diff --git a/dogfooding/index.html b/dogfooding/index.html index 0b100f7..4e86cc3 100644 --- a/dogfooding/index.html +++ b/dogfooding/index.html @@ -31,6 +31,9 @@
0 +
+ + 0
@@ -45,4 +48,4 @@
- + \ No newline at end of file diff --git a/dogfooding/index.js b/dogfooding/index.js index decbf70..1ec2136 100644 --- a/dogfooding/index.js +++ b/dogfooding/index.js @@ -1,3 +1,3 @@ /*! For license information please see index.js.LICENSE.txt */ -(()=>{var __webpack_modules__={8045:e=>{"use strict";e.exports=function(e,t){for(var r=new Array(arguments.length-1),n=0,s=2,o=!0;s{"use strict";var r=t;r.length=function(e){var t=e.length;if(!t)return 0;for(var r=0;--t%4>1&&"="===e.charAt(t);)++r;return Math.ceil(3*e.length)/4-r};for(var n=new Array(64),s=new Array(123),o=0;o<64;)s[n[o]=o<26?o+65:o<52?o+71:o<62?o-4:o-59|43]=o++;r.encode=function(e,t,r){for(var s,o=null,i=[],a=0,c=0;t>2],s=(3&l)<<4,c=1;break;case 1:i[a++]=n[s|l>>4],s=(15&l)<<2,c=2;break;case 2:i[a++]=n[s|l>>6],i[a++]=n[63&l],c=0}a>8191&&((o||(o=[])).push(String.fromCharCode.apply(String,i)),a=0)}return c&&(i[a++]=n[s],i[a++]=61,1===c&&(i[a++]=61)),o?(a&&o.push(String.fromCharCode.apply(String,i.slice(0,a))),o.join("")):String.fromCharCode.apply(String,i.slice(0,a))};var i="invalid encoding";r.decode=function(e,t,r){for(var n,o=r,a=0,c=0;c1)break;if(void 0===(l=s[l]))throw Error(i);switch(a){case 0:n=l,a=1;break;case 1:t[r++]=n<<2|(48&l)>>4,n=l,a=2;break;case 2:t[r++]=(15&n)<<4|(60&l)>>2,n=l,a=3;break;case 3:t[r++]=(3&n)<<6|l,a=0}}if(1===a)throw Error(i);return r-o},r.test=function(e){return/^(?:[A-Za-z0-9+/]{4})*(?:[A-Za-z0-9+/]{2}==|[A-Za-z0-9+/]{3}=)?$/.test(e)}},8561:e=>{"use strict";function t(e,r){"string"==typeof e&&(r=e,e=void 0);var n=[];function s(e){if("string"!=typeof e){var r=o();if(t.verbose&&console.log("codegen: "+r),r="return "+r,e){for(var i=Object.keys(e),a=new Array(i.length+1),c=new Array(i.length),l=0;l{"use strict";function t(){this._listeners={}}e.exports=t,t.prototype.on=function(e,t,r){return(this._listeners[e]||(this._listeners[e]=[])).push({fn:t,ctx:r||this}),this},t.prototype.off=function(e,t){if(void 0===e)this._listeners={};else if(void 0===t)this._listeners[e]=[];else for(var r=this._listeners[e],n=0;n{"use strict";e.exports=o;var n=r(8045),s=r(4153)("fs");function o(e,t,r){return"function"==typeof t?(r=t,t={}):t||(t={}),r?!t.xhr&&s&&s.readFile?s.readFile(e,(function(n,s){return n&&"undefined"!=typeof XMLHttpRequest?o.xhr(e,t,r):n?r(n):r(null,t.binary?s:s.toString("utf8"))})):o.xhr(e,t,r):n(o,this,e,t)}o.xhr=function(e,t,r){var n=new XMLHttpRequest;n.onreadystatechange=function(){if(4===n.readyState){if(0!==n.status&&200!==n.status)return r(Error("status "+n.status));if(t.binary){var e=n.response;if(!e){e=[];for(var s=0;s{"use strict";function t(e){return"undefined"!=typeof Float32Array?function(){var t=new Float32Array([-0]),r=new Uint8Array(t.buffer),n=128===r[3];function s(e,n,s){t[0]=e,n[s]=r[0],n[s+1]=r[1],n[s+2]=r[2],n[s+3]=r[3]}function o(e,n,s){t[0]=e,n[s]=r[3],n[s+1]=r[2],n[s+2]=r[1],n[s+3]=r[0]}function i(e,n){return r[0]=e[n],r[1]=e[n+1],r[2]=e[n+2],r[3]=e[n+3],t[0]}function a(e,n){return r[3]=e[n],r[2]=e[n+1],r[1]=e[n+2],r[0]=e[n+3],t[0]}e.writeFloatLE=n?s:o,e.writeFloatBE=n?o:s,e.readFloatLE=n?i:a,e.readFloatBE=n?a:i}():function(){function t(e,t,r,n){var s=t<0?1:0;if(s&&(t=-t),0===t)e(1/t>0?0:2147483648,r,n);else if(isNaN(t))e(2143289344,r,n);else if(t>34028234663852886e22)e((s<<31|2139095040)>>>0,r,n);else if(t<11754943508222875e-54)e((s<<31|Math.round(t/1401298464324817e-60))>>>0,r,n);else{var o=Math.floor(Math.log(t)/Math.LN2);e((s<<31|o+127<<23|8388607&Math.round(t*Math.pow(2,-o)*8388608))>>>0,r,n)}}function i(e,t,r){var n=e(t,r),s=2*(n>>31)+1,o=n>>>23&255,i=8388607&n;return 255===o?i?NaN:s*(1/0):0===o?1401298464324817e-60*s*i:s*Math.pow(2,o-150)*(i+8388608)}e.writeFloatLE=t.bind(null,r),e.writeFloatBE=t.bind(null,n),e.readFloatLE=i.bind(null,s),e.readFloatBE=i.bind(null,o)}(),"undefined"!=typeof Float64Array?function(){var t=new Float64Array([-0]),r=new Uint8Array(t.buffer),n=128===r[7];function s(e,n,s){t[0]=e,n[s]=r[0],n[s+1]=r[1],n[s+2]=r[2],n[s+3]=r[3],n[s+4]=r[4],n[s+5]=r[5],n[s+6]=r[6],n[s+7]=r[7]}function o(e,n,s){t[0]=e,n[s]=r[7],n[s+1]=r[6],n[s+2]=r[5],n[s+3]=r[4],n[s+4]=r[3],n[s+5]=r[2],n[s+6]=r[1],n[s+7]=r[0]}function i(e,n){return r[0]=e[n],r[1]=e[n+1],r[2]=e[n+2],r[3]=e[n+3],r[4]=e[n+4],r[5]=e[n+5],r[6]=e[n+6],r[7]=e[n+7],t[0]}function a(e,n){return r[7]=e[n],r[6]=e[n+1],r[5]=e[n+2],r[4]=e[n+3],r[3]=e[n+4],r[2]=e[n+5],r[1]=e[n+6],r[0]=e[n+7],t[0]}e.writeDoubleLE=n?s:o,e.writeDoubleBE=n?o:s,e.readDoubleLE=n?i:a,e.readDoubleBE=n?a:i}():function(){function t(e,t,r,n,s,o){var i=n<0?1:0;if(i&&(n=-n),0===n)e(0,s,o+t),e(1/n>0?0:2147483648,s,o+r);else if(isNaN(n))e(0,s,o+t),e(2146959360,s,o+r);else if(n>17976931348623157e292)e(0,s,o+t),e((i<<31|2146435072)>>>0,s,o+r);else{var a;if(n<22250738585072014e-324)e((a=n/5e-324)>>>0,s,o+t),e((i<<31|a/4294967296)>>>0,s,o+r);else{var c=Math.floor(Math.log(n)/Math.LN2);1024===c&&(c=1023),e(4503599627370496*(a=n*Math.pow(2,-c))>>>0,s,o+t),e((i<<31|c+1023<<20|1048576*a&1048575)>>>0,s,o+r)}}}function i(e,t,r,n,s){var o=e(n,s+t),i=e(n,s+r),a=2*(i>>31)+1,c=i>>>20&2047,l=4294967296*(1048575&i)+o;return 2047===c?l?NaN:a*(1/0):0===c?5e-324*a*l:a*Math.pow(2,c-1075)*(l+4503599627370496)}e.writeDoubleLE=t.bind(null,r,0,4),e.writeDoubleBE=t.bind(null,n,4,0),e.readDoubleLE=i.bind(null,s,0,4),e.readDoubleBE=i.bind(null,o,4,0)}(),e}function r(e,t,r){t[r]=255&e,t[r+1]=e>>>8&255,t[r+2]=e>>>16&255,t[r+3]=e>>>24}function n(e,t,r){t[r]=e>>>24,t[r+1]=e>>>16&255,t[r+2]=e>>>8&255,t[r+3]=255&e}function s(e,t){return(e[t]|e[t+1]<<8|e[t+2]<<16|e[t+3]<<24)>>>0}function o(e,t){return(e[t]<<24|e[t+1]<<16|e[t+2]<<8|e[t+3])>>>0}e.exports=t(t)},4153:module=>{"use strict";function inquire(moduleName){try{var mod=eval("quire".replace(/^/,"re"))(moduleName);if(mod&&(mod.length||Object.keys(mod).length))return mod}catch(e){}return null}module.exports=inquire},9207:(e,t)=>{"use strict";var r=t,n=r.isAbsolute=function(e){return/^(?:\/|\w+:)/.test(e)},s=r.normalize=function(e){var t=(e=e.replace(/\\/g,"/").replace(/\/{2,}/g,"/")).split("/"),r=n(e),s="";r&&(s=t.shift()+"/");for(var o=0;o0&&".."!==t[o-1]?t.splice(--o,2):r?t.splice(o,1):++o:"."===t[o]?t.splice(o,1):++o;return s+t.join("/")};r.resolve=function(e,t,r){return r||(t=s(t)),n(t)?t:(r||(e=s(e)),(e=e.replace(/(?:\/|^)[^/]+$/,"")).length?s(e+"/"+t):t)}},9390:e=>{"use strict";e.exports=function(e,t,r){var n=r||8192,s=n>>>1,o=null,i=n;return function(r){if(r<1||r>s)return e(r);i+r>n&&(o=e(n),i=0);var a=t.call(o,i,i+=r);return 7&i&&(i=1+(7|i)),a}}},1447:(e,t)=>{"use strict";var r=t;r.length=function(e){for(var t=0,r=0,n=0;n191&&n<224?o[i++]=(31&n)<<6|63&e[t++]:n>239&&n<365?(n=((7&n)<<18|(63&e[t++])<<12|(63&e[t++])<<6|63&e[t++])-65536,o[i++]=55296+(n>>10),o[i++]=56320+(1023&n)):o[i++]=(15&n)<<12|(63&e[t++])<<6|63&e[t++],i>8191&&((s||(s=[])).push(String.fromCharCode.apply(String,o)),i=0);return s?(i&&s.push(String.fromCharCode.apply(String,o.slice(0,i))),s.join("")):String.fromCharCode.apply(String,o.slice(0,i))},r.write=function(e,t,r){for(var n,s,o=r,i=0;i>6|192,t[r++]=63&n|128):55296==(64512&n)&&56320==(64512&(s=e.charCodeAt(i+1)))?(n=65536+((1023&n)<<10)+(1023&s),++i,t[r++]=n>>18|240,t[r++]=n>>12&63|128,t[r++]=n>>6&63|128,t[r++]=63&n|128):(t[r++]=n>>12|224,t[r++]=n>>6&63|128,t[r++]=63&n|128);return r-o}},7833:(e,t,r)=>{t.formatArgs=function(t){if(t[0]=(this.useColors?"%c":"")+this.namespace+(this.useColors?" %c":" ")+t[0]+(this.useColors?"%c ":" ")+"+"+e.exports.humanize(this.diff),!this.useColors)return;const r="color: "+this.color;t.splice(1,0,r,"color: inherit");let n=0,s=0;t[0].replace(/%[a-zA-Z%]/g,(e=>{"%%"!==e&&(n++,"%c"===e&&(s=n))})),t.splice(s,0,r)},t.save=function(e){try{e?t.storage.setItem("debug",e):t.storage.removeItem("debug")}catch(e){}},t.load=function(){let e;try{e=t.storage.getItem("debug")}catch(e){}return!e&&"undefined"!=typeof process&&"env"in process&&(e=process.env.DEBUG),e},t.useColors=function(){return!("undefined"==typeof window||!window.process||"renderer"!==window.process.type&&!window.process.__nwjs)||("undefined"==typeof navigator||!navigator.userAgent||!navigator.userAgent.toLowerCase().match(/(edge|trident)\/(\d+)/))&&("undefined"!=typeof document&&document.documentElement&&document.documentElement.style&&document.documentElement.style.WebkitAppearance||"undefined"!=typeof window&&window.console&&(window.console.firebug||window.console.exception&&window.console.table)||"undefined"!=typeof navigator&&navigator.userAgent&&navigator.userAgent.toLowerCase().match(/firefox\/(\d+)/)&&parseInt(RegExp.$1,10)>=31||"undefined"!=typeof navigator&&navigator.userAgent&&navigator.userAgent.toLowerCase().match(/applewebkit\/(\d+)/))},t.storage=function(){try{return localStorage}catch(e){}}(),t.destroy=(()=>{let e=!1;return()=>{e||(e=!0,console.warn("Instance method `debug.destroy()` is deprecated and no longer does anything. It will be removed in the next major version of `debug`."))}})(),t.colors=["#0000CC","#0000FF","#0033CC","#0033FF","#0066CC","#0066FF","#0099CC","#0099FF","#00CC00","#00CC33","#00CC66","#00CC99","#00CCCC","#00CCFF","#3300CC","#3300FF","#3333CC","#3333FF","#3366CC","#3366FF","#3399CC","#3399FF","#33CC00","#33CC33","#33CC66","#33CC99","#33CCCC","#33CCFF","#6600CC","#6600FF","#6633CC","#6633FF","#66CC00","#66CC33","#9900CC","#9900FF","#9933CC","#9933FF","#99CC00","#99CC33","#CC0000","#CC0033","#CC0066","#CC0099","#CC00CC","#CC00FF","#CC3300","#CC3333","#CC3366","#CC3399","#CC33CC","#CC33FF","#CC6600","#CC6633","#CC9900","#CC9933","#CCCC00","#CCCC33","#FF0000","#FF0033","#FF0066","#FF0099","#FF00CC","#FF00FF","#FF3300","#FF3333","#FF3366","#FF3399","#FF33CC","#FF33FF","#FF6600","#FF6633","#FF9900","#FF9933","#FFCC00","#FFCC33"],t.log=console.debug||console.log||(()=>{}),e.exports=r(736)(t);const{formatters:n}=e.exports;n.j=function(e){try{return JSON.stringify(e)}catch(e){return"[UnexpectedJSONParseError]: "+e.message}}},736:(e,t,r)=>{e.exports=function(e){function t(e){let r,s,o,i=null;function a(...e){if(!a.enabled)return;const n=a,s=Number(new Date),o=s-(r||s);n.diff=o,n.prev=r,n.curr=s,r=s,e[0]=t.coerce(e[0]),"string"!=typeof e[0]&&e.unshift("%O");let i=0;e[0]=e[0].replace(/%([a-zA-Z%])/g,((r,s)=>{if("%%"===r)return"%";i++;const o=t.formatters[s];if("function"==typeof o){const t=e[i];r=o.call(n,t),e.splice(i,1),i--}return r})),t.formatArgs.call(n,e),(n.log||t.log).apply(n,e)}return a.namespace=e,a.useColors=t.useColors(),a.color=t.selectColor(e),a.extend=n,a.destroy=t.destroy,Object.defineProperty(a,"enabled",{enumerable:!0,configurable:!1,get:()=>null!==i?i:(s!==t.namespaces&&(s=t.namespaces,o=t.enabled(e)),o),set:e=>{i=e}}),"function"==typeof t.init&&t.init(a),a}function n(e,r){const n=t(this.namespace+(void 0===r?":":r)+e);return n.log=this.log,n}function s(e){return e.toString().substring(2,e.toString().length-2).replace(/\.\*\?$/,"*")}return t.debug=t,t.default=t,t.coerce=function(e){return e instanceof Error?e.stack||e.message:e},t.disable=function(){const e=[...t.names.map(s),...t.skips.map(s).map((e=>"-"+e))].join(",");return t.enable(""),e},t.enable=function(e){let r;t.save(e),t.namespaces=e,t.names=[],t.skips=[];const n=("string"==typeof e?e:"").split(/[\s,]+/),s=n.length;for(r=0;r{t[r]=e[r]})),t.names=[],t.skips=[],t.formatters={},t.selectColor=function(e){let r=0;for(let t=0;t{"use strict";function t(e,t){for(const r in t)Object.defineProperty(e,r,{value:t[r],enumerable:!0,configurable:!0});return e}e.exports=function(e,r,n){if(!e||"string"==typeof e)throw new TypeError("Please pass an Error to err-code");n||(n={}),"object"==typeof r&&(n=r,r=""),r&&(n.code=r);try{return t(e,n)}catch(r){n.message=e.message,n.stack=e.stack;const s=function(){};return s.prototype=Object.create(Object.getPrototypeOf(e)),t(new s,n)}}},544:(e,t,r)=>{"use strict";const n=r(9939);t.PP=n.EventIterator,n.EventIterator},9939:(e,t)=>{"use strict";Object.defineProperty(t,"__esModule",{value:!0});class r{constructor(){this.pullQueue=[],this.pushQueue=[],this.eventHandlers={},this.isPaused=!1,this.isStopped=!1}push(e){if(this.isStopped)return;const t={value:e,done:!1};if(this.pullQueue.length){const e=this.pullQueue.shift();e&&e.resolve(t)}else this.pushQueue.push(Promise.resolve(t)),void 0!==this.highWaterMark&&this.pushQueue.length>=this.highWaterMark&&!this.isPaused&&(this.isPaused=!0,this.eventHandlers.highWater?this.eventHandlers.highWater():console&&console.warn(`EventIterator queue reached ${this.pushQueue.length} items`))}stop(){if(!this.isStopped){this.isStopped=!0,this.remove();for(const e of this.pullQueue)e.resolve({value:void 0,done:!0});this.pullQueue.length=0}}fail(e){if(!this.isStopped)if(this.isStopped=!0,this.remove(),this.pullQueue.length){for(const t of this.pullQueue)t.reject(e);this.pullQueue.length=0}else{const t=Promise.reject(e);t.catch((()=>{})),this.pushQueue.push(t)}}remove(){Promise.resolve().then((()=>{this.removeCallback&&this.removeCallback()}))}[Symbol.asyncIterator](){return{next:e=>{const t=this.pushQueue.shift();return t?(void 0!==this.lowWaterMark&&this.pushQueue.length<=this.lowWaterMark&&this.isPaused&&(this.isPaused=!1,this.eventHandlers.lowWater&&this.eventHandlers.lowWater()),t):this.isStopped?Promise.resolve({value:void 0,done:!0}):new Promise(((e,t)=>{this.pullQueue.push({resolve:e,reject:t})}))},return:()=>(this.isStopped=!0,this.pushQueue.length=0,this.remove(),Promise.resolve({value:void 0,done:!0}))}}}class n{constructor(e,{highWaterMark:t=100,lowWaterMark:n=1}={}){const s=new r;s.highWaterMark=t,s.lowWaterMark=n,s.removeCallback=e({push:e=>s.push(e),stop:()=>s.stop(),fail:e=>s.fail(e),on:(e,t)=>{s.eventHandlers[e]=t}})||(()=>{}),this[Symbol.asyncIterator]=()=>s[Symbol.asyncIterator](),Object.freeze(this)}}t.EventIterator=n,t.default=n},228:e=>{"use strict";var t=Object.prototype.hasOwnProperty,r="~";function n(){}function s(e,t,r){this.fn=e,this.context=t,this.once=r||!1}function o(e,t,n,o,i){if("function"!=typeof n)throw new TypeError("The listener must be a function");var a=new s(n,o||e,i),c=r?r+t:t;return e._events[c]?e._events[c].fn?e._events[c]=[e._events[c],a]:e._events[c].push(a):(e._events[c]=a,e._eventsCount++),e}function i(e,t){0==--e._eventsCount?e._events=new n:delete e._events[t]}function a(){this._events=new n,this._eventsCount=0}Object.create&&(n.prototype=Object.create(null),(new n).__proto__||(r=!1)),a.prototype.eventNames=function(){var e,n,s=[];if(0===this._eventsCount)return s;for(n in e=this._events)t.call(e,n)&&s.push(r?n.slice(1):n);return Object.getOwnPropertySymbols?s.concat(Object.getOwnPropertySymbols(e)):s},a.prototype.listeners=function(e){var t=r?r+e:e,n=this._events[t];if(!n)return[];if(n.fn)return[n.fn];for(var s=0,o=n.length,i=new Array(o);s{e.exports=function(e){if(!e)throw Error("hashlru must have a max value, of type number, greater than 0");var t=0,r=Object.create(null),n=Object.create(null);function s(s,o){r[s]=o,++t>=e&&(t=0,n=r,r=Object.create(null))}return{has:function(e){return void 0!==r[e]||void 0!==n[e]},remove:function(e){void 0!==r[e]&&(r[e]=void 0),void 0!==n[e]&&(n[e]=void 0)},get:function(e){var t=r[e];return void 0!==t?t:void 0!==(t=n[e])?(s(e,t),t):void 0},set:function(e,t){void 0!==r[e]?r[e]=t:s(e,t)},clear:function(){r=Object.create(null),n=Object.create(null)}}}},5818:(e,t,r)=>{var n;!function(){"use strict";var t="object"==typeof window?window:{};!t.HI_BASE32_NO_NODE_JS&&"object"==typeof process&&process.versions&&process.versions.node&&(t=global);var s=!t.HI_BASE32_NO_COMMON_JS&&e.exports,o=r.amdO,i="ABCDEFGHIJKLMNOPQRSTUVWXYZ234567".split(""),a={A:0,B:1,C:2,D:3,E:4,F:5,G:6,H:7,I:8,J:9,K:10,L:11,M:12,N:13,O:14,P:15,Q:16,R:17,S:18,T:19,U:20,V:21,W:22,X:23,Y:24,Z:25,2:26,3:27,4:28,5:29,6:30,7:31},c=[0,0,0,0,0,0,0,0],l=function(e,t){t.length>10&&(t="..."+t.substr(-10));var r=new Error("Decoded data is not valid UTF-8. Maybe try base32.decode.asBytes()? Partial data after reading "+e+" bytes: "+t+" <-");throw r.position=e,r},u=function(e){if(""===e)return[];if(!/^[A-Z2-7=]+$/.test(e))throw new Error("Invalid base32 characters");for(var t,r,n,s,o,i,c,l,u=[],h=0,d=(e=e.replace(/=/g,"")).length,p=0,f=d>>3<<3;p>>2),u[h++]=255&(r<<6|n<<1|s>>>4),u[h++]=255&(s<<4|o>>>1),u[h++]=255&(o<<7|i<<2|c>>>3),u[h++]=255&(c<<5|l);var g=d-f;return 2===g?(t=a[e.charAt(p++)],r=a[e.charAt(p++)],u[h++]=255&(t<<3|r>>>2)):4===g?(t=a[e.charAt(p++)],r=a[e.charAt(p++)],n=a[e.charAt(p++)],s=a[e.charAt(p++)],u[h++]=255&(t<<3|r>>>2),u[h++]=255&(r<<6|n<<1|s>>>4)):5===g?(t=a[e.charAt(p++)],r=a[e.charAt(p++)],n=a[e.charAt(p++)],s=a[e.charAt(p++)],o=a[e.charAt(p++)],u[h++]=255&(t<<3|r>>>2),u[h++]=255&(r<<6|n<<1|s>>>4),u[h++]=255&(s<<4|o>>>1)):7===g&&(t=a[e.charAt(p++)],r=a[e.charAt(p++)],n=a[e.charAt(p++)],s=a[e.charAt(p++)],o=a[e.charAt(p++)],i=a[e.charAt(p++)],c=a[e.charAt(p++)],u[h++]=255&(t<<3|r>>>2),u[h++]=255&(r<<6|n<<1|s>>>4),u[h++]=255&(s<<4|o>>>1),u[h++]=255&(o<<7|i<<2|c>>>3)),u},h=function(e,t){if(!t)return function(e){for(var t,r,n="",s=e.length,o=0,i=0;o191&&t<=223?(r=31&t,i=1):t<=239?(r=15&t,i=2):t<=247?(r=7&t,i=3):l(o,n);for(var a=0;a191)&&l(o,n),r<<=6,r+=63&t;r>=55296&&r<=57343&&l(o,n),r>1114111&&l(o,n),r<=65535?n+=String.fromCharCode(r):(r-=65536,n+=String.fromCharCode(55296+(r>>10)),n+=String.fromCharCode(56320+(1023&r)))}return n}(u(e));if(""===e)return"";if(!/^[A-Z2-7=]+$/.test(e))throw new Error("Invalid base32 characters");var r,n,s,o,i,c,h,d,p="",f=e.indexOf("=");-1===f&&(f=e.length);for(var g=0,y=f>>3<<3;g>>2))+String.fromCharCode(255&(n<<6|s<<1|o>>>4))+String.fromCharCode(255&(o<<4|i>>>1))+String.fromCharCode(255&(i<<7|c<<2|h>>>3))+String.fromCharCode(255&(h<<5|d));var m=f-y;return 2===m?(r=a[e.charAt(g++)],n=a[e.charAt(g++)],p+=String.fromCharCode(255&(r<<3|n>>>2))):4===m?(r=a[e.charAt(g++)],n=a[e.charAt(g++)],s=a[e.charAt(g++)],o=a[e.charAt(g++)],p+=String.fromCharCode(255&(r<<3|n>>>2))+String.fromCharCode(255&(n<<6|s<<1|o>>>4))):5===m?(r=a[e.charAt(g++)],n=a[e.charAt(g++)],s=a[e.charAt(g++)],o=a[e.charAt(g++)],i=a[e.charAt(g++)],p+=String.fromCharCode(255&(r<<3|n>>>2))+String.fromCharCode(255&(n<<6|s<<1|o>>>4))+String.fromCharCode(255&(o<<4|i>>>1))):7===m&&(r=a[e.charAt(g++)],n=a[e.charAt(g++)],s=a[e.charAt(g++)],o=a[e.charAt(g++)],i=a[e.charAt(g++)],c=a[e.charAt(g++)],h=a[e.charAt(g++)],p+=String.fromCharCode(255&(r<<3|n>>>2))+String.fromCharCode(255&(n<<6|s<<1|o>>>4))+String.fromCharCode(255&(o<<4|i>>>1))+String.fromCharCode(255&(i<<7|c<<2|h>>>3))),p},d={encode:function(e,t){var r="string"!=typeof e;return r&&e.constructor===ArrayBuffer&&(e=new Uint8Array(e)),r?function(e){for(var t,r,n,s,o,a="",c=e.length,l=0,u=5*parseInt(c/5);l>>3]+i[31&(t<<2|r>>>6)]+i[r>>>1&31]+i[31&(r<<4|n>>>4)]+i[31&(n<<1|s>>>7)]+i[s>>>2&31]+i[31&(s<<3|o>>>5)]+i[31&o];var h=c-u;return 1===h?(t=e[l],a+=i[t>>>3]+i[t<<2&31]+"======"):2===h?(t=e[l++],r=e[l],a+=i[t>>>3]+i[31&(t<<2|r>>>6)]+i[r>>>1&31]+i[r<<4&31]+"===="):3===h?(t=e[l++],r=e[l++],n=e[l],a+=i[t>>>3]+i[31&(t<<2|r>>>6)]+i[r>>>1&31]+i[31&(r<<4|n>>>4)]+i[n<<1&31]+"==="):4===h&&(t=e[l++],r=e[l++],n=e[l++],s=e[l],a+=i[t>>>3]+i[31&(t<<2|r>>>6)]+i[r>>>1&31]+i[31&(r<<4|n>>>4)]+i[31&(n<<1|s>>>7)]+i[s>>>2&31]+i[s<<3&31]+"="),a}(e):t?function(e){for(var t,r,n,s,o,a="",c=e.length,l=0,u=5*parseInt(c/5);l>>3]+i[31&(t<<2|r>>>6)]+i[r>>>1&31]+i[31&(r<<4|n>>>4)]+i[31&(n<<1|s>>>7)]+i[s>>>2&31]+i[31&(s<<3|o>>>5)]+i[31&o];var h=c-u;return 1===h?(t=e.charCodeAt(l),a+=i[t>>>3]+i[t<<2&31]+"======"):2===h?(t=e.charCodeAt(l++),r=e.charCodeAt(l),a+=i[t>>>3]+i[31&(t<<2|r>>>6)]+i[r>>>1&31]+i[r<<4&31]+"===="):3===h?(t=e.charCodeAt(l++),r=e.charCodeAt(l++),n=e.charCodeAt(l),a+=i[t>>>3]+i[31&(t<<2|r>>>6)]+i[r>>>1&31]+i[31&(r<<4|n>>>4)]+i[n<<1&31]+"==="):4===h&&(t=e.charCodeAt(l++),r=e.charCodeAt(l++),n=e.charCodeAt(l++),s=e.charCodeAt(l),a+=i[t>>>3]+i[31&(t<<2|r>>>6)]+i[r>>>1&31]+i[31&(r<<4|n>>>4)]+i[31&(n<<1|s>>>7)]+i[s>>>2&31]+i[s<<3&31]+"="),a}(e):function(e){var t,r,n,s,o,a,l,u=!1,h="",d=0,p=0,f=e.length;if(""===e)return h;do{for(c[0]=c[5],c[1]=c[6],c[2]=c[7],l=p;d>6,c[l++]=128|63&a):a<55296||a>=57344?(c[l++]=224|a>>12,c[l++]=128|a>>6&63,c[l++]=128|63&a):(a=65536+((1023&a)<<10|1023&e.charCodeAt(++d)),c[l++]=240|a>>18,c[l++]=128|a>>12&63,c[l++]=128|a>>6&63,c[l++]=128|63&a);p=l-5,d===f&&++d,d>f&&l<6&&(u=!0),t=c[0],l>4?(r=c[1],n=c[2],s=c[3],o=c[4],h+=i[t>>>3]+i[31&(t<<2|r>>>6)]+i[r>>>1&31]+i[31&(r<<4|n>>>4)]+i[31&(n<<1|s>>>7)]+i[s>>>2&31]+i[31&(s<<3|o>>>5)]+i[31&o]):1===l?h+=i[t>>>3]+i[t<<2&31]+"======":2===l?(r=c[1],h+=i[t>>>3]+i[31&(t<<2|r>>>6)]+i[r>>>1&31]+i[r<<4&31]+"===="):3===l?(r=c[1],n=c[2],h+=i[t>>>3]+i[31&(t<<2|r>>>6)]+i[r>>>1&31]+i[31&(r<<4|n>>>4)]+i[n<<1&31]+"==="):(r=c[1],n=c[2],s=c[3],h+=i[t>>>3]+i[31&(t<<2|r>>>6)]+i[r>>>1&31]+i[31&(r<<4|n>>>4)]+i[31&(n<<1|s>>>7)]+i[s>>>2&31]+i[s<<3&31]+"=")}while(!u);return h}(e)},decode:h};h.asBytes=u,s?e.exports=d:(t.base32=d,o&&(void 0===(n=function(){return d}.call(d,r,d,e))||(e.exports=n)))}()},4866:e=>{e.exports=function(){return"undefined"!=typeof window&&"object"==typeof window.process&&"renderer"===window.process.type||!("undefined"==typeof process||"object"!=typeof process.versions||!process.versions.electron)||"object"==typeof navigator&&"string"==typeof navigator.userAgent&&navigator.userAgent.indexOf("Electron")>=0}},6368:e=>{"use strict";e.exports=e=>{if("[object Object]"!==Object.prototype.toString.call(e))return!1;const t=Object.getPrototypeOf(e);return null===t||t===Object.prototype}},1176:(e,t,r)=>{var n;!function(){"use strict";var s="input is invalid type",o="object"==typeof window,i=o?window:{};i.JS_SHA3_NO_WINDOW&&(o=!1);var a=!o&&"object"==typeof self;!i.JS_SHA3_NO_NODE_JS&&"object"==typeof process&&process.versions&&process.versions.node?i=global:a&&(i=self);for(var c=!i.JS_SHA3_NO_COMMON_JS&&e.exports,l=r.amdO,u=!i.JS_SHA3_NO_ARRAY_BUFFER&&"undefined"!=typeof ArrayBuffer,h="0123456789abcdef".split(""),d=[4,1024,262144,67108864],p=[0,8,16,24],f=[1,0,32898,0,32906,2147483648,2147516416,2147483648,32907,0,2147483649,0,2147516545,2147483648,32777,2147483648,138,0,136,0,2147516425,0,2147483658,0,2147516555,0,139,2147483648,32905,2147483648,32771,2147483648,32770,2147483648,128,2147483648,32778,0,2147483658,2147483648,2147516545,2147483648,32896,2147483648,2147483649,0,2147516424,2147483648],g=[224,256,384,512],y=[128,256],m=["hex","buffer","arrayBuffer","array","digest"],b={128:168,256:136},w=i.JS_SHA3_NO_NODE_JS||!Array.isArray?function(e){return"[object Array]"===Object.prototype.toString.call(e)}:Array.isArray,v=!u||!i.JS_SHA3_NO_ARRAY_BUFFER_IS_VIEW&&ArrayBuffer.isView?ArrayBuffer.isView:function(e){return"object"==typeof e&&e.buffer&&e.buffer.constructor===ArrayBuffer},E=function(e){var t=typeof e;if("string"===t)return[e,!0];if("object"!==t||null===e)throw new Error(s);if(u&&e.constructor===ArrayBuffer)return[new Uint8Array(e),!1];if(!w(e)&&!v(e))throw new Error(s);return[e,!1]},S=function(e){return 0===E(e)[0].length},A=function(e){for(var t=[],r=0;r>5,this.byteCount=this.blockCount<<2,this.outputBlocks=r>>5,this.extraBytes=(31&r)>>3;for(var n=0;n<50;++n)this.s[n]=0}function $(e,t,r){F.call(this,e,t,r)}F.prototype.update=function(e){if(this.finalized)throw new Error("finalize already called");var t=E(e);e=t[0];for(var r,n,s=t[1],o=this.blocks,i=this.byteCount,a=e.length,c=this.blockCount,l=0,u=this.s;l>2]|=n<>2]|=(192|n>>6)<>2]|=(128|63&n)<=57344?(o[r>>2]|=(224|n>>12)<>2]|=(128|n>>6&63)<>2]|=(128|63&n)<>2]|=(240|n>>18)<>2]|=(128|n>>12&63)<>2]|=(128|n>>6&63)<>2]|=(128|63&n)<>2]|=e[l]<=i){for(this.start=r-i,this.block=o[c],r=0;r>=8);r>0;)s.unshift(r),r=255&(e>>=8),++n;return t?s.push(n):s.unshift(n),this.update(s),s.length},F.prototype.encodeString=function(e){var t=E(e);e=t[0];var r=t[1],n=0,s=e.length;if(r)for(var o=0;o=57344?n+=3:(i=65536+((1023&i)<<10|1023&e.charCodeAt(++o)),n+=4)}else n=s;return n+=this.encode(8*n),this.update(e),n},F.prototype.bytepad=function(e,t){for(var r=this.encode(t),n=0;n>2]|=this.padding[3&t],this.lastByteIndex===this.byteCount)for(e[0]=e[r],t=1;t>4&15]+h[15&e]+h[e>>12&15]+h[e>>8&15]+h[e>>20&15]+h[e>>16&15]+h[e>>28&15]+h[e>>24&15];i%t==0&&(r=A(r),H(r),o=0)}return s&&(e=r[o],a+=h[e>>4&15]+h[15&e],s>1&&(a+=h[e>>12&15]+h[e>>8&15]),s>2&&(a+=h[e>>20&15]+h[e>>16&15])),a},F.prototype.arrayBuffer=function(){this.finalize();var e,t=this.blockCount,r=this.s,n=this.outputBlocks,s=this.extraBytes,o=0,i=0,a=this.outputBits>>3;e=s?new ArrayBuffer(n+1<<2):new ArrayBuffer(a);for(var c=new Uint32Array(e);i>8&255,c[e+2]=t>>16&255,c[e+3]=t>>24&255;a%r==0&&(n=A(n),H(n))}return o&&(e=a<<2,t=n[i],c[e]=255&t,o>1&&(c[e+1]=t>>8&255),o>2&&(c[e+2]=t>>16&255)),c},$.prototype=new F,$.prototype.finalize=function(){return this.encode(this.outputBits,!0),F.prototype.finalize.call(this)};var H=function(e){var t,r,n,s,o,i,a,c,l,u,h,d,p,g,y,m,b,w,v,E,S,A,_,k,I,R,T,C,N,x,P,O,D,L,B,U,M,F,$,H,q,V,j,K,z,G,W,Y,J,X,Q,Z,ee,te,re,ne,se,oe,ie,ae,ce,le,ue;for(n=0;n<48;n+=2)s=e[0]^e[10]^e[20]^e[30]^e[40],o=e[1]^e[11]^e[21]^e[31]^e[41],i=e[2]^e[12]^e[22]^e[32]^e[42],a=e[3]^e[13]^e[23]^e[33]^e[43],c=e[4]^e[14]^e[24]^e[34]^e[44],l=e[5]^e[15]^e[25]^e[35]^e[45],u=e[6]^e[16]^e[26]^e[36]^e[46],h=e[7]^e[17]^e[27]^e[37]^e[47],t=(d=e[8]^e[18]^e[28]^e[38]^e[48])^(i<<1|a>>>31),r=(p=e[9]^e[19]^e[29]^e[39]^e[49])^(a<<1|i>>>31),e[0]^=t,e[1]^=r,e[10]^=t,e[11]^=r,e[20]^=t,e[21]^=r,e[30]^=t,e[31]^=r,e[40]^=t,e[41]^=r,t=s^(c<<1|l>>>31),r=o^(l<<1|c>>>31),e[2]^=t,e[3]^=r,e[12]^=t,e[13]^=r,e[22]^=t,e[23]^=r,e[32]^=t,e[33]^=r,e[42]^=t,e[43]^=r,t=i^(u<<1|h>>>31),r=a^(h<<1|u>>>31),e[4]^=t,e[5]^=r,e[14]^=t,e[15]^=r,e[24]^=t,e[25]^=r,e[34]^=t,e[35]^=r,e[44]^=t,e[45]^=r,t=c^(d<<1|p>>>31),r=l^(p<<1|d>>>31),e[6]^=t,e[7]^=r,e[16]^=t,e[17]^=r,e[26]^=t,e[27]^=r,e[36]^=t,e[37]^=r,e[46]^=t,e[47]^=r,t=u^(s<<1|o>>>31),r=h^(o<<1|s>>>31),e[8]^=t,e[9]^=r,e[18]^=t,e[19]^=r,e[28]^=t,e[29]^=r,e[38]^=t,e[39]^=r,e[48]^=t,e[49]^=r,g=e[0],y=e[1],G=e[11]<<4|e[10]>>>28,W=e[10]<<4|e[11]>>>28,C=e[20]<<3|e[21]>>>29,N=e[21]<<3|e[20]>>>29,ae=e[31]<<9|e[30]>>>23,ce=e[30]<<9|e[31]>>>23,V=e[40]<<18|e[41]>>>14,j=e[41]<<18|e[40]>>>14,L=e[2]<<1|e[3]>>>31,B=e[3]<<1|e[2]>>>31,m=e[13]<<12|e[12]>>>20,b=e[12]<<12|e[13]>>>20,Y=e[22]<<10|e[23]>>>22,J=e[23]<<10|e[22]>>>22,x=e[33]<<13|e[32]>>>19,P=e[32]<<13|e[33]>>>19,le=e[42]<<2|e[43]>>>30,ue=e[43]<<2|e[42]>>>30,te=e[5]<<30|e[4]>>>2,re=e[4]<<30|e[5]>>>2,U=e[14]<<6|e[15]>>>26,M=e[15]<<6|e[14]>>>26,w=e[25]<<11|e[24]>>>21,v=e[24]<<11|e[25]>>>21,X=e[34]<<15|e[35]>>>17,Q=e[35]<<15|e[34]>>>17,O=e[45]<<29|e[44]>>>3,D=e[44]<<29|e[45]>>>3,k=e[6]<<28|e[7]>>>4,I=e[7]<<28|e[6]>>>4,ne=e[17]<<23|e[16]>>>9,se=e[16]<<23|e[17]>>>9,F=e[26]<<25|e[27]>>>7,$=e[27]<<25|e[26]>>>7,E=e[36]<<21|e[37]>>>11,S=e[37]<<21|e[36]>>>11,Z=e[47]<<24|e[46]>>>8,ee=e[46]<<24|e[47]>>>8,K=e[8]<<27|e[9]>>>5,z=e[9]<<27|e[8]>>>5,R=e[18]<<20|e[19]>>>12,T=e[19]<<20|e[18]>>>12,oe=e[29]<<7|e[28]>>>25,ie=e[28]<<7|e[29]>>>25,H=e[38]<<8|e[39]>>>24,q=e[39]<<8|e[38]>>>24,A=e[48]<<14|e[49]>>>18,_=e[49]<<14|e[48]>>>18,e[0]=g^~m&w,e[1]=y^~b&v,e[10]=k^~R&C,e[11]=I^~T&N,e[20]=L^~U&F,e[21]=B^~M&$,e[30]=K^~G&Y,e[31]=z^~W&J,e[40]=te^~ne&oe,e[41]=re^~se&ie,e[2]=m^~w&E,e[3]=b^~v&S,e[12]=R^~C&x,e[13]=T^~N&P,e[22]=U^~F&H,e[23]=M^~$&q,e[32]=G^~Y&X,e[33]=W^~J&Q,e[42]=ne^~oe&ae,e[43]=se^~ie&ce,e[4]=w^~E&A,e[5]=v^~S&_,e[14]=C^~x&O,e[15]=N^~P&D,e[24]=F^~H&V,e[25]=$^~q&j,e[34]=Y^~X&Z,e[35]=J^~Q&ee,e[44]=oe^~ae&le,e[45]=ie^~ce&ue,e[6]=E^~A&g,e[7]=S^~_&y,e[16]=x^~O&k,e[17]=P^~D&I,e[26]=H^~V&L,e[27]=q^~j&B,e[36]=X^~Z&K,e[37]=Q^~ee&z,e[46]=ae^~le&te,e[47]=ce^~ue&re,e[8]=A^~g&m,e[9]=_^~y&b,e[18]=O^~k&R,e[19]=D^~I&T,e[28]=V^~L&U,e[29]=j^~B&M,e[38]=Z^~K&G,e[39]=ee^~z&W,e[48]=le^~te&ne,e[49]=ue^~re&se,e[0]^=f[n],e[1]^=f[n+1]};if(c)e.exports=x;else{for(O=0;OObject.defineProperty(e,t,{value:r,writable:!0,enumerable:!0,configurable:!0}),a=this,c={concatArrays:!1,ignoreUndefined:!1},l=e=>{const t=[];for(const r in e)s.call(e,r)&&t.push(r);if(Object.getOwnPropertySymbols){const r=Object.getOwnPropertySymbols(e);for(const n of r)o.call(e,n)&&t.push(n)}return t};function u(e){return Array.isArray(e)?function(e){const t=e.slice(0,0);return l(e).forEach((r=>{i(t,r,u(e[r]))})),t}(e):n(e)?function(e){const t=null===Object.getPrototypeOf(e)?Object.create(null):{};return l(e).forEach((r=>{i(t,r,u(e[r]))})),t}(e):e}const h=(e,t,r,n)=>(r.forEach((r=>{void 0===t[r]&&n.ignoreUndefined||(r in e&&e[r]!==Object.getPrototypeOf(e)?i(e,r,p(e[r],t[r],n)):i(e,r,u(t[r])))})),e),d=(e,t,r)=>{let n=e.slice(0,0),o=0;return[e,t].forEach((t=>{const a=[];for(let r=0;r!a.includes(e))),r)})),n};function p(e,t,r){return r.concatArrays&&Array.isArray(e)&&Array.isArray(t)?d(e,t,r):n(t)&&n(e)?h(e,t,l(t),r):u(t)}e.exports=function(...e){const t=p(u(c),this!==a&&this||{},c);let r={_:{}};for(const s of e)if(void 0!==s){if(!n(s))throw new TypeError("`"+s+"` is not an Option Object");r=p(r,{_:s},t)}return r._}},6585:e=>{var t=1e3,r=60*t,n=60*r,s=24*n,o=7*s;function i(e,t,r,n){var s=t>=1.5*r;return Math.round(e/r)+" "+n+(s?"s":"")}e.exports=function(e,a){a=a||{};var c,l,u=typeof e;if("string"===u&&e.length>0)return function(e){if(!((e=String(e)).length>100)){var i=/^(-?(?:\d+)?\.?\d+) *(milliseconds?|msecs?|ms|seconds?|secs?|s|minutes?|mins?|m|hours?|hrs?|h|days?|d|weeks?|w|years?|yrs?|y)?$/i.exec(e);if(i){var a=parseFloat(i[1]);switch((i[2]||"ms").toLowerCase()){case"years":case"year":case"yrs":case"yr":case"y":return 315576e5*a;case"weeks":case"week":case"w":return a*o;case"days":case"day":case"d":return a*s;case"hours":case"hour":case"hrs":case"hr":case"h":return a*n;case"minutes":case"minute":case"mins":case"min":case"m":return a*r;case"seconds":case"second":case"secs":case"sec":case"s":return a*t;case"milliseconds":case"millisecond":case"msecs":case"msec":case"ms":return a;default:return}}}}(e);if("number"===u&&isFinite(e))return a.long?(c=e,(l=Math.abs(c))>=s?i(c,l,s,"day"):l>=n?i(c,l,n,"hour"):l>=r?i(c,l,r,"minute"):l>=t?i(c,l,t,"second"):c+" ms"):function(e){var o=Math.abs(e);return o>=s?Math.round(e/s)+"d":o>=n?Math.round(e/n)+"h":o>=r?Math.round(e/r)+"m":o>=t?Math.round(e/t)+"s":e+"ms"}(e);throw new Error("val is not a non-empty string or a valid number. val="+JSON.stringify(e))}},8437:(e,t,r)=>{e.exports=r(4327)},4327:function(e,t){!function(r,n){"use strict";var s={version:"3.0.0",x86:{},x64:{},inputValidation:!0};function o(e){if(!Array.isArray(e)&&!ArrayBuffer.isView(e))return!1;for(var t=0;t255)return!1;return!0}function i(e,t){return(65535&e)*t+(((e>>>16)*t&65535)<<16)}function a(e,t){return e<>>32-t}function c(e){return e=i(e^=e>>>16,2246822507),(e=i(e^=e>>>13,3266489909))^e>>>16}function l(e,t){e=[e[0]>>>16,65535&e[0],e[1]>>>16,65535&e[1]],t=[t[0]>>>16,65535&t[0],t[1]>>>16,65535&t[1]];var r=[0,0,0,0];return r[3]+=e[3]+t[3],r[2]+=r[3]>>>16,r[3]&=65535,r[2]+=e[2]+t[2],r[1]+=r[2]>>>16,r[2]&=65535,r[1]+=e[1]+t[1],r[0]+=r[1]>>>16,r[1]&=65535,r[0]+=e[0]+t[0],r[0]&=65535,[r[0]<<16|r[1],r[2]<<16|r[3]]}function u(e,t){e=[e[0]>>>16,65535&e[0],e[1]>>>16,65535&e[1]],t=[t[0]>>>16,65535&t[0],t[1]>>>16,65535&t[1]];var r=[0,0,0,0];return r[3]+=e[3]*t[3],r[2]+=r[3]>>>16,r[3]&=65535,r[2]+=e[2]*t[3],r[1]+=r[2]>>>16,r[2]&=65535,r[2]+=e[3]*t[2],r[1]+=r[2]>>>16,r[2]&=65535,r[1]+=e[1]*t[3],r[0]+=r[1]>>>16,r[1]&=65535,r[1]+=e[2]*t[2],r[0]+=r[1]>>>16,r[1]&=65535,r[1]+=e[3]*t[1],r[0]+=r[1]>>>16,r[1]&=65535,r[0]+=e[0]*t[3]+e[1]*t[2]+e[2]*t[1]+e[3]*t[0],r[0]&=65535,[r[0]<<16|r[1],r[2]<<16|r[3]]}function h(e,t){return 32==(t%=64)?[e[1],e[0]]:t<32?[e[0]<>>32-t,e[1]<>>32-t]:(t-=32,[e[1]<>>32-t,e[0]<>>32-t])}function d(e,t){return 0==(t%=64)?e:t<32?[e[0]<>>32-t,e[1]<>>1]),e=p(e=u(e,[4283543511,3981806797]),[0,e[0]>>>1]),p(e=u(e,[3301882366,444984403]),[0,e[0]>>>1])}s.x86.hash32=function(e,t){if(s.inputValidation&&!o(e))return n;t=t||0;for(var r=e.length%4,l=e.length-r,u=t,h=0,d=3432918353,p=461845907,f=0;f>>0},s.x86.hash128=function(e,t){if(s.inputValidation&&!o(e))return n;t=t||0;for(var r=e.length%16,l=e.length-r,u=t,h=t,d=t,p=t,f=0,g=0,y=0,m=0,b=597399067,w=2869860233,v=951274213,E=2716044179,S=0;S>>0).toString(16)).slice(-8)+("00000000"+(h>>>0).toString(16)).slice(-8)+("00000000"+(d>>>0).toString(16)).slice(-8)+("00000000"+(p>>>0).toString(16)).slice(-8)},s.x64.hash128=function(e,t){if(s.inputValidation&&!o(e))return n;t=t||0;for(var r=e.length%16,i=e.length-r,a=[0,t],c=[0,t],g=[0,0],y=[0,0],m=[2277735313,289559509],b=[1291169091,658871167],w=0;w>>0).toString(16)).slice(-8)+("00000000"+(a[1]>>>0).toString(16)).slice(-8)+("00000000"+(c[0]>>>0).toString(16)).slice(-8)+("00000000"+(c[1]>>>0).toString(16)).slice(-8)},e.exports&&(t=e.exports=s),t.murmurHash3=s}()},5507:function(e,t){(function(){var e,r,n,s,o,i,a,c;c=function(e){return[(e&255<<24)>>>24,(e&255<<16)>>>16,(65280&e)>>>8,255&e].join(".")},a=function(e){var t,n,s,o,i,a;for(t=[],s=o=0;o<=3&&0!==e.length;s=++o){if(s>0){if("."!==e[0])throw new Error("Invalid IP");e=e.substring(1)}i=(a=r(e))[0],n=a[1],e=e.substring(n),t.push(i)}if(0!==e.length)throw new Error("Invalid IP");switch(t.length){case 1:if(t[0]>4294967295)throw new Error("Invalid IP");return t[0]>>>0;case 2:if(t[0]>255||t[1]>16777215)throw new Error("Invalid IP");return(t[0]<<24|t[1])>>>0;case 3:if(t[0]>255||t[1]>255||t[2]>65535)throw new Error("Invalid IP");return(t[0]<<24|t[1]<<16|t[2])>>>0;case 4:if(t[0]>255||t[1]>255||t[2]>255||t[3]>255)throw new Error("Invalid IP");return(t[0]<<24|t[1]<<16|t[2]<<8|t[3])>>>0;default:throw new Error("Invalid IP")}},s=(n=function(e){return e.charCodeAt(0)})("0"),i=n("a"),o=n("A"),r=function(e){var t,r,a,c,l;for(c=0,t=10,r="9",a=0,e.length>1&&"0"===e[a]&&("x"===e[a+1]||"X"===e[a+1]?(a+=2,t=16):"0"<=e[a+1]&&e[a+1]<="9"&&(a++,t=8,r="7")),l=a;a>>0;else{if(16!==t)break;if("a"<=e[a]&&e[a]<="f")c=c*t+(10+n(e[a])-i)>>>0;else{if(!("A"<=e[a]&&e[a]<="F"))break;c=c*t+(10+n(e[a])-o)>>>0}}if(c>4294967295)throw new Error("too large");a++}if(a===l)throw new Error("empty octet");return[c,a]},e=function(){function e(e,t){var r,n,s;if("string"!=typeof e)throw new Error("Missing `net' parameter");if(t||(s=e.split("/",2),e=s[0],t=s[1]),t||(t=32),"string"==typeof t&&t.indexOf(".")>-1){try{this.maskLong=a(t)}catch(e){throw new Error("Invalid mask: "+t)}for(r=n=32;n>=0;r=--n)if(this.maskLong===4294967295<<32-r>>>0){this.bitmask=r;break}}else{if(!t&&0!==t)throw new Error("Invalid mask: empty");this.bitmask=parseInt(t,10),this.maskLong=0,this.bitmask>0&&(this.maskLong=4294967295<<32-this.bitmask>>>0)}try{this.netLong=(a(e)&this.maskLong)>>>0}catch(t){throw new Error("Invalid net address: "+e)}if(!(this.bitmask<=32))throw new Error("Invalid mask for ip4: "+t);this.size=Math.pow(2,32-this.bitmask),this.base=c(this.netLong),this.mask=c(this.maskLong),this.hostmask=c(~this.maskLong),this.first=this.bitmask<=30?c(this.netLong+1):this.base,this.last=this.bitmask<=30?c(this.netLong+this.size-2):c(this.netLong+this.size-1),this.broadcast=this.bitmask<=30?c(this.netLong+this.size-1):void 0}return e.prototype.contains=function(t){return"string"==typeof t&&(t.indexOf("/")>0||4!==t.split(".").length)&&(t=new e(t)),t instanceof e?this.contains(t.base)&&this.contains(t.broadcast||t.last):(a(t)&this.maskLong)>>>0==(this.netLong&this.maskLong)>>>0},e.prototype.next=function(t){return null==t&&(t=1),new e(c(this.netLong+this.size*t),this.mask)},e.prototype.forEach=function(e){var t,r,n;for(n=a(this.first),r=a(this.last),t=0;n<=r;)e(c(n),n,t),t++,n++},e.prototype.toString=function(){return this.base+"/"+this.bitmask},e}(),t.ip2long=a,t.long2ip=c,t.Netmask=e}).call(this)},2549:(e,t,r)=>{"use strict";e.exports=r(9100)},5095:e=>{"use strict";e.exports=n;var t,r=/\/|\./;function n(e,t){r.test(e)||(e="google/protobuf/"+e+".proto",t={nested:{google:{nested:{protobuf:{nested:t}}}}}),n[e]=t}n("any",{Any:{fields:{type_url:{type:"string",id:1},value:{type:"bytes",id:2}}}}),n("duration",{Duration:t={fields:{seconds:{type:"int64",id:1},nanos:{type:"int32",id:2}}}}),n("timestamp",{Timestamp:t}),n("empty",{Empty:{fields:{}}}),n("struct",{Struct:{fields:{fields:{keyType:"string",type:"Value",id:1}}},Value:{oneofs:{kind:{oneof:["nullValue","numberValue","stringValue","boolValue","structValue","listValue"]}},fields:{nullValue:{type:"NullValue",id:1},numberValue:{type:"double",id:2},stringValue:{type:"string",id:3},boolValue:{type:"bool",id:4},structValue:{type:"Struct",id:5},listValue:{type:"ListValue",id:6}}},NullValue:{values:{NULL_VALUE:0}},ListValue:{fields:{values:{rule:"repeated",type:"Value",id:1}}}}),n("wrappers",{DoubleValue:{fields:{value:{type:"double",id:1}}},FloatValue:{fields:{value:{type:"float",id:1}}},Int64Value:{fields:{value:{type:"int64",id:1}}},UInt64Value:{fields:{value:{type:"uint64",id:1}}},Int32Value:{fields:{value:{type:"int32",id:1}}},UInt32Value:{fields:{value:{type:"uint32",id:1}}},BoolValue:{fields:{value:{type:"bool",id:1}}},StringValue:{fields:{value:{type:"string",id:1}}},BytesValue:{fields:{value:{type:"bytes",id:1}}}}),n("field_mask",{FieldMask:{fields:{paths:{rule:"repeated",type:"string",id:1}}}}),n.get=function(e){return n[e]||null}},744:(e,t,r)=>{"use strict";var n=t,s=r(5643),o=r(3262);function i(e,t,r,n){var o=!1;if(t.resolvedType)if(t.resolvedType instanceof s){e("switch(d%s){",n);for(var i=t.resolvedType.values,a=Object.keys(i),c=0;c>>0",n,n);break;case"int32":case"sint32":case"sfixed32":e("m%s=d%s|0",n,n);break;case"uint64":l=!0;case"int64":case"sint64":case"fixed64":case"sfixed64":e("if(util.Long)")("(m%s=util.Long.fromValue(d%s)).unsigned=%j",n,n,l)('else if(typeof d%s==="string")',n)("m%s=parseInt(d%s,10)",n,n)('else if(typeof d%s==="number")',n)("m%s=d%s",n,n)('else if(typeof d%s==="object")',n)("m%s=new util.LongBits(d%s.low>>>0,d%s.high>>>0).toNumber(%s)",n,n,n,l?"true":"");break;case"bytes":e('if(typeof d%s==="string")',n)("util.base64.decode(d%s,m%s=util.newBuffer(util.base64.length(d%s)),0)",n,n,n)("else if(d%s.length >= 0)",n)("m%s=d%s",n,n);break;case"string":e("m%s=String(d%s)",n,n);break;case"bool":e("m%s=Boolean(d%s)",n,n)}}return e}function a(e,t,r,n){if(t.resolvedType)t.resolvedType instanceof s?e("d%s=o.enums===String?(types[%i].values[m%s]===undefined?m%s:types[%i].values[m%s]):m%s",n,r,n,n,r,n,n):e("d%s=types[%i].toObject(m%s,o)",n,r,n);else{var o=!1;switch(t.type){case"double":case"float":e("d%s=o.json&&!isFinite(m%s)?String(m%s):m%s",n,n,n,n);break;case"uint64":o=!0;case"int64":case"sint64":case"fixed64":case"sfixed64":e('if(typeof m%s==="number")',n)("d%s=o.longs===String?String(m%s):m%s",n,n,n)("else")("d%s=o.longs===String?util.Long.prototype.toString.call(m%s):o.longs===Number?new util.LongBits(m%s.low>>>0,m%s.high>>>0).toNumber(%s):m%s",n,n,n,n,o?"true":"",n);break;case"bytes":e("d%s=o.bytes===String?util.base64.encode(m%s,0,m%s.length):o.bytes===Array?Array.prototype.slice.call(m%s):m%s",n,n,n,n,n);break;default:e("d%s=m%s",n,n)}}return e}n.fromObject=function(e){var t=e.fieldsArray,r=o.codegen(["d"],e.name+"$fromObject")("if(d instanceof this.ctor)")("return d");if(!t.length)return r("return new this.ctor");r("var m=new this.ctor");for(var n=0;n{"use strict";e.exports=function(e){var t=o.codegen(["r","l"],e.name+"$decode")("if(!(r instanceof Reader))")("r=Reader.create(r)")("var c=l===undefined?r.len:r.pos+l,m=new this.ctor"+(e.fieldsArray.filter((function(e){return e.map})).length?",k,value":""))("while(r.pos>>3){");for(var r=0;r>>3){")("case 1: k=r.%s(); break",a.keyType)("case 2:"),void 0===s.basic[c]?t("value=types[%i].decode(r,r.uint32())",r):t("value=r.%s()",c),t("break")("default:")("r.skipType(tag2&7)")("break")("}")("}"),void 0!==s.long[a.keyType]?t('%s[typeof k==="object"?util.longToHash(k):k]=value',l):t("%s[k]=value",l)):a.repeated?(t("if(!(%s&&%s.length))",l,l)("%s=[]",l),void 0!==s.packed[c]&&t("if((t&7)===2){")("var c2=r.uint32()+r.pos")("while(r.pos{"use strict";e.exports=function(e){for(var t,r=o.codegen(["m","w"],e.name+"$encode")("if(!w)")("w=Writer.create()"),a=e.fieldsArray.slice().sort(o.compareFieldsById),c=0;c>>0,8|s.mapKey[l.keyType],l.keyType),void 0===d?r("types[%i].encode(%s[ks[i]],w.uint32(18).fork()).ldelim().ldelim()",u,t):r(".uint32(%i).%s(%s[ks[i]]).ldelim()",16|d,h,t),r("}")("}")):l.repeated?(r("if(%s!=null&&%s.length){",t,t),l.packed&&void 0!==s.packed[h]?r("w.uint32(%i).fork()",(l.id<<3|2)>>>0)("for(var i=0;i<%s.length;++i)",t)("w.%s(%s[i])",h,t)("w.ldelim()"):(r("for(var i=0;i<%s.length;++i)",t),void 0===d?i(r,l,u,t+"[i]"):r("w.uint32(%i).%s(%s[i])",(l.id<<3|d)>>>0,h,t)),r("}")):(l.optional&&r("if(%s!=null&&Object.hasOwnProperty.call(m,%j))",t,l.name),void 0===d?i(r,l,u,t):r("w.uint32(%i).%s(%s)",(l.id<<3|d)>>>0,h,t))}return r("return w")};var n=r(5643),s=r(361),o=r(3262);function i(e,t,r,n){return t.resolvedType.group?e("types[%i].encode(%s,w.uint32(%i)).uint32(%i)",r,n,(t.id<<3|3)>>>0,(t.id<<3|4)>>>0):e("types[%i].encode(%s,w.uint32(%i).fork()).ldelim()",r,n,(t.id<<3|2)>>>0)}},5643:(e,t,r)=>{"use strict";e.exports=i;var n=r(7209);((i.prototype=Object.create(n.prototype)).constructor=i).className="Enum";var s=r(8923),o=r(3262);function i(e,t,r,s,o,i){if(n.call(this,e,r),t&&"object"!=typeof t)throw TypeError("values must be an object");if(this.valuesById={},this.values=Object.create(this.valuesById),this.comment=s,this.comments=o||{},this.valuesOptions=i,this.reserved=void 0,t)for(var a=Object.keys(t),c=0;c{"use strict";e.exports=l;var n=r(7209);((l.prototype=Object.create(n.prototype)).constructor=l).className="Field";var s,o=r(5643),i=r(361),a=r(3262),c=/^required|optional|repeated$/;function l(e,t,r,s,o,l,u){if(a.isObject(s)?(u=o,l=s,s=o=void 0):a.isObject(o)&&(u=l,l=o,o=void 0),n.call(this,e,l),!a.isInteger(t)||t<0)throw TypeError("id must be a non-negative integer");if(!a.isString(r))throw TypeError("type must be a string");if(void 0!==s&&!c.test(s=s.toString().toLowerCase()))throw TypeError("rule must be a string rule");if(void 0!==o&&!a.isString(o))throw TypeError("extend must be a string");"proto3_optional"===s&&(s="optional"),this.rule=s&&"optional"!==s?s:void 0,this.type=r,this.id=t,this.extend=o||void 0,this.required="required"===s,this.optional=!this.required,this.repeated="repeated"===s,this.map=!1,this.message=null,this.partOf=null,this.typeDefault=null,this.defaultValue=null,this.long=!!a.Long&&void 0!==i.long[r],this.bytes="bytes"===r,this.resolvedType=null,this.extensionField=null,this.declaringField=null,this._packed=null,this.comment=u}l.fromJSON=function(e,t){return new l(e,t.id,t.type,t.rule,t.extend,t.options,t.comment)},Object.defineProperty(l.prototype,"packed",{get:function(){return null===this._packed&&(this._packed=!1!==this.getOption("packed")),this._packed}}),l.prototype.setOption=function(e,t,r){return"packed"===e&&(this._packed=null),n.prototype.setOption.call(this,e,t,r)},l.prototype.toJSON=function(e){var t=!!e&&Boolean(e.keepComments);return a.toObject(["rule","optional"!==this.rule&&this.rule||void 0,"type",this.type,"id",this.id,"extend",this.extend,"options",this.options,"comment",t?this.comment:void 0])},l.prototype.resolve=function(){if(this.resolved)return this;if(void 0===(this.typeDefault=i.defaults[this.type])?(this.resolvedType=(this.declaringField?this.declaringField.parent:this.parent).lookupTypeOrEnum(this.type),this.resolvedType instanceof s?this.typeDefault=null:this.typeDefault=this.resolvedType.values[Object.keys(this.resolvedType.values)[0]]):this.options&&this.options.proto3_optional&&(this.typeDefault=null),this.options&&null!=this.options.default&&(this.typeDefault=this.options.default,this.resolvedType instanceof o&&"string"==typeof this.typeDefault&&(this.typeDefault=this.resolvedType.values[this.typeDefault])),this.options&&(!0!==this.options.packed&&(void 0===this.options.packed||!this.resolvedType||this.resolvedType instanceof o)||delete this.options.packed,Object.keys(this.options).length||(this.options=void 0)),this.long)this.typeDefault=a.Long.fromNumber(this.typeDefault,"u"===this.type.charAt(0)),Object.freeze&&Object.freeze(this.typeDefault);else if(this.bytes&&"string"==typeof this.typeDefault){var e;a.base64.test(this.typeDefault)?a.base64.decode(this.typeDefault,e=a.newBuffer(a.base64.length(this.typeDefault)),0):a.utf8.write(this.typeDefault,e=a.newBuffer(a.utf8.length(this.typeDefault)),0),this.typeDefault=e}return this.map?this.defaultValue=a.emptyObject:this.repeated?this.defaultValue=a.emptyArray:this.defaultValue=this.typeDefault,this.parent instanceof s&&(this.parent.ctor.prototype[this.name]=this.defaultValue),n.prototype.resolve.call(this)},l.d=function(e,t,r,n){return"function"==typeof t?t=a.decorateType(t).name:t&&"object"==typeof t&&(t=a.decorateEnum(t).name),function(s,o){a.decorateType(s.constructor).add(new l(o,e,t,r,{default:n}))}},l._configure=function(e){s=e}},5325:(e,t,r)=>{"use strict";var n=e.exports=r(4394);n.build="light",n.load=function(e,t,r){return"function"==typeof t?(r=t,t=new n.Root):t||(t=new n.Root),t.load(e,r)},n.loadSync=function(e,t){return t||(t=new n.Root),t.loadSync(e)},n.encoder=r(1080),n.decoder=r(7728),n.verifier=r(420),n.converter=r(744),n.ReflectionObject=r(7209),n.Namespace=r(8923),n.Root=r(5330),n.Enum=r(5643),n.Type=r(7882),n.Field=r(1344),n.OneOf=r(1457),n.MapField=r(8252),n.Service=r(9687),n.Method=r(8811),n.Message=r(2551),n.wrappers=r(6434),n.types=r(361),n.util=r(3262),n.ReflectionObject._configure(n.Root),n.Namespace._configure(n.Type,n.Service,n.Enum),n.Root._configure(n.Type),n.Field._configure(n.Type)},4394:(e,t,r)=>{"use strict";var n=t;function s(){n.util._configure(),n.Writer._configure(n.BufferWriter),n.Reader._configure(n.BufferReader)}n.build="minimal",n.Writer=r(3449),n.BufferWriter=r(818),n.Reader=r(6237),n.BufferReader=r(3158),n.util=r(3610),n.rpc=r(5047),n.roots=r(4529),n.configure=s,s()},9100:(e,t,r)=>{"use strict";var n=e.exports=r(5325);n.build="full",n.tokenize=r(527),n.parse=r(4863),n.common=r(5095),n.Root._configure(n.Type,n.parse,n.common)},8252:(e,t,r)=>{"use strict";e.exports=i;var n=r(1344);((i.prototype=Object.create(n.prototype)).constructor=i).className="MapField";var s=r(361),o=r(3262);function i(e,t,r,s,i,a){if(n.call(this,e,t,s,void 0,void 0,i,a),!o.isString(r))throw TypeError("keyType must be a string");this.keyType=r,this.resolvedKeyType=null,this.map=!0}i.fromJSON=function(e,t){return new i(e,t.id,t.keyType,t.type,t.options,t.comment)},i.prototype.toJSON=function(e){var t=!!e&&Boolean(e.keepComments);return o.toObject(["keyType",this.keyType,"type",this.type,"id",this.id,"extend",this.extend,"options",this.options,"comment",t?this.comment:void 0])},i.prototype.resolve=function(){if(this.resolved)return this;if(void 0===s.mapKey[this.keyType])throw Error("invalid key type: "+this.keyType);return n.prototype.resolve.call(this)},i.d=function(e,t,r){return"function"==typeof r?r=o.decorateType(r).name:r&&"object"==typeof r&&(r=o.decorateEnum(r).name),function(n,s){o.decorateType(n.constructor).add(new i(s,e,t,r))}}},2551:(e,t,r)=>{"use strict";e.exports=s;var n=r(3610);function s(e){if(e)for(var t=Object.keys(e),r=0;r{"use strict";e.exports=o;var n=r(7209);((o.prototype=Object.create(n.prototype)).constructor=o).className="Method";var s=r(3262);function o(e,t,r,o,i,a,c,l,u){if(s.isObject(i)?(c=i,i=a=void 0):s.isObject(a)&&(c=a,a=void 0),void 0!==t&&!s.isString(t))throw TypeError("type must be a string");if(!s.isString(r))throw TypeError("requestType must be a string");if(!s.isString(o))throw TypeError("responseType must be a string");n.call(this,e,c),this.type=t||"rpc",this.requestType=r,this.requestStream=!!i||void 0,this.responseType=o,this.responseStream=!!a||void 0,this.resolvedRequestType=null,this.resolvedResponseType=null,this.comment=l,this.parsedOptions=u}o.fromJSON=function(e,t){return new o(e,t.type,t.requestType,t.responseType,t.requestStream,t.responseStream,t.options,t.comment,t.parsedOptions)},o.prototype.toJSON=function(e){var t=!!e&&Boolean(e.keepComments);return s.toObject(["type","rpc"!==this.type&&this.type||void 0,"requestType",this.requestType,"requestStream",this.requestStream,"responseType",this.responseType,"responseStream",this.responseStream,"options",this.options,"comment",t?this.comment:void 0,"parsedOptions",this.parsedOptions])},o.prototype.resolve=function(){return this.resolved?this:(this.resolvedRequestType=this.parent.lookupType(this.requestType),this.resolvedResponseType=this.parent.lookupType(this.responseType),n.prototype.resolve.call(this))}},8923:(e,t,r)=>{"use strict";e.exports=h;var n=r(7209);((h.prototype=Object.create(n.prototype)).constructor=h).className="Namespace";var s,o,i,a=r(1344),c=r(3262),l=r(1457);function u(e,t){if(e&&e.length){for(var r={},n=0;nt)return!0;return!1},h.isReservedName=function(e,t){if(e)for(var r=0;r0;){var n=e.shift();if(r.nested&&r.nested[n]){if(!((r=r.nested[n])instanceof h))throw Error("path conflicts with non-namespace objects")}else r.add(r=new h(n))}return t&&r.addJSON(t),r},h.prototype.resolveAll=function(){for(var e=this.nestedArray,t=0;t-1)return n}else if(n instanceof h&&(n=n.lookup(e.slice(1),t,!0)))return n}else for(var s=0;s{"use strict";e.exports=o,o.className="ReflectionObject";var n,s=r(3262);function o(e,t){if(!s.isString(e))throw TypeError("name must be a string");if(t&&!s.isObject(t))throw TypeError("options must be an object");this.options=t,this.parsedOptions=null,this.name=e,this.parent=null,this.resolved=!1,this.comment=null,this.filename=null}Object.defineProperties(o.prototype,{root:{get:function(){for(var e=this;null!==e.parent;)e=e.parent;return e}},fullName:{get:function(){for(var e=[this.name],t=this.parent;t;)e.unshift(t.name),t=t.parent;return e.join(".")}}}),o.prototype.toJSON=function(){throw Error()},o.prototype.onAdd=function(e){this.parent&&this.parent!==e&&this.parent.remove(this),this.parent=e,this.resolved=!1;var t=e.root;t instanceof n&&t._handleAdd(this)},o.prototype.onRemove=function(e){var t=e.root;t instanceof n&&t._handleRemove(this),this.parent=null,this.resolved=!1},o.prototype.resolve=function(){return this.resolved||this.root instanceof n&&(this.resolved=!0),this},o.prototype.getOption=function(e){if(this.options)return this.options[e]},o.prototype.setOption=function(e,t,r){return r&&this.options&&void 0!==this.options[e]||((this.options||(this.options={}))[e]=t),this},o.prototype.setParsedOption=function(e,t,r){this.parsedOptions||(this.parsedOptions=[]);var n=this.parsedOptions;if(r){var o=n.find((function(t){return Object.prototype.hasOwnProperty.call(t,e)}));if(o){var i=o[e];s.setProperty(i,r,t)}else(o={})[e]=s.setProperty({},r,t),n.push(o)}else{var a={};a[e]=t,n.push(a)}return this},o.prototype.setOptions=function(e,t){if(e)for(var r=Object.keys(e),n=0;n{"use strict";e.exports=i;var n=r(7209);((i.prototype=Object.create(n.prototype)).constructor=i).className="OneOf";var s=r(1344),o=r(3262);function i(e,t,r,s){if(Array.isArray(t)||(r=t,t=void 0),n.call(this,e,r),void 0!==t&&!Array.isArray(t))throw TypeError("fieldNames must be an Array");this.oneof=t||[],this.fieldsArray=[],this.comment=s}function a(e){if(e.parent)for(var t=0;t-1&&this.oneof.splice(t,1),e.partOf=null,this},i.prototype.onAdd=function(e){n.prototype.onAdd.call(this,e);for(var t=0;t{"use strict";e.exports=_,_.filename=null,_.defaults={keepCase:!1};var n=r(527),s=r(5330),o=r(7882),i=r(1344),a=r(8252),c=r(1457),l=r(5643),u=r(9687),h=r(8811),d=r(361),p=r(3262),f=/^[1-9][0-9]*$/,g=/^-?[1-9][0-9]*$/,y=/^0[x][0-9a-fA-F]+$/,m=/^-?0[x][0-9a-fA-F]+$/,b=/^0[0-7]+$/,w=/^-?0[0-7]+$/,v=/^(?![eE])[0-9]*(?:\.[0-9]*)?(?:[eE][+-]?[0-9]+)?$/,E=/^[a-zA-Z_][a-zA-Z_0-9]*$/,S=/^(?:\.?[a-zA-Z_][a-zA-Z_0-9]*)(?:\.[a-zA-Z_][a-zA-Z_0-9]*)*$/,A=/^(?:\.[a-zA-Z_][a-zA-Z_0-9]*)+$/;function _(e,t,r){t instanceof s||(r=t,t=new s),r||(r=_.defaults);var k,I,R,T,C,N=r.preferTrailingComment||!1,x=n(e,r.alternateCommentMode||!1),P=x.next,O=x.push,D=x.peek,L=x.skip,B=x.cmnt,U=!0,M=!1,F=t,$=r.keepCase?function(e){return e}:p.camelCase;function H(e,t,r){var n=_.filename;return r||(_.filename=null),Error("illegal "+(t||"token")+" '"+e+"' ("+(n?n+", ":"")+"line "+x.line+")")}function q(){var e,t=[];do{if('"'!==(e=P())&&"'"!==e)throw H(e);t.push(P()),L(e),e=D()}while('"'===e||"'"===e);return t.join("")}function V(e){var t=P();switch(t){case"'":case'"':return O(t),q();case"true":case"TRUE":return!0;case"false":case"FALSE":return!1}try{return function(e,t){var r=1;switch("-"===e.charAt(0)&&(r=-1,e=e.substring(1)),e){case"inf":case"INF":case"Inf":return r*(1/0);case"nan":case"NAN":case"Nan":case"NaN":return NaN;case"0":return 0}if(f.test(e))return r*parseInt(e,10);if(y.test(e))return r*parseInt(e,16);if(b.test(e))return r*parseInt(e,8);if(v.test(e))return r*parseFloat(e);throw H(e,"number",!0)}(t)}catch(r){if(e&&S.test(t))return t;throw H(t,"value")}}function j(e,t){var r,n;do{!t||'"'!==(r=D())&&"'"!==r?e.push([n=K(P()),L("to",!0)?K(P()):n]):e.push(q())}while(L(",",!0));var s={options:void 0,setOption:function(e,t){void 0===this.options&&(this.options={}),this.options[e]=t}};J(s,(function(e){if("option"!==e)throw H(e);ee(s,e),L(";")}),(function(){ne(s)}))}function K(e,t){switch(e){case"max":case"MAX":case"Max":return 536870911;case"0":return 0}if(!t&&"-"===e.charAt(0))throw H(e,"id");if(g.test(e))return parseInt(e,10);if(m.test(e))return parseInt(e,16);if(w.test(e))return parseInt(e,8);throw H(e,"id")}function z(){if(void 0!==k)throw H("package");if(k=P(),!S.test(k))throw H(k,"name");F=F.define(k),L(";")}function G(){var e,t=D();switch(t){case"weak":e=R||(R=[]),P();break;case"public":P();default:e=I||(I=[])}t=q(),L(";"),e.push(t)}function W(){if(L("="),T=q(),!(M="proto3"===T)&&"proto2"!==T)throw H(T,"syntax");L(";")}function Y(e,t){switch(t){case"option":return ee(e,t),L(";"),!0;case"message":return X(e,t),!0;case"enum":return Z(e,t),!0;case"service":return function(e,t){if(!E.test(t=P()))throw H(t,"service name");var r=new u(t);J(r,(function(e){if(!Y(r,e)){if("rpc"!==e)throw H(e);!function(e,t){var r=B(),n=t;if(!E.test(t=P()))throw H(t,"name");var s,o,i,a,c=t;if(L("("),L("stream",!0)&&(o=!0),!S.test(t=P()))throw H(t);if(s=t,L(")"),L("returns"),L("("),L("stream",!0)&&(a=!0),!S.test(t=P()))throw H(t);i=t,L(")");var l=new h(c,n,s,i,o,a);l.comment=r,J(l,(function(e){if("option"!==e)throw H(e);ee(l,e),L(";")})),e.add(l)}(r,e)}})),e.add(r)}(e,t),!0;case"extend":return function(e,t){if(!S.test(t=P()))throw H(t,"reference");var r=t;J(null,(function(t){switch(t){case"required":case"repeated":Q(e,t,r);break;case"optional":Q(e,M?"proto3_optional":"optional",r);break;default:if(!M||!S.test(t))throw H(t);O(t),Q(e,"optional",r)}}))}(e,t),!0}return!1}function J(e,t,r){var n=x.line;if(e&&("string"!=typeof e.comment&&(e.comment=B()),e.filename=_.filename),L("{",!0)){for(var s;"}"!==(s=P());)t(s);L(";",!0)}else r&&r(),L(";"),e&&("string"!=typeof e.comment||N)&&(e.comment=B(n)||e.comment)}function X(e,t){if(!E.test(t=P()))throw H(t,"type name");var r=new o(t);J(r,(function(e){if(!Y(r,e))switch(e){case"map":!function(e){L("<");var t=P();if(void 0===d.mapKey[t])throw H(t,"type");L(",");var r=P();if(!S.test(r))throw H(r,"type");L(">");var n=P();if(!E.test(n))throw H(n,"name");L("=");var s=new a($(n),K(P()),t,r);J(s,(function(e){if("option"!==e)throw H(e);ee(s,e),L(";")}),(function(){ne(s)})),e.add(s)}(r);break;case"required":case"repeated":Q(r,e);break;case"optional":Q(r,M?"proto3_optional":"optional");break;case"oneof":!function(e,t){if(!E.test(t=P()))throw H(t,"name");var r=new c($(t));J(r,(function(e){"option"===e?(ee(r,e),L(";")):(O(e),Q(r,"optional"))})),e.add(r)}(r,e);break;case"extensions":j(r.extensions||(r.extensions=[]));break;case"reserved":j(r.reserved||(r.reserved=[]),!0);break;default:if(!M||!S.test(e))throw H(e);O(e),Q(r,"optional")}})),e.add(r)}function Q(e,t,r){var n=P();if("group"!==n){for(;n.endsWith(".")||D().startsWith(".");)n+=P();if(!S.test(n))throw H(n,"type");var s=P();if(!E.test(s))throw H(s,"name");s=$(s),L("=");var a=new i(s,K(P()),n,t,r);if(J(a,(function(e){if("option"!==e)throw H(e);ee(a,e),L(";")}),(function(){ne(a)})),"proto3_optional"===t){var l=new c("_"+s);a.setOption("proto3_optional",!0),l.add(a),e.add(l)}else e.add(a);M||!a.repeated||void 0===d.packed[n]&&void 0!==d.basic[n]||a.setOption("packed",!1,!0)}else!function(e,t){var r=P();if(!E.test(r))throw H(r,"name");var n=p.lcFirst(r);r===n&&(r=p.ucFirst(r)),L("=");var s=K(P()),a=new o(r);a.group=!0;var c=new i(n,s,r,t);c.filename=_.filename,J(a,(function(e){switch(e){case"option":ee(a,e),L(";");break;case"required":case"repeated":Q(a,e);break;case"optional":Q(a,M?"proto3_optional":"optional");break;case"message":X(a,e);break;case"enum":Z(a,e);break;default:throw H(e)}})),e.add(a).add(c)}(e,t)}function Z(e,t){if(!E.test(t=P()))throw H(t,"name");var r=new l(t);J(r,(function(e){switch(e){case"option":ee(r,e),L(";");break;case"reserved":j(r.reserved||(r.reserved=[]),!0);break;default:!function(e,t){if(!E.test(t))throw H(t,"name");L("=");var r=K(P(),!0),n={options:void 0,setOption:function(e,t){void 0===this.options&&(this.options={}),this.options[e]=t}};J(n,(function(e){if("option"!==e)throw H(e);ee(n,e),L(";")}),(function(){ne(n)})),e.add(t,r,n.comment,n.options)}(r,e)}})),e.add(r)}function ee(e,t){var r=L("(",!0);if(!S.test(t=P()))throw H(t,"name");var n,s=t,o=s;r&&(L(")"),o=s="("+s+")",t=D(),A.test(t)&&(n=t.slice(1),s+=t,P())),L("="),function(e,t,r,n){e.setParsedOption&&e.setParsedOption(t,r,n)}(e,o,te(e,s),n)}function te(e,t){if(L("{",!0)){for(var r={};!L("}",!0);){if(!E.test(C=P()))throw H(C,"name");if(null===C)throw H(C,"end of input");var n,s=C;if(L(":",!0),"{"===D())n=te(e,t+"."+C);else if("["===D()){var o;if(n=[],L("[",!0)){do{o=V(!0),n.push(o)}while(L(",",!0));L("]"),void 0!==o&&re(e,t+"."+C,o)}}else n=V(!0),re(e,t+"."+C,n);var i=r[s];i&&(n=[].concat(i).concat(n)),r[s]=n,L(",",!0),L(";",!0)}return r}var a=V(!0);return re(e,t,a),a}function re(e,t,r){e.setOption&&e.setOption(t,r)}function ne(e){if(L("[",!0)){do{ee(e,"option")}while(L(",",!0));L("]")}return e}for(;null!==(C=P());)switch(C){case"package":if(!U)throw H(C);z();break;case"import":if(!U)throw H(C);G();break;case"syntax":if(!U)throw H(C);W();break;case"option":ee(F,C),L(";");break;default:if(Y(F,C)){U=!1;continue}throw H(C)}return _.filename=null,{package:k,imports:I,weakImports:R,syntax:T,root:t}}},6237:(e,t,r)=>{"use strict";e.exports=c;var n,s=r(3610),o=s.LongBits,i=s.utf8;function a(e,t){return RangeError("index out of range: "+e.pos+" + "+(t||1)+" > "+e.len)}function c(e){this.buf=e,this.pos=0,this.len=e.length}var l,u="undefined"!=typeof Uint8Array?function(e){if(e instanceof Uint8Array||Array.isArray(e))return new c(e);throw Error("illegal buffer")}:function(e){if(Array.isArray(e))return new c(e);throw Error("illegal buffer")},h=function(){return s.Buffer?function(e){return(c.create=function(e){return s.Buffer.isBuffer(e)?new n(e):u(e)})(e)}:u};function d(){var e=new o(0,0),t=0;if(!(this.len-this.pos>4)){for(;t<3;++t){if(this.pos>=this.len)throw a(this);if(e.lo=(e.lo|(127&this.buf[this.pos])<<7*t)>>>0,this.buf[this.pos++]<128)return e}return e.lo=(e.lo|(127&this.buf[this.pos++])<<7*t)>>>0,e}for(;t<4;++t)if(e.lo=(e.lo|(127&this.buf[this.pos])<<7*t)>>>0,this.buf[this.pos++]<128)return e;if(e.lo=(e.lo|(127&this.buf[this.pos])<<28)>>>0,e.hi=(e.hi|(127&this.buf[this.pos])>>4)>>>0,this.buf[this.pos++]<128)return e;if(t=0,this.len-this.pos>4){for(;t<5;++t)if(e.hi=(e.hi|(127&this.buf[this.pos])<<7*t+3)>>>0,this.buf[this.pos++]<128)return e}else for(;t<5;++t){if(this.pos>=this.len)throw a(this);if(e.hi=(e.hi|(127&this.buf[this.pos])<<7*t+3)>>>0,this.buf[this.pos++]<128)return e}throw Error("invalid varint encoding")}function p(e,t){return(e[t-4]|e[t-3]<<8|e[t-2]<<16|e[t-1]<<24)>>>0}function f(){if(this.pos+8>this.len)throw a(this,8);return new o(p(this.buf,this.pos+=4),p(this.buf,this.pos+=4))}c.create=h(),c.prototype._slice=s.Array.prototype.subarray||s.Array.prototype.slice,c.prototype.uint32=(l=4294967295,function(){if(l=(127&this.buf[this.pos])>>>0,this.buf[this.pos++]<128)return l;if(l=(l|(127&this.buf[this.pos])<<7)>>>0,this.buf[this.pos++]<128)return l;if(l=(l|(127&this.buf[this.pos])<<14)>>>0,this.buf[this.pos++]<128)return l;if(l=(l|(127&this.buf[this.pos])<<21)>>>0,this.buf[this.pos++]<128)return l;if(l=(l|(15&this.buf[this.pos])<<28)>>>0,this.buf[this.pos++]<128)return l;if((this.pos+=5)>this.len)throw this.pos=this.len,a(this,10);return l}),c.prototype.int32=function(){return 0|this.uint32()},c.prototype.sint32=function(){var e=this.uint32();return e>>>1^-(1&e)},c.prototype.bool=function(){return 0!==this.uint32()},c.prototype.fixed32=function(){if(this.pos+4>this.len)throw a(this,4);return p(this.buf,this.pos+=4)},c.prototype.sfixed32=function(){if(this.pos+4>this.len)throw a(this,4);return 0|p(this.buf,this.pos+=4)},c.prototype.float=function(){if(this.pos+4>this.len)throw a(this,4);var e=s.float.readFloatLE(this.buf,this.pos);return this.pos+=4,e},c.prototype.double=function(){if(this.pos+8>this.len)throw a(this,4);var e=s.float.readDoubleLE(this.buf,this.pos);return this.pos+=8,e},c.prototype.bytes=function(){var e=this.uint32(),t=this.pos,r=this.pos+e;if(r>this.len)throw a(this,e);if(this.pos+=e,Array.isArray(this.buf))return this.buf.slice(t,r);if(t===r){var n=s.Buffer;return n?n.alloc(0):new this.buf.constructor(0)}return this._slice.call(this.buf,t,r)},c.prototype.string=function(){var e=this.bytes();return i.read(e,0,e.length)},c.prototype.skip=function(e){if("number"==typeof e){if(this.pos+e>this.len)throw a(this,e);this.pos+=e}else do{if(this.pos>=this.len)throw a(this)}while(128&this.buf[this.pos++]);return this},c.prototype.skipType=function(e){switch(e){case 0:this.skip();break;case 1:this.skip(8);break;case 2:this.skip(this.uint32());break;case 3:for(;4!=(e=7&this.uint32());)this.skipType(e);break;case 5:this.skip(4);break;default:throw Error("invalid wire type "+e+" at offset "+this.pos)}return this},c._configure=function(e){n=e,c.create=h(),n._configure();var t=s.Long?"toLong":"toNumber";s.merge(c.prototype,{int64:function(){return d.call(this)[t](!1)},uint64:function(){return d.call(this)[t](!0)},sint64:function(){return d.call(this).zzDecode()[t](!1)},fixed64:function(){return f.call(this)[t](!0)},sfixed64:function(){return f.call(this)[t](!1)}})}},3158:(e,t,r)=>{"use strict";e.exports=o;var n=r(6237);(o.prototype=Object.create(n.prototype)).constructor=o;var s=r(3610);function o(e){n.call(this,e)}o._configure=function(){s.Buffer&&(o.prototype._slice=s.Buffer.prototype.slice)},o.prototype.string=function(){var e=this.uint32();return this.buf.utf8Slice?this.buf.utf8Slice(this.pos,this.pos=Math.min(this.pos+e,this.len)):this.buf.toString("utf-8",this.pos,this.pos=Math.min(this.pos+e,this.len))},o._configure()},5330:(e,t,r)=>{"use strict";e.exports=h;var n=r(8923);((h.prototype=Object.create(n.prototype)).constructor=h).className="Root";var s,o,i,a=r(1344),c=r(5643),l=r(1457),u=r(3262);function h(e){n.call(this,"",e),this.deferred=[],this.files=[]}function d(){}h.fromJSON=function(e,t){return t||(t=new h),e.options&&t.setOptions(e.options),t.addJSON(e.nested)},h.prototype.resolvePath=u.path.resolve,h.prototype.fetch=u.fetch,h.prototype.load=function e(t,r,n){"function"==typeof r&&(n=r,r=void 0);var s=this;if(!n)return u.asPromise(e,s,t,r);var a=n===d;function c(e,t){if(n){if(a)throw e;var r=n;n=null,r(e,t)}}function l(e){var t=e.lastIndexOf("google/protobuf/");if(t>-1){var r=e.substring(t);if(r in i)return r}return null}function h(e,t){try{if(u.isString(t)&&"{"===t.charAt(0)&&(t=JSON.parse(t)),u.isString(t)){o.filename=e;var n,i=o(t,s,r),h=0;if(i.imports)for(;h-1))if(s.files.push(e),e in i)a?h(e,i[e]):(++f,setTimeout((function(){--f,h(e,i[e])})));else if(a){var r;try{r=u.fs.readFileSync(e).toString("utf8")}catch(e){return void(t||c(e))}h(e,r)}else++f,s.fetch(e,(function(r,o){--f,n&&(r?t?f||c(null,s):c(r):h(e,o))}))}var f=0;u.isString(t)&&(t=[t]);for(var g,y=0;y-1&&this.deferred.splice(t,1)}}else if(e instanceof c)p.test(e.name)&&delete e.parent[e.name];else if(e instanceof n){for(var r=0;r{"use strict";e.exports={}},5047:(e,t,r)=>{"use strict";t.Service=r(7595)},7595:(e,t,r)=>{"use strict";e.exports=s;var n=r(3610);function s(e,t,r){if("function"!=typeof e)throw TypeError("rpcImpl must be a function");n.EventEmitter.call(this),this.rpcImpl=e,this.requestDelimited=Boolean(t),this.responseDelimited=Boolean(r)}(s.prototype=Object.create(n.EventEmitter.prototype)).constructor=s,s.prototype.rpcCall=function e(t,r,s,o,i){if(!o)throw TypeError("request must be specified");var a=this;if(!i)return n.asPromise(e,a,t,r,s,o);if(a.rpcImpl)try{return a.rpcImpl(t,r[a.requestDelimited?"encodeDelimited":"encode"](o).finish(),(function(e,r){if(e)return a.emit("error",e,t),i(e);if(null!==r){if(!(r instanceof s))try{r=s[a.responseDelimited?"decodeDelimited":"decode"](r)}catch(e){return a.emit("error",e,t),i(e)}return a.emit("data",r,t),i(null,r)}a.end(!0)}))}catch(e){return a.emit("error",e,t),void setTimeout((function(){i(e)}),0)}else setTimeout((function(){i(Error("already ended"))}),0)},s.prototype.end=function(e){return this.rpcImpl&&(e||this.rpcImpl(null,null,null),this.rpcImpl=null,this.emit("end").off()),this}},9687:(e,t,r)=>{"use strict";e.exports=a;var n=r(8923);((a.prototype=Object.create(n.prototype)).constructor=a).className="Service";var s=r(8811),o=r(3262),i=r(5047);function a(e,t){n.call(this,e,t),this.methods={},this._methodsArray=null}function c(e){return e._methodsArray=null,e}a.fromJSON=function(e,t){var r=new a(e,t.options);if(t.methods)for(var n=Object.keys(t.methods),o=0;o{"use strict";e.exports=h;var t=/[\s{}=;:[\],'"()<>]/g,r=/(?:"([^"\\]*(?:\\.[^"\\]*)*)")/g,n=/(?:'([^'\\]*(?:\\.[^'\\]*)*)')/g,s=/^ *[*/]+ */,o=/^\s*\*?\/*/,i=/\n/g,a=/\s/,c=/\\(.?)/g,l={0:"\0",r:"\r",n:"\n",t:"\t"};function u(e){return e.replace(c,(function(e,t){switch(t){case"\\":case"":return t;default:return l[t]||""}}))}function h(e,c){e=e.toString();var l=0,h=e.length,d=1,p=0,f={},g=[],y=null;function m(e){return Error("illegal "+e+" (line "+d+")")}function b(t){return e.charAt(t)}function w(t,r,n){var a,l={type:e.charAt(t++),lineEmpty:!1,leading:n},u=t-(c?2:3);do{if(--u<0||"\n"===(a=e.charAt(u))){l.lineEmpty=!0;break}}while(" "===a||"\t"===a);for(var h=e.substring(t,r).split(i),g=0;g0)return g.shift();if(y)return function(){var t="'"===y?n:r;t.lastIndex=l-1;var s=t.exec(e);if(!s)throw m("string");return l=t.lastIndex,A(y),y=null,u(s[1])}();var s,o,i,p,f,S=0===l;do{if(l===h)return null;for(s=!1;a.test(i=b(l));)if("\n"===i&&(S=!0,++d),++l===h)return null;if("/"===b(l)){if(++l===h)throw m("comment");if("/"===b(l))if(c){if(p=l,f=!1,v(l-1)){f=!0;do{if((l=E(l))===h)break;if(l++,!S)break}while(v(l))}else l=Math.min(h,E(l)+1);f&&(w(p,l,S),S=!0),d++,s=!0}else{for(f="/"===b(p=l+1);"\n"!==b(++l);)if(l===h)return null;++l,f&&(w(p,l-1,S),S=!0),++d,s=!0}else{if("*"!==(i=b(l)))return"/";p=l+1,f=c||"*"===b(p);do{if("\n"===i&&++d,++l===h)throw m("comment");o=i,i=b(l)}while("*"!==o||"/"!==i);++l,f&&(w(p,l-2,S),S=!0),s=!0}}}while(s);var _=l;if(t.lastIndex=0,!t.test(b(_++)))for(;_{"use strict";e.exports=b;var n=r(8923);((b.prototype=Object.create(n.prototype)).constructor=b).className="Type";var s=r(5643),o=r(1457),i=r(1344),a=r(8252),c=r(9687),l=r(2551),u=r(6237),h=r(3449),d=r(3262),p=r(1080),f=r(7728),g=r(420),y=r(744),m=r(6434);function b(e,t){n.call(this,e,t),this.fields={},this.oneofs=void 0,this.extensions=void 0,this.reserved=void 0,this.group=void 0,this._fieldsById=null,this._fieldsArray=null,this._oneofsArray=null,this._ctor=null}function w(e){return e._fieldsById=e._fieldsArray=e._oneofsArray=null,delete e.encode,delete e.decode,delete e.verify,e}Object.defineProperties(b.prototype,{fieldsById:{get:function(){if(this._fieldsById)return this._fieldsById;this._fieldsById={};for(var e=Object.keys(this.fields),t=0;t{"use strict";var n=t,s=r(3262),o=["double","float","int32","uint32","sint32","fixed32","sfixed32","int64","uint64","sint64","fixed64","sfixed64","bool","string","bytes"];function i(e,t){var r=0,n={};for(t|=0;r{"use strict";var n,s,o=e.exports=r(3610),i=r(4529);o.codegen=r(8561),o.fetch=r(5212),o.path=r(9207),o.fs=o.inquire("fs"),o.toArray=function(e){if(e){for(var t=Object.keys(e),r=new Array(t.length),n=0;n0)t[s]=e(t[s]||{},r,n);else{var o=t[s];o&&(n=[].concat(o).concat(n)),t[s]=n}return t}(e,t=t.split("."),r)},Object.defineProperty(o,"decorateRoot",{get:function(){return i.decorated||(i.decorated=new(r(5330)))}})},2239:(e,t,r)=>{"use strict";e.exports=s;var n=r(3610);function s(e,t){this.lo=e>>>0,this.hi=t>>>0}var o=s.zero=new s(0,0);o.toNumber=function(){return 0},o.zzEncode=o.zzDecode=function(){return this},o.length=function(){return 1};var i=s.zeroHash="\0\0\0\0\0\0\0\0";s.fromNumber=function(e){if(0===e)return o;var t=e<0;t&&(e=-e);var r=e>>>0,n=(e-r)/4294967296>>>0;return t&&(n=~n>>>0,r=~r>>>0,++r>4294967295&&(r=0,++n>4294967295&&(n=0))),new s(r,n)},s.from=function(e){if("number"==typeof e)return s.fromNumber(e);if(n.isString(e)){if(!n.Long)return s.fromNumber(parseInt(e,10));e=n.Long.fromString(e)}return e.low||e.high?new s(e.low>>>0,e.high>>>0):o},s.prototype.toNumber=function(e){if(!e&&this.hi>>>31){var t=1+~this.lo>>>0,r=~this.hi>>>0;return t||(r=r+1>>>0),-(t+4294967296*r)}return this.lo+4294967296*this.hi},s.prototype.toLong=function(e){return n.Long?new n.Long(0|this.lo,0|this.hi,Boolean(e)):{low:0|this.lo,high:0|this.hi,unsigned:Boolean(e)}};var a=String.prototype.charCodeAt;s.fromHash=function(e){return e===i?o:new s((a.call(e,0)|a.call(e,1)<<8|a.call(e,2)<<16|a.call(e,3)<<24)>>>0,(a.call(e,4)|a.call(e,5)<<8|a.call(e,6)<<16|a.call(e,7)<<24)>>>0)},s.prototype.toHash=function(){return String.fromCharCode(255&this.lo,this.lo>>>8&255,this.lo>>>16&255,this.lo>>>24,255&this.hi,this.hi>>>8&255,this.hi>>>16&255,this.hi>>>24)},s.prototype.zzEncode=function(){var e=this.hi>>31;return this.hi=((this.hi<<1|this.lo>>>31)^e)>>>0,this.lo=(this.lo<<1^e)>>>0,this},s.prototype.zzDecode=function(){var e=-(1&this.lo);return this.lo=((this.lo>>>1|this.hi<<31)^e)>>>0,this.hi=(this.hi>>>1^e)>>>0,this},s.prototype.length=function(){var e=this.lo,t=(this.lo>>>28|this.hi<<4)>>>0,r=this.hi>>>24;return 0===r?0===t?e<16384?e<128?1:2:e<2097152?3:4:t<16384?t<128?5:6:t<2097152?7:8:r<128?9:10}},3610:function(e,t,r){"use strict";var n=t;function s(e,t,r){for(var n=Object.keys(t),s=0;s0)},n.Buffer=function(){try{var e=n.inquire("buffer").Buffer;return e.prototype.utf8Write?e:null}catch(e){return null}}(),n._Buffer_from=null,n._Buffer_allocUnsafe=null,n.newBuffer=function(e){return"number"==typeof e?n.Buffer?n._Buffer_allocUnsafe(e):new n.Array(e):n.Buffer?n._Buffer_from(e):"undefined"==typeof Uint8Array?e:new Uint8Array(e)},n.Array="undefined"!=typeof Uint8Array?Uint8Array:Array,n.Long=n.global.dcodeIO&&n.global.dcodeIO.Long||n.global.Long||n.inquire("long"),n.key2Re=/^true|false|0|1$/,n.key32Re=/^-?(?:0|[1-9][0-9]*)$/,n.key64Re=/^(?:[\\x00-\\xff]{8}|-?(?:0|[1-9][0-9]*))$/,n.longToHash=function(e){return e?n.LongBits.from(e).toHash():n.LongBits.zeroHash},n.longFromHash=function(e,t){var r=n.LongBits.fromHash(e);return n.Long?n.Long.fromBits(r.lo,r.hi,t):r.toNumber(Boolean(t))},n.merge=s,n.lcFirst=function(e){return e.charAt(0).toLowerCase()+e.substring(1)},n.newError=o,n.ProtocolError=o("ProtocolError"),n.oneOfGetter=function(e){for(var t={},r=0;r-1;--r)if(1===t[e[r]]&&void 0!==this[e[r]]&&null!==this[e[r]])return e[r]}},n.oneOfSetter=function(e){return function(t){for(var r=0;r{"use strict";e.exports=function(e){var t=s.codegen(["m"],e.name+"$verify")('if(typeof m!=="object"||m===null)')("return%j","object expected"),r={};e.oneofsArray.length&&t("var p={}");for(var n=0;n{"use strict";var n=t,s=r(2551);n[".google.protobuf.Any"]={fromObject:function(e){if(e&&e["@type"]){var t=e["@type"].substring(e["@type"].lastIndexOf("/")+1),r=this.lookup(t);if(r){var n="."===e["@type"].charAt(0)?e["@type"].slice(1):e["@type"];return-1===n.indexOf("/")&&(n="/"+n),this.create({type_url:n,value:r.encode(r.fromObject(e)).finish()})}}return this.fromObject(e)},toObject:function(e,t){var r="",n="";if(t&&t.json&&e.type_url&&e.value){n=e.type_url.substring(e.type_url.lastIndexOf("/")+1),r=e.type_url.substring(0,e.type_url.lastIndexOf("/")+1);var o=this.lookup(n);o&&(e=o.decode(e.value))}if(!(e instanceof this.ctor)&&e instanceof s){var i=e.$type.toObject(e,t);return""===r&&(r="type.googleapis.com/"),n=r+("."===e.$type.fullName[0]?e.$type.fullName.slice(1):e.$type.fullName),i["@type"]=n,i}return this.toObject(e,t)}}},3449:(e,t,r)=>{"use strict";e.exports=h;var n,s=r(3610),o=s.LongBits,i=s.base64,a=s.utf8;function c(e,t,r){this.fn=e,this.len=t,this.next=void 0,this.val=r}function l(){}function u(e){this.head=e.head,this.tail=e.tail,this.len=e.len,this.next=e.states}function h(){this.len=0,this.head=new c(l,0,0),this.tail=this.head,this.states=null}var d=function(){return s.Buffer?function(){return(h.create=function(){return new n})()}:function(){return new h}};function p(e,t,r){t[r]=255&e}function f(e,t){this.len=e,this.next=void 0,this.val=t}function g(e,t,r){for(;e.hi;)t[r++]=127&e.lo|128,e.lo=(e.lo>>>7|e.hi<<25)>>>0,e.hi>>>=7;for(;e.lo>127;)t[r++]=127&e.lo|128,e.lo=e.lo>>>7;t[r++]=e.lo}function y(e,t,r){t[r]=255&e,t[r+1]=e>>>8&255,t[r+2]=e>>>16&255,t[r+3]=e>>>24}h.create=d(),h.alloc=function(e){return new s.Array(e)},s.Array!==Array&&(h.alloc=s.pool(h.alloc,s.Array.prototype.subarray)),h.prototype._push=function(e,t,r){return this.tail=this.tail.next=new c(e,t,r),this.len+=t,this},f.prototype=Object.create(c.prototype),f.prototype.fn=function(e,t,r){for(;e>127;)t[r++]=127&e|128,e>>>=7;t[r]=e},h.prototype.uint32=function(e){return this.len+=(this.tail=this.tail.next=new f((e>>>=0)<128?1:e<16384?2:e<2097152?3:e<268435456?4:5,e)).len,this},h.prototype.int32=function(e){return e<0?this._push(g,10,o.fromNumber(e)):this.uint32(e)},h.prototype.sint32=function(e){return this.uint32((e<<1^e>>31)>>>0)},h.prototype.uint64=function(e){var t=o.from(e);return this._push(g,t.length(),t)},h.prototype.int64=h.prototype.uint64,h.prototype.sint64=function(e){var t=o.from(e).zzEncode();return this._push(g,t.length(),t)},h.prototype.bool=function(e){return this._push(p,1,e?1:0)},h.prototype.fixed32=function(e){return this._push(y,4,e>>>0)},h.prototype.sfixed32=h.prototype.fixed32,h.prototype.fixed64=function(e){var t=o.from(e);return this._push(y,4,t.lo)._push(y,4,t.hi)},h.prototype.sfixed64=h.prototype.fixed64,h.prototype.float=function(e){return this._push(s.float.writeFloatLE,4,e)},h.prototype.double=function(e){return this._push(s.float.writeDoubleLE,8,e)};var m=s.Array.prototype.set?function(e,t,r){t.set(e,r)}:function(e,t,r){for(var n=0;n>>0;if(!t)return this._push(p,1,0);if(s.isString(e)){var r=h.alloc(t=i.length(e));i.decode(e,r,0),e=r}return this.uint32(t)._push(m,t,e)},h.prototype.string=function(e){var t=a.length(e);return t?this.uint32(t)._push(a.write,t,e):this._push(p,1,0)},h.prototype.fork=function(){return this.states=new u(this),this.head=this.tail=new c(l,0,0),this.len=0,this},h.prototype.reset=function(){return this.states?(this.head=this.states.head,this.tail=this.states.tail,this.len=this.states.len,this.states=this.states.next):(this.head=this.tail=new c(l,0,0),this.len=0),this},h.prototype.ldelim=function(){var e=this.head,t=this.tail,r=this.len;return this.reset().uint32(r),r&&(this.tail.next=e.next,this.tail=t,this.len+=r),this},h.prototype.finish=function(){for(var e=this.head.next,t=this.constructor.alloc(this.len),r=0;e;)e.fn(e.val,t,r),r+=e.len,e=e.next;return t},h._configure=function(e){n=e,h.create=d(),n._configure()}},818:(e,t,r)=>{"use strict";e.exports=o;var n=r(3449);(o.prototype=Object.create(n.prototype)).constructor=o;var s=r(3610);function o(){n.call(this)}function i(e,t,r){e.length<40?s.utf8.write(e,t,r):t.utf8Write?t.utf8Write(e,r):t.write(e,r)}o._configure=function(){o.alloc=s._Buffer_allocUnsafe,o.writeBytesBuffer=s.Buffer&&s.Buffer.prototype instanceof Uint8Array&&"set"===s.Buffer.prototype.set.name?function(e,t,r){t.set(e,r)}:function(e,t,r){if(e.copy)e.copy(t,r,0,e.length);else for(var n=0;n>>0;return this.uint32(t),t&&this._push(o.writeBytesBuffer,t,e),this},o.prototype.string=function(e){var t=s.Buffer.byteLength(e);return this.uint32(t),t&&this._push(i,t,e),this},o._configure()},152:(e,t)=>{"use strict";class r{static isArrayBuffer(e){return"[object ArrayBuffer]"===Object.prototype.toString.call(e)}static toArrayBuffer(e){return this.isArrayBuffer(e)?e:e.byteLength===e.buffer.byteLength||0===e.byteOffset&&e.byteLength===e.buffer.byteLength?e.buffer:this.toUint8Array(e.buffer).slice(e.byteOffset,e.byteOffset+e.byteLength).buffer}static toUint8Array(e){return this.toView(e,Uint8Array)}static toView(e,t){if(e.constructor===t)return e;if(this.isArrayBuffer(e))return new t(e);if(this.isArrayBufferView(e))return new t(e.buffer,e.byteOffset,e.byteLength);throw new TypeError("The provided value is not of type '(ArrayBuffer or ArrayBufferView)'")}static isBufferSource(e){return this.isArrayBufferView(e)||this.isArrayBuffer(e)}static isArrayBufferView(e){return ArrayBuffer.isView(e)||e&&this.isArrayBuffer(e.buffer)}static isEqual(e,t){const n=r.toUint8Array(e),s=r.toUint8Array(t);if(n.length!==s.byteLength)return!1;for(let e=0;e{}},__webpack_module_cache__={},leafPrototypes,getProto;function __webpack_require__(e){var t=__webpack_module_cache__[e];if(void 0!==t)return t.exports;var r=__webpack_module_cache__[e]={exports:{}};return __webpack_modules__[e].call(r.exports,r,r.exports,__webpack_require__),r.exports}__webpack_require__.amdO={},getProto=Object.getPrototypeOf?e=>Object.getPrototypeOf(e):e=>e.__proto__,__webpack_require__.t=function(e,t){if(1&t&&(e=this(e)),8&t)return e;if("object"==typeof e&&e){if(4&t&&e.__esModule)return e;if(16&t&&"function"==typeof e.then)return e}var r=Object.create(null);__webpack_require__.r(r);var n={};leafPrototypes=leafPrototypes||[null,getProto({}),getProto([]),getProto(getProto)];for(var s=2&t&&e;"object"==typeof s&&!~leafPrototypes.indexOf(s);s=getProto(s))Object.getOwnPropertyNames(s).forEach((t=>n[t]=()=>e[t]));return n.default=()=>e,__webpack_require__.d(r,n),r},__webpack_require__.d=(e,t)=>{for(var r in t)__webpack_require__.o(t,r)&&!__webpack_require__.o(e,r)&&Object.defineProperty(e,r,{enumerable:!0,get:t[r]})},__webpack_require__.o=(e,t)=>Object.prototype.hasOwnProperty.call(e,t),__webpack_require__.r=e=>{"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(e,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(e,"__esModule",{value:!0})};var __webpack_exports__={};(()=>{"use strict";var e={};__webpack_require__.r(e),__webpack_require__.d(e,{base10:()=>ie});var t={};__webpack_require__.r(t),__webpack_require__.d(t,{base16:()=>ae,base16upper:()=>ce});var r={};__webpack_require__.r(r),__webpack_require__.d(r,{base2:()=>le});var n={};__webpack_require__.r(n),__webpack_require__.d(n,{base256emoji:()=>pe});var s={};__webpack_require__.r(s),__webpack_require__.d(s,{base32:()=>fe,base32hex:()=>be,base32hexpad:()=>ve,base32hexpadupper:()=>Ee,base32hexupper:()=>we,base32pad:()=>ye,base32padupper:()=>me,base32upper:()=>ge,base32z:()=>Se});var o={};__webpack_require__.r(o),__webpack_require__.d(o,{base36:()=>Ae,base36upper:()=>_e});var i={};__webpack_require__.r(i),__webpack_require__.d(i,{base58btc:()=>ke,base58flickr:()=>Ie});var a={};__webpack_require__.r(a),__webpack_require__.d(a,{base64:()=>Re,base64pad:()=>Te,base64url:()=>Ce,base64urlpad:()=>Ne});var c={};__webpack_require__.r(c),__webpack_require__.d(c,{base8:()=>xe});var l={};__webpack_require__.r(l),__webpack_require__.d(l,{identity:()=>Pe});var u={};__webpack_require__.r(u),__webpack_require__.d(u,{code:()=>Be,decode:()=>Me,encode:()=>Ue,name:()=>Le});var h={};__webpack_require__.r(h),__webpack_require__.d(h,{code:()=>$e,decode:()=>qe,encode:()=>He,name:()=>Fe});var d={};__webpack_require__.r(d),__webpack_require__.d(d,{identity:()=>ht});var p={};__webpack_require__.r(p),__webpack_require__.d(p,{sha256:()=>gt,sha512:()=>yt});var f={};__webpack_require__.r(f),__webpack_require__.d(f,{aK:()=>xi,e8:()=>yi,DO:()=>gi,OG:()=>Pi,My:()=>bi,Ph:()=>Ai,lX:()=>_i,Id:()=>Ti,fg:()=>Li,qj:()=>Ri,aT:()=>Si,r4:()=>Ni,aY:()=>fi,x:()=>Mi,lq:()=>ki,z:()=>Ii,Q5:()=>Ui});var g={};__webpack_require__.r(g),__webpack_require__.d(g,{Ed25519PrivateKey:()=>$a,Ed25519PublicKey:()=>Fa,generateKeyPair:()=>Va,generateKeyPairFromSeed:()=>ja,unmarshalEd25519PrivateKey:()=>Ha,unmarshalEd25519PublicKey:()=>qa});var y={};__webpack_require__.r(y),__webpack_require__.d(y,{MAX_RSA_KEY_SIZE:()=>cu,RsaPrivateKey:()=>uu,RsaPublicKey:()=>lu,fromJwk:()=>pu,generateKeyPair:()=>fu,unmarshalRsaPrivateKey:()=>hu,unmarshalRsaPublicKey:()=>du});var m={};function b(e=0){return new Uint8Array(e)}function w(e=0){return new Uint8Array(e)}__webpack_require__.r(m),__webpack_require__.d(m,{Secp256k1PrivateKey:()=>Ou,Secp256k1PublicKey:()=>Pu,generateKeyPair:()=>Bu,unmarshalSecp256k1PrivateKey:()=>Du,unmarshalSecp256k1PublicKey:()=>Lu});const v=Math.pow(2,7),E=Math.pow(2,14),S=Math.pow(2,21),A=Math.pow(2,28),_=Math.pow(2,35),k=Math.pow(2,42),I=Math.pow(2,49),R=128,T=127;function C(e){if(eNumber.MAX_SAFE_INTEGER)throw new RangeError("Could not encode varint");return 8}function N(e,t,r=0){switch(C(e)){case 8:t[r++]=255&e|R,e/=128;case 7:t[r++]=255&e|R,e/=128;case 6:t[r++]=255&e|R,e/=128;case 5:t[r++]=255&e|R,e/=128;case 4:t[r++]=255&e|R,e>>>=7;case 3:t[r++]=255&e|R,e>>>=7;case 2:t[r++]=255&e|R,e>>>=7;case 1:t[r++]=255&e,e>>>=7;break;default:throw new Error("unreachable")}return t}function x(e,t){let r=e[t],n=0;if(n+=r&T,r>>=7;case 3:t.set(r++,255&e|R),e>>>=7;case 2:t.set(r++,255&e|R),e>>>=7;case 1:t.set(r++,255&e),e>>>=7;break;default:throw new Error("unreachable")}return t}(e,t,r)}function O(e,t=0){return e instanceof Uint8Array?x(e,t):function(e,t){let r=e.get(t),n=0;if(n+=r&T,r>>31>0){const e=1+~this.lo>>>0;let t=~this.hi>>>0;return 0===e&&(t=t+1>>>0),-(e+4294967296*t)}return this.lo+4294967296*this.hi}toBigInt(e=!1){if(e)return BigInt(this.lo>>>0)+(BigInt(this.hi>>>0)<<32n);if(this.hi>>>31!=0){const e=1+~this.lo>>>0;let t=~this.hi>>>0;return 0===e&&(t=t+1>>>0),-(BigInt(e)+(BigInt(t)<<32n))}return BigInt(this.lo>>>0)+(BigInt(this.hi>>>0)<<32n)}toString(e=!1){return this.toBigInt(e).toString()}zzEncode(){const e=this.hi>>31;return this.hi=((this.hi<<1|this.lo>>>31)^e)>>>0,this.lo=(this.lo<<1^e)>>>0,this}zzDecode(){const e=-(1&this.lo);return this.lo=((this.lo>>>1|this.hi<<31)^e)>>>0,this.hi=(this.hi>>>1^e)>>>0,this}length(){const e=this.lo,t=(this.lo>>>28|this.hi<<4)>>>0,r=this.hi>>>24;return 0===r?0===t?e<16384?e<128?1:2:e<2097152?3:4:t<16384?t<128?5:6:t<2097152?7:8:r<128?9:10}static fromBigInt(e){if(0n===e)return V;if(e<$&&e>H)return this.fromNumber(Number(e));const t=e<0n;t&&(e=-e);let r=e>>32n,n=e-(r<<32n);return t&&(r=0n|~r,n=0n|~n,++n>j&&(n=0n,++r>j&&(r=0n))),new q(Number(n),Number(r))}static fromNumber(e){if(0===e)return V;const t=e<0;t&&(e=-e);let r=e>>>0,n=(e-r)/4294967296>>>0;return t&&(n=~n>>>0,r=~r>>>0,++r>4294967295&&(r=0,++n>4294967295&&(n=0))),new q(r,n)}static from(e){return"number"==typeof e?q.fromNumber(e):"bigint"==typeof e?q.fromBigInt(e):"string"==typeof e?q.fromBigInt(BigInt(e)):null!=e.low||null!=e.high?new q(e.low>>>0,e.high>>>0):V}}const V=new q(0,0);V.toBigInt=function(){return 0n},V.zzEncode=V.zzDecode=function(){return this},V.length=function(){return 1};const j=4294967296n;function K(e,t,r){const n=r;let s,o;for(let n=0;n>6|192,t[r++]=63&s|128):55296==(64512&s)&&56320==(64512&(o=e.charCodeAt(n+1)))?(s=65536+((1023&s)<<10)+(1023&o),++n,t[r++]=s>>18|240,t[r++]=s>>12&63|128,t[r++]=s>>6&63|128,t[r++]=63&s|128):(t[r++]=s>>12|224,t[r++]=s>>6&63|128,t[r++]=63&s|128);return r-n}function z(e,t){return RangeError(`index out of range: ${e.pos} + ${t??1} > ${e.len}`)}function G(e,t){return(e[t-4]|e[t-3]<<8|e[t-2]<<16|e[t-1]<<24)>>>0}class W{buf;pos;len;_slice=Uint8Array.prototype.subarray;constructor(e){this.buf=e,this.pos=0,this.len=e.length}uint32(){let e=4294967295;if(e=(127&this.buf[this.pos])>>>0,this.buf[this.pos++]<128)return e;if(e=(e|(127&this.buf[this.pos])<<7)>>>0,this.buf[this.pos++]<128)return e;if(e=(e|(127&this.buf[this.pos])<<14)>>>0,this.buf[this.pos++]<128)return e;if(e=(e|(127&this.buf[this.pos])<<21)>>>0,this.buf[this.pos++]<128)return e;if(e=(e|(15&this.buf[this.pos])<<28)>>>0,this.buf[this.pos++]<128)return e;if((this.pos+=5)>this.len)throw this.pos=this.len,z(this,10);return e}int32(){return 0|this.uint32()}sint32(){const e=this.uint32();return e>>>1^-(1&e)}bool(){return 0!==this.uint32()}fixed32(){if(this.pos+4>this.len)throw z(this,4);return G(this.buf,this.pos+=4)}sfixed32(){if(this.pos+4>this.len)throw z(this,4);return 0|G(this.buf,this.pos+=4)}float(){if(this.pos+4>this.len)throw z(this,4);const e=(t=this.buf,r=this.pos,L[0]=t[r],L[1]=t[r+1],L[2]=t[r+2],L[3]=t[r+3],D[0]);var t,r;return this.pos+=4,e}double(){if(this.pos+8>this.len)throw z(this,4);const e=(t=this.buf,r=this.pos,M[0]=t[r],M[1]=t[r+1],M[2]=t[r+2],M[3]=t[r+3],M[4]=t[r+4],M[5]=t[r+5],M[6]=t[r+6],M[7]=t[r+7],U[0]);var t,r;return this.pos+=8,e}bytes(){const e=this.uint32(),t=this.pos,r=this.pos+e;if(r>this.len)throw z(this,e);return this.pos+=e,t===r?new Uint8Array(0):this.buf.subarray(t,r)}string(){const e=this.bytes();return function(e,t,r){if(r-t<1)return"";let n;const s=[];let o,i=0;for(;t191&&o<224?s[i++]=(31&o)<<6|63&e[t++]:o>239&&o<365?(o=((7&o)<<18|(63&e[t++])<<12|(63&e[t++])<<6|63&e[t++])-65536,s[i++]=55296+(o>>10),s[i++]=56320+(1023&o)):s[i++]=(15&o)<<12|(63&e[t++])<<6|63&e[t++],i>8191&&((n??(n=[])).push(String.fromCharCode.apply(String,s)),i=0);return null!=n?(i>0&&n.push(String.fromCharCode.apply(String,s.slice(0,i))),n.join("")):String.fromCharCode.apply(String,s.slice(0,i))}(e,0,e.length)}skip(e){if("number"==typeof e){if(this.pos+e>this.len)throw z(this,e);this.pos+=e}else do{if(this.pos>=this.len)throw z(this)}while(128&this.buf[this.pos++]);return this}skipType(e){switch(e){case 0:this.skip();break;case 1:this.skip(8);break;case 2:this.skip(this.uint32());break;case 3:for(;4!=(e=7&this.uint32());)this.skipType(e);break;case 5:this.skip(4);break;default:throw Error(`invalid wire type ${e} at offset ${this.pos}`)}return this}readLongVarint(){const e=new q(0,0);let t=0;if(!(this.len-this.pos>4)){for(;t<3;++t){if(this.pos>=this.len)throw z(this);if(e.lo=(e.lo|(127&this.buf[this.pos])<<7*t)>>>0,this.buf[this.pos++]<128)return e}return e.lo=(e.lo|(127&this.buf[this.pos++])<<7*t)>>>0,e}for(;t<4;++t)if(e.lo=(e.lo|(127&this.buf[this.pos])<<7*t)>>>0,this.buf[this.pos++]<128)return e;if(e.lo=(e.lo|(127&this.buf[this.pos])<<28)>>>0,e.hi=(e.hi|(127&this.buf[this.pos])>>4)>>>0,this.buf[this.pos++]<128)return e;if(t=0,this.len-this.pos>4){for(;t<5;++t)if(e.hi=(e.hi|(127&this.buf[this.pos])<<7*t+3)>>>0,this.buf[this.pos++]<128)return e}else for(;t<5;++t){if(this.pos>=this.len)throw z(this);if(e.hi=(e.hi|(127&this.buf[this.pos])<<7*t+3)>>>0,this.buf[this.pos++]<128)return e}throw Error("invalid varint encoding")}readFixed64(){if(this.pos+8>this.len)throw z(this,8);const e=G(this.buf,this.pos+=4),t=G(this.buf,this.pos+=4);return new q(e,t)}int64(){return this.readLongVarint().toBigInt()}int64Number(){return this.readLongVarint().toNumber()}int64String(){return this.readLongVarint().toString()}uint64(){return this.readLongVarint().toBigInt(!0)}uint64Number(){const e=x(this.buf,this.pos);return this.pos+=C(e),e}uint64String(){return this.readLongVarint().toString(!0)}sint64(){return this.readLongVarint().zzDecode().toBigInt()}sint64Number(){return this.readLongVarint().zzDecode().toNumber()}sint64String(){return this.readLongVarint().zzDecode().toString()}fixed64(){return this.readFixed64().toBigInt()}fixed64Number(){return this.readFixed64().toNumber()}fixed64String(){return this.readFixed64().toString()}sfixed64(){return this.readFixed64().toBigInt()}sfixed64Number(){return this.readFixed64().toNumber()}sfixed64String(){return this.readFixed64().toString()}}function Y(e,t,r){const n=function(e){return new W(e instanceof Uint8Array?e:e.subarray())}(e);return t.decode(n,void 0,r)}function J(e){if(e instanceof Uint8Array&&"Uint8Array"===e.constructor.name)return e;if(e instanceof ArrayBuffer)return new Uint8Array(e);if(ArrayBuffer.isView(e))return new Uint8Array(e.buffer,e.byteOffset,e.byteLength);throw new Error("Unknown type, must be binary type")}new Uint8Array(0);const X=function(e,t){if(e.length>=255)throw new TypeError("Alphabet too long");for(var r=new Uint8Array(256),n=0;n>>0,i=new Uint8Array(o);e[t];){var u=r[e.charCodeAt(t)];if(255===u)return;for(var h=0,d=o-1;(0!==u||h>>0,i[d]=u%256>>>0,u=u/256>>>0;if(0!==u)throw new Error("Non-zero carry");s=h,t++}if(" "!==e[t]){for(var p=o-s;p!==o&&0===i[p];)p++;for(var f=new Uint8Array(n+(o-p)),g=n;p!==o;)f[g++]=i[p++];return f}}}return{encode:function(t){if(t instanceof Uint8Array||(ArrayBuffer.isView(t)?t=new Uint8Array(t.buffer,t.byteOffset,t.byteLength):Array.isArray(t)&&(t=Uint8Array.from(t))),!(t instanceof Uint8Array))throw new TypeError("Expected Uint8Array");if(0===t.length)return"";for(var r=0,n=0,s=0,o=t.length;s!==o&&0===t[s];)s++,r++;for(var i=(o-s)*u+1>>>0,l=new Uint8Array(i);s!==o;){for(var h=t[s],d=0,p=i-1;(0!==h||d>>0,l[p]=h%a>>>0,h=h/a>>>0;if(0!==h)throw new Error("Non-zero carry");n=d,s++}for(var f=i-n;f!==i&&0===l[f];)f++;for(var g=c.repeat(r);fJ(s(e))})}function oe({name:e,prefix:t,bitsPerChar:r,alphabet:n}){return ne({prefix:t,name:e,encode:e=>function(e,t,r){const n="="===t[t.length-1],s=(1<r;)i-=r,o+=t[s&a>>i];if(0!==i&&(o+=t[s&a<function(e,t,r,n){const s={};for(let e=0;e=8&&(a-=8,i[l++]=255&c>>a)}if(a>=r||255&c<<8-a)throw new SyntaxError("Unexpected end of data");return i}(t,n,r,e)})}const ie=se({prefix:"9",name:"base10",alphabet:"0123456789"}),ae=oe({prefix:"f",name:"base16",alphabet:"0123456789abcdef",bitsPerChar:4}),ce=oe({prefix:"F",name:"base16upper",alphabet:"0123456789ABCDEF",bitsPerChar:4}),le=oe({prefix:"0",name:"base2",alphabet:"01",bitsPerChar:1}),ue=Array.from("🚀🪐☄🛰🌌🌑🌒🌓🌔🌕🌖🌗🌘🌍🌏🌎🐉☀💻🖥💾💿😂❤😍🤣😊🙏💕😭😘👍😅👏😁🔥🥰💔💖💙😢🤔😆🙄💪😉☺👌🤗💜😔😎😇🌹🤦🎉💞✌✨🤷😱😌🌸🙌😋💗💚😏💛🙂💓🤩😄😀🖤😃💯🙈👇🎶😒🤭❣😜💋👀😪😑💥🙋😞😩😡🤪👊🥳😥🤤👉💃😳✋😚😝😴🌟😬🙃🍀🌷😻😓⭐✅🥺🌈😈🤘💦✔😣🏃💐☹🎊💘😠☝😕🌺🎂🌻😐🖕💝🙊😹🗣💫💀👑🎵🤞😛🔴😤🌼😫⚽🤙☕🏆🤫👈😮🙆🍻🍃🐶💁😲🌿🧡🎁⚡🌞🎈❌✊👋😰🤨😶🤝🚶💰🍓💢🤟🙁🚨💨🤬✈🎀🍺🤓😙💟🌱😖👶🥴▶➡❓💎💸⬇😨🌚🦋😷🕺⚠🙅😟😵👎🤲🤠🤧📌🔵💅🧐🐾🍒😗🤑🌊🤯🐷☎💧😯💆👆🎤🙇🍑❄🌴💣🐸💌📍🥀🤢👅💡💩👐📸👻🤐🤮🎼🥵🚩🍎🍊👼💍📣🥂"),he=ue.reduce(((e,t,r)=>(e[r]=t,e)),[]),de=ue.reduce(((e,t,r)=>(e[t.codePointAt(0)]=r,e)),[]),pe=ne({prefix:"🚀",name:"base256emoji",encode:function(e){return e.reduce(((e,t)=>e+he[t]),"")},decode:function(e){const t=[];for(const r of e){const e=de[r.codePointAt(0)];if(void 0===e)throw new Error(`Non-base256emoji character: ${r}`);t.push(e)}return new Uint8Array(t)}}),fe=oe({prefix:"b",name:"base32",alphabet:"abcdefghijklmnopqrstuvwxyz234567",bitsPerChar:5}),ge=oe({prefix:"B",name:"base32upper",alphabet:"ABCDEFGHIJKLMNOPQRSTUVWXYZ234567",bitsPerChar:5}),ye=oe({prefix:"c",name:"base32pad",alphabet:"abcdefghijklmnopqrstuvwxyz234567=",bitsPerChar:5}),me=oe({prefix:"C",name:"base32padupper",alphabet:"ABCDEFGHIJKLMNOPQRSTUVWXYZ234567=",bitsPerChar:5}),be=oe({prefix:"v",name:"base32hex",alphabet:"0123456789abcdefghijklmnopqrstuv",bitsPerChar:5}),we=oe({prefix:"V",name:"base32hexupper",alphabet:"0123456789ABCDEFGHIJKLMNOPQRSTUV",bitsPerChar:5}),ve=oe({prefix:"t",name:"base32hexpad",alphabet:"0123456789abcdefghijklmnopqrstuv=",bitsPerChar:5}),Ee=oe({prefix:"T",name:"base32hexpadupper",alphabet:"0123456789ABCDEFGHIJKLMNOPQRSTUV=",bitsPerChar:5}),Se=oe({prefix:"h",name:"base32z",alphabet:"ybndrfg8ejkmcpqxot1uwisza345h769",bitsPerChar:5}),Ae=se({prefix:"k",name:"base36",alphabet:"0123456789abcdefghijklmnopqrstuvwxyz"}),_e=se({prefix:"K",name:"base36upper",alphabet:"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"}),ke=se({name:"base58btc",prefix:"z",alphabet:"123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz"}),Ie=se({name:"base58flickr",prefix:"Z",alphabet:"123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ"}),Re=oe({prefix:"m",name:"base64",alphabet:"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/",bitsPerChar:6}),Te=oe({prefix:"M",name:"base64pad",alphabet:"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=",bitsPerChar:6}),Ce=oe({prefix:"u",name:"base64url",alphabet:"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_",bitsPerChar:6}),Ne=oe({prefix:"U",name:"base64urlpad",alphabet:"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_=",bitsPerChar:6}),xe=oe({prefix:"7",name:"base8",alphabet:"01234567",bitsPerChar:3}),Pe=ne({prefix:"\0",name:"identity",encode:e=>{return t=e,(new TextDecoder).decode(t);var t},decode:e=>function(e){return(new TextEncoder).encode(e)}(e)}),Oe=new TextEncoder,De=new TextDecoder,Le="json",Be=512;function Ue(e){return Oe.encode(JSON.stringify(e))}function Me(e){return JSON.parse(De.decode(e))}const Fe="raw",$e=85;function He(e){return J(e)}function qe(e){return J(e)}var Ve=128,je=-128,Ke=Math.pow(2,31),ze=128,Ge=127,We=Math.pow(2,7),Ye=Math.pow(2,14),Je=Math.pow(2,21),Xe=Math.pow(2,28),Qe=Math.pow(2,35),Ze=Math.pow(2,42),et=Math.pow(2,49),tt=Math.pow(2,56),rt=Math.pow(2,63);const nt={encode:function e(t,r,n){r=r||[];for(var s=n=n||0;t>=Ke;)r[n++]=255&t|Ve,t/=128;for(;t&je;)r[n++]=255&t|Ve,t>>>=7;return r[n]=0|t,e.bytes=n-s+1,r},decode:function e(t,r){var n,s=0,o=0,i=r=r||0,a=t.length;do{if(i>=a)throw e.bytes=0,new RangeError("Could not decode varint");n=t[i++],s+=o<28?(n&Ge)<=ze);return e.bytes=i-r,s},encodingLength:function(e){return eat(this.code,e)))}throw Error("Unknown type, must be binary type")}}function ft(e){return async t=>new Uint8Array(await crypto.subtle.digest(e,t))}const gt=dt({name:"sha2-256",code:18,encode:ft("SHA-256")}),yt=dt({name:"sha2-512",code:19,encode:ft("SHA-512")});function mt(e,t){const{bytes:r,version:n}=e;return 0===n?function(e,t,r){const{prefix:n}=r;if(n!==ke.prefix)throw Error(`Cannot string encode V0 in ${r.name} encoding`);const s=t.get(n);if(null==s){const s=r.encode(e).slice(1);return t.set(n,s),s}return s}(r,wt(e),t??ke.encoder):function(e,t,r){const{prefix:n}=r,s=t.get(n);if(null==s){const s=r.encode(e);return t.set(n,s),s}return s}(r,wt(e),t??fe.encoder)}const bt=new WeakMap;function wt(e){const t=bt.get(e);if(null==t){const t=new Map;return bt.set(e,t),t}return t}class vt{code;version;multihash;bytes;"/";constructor(e,t,r,n){this.code=t,this.version=e,this.multihash=r,this.bytes=n,this["/"]=n}get asCID(){return this}get byteOffset(){return this.bytes.byteOffset}get byteLength(){return this.bytes.byteLength}toV0(){switch(this.version){case 0:return this;case 1:{const{code:e,multihash:t}=this;if(e!==Et)throw new Error("Cannot convert a non dag-pb CID to CIDv0");if(t.code!==St)throw new Error("Cannot convert non sha2-256 multihash CID to CIDv0");return vt.createV0(t)}default:throw Error(`Can not convert CID version ${this.version} to version 0. This is a bug please report`)}}toV1(){switch(this.version){case 0:{const{code:e,digest:t}=this.multihash,r=at(e,t);return vt.createV1(this.code,r)}case 1:return this;default:throw Error(`Can not convert CID version ${this.version} to version 1. This is a bug please report`)}}equals(e){return vt.equals(this,e)}static equals(e,t){const r=t;return null!=r&&e.code===r.code&&e.version===r.version&&function(e,t){if(e===t)return!0;{const r=t;return e.code===r.code&&e.size===r.size&&r.bytes instanceof Uint8Array&&function(e,t){if(e===t)return!0;if(e.byteLength!==t.byteLength)return!1;for(let r=0;r{const[r,n]=st(e.subarray(t));return t+=n,r};let n=r(),s=Et;if(18===n?(n=0,t=0):s=r(),0!==n&&1!==n)throw new RangeError(`Invalid CID version ${n}`);const o=t,i=r(),a=r(),c=t+a;return{version:n,codec:s,multihashCode:i,digestSize:a,multihashSize:c-o,size:c}}static parse(e,t){const[r,n]=function(e,t){switch(e[0]){case"Q":{const r=t??ke;return[ke.prefix,r.decode(`${ke.prefix}${e}`)]}case ke.prefix:{const r=t??ke;return[ke.prefix,r.decode(e)]}case fe.prefix:{const r=t??fe;return[fe.prefix,r.decode(e)]}default:if(null==t)throw Error("To parse non base32 or base58btc encoded CID multibase decoder must be provided");return[e[0],t.decode(e)]}}(e,t),s=vt.decode(n);if(0===s.version&&"Q"!==e[0])throw Error("Version 0 CID string must not include multibase prefix");return wt(s).set(r,e),s}}const Et=112,St=18;function At(e,t,r){const n=it(e),s=n+it(t),o=new Uint8Array(s+r.byteLength);return ot(e,o,0),ot(t,o,n),o.set(r,s),o}const _t=Symbol.for("@ipld/js-cid/CID"),kt={...l,...r,...c,...e,...t,...s,...o,...i,...a,...n};function It(e,t,r,n){return{name:e,prefix:t,encoder:{name:e,prefix:t,encode:r},decoder:{decode:n}}}const Rt=It("utf8","u",(e=>"u"+new TextDecoder("utf8").decode(e)),(e=>(new TextEncoder).encode(e.substring(1)))),Tt=It("ascii","a",(e=>{let t="a";for(let r=0;r{const t=w((e=e.substring(1)).length);for(let r=0;r4096)return w(e);n+e>t&&(r=w(t),n=0);const s=r.subarray(n,n+=e);return 7&n&&(n=1+(7|n)),s}}();class Lt{len;head;tail;states;constructor(){this.len=0,this.head=new xt(Pt,0,0),this.tail=this.head,this.states=null}_push(e,t,r){return this.tail=this.tail.next=new xt(e,t,r),this.len+=t,this}uint32(e){return this.len+=(this.tail=this.tail.next=new Mt((e>>>=0)<128?1:e<16384?2:e<2097152?3:e<268435456?4:5,e)).len,this}int32(e){return e<0?this._push(Ft,10,q.fromNumber(e)):this.uint32(e)}sint32(e){return this.uint32((e<<1^e>>31)>>>0)}uint64(e){const t=q.fromBigInt(e);return this._push(Ft,t.length(),t)}uint64Number(e){return this._push(N,C(e),e)}uint64String(e){return this.uint64(BigInt(e))}int64(e){return this.uint64(e)}int64Number(e){return this.uint64Number(e)}int64String(e){return this.uint64String(e)}sint64(e){const t=q.fromBigInt(e).zzEncode();return this._push(Ft,t.length(),t)}sint64Number(e){const t=q.fromNumber(e).zzEncode();return this._push(Ft,t.length(),t)}sint64String(e){return this.sint64(BigInt(e))}bool(e){return this._push(Bt,1,e?1:0)}fixed32(e){return this._push($t,4,e>>>0)}sfixed32(e){return this.fixed32(e)}fixed64(e){const t=q.fromBigInt(e);return this._push($t,4,t.lo)._push($t,4,t.hi)}fixed64Number(e){const t=q.fromNumber(e);return this._push($t,4,t.lo)._push($t,4,t.hi)}fixed64String(e){return this.fixed64(BigInt(e))}sfixed64(e){return this.fixed64(e)}sfixed64Number(e){return this.fixed64Number(e)}sfixed64String(e){return this.fixed64String(e)}float(e){return this._push(B,4,e)}double(e){return this._push(F,8,e)}bytes(e){const t=e.length>>>0;return 0===t?this._push(Bt,1,0):this.uint32(t)._push(Ht,t,e)}string(e){const t=function(e){let t=0,r=0;for(let n=0;n127;)t[r++]=127&e|128,e>>>=7;t[r]=e}class Mt extends xt{next;constructor(e,t){super(Ut,e,t),this.next=void 0}}function Ft(e,t,r){for(;0!==e.hi;)t[r++]=127&e.lo|128,e.lo=(e.lo>>>7|e.hi<<25)>>>0,e.hi>>>=7;for(;e.lo>127;)t[r++]=127&e.lo|128,e.lo=e.lo>>>7;t[r++]=e.lo}function $t(e,t,r){t[r]=255&e,t[r+1]=e>>>8&255,t[r+2]=e>>>16&255,t[r+3]=e>>>24}function Ht(e,t,r){t.set(e,r)}function qt(e,t,r){t.set(e,r)}function Vt(e,t,r){e.length<40?K(e,t,r):null!=t.utf8Write?t.utf8Write(e,r):t.set(Nt(e),r)}function jt(e,t){const r=new Lt;return t.encode(e,r,{lengthDelimited:!1}),r.finish()}var Kt,zt,Gt,Wt,Yt,Jt,Xt,Qt,Zt,er,tr,rr,nr,sr,or,ir,ar,cr,lr,ur,hr,dr,pr,fr,gr,yr,mr,br,wr,vr;function Er(e,t,r,n){return{name:e,type:t,encode:r,decode:n}}function Sr(e){function t(t){if(null==e[t.toString()])throw new Error("Invalid enum value");return e[t]}return Er("enum",Kt.VARINT,(function(e,r){const n=t(e);r.int32(n)}),(function(e){return t(e.int32())}))}function Ar(e,t){return Er("message",Kt.LENGTH_DELIMITED,e,t)}null!=globalThis.Buffer&&(Lt.prototype.bytes=function(e){const t=e.length>>>0;return this.uint32(t),t>0&&this._push(qt,t,e),this},Lt.prototype.string=function(e){const t=globalThis.Buffer.byteLength(e);return this.uint32(t),t>0&&this._push(Vt,t,e),this}),function(e){e[e.VARINT=0]="VARINT",e[e.BIT64=1]="BIT64",e[e.LENGTH_DELIMITED=2]="LENGTH_DELIMITED",e[e.START_GROUP=3]="START_GROUP",e[e.END_GROUP=4]="END_GROUP",e[e.BIT32=5]="BIT32"}(Kt||(Kt={})),Error;class _r extends Error{code="ERR_MAX_LENGTH";name="MaxLengthError"}function kr(e){return Boolean(e)}function Ir(e){const t=new Map;return e.forEach((e=>{let r=t.get(e.contentTopic);r||(t.set(e.contentTopic,[]),r=t.get(e.contentTopic)),r.push(e)})),t}function Rr(e){return new Promise((t=>{setTimeout(t,e)}))}!function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.proof&&e.proof.byteLength>0&&(t.uint32(10),t.bytes(e.proof)),null!=e.merkleRoot&&e.merkleRoot.byteLength>0&&(t.uint32(18),t.bytes(e.merkleRoot)),null!=e.epoch&&e.epoch.byteLength>0&&(t.uint32(26),t.bytes(e.epoch)),null!=e.shareX&&e.shareX.byteLength>0&&(t.uint32(34),t.bytes(e.shareX)),null!=e.shareY&&e.shareY.byteLength>0&&(t.uint32(42),t.bytes(e.shareY)),null!=e.nullifier&&e.nullifier.byteLength>0&&(t.uint32(50),t.bytes(e.nullifier)),null!=e.rlnIdentifier&&e.rlnIdentifier.byteLength>0&&(t.uint32(58),t.bytes(e.rlnIdentifier)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={proof:b(0),merkleRoot:b(0),epoch:b(0),shareX:b(0),shareY:b(0),nullifier:b(0),rlnIdentifier:b(0)},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.proof=e.bytes();break;case 2:n.merkleRoot=e.bytes();break;case 3:n.epoch=e.bytes();break;case 4:n.shareX=e.bytes();break;case 5:n.shareY=e.bytes();break;case 6:n.nullifier=e.bytes();break;case 7:n.rlnIdentifier=e.bytes();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(zt||(zt={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.payload&&e.payload.byteLength>0&&(t.uint32(10),t.bytes(e.payload)),null!=e.contentTopic&&""!==e.contentTopic&&(t.uint32(18),t.string(e.contentTopic)),null!=e.version&&(t.uint32(24),t.uint32(e.version)),null!=e.timestamp&&(t.uint32(80),t.sint64(e.timestamp)),null!=e.meta&&(t.uint32(90),t.bytes(e.meta)),null!=e.rateLimitProof&&(t.uint32(170),zt.codec().encode(e.rateLimitProof,t)),null!=e.ephemeral&&(t.uint32(248),t.bool(e.ephemeral)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={payload:b(0),contentTopic:""},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.payload=e.bytes();break;case 2:n.contentTopic=e.string();break;case 3:n.version=e.uint32();break;case 10:n.timestamp=e.sint64();break;case 11:n.meta=e.bytes();break;case 21:n.rateLimitProof=zt.codec().decode(e,e.uint32(),{limits:r.limits?.rateLimitProof});break;case 31:n.ephemeral=e.bool();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(Gt||(Gt={})),function(e){let t,r;!function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.contentTopic&&""!==e.contentTopic&&(t.uint32(10),t.string(e.contentTopic)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={contentTopic:""},s=null==t?e.len:e.pos+t;for(;e.pos>>3==1?n.contentTopic=e.string():e.skipType(7&t)}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(t=e.ContentFilter||(e.ContentFilter={})),e.codec=()=>(null==r&&(r=Ar(((t,r,n={})=>{if(!1!==n.lengthDelimited&&r.fork(),null!=t.subscribe&&!1!==t.subscribe&&(r.uint32(8),r.bool(t.subscribe)),null!=t.topic&&""!==t.topic&&(r.uint32(18),r.string(t.topic)),null!=t.contentFilters)for(const n of t.contentFilters)r.uint32(26),e.ContentFilter.codec().encode(n,r);!1!==n.lengthDelimited&&r.ldelim()}),((t,r,n={})=>{const s={subscribe:!1,topic:"",contentFilters:[]},o=null==r?t.len:t.pos+r;for(;t.pos>>3){case 1:s.subscribe=t.bool();break;case 2:s.topic=t.string();break;case 3:if(null!=n.limits?.contentFilters&&s.contentFilters.length===n.limits.contentFilters)throw new _r('Decode error - map field "contentFilters" had too many elements');s.contentFilters.push(e.ContentFilter.codec().decode(t,t.uint32(),{limits:n.limits?.contentFilters$}));break;default:t.skipType(7&r)}}return s}))),r),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(Wt||(Wt={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{if(!1!==r.lengthDelimited&&t.fork(),null!=e.messages)for(const r of e.messages)t.uint32(10),Qt.codec().encode(r,t);!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={messages:[]},s=null==t?e.len:e.pos+t;for(;e.pos>>3==1){if(null!=r.limits?.messages&&n.messages.length===r.limits.messages)throw new _r('Decode error - map field "messages" had too many elements');n.messages.push(Qt.codec().decode(e,e.uint32(),{limits:r.limits?.messages$}))}else e.skipType(7&t)}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(Yt||(Yt={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.requestId&&""!==e.requestId&&(t.uint32(10),t.string(e.requestId)),null!=e.request&&(t.uint32(18),Wt.codec().encode(e.request,t)),null!=e.push&&(t.uint32(26),Yt.codec().encode(e.push,t)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={requestId:""},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.requestId=e.string();break;case 2:n.request=Wt.codec().decode(e,e.uint32(),{limits:r.limits?.request});break;case 3:n.push=Yt.codec().decode(e,e.uint32(),{limits:r.limits?.push});break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(Jt||(Jt={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.proof&&e.proof.byteLength>0&&(t.uint32(10),t.bytes(e.proof)),null!=e.merkleRoot&&e.merkleRoot.byteLength>0&&(t.uint32(18),t.bytes(e.merkleRoot)),null!=e.epoch&&e.epoch.byteLength>0&&(t.uint32(26),t.bytes(e.epoch)),null!=e.shareX&&e.shareX.byteLength>0&&(t.uint32(34),t.bytes(e.shareX)),null!=e.shareY&&e.shareY.byteLength>0&&(t.uint32(42),t.bytes(e.shareY)),null!=e.nullifier&&e.nullifier.byteLength>0&&(t.uint32(50),t.bytes(e.nullifier)),null!=e.rlnIdentifier&&e.rlnIdentifier.byteLength>0&&(t.uint32(58),t.bytes(e.rlnIdentifier)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={proof:b(0),merkleRoot:b(0),epoch:b(0),shareX:b(0),shareY:b(0),nullifier:b(0),rlnIdentifier:b(0)},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.proof=e.bytes();break;case 2:n.merkleRoot=e.bytes();break;case 3:n.epoch=e.bytes();break;case 4:n.shareX=e.bytes();break;case 5:n.shareY=e.bytes();break;case 6:n.nullifier=e.bytes();break;case 7:n.rlnIdentifier=e.bytes();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(Xt||(Xt={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.payload&&e.payload.byteLength>0&&(t.uint32(10),t.bytes(e.payload)),null!=e.contentTopic&&""!==e.contentTopic&&(t.uint32(18),t.string(e.contentTopic)),null!=e.version&&(t.uint32(24),t.uint32(e.version)),null!=e.timestamp&&(t.uint32(80),t.sint64(e.timestamp)),null!=e.meta&&(t.uint32(90),t.bytes(e.meta)),null!=e.rateLimitProof&&(t.uint32(170),Xt.codec().encode(e.rateLimitProof,t)),null!=e.ephemeral&&(t.uint32(248),t.bool(e.ephemeral)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={payload:b(0),contentTopic:""},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.payload=e.bytes();break;case 2:n.contentTopic=e.string();break;case 3:n.version=e.uint32();break;case 10:n.timestamp=e.sint64();break;case 11:n.meta=e.bytes();break;case 21:n.rateLimitProof=Xt.codec().decode(e,e.uint32(),{limits:r.limits?.rateLimitProof});break;case 31:n.ephemeral=e.bool();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(Qt||(Qt={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.contentTopic&&""!==e.contentTopic&&(t.uint32(18),t.string(e.contentTopic)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={contentTopic:""},s=null==t?e.len:e.pos+t;for(;e.pos>>3==2?n.contentTopic=e.string():e.skipType(7&t)}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(Zt||(Zt={})),function(e){let t,r,n;!function(e){e.SUBSCRIBER_PING="SUBSCRIBER_PING",e.SUBSCRIBE="SUBSCRIBE",e.UNSUBSCRIBE="UNSUBSCRIBE",e.UNSUBSCRIBE_ALL="UNSUBSCRIBE_ALL"}(t=e.FilterSubscribeType||(e.FilterSubscribeType={})),function(e){e[e.SUBSCRIBER_PING=0]="SUBSCRIBER_PING",e[e.SUBSCRIBE=1]="SUBSCRIBE",e[e.UNSUBSCRIBE=2]="UNSUBSCRIBE",e[e.UNSUBSCRIBE_ALL=3]="UNSUBSCRIBE_ALL"}(r||(r={})),function(e){e.codec=()=>Sr(r)}(t=e.FilterSubscribeType||(e.FilterSubscribeType={})),e.codec=()=>(null==n&&(n=Ar(((t,n,s={})=>{if(!1!==s.lengthDelimited&&n.fork(),null!=t.requestId&&""!==t.requestId&&(n.uint32(10),n.string(t.requestId)),null!=t.filterSubscribeType&&0!==r[t.filterSubscribeType]&&(n.uint32(16),e.FilterSubscribeType.codec().encode(t.filterSubscribeType,n)),null!=t.pubsubTopic&&(n.uint32(82),n.string(t.pubsubTopic)),null!=t.contentTopics)for(const e of t.contentTopics)n.uint32(90),n.string(e);!1!==s.lengthDelimited&&n.ldelim()}),((r,n,s={})=>{const o={requestId:"",filterSubscribeType:t.SUBSCRIBER_PING,contentTopics:[]},i=null==n?r.len:r.pos+n;for(;r.pos>>3){case 1:o.requestId=r.string();break;case 2:o.filterSubscribeType=e.FilterSubscribeType.codec().decode(r);break;case 10:o.pubsubTopic=r.string();break;case 11:if(null!=s.limits?.contentTopics&&o.contentTopics.length===s.limits.contentTopics)throw new _r('Decode error - map field "contentTopics" had too many elements');o.contentTopics.push(r.string());break;default:r.skipType(7&t)}}return o}))),n),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(er||(er={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.requestId&&""!==e.requestId&&(t.uint32(10),t.string(e.requestId)),null!=e.statusCode&&0!==e.statusCode&&(t.uint32(80),t.uint32(e.statusCode)),null!=e.statusDesc&&(t.uint32(90),t.string(e.statusDesc)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={requestId:"",statusCode:0},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.requestId=e.string();break;case 10:n.statusCode=e.uint32();break;case 11:n.statusDesc=e.string();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(tr||(tr={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.wakuMessage&&(t.uint32(10),sr.codec().encode(e.wakuMessage,t)),null!=e.pubsubTopic&&(t.uint32(18),t.string(e.pubsubTopic)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.wakuMessage=sr.codec().decode(e,e.uint32(),{limits:r.limits?.wakuMessage});break;case 2:n.pubsubTopic=e.string();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(rr||(rr={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.proof&&e.proof.byteLength>0&&(t.uint32(10),t.bytes(e.proof)),null!=e.merkleRoot&&e.merkleRoot.byteLength>0&&(t.uint32(18),t.bytes(e.merkleRoot)),null!=e.epoch&&e.epoch.byteLength>0&&(t.uint32(26),t.bytes(e.epoch)),null!=e.shareX&&e.shareX.byteLength>0&&(t.uint32(34),t.bytes(e.shareX)),null!=e.shareY&&e.shareY.byteLength>0&&(t.uint32(42),t.bytes(e.shareY)),null!=e.nullifier&&e.nullifier.byteLength>0&&(t.uint32(50),t.bytes(e.nullifier)),null!=e.rlnIdentifier&&e.rlnIdentifier.byteLength>0&&(t.uint32(58),t.bytes(e.rlnIdentifier)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={proof:b(0),merkleRoot:b(0),epoch:b(0),shareX:b(0),shareY:b(0),nullifier:b(0),rlnIdentifier:b(0)},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.proof=e.bytes();break;case 2:n.merkleRoot=e.bytes();break;case 3:n.epoch=e.bytes();break;case 4:n.shareX=e.bytes();break;case 5:n.shareY=e.bytes();break;case 6:n.nullifier=e.bytes();break;case 7:n.rlnIdentifier=e.bytes();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(nr||(nr={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.payload&&e.payload.byteLength>0&&(t.uint32(10),t.bytes(e.payload)),null!=e.contentTopic&&""!==e.contentTopic&&(t.uint32(18),t.string(e.contentTopic)),null!=e.version&&(t.uint32(24),t.uint32(e.version)),null!=e.timestamp&&(t.uint32(80),t.sint64(e.timestamp)),null!=e.meta&&(t.uint32(90),t.bytes(e.meta)),null!=e.rateLimitProof&&(t.uint32(170),nr.codec().encode(e.rateLimitProof,t)),null!=e.ephemeral&&(t.uint32(248),t.bool(e.ephemeral)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={payload:b(0),contentTopic:""},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.payload=e.bytes();break;case 2:n.contentTopic=e.string();break;case 3:n.version=e.uint32();break;case 10:n.timestamp=e.sint64();break;case 11:n.meta=e.bytes();break;case 21:n.rateLimitProof=nr.codec().decode(e,e.uint32(),{limits:r.limits?.rateLimitProof});break;case 31:n.ephemeral=e.bool();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(sr||(sr={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.pubsubTopic&&""!==e.pubsubTopic&&(t.uint32(10),t.string(e.pubsubTopic)),null!=e.message&&(t.uint32(18),lr.codec().encode(e.message,t)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={pubsubTopic:""},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.pubsubTopic=e.string();break;case 2:n.message=lr.codec().decode(e,e.uint32(),{limits:r.limits?.message});break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(or||(or={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.isSuccess&&!1!==e.isSuccess&&(t.uint32(8),t.bool(e.isSuccess)),null!=e.info&&(t.uint32(18),t.string(e.info)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={isSuccess:!1},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.isSuccess=e.bool();break;case 2:n.info=e.string();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(ir||(ir={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.requestId&&""!==e.requestId&&(t.uint32(10),t.string(e.requestId)),null!=e.request&&(t.uint32(18),or.codec().encode(e.request,t)),null!=e.response&&(t.uint32(26),ir.codec().encode(e.response,t)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={requestId:""},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.requestId=e.string();break;case 2:n.request=or.codec().decode(e,e.uint32(),{limits:r.limits?.request});break;case 3:n.response=ir.codec().decode(e,e.uint32(),{limits:r.limits?.response});break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(ar||(ar={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.proof&&e.proof.byteLength>0&&(t.uint32(10),t.bytes(e.proof)),null!=e.merkleRoot&&e.merkleRoot.byteLength>0&&(t.uint32(18),t.bytes(e.merkleRoot)),null!=e.epoch&&e.epoch.byteLength>0&&(t.uint32(26),t.bytes(e.epoch)),null!=e.shareX&&e.shareX.byteLength>0&&(t.uint32(34),t.bytes(e.shareX)),null!=e.shareY&&e.shareY.byteLength>0&&(t.uint32(42),t.bytes(e.shareY)),null!=e.nullifier&&e.nullifier.byteLength>0&&(t.uint32(50),t.bytes(e.nullifier)),null!=e.rlnIdentifier&&e.rlnIdentifier.byteLength>0&&(t.uint32(58),t.bytes(e.rlnIdentifier)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={proof:b(0),merkleRoot:b(0),epoch:b(0),shareX:b(0),shareY:b(0),nullifier:b(0),rlnIdentifier:b(0)},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.proof=e.bytes();break;case 2:n.merkleRoot=e.bytes();break;case 3:n.epoch=e.bytes();break;case 4:n.shareX=e.bytes();break;case 5:n.shareY=e.bytes();break;case 6:n.nullifier=e.bytes();break;case 7:n.rlnIdentifier=e.bytes();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(cr||(cr={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.payload&&e.payload.byteLength>0&&(t.uint32(10),t.bytes(e.payload)),null!=e.contentTopic&&""!==e.contentTopic&&(t.uint32(18),t.string(e.contentTopic)),null!=e.version&&(t.uint32(24),t.uint32(e.version)),null!=e.timestamp&&(t.uint32(80),t.sint64(e.timestamp)),null!=e.meta&&(t.uint32(90),t.bytes(e.meta)),null!=e.rateLimitProof&&(t.uint32(170),cr.codec().encode(e.rateLimitProof,t)),null!=e.ephemeral&&(t.uint32(248),t.bool(e.ephemeral)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={payload:b(0),contentTopic:""},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.payload=e.bytes();break;case 2:n.contentTopic=e.string();break;case 3:n.version=e.uint32();break;case 10:n.timestamp=e.sint64();break;case 11:n.meta=e.bytes();break;case 21:n.rateLimitProof=cr.codec().decode(e,e.uint32(),{limits:r.limits?.rateLimitProof});break;case 31:n.ephemeral=e.bool();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(lr||(lr={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.messageHash&&(t.uint32(10),t.bytes(e.messageHash)),null!=e.message&&(t.uint32(18),fr.codec().encode(e.message,t)),null!=e.pubsubTopic&&(t.uint32(26),t.string(e.pubsubTopic)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.messageHash=e.bytes();break;case 2:n.message=fr.codec().decode(e,e.uint32(),{limits:r.limits?.message});break;case 3:n.pubsubTopic=e.string();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(ur||(ur={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{if(!1!==r.lengthDelimited&&t.fork(),null!=e.requestId&&""!==e.requestId&&(t.uint32(10),t.string(e.requestId)),null!=e.includeData&&!1!==e.includeData&&(t.uint32(16),t.bool(e.includeData)),null!=e.pubsubTopic&&(t.uint32(82),t.string(e.pubsubTopic)),null!=e.contentTopics)for(const r of e.contentTopics)t.uint32(90),t.string(r);if(null!=e.timeStart&&(t.uint32(96),t.sint64(e.timeStart)),null!=e.timeEnd&&(t.uint32(104),t.sint64(e.timeEnd)),null!=e.messageHashes)for(const r of e.messageHashes)t.uint32(162),t.bytes(r);null!=e.paginationCursor&&(t.uint32(410),t.bytes(e.paginationCursor)),null!=e.paginationForward&&!1!==e.paginationForward&&(t.uint32(416),t.bool(e.paginationForward)),null!=e.paginationLimit&&(t.uint32(424),t.uint64(e.paginationLimit)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={requestId:"",includeData:!1,contentTopics:[],messageHashes:[],paginationForward:!1},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.requestId=e.string();break;case 2:n.includeData=e.bool();break;case 10:n.pubsubTopic=e.string();break;case 11:if(null!=r.limits?.contentTopics&&n.contentTopics.length===r.limits.contentTopics)throw new _r('Decode error - map field "contentTopics" had too many elements');n.contentTopics.push(e.string());break;case 12:n.timeStart=e.sint64();break;case 13:n.timeEnd=e.sint64();break;case 20:if(null!=r.limits?.messageHashes&&n.messageHashes.length===r.limits.messageHashes)throw new _r('Decode error - map field "messageHashes" had too many elements');n.messageHashes.push(e.bytes());break;case 51:n.paginationCursor=e.bytes();break;case 52:n.paginationForward=e.bool();break;case 53:n.paginationLimit=e.uint64();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(hr||(hr={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{if(!1!==r.lengthDelimited&&t.fork(),null!=e.requestId&&""!==e.requestId&&(t.uint32(10),t.string(e.requestId)),null!=e.statusCode&&(t.uint32(80),t.uint32(e.statusCode)),null!=e.statusDesc&&(t.uint32(90),t.string(e.statusDesc)),null!=e.messages)for(const r of e.messages)t.uint32(162),ur.codec().encode(r,t);null!=e.paginationCursor&&(t.uint32(410),t.bytes(e.paginationCursor)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={requestId:"",messages:[]},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.requestId=e.string();break;case 10:n.statusCode=e.uint32();break;case 11:n.statusDesc=e.string();break;case 20:if(null!=r.limits?.messages&&n.messages.length===r.limits.messages)throw new _r('Decode error - map field "messages" had too many elements');n.messages.push(ur.codec().decode(e,e.uint32(),{limits:r.limits?.messages$}));break;case 51:n.paginationCursor=e.bytes();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(dr||(dr={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.proof&&e.proof.byteLength>0&&(t.uint32(10),t.bytes(e.proof)),null!=e.merkleRoot&&e.merkleRoot.byteLength>0&&(t.uint32(18),t.bytes(e.merkleRoot)),null!=e.epoch&&e.epoch.byteLength>0&&(t.uint32(26),t.bytes(e.epoch)),null!=e.shareX&&e.shareX.byteLength>0&&(t.uint32(34),t.bytes(e.shareX)),null!=e.shareY&&e.shareY.byteLength>0&&(t.uint32(42),t.bytes(e.shareY)),null!=e.nullifier&&e.nullifier.byteLength>0&&(t.uint32(50),t.bytes(e.nullifier)),null!=e.rlnIdentifier&&e.rlnIdentifier.byteLength>0&&(t.uint32(58),t.bytes(e.rlnIdentifier)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={proof:b(0),merkleRoot:b(0),epoch:b(0),shareX:b(0),shareY:b(0),nullifier:b(0),rlnIdentifier:b(0)},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.proof=e.bytes();break;case 2:n.merkleRoot=e.bytes();break;case 3:n.epoch=e.bytes();break;case 4:n.shareX=e.bytes();break;case 5:n.shareY=e.bytes();break;case 6:n.nullifier=e.bytes();break;case 7:n.rlnIdentifier=e.bytes();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(pr||(pr={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.payload&&e.payload.byteLength>0&&(t.uint32(10),t.bytes(e.payload)),null!=e.contentTopic&&""!==e.contentTopic&&(t.uint32(18),t.string(e.contentTopic)),null!=e.version&&(t.uint32(24),t.uint32(e.version)),null!=e.timestamp&&(t.uint32(80),t.sint64(e.timestamp)),null!=e.meta&&(t.uint32(90),t.bytes(e.meta)),null!=e.rateLimitProof&&(t.uint32(170),pr.codec().encode(e.rateLimitProof,t)),null!=e.ephemeral&&(t.uint32(248),t.bool(e.ephemeral)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={payload:b(0),contentTopic:""},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.payload=e.bytes();break;case 2:n.contentTopic=e.string();break;case 3:n.version=e.uint32();break;case 10:n.timestamp=e.sint64();break;case 11:n.meta=e.bytes();break;case 21:n.rateLimitProof=pr.codec().decode(e,e.uint32(),{limits:r.limits?.rateLimitProof});break;case 31:n.ephemeral=e.bool();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(fr||(fr={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.enr&&(t.uint32(10),t.bytes(e.enr)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={},s=null==t?e.len:e.pos+t;for(;e.pos>>3==1?n.enr=e.bytes():e.skipType(7&t)}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(gr||(gr={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.numPeers&&(t.uint32(8),t.uint64(e.numPeers)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={},s=null==t?e.len:e.pos+t;for(;e.pos>>3==1?n.numPeers=e.uint64():e.skipType(7&t)}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(yr||(yr={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{if(!1!==r.lengthDelimited&&t.fork(),null!=e.peerInfos)for(const r of e.peerInfos)t.uint32(10),gr.codec().encode(r,t);!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={peerInfos:[]},s=null==t?e.len:e.pos+t;for(;e.pos>>3==1){if(null!=r.limits?.peerInfos&&n.peerInfos.length===r.limits.peerInfos)throw new _r('Decode error - map field "peerInfos" had too many elements');n.peerInfos.push(gr.codec().decode(e,e.uint32(),{limits:r.limits?.peerInfos$}))}else e.skipType(7&t)}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(mr||(mr={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.query&&(t.uint32(10),yr.codec().encode(e.query,t)),null!=e.response&&(t.uint32(18),mr.codec().encode(e.response,t)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.query=yr.codec().decode(e,e.uint32(),{limits:r.limits?.query});break;case 2:n.response=mr.codec().decode(e,e.uint32(),{limits:r.limits?.response});break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(br||(br={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{if(!1!==r.lengthDelimited&&t.fork(),null!=e.clusterId&&(t.uint32(8),t.uint32(e.clusterId)),null!=e.shards)for(const r of e.shards)t.uint32(16),t.uint32(r);!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={shards:[]},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.clusterId=e.uint32();break;case 2:if(null!=r.limits?.shards&&n.shards.length===r.limits.shards)throw new _r('Decode error - map field "shards" had too many elements');n.shards.push(e.uint32());break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(wr||(wr={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{if(!1!==r.lengthDelimited&&t.fork(),null!=e.clusterId&&(t.uint32(8),t.uint32(e.clusterId)),null!=e.shards)for(const r of e.shards)t.uint32(16),t.uint32(r);!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={shards:[]},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.clusterId=e.uint32();break;case 2:if(null!=r.limits?.shards&&n.shards.length===r.limits.shards)throw new _r('Decode error - map field "shards" had too many elements');n.shards.push(e.uint32());break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(vr||(vr={}));function Tr(e){if(!Number.isSafeInteger(e)||e<0)throw new Error(`positive integer expected, not ${e}`)}function Cr(e,...t){if(!((r=e)instanceof Uint8Array||null!=r&&"object"==typeof r&&"Uint8Array"===r.constructor.name))throw new Error("Uint8Array expected");var r;if(t.length>0&&!t.includes(e.length))throw new Error(`Uint8Array expected of length ${t}, not of length=${e.length}`)}function Nr(e){if("function"!=typeof e||"function"!=typeof e.create)throw new Error("Hash should be wrapped by utils.wrapConstructor");Tr(e.outputLen),Tr(e.blockLen)}function xr(e,t=!0){if(e.destroyed)throw new Error("Hash instance has been destroyed");if(t&&e.finished)throw new Error("Hash#digest() has already been called")}const Pr="object"==typeof globalThis&&"crypto"in globalThis?globalThis.crypto:void 0,Or=e=>new DataView(e.buffer,e.byteOffset,e.byteLength),Dr=(e,t)=>e<<32-t|e>>>t;new Uint8Array(new Uint32Array([287454020]).buffer)[0];const Lr=async()=>{};async function Br(e,t,r){let n=Date.now();for(let s=0;s=0&&ee().update(Ur(t)).digest(),r=e();return t.outputLen=r.outputLen,t.blockLen=r.blockLen,t.create=()=>e(),t}function Hr(e=32){if(Pr&&"function"==typeof Pr.getRandomValues)return Pr.getRandomValues(new Uint8Array(e));throw new Error("crypto.getRandomValues must be defined")}const qr=(e,t,r)=>e&t^e&r^t&r;class Vr extends Mr{constructor(e,t,r,n){super(),this.blockLen=e,this.outputLen=t,this.padOffset=r,this.isLE=n,this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.buffer=new Uint8Array(e),this.view=Or(this.buffer)}update(e){xr(this);const{view:t,buffer:r,blockLen:n}=this,s=(e=Ur(e)).length;for(let o=0;on-o&&(this.process(r,0),o=0);for(let e=o;e>s&o),a=Number(r&o),c=n?4:0,l=n?0:4;e.setUint32(t+c,i,n),e.setUint32(t+l,a,n)}(r,n-8,BigInt(8*this.length),s),this.process(r,0);const i=Or(e),a=this.outputLen;if(a%4)throw new Error("_sha2: outputLen should be aligned to 32bit");const c=a/4,l=this.get();if(c>l.length)throw new Error("_sha2: outputLen bigger than state");for(let e=0;e>>3,s=Dr(r,17)^Dr(r,19)^r>>>10;zr[e]=s+zr[e-7]+n+zr[e-16]|0}let{A:r,B:n,C:s,D:o,E:i,F:a,G:c,H:l}=this;for(let e=0;e<64;e++){const t=l+(Dr(i,6)^Dr(i,11)^Dr(i,25))+((u=i)&a^~u&c)+jr[e]+zr[e]|0,h=(Dr(r,2)^Dr(r,13)^Dr(r,22))+qr(r,n,s)|0;l=c,c=a,a=i,i=o+t|0,o=s,s=n,n=r,r=t+h|0}var u;r=r+this.A|0,n=n+this.B|0,s=s+this.C|0,o=o+this.D|0,i=i+this.E|0,a=a+this.F|0,c=c+this.G|0,l=l+this.H|0,this.set(r,n,s,o,i,a,c,l)}roundClean(){zr.fill(0)}destroy(){this.set(0,0,0,0,0,0,0,0),this.buffer.fill(0)}}const Wr=$r((()=>new Gr));var Yr,Jr,Xr,Qr,Zr;!function(e){e.Relay="relay",e.Store="store",e.LightPush="lightpush",e.Filter="filter"}(Yr||(Yr={})),function(e){e.GENERIC_FAIL="Generic error",e.ENCODE_FAILED="Failed to encode",e.DECODE_FAILED="Failed to decode",e.EMPTY_PAYLOAD="Payload is empty",e.SIZE_TOO_BIG="Size is too big",e.TOPIC_NOT_CONFIGURED="Topic not configured",e.TOPIC_DECODER_MISMATCH="Topic decoder mismatch",e.INVALID_DECODER_TOPICS="Invalid decoder topics",e.NO_PEER_AVAILABLE="No peer available",e.NO_STREAM_AVAILABLE="No stream available",e.NO_RESPONSE="No response received",e.REMOTE_PEER_REJECTED="Remote peer rejected",e.REQUEST_TIMEOUT="Request timeout",e.RLN_IDENTITY_MISSING="Identity credentials are not set",e.RLN_MEMBERSHIP_INDEX="Membership index is not set",e.RLN_LIMIT_MISSING="User message limit is not set",e.RLN_PROOF_GENERATION="Proof generation failed"}(Jr||(Jr={})),function(e){e.BOOTSTRAP="bootstrap",e.PEER_EXCHANGE="peer-exchange",e.LOCAL="local-peer-cache"}(Xr||(Xr={})),function(e){e.PEER_DISCOVERY_BOOTSTRAP="peer:discovery:bootstrap",e.PEER_DISCOVERY_PEER_EXCHANGE="peer:discovery:peer-exchange",e.PEER_CONNECT_BOOTSTRAP="peer:connected:bootstrap",e.PEER_CONNECT_PEER_EXCHANGE="peer:connected:peer-exchange"}(Qr||(Qr={})),function(e){e.CONNECTION_STATUS="waku:connection"}(Zr||(Zr={}));const en="@waku/bootstrap",tn=1,rn={clusterId:tn,shards:[0,1,2,3,4,5,6,7,8]};var nn;function sn(e,t="utf8"){const r=Ct[t];if(null==r)throw new Error(`Unsupported encoding "${t}"`);return r.encoder.encode(e).substring(1)}function on(e){return"string"==typeof e?Nt(e.replace(/^0x/i,"").toLowerCase(),"base16"):e}!function(e){e.Unhealthy="Unhealthy",e.MinimallyHealthy="MinimallyHealthy",e.SufficientlyHealthy="SufficientlyHealthy"}(nn||(nn={}));const an=e=>sn(e,"base16"),cn=e=>sn(e,"utf8"),ln=e=>Nt(e,"utf8");function un(e,t){const r=t??e.reduce(((e,t)=>e+t.length),0),n=new Uint8Array(r);let s=0;for(const t of e)n.set(t,s),s+=t.length;return n}const hn=e=>{if(void 0===e.shard)throw new Error("Invalid shard");return`/waku/2/rs/${e.clusterId??tn}/${e.shard}`},dn=e=>{if("contentTopics"in e&&e.contentTopics)return Array.from(new Set(e.contentTopics.map((t=>yn(t,e.clusterId)))));if("shards"in e){if(void 0===e.shards)throw new Error("Invalid shard");return Array.from(new Set(e.shards.map((t=>`/waku/2/rs/${e.clusterId??tn}/${t}`))))}if("application"in e&&"version"in e)return[yn(`/${e.application}/${e.version}/default/default`,e.clusterId)];throw new Error("Missing required configuration in shard parameters")},pn=e=>{const t=e.split("/");if(6!=t.length||"waku"!==t[1]||"2"!==t[2]||"rs"!==t[3])throw new Error("Invalid pubsub topic");const r=parseInt(t[4]),n=parseInt(t[5]);if(isNaN(r)||isNaN(n))throw new Error("Invalid clusterId or shard");return{clusterId:r,shard:n}},fn=e=>{const t=new Set,r=new Set;for(const n of e){const{clusterId:e,shard:s}=pn(n);t.add(`${e}:${s}`),r.add(e)}if(0===t.size)throw new Error("No valid pubsub topics provided");if(r.size>1)throw new Error("Pubsub topics from multiple cluster IDs are not supported");return{clusterId:r.values().next().value,shards:Array.from(t).map((e=>parseInt(e.split(":")[1])))}};function gn(e,t){if(!t.includes(e))throw new Error(`Pubsub topic ${e} has not been configured on this instance. Configured topics are: ${t}. Please update your configuration by passing in the topic during Waku node instantiation.`)}function yn(e,t=tn,r=8){if(!e)throw Error("Content topic must be specified");return`/waku/2/rs/${t}/${function(e,t=8){const{application:r,version:n}=function(e){const t=e.split("/");if(t.length<5||t.length>6)throw Error("Content topic format is invalid");let r=0;if(6==t.length){if(r=parseInt(t[1]),isNaN(r))throw new Error("Invalid generation field in content topic");if(r>0)throw new Error("Generation greater than 0 is not supported")}const n=t.splice(-4);if(0==n[0].length)throw new Error("Application field cannot be empty");if(0==n[1].length)throw new Error("Version field cannot be empty");if(0==n[2].length)throw new Error("Topic name field cannot be empty");if(0==n[3].length)throw new Error("Encoding field cannot be empty");return{generation:r,application:n[0],version:n[1],topicName:n[2],encoding:n[3]}}(e),s=Wr(un([ln(r),ln(n)])),o=new DataView(s.buffer.slice(-8));return Number(o.getBigUint64(0,!1)%BigInt(t))}(e,r)}`}function mn(e,t){return"string"==typeof t?t:void 0!==t?.shard?hn(t):yn(e,t?.clusterId??tn)}const bn=e=>{if((e=new Uint8Array(e)).length<3)throw new Error("Insufficient data");const t=new DataView(e.buffer),r=t.getUint16(0),n=[];if(130===e.length)for(let e=0;e<1024;e++){const r=Math.floor(e/8)+2,s=7-e%8;t.getUint8(r)&1<=e.length)throw new Error("Unexpected end of data");n.push(t.getUint16(o))}}return{clusterId:r,shards:n}},wn=e=>{const{clusterId:t,shards:r}=e,n=r.length>=64?130:3+2*r.length,s=new ArrayBuffer(n),o=new DataView(s);if(o.setUint16(0,t),r.length>=64)for(const e of r){const t=Math.floor(e/8)+2,r=7-e%8;o.setUint8(t,o.getUint8(t)|1<setTimeout(t,e)))}var En=__webpack_require__(7833);const Sn="waku";class An{_info;_warn;_error;static createDebugNamespace(e,t){return t?`${Sn}:${e}:${t}`:`${Sn}:${e}`}constructor(e){this._info=En(An.createDebugNamespace("info",e)),this._warn=En(An.createDebugNamespace("warn",e)),this._error=En(An.createDebugNamespace("error",e))}get info(){return this._info}get warn(){return this._warn}get error(){return this._error}log(e,...t){(0,this[e])(...t)}}const _n=new An("message:version-0"),kn=BigInt(1e6);class In{pubsubTopic;proto;constructor(e,t){this.pubsubTopic=e,this.proto=t}get ephemeral(){return Boolean(this.proto.ephemeral)}get payload(){return this.proto.payload}get contentTopic(){return this.proto.contentTopic}get _rawTimestamp(){return this.proto.timestamp}get timestamp(){try{if(this.proto.timestamp){const e=this.proto.timestamp/kn;return new Date(Number(e))}return}catch(e){return}}get meta(){return this.proto.meta}get version(){return this.proto.version??0}get rateLimitProof(){return this.proto.rateLimitProof}}class Rn{contentTopic;ephemeral;pubsubTopic;metaSetter;constructor(e,t=!1,r,n){if(this.contentTopic=e,this.ephemeral=t,this.pubsubTopic=r,this.metaSetter=n,!e||""===e)throw new Error("Content topic must be specified")}async toWire(e){return Gt.encode(await this.toProtoObj(e))}async toProtoObj(e){const t=e.timestamp??new Date,r={payload:e.payload,version:0,contentTopic:this.contentTopic,timestamp:BigInt(t.valueOf())*kn,meta:void 0,rateLimitProof:e.rateLimitProof,ephemeral:this.ephemeral};if(this.metaSetter){const e=this.metaSetter(r);return{...r,meta:e}}return r}}function Tn({pubsubTopic:e,pubsubTopicShardInfo:t,contentTopic:r,ephemeral:n,metaSetter:s}){return new Rn(r,n,mn(r,e??t),s)}class Cn{pubsubTopic;contentTopic;constructor(e,t){if(this.pubsubTopic=e,this.contentTopic=t,!t||""===t)throw new Error("Content topic must be specified")}fromWireToProtoObj(e){const t=Gt.decode(e);return Promise.resolve({payload:t.payload,contentTopic:t.contentTopic,version:t.version??void 0,timestamp:t.timestamp??void 0,meta:t.meta??void 0,rateLimitProof:t.rateLimitProof??void 0,ephemeral:t.ephemeral??!1})}async fromProtoObj(e,t){return t.version?(_n.error("Failed to decode due to incorrect version, expected:",0,", actual:",t.version),Promise.resolve(void 0)):new In(e,t)}}const Nn=function(e){if(null!=e[Symbol.asyncIterator])return(async()=>{const t=[];for await(const r of e)t.push(r);return t})();const t=[];for(const r of e)t.push(r);return t};function xn(e,t){null==t&&(t=e.reduce(((e,t)=>e+t.length),0));const r=w(t);let n=0;for(const t of e)r.set(t,n),n+=t.length;return r}function Pn(e,t){if(e===t)return!0;if(e.byteLength!==t.byteLength)return!1;for(let r=0;r0&&this.appendAll(e)}*[Symbol.iterator](){yield*this.bufs}get byteLength(){return this.length}append(...e){this.appendAll(e)}appendAll(e){let t=0;for(const r of e)if(r instanceof Uint8Array)t+=r.byteLength,this.bufs.push(r);else{if(!Ln(r))throw new Error("Could not append value, must be an Uint8Array or a Uint8ArrayList");t+=r.byteLength,this.bufs.push(...r.bufs)}this.length+=t}prepend(...e){this.prependAll(e)}prependAll(e){let t=0;for(const r of e.reverse())if(r instanceof Uint8Array)t+=r.byteLength,this.bufs.unshift(r);else{if(!Ln(r))throw new Error("Could not prepend value, must be an Uint8Array or a Uint8ArrayList");t+=r.byteLength,this.bufs.unshift(...r.bufs)}this.length+=t}get(e){const t=Dn(this.bufs,e);return t.buf[t.index]}set(e,t){const r=Dn(this.bufs,e);r.buf[r.index]=t}write(e,t=0){if(e instanceof Uint8Array)for(let r=0;r0;){if(!(e>=this.bufs[0].byteLength)){this.bufs[0]=this.bufs[0].subarray(e),this.length-=e;break}e-=this.bufs[0].byteLength,this.length-=this.bufs[0].byteLength,this.bufs.shift()}}}slice(e,t){const{bufs:r,length:n}=this._subList(e,t);return xn(r,n)}subarray(e,t){const{bufs:r,length:n}=this._subList(e,t);return 1===r.length?r[0]:xn(r,n)}sublist(e,t){const{bufs:r,length:n}=this._subList(e,t),s=new Bn;return s.length=n,s.bufs=[...r],s}_subList(e,t){if(e=e??0,t=t??this.length,e<0&&(e=this.length+e),t<0&&(t=this.length+t),e<0||t>this.length)throw new RangeError("index is out of bounds");if(e===t)return{bufs:[],length:0};if(0===e&&t===this.length)return{bufs:this.bufs,length:this.length};const r=[];let n=0;for(let s=0;s=a)continue;const c=e>=i&&ei&&t<=a;if(c&&l){if(e===i&&t===a){r.push(o);break}const n=e-i;r.push(o.subarray(n,n+(t-e)));break}if(c){if(0===e){r.push(o);continue}r.push(o.subarray(e-i))}else{if(l){if(t===a){r.push(o);break}r.push(o.subarray(0,t-i));break}r.push(o)}}return{bufs:r,length:t-e}}indexOf(e,t=0){if(!(Ln(e)||e instanceof Uint8Array))throw new TypeError('The "value" argument must be a Uint8ArrayList or Uint8Array');const r=e instanceof Uint8Array?e:e.subarray();if(t=Number(t??0),isNaN(t)&&(t=0),t<0&&(t=this.length+t),t<0&&(t=0),0===e.length)return t>this.length?this.length:t;const n=r.byteLength;if(0===n)throw new TypeError("search must be at least 1 byte long");const s=new Int32Array(256);for(let e=0;e<256;e++)s[e]=-1;for(let e=0;e=0;t--){const n=this.get(e+t);if(r[t]!==n){c=Math.max(1,t-o[n]);break}}if(0===c)return e}return-1}getInt8(e){const t=this.subarray(e,e+1);return new DataView(t.buffer,t.byteOffset,t.byteLength).getInt8(0)}setInt8(e,t){const r=w(1);new DataView(r.buffer,r.byteOffset,r.byteLength).setInt8(0,t),this.write(r,e)}getInt16(e,t){const r=this.subarray(e,e+2);return new DataView(r.buffer,r.byteOffset,r.byteLength).getInt16(0,t)}setInt16(e,t,r){const n=b(2);new DataView(n.buffer,n.byteOffset,n.byteLength).setInt16(0,t,r),this.write(n,e)}getInt32(e,t){const r=this.subarray(e,e+4);return new DataView(r.buffer,r.byteOffset,r.byteLength).getInt32(0,t)}setInt32(e,t,r){const n=b(4);new DataView(n.buffer,n.byteOffset,n.byteLength).setInt32(0,t,r),this.write(n,e)}getBigInt64(e,t){const r=this.subarray(e,e+8);return new DataView(r.buffer,r.byteOffset,r.byteLength).getBigInt64(0,t)}setBigInt64(e,t,r){const n=b(8);new DataView(n.buffer,n.byteOffset,n.byteLength).setBigInt64(0,t,r),this.write(n,e)}getUint8(e){const t=this.subarray(e,e+1);return new DataView(t.buffer,t.byteOffset,t.byteLength).getUint8(0)}setUint8(e,t){const r=w(1);new DataView(r.buffer,r.byteOffset,r.byteLength).setUint8(0,t),this.write(r,e)}getUint16(e,t){const r=this.subarray(e,e+2);return new DataView(r.buffer,r.byteOffset,r.byteLength).getUint16(0,t)}setUint16(e,t,r){const n=b(2);new DataView(n.buffer,n.byteOffset,n.byteLength).setUint16(0,t,r),this.write(n,e)}getUint32(e,t){const r=this.subarray(e,e+4);return new DataView(r.buffer,r.byteOffset,r.byteLength).getUint32(0,t)}setUint32(e,t,r){const n=b(4);new DataView(n.buffer,n.byteOffset,n.byteLength).setUint32(0,t,r),this.write(n,e)}getBigUint64(e,t){const r=this.subarray(e,e+8);return new DataView(r.buffer,r.byteOffset,r.byteLength).getBigUint64(0,t)}setBigUint64(e,t,r){const n=b(8);new DataView(n.buffer,n.byteOffset,n.byteLength).setBigUint64(0,t,r),this.write(n,e)}getFloat32(e,t){const r=this.subarray(e,e+4);return new DataView(r.buffer,r.byteOffset,r.byteLength).getFloat32(0,t)}setFloat32(e,t,r){const n=b(4);new DataView(n.buffer,n.byteOffset,n.byteLength).setFloat32(0,t,r),this.write(n,e)}getFloat64(e,t){const r=this.subarray(e,e+8);return new DataView(r.buffer,r.byteOffset,r.byteLength).getFloat64(0,t)}setFloat64(e,t,r){const n=b(8);new DataView(n.buffer,n.byteOffset,n.byteLength).setFloat64(0,t,r),this.write(n,e)}equals(e){if(null==e)return!1;if(!(e instanceof Bn))return!1;if(e.bufs.length!==this.bufs.length)return!1;for(let t=0;te+t.byteLength),0)),r.length=t,r}}function Un(e){return null!=e[Symbol.asyncIterator]}const Mn=e=>{const t=C(e),r=w(t);return P(e,r),Mn.bytes=t,r};function Fn(e,t){const r=(t=t??{}).lengthEncoder??Mn;function*n(e){const t=r(e.byteLength);t instanceof Uint8Array?yield t:yield*t,e instanceof Uint8Array?yield e:yield*e}return Un(e)?async function*(){for await(const t of e)yield*n(t)}():function*(){for(const t of e)yield*n(t)}()}Mn.bytes=0,Fn.single=(e,t)=>{const r=(t=t??{}).lengthEncoder??Mn;return new Bn(r(e.byteLength),e)};class $n extends Error{name="InvalidMessageLengthError";code="ERR_INVALID_MSG_LENGTH"}class Hn extends Error{name="InvalidDataLengthError";code="ERR_MSG_DATA_TOO_LONG"}class qn extends Error{name="InvalidDataLengthLengthError";code="ERR_MSG_LENGTH_TOO_LONG"}class Vn extends Error{name="UnexpectedEOFError";code="ERR_UNEXPECTED_EOF"}var jn;!function(e){e[e.LENGTH=0]="LENGTH",e[e.DATA=1]="DATA"}(jn||(jn={}));const Kn=e=>{const t=O(e);return Kn.bytes=C(t),t};function zn(e,t){const r=new Bn;let n=jn.LENGTH,s=-1;const o=t?.lengthDecoder??Kn,i=t?.maxLengthLength??8,a=t?.maxDataLength??4194304;function*c(){for(;r.byteLength>0;){if(n===jn.LENGTH)try{if(s=o(r),s<0)throw new $n("Invalid message length");if(s>a)throw new Hn("Message length too long");const e=o.bytes;r.consume(e),null!=t?.onLength&&t.onLength(s),n=jn.DATA}catch(e){if(e instanceof RangeError){if(r.byteLength>i)throw new qn("Message length length too long");break}throw e}if(n===jn.DATA){if(r.byteLength0)throw new Vn("Unexpected end of input")}():function*(){for(const t of e)r.append(t),yield*c();if(r.byteLength>0)throw new Vn("Unexpected end of input")}()}function Gn(){const e={};return e.promise=new Promise(((t,r)=>{e.resolve=t,e.reject=r})),e}Kn.bytes=0,zn.fromReader=(e,t)=>{let r=1;return zn(async function*(){for(;;)try{const{done:t,value:n}=await e.next(r);if(!0===t)return;null!=n&&(yield n)}catch(e){if("ERR_UNDER_READ"===e.code)return{done:!0,value:null};throw e}finally{r=1}}(),{...t??{},onLength:e=>{r=e}})};class Wn{buffer;mask;top;btm;next;constructor(e){if(!(e>0)||e-1&e)throw new Error("Max size for a FixedFIFO should be a power of two");this.buffer=new Array(e),this.mask=e-1,this.top=0,this.btm=0,this.next=null}push(e){return void 0===this.buffer[this.top]&&(this.buffer[this.top]=e,this.top=this.top+1&this.mask,!0)}shift(){const e=this.buffer[this.btm];if(void 0!==e)return this.buffer[this.btm]=void 0,this.btm=this.btm+1&this.mask,e}isEmpty(){return void 0===this.buffer[this.btm]}}class Yn{size;hwm;head;tail;constructor(e={}){this.hwm=e.splitLimit??16,this.head=new Wn(this.hwm),this.tail=this.head,this.size=0}calculateSize(e){return null!=e?.byteLength?e.byteLength:1}push(e){if(null!=e?.value&&(this.size+=this.calculateSize(e.value)),!this.head.push(e)){const t=this.head;this.head=t.next=new Wn(2*this.head.buffer.length),this.head.push(e)}}shift(){let e=this.tail.shift();if(void 0===e&&null!=this.tail.next){const t=this.tail.next;this.tail.next=null,this.tail=t,e=this.tail.shift()}return null!=e?.value&&(this.size-=this.calculateSize(e.value)),e}isEmpty(){return this.head.isEmpty()}}class Jn extends Error{type;code;constructor(e,t){super(e??"The operation was aborted"),this.type="aborted",this.code=t??"ABORT_ERR"}}function Xn(e={}){return function(e,t){let r,n,s,o=(t=t??{}).onEnd,i=new Yn,a=Gn();const c=e=>null!=n?n(e):(i.push(e),r),l=e=>{if(s)return r;if(!0!==t?.objectMode&&null==e?.byteLength)throw new Error("objectMode was not true but tried to push non-Uint8Array value");return c({done:!1,value:e})},u=e=>s?r:(s=!0,null!=e?(e=>(i=new Yn,null!=n?n({error:e}):(i.push({error:e}),r)))(e):c({done:!0}));if(r={[Symbol.asyncIterator](){return this},next:async()=>{try{return i.isEmpty()?s?{done:!0}:await new Promise(((t,s)=>{n=o=>{n=null,i.push(o);try{t(e(i))}catch(e){s(e)}return r}})):e(i)}finally{i.isEmpty()&&queueMicrotask((()=>{a.resolve(),a=Gn()}))}},return:()=>(i=new Yn,u(),{done:!0}),throw:e=>(u(e),{done:!0}),push:l,end:u,get readableLength(){return i.size},onEmpty:async e=>{const t=e?.signal;if(t?.throwIfAborted(),i.isEmpty())return;let r,n;null!=t&&(r=new Promise(((e,r)=>{n=()=>{r(new Jn)},t.addEventListener("abort",n)})));try{await Promise.race([a.promise,r])}finally{null!=n&&null!=t&&t?.removeEventListener("abort",n)}}},null==o)return r;const h=r;return r={[Symbol.asyncIterator](){return this},next:()=>h.next(),throw:e=>(h.throw(e),null!=o&&(o(e),o=void 0),{done:!0}),return:()=>(h.return(),null!=o&&(o(),o=void 0),{done:!0}),push:l,end:e=>(h.end(e),null!=o&&(o(e),o=void 0),r),get readableLength(){return h.readableLength},onEmpty:e=>h.onEmpty(e)},r}((e=>{const t=e.shift();if(null==t)return{done:!0};if(null!=t.error)throw t.error;return{done:!0===t.done,value:t.value}}),e)}const Qn=function(...e){const t=[];for(const r of e)null==r[Symbol.asyncIterator]&&t.push(r);return t.length===e.length?function*(){for(const e of t)yield*e}():async function*(){const t=Xn({objectMode:!0});Promise.resolve().then((async()=>{try{await Promise.all(e.map((async e=>{for await(const r of e)t.push(r)}))),t.end()}catch(e){t.end(e)}})),yield*t}()};function Zn(e,...t){if(null==e)throw new Error("Empty pipeline");if(ns(e)){const t=e;e=()=>t.source}else if(rs(e)||ts(e)){const t=e;e=()=>t}const r=[e,...t];if(r.length>1&&ns(r[r.length-1])&&(r[r.length-1]=r[r.length-1].sink),r.length>2)for(let e=1;e{let t;for(;e.length>0;)t=e.shift()(t);return t},ts=e=>null!=e?.[Symbol.asyncIterator],rs=e=>null!=e?.[Symbol.iterator],ns=e=>null!=e&&null!=e.sink&&null!=e.source,ss=e=>t=>{const r=e.sink(t);if(null!=r?.then){const t=Xn({objectMode:!0});let n;r.then((()=>{t.end()}),(e=>{t.end(e)}));const s=e.source;if(ts(s))n=async function*(){yield*s,t.end()};else{if(!rs(s))throw new Error("Unknown duplex source type - must be Iterable or AsyncIterable");n=function*(){yield*s,t.end()}}return Qn(t,n())}return e.source};class os{multicodec;getConnections;addEventListener;streamPool;log;constructor(e,t,r){this.multicodec=e,this.getConnections=t,this.addEventListener=r,this.log=new An(`stream-manager:${e}`),this.streamPool=new Map,this.addEventListener("peer:update",this.handlePeerUpdateStreamPool)}async getStream(e){const t=e.id.toString(),r=this.streamPool.get(t);if(!r)return this.createStream(e);this.streamPool.delete(t),this.prepareStream(e);try{const e=await r;if(e&&"closed"!==e.status)return e}catch(e){this.log.warn(`Failed to get stream for ${t} -- `,e),this.log.warn("Attempting to create a new stream for the peer")}return this.createStream(e)}async createStream(e,t=0){const r=function(e){if(!e.length)return;if(1===e.length)return e[0];let t;return e.forEach((e=>{"open"===e.status&&(t?e.timeline.open>t.timeline.open&&(t=e):t=e)})),t}(this.getConnections(e.id));if(!r)throw new Error("Failed to get a connection to the peer");try{return await r.newStream(this.multicodec)}catch(r){if(t<3){const r=1e3*Math.pow(2,t);return await new Promise((e=>setTimeout(e,r))),this.createStream(e,t+1)}throw new Error(`Failed to create a new stream for ${e.id.toString()} -- `+r)}}prepareStream(e){const t=new Promise((e=>setTimeout(e,5e3))),r=Promise.race([this.createStream(e),t.then((()=>{throw new Error("Connection timeout")}))]).catch((t=>{this.log.error(`Failed to prepare a new stream for ${e.id.toString()} -- `,t)}));this.streamPool.set(e.id.toString(),r)}handlePeerUpdateStreamPool=e=>{const{peer:t}=e.detail;if(t.protocols.includes(this.multicodec))if(this.isConnectedTo(t.id))this.log.info(`Preemptively opening a stream to ${t.id.toString()}`),this.prepareStream(t);else{const e=t.id.toString();this.streamPool.delete(e),this.log.info(`Removed pending stream for disconnected peer ${e}`)}};isConnectedTo(e){return this.getConnections(e).some((e=>"open"===e.status))}}class is{multicodec;components;log;pubsubTopics;addLibp2pEventListener;removeLibp2pEventListener;streamManager;constructor(e,t,r,n){this.multicodec=e,this.components=t,this.log=r,this.pubsubTopics=n,this.addLibp2pEventListener=t.events.addEventListener.bind(t.events),this.removeLibp2pEventListener=t.events.removeEventListener.bind(t.events),this.streamManager=new os(e,t.connectionManager.getConnections.bind(t.connectionManager),this.addLibp2pEventListener)}async getStream(e){return this.streamManager.getStream(e)}get peerStore(){return this.components.peerStore}async allPeers(){return async function(e,t){const r=[];return await e.forEach((e=>{for(let n=0;nthis.components.connectionManager.getConnections(e.id).length>0))}async getPeers({numPeers:e,maxBootstrapPeers:t}={maxBootstrapPeers:1,numPeers:0}){const r=function(e,t,r){let n=e.filter((e=>e.tags.has(Xr.BOOTSTRAP))).slice(0,r);t>0&&t!e.tags.has(Xr.BOOTSTRAP)));if(0===t)return[...n,...s];const o=[...n];for(;o.length0;){const e=Math.floor(Math.random()*s.length),t=s.splice(e,1)[0];o.push(t)}return o}(await async function(e,t,r,n){const s=e.filter((e=>"open"===e.status)).map((async e=>{const s=await t.get(e.remotePeer);if(r.some((e=>s.protocols.includes(e)))){if(!n)return s;{const e=s.metadata.get("shardInfo"),t=e&&bn(e);if(t&&n.clusterId===t.clusterId)return s}}return null}));return(await Promise.all(s)).filter((e=>null!==e))}(this.components.connectionManager.getConnections(),this.peerStore,[this.multicodec],fn(this.pubsubTopics)),e,t),n=await async function(e,t){return 0===t.length?[]:(await Promise.all(t.map((async t=>{try{const r=(await e.get(t.id)).metadata.get("ping");return r?{peer:t,ping:Number(cn(r))}:{peer:t,ping:1/0}}catch(e){return{peer:t,ping:1/0}}})))).filter((e=>null!==e)).sort(((e,t)=>e.ping-t.ping)).map((e=>e.peer))}(this.peerStore,r);return 0===n.length&&this.log.warn("No peers found. Ensure you have a connection to the network."),n.length{ys.error("Failed to register ",ms,e)}))}async subscribe(e,t,r){const n=await this.getStream(t),s=fs.createSubscribeRequest(e,r);let o;try{o=await Zn([s.encode()],Fn,n,zn,(async e=>await Nn(e)))}catch(e){return ys.error("Failed to send subscribe request",e),{success:null,failure:{error:Jr.GENERIC_FAIL,peerId:t.id}}}const{statusCode:i,requestId:a,statusDesc:c}=gs.decode(o[0].slice());return i<200||i>=300?(ys.error(`Filter subscribe request ${a} failed with status code ${i}: ${c}`),{failure:{error:Jr.REMOTE_PEER_REJECTED,peerId:t.id},success:null}):{failure:null,success:t.id}}async unsubscribe(e,t,r){let n;try{n=await this.getStream(t)}catch(e){return ys.error(`Failed to get a stream for remote peer${t.id.toString()}`,e),{success:null,failure:{error:Jr.NO_STREAM_AVAILABLE,peerId:t.id}}}const s=fs.createUnsubscribeRequest(e,r);try{await Zn([s.encode()],Fn,n.sink)}catch(e){return ys.error("Failed to send unsubscribe request",e),{success:null,failure:{error:Jr.GENERIC_FAIL,peerId:t.id}}}return{success:t.id,failure:null}}async unsubscribeAll(e,t){const r=await this.getStream(t),n=fs.createUnsubscribeAllRequest(e),s=await Zn([n.encode()],Fn,r,zn,(async e=>await Nn(e)));if(!s||!s.length)return{failure:{error:Jr.NO_RESPONSE,peerId:t.id},success:null};const{statusCode:o,requestId:i,statusDesc:a}=gs.decode(s[0].slice());return o<200||o>=300?(ys.error(`Filter unsubscribe all request ${i} failed with status code ${o}: ${a}`),{failure:{error:Jr.REMOTE_PEER_REJECTED,peerId:t.id},success:null}):{failure:null,success:t.id}}async ping(e){let t;try{t=await this.getStream(e)}catch(t){return ys.error(`Failed to get a stream for remote peer${e.id.toString()}`,t),{success:null,failure:{error:Jr.NO_STREAM_AVAILABLE,peerId:e.id}}}const r=fs.createSubscriberPingRequest();let n;try{n=await Zn([r.encode()],Fn,t,zn,(async e=>await Nn(e)))}catch(t){return ys.error("Failed to send ping request",t),{success:null,failure:{error:Jr.GENERIC_FAIL,peerId:e.id}}}if(!n||!n.length)return{success:null,failure:{error:Jr.NO_RESPONSE,peerId:e.id}};const{statusCode:s,requestId:o,statusDesc:i}=gs.decode(n[0].slice());return s<200||s>=300?(ys.error(`Filter ping request ${o} failed with status code ${s}: ${i}`),{success:null,failure:{error:Jr.REMOTE_PEER_REJECTED,peerId:e.id}}):{success:e.id,failure:null}}onRequest(e){const{connection:t,stream:r}=e,{remotePeer:n}=t;ys.info(`Received message from ${n.toString()}`);try{Zn(r,zn,(async e=>{for await(const r of e){const e=ps.decode(r.slice()),{pubsubTopic:n,wakuMessage:s}=e;if(!s)return void ys.error("Received empty message");if(!n)return void ys.error("Pubsub topic missing from push message");await this.handleIncomingMessage(n,s,t.remotePeer.toString())}})).then((()=>{ys.info("Receiving pipe closed.")}),(e=>{ys.error("Error with receiving pipe",e)}))}catch(e){ys.error("Error decoding message",e)}}}class ws{proto;constructor(e){this.proto=e}static createRequest(e,t){return new ws({requestId:ds(),request:{message:e,pubsubTopic:t},response:void 0})}static decode(e){const t=ar.decode(e);return new ws(t)}encode(){return ar.encode(this.proto)}get query(){return this.proto.request}get response(){return this.proto.response}}const vs=new An("light-push");class Es extends is{pubsubTopics;constructor(e,t){super("/vac/waku/lightpush/2.0.0-beta1",t.components,vs,e),this.pubsubTopics=e}async preparePushMessage(e,t){try{if(!t.payload||0===t.payload.length)return vs.error("Failed to send waku light push: payload is empty"),{query:null,error:Jr.EMPTY_PAYLOAD};if(!await async function(e,t){const r=await e.toWire(t);return!!r&&(e=>e.length/1048576<=1)(r)}(e,t))return vs.error("Failed to send waku light push: message is bigger than 1MB"),{query:null,error:Jr.SIZE_TOO_BIG};const r=await e.toProtoObj(t);return r?{query:ws.createRequest(r,e.pubsubTopic),error:null}:(vs.error("Failed to encode to protoMessage, aborting push"),{query:null,error:Jr.ENCODE_FAILED})}catch(e){return vs.error("Failed to prepare push message",e),{query:null,error:Jr.GENERIC_FAIL}}}async send(e,t,r){const{query:n,error:s}=await this.preparePushMessage(e,t);if(s||!n)return{success:null,failure:{error:s,peerId:r.id}};let o,i;try{o=await this.getStream(r)}catch(e){return vs.error("Failed to get stream",e),{success:null,failure:{error:Jr.NO_STREAM_AVAILABLE,peerId:r.id}}}try{i=await Zn([n.encode()],Fn,o,zn,(async e=>await Nn(e)))}catch(e){return vs.error("Failed to send waku light push request",e),{success:null,failure:{error:Jr.GENERIC_FAIL,peerId:r.id}}}const a=new Bn;let c;i.forEach((e=>{a.append(e)}));try{c=ws.decode(a).response}catch(e){return vs.error("Failed to decode push reply",e),{success:null,failure:{error:Jr.DECODE_FAILED,peerId:r.id}}}if(!c)return vs.error("Remote peer fault: No response in PushRPC"),{success:null,failure:{error:Jr.NO_RESPONSE,peerId:r.id}};if((l=c.info)&&l.includes("could not generate rln-v2 proof")){const e=(e=>{const t={[Jr.RLN_IDENTITY_MISSING]:Jr.RLN_IDENTITY_MISSING,[Jr.RLN_MEMBERSHIP_INDEX]:Jr.RLN_MEMBERSHIP_INDEX,[Jr.RLN_LIMIT_MISSING]:Jr.RLN_LIMIT_MISSING},r=e.toLowerCase();for(const e in t)if(r.includes(e.toLowerCase()))return t[e];return Jr.RLN_PROOF_GENERATION})(c.info);return vs.error("Remote peer rejected the message: ",e),{success:null,failure:{error:e,peerId:r.id}}}var l;return c.isSuccess?{success:r.id,failure:null}:(vs.error("Remote peer rejected the message: ",c.info),{success:null,failure:{error:Jr.REMOTE_PEER_REJECTED,peerId:r.id}})}}const Ss={payload:new Uint8Array,contentTopic:"",version:void 0,timestamp:void 0,meta:void 0,rateLimitProof:void 0,ephemeral:void 0},As=1e6;class _s{proto;constructor(e){this.proto=e}static create(e){const t=new _s({...e,requestId:ds(),timeStart:e.timeStart?BigInt(e.timeStart.getTime()*As):void 0,timeEnd:e.timeEnd?BigInt(e.timeEnd.getTime()*As):void 0,messageHashes:e.messageHashes||[],paginationLimit:e.paginationLimit?BigInt(e.paginationLimit):void 0});if(e.pubsubTopic&&!e.contentTopics||!e.pubsubTopic&&e.contentTopics)throw new Error("Both pubsubTopic and contentTopics must be set or unset");if(e.messageHashes&&(e.pubsubTopic||e.contentTopics||e.timeStart||e.timeEnd))throw new Error("Message hash lookup queries cannot include content filter criteria");return t}static decode(e){const t=hr.decode(e);return new _s(t)}encode(){return hr.encode(this.proto)}}class ks{proto;constructor(e){this.proto=e}static decode(e){const t=dr.decode(e);return new ks(t)}encode(){return dr.encode(this.proto)}get statusCode(){return this.proto.statusCode}get statusDesc(){return this.proto.statusDesc}get messages(){return this.proto.messages}get paginationCursor(){return this.proto.paginationCursor}}const Is=new An("store");class Rs extends is{pubsubTopics;constructor(e,t){super("/vac/waku/store-query/3.0.0",t.components,Is,e),this.pubsubTopics=e}async*queryPerPage(e,t,r){if(e.contentTopics.toString()!==Array.from(t.keys()).toString())throw new Error("Internal error, the decoders should match the query's content topics");let n=e.paginationCursor;for(;;){const s=_s.create({...e,paginationCursor:n});let o;try{o=await this.getStream(r)}catch(e){Is.error("Failed to get stream",e);break}const i=await Zn([s.encode()],Fn,o,zn,(async e=>await Nn(e))),a=new Bn;i.forEach((e=>{a.append(e)}));const c=ks.decode(a);if(!c.statusCode||c.statusCode>=300){const e=`Store query failed with status code: ${c.statusCode}, description: ${c.statusDesc}`;throw Is.error(e),new Error(e)}if(!c.messages||!c.messages.length){Is.warn("Stopping pagination due to empty messages in response");break}Is.info(`${c.messages.length} messages retrieved from store`);const l=c.messages.map((e=>{if(!e.message)return Promise.resolve(void 0);const r=e.message.contentTopic;if(r){const s=t.get(r);if(s)return s.fromProtoObj(e.pubsubTopic||"",(n=e.message,{...Ss,...n}))}var n;return Promise.resolve(void 0)}));if(yield l,n=e.paginationForward?c.messages[c.messages.length-1].messageHash:c.messages[0].messageHash,c.messages.length>100&&c.messages.length<(e.paginationLimit||20))break}}}class Ts extends Error{constructor(e){super(e),this.name="TimeoutError"}}class Cs extends Error{constructor(e){super(),this.name="AbortError",this.message=e}}const Ns=e=>void 0===globalThis.DOMException?new Cs(e):new DOMException(e),xs=e=>{const t=void 0===e.reason?Ns("This operation was aborted."):e.reason;return t instanceof Error?t:Ns(t)};function Ps(e,t){const{milliseconds:r,fallback:n,message:s,customTimers:o={setTimeout,clearTimeout}}=t;let i;const a=new Promise(((a,c)=>{if("number"!=typeof r||1!==Math.sign(r))throw new TypeError(`Expected \`milliseconds\` to be a positive number, got \`${r}\``);if(t.signal){const{signal:e}=t;e.aborted&&c(xs(e)),e.addEventListener("abort",(()=>{c(xs(e))}))}if(r===Number.POSITIVE_INFINITY)return void e.then(a,c);const l=new Ts;i=o.setTimeout.call(void 0,(()=>{if(n)try{a(n())}catch(e){c(e)}else"function"==typeof e.cancel&&e.cancel(),!1===s?a():s instanceof Error?c(s):(l.message=s??`Promise timed out after ${r} milliseconds`,c(l))}),r),(async()=>{try{a(await e)}catch(e){c(e)}})()})).finally((()=>{a.clear()}));return a.clear=()=>{o.clearTimeout.call(void 0,i),i=void 0},a}const Os=e=>{const t=e.addEventListener||e.on||e.addListener,r=e.removeEventListener||e.off||e.removeListener;if(!t||!r)throw new TypeError("Emitter is not compatible");return{addListener:t.bind(e),removeListener:r.bind(e)}};function Ds(e,t,r){"function"==typeof r&&(r={filter:r});const n=function(e,t,r){let n;const s=new Promise(((s,o)=>{if(!((r={rejectionEvents:["error"],multiArgs:!1,resolveImmediately:!1,...r}).count>=0)||r.count!==Number.POSITIVE_INFINITY&&!Number.isInteger(r.count))throw new TypeError("The `count` option should be at least 0 or more");r.signal?.throwIfAborted();const i=[t].flat(),a=[],{addListener:c,removeListener:l}=Os(e),u=(...e)=>{const t=r.multiArgs?e:e[0];r.filter&&!r.filter(t)||(a.push(t),r.count===a.length&&(n(),s(a)))},h=e=>{n(),o(e)};n=()=>{for(const e of i)l(e,u);for(const e of r.rejectionEvents)l(e,h)};for(const e of i)c(e,u);for(const e of r.rejectionEvents)c(e,h);r.signal&&r.signal.addEventListener("abort",(()=>{h(r.signal.reason)}),{once:!0}),r.resolveImmediately&&s(a)}));if(s.cancel=n,"number"==typeof r.timeout){const e=Ps(s,{milliseconds:r.timeout});return e.cancel=n,e}return s}(e,t,r={...r,count:1,resolveImmediately:!1}),s=n.then((e=>e[0]));return s.cancel=n.cancel,s}const Ls=new An("wait-for-remote-peer");async function Bs(e,t,r){if(t=t??function(e){const t=[];return e.relay&&t.push(Yr.Relay),e.filter&&t.push(Yr.Filter),e.store&&t.push(Yr.Store),e.lightPush&&t.push(Yr.LightPush),t}(e),!e.isStarted())return Promise.reject("Waku node is not started");const n=[];if(t.includes(Yr.Relay)){if(!e.relay)throw new Error("Cannot wait for Relay peer: protocol not mounted");n.push(async function(e){let t=e.getMeshPeers();const r=e.pubsubTopics;for(const n of r)for(;0==t.length;)await Ds(e.gossipSub,"gossipsub:heartbeat"),t=e.getMeshPeers(n)}(e.relay))}if(t.includes(Yr.Store)){if(!e.store)throw new Error("Cannot wait for Store peer: protocol not mounted");n.push(Us(e.store.protocol,e.libp2p.services.metadata))}if(t.includes(Yr.LightPush)){if(!e.lightPush)throw new Error("Cannot wait for LightPush peer: protocol not mounted");n.push(Us(e.lightPush.protocol,e.libp2p.services.metadata))}if(t.includes(Yr.Filter)){if(!e.filter)throw new Error("Cannot wait for Filter peer: protocol not mounted");n.push(Us(e.filter.protocol,e.libp2p.services.metadata))}r?await async function(e,t,r){await Promise.race([e,Ms(t,"Timed out waiting for a remote peer.")])}(Promise.all(n),r):await Promise.all(n)}async function Us(e,t){const r=e.multicodec,n=await e.connectedPeers();if(n.length){if(!t)return void Ls.info(`${r} peer found: `,n[0].id.toString());try{return void await Promise.any(n.map((e=>t.confirmOrAttemptHandshake(e.id))))}catch(e){"ERR_CONNECTION_BEING_CLOSED"===e.code&&Ls.error(`Connection with the peer was closed and possibly because it's on a different shard. Error: ${e}`),Ls.error(`Error waiting for handshake confirmation: ${e}`)}}Ls.info(`Waiting for ${r} peer`),await new Promise((n=>{const s=o=>{o.detail?.protocols?.includes(r)&&(t?t.confirmOrAttemptHandshake(o.detail.peerId).then((()=>{e.removeLibp2pEventListener("peer:identify",s),n()})).catch((e=>{"ERR_CONNECTION_BEING_CLOSED"===e.code&&Ls.error(`Connection with the peer was closed and possibly because it's on a different shard. Error: ${e}`),Ls.error(`Error waiting for handshake confirmation: ${e}`)})):(e.removeLibp2pEventListener("peer:identify",s),n()))};e.addLibp2pEventListener("peer:identify",s)}))}const Ms=(e,t)=>new Promise(((r,n)=>setTimeout((()=>n(t)),e)));class Fs extends EventTarget{#e=new Map;constructor(){super()}listenerCount(e){const t=this.#e.get(e);return null==t?0:t.length}addEventListener(e,t,r){super.addEventListener(e,t,r);let n=this.#e.get(e);null==n&&(n=[],this.#e.set(e,n)),n.push({callback:t,once:(!0!==r&&!1!==r&&r?.once)??!1})}removeEventListener(e,t,r){super.removeEventListener(e.toString(),t??null,r);let n=this.#e.get(e);null!=n&&(n=n.filter((({callback:e})=>e!==t)),this.#e.set(e,n))}dispatchEvent(e){const t=super.dispatchEvent(e);let r=this.#e.get(e.type);return null==r||(r=r.filter((({once:e})=>!e)),this.#e.set(e.type,r)),t}safeDispatchEvent(e,t={}){return this.dispatchEvent(new $s(e,t))}}const $s=globalThis.CustomEvent,Hs=new An("keep-alive");class qs{relay;libp2p;options;pingKeepAliveTimers=new Map;relayKeepAliveTimers=new Map;constructor({options:e,relay:t,libp2p:r}){this.options=e,this.relay=t,this.libp2p=r}start(e){this.stop(e);const{pingKeepAlive:t,relayKeepAlive:r}=this.options,n=e.toString();if(0!==t){const r=setInterval((()=>{(async()=>{let r;try{try{r=await this.libp2p.services.ping.ping(e),Hs.info(`Ping succeeded (${n})`,r)}catch(e){return void Hs.error(`Ping failed for peer (${n}).\n Next ping will be attempted in ${t} seconds.\n `)}try{await this.libp2p.peerStore.merge(e,{metadata:{ping:ln(r.toString())}})}catch(e){Hs.error("Failed to update ping",e)}}catch(e){Hs.error(`Ping failed (${n})`,e)}})()}),1e3*t);this.pingKeepAliveTimers.set(n,r)}const s=this.relay;if(s&&0!==r){const t=this.scheduleRelayPings(s,r,e.toString());this.relayKeepAliveTimers.set(e,t)}}stop(e){const t=e.toString();this.pingKeepAliveTimers.has(t)&&(clearInterval(this.pingKeepAliveTimers.get(t)),this.pingKeepAliveTimers.delete(t)),this.relayKeepAliveTimers.has(e)&&(this.relayKeepAliveTimers.get(e)?.map(clearInterval),this.relayKeepAliveTimers.delete(e))}stopAll(){for(const e of[...Object.values(this.pingKeepAliveTimers),...Object.values(this.relayKeepAliveTimers)])clearInterval(e);this.pingKeepAliveTimers.clear(),this.relayKeepAliveTimers.clear()}connectionsExist(){return this.pingKeepAliveTimers.size>0||this.relayKeepAliveTimers.size>0}scheduleRelayPings(e,t,r){const n=[];for(const s of e.pubsubTopics){if(!e.getMeshPeers(s).includes(r))continue;const o=Tn({pubsubTopicShardInfo:pn(s),contentTopic:"/relay-ping/1/ping/null",ephemeral:!0}),i=setInterval((()=>{Hs.info("Sending Waku Relay ping message"),e.send(o,{payload:new Uint8Array([1])}).catch((e=>Hs.error("Failed to send relay ping",e)))}),1e3*t);n.push(i)}return n}}const Vs=new An("connection-manager");class js extends Fs{configuredPubsubTopics;static instances=new Map;keepAliveManager;options;libp2p;dialAttemptsForPeer=new Map;dialErrorsForPeer=new Map;currentActiveParallelDialCount=0;pendingPeerDialQueue=[];isP2PNetworkConnected=!1;isConnected(){return!(globalThis?.navigator&&!globalThis?.navigator?.onLine)&&this.isP2PNetworkConnected}static create(e,t,r,n,s,o){let i=js.instances.get(e);return i||(i=new js(t,r,n,s,o),js.instances.set(e,i)),i}stop(){this.keepAliveManager.stopAll(),this.libp2p.removeEventListener("peer:connect",this.onEventHandlers["peer:connect"]),this.libp2p.removeEventListener("peer:disconnect",this.onEventHandlers["peer:disconnect"]),this.libp2p.removeEventListener("peer:discovery",this.onEventHandlers["peer:discovery"]),this.stopNetworkStatusListener()}async dropConnection(e){try{this.keepAliveManager.stop(e),await this.libp2p.hangUp(e),Vs.info(`Dropped connection with peer ${e.toString()}`)}catch(t){Vs.error(`Error dropping connection with peer ${e.toString()} - ${t}`)}}async getPeersByDiscovery(){const e=await this.libp2p.peerStore.all(),t=this.libp2p.getConnections().map((e=>e.remotePeer)),r=[],n=[],s=[],o=[],i=[],a=[];for(const t of e){const e=await this.getTagNamesForPeer(t.id);e.includes(Xr.BOOTSTRAP)?r.push(t):e.includes(Xr.PEER_EXCHANGE)?n.push(t):e.includes(Xr.LOCAL)&&s.push(t)}for(const e of t){const t=await this.libp2p.peerStore.get(e),r=await this.getTagNamesForPeer(e);r.includes(Xr.BOOTSTRAP)?o.push(t):r.includes(Xr.PEER_EXCHANGE)?i.push(t):r.includes(Xr.LOCAL)&&a.push(t)}return{DISCOVERED:{[Xr.BOOTSTRAP]:r,[Xr.PEER_EXCHANGE]:n,[Xr.LOCAL]:s},CONNECTED:{[Xr.BOOTSTRAP]:o,[Xr.PEER_EXCHANGE]:i,[Xr.LOCAL]:a}}}constructor(e,t,r,n,s){super(),this.configuredPubsubTopics=r,this.libp2p=e,this.configuredPubsubTopics=r,this.options={maxDialAttemptsForPeer:3,maxBootstrapPeersAllowed:1,maxParallelDials:3,...s},this.keepAliveManager=new qs({relay:n,libp2p:e,options:t}),this.startEventListeners().then((()=>Vs.info("Connection Manager is now running"))).catch((e=>Vs.error("Unexpected error while running service",e))),this.dialPeerStorePeers().catch((e=>Vs.error("Unexpected error while dialing peer store peers",e)))}async dialPeerStorePeers(){const e=await this.libp2p.peerStore.all(),t=[];for(const r of e)this.libp2p.getConnections().find((e=>e.remotePeer===r.id))||t.push(this.attemptDial(r.id));try{await Promise.all(t)}catch(e){Vs.error("Unexpected error while dialing peer store peers",e)}}async startEventListeners(){this.startPeerDiscoveryListener(),this.startPeerConnectionListener(),this.startPeerDisconnectionListener(),this.startNetworkStatusListener()}async dialPeer(e){this.currentActiveParallelDialCount+=1;let t=0;for(;t{e.tags=Array.from(new Set([...e.tags,...r]))})),this.dialAttemptsForPeer.set(e.toString(),-1),this.keepAliveManager.start(e);break}catch(r){r instanceof AggregateError?Vs.error(`Error dialing peer ${e.toString()} - ${r.errors}`):Vs.error(`Error dialing peer ${e.toString()} - ${r.message}`),this.dialErrorsForPeer.set(e.toString(),r),t++,this.dialAttemptsForPeer.set(e.toString(),t)}if(this.currentActiveParallelDialCount--,this.processDialQueue(),t===this.options.maxDialAttemptsForPeer)try{const t=this.dialErrorsForPeer.get(e.toString());if(t){let r;t instanceof AggregateError?t.errors?0===t.errors.length?Vs.warn("Errors array is empty for AggregateError"):r=JSON.stringify(t.errors[0]):Vs.warn("No errors array found for AggregateError"):r=t.message,Vs.info(`Deleting undialable peer ${e.toString()} from peer store. Reason: ${r}`)}this.dialErrorsForPeer.delete(e.toString()),await this.libp2p.peerStore.delete(e),await this.attemptDnsDiscovery()}catch(t){throw new Error(`Error deleting undialable peer ${e.toString()} from peer store - ${t}`)}}async attemptDnsDiscovery(){if(this.libp2p.getConnections().length>0)return;if((await this.libp2p.peerStore.all()).length>0)return;Vs.info("Attempting to trigger DNS discovery.");const e=Object.values(this.libp2p.components.components).find((e=>!(!e||!e.toString)&&e.toString().includes(en)));e&&await e.findPeers()}processDialQueue(){if(this.pendingPeerDialQueue.length>0&&this.currentActiveParallelDialCount{Vs.error(e)}))}}startPeerDiscoveryListener(){this.libp2p.addEventListener("peer:discovery",this.onEventHandlers["peer:discovery"])}startPeerConnectionListener(){this.libp2p.addEventListener("peer:connect",this.onEventHandlers["peer:connect"])}startPeerDisconnectionListener(){this.libp2p.addEventListener("peer:disconnect",this.onEventHandlers["peer:disconnect"])}async attemptDial(e){await this.shouldDialPeer(e)&&(this.currentActiveParallelDialCount>=this.options.maxParallelDials?this.pendingPeerDialQueue.push(e):await this.dialPeer(e))}onEventHandlers={"peer:discovery":e=>{(async()=>{const{id:t}=e.detail;await this.dispatchDiscoveryEvent(t);try{await this.attemptDial(t)}catch(e){Vs.error(`Error dialing peer ${t.toString()} : ${e}`)}})()},"peer:connect":e=>{(async()=>{Vs.info(`Connected to peer ${e.detail.toString()}`);const t=e.detail;this.keepAliveManager.start(t),(await this.getTagNamesForPeer(t)).includes(Xr.BOOTSTRAP)?this.libp2p.getConnections().filter((e=>e.tags.includes(Xr.BOOTSTRAP))).length>this.options.maxBootstrapPeersAllowed?await this.dropConnection(t):this.dispatchEvent(new $s(Qr.PEER_CONNECT_BOOTSTRAP,{detail:t})):this.dispatchEvent(new $s(Qr.PEER_CONNECT_PEER_EXCHANGE,{detail:t})),this.setP2PNetworkConnected()})()},"peer:disconnect":e=>{(async()=>{this.keepAliveManager.stop(e.detail),this.setP2PNetworkDisconnected()})()},"browser:network":()=>{this.dispatchWakuConnectionEvent()}};async shouldDialPeer(e){if(this.libp2p.getConnections(e).length>0)return Vs.warn(`Already connected to peer ${e.toString()}. Not dialing.`),!1;if(!await this.isPeerTopicConfigured(e)){const t=await this.getPeerShardInfo(e,this.libp2p.peerStore);return Vs.warn(`Discovered peer ${e.toString()} with ShardInfo ${t} is not part of any of the configured pubsub topics (${this.configuredPubsubTopics}).\n Not dialing.`),!1}return await this.isPeerDialableBasedOnBootstrapStatus(e)?!this.dialAttemptsForPeer.has(e.toString())||(Vs.warn(`Peer ${e.toString()} has already been attempted dial before, or already has a dial attempt in progress, skipping dial`),!1):(Vs.warn(`Peer ${e.toString()} is not dialable based on bootstrap status. Not dialing.`),!1)}async isPeerDialableBasedOnBootstrapStatus(e){return!(await this.getTagNamesForPeer(e)).some((e=>e===Xr.BOOTSTRAP))||this.libp2p.getConnections().filter((e=>e.tags.find((e=>e===Xr.BOOTSTRAP)))).lengththis.configuredPubsubTopics.includes(e)))}async getPeerShardInfo(e,t){const r=(await t.get(e)).metadata.get("shardInfo");if(r)return bn(r)}startNetworkStatusListener(){try{globalThis.addEventListener("online",this.onEventHandlers["browser:network"]),globalThis.addEventListener("offline",this.onEventHandlers["browser:network"])}catch(e){Vs.error(`Failed to start network listener: ${e}`)}}stopNetworkStatusListener(){try{globalThis.removeEventListener("online",this.onEventHandlers["browser:network"]),globalThis.removeEventListener("offline",this.onEventHandlers["browser:network"])}catch(e){Vs.error(`Failed to stop network listener: ${e}`)}}setP2PNetworkConnected(){this.isP2PNetworkConnected||(this.isP2PNetworkConnected=!0,this.dispatchWakuConnectionEvent())}setP2PNetworkDisconnected(){this.isP2PNetworkConnected&&0===this.libp2p.getConnections().length&&(this.isP2PNetworkConnected=!1,this.dispatchWakuConnectionEvent())}dispatchWakuConnectionEvent(){this.dispatchEvent(new $s(Zr.CONNECTION_STATUS,{detail:this.isConnected()}))}}class Ks{static instance;health;constructor(){this.health={overallStatus:nn.Unhealthy,protocolStatuses:new Map}}static getInstance(){return Ks.instance||(Ks.instance=new Ks),Ks.instance}getHealthStatus(){return this.health.overallStatus}getProtocolStatus(e){return this.health.protocolStatuses.get(e)}updateProtocolHealth(e,t){const r=this.getNameFromMulticodec(e);let n=nn.Unhealthy;1==t?n=nn.MinimallyHealthy:t>=2&&(n=nn.SufficientlyHealthy),this.health.protocolStatuses.set(r,{name:r,status:n,lastUpdate:new Date}),this.updateOverallHealth()}getNameFromMulticodec(e){let t;if(e.includes("filter"))t=Yr.Filter;else if(e.includes("lightpush"))t=Yr.LightPush;else{if(!e.includes("store"))throw new Error(`Unknown protocol: ${e}`);t=Yr.Store}return t}updateOverallHealth(){const e=[Yr.LightPush,Yr.Filter].map((e=>this.getProtocolStatus(e)?.status));e.some((e=>e===nn.Unhealthy))?this.health.overallStatus=nn.Unhealthy:e.some((e=>e===nn.MinimallyHealthy))?this.health.overallStatus=nn.MinimallyHealthy:this.health.overallStatus=nn.SufficientlyHealthy}}const zs=()=>Ks.getInstance(),Gs=new An("metadata"),Ws="/vac/waku/metadata/1.0.0";class Ys extends is{pubsubTopics;libp2pComponents;handshakesConfirmed=new Map;constructor(e,t){super(Ws,t.components,Gs,e),this.pubsubTopics=e,this.libp2pComponents=t,t.registrar.handle(Ws,(e=>{this.onRequest(e)}))}async query(e){const t=wr.encode(fn(this.pubsubTopics)),r=await this.peerStore.get(e);if(!r)return{shardInfo:null,error:Jr.NO_PEER_AVAILABLE};let n;try{n=await this.getStream(r)}catch(o){return Gs.error("Failed to get stream",o),{shardInfo:null,error:Jr.NO_STREAM_AVAILABLE}}const s=await Zn([t],Fn,n,zn,(async e=>await Nn(e))),{error:o,shardInfo:i}=this.decodeMetadataResponse(s);return o?{shardInfo:null,error:o}:(await this.savePeerShardInfo(e,i),{shardInfo:i,error:null})}async confirmOrAttemptHandshake(e){const t=this.handshakesConfirmed.get(e.toString());return t?{shardInfo:t,error:null}:await this.query(e)}async onRequest(e){try{const{stream:t,connection:r}=e,n=vr.encode(fn(this.pubsubTopics)),s=await Zn([n],Fn,t,zn,(async e=>await Nn(e))),{error:o,shardInfo:i}=this.decodeMetadataResponse(s);if(o)return;await this.savePeerShardInfo(r.remotePeer,i)}catch(e){Gs.error("Error handling metadata request",e)}}decodeMetadataResponse(e){const t=new Bn;e.forEach((e=>{t.append(e)}));const r=vr.decode(t);return r?{shardInfo:r,error:null}:(Gs.error("Error decoding metadata response"),{shardInfo:null,error:Jr.DECODE_FAILED})}async savePeerShardInfo(e,t){await this.libp2pComponents.peerStore.merge(e,{metadata:{shardInfo:wn(t)}}),this.handshakesConfirmed.set(e.toString(),t)}}function Js(e){return t=>new Ys(e,t)}const Xs=Symbol.for("@libp2p/peer-id");function Qs(e){return null!=e&&Boolean(e[Xs])}class Zs extends Error{code;type;constructor(e="The operation was aborted"){super(e),this.name="AbortError",this.code=Zs.code,this.type=Zs.type}static code="ABORT_ERR";static type="aborted"}class eo extends Error{code;props;constructor(e,t,r){super(e),this.code=t,this.name=r?.name??"CodeError",this.props=r??{}}}class to extends AggregateError{code;props;constructor(e,t,r,n){super(e,t),this.code=r,this.name=n?.name??"AggregateCodeError",this.props=n??{}}}Error,Error,Error;const ro="ERR_TIMEOUT",no=45,so=15,oo=new class{index=0;input="";new(e){return this.index=0,this.input=e,this}readAtomically(e){const t=this.index,r=e();return void 0===r&&(this.index=t),r}parseWith(e){const t=e();if(this.index===this.input.length)return t}peekChar(){if(!(this.index>=this.input.length))return this.input[this.index]}readChar(){if(!(this.index>=this.input.length))return this.input[this.index++]}readGivenChar(e){return this.readAtomically((()=>{const t=this.readChar();if(t===e)return t}))}readSeparator(e,t,r){return this.readAtomically((()=>{if(!(t>0&&void 0===this.readGivenChar(e)))return r()}))}readNumber(e,t,r,n){return this.readAtomically((()=>{let s=0,o=0;const i=this.peekChar();if(void 0===i)return;const a="0"===i,c=2**(8*n)-1;for(;;){const r=this.readAtomically((()=>{const t=this.readChar();if(void 0===t)return;const r=Number.parseInt(t,e);return Number.isNaN(r)?void 0:r}));if(void 0===r)break;if(s*=e,s+=r,s>c)return;if(o+=1,void 0!==t&&o>t)return}return 0===o||!r&&a&&o>1?void 0:s}))}readIPv4Addr(){return this.readAtomically((()=>{const e=new Uint8Array(4);for(let t=0;tthis.readNumber(10,3,!1,1)));if(void 0===r)return;e[t]=r}return e}))}readIPv6Addr(){const e=e=>{for(let t=0;tthis.readIPv4Addr()));if(void 0!==n)return e[r]=n[0],e[r+1]=n[1],e[r+2]=n[2],e[r+3]=n[3],[r+4,!0]}const n=this.readSeparator(":",t,(()=>this.readNumber(16,4,!0,2)));if(void 0===n)return[r,!1];e[r]=n>>8,e[r+1]=255&n}return[e.length,!1]};return this.readAtomically((()=>{const t=new Uint8Array(16),[r,n]=e(t);if(16===r)return t;if(n)return;if(void 0===this.readGivenChar(":"))return;if(void 0===this.readGivenChar(":"))return;const s=new Uint8Array(14),o=16-(r+2),[i]=e(s.subarray(0,o));return t.set(s.subarray(0,i),16-i),t}))}readIPAddr(){return this.readIPv4Addr()??this.readIPv6Addr()}};function io(e){return Boolean(function(e){if(!(e.length>so))return oo.new(e).parseWith((()=>oo.readIPv4Addr()))}(e))}function ao(e){return Boolean(function(e){if(e.includes("%")&&(e=e.split("%")[0]),!(e.length>no))return oo.new(e).parseWith((()=>oo.readIPv6Addr()))}(e))}function co(e){return Boolean(function(e){if(e.includes("%")&&(e=e.split("%")[0]),!(e.length>no))return oo.new(e).parseWith((()=>oo.readIPAddr()))}(e))}parseInt("0xFFFF",16),new Uint8Array([0,0,0,0,0,0,0,0,0,0,255,255]);const lo=io,uo=ao,ho=function(e){let t=0;if(e=e.toString().trim(),lo(e)){const r=new Uint8Array(t+4);return e.split(/\./g).forEach((e=>{r[t++]=255&parseInt(e,10)})),r}if(uo(e)){const r=e.split(":",8);let n;for(n=0;n0;n--)e.push("0");r.splice.apply(r,e)}const s=new Uint8Array(t+16);for(n=0;n>8&255,s[t++]=255&e}return s}throw new Error("invalid ip address")},po=function(e,t=0,r){t=~~t,r=r??e.length-t;const n=new DataView(e.buffer);if(4===r){const n=[];for(let s=0;s65536)throw new Error("Port number is not in range(1, 65536)");const s=So(n);return xn([r,s],r.length+s.length)}(t);case 445:return function(e){const t=e.split(":");if(2!==t.length)throw new Error(`failed to parse onion addr: ["'${t.join('", "')}'"]' does not contain a port number`);if(56!==t[0].length)throw new Error(`failed to parse onion addr: ${t[0]} not a Tor onion3 address.`);const r=fe.decode(`b${t[0]}`),n=parseInt(t[1],10);if(n<1||n>65536)throw new Error("Port number is not in range(1, 65536)");const s=So(n);return xn([r,s],r.length+s.length)}(t);case 466:return function(e){const t=Eo.decode(e),r=Uint8Array.from(P(t.length));return xn([r,t],r.length+t.length)}(t);case 481:return _o(globalThis.decodeURIComponent(t));default:return Nt(t,"base16")}}[[4,32,"ip4"],[6,16,"tcp"],[33,16,"dccp"],[41,128,"ip6"],[42,fo,"ip6zone"],[43,8,"ipcidr"],[53,fo,"dns",!0],[54,fo,"dns4",!0],[55,fo,"dns6",!0],[56,fo,"dnsaddr",!0],[132,16,"sctp"],[273,16,"udp"],[275,0,"p2p-webrtc-star"],[276,0,"p2p-webrtc-direct"],[277,0,"p2p-stardust"],[280,0,"webrtc-direct"],[281,0,"webrtc"],[290,0,"p2p-circuit"],[301,0,"udt"],[302,0,"utp"],[400,fo,"unix",!1,!0],[421,fo,"ipfs"],[421,fo,"p2p"],[443,0,"https"],[444,96,"onion"],[445,296,"onion3"],[446,fo,"garlic64"],[448,0,"tls"],[449,fo,"sni"],[460,0,"quic"],[461,0,"quic-v1"],[465,0,"webtransport"],[466,fo,"certhash"],[477,0,"ws"],[478,0,"wss"],[479,0,"p2p-websocket-star"],[480,0,"http"],[481,fo,"http-path"],[777,fo,"memory"]].forEach((e=>{const t=function(e,t,r,n,s){return{code:e,size:t,name:r,resolvable:Boolean(n),path:Boolean(s)}}(...e);yo[t.code]=t,go[t.name]=t})),mo("ip4"),mo("ip6"),mo("ipcidr");const vo=Object.values(kt).map((e=>e.decoder)),Eo=function(){let e=vo[0].or(vo[1]);return vo.slice(2).forEach((t=>e=e.or(t))),e}();function So(e){const t=new ArrayBuffer(2);return new DataView(t).setUint16(0,e),new Uint8Array(t)}function Ao(e){return new DataView(e.buffer).getUint16(e.byteOffset)}function _o(e){const t=Nt(e),r=Uint8Array.from(P(t.length));return xn([r,t],r.length+t.length)}function ko(e){const t=O(e);if((e=e.slice(C(t))).length!==t)throw new Error("inconsistent lengths");return sn(e)}function Io(e){const t=[],r=[];let n=null,s=0;for(;se.length)throw xo("Invalid address Uint8Array: "+sn(e,"base16"));t.push([o,l]);const u=bo(o,l);if(r.push([o,u]),!0===a.path){n=u;break}}return{bytes:Uint8Array.from(e),string:Ro(r),tuples:t,stringTuples:r,path:n}}function Ro(e){const t=[];return e.map((e=>{const r=mo(e[0]);return t.push(r.name),e.length>1&&null!=e[1]&&t.push(e[1]),null})),No(t.join("/"))}function To(e){return xn(e.map((e=>{const t=mo(e[0]);let r=Uint8Array.from(P(t.code));return e.length>1&&null!=e[1]&&(r=xn([r,e[1]])),r})))}function Co(e,t){if(e.size>0)return e.size/8;if(0===e.size)return 0;{const e=O(t instanceof Uint8Array?t:Uint8Array.from(t));return e+C(e)}}function No(e){return"/"+e.trim().split("/").filter((e=>e)).join("/")}function xo(e){return new Error("Error parsing address: "+e)}const Po=Symbol.for("nodejs.util.inspect.custom"),Oo=Symbol.for("@multiformats/js-multiaddr/multiaddr"),Do=[mo("dns").code,mo("dns4").code,mo("dns6").code,mo("dnsaddr").code];class Lo{bytes;#t;#r;#n;#s;[Oo]=!0;constructor(e){let t;if(null==e&&(e=""),e instanceof Uint8Array)t=Io(e);else if("string"==typeof e){if(e.length>0&&"/"!==e.charAt(0))throw new Error(`multiaddr "${e}" must start with a "/"`);t=function(e){const t=[],r=[];let n=null;const s=(e=No(e)).split("/").slice(1);if(1===s.length&&""===s[0])return{bytes:new Uint8Array,string:"/",tuples:[],stringTuples:[],path:null};for(let o=0;o=s.length)throw xo("invalid address: "+e);if(!0===i.path){n=No(s.slice(o).join("/")),t.push([i.code,wo(i.code,n)]),r.push([i.code,n]);break}const a=wo(i.code,s[o]);t.push([i.code,a]),r.push([i.code,bo(i.code,a)])}return{string:Ro(r),bytes:To(t),tuples:t,stringTuples:r,path:n}}(e)}else{if(!Uo(e))throw new Error("addr must be a string, Buffer, or another Multiaddr");t=Io(e.bytes)}this.bytes=t.bytes,this.#t=t.string,this.#r=t.tuples,this.#n=t.stringTuples,this.#s=t.path}toString(){return this.#t}toJSON(){return this.toString()}toOptions(){let e,t,r,n,s="";const o=mo("tcp"),i=mo("udp"),a=mo("ip4"),c=mo("ip6"),l=mo("dns6"),u=mo("ip6zone");for(const[h,d]of this.stringTuples())h===u.code&&(s=`%${d??""}`),Do.includes(h)&&(t=o.name,n=443,r=`${d??""}${s}`,e=h===l.code?6:4),h!==o.code&&h!==i.code||(t=mo(h).name,n=parseInt(d??"")),h!==a.code&&h!==c.code||(t=mo(h).name,r=`${d??""}${s}`,e=h===c.code?6:4);if(null==e||null==t||null==r||null==n)throw new Error('multiaddr must have a valid format: "/{ip4, ip6, dns4, dns6, dnsaddr}/{address}/{tcp, udp}/{port}".');return{family:e,host:r,transport:t,port:n}}protos(){return this.#r.map((([e])=>Object.assign({},mo(e))))}protoCodes(){return this.#r.map((([e])=>e))}protoNames(){return this.#r.map((([e])=>mo(e).name))}tuples(){return this.#r}stringTuples(){return this.#n}encapsulate(e){return e=new Lo(e),new Lo(this.toString()+e.toString())}decapsulate(e){const t=e.toString(),r=this.toString(),n=r.lastIndexOf(t);if(n<0)throw new Error(`Address ${this.toString()} does not contain subaddress: ${e.toString()}`);return new Lo(r.slice(0,n))}decapsulateCode(e){const t=this.tuples();for(let r=t.length-1;r>=0;r--)if(t[r][0]===e)return new Lo(To(t.slice(0,r)));return this}getPeerId(){try{let e=[];this.stringTuples().forEach((([t,r])=>{t===go.p2p.code&&e.push([t,r]),t===go["p2p-circuit"].code&&(e=[])}));const t=e.pop();if(null!=t?.[1]){const e=t[1];return"Q"===e[0]||"1"===e[0]?sn(ke.decode(`z${e}`),"base58btc"):sn(vt.parse(e).multihash.bytes,"base58btc")}return null}catch(e){return null}}getPath(){return this.#s}equals(e){return Pn(this.bytes,e.bytes)}async resolve(e){const t=this.protos().find((e=>e.resolvable));if(null==t)return[this];const r=Bo.get(t.name);if(null==r)throw new eo(`no available resolver for ${t.name}`,"ERR_NO_AVAILABLE_RESOLVER");return(await r(this,e)).map((e=>Mo(e)))}nodeAddress(){const e=this.toOptions();if("tcp"!==e.transport&&"udp"!==e.transport)throw new Error(`multiaddr must have a valid format - no protocol with name: "${e.transport}". Must have a valid transport protocol: "{tcp, udp}"`);return{family:e.family,address:e.host,port:e.port}}isThinWaistAddress(e){const t=(e??this).protos();return!(2!==t.length||4!==t[0].code&&41!==t[0].code||6!==t[1].code&&273!==t[1].code)}[Po](){return`Multiaddr(${this.#t})`}}const Bo=new Map;function Uo(e){return Boolean(e?.[Oo])}function Mo(e){return new Lo(e)}function Fo(e,t){const r=ln(e),n=ln(t.contentTopic),s=function(e){if(!e)return;let t;return t="bigint"==typeof e?e:1000000n*BigInt(e.valueOf()),function(e){const t=new ArrayBuffer(8),r=new DataView(t);return"number"==typeof e?r.setFloat64(0,e,!1):r.setBigInt64(0,e,!1),new Uint8Array(t)}(t)}(t.timestamp),o=un([r,t.payload,n,t.meta,s].filter(kr));return Wr(o)}class $o{core;connectionManager;healthManager;numPeersToUse;peers=[];maintainPeersIntervalId=null;log;maintainPeersLock=!1;renewPeersLocker=new Ho(3e4);constructor(e,t,r){this.core=e,this.connectionManager=t,this.log=new An(`sdk:${e.multicodec}`),this.healthManager=zs(),this.numPeersToUse=r?.numPeersToUse??2;const n=r?.maintainPeersInterval??3e4;this.startMaintainPeersInterval(n)}get connectedPeers(){return this.peers}async renewPeer(e){this.log.info(`Renewing peer ${e}`),await this.connectionManager.dropConnection(e);const t=(await this.findAndAddPeers(1))[0];t||this.log.error("Failed to find a new peer to replace the disconnected one.");const r=this.peers.filter((t=>!t.id.equals(e)));return this.updatePeers(r),this.log.info(`Peer ${e} disconnected and removed from the peer list`),this.renewPeersLocker.lock(e),t}stopMaintainPeersInterval(){this.maintainPeersIntervalId&&(clearInterval(this.maintainPeersIntervalId),this.maintainPeersIntervalId=null,this.log.info("Maintain peers interval stopped"))}hasPeers=async(e={})=>{const{autoRetry:t=!1,forceUseAllPeers:r=!1,initialDelay:n=10,maxAttempts:s=3,maxDelay:o=100}=e;if(!r&&this.connectedPeers.length>0)return!0;let i=0;for(;i{this.maintainPeers().catch((e=>{this.log.error("Error during maintain peers interval:",e)}))}),e),this.log.info(`Maintain peers interval started with interval ${e}ms`)}catch(e){throw this.log.error("Error starting maintain peers interval:",e),e}}async maintainPeers(){if(this.maintainPeersLock)return!1;this.maintainPeersLock=!0,this.log.info(`Maintaining peers, current count: ${this.peers.length}`);try{const e=this.numPeersToUse-this.peers.length;e>0&&await this.findAndAddPeers(e),this.log.info(`Peer maintenance completed, current count: ${this.peers.length}`),this.renewPeersLocker.cleanUnlocked()}finally{this.maintainPeersLock=!1}return!0}async findAndAddPeers(e){this.log.info(`Finding and adding ${e} new peers`);try{const t=await this.findAdditionalPeers(e),r=t.map((e=>this.connectionManager.attemptDial(e.id)));await Promise.all(r);const n=[...this.peers,...t];return this.updatePeers(n),this.log.info(`Added ${t.length} new peers, total peers: ${this.peers.length}`),t}catch(e){throw this.log.error("Error finding and adding new peers:",e),e}}async findAdditionalPeers(e){this.log.info(`Finding ${e} additional peers`);try{let t=await this.core.allPeers();return 0===t.length&&this.log.warn("No new peers found."),t=t.filter((e=>!1===this.peers.some((t=>t.id.equals(e.id))))).filter((e=>!this.renewPeersLocker.isLocked(e.id))).slice(0,e),t}catch(e){throw this.log.error("Error finding additional peers:",e),e}}updatePeers(e){this.peers=e,this.healthManager.updateProtocolHealth(this.core.multicodec,this.peers.length)}}class Ho{lockDuration;peers=new Map;constructor(e){this.lockDuration=e}lock(e){this.peers.set(e.toString(),Date.now())}isLocked(e){const t=this.peers.get(e.toString());return!(!t||this.isTimeUnlocked(t))}cleanUnlocked(){Object.entries(this.peers).forEach((([e,t])=>{this.isTimeUnlocked(t)&&this.peers.delete(e.toString())}))}isTimeUnlocked(e){return Date.now()-e>=this.lockDuration}}const qo=new An("sdk:filter");class Vo{pubsubTopic;protocol;connectionManager;getPeers;renewPeer;subscriptionCallbacks=new Map;receivedMessagesHashStr=[];peerFailures=new Map;receivedMessagesHashes;missedMessagesByPeer=new Map;keepAliveInterval=6e4;maxPingFailures=2;maxMissedMessagesThreshold=3;keepAliveTimer=null;constructor(e,t,r,n,s){this.pubsubTopic=e,this.protocol=t,this.connectionManager=r,this.getPeers=n,this.renewPeer=s,this.pubsubTopic=e;const o=this.getPeers().map((e=>e.id.toString()));this.receivedMessagesHashes={all:new Set,nodes:{...Object.fromEntries(o.map((e=>[e,new Set])))}},o.forEach((e=>this.missedMessagesByPeer.set(e,0)))}addHash(e,t){this.receivedMessagesHashes.all.add(e),t&&(this.receivedMessagesHashes.nodes[t]||(this.receivedMessagesHashes.nodes[t]=new Set),this.receivedMessagesHashes.nodes[t].add(e))}async subscribe(e,t,r={}){this.keepAliveInterval=r.keepAlive||6e4,this.maxPingFailures=r.pingsBeforePeerRenewed||2,this.maxMissedMessagesThreshold=r.maxMissedMessagesThreshold||3;const n=Array.isArray(e)?e:[e];for(const e of n)if(e.pubsubTopic!==this.pubsubTopic)return{failures:[{error:Jr.TOPIC_DECODER_MISMATCH}],successes:[]};const s=Ir(n),o=Array.from(s.keys()),i=this.getPeers().map((async e=>this.protocol.subscribe(this.pubsubTopic,e,o))),a=await Promise.allSettled(i),c=this.handleResult(a,"subscribe");return s.forEach(((e,r)=>{const n={decoders:e,callback:t};this.subscriptionCallbacks.set(r,n)})),this.startSubscriptionsMaintenance(this.keepAliveInterval),c}async unsubscribe(e){const t=this.getPeers().map((async t=>{const r=await this.protocol.unsubscribe(this.pubsubTopic,t,e);return e.forEach((e=>{this.subscriptionCallbacks.delete(e)})),r})),r=await Promise.allSettled(t),n=this.handleResult(r,"unsubscribe");return 0===this.subscriptionCallbacks.size&&this.stopSubscriptionsMaintenance(),n}async ping(e){const t=(e?[e]:this.getPeers().map((e=>e.id))).map((e=>this.pingSpecificPeer(e))),r=await Promise.allSettled(t);return this.handleResult(r,"ping")}async unsubscribeAll(){const e=this.getPeers().map((async e=>this.protocol.unsubscribeAll(this.pubsubTopic,e))),t=await Promise.allSettled(e);this.subscriptionCallbacks.clear();const r=this.handleResult(t,"unsubscribeAll");return this.stopSubscriptionsMaintenance(),r}async validateMessage(){for(const e of this.receivedMessagesHashes.all)for(const[t,r]of Object.entries(this.receivedMessagesHashes.nodes))if(!r.has(e)&&(this.incrementMissedMessageCount(t),this.shouldRenewPeer(t))){qo.info(`Peer ${t} has missed too many messages, renewing.`);const e=this.getPeers().find((e=>e.id.toString()===t))?.id;if(!e){qo.error(`Unexpected Error: Peer ${t} not found in connected peers.`);continue}try{await this.renewAndSubscribePeer(e)}catch(e){qo.error(`Failed to renew peer ${t}: ${e}`)}}}async processIncomingMessage(e,t){const r=function(e,t){const r=Fo(e,t);return cn(r)}(this.pubsubTopic,e);if(this.addHash(r,t),this.validateMessage(),this.receivedMessagesHashStr.includes(r))return void qo.info("Message already received, skipping");this.receivedMessagesHashStr.push(r);const{contentTopic:n}=e,s=this.subscriptionCallbacks.get(n);s?(qo.info("Processing message with content topic ",n," on pubsub topic ",this.pubsubTopic),await async function(e,t,r){const{decoders:n,callback:s}=e,{contentTopic:o}=r;if(o)try{const e=n.map((e=>e.fromProtoObj(t,r).then((e=>e||Promise.reject("Decoding failed"))))),o=await Promise.any(e);await s(o)}catch(e){qo.error("Error decoding message",e)}else qo.warn("Message has no content topic, skipping")}(s,this.pubsubTopic,e)):qo.error("No subscription callback available for ",n)}handleResult(e,t){const r={failures:[],successes:[]};for(const n of e)if("rejected"===n.status)qo.error(`Failed to resolve ${t} promise successfully: `,n.reason),r.failures.push({error:Jr.GENERIC_FAIL});else{const e=n.value;e.failure?r.failures.push(e.failure):r.successes.push(e.success)}return r}async pingSpecificPeer(e){const t=this.getPeers().find((t=>t.id.equals(e)));if(!t)return{success:null,failure:{peerId:e,error:Jr.NO_PEER_AVAILABLE}};try{const r=await this.protocol.ping(t);return r.failure?await this.handlePeerFailure(e):this.peerFailures.delete(e.toString()),r}catch(t){return await this.handlePeerFailure(e),{success:null,failure:{peerId:e,error:Jr.GENERIC_FAIL}}}}async handlePeerFailure(e){const t=(this.peerFailures.get(e.toString())||0)+1;if(this.peerFailures.set(e.toString(),t),t>this.maxPingFailures)try{await this.renewAndSubscribePeer(e),this.peerFailures.delete(e.toString())}catch(t){qo.error(`Failed to renew peer ${e.toString()}: ${t}.`)}}async renewAndSubscribePeer(e){try{const t=await this.renewPeer(e);return await this.protocol.subscribe(this.pubsubTopic,t,Array.from(this.subscriptionCallbacks.keys())),this.receivedMessagesHashes.nodes[t.id.toString()]=new Set,this.missedMessagesByPeer.set(t.id.toString(),0),t}catch(t){return void qo.warn(`Failed to renew peer ${e.toString()}: ${t}.`)}finally{this.peerFailures.delete(e.toString()),this.missedMessagesByPeer.delete(e.toString()),delete this.receivedMessagesHashes.nodes[e.toString()]}}startSubscriptionsMaintenance(e){this.startKeepAlivePings(e),this.startConnectionListener()}stopSubscriptionsMaintenance(){this.stopKeepAlivePings(),this.stopConnectionListener()}startKeepAlivePings(e){this.keepAliveTimer?qo.info("Recurring pings already set up."):this.keepAliveTimer=setInterval((()=>{this.ping().catch((e=>{qo.error("Error in keep-alive ping cycle:",e)}))}),e)}stopKeepAlivePings(){this.keepAliveTimer?(qo.info("Stopping recurring pings."),clearInterval(this.keepAliveTimer),this.keepAliveTimer=null):qo.info("Already stopped recurring pings.")}startConnectionListener(){this.connectionManager.addEventListener(Zr.CONNECTION_STATUS,this.connectionListener.bind(this))}stopConnectionListener(){this.connectionManager.removeEventListener(Zr.CONNECTION_STATUS,this.connectionListener.bind(this))}async connectionListener({detail:e}){if(e){try{const e=(await this.ping()).failures.map((async e=>{e.peerId&&await this.renewAndSubscribePeer(e.peerId)}));await Promise.all(e)}catch(e){qo.error(`networkStateListener failed to recover: ${e}`)}this.startKeepAlivePings(this.keepAliveInterval)}else this.stopKeepAlivePings()}incrementMissedMessageCount(e){const t=this.missedMessagesByPeer.get(e)||0;this.missedMessagesByPeer.set(e,t+1)}shouldRenewPeer(e){return(this.missedMessagesByPeer.get(e)||0)>this.maxMissedMessagesThreshold}}class jo extends $o{protocol;_connectionManager;activeSubscriptions=new Map;constructor(e,t,r){super(new bs((async(e,t,r)=>{const n=this.getActiveSubscription(e);n?await n.processIncomingMessage(t,r):qo.error(`No subscription locally registered for topic ${e}`)}),e.configuredPubsubTopics,t),e,{numPeersToUse:r?.numPeersToUse}),this.protocol=this.core,this._connectionManager=e}async subscribe(e,t,r,n){const s=this.getUniquePubsubTopics(e);if(1!==s.length)return{subscription:null,error:Jr.INVALID_DECODER_TOPICS,results:null};const o=s[0],{subscription:i,error:a}=await this.createSubscription(o,r);if(a)return{subscription:null,error:a,results:null};const{failures:c,successes:l}=await i.subscribe(e,t,n);return{subscription:i,error:null,results:{failures:c,successes:l}}}async createSubscription(e,t){t={autoRetry:!0,...t};const r="string"==typeof e?e:dn(e)?.[0];return gn(r,this.protocol.pubsubTopics),await this.hasPeers(t)?(qo.info(`Creating filter subscription with ${this.connectedPeers.length} peers: `,this.connectedPeers.map((e=>e.id.toString()))),{error:null,subscription:this.getActiveSubscription(r)??this.setActiveSubscription(r,new Vo(r,this.protocol,this._connectionManager,(()=>this.connectedPeers),this.renewPeer.bind(this)))}):{error:Jr.NO_PEER_AVAILABLE,subscription:null}}async subscribeWithUnsubscribe(e,t,r){const n=this.getUniquePubsubTopics(e);if(0===n.length)throw Error("Failed to subscribe: no pubsubTopic found on decoders provided.");if(n.length>1)throw Error("Failed to subscribe: all decoders should have the same pubsub topic. Use createSubscription to be more agile.");const{subscription:s,error:o}=await this.createSubscription(n[0]);if(o)throw Error(`Failed to create subscription: ${o}`);await s.subscribe(e,t,r);const i=Array.from(Ir(Array.isArray(e)?e:[e]).keys());return async()=>{await s.unsubscribe(i)}}toSubscriptionIterator(e){return async function(e,t,r){const n=[];let s;s=await e.subscribeWithUnsubscribe(t,(e=>{n.push(e)}));const o=Number.isInteger(r?.timeoutMs),i=Date.now();return{iterator:async function*(){for(;;){if(o&&Date.now()-i>=0)return;await Rr(60);const e=n.shift();if(!s&&0===n.length)return e;!e&&s||(yield e)}}(),async stop(){s&&(await s(),s=void 0)}}}(this,e)}getActiveSubscription(e){return this.activeSubscriptions.get(e)}setActiveSubscription(e,t){return this.activeSubscriptions.set(e,t),t}getUniquePubsubTopics(e){if(!Array.isArray(e))return[e.pubsubTopic];if(0===e.length)return[];const t=new Set(e.map((e=>e.pubsubTopic)));return[...t]}}const Ko=new An("sdk:light-push");class zo extends $o{protocol;constructor(e,t,r){super(new Es(e.configuredPubsubTopics,t),e,{numPeersToUse:r?.numPeersToUse}),this.protocol=this.core}async send(e,t,r){const n={autoRetry:!0,...r},s=[],o=[],{pubsubTopic:i}=e;try{gn(i,this.protocol.pubsubTopics)}catch(e){return Ko.error("Failed to send waku light push: pubsub topic not configured"),{failures:[{error:Jr.TOPIC_NOT_CONFIGURED}],successes:[]}}if(!await this.hasPeers(n))return{successes:s,failures:[{error:Jr.NO_PEER_AVAILABLE}]};const a=this.connectedPeers.map((r=>this.protocol.send(e,t,r))),c=await Promise.allSettled(a);for(const e of c)if("fulfilled"===e.status){const{failure:t,success:r}=e.value;if(r&&s.push(r),t){if(t.peerId)try{await this.renewPeer(t.peerId),Ko.info("Renewed peer",t.peerId.toString())}catch(e){Ko.error("Failed to renew peer",e)}o.push(t)}}else Ko.error("Failed unexpectedly while sending:",e.reason),o.push({error:Jr.GENERIC_FAIL});return{successes:s,failures:o}}}const Go=new An("waku:store:sdk");class Wo extends $o{protocol;constructor(e,t){super(new Rs(e.configuredPubsubTopics,t),e,{numPeersToUse:1}),this.protocol=this.core}async*queryGenerator(e,t){const{pubsubTopic:r,contentTopics:n,decodersAsMap:s}=this.validateDecodersAndPubsubTopic(e),o={pubsubTopic:r,contentTopics:n,includeData:!0,paginationForward:!0,...t},i=(await this.protocol.getPeers({numPeers:this.numPeersToUse,maxBootstrapPeers:1}))[0];if(!i)throw Go.error("No peers available to query"),new Error("No peers available to query");Go.info(`Querying store with options: ${JSON.stringify(t)}`);const a=this.protocol.queryPerPage(o,s,i);for await(const e of a)yield e}async queryWithOrderedCallback(e,t,r){Go.info("Querying store with ordered callback");for await(const n of this.queryGenerator(e,r))if(await this.processMessages(n,t))break}async queryWithPromiseCallback(e,t,r){Go.info("Querying store with promise callback");let n=!1;for await(const s of this.queryGenerator(e,r)){const e=s.map((async e=>{n||(n=Boolean(await t(e)))}));if(await Promise.all(e),n)break}}async processMessages(e,t){let r=!1;const n=(await Promise.all(e)).filter(kr);return await Promise.all(n.map((async e=>{e&&!r&&(r=Boolean(await t(e)))}))),r}createCursor(e){return Fo(e.pubsubTopic,e)}validateDecodersAndPubsubTopic(e){if(0===e.length)throw Go.error("No decoders provided"),new Error("No decoders provided");const t=Array.from(new Set(e.map((e=>e.pubsubTopic))));if(t.length>1)throw Go.error("API does not support querying multiple pubsub topics at once"),new Error("API does not support querying multiple pubsub topics at once");const r=t[0];gn(r,this.protocol.pubsubTopics);const n=new Map;e.forEach((e=>{if(n.has(e.contentTopic))throw Go.error("API does not support different decoder per content topic"),new Error("API does not support different decoder per content topic");n.set(e.contentTopic,e)}));const s=e.filter((e=>e.pubsubTopic===r)).map((e=>e.contentTopic));if(0===s.length)throw Go.error(`No decoders found for topic ${r}`),new Error("No decoders found for topic "+r);return{pubsubTopic:r,contentTopics:s,decodersAsMap:n}}}const Yo="js-waku",Jo=10,Xo=new An("waku");class Qo{pubsubTopics;libp2p;relay;store;filter;lightPush;connectionManager;health;constructor(e,t,r,n,s){this.pubsubTopics=e,this.relay=s,this.libp2p=r,n={filter:!1,lightpush:!1,store:!1,...n};const o=t.pingKeepAlive||300,i=this.relay?t.relayKeepAlive||300:0,a=this.libp2p.peerId.toString();if(this.connectionManager=js.create(a,r,{pingKeepAlive:o,relayKeepAlive:i},this.pubsubTopics,this.relay),this.health=zs(),n.store){const e=(c=this.connectionManager,e=>new Wo(c,e));this.store=e(r)}var c;if(n.lightpush){const e=function(e,t={}){return r=>new zo(e,r,t)}(this.connectionManager);this.lightPush=e(r)}if(n.filter){const e=function(e,t){return t=>new jo(e,t,undefined)}(this.connectionManager);this.filter=e(r)}Xo.info("Waku node created",a,`relay: ${!!this.relay}, store: ${!!this.store}, light push: ${!!this.lightPush}, filter: ${!!this.filter}`)}async dial(e,t){const r=t??[],n=function(e){return Qs(e)?e:Mo(e)}(e);void 0===t&&(this.relay&&r.push(Yr.Relay),this.store&&r.push(Yr.Store),this.filter&&r.push(Yr.Filter),this.lightPush&&r.push(Yr.LightPush));const s=[];return r.includes(Yr.Relay)&&(this.relay?this.relay.gossipSub.multicodecs.forEach((e=>s.push(e))):Xo.error("Relay codec not included in dial codec: protocol not mounted locally")),r.includes(Yr.Store)&&(this.store?s.push(this.store.protocol.multicodec):Xo.error("Store codec not included in dial codec: protocol not mounted locally")),r.includes(Yr.LightPush)&&(this.lightPush?s.push(this.lightPush.protocol.multicodec):Xo.error("Light Push codec not included in dial codec: protocol not mounted locally")),r.includes(Yr.Filter)&&(this.filter?s.push(this.filter.protocol.multicodec):Xo.error("Filter codec not included in dial codec: protocol not mounted locally")),Xo.info(`Dialing to ${n.toString()} with protocols ${r}`),this.libp2p.dialProtocol(n,s)}async start(){await this.libp2p.start()}async stop(){this.connectionManager.stop(),await this.libp2p.stop()}isStarted(){return"started"==this.libp2p.status}isConnected(){return this.connectionManager.isConnected()}getLocalMultiaddrWithID(){const e=this.libp2p.getMultiaddrs().find((e=>e.toString().match(/127\.0\.0\.1/)));if(!e||""===e.toString())throw"Not listening on localhost";return e+"/p2p/"+this.libp2p.peerId.toString()}}function Zo(e){return null!=e&&"function"==typeof e.then&&"function"==typeof e.catch&&"function"==typeof e.finally}const ei=BigInt(2**32-1),ti=BigInt(32);function ri(e,t=!1){return t?{h:Number(e&ei),l:Number(e>>ti&ei)}:{h:0|Number(e>>ti&ei),l:0|Number(e&ei)}}const ni={fromBig:ri,split:function(e,t=!1){let r=new Uint32Array(e.length),n=new Uint32Array(e.length);for(let s=0;sBigInt(e>>>0)<>>0),shrSH:(e,t,r)=>e>>>r,shrSL:(e,t,r)=>e<<32-r|t>>>r,rotrSH:(e,t,r)=>e>>>r|t<<32-r,rotrSL:(e,t,r)=>e<<32-r|t>>>r,rotrBH:(e,t,r)=>e<<64-r|t>>>r-32,rotrBL:(e,t,r)=>e>>>r-32|t<<64-r,rotr32H:(e,t)=>t,rotr32L:(e,t)=>e,rotlSH:(e,t,r)=>e<>>32-r,rotlSL:(e,t,r)=>t<>>32-r,rotlBH:(e,t,r)=>t<>>64-r,rotlBL:(e,t,r)=>e<>>64-r,add:function(e,t,r,n){const s=(t>>>0)+(n>>>0);return{h:e+r+(s/2**32|0)|0,l:0|s}},add3L:(e,t,r)=>(e>>>0)+(t>>>0)+(r>>>0),add3H:(e,t,r,n)=>t+r+n+(e/2**32|0)|0,add4L:(e,t,r,n)=>(e>>>0)+(t>>>0)+(r>>>0)+(n>>>0),add4H:(e,t,r,n,s)=>t+r+n+s+(e/2**32|0)|0,add5H:(e,t,r,n,s,o)=>t+r+n+s+o+(e/2**32|0)|0,add5L:(e,t,r,n,s)=>(e>>>0)+(t>>>0)+(r>>>0)+(n>>>0)+(s>>>0)},si=ni,[oi,ii]=(()=>si.split(["0x428a2f98d728ae22","0x7137449123ef65cd","0xb5c0fbcfec4d3b2f","0xe9b5dba58189dbbc","0x3956c25bf348b538","0x59f111f1b605d019","0x923f82a4af194f9b","0xab1c5ed5da6d8118","0xd807aa98a3030242","0x12835b0145706fbe","0x243185be4ee4b28c","0x550c7dc3d5ffb4e2","0x72be5d74f27b896f","0x80deb1fe3b1696b1","0x9bdc06a725c71235","0xc19bf174cf692694","0xe49b69c19ef14ad2","0xefbe4786384f25e3","0x0fc19dc68b8cd5b5","0x240ca1cc77ac9c65","0x2de92c6f592b0275","0x4a7484aa6ea6e483","0x5cb0a9dcbd41fbd4","0x76f988da831153b5","0x983e5152ee66dfab","0xa831c66d2db43210","0xb00327c898fb213f","0xbf597fc7beef0ee4","0xc6e00bf33da88fc2","0xd5a79147930aa725","0x06ca6351e003826f","0x142929670a0e6e70","0x27b70a8546d22ffc","0x2e1b21385c26c926","0x4d2c6dfc5ac42aed","0x53380d139d95b3df","0x650a73548baf63de","0x766a0abb3c77b2a8","0x81c2c92e47edaee6","0x92722c851482353b","0xa2bfe8a14cf10364","0xa81a664bbc423001","0xc24b8b70d0f89791","0xc76c51a30654be30","0xd192e819d6ef5218","0xd69906245565a910","0xf40e35855771202a","0x106aa07032bbd1b8","0x19a4c116b8d2d0c8","0x1e376c085141ab53","0x2748774cdf8eeb99","0x34b0bcb5e19b48a8","0x391c0cb3c5c95a63","0x4ed8aa4ae3418acb","0x5b9cca4f7763e373","0x682e6ff3d6b2b8a3","0x748f82ee5defb2fc","0x78a5636f43172f60","0x84c87814a1f0ab72","0x8cc702081a6439ec","0x90befffa23631e28","0xa4506cebde82bde9","0xbef9a3f7b2c67915","0xc67178f2e372532b","0xca273eceea26619c","0xd186b8c721c0c207","0xeada7dd6cde0eb1e","0xf57d4f7fee6ed178","0x06f067aa72176fba","0x0a637dc5a2c898a6","0x113f9804bef90dae","0x1b710b35131c471b","0x28db77f523047d84","0x32caab7b40c72493","0x3c9ebe0a15c9bebc","0x431d67c49c100d4c","0x4cc5d4becb3e42b6","0x597f299cfc657e2a","0x5fcb6fab3ad6faec","0x6c44198c4a475817"].map((e=>BigInt(e)))))(),ai=new Uint32Array(80),ci=new Uint32Array(80);class li extends Vr{constructor(){super(128,64,16,!1),this.Ah=1779033703,this.Al=-205731576,this.Bh=-1150833019,this.Bl=-2067093701,this.Ch=1013904242,this.Cl=-23791573,this.Dh=-1521486534,this.Dl=1595750129,this.Eh=1359893119,this.El=-1377402159,this.Fh=-1694144372,this.Fl=725511199,this.Gh=528734635,this.Gl=-79577749,this.Hh=1541459225,this.Hl=327033209}get(){const{Ah:e,Al:t,Bh:r,Bl:n,Ch:s,Cl:o,Dh:i,Dl:a,Eh:c,El:l,Fh:u,Fl:h,Gh:d,Gl:p,Hh:f,Hl:g}=this;return[e,t,r,n,s,o,i,a,c,l,u,h,d,p,f,g]}set(e,t,r,n,s,o,i,a,c,l,u,h,d,p,f,g){this.Ah=0|e,this.Al=0|t,this.Bh=0|r,this.Bl=0|n,this.Ch=0|s,this.Cl=0|o,this.Dh=0|i,this.Dl=0|a,this.Eh=0|c,this.El=0|l,this.Fh=0|u,this.Fl=0|h,this.Gh=0|d,this.Gl=0|p,this.Hh=0|f,this.Hl=0|g}process(e,t){for(let r=0;r<16;r++,t+=4)ai[r]=e.getUint32(t),ci[r]=e.getUint32(t+=4);for(let e=16;e<80;e++){const t=0|ai[e-15],r=0|ci[e-15],n=si.rotrSH(t,r,1)^si.rotrSH(t,r,8)^si.shrSH(t,r,7),s=si.rotrSL(t,r,1)^si.rotrSL(t,r,8)^si.shrSL(t,r,7),o=0|ai[e-2],i=0|ci[e-2],a=si.rotrSH(o,i,19)^si.rotrBH(o,i,61)^si.shrSH(o,i,6),c=si.rotrSL(o,i,19)^si.rotrBL(o,i,61)^si.shrSL(o,i,6),l=si.add4L(s,c,ci[e-7],ci[e-16]),u=si.add4H(l,n,a,ai[e-7],ai[e-16]);ai[e]=0|u,ci[e]=0|l}let{Ah:r,Al:n,Bh:s,Bl:o,Ch:i,Cl:a,Dh:c,Dl:l,Eh:u,El:h,Fh:d,Fl:p,Gh:f,Gl:g,Hh:y,Hl:m}=this;for(let e=0;e<80;e++){const t=si.rotrSH(u,h,14)^si.rotrSH(u,h,18)^si.rotrBH(u,h,41),b=si.rotrSL(u,h,14)^si.rotrSL(u,h,18)^si.rotrBL(u,h,41),w=u&d^~u&f,v=h&p^~h&g,E=si.add5L(m,b,v,ii[e],ci[e]),S=si.add5H(E,y,t,w,oi[e],ai[e]),A=0|E,_=si.rotrSH(r,n,28)^si.rotrBH(r,n,34)^si.rotrBH(r,n,39),k=si.rotrSL(r,n,28)^si.rotrBL(r,n,34)^si.rotrBL(r,n,39),I=r&s^r&i^s&i,R=n&o^n&a^o&a;y=0|f,m=0|g,f=0|d,g=0|p,d=0|u,p=0|h,({h:u,l:h}=si.add(0|c,0|l,0|S,0|A)),c=0|i,l=0|a,i=0|s,a=0|o,s=0|r,o=0|n;const T=si.add3L(A,k,R);r=si.add3H(T,S,_,I),n=0|T}({h:r,l:n}=si.add(0|this.Ah,0|this.Al,0|r,0|n)),({h:s,l:o}=si.add(0|this.Bh,0|this.Bl,0|s,0|o)),({h:i,l:a}=si.add(0|this.Ch,0|this.Cl,0|i,0|a)),({h:c,l}=si.add(0|this.Dh,0|this.Dl,0|c,0|l)),({h:u,l:h}=si.add(0|this.Eh,0|this.El,0|u,0|h)),({h:d,l:p}=si.add(0|this.Fh,0|this.Fl,0|d,0|p)),({h:f,l:g}=si.add(0|this.Gh,0|this.Gl,0|f,0|g)),({h:y,l:m}=si.add(0|this.Hh,0|this.Hl,0|y,0|m)),this.set(r,n,s,o,i,a,c,l,u,h,d,p,f,g,y,m)}roundClean(){ai.fill(0),ci.fill(0)}destroy(){this.buffer.fill(0),this.set(0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0)}}const ui=$r((()=>new li)),hi=BigInt(0),di=BigInt(1),pi=BigInt(2);function fi(e){return e instanceof Uint8Array||null!=e&&"object"==typeof e&&"Uint8Array"===e.constructor.name}function gi(e){if(!fi(e))throw new Error("Uint8Array expected")}function yi(e,t){if("boolean"!=typeof t)throw new Error(`${e} must be valid boolean, got "${t}".`)}const mi=Array.from({length:256},((e,t)=>t.toString(16).padStart(2,"0")));function bi(e){gi(e);let t="";for(let r=0;r=vi._0&&e<=vi._9?e-vi._0:e>=vi._A&&e<=vi._F?e-(vi._A-10):e>=vi._a&&e<=vi._f?e-(vi._a-10):void 0}function Si(e){if("string"!=typeof e)throw new Error("hex string expected, got "+typeof e);const t=e.length,r=t/2;if(t%2)throw new Error("padded hex string expected, got unpadded hex of length "+t);const n=new Uint8Array(r);for(let t=0,s=0;t"bigint"==typeof e&&hi<=e;function Ni(e,t,r){return Ci(e)&&Ci(t)&&Ci(r)&&t<=e&&e(pi<new Uint8Array(e),Di=e=>Uint8Array.from(e);function Li(e,t,r){if("number"!=typeof e||e<2)throw new Error("hashLen must be a number");if("number"!=typeof t||t<2)throw new Error("qByteLen must be a number");if("function"!=typeof r)throw new Error("hmacFn must be a function");let n=Oi(e),s=Oi(e),o=0;const i=()=>{n.fill(1),s.fill(0),o=0},a=(...e)=>r(s,n,...e),c=(e=Oi())=>{s=a(Di([0]),e),n=a(),0!==e.length&&(s=a(Di([1]),e),n=a())},l=()=>{if(o++>=1e3)throw new Error("drbg: tried 1000 values");let e=0;const r=[];for(;e{let r;for(i(),c(e);!(r=t(l()));)c();return i(),r}}const Bi={bigint:e=>"bigint"==typeof e,function:e=>"function"==typeof e,boolean:e=>"boolean"==typeof e,string:e=>"string"==typeof e,stringOrUint8Array:e=>"string"==typeof e||fi(e),isSafeInteger:e=>Number.isSafeInteger(e),array:e=>Array.isArray(e),field:(e,t)=>t.Fp.isValid(e),hash:e=>"function"==typeof e&&Number.isSafeInteger(e.outputLen)};function Ui(e,t,r={}){const n=(t,r,n)=>{const s=Bi[r];if("function"!=typeof s)throw new Error(`Invalid validator "${r}", expected function`);const o=e[t];if(!(n&&void 0===o||s(o,e)))throw new Error(`Invalid param ${String(t)}=${o} (${typeof o}), expected ${r}`)};for(const[e,r]of Object.entries(t))n(e,r,!1);for(const[e,t]of Object.entries(r))n(e,t,!0);return e}function Mi(e){const t=new WeakMap;return(r,...n)=>{const s=t.get(r);if(void 0!==s)return s;const o=e(r,...n);return t.set(r,o),o}}const Fi=BigInt(0),$i=BigInt(1),Hi=BigInt(2),qi=BigInt(3),Vi=BigInt(4),ji=BigInt(5),Ki=BigInt(8);function zi(e,t){const r=e%t;return r>=Fi?r:t+r}function Gi(e,t,r){if(r<=Fi||t 0");if(r===$i)return Fi;let n=$i;for(;t>Fi;)t&$i&&(n=n*e%r),e=e*e%r,t>>=$i;return n}function Wi(e,t,r){let n=e;for(;t-- >Fi;)n*=n,n%=r;return n}function Yi(e,t){if(e===Fi||t<=Fi)throw new Error(`invert: expected positive integers, got n=${e} mod=${t}`);let r=zi(e,t),n=t,s=Fi,o=$i,i=$i,a=Fi;for(;r!==Fi;){const e=n/r,t=n%r,c=s-i*e,l=o-a*e;n=r,r=t,s=i,o=a,i=c,a=l}if(n!==$i)throw new Error("invert: does not exist");return zi(s,t)}BigInt(9),BigInt(16);const Ji=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function Xi(e,t){const r=void 0!==t?t:e.toString(2).length;return{nBitLength:r,nByteLength:Math.ceil(r/8)}}function Qi(e,t,r=!1,n={}){if(e<=Fi)throw new Error(`Expected Field ORDER > 0, got ${e}`);const{nBitLength:s,nByteLength:o}=Xi(e,t);if(o>2048)throw new Error("Field lengths over 2048 bytes are not supported");const i=function(e){if(e%Vi===qi){const t=(e+$i)/Vi;return function(e,r){const n=e.pow(r,t);if(!e.eql(e.sqr(n),r))throw new Error("Cannot find square root");return n}}if(e%Ki===ji){const t=(e-ji)/Ki;return function(e,r){const n=e.mul(r,Hi),s=e.pow(n,t),o=e.mul(r,s),i=e.mul(e.mul(o,Hi),s),a=e.mul(o,e.sub(i,e.ONE));if(!e.eql(e.sqr(a),r))throw new Error("Cannot find square root");return a}}return function(e){const t=(e-$i)/Hi;let r,n,s;for(r=e-$i,n=0;r%Hi===Fi;r/=Hi,n++);for(s=Hi;szi(t,e),isValid:t=>{if("bigint"!=typeof t)throw new Error("Invalid field element: expected bigint, got "+typeof t);return Fi<=t&&te===Fi,isOdd:e=>(e&$i)===$i,neg:t=>zi(-t,e),eql:(e,t)=>e===t,sqr:t=>zi(t*t,e),add:(t,r)=>zi(t+r,e),sub:(t,r)=>zi(t-r,e),mul:(t,r)=>zi(t*r,e),pow:(e,t)=>function(e,t,r){if(r 0");if(r===Fi)return e.ONE;if(r===$i)return t;let n=e.ONE,s=t;for(;r>Fi;)r&$i&&(n=e.mul(n,s)),s=e.sqr(s),r>>=$i;return n}(a,e,t),div:(t,r)=>zi(t*Yi(r,e),e),sqrN:e=>e*e,addN:(e,t)=>e+t,subN:(e,t)=>e-t,mulN:(e,t)=>e*t,inv:t=>Yi(t,e),sqrt:n.sqrt||(e=>i(a,e)),invertBatch:e=>function(e,t){const r=new Array(t.length),n=t.reduce(((t,n,s)=>e.is0(n)?t:(r[s]=t,e.mul(t,n))),e.ONE),s=e.inv(n);return t.reduceRight(((t,n,s)=>e.is0(n)?t:(r[s]=e.mul(t,r[s]),e.mul(t,n))),s),r}(a,e),cmov:(e,t,r)=>r?t:e,toBytes:e=>r?Ii(e,o):ki(e,o),fromBytes:e=>{if(e.length!==o)throw new Error(`Fp.fromBytes: expected ${o}, got ${e.length}`);return r?_i(e):Ai(e)}});return Object.freeze(a)}function Zi(e){if("bigint"!=typeof e)throw new Error("field order must be bigint");const t=e.toString(2).length;return Math.ceil(t/8)}function ea(e){const t=Zi(e);return t+Math.ceil(t/2)}const ta=BigInt(0),ra=BigInt(1),na=new WeakMap,sa=new WeakMap;function oa(e,t){const r=(e,t)=>{const r=t.negate();return e?r:t},n=e=>{if(!Number.isSafeInteger(e)||e<=0||e>t)throw new Error(`Wrong window size=${e}, should be [1..${t}]`)},s=e=>(n(e),{windows:Math.ceil(t/e)+1,windowSize:2**(e-1)});return{constTimeNegate:r,unsafeLadder(t,r){let n=e.ZERO,s=t;for(;r>ta;)r&ra&&(n=n.add(s)),s=s.double(),r>>=ra;return n},precomputeWindow(e,t){const{windows:r,windowSize:n}=s(t),o=[];let i=e,a=i;for(let e=0;e>=d,s>a&&(s-=h,o+=ra);const i=t,p=t+Math.abs(s)-1,f=e%2!=0,g=s<0;0===s?l=l.add(r(f,n[i])):c=c.add(r(g,n[p]))}return{p:c,f:l}},wNAFCached(e,t,r){const n=sa.get(e)||1;let s=na.get(e);return s||(s=this.precomputeWindow(e,n),1!==n&&na.set(e,r(s))),this.wNAF(n,s,t)},setWindowSize(e,t){n(t),sa.set(e,t),na.delete(e)}}}function ia(e){return function(e){const t=Ji.reduce(((e,t)=>(e[t]="function",e)),{ORDER:"bigint",MASK:"bigint",BYTES:"isSafeInteger",BITS:"isSafeInteger"});Ui(e,t)}(e.Fp),Ui(e,{n:"bigint",h:"bigint",Gx:"field",Gy:"field"},{nBitLength:"isSafeInteger",nByteLength:"isSafeInteger"}),Object.freeze({...Xi(e.n,e.nBitLength),...e,p:e.Fp.ORDER})}const aa=BigInt(0),ca=BigInt(1),la=BigInt(2),ua=BigInt(8),ha={zip215:!0};const da=BigInt(0),pa=BigInt(1);const fa=BigInt("57896044618658097711785492504343953926634992332820282019728792003956564819949"),ga=BigInt("19681161376707505956807079304988542015446066515923890162744021073123829784752"),ya=(BigInt(0),BigInt(1)),ma=BigInt(2),ba=BigInt(3),wa=BigInt(5),va=BigInt(8);function Ea(e){const t=BigInt(10),r=BigInt(20),n=BigInt(40),s=BigInt(80),o=fa,i=e*e%o*e%o,a=Wi(i,ma,o)*i%o,c=Wi(a,ya,o)*e%o,l=Wi(c,wa,o)*c%o,u=Wi(l,t,o)*l%o,h=Wi(u,r,o)*u%o,d=Wi(h,n,o)*h%o,p=Wi(d,s,o)*d%o,f=Wi(p,s,o)*d%o,g=Wi(f,t,o)*l%o;return{pow_p_5_8:Wi(g,ma,o)*e%o,b2:i}}function Sa(e){return e[0]&=248,e[31]&=127,e[31]|=64,e}function Aa(e,t){const r=fa,n=zi(t*t*t,r),s=zi(n*n*t,r);let o=zi(e*n*Ea(e*s).pow_p_5_8,r);const i=zi(t*o*o,r),a=o,c=zi(o*ga,r),l=i===e,u=i===zi(-e,r),h=i===zi(-e*ga,r);return l&&(o=a),(u||h)&&(o=c),(zi(o,r)&$i)===$i&&(o=zi(-o,r)),{isValid:l||u,value:o}}const _a=(()=>Qi(fa,void 0,!0))(),ka=(()=>({a:BigInt(-1),d:BigInt("37095705934669439343138083508754565189542113879843219016388785533085940283555"),Fp:_a,n:BigInt("7237005577332262213973186563042994240857116359379907606001950938285454250989"),h:va,Gx:BigInt("15112221349535400772501151409588531511454012693041857206046113283949847762202"),Gy:BigInt("46316835694926478169428394003475163141307993866256225615783033603165251855960"),hash:ui,randomBytes:Hr,adjustScalarBytes:Sa,uvRatio:Aa}))(),Ia=(()=>function(e){const t=function(e){const t=ia(e);return Ui(e,{hash:"function",a:"bigint",d:"bigint",randomBytes:"function"},{adjustScalarBytes:"function",domain:"function",uvRatio:"function",mapToCurve:"function"}),Object.freeze({...t})}(e),{Fp:r,n,prehash:s,hash:o,randomBytes:i,nByteLength:a,h:c}=t,l=la<{try{return{isValid:!0,value:r.sqrt(e*r.inv(t))}}catch(e){return{isValid:!1,value:aa}}}),d=t.adjustScalarBytes||(e=>e),p=t.domain||((e,t,r)=>{if(yi("phflag",r),t.length||r)throw new Error("Contexts/pre-hash are not supported");return e});function f(e,t){xi("coordinate "+e,t,aa,l)}function g(e){if(!(e instanceof b))throw new Error("ExtendedPoint expected")}const y=Mi(((e,t)=>{const{ex:n,ey:s,ez:o}=e,i=e.is0();null==t&&(t=i?ua:r.inv(o));const a=u(n*t),c=u(s*t),l=u(o*t);if(i)return{x:aa,y:ca};if(l!==ca)throw new Error("invZ was invalid");return{x:a,y:c}})),m=Mi((e=>{const{a:r,d:n}=t;if(e.is0())throw new Error("bad point: ZERO");const{ex:s,ey:o,ez:i,et:a}=e,c=u(s*s),l=u(o*o),h=u(i*i),d=u(h*h),p=u(c*r);if(u(h*u(p+l))!==u(d+u(n*u(c*l))))throw new Error("bad point: equation left != right (1)");if(u(s*o)!==u(i*a))throw new Error("bad point: equation left != right (2)");return!0}));class b{constructor(e,t,r,n){this.ex=e,this.ey=t,this.ez=r,this.et=n,f("x",e),f("y",t),f("z",r),f("t",n),Object.freeze(this)}get x(){return this.toAffine().x}get y(){return this.toAffine().y}static fromAffine(e){if(e instanceof b)throw new Error("extended point not allowed");const{x:t,y:r}=e||{};return f("x",t),f("y",r),new b(t,r,ca,u(t*r))}static normalizeZ(e){const t=r.invertBatch(e.map((e=>e.ez)));return e.map(((e,r)=>e.toAffine(t[r]))).map(b.fromAffine)}_setWindowSize(e){E.setWindowSize(this,e)}assertValidity(){m(this)}equals(e){g(e);const{ex:t,ey:r,ez:n}=this,{ex:s,ey:o,ez:i}=e,a=u(t*i),c=u(s*n),l=u(r*i),h=u(o*n);return a===c&&l===h}is0(){return this.equals(b.ZERO)}negate(){return new b(u(-this.ex),this.ey,this.ez,u(-this.et))}double(){const{a:e}=t,{ex:r,ey:n,ez:s}=this,o=u(r*r),i=u(n*n),a=u(la*u(s*s)),c=u(e*o),l=r+n,h=u(u(l*l)-o-i),d=c+i,p=d-a,f=c-i,g=u(h*p),y=u(d*f),m=u(h*f),w=u(p*d);return new b(g,y,w,m)}add(e){g(e);const{a:r,d:n}=t,{ex:s,ey:o,ez:i,et:a}=this,{ex:c,ey:l,ez:h,et:d}=e;if(r===BigInt(-1)){const e=u((o-s)*(l+c)),t=u((o+s)*(l-c)),r=u(t-e);if(r===aa)return this.double();const n=u(i*la*d),p=u(a*la*h),f=p+n,g=t+e,y=p-n,m=u(f*r),w=u(g*y),v=u(f*y),E=u(r*g);return new b(m,w,E,v)}const p=u(s*c),f=u(o*l),y=u(a*n*d),m=u(i*h),w=u((s+o)*(c+l)-p-f),v=m-y,E=m+y,S=u(f-r*p),A=u(w*v),_=u(E*S),k=u(w*S),I=u(v*E);return new b(A,_,I,k)}subtract(e){return this.add(e.negate())}wNAF(e){return E.wNAFCached(this,e,b.normalizeZ)}multiply(e){const t=e;xi("scalar",t,ca,n);const{p:r,f:s}=this.wNAF(t);return b.normalizeZ([r,s])[0]}multiplyUnsafe(e){const t=e;return xi("scalar",t,aa,n),t===aa?v:this.equals(v)||t===ca?this:this.equals(w)?this.wNAF(t).p:E.unsafeLadder(this,t)}isSmallOrder(){return this.multiplyUnsafe(c).is0()}isTorsionFree(){return E.unsafeLadder(this,n).is0()}toAffine(e){return y(this,e)}clearCofactor(){const{h:e}=t;return e===ca?this:this.multiplyUnsafe(e)}static fromHex(e,n=!1){const{d:s,a:o}=t,i=r.BYTES;e=Ri("pointHex",e,i),yi("zip215",n);const a=e.slice(),c=e[i-1];a[i-1]=-129&c;const d=_i(a),p=n?l:r.ORDER;xi("pointHex.y",d,aa,p);const f=u(d*d),g=u(f-ca),y=u(s*f-o);let{isValid:m,value:w}=h(g,y);if(!m)throw new Error("Point.fromHex: invalid y coordinate");const v=(w&ca)===ca,E=!!(128&c);if(!n&&w===aa&&E)throw new Error("Point.fromHex: x=0 and x_0=1");return E!==v&&(w=u(-w)),b.fromAffine({x:w,y:d})}static fromPrivateKey(e){return _(e).point}toRawBytes(){const{x:e,y:t}=this.toAffine(),n=Ii(t,r.BYTES);return n[n.length-1]|=e&ca?128:0,n}toHex(){return bi(this.toRawBytes())}}b.BASE=new b(t.Gx,t.Gy,ca,u(t.Gx*t.Gy)),b.ZERO=new b(aa,ca,ca,aa);const{BASE:w,ZERO:v}=b,E=oa(b,8*a);function S(e){return zi(e,n)}function A(e){return S(_i(e))}function _(e){const t=a;e=Ri("private key",e,t);const r=Ri("hashed private key",o(e),2*t),n=d(r.slice(0,t)),s=r.slice(t,2*t),i=A(n),c=w.multiply(i),l=c.toRawBytes();return{head:n,prefix:s,scalar:i,point:c,pointBytes:l}}function k(e=new Uint8Array,...t){const r=Ti(...t);return A(o(p(r,Ri("context",e),!!s)))}const I=ha;return w._setWindowSize(8),{CURVE:t,getPublicKey:function(e){return _(e).pointBytes},sign:function(e,t,o={}){e=Ri("message",e),s&&(e=s(e));const{prefix:i,scalar:c,pointBytes:l}=_(t),u=k(o.context,i,e),h=w.multiply(u).toRawBytes(),d=S(u+k(o.context,h,l,e)*c);return xi("signature.s",d,aa,n),Ri("result",Ti(h,Ii(d,r.BYTES)),2*a)},verify:function(e,t,n,o=I){const{context:i,zip215:a}=o,c=r.BYTES;e=Ri("signature",e,2*c),t=Ri("message",t),void 0!==a&&yi("zip215",a),s&&(t=s(t));const l=_i(e.slice(c,2*c));let u,h,d;try{u=b.fromHex(n,a),h=b.fromHex(e.slice(0,c),a),d=w.multiplyUnsafe(l)}catch(e){return!1}if(!a&&u.isSmallOrder())return!1;const p=k(i,h.toRawBytes(),u.toRawBytes(),t);return h.add(u.multiplyUnsafe(p)).subtract(d).clearCofactor().equals(b.ZERO)},ExtendedPoint:b,utils:{getExtendedPublicKey:_,randomPrivateKey:()=>i(r.BYTES),precompute:(e=8,t=b.BASE)=>(t._setWindowSize(e),t.multiply(BigInt(3)),t)}}}(ka))(),Ra=(()=>function(e){const t=(Ui(r=e,{a:"bigint"},{montgomeryBits:"isSafeInteger",nByteLength:"isSafeInteger",adjustScalarBytes:"function",domain:"function",powPminus2:"function",Gu:"bigint"}),Object.freeze({...r}));var r;const{P:n}=t,s=e=>zi(e,n),o=t.montgomeryBits,i=Math.ceil(o/8),a=t.nByteLength,c=t.adjustScalarBytes||(e=>e),l=t.powPminus2||(e=>Gi(e,n-BigInt(2),n));function u(e,t,r){const n=s(e*(t-r));return[t=s(t-n),r=s(r+n)]}const h=(t.a-BigInt(2))/BigInt(4);function d(e){return Ii(s(e),i)}function p(e,t){const r=function(e){const t=Ri("u coordinate",e,i);return 32===a&&(t[31]&=127),_i(t)}(t),p=function(e){const t=Ri("scalar",e),r=t.length;if(r!==i&&r!==a)throw new Error(`Expected ${i} or ${a} bytes, got ${r}`);return _i(c(t))}(e),f=function(e,t){xi("u",e,da,n),xi("scalar",t,da,n);const r=t,i=e;let a,c=pa,d=da,p=e,f=pa,g=da;for(let e=BigInt(o-1);e>=da;e--){const t=r>>e&pa;g^=t,a=u(g,c,p),c=a[0],p=a[1],a=u(g,d,f),d=a[0],f=a[1],g=t;const n=c+d,o=s(n*n),l=c-d,y=s(l*l),m=o-y,b=p+f,w=s((p-f)*n),v=s(b*l),E=w+v,S=w-v;p=s(E*E),f=s(i*s(S*S)),c=s(o*y),d=s(m*(o+s(h*m)))}a=u(g,c,p),c=a[0],p=a[1],a=u(g,d,f),d=a[0],f=a[1];const y=l(d);return s(c*y)}(r,p);if(f===da)throw new Error("Invalid private or public key received");return d(f)}const f=d(t.Gu);function g(e){return p(e,f)}return{scalarMult:p,scalarMultBase:g,getSharedSecret:(e,t)=>p(e,t),getPublicKey:e=>g(e),utils:{randomPrivateKey:()=>t.randomBytes(t.nByteLength)},GuBytes:f}}({P:fa,a:BigInt(486662),montgomeryBits:255,nByteLength:32,Gu:BigInt(9),powPminus2:e=>{const t=fa,{pow_p_5_8:r,b2:n}=Ea(e);return zi(Wi(r,ba,t)*n,t)},adjustScalarBytes:Sa,randomBytes:Hr}))(),Ta=32,Ca=64,Na=32;function xa(e,t){const r=new Uint8Array(Ca);for(let n=0;nSr(Ba)}(La||(La={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.Type&&(t.uint32(8),La.codec().encode(e.Type,t)),null!=e.Data&&(t.uint32(18),t.bytes(e.Data)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t)=>{const r={},n=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:r.Type=La.codec().decode(e);break;case 2:r.Data=e.bytes();break;default:e.skipType(7&t)}}return r}))),t),e.encode=t=>jt(t,e.codec()),e.decode=t=>Y(t,e.codec())}(Ua||(Ua={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.Type&&(t.uint32(8),La.codec().encode(e.Type,t)),null!=e.Data&&(t.uint32(18),t.bytes(e.Data)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t)=>{const r={},n=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:r.Type=La.codec().decode(e);break;case 2:r.Data=e.bytes();break;default:e.skipType(7&t)}}return r}))),t),e.encode=t=>jt(t,e.codec()),e.decode=t=>Y(t,e.codec())}(Ma||(Ma={}));class Fa{_key;constructor(e){this._key=Ka(e,Ta)}verify(e,t){return function(e,t,r){return Ia.verify(t,r instanceof Uint8Array?r:r.subarray(),e)}(this._key,t,e)}marshal(){return this._key}get bytes(){return Ua.encode({Type:La.Ed25519,Data:this.marshal()}).subarray()}equals(e){return Pn(this.bytes,e.bytes)}hash(){const e=gt.digest(this.bytes);return Zo(e)?e.then((({bytes:e})=>e)):e.bytes}}class $a{_key;_publicKey;constructor(e,t){this._key=Ka(e,Ca),this._publicKey=Ka(t,Ta)}sign(e){return function(e,t){const r=e.subarray(0,Na);return Ia.sign(t instanceof Uint8Array?t:t.subarray(),r)}(this._key,e)}get public(){return new Fa(this._publicKey)}marshal(){return this._key}get bytes(){return Ma.encode({Type:La.Ed25519,Data:this.marshal()}).subarray()}equals(e){return Pn(this.bytes,e.bytes)}async hash(){const e=gt.digest(this.bytes);let t;return Zo(e)?({bytes:t}=await e):t=e.bytes,t}async id(){const e=ht.digest(this.public.bytes);return ke.encode(e.bytes).substring(1)}async export(e,t="libp2p-key"){if("libp2p-key"===t)return Da(this.bytes,e);throw new eo(`export format '${t}' is not supported`,"ERR_INVALID_EXPORT_FORMAT")}}function Ha(e){if(e.length>Ca){const t=(e=Ka(e,Ca+Ta)).subarray(0,Ca),r=e.subarray(Ca,e.length);return new $a(t,r)}const t=(e=Ka(e,Ca)).subarray(0,Ca),r=e.subarray(Ta);return new $a(t,r)}function qa(e){return e=Ka(e,Ta),new Fa(e)}async function Va(){const{privateKey:e,publicKey:t}=function(){const e=Ia.utils.randomPrivateKey(),t=Ia.getPublicKey(e);return{privateKey:xa(e,t),publicKey:t}}();return new $a(e,t)}async function ja(e){const{privateKey:t,publicKey:r}=function(e){if(e.length!==Na)throw new TypeError('"seed" must be 32 bytes in length.');if(!(e instanceof Uint8Array))throw new TypeError('"seed" must be a node.js Buffer, or Uint8Array.');const t=e,r=Ia.getPublicKey(t);return{privateKey:xa(t,r),publicKey:r}}(e);return new $a(t,r)}function Ka(e,t){if((e=Uint8Array.from(e??[])).length!==t)throw new eo(`Key must be a Uint8Array of length ${t}, got ${e.length}`,"ERR_INVALID_KEY_TYPE");return e}async function za(e){const t=[await Pa.get().subtle.importKey("jwk",e,{name:"RSASSA-PKCS1-v1_5",hash:{name:"SHA-256"}},!0,["sign"]),await Wa(e)],r=await Ga({privateKey:t[0],publicKey:t[1]});return{privateKey:r[0],publicKey:r[1]}}async function Ga(e){if(null==e.privateKey||null==e.publicKey)throw new eo("Private and public key are required","ERR_INVALID_PARAMETERS");return Promise.all([Pa.get().subtle.exportKey("jwk",e.privateKey),Pa.get().subtle.exportKey("jwk",e.publicKey)])}async function Wa(e){return Pa.get().subtle.importKey("jwk",{kty:e.kty,n:e.n,e:e.e},{name:"RSASSA-PKCS1-v1_5",hash:{name:"SHA-256"}},!0,["verify"])}function Ya(e){if("RSA"!==e.kty)throw new eo("invalid key type","ERR_INVALID_KEY_TYPE");if(null==e.n)throw new eo("invalid key modulus","ERR_INVALID_KEY_MODULUS");return 8*Nt(e.n,"base64url").length}class Ja extends Mr{constructor(e,t){super(),this.finished=!1,this.destroyed=!1,Nr(e);const r=Ur(t);if(this.iHash=e.create(),"function"!=typeof this.iHash.update)throw new Error("Expected instance of class which extends utils.Hash");this.blockLen=this.iHash.blockLen,this.outputLen=this.iHash.outputLen;const n=this.blockLen,s=new Uint8Array(n);s.set(r.length>n?e.create().update(r).digest():r);for(let e=0;enew Ja(e,t).update(r).digest();Xa.create=(e,t)=>new Ja(e,t);var Qa=__webpack_require__(152);function Za(e,t){let r=0;if(1===e.length)return e[0];for(let n=e.length-1;n>=0;n--)r+=e[e.length-1-n]*Math.pow(2,t*n);return r}function ec(e,t,r=-1){const n=r;let s=e,o=0,i=Math.pow(2,t);for(let r=1;r<8;r++){if(e=0;e--){const r=Math.pow(2,e*t);i[o-e-1]=Math.floor(s/r),s-=i[o-e-1]*r}return e}i*=Math.pow(2,t)}return new ArrayBuffer(0)}function tc(...e){let t=0,r=0;for(const r of e)t+=r.length;const n=new ArrayBuffer(t),s=new Uint8Array(n);for(const t of e)s.set(t,r),r+=t.length;return s}function rc(){const e=new Uint8Array(this.valueHex);if(this.valueHex.byteLength>=2){const t=255===e[0]&&128&e[1],r=0===e[0]&&!(128&e[1]);(t||r)&&this.warnings.push("Needlessly long format")}const t=new ArrayBuffer(this.valueHex.byteLength),r=new Uint8Array(t);for(let e=0;e=s.length)return this.error="End of input reached before message was fully decoded",-1;if(e===r){r+=255;const e=new Uint8Array(r);for(let r=0;r8)return this.error="Too big integer",-1;if(o+1>s.length)return this.error="End of input reached before message was fully decoded",-1;const i=t+1,a=n.subarray(i,i+o);return 0===a[o-1]&&this.warnings.push("Needlessly long encoded length"),this.length=Za(a,8),this.longFormUsed&&this.length<=127&&this.warnings.push("Unnecessary usage of long length form"),this.blockLength=o+1,t+this.blockLength}toBER(e=!1){let t,r;if(this.length>127&&(this.longFormUsed=!0),this.isIndefiniteForm)return t=new ArrayBuffer(1),!1===e&&(r=new Uint8Array(t),r[0]=128),t;if(this.longFormUsed){const n=ec(this.length,8);if(n.byteLength>127)return this.error="Too big length",hc;if(t=new ArrayBuffer(n.byteLength+1),e)return t;const s=new Uint8Array(n);r=new Uint8Array(t),r[0]=128|n.byteLength;for(let e=0;e=37&&!1===s.idBlock.isHexOnly)return s.error="UNIVERSAL 37 and upper tags are reserved by ASN.1 standard",{offset:-1,result:s};switch(s.idBlock.tagNumber){case 0:if(s.idBlock.isConstructed&&s.lenBlock.length>0)return s.error="Type [UNIVERSAL 0] is reserved",{offset:-1,result:s};a=Ec.EndOfContent;break;case 1:a=Ec.Boolean;break;case 2:a=Ec.Integer;break;case 3:a=Ec.BitString;break;case 4:a=Ec.OctetString;break;case 5:a=Ec.Null;break;case 6:a=Ec.ObjectIdentifier;break;case 10:a=Ec.Enumerated;break;case 12:a=Ec.Utf8String;break;case 13:a=Ec.RelativeObjectIdentifier;break;case 14:a=Ec.TIME;break;case 15:return s.error="[UNIVERSAL 15] is reserved by ASN.1 standard",{offset:-1,result:s};case 16:a=Ec.Sequence;break;case 17:a=Ec.Set;break;case 18:a=Ec.NumericString;break;case 19:a=Ec.PrintableString;break;case 20:a=Ec.TeletexString;break;case 21:a=Ec.VideotexString;break;case 22:a=Ec.IA5String;break;case 23:a=Ec.UTCTime;break;case 24:a=Ec.GeneralizedTime;break;case 25:a=Ec.GraphicString;break;case 26:a=Ec.VisibleString;break;case 27:a=Ec.GeneralString;break;case 28:a=Ec.UniversalString;break;case 29:a=Ec.CharacterString;break;case 30:a=Ec.BmpString;break;case 31:a=Ec.DATE;break;case 32:a=Ec.TimeOfDay;break;case 33:a=Ec.DateTime;break;case 34:a=Ec.Duration;break;default:{const e=s.idBlock.isConstructed?new Ec.Constructed:new Ec.Primitive;e.idBlock=s.idBlock,e.lenBlock=s.lenBlock,e.warnings=s.warnings,s=e}}}else a=s.idBlock.isConstructed?Ec.Constructed:Ec.Primitive;return s=function(e,t){if(e instanceof t)return e;const r=new t;return r.idBlock=e.idBlock,r.lenBlock=e.lenBlock,r.warnings=e.warnings,r.valueBeforeDecodeView=e.valueBeforeDecodeView,r}(s,a),i=s.fromBER(e,t,s.lenBlock.isIndefiniteForm?r:s.lenBlock.length),s.valueBeforeDecodeView=e.subarray(n,n+s.blockLength),{offset:i,result:s}}function al(e){if(!e.byteLength){const e=new Sc({},bc);return e.error="Input buffer has zero length",{offset:-1,result:e}}return il(Qa._H.toUint8Array(e).slice(),0,e.byteLength)}Ic=ol,Ec.Primitive=Ic,ol.NAME="PRIMITIVE";class cl extends bc{constructor({value:e=[],isIndefiniteForm:t=!1,...r}={}){super(r),this.value=e,this.isIndefiniteForm=t}fromBER(e,t,r){const n=Qa._H.toUint8Array(e);if(!ic(this,n,t,r))return-1;if(this.valueBeforeDecodeView=n.subarray(t,t+r),0===this.valueBeforeDecodeView.length)return this.warnings.push("Zero buffer length"),t;let s=t;for(;(this.isIndefiniteForm?1:r)>0;){const e=il(n,s,r);if(-1===e.offset)return this.error=e.result.error,this.warnings.concat(e.result.warnings),-1;if(s=e.offset,this.blockLength+=e.result.blockLength,r-=e.result.blockLength,this.value.push(e.result),this.isIndefiniteForm&&e.result.constructor.NAME===pc)break}return this.isIndefiniteForm&&(this.value[this.value.length-1].constructor.NAME===pc?this.value.pop():this.warnings.push("No EndOfContent block encoded")),s}toBER(e,t){const r=t||new ac;for(let t=0;t` ${e}`)).join("\n"));const t=3===this.idBlock.tagClass?`[${this.idBlock.tagNumber}]`:this.constructor.NAME;return e.length?`${t} :\n${e.join("\n")}`:`${t} :`}}Rc=ll,Ec.Constructed=Rc,ll.NAME="CONSTRUCTED";class ul extends bc{fromBER(e,t,r){return t}toBER(e){return hc}}ul.override="EndOfContentValueBlock";class hl extends Sc{constructor(e={}){super(e,ul),this.idBlock.tagClass=1,this.idBlock.tagNumber=0}}Tc=hl,Ec.EndOfContent=Tc,hl.NAME=pc;class dl extends Sc{constructor(e={}){super(e,bc),this.idBlock.tagClass=1,this.idBlock.tagNumber=5}fromBER(e,t,r){return this.lenBlock.length>0&&this.warnings.push("Non-zero length of value block for Null type"),this.idBlock.error.length||(this.blockLength+=this.idBlock.blockLength),this.lenBlock.error.length||(this.blockLength+=this.lenBlock.blockLength),this.blockLength+=r,t+r>e.byteLength?(this.error="End of input reached before message was fully decoded (inconsistent offset and length values)",-1):t+r}toBER(e,t){const r=new ArrayBuffer(2);if(!e){const e=new Uint8Array(r);e[0]=5,e[1]=0}return t&&t.write(r),r}onAsciiEncoding(){return`${this.constructor.NAME}`}}Cc=dl,Ec.Null=Cc,dl.NAME="NULL";class pl extends(yc(bc)){constructor({value:e,...t}={}){super(t),t.valueHex?this.valueHexView=Qa._H.toUint8Array(t.valueHex):this.valueHexView=new Uint8Array(1),e&&(this.value=e)}get value(){for(const e of this.valueHexView)if(e>0)return!0;return!1}set value(e){this.valueHexView[0]=e?255:0}fromBER(e,t,r){const n=Qa._H.toUint8Array(e);return ic(this,n,t,r)?(this.valueHexView=n.subarray(t,t+r),r>1&&this.warnings.push("Boolean value encoded in more then 1 octet"),this.isHexOnly=!0,rc.call(this),this.blockLength=r,t+r):-1}toBER(){return this.valueHexView.slice()}toJSON(){return{...super.toJSON(),value:this.value}}}pl.NAME="BooleanValueBlock";class fl extends Sc{constructor(e={}){super(e,pl),this.idBlock.tagClass=1,this.idBlock.tagNumber=1}getValue(){return this.valueBlock.value}setValue(e){this.valueBlock.value=e}onAsciiEncoding(){return`${this.constructor.NAME} : ${this.getValue}`}}Nc=fl,Ec.Boolean=Nc,fl.NAME="BOOLEAN";class gl extends(yc(cl)){constructor({isConstructed:e=!1,...t}={}){super(t),this.isConstructed=e}fromBER(e,t,r){let n=0;if(this.isConstructed){if(this.isHexOnly=!1,n=cl.prototype.fromBER.call(this,e,t,r),-1===n)return n;for(let e=0;e0&&r.unusedBits>0)return this.error='Using of "unused bits" inside constructive BIT STRING allowed for least one only',-1;this.unusedBits=r.unusedBits}return n}const s=Qa._H.toUint8Array(e);if(!ic(this,s,t,r))return-1;const o=s.subarray(t,t+r);if(this.unusedBits=o[0],this.unusedBits>7)return this.error="Unused bits for BitString must be in range 0-7",-1;if(!this.unusedBits){const e=o.subarray(1);try{if(e.byteLength){const t=il(e,0,e.byteLength);-1!==t.offset&&t.offset===r-1&&(this.value=[t.result])}}catch(e){}}return this.valueHexView=o.subarray(1),this.blockLength=o.length,t+r}toBER(e,t){if(this.isConstructed)return cl.prototype.toBER.call(this,e,t);if(e)return new ArrayBuffer(this.valueHexView.byteLength+1);if(!this.valueHexView.byteLength)return hc;const r=new Uint8Array(this.valueHexView.length+1);return r[0]=this.unusedBits,r.set(this.valueHexView,1),r.buffer}toJSON(){return{...super.toJSON(),unusedBits:this.unusedBits,isConstructed:this.isConstructed}}}ml.NAME="BitStringValueBlock";class bl extends Sc{constructor({idBlock:e={},lenBlock:t={},...r}={}){var n,s;null!==(n=r.isConstructed)&&void 0!==n||(r.isConstructed=!!(null===(s=r.value)||void 0===s?void 0:s.length)),super({idBlock:{isConstructed:r.isConstructed,...e},lenBlock:{...t,isIndefiniteForm:!!r.isIndefiniteForm},...r},ml),this.idBlock.tagClass=1,this.idBlock.tagNumber=3}fromBER(e,t,r){return this.valueBlock.isConstructed=this.idBlock.isConstructed,this.valueBlock.isIndefiniteForm=this.lenBlock.isIndefiniteForm,super.fromBER(e,t,r)}onAsciiEncoding(){if(this.valueBlock.isConstructed||this.valueBlock.value&&this.valueBlock.value.length)return ll.prototype.onAsciiEncoding.call(this);{const e=[],t=this.valueBlock.valueHexView;for(const r of t)e.push(r.toString(2).padStart(8,"0"));const r=e.join("");return`${this.constructor.NAME} : ${r.substring(0,r.length-this.valueBlock.unusedBits)}`}}}function wl(e,t){const r=new Uint8Array([0]),n=new Uint8Array(e),s=new Uint8Array(t);let o=n.slice(0);const i=o.length-1,a=s.slice(0),c=a.length-1;let l=0,u=0;for(let e=c=0;e--,u++)l=1==u=o.length?o=tc(new Uint8Array([l%10]),o):o[i-u]=l%10;return r[0]>0&&(o=tc(r,o)),o}function vl(e){if(e>=cc.length)for(let t=cc.length;t<=e;t++){const e=new Uint8Array([0]);let r=cc[t-1].slice(0);for(let t=r.length-1;t>=0;t--){const n=new Uint8Array([(r[t]<<1)+e[0]]);e[0]=n[0]/10,r[t]=n[0]%10}e[0]>0&&(r=tc(e,r)),cc.push(r)}return cc[e]}function El(e,t){let r=0;const n=new Uint8Array(e),s=new Uint8Array(t),o=n.slice(0),i=o.length-1,a=s.slice(0),c=a.length-1;let l,u=0;for(let e=c;e>=0;e--,u++)l=o[i-u]-a[c-u]-r,1==l<0?(r=1,o[i-u]=l+10):(r=0,o[i-u]=l);if(r>0)for(let e=i-c+1;e>=0;e--,u++){if(l=o[i-u]-r,!(l<0)){r=0,o[i-u]=l;break}r=1,o[i-u]=l+10}return o.slice()}Pc=bl,Ec.BitString=Pc,bl.NAME=gc;class Sl extends(yc(bc)){constructor({value:e,...t}={}){super(t),this._valueDec=0,t.valueHex&&this.setValueHex(),void 0!==e&&(this.valueDec=e)}setValueHex(){this.valueHexView.length>=4?(this.warnings.push("Too big Integer for decoding, hex only"),this.isHexOnly=!0,this._valueDec=0):(this.isHexOnly=!1,this.valueHexView.length>0&&(this._valueDec=rc.call(this)))}set valueDec(e){this._valueDec=e,this.isHexOnly=!1,this.valueHexView=new Uint8Array(function(e){const t=e<0?-1*e:e;let r=128;for(let n=1;n<8;n++){if(t<=r){if(e<0){const e=ec(r-t,8,n);return new Uint8Array(e)[0]|=128,e}let s=ec(t,8,n),o=new Uint8Array(s);if(128&o[0]){const e=s.slice(0),t=new Uint8Array(e);s=new ArrayBuffer(s.byteLength+1),o=new Uint8Array(s);for(let r=0;r1&&(n=o.length+1),this.valueHexView=o.subarray(n-o.length)),s}toDER(e=!1){const t=this.valueHexView;switch(!0){case!!(128&t[0]):{const e=new Uint8Array(this.valueHexView.length+1);e[0]=0,e.set(t,1),this.valueHexView=e}break;case 0===t[0]&&!(128&t[1]):this.valueHexView=this.valueHexView.subarray(1)}return this.toBER(e)}fromBER(e,t,r){const n=super.fromBER(e,t,r);return-1===n||this.setValueHex(),n}toBER(e){return e?new ArrayBuffer(this.valueHexView.length):this.valueHexView.slice().buffer}toJSON(){return{...super.toJSON(),valueDec:this.valueDec}}toString(){const e=8*this.valueHexView.length-1;let t,r=new Uint8Array(8*this.valueHexView.length/3),n=0;const s=this.valueHexView;let o="",i=!1;for(let i=s.byteLength-1;i>=0;i--){t=s[i];for(let s=0;s<8;s++)1&~t||(n===e?(r=El(vl(n),r),o="-"):r=wl(r,vl(n))),n++,t>>=1}for(let e=0;e0;){const t=new kl;if(n=t.fromBER(e,n,r),-1===n)return this.blockLength=0,this.error=t.error,n;0===this.value.length&&(t.isFirstSid=!0),this.blockLength+=t.blockLength,r-=t.blockLength,this.value.push(t)}return n}toBER(e){const t=[];for(let r=0;rNumber.MAX_SAFE_INTEGER){sc();const t=BigInt(n);e.valueBigInt=t}else if(e.valueDec=parseInt(n,10),isNaN(e.valueDec))return;this.value.length||(e.isFirstSid=!0,s=!0),this.value.push(e)}}while(-1!==r)}toString(){let e="",t=!1;for(let r=0;r0;){const t=new Tl;if(n=t.fromBER(e,n,r),-1===n)return this.blockLength=0,this.error=t.error,n;this.blockLength+=t.blockLength,r-=t.blockLength,this.value.push(t)}return n}toBER(e,t){const r=[];for(let t=0;t4)continue;const o=4-s.length;for(let e=s.length-1;e>=0;e--)r[4*n+e+o]=s[e]}this.valueBlock.value=e}}$l.NAME="UniversalStringValueBlock";class Hl extends $l{constructor({...e}={}){super(e),this.idBlock.tagClass=1,this.idBlock.tagNumber=28}}qc=Hl,Ec.UniversalString=qc,Hl.NAME="UniversalString";class ql extends Ll{constructor(e={}){super(e),this.idBlock.tagClass=1,this.idBlock.tagNumber=18}}Vc=ql,Ec.NumericString=Vc,ql.NAME="NumericString";class Vl extends Ll{constructor(e={}){super(e),this.idBlock.tagClass=1,this.idBlock.tagNumber=19}}jc=Vl,Ec.PrintableString=jc,Vl.NAME="PrintableString";class jl extends Ll{constructor(e={}){super(e),this.idBlock.tagClass=1,this.idBlock.tagNumber=20}}Kc=jl,Ec.TeletexString=Kc,jl.NAME="TeletexString";class Kl extends Ll{constructor(e={}){super(e),this.idBlock.tagClass=1,this.idBlock.tagNumber=21}}zc=Kl,Ec.VideotexString=zc,Kl.NAME="VideotexString";class zl extends Ll{constructor(e={}){super(e),this.idBlock.tagClass=1,this.idBlock.tagNumber=22}}Gc=zl,Ec.IA5String=Gc,zl.NAME="IA5String";class Gl extends Ll{constructor(e={}){super(e),this.idBlock.tagClass=1,this.idBlock.tagNumber=25}}Wc=Gl,Ec.GraphicString=Wc,Gl.NAME="GraphicString";class Wl extends Ll{constructor(e={}){super(e),this.idBlock.tagClass=1,this.idBlock.tagNumber=26}}Yc=Wl,Ec.VisibleString=Yc,Wl.NAME="VisibleString";class Yl extends Ll{constructor(e={}){super(e),this.idBlock.tagClass=1,this.idBlock.tagNumber=27}}Jc=Yl,Ec.GeneralString=Jc,Yl.NAME="GeneralString";class Jl extends Ll{constructor(e={}){super(e),this.idBlock.tagClass=1,this.idBlock.tagNumber=29}}Xc=Jl,Ec.CharacterString=Xc,Jl.NAME="CharacterString";class Xl extends Wl{constructor({value:e,valueDate:t,...r}={}){if(super(r),this.year=0,this.month=0,this.day=0,this.hour=0,this.minute=0,this.second=0,e){this.fromString(e),this.valueBlock.valueHexView=new Uint8Array(e.length);for(let t=0;t=50?1900+r:2e3+r,this.month=parseInt(t[2],10),this.day=parseInt(t[3],10),this.hour=parseInt(t[4],10),this.minute=parseInt(t[5],10),this.second=parseInt(t[6],10)}toString(e="iso"){if("iso"===e){const e=new Array(7);return e[0]=nc(this.year<2e3?this.year-1900:this.year-2e3,2),e[1]=nc(this.month,2),e[2]=nc(this.day,2),e[3]=nc(this.hour,2),e[4]=nc(this.minute,2),e[5]=nc(this.second,2),e[6]="Z",e.join("")}return super.toString(e)}onAsciiEncoding(){return`${this.constructor.NAME} : ${this.toDate().toISOString()}`}toJSON(){return{...super.toJSON(),year:this.year,month:this.month,day:this.day,hour:this.hour,minute:this.minute,second:this.second}}}Qc=Xl,Ec.UTCTime=Qc,Xl.NAME="UTCTime";class Ql extends Xl{constructor(e={}){var t;super(e),null!==(t=this.millisecond)&&void 0!==t||(this.millisecond=0),this.idBlock.tagClass=1,this.idBlock.tagNumber=24}fromDate(e){super.fromDate(e),this.millisecond=e.getUTCMilliseconds()}toDate(){return new Date(Date.UTC(this.year,this.month-1,this.day,this.hour,this.minute,this.second,this.millisecond))}fromString(e){let t,r=!1,n="",s="",o=0,i=0,a=0;if("Z"===e[e.length-1])n=e.substring(0,e.length-1),r=!0;else{const t=new Number(e[e.length-1]);if(isNaN(t.valueOf()))throw new Error("Wrong input string for conversion");n=e}if(r){if(-1!==n.indexOf("+"))throw new Error("Wrong input string for conversion");if(-1!==n.indexOf("-"))throw new Error("Wrong input string for conversion")}else{let e=1,t=n.indexOf("+"),r="";if(-1===t&&(t=n.indexOf("-"),e=-1),-1!==t){if(r=n.substring(t+1),n=n.substring(0,t),2!==r.length&&4!==r.length)throw new Error("Wrong input string for conversion");let s=parseInt(r.substring(0,2),10);if(isNaN(s.valueOf()))throw new Error("Wrong input string for conversion");if(i=e*s,4===r.length){if(s=parseInt(r.substring(2,4),10),isNaN(s.valueOf()))throw new Error("Wrong input string for conversion");a=e*s}}}let c=n.indexOf(".");if(-1===c&&(c=n.indexOf(",")),-1!==c){const e=new Number(`0${n.substring(c)}`);if(isNaN(e.valueOf()))throw new Error("Wrong input string for conversion");o=e.valueOf(),s=n.substring(0,c)}else s=n;switch(!0){case 8===s.length:if(t=/(\d{4})(\d{2})(\d{2})/gi,-1!==c)throw new Error("Wrong input string for conversion");break;case 10===s.length:if(t=/(\d{4})(\d{2})(\d{2})(\d{2})/gi,-1!==c){let e=60*o;this.minute=Math.floor(e),e=60*(e-this.minute),this.second=Math.floor(e),e=1e3*(e-this.second),this.millisecond=Math.floor(e)}break;case 12===s.length:if(t=/(\d{4})(\d{2})(\d{2})(\d{2})(\d{2})/gi,-1!==c){let e=60*o;this.second=Math.floor(e),e=1e3*(e-this.second),this.millisecond=Math.floor(e)}break;case 14===s.length:if(t=/(\d{4})(\d{2})(\d{2})(\d{2})(\d{2})(\d{2})/gi,-1!==c){const e=1e3*o;this.millisecond=Math.floor(e)}break;default:throw new Error("Wrong input string for conversion")}const l=t.exec(s);if(null===l)throw new Error("Wrong input string for conversion");for(let e=1;e0&&(t=`0${t}`);const r=t.length/2,n=new Uint8Array(r);let s=0,o=0;for(;s0&&(r=`0${r}`),t.push(r)})),BigInt("0x"+t.join(""))}sl=nu,Ec.TIME=sl,nu.NAME="TIME";async function au(e,t){const r=Pa.get(),n=new xl({value:[new Al({value:0}),new xl({value:[new Rl({value:"1.2.840.113549.1.1.1"}),new dl]}),new yl({valueHex:e.marshal()})]}).toBER(),s=new Uint8Array(n,0,n.byteLength),o=su(16),i=await async function(e,t,r,n){const{c:s,dkLen:o,asyncTick:i,DK:a,PRF:c,PRFSalt:l}=function(e,t,r,n){Nr(e);const s=function(e,t){if(void 0!==t&&"[object Object]"!==Fr.call(t))throw new Error("Options should be object or undefined");return Object.assign({dkLen:32,asyncTick:10},t)}(0,n),{c:o,dkLen:i,asyncTick:a}=s;if(Tr(o),Tr(i),Tr(a),o<1)throw new Error("PBKDF2: iterations (c) should be >= 1");const c=Ur(t),l=Ur(r),u=new Uint8Array(i),h=Xa.create(e,c),d=h._cloneInto().update(l);return{c:o,dkLen:i,asyncTick:a,DK:u,PRF:h,PRFSalt:d}}(e,t,r,n);let u;const h=new Uint8Array(4),d=Or(h),p=new Uint8Array(c.outputLen);for(let e=1,t=0;t{c._cloneInto(u).update(p).digestInto(p);for(let e=0;ee)):e.bytes}}class uu{_key;_publicKey;constructor(e,t){this._key=e,this._publicKey=t}genSecret(){return su(16)}sign(e){return async function(e,t){const r=await Pa.get().subtle.importKey("jwk",e,{name:"RSASSA-PKCS1-v1_5",hash:{name:"SHA-256"}},!1,["sign"]),n=await Pa.get().subtle.sign({name:"RSASSA-PKCS1-v1_5"},r,t instanceof Uint8Array?t:t.subarray());return new Uint8Array(n,0,n.byteLength)}(this._key,e)}get public(){if(null==this._publicKey)throw new eo("public key not provided","ERR_PUBKEY_NOT_PROVIDED");return new lu(this._publicKey)}marshal(){return function(e){if(null==e.n||null==e.e||null==e.d||null==e.p||null==e.q||null==e.dp||null==e.dq||null==e.qi)throw new eo("JWK was missing components","ERR_INVALID_PARAMETERS");const t=new xl({value:[new Al({value:0}),Al.fromBigInt(iu(Nt(e.n,"base64url"))),Al.fromBigInt(iu(Nt(e.e,"base64url"))),Al.fromBigInt(iu(Nt(e.d,"base64url"))),Al.fromBigInt(iu(Nt(e.p,"base64url"))),Al.fromBigInt(iu(Nt(e.q,"base64url"))),Al.fromBigInt(iu(Nt(e.dp,"base64url"))),Al.fromBigInt(iu(Nt(e.dq,"base64url"))),Al.fromBigInt(iu(Nt(e.qi,"base64url")))]}).toBER();return new Uint8Array(t,0,t.byteLength)}(this._key)}get bytes(){return Ma.encode({Type:La.RSA,Data:this.marshal()}).subarray()}equals(e){return Pn(this.bytes,e.bytes)}hash(){const e=gt.digest(this.bytes);return Zo(e)?e.then((({bytes:e})=>e)):e.bytes}async id(){return sn(await this.public.hash(),"base58btc")}async export(e,t="pkcs-8"){if("pkcs-8"===t)return au(this,e);if("libp2p-key"===t)return Da(this.bytes,e);throw new eo(`export format '${t}' is not supported`,"ERR_INVALID_EXPORT_FORMAT")}}async function hu(e){const t=function(e){const{result:t}=al(e),r=t.valueBlock.value;return{n:sn(ou(r[1].toBigInt()),"base64url"),e:sn(ou(r[2].toBigInt()),"base64url"),d:sn(ou(r[3].toBigInt()),"base64url"),p:sn(ou(r[4].toBigInt()),"base64url"),q:sn(ou(r[5].toBigInt()),"base64url"),dp:sn(ou(r[6].toBigInt()),"base64url"),dq:sn(ou(r[7].toBigInt()),"base64url"),qi:sn(ou(r[8].toBigInt()),"base64url"),kty:"RSA",alg:"RS256"}}(e);if(Ya(t)>cu)throw new eo("key size is too large","ERR_KEY_SIZE_TOO_LARGE");const r=await za(t);return new uu(r.privateKey,r.publicKey)}function du(e){const t=function(e){const{result:t}=al(e),r=t.valueBlock.value[1].valueBlock.value[0].valueBlock.value;return{kty:"RSA",n:sn(ou(r[0].toBigInt()),"base64url"),e:sn(ou(r[1].toBigInt()),"base64url")}}(e);if(Ya(t)>cu)throw new eo("key size is too large","ERR_KEY_SIZE_TOO_LARGE");return new lu(t)}async function pu(e){if(Ya(e)>cu)throw new eo("key size is too large","ERR_KEY_SIZE_TOO_LARGE");const t=await za(e);return new uu(t.privateKey,t.publicKey)}async function fu(e){if(e>cu)throw new eo("key size is too large","ERR_KEY_SIZE_TOO_LARGE");const t=await async function(e){const t=await Pa.get().subtle.generateKey({name:"RSASSA-PKCS1-v1_5",modulusLength:e,publicExponent:new Uint8Array([1,0,1]),hash:{name:"SHA-256"}},!0,["sign","verify"]),r=await Ga(t);return{privateKey:r[0],publicKey:r[1]}}(e);return new uu(t.privateKey,t.publicKey)}function gu(e){void 0!==e.lowS&&yi("lowS",e.lowS),void 0!==e.prehash&&yi("prehash",e.prehash)}const{Ph:yu,aT:mu}=f,bu={Err:class extends Error{constructor(e=""){super(e)}},_parseInt(e){const{Err:t}=bu;if(e.length<2||2!==e[0])throw new t("Invalid signature integer tag");const r=e[1],n=e.subarray(2,r+2);if(!r||n.length!==r)throw new t("Invalid signature integer: wrong length");if(128&n[0])throw new t("Invalid signature integer: negative");if(0===n[0]&&!(128&n[1]))throw new t("Invalid signature integer: unnecessary leading zero");return{d:yu(n),l:e.subarray(r+2)}},toSig(e){const{Err:t}=bu,r="string"==typeof e?mu(e):e;gi(r);let n=r.length;if(n<2||48!=r[0])throw new t("Invalid signature tag");if(r[1]!==n-2)throw new t("Invalid signature: incorrect length");const{d:s,l:o}=bu._parseInt(r.subarray(2)),{d:i,l:a}=bu._parseInt(o);if(a.length)throw new t("Invalid signature: left bytes after parsing");return{r:s,s:i}},hexFromSig(e){const t=e=>8&Number.parseInt(e[0],16)?"00"+e:e,r=e=>{const t=e.toString(16);return 1&t.length?`0${t}`:t},n=t(r(e.s)),s=t(r(e.r)),o=n.length/2,i=s.length/2,a=r(o),c=r(i);return`30${r(i+o+4)}02${c}${s}02${a}${n}`}},wu=BigInt(0),vu=BigInt(1),Eu=(BigInt(2),BigInt(3));function Su(e){const t=function(e){const t=ia(e);return Ui(t,{hash:"hash",hmac:"function",randomBytes:"function"},{bits2int:"function",bits2int_modN:"function",lowS:"boolean"}),Object.freeze({lowS:!0,...t})}(e),{Fp:r,n}=t,s=r.BYTES+1,o=2*r.BYTES+1;function i(e){return zi(e,n)}function a(e){return Yi(e,n)}const{ProjectivePoint:c,normPrivateKeyToScalar:l,weierstrassEquation:u,isWithinCurveOrder:h}=function(e){const t=function(e){const t=ia(e);Ui(t,{a:"field",b:"field"},{allowedPrivateKeyLengths:"array",wrapPrivateKey:"boolean",isTorsionFree:"function",clearCofactor:"function",allowInfinityPoint:"boolean",fromBytes:"function",toBytes:"function"});const{endo:r,Fp:n,a:s}=t;if(r){if(!n.eql(s,n.ZERO))throw new Error("Endomorphism can only be defined for Koblitz curves that have a=0");if("object"!=typeof r||"bigint"!=typeof r.beta||"function"!=typeof r.splitScalar)throw new Error("Expected endomorphism with beta: bigint and splitScalar: function")}return Object.freeze({...t})}(e),{Fp:r}=t,n=t.toBytes||((e,t,n)=>{const s=t.toAffine();return Ti(Uint8Array.from([4]),r.toBytes(s.x),r.toBytes(s.y))}),s=t.fromBytes||(e=>{const t=e.subarray(1);return{x:r.fromBytes(t.subarray(0,r.BYTES)),y:r.fromBytes(t.subarray(r.BYTES,2*r.BYTES))}});function o(e){const{a:n,b:s}=t,o=r.sqr(e),i=r.mul(o,e);return r.add(r.add(i,r.mul(e,n)),s)}if(!r.eql(r.sqr(t.Gy),o(t.Gx)))throw new Error("bad generator point: equation left != right");function i(e){const{allowedPrivateKeyLengths:r,nByteLength:n,wrapPrivateKey:s,n:o}=t;if(r&&"bigint"!=typeof e){if(fi(e)&&(e=bi(e)),"string"!=typeof e||!r.includes(e.length))throw new Error("Invalid key");e=e.padStart(2*n,"0")}let i;try{i="bigint"==typeof e?e:Ai(Ri("private key",e,n))}catch(t){throw new Error(`private key must be ${n} bytes, hex or bigint, not ${typeof e}`)}return s&&(i=zi(i,o)),xi("private key",i,vu,o),i}function a(e){if(!(e instanceof u))throw new Error("ProjectivePoint expected")}const c=Mi(((e,t)=>{const{px:n,py:s,pz:o}=e;if(r.eql(o,r.ONE))return{x:n,y:s};const i=e.is0();null==t&&(t=i?r.ONE:r.inv(o));const a=r.mul(n,t),c=r.mul(s,t),l=r.mul(o,t);if(i)return{x:r.ZERO,y:r.ZERO};if(!r.eql(l,r.ONE))throw new Error("invZ was invalid");return{x:a,y:c}})),l=Mi((e=>{if(e.is0()){if(t.allowInfinityPoint&&!r.is0(e.py))return;throw new Error("bad point: ZERO")}const{x:n,y:s}=e.toAffine();if(!r.isValid(n)||!r.isValid(s))throw new Error("bad point: x or y not FE");const i=r.sqr(s),a=o(n);if(!r.eql(i,a))throw new Error("bad point: equation left != right");if(!e.isTorsionFree())throw new Error("bad point: not in prime-order subgroup");return!0}));class u{constructor(e,t,n){if(this.px=e,this.py=t,this.pz=n,null==e||!r.isValid(e))throw new Error("x required");if(null==t||!r.isValid(t))throw new Error("y required");if(null==n||!r.isValid(n))throw new Error("z required");Object.freeze(this)}static fromAffine(e){const{x:t,y:n}=e||{};if(!e||!r.isValid(t)||!r.isValid(n))throw new Error("invalid affine point");if(e instanceof u)throw new Error("projective point not allowed");const s=e=>r.eql(e,r.ZERO);return s(t)&&s(n)?u.ZERO:new u(t,n,r.ONE)}get x(){return this.toAffine().x}get y(){return this.toAffine().y}static normalizeZ(e){const t=r.invertBatch(e.map((e=>e.pz)));return e.map(((e,r)=>e.toAffine(t[r]))).map(u.fromAffine)}static fromHex(e){const t=u.fromAffine(s(Ri("pointHex",e)));return t.assertValidity(),t}static fromPrivateKey(e){return u.BASE.multiply(i(e))}_setWindowSize(e){d.setWindowSize(this,e)}assertValidity(){l(this)}hasEvenY(){const{y:e}=this.toAffine();if(r.isOdd)return!r.isOdd(e);throw new Error("Field doesn't support isOdd")}equals(e){a(e);const{px:t,py:n,pz:s}=this,{px:o,py:i,pz:c}=e,l=r.eql(r.mul(t,c),r.mul(o,s)),u=r.eql(r.mul(n,c),r.mul(i,s));return l&&u}negate(){return new u(this.px,r.neg(this.py),this.pz)}double(){const{a:e,b:n}=t,s=r.mul(n,Eu),{px:o,py:i,pz:a}=this;let c=r.ZERO,l=r.ZERO,h=r.ZERO,d=r.mul(o,o),p=r.mul(i,i),f=r.mul(a,a),g=r.mul(o,i);return g=r.add(g,g),h=r.mul(o,a),h=r.add(h,h),c=r.mul(e,h),l=r.mul(s,f),l=r.add(c,l),c=r.sub(p,l),l=r.add(p,l),l=r.mul(c,l),c=r.mul(g,c),h=r.mul(s,h),f=r.mul(e,f),g=r.sub(d,f),g=r.mul(e,g),g=r.add(g,h),h=r.add(d,d),d=r.add(h,d),d=r.add(d,f),d=r.mul(d,g),l=r.add(l,d),f=r.mul(i,a),f=r.add(f,f),d=r.mul(f,g),c=r.sub(c,d),h=r.mul(f,p),h=r.add(h,h),h=r.add(h,h),new u(c,l,h)}add(e){a(e);const{px:n,py:s,pz:o}=this,{px:i,py:c,pz:l}=e;let h=r.ZERO,d=r.ZERO,p=r.ZERO;const f=t.a,g=r.mul(t.b,Eu);let y=r.mul(n,i),m=r.mul(s,c),b=r.mul(o,l),w=r.add(n,s),v=r.add(i,c);w=r.mul(w,v),v=r.add(y,m),w=r.sub(w,v),v=r.add(n,o);let E=r.add(i,l);return v=r.mul(v,E),E=r.add(y,b),v=r.sub(v,E),E=r.add(s,o),h=r.add(c,l),E=r.mul(E,h),h=r.add(m,b),E=r.sub(E,h),p=r.mul(f,v),h=r.mul(g,b),p=r.add(h,p),h=r.sub(m,p),p=r.add(m,p),d=r.mul(h,p),m=r.add(y,y),m=r.add(m,y),b=r.mul(f,b),v=r.mul(g,v),m=r.add(m,b),b=r.sub(y,b),b=r.mul(f,b),v=r.add(v,b),y=r.mul(m,v),d=r.add(d,y),y=r.mul(E,v),h=r.mul(w,h),h=r.sub(h,y),y=r.mul(w,m),p=r.mul(E,p),p=r.add(p,y),new u(h,d,p)}subtract(e){return this.add(e.negate())}is0(){return this.equals(u.ZERO)}wNAF(e){return d.wNAFCached(this,e,u.normalizeZ)}multiplyUnsafe(e){xi("scalar",e,wu,t.n);const n=u.ZERO;if(e===wu)return n;if(e===vu)return this;const{endo:s}=t;if(!s)return d.unsafeLadder(this,e);let{k1neg:o,k1:i,k2neg:a,k2:c}=s.splitScalar(e),l=n,h=n,p=this;for(;i>wu||c>wu;)i&vu&&(l=l.add(p)),c&vu&&(h=h.add(p)),p=p.double(),i>>=vu,c>>=vu;return o&&(l=l.negate()),a&&(h=h.negate()),h=new u(r.mul(h.px,s.beta),h.py,h.pz),l.add(h)}multiply(e){const{endo:n,n:s}=t;let o,i;if(xi("scalar",e,vu,s),n){const{k1neg:t,k1:s,k2neg:a,k2:c}=n.splitScalar(e);let{p:l,f:h}=this.wNAF(s),{p,f}=this.wNAF(c);l=d.constTimeNegate(t,l),p=d.constTimeNegate(a,p),p=new u(r.mul(p.px,n.beta),p.py,p.pz),o=l.add(p),i=h.add(f)}else{const{p:t,f:r}=this.wNAF(e);o=t,i=r}return u.normalizeZ([o,i])[0]}multiplyAndAddUnsafe(e,t,r){const n=u.BASE,s=(e,t)=>t!==wu&&t!==vu&&e.equals(n)?e.multiply(t):e.multiplyUnsafe(t),o=s(this,t).add(s(e,r));return o.is0()?void 0:o}toAffine(e){return c(this,e)}isTorsionFree(){const{h:e,isTorsionFree:r}=t;if(e===vu)return!0;if(r)return r(u,this);throw new Error("isTorsionFree() has not been declared for the elliptic curve")}clearCofactor(){const{h:e,clearCofactor:r}=t;return e===vu?this:r?r(u,this):this.multiplyUnsafe(t.h)}toRawBytes(e=!0){return yi("isCompressed",e),this.assertValidity(),n(u,this,e)}toHex(e=!0){return yi("isCompressed",e),bi(this.toRawBytes(e))}}u.BASE=new u(t.Gx,t.Gy,r.ONE),u.ZERO=new u(r.ZERO,r.ONE,r.ZERO);const h=t.nBitLength,d=oa(u,t.endo?Math.ceil(h/2):h);return{CURVE:t,ProjectivePoint:u,normPrivateKeyToScalar:i,weierstrassEquation:o,isWithinCurveOrder:function(e){return Ni(e,vu,t.n)}}}({...t,toBytes(e,t,n){const s=t.toAffine(),o=r.toBytes(s.x),i=Ti;return yi("isCompressed",n),n?i(Uint8Array.from([t.hasEvenY()?2:3]),o):i(Uint8Array.from([4]),o,r.toBytes(s.y))},fromBytes(e){const t=e.length,n=e[0],i=e.subarray(1);if(t!==s||2!==n&&3!==n){if(t===o&&4===n)return{x:r.fromBytes(i.subarray(0,r.BYTES)),y:r.fromBytes(i.subarray(r.BYTES,2*r.BYTES))};throw new Error(`Point of length ${t} was invalid. Expected ${s} compressed bytes or ${o} uncompressed bytes`)}{const e=Ai(i);if(!Ni(e,vu,r.ORDER))throw new Error("Point is not on curve");const t=u(e);let s;try{s=r.sqrt(t)}catch(e){const t=e instanceof Error?": "+e.message:"";throw new Error("Point is not on curve"+t)}return!(1&~n)!=((s&vu)===vu)&&(s=r.neg(s)),{x:e,y:s}}}}),d=e=>bi(ki(e,t.nByteLength));function p(e){return e>n>>vu}const f=(e,t,r)=>Ai(e.slice(t,r));class g{constructor(e,t,r){this.r=e,this.s=t,this.recovery=r,this.assertValidity()}static fromCompact(e){const r=t.nByteLength;return e=Ri("compactSignature",e,2*r),new g(f(e,0,r),f(e,r,2*r))}static fromDER(e){const{r:t,s:r}=bu.toSig(Ri("DER",e));return new g(t,r)}assertValidity(){xi("r",this.r,vu,n),xi("s",this.s,vu,n)}addRecoveryBit(e){return new g(this.r,this.s,e)}recoverPublicKey(e){const{r:n,s,recovery:o}=this,l=w(Ri("msgHash",e));if(null==o||![0,1,2,3].includes(o))throw new Error("recovery id invalid");const u=2===o||3===o?n+t.n:n;if(u>=r.ORDER)throw new Error("recovery id 2 or 3 invalid");const h=1&o?"03":"02",p=c.fromHex(h+d(u)),f=a(u),g=i(-l*f),y=i(s*f),m=c.BASE.multiplyAndAddUnsafe(p,g,y);if(!m)throw new Error("point at infinify");return m.assertValidity(),m}hasHighS(){return p(this.s)}normalizeS(){return this.hasHighS()?new g(this.r,i(-this.s),this.recovery):this}toDERRawBytes(){return Si(this.toDERHex())}toDERHex(){return bu.hexFromSig({r:this.r,s:this.s})}toCompactRawBytes(){return Si(this.toCompactHex())}toCompactHex(){return d(this.r)+d(this.s)}}const y={isValidPrivateKey(e){try{return l(e),!0}catch(e){return!1}},normPrivateKeyToScalar:l,randomPrivateKey:()=>{const e=ea(t.n);return function(e,t,r=!1){const n=e.length,s=Zi(t),o=ea(t);if(n<16||n1024)throw new Error(`expected ${o}-1024 bytes of input, got ${n}`);const i=zi(r?Ai(e):_i(e),t-$i)+$i;return r?Ii(i,s):ki(i,s)}(t.randomBytes(e),t.n)},precompute:(e=8,t=c.BASE)=>(t._setWindowSize(e),t.multiply(BigInt(3)),t)};function m(e){const t=fi(e),r="string"==typeof e,n=(t||r)&&e.length;return t?n===s||n===o:r?n===2*s||n===2*o:e instanceof c}const b=t.bits2int||function(e){const r=Ai(e),n=8*e.length-t.nBitLength;return n>0?r>>BigInt(n):r},w=t.bits2int_modN||function(e){return i(b(e))},v=Pi(t.nBitLength);function E(e){return xi(`num < 2^${t.nBitLength}`,e,wu,v),ki(e,t.nByteLength)}const S={lowS:t.lowS,prehash:!1},A={lowS:t.lowS,prehash:!1};return c.BASE._setWindowSize(8),{CURVE:t,getPublicKey:function(e,t=!0){return c.fromPrivateKey(e).toRawBytes(t)},getSharedSecret:function(e,t,r=!0){if(m(e))throw new Error("first arg must be private key");if(!m(t))throw new Error("second arg must be public key");return c.fromHex(t).multiply(l(e)).toRawBytes(r)},sign:function(e,n,s=S){const{seed:o,k2sig:u}=function(e,n,s=S){if(["recovered","canonical"].some((e=>e in s)))throw new Error("sign() legacy options not supported");const{hash:o,randomBytes:u}=t;let{lowS:d,prehash:f,extraEntropy:y}=s;null==d&&(d=!0),e=Ri("msgHash",e),gu(s),f&&(e=Ri("prehashed msgHash",o(e)));const m=w(e),v=l(n),A=[E(v),E(m)];if(null!=y&&!1!==y){const e=!0===y?u(r.BYTES):y;A.push(Ri("extraEntropy",e))}const _=Ti(...A),k=m;return{seed:_,k2sig:function(e){const t=b(e);if(!h(t))return;const r=a(t),n=c.BASE.multiply(t).toAffine(),s=i(n.x);if(s===wu)return;const o=i(r*i(k+s*v));if(o===wu)return;let l=(n.x===s?0:2)|Number(n.y&vu),u=o;return d&&p(o)&&(u=function(e){return p(e)?i(-e):e}(o),l^=1),new g(s,u,l)}}}(e,n,s),d=t;return Li(d.hash.outputLen,d.nByteLength,d.hmac)(o,u)},verify:function(e,r,n,s=A){const o=e;if(r=Ri("msgHash",r),n=Ri("publicKey",n),"strict"in s)throw new Error("options.strict was renamed to lowS");gu(s);const{lowS:l,prehash:u}=s;let h,d;try{if("string"==typeof o||fi(o))try{h=g.fromDER(o)}catch(e){if(!(e instanceof bu.Err))throw e;h=g.fromCompact(o)}else{if("object"!=typeof o||"bigint"!=typeof o.r||"bigint"!=typeof o.s)throw new Error("PARSE");{const{r:e,s:t}=o;h=new g(e,t)}}d=c.fromHex(n)}catch(e){if("PARSE"===e.message)throw new Error("signature must be Signature instance, Uint8Array or hex string");return!1}if(l&&h.hasHighS())return!1;u&&(r=t.hash(r));const{r:p,s:f}=h,y=w(r),m=a(f),b=i(y*m),v=i(p*m),E=c.BASE.multiplyAndAddUnsafe(d,b,v)?.toAffine();return!!E&&i(E.x)===p},ProjectivePoint:c,Signature:g,utils:y}}function Au(e){return{hash:e,hmac:(t,...r)=>Xa(e,t,function(...e){let t=0;for(let r=0;r(e+t/Ru)/t;const Cu=Qi(_u,void 0,void 0,{sqrt:function(e){const t=_u,r=BigInt(3),n=BigInt(6),s=BigInt(11),o=BigInt(22),i=BigInt(23),a=BigInt(44),c=BigInt(88),l=e*e*e%t,u=l*l*e%t,h=Wi(u,r,t)*u%t,d=Wi(h,r,t)*u%t,p=Wi(d,Ru,t)*l%t,f=Wi(p,s,t)*p%t,g=Wi(f,o,t)*f%t,y=Wi(g,a,t)*g%t,m=Wi(y,c,t)*y%t,b=Wi(m,a,t)*g%t,w=Wi(b,r,t)*u%t,v=Wi(w,i,t)*f%t,E=Wi(v,n,t)*l%t,S=Wi(E,Ru,t);if(!Cu.eql(Cu.sqr(S),e))throw new Error("Cannot find square root");return S}}),Nu=function(e,t){const r=t=>Su({...e,...Au(t)});return Object.freeze({...r(t),create:r})}({a:BigInt(0),b:BigInt(7),Fp:Cu,n:ku,Gx:BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),Gy:BigInt("32670510020758816978083085130507043184471273380659243275938904335757337482424"),h:BigInt(1),lowS:!0,endo:{beta:BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),splitScalar:e=>{const t=ku,r=BigInt("0x3086d221a7d46bcde86c90e49284eb15"),n=-Iu*BigInt("0xe4437ed6010e88286f547fa90abfe4c3"),s=BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"),o=r,i=BigInt("0x100000000000000000000000000000000"),a=Tu(o*e,t),c=Tu(-n*e,t);let l=zi(e-a*r-c*s,t),u=zi(-a*n-c*o,t);const h=l>i,d=u>i;if(h&&(l=t-l),d&&(u=t-u),l>i||u>i)throw new Error("splitScalar: Endomorphism failed, k="+e);return{k1neg:h,k1:l,k2neg:d,k2:u}}}},Wr);function xu(e){try{Nu.ProjectivePoint.fromHex(e)}catch(e){throw new eo(String(e),"ERR_INVALID_PUBLIC_KEY")}}BigInt(0),Nu.ProjectivePoint;class Pu{_key;constructor(e){xu(e),this._key=e}verify(e,t){return function(e,t,r){const n=gt.digest(r instanceof Uint8Array?r:r.subarray());if(Zo(n))return n.then((({digest:r})=>Nu.verify(t,r,e))).catch((e=>{throw new eo(String(e),"ERR_INVALID_INPUT")}));try{return Nu.verify(t,n.digest,e)}catch(e){throw new eo(String(e),"ERR_INVALID_INPUT")}}(this._key,t,e)}marshal(){return e=this._key,Nu.ProjectivePoint.fromHex(e).toRawBytes(!0);var e}get bytes(){return Ua.encode({Type:La.Secp256k1,Data:this.marshal()}).subarray()}equals(e){return Pn(this.bytes,e.bytes)}async hash(){const e=gt.digest(this.bytes);let t;return Zo(e)?({bytes:t}=await e):t=e.bytes,t}}class Ou{_key;_publicKey;constructor(e,t){this._key=e,this._publicKey=t??function(e){try{return Nu.getPublicKey(e,!0)}catch(e){throw new eo(String(e),"ERR_INVALID_PRIVATE_KEY")}}(e),function(e){try{Nu.getPublicKey(e,!0)}catch(e){throw new eo(String(e),"ERR_INVALID_PRIVATE_KEY")}}(this._key),xu(this._publicKey)}sign(e){return function(e,t){const r=gt.digest(t instanceof Uint8Array?t:t.subarray());if(Zo(r))return r.then((({digest:t})=>Nu.sign(t,e).toDERRawBytes())).catch((e=>{throw new eo(String(e),"ERR_INVALID_INPUT")}));try{return Nu.sign(r.digest,e).toDERRawBytes()}catch(e){throw new eo(String(e),"ERR_INVALID_INPUT")}}(this._key,e)}get public(){return new Pu(this._publicKey)}marshal(){return this._key}get bytes(){return Ma.encode({Type:La.Secp256k1,Data:this.marshal()}).subarray()}equals(e){return Pn(this.bytes,e.bytes)}hash(){const e=gt.digest(this.bytes);return Zo(e)?e.then((({bytes:e})=>e)):e.bytes}async id(){return sn(await this.public.hash(),"base58btc")}async export(e,t="libp2p-key"){if("libp2p-key"===t)return Da(this.bytes,e);throw new eo(`export format '${t}' is not supported`,"ERR_INVALID_EXPORT_FORMAT")}}function Du(e){return new Ou(e)}function Lu(e){return new Pu(e)}async function Bu(){const e=Nu.utils.randomPrivateKey();return new Ou(e)}const Uu={rsa:y,ed25519:g,secp256k1:m};function Mu(e){const t=Object.keys(Uu).join(" / ");return new eo(`invalid or unsupported key type ${e}. Must be ${t}`,"ERR_UNSUPPORTED_KEY_TYPE")}function Fu(e){if("rsa"===(e=e.toLowerCase())||"ed25519"===e||"secp256k1"===e)return Uu[e];throw Mu(e)}function $u(e){const t=Ua.decode(e),r=t.Data??new Uint8Array;switch(t.Type){case La.RSA:return Uu.rsa.unmarshalRsaPublicKey(r);case La.Ed25519:return Uu.ed25519.unmarshalEd25519PublicKey(r);case La.Secp256k1:return Uu.secp256k1.unmarshalSecp256k1PublicKey(r);default:throw Mu(t.Type??"unknown")}}function Hu(e,t){return Fu(t=(t??"rsa").toLowerCase()),e.bytes}async function qu(e){const t=Ma.decode(e),r=t.Data??new Uint8Array;switch(t.Type){case La.RSA:return Uu.rsa.unmarshalRsaPrivateKey(r);case La.Ed25519:return Uu.ed25519.unmarshalEd25519PrivateKey(r);case La.Secp256k1:return Uu.secp256k1.unmarshalSecp256k1PrivateKey(r);default:throw Mu(t.Type??"RSA")}}const Vu=Symbol.for("@libp2p/service-capabilities"),ju=Symbol.for("@libp2p/service-dependencies"),Ku=Symbol.for("nodejs.util.inspect.custom"),zu=Object.values(kt).map((e=>e.decoder)).reduce(((e,t)=>e.or(t)),kt.identity.decoder),Gu=114,Wu=36,Yu=37;class Ju{type;multihash;privateKey;publicKey;string;constructor(e){this.type=e.type,this.multihash=e.multihash,this.privateKey=e.privateKey,Object.defineProperty(this,"string",{enumerable:!1,writable:!0})}get[Symbol.toStringTag](){return`PeerId(${this.toString()})`}[Xs]=!0;toString(){return null==this.string&&(this.string=ke.encode(this.multihash.bytes).slice(1)),this.string}toCID(){return vt.createV1(Gu,this.multihash)}toBytes(){return this.multihash.bytes}toJSON(){return this.toString()}equals(e){if(null==e)return!1;if(e instanceof Uint8Array)return Pn(this.multihash.bytes,e);if("string"==typeof e)return rh(e).equals(this);if(null!=e?.multihash?.bytes)return Pn(this.multihash.bytes,e.multihash.bytes);throw new Error("not valid Id")}[Ku](){return`PeerId(${this.toString()})`}}class Xu extends Ju{type="RSA";publicKey;constructor(e){super({...e,type:"RSA"}),this.publicKey=e.publicKey}}class Qu extends Ju{type="Ed25519";publicKey;constructor(e){super({...e,type:"Ed25519"}),this.publicKey=e.multihash.digest}}class Zu extends Ju{type="secp256k1";publicKey;constructor(e){super({...e,type:"secp256k1"}),this.publicKey=e.multihash.digest}}const eh=2336;class th{type="url";multihash;privateKey;publicKey;url;constructor(e){this.url=e.toString(),this.multihash=ht.digest(Nt(this.url))}[Ku](){return`PeerId(${this.url})`}[Xs]=!0;toString(){return this.toCID().toString()}toCID(){return vt.createV1(eh,this.multihash)}toBytes(){return this.toCID().bytes}equals(e){return null!=e&&(e instanceof Uint8Array&&(e=sn(e)),e.toString()===this.toString())}}function rh(e,t){if(t=t??zu,"1"===e.charAt(0)||"Q"===e.charAt(0)){const t=ct(ke.decode(`z${e}`));return e.startsWith("12D")?new Qu({multihash:t}):e.startsWith("16U")?new Zu({multihash:t}):new Xu({multihash:t})}return nh(zu.decode(e))}function nh(e){try{const t=ct(e);if(t.code===ht.code){if(t.digest.length===Wu)return new Qu({multihash:t});if(t.digest.length===Yu)return new Zu({multihash:t})}if(t.code===gt.code)return new Xu({multihash:t})}catch{return function(e){if(null==e?.multihash||null==e.version||1===e.version&&e.code!==Gu&&e.code!==eh)throw new Error("Supplied PeerID CID is invalid");if(e.code===eh){const t=sn(e.multihash.digest);return new th(new URL(t))}const t=e.multihash;if(t.code===gt.code)return new Xu({multihash:e.multihash});if(t.code===ht.code){if(t.digest.length===Wu)return new Qu({multihash:e.multihash});if(t.digest.length===Yu)return new Zu({multihash:e.multihash})}throw new Error("Supplied PeerID CID is invalid")}(vt.decode(e))}throw new Error("Supplied PeerID CID is invalid")}async function sh(e,t){return e.length===Wu?new Qu({multihash:at(ht.code,e),privateKey:t}):e.length===Yu?new Zu({multihash:at(ht.code,e),privateKey:t}):new Xu({multihash:await gt.digest(e),publicKey:e,privateKey:t})}class oh extends Error{type;code;constructor(e,t,r){super(e??"The operation was aborted"),this.type="aborted",this.name=r??"AbortError",this.code=t??"ABORT_ERR"}}async function ih(e,t,r){if(null==t)return e;if(t.aborted)return Promise.reject(new oh(r?.errorMessage,r?.errorCode,r?.errorName));let n;const s=new oh(r?.errorMessage,r?.errorCode,r?.errorName);try{return await Promise.race([e,new Promise(((e,r)=>{n=()=>{r(s)},t.addEventListener("abort",n)}))])}finally{null!=n&&t.removeEventListener("abort",n)}}class ah{readNext;haveNext;ended;nextResult;constructor(){this.ended=!1,this.readNext=Gn(),this.haveNext=Gn()}[Symbol.asyncIterator](){return this}async next(){if(null==this.nextResult&&await this.haveNext.promise,null==this.nextResult)throw new Error("HaveNext promise resolved but nextResult was undefined");const e=this.nextResult;return this.nextResult=void 0,this.readNext.resolve(),this.readNext=Gn(),e}async throw(e){return this.ended=!0,null!=e&&(this.haveNext.promise.catch((()=>{})),this.haveNext.reject(e)),{done:!0,value:void 0}}async return(){return await this._push(void 0),{done:!0,value:void 0}}async push(e,t){await this._push(e,t)}async end(e,t){null!=e?await this.throw(e):await this._push(void 0,t)}async _push(e,t){if(null!=e&&this.ended)throw new Error("Cannot push value onto an ended pushable");for(;null!=this.nextResult;)await this.readNext.promise;null!=e?this.nextResult={done:!1,value:e}:(this.ended=!0,this.nextResult={done:!0,value:void 0}),this.haveNext.resolve(),this.haveNext=Gn(),await ih(this.readNext.promise,t?.signal,t)}}class ch extends Error{name="UnexpectedEOFError";code="ERR_UNEXPECTED_EOF"}class lh extends Error{code;constructor(e,t){super(e),this.code=t}}class uh extends lh{type;constructor(e){super(e,"ABORT_ERR"),this.type="aborted",this.name="AbortError"}}function hh(e,t){const r=new ah;e.sink(r).catch((async e=>{await r.end(e)})),e.sink=async e=>{for await(const t of e)await r.push(t);await r.end()};let n=e.source;null!=e.source[Symbol.iterator]?n=e.source[Symbol.iterator]():null!=e.source[Symbol.asyncIterator]&&(n=e.source[Symbol.asyncIterator]());const s=new Bn,o={read:async(e,t)=>{let r;t?.signal?.throwIfAborted();const o=new Promise(((e,n)=>{r=()=>{n(new uh("Read aborted"))},t?.signal?.addEventListener("abort",r)}));try{if(null==e){const{done:e,value:t}=await Promise.race([n.next(),o]);return!0===e?new Bn:t}for(;s.byteLength{t?.signal?.throwIfAborted(),e instanceof Uint8Array?await r.push(e,t):await r.push(e.subarray(),t)},unwrap:()=>{if(s.byteLength>0){const r=e.source;e.source=async function*(){!1===t?.yieldBytes?yield s:yield*s,yield*r}()}return e}};return o}class dh extends Error{name="InvalidMessageLengthError";code="ERR_INVALID_MSG_LENGTH"}class ph extends Error{name="InvalidDataLengthError";code="ERR_MSG_DATA_TOO_LONG"}class fh extends Error{name="InvalidDataLengthLengthError";code="ERR_MSG_LENGTH_TOO_LONG"}function gh(e,t={}){const r=hh(e,t);null!=t.maxDataLength&&null==t.maxLengthLength&&(t.maxLengthLength=C(t.maxDataLength));const n=t?.lengthDecoder??O,s=t?.lengthEncoder??P;return{read:async e=>{let s=-1;const o=new Bn;for(;;){o.append(await r.read(1,e));try{s=n(o)}catch(e){if(e instanceof RangeError)continue;throw e}if(s<0)throw new dh("Invalid message length");if(null!=t?.maxLengthLength&&o.byteLength>t.maxLengthLength)throw new fh("message length length too long");if(s>-1)break}if(null!=t?.maxDataLength&&s>t.maxDataLength)throw new ph("message length too long");return r.read(s,e)},write:async(e,t)=>{await r.write(new Bn(s(e.byteLength),e),t)},writeV:async(e,t)=>{const n=new Bn(...e.flatMap((e=>[s(e.byteLength),e])));await r.write(n,t)},unwrap:()=>r.unwrap()}}function yh(){const e=Gn();let t=!1;return{sink:async r=>{if(t)throw new Error("already piped");t=!0,e.resolve(r)},source:async function*(){const t=await e.promise;yield*t}()}}const mh=65535,bh=Boolean(globalThis.process?.env?.DUMP_SESSION_KEYS);function wh(e){if(!Number.isSafeInteger(e)||e<0)throw new Error(`positive integer expected, not ${e}`)}function vh(e){if("boolean"!=typeof e)throw new Error(`boolean expected, not ${e}`)}function Eh(e){return e instanceof Uint8Array||null!=e&&"object"==typeof e&&"Uint8Array"===e.constructor.name}function Sh(e,...t){if(!Eh(e))throw new Error("Uint8Array expected");if(t.length>0&&!t.includes(e.length))throw new Error(`Uint8Array expected of length ${t}, not of length=${e.length}`)}function Ah(e,t=!0){if(e.destroyed)throw new Error("Hash instance has been destroyed");if(t&&e.finished)throw new Error("Hash#digest() has already been called")}const _h=e=>new Uint32Array(e.buffer,e.byteOffset,Math.floor(e.byteLength/4));if(68!==new Uint8Array(new Uint32Array([287454020]).buffer)[0])throw new Error("Non little-endian hardware is not supported");function kh(e){if("string"==typeof e)e=function(e){if("string"!=typeof e)throw new Error("string expected, got "+typeof e);return new Uint8Array((new TextEncoder).encode(e))}(e);else{if(!Eh(e))throw new Error("Uint8Array expected, got "+typeof e);e=Th(e)}return e}const Ih=(e,t)=>(Object.assign(t,e),t);function Rh(e,t,r,n){if("function"==typeof e.setBigUint64)return e.setBigUint64(t,r,n);const s=BigInt(32),o=BigInt(4294967295),i=Number(r>>s&o),a=Number(r&o),c=n?4:0,l=n?0:4;e.setUint32(t+c,i,n),e.setUint32(t+l,a,n)}function Th(e){return Uint8Array.from(e)}function Ch(...e){for(let t=0;tUint8Array.from(e.split("").map((e=>e.charCodeAt(0)))),xh=Nh("expand 16-byte k"),Ph=Nh("expand 32-byte k"),Oh=_h(xh),Dh=_h(Ph);function Lh(e,t){return e<>>32-t}function Bh(e){return e.byteOffset%4==0}Dh.slice();const Uh=2**32-1,Mh=new Uint32Array;function Fh(e,t){const{allowShortKeys:r,extendNonceFn:n,counterLength:s,counterRight:o,rounds:i}=function(e,t){if(null==t||"object"!=typeof t)throw new Error("options must be defined");return Object.assign({allowShortKeys:!1,counterLength:8,counterRight:!1,rounds:20},t)}(0,t);if("function"!=typeof e)throw new Error("core must be a function");return wh(s),wh(i),vh(o),vh(r),(t,a,c,l,u=0)=>{Sh(t),Sh(a),Sh(c);const h=c.length;if(void 0===l&&(l=new Uint8Array(h)),Sh(l),wh(u),u<0||u>=Uh)throw new Error("arx: counter overflow");if(l.length=Uh)throw new Error("arx: counter overflow");const g=Math.min(64,c-f);if(h&&64===g){const e=f/4;if(f%4!=0)throw new Error("arx: invalid block position");for(let t,r=0;r<16;r++)t=e+r,p[t]=d[t]^u[r];f+=64}else{for(let e,t=0;t255&e[t++]|(255&e[t++])<<8;class Hh{constructor(e){this.blockLen=16,this.outputLen=16,this.buffer=new Uint8Array(16),this.r=new Uint16Array(10),this.h=new Uint16Array(10),this.pad=new Uint16Array(8),this.pos=0,this.finished=!1,Sh(e=kh(e),32);const t=$h(e,0),r=$h(e,2),n=$h(e,4),s=$h(e,6),o=$h(e,8),i=$h(e,10),a=$h(e,12),c=$h(e,14);this.r[0]=8191&t,this.r[1]=8191&(t>>>13|r<<3),this.r[2]=7939&(r>>>10|n<<6),this.r[3]=8191&(n>>>7|s<<9),this.r[4]=255&(s>>>4|o<<12),this.r[5]=o>>>1&8190,this.r[6]=8191&(o>>>14|i<<2),this.r[7]=8065&(i>>>11|a<<5),this.r[8]=8191&(a>>>8|c<<8),this.r[9]=c>>>5&127;for(let t=0;t<8;t++)this.pad[t]=$h(e,16+2*t)}process(e,t,r=!1){const n=r?0:2048,{h:s,r:o}=this,i=o[0],a=o[1],c=o[2],l=o[3],u=o[4],h=o[5],d=o[6],p=o[7],f=o[8],g=o[9],y=$h(e,t+0),m=$h(e,t+2),b=$h(e,t+4),w=$h(e,t+6),v=$h(e,t+8),E=$h(e,t+10),S=$h(e,t+12),A=$h(e,t+14);let _=s[0]+(8191&y),k=s[1]+(8191&(y>>>13|m<<3)),I=s[2]+(8191&(m>>>10|b<<6)),R=s[3]+(8191&(b>>>7|w<<9)),T=s[4]+(8191&(w>>>4|v<<12)),C=s[5]+(v>>>1&8191),N=s[6]+(8191&(v>>>14|E<<2)),x=s[7]+(8191&(E>>>11|S<<5)),P=s[8]+(8191&(S>>>8|A<<8)),O=s[9]+(A>>>5|n),D=0,L=D+_*i+k*(5*g)+I*(5*f)+R*(5*p)+T*(5*d);D=L>>>13,L&=8191,L+=C*(5*h)+N*(5*u)+x*(5*l)+P*(5*c)+O*(5*a),D+=L>>>13,L&=8191;let B=D+_*a+k*i+I*(5*g)+R*(5*f)+T*(5*p);D=B>>>13,B&=8191,B+=C*(5*d)+N*(5*h)+x*(5*u)+P*(5*l)+O*(5*c),D+=B>>>13,B&=8191;let U=D+_*c+k*a+I*i+R*(5*g)+T*(5*f);D=U>>>13,U&=8191,U+=C*(5*p)+N*(5*d)+x*(5*h)+P*(5*u)+O*(5*l),D+=U>>>13,U&=8191;let M=D+_*l+k*c+I*a+R*i+T*(5*g);D=M>>>13,M&=8191,M+=C*(5*f)+N*(5*p)+x*(5*d)+P*(5*h)+O*(5*u),D+=M>>>13,M&=8191;let F=D+_*u+k*l+I*c+R*a+T*i;D=F>>>13,F&=8191,F+=C*(5*g)+N*(5*f)+x*(5*p)+P*(5*d)+O*(5*h),D+=F>>>13,F&=8191;let $=D+_*h+k*u+I*l+R*c+T*a;D=$>>>13,$&=8191,$+=C*i+N*(5*g)+x*(5*f)+P*(5*p)+O*(5*d),D+=$>>>13,$&=8191;let H=D+_*d+k*h+I*u+R*l+T*c;D=H>>>13,H&=8191,H+=C*a+N*i+x*(5*g)+P*(5*f)+O*(5*p),D+=H>>>13,H&=8191;let q=D+_*p+k*d+I*h+R*u+T*l;D=q>>>13,q&=8191,q+=C*c+N*a+x*i+P*(5*g)+O*(5*f),D+=q>>>13,q&=8191;let V=D+_*f+k*p+I*d+R*h+T*u;D=V>>>13,V&=8191,V+=C*l+N*c+x*a+P*i+O*(5*g),D+=V>>>13,V&=8191;let j=D+_*g+k*f+I*p+R*d+T*h;D=j>>>13,j&=8191,j+=C*u+N*l+x*c+P*a+O*i,D+=j>>>13,j&=8191,D=(D<<2)+D|0,D=D+L|0,L=8191&D,D>>>=13,B+=D,s[0]=L,s[1]=B,s[2]=U,s[3]=M,s[4]=F,s[5]=$,s[6]=H,s[7]=q,s[8]=V,s[9]=j}finalize(){const{h:e,pad:t}=this,r=new Uint16Array(10);let n=e[1]>>>13;e[1]&=8191;for(let t=2;t<10;t++)e[t]+=n,n=e[t]>>>13,e[t]&=8191;e[0]+=5*n,n=e[0]>>>13,e[0]&=8191,e[1]+=n,n=e[1]>>>13,e[1]&=8191,e[2]+=n,r[0]=e[0]+5,n=r[0]>>>13,r[0]&=8191;for(let t=1;t<10;t++)r[t]=e[t]+n,n=r[t]>>>13,r[t]&=8191;r[9]-=8192;let s=(1^n)-1;for(let e=0;e<10;e++)r[e]&=s;s=~s;for(let t=0;t<10;t++)e[t]=e[t]&s|r[t];e[0]=65535&(e[0]|e[1]<<13),e[1]=65535&(e[1]>>>3|e[2]<<10),e[2]=65535&(e[2]>>>6|e[3]<<7),e[3]=65535&(e[3]>>>9|e[4]<<4),e[4]=65535&(e[4]>>>12|e[5]<<1|e[6]<<14),e[5]=65535&(e[6]>>>2|e[7]<<11),e[6]=65535&(e[7]>>>5|e[8]<<8),e[7]=65535&(e[8]>>>8|e[9]<<5);let o=e[0]+t[0];e[0]=65535&o;for(let r=1;r<8;r++)o=(e[r]+t[r]|0)+(o>>>16)|0,e[r]=65535&o;Ch(r)}update(e){Ah(this);const{buffer:t,blockLen:r}=this,n=(e=kh(e)).length;for(let s=0;s>>0,e[s++]=r[t]>>>8;return e}digest(){const{buffer:e,outputLen:t}=this;this.digestInto(e);const r=e.slice(0,t);return this.destroy(),r}}const qh=function(e){const t=(t,r)=>e(r).update(kh(t)).digest(),r=e(new Uint8Array(32));return t.outputLen=r.outputLen,t.blockLen=r.blockLen,t.create=t=>e(t),t}((e=>new Hh(e)));function Vh(e,t,r,n,s,o=20){let i=e[0],a=e[1],c=e[2],l=e[3],u=t[0],h=t[1],d=t[2],p=t[3],f=t[4],g=t[5],y=t[6],m=t[7],b=s,w=r[0],v=r[1],E=r[2],S=i,A=a,_=c,k=l,I=u,R=h,T=d,C=p,N=f,x=g,P=y,O=m,D=b,L=w,B=v,U=E;for(let e=0;e{e.update(t);const r=t.length%16;r&&e.update(zh.subarray(r))},Wh=new Uint8Array(32);function Yh(e,t,r,n,s){const o=e(t,r,Wh),i=qh.create(o);s&&Gh(i,s),Gh(i,n);const a=new Uint8Array(16),c=(l=a,new DataView(l.buffer,l.byteOffset,l.byteLength));var l;Rh(c,0,BigInt(s?s.length:0),!0),Rh(c,8,BigInt(n.length),!0),i.update(a);const u=i.digest();return Ch(o,a),u}const Jh=e=>(t,r,n)=>(Sh(t,32),Sh(r),{encrypt(s,o){const i=s.length,a=i+16;o?Sh(o,a):o=new Uint8Array(a),e(t,r,s,o,1);const c=Yh(e,t,r,o.subarray(0,-16),n);return o.set(c,i),Ch(c),o},decrypt(s,o){const i=s.length,a=i-16;if(i<16)throw new Error("encrypted data must be at least 16 bytes");o?Sh(o,a):o=new Uint8Array(a);const c=s.subarray(0,-16),l=s.subarray(-16),u=Yh(e,t,r,c,n);if(!function(e,t){if(e.length!==t.length)return!1;let r=0;for(let n=0;nWr(e.subarray()),getHKDF(e,t){const r=function(e,t,r){return Nr(e),void 0===r&&(r=new Uint8Array(e.outputLen)),Xa(e,Ur(r),Ur(t))}(Wr,t,e),n=function(e,t,r,n=32){if(Nr(e),Tr(n),n>255*e.outputLen)throw new Error("Length should be <= 255*HashLen");const s=Math.ceil(n/e.outputLen);void 0===r&&(r=Zh);const o=new Uint8Array(s*e.outputLen),i=Xa.create(e,t),a=i._cloneInto(),c=new Uint8Array(i.outputLen);for(let t=0;t({publicKey:Ra.getPublicKey(e),privateKey:e}),generateX25519SharedKey:(e,t)=>Ra.getSharedSecret(e.subarray(),t.subarray()),chaCha20Poly1305Encrypt:(e,t,r,n)=>Xh(n,t,r).encrypt(e.subarray()),chaCha20Poly1305Decrypt:(e,t,r,n,s)=>Xh(n,t,r).decrypt(e.subarray(),s)},td=e=>{const t=w(2);return t[0]=e>>8,t[1]=e,t};td.bytes=2;const rd=e=>{if(e.length<2)throw RangeError("Could not decode int16BE");if(e instanceof Uint8Array){let t=0;return t+=e[0]<<8,t+=e[1],t}return e.getUint16(0)};function nd(e,t){t.enabled&&bh&&(e?(t(`LOCAL_STATIC_PUBLIC_KEY ${sn(e.publicKey,"hex")}`),t(`LOCAL_STATIC_PRIVATE_KEY ${sn(e.privateKey,"hex")}`)):t("Missing local static keys."))}function sd(e,t){t.enabled&&bh&&(e?(t(`LOCAL_PUBLIC_EPHEMERAL_KEY ${sn(e.publicKey,"hex")}`),t(`LOCAL_PRIVATE_EPHEMERAL_KEY ${sn(e.privateKey,"hex")}`)):t("Missing local ephemeral keys."))}function od(e,t){t.enabled&&bh&&t(e?`REMOTE_EPHEMERAL_PUBLIC_KEY ${sn(e.subarray(),"hex")}`:"Missing remote ephemeral keys.")}function id(e,t,r){r.enabled&&bh&&(r(`CIPHER_STATE_1 ${e.n.getUint64()} ${e.k&&sn(e.k,"hex")}`),r(`CIPHER_STATE_2 ${t.n.getUint64()} ${t.k&&sn(t.k,"hex")}`))}rd.bytes=2;class ad extends Error{code;constructor(e="Unexpected Peer"){super(e),this.code=ad.code}static code="ERR_UNEXPECTED_PEER"}class cd extends Error{code;constructor(e="Invalid crypto exchange"){super(e),this.code=cd.code}static code="ERR_INVALID_CRYPTO_EXCHANGE"}class ld{n;bytes;view;constructor(e=0){this.n=e,this.bytes=b(12),this.view=new DataView(this.bytes.buffer,this.bytes.byteOffset,this.bytes.byteLength),this.view.setUint32(4,e,!0)}increment(){this.n++,this.view.setUint32(4,this.n,!0)}getBytes(){return this.bytes}getUint64(){return this.n}assertValue(){if(this.n>4294967295)throw new Error("Cipherstate has reached maximum n, a new handshake must be performed")}}const ud=b(0);class hd{k;n;crypto;constructor(e,t=void 0,r=0){this.crypto=e,this.k=t,this.n=new ld(r)}hasKey(){return Boolean(this.k)}encryptWithAd(e,t){if(!this.hasKey())return t;this.n.assertValue();const r=this.crypto.encrypt(t,this.n.getBytes(),e,this.k);return this.n.increment(),r}decryptWithAd(e,t,r){if(!this.hasKey())return t;this.n.assertValue();const n=this.crypto.decrypt(t,this.n.getBytes(),e,this.k,r);return this.n.increment(),n}}class dd{cs;ck;h;crypto;constructor(e,t){this.crypto=e;const r=Nt(t,"utf-8");this.h=function(e,t){if(t.length<=32){const e=b(32);return e.set(t),e}return e.hash(t)}(e,r),this.ck=this.h,this.cs=new hd(e)}mixKey(e){const[t,r]=this.crypto.hkdf(this.ck,e);this.ck=t,this.cs=new hd(this.crypto,r)}mixHash(e){this.h=this.crypto.hash(new Bn(this.h,e))}encryptAndHash(e){const t=this.cs.encryptWithAd(this.h,e);return this.mixHash(t),t}decryptAndHash(e){const t=this.cs.decryptWithAd(this.h,e);return this.mixHash(e),t}split(){const[e,t]=this.crypto.hkdf(this.ck,ud);return[new hd(this.crypto,e),new hd(this.crypto,t)]}}class pd{ss;s;e;rs;re;initiator;crypto;constructor(e){const{crypto:t,protocolName:r,prologue:n,initiator:s,s:o,e:i,rs:a,re:c}=e;this.crypto=t,this.ss=new dd(t,r),this.ss.mixHash(n),this.initiator=s,this.s=o,this.e=i,this.rs=a,this.re=c}writeE(){if(this.e)throw new Error("ephemeral keypair is already set");const e=this.crypto.generateKeypair();return this.ss.mixHash(e.publicKey),this.e=e,e.publicKey}writeS(){if(!this.s)throw new Error("static keypair is not set");return this.ss.encryptAndHash(this.s.publicKey)}writeEE(){if(!this.e)throw new Error("ephemeral keypair is not set");if(!this.re)throw new Error("remote ephemeral public key is not set");this.ss.mixKey(this.crypto.dh(this.e,this.re))}writeES(){if(this.initiator){if(!this.e)throw new Error("ephemeral keypair is not set");if(!this.rs)throw new Error("remote static public key is not set");this.ss.mixKey(this.crypto.dh(this.e,this.rs))}else{if(!this.s)throw new Error("static keypair is not set");if(!this.re)throw new Error("remote ephemeral public key is not set");this.ss.mixKey(this.crypto.dh(this.s,this.re))}}writeSE(){if(this.initiator){if(!this.s)throw new Error("static keypair is not set");if(!this.re)throw new Error("remote ephemeral public key is not set");this.ss.mixKey(this.crypto.dh(this.s,this.re))}else{if(!this.e)throw new Error("ephemeral keypair is not set");if(!this.rs)throw new Error("remote static public key is not set");this.ss.mixKey(this.crypto.dh(this.e,this.rs))}}readE(e,t=0){if(this.re)throw new Error("remote ephemeral public key is already set");if(e.byteLength(null==t&&(t=Ar(((e,t,r={})=>{if(!1!==r.lengthDelimited&&t.fork(),null!=e.webtransportCerthashes)for(const r of e.webtransportCerthashes)t.uint32(10),t.bytes(r);!1!==r.lengthDelimited&&t.ldelim()}),((e,t)=>{const r={webtransportCerthashes:[]},n=null==t?e.len:e.pos+t;for(;e.pos>>3==1?r.webtransportCerthashes.push(e.bytes()):e.skipType(7&t)}return r}))),t),e.encode=t=>jt(t,e.codec()),e.decode=t=>Y(t,e.codec())}(gd||(gd={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.identityKey&&e.identityKey.byteLength>0&&(t.uint32(10),t.bytes(e.identityKey)),null!=e.identitySig&&e.identitySig.byteLength>0&&(t.uint32(18),t.bytes(e.identitySig)),null!=e.extensions&&(t.uint32(34),gd.codec().encode(e.extensions,t)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t)=>{const r={identityKey:b(0),identitySig:b(0)},n=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:r.identityKey=e.bytes();break;case 2:r.identitySig=e.bytes();break;case 4:r.extensions=gd.codec().decode(e,e.uint32());break;default:e.skipType(7&t)}}return r}))),t),e.encode=t=>jt(t,e.codec()),e.decode=t=>Y(t,e.codec())}(yd||(yd={}));class vd{protocol="/noise";crypto;prologue;staticKey;extensions;metrics;components;constructor(e,t={}){const{staticNoiseKey:r,extensions:n,crypto:s,prologueBytes:o}=t,{metrics:i}=e;this.components=e;const a=s??ed;this.crypto=function(e){return{generateKeypair:e.generateX25519KeyPair,dh:(t,r)=>e.generateX25519SharedKey(t.privateKey,r).subarray(0,32),encrypt:e.chaCha20Poly1305Encrypt,decrypt:e.chaCha20Poly1305Decrypt,hash:e.hashSHA256,hkdf:e.getHKDF}}(a),this.extensions=n,this.metrics=i?function(e){return{xxHandshakeSuccesses:e.registerCounter("libp2p_noise_xxhandshake_successes_total",{help:"Total count of noise xxHandshakes successes_"}),xxHandshakeErrors:e.registerCounter("libp2p_noise_xxhandshake_error_total",{help:"Total count of noise xxHandshakes errors"}),encryptedPackets:e.registerCounter("libp2p_noise_encrypted_packets_total",{help:"Total count of noise encrypted packets successfully"}),decryptedPackets:e.registerCounter("libp2p_noise_decrypted_packets_total",{help:"Total count of noise decrypted packets"}),decryptErrors:e.registerCounter("libp2p_noise_decrypt_errors_total",{help:"Total count of noise decrypt errors"})}}(i):void 0,this.staticKey=r?a.generateX25519KeyPairFromSeed(r):a.generateX25519KeyPair(),this.prologue=o??b(0)}[Symbol.toStringTag]="@chainsafe/libp2p-noise";[Vu]=["@libp2p/connection-encryption","@chainsafe/libp2p-noise"];async secureOutbound(...e){const{localPeer:t,connection:r,remotePeer:n}=this.parseArgs(e),s=gh(r,{lengthEncoder:td,lengthDecoder:rd,maxDataLength:mh});if(!t.privateKey)throw new eo("local peerId does not contain private key","ERR_NO_PRIVATE_KEY");const o=await qu(t.privateKey),i=n?.publicKey,a=await this.performHandshakeInitiator(s,o,i),c=await this.createSecureConnection(s,a);return r.source=c.source,r.sink=c.sink,{conn:r,remoteExtensions:a.payload.extensions,remotePeer:await sh(a.payload.identityKey)}}async secureInbound(...e){const{localPeer:t,connection:r,remotePeer:n}=this.parseArgs(e),s=gh(r,{lengthEncoder:td,lengthDecoder:rd,maxDataLength:mh});if(!t.privateKey)throw new eo("local peerId does not contain private key","ERR_NO_PRIVATE_KEY");const o=await qu(t.privateKey),i=n?.publicKey,a=await this.performHandshakeResponder(s,o,i),c=await this.createSecureConnection(s,a);return r.source=c.source,r.sink=c.sink,{conn:r,remoteExtensions:a.payload.extensions,remotePeer:await sh(a.payload.identityKey)}}async performHandshakeInitiator(e,t,r){let n;try{n=await async function(e){const{log:t,connection:r,crypto:n,privateKey:s,prologue:o,s:i,remoteIdentityKey:a,extensions:c}=e,l=await md(s,i.publicKey,c),u=new fd({crypto:n,protocolName:"Noise_XX_25519_ChaChaPoly_SHA256",initiator:!0,prologue:o,s:i});nd(u.s,t),t.trace("Stage 0 - Initiator starting to send first message."),await r.write(u.writeMessageA(ud)),t.trace("Stage 0 - Initiator finished sending first message."),sd(u.e,t),t.trace("Stage 1 - Initiator waiting to receive first message from responder...");const h=u.readMessageB(await r.read());var d,p;t.trace("Stage 1 - Initiator received the message."),od(u.re,t),d=u.rs,(p=t).enabled&&bh&&p(d?`REMOTE_STATIC_PUBLIC_KEY ${sn(d.subarray(),"hex")}`:"Missing remote static public key."),t.trace("Initiator going to check remote's signature...");const f=await bd(h,u.rs,a);t.trace("All good with the signature!"),t.trace("Stage 2 - Initiator sending third handshake message."),await r.write(u.writeMessageC(l)),t.trace("Stage 2 - Initiator sent message with signed payload.");const[g,y]=u.ss.split();return id(g,y,t),{payload:f,encrypt:e=>g.encryptWithAd(ud,e),decrypt:(e,t)=>y.decryptWithAd(ud,e,t)}}({connection:e,privateKey:t,remoteIdentityKey:r,log:this.components.logger.forComponent("libp2p:noise:xxhandshake"),crypto:this.crypto,prologue:this.prologue,s:this.staticKey,extensions:this.extensions}),this.metrics?.xxHandshakeSuccesses.increment()}catch(e){throw this.metrics?.xxHandshakeErrors.increment(),e}return n}async performHandshakeResponder(e,t,r){let n;try{n=await async function(e){const{log:t,connection:r,crypto:n,privateKey:s,prologue:o,s:i,remoteIdentityKey:a,extensions:c}=e,l=await md(s,i.publicKey,c),u=new fd({crypto:n,protocolName:"Noise_XX_25519_ChaChaPoly_SHA256",initiator:!1,prologue:o,s:i});nd(u.s,t),t.trace("Stage 0 - Responder waiting to receive first message."),u.readMessageA(await r.read()),t.trace("Stage 0 - Responder received first message."),od(u.re,t),t.trace("Stage 1 - Responder sending out first message with signed payload and static key."),await r.write(u.writeMessageB(l)),t.trace("Stage 1 - Responder sent the second handshake message with signed payload."),sd(u.e,t),t.trace("Stage 2 - Responder waiting for third handshake message...");const h=u.readMessageC(await r.read());t.trace("Stage 2 - Responder received the message, finished handshake.");const d=await bd(h,u.rs,a),[p,f]=u.ss.split();return id(p,f,t),{payload:d,encrypt:e=>f.encryptWithAd(ud,e),decrypt:(e,t)=>p.decryptWithAd(ud,e,t)}}({connection:e,privateKey:t,remoteIdentityKey:r,log:this.components.logger.forComponent("libp2p:noise:xxhandshake"),crypto:this.crypto,prologue:this.prologue,s:this.staticKey,extensions:this.extensions}),this.metrics?.xxHandshakeSuccesses.increment()}catch(e){throw this.metrics?.xxHandshakeErrors.increment(),e}return n}async createSecureConnection(e,t){const[r,n]=function(){const e=yh(),t=yh();return[{source:e.source,sink:t.sink},{source:t.source,sink:e.sink}]}(),s=e.unwrap();return await Zn(r,function(e,t){return async function*(r){for await(const n of r)for(let r=0;rn.length&&(o=n.length),s=n instanceof Uint8Array?e.encrypt(n.subarray(r,o)):e.encrypt(n.sublist(r,o)),t?.encryptedPackets.increment(),yield new Bn(td(s.byteLength),s)}}}(t,this.metrics),s,(e=>zn(e,{lengthDecoder:rd})),function(e,t){return async function*(r){for await(const n of r)for(let r=0;rn.length&&(s=n.length),s-16new vd(t,e)}const Sd=Symbol.for("@libp2p/peer-discovery"),Ad=ep("dns4"),_d=ep("dns6"),kd=ep("dnsaddr"),Id=Zd(ep("dns"),kd,Ad,_d),Rd=Zd(ep("ip4"),ep("ip6")),Td=Zd(Qd(Rd,ep("tcp")),Qd(Id,ep("tcp"))),Cd=Qd(Rd,ep("udp")),Nd=Qd(Cd,ep("utp")),xd=Qd(Cd,ep("quic")),Pd=Qd(Cd,ep("quic-v1")),Od=Zd(Qd(Td,ep("ws")),Qd(Id,ep("ws"))),Dd=Zd(Qd(Od,ep("p2p")),Od),Ld=Zd(Qd(Td,ep("wss")),Qd(Id,ep("wss")),Qd(Td,ep("tls"),ep("ws")),Qd(Id,ep("tls"),ep("ws"))),Bd=Zd(Qd(Ld,ep("p2p")),Ld),Ud=Zd(Qd(Td,ep("http")),Qd(Rd,ep("http")),Qd(Id,ep("http"))),Md=Zd(Qd(Td,ep("https")),Qd(Rd,ep("https")),Qd(Id,ep("https"))),Fd=Qd(Cd,ep("webrtc-direct"),ep("certhash")),$d=Zd(Qd(Fd,ep("p2p")),Fd),Hd=Qd(Pd,ep("webtransport"),ep("certhash"),ep("certhash")),qd=Zd(Qd(Hd,ep("p2p")),Hd),Vd=Zd(Qd(Dd,ep("p2p-webrtc-star"),ep("p2p")),Qd(Bd,ep("p2p-webrtc-star"),ep("p2p")),Qd(Dd,ep("p2p-webrtc-star")),Qd(Bd,ep("p2p-webrtc-star"))),jd=(Zd(Qd(Dd,ep("p2p-websocket-star"),ep("p2p")),Qd(Bd,ep("p2p-websocket-star"),ep("p2p")),Qd(Dd,ep("p2p-websocket-star")),Qd(Bd,ep("p2p-websocket-star"))),Zd(Qd(Ud,ep("p2p-webrtc-direct"),ep("p2p")),Qd(Md,ep("p2p-webrtc-direct"),ep("p2p")),Qd(Ud,ep("p2p-webrtc-direct")),Qd(Md,ep("p2p-webrtc-direct")))),Kd=Zd(Od,Ld,Ud,Md,Vd,jd,Td,Nd,xd,Id,$d,qd),zd=(Zd(Qd(Kd,ep("p2p-stardust"),ep("p2p")),Qd(Kd,ep("p2p-stardust"))),Zd(Qd(Kd,ep("p2p")),Vd,jd,$d,qd,ep("p2p"))),Gd=Zd(Qd(zd,ep("p2p-circuit"),zd),Qd(zd,ep("p2p-circuit")),Qd(ep("p2p-circuit"),zd),Qd(Kd,ep("p2p-circuit")),Qd(ep("p2p-circuit"),Kd),ep("p2p-circuit")),Wd=()=>Zd(Qd(Gd,Wd),Gd),Yd=Wd(),Jd=Zd(Qd(Yd,zd,Yd),Qd(zd,Yd),Qd(Yd,zd),Yd,zd);function Xd(e){return function(t){let r;try{r=Mo(t)}catch(e){return!1}const n=e(r.protoNames());return null!==n&&(!0===n||!1===n?n:0===n.length)}}function Qd(...e){function t(t){if(t.length(r="function"==typeof e?e().partialMatch(t):e.partialMatch(t),Array.isArray(r)&&(t=r),null===r))),r}return{toString:function(){return"{ "+e.join(" ")+" }"},input:e,matches:Xd(t),partialMatch:t}}function Zd(...e){function t(t){let r=null;return e.some((e=>{const n="function"==typeof e?e().partialMatch(t):e.partialMatch(t);return null!=n&&(r=n,!0)})),r}return{toString:function(){return"{ "+e.join(" ")+" }"},input:e,matches:Xd(t),partialMatch:t}}function ep(e){const t=e;return{toString:function(){return t},matches:function(e){let r;try{r=Mo(e)}catch(e){return!1}const n=r.protoNames();return 1===n.length&&n[0]===t},partialMatch:function(e){return 0===e.length?null:e[0]===t?e.slice(1):null}}}Zd(Qd(Yd,ep("webrtc"),ep("p2p")),Qd(Yd,ep("webrtc")),Qd(Kd,ep("webrtc"),ep("p2p")),Qd(Kd,ep("webrtc")),ep("webrtc"));class tp extends Fs{static tag="bootstrap";log;timer;list;timeout;components;_init;constructor(e,t={list:[]}){if(null==t.list||0===t.list.length)throw new Error("Bootstrap requires a list of peer addresses");super(),this.components=e,this.log=e.logger.forComponent("libp2p:bootstrap"),this.timeout=t.timeout??1e3,this.list=[];for(const e of t.list){if(!Jd.matches(e)){this.log.error("Invalid multiaddr");continue}const t=Mo(e),r=t.getPeerId();if(null==r){this.log.error("Invalid bootstrap multiaddr without peer id");continue}const n={id:rh(r),multiaddrs:[t]};this.list.push(n)}this._init=t}[Sd]=this;[Symbol.toStringTag]="@libp2p/bootstrap";[Vu]=["@libp2p/peer-discovery"];isStarted(){return Boolean(this.timer)}start(){this.isStarted()||(this.log("Starting bootstrap node discovery, discovering peers after %s ms",this.timeout),this.timer=setTimeout((()=>{this._discoverBootstrapPeers().catch((e=>{this.log.error(e)}))}),this.timeout))}async _discoverBootstrapPeers(){if(null!=this.timer)for(const e of this.list){if(await this.components.peerStore.merge(e.id,{tags:{[this._init.tagName??"bootstrap"]:{value:this._init.tagValue??50,ttl:this._init.tagTTL??12e4}}}),null==this.timer)return;this.safeDispatchEvent("peer",{detail:e})}}stop(){null!=this.timer&&clearTimeout(this.timer),this.timer=void 0}}const rp=Uint8Array.from([3,1]);var np;!function(e){let t,r;!function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.multiaddr&&e.multiaddr.byteLength>0&&(t.uint32(10),t.bytes(e.multiaddr)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t)=>{const r={multiaddr:new Uint8Array(0)},n=null==t?e.len:e.pos+t;for(;e.pos>>3==1?r.multiaddr=e.bytes():e.skipType(7&t)}return r}))),t),e.encode=t=>jt(t,e.codec()),e.decode=t=>Y(t,e.codec())}(t=e.AddressInfo||(e.AddressInfo={})),e.codec=()=>(null==r&&(r=Ar(((t,r,n={})=>{if(!1!==n.lengthDelimited&&r.fork(),null!=t.peerId&&t.peerId.byteLength>0&&(r.uint32(10),r.bytes(t.peerId)),null!=t.seq&&0n!==t.seq&&(r.uint32(16),r.uint64(t.seq)),null!=t.addresses)for(const n of t.addresses)r.uint32(26),e.AddressInfo.codec().encode(n,r);!1!==n.lengthDelimited&&r.ldelim()}),((t,r)=>{const n={peerId:new Uint8Array(0),seq:0n,addresses:[]},s=null==r?t.len:t.pos+r;for(;t.pos>>3){case 1:n.peerId=t.bytes();break;case 2:n.seq=t.uint64();break;case 3:n.addresses.push(e.AddressInfo.codec().decode(t,t.uint32()));break;default:t.skipType(7&r)}}return n}))),r),e.encode=t=>jt(t,e.codec()),e.decode=t=>Y(t,e.codec())}(np||(np={}));class sp{static createFromProtobuf=e=>{const t=np.decode(e),r=nh(t.peerId),n=(t.addresses??[]).map((e=>Mo(e.multiaddr))),s=t.seq;return new sp({peerId:r,multiaddrs:n,seqNumber:s})};static DOMAIN="libp2p-peer-record";static CODEC=rp;peerId;multiaddrs;seqNumber;domain=sp.DOMAIN;codec=sp.CODEC;marshaled;constructor(e){const{peerId:t,multiaddrs:r,seqNumber:n}=e;this.peerId=t,this.multiaddrs=r??[],this.seqNumber=n??BigInt(Date.now())}marshal(){return null==this.marshaled&&(this.marshaled=np.encode({peerId:this.peerId.toBytes(),seq:BigInt(this.seqNumber),addresses:this.multiaddrs.map((e=>({multiaddr:e.bytes})))})),this.marshaled}equals(e){return e instanceof sp&&!!this.peerId.equals(e.peerId)&&this.seqNumber===e.seqNumber&&!!function(e,t){const r=(e,t)=>e.toString().localeCompare(t.toString());return e.length===t.length&&(t.sort(r),e.sort(r).every(((e,r)=>t[r].equals(e))))}(this.multiaddrs,e.multiaddrs)}}var op;!function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.publicKey&&e.publicKey.byteLength>0&&(t.uint32(10),t.bytes(e.publicKey)),null!=e.payloadType&&e.payloadType.byteLength>0&&(t.uint32(18),t.bytes(e.payloadType)),null!=e.payload&&e.payload.byteLength>0&&(t.uint32(26),t.bytes(e.payload)),null!=e.signature&&e.signature.byteLength>0&&(t.uint32(42),t.bytes(e.signature)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t)=>{const r={publicKey:new Uint8Array(0),payloadType:new Uint8Array(0),payload:new Uint8Array(0),signature:new Uint8Array(0)},n=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:r.publicKey=e.bytes();break;case 2:r.payloadType=e.bytes();break;case 3:r.payload=e.bytes();break;case 5:r.signature=e.bytes();break;default:e.skipType(7&t)}}return r}))),t),e.encode=t=>jt(t,e.codec()),e.decode=t=>Y(t,e.codec())}(op||(op={}));class ip{static createFromProtobuf=async e=>{const t=op.decode(e),r=await sh(t.publicKey);return new ip({peerId:r,payloadType:t.payloadType,payload:t.payload,signature:t.signature})};static seal=async(e,t)=>{if(null==t.privateKey)throw new Error("Missing private key");const r=e.domain,n=e.codec,s=e.marshal(),o=ap(r,n,s),i=await qu(t.privateKey),a=await i.sign(o.subarray());return new ip({peerId:t,payloadType:n,payload:s,signature:a})};static openAndCertify=async(e,t)=>{const r=await ip.createFromProtobuf(e);if(!await r.validate(t))throw new eo("envelope signature is not valid for the given domain","ERR_SIGNATURE_NOT_VALID");return r};peerId;payloadType;payload;signature;marshaled;constructor(e){const{peerId:t,payloadType:r,payload:n,signature:s}=e;this.peerId=t,this.payloadType=r,this.payload=n,this.signature=s}marshal(){if(null==this.peerId.publicKey)throw new Error("Missing public key");return null==this.marshaled&&(this.marshaled=op.encode({publicKey:this.peerId.publicKey,payloadType:this.payloadType,payload:this.payload.subarray(),signature:this.signature})),this.marshaled}equals(e){return Pn(this.marshal(),e.marshal())}async validate(e){const t=ap(e,this.payloadType,this.payload);if(null==this.peerId.publicKey)throw new Error("Missing public key");return $u(this.peerId.publicKey).verify(t.subarray(),this.signature)}}const ap=(e,t,r)=>{const n=Nt(e),s=P(n.byteLength),o=P(t.length),i=P(r.length);return new Bn(s,n,o,t,i,r)},cp=e=>({match:t=>!(t.length<1)&&!!e(t[0])&&t.slice(1),pattern:"fn"}),lp=e=>({match:t=>cp((t=>t===e)).match(t),pattern:e}),up=()=>({match:e=>cp((e=>"string"==typeof e)).match(e),pattern:"{string}"}),hp=()=>({match:e=>cp((e=>!isNaN(parseInt(e)))).match(e),pattern:"{number}"}),dp=()=>({match:e=>{if(e.length<2)return!1;if("p2p"!==e[0]&&"ipfs"!==e[0])return!1;if(!e[1].startsWith("Q")&&!e[1].startsWith("1"))return!1;try{ke.decode(`z${e[1]}`)}catch(e){return!1}return e.slice(2)},pattern:"/p2p/{peerid}"}),pp=()=>({match:e=>{if(e.length<2)return!1;if("certhash"!==e[0])return!1;try{Ce.decode(e[1])}catch{return!1}return e.slice(2)},pattern:"/certhash/{certhash}"}),fp=e=>({match:t=>{const r=e.match(t);return!1===r?t:r},pattern:`optional(${e.pattern})`}),gp=(...e)=>({match:t=>{let r;for(const n of e){const e=n.match(t);!1!==e&&(null==r||e.lengthe.pattern)).join(", ")})`}),yp=(...e)=>({match:t=>{for(const r of e){const e=r.match(t);if(!1===e)return!1;t=e}return t},pattern:`and(${e.map((e=>e.pattern)).join(", ")})`});function mp(...e){function t(t){let r=(e=>e.toString().split("/").slice(1))(t);for(const t of e){const e=t.match(r);if(!1===e)return!1;r=e}return r}return{matches:function(e){return!1!==t(e)},exactMatch:function(e){const r=t(e);return!1!==r&&0===r.length}}}const bp=yp(lp("dns4"),up()),wp=yp(lp("dns6"),up()),vp=yp(lp("dnsaddr"),up()),Ep=yp(lp("dns"),up()),Sp=(mp(bp),mp(wp),mp(vp),mp(gp(Ep,vp,bp,wp)),yp(lp("ip4"),cp(io))),Ap=yp(lp("ip6"),cp(ao)),_p=gp(Sp,Ap),kp=gp(_p,Ep,bp,wp,vp),Ip=mp(kp),Rp=(mp(Sp),mp(Ap),mp(_p),yp(kp,lp("tcp"),hp())),Tp=yp(kp,lp("udp"),hp()),Cp=(mp(Rp),mp(Tp),yp(Tp,lp("quic"))),Np=yp(Tp,lp("quic-v1")),xp=gp(Cp,Np),Pp=(mp(Cp),mp(Np),gp(kp,Rp,Tp,Cp,Np)),Op=gp(yp(Pp,lp("ws"),fp(dp()))),Dp=(mp(Op),gp(yp(Pp,lp("wss"),fp(dp())),yp(Pp,lp("tls"),lp("ws"),fp(dp())))),Lp=(mp(Dp),yp(Tp,lp("webrtc-direct"),fp(pp()),fp(pp()),fp(dp()))),Bp=(mp(Lp),yp(Np,lp("webtransport"),fp(pp()),fp(pp()),fp(dp()))),Up=(mp(Bp),gp(Op,Dp,yp(Rp,fp(dp())),yp(xp,fp(dp())),yp(kp,fp(dp())),Lp,Bp,dp())),Mp=(mp(Up),mp(yp(Up,lp("p2p-circuit"),dp())));function Fp(e,t){const r=gh(e,t),n={read:async(e,t)=>{const n=await r.read(t);return e.decode(n)},write:async(e,t,n)=>{await r.write(t.encode(e),n)},writeV:async(e,t,n)=>{await r.writeV(e.map((e=>t.encode(e))),n)},pb:e=>({read:async t=>n.read(e,t),write:async(t,r)=>n.write(t,e,r),writeV:async(t,r)=>n.writeV(t,e,r),unwrap:()=>n}),unwrap:()=>r.unwrap()};return n}var $p;mp(gp(yp(Up,lp("p2p-circuit"),lp("webrtc"),fp(dp())),yp(Up,lp("webrtc"),fp(dp())),lp("webrtc"))),mp(gp(yp(kp,lp("tcp"),hp(),lp("http"),fp(dp())),yp(kp,lp("http"),fp(dp())))),mp(gp(yp(kp,lp("tcp"),gp(yp(lp("443"),lp("http")),yp(hp(),lp("https"))),fp(dp())),yp(kp,lp("tls"),lp("http"),fp(dp())),yp(kp,lp("https"),fp(dp())))),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{if(!1!==r.lengthDelimited&&t.fork(),null!=e.protocolVersion&&(t.uint32(42),t.string(e.protocolVersion)),null!=e.agentVersion&&(t.uint32(50),t.string(e.agentVersion)),null!=e.publicKey&&(t.uint32(10),t.bytes(e.publicKey)),null!=e.listenAddrs)for(const r of e.listenAddrs)t.uint32(18),t.bytes(r);if(null!=e.observedAddr&&(t.uint32(34),t.bytes(e.observedAddr)),null!=e.protocols)for(const r of e.protocols)t.uint32(26),t.string(r);null!=e.signedPeerRecord&&(t.uint32(66),t.bytes(e.signedPeerRecord)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t)=>{const r={listenAddrs:[],protocols:[]},n=null==t?e.len:e.pos+t;for(;e.pos>>3){case 5:r.protocolVersion=e.string();break;case 6:r.agentVersion=e.string();break;case 1:r.publicKey=e.bytes();break;case 2:r.listenAddrs.push(e.bytes());break;case 4:r.observedAddr=e.bytes();break;case 3:r.protocols.push(e.string());break;case 8:r.signedPeerRecord=e.bytes();break;default:e.skipType(7&t)}}return r}))),t),e.encode=t=>jt(t,e.codec()),e.decode=t=>Y(t,e.codec())}($p||($p={}));var Hp=__webpack_require__(4866);const qp="object"==typeof window&&"object"==typeof document&&9===document.nodeType,Vp=Hp(),jp=qp&&!Vp,Kp=Vp&&!qp,zp=Vp&&qp,Gp=void 0!==globalThis.process&&void 0!==globalThis.process.release&&"node"===globalThis.process.release.name&&!Vp,Wp="function"==typeof importScripts&&"undefined"!=typeof self&&"undefined"!=typeof WorkerGlobalScope&&self instanceof WorkerGlobalScope,Yp=(void 0!==globalThis.process&&void 0!==globalThis.process.env&&globalThis.process.env.NODE_ENV,"undefined"!=typeof navigator&&"ReactNative"===navigator.product),Jp="ipfs",Xp=5e3,Qp=1,Zp=1,ef=10,tf=8192,rf=!0,nf=!0;class sf{host;protocol;started;timeout;peerId;peerStore;registrar;addressManager;maxInboundStreams;maxOutboundStreams;maxMessageSize;maxObservedAddresses;events;runOnTransientConnection;log;constructor(e,t){var r,n;this.protocol=t.protocol,this.started=!1,this.peerId=e.peerId,this.peerStore=e.peerStore,this.registrar=e.registrar,this.addressManager=e.addressManager,this.events=e.events,this.log=t.log,this.timeout=t.timeout??Xp,this.maxInboundStreams=t.maxInboundStreams??Qp,this.maxOutboundStreams=t.maxOutboundStreams??Zp,this.maxMessageSize=t.maxMessageSize??tf,this.maxObservedAddresses=t.maxObservedAddresses??ef,this.runOnTransientConnection=t.runOnTransientConnection??nf,this.host={protocolVersion:`${t.protocolPrefix??Jp}/0.1.0`,agentVersion:(r=e.nodeInfo,n=t.agentVersion,null!=n||(n=`${r.name}/${r.version}`,Gp||Kp?n+=` UserAgent=${globalThis.process.version}`:(jp||Wp||zp||Yp)&&(n+=` UserAgent=${globalThis.navigator.userAgent}`)),n)}}isStarted(){return this.started}async start(){this.started||(await this.peerStore.merge(this.peerId,{metadata:{AgentVersion:Nt(this.host.agentVersion),ProtocolVersion:Nt(this.host.protocolVersion)}}),await this.registrar.handle(this.protocol,(e=>{this.handleProtocol(e).catch((e=>{this.log.error(e)}))}),{maxInboundStreams:this.maxInboundStreams,maxOutboundStreams:this.maxOutboundStreams,runOnTransientConnection:this.runOnTransientConnection}),this.started=!0)}async stop(){await this.registrar.unhandle(this.protocol),this.started=!1}}class of extends sf{constructor(e,t={}){super(e,{...t,protocol:`/${t.protocolPrefix??Jp}/id/1.0.0`,log:e.logger.forComponent("libp2p:identify")}),(t.runOnConnectionOpen??rf)&&e.events.addEventListener("connection:open",(e=>{const t=e.detail;this.identify(t).catch((e=>{this.log.error("error during identify trigged by connection:open",e)}))}))}[Vu]=["@libp2p/identify"];async _identify(e,t={}){let r;if(null==t.signal){const e=AbortSignal.timeout(this.timeout);t={...t,signal:e}}try{r=await e.newStream(this.protocol,{...t,runOnTransientConnection:this.runOnTransientConnection});const n=Fp(r,{maxDataLength:this.maxMessageSize}).pb($p),s=await n.read(t);return await r.close(t),s}catch(e){throw this.log.error("error while reading identify message",e),r?.abort(e),e}}async identify(e,t={}){const r=await this._identify(e,t),{publicKey:n,protocols:s,observedAddr:o}=r;if(null==n)throw new eo("public key was missing from identify message","ERR_MISSING_PUBLIC_KEY");const i=await sh(n);if(!e.remotePeer.equals(i))throw new eo("identified peer does not match the expected peer","ERR_INVALID_PEER");if(this.peerId.equals(i))throw new eo("identified peer is our own peer id?","ERR_INVALID_PEER");const a=function(e){if(null!=e&&e.length>0)try{return Mo(e)}catch{}}(o);return this.log("identify completed for peer %p and protocols %o",i,s),this.log("our observed address is %a",a),null!=a&&this.addressManager.getObservedAddrs().length<(this.maxObservedAddresses??1/0)&&(this.log("storing our observed address %a",a),this.addressManager.addObservedAddr(a)),async function(e,t,r,n,s){if(r("received identify from %p",n.remotePeer),null==s)throw new eo("message was null or undefined","ERR_INVALID_MESSAGE");const o={};if(s.listenAddrs.length>0&&(o.addresses=s.listenAddrs.map((e=>({isCertified:!1,multiaddr:Mo(e)})))),s.protocols.length>0&&(o.protocols=s.protocols),null!=s.publicKey&&(o.publicKey=s.publicKey,!(await sh(s.publicKey)).equals(n.remotePeer)))throw new eo("public key did not match remote PeerId","ERR_INVALID_PUBLIC_KEY");let i;if(null!=s.signedPeerRecord){r("received signedPeerRecord from %p",n.remotePeer);let t=s.signedPeerRecord;const a=await ip.openAndCertify(t,sp.DOMAIN);let c,l=sp.createFromProtobuf(a.payload);if(!l.peerId.equals(a.peerId))throw new eo("signing key does not match PeerId in the PeerRecord","ERR_INVALID_SIGNING_KEY");if(!n.remotePeer.equals(l.peerId))throw new eo("signing key does not match remote PeerId","ERR_INVALID_PEER_RECORD_KEY");try{c=await e.get(l.peerId)}catch(e){if("ERR_NOT_FOUND"!==e.code)throw e}if(null!=c&&(o.metadata=c.metadata,null!=c.peerRecordEnvelope)){const e=await ip.createFromProtobuf(c.peerRecordEnvelope),n=sp.createFromProtobuf(e.payload);n.seqNumber>=l.seqNumber&&(r("sequence number was lower or equal to existing sequence number - stored: %d received: %d",n.seqNumber,l.seqNumber),l=n,t=c.peerRecordEnvelope)}o.peerRecordEnvelope=t,o.addresses=l.multiaddrs.map((e=>({isCertified:!0,multiaddr:e}))),i={seq:l.seqNumber,addresses:l.multiaddrs}}else r("%p did not send a signed peer record",n.remotePeer);if(r("patching %p with",n.remotePeer,o),await e.patch(n.remotePeer,o),null!=s.agentVersion||null!=s.protocolVersion){const t={};null!=s.agentVersion&&(t.AgentVersion=Nt(s.agentVersion)),null!=s.protocolVersion&&(t.ProtocolVersion=Nt(s.protocolVersion)),r("merging %p metadata",n.remotePeer,t),await e.merge(n.remotePeer,{metadata:t})}const a={peerId:n.remotePeer,protocolVersion:s.protocolVersion,agentVersion:s.agentVersion,publicKey:s.publicKey,listenAddrs:s.listenAddrs.map((e=>Mo(e))),observedAddr:null==s.observedAddr?void 0:Mo(s.observedAddr),protocols:s.protocols,signedPeerRecord:i,connection:n};return t.safeDispatchEvent("peer:identify",{detail:a}),a}(this.peerStore,this.events,this.log,e,r)}async handleProtocol(e){const{connection:t,stream:r}=e,n=AbortSignal.timeout(this.timeout);try{const e=this.peerId.publicKey??new Uint8Array(0),s=await this.peerStore.get(this.peerId),o=this.addressManager.getAddresses().map((e=>e.decapsulateCode(mo("p2p").code)));let i=s.peerRecordEnvelope;if(o.length>0&&null==i){const e=new sp({peerId:this.peerId,multiaddrs:o});i=(await ip.seal(e,this.peerId)).marshal().subarray()}let a=t.remoteAddr.bytes;Ip.matches(t.remoteAddr)||(a=void 0);const c=Fp(r).pb($p);await c.write({protocolVersion:this.host.protocolVersion,agentVersion:this.host.agentVersion,publicKey:e,listenAddrs:o.map((e=>e.bytes)),signedPeerRecord:i,observedAddr:a,protocols:s.protocols},{signal:n}),await r.close({signal:n})}catch(e){this.log.error("could not respond to identify request",e),r.abort(e)}}}function af(e={}){return t=>new of(t,e)}function cf(e,t){const r=function(e){if(null!=e){if("function"==typeof e[Symbol.iterator])return e[Symbol.iterator]();if("function"==typeof e[Symbol.asyncIterator])return e[Symbol.asyncIterator]();if("function"==typeof e.next)return e}throw new Error("argument is not an iterator or iterable")}(e).return?.();var n;null!=(n=r)&&"function"==typeof n.then&&"function"==typeof n.catch&&"function"==typeof n.finally&&r.catch((e=>{t.error("could not cause iterator to return",e)}))}const lf=()=>{const e=new Error("Delay aborted");return e.name="AbortError",e},uf=new WeakMap,hf=function({clearTimeout:e,setTimeout:t}={}){return(r,{value:n,signal:s}={})=>{if(s?.aborted)return Promise.reject(lf());let o,i,a;const c=e??clearTimeout,l=()=>{c(o),a(lf())},u=new Promise(((e,c)=>{i=()=>{s&&s.removeEventListener("abort",l),e(n)},a=c,o=(t??setTimeout)(i,r)}));return s&&s.addEventListener("abort",l,{once:!0}),uf.set(u,(()=>{c(o),o=null,i()})),u}}();class df{memoryStorage;points;duration;blockDuration;execEvenly;execEvenlyMinDelayMs;keyPrefix;constructor(e={}){this.points=e.points??4,this.duration=e.duration??1,this.blockDuration=e.blockDuration??0,this.execEvenly=e.execEvenly??!1,this.execEvenlyMinDelayMs=e.execEvenlyMinDelayMs??1e3*this.duration/this.points,this.keyPrefix=e.keyPrefix??"rlflx",this.memoryStorage=new pf}async consume(e,t=1,r={}){const n=this.getKey(e),s=this._getKeySecDuration(r);let o=this.memoryStorage.incrby(n,t,s);if(o.remainingPoints=Math.max(this.points-o.consumedPoints,0),o.consumedPoints>this.points)throw this.blockDuration>0&&o.consumedPoints<=this.points+t&&(o=this.memoryStorage.set(n,o.consumedPoints,this.blockDuration)),new eo("Rate limit exceeded","ERR_RATE_LIMIT_EXCEEDED",o);if(this.execEvenly&&o.msBeforeNext>0&&!o.isFirstInDuration){let e=Math.ceil(o.msBeforeNext/(o.remainingPoints+2));e=0?r:this.duration);return this.memoryStorage.set(this.getKey(e),t,r),{remainingPoints:0,msBeforeNext:0===n?-1:n,consumedPoints:t,isFirstInDuration:!1}}get(e){const t=this.memoryStorage.get(this.getKey(e));return null!=t&&(t.remainingPoints=Math.max(this.points-t.consumedPoints,0)),t}delete(e){this.memoryStorage.delete(this.getKey(e))}_getKeySecDuration(e){return null!=e?.customDuration&&e.customDuration>=0?e.customDuration:this.duration}getKey(e){return this.keyPrefix.length>0?`${this.keyPrefix}:${e}`:e}parseKey(e){return e.substring(this.keyPrefix.length)}}class pf{storage;constructor(){this.storage=new Map}incrby(e,t,r){const n=this.storage.get(e);if(null!=n){const s=null!=n.expiresAt?n.expiresAt.getTime()-(new Date).getTime():-1;return null==n.expiresAt||s>0?(n.value+=t,{remainingPoints:0,msBeforeNext:s,consumedPoints:n.value,isFirstInDuration:!1}):this.set(e,t,r)}return this.set(e,t,r)}set(e,t,r){const n=1e3*r,s=this.storage.get(e);null!=s&&clearTimeout(s.timeoutId);const o={value:t,expiresAt:n>0?new Date(Date.now()+n):void 0};return this.storage.set(e,o),n>0&&(o.timeoutId=setTimeout((()=>{this.storage.delete(e)}),n),null!=o.timeoutId.unref&&o.timeoutId.unref()),{remainingPoints:0,msBeforeNext:0===n?-1:n,consumedPoints:o.value,isFirstInDuration:!0}}get(e){const t=this.storage.get(e);if(null!=t)return{remainingPoints:0,msBeforeNext:null!=t.expiresAt?t.expiresAt.getTime()-(new Date).getTime():-1,consumedPoints:t.value,isFirstInDuration:!1}}delete(e){const t=this.storage.get(e);return null!=t&&(null!=t.timeoutId&&clearTimeout(t.timeoutId),this.storage.delete(e),!0)}}var ff;!function(e){e[e.NEW_STREAM=0]="NEW_STREAM",e[e.MESSAGE_RECEIVER=1]="MESSAGE_RECEIVER",e[e.MESSAGE_INITIATOR=2]="MESSAGE_INITIATOR",e[e.CLOSE_RECEIVER=3]="CLOSE_RECEIVER",e[e.CLOSE_INITIATOR=4]="CLOSE_INITIATOR",e[e.RESET_RECEIVER=5]="RESET_RECEIVER",e[e.RESET_INITIATOR=6]="RESET_INITIATOR"}(ff||(ff={}));const gf=Object.freeze({0:"NEW_STREAM",1:"MESSAGE_RECEIVER",2:"MESSAGE_INITIATOR",3:"CLOSE_RECEIVER",4:"CLOSE_INITIATOR",5:"RESET_RECEIVER",6:"RESET_INITIATOR"}),yf=Object.freeze({NEW_STREAM:ff.NEW_STREAM,MESSAGE:ff.MESSAGE_INITIATOR,CLOSE:ff.CLOSE_INITIATOR,RESET:ff.RESET_INITIATOR}),mf=Object.freeze({MESSAGE:ff.MESSAGE_RECEIVER,CLOSE:ff.CLOSE_RECEIVER,RESET:ff.RESET_RECEIVER}),bf=1<<20;class wf{_buffer;_headerInfo;_maxMessageSize;_maxUnprocessedMessageQueueSize;constructor(e=bf,t=4194304){this._buffer=new Bn,this._headerInfo=null,this._maxMessageSize=e,this._maxUnprocessedMessageQueueSize=t}write(e){if(null==e||0===e.length)return[];if(this._buffer.append(e),this._buffer.byteLength>this._maxUnprocessedMessageQueueSize)throw Object.assign(new Error("unprocessed message queue size too large!"),{code:"ERR_MSG_QUEUE_TOO_BIG"});const t=[];for(;0!==this._buffer.length;){if(null==this._headerInfo)try{this._headerInfo=this._decodeHeader(this._buffer)}catch(e){if("ERR_MSG_TOO_BIG"===e.code)throw e;break}const{id:e,type:r,length:n,offset:s}=this._headerInfo;if(this._buffer.length-sthis._maxMessageSize)throw Object.assign(new Error("message size too large!"),{code:"ERR_MSG_TOO_BIG"});return{id:t>>3,type:o,offset:r+s,length:n}}}const vf=128,Ef=127;function Sf(e,t=0){let r,n=0,s=0,o=t;const i=e.length;do{if(o>=i||s>49)throw t=0,new RangeError("Could not decode varint");r=e.get(o++),n+=s<28?(r&Ef)<=vf);return{value:n,offset:t=o-t}}const Af=10240,_f=new class{_pool;_poolOffset;constructor(){this._pool=w(Af),this._poolOffset=0}write(e,t){const r=this._pool;let n=this._poolOffset;P(e.id<<3|e.type,r,n),n+=C(e.id<<3|e.type),e.type!==ff.NEW_STREAM&&e.type!==ff.MESSAGE_INITIATOR&&e.type!==ff.MESSAGE_RECEIVER||null==e.data?(P(0,r,n),n+=C(0)):(P(e.data.length,r,n),n+=C(e.data.length));const s=r.subarray(this._poolOffset,n);Af-n<100?(this._pool=w(Af),this._poolOffset=0):this._poolOffset=n,t.append(s),e.type!==ff.NEW_STREAM&&e.type!==ff.MESSAGE_INITIATOR&&e.type!==ff.MESSAGE_RECEIVER||null==e.data||t.append(e.data)}};function kf(e){return null!=e&&"function"==typeof e.then&&"function"==typeof e.catch&&"function"==typeof e.finally}class If{id;direction;timeline;protocol;metadata;source;status;readStatus;writeStatus;log;sinkController;sinkEnd;closed;endErr;streamSource;onEnd;onCloseRead;onCloseWrite;onReset;onAbort;sendCloseWriteTimeout;sendingData;constructor(e){this.sinkController=new AbortController,this.sinkEnd=Gn(),this.closed=Gn(),this.log=e.log,this.status="open",this.readStatus="ready",this.writeStatus="ready",this.id=e.id,this.metadata=e.metadata??{},this.direction=e.direction,this.timeline={open:Date.now()},this.sendCloseWriteTimeout=e.sendCloseWriteTimeout??5e3,this.onEnd=e.onEnd,this.onCloseRead=e?.onCloseRead,this.onCloseWrite=e?.onCloseWrite,this.onReset=e?.onReset,this.onAbort=e?.onAbort,this.source=this.streamSource=Xn({onEnd:e=>{null!=e?this.log.trace("source ended with error",e):this.log.trace("source ended"),this.onSourceEnd(e)}}),this.sink=this.sink.bind(this)}async sink(e){if("ready"!==this.writeStatus)throw new eo(`writable end state is "${this.writeStatus}" not "ready"`,"ERR_SINK_INVALID_STATE");try{this.writeStatus="writing";const t={signal:this.sinkController.signal};if("outbound"===this.direction){const e=this.sendNewStream(t);kf(e)&&await e}const r=()=>{cf(e,this.log)};try{this.sinkController.signal.addEventListener("abort",r),this.log.trace("sink reading from source");for await(let r of e){r=r instanceof Uint8Array?new Bn(r):r;const e=this.sendData(r,t);kf(e)&&(this.sendingData=Gn(),await e,this.sendingData.resolve(),this.sendingData=void 0)}}finally{this.sinkController.signal.removeEventListener("abort",r)}this.log.trace('sink finished reading from source, write status is "%s"',this.writeStatus),"writing"===this.writeStatus&&(this.writeStatus="closing",this.log.trace("send close write to remote"),await this.sendCloseWrite({signal:AbortSignal.timeout(this.sendCloseWriteTimeout)}),this.writeStatus="closed"),this.onSinkEnd()}catch(e){throw this.log.trace("sink ended with error, calling abort with error",e),this.abort(e),e}finally{this.log.trace("resolve sink end"),this.sinkEnd.resolve()}}onSourceEnd(e){null==this.timeline.closeRead&&(this.timeline.closeRead=Date.now(),this.readStatus="closed",null!=e&&null==this.endErr&&(this.endErr=e),this.onCloseRead?.(),null!=this.timeline.closeWrite?(this.log.trace("source and sink ended"),this.timeline.close=Date.now(),"aborted"!==this.status&&"reset"!==this.status&&(this.status="closed"),null!=this.onEnd&&this.onEnd(this.endErr),this.closed.resolve()):this.log.trace("source ended, waiting for sink to end"))}onSinkEnd(e){null==this.timeline.closeWrite&&(this.timeline.closeWrite=Date.now(),this.writeStatus="closed",null!=e&&null==this.endErr&&(this.endErr=e),this.onCloseWrite?.(),null!=this.timeline.closeRead?(this.log.trace("sink and source ended"),this.timeline.close=Date.now(),"aborted"!==this.status&&"reset"!==this.status&&(this.status="closed"),null!=this.onEnd&&this.onEnd(this.endErr),this.closed.resolve()):this.log.trace("sink ended, waiting for source to end"))}async close(e){this.log.trace("closing gracefully"),this.status="closing",await ih(Promise.all([this.closeWrite(e),this.closeRead(e),this.closed.promise]),e?.signal),this.status="closed",this.log.trace("closed gracefully")}async closeRead(e={}){if("closing"===this.readStatus||"closed"===this.readStatus)return;this.log.trace('closing readable end of stream with starting read status "%s"',this.readStatus);const t=this.readStatus;this.readStatus="closing","reset"!==this.status&&"aborted"!==this.status&&null==this.timeline.closeRead&&(this.log.trace("send close read to remote"),await this.sendCloseRead(e)),"ready"===t&&(this.log.trace("ending internal source queue with %d queued bytes",this.streamSource.readableLength),this.streamSource.end()),this.log.trace("closed readable end of stream")}async closeWrite(e={}){"closing"!==this.writeStatus&&"closed"!==this.writeStatus&&(this.log.trace('closing writable end of stream with starting write status "%s"',this.writeStatus),"ready"===this.writeStatus&&(this.log.trace("sink was never sunk, sink an empty array"),await ih(this.sink([]),e.signal)),"writing"===this.writeStatus&&(null!=this.sendingData&&await ih(this.sendingData.promise,e.signal),this.log.trace("aborting source passed to .sink"),this.sinkController.abort(),await ih(this.sinkEnd.promise,e.signal)),this.writeStatus="closed",this.log.trace("closed writable end of stream"))}abort(e){if("closed"===this.status||"aborted"===this.status||"reset"===this.status)return;this.log("abort with error",e),this.log("try to send reset to remote");const t=this.sendReset();kf(t)&&t.catch((e=>{this.log.error("error sending reset message",e)})),this.status="aborted",this.timeline.abort=Date.now(),this._closeSinkAndSource(e),this.onAbort?.(e)}reset(){if("closed"===this.status||"aborted"===this.status||"reset"===this.status)return;const e=new eo("stream reset","ERR_STREAM_RESET");this.status="reset",this.timeline.reset=Date.now(),this._closeSinkAndSource(e),this.onReset?.()}_closeSinkAndSource(e){this._closeSink(e),this._closeSource(e)}_closeSink(e){"writing"===this.writeStatus&&(this.log.trace("end sink source"),this.sinkController.abort()),this.onSinkEnd(e)}_closeSource(e){"closing"!==this.readStatus&&"closed"!==this.readStatus&&(this.log.trace("ending source with %d bytes to be read by consumer",this.streamSource.readableLength),this.readStatus="closing",this.streamSource.end(e))}remoteCloseWrite(){"closing"!==this.readStatus&&"closed"!==this.readStatus?(this.log.trace("remote close write"),this._closeSource()):this.log("received remote close write but local source is already closed")}remoteCloseRead(){"closing"!==this.writeStatus&&"closed"!==this.writeStatus?(this.log.trace("remote close read"),this._closeSink()):this.log("received remote close read but local sink is already closed")}destroy(){"closed"!==this.status&&"aborted"!==this.status&&"reset"!==this.status?(this.log.trace("stream destroyed"),this._closeSinkAndSource()):this.log("received destroy but we are already closed")}sourcePush(e){this.streamSource.push(e)}sourceReadableLength(){return this.streamSource.readableLength}}class Rf extends If{name;streamId;send;types;maxDataSize;constructor(e){super(e),this.types="outbound"===e.direction?yf:mf,this.send=e.send,this.name=e.name,this.streamId=e.streamId,this.maxDataSize=e.maxDataSize}async sendNewStream(){await this.send({id:this.streamId,type:yf.NEW_STREAM,data:new Bn(Nt(this.name))})}async sendData(e){for(e=e.sublist();e.byteLength>0;){const t=Math.min(e.byteLength,this.maxDataSize);await this.send({id:this.streamId,type:this.types.MESSAGE,data:e.sublist(0,t)}),e.consume(t)}}async sendReset(){await this.send({id:this.streamId,type:this.types.RESET})}async sendCloseWrite(){await this.send({id:this.streamId,type:this.types.CLOSE})}async sendCloseRead(){}}function Tf(e){const t={...e,type:`${gf[e.type]} (${e.type})`};return e.type===ff.NEW_STREAM&&(t.data=sn(e.data instanceof Uint8Array?e.data:e.data.subarray())),e.type!==ff.MESSAGE_INITIATOR&&e.type!==ff.MESSAGE_RECEIVER||(t.data=sn(e.data instanceof Uint8Array?e.data:e.data.subarray(),"base16")),t}class Cf{protocol="/mplex/6.7.0";sink;source;log;_streamId;_streams;_init;_source;closeController;rateLimiter;closeTimeout;logger;constructor(e,t){t=t??{},this.log=e.logger.forComponent("libp2p:mplex"),this.logger=e.logger,this._streamId=0,this._streams={initiators:new Map,receivers:new Map},this._init=t,this.closeTimeout=t.closeTimeout??500,this.sink=this._createSink(),this._source=Xn({objectMode:!0,onEnd:()=>{for(const e of this._streams.initiators.values())e.destroy();for(const e of this._streams.receivers.values())e.destroy()}}),this.source=Zn(this._source,(e=>async function*(e){for await(const t of e){const e=new Bn;_f.write(t,e),yield e}}(e))),this.closeController=new AbortController,this.rateLimiter=new df({points:t.disconnectThreshold??5,duration:1})}get streams(){const e=[];for(const t of this._streams.initiators.values())e.push(t);for(const t of this._streams.receivers.values())e.push(t);return e}newStream(e){if(this.closeController.signal.aborted)throw new Error("Muxer already closed");const t=this._streamId++;e=null==e?t.toString():e.toString();const r=this._streams.initiators;return this._newStream({id:t,name:e,type:"initiator",registry:r})}async close(e){if(this.closeController.signal.aborted)return;const t=e?.signal??AbortSignal.timeout(this.closeTimeout);try{await Promise.all(this.streams.map((async e=>e.close({signal:t})))),this._source.end(),await this._source.onEmpty({signal:t}),this.closeController.abort()}catch(e){this.abort(e)}}abort(e){this.closeController.signal.aborted||(this.streams.forEach((t=>{t.abort(e)})),this.closeController.abort(e))}_newReceiverStream(e){const{id:t,name:r}=e,n=this._streams.receivers;return this._newStream({id:t,name:r,type:"receiver",registry:n})}_newStream(e){const{id:t,name:r,type:n,registry:s}=e;if(this.log("new %s stream %s",n,t),"initiator"===n&&this._streams.initiators.size===(this._init.maxOutboundStreams??1024))throw new eo("Too many outbound streams open","ERR_TOO_MANY_OUTBOUND_STREAMS");if(s.has(t))throw new Error(`${n} stream ${t} already exists!`);const o=function(e){const{id:t,name:r,send:n,onEnd:s,type:o="initiator",maxMsgSize:i=bf}=e;return new Rf({id:"initiator"===o?`i${t}`:`r${t}`,streamId:t,name:`${r??t}`,direction:"initiator"===o?"outbound":"inbound",maxDataSize:i,onEnd:s,send:n,log:e.logger.forComponent(`libp2p:mplex:stream:${o}:${t}`)})}({id:t,name:r,send:async e=>{this.log.enabled&&this.log.trace("%s stream %s send",n,t,Tf(e)),this._source.push(e)},type:n,onEnd:()=>{this.log("%s stream with id %s and protocol %s ended",n,t,o.protocol),s.delete(t),null!=this._init.onStreamEnd&&this._init.onStreamEnd(o)},maxMsgSize:this._init.maxMsgSize,logger:this.logger});return s.set(t,o),o}_createSink(){return async e=>{const t=()=>{cf(e,this.log)};this.closeController.signal.addEventListener("abort",t);try{const t=new wf(this._init.maxMsgSize,this._init.maxUnprocessedMessageQueueSize);for await(const r of e)for(const e of t.write(r))await this._handleIncoming(e);this._source.end()}catch(e){this.log("error in sink",e),this._source.end(e)}finally{this.closeController.signal.removeEventListener("abort",t)}}}async _handleIncoming(e){const{id:t,type:r}=e;if(this.log.enabled&&this.log.trace("incoming message",Tf(e)),e.type===ff.NEW_STREAM){if(this._streams.receivers.size===(this._init.maxInboundStreams??1024)){this.log("too many inbound streams open"),this._source.push({id:t,type:ff.RESET_RECEIVER});try{await this.rateLimiter.consume("new-stream",1)}catch{return this.log("rate limit hit when opening too many new streams over the inbound stream limit - closing remote connection"),void this.abort(new Error("Too many open streams"))}return}const r=this._newReceiverStream({id:t,name:sn(e.data instanceof Uint8Array?e.data:e.data.subarray())});return void(null!=this._init.onIncomingStream&&this._init.onIncomingStream(r))}const n=(1&~r?this._streams.receivers:this._streams.initiators).get(t);if(null==n){this.log("missing stream %s for message type %s",t,gf[r]);try{await this.rateLimiter.consume("missing-stream",1)}catch{return this.log("rate limit hit when receiving messages for streams that do not exist - closing remote connection"),void this.abort(new Error("Too many messages for missing streams"))}return}const s=this._init.maxStreamBufferSize??4194304;try{switch(r){case ff.MESSAGE_INITIATOR:case ff.MESSAGE_RECEIVER:if(n.sourceReadableLength()>s)throw this._source.push({id:e.id,type:r===ff.MESSAGE_INITIATOR?ff.RESET_RECEIVER:ff.RESET_INITIATOR}),new eo("Input buffer full - increase Mplex maxBufferSize to accommodate slow consumers","ERR_STREAM_INPUT_BUFFER_FULL");n.sourcePush(e.data);break;case ff.CLOSE_INITIATOR:case ff.CLOSE_RECEIVER:n.remoteCloseWrite();break;case ff.RESET_INITIATOR:case ff.RESET_RECEIVER:n.reset();break;default:this.log("unknown message type %s",r)}}catch(e){this.log.error("error while processing message",e),n.abort(e)}}}class Nf{protocol="/mplex/6.7.0";_init;components;constructor(e,t={}){this.components=e,this._init=t}[Symbol.toStringTag]="@libp2p/mplex";[Vu]=["@libp2p/stream-multiplexing"];createStreamMuxer(e={}){return new Cf(this.components,{...e,...this._init})}}function xf(e={}){return t=>new Nf(t,e)}const Pf="ERR_WRONG_PING_ACK";class Of{protocol;components;started;timeout;maxInboundStreams;maxOutboundStreams;runOnTransientConnection;log;constructor(e,t={}){this.components=e,this.log=e.logger.forComponent("libp2p:ping"),this.started=!1,this.protocol=`/${t.protocolPrefix??"ipfs"}/ping/1.0.0`,this.timeout=t.timeout??1e4,this.maxInboundStreams=t.maxInboundStreams??2,this.maxOutboundStreams=t.maxOutboundStreams??1,this.runOnTransientConnection=t.runOnTransientConnection??!0,this.handleMessage=this.handleMessage.bind(this)}[Symbol.toStringTag]="@libp2p/ping";async start(){await this.components.registrar.handle(this.protocol,this.handleMessage,{maxInboundStreams:this.maxInboundStreams,maxOutboundStreams:this.maxOutboundStreams,runOnTransientConnection:this.runOnTransientConnection}),this.started=!0}async stop(){await this.components.registrar.unhandle(this.protocol),this.started=!1}isStarted(){return this.started}handleMessage(e){this.log("incoming ping from %p",e.connection.remotePeer);const{stream:t}=e,r=Date.now();AbortSignal.timeout(this.timeout).addEventListener("abort",(()=>{t?.abort(new eo("ping timeout",ro))})),Zn(t,(async function*(e){let r=0;for await(const n of e){if(r+=n.byteLength,r>32)return void t?.abort(new eo("Too much data received","ERR_INVALID_MESSAGE"));yield n}}),t).catch((r=>{this.log.error("incoming ping from %p failed with error",e.connection.remotePeer,r),t?.abort(r)})).finally((()=>{const t=Date.now()-r;this.log("incoming ping from %p complete in %dms",e.connection.remotePeer,t)}))}async ping(e,t={}){this.log("pinging %p",e);const r=Date.now(),n=su(32),s=await this.components.connectionManager.openConnection(e,t);let o,i=()=>{};if(null==t.signal){const e=AbortSignal.timeout(this.timeout);t={...t,signal:e}}try{o=await s.newStream(this.protocol,{...t,runOnTransientConnection:this.runOnTransientConnection}),i=()=>{o?.abort(new eo("ping timeout",ro))},t.signal?.addEventListener("abort",i,{once:!0});const e=await Zn([n],o,(async e=>function(e){if(null!=e[Symbol.asyncIterator])return(async()=>{for await(const t of e)return t})();for(const t of e)return t}(e))),a=Date.now()-r;if(null==e)throw new eo(`Did not receive a ping ack after ${a}ms`,Pf);if(!Pn(n,e.subarray()))throw new eo(`Received wrong ping ack after ${a}ms`,Pf);return this.log("ping %p complete in %dms",s.remotePeer,a),a}catch(e){throw this.log.error("error while pinging %p",s.remotePeer,e),o?.abort(e),e}finally{t.signal?.removeEventListener("abort",i),null!=o&&await o.close()}}}function Df(e={}){return t=>new Of(t,e)}const Lf=Symbol.for("@libp2p/transport");var Bf;!function(e){e[e.FATAL_ALL=0]="FATAL_ALL",e[e.NO_FATAL=1]="NO_FATAL"}(Bf||(Bf={}));const Uf=[mo("tcp").code,mo("dns").code,mo("dnsaddr").code,mo("dns4").code,mo("dns6").code];function Mf(e){let t;try{t=mo("sni").code}catch(e){return null}for(const[r,n]of e)if(r===t&&void 0!==n)return n;return null}function Ff(e){return e.some((([e,t])=>e===mo("tls").code))}function $f(e,t,r){const n=Hf[mo(e).name];if(void 0===n)throw new Error(`Can't interpret protocol ${mo(e).name}`);const s=n(t,r);return e===mo("ip6").code?`[${s}]`:s}const Hf={ip4:(e,t)=>e,ip6:(e,t)=>0===t.length?e:`[${e}]`,tcp:(e,t)=>{const r=t.pop();if(void 0===r)throw new Error("Unexpected end of multiaddr");return`tcp://${$f(r[0],r[1]??"",t)}:${e}`},udp:(e,t)=>{const r=t.pop();if(void 0===r)throw new Error("Unexpected end of multiaddr");return`udp://${$f(r[0],r[1]??"",t)}:${e}`},dnsaddr:(e,t)=>e,dns4:(e,t)=>e,dns6:(e,t)=>e,dns:(e,t)=>e,ipfs:(e,t)=>{const r=t.pop();if(void 0===r)throw new Error("Unexpected end of multiaddr");return`${$f(r[0],r[1]??"",t)}/ipfs/${e}`},p2p:(e,t)=>{const r=t.pop();if(void 0===r)throw new Error("Unexpected end of multiaddr");return`${$f(r[0],r[1]??"",t)}/p2p/${e}`},http:(e,t)=>{const r=Ff(t),n=Mf(t);if(r&&null!==n)return`https://${n}`;const s=r?"https://":"http://",o=t.pop();if(void 0===o)throw new Error("Unexpected end of multiaddr");let i=$f(o[0],o[1]??"",t);return i=i.replace("tcp://",""),`${s}${i}`},"http-path":(e,t)=>{const r=t.pop();if(void 0===r)throw new Error("Unexpected end of multiaddr");return`${$f(r[0],r[1]??"",t)}/${decodeURIComponent(e)}`},tls:(e,t)=>{const r=t.pop();if(void 0===r)throw new Error("Unexpected end of multiaddr");return $f(r[0],r[1]??"",t)},sni:(e,t)=>{const r=t.pop();if(void 0===r)throw new Error("Unexpected end of multiaddr");return $f(r[0],r[1]??"",t)},https:(e,t)=>{const r=t.pop();if(void 0===r)throw new Error("Unexpected end of multiaddr");let n=$f(r[0],r[1]??"",t);return n=n.replace("tcp://",""),`https://${n}`},ws:(e,t)=>{const r=Ff(t),n=Mf(t);if(r&&null!==n)return`wss://${n}`;const s=r?"wss://":"ws://",o=t.pop();if(void 0===o)throw new Error("Unexpected end of multiaddr");let i=$f(o[0],o[1]??"",t);return i=i.replace("tcp://",""),`${s}${i}`},wss:(e,t)=>{const r=t.pop();if(void 0===r)throw new Error("Unexpected end of multiaddr");let n=$f(r[0],r[1]??"",t);return n=n.replace("tcp://",""),`wss://${n}`},"p2p-websocket-star":(e,t)=>{const r=t.pop();if(void 0===r)throw new Error("Unexpected end of multiaddr");return`${$f(r[0],r[1]??"",t)}/p2p-websocket-star`},"p2p-webrtc-star":(e,t)=>{const r=t.pop();if(void 0===r)throw new Error("Unexpected end of multiaddr");return`${$f(r[0],r[1]??"",t)}/p2p-webrtc-star`},"p2p-webrtc-direct":(e,t)=>{const r=t.pop();if(void 0===r)throw new Error("Unexpected end of multiaddr");return`${$f(r[0],r[1]??"",t)}/p2p-webrtc-direct`}},qf=async e=>{if(e.readyState>=2)throw new Error("socket closed");1!==e.readyState&&await new Promise(((t,r)=>{function n(){e.removeEventListener("open",s),e.removeEventListener("error",o)}function s(){n(),t()}function o(t){n(),r(t.error??new Error(`connect ECONNREFUSED ${e.url}`))}e.addEventListener("open",s),e.addEventListener("error",o)}))},Vf=(e,t)=>((t=t??{}).closeOnEnd=!1!==t.closeOnEnd,async r=>{for await(const t of r){try{await qf(e)}catch(e){if("socket closed"===e.message)break;throw e}if(e.readyState===e.CLOSING||e.readyState===e.CLOSED)break;e.send(t)}null!=t.closeOnEnd&&e.readyState<=1&&await new Promise(((t,r)=>{e.addEventListener("close",(e=>{if(e.wasClean||1006===e.code)t();else{const t=Object.assign(new Error("ws error"),{event:e});r(t)}})),setTimeout((()=>{e.close()}))}))});var jf=__webpack_require__(544);function Kf(e){return e instanceof ArrayBuffer||"ArrayBuffer"===e?.constructor?.name&&"number"==typeof e?.byteLength}const zf=WebSocket,Gf={"http:":"ws:","https:":"wss:"};function Wf(e,t){t=t??{};const r=((e,t)=>{if(e.startsWith("//")&&(e=`${t?.protocol??"ws:"}${e}`),e.startsWith("/")&&null!=t){const r=t.protocol??"ws:",n=t.host,s=null!=t.port&&!0!==n?.endsWith(`:${t.port}`)?`:${t.port}`:"";e=`${r}//${n}${s}${e}`}const r=new URL(e);for(const[e,t]of Object.entries(Gf))r.protocol===e&&(r.protocol=t);return r})(e,"undefined"==typeof window?void 0:window.location);return((e,t)=>{t=t??{};const r=(e=>{e.binaryType="arraybuffer";const t=async()=>{await new Promise(((t,r)=>{if(s)return void t();if(null!=n)return void r(n);const o=t=>{e.removeEventListener("open",i),e.removeEventListener("error",a),t()},i=()=>{o(t)},a=t=>{o((()=>{r(t.error??new Error(`connect ECONNREFUSED ${e.url}`))}))};e.addEventListener("open",i),e.addEventListener("error",a)}))},r=async function*(){const r=new jf.PP((({push:t,stop:r,fail:n})=>{const s=e=>{let r=null;"string"==typeof e.data&&(r=Nt(e.data)),Kf(e.data)&&(r=new Uint8Array(e.data)),e.data instanceof Uint8Array&&(r=e.data),null!=r&&t(r)},o=e=>{n(e.error??new Error("Socket error"))};return e.addEventListener("message",s),e.addEventListener("error",o),e.addEventListener("close",r),()=>{e.removeEventListener("message",s),e.removeEventListener("error",o),e.removeEventListener("close",r)}}),{highWaterMark:1/0});await t();for await(const e of r)yield Kf(e)?new Uint8Array(e):e}();let n,s=1===e.readyState;return e.addEventListener("open",(()=>{s=!0,n=null})),e.addEventListener("close",(()=>{s=!1,n=null})),e.addEventListener("error",(t=>{s||(n=t.error??new Error(`connect ECONNREFUSED ${e.url}`))})),Object.assign(r,{connected:t})})(e);let n=t.remoteAddress,s=t.remotePort;if(null!=e.url)try{const t=new URL(e.url);n=t.hostname,s=parseInt(t.port,10)}catch{}if(null==n||null==s)throw new Error("Remote connection did not have address and/or port");return{sink:Vf(e,t),source:r,connected:async()=>{await r.connected()},close:async()=>{e.readyState!==e.CONNECTING&&e.readyState!==e.OPEN||await new Promise((t=>{e.addEventListener("close",(()=>{t()})),e.close()}))},destroy:()=>{null!=e.terminate?e.terminate():e.close()},remoteAddress:n,remotePort:s,socket:e}})(new zf(r.toString(),t.websocket),t)}class Yf extends Event{constructor(e,t){super(e),this.detail=t}}const Jf=421,Xf=290;function Qf(e){return e.filter((e=>{if(e.protoCodes().includes(Xf))return!1;const t=e.decapsulateCode(Jf);return Dd.matches(t)||Bd.matches(t)}))}function Zf(e){return e.filter((e=>{if(e.protoCodes().includes(Xf))return!1;const t=e.decapsulateCode(Jf);return Bd.matches(t)}))}class eg{log;init;logger;metrics;components;constructor(e,t){this.log=e.logger.forComponent("libp2p:websockets"),this.logger=e.logger,this.components=e,this.init=t,null!=e.metrics&&(this.metrics={dialerEvents:e.metrics.registerCounterGroup("libp2p_websockets_dialer_events_total",{label:"event",help:"Total count of WebSockets dialer events by type"})})}[Lf]=!0;[Symbol.toStringTag]="@libp2p/websockets";[Vu]=["@libp2p/transport"];async dial(e,t){this.log("dialing %s",e),t=t??{};const r=function(e,t,r){const n=r.logger.forComponent("libp2p:websockets:maconn"),s=r.metrics,o=r.metricPrefix??"",i={log:n,async sink(t){try{await e.sink(async function*(){for await(const e of t)e instanceof Uint8Array?yield e:yield e.subarray()}())}catch(e){"aborted"!==e.type&&n.error(e)}},source:e.source,remoteAddr:t,timeline:{open:Date.now()},async close(t={}){const r=Date.now();if(null==t.signal){const e=AbortSignal.timeout(500);t={...t,signal:e}}const s=()=>{const{host:e,port:t}=i.remoteAddr.toOptions();n("timeout closing stream to %s:%s after %dms, destroying it manually",e,t,Date.now()-r),this.abort(new eo("Socket close timeout","ERR_SOCKET_CLOSE_TIMEOUT"))};t.signal?.addEventListener("abort",s);try{await e.close()}catch(e){n.error("error closing WebSocket gracefully",e),this.abort(e)}finally{t.signal?.removeEventListener("abort",s),i.timeline.close=Date.now()}},abort(t){const{host:r,port:a}=i.remoteAddr.toOptions();n("timeout closing stream to %s:%s due to error",r,a,t),e.destroy(),i.timeline.close=Date.now(),s?.increment({[`${o}error`]:!0})}};return e.socket.addEventListener("close",(()=>{s?.increment({[`${o}close`]:!0}),null==i.timeline.close&&(i.timeline.close=Date.now())}),{once:!0}),i}(await this._connect(e,t),e,{logger:this.logger,metrics:this.metrics?.dialerEvents});this.log("new outbound connection %s",r.remoteAddr);const n=await t.upgrader.upgradeOutbound(r,t);return this.log("outbound connection %s upgraded",r.remoteAddr),n}async _connect(e,t){t?.signal?.throwIfAborted();const r=e.toOptions();this.log("dialing %s:%s",r.host,r.port);const n=Gn(),s=Wf(function(e,t){const r=Mo(e).stringTuples(),n=r.pop();if(void 0===n)throw new Error("Unexpected end of multiaddr");const s=mo(n[0]),o=Hf[s.name];if(null==o)throw new Error(`No interpreter found for ${s.name}`);let i=o(n[1]??"",r);return Uf.includes(n[0])&&(i=i.replace(/^.*:\/\//,""),i="443"===n[1]?`https://${i}`:`http://${i}`),(i.startsWith("http://")||i.startsWith("https://"))&&(i=new URL(i).toString(),i.endsWith("/")&&(i=i.substring(0,i.length-1))),i}(e),this.init);s.socket.addEventListener("error",(()=>{const t=new eo(`Could not connect to ${e.toString()}`,"ERR_CONNECTION_FAILED");this.log.error("connection error:",t),this.metrics?.dialerEvents.increment({error:!0}),n.reject(t)}));try{t.onProgress?.(new Yf("websockets:open-connection")),await ih(Promise.race([s.connected(),n.promise]),t.signal)}catch(e){throw!0===t.signal?.aborted&&this.metrics?.dialerEvents.increment({abort:!0}),s.close().catch((e=>{this.log.error("error closing raw socket",e)})),e}return this.log("connected %s",e),this.metrics?.dialerEvents.increment({connect:!0}),s}createListener(e){return function(){throw new Error("WebSocket Servers can not be created in the browser!")}((this.logger,this.components.metrics),this.init)}listenFilter(e){return e=Array.isArray(e)?e:[e],null!=this.init?.filter?this.init?.filter(e):jp||Wp?Zf(e):Qf(e)}dialFilter(e){return this.listenFilter(e)}}function tg(e={}){return t=>new eg(t,e)}const rg=Symbol.for("@libp2p/content-routing"),ng=Symbol.for("@libp2p/peer-routing"),sg=1e3,og=60*sg,ig=60*og,ag=24*ig,cg=7*ag,lg=function(e,t){try{if("string"==typeof e&&e.length>0)return function(e){if((e=String(e)).length>100)throw new Error("Value exceeds the maximum length of 100 characters.");const t=/^(-?(?:\d+)?\.?\d+) *(milliseconds?|msecs?|ms|seconds?|secs?|s|minutes?|mins?|m|hours?|hrs?|h|days?|d|weeks?|w|years?|yrs?|y)?$/i.exec(e);if(!t)return NaN;const r=parseFloat(t[1]),n=(t[2]||"ms").toLowerCase();switch(n){case"years":case"year":case"yrs":case"yr":case"y":return 315576e5*r;case"weeks":case"week":case"w":return r*cg;case"days":case"day":case"d":return r*ag;case"hours":case"hour":case"hrs":case"hr":case"h":return r*ig;case"minutes":case"minute":case"mins":case"min":case"m":return r*og;case"seconds":case"second":case"secs":case"sec":case"s":return r*sg;case"milliseconds":case"millisecond":case"msecs":case"msec":case"ms":return r;default:throw new Error(`The unit ${n} was matched, but no matching case exists.`)}}(e);if("number"==typeof e&&isFinite(e))return t?.long?function(e){const t=Math.abs(e);return t>=ag?ug(e,t,ag,"day"):t>=ig?ug(e,t,ig,"hour"):t>=og?ug(e,t,og,"minute"):t>=sg?ug(e,t,sg,"second"):`${e} ms`}(e):function(e){const t=Math.abs(e);return t>=ag?`${Math.round(e/ag)}d`:t>=ig?`${Math.round(e/ig)}h`:t>=og?`${Math.round(e/og)}m`:t>=sg?`${Math.round(e/sg)}s`:`${e}ms`}(e);throw new Error("Value is not a string or number.")}catch(t){const r=function(e){return"object"==typeof e&&null!==e&&"message"in e}(t)?`${t.message}. value=${JSON.stringify(e)}`:"An unknown error has occured.";throw new Error(r)}};function ug(e,t,r,n){const s=t>=1.5*r;return`${Math.round(e/r)} ${n}${s?"s":""}`}const hg=function(){try{return localStorage}catch(e){}}(),dg=console.debug??console.log??(()=>{}),pg=function(e){function t(e){let n,s,o,i=null;function a(...e){if(!a.enabled)return;const r=a,s=Number(new Date),o=s-(n||s);r.diff=o,r.prev=n,r.curr=s,n=s,e[0]=t.coerce(e[0]),"string"!=typeof e[0]&&e.unshift("%O");let i=0;e[0]=e[0].replace(/%([a-zA-Z%])/g,((n,s)=>{if("%%"===n)return"%";i++;const o=t.formatters[s];if("function"==typeof o){const t=e[i];n=o.call(r,t),e.splice(i,1),i--}return n})),t.formatArgs.call(r,e),(r.log||t.log).apply(r,e)}return a.namespace=e,a.useColors=t.useColors(),a.color=t.selectColor(e),a.extend=r,a.destroy=t.destroy,Object.defineProperty(a,"enabled",{enumerable:!0,configurable:!1,get:()=>null!==i?i:(s!==t.namespaces&&(s=t.namespaces,o=t.enabled(e)),o),set:e=>{i=e}}),"function"==typeof t.init&&t.init(a),a}function r(e,r){const n=t(this.namespace+(void 0===r?":":r)+e);return n.log=this.log,n}function n(e){return e.toString().substring(2,e.toString().length-2).replace(/\.\*\?$/,"*")}return t.debug=t,t.default=t,t.coerce=function(e){return e instanceof Error?e.stack??e.message:e},t.disable=function(){const e=[...t.names.map(n),...t.skips.map(n).map((e=>"-"+e))].join(",");return t.enable(""),e},t.enable=function(e){let r;t.save(e),t.namespaces=e,t.names=[],t.skips=[];const n=("string"==typeof e?e:"").split(/[\s,]+/),s=n.length;for(r=0;r{t[r]=e[r]})),t.names=[],t.skips=[],t.formatters={},t.selectColor=function(e){let r=0;for(let t=0;t{"%%"!==e&&(r++,"%c"===e&&(n=r))})),e.splice(n,0,t)},save:function(e){try{e?hg?.setItem("debug",e):hg?.removeItem("debug")}catch(e){}},load:function(){let e;try{e=hg?.getItem("debug")}catch(e){}return!e&&"undefined"!=typeof process&&"env"in process&&(e=process.env.DEBUG),e},useColors:function(){return!("undefined"==typeof window||!window.process||"renderer"!==window.process.type&&!window.process.__nwjs)||("undefined"==typeof navigator||null==navigator.userAgent?.toLowerCase().match(/(edge|trident)\/(\d+)/))&&("undefined"!=typeof document&&document.documentElement?.style?.WebkitAppearance||"undefined"!=typeof window&&window.console&&(window.console.firebug||window.console.exception&&window.console.table)||"undefined"!=typeof navigator&&null!=navigator.userAgent?.toLowerCase().match(/firefox\/(\d+)/)&&parseInt(RegExp.$1,10)>=31||"undefined"!=typeof navigator&&navigator.userAgent?.toLowerCase().match(/applewebkit\/(\d+)/))},setupFormatters:function(e){e.j=function(e){try{return JSON.stringify(e)}catch(e){return"[UnexpectedJSONParseError]: "+e.message}}},colors:["#0000CC","#0000FF","#0033CC","#0033FF","#0066CC","#0066FF","#0099CC","#0099FF","#00CC00","#00CC33","#00CC66","#00CC99","#00CCCC","#00CCFF","#3300CC","#3300FF","#3333CC","#3333FF","#3366CC","#3366FF","#3399CC","#3399FF","#33CC00","#33CC33","#33CC66","#33CC99","#33CCCC","#33CCFF","#6600CC","#6600FF","#6633CC","#6633FF","#66CC00","#66CC33","#9900CC","#9900FF","#9933CC","#9933FF","#99CC00","#99CC33","#CC0000","#CC0033","#CC0066","#CC0099","#CC00CC","#CC00FF","#CC3300","#CC3333","#CC3366","#CC3399","#CC33CC","#CC33FF","#CC6600","#CC6633","#CC9900","#CC9933","#CCCC00","#CCCC33","#FF0000","#FF0033","#FF0066","#FF0099","#FF00CC","#FF00FF","#FF3300","#FF3333","#FF3366","#FF3399","#FF33CC","#FF33FF","#FF6600","#FF6633","#FF9900","#FF9933","#FFCC00","#FFCC33"],storage:hg,log:dg}),fg=pg;function gg(){return{forComponent:e=>function(e){let t=function(e){const t=()=>{};return t.enabled=!1,t.color="",t.diff=0,t.log=()=>{},t.namespace=e,t.destroy=()=>!0,t.extend=()=>t,t}(`${e}:trace`);return fg.enabled(`${e}:trace`)&&null!=fg.names.map((e=>e.toString())).find((e=>e.includes(":trace")))&&(t=fg(`${e}:trace`)),Object.assign(fg(e),{error:fg(`${e}:error`),trace:t})}(e)}}function yg(e,t){const r={[Symbol.iterator]:()=>r,next:()=>{const r=e.next(),n=r.value;return!0===r.done||null==n?{done:!0,value:void 0}:{done:!1,value:t(n)}}};return r}fg.formatters.b=e=>null==e?"undefined":ke.baseEncode(e),fg.formatters.t=e=>null==e?"undefined":fe.baseEncode(e),fg.formatters.m=e=>null==e?"undefined":Re.baseEncode(e),fg.formatters.p=e=>null==e?"undefined":e.toString(),fg.formatters.c=e=>null==e?"undefined":e.toString(),fg.formatters.k=e=>null==e?"undefined":e.toString(),fg.formatters.a=e=>null==e?"undefined":e.toString();class mg{set;constructor(e){if(this.set=new Set,null!=e)for(const t of e)this.set.add(t.toString())}get size(){return this.set.size}[Symbol.iterator](){return this.values()}add(e){this.set.add(e.toString())}clear(){this.set.clear()}delete(e){this.set.delete(e.toString())}entries(){return yg(this.set.entries(),(e=>{const t=rh(e[0]);return[t,t]}))}forEach(e){this.set.forEach((t=>{const r=rh(t);e(r,r,this)}))}has(e){return this.set.has(e.toString())}values(){return yg(this.set.values(),(e=>rh(e)))}intersection(e){const t=new mg;for(const r of e)this.has(r)&&t.add(r);return t}difference(e){const t=new mg;for(const r of this)e.has(r)||t.add(r);return t}union(e){const t=new mg;for(const r of e)t.add(r);for(const e of this)t.add(e);return t}}const bg=async()=>{const e=await async function(e,t){return Fu("Ed25519").generateKeyPair(2048)}(),t=await wg(e);if("Ed25519"===t.type)return t;throw new Error(`Generated unexpected PeerId type "${t.type}"`)};async function wg(e){return sh(Hu(e.public),(t=e,Fu(r=(r??"rsa").toLowerCase()),t.bytes));var t,r}async function vg(e){return async function(e,t,r){if(null!=t)return wg(await qu(t));if(null!=r)return async function(e){return sh(Hu(e))}($u(r));const n=nh(e);if("Ed25519"!==n.type&&"secp256k1"!==n.type&&"RSA"!==n.type)throw new Error("Supplied PeerID is invalid");return n}(Nt(e.id,"base58btc"),null!=e.privKey?Nt(e.privKey,"base64pad"):void 0,null!=e.pubKey?Nt(e.pubKey,"base64pad"):void 0)}class Eg{map;constructor(e){if(this.map=new Map,null!=e)for(const[t,r]of e.entries())this.map.set(t.toString(),r)}[Symbol.iterator](){return this.entries()}clear(){this.map.clear()}delete(e){return this.map.delete(e.toString())}entries(){return yg(this.map.entries(),(e=>[rh(e[0]),e[1]]))}forEach(e){this.map.forEach(((t,r)=>{e(t,rh(r),this)}))}get(e){return this.map.get(e.toString())}has(e){return this.map.has(e.toString())}set(e,t){this.map.set(e.toString(),t)}keys(){return yg(this.map.keys(),(e=>rh(e)))}values(){return this.map.values()}get size(){return this.map.size}}var Sg=__webpack_require__(228);class Ag{#o=[];enqueue(e,t){const r={priority:(t={priority:0,...t}).priority,run:e};if(this.size&&this.#o[this.size-1].priority>=t.priority)return void this.#o.push(r);const n=function(e,t,r){let n=0,s=e.length;for(;s>0;){const r=Math.trunc(s/2);let i=n+r;o=e[i],t.priority-o.priority<=0?(n=++i,s-=r+1):s=r}var o;return n}(this.#o,r);this.#o.splice(n,0,r)}dequeue(){const e=this.#o.shift();return e?.run}filter(e){return this.#o.filter((t=>t.priority===e.priority)).map((e=>e.run))}get size(){return this.#o.length}}class _g extends Sg{#i;#a;#c=0;#l;#u;#h=0;#d;#p;#o;#f;#g=0;#y;#m;#b;timeout;constructor(e){if(super(),!("number"==typeof(e={carryoverConcurrencyCount:!1,intervalCap:Number.POSITIVE_INFINITY,interval:0,concurrency:Number.POSITIVE_INFINITY,autoStart:!0,queueClass:Ag,...e}).intervalCap&&e.intervalCap>=1))throw new TypeError(`Expected \`intervalCap\` to be a number from 1 and up, got \`${e.intervalCap?.toString()??""}\` (${typeof e.intervalCap})`);if(void 0===e.interval||!(Number.isFinite(e.interval)&&e.interval>=0))throw new TypeError(`Expected \`interval\` to be a finite number >= 0, got \`${e.interval?.toString()??""}\` (${typeof e.interval})`);this.#i=e.carryoverConcurrencyCount,this.#a=e.intervalCap===Number.POSITIVE_INFINITY||0===e.interval,this.#l=e.intervalCap,this.#u=e.interval,this.#o=new e.queueClass,this.#f=e.queueClass,this.concurrency=e.concurrency,this.timeout=e.timeout,this.#b=!0===e.throwOnTimeout,this.#m=!1===e.autoStart}get#w(){return this.#a||this.#c{this.#A()}),t)),!0;this.#c=this.#i?this.#g:0}return!1}#S(){if(0===this.#o.size)return this.#d&&clearInterval(this.#d),this.#d=void 0,this.emit("empty"),0===this.#g&&this.emit("idle"),!1;if(!this.#m){const e=!this.#I;if(this.#w&&this.#v){const t=this.#o.dequeue();return!!t&&(this.emit("active"),t(),e&&this.#k(),!0)}}return!1}#k(){this.#a||void 0!==this.#d||(this.#d=setInterval((()=>{this.#_()}),this.#u),this.#h=Date.now()+this.#u)}#_(){0===this.#c&&0===this.#g&&this.#d&&(clearInterval(this.#d),this.#d=void 0),this.#c=this.#i?this.#g:0,this.#R()}#R(){for(;this.#S(););}get concurrency(){return this.#y}set concurrency(e){if(!("number"==typeof e&&e>=1))throw new TypeError(`Expected \`concurrency\` to be a number from 1 and up, got \`${e}\` (${typeof e})`);this.#y=e,this.#R()}async#T(e){return new Promise(((t,r)=>{e.addEventListener("abort",(()=>{r(e.reason)}),{once:!0})}))}async add(e,t={}){return t={timeout:this.timeout,throwOnTimeout:this.#b,...t},new Promise(((r,n)=>{this.#o.enqueue((async()=>{this.#g++,this.#c++;try{t.signal?.throwIfAborted();let n=e({signal:t.signal});t.timeout&&(n=Ps(Promise.resolve(n),{milliseconds:t.timeout})),t.signal&&(n=Promise.race([n,this.#T(t.signal)]));const s=await n;r(s),this.emit("completed",s)}catch(e){if(e instanceof Ts&&!t.throwOnTimeout)return void r();n(e),this.emit("error",e)}finally{this.#E()}}),t),this.emit("add"),this.#S()}))}async addAll(e,t){return Promise.all(e.map((async e=>this.add(e,t))))}start(){return this.#m?(this.#m=!1,this.#R(),this):this}pause(){this.#m=!0}clear(){this.#o=new this.#f}async onEmpty(){0!==this.#o.size&&await this.#C("empty")}async onSizeLessThan(e){this.#o.sizethis.#o.size{const n=()=>{t&&!t()||(this.off(e,n),r())};this.on(e,n)}))}get size(){return this.#o.size}sizeBy(e){return this.#o.filter(e).length}get pending(){return this.#g}get isPaused(){return this.#m}}const kg={},Ig=e=>{e.addEventListener("message",(t=>{Ig.dispatchEvent("message",e,t)})),null!=e.port&&e.port.addEventListener("message",(t=>{Ig.dispatchEvent("message",e,t)}))};Ig.addEventListener=(e,t)=>{null==kg[e]&&(kg[e]=[]),kg[e].push(t)},Ig.removeEventListener=(e,t)=>{null!=kg[e]&&(kg[e]=kg[e].filter((e=>e===t)))},Ig.dispatchEvent=function(e,t,r){null!=kg[e]&&kg[e].forEach((e=>e(t,r)))};const Rg=Ig,Tg="lock:worker:request-read",Cg="lock:worker:release-read",Ng="lock:master:grant-read",xg="lock:worker:request-write",Pg="lock:worker:release-write",Og="lock:master:grant-write",Dg=(e,t,r,n,s)=>(o,i)=>{if(i.data.type!==r)return;const a={type:i.data.type,name:i.data.name,identifier:i.data.identifier};e.dispatchEvent(new MessageEvent(t,{data:{name:a.name,handler:async()=>{o.postMessage({type:s,name:a.name,identifier:a.identifier}),await new Promise((e=>{const t=r=>{if(null==r||null==r.data)return;const s=r.data.type,i=(r.data.name,r.data.identifier);s===n&&i===a.identifier&&(o.removeEventListener("message",t),e())};o.addEventListener("message",t)}))}}}))},Lg=(e,t,r,n)=>async()=>{const s=Math.random().toString().substring(2);return globalThis.postMessage({type:t,identifier:s,name:e}),new Promise((t=>{const o=i=>{if(null==i||null==i.data)return;const a=i.data.type,c=i.data.identifier;a===r&&c===s&&(globalThis.removeEventListener("message",o),t((()=>{globalThis.postMessage({type:n,identifier:s,name:e})})))};globalThis.addEventListener("message",o)}))},Bg={singleProcess:!1},Ug={};let Mg;async function Fg(e,t){let r;const n=new Promise((e=>{r=e}));return e.add((async()=>Ps((async()=>{await new Promise((e=>{r((()=>{e()}))}))})(),{milliseconds:t.timeout}))),n}const $g={name:"lock",concurrency:1/0,timeout:846e5,singleProcess:!1};const Hg={ERR_INVALID_PARAMETERS:"ERR_INVALID_PARAMETERS"};var qg,Vg,jg;function Kg(e,t){const r=qg.decode(t);null!=r.publicKey&&null==e.publicKey&&(e=function(e){if("RSA"===e.type)return new Xu(e);if("Ed25519"===e.type)return new Qu(e);if("secp256k1"===e.type)return new Zu(e);throw new eo("Not a PeerId","ERR_INVALID_PARAMETERS")}({...e,publicKey:e.publicKey}));const n=new Map,s=BigInt(Date.now());for(const[e,t]of r.tags.entries())null!=t.expiry&&t.expiry({multiaddr:Mo(e),isCertified:t??!1}))),metadata:r.metadata,peerRecordEnvelope:r.peerRecordEnvelope??void 0,tags:n}}!function(e){let t,r,n;!function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.key&&""!==e.key&&(t.uint32(10),t.string(e.key)),null!=e.value&&e.value.byteLength>0&&(t.uint32(18),t.bytes(e.value)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t)=>{const r={key:"",value:new Uint8Array(0)},n=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:r.key=e.string();break;case 2:r.value=e.bytes();break;default:e.skipType(7&t)}}return r}))),t),e.encode=t=>jt(t,e.codec()),e.decode=t=>Y(t,e.codec())}(t=e.Peer$metadataEntry||(e.Peer$metadataEntry={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.key&&""!==e.key&&(t.uint32(10),t.string(e.key)),null!=e.value&&(t.uint32(18),jg.codec().encode(e.value,t)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t)=>{const r={key:""},n=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:r.key=e.string();break;case 2:r.value=jg.codec().decode(e,e.uint32());break;default:e.skipType(7&t)}}return r}))),t),e.encode=t=>jt(t,e.codec()),e.decode=t=>Y(t,e.codec())}(r=e.Peer$tagsEntry||(e.Peer$tagsEntry={})),e.codec=()=>(null==n&&(n=Ar(((t,r,n={})=>{if(!1!==n.lengthDelimited&&r.fork(),null!=t.addresses)for(const e of t.addresses)r.uint32(10),Vg.codec().encode(e,r);if(null!=t.protocols)for(const e of t.protocols)r.uint32(18),r.string(e);if(null!=t.publicKey&&(r.uint32(34),r.bytes(t.publicKey)),null!=t.peerRecordEnvelope&&(r.uint32(42),r.bytes(t.peerRecordEnvelope)),null!=t.metadata&&0!==t.metadata.size)for(const[n,s]of t.metadata.entries())r.uint32(50),e.Peer$metadataEntry.codec().encode({key:n,value:s},r);if(null!=t.tags&&0!==t.tags.size)for(const[n,s]of t.tags.entries())r.uint32(58),e.Peer$tagsEntry.codec().encode({key:n,value:s},r);!1!==n.lengthDelimited&&r.ldelim()}),((t,r)=>{const n={addresses:[],protocols:[],metadata:new Map,tags:new Map},s=null==r?t.len:t.pos+r;for(;t.pos>>3){case 1:n.addresses.push(Vg.codec().decode(t,t.uint32()));break;case 2:n.protocols.push(t.string());break;case 4:n.publicKey=t.bytes();break;case 5:n.peerRecordEnvelope=t.bytes();break;case 6:{const r=e.Peer$metadataEntry.codec().decode(t,t.uint32());n.metadata.set(r.key,r.value);break}case 7:{const r=e.Peer$tagsEntry.codec().decode(t,t.uint32());n.tags.set(r.key,r.value);break}default:t.skipType(7&r)}}return n}))),n),e.encode=t=>jt(t,e.codec()),e.decode=t=>Y(t,e.codec())}(qg||(qg={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.multiaddr&&e.multiaddr.byteLength>0&&(t.uint32(10),t.bytes(e.multiaddr)),null!=e.isCertified&&(t.uint32(16),t.bool(e.isCertified)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t)=>{const r={multiaddr:new Uint8Array(0)},n=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:r.multiaddr=e.bytes();break;case 2:r.isCertified=e.bool();break;default:e.skipType(7&t)}}return r}))),t),e.encode=t=>jt(t,e.codec()),e.decode=t=>Y(t,e.codec())}(Vg||(Vg={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.value&&0!==e.value&&(t.uint32(8),t.uint32(e.value)),null!=e.expiry&&(t.uint32(16),t.uint64(e.expiry)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t)=>{const r={value:0},n=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:r.value=e.uint32();break;case 2:r.expiry=e.uint64();break;default:e.skipType(7&t)}}return r}))),t),e.encode=t=>jt(t,e.codec()),e.decode=t=>Y(t,e.codec())}(jg||(jg={}));const zg="/",Gg=(new TextEncoder).encode(zg),Wg=Gg[0];class Yg{_buf;constructor(e,t){if("string"==typeof e)this._buf=Nt(e);else{if(!(e instanceof Uint8Array))throw new Error("Invalid key, should be String of Uint8Array");this._buf=e}if(null==t&&(t=!0),t&&this.clean(),0===this._buf.byteLength||this._buf[0]!==Wg)throw new Error("Invalid key")}toString(e="utf8"){return sn(this._buf,e)}uint8Array(){return this._buf}get[Symbol.toStringTag](){return`Key(${this.toString()})`}static withNamespaces(e){return new Yg(e.join(zg))}static random(){return new Yg(Math.random().toString().substring(2))}static asKey(e){return e instanceof Uint8Array||"string"==typeof e?new Yg(e):"function"==typeof e.uint8Array?new Yg(e.uint8Array()):null}clean(){if(null!=this._buf&&0!==this._buf.byteLength||(this._buf=Gg),this._buf[0]!==Wg){const e=new Uint8Array(this._buf.byteLength+1);e.fill(Wg,0,1),e.set(this._buf,1),this._buf=e}for(;this._buf.byteLength>1&&this._buf[this._buf.byteLength-1]===Wg;)this._buf=this._buf.subarray(0,-1)}less(e){const t=this.list(),r=e.list();for(let e=0;es)return!1}return t.lengthe.namespaces())),[].concat(...t))]);var t}}const Jg="/peers/";function Xg(e){if(!Qs(e)||null==e.type)throw new eo("Invalid PeerId",Hg.ERR_INVALID_PARAMETERS);const t=e.toCID().toString();return new Yg(`${Jg}${t}`)}async function Qg(e,t,r){const n=new Map;for(const s of r){if(null==s)continue;if(s.multiaddr instanceof Uint8Array&&(s.multiaddr=Mo(s.multiaddr)),!Uo(s.multiaddr))throw new eo("Multiaddr was invalid",Hg.ERR_INVALID_PARAMETERS);if(!await t(e,s.multiaddr))continue;const r=s.isCertified??!1,o=s.multiaddr.toString(),i=n.get(o);null!=i?s.isCertified=i.isCertified||r:n.set(o,{multiaddr:s.multiaddr,isCertified:r})}return[...n.values()].sort(((e,t)=>e.multiaddr.toString().localeCompare(t.multiaddr.toString()))).map((({isCertified:e,multiaddr:t})=>({isCertified:e,multiaddr:t.bytes})))}async function Zg(e,t,r,n){if(null==t)throw new eo("Invalid PeerData",Hg.ERR_INVALID_PARAMETERS);if(null!=t.publicKey&&null!=e.publicKey&&!Pn(t.publicKey,e.publicKey))throw new eo("publicKey bytes do not match peer id publicKey bytes",Hg.ERR_INVALID_PARAMETERS);const s=n.existingPeer;if(null!=s&&!e.equals(s.id))throw new eo("peer id did not match existing peer id",Hg.ERR_INVALID_PARAMETERS);let o=s?.addresses??[],i=new Set(s?.protocols??[]),a=s?.metadata??new Map,c=s?.tags??new Map,l=s?.peerRecordEnvelope;if("patch"===r&&(null==t.multiaddrs&&null==t.addresses||(o=[],null!=t.multiaddrs&&o.push(...t.multiaddrs.map((e=>({isCertified:!1,multiaddr:e})))),null!=t.addresses&&o.push(...t.addresses)),null!=t.protocols&&(i=new Set(t.protocols)),null!=t.metadata&&(a=ey(t.metadata instanceof Map?[...t.metadata.entries()]:Object.entries(t.metadata),{validate:ty})),null!=t.tags&&(c=ey(t.tags instanceof Map?[...t.tags.entries()]:Object.entries(t.tags),{validate:ry,map:ny})),null!=t.peerRecordEnvelope&&(l=t.peerRecordEnvelope)),"merge"===r){if(null!=t.multiaddrs&&o.push(...t.multiaddrs.map((e=>({isCertified:!1,multiaddr:e})))),null!=t.addresses&&o.push(...t.addresses),null!=t.protocols&&(i=new Set([...i,...t.protocols])),null!=t.metadata){const e=t.metadata instanceof Map?[...t.metadata.entries()]:Object.entries(t.metadata);for(const[t,r]of e)null==r?a.delete(t):a.set(t,r);a=ey([...a.entries()],{validate:ty})}if(null!=t.tags){const e=t.tags instanceof Map?[...t.tags.entries()]:Object.entries(t.tags),r=new Map(c);for(const[t,n]of e)null==n?r.delete(t):r.set(t,n);c=ey([...r.entries()],{validate:ry,map:ny})}null!=t.peerRecordEnvelope&&(l=t.peerRecordEnvelope)}const u={addresses:await Qg(e,n.addressFilter??(async()=>!0),o),protocols:[...i.values()].sort(((e,t)=>e.localeCompare(t))),metadata:a,tags:c,publicKey:s?.id.publicKey??t.publicKey??e.publicKey,peerRecordEnvelope:l};return"RSA"!==e.type&&delete u.publicKey,u}function ey(e,t){const r=new Map;for(const[r,n]of e)null!=n&&t.validate(r,n);for(const[n,s]of e.sort((([e],[t])=>e.localeCompare(t))))null!=s&&r.set(n,t.map?.(n,s)??s);return r}function ty(e,t){if("string"!=typeof e)throw new eo("Metadata key must be a string",Hg.ERR_INVALID_PARAMETERS);if(!(t instanceof Uint8Array))throw new eo("Metadata value must be a Uint8Array",Hg.ERR_INVALID_PARAMETERS)}function ry(e,t){if("string"!=typeof e)throw new eo("Tag name must be a string",Hg.ERR_INVALID_PARAMETERS);if(null!=t.value){if(parseInt(`${t.value}`,10)!==t.value)throw new eo("Tag value must be an integer",Hg.ERR_INVALID_PARAMETERS);if(t.value<0||t.value>100)throw new eo("Tag value must be between 0-100",Hg.ERR_INVALID_PARAMETERS)}if(null!=t.ttl){if(parseInt(`${t.ttl}`,10)!==t.ttl)throw new eo("Tag ttl must be an integer",Hg.ERR_INVALID_PARAMETERS);if(t.ttl<0)throw new eo("Tag ttl must be between greater than 0",Hg.ERR_INVALID_PARAMETERS)}}function ny(e,t){let r;return null!=t.expiry&&(r=t.expiry),null!=t.ttl&&(r=BigInt(Date.now()+Number(t.ttl))),{value:t.value??0,expiry:r}}function sy(e,t,r){const n=e.toString().split("/")[2],s=nh(fe.decode(n)),o=r.get(s);if(null!=o)return o;const i=Kg(s,t);return r.set(s,i),i}class oy{peerId;datastore;lock;addressFilter;constructor(e,t={}){this.peerId=e.peerId,this.datastore=e.datastore,this.addressFilter=t.addressFilter,this.lock=function(e){const t=Object.assign({},$g,e);return null==Mg&&(Mg=(e=>{if(e=Object.assign({},Bg,e),Boolean(globalThis.document)||e.singleProcess){const e=new EventTarget;return Rg.addEventListener("message",Dg(e,"requestReadLock",Tg,Cg,Ng)),Rg.addEventListener("message",Dg(e,"requestWriteLock",xg,Pg,Og)),e}return{isWorker:!0,readLock:e=>Lg(e,Tg,Ng,Cg),writeLock:e=>Lg(e,xg,Og,Pg)}})(t),!0!==Mg.isWorker&&(Mg.addEventListener("requestReadLock",(e=>{null!=Ug[e.data.name]&&Ug[e.data.name].readLock().then((async t=>e.data.handler().finally((()=>{t()}))))})),Mg.addEventListener("requestWriteLock",(async e=>{null!=Ug[e.data.name]&&Ug[e.data.name].writeLock().then((async t=>e.data.handler().finally((()=>{t()}))))})))),null==Ug[t.name]&&(Ug[t.name]=((e,t)=>{if(!0===Mg.isWorker)return{readLock:Mg.readLock(e,t),writeLock:Mg.writeLock(e,t)};const r=new _g({concurrency:1});let n;return{async readLock(){if(null!=n)return Fg(n,t);n=new _g({concurrency:t.concurrency,autoStart:!1});const e=n,s=Fg(n,t);return r.add((async()=>{e.start(),await e.onIdle().then((()=>{n===e&&(n=null)}))})),s},writeLock:async()=>(n=null,Fg(r,t))}})(t.name,t)),Ug[t.name]}({name:"peer-store",singleProcess:!0})}async has(e){return this.datastore.has(Xg(e))}async delete(e){if(this.peerId.equals(e))throw new eo("Cannot delete self peer",Hg.ERR_INVALID_PARAMETERS);await this.datastore.delete(Xg(e))}async load(e){return Kg(e,await this.datastore.get(Xg(e)))}async save(e,t){const{existingBuf:r,existingPeer:n}=await this.#N(e),s=await Zg(e,t,"patch",{addressFilter:this.addressFilter});return this.#x(e,s,r,n)}async patch(e,t){const{existingBuf:r,existingPeer:n}=await this.#N(e),s=await Zg(e,t,"patch",{addressFilter:this.addressFilter,existingPeer:n});return this.#x(e,s,r,n)}async merge(e,t){const{existingBuf:r,existingPeer:n}=await this.#N(e),s=await Zg(e,t,"merge",{addressFilter:this.addressFilter,existingPeer:n});return this.#x(e,s,r,n)}async*all(e){const t=new Eg;for await(const{key:r,value:n}of this.datastore.query(function(e,t){return null==e?{}:{prefix:Jg,filters:(e.filters??[]).map((e=>({key:r,value:n})=>e(sy(r,n,t)))),orders:(e.orders??[]).map((e=>(r,n)=>e(sy(r.key,r.value,t),sy(n.key,n.value,t))))}}(e??{},t))){const e=sy(r,n,t);e.id.equals(this.peerId)||(yield e)}}async#N(e){try{const t=await this.datastore.get(Xg(e));return{existingBuf:t,existingPeer:Kg(e,t)}}catch(e){if("ERR_NOT_FOUND"!==e.code)throw e}return{}}async#x(e,t,r,n){const s=qg.encode(t);return null!=r&&Pn(s,r)?{peer:Kg(e,s),previous:n,updated:!1}:(await this.datastore.put(Xg(e),s),{peer:Kg(e,s),previous:n,updated:!0})}}class iy{store;events;peerId;log;constructor(e,t={}){this.log=e.logger.forComponent("libp2p:peer-store"),this.events=e.events,this.peerId=e.peerId,this.store=new oy(e,t)}[Symbol.toStringTag]="@libp2p/peer-store";async forEach(e,t){this.log.trace("forEach await read lock");const r=await this.store.lock.readLock();this.log.trace("forEach got read lock");try{for await(const r of this.store.all(t))e(r)}finally{this.log.trace("forEach release read lock"),r()}}async all(e){this.log.trace("all await read lock");const t=await this.store.lock.readLock();this.log.trace("all got read lock");try{return await Nn(this.store.all(e))}finally{this.log.trace("all release read lock"),t()}}async delete(e){this.log.trace("delete await write lock");const t=await this.store.lock.writeLock();this.log.trace("delete got write lock");try{await this.store.delete(e)}finally{this.log.trace("delete release write lock"),t()}}async has(e){this.log.trace("has await read lock");const t=await this.store.lock.readLock();this.log.trace("has got read lock");try{return await this.store.has(e)}finally{this.log.trace("has release read lock"),t()}}async get(e){this.log.trace("get await read lock");const t=await this.store.lock.readLock();this.log.trace("get got read lock");try{return await this.store.load(e)}finally{this.log.trace("get release read lock"),t()}}async save(e,t){this.log.trace("save await write lock");const r=await this.store.lock.writeLock();this.log.trace("save got write lock");try{const r=await this.store.save(e,t);return this.#P(e,r),r.peer}finally{this.log.trace("save release write lock"),r()}}async patch(e,t){this.log.trace("patch await write lock");const r=await this.store.lock.writeLock();this.log.trace("patch got write lock");try{const r=await this.store.patch(e,t);return this.#P(e,r),r.peer}finally{this.log.trace("patch release write lock"),r()}}async merge(e,t){this.log.trace("merge await write lock");const r=await this.store.lock.writeLock();this.log.trace("merge got write lock");try{const r=await this.store.merge(e,t);return this.#P(e,r),r.peer}finally{this.log.trace("merge release write lock"),r()}}async consumePeerRecord(e,t){const r=await ip.openAndCertify(e,sp.DOMAIN);if(!1===t?.equals(r.peerId))return this.log("envelope peer id was not the expected peer id - expected: %p received: %p",t,r.peerId),!1;const n=sp.createFromProtobuf(r.payload);let s;try{s=await this.get(r.peerId)}catch(e){if("ERR_NOT_FOUND"!==e.code)throw e}if(null!=s?.peerRecordEnvelope){const e=await ip.createFromProtobuf(s.peerRecordEnvelope),t=sp.createFromProtobuf(e.payload);if(t.seqNumber>=n.seqNumber)return this.log("sequence number was lower or equal to existing sequence number - stored: %d received: %d",t.seqNumber,n.seqNumber),!1}return await this.patch(n.peerId,{peerRecordEnvelope:e,addresses:n.multiaddrs.map((e=>({isCertified:!0,multiaddr:e})))}),!0}#P(e,t){t.updated&&(this.peerId.equals(e)?this.events.safeDispatchEvent("self:peer:update",{detail:t}):this.events.safeDispatchEvent("peer:update",{detail:t}))}}const ay=function(e){if(null!=e[Symbol.asyncIterator])return(async()=>{for await(const t of e);})();for(const t of e);},cy=function(e,t){let r=0;if(null!=e[Symbol.asyncIterator])return async function*(){for await(const n of e)await t(n,r++)&&(yield n)}();const n=function(e){const[t,r]=null!=e[Symbol.asyncIterator]?[e[Symbol.asyncIterator](),Symbol.asyncIterator]:[e[Symbol.iterator](),Symbol.iterator],n=[];return{peek:()=>t.next(),push:e=>{n.push(e)},next:()=>n.length>0?{done:!1,value:n.shift()}:t.next(),[r](){return this}}}(e),{value:s,done:o}=n.next();if(!0===o)return function*(){}();const i=t(s,r++);if("function"==typeof i.then)return async function*(){await i&&(yield s);for await(const e of n)await t(e,r++)&&(yield e)}();const a=t;return function*(){!0===i&&(yield s);for(const e of n)a(e,r++)&&(yield e)}()},ly=function(e,t){return null!=e[Symbol.asyncIterator]?async function*(){const r=await Nn(e);yield*r.sort(t)}():function*(){const r=Nn(e);yield*r.sort(t)}()},uy=function(e,t){return null!=e[Symbol.asyncIterator]?async function*(){let r=0;if(!(t<1))for await(const n of e)if(yield n,r++,r===t)return}():function*(){let r=0;if(!(t<1))for(const n of e)if(yield n,r++,r===t)return}()};class hy{put(e,t,r){return Promise.reject(new Error(".put is not implemented"))}get(e,t){return Promise.reject(new Error(".get is not implemented"))}has(e,t){return Promise.reject(new Error(".has is not implemented"))}delete(e,t){return Promise.reject(new Error(".delete is not implemented"))}async*putMany(e,t={}){for await(const{key:r,value:n}of e)await this.put(r,n,t),yield r}async*getMany(e,t={}){for await(const r of e)yield{key:r,value:await this.get(r,t)}}async*deleteMany(e,t={}){for await(const r of e)await this.delete(r,t),yield r}batch(){let e=[],t=[];return{put(t,r){e.push({key:t,value:r})},delete(e){t.push(e)},commit:async r=>{await ay(this.putMany(e,r)),e=[],await ay(this.deleteMany(t,r)),t=[]}}}async*_all(e,t){throw new Error("._all is not implemented")}async*_allKeys(e,t){throw new Error("._allKeys is not implemented")}query(e,t){let r=this._all(e,t);if(null!=e.prefix){const t=e.prefix;r=cy(r,(e=>e.key.toString().startsWith(t)))}if(Array.isArray(e.filters)&&(r=e.filters.reduce(((e,t)=>cy(e,t)),r)),Array.isArray(e.orders)&&(r=e.orders.reduce(((e,t)=>ly(e,t)),r)),null!=e.offset){let t=0;const n=e.offset;r=cy(r,(()=>t++>=n))}return null!=e.limit&&(r=uy(r,e.limit)),r}queryKeys(e,t){let r=this._allKeys(e,t);if(null!=e.prefix){const t=e.prefix;r=cy(r,(e=>e.toString().startsWith(t)))}if(Array.isArray(e.filters)&&(r=e.filters.reduce(((e,t)=>cy(e,t)),r)),Array.isArray(e.orders)&&(r=e.orders.reduce(((e,t)=>ly(e,t)),r)),null!=e.offset){const t=e.offset;let n=0;r=cy(r,(()=>n++>=t))}return null!=e.limit&&(r=uy(r,e.limit)),r}}var dy=__webpack_require__(6310);class py extends hy{data;constructor(){super(),this.data=new Map}put(e,t){return this.data.set(e.toString(),t),e}get(e){const t=this.data.get(e.toString());if(null==t)throw r=r??new Error("Not Found"),dy(r,"ERR_NOT_FOUND");var r;return t}has(e){return this.data.has(e.toString())}delete(e){this.data.delete(e.toString())}*_all(){for(const[e,t]of this.data.entries())yield{key:new Yg(e),value:t}}*_allKeys(){for(const e of this.data.keys())yield new Yg(e)}}const fy=e=>e;function gy(e,t){const r=e.getPeerId();return null!=r&&rh(r).equals(t)&&(e=e.decapsulate(Mo(`/p2p/${t.toString()}`))),e}class yy{log;components;listen;announce;observed;announceFilter;constructor(e,t={}){const{listen:r=[],announce:n=[]}=t;this.components=e,this.log=e.logger.forComponent("libp2p:address-manager"),this.listen=r.map((e=>e.toString())),this.announce=new Set(n.map((e=>e.toString()))),this.observed=new Map,this.announceFilter=t.announceFilter??fy,this._updatePeerStoreAddresses=function(e,t){let r;return function(){clearTimeout(r),r=setTimeout((function(){r=void 0,e()}),1e3)}}(this._updatePeerStoreAddresses.bind(this)),e.events.addEventListener("transport:listening",(()=>{this._updatePeerStoreAddresses()})),e.events.addEventListener("transport:close",(()=>{this._updatePeerStoreAddresses()}))}[Symbol.toStringTag]="@libp2p/address-manager";_updatePeerStoreAddresses(){const e=this.getAnnounceAddrs().concat(this.components.transportManager.getAddrs()).concat([...this.observed.entries()].filter((([e,t])=>t.confident)).map((([e])=>Mo(e)))).map((e=>e.getPeerId()===this.components.peerId.toString()?e.decapsulate(`/p2p/${this.components.peerId.toString()}`):e));this.components.peerStore.patch(this.components.peerId,{multiaddrs:e}).catch((e=>{this.log.error("error updating addresses",e)}))}getListenAddrs(){return Array.from(this.listen).map((e=>Mo(e)))}getAnnounceAddrs(){return Array.from(this.announce).map((e=>Mo(e)))}getObservedAddrs(){return Array.from(this.observed).map((([e])=>Mo(e)))}addObservedAddr(e){const t=(e=gy(e,this.components.peerId)).toString();this.observed.has(t)||this.observed.set(t,{confident:!1})}confirmObservedAddr(e){const t=(e=gy(e,this.components.peerId)).toString(),r=(this.observed.get(t)??{confident:!1}).confident;this.observed.set(t,{confident:!0}),r||this._updatePeerStoreAddresses()}removeObservedAddr(e){const t=(e=gy(e,this.components.peerId)).toString();this.observed.delete(t)}getAddresses(){let e=this.getAnnounceAddrs().map((e=>e.toString()));0===e.length&&(e=this.components.transportManager.getAddrs().map((e=>e.toString()))),e=e.concat(Array.from(this.observed).filter((([e,t])=>t.confident)).map((([e])=>e)));const t=new Set(e);return this.announceFilter(Array.from(t).map((e=>Mo(e)))).map((e=>!0===e.protos().pop()?.path||e.getPeerId()===this.components.peerId.toString()?e:e.encapsulate(`/p2p/${this.components.peerId.toString()}`)))}}class my{components={};_started=!1;constructor(e={}){this.components={};for(const[t,r]of Object.entries(e))this.components[t]=r;null==this.components.logger&&(this.components.logger=gg())}isStarted(){return this._started}async _invokeStartableMethod(e){await Promise.all(Object.values(this.components).filter((e=>function(e){return null!=e&&"function"==typeof e.start&&"function"==typeof e.stop}(e))).map((async t=>{await(t[e]?.())})))}async beforeStart(){await this._invokeStartableMethod("beforeStart")}async start(){await this._invokeStartableMethod("start"),this._started=!0}async afterStart(){await this._invokeStartableMethod("afterStart")}async beforeStop(){await this._invokeStartableMethod("beforeStop")}async stop(){await this._invokeStartableMethod("stop"),this._started=!1}async afterStop(){await this._invokeStartableMethod("afterStop")}}const by=["metrics","connectionProtector","dns"],wy=["components","isStarted","beforeStart","start","afterStart","beforeStop","stop","afterStop","then","_invokeStartableMethod"];function vy(e){return Array.isArray(e?.[Vu])?e[Vu]:[]}function Ey(e){return Array.isArray(e?.[ju])?e[ju]:[]}function Sy(e){return e?.[Symbol.toStringTag]??e?.toString()??"unknown"}var Ay=__webpack_require__(5507);const _y=["0.0.0.0/8","10.0.0.0/8","100.64.0.0/10","127.0.0.0/8","169.254.0.0/16","172.16.0.0/12","192.0.0.0/24","192.0.0.0/29","192.0.0.8/32","192.0.0.9/32","192.0.0.10/32","192.0.0.170/32","192.0.0.171/32","192.0.2.0/24","192.31.196.0/24","192.52.193.0/24","192.88.99.0/24","192.168.0.0/16","192.175.48.0/24","198.18.0.0/15","198.51.100.0/24","203.0.113.0/24","240.0.0.0/4","255.255.255.255/32"].map((e=>new Ay.Netmask(e)));function ky(e){for(const t of _y)if(t.contains(e))return!0;return!1}function Iy(e){return io(e)?ky(e):/^::ffff:([0-9a-fA-F]{1,4}):([0-9a-fA-F]{1,4})$/.test(e)?function(e){const t=e.split(":");if(t.length<2)return!1;const r=t[t.length-1].padStart(4,"0"),n=t[t.length-2].padStart(4,"0");return ky(`${parseInt(n.substring(0,2),16)}.${parseInt(n.substring(2),16)}.${parseInt(r.substring(0,2),16)}.${parseInt(r.substring(2),16)}`)}(e):/^::ffff:([0-9]{1,3})\.([0-9]{1,3})\.([0-9]{1,3})\.([0-9]{1,3})$/.test(e)?function(e){const t=e.split(":");return ky(t[t.length-1])}(e):ao(e)?function(e){return/^::$/.test(e)||/^::1$/.test(e)||/^64:ff9b::([0-9]{1,3})\.([0-9]{1,3})\.([0-9]{1,3})\.([0-9]{1,3})$/.test(e)||/^100::([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4})$/.test(e)||/^2001::([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4})$/.test(e)||/^2001:2[0-9a-fA-F]:([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4})$/.test(e)||/^2001:db8:([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4})$/.test(e)||/^2002:([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4})$/.test(e)||/^f[c-d]([0-9a-fA-F]{2,2}):/i.test(e)||/^fe[8-9a-bA-B][0-9a-fA-F]:/i.test(e)||/^ff([0-9a-fA-F]{2,2}):/i.test(e)}(e):void 0}function Ry(e={}){return{denyDialPeer:async()=>!1,denyDialMultiaddr:async e=>{const t=e.stringTuples();return(4===t[0][0]||41===t[0][0])&&Boolean(Iy(`${t[0][1]}`))},denyInboundConnection:async()=>!1,denyOutboundConnection:async()=>!1,denyInboundEncryptedConnection:async()=>!1,denyOutboundEncryptedConnection:async()=>!1,denyInboundUpgradedConnection:async()=>!1,denyOutboundUpgradedConnection:async()=>!1,filterMultiaddrForPeer:async()=>!0,...e}}function Ty(e){try{const{address:t}=e.nodeAddress();return Boolean(Iy(t))}catch{return!0}}function Cy(e,t){const r=function(e,t){const r=Ty(e.multiaddr),n=Ty(t.multiaddr);return r&&!n?1:!r&&n?-1:0}(e,t);if(0!==r)return r;const n=function(e,t){const r=Mp.exactMatch(e.multiaddr),n=Mp.exactMatch(t.multiaddr);return r&&!n?1:!r&&n?-1:0}(e,t);if(0!==n)return n;const s=function(e,t){return e.isCertified&&!t.isCertified?-1:!e.isCertified&&t.isCertified?1:0}(e,t);return s}function Ny(e){const t=[Dy.A];return null==e?t:Array.isArray(e)?0===e.length?t:e:[e]}const xy=60;function Py(e){return{Status:e.Status??0,TC:e.TC??e.flag_tc??!1,RD:e.RD??e.flag_rd??!1,RA:e.RA??e.flag_ra??!1,AD:e.AD??e.flag_ad??!1,CD:e.CD??e.flag_cd??!1,Question:(e.Question??e.questions??[]).map((e=>({name:e.name,type:Dy[e.type]}))),Answer:(e.Answer??e.answers??[]).map((e=>({name:e.name,type:Dy[e.type],TTL:e.TTL??e.ttl??xy,data:e.data instanceof Uint8Array?sn(e.data):e.data})))}}function Oy(e,t={}){const r=new _g({concurrency:t.queryConcurrency??4});return async(t,n={})=>{const s=new URLSearchParams;s.set("name",t),Ny(n.types).forEach((e=>{s.append("type",Dy[e])})),n.onProgress?.(new Yf("dns:query",{detail:t}));const o=await r.add((async()=>{const t=await fetch(`${e}?${s}`,{headers:{accept:"application/dns-json"},signal:n?.signal});if(200!==t.status)throw new Error(`Unexpected HTTP status: ${t.status} - ${t.statusText}`);const r=Py(await t.json());return n.onProgress?.(new Yf("dns:response",{detail:r})),r}),{signal:n.signal});if(null==o)throw new Error("No DNS response received");return o}}var Dy,Ly=__webpack_require__(194);class By{lru;constructor(e){this.lru=Ly(e)}get(e,t){let r=!0;const n=[];for(const s of t){const t=this.getAnswers(e,s);if(0===t.length){r=!1;break}n.push(...t)}if(r)return Py({answers:n})}getAnswers(e,t){const r=`${e.toLowerCase()}-${t}`,n=this.lru.get(r);if(null!=n){const e=n.filter((e=>e.expires>Date.now())).map((({expires:e,value:t})=>({...t,TTL:Math.round((e-Date.now())/1e3),type:Dy[t.type]})));return 0===e.length&&this.lru.remove(r),e}return[]}add(e,t){const r=`${e.toLowerCase()}-${t.type}`,n=this.lru.get(r)??[];n.push({expires:Date.now()+1e3*(t.TTL??xy),value:t}),this.lru.set(r,n)}remove(e,t){const r=`${e.toLowerCase()}-${t}`;this.lru.remove(r)}clear(){this.lru.clear()}}class Uy{resolvers;cache;constructor(e){var t;this.resolvers={},this.cache=(t=e.cacheSize??1e3,new By(t)),Object.entries(e.resolvers??{}).forEach((([e,t])=>{Array.isArray(t)||(t=[t]),e.endsWith(".")||(e=`${e}.`),this.resolvers[e]=t})),null==this.resolvers["."]&&(this.resolvers["."]=[Oy("https://cloudflare-dns.com/dns-query"),Oy("https://dns.google/resolve")])}async query(e,t={}){const r=Ny(t.types),n=!1!==t.cached?this.cache.get(e,r):void 0;if(null!=n)return t.onProgress?.(new Yf("dns:cache",{detail:n})),n;const s=`${e.split(".").pop()}.`,o=(this.resolvers[s]??this.resolvers["."]).sort((()=>Math.random()>.5?-1:1)),i=[];for(const n of o){if(!0===t.signal?.aborted)break;try{const s=await n(e,{...t,types:r});for(const t of s.Answer)this.cache.add(e,t);return s}catch(e){i.push(e),t.onProgress?.(new Yf("dns:error",{detail:e}))}}if(1===i.length)throw i[0];throw new AggregateError(i,`DNS lookup of ${e} ${r} failed`)}}!function(e){e[e.A=1]="A",e[e.CNAME=5]="CNAME",e[e.TXT=16]="TXT",e[e.AAAA=28]="AAAA"}(Dy||(Dy={}));const{code:My}=mo("dnsaddr"),Fy=async function(e,t={}){const r=t.maxRecursiveDepth??32;if(0===r)throw new eo("Max recursive depth reached","ERR_MAX_RECURSIVE_DEPTH_REACHED");const[,n]=e.stringTuples().find((([e])=>e===My))??[],s=t?.dns??function(e={}){return new Uy(e)}(),o=await s.query(`_dnsaddr.${n}`,{signal:t?.signal,types:[Dy.TXT]}),i=e.getPeerId(),a=[];for(const e of o.Answer){const n=e.data.replace(/["']/g,"").trim().split("=")[1];if(null==n)continue;if(null!=i&&!n.includes(i))continue;const s=Mo(n);if(n.startsWith("/dnsaddr")){const e=await s.resolve({...t,maxRecursiveDepth:r-1});a.push(...e.map((e=>e.toString())))}else a.push(s.toString())}return a},$y=__webpack_require__(6864);var Hy,qy;!function(e){e.NOT_STARTED_YET="The libp2p node is not started yet",e.ERR_PROTECTOR_REQUIRED="Private network is enforced, but no protector was provided",e.NOT_FOUND="Not found"}(Hy||(Hy={})),function(e){e.ERR_PROTECTOR_REQUIRED="ERR_PROTECTOR_REQUIRED",e.ERR_PEER_DIAL_INTERCEPTED="ERR_PEER_DIAL_INTERCEPTED",e.ERR_CONNECTION_INTERCEPTED="ERR_CONNECTION_INTERCEPTED",e.ERR_INVALID_PROTOCOLS_FOR_STREAM="ERR_INVALID_PROTOCOLS_FOR_STREAM",e.ERR_CONNECTION_ENDED="ERR_CONNECTION_ENDED",e.ERR_CONNECTION_FAILED="ERR_CONNECTION_FAILED",e.ERR_NODE_NOT_STARTED="ERR_NODE_NOT_STARTED",e.ERR_ALREADY_ABORTED="ERR_ALREADY_ABORTED",e.ERR_TOO_MANY_ADDRESSES="ERR_TOO_MANY_ADDRESSES",e.ERR_NO_VALID_ADDRESSES="ERR_NO_VALID_ADDRESSES",e.ERR_RELAYED_DIAL="ERR_RELAYED_DIAL",e.ERR_DIALED_SELF="ERR_DIALED_SELF",e.ERR_DISCOVERED_SELF="ERR_DISCOVERED_SELF",e.ERR_DUPLICATE_TRANSPORT="ERR_DUPLICATE_TRANSPORT",e.ERR_ENCRYPTION_FAILED="ERR_ENCRYPTION_FAILED",e.ERR_HOP_REQUEST_FAILED="ERR_HOP_REQUEST_FAILED",e.ERR_INVALID_KEY="ERR_INVALID_KEY",e.ERR_INVALID_MESSAGE="ERR_INVALID_MESSAGE",e.ERR_INVALID_PARAMETERS="ERR_INVALID_PARAMETERS",e.ERR_INVALID_PEER="ERR_INVALID_PEER",e.ERR_MUXER_UNAVAILABLE="ERR_MUXER_UNAVAILABLE",e.ERR_NOT_FOUND="ERR_NOT_FOUND",e.ERR_TRANSPORT_UNAVAILABLE="ERR_TRANSPORT_UNAVAILABLE",e.ERR_TRANSPORT_DIAL_FAILED="ERR_TRANSPORT_DIAL_FAILED",e.ERR_UNSUPPORTED_PROTOCOL="ERR_UNSUPPORTED_PROTOCOL",e.ERR_PROTOCOL_HANDLER_ALREADY_REGISTERED="ERR_PROTOCOL_HANDLER_ALREADY_REGISTERED",e.ERR_INVALID_MULTIADDR="ERR_INVALID_MULTIADDR",e.ERR_SIGNATURE_NOT_VALID="ERR_SIGNATURE_NOT_VALID",e.ERR_FIND_SELF="ERR_FIND_SELF",e.ERR_NO_ROUTERS_AVAILABLE="ERR_NO_ROUTERS_AVAILABLE",e.ERR_CONNECTION_NOT_MULTIPLEXED="ERR_CONNECTION_NOT_MULTIPLEXED",e.ERR_NO_DIAL_TOKENS="ERR_NO_DIAL_TOKENS",e.ERR_INVALID_CMS="ERR_INVALID_CMS",e.ERR_MISSING_KEYS="ERR_MISSING_KEYS",e.ERR_NO_KEY="ERR_NO_KEY",e.ERR_INVALID_KEY_NAME="ERR_INVALID_KEY_NAME",e.ERR_INVALID_KEY_TYPE="ERR_INVALID_KEY_TYPE",e.ERR_KEY_ALREADY_EXISTS="ERR_KEY_ALREADY_EXISTS",e.ERR_INVALID_KEY_SIZE="ERR_INVALID_KEY_SIZE",e.ERR_KEY_NOT_FOUND="ERR_KEY_NOT_FOUND",e.ERR_OLD_KEY_NAME_INVALID="ERR_OLD_KEY_NAME_INVALID",e.ERR_NEW_KEY_NAME_INVALID="ERR_NEW_KEY_NAME_INVALID",e.ERR_PASSWORD_REQUIRED="ERR_PASSWORD_REQUIRED",e.ERR_PEM_REQUIRED="ERR_PEM_REQUIRED",e.ERR_CANNOT_READ_KEY="ERR_CANNOT_READ_KEY",e.ERR_MISSING_PRIVATE_KEY="ERR_MISSING_PRIVATE_KEY",e.ERR_MISSING_PUBLIC_KEY="ERR_MISSING_PUBLIC_KEY",e.ERR_INVALID_OLD_PASS_TYPE="ERR_INVALID_OLD_PASS_TYPE",e.ERR_INVALID_NEW_PASS_TYPE="ERR_INVALID_NEW_PASS_TYPE",e.ERR_INVALID_PASS_LENGTH="ERR_INVALID_PASS_LENGTH",e.ERR_NOT_IMPLEMENTED="ERR_NOT_IMPLEMENTED",e.ERR_WRONG_PING_ACK="ERR_WRONG_PING_ACK",e.ERR_INVALID_RECORD="ERR_INVALID_RECORD",e.ERR_ALREADY_SUCCEEDED="ERR_ALREADY_SUCCEEDED",e.ERR_NO_HANDLER_FOR_PROTOCOL="ERR_NO_HANDLER_FOR_PROTOCOL",e.ERR_TOO_MANY_OUTBOUND_PROTOCOL_STREAMS="ERR_TOO_MANY_OUTBOUND_PROTOCOL_STREAMS",e.ERR_TOO_MANY_INBOUND_PROTOCOL_STREAMS="ERR_TOO_MANY_INBOUND_PROTOCOL_STREAMS",e.ERR_CONNECTION_DENIED="ERR_CONNECTION_DENIED",e.ERR_TRANSFER_LIMIT_EXCEEDED="ERR_TRANSFER_LIMIT_EXCEEDED"}(qy||(qy={}));const Vy={addresses:{listen:[],announce:[],noAnnounce:[],announceFilter:e=>e},connectionManager:{resolvers:{dnsaddr:Fy},addressSorter:Cy},transportManager:{faultTolerance:Bf.FATAL_ALL}};function jy(e){if(Qs(e))return{peerId:e,multiaddrs:[]};let t;if(Array.isArray(e)||(e=[e]),e.length>0){const r=e[0].getPeerId();t=null==r?void 0:rh(r),e.forEach((e=>{if(!Uo(e))throw new eo("Invalid Multiaddr",qy.ERR_INVALID_MULTIADDR);const r=e.getPeerId();if(null==r){if(null!=t)throw new eo("Multiaddrs must all have the same peer id or have no peer id",qy.ERR_INVALID_PARAMETERS)}else{const e=rh(r);if(!0!==t?.equals(e))throw new eo("Multiaddrs must all have the same peer id or have no peer id",qy.ERR_INVALID_PARAMETERS)}}))}return{peerId:t,multiaddrs:e}}class Ky extends Error{type;code;constructor(e,t){super(e??"The operation was aborted"),this.type="aborted",this.name="AbortError",this.code=t??"ABORT_ERR"}}async function zy(e,t,r,n){const s=new Ky(n?.errorMessage,n?.errorCode);return!0===r?.aborted?Promise.reject(s):new Promise(((o,i)=>{function a(){r?.removeEventListener("abort",u),e.removeEventListener(t,c),null!=n?.errorEvent&&e.removeEventListener(n.errorEvent,l)}const c=e=>{try{if(!1===n?.filter?.(e))return}catch(e){return a(),void i(e)}a(),o(e)},l=e=>{a(),i(e.detail)},u=()=>{a(),i(s)};r?.addEventListener("abort",u),e.addEventListener(t,c),null!=n?.errorEvent&&e.addEventListener(n.errorEvent,l)}))}class Gy{deferred;signal;constructor(e){this.signal=e,this.deferred=Gn(),this.onAbort=this.onAbort.bind(this),this.signal?.addEventListener("abort",this.onAbort)}onAbort(){this.deferred.reject(this.signal?.reason??new Zs)}cleanup(){this.signal?.removeEventListener("abort",this.onAbort)}}class Wy{id;fn;options;recipients;status;timeline;controller;constructor(e,t){this.id=`${parseInt(String(1e9*Math.random()),10).toString()}${Date.now()}`,this.status="queued",this.fn=e,this.options=t,this.recipients=[],this.timeline={created:Date.now()},this.controller=new AbortController,this.controller.signal,this.onAbort=this.onAbort.bind(this)}abort(e){this.controller.abort(e)}onAbort(){this.recipients.reduce(((e,t)=>e&&!0===t.signal?.aborted),!0)&&(this.controller.abort(new Zs),this.cleanup())}async join(e={}){const t=new Gy(e.signal);return this.recipients.push(t),e.signal?.addEventListener("abort",this.onAbort),t.deferred.promise}async run(){this.status="running",this.timeline.started=Date.now();try{this.controller.signal.throwIfAborted();const e=await ih(this.fn({...this.options??{},signal:this.controller.signal}),this.controller.signal);this.recipients.forEach((t=>{t.deferred.resolve(e)})),this.status="complete"}catch(e){this.recipients.forEach((t=>{t.deferred.reject(e)})),this.status="errored"}finally{this.timeline.finished=Date.now(),this.cleanup()}}cleanup(){this.recipients.forEach((e=>{e.cleanup(),e.signal?.removeEventListener("abort",this.onAbort)}))}}class Yy extends Fs{concurrency;queue;pending;sort;constructor(e={}){super(),this.concurrency=e.concurrency??Number.POSITIVE_INFINITY,this.pending=0,null!=e.metricName&&e.metrics?.registerMetricGroup(e.metricName,{calculate:()=>({size:this.queue.length,running:this.pending,queued:this.queue.length-this.pending})}),this.sort=e.sort,this.queue=[]}tryToStartAnother(){if(0===this.size)return queueMicrotask((()=>{this.safeDispatchEvent("empty")})),0===this.running&&queueMicrotask((()=>{this.safeDispatchEvent("idle")})),!1;if(this.pending{for(let t=0;t(this.safeDispatchEvent("completed",{detail:e}),this.safeDispatchEvent("success",{detail:{job:r,result:e}}),e))).catch((e=>{if("queued"===r.status)for(let e=0;e{e.abort(new Zs)})),this.clear()}async onEmpty(e){0!==this.size&&await zy(this,"empty",e?.signal)}async onSizeLessThan(e,t){this.sizethis.size{null!=e?this.abort():this.clear(),t.end(e)},n=e=>{null!=e.detail&&t.push(e.detail)},s=e=>{r(e.detail)},o=()=>{r()},i=()=>{r(new eo("Queue aborted","ERR_QUEUE_ABORTED"))};this.addEventListener("completed",n),this.addEventListener("error",s),this.addEventListener("idle",o),e?.signal?.addEventListener("abort",i);try{yield*t}finally{this.removeEventListener("completed",n),this.removeEventListener("error",s),this.removeEventListener("idle",o),e?.signal?.removeEventListener("abort",i),r()}}}class Jy extends Yy{has(e){return null!=this.find(e)}find(e){return this.queue.find((t=>e.equals(t.options.peerId)))}}const Xy=42e4,Qy="last-dial-failure",Zy=5,em=100,tm=25,rm=0,nm=5e3,sm=Xy,om=10;class im{connectionManager;peerStore;queue;minConnections;autoDialPriority;autoDialIntervalMs;autoDialMaxQueueLength;autoDialPeerRetryThresholdMs;autoDialDiscoveredPeersDebounce;autoDialInterval;started;running;log;constructor(e,t){let r;this.connectionManager=e.connectionManager,this.peerStore=e.peerStore,this.minConnections=t.minConnections??Zy,this.autoDialPriority=t.autoDialPriority??rm,this.autoDialIntervalMs=t.autoDialInterval??nm,this.autoDialMaxQueueLength=t.maxQueueLength??em,this.autoDialPeerRetryThresholdMs=t.autoDialPeerRetryThreshold??sm,this.autoDialDiscoveredPeersDebounce=t.autoDialDiscoveredPeersDebounce??om,this.log=e.logger.forComponent("libp2p:connection-manager:auto-dial"),this.started=!1,this.running=!1,this.queue=new Jy({concurrency:t.autoDialConcurrency??tm,metricName:"libp2p_autodial_queue",metrics:e.metrics}),this.queue.addEventListener("error",(e=>{this.log.error("error during auto-dial",e.detail)})),e.events.addEventListener("connection:close",(()=>{this.autoDial().catch((e=>{this.log.error(e)}))})),e.events.addEventListener("peer:discovery",(()=>{clearTimeout(r),r=setTimeout((()=>{this.autoDial().catch((e=>{this.log.error(e)}))}),this.autoDialDiscoveredPeersDebounce)}))}isStarted(){return this.started}start(){this.started=!0}afterStart(){this.autoDial().catch((e=>{this.log.error("error while autodialing",e)}))}stop(){this.queue.clear(),clearTimeout(this.autoDialInterval),this.started=!1,this.running=!1}async autoDial(){if(!this.started||this.running)return;const e=this.connectionManager.getConnectionsMap(),t=e.size;if(t>=this.minConnections)return void(this.minConnections>0&&this.log.trace("have enough connections %d/%d",t,this.minConnections));if(this.queue.size>this.autoDialMaxQueueLength)return this.log("not enough connections %d/%d but auto dial queue is full",t,this.minConnections),void this.sheduleNextAutodial();this.running=!0,this.log("not enough connections %d/%d - will dial peers to increase the number of connections",t,this.minConnections);const r=new mg(this.connectionManager.getDialQueue().map((e=>e.peerId)).filter(Boolean)),n=await this.peerStore.all({filters:[t=>0===t.addresses.length?(this.log.trace("not autodialing %p because they have no addresses",t.id),!1):e.has(t.id)?(this.log.trace("not autodialing %p because they are already connected",t.id),!1):r.has(t.id)?(this.log.trace("not autodialing %p because they are already being dialed",t.id),!1):!this.queue.has(t.id)||(this.log.trace("not autodialing %p because they are already being autodialed",t.id),!1)]}),s=n.sort((()=>Math.random()>.5?1:-1)),o=new Eg;for(const e of s)o.has(e.id)||o.set(e.id,[...e.tags.values()].reduce(((e,t)=>e+t.value),0));const i=s.sort(((e,t)=>{const r=o.get(e.id)??0,n=o.get(t.id)??0;return r>n?-1:r{const t=e.metadata.get(Qy);if(null==t)return!0;const r=parseInt(sn(t));return!!isNaN(r)||Date.now()-r>this.autoDialPeerRetryThresholdMs}));this.log("selected %d/%d peers to dial",i.length,n.length);for(const e of i)this.queue.add((async()=>{const t=this.connectionManager.getConnectionsMap().size;if(t>=this.minConnections)return this.log("got enough connections now %d/%d",t,this.minConnections),void this.queue.clear();this.log("connecting to a peerStore stored peer %p",e.id),await this.connectionManager.openConnection(e.id,{priority:this.autoDialPriority})}),{peerId:e.id}).catch((e=>{this.log.error("could not connect to peerStore stored peer",e)}));this.running=!1,this.sheduleNextAutodial()}sheduleNextAutodial(){this.started&&(this.autoDialInterval=setTimeout((()=>{this.autoDial().catch((e=>{this.log.error("error while autodialing",e)}))}),this.autoDialIntervalMs))}}const am=["/ipfs/id/1.0.0","/ipfs/id/push/1.0.0","/libp2p/autonat/1.0.0","/libp2p/dcutr"],cm={maxConnections:100,allow:[]};class lm{maxConnections;connectionManager;peerStore;allow;events;log;constructor(e,t={}){this.maxConnections=t.maxConnections??cm.maxConnections,this.allow=t.allow??cm.allow,this.connectionManager=e.connectionManager,this.peerStore=e.peerStore,this.events=e.events,this.log=e.logger.forComponent("libp2p:connection-manager:connection-pruner"),e.events.addEventListener("connection:open",(()=>{this.maybePruneConnections().catch((e=>{this.log.error(e)}))}))}async maybePruneConnections(){const e=this.connectionManager.getConnections(),t=e.length;if(this.log("checking max connections limit %d/%d",t,this.maxConnections),t<=this.maxConnections)return;const r=new Eg;for(const t of e){const e=t.remotePeer;if(!r.has(e)){r.set(e,0);try{const t=await this.peerStore.get(e);r.set(e,[...t.tags.values()].reduce(((e,t)=>e+t.value),0))}catch(e){"ERR_NOT_FOUND"!==e.code&&this.log.error("error loading peer tags",e)}}}const n=this.sortConnections(e,r),s=Math.max(t-this.maxConnections,0),o=[];for(const e of n)if(this.log("too many connections open - closing a connection to %p",e.remotePeer),this.allow.some((t=>e.remoteAddr.toString().startsWith(t.toString())))||o.push(e),o.length===s)break;await Promise.all(o.map((async e=>{await async function(e,t){const r=e?.streams?.map((e=>e.protocol))??[],n=t?.closableProtocols??am;if(!(r.filter((e=>null!=e&&!n.includes(e))).length>0))try{await(e?.close(t))}catch(t){e?.abort(t)}}(e,{signal:AbortSignal.timeout(1e3)})}))),this.events.safeDispatchEvent("connection:prune",{detail:o})}sortConnections(e,t){return e.sort(((e,t)=>{const r=e.timeline.open,n=t.timeline.open;return rn?-1:0})).sort(((e,t)=>"outbound"===e.direction&&"inbound"===t.direction?1:"inbound"===e.direction&&"outbound"===t.direction?-1:0)).sort(((e,t)=>e.streams.length>t.streams.length?1:e.streams.length{const n=t.get(e.remotePeer)??0,s=t.get(r.remotePeer)??0;return n>s?1:ne.options.priority>t.options.priority?-1:e.options.priority{this.log.error("error in dial queue",e.detail)}))}start(){this.shutDownController=new AbortController,this.shutDownController.signal}stop(){this.shutDownController.abort(),this.queue.abort()}async dial(e,t={}){const{peerId:r,multiaddrs:n}=jy(e),s=Array.from(this.connections.values()).flat().find((e=>!0!==t.force&&(!!e.remotePeer.equals(r)||n.find((t=>t.equals(e.remoteAddr))))));if(null!=s)return this.log("already connected to %a",s.remoteAddr),t.onProgress?.(new Yf("dial-queue:already-connected")),s;const o=this.queue.queue.find((e=>{if(!0===r?.equals(e.options.peerId))return!0;const t=e.options.multiaddrs;if(null==t)return!1;for(const e of n)if(t.has(e.toString()))return!0;return!1}));if(null!=o){this.log("joining existing dial target for %p",r);for(const e of n)o.options.multiaddrs.add(e.toString());return t.onProgress?.(new Yf("dial-queue:already-in-dial-queue")),o.join(t)}if(this.queue.size>=this.maxDialQueueLength)throw new eo("Dial queue is full","ERR_DIAL_QUEUE_FULL");return this.log("creating dial target for %p",r,n.map((e=>e.toString()))),t.onProgress?.(new Yf("dial-queue:add-to-dial-queue")),this.queue.add((async e=>{e?.onProgress?.(new Yf("dial-queue:start-dial"));const t=this.createDialAbortController(e?.signal);let n;try{n=await this.calculateMultiaddrs(r,e?.multiaddrs,{...e,signal:t}),e?.onProgress?.(new Yf("dial-queue:calculated-addresses",n)),n.map((({multiaddr:e})=>e.toString())).forEach((t=>{e?.multiaddrs.add(t)}))}catch(e){throw t.clear(),e}try{let s=0;const o=[];for(const i of n){if(s===this.maxPeerAddrsToDial)throw this.log("dialed maxPeerAddrsToDial (%d) addresses for %p, not trying any others",s,r),new eo("Peer had more than maxPeerAddrsToDial",qy.ERR_TOO_MANY_ADDRESSES);s++;try{const r=await this.components.transportManager.dial(i.multiaddr,{...e,signal:t});return this.log("dial to %a succeeded",i.multiaddr),r}catch(e){if(this.log.error("dial failed to %a",i.multiaddr,e),null!=r)try{await this.components.peerStore.patch(r,{metadata:{[Qy]:Nt(Date.now().toString())}})}catch(e){this.log.error("could not update last dial failure key for %p",r,e)}if(t.aborted)throw new eo(e.message,ro);o.push(e)}}if(1===o.length)throw o[0];throw new to(o,"All multiaddr dials failed",qy.ERR_TRANSPORT_DIAL_FAILED)}finally{t.clear()}}),{peerId:r,priority:t.priority??fm,multiaddrs:new Set(n.map((e=>e.toString()))),signal:t.signal,onProgress:t.onProgress})}createDialAbortController(e){return hm([AbortSignal.timeout(this.dialTimeout),this.shutDownController.signal,e])}async calculateMultiaddrs(e,t=new Set,r={}){const n=[...t].map((e=>({multiaddr:Mo(e),isCertified:!1})));if(null!=e){if(this.components.peerId.equals(e))throw new eo("Tried to dial self",qy.ERR_DIALED_SELF);if(!0===await(this.components.connectionGater.denyDialPeer?.(e)))throw new eo("The dial request is blocked by gater.allowDialPeer",qy.ERR_PEER_DIAL_INTERCEPTED);if(0===n.length){this.log("loading multiaddrs for %p",e);try{const t=await this.components.peerStore.get(e);n.push(...t.addresses),this.log("loaded multiaddrs for %p",e,n.map((({multiaddr:e})=>e.toString())))}catch(e){if(e.code!==qy.ERR_NOT_FOUND)throw e}}if(0===n.length){this.log("looking up multiaddrs for %p in the peer routing",e);try{const t=await this.components.peerRouting.findPeer(e);this.log("found multiaddrs for %p in the peer routing",e,n.map((({multiaddr:e})=>e.toString()))),n.push(...t.multiaddrs.map((e=>({multiaddr:e,isCertified:!1}))))}catch(t){t.code!==qy.ERR_NO_ROUTERS_AVAILABLE&&this.log.error("looking up multiaddrs for %p in the peer routing failed",e,t)}}}let s=(await Promise.all(n.map((async e=>{const t=await async function(e,t){let r=!1;for(const t of Bo.keys())if(r=e.protoNames().includes(t),r)break;if(!r)return[e];const n=await e.resolve(t);return t.log("resolved %s to",e,n.map((e=>e.toString()))),n}(e.multiaddr,{dns:this.components.dns,...r,log:this.log});return 1===t.length&&t[0].equals(e.multiaddr)?e:t.map((e=>({multiaddr:e,isCertified:!1})))})))).flat();if(null!=e){const t=`/p2p/${e.toString()}`;s=s.map((e=>{const r=e.multiaddr.protos().pop();return!0===r?.path?e:null==e.multiaddr.getPeerId()?{multiaddr:e.multiaddr.encapsulate(t),isCertified:e.isCertified}:e}))}const o=s.filter((t=>{if(null==this.components.transportManager.dialTransportForMultiaddr(t.multiaddr))return!1;const r=t.multiaddr.getPeerId();return null==e||null==r||e.equals(r)})),i=new Map;for(const e of o){const t=e.multiaddr.toString(),r=i.get(t);null==r?i.set(t,e):r.isCertified=r.isCertified||e.isCertified||!1}const a=[...i.values()];if(0===a.length)throw new eo("The dial request has no valid addresses",qy.ERR_NO_VALID_ADDRESSES);const c=[];for(const e of a)null!=this.components.connectionGater.denyDialMultiaddr&&await this.components.connectionGater.denyDialMultiaddr(e.multiaddr)||c.push(e);const l=c.sort(this.addressSorter);if(0===l.length)throw new eo("The connection gater denied all addresses in the dial request",qy.ERR_NO_VALID_ADDRESSES);return this.log.trace("addresses for %p before filtering",e??"unknown peer",s.map((({multiaddr:e})=>e.toString()))),this.log.trace("addresses for %p after filtering",e??"unknown peer",l.map((({multiaddr:e})=>e.toString()))),l}async isDialable(e,t={}){Array.isArray(e)||(e=[e]);try{const r=await this.calculateMultiaddrs(void 0,new Set(e.map((e=>e.toString()))),t);return!1!==t.runOnTransientConnection||null!=r.find((e=>!Mp.matches(e.multiaddr)))}catch(e){this.log.trace("error calculating if multiaddr(s) were dialable",e)}return!1}}const fm=50,gm=5,ym=100,mm=5,bm=10,wm=25,vm=0,Em=100,Sm=Xy,Am=10;class _m{started;connections;allow;deny;maxIncomingPendingConnections;incomingPendingConnections;maxConnections;dialQueue;autoDial;connectionPruner;inboundConnectionRateLimiter;peerStore;metrics;events;log;constructor(e,t={}){this.maxConnections=t.maxConnections??ym;const r=t.minConnections??gm;if(this.maxConnectionsMo(e))),this.deny=(t.deny??[]).map((e=>Mo(e))),this.incomingPendingConnections=0,this.maxIncomingPendingConnections=t.maxIncomingPendingConnections??bm,this.inboundConnectionRateLimiter=new df({points:t.inboundConnectionThreshold??mm,duration:1}),this.autoDial=new im({connectionManager:this,peerStore:e.peerStore,events:e.events,logger:e.logger},{minConnections:r,autoDialConcurrency:t.autoDialConcurrency??wm,autoDialPriority:t.autoDialPriority??vm,autoDialPeerRetryThreshold:t.autoDialPeerRetryThreshold??Sm,autoDialDiscoveredPeersDebounce:t.autoDialDiscoveredPeersDebounce??Am,maxQueueLength:t.autoDialMaxQueueLength??Em}),this.connectionPruner=new lm({connectionManager:this,peerStore:e.peerStore,events:e.events,logger:e.logger},{maxConnections:this.maxConnections,allow:this.allow}),this.dialQueue=new pm(e,{addressSorter:t.addressSorter??Cy,maxParallelDials:t.maxParallelDials??50,maxDialQueueLength:t.maxDialQueueLength??500,maxPeerAddrsToDial:t.maxPeerAddrsToDial??25,dialTimeout:t.dialTimeout??5e3,resolvers:t.resolvers??{dnsaddr:Fy},connections:this.connections})}[Symbol.toStringTag]="@libp2p/connection-manager";isStarted(){return this.started}async start(){this.metrics?.registerMetricGroup("libp2p_connection_manager_connections",{calculate:()=>{const e={inbound:0,outbound:0};for(const t of this.connections.values())for(const r of t)"inbound"===r.direction?e.inbound++:e.outbound++;return e}}),this.metrics?.registerMetricGroup("libp2p_protocol_streams_total",{label:"protocol",calculate:()=>{const e={};for(const t of this.connections.values())for(const r of t)for(const t of r.streams){const r=`${t.direction} ${t.protocol??"unnegotiated"}`;e[r]=(e[r]??0)+1}return e}}),this.metrics?.registerMetricGroup("libp2p_connection_manager_protocol_streams_per_connection_90th_percentile",{label:"protocol",calculate:()=>{const e={};for(const t of this.connections.values())for(const r of t){const t={};for(const e of r.streams){const r=`${e.direction} ${e.protocol??"unnegotiated"}`;t[r]=(t[r]??0)+1}for(const[r,n]of Object.entries(t))e[r]=e[r]??[],e[r].push(n)}const t={};for(let[r,n]of Object.entries(e)){n=n.sort(((e,t)=>e-t));const e=Math.floor(.9*n.length);t[r]=n[e]}return t}}),this.dialQueue.start(),this.autoDial.start(),this.started=!0,this.log("started")}async afterStart(){Promise.resolve().then((async()=>{const e=await this.peerStore.all({filters:[e=>e.tags.has("keep-alive")]});await Promise.all(e.map((async e=>{await this.openConnection(e.id).catch((e=>{this.log.error(e)}))})))})).catch((e=>{this.log.error(e)})),this.autoDial.afterStart()}async stop(){this.dialQueue.stop(),this.autoDial.stop();const e=[];for(const t of this.connections.values())for(const r of t)e.push((async()=>{try{await r.close()}catch(e){this.log.error(e)}})());this.log("closing %d connections",e.length),await Promise.all(e),this.connections.clear(),this.log("stopped")}onConnect(e){this._onConnect(e).catch((e=>{this.log.error(e)}))}async _onConnect(e){const{detail:t}=e;if(!this.started)return void await t.close();const r=t.remotePeer,n=this.connections.get(r);let s=!1;null!=n?n.push(t):(s=!0,this.connections.set(r,[t])),null!=r.publicKey&&"RSA"===r.type&&await this.peerStore.patch(r,{publicKey:r.publicKey}),s&&this.events.safeDispatchEvent("peer:connect",{detail:t.remotePeer})}onDisconnect(e){const{detail:t}=e;if(!this.started)return;const r=t.remotePeer;let n=this.connections.get(r);null!=n&&n.length>1?(n=n.filter((e=>e.id!==t.id)),this.connections.set(r,n)):null!=n&&(this.connections.delete(r),this.events.safeDispatchEvent("peer:disconnect",{detail:t.remotePeer}))}getConnections(e){if(null!=e)return this.connections.get(e)??[];let t=[];for(const e of this.connections.values())t=t.concat(e);return t}getConnectionsMap(){return this.connections}async openConnection(e,t={}){if(!this.isStarted())throw new eo("Not started",qy.ERR_NODE_NOT_STARTED);t.signal?.throwIfAborted();const{peerId:r}=jy(e);if(null!=r&&!0!==t.force){this.log("dial %p",r);const e=this.getConnections(r).find((e=>!e.transient));if(null!=e)return this.log("had an existing non-transient connection to %p",r),t.onProgress?.(new Yf("dial-queue:already-connected")),e}const n=await this.dialQueue.dial(e,{...t,priority:t.priority??fm});let s=this.connections.get(n.remotePeer);null==s&&(s=[],this.connections.set(n.remotePeer,s));let o=!1;for(const e of s)e.id===n.id&&(o=!0);return o||s.push(n),n}async closeConnections(e,t={}){const r=this.connections.get(e)??[];await Promise.all(r.map((async e=>{try{await e.close(t)}catch(t){e.abort(t)}})))}async acceptIncomingConnection(e){if(this.deny.some((t=>e.remoteAddr.toString().startsWith(t.toString()))))return this.log("connection from %a refused - connection remote address was in deny list",e.remoteAddr),!1;if(this.allow.some((t=>e.remoteAddr.toString().startsWith(t.toString()))))return this.incomingPendingConnections++,!0;if(this.incomingPendingConnections===this.maxIncomingPendingConnections)return this.log("connection from %a refused - incomingPendingConnections exceeded by host",e.remoteAddr),!1;if(e.remoteAddr.isThinWaistAddress()){const t=e.remoteAddr.nodeAddress().address;try{await this.inboundConnectionRateLimiter.consume(t,1)}catch{return this.log("connection from %a refused - inboundConnectionThreshold exceeded by host %s",e.remoteAddr,t),!1}}return this.getConnections().length({id:t.id,status:e[t.status],peerId:t.options.peerId,multiaddrs:[...t.options.multiaddrs].map((e=>Mo(e)))})))}async isDialable(e,t={}){return this.dialQueue.isDialable(e,t)}}class km{movingAverage;variance;deviation;forecast;timespan;previousTime;constructor(e){this.timespan=e,this.movingAverage=0,this.variance=0,this.deviation=0,this.forecast=0}alpha(e,t){return 1-Math.exp(-(e-t)/this.timespan)}push(e,t=Date.now()){if(null!=this.previousTime){const r=this.alpha(t,this.previousTime),n=e-this.movingAverage,s=r*n;this.movingAverage=r*e+(1-r)*this.movingAverage,this.variance=(1-r)*(this.variance+n*s),this.deviation=Math.sqrt(this.variance),this.forecast=this.movingAverage+r*n}else this.movingAverage=e;this.previousTime=t}}class Im{success;failure;next;metric;timeoutMultiplier;failureMultiplier;minTimeout;constructor(e={}){this.success=new km(e.interval??5e3),this.failure=new km(e.interval??5e3),this.next=new km(e.interval??5e3),this.failureMultiplier=e.failureMultiplier??2,this.timeoutMultiplier=e.timeoutMultiplier??1.2,this.minTimeout=e.minTimeout??2e3,null!=e.metricName&&(this.metric=e.metrics?.registerMetricGroup(e.metricName))}getTimeoutSignal(e={}){const t=Math.max(Math.round(this.next.movingAverage*(e.timeoutFactor??this.timeoutMultiplier)),this.minTimeout),r=AbortSignal.timeout(t),n=hm([e.signal,r]);return n.start=Date.now(),n.timeout=t,n}cleanUp(e){const t=Date.now()-e.start;e.aborted?(this.failure.push(t),this.next.push(t*this.failureMultiplier),this.metric?.update({failureMovingAverage:this.failure.movingAverage,failureDeviation:this.failure.deviation,failureForecast:this.failure.forecast,failureVariance:this.failure.variance,failure:t})):(this.success.push(t),this.next.push(t),this.metric?.update({successMovingAverage:this.success.movingAverage,successDeviation:this.success.deviation,successForecast:this.success.forecast,successVariance:this.success.variance,success:t}))}}class Rm{protocol;components;log;heartbeatInterval;pingIntervalMs;abortController;timeout;constructor(e,t={}){this.components=e,this.protocol=`/${t.protocolPrefix??"ipfs"}/ping/1.0.0`,this.log=e.logger.forComponent("libp2p:connection-monitor"),this.pingIntervalMs=t.pingInterval??1e4,this.timeout=new Im({...t.pingTimeout??{},metrics:e.metrics,metricName:"libp2p_connection_monitor_ping_time_milliseconds"})}[Symbol.toStringTag]="@libp2p/connection-monitor";[Vu]=["@libp2p/connection-monitor"];start(){this.abortController=new AbortController,this.heartbeatInterval=setInterval((()=>{this.components.connectionManager.getConnections().forEach((e=>{Promise.resolve().then((async()=>{let t=Date.now();try{const r=this.timeout.getTimeoutSignal({signal:this.abortController?.signal}),n=hh(await e.newStream(this.protocol,{signal:r,runOnTransientConnection:!0}));t=Date.now(),await Promise.all([n.write(su(32),{signal:r}),n.read(32,{signal:r})]),e.rtt=Date.now()-t,await n.unwrap().close({signal:r})}catch(r){if("ERR_UNSUPPORTED_PROTOCOL"!==r.code)throw r;e.rtt=(Date.now()-t)/2}})).catch((t=>{this.log.error("error during heartbeat, aborting connection",t),e.abort(t)}))}))}),this.pingIntervalMs)}stop(){this.abortController?.abort(),null!=this.heartbeatInterval&&clearInterval(this.heartbeatInterval)}}class Tm{routers;started;components;constructor(e,t){this.routers=t.routers??[],this.started=!1,this.components=e}[Symbol.toStringTag]="@libp2p/content-routing";isStarted(){return this.started}async start(){this.started=!0}async stop(){this.started=!1}async*findProviders(e,t={}){if(0===this.routers.length)throw new eo("No content routers available",qy.ERR_NO_ROUTERS_AVAILABLE);const r=this,n=new mg;for await(const s of Qn(...r.routers.map((r=>r.findProviders(e,t)))))null!=s&&(s.multiaddrs.length>0&&await this.components.peerStore.merge(s.id,{multiaddrs:s.multiaddrs}),n.has(s.id)||(n.add(s.id),yield s))}async provide(e,t={}){if(0===this.routers.length)throw new eo("No content routers available",qy.ERR_NO_ROUTERS_AVAILABLE);await Promise.all(this.routers.map((async r=>{await r.provide(e,t)})))}async put(e,t,r){if(!this.isStarted())throw new eo(Hy.NOT_STARTED_YET,qy.ERR_NODE_NOT_STARTED);await Promise.all(this.routers.map((async n=>{await n.put(e,t,r)})))}async get(e,t){if(!this.isStarted())throw new eo(Hy.NOT_STARTED_YET,qy.ERR_NODE_NOT_STARTED);return Promise.any(this.routers.map((async r=>r.get(e,t))))}}class Cm{fp;h;seed;constructor(e,t,r,n=2){if(n>64)throw new TypeError("Invalid Fingerprint Size");const s=t.hashV(e,r),o=b(n);for(let e=0;ee.equals(t)))}add(e){if(!(e instanceof Cm))throw new TypeError("Invalid Fingerprint");for(let t=0;te.equals(t)));return t>-1&&(this.contents[t]=null,!0)}}const Pm={32:16777619n,64:1099511628211n,128:309485009821345068724781371n,256:374144419156711147060143317175368453031918731002211n,512:35835915874844867368919076489095108449946327955754392558399825615420669938882575126094039892345713852759n,1024:5016456510113118655434598811035278955030765345404790744303017523831112055108147451509157692220295382716162651878526895249385292291816524375083746691371804094271873160484737966720260389217684476157468082573n},Om={32:2166136261n,64:14695981039346656037n,128:144066263297769815596495629667062367629n,256:100029257958052580907070968620625704837092796014241193945225284501741471925557n,512:9659303129496669498009435400716310466090418745672637896108374329434462657994582932197716438449813051892206539805784495328239340083876191928701583869517785n,1024:14197795064947621068722070641403218320880622795441933960878474914617582723252296732303717722150864096521202355549365628174669108571814760471015076148029755969804077320157692458563003215304957150157403644460363550505412711285966361610267868082893823963790439336411086884584107735010676915n},Dm=new globalThis.TextEncoder;__webpack_require__(8437);const Lm={hash:e=>Number(function(e,{size:t=32,utf8Buffer:r}={}){if(!Pm[t])throw new Error("The `size` option must be one of 32, 64, 128, 256, 512, or 1024");if("string"==typeof e){if(r)return function(e,t,r){if(0===r.length)throw new Error("The `utf8Buffer` option must have a length greater than zero");const n=Pm[t];let s=Om[t],o=e;for(;o.length>0;){const e=Dm.encodeInto(o,r);o=o.slice(e.read);for(let o=0;ofunction(e){let t=e.toString(16);return t.length%2==1&&(t=`0${t}`),Nt(t,"base16")}(Lm.hash(e,t))};class Bm{bucketSize;filterSize;fingerprintSize;buckets;count;hash;seed;constructor(e){this.filterSize=e.filterSize,this.bucketSize=e.bucketSize??4,this.fingerprintSize=e.fingerprintSize??2,this.count=0,this.buckets=[],this.hash=e.hash??Lm,this.seed=e.seed??Nm(0,Math.pow(2,10))}add(e){"string"==typeof e&&(e=Nt(e));const t=new Cm(e,this.hash,this.seed,this.fingerprintSize),r=this.hash.hash(e,this.seed)%this.filterSize,n=(r^t.hash())%this.filterSize;if(null==this.buckets[r]&&(this.buckets[r]=new xm(this.bucketSize)),null==this.buckets[n]&&(this.buckets[n]=new xm(this.bucketSize)),this.buckets[r].add(t)||this.buckets[n].add(t))return this.count++,!0;const s=[r,n];let o=s[Nm(0,s.length-1)];null==this.buckets[o]&&(this.buckets[o]=new xm(this.bucketSize));for(let e=0;e<500;e++){const e=this.buckets[o].swap(t);if(null!=e&&(o=(o^e.hash())%this.filterSize,null==this.buckets[o]&&(this.buckets[o]=new xm(this.bucketSize)),this.buckets[o].add(e)))return this.count++,!0}return!1}has(e){"string"==typeof e&&(e=Nt(e));const t=new Cm(e,this.hash,this.seed,this.fingerprintSize),r=this.hash.hash(e,this.seed)%this.filterSize,n=this.buckets[r]?.has(t)??!1;if(n)return n;const s=(r^t.hash())%this.filterSize;return this.buckets[s]?.has(t)??!1}remove(e){"string"==typeof e&&(e=Nt(e));const t=new Cm(e,this.hash,this.seed,this.fingerprintSize),r=this.hash.hash(e,this.seed)%this.filterSize,n=this.buckets[r]?.remove(t)??!1;if(n)return this.count--,n;const s=(r^t.hash())%this.filterSize,o=this.buckets[s]?.remove(t)??!1;return o&&this.count--,o}get reliable(){return Math.floor(this.count/this.filterSize*100)<=90}}const Um={1:.5,2:.84,4:.95,8:.98};function Mm(e,t=.001){const r=function(e=.001){return e>.002?2:e>1e-5?4:8}(t),n=Um[r];return{filterSize:Math.round(e/n),bucketSize:r,fingerprintSize:Math.min(Math.ceil(Math.log2(1/t)+Math.log2(2*r)),64)}}class Fm{filterSize;bucketSize;fingerprintSize;scale;filterSeries;hash;seed;constructor(e){this.bucketSize=e.bucketSize??4,this.filterSize=e.filterSize??(1<<18)/this.bucketSize,this.fingerprintSize=e.fingerprintSize??2,this.scale=e.scale??2,this.hash=e.hash??Lm,this.seed=e.seed??Nm(0,Math.pow(2,10)),this.filterSeries=[new Bm({filterSize:this.filterSize,bucketSize:this.bucketSize,fingerprintSize:this.fingerprintSize,hash:this.hash,seed:this.seed})]}add(e){if("string"==typeof e&&(e=Nt(e)),this.has(e))return!0;let t=this.filterSeries.find((e=>e.reliable));if(null==t){const e=this.filterSize*Math.pow(this.scale,this.filterSeries.length);t=new Bm({filterSize:e,bucketSize:this.bucketSize,fingerprintSize:this.fingerprintSize,hash:this.hash,seed:this.seed}),this.filterSeries.push(t)}return t.add(e)}has(e){"string"==typeof e&&(e=Nt(e));for(let t=0;te+t.count),0)}}const $m=globalThis.CustomEvent??Event;class Hm{log;peerId;peerStore;routers;constructor(e,t={}){this.log=e.logger.forComponent("libp2p:peer-routing"),this.peerId=e.peerId,this.peerStore=e.peerStore,this.routers=t.routers??[]}[Symbol.toStringTag]="@libp2p/peer-routing";async findPeer(e,t){if(0===this.routers.length)throw new eo("No peer routers available",qy.ERR_NO_ROUTERS_AVAILABLE);if(e.toString()===this.peerId.toString())throw new eo("Should not try to find self",qy.ERR_FIND_SELF);const r=this,n=Qn(...this.routers.map((n=>async function*(){try{yield await n.findPeer(e,t)}catch(e){r.log.error(e)}}())));for await(const e of n)if(null!=e)return e.multiaddrs.length>0&&await this.peerStore.merge(e.id,{multiaddrs:e.multiaddrs}),e;throw new eo(Hy.NOT_FOUND,qy.ERR_NOT_FOUND)}async*getClosestPeers(e,t={}){if(0===this.routers.length)throw new eo("No peer routers available",qy.ERR_NO_ROUTERS_AVAILABLE);const r=this,n=function(e,t=.001,r){return new Fm({...Mm(1024,t),...r??{}})}();for await(const s of async function*(e,t={}){let r=t.concurrency??1/0;r<1&&(r=1/0);const n=null!=t.ordered&&t.ordered,s=new EventTarget,o=[];let i,a=Gn(),c=Gn(),l=!1,u=!1;function h(){return n?o[0]?.done:Boolean(o.find((e=>e.done)))}function*d(){for(;o.length>0&&o[0].done;){const e=o[0];if(o.shift(),!e.ok)throw u=!0,a.resolve(),e.err;yield e.value,a.resolve()}}function*p(){for(;h();)for(let e=0;e{c.resolve()})),Promise.resolve().then((async()=>{try{for await(const t of e){if(o.length===r&&(a=Gn(),await a.promise),u)break;const e={done:!1};o.push(e),t().then((t=>{e.done=!0,e.ok=!0,e.value=t,s.dispatchEvent(new $m("task-complete"))}),(t=>{e.done=!0,e.err=t,s.dispatchEvent(new $m("task-complete"))}))}l=!0,s.dispatchEvent(new $m("task-complete"))}catch(e){i=e,s.dispatchEvent(new $m("task-complete"))}}));;){if(h()||(c=Gn(),await c.promise),null!=i)throw i;if(n?yield*d():yield*p(),l&&0===o.length)break}}(async function*(){const n=Qn(...r.routers.map((r=>r.getClosestPeers(e,t))));for await(let e of n)yield async()=>{if(0===e.multiaddrs.length)try{e=await r.findPeer(e.id,{...t,useCache:!1})}catch(e){return void r.log.error("could not find peer multiaddrs",e)}return e}}()))null!=s&&(s.multiaddrs.length>0&&await this.peerStore.merge(s.id,{multiaddrs:s.multiaddrs}),n.has(s.id.toBytes())||(n.add(s.id.toBytes()),yield s))}}class qm extends Fs{peerRouting;log;walking;walkers;shutdownController;walkController;needNext;constructor(e){super(),this.log=e.logger.forComponent("libp2p:random-walk"),this.peerRouting=e.peerRouting,this.walkers=0,this.walking=!1,this.shutdownController=new AbortController,this.shutdownController.signal}[Symbol.toStringTag]="@libp2p/random-walk";start(){this.shutdownController=new AbortController,this.shutdownController.signal}stop(){this.shutdownController.abort()}async*walk(e){this.walking||this.startWalk(),this.walkers++;const t=hm([this.shutdownController.signal,e?.signal]);try{for(;;){this.needNext?.resolve(),this.needNext=Gn();const e=await zy(this,"walk:peer",t,{errorEvent:"walk:error"});yield e.detail}}finally{t.clear(),this.walkers--,0===this.walkers&&(this.walkController?.abort(),this.walkController=void 0)}}startWalk(){this.walking=!0,this.walkController=new AbortController,this.walkController.signal;const e=hm([this.walkController.signal,this.shutdownController.signal]),t=Date.now();let r=0;Promise.resolve().then((async()=>{for(this.log("start walk");this.walkers>0;)try{const t=su(32);let n=Date.now();for await(const s of this.peerRouting.getClosestPeers(t,{signal:e}))e.aborted&&this.log("aborting walk"),e.throwIfAborted(),this.log("found peer %p after %dms for %d walkers",s.id,Date.now()-n,this.walkers),r++,this.safeDispatchEvent("walk:peer",{detail:s}),1===this.walkers&&null!=this.needNext&&(this.log("wait for need next"),await ih(this.needNext.promise,e)),n=Date.now();this.log("walk iteration for %b and %d walkers finished, found %d peers",t,this.walkers,r)}catch(e){this.log.error("randomwalk errored",e),this.safeDispatchEvent("walk:error",{detail:e})}this.log("no walkers left, ended walk")})).catch((e=>{this.log.error("randomwalk errored",e)})).finally((()=>{this.log("finished walk, found %d peers after %dms",r,Date.now()-t),this.walking=!1}))}}class Vm{log;topologies;handlers;components;constructor(e){this.log=e.logger.forComponent("libp2p:registrar"),this.topologies=new Map,this.handlers=new Map,this.components=e,this._onDisconnect=this._onDisconnect.bind(this),this._onPeerUpdate=this._onPeerUpdate.bind(this),this._onPeerIdentify=this._onPeerIdentify.bind(this),this.components.events.addEventListener("peer:disconnect",this._onDisconnect),this.components.events.addEventListener("peer:update",this._onPeerUpdate),this.components.events.addEventListener("peer:identify",this._onPeerIdentify)}[Symbol.toStringTag]="@libp2p/registrar";getProtocols(){return Array.from(new Set([...this.handlers.keys()])).sort()}getHandler(e){const t=this.handlers.get(e);if(null==t)throw new eo(`No handler registered for protocol ${e}`,qy.ERR_NO_HANDLER_FOR_PROTOCOL);return t}getTopologies(e){const t=this.topologies.get(e);return null==t?[]:[...t.values()]}async handle(e,t,r){if(this.handlers.has(e))throw new eo(`Handler already registered for protocol ${e}`,qy.ERR_PROTOCOL_HANDLER_ALREADY_REGISTERED);const n=$y.bind({ignoreUndefined:!0})({maxInboundStreams:32,maxOutboundStreams:64},r);this.handlers.set(e,{handler:t,options:n}),await this.components.peerStore.merge(this.components.peerId,{protocols:[e]})}async unhandle(e){(Array.isArray(e)?e:[e]).forEach((e=>{this.handlers.delete(e)})),await this.components.peerStore.patch(this.components.peerId,{protocols:this.getProtocols()})}async register(e,t){if(null==t)throw new eo("invalid topology",qy.ERR_INVALID_PARAMETERS);const r=`${(1e9*Math.random()).toString(36)}${Date.now()}`;let n=this.topologies.get(e);return null==n&&(n=new Map,this.topologies.set(e,n)),n.set(r,t),r}unregister(e){for(const[t,r]of this.topologies.entries())r.has(e)&&(r.delete(e),0===r.size&&this.topologies.delete(t))}_onDisconnect(e){const t=e.detail;this.components.peerStore.get(t).then((e=>{for(const r of e.protocols){const e=this.topologies.get(r);if(null!=e)for(const r of e.values())!1!==r.filter?.has(t)&&(r.filter?.remove(t),r.onDisconnect?.(t))}})).catch((e=>{e.code!==qy.ERR_NOT_FOUND&&this.log.error("could not inform topologies of disconnecting peer %p",t,e)}))}_onPeerUpdate(e){const{peer:t,previous:r}=e.detail,n=(r?.protocols??[]).filter((e=>!t.protocols.includes(e)));for(const e of n){const r=this.topologies.get(e);if(null!=r)for(const e of r.values())!1!==e.filter?.has(t.id)&&(e.filter?.remove(t.id),e.onDisconnect?.(t.id))}}_onPeerIdentify(e){const t=e.detail.protocols,r=e.detail.connection,n=e.detail.peerId;for(const e of t){const t=this.topologies.get(e);if(null!=t)for(const e of t.values())r.transient&&!0!==e.notifyOnTransient||!0!==e.filter?.has(n)&&(e.filter?.add(n),e.onConnect?.(n,r))}}}class jm extends Map{metric;constructor(e){super();const{name:t,metrics:r}=e;this.metric=r.registerMetric(t),this.updateComponentMetric()}set(e,t){return super.set(e,t),this.updateComponentMetric(),this}delete(e){const t=super.delete(e);return this.updateComponentMetric(),t}clear(){super.clear(),this.updateComponentMetric()}updateComponentMetric(){this.metric.update(this.size)}}class Km{log;components;transports;listeners;faultTolerance;started;constructor(e,t={}){this.log=e.logger.forComponent("libp2p:transports"),this.components=e,this.started=!1,this.transports=new Map,this.listeners=function(e){const{name:t,metrics:r}=e;let n;return n=null!=r?new jm({name:t,metrics:r}):new Map,n}({name:"libp2p_transport_manager_listeners",metrics:this.components.metrics}),this.faultTolerance=t.faultTolerance??Bf.FATAL_ALL}[Symbol.toStringTag]="@libp2p/transport-manager";add(e){const t=e[Symbol.toStringTag];if(null==t)throw new eo("Transport must have a valid tag",qy.ERR_INVALID_KEY);if(this.transports.has(t))throw new eo(`There is already a transport with the tag ${t}`,qy.ERR_DUPLICATE_TRANSPORT);this.log("adding transport %s",t),this.transports.set(t,e),this.listeners.has(t)||this.listeners.set(t,[])}isStarted(){return this.started}start(){this.started=!0}async afterStart(){const e=this.components.addressManager.getListenAddrs();await this.listen(e)}async stop(){const e=[];for(const[t,r]of this.listeners)for(this.log("closing listeners for %s",t);r.length>0;){const t=r.pop();null!=t&&e.push(t.close())}await Promise.all(e),this.log("all listeners closed");for(const e of this.listeners.keys())this.listeners.set(e,[]);this.started=!1}async dial(e,t){const r=this.dialTransportForMultiaddr(e);if(null==r)throw new eo(`No transport available for address ${String(e)}`,qy.ERR_TRANSPORT_UNAVAILABLE);t?.onProgress?.(new Yf("transport-manager:selected-transport",r[Symbol.toStringTag]));try{return await r.dial(e,{...t,upgrader:this.components.upgrader})}catch(e){throw null==e.code&&(e.code=qy.ERR_TRANSPORT_DIAL_FAILED),e}}getAddrs(){let e=[];for(const t of this.listeners.values())for(const r of t)e=[...e,...r.getAddrs()];return e}getTransports(){return Array.of(...this.transports.values())}getListeners(){return Array.of(...this.listeners.values()).flat()}dialTransportForMultiaddr(e){for(const t of this.transports.values())if(t.dialFilter([e]).length>0)return t}listenTransportForMultiaddr(e){for(const t of this.transports.values())if(t.listenFilter([e]).length>0)return t}async listen(e){if(!this.isStarted())throw new eo("Not started",qy.ERR_NODE_NOT_STARTED);if(null==e||0===e.length)return void this.log("no addresses were provided for listening, this node is dial only");const t=[];for(const[r,n]of this.transports.entries()){const s=n.listenFilter(e),o=[];for(const e of s){this.log("creating listener for %s on %a",r,e);const t=n.createListener({upgrader:this.components.upgrader});let s=this.listeners.get(r)??[];null==s&&(s=[],this.listeners.set(r,s)),s.push(t),t.addEventListener("listening",(()=>{this.components.events.safeDispatchEvent("transport:listening",{detail:t})})),t.addEventListener("close",(()=>{const e=s.findIndex((e=>e===t));s.splice(e,1),this.components.events.safeDispatchEvent("transport:close",{detail:t})})),o.push(t.listen(e))}if(0!==o.length){if(null==(await Promise.allSettled(o)).find((e=>"fulfilled"===e.status))&&this.faultTolerance!==Bf.NO_FATAL)throw new eo(`Transport (${r}) could not listen on any available address`,qy.ERR_NO_VALID_ADDRESSES)}else t.push(r)}if(t.length===this.transports.size){const e=`no valid addresses were provided for transports [${t.join(", ")}]`;if(this.faultTolerance===Bf.FATAL_ALL)throw new eo(e,qy.ERR_NO_VALID_ADDRESSES);this.log(`libp2p in dial mode only: ${e}`)}}async remove(e){const t=this.listeners.get(e)??[];this.log.trace("removing transport %s",e);const r=[];for(this.log.trace("closing listeners for %s",e);t.length>0;){const e=t.pop();null!=e&&r.push(e.close())}await Promise.all(r),this.transports.delete(e),this.listeners.delete(e)}async removeAll(){const e=[];for(const t of this.transports.keys())e.push(this.remove(t));await Promise.all(e)}}const zm="/multistream/1.0.0",Gm=1024,Wm=Nt("\n");async function Ym(e,t,r){await e.write(t,r)}async function Jm(e,t){const r=await async function(e,t){const r=await e.read(t);if(0===r.byteLength||r.get(r.byteLength-1)!==Wm[0])throw t.log.error("Invalid mss message - missing newline",r),new eo("missing newline","ERR_INVALID_MULTISTREAM_SELECT_MESSAGE");return r.sublist(0,-1)}(e,t);return sn(r.subarray())}async function Xm(e,t,r){t=Array.isArray(t)?t:[t],r.log.trace("handle: available protocols %s",t);const n=gh(e,{...r,maxDataLength:Gm,maxLengthLength:2});for(;;){r.log.trace("handle: reading incoming string");const e=await Jm(n,r);if(r.log.trace('handle: read "%s"',e),e!==zm){if(t.includes(e))return r.log.trace('handle: respond with "%s" for "%s"',e,e),await Ym(n,Nt(`${e}\n`),r),r.log.trace('handle: responded with "%s" for "%s"',e,e),{stream:n.unwrap(),protocol:e};if("ls"!==e)r.log('handle: respond with "na" for "%s"',e),await Ym(n,Nt("na\n"),r),r.log('handle: responded with "na" for "%s"',e);else{const s=new Bn(...t.map((e=>Fn.single(Nt(`${e}\n`)))),Nt("\n"));r.log.trace('handle: respond with "%s" for %s',t,e),await Ym(n,s,r),r.log.trace('handle: responded with "%s" for %s',t,e)}}else r.log.trace('handle: respond with "%s" for "%s"',zm,e),await Ym(n,Nt(`${zm}\n`),r),r.log.trace('handle: responded with "%s" for "%s"',zm,e)}}async function Qm(e,t,r){if(1===(t=Array.isArray(t)?[...t]:[t]).length&&!1===r.negotiateFully)return function(e,t,r){const n=e.sink.bind(e),s=e.source;let o=!1,i=!1;const a=Gn();let c=!1,l=!1;const u=Gn();let h=!1,d=!1;const p=Gn(),f=gh({sink:n,source:s},{...r,maxDataLength:Gm});async function g(){if(i)return r.log.trace("optimistic: already negotiating %s stream",t),void await a.promise;i=!0;try{c||(r.log.trace("optimistic: doing send protocol for %s stream",t),await async function(){if(l)await u.promise;else{l=!0;try{r.log.trace('optimistic: write ["%s", "%s", data] in source',zm,t),await f.writeV([Nt(`${zm}\n`),Nt(`${t}\n`)]),r.log.trace('optimistic: wrote ["%s", "%s", data] in source',zm,t)}finally{c=!0,l=!1,u.resolve()}}}()),h||(r.log.trace("optimistic: doing read protocol for %s stream",t),await async function(){if(d)await p.promise;else{d=!0;try{r.log.trace("optimistic: reading multistream select header");let e=await Jm(f,r);if(r.log.trace('optimistic: read multistream select header "%s"',e),e===zm&&(e=await Jm(f,r)),r.log.trace('optimistic: read protocol "%s", expecting "%s"',e,t),e!==t)throw new eo("protocol selection failed","ERR_UNSUPPORTED_PROTOCOL")}finally{h=!0,d=!1,p.resolve()}}}())}finally{i=!1,o=!0,a.resolve()}}if(e.sink=async e=>{const{sink:n}=f.unwrap();await n(async function*(){let n=!1;for await(const s of e){if(l&&await u.promise,c)yield s;else{l=!0,r.log.trace('optimistic: write ["%s", "%s", data(%d)] in sink',zm,t,s.byteLength);const e=`${t}\n`;yield new Bn(Uint8Array.from([19]),Nt(`${zm}\n`),P(e.length),Nt(e),s).subarray(),r.log.trace('optimistic: wrote ["%s", "%s", data(%d)] in sink',zm,t,s.byteLength),c=!0,l=!1,u.resolve(),g().catch((e=>{r.log.error("could not finish optimistic protocol negotiation of %s",t,e)}))}n=!0}n||await g()}())},e.source=async function*(){await g(),r.log.trace('optimistic: reading data from "%s" stream',t),yield*f.unwrap().source}(),null!=e.closeRead){const t=e.closeRead.bind(e);e.closeRead=async e=>{o||await g().catch((e=>{r.log.error("could not negotiate protocol before close read",e)})),await t(e)}}if(null!=e.closeWrite){const t=e.closeWrite.bind(e);e.closeWrite=async e=>{o||await g().catch((e=>{r.log.error("could not negotiate protocol before close write",e)})),await t(e)}}if(null!=e.close){const t=e.close.bind(e);e.close=async e=>{const r=[];l&&r.push(u.promise),d&&r.push(p.promise),r.length>0?await ih(Promise.all(r),e?.signal):(o=!0,i=!1,a.resolve()),await t(e)}}return{stream:e,protocol:t}}(e,t[0],r);const n=gh(e,{...r,maxDataLength:Gm}),s=t.shift();if(null==s)throw new Error("At least one protocol must be specified");r.log.trace('select: write ["%s", "%s"]',zm,s);const o=Nt(`${zm}\n`),i=Nt(`${s}\n`);await async function(e,t,r){await e.writeV(t,r)}(n,[o,i],r),r.log.trace("select: reading multistream-select header");let a=await Jm(n,r);if(r.log.trace('select: read "%s"',a),a===zm&&(r.log.trace("select: reading protocol response"),a=await Jm(n,r),r.log.trace('select: read "%s"',a)),a===s)return{stream:n.unwrap(),protocol:s};for(const e of t){r.log.trace('select: write "%s"',e),await Ym(n,Nt(`${e}\n`),r),r.log.trace("select: reading protocol response");const t=await Jm(n,r);if(r.log.trace('select: read "%s" for "%s"',t,e),t===e)return{stream:n.unwrap(),protocol:e}}throw new eo("protocol selection failed","ERR_UNSUPPORTED_PROTOCOL")}const Zm=Symbol.for("@libp2p/connection");class eb{id;remoteAddr;remotePeer;direction;timeline;multiplexer;encryption;status;transient;log;tags;_newStream;_close;_abort;_getStreams;constructor(e){const{remoteAddr:t,remotePeer:r,newStream:n,close:s,abort:o,getStreams:i}=e;this.id=`${parseInt(String(1e9*Math.random())).toString(36)}${Date.now()}`,this.remoteAddr=t,this.remotePeer=r,this.direction=e.direction,this.status="open",this.timeline=e.timeline,this.multiplexer=e.multiplexer,this.encryption=e.encryption,this.transient=e.transient??!1,this.log=e.logger.forComponent(`libp2p:connection:${this.direction}:${this.id}`),null==this.remoteAddr.getPeerId()&&(this.remoteAddr=this.remoteAddr.encapsulate(`/p2p/${this.remotePeer}`)),this._newStream=n,this._close=s,this._abort=o,this._getStreams=i,this.tags=[]}[Symbol.toStringTag]="Connection";[Zm]=!0;get streams(){return this._getStreams()}async newStream(e,t){if("closing"===this.status)throw new eo("the connection is being closed","ERR_CONNECTION_BEING_CLOSED");if("closed"===this.status)throw new eo("the connection is closed","ERR_CONNECTION_CLOSED");if(Array.isArray(e)||(e=[e]),this.transient&&!0!==t?.runOnTransientConnection)throw new eo("Cannot open protocol stream on transient connection","ERR_TRANSIENT_CONNECTION");const r=await this._newStream(e,t);return r.direction="outbound",r}async close(e={}){if("closed"!==this.status&&"closing"!==this.status){if(this.log("closing connection to %a",this.remoteAddr),this.status="closing",null==e.signal){const t=AbortSignal.timeout(500);e={...e,signal:t}}try{this.log.trace("closing all streams"),await Promise.all(this.streams.map((async t=>t.close(e)))),this.log.trace("closing underlying transport"),await this._close(e),this.log.trace("updating timeline with close time"),this.status="closed",this.timeline.close=Date.now()}catch(e){this.log.error("error encountered during graceful close of connection to %a",this.remoteAddr,e),this.abort(e)}}}abort(e){this.log.error("aborting connection to %a due to error",this.remoteAddr,e),this.status="closing",this.streams.forEach((t=>{t.abort(e)})),this.log.error("all streams aborted",this.streams.length),this._abort(e),this.timeline.close=Date.now(),this.status="closed"}}function tb(e,t,r){let n=0;return r.streams.forEach((r=>{r.direction===t&&r.protocol===e&&n++})),n}class rb{components;connectionEncryption;muxers;inboundUpgradeTimeout;events;constructor(e,t){this.components=e,this.connectionEncryption=new Map,t.connectionEncryption.forEach((e=>{this.connectionEncryption.set(e.protocol,e)})),this.muxers=new Map,t.muxers.forEach((e=>{this.muxers.set(e.protocol,e)})),this.inboundUpgradeTimeout=t.inboundUpgradeTimeout??2e3,this.events=e.events}[Symbol.toStringTag]="@libp2p/upgrader";async shouldBlockConnection(e,t,r){const n=this.components.connectionGater[r];if(void 0!==n&&await n(e,t))throw new eo(`The multiaddr connection is blocked by gater.${r}`,qy.ERR_CONNECTION_INTERCEPTED)}async upgradeInbound(e,t){if(!await this.components.connectionManager.acceptIncomingConnection(e))throw new eo("connection denied",qy.ERR_CONNECTION_DENIED);let r,n,s,o,i;const a=AbortSignal.timeout(this.inboundUpgradeTimeout),c=()=>{e.abort(new eo("inbound upgrade timeout",ro))};a.addEventListener("abort",c,{once:!0});try{if(!0===await(this.components.connectionGater.denyInboundConnection?.(e)))throw new eo("The multiaddr connection is blocked by gater.acceptConnection",qy.ERR_CONNECTION_INTERCEPTED);this.components.metrics?.trackMultiaddrConnection(e),e.log("starting the inbound connection upgrade");let a=e;if(!0!==t?.skipProtection){const t=this.components.connectionProtector;null!=t&&(e.log("protecting the inbound connection"),a=await t.protect(e))}try{if(r=a,!0!==t?.skipEncryption){t?.onProgress?.(new Yf("upgrader:encrypt-inbound-connection")),({conn:r,remotePeer:n,protocol:i}=await this._encryptInbound(a));const e={...a,...r};await this.shouldBlockConnection(n,e,"denyInboundEncryptedConnection")}else{const t=e.remoteAddr.getPeerId();if(null==t)throw new eo("inbound connection that skipped encryption must have a peer id",qy.ERR_INVALID_MULTIADDR);const r=rh(t);i="native",n=r}if(s=r,null!=t?.muxerFactory)o=t.muxerFactory;else if(this.muxers.size>0){t?.onProgress?.(new Yf("upgrader:multiplex-inbound-connection"));const e=await this._multiplexInbound({...a,...r},this.muxers);o=e.muxerFactory,s=e.stream}}catch(t){throw e.log.error("failed to upgrade inbound connection",t),t}return await this.shouldBlockConnection(n,e,"denyInboundUpgradedConnection"),e.log("successfully upgraded inbound connection"),this._createConnection({cryptoProtocol:i,direction:"inbound",maConn:e,upgradedConn:s,muxerFactory:o,remotePeer:n,transient:t?.transient})}finally{a.removeEventListener("abort",c),this.components.connectionManager.afterUpgradeInbound()}}async upgradeOutbound(e,t){const r=e.remoteAddr.getPeerId();let n,s,o,i,a,c;null!=r&&(n=rh(r),await this.shouldBlockConnection(n,e,"denyOutboundConnection")),this.components.metrics?.trackMultiaddrConnection(e),e.log("starting the outbound connection upgrade");let l=e;if(!0!==t?.skipProtection){const t=this.components.connectionProtector;null!=t&&(l=await t.protect(e))}try{if(s=l,!0!==t?.skipEncryption){({conn:s,remotePeer:o,protocol:a}=await this._encryptOutbound(l,n));const e={...l,...s};await this.shouldBlockConnection(o,e,"denyOutboundEncryptedConnection")}else{if(null==n)throw new eo("Encryption was skipped but no peer id was passed",qy.ERR_INVALID_PEER);a="native",o=n}if(i=s,null!=t?.muxerFactory)c=t.muxerFactory;else if(this.muxers.size>0){const e=await this._multiplexOutbound({...l,...s},this.muxers);c=e.muxerFactory,i=e.stream}}catch(t){throw e.log.error("failed to upgrade outbound connection",t),await e.close(t),t}return await this.shouldBlockConnection(o,e,"denyOutboundUpgradedConnection"),e.log("successfully upgraded outbound connection"),this._createConnection({cryptoProtocol:a,direction:"outbound",maConn:e,upgradedConn:i,muxerFactory:c,remotePeer:o,transient:t?.transient})}_createConnection(e){const{cryptoProtocol:t,direction:r,maConn:n,upgradedConn:s,remotePeer:o,muxerFactory:i,transient:a}=e;let c,l,u;null!=i&&(c=i.createStreamMuxer({direction:r,onIncomingStream:e=>{null!=u&&Promise.resolve().then((async()=>{const t=this.components.registrar.getProtocols(),{stream:r,protocol:n}=await Xm(e,t,{log:e.log,yieldBytes:!1});if(null==u)return;u.log("incoming stream opened on %s",n);const s=function(e,t){try{const{options:r}=t.getHandler(e);return r.maxInboundStreams}catch(e){if(e.code!==qy.ERR_NO_HANDLER_FOR_PROTOCOL)throw e}return 32}(n,this.components.registrar);if(tb(n,"inbound",u)===s){const t=new eo(`Too many inbound protocol streams for protocol "${n}" - limit ${s}`,qy.ERR_TOO_MANY_INBOUND_PROTOCOL_STREAMS);throw e.abort(t),t}e.source=r.source,e.sink=r.sink,e.protocol=n,null!=r.closeWrite&&(e.closeWrite=r.closeWrite),null!=r.closeRead&&(e.closeRead=r.closeRead),null!=r.close&&(e.close=r.close),await this.components.peerStore.merge(o,{protocols:[n]}),this.components.metrics?.trackProtocolStream(e,u),this._onStream({connection:u,stream:e,protocol:n})})).catch((async t=>{u.log.error("error handling incoming stream id %s",e.id,t.message,t.code,t.stack),null==e.timeline.close&&await e.close()}))}}),l=async(e,t={})=>{if(null==c)throw new eo("Stream is not multiplexed",qy.ERR_MUXER_UNAVAILABLE);u.log("starting new stream for protocols %s",e);const r=await c.newStream();u.log.trace("started new stream %s for protocols %s",r.id,e);try{if(null==t.signal){r.log("no abort signal was passed while trying to negotiate protocols %s falling back to default timeout",e);const n=AbortSignal.timeout(3e4);t={...t,signal:n}}r.log.trace("selecting protocol from protocols %s",e);const{stream:n,protocol:s}=await Qm(r,e,{...t,log:r.log,yieldBytes:!0});r.log("selected protocol %s",s);const i=function(e,t,r={}){try{const{options:r}=t.getHandler(e);if(null!=r.maxOutboundStreams)return r.maxOutboundStreams}catch(e){if(e.code!==qy.ERR_NO_HANDLER_FOR_PROTOCOL)throw e}return r.maxOutboundStreams??64}(s,this.components.registrar,t),a=tb(s,"outbound",u);if(a>=i){const e=new eo(`Too many outbound protocol streams for protocol "${s}" - ${a}/${i}`,qy.ERR_TOO_MANY_OUTBOUND_PROTOCOL_STREAMS);throw r.abort(e),e}return await this.components.peerStore.merge(o,{protocols:[s]}),r.source=n.source,r.sink=n.sink,r.protocol=s,null!=n.closeWrite&&(r.closeWrite=n.closeWrite),null!=n.closeRead&&(r.closeRead=n.closeRead),null!=n.close&&(r.close=n.close),this.components.metrics?.trackProtocolStream(r,u),r}catch(t){if(u.log.error("could not create new stream for protocols %s",e,t),null==r.timeline.close&&r.abort(t),null!=t.code)throw t;throw new eo(String(t),qy.ERR_UNSUPPORTED_PROTOCOL)}},Promise.all([c.sink(s.source),s.sink(c.source)]).catch((e=>{u.log.error("error piping data through muxer",e)})));const h=n.timeline;var d;return n.timeline=new Proxy(h,{set:(...e)=>(null!=u&&"close"===e[1]&&null!=e[2]&&null==h.close&&(async()=>{try{"open"===u.status&&await u.close()}catch(e){u.log.error("error closing connection after timeline close",e)}finally{this.events.safeDispatchEvent("connection:close",{detail:u})}})().catch((e=>{u.log.error("error thrown while dispatching connection:close event",e)})),Reflect.set(...e))}),n.timeline.upgraded=Date.now(),d={remoteAddr:n.remoteAddr,remotePeer:o,status:"open",direction:r,timeline:n.timeline,multiplexer:c?.protocol,encryption:t,transient:a,logger:this.components.logger,newStream:l??(()=>{throw new eo("connection is not multiplexed",qy.ERR_CONNECTION_NOT_MULTIPLEXED)}),getStreams:()=>null!=c?c.streams:[],close:async e=>{null!=c&&(u.log.trace("close muxer"),await c.close(e)),u.log.trace("close maconn"),await n.close(e),u.log.trace("closed maconn")},abort:e=>{n.abort(e),null!=c&&c.abort(e)}},u=new eb(d),this.events.safeDispatchEvent("connection:open",{detail:u}),u}_onStream(e){const{connection:t,stream:r,protocol:n}=e,{handler:s,options:o}=this.components.registrar.getHandler(n);if(t.transient&&!0!==o.runOnTransientConnection)throw new eo("Cannot open protocol stream on transient connection","ERR_TRANSIENT_CONNECTION");s({connection:t,stream:r})}async _encryptInbound(e){const t=Array.from(this.connectionEncryption.keys());e.log("handling inbound crypto protocol selection",t);try{const{stream:r,protocol:n}=await Xm(e,t,{log:e.log}),s=this.connectionEncryption.get(n);if(null==s)throw new Error(`no crypto module found for ${n}`);return e.log("encrypting inbound connection using",n),{...await s.secureInbound(this.components.peerId,r),protocol:n}}catch(t){throw e.log.error("encrypting inbound connection failed",t),new eo(t.message,qy.ERR_ENCRYPTION_FAILED)}}async _encryptOutbound(e,t){const r=Array.from(this.connectionEncryption.keys());e.log("selecting outbound crypto protocol",r);try{e.log.trace("selecting encrypter from %s",r);const{stream:n,protocol:s}=await Qm(e,r,{log:e.log,yieldBytes:!0}),o=this.connectionEncryption.get(s);if(null==o)throw new Error(`no crypto module found for ${s}`);return e.log("encrypting outbound connection to %p using %s",t,o),{...await o.secureOutbound(this.components.peerId,n,t),protocol:s}}catch(r){throw e.log.error("encrypting outbound connection to %p failed",t,r),new eo(r.message,qy.ERR_ENCRYPTION_FAILED)}}async _multiplexOutbound(e,t){const r=Array.from(t.keys());e.log("outbound selecting muxer %s",r);try{e.log.trace("selecting stream muxer from %s",r);const{stream:n,protocol:s}=await Qm(e,r,{log:e.log,yieldBytes:!0});return e.log("selected %s as muxer protocol",s),{stream:n,muxerFactory:t.get(s)}}catch(t){throw e.log.error("error multiplexing outbound connection",t),new eo(String(t),qy.ERR_MUXER_UNAVAILABLE)}}async _multiplexInbound(e,t){const r=Array.from(t.keys());e.log("inbound handling muxers %s",r);try{const{stream:n,protocol:s}=await Xm(e,r,{log:e.log});return{stream:n,muxerFactory:t.get(s)}}catch(t){throw e.log.error("error multiplexing inbound connection",t),new eo(String(t),qy.ERR_MUXER_UNAVAILABLE)}}}class nb extends Fs{peerId;peerStore;contentRouting;peerRouting;metrics;services;logger;status;components;log;constructor(e){super(),this.status="stopped";const t=new Fs,r=t.dispatchEvent.bind(t);t.dispatchEvent=e=>{const t=r(e),n=this.dispatchEvent(new $s(e.type,{detail:e.detail}));return t||n},this.peerId=e.peerId,this.logger=e.logger??gg(),this.log=this.logger.forComponent("libp2p"),this.services={};const n=this.components=function(e={}){const t=new my(e);return new Proxy(t,{get(e,r,n){if("string"==typeof r&&!wy.includes(r)){const e=t.components[r];if(null==e&&!by.includes(r))throw new eo(`${r} not set`,"ERR_SERVICE_MISSING");return e}return Reflect.get(e,r,n)},set:(e,r,n)=>("string"==typeof r?t.components[r]=n:Reflect.set(e,r,n),!0)})}({peerId:e.peerId,privateKey:e.privateKey,nodeInfo:e.nodeInfo??{name:"libp2p",version:"1.9.4"},logger:this.logger,events:t,datastore:e.datastore??new py,connectionGater:Ry(e.connectionGater),dns:e.dns});this.peerStore=this.configureComponent("peerStore",new iy(n,{addressFilter:this.components.connectionGater.filterMultiaddrForPeer,...e.peerStore})),null!=e.metrics&&(this.metrics=this.configureComponent("metrics",e.metrics(this.components))),n.events.addEventListener("peer:update",(e=>{if(null==e.detail.previous){const t={id:e.detail.peer.id,multiaddrs:e.detail.peer.addresses.map((e=>e.multiaddr))};n.events.safeDispatchEvent("peer:discovery",{detail:t})}})),null!=e.connectionProtector&&this.configureComponent("connectionProtector",e.connectionProtector(n)),this.components.upgrader=new rb(this.components,{connectionEncryption:(e.connectionEncryption??[]).map(((e,t)=>this.configureComponent(`connection-encryption-${t}`,e(this.components)))),muxers:(e.streamMuxers??[]).map(((e,t)=>this.configureComponent(`stream-muxers-${t}`,e(this.components)))),inboundUpgradeTimeout:e.connectionManager?.inboundUpgradeTimeout}),this.configureComponent("transportManager",new Km(this.components,e.transportManager)),this.configureComponent("connectionManager",new _m(this.components,e.connectionManager)),!1!==e.connectionMonitor?.enabled&&this.configureComponent("connectionMonitor",new Rm(this.components,e.connectionMonitor)),this.configureComponent("registrar",new Vm(this.components)),this.configureComponent("addressManager",new yy(this.components,e.addresses));const s=(e.peerRouters??[]).map(((e,t)=>this.configureComponent(`peer-router-${t}`,e(this.components))));this.peerRouting=this.components.peerRouting=this.configureComponent("peerRouting",new Hm(this.components,{routers:s}));const o=(e.contentRouters??[]).map(((e,t)=>this.configureComponent(`content-router-${t}`,e(this.components))));if(this.contentRouting=this.components.contentRouting=this.configureComponent("contentRouting",new Tm(this.components,{routers:o})),this.configureComponent("randomWalk",new qm(this.components)),(e.peerDiscovery??[]).forEach(((e,t)=>{this.configureComponent(`peer-discovery-${t}`,e(this.components)).addEventListener("peer",(e=>{this.#O(e)}))})),e.transports?.forEach(((e,t)=>{this.components.transportManager.add(this.configureComponent(`transport-${t}`,e(this.components)))})),null!=e.services)for(const t of Object.keys(e.services)){const r=(0,e.services[t])(this.components);null!=r?(this.services[t]=r,this.configureComponent(t,r),null!=r[rg]&&(this.log("registering service %s for content routing",t),o.push(r[rg])),null!=r[ng]&&(this.log("registering service %s for peer routing",t),s.push(r[ng])),null!=r[Sd]&&(this.log("registering service %s for peer discovery",t),r[Sd].addEventListener?.("peer",(e=>{this.#O(e)})))):this.log.error("service factory %s returned null or undefined instance",t)}!function(e){const t={};for(const r of Object.values(e.components))for(const e of vy(r))t[e]=!0;for(const r of Object.values(e.components))for(const e of Ey(r))if(!0!==t[e])throw new eo(`Service "${Sy(r)}" required capability "${e}" but it was not provided by any component, you may need to add additional configuration when creating your node.`,"ERR_UNMET_SERVICE_DEPENDENCIES")}(n)}configureComponent(e,t){return null==t&&this.log.error("component %s was null or undefined",e),this.components[e]=t,t}async start(){if("stopped"===this.status){this.status="starting",this.log("libp2p is starting");try{await(this.components.beforeStart?.()),await this.components.start(),await(this.components.afterStart?.()),this.status="started",this.safeDispatchEvent("start",{detail:this}),this.log("libp2p has started")}catch(e){throw this.log.error("An error occurred starting libp2p",e),this.status="started",await this.stop(),e}}}async stop(){"started"===this.status&&(this.log("libp2p is stopping"),this.status="stopping",await(this.components.beforeStop?.()),await this.components.stop(),await(this.components.afterStop?.()),this.status="stopped",this.safeDispatchEvent("stop",{detail:this}),this.log("libp2p has stopped"))}getConnections(e){return this.components.connectionManager.getConnections(e)}getDialQueue(){return this.components.connectionManager.getDialQueue()}getPeers(){const e=new mg;for(const t of this.components.connectionManager.getConnections())e.add(t.remotePeer);return Array.from(e)}async dial(e,t={}){return this.components.connectionManager.openConnection(e,{priority:75,...t})}async dialProtocol(e,t,r={}){if(null==t)throw new eo("no protocols were provided to open a stream",qy.ERR_INVALID_PROTOCOLS_FOR_STREAM);if(0===(t=Array.isArray(t)?t:[t]).length)throw new eo("no protocols were provided to open a stream",qy.ERR_INVALID_PROTOCOLS_FOR_STREAM);return(await this.dial(e,r)).newStream(t,r)}getMultiaddrs(){return this.components.addressManager.getAddresses()}getProtocols(){return this.components.registrar.getProtocols()}async hangUp(e,t={}){Uo(e)&&(e=rh(e.getPeerId()??"")),await this.components.connectionManager.closeConnections(e,t)}async getPublicKey(e,t={}){if(this.log("getPublicKey %p",e),null!=e.publicKey)return e.publicKey;try{const t=await this.peerStore.get(e);if(null!=t.id.publicKey)return t.id.publicKey}catch(e){if(e.code!==qy.ERR_NOT_FOUND)throw e}const r=xn([Nt("/pk/"),e.multihash.digest]),n=await this.contentRouting.get(r,t);return $u(n),await this.peerStore.patch(e,{publicKey:n}),n}async handle(e,t,r){Array.isArray(e)||(e=[e]),await Promise.all(e.map((async e=>{await this.components.registrar.handle(e,t,r)})))}async unhandle(e){Array.isArray(e)||(e=[e]),await Promise.all(e.map((async e=>{await this.components.registrar.unhandle(e)})))}async register(e,t){return this.components.registrar.register(e,t)}unregister(e){this.components.registrar.unregister(e)}async isDialable(e,t={}){return this.components.connectionManager.isDialable(e,t)}#O(e){const{detail:t}=e;t.id.toString()!==this.peerId.toString()?this.components.peerStore.merge(t.id,{multiaddrs:t.multiaddrs}).catch((e=>{this.log.error(e)})):this.log.error(new Error(qy.ERR_DISCOVERED_SELF))}}const sb={SANDBOX:"enrtree://AIRVQ5DDA4FFWLRBCHJWUWOO6X6S4ZTZ5B667LQ6AJU6PEYDLRD5O@sandbox.waku.nodes.status.im",TEST:"enrtree://AOGYWMBYOUIMOENHXCHILPKY3ZRFEULMFI4DOM442QSZ73TT2A7VI@test.waku.nodes.status.im"},ob="bootstrap",ib={store:1,filter:2,lightPush:2};var ab=__webpack_require__(495),cb=__webpack_require__.t(ab,2);const lb=BigInt(0),ub=BigInt(1),hb=BigInt(2),db=BigInt(3),pb=BigInt(8),fb=Object.freeze({a:lb,b:BigInt(7),P:BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),n:BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),h:ub,Gx:BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),Gy:BigInt("32670510020758816978083085130507043184471273380659243275938904335757337482424"),beta:BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee")}),gb=(e,t)=>(e+t/hb)/t,yb={beta:BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),splitScalar(e){const{n:t}=fb,r=BigInt("0x3086d221a7d46bcde86c90e49284eb15"),n=-ub*BigInt("0xe4437ed6010e88286f547fa90abfe4c3"),s=BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"),o=r,i=BigInt("0x100000000000000000000000000000000"),a=gb(o*e,t),c=gb(-n*e,t);let l=jb(e-a*r-c*s,t),u=jb(-a*n-c*o,t);const h=l>i,d=u>i;if(h&&(l=t-l),d&&(u=t-u),l>i||u>i)throw new Error("splitScalarEndo: Endomorphism failed, k="+e);return{k1neg:h,k1:l,k2neg:d,k2:u}}},mb=32,bb=32,wb=mb+1,vb=2*mb+1;function Eb(e){const{a:t,b:r}=fb,n=jb(e*e),s=jb(n*e);return jb(s+t*e+r)}const Sb=fb.a===lb;class Ab extends Error{constructor(e){super(e)}}function _b(e){if(!(e instanceof kb))throw new TypeError("JacobianPoint expected")}class kb{constructor(e,t,r){this.x=e,this.y=t,this.z=r}static fromAffine(e){if(!(e instanceof Tb))throw new TypeError("JacobianPoint#fromAffine: expected Point");return e.equals(Tb.ZERO)?kb.ZERO:new kb(e.x,e.y,ub)}static toAffineBatch(e){const t=function(e,t=fb.P){const r=new Array(e.length),n=zb(e.reduce(((e,n,s)=>n===lb?e:(r[s]=e,jb(e*n,t))),ub),t);return e.reduceRight(((e,n,s)=>n===lb?e:(r[s]=jb(e*r[s],t),jb(e*n,t))),n),r}(e.map((e=>e.z)));return e.map(((e,r)=>e.toAffine(t[r])))}static normalizeZ(e){return kb.toAffineBatch(e).map(kb.fromAffine)}equals(e){_b(e);const{x:t,y:r,z:n}=this,{x:s,y:o,z:i}=e,a=jb(n*n),c=jb(i*i),l=jb(t*c),u=jb(s*a),h=jb(jb(r*i)*c),d=jb(jb(o*n)*a);return l===u&&h===d}negate(){return new kb(this.x,jb(-this.y),this.z)}double(){const{x:e,y:t,z:r}=this,n=jb(e*e),s=jb(t*t),o=jb(s*s),i=e+s,a=jb(hb*(jb(i*i)-n-o)),c=jb(db*n),l=jb(c*c),u=jb(l-hb*a),h=jb(c*(a-u)-pb*o),d=jb(hb*t*r);return new kb(u,h,d)}add(e){_b(e);const{x:t,y:r,z:n}=this,{x:s,y:o,z:i}=e;if(s===lb||o===lb)return this;if(t===lb||r===lb)return e;const a=jb(n*n),c=jb(i*i),l=jb(t*c),u=jb(s*a),h=jb(jb(r*i)*c),d=jb(jb(o*n)*a),p=jb(u-l),f=jb(d-h);if(p===lb)return f===lb?this.double():kb.ZERO;const g=jb(p*p),y=jb(p*g),m=jb(l*g),b=jb(f*f-y-hb*m),w=jb(f*(m-b)-h*y),v=jb(n*i*p);return new kb(b,w,v)}subtract(e){return this.add(e.negate())}multiplyUnsafe(e){const t=kb.ZERO;if("bigint"==typeof e&&e===lb)return t;let r=Vb(e);if(r===ub)return this;if(!Sb){let e=t,n=this;for(;r>lb;)r&ub&&(e=e.add(n)),n=n.double(),r>>=ub;return e}let{k1neg:n,k1:s,k2neg:o,k2:i}=yb.splitScalar(r),a=t,c=t,l=this;for(;s>lb||i>lb;)s&ub&&(a=a.add(l)),i&ub&&(c=c.add(l)),l=l.double(),s>>=ub,i>>=ub;return n&&(a=a.negate()),o&&(c=c.negate()),c=new kb(jb(c.x*yb.beta),c.y,c.z),a.add(c)}precomputeWindow(e){const t=Sb?128/e+1:256/e+1,r=[];let n=this,s=n;for(let o=0;o>=u,i>a&&(i-=l,e+=ub);const h=r,d=r+Math.abs(i)-1,p=t%2!=0,f=i<0;0===i?o=o.add(Ib(p,n[h])):s=s.add(Ib(f,n[d]))}return{p:s,f:o}}multiply(e,t){let r,n,s=Vb(e);if(Sb){const{k1neg:e,k1:o,k2neg:i,k2:a}=yb.splitScalar(s);let{p:c,f:l}=this.wNAF(o,t),{p:u,f:h}=this.wNAF(a,t);c=Ib(e,c),u=Ib(i,u),u=new kb(jb(u.x*yb.beta),u.y,u.z),r=c.add(u),n=l.add(h)}else{const{p:e,f:o}=this.wNAF(s,t);r=e,n=o}return kb.normalizeZ([r,n])[0]}toAffine(e){const{x:t,y:r,z:n}=this,s=this.equals(kb.ZERO);null==e&&(e=s?pb:zb(n));const o=e,i=jb(o*o),a=jb(i*o),c=jb(t*i),l=jb(r*a),u=jb(n*o);if(s)return Tb.ZERO;if(u!==ub)throw new Error("invZ was invalid");return new Tb(c,l)}}function Ib(e,t){const r=t.negate();return e?r:t}kb.BASE=new kb(fb.Gx,fb.Gy,ub),kb.ZERO=new kb(lb,ub,lb);const Rb=new WeakMap;class Tb{constructor(e,t){this.x=e,this.y=t}_setWindowSize(e){this._WINDOW_SIZE=e,Rb.delete(this)}hasEvenY(){return this.y%hb===lb}static fromCompressedHex(e){const t=32===e.length,r=Hb(t?e:e.subarray(1));if(!Qb(r))throw new Error("Point is not on curve");let n=function(e){const{P:t}=fb,r=BigInt(6),n=BigInt(11),s=BigInt(22),o=BigInt(23),i=BigInt(44),a=BigInt(88),c=e*e*e%t,l=c*c*e%t,u=Kb(l,db)*l%t,h=Kb(u,db)*l%t,d=Kb(h,hb)*c%t,p=Kb(d,n)*d%t,f=Kb(p,s)*p%t,g=Kb(f,i)*f%t,y=Kb(g,a)*g%t,m=Kb(y,i)*f%t,b=Kb(m,db)*l%t,w=Kb(b,o)*p%t,v=Kb(w,r)*c%t,E=Kb(v,hb);if(E*E%t!==e)throw new Error("Cannot find square root");return E}(Eb(r));const s=(n&ub)===ub;t?s&&(n=jb(-n)):!(1&~e[0])!==s&&(n=jb(-n));const o=new Tb(r,n);return o.assertValidity(),o}static fromUncompressedHex(e){const t=Hb(e.subarray(1,mb+1)),r=Hb(e.subarray(mb+1,2*mb+1)),n=new Tb(t,r);return n.assertValidity(),n}static fromHex(e){const t=qb(e),r=t.length,n=t[0];if(r===mb)return this.fromCompressedHex(t);if(r===wb&&(2===n||3===n))return this.fromCompressedHex(t);if(r===vb&&4===n)return this.fromUncompressedHex(t);throw new Error(`Point.fromHex: received invalid point. Expected 32-${wb} compressed bytes or ${vb} uncompressed bytes, not ${r}`)}static fromPrivateKey(e){return Tb.BASE.multiply(ew(e))}static fromSignature(e,t,r){const{r:n,s}=tw(t);if(![0,1,2,3].includes(r))throw new Error("Cannot recover: invalid recovery bit");const o=Gb(qb(e)),{n:i}=fb,a=2===r||3===r?n+i:n,c=zb(a,i),l=jb(-o*c,i),u=jb(s*c,i),h=1&r?"03":"02",d=Tb.fromHex(h+Bb(a)),p=Tb.BASE.multiplyAndAddUnsafe(d,l,u);if(!p)throw new Error("Cannot recover signature: point at infinify");return p.assertValidity(),p}toRawBytes(e=!1){return $b(this.toHex(e))}toHex(e=!1){const t=Bb(this.x);return e?`${this.hasEvenY()?"02":"03"}${t}`:`04${t}${Bb(this.y)}`}toHexX(){return this.toHex(!0).slice(2)}toRawX(){return this.toRawBytes(!0).slice(1)}assertValidity(){const e="Point is not on elliptic curve",{x:t,y:r}=this;if(!Qb(t)||!Qb(r))throw new Error(e);const n=jb(r*r);if(jb(n-Eb(t))!==lb)throw new Error(e)}equals(e){return this.x===e.x&&this.y===e.y}negate(){return new Tb(this.x,jb(-this.y))}double(){return kb.fromAffine(this).double().toAffine()}add(e){return kb.fromAffine(this).add(kb.fromAffine(e)).toAffine()}subtract(e){return this.add(e.negate())}multiply(e){return kb.fromAffine(this).multiply(e,this).toAffine()}multiplyAndAddUnsafe(e,t,r){const n=kb.fromAffine(this),s=t===lb||t===ub||this!==Tb.BASE?n.multiplyUnsafe(t):n.multiply(t),o=kb.fromAffine(e).multiplyUnsafe(r),i=s.add(o);return i.equals(kb.ZERO)?void 0:i.toAffine()}}function Cb(e){return Number.parseInt(e[0],16)>=8?"00"+e:e}function Nb(e){if(e.length<2||2!==e[0])throw new Error(`Invalid signature integer tag: ${Db(e)}`);const t=e[1],r=e.subarray(2,t+2);if(!t||r.length!==t)throw new Error("Invalid signature integer: wrong length");if(0===r[0]&&r[1]<=127)throw new Error("Invalid signature integer: trailing length");return{data:Hb(r),left:e.subarray(t+2)}}Tb.BASE=new Tb(fb.Gx,fb.Gy),Tb.ZERO=new Tb(lb,lb);class xb{constructor(e,t){this.r=e,this.s=t,this.assertValidity()}static fromCompact(e){const t=e instanceof Uint8Array,r="Signature.fromCompact";if("string"!=typeof e&&!t)throw new TypeError(`${r}: Expected string or Uint8Array`);const n=t?Db(e):e;if(128!==n.length)throw new Error(`${r}: Expected 64-byte hex`);return new xb(Fb(n.slice(0,64)),Fb(n.slice(64,128)))}static fromDER(e){const t=e instanceof Uint8Array;if("string"!=typeof e&&!t)throw new TypeError("Signature.fromDER: Expected string or Uint8Array");const{r,s:n}=function(e){if(e.length<2||48!=e[0])throw new Error(`Invalid signature tag: ${Db(e)}`);if(e[1]!==e.length-2)throw new Error("Invalid signature: incorrect length");const{data:t,left:r}=Nb(e.subarray(2)),{data:n,left:s}=Nb(r);if(s.length)throw new Error(`Invalid signature: left bytes after parsing: ${Db(s)}`);return{r:t,s:n}}(t?e:$b(e));return new xb(r,n)}static fromHex(e){return this.fromDER(e)}assertValidity(){const{r:e,s:t}=this;if(!Xb(e))throw new Error("Invalid Signature: r must be 0 < r < n");if(!Xb(t))throw new Error("Invalid Signature: s must be 0 < s < n")}hasHighS(){const e=fb.n>>ub;return this.s>e}normalizeS(){return this.hasHighS()?new xb(this.r,jb(-this.s,fb.n)):this}toDERRawBytes(){return $b(this.toDERHex())}toDERHex(){const e=Cb(Mb(this.s)),t=Cb(Mb(this.r)),r=e.length/2,n=t.length/2,s=Mb(r),o=Mb(n);return`30${Mb(n+r+4)}02${o}${t}02${s}${e}`}toRawBytes(){return this.toDERRawBytes()}toHex(){return this.toDERHex()}toCompactRawBytes(){return $b(this.toCompactHex())}toCompactHex(){return Bb(this.r)+Bb(this.s)}}function Pb(...e){if(!e.every((e=>e instanceof Uint8Array)))throw new Error("Uint8Array list expected");if(1===e.length)return e[0];const t=e.reduce(((e,t)=>e+t.length),0),r=new Uint8Array(t);for(let t=0,n=0;tt.toString(16).padStart(2,"0")));function Db(e){if(!(e instanceof Uint8Array))throw new Error("Expected Uint8Array");let t="";for(let r=0;r0)return BigInt(e);if("bigint"==typeof e&&Xb(e))return e;throw new TypeError("Expected valid private scalar: 0 < scalar < curve.n")}function jb(e,t=fb.P){const r=e%t;return r>=lb?r:t+r}function Kb(e,t){const{P:r}=fb;let n=e;for(;t-- >lb;)n*=n,n%=r;return n}function zb(e,t=fb.P){if(e===lb||t<=lb)throw new Error(`invert: expected positive integers, got n=${e} mod=${t}`);let r=jb(e,t),n=t,s=lb,o=ub,i=ub,a=lb;for(;r!==lb;){const e=n/r,t=n%r,c=s-i*e,l=o-a*e;n=r,r=t,s=i,o=a,i=c,a=l}if(n!==ub)throw new Error("invert: does not exist");return jb(s,t)}function Gb(e,t=!1){const r=function(e){const t=8*e.length-8*bb,r=Hb(e);return t>0?r>>BigInt(t):r}(e);if(t)return r;const{n}=fb;return r>=n?r-n:r}let Wb,Yb;class Jb{constructor(e,t){if(this.hashLen=e,this.qByteLen=t,"number"!=typeof e||e<2)throw new Error("hashLen must be a number");if("number"!=typeof t||t<2)throw new Error("qByteLen must be a number");this.v=new Uint8Array(e).fill(1),this.k=new Uint8Array(e).fill(0),this.counter=0}hmac(...e){return cw.hmacSha256(this.k,...e)}hmacSync(...e){return Yb(this.k,...e)}checkSync(){if("function"!=typeof Yb)throw new Ab("hmacSha256Sync needs to be set")}incr(){if(this.counter>=1e3)throw new Error("Tried 1,000 k values for sign(), all were invalid");this.counter+=1}async reseed(e=new Uint8Array){this.k=await this.hmac(this.v,Uint8Array.from([0]),e),this.v=await this.hmac(this.v),0!==e.length&&(this.k=await this.hmac(this.v,Uint8Array.from([1]),e),this.v=await this.hmac(this.v))}reseedSync(e=new Uint8Array){this.checkSync(),this.k=this.hmacSync(this.v,Uint8Array.from([0]),e),this.v=this.hmacSync(this.v),0!==e.length&&(this.k=this.hmacSync(this.v,Uint8Array.from([1]),e),this.v=this.hmacSync(this.v))}async generate(){this.incr();let e=0;const t=[];for(;e0)t=BigInt(e);else if("string"==typeof e){if(e.length!==2*bb)throw new Error("Expected 32 bytes of private key");t=Fb(e)}else{if(!(e instanceof Uint8Array))throw new TypeError("Expected valid private key");if(e.length!==bb)throw new Error("Expected 32 bytes of private key");t=Hb(e)}if(!Xb(t))throw new Error("Expected private key: 0 < key < n");return t}function tw(e){if(e instanceof xb)return e.assertValidity(),e;try{return xb.fromDER(e)}catch(t){return xb.fromCompact(e)}}function rw(e){return Hb(e.length>mb?e.slice(0,mb):e)}function nw(e){const t=rw(e),r=jb(t,fb.n);return sw(r{e=qb(e);const t=bb+8;if(e.length1024)throw new Error("Expected valid bytes of private key as per FIPS 186");return Ub(jb(Hb(e),fb.n-ub)+ub)},randomBytes:(e=32)=>{if(iw.web)return iw.web.getRandomValues(new Uint8Array(e));if(iw.node){const{randomBytes:t}=iw.node;return Uint8Array.from(t(e))}throw new Error("The environment doesn't have randomBytes function")},randomPrivateKey:()=>cw.hashToPrivateKey(cw.randomBytes(bb+8)),precompute(e=8,t=Tb.BASE){const r=t===Tb.BASE?t:new Tb(t.x,t.y);return r._setWindowSize(e),r.multiply(db),r},sha256:async(...e)=>{if(iw.web){const t=await iw.web.subtle.digest("SHA-256",Pb(...e));return new Uint8Array(t)}if(iw.node){const{createHash:t}=iw.node,r=t("sha256");return e.forEach((e=>r.update(e))),Uint8Array.from(r.digest())}throw new Error("The environment doesn't have sha256 function")},hmacSha256:async(e,...t)=>{if(iw.web){const r=await iw.web.subtle.importKey("raw",e,{name:"HMAC",hash:{name:"SHA-256"}},!1,["sign"]),n=Pb(...t),s=await iw.web.subtle.sign("HMAC",r,n);return new Uint8Array(s)}if(iw.node){const{createHmac:r}=iw.node,n=r("sha256",e);return t.forEach((e=>n.update(e))),Uint8Array.from(n.digest())}throw new Error("The environment doesn't have hmac-sha256 function")},sha256Sync:void 0,hmacSha256Sync:void 0,taggedHash:async(e,...t)=>{let r=aw[e];if(void 0===r){const t=await cw.sha256(Uint8Array.from(e,(e=>e.charCodeAt(0))));r=Pb(t,t),aw[e]=r}return cw.sha256(r,...t)},taggedHashSync:(e,...t)=>{if("function"!=typeof Wb)throw new Ab("sha256Sync is undefined, you need to set it");let r=aw[e];if(void 0===r){const t=Wb(Uint8Array.from(e,(e=>e.charCodeAt(0))));r=Pb(t,t),aw[e]=r}return Wb(r,...t)},_JacobianPoint:kb};Object.defineProperties(cw,{sha256Sync:{configurable:!1,get:()=>Wb,set(e){Wb||(Wb=e)}},hmacSha256Sync:{configurable:!1,get:()=>Yb,set(e){Yb||(Yb=e)}}});var lw=__webpack_require__(1176);function uw(e){return new Uint8Array(lw.keccak256.arrayBuffer(e))}function hw(e,t,r){try{return function(e,t,r,n=ow){let s;try{s=tw(e),t=qb(t)}catch(e){return!1}const{r:o,s:i}=s;if(n.strict&&s.hasHighS())return!1;const a=Gb(t);let c;try{c=function(e){return e instanceof Tb?(e.assertValidity(),e):Tb.fromHex(e)}(r)}catch(e){return!1}const{n:l}=fb,u=zb(i,l),h=jb(a*u,l),d=jb(o*u,l),p=Tb.BASE.multiplyAndAddUnsafe(c,h,d);return!!p&&jb(p.x,l)===o}(xb.fromCompact(e.slice(0,64)),t,r)}catch{return!1}}const dw="Invalid record id";function pw(e,t){switch(t){case"udp":return pw(e,"udp4")||pw(e,"udp6");case"tcp":return pw(e,"tcp4")||pw(e,"tcp6")}const r=t.endsWith("6"),n=e.get(r?"ip6":"ip");if(!n)return;const s=t.slice(0,3);let o;switch(s){case"udp":o=r?e.get("udp6"):e.get("udp");break;case"tcp":o=r?e.get("tcp6"):e.get("tcp");break;default:return}return o?function(e,t,r,n){let s=Mo("/"+e+"/"+bo(e,r));return s=s.encapsulate(Mo("/"+t+"/"+bo(t,n))),s}(r?"ip6":"ip4",s,n,o):void 0}function fw(e){const t=e.reduce(((e,t)=>e+2+t.bytes.length),0),r=new Uint8Array(t),n=new DataView(r.buffer);let s=0;return e.forEach((e=>{if(e.getPeerId())throw new Error("`multiaddr` field MUST not contain peer id");n.setUint16(s,e.bytes.length),s+=2,r.set(e.bytes,s),s+=e.bytes.length})),r}function gw(e){let t=0;return e.lightPush&&(t+=1),t<<=1,e.filter&&(t+=1),t<<=1,e.store&&(t+=1),t<<=1,e.relay&&(t+=1),t}class yw extends Map{seq;signature;constructor(e={},t=BigInt(1),r){super(Object.entries(e)),this.seq=t,this.signature=r}set(e,t){return this.signature=void 0,this.seq++,super.set(e,t)}get id(){const e=this.get("id");if(!e)throw new Error("id not found.");return cn(e)}get publicKey(){if("v4"===this.id)return this.get("secp256k1");throw new Error(dw)}get rs(){const e=this.get("rs");if(e)return bn(e)}get rsv(){const e=this.get("rsv");if(e)return bn(e)}get ip(){return mw(this,"ip","ip4")}set ip(e){ww(this,"ip","ip4",e)}get tcp(){return bw(this,"tcp","tcp")}set tcp(e){vw(this,"tcp","tcp",e)}get udp(){return bw(this,"udp","udp")}set udp(e){vw(this,"udp","udp",e)}get ip6(){return mw(this,"ip6","ip6")}set ip6(e){ww(this,"ip6","ip6",e)}get tcp6(){return bw(this,"tcp6","tcp")}set tcp6(e){vw(this,"tcp6","tcp",e)}get udp6(){return bw(this,"udp6","udp")}set udp6(e){vw(this,"udp6","udp",e)}get multiaddrs(){const e=this.get("multiaddrs");if(e)return function(e){const t=[];let r=0;for(;r>=1)%2&&(t.store=!0),(e>>=1)%2&&(t.filter=!0),(e>>=1)%2&&(t.lightPush=!0),t}(e[0])}set waku2(e){Ew(this,"waku2",e,(e=>new Uint8Array([gw(e)])))}}function mw(e,t,r){const n=e.get(t);if(n)return bo(r,n)}function bw(e,t,r){const n=e.get(t);if(n)return Number(bo(r,n))}function ww(e,t,r,n){Ew(e,t,n,wo.bind({},r))}function vw(e,t,r,n){ww(e,t,r,n?.toString(10))}function Ew(e,t,r,n){void 0!==r?e.set(t,n(r)):e.delete(t)}async function Sw(e,t){return async function(e,t,r={}){const{seed:n,m:s,d:o}=function(e,t,r){if(null==e)throw new Error(`sign: expected valid message hash, not "${e}"`);const n=qb(e),s=ew(t),o=[sw(s),nw(n)];if(null!=r){!0===r&&(r=cw.randomBytes(mb));const e=qb(r);if(e.length!==mb)throw new Error(`sign: Expected ${mb} bytes of extra data`);o.push(e)}return{seed:Pb(...o),m:rw(n),d:s}}(e,t,r.extraEntropy),i=new Jb(32,bb);let a;for(await i.reseed(n);!(a=Zb(await i.generate(),s,o,r.canonical));)await i.reseed();return function(e,t){const{sig:r,recovery:n}=e,{der:s,recovered:o}=Object.assign({canonical:!0,der:!0},t),i=s?r.toDERRawBytes():r.toCompactRawBytes();return o?[i,n]:i}(a,r)}(uw(t),e,{der:!1})}const Aw=new An("enr");var _w,kw;!function(e){e.TCP="tcp",e.UDP="udp"}(_w||(_w={})),function(e){e.TCP4="tcp4",e.UDP4="udp4",e.TCP6="tcp6",e.UDP6="udp6"}(kw||(kw={}));class Iw extends yw{static RECORD_PREFIX="enr:";peerId;static async create(e={},t=BigInt(1),r){const n=new Iw(e,t,r);try{const e=n.publicKey;e&&(n.peerId=await function(e){return sh(new Uu.secp256k1.Secp256k1PublicKey(e).bytes,void 0)}(e))}catch(e){Aw.error("Could not calculate peer id for ENR",e)}return n}get nodeId(){if("v4"===this.id)return this.publicKey?function(e){const t=Tb.fromHex(e).toRawBytes(!1);return an(uw(t.slice(1)))}(this.publicKey):void 0;throw new Error(dw)}getLocationMultiaddr=pw.bind({},this);get shardInfo(){return this.rs&&this.rsv&&Aw.warn("ENR contains both `rs` and `rsv` fields."),this.rs||this.rsv}setLocationMultiaddr(e){const t=e.protoNames();if(2!==t.length&&"udp"!==t[1]&&"tcp"!==t[1])throw new Error("Invalid multiaddr");const r=e.tuples();if(!r[0][1]||!r[1][1])throw new Error("Invalid multiaddr");4===r[0][0]?(this.set("ip",r[0][1]),this.set(t[1],r[1][1])):(this.set("ip6",r[0][1]),this.set(t[1]+"6",r[1][1]))}getAllLocationMultiaddrs(){const e=[];for(const t of Object.values(kw)){const r=this.getLocationMultiaddr(t);r&&e.push(r)}const t=this.multiaddrs??[];return e.concat(t).map((e=>this.peerId?e.encapsulate(`/p2p/${this.peerId.toString()}`):e))}get peerInfo(){const e=this.peerId;if(e)return{id:e,multiaddrs:this.getAllLocationMultiaddrs()}}getFullMultiaddr(e){if(this.peerId){const t=this.getLocationMultiaddr(e);if(t)return t.encapsulate(`/p2p/${this.peerId.toString()}`)}}getFullMultiaddrs(){if(this.peerId&&this.multiaddrs){const e=this.peerId;return this.multiaddrs.map((t=>t.encapsulate(`/p2p/${e.toString()}`)))}return[]}verify(e,t){if(!this.get("id")||"v4"!==this.id)throw new Error(dw);if(!this.publicKey)throw new Error("Failed to verify ENR: No public key");return hw(t,uw(e),this.publicKey)}async sign(e,t){if("v4"!==this.id)throw new Error(dw);return this.signature=await Sw(t,e),this.signature}}let Rw=!1,Tw=!1;const Cw={debug:1,default:2,info:2,warning:3,error:4,off:5};let Nw=Cw.default,xw=null;const Pw=function(){try{const e=[];if(["NFD","NFC","NFKD","NFKC"].forEach((t=>{try{if("test"!=="test".normalize(t))throw new Error("bad normalize")}catch(r){e.push(t)}})),e.length)throw new Error("missing "+e.join(", "));if(String.fromCharCode(233).normalize("NFD")!==String.fromCharCode(101,769))throw new Error("broken implementation")}catch(e){return e.message}return null}();var Ow,Dw;!function(e){e.DEBUG="DEBUG",e.INFO="INFO",e.WARNING="WARNING",e.ERROR="ERROR",e.OFF="OFF"}(Ow||(Ow={})),function(e){e.UNKNOWN_ERROR="UNKNOWN_ERROR",e.NOT_IMPLEMENTED="NOT_IMPLEMENTED",e.UNSUPPORTED_OPERATION="UNSUPPORTED_OPERATION",e.NETWORK_ERROR="NETWORK_ERROR",e.SERVER_ERROR="SERVER_ERROR",e.TIMEOUT="TIMEOUT",e.BUFFER_OVERRUN="BUFFER_OVERRUN",e.NUMERIC_FAULT="NUMERIC_FAULT",e.MISSING_NEW="MISSING_NEW",e.INVALID_ARGUMENT="INVALID_ARGUMENT",e.MISSING_ARGUMENT="MISSING_ARGUMENT",e.UNEXPECTED_ARGUMENT="UNEXPECTED_ARGUMENT",e.CALL_EXCEPTION="CALL_EXCEPTION",e.INSUFFICIENT_FUNDS="INSUFFICIENT_FUNDS",e.NONCE_EXPIRED="NONCE_EXPIRED",e.REPLACEMENT_UNDERPRICED="REPLACEMENT_UNDERPRICED",e.UNPREDICTABLE_GAS_LIMIT="UNPREDICTABLE_GAS_LIMIT",e.TRANSACTION_REPLACED="TRANSACTION_REPLACED",e.ACTION_REJECTED="ACTION_REJECTED"}(Dw||(Dw={}));const Lw="0123456789abcdef";class Bw{constructor(e){Object.defineProperty(this,"version",{enumerable:!0,value:e,writable:!1})}_log(e,t){const r=e.toLowerCase();null==Cw[r]&&this.throwArgumentError("invalid log level name","logLevel",e),Nw>Cw[r]||console.log.apply(console,t)}debug(...e){this._log(Bw.levels.DEBUG,e)}info(...e){this._log(Bw.levels.INFO,e)}warn(...e){this._log(Bw.levels.WARNING,e)}makeError(e,t,r){if(Tw)return this.makeError("censored error",t,{});t||(t=Bw.errors.UNKNOWN_ERROR),r||(r={});const n=[];Object.keys(r).forEach((e=>{const t=r[e];try{if(t instanceof Uint8Array){let r="";for(let e=0;e>4],r+=Lw[15&t[e]];n.push(e+"=Uint8Array(0x"+r+")")}else n.push(e+"="+JSON.stringify(t))}catch(t){n.push(e+"="+JSON.stringify(r[e].toString()))}})),n.push(`code=${t}`),n.push(`version=${this.version}`);const s=e;let o="";switch(t){case Dw.NUMERIC_FAULT:{o="NUMERIC_FAULT";const t=e;switch(t){case"overflow":case"underflow":case"division-by-zero":o+="-"+t;break;case"negative-power":case"negative-width":o+="-unsupported";break;case"unbound-bitwise-result":o+="-unbound-result"}break}case Dw.CALL_EXCEPTION:case Dw.INSUFFICIENT_FUNDS:case Dw.MISSING_NEW:case Dw.NONCE_EXPIRED:case Dw.REPLACEMENT_UNDERPRICED:case Dw.TRANSACTION_REPLACED:case Dw.UNPREDICTABLE_GAS_LIMIT:o=t}o&&(e+=" [ See: https://links.ethers.org/v5-errors-"+o+" ]"),n.length&&(e+=" ("+n.join(", ")+")");const i=new Error(e);return i.reason=s,i.code=t,Object.keys(r).forEach((function(e){i[e]=r[e]})),i}throwError(e,t,r){throw this.makeError(e,t,r)}throwArgumentError(e,t,r){return this.throwError(e,Bw.errors.INVALID_ARGUMENT,{argument:t,value:r})}assert(e,t,r,n){e||this.throwError(t,r,n)}assertArgument(e,t,r,n){e||this.throwArgumentError(t,r,n)}checkNormalize(e){null==e&&(e="platform missing String.prototype.normalize"),Pw&&this.throwError("platform missing String.prototype.normalize",Bw.errors.UNSUPPORTED_OPERATION,{operation:"String.prototype.normalize",form:Pw})}checkSafeUint53(e,t){"number"==typeof e&&(null==t&&(t="value not safe"),(e<0||e>=9007199254740991)&&this.throwError(t,Bw.errors.NUMERIC_FAULT,{operation:"checkSafeInteger",fault:"out-of-safe-range",value:e}),e%1&&this.throwError(t,Bw.errors.NUMERIC_FAULT,{operation:"checkSafeInteger",fault:"non-integer",value:e}))}checkArgumentCount(e,t,r){r=r?": "+r:"",et&&this.throwError("too many arguments"+r,Bw.errors.UNEXPECTED_ARGUMENT,{count:e,expectedCount:t})}checkNew(e,t){e!==Object&&null!=e||this.throwError("missing new",Bw.errors.MISSING_NEW,{name:t.name})}checkAbstract(e,t){e===t?this.throwError("cannot instantiate abstract class "+JSON.stringify(t.name)+" directly; use a sub-class",Bw.errors.UNSUPPORTED_OPERATION,{name:e.name,operation:"new"}):e!==Object&&null!=e||this.throwError("missing new",Bw.errors.MISSING_NEW,{name:t.name})}static globalLogger(){return xw||(xw=new Bw("logger/5.7.0")),xw}static setCensorship(e,t){if(!e&&t&&this.globalLogger().throwError("cannot permanently disable censorship",Bw.errors.UNSUPPORTED_OPERATION,{operation:"setCensorship"}),Rw){if(!e)return;this.globalLogger().throwError("error censorship permanent",Bw.errors.UNSUPPORTED_OPERATION,{operation:"setCensorship"})}Tw=!!e,Rw=!!t}static setLogLevel(e){const t=Cw[e.toLowerCase()];null!=t?Nw=t:Bw.globalLogger().warn("invalid log level - "+e)}static from(e){return new Bw(e)}}Bw.errors=Dw,Bw.levels=Ow;const Uw=new Bw("bytes/5.7.0");function Mw(e){return!!e.toHexString}function Fw(e){return e.slice||(e.slice=function(){const t=Array.prototype.slice.call(arguments);return Fw(new Uint8Array(Array.prototype.slice.apply(e,t)))}),e}function $w(e){return"number"==typeof e&&e==e&&e%1==0}function Hw(e){if(null==e)return!1;if(e.constructor===Uint8Array)return!0;if("string"==typeof e)return!1;if(!$w(e.length)||e.length<0)return!1;for(let t=0;t=256)return!1}return!0}function qw(e,t){if(t||(t={}),"number"==typeof e){Uw.checkSafeUint53(e,"invalid arrayify value");const t=[];for(;e;)t.unshift(255&e),e=parseInt(String(e/256));return 0===t.length&&t.push(0),Fw(new Uint8Array(t))}if(t.allowMissingPrefix&&"string"==typeof e&&"0x"!==e.substring(0,2)&&(e="0x"+e),Mw(e)&&(e=e.toHexString()),Vw(e)){let r=e.substring(2);r.length%2&&("left"===t.hexPad?r="0"+r:"right"===t.hexPad?r+="0":Uw.throwArgumentError("hex data is odd-length","value",e));const n=[];for(let e=0;e>4]+jw[15&n]}return t}return Uw.throwArgumentError("invalid hexlify value","value",e)}const zw=new Bw("rlp/5.7.0");function Gw(e){const t=[];for(;e;)t.unshift(255&e),e>>=8;return t}function Ww(e,t,r){let n=0;for(let s=0;st+1+n&&zw.throwError("child data too short",Bw.errors.BUFFER_OVERRUN,{})}return{consumed:1+n,result:s}}function Xw(e,t){if(0===e.length&&zw.throwError("data too short",Bw.errors.BUFFER_OVERRUN,{}),e[t]>=248){const r=e[t]-247;t+1+r>e.length&&zw.throwError("data short segment too short",Bw.errors.BUFFER_OVERRUN,{});const n=Ww(e,t+1,r);return t+1+r+n>e.length&&zw.throwError("data long segment too short",Bw.errors.BUFFER_OVERRUN,{}),Jw(e,t,t+1+r,r+n)}if(e[t]>=192){const r=e[t]-192;return t+1+r>e.length&&zw.throwError("data array too short",Bw.errors.BUFFER_OVERRUN,{}),Jw(e,t,t+1,r)}if(e[t]>=184){const r=e[t]-183;t+1+r>e.length&&zw.throwError("data array too short",Bw.errors.BUFFER_OVERRUN,{});const n=Ww(e,t+1,r);return t+1+r+n>e.length&&zw.throwError("data array too short",Bw.errors.BUFFER_OVERRUN,{}),{consumed:1+r+n,result:Kw(e.slice(t+1+r,t+1+r+n))}}if(e[t]>=128){const r=e[t]-128;return t+1+r>e.length&&zw.throwError("data too short",Bw.errors.BUFFER_OVERRUN,{}),{consumed:1+r,result:Kw(e.slice(t+1,t+1+r))}}return{consumed:1,result:Kw(e[t])}}const Qw=new An("enr:decoder");class Zw{static fromString(e){if(!e.startsWith(Iw.RECORD_PREFIX))throw new Error(`"string encoded ENR must start with '${Iw.RECORD_PREFIX}'`);return Zw.fromRLP(Nt(e.slice(4),"base64url"))}static fromRLP(e){const t=function(e){const t=qw(e),r=Xw(t,0);return r.consumed!==t.length&&zw.throwArgumentError("invalid rlp data","data",e),r.result}(e).map(on);return async function(e){const{signature:t,seq:r,kvs:n}=function(e){if(!Array.isArray(e))throw new Error("Decoded ENR must be an array");if(e.length%2!=0)throw new Error("Decoded ENR must have an even number of elements");const[t,r,...n]=e;if(!t||Array.isArray(t))throw new Error("Decoded ENR invalid signature: must be a byte array");if(!r||Array.isArray(r))throw new Error("Decoded ENR invalid sequence number: must be a byte array");return{signature:t,seq:r,kvs:n}}(e),s={};for(let e=0;eev.test(e),encode(e,t,r){r=~~r,t=t||new Uint8Array(r+4);const n=e.length;let s=0;for(let o=0;o(t=~~t,`${e[t++]}.${e[t++]}.${e[t++]}.${e[t]}`)},nv={name:"v6",size:16,isFormat:e=>e.length>0&&tv.test(e),encode(e,t,r){let n=16+(r=~~r),s=-1,o=0,i=0,a=!0,c=!1;t=t||new Uint8Array(r+16);for(let l=0;l>8),r=97?u-=87:u>=65?u-=55:(u-=48,i=10*i+u),o=(o<<4)+u)}if(!1===a)!0===c?(r>8),r=s+2;e--)t[e]=t[e-2];t[s]=0,t[s+1]=0,s=r}if(s!==r&&-1!==s)for(r>n-2&&(r=n-2);n>s;)t[--n]=rs?t[--r]:0;else for(;r=pv||(64512&e.charCodeAt(o))!==pv?t+=3:(n=o,t+=4)}}return t}function gv(e,t,r){const n=e.length;null==r&&(r=0),void 0===t&&(t=new Uint8Array(fv(e)+r));let s=r;for(let r=0;r>6,t[s++]=128|63&o;else if((63488&o)!==dv)t[s++]=224|(61440&o)>>12,t[s++]=128|(4032&o)>>6,t[s++]=128|63&o;else{const i=r+1;if(i===n||o>=pv)t[s++]=239,t[s++]=191,t[s++]=189;else{const n=e.charCodeAt(i);(64512&n)!==pv?(t[s++]=239,t[s++]=191,t[s++]=189):(r=i,o=65536|(1023&o)<<10|1023&n,t[s++]=240|(1835008&o)>>18,t[s++]=128|(258048&o)>>12,t[s++]=128|(4032&o)>>6,t[s++]=128|63&o)}}}return gv.bytes=s-r,t}function yv(e,t,r){let n="";null==t&&(t=0),null==r&&(r=e.length);for(let s=t;s191&&t<224)r=(31&t)<<6|63&e[s++];else if(t>239&&t<365){r=((7&t)<<18|(63&e[s++])<<12|(63&e[s++])<<6|63&e[s++])-65536;const o=dv|r>>10&1023;n+=String.fromCharCode(o),r=pv|1023&r}else r=(15&t)<<12|(63&e[s++])<<6|63&e[s++];n+=String.fromCharCode(r)}return yv.bytes=r-t,n}gv.bytes=0,yv.bytes=0;const mv=e=>e instanceof Uint8Array;function bv(e){return"string"==typeof e?fv(e):e.byteLength}function wv(e){return e instanceof Uint8Array?e:Array.isArray(e)?new Uint8Array(e):gv(e)}function vv(e,t,r){if("string"!=typeof t)throw new Error("unknown input type");return gv(t,e,r),gv.bytes}const Ev=Math.pow(2,24),Sv=Math.pow(2,16),Av=Math.pow(2,8),_v=(e,t)=>e[t]*Ev+e[t+1]*Sv+e[t+2]*Av+e[t+3],kv=(e,t)=>e[t]<<8|e[t+1],Iv=(e,t,r)=>(t=+t,e[r+3]=t,t>>>=8,e[r+2]=t,t>>>=8,e[r+1]=t,t>>>=8,e[r]=t,r+4),Rv=(e,t,r)=>(e[r]=t>>8,e[r+1]=255&t,r+2);function Tv(e,t,r,n,s){return r<0&&(n-=r,r=0),n<0&&(n=0),s<0?new Uint8Array(0):r>=t.length||n>=s?0:function(e,t,r,n,s){s-n>t.length-r&&(s=n+t.length-r);let o=s-n;const i=e.length-n;return o>i&&(o=i),(0!==n||se)}}const Nv=Cv({encode(e,t,r){t||(t=new Uint8Array(Nv.encodingLength(e))),r||(r=0);const n=r,s=e.replace(/^\.|\.$/gm,"");if(s.length){const e=s.split(".");for(let n=0;n=e.length)throw new Error("Cannot decode name (buffer overflow)");const a=e[t++];if(o+=i?0:1,0===a)break;if(192&a){if(192&~a)throw new Error("Cannot decode name (bad label)");{if(t+1>e.length)throw new Error("Cannot decode name (buffer overflow)");const r=kv(e,t-1)-49152;if(r>=n)throw new Error("Cannot decode name (bad pointer)");t=r,n=r,o+=i?0:1,i=!0}}else{if(t+a>e.length)throw new Error("Cannot decode name (buffer overflow)");if(s+=a+1,s>254)throw new Error("Cannot decode name (name too long)");r.push(yv(e,t,t+a)),t+=a,o+=i?0:a}}return Nv.decode.bytes=o,0===r.length?".":r.join(".")},encodingLength:e=>"."===e||".."===e?1:bv(e.replace(/^\.|\.$/gm,""))+2}),xv=Cv({encode(e,t,r){t||(t=new Uint8Array(xv.encodingLength(e))),r||(r=0);const n=vv(t,e,r+1);return t[r]=n,xv.encode.bytes=n+1,t},decode(e,t){t||(t=0);const r=e[t],n=yv(e,t+1,t+1+r);return xv.decode.bytes=r+1,n},encodingLength:e=>bv(e)+1}),Pv=Cv({bytes:12,encode(e,t,r){t||(t=new Uint8Array(Pv.encodingLength(e))),r||(r=0);const n=32767&(e.flags||0),s="response"===e.type?32768:0;return Rv(t,e.id||0,r),Rv(t,n|s,r+2),Rv(t,e.questions.length,r+4),Rv(t,e.answers.length,r+6),Rv(t,e.authorities.length,r+8),Rv(t,e.additionals.length,r+10),t},decode(e,t){if(t||(t=0),e.length<12)throw new Error("Header must be 12 bytes");const r=kv(e,t+2);return{id:kv(e,t),type:32768&r?"response":"query",flags:32767&r,flag_qr:1==(r>>15&1),opcode:cv(r>>11&15),flag_aa:1==(r>>10&1),flag_tc:1==(r>>9&1),flag_rd:1==(r>>8&1),flag_ra:1==(r>>7&1),flag_z:1==(r>>6&1),flag_ad:1==(r>>5&1),flag_cd:1==(r>>4&1),rcode:av(15&r),questions:new Array(kv(e,t+4)),answers:new Array(kv(e,t+6)),authorities:new Array(kv(e,t+8)),additionals:new Array(kv(e,t+10))}},encodingLength:()=>12}),Ov=Cv({encode(e,t,r){t||(t=new Uint8Array(Ov.encodingLength(e))),r||(r=0);const n=e.length;return Rv(t,n,r),Tv(e,t,r+2,0,n),Ov.encode.bytes=n+2,t},decode(e,t){t||(t=0);const r=kv(e,t),n=e.slice(t+2,t+2+r);return Ov.decode.bytes=r+2,n},encodingLength:e=>e.length+2}),Dv=Cv({encode:(e,t,r)=>(t||(t=new Uint8Array(Dv.encodingLength(e))),r||(r=0),Nv.encode(e,t,r+2),Rv(t,Nv.encode.bytes,r),Dv.encode.bytes=Nv.encode.bytes+2,t),decode(e,t){t||(t=0);const r=kv(e,t),n=Nv.decode(e,t+2);return Dv.decode.bytes=r+2,n},encodingLength:e=>Nv.encodingLength(e)+2}),Lv=Cv({encode(e,t,r){t||(t=new Uint8Array(Lv.encodingLength(e))),r||(r=0);const n=r;return r+=2,Nv.encode(e.mname,t,r),r+=Nv.encode.bytes,Nv.encode(e.rname,t,r),r+=Nv.encode.bytes,Iv(t,e.serial||0,r),r+=4,Iv(t,e.refresh||0,r),r+=4,Iv(t,e.retry||0,r),r+=4,Iv(t,e.expire||0,r),r+=4,Iv(t,e.minimum||0,r),Rv(t,(r+=4)-n-2,n),Lv.encode.bytes=r-n,t},decode(e,t){t||(t=0);const r=t,n={};return t+=2,n.mname=Nv.decode(e,t),t+=Nv.decode.bytes,n.rname=Nv.decode(e,t),t+=Nv.decode.bytes,n.serial=_v(e,t),t+=4,n.refresh=_v(e,t),t+=4,n.retry=_v(e,t),t+=4,n.expire=_v(e,t),t+=4,n.minimum=_v(e,t),t+=4,Lv.decode.bytes=t-r,n},encodingLength:e=>22+Nv.encodingLength(e.mname)+Nv.encodingLength(e.rname)}),Bv=Cv({encode(e,t,r){Array.isArray(e)||(e=[e]);for(let t=0;t0;){const r=e[t++];if(--n,ne?(mv(e)?e.length:bv(e))+2:2}),Mv=Cv({encode(e,t,r){t||(t=new Uint8Array(Mv.encodingLength(e))),r||(r=0);const n=r;return r+=2,xv.encode(e.cpu,t,r),r+=xv.encode.bytes,xv.encode(e.os,t,r),r+=xv.encode.bytes,Rv(t,r-n-2,n),Mv.encode.bytes=r-n,t},decode(e,t){t||(t=0);const r=t,n={};return t+=2,n.cpu=xv.decode(e,t),t+=xv.decode.bytes,n.os=xv.decode(e,t),t+=xv.decode.bytes,Mv.decode.bytes=t-r,n},encodingLength:e=>xv.encodingLength(e.cpu)+xv.encodingLength(e.os)+2}),Fv=Cv({encode:(e,t,r)=>(t||(t=new Uint8Array(Fv.encodingLength(e))),r||(r=0),Nv.encode(e,t,r+2),Rv(t,Nv.encode.bytes,r),Fv.encode.bytes=Nv.encode.bytes+2,t),decode(e,t){t||(t=0);const r=Nv.decode(e,t+2);return Fv.decode.bytes=Nv.decode.bytes+2,r},encodingLength:e=>Nv.encodingLength(e)+2}),$v=Cv({encode(e,t,r){t||(t=new Uint8Array($v.encodingLength(e))),r||(r=0),Rv(t,e.priority||0,r+2),Rv(t,e.weight||0,r+4),Rv(t,e.port||0,r+6),Nv.encode(e.target,t,r+8);const n=Nv.encode.bytes+6;return Rv(t,n,r),$v.encode.bytes=n+2,t},decode(e,t){t||(t=0);const r=kv(e,t),n={};return n.priority=kv(e,t+2),n.weight=kv(e,t+4),n.port=kv(e,t+6),n.target=Nv.decode(e,t+8),$v.decode.bytes=r+2,n},encodingLength:e=>8+Nv.encodingLength(e.target)}),Hv=Cv({encode(e,t,r){const n=Hv.encodingLength(e);return t||(t=new Uint8Array(Hv.encodingLength(e))),r||(r=0),e.issuerCritical&&(e.flags=Hv.ISSUER_CRITICAL),Rv(t,n-2,r),t[r+=2]=e.flags||0,r+=1,xv.encode(e.tag,t,r),r+=xv.encode.bytes,vv(t,e.value,r),r+=bv(e.value),Hv.encode.bytes=n,t},decode(e,t){t||(t=0);const r=kv(e,t),n=t+=2,s={};return s.flags=e[t],t+=1,s.tag=xv.decode(e,t),t+=xv.decode.bytes,s.value=yv(e,t,n+r),s.issuerCritical=!!(s.flags&Hv.ISSUER_CRITICAL),Hv.decode.bytes=r+2,s},encodingLength:e=>xv.encodingLength(e.tag)+xv.encodingLength(e.value)+2});Hv.ISSUER_CRITICAL=128;const qv=Cv({encode(e,t,r){t||(t=new Uint8Array(qv.encodingLength(e))),r||(r=0);const n=r;return r+=2,Rv(t,e.preference||0,r),r+=2,Nv.encode(e.exchange,t,r),r+=Nv.encode.bytes,Rv(t,r-n-2,n),qv.encode.bytes=r-n,t},decode(e,t){t||(t=0);const r=t,n={};return t+=2,n.preference=kv(e,t),t+=2,n.exchange=Nv.decode(e,t),t+=Nv.decode.bytes,qv.decode.bytes=t-r,n},encodingLength:e=>4+Nv.encodingLength(e.exchange)}),Vv=Cv({encode:(e,t,r)=>(t||(t=new Uint8Array(Vv.encodingLength(e))),r||(r=0),Rv(t,4,r),r+=2,rv.encode(e,t,r),t),decode:(e,t)=>(t||(t=0),t+=2,rv.decode(e,t)),bytes:6}),jv=Cv({encode:(e,t,r)=>(t||(t=new Uint8Array(jv.encodingLength(e))),r||(r=0),Rv(t,16,r),r+=2,nv.encode(e,t,r),jv.encode.bytes=18,t),decode(e,t){t||(t=0),t+=2;const r=nv.decode(e,t);return jv.decode.bytes=18,r},bytes:18}),Kv=e=>new Uint8Array(e),zv=Cv({encode(e,t,r){t||(t=new Uint8Array(zv.encodingLength(e))),r||(r=0);const n=r,s=hv(e.code);if(Rv(t,s,r),r+=2,e.data)Rv(t,e.data.length,r),r+=2,Tv(e.data,t,r),r+=e.data.length;else switch(s){case 8:{const n=e.sourcePrefixLength||0,s=e.family||function(e){return sv(e)===rv.size?1:2}(e.ip),o=function(e,t,r){r=~~r;const n=sv(e);return"function"==typeof t&&(t=t(r+n)),n===rv.size?rv.encode(e,t,r):nv.encode(e,t,r)}(e.ip,Kv),i=Math.ceil(n/8);Rv(t,i+4,r),Rv(t,s,r+=2),r+=2,t[r++]=n,t[r++]=e.scopePrefixLength||0,Tv(o,t,r,0,i),r+=i}break;case 11:e.timeout?(Rv(t,2,r),r+=2,Rv(t,e.timeout,r),r+=2):(Rv(t,0,r),r+=2);break;case 12:{const n=e.length||0;Rv(t,n,r),r+=2,t.fill(0,r,r+n),r+=n}break;case 14:{const n=2*e.tags.length;Rv(t,n,r),r+=2;for(const n of e.tags)Rv(t,n,r),r+=2}break;default:throw new Error(`Unknown roption code: ${e.code}`)}return zv.encode.bytes=r-n,t},decode(e,t){t||(t=0);const r={};r.code=kv(e,t),r.type=function(e){switch(e){case 1:return"LLQ";case 2:return"UL";case 3:return"NSID";case 5:return"DAU";case 6:return"DHU";case 7:return"N3U";case 8:return"CLIENT_SUBNET";case 9:return"EXPIRE";case 10:return"COOKIE";case 11:return"TCP_KEEPALIVE";case 12:return"PADDING";case 13:return"CHAIN";case 14:return"KEY_TAG";case 26946:return"DEVICEID"}return e<0?null:`OPTION_${e}`}(r.code);const n=kv(e,t+=2);switch(t+=2,r.data=e.slice(t,t+n),r.code){case 8:r.family=kv(e,t),t+=2,r.sourcePrefixLength=e[t++],r.scopePrefixLength=e[t++];{const s=new Uint8Array(1===r.family?4:16);Tv(e,s,0,t,t+n-4),r.ip=function(e,t,r){if(t=~~t,(r=r||e.length-t)===rv.size)return rv.decode(e,t,r);if(r===nv.size)return nv.decode(e,t,r);throw Error(`Invalid buffer size needs to be ${rv.size} for v4 or ${nv.size} for v6.`)}(s)}break;case 11:n>0&&(r.timeout=kv(e,t),t+=2);break;case 14:r.tags=[];for(let s=0;s0;)n[o++]=zv.decode(e,t),t+=zv.decode.bytes,s-=zv.decode.bytes;return Gv.decode.bytes=t-r,n},encodingLength:e=>2+dE(e||[],zv)}),Wv=Cv({encode(e,t,r){t||(t=new Uint8Array(Wv.encodingLength(e))),r||(r=0);const n=r,s=e.key;if(!mv(s))throw new Error("Key must be a Buffer");return r+=2,Rv(t,e.flags,r),t[r+=2]=Wv.PROTOCOL_DNSSEC,t[r+=1]=e.algorithm,Tv(s,t,r+=1,0,s.length),r+=s.length,Wv.encode.bytes=r-n,Rv(t,Wv.encode.bytes-2,n),t},decode(e,t){t||(t=0);const r=t,n={},s=kv(e,t);if(t+=2,n.flags=kv(e,t),e[t+=2]!==Wv.PROTOCOL_DNSSEC)throw new Error("Protocol must be 3");return t+=1,n.algorithm=e[t],t+=1,n.key=e.slice(t,r+s+2),t+=n.key.length,Wv.decode.bytes=t-r,n},encodingLength:e=>6+bv(e.key)});Wv.PROTOCOL_DNSSEC=3,Wv.ZONE_KEY=128,Wv.SECURE_ENTRYPOINT=32768;const Yv=Cv({encode(e,t,r){t||(t=new Uint8Array(Yv.encodingLength(e))),r||(r=0);const n=r,s=e.signature;if(!mv(s))throw new Error("Signature must be a Buffer");return r+=2,Rv(t,iv(e.typeCovered),r),t[r+=2]=e.algorithm,t[r+=1]=e.labels,r+=1,Iv(t,e.originalTTL,r),r+=4,Iv(t,e.expiration,r),r+=4,Iv(t,e.inception,r),r+=4,Rv(t,e.keyTag,r),r+=2,Nv.encode(e.signersName,t,r),Tv(s,t,r+=Nv.encode.bytes,0,s.length),r+=s.length,Yv.encode.bytes=r-n,Rv(t,Yv.encode.bytes-2,n),t},decode(e,t){t||(t=0);const r=t,n={},s=kv(e,t);return t+=2,n.typeCovered=ov(kv(e,t)),t+=2,n.algorithm=e[t],t+=1,n.labels=e[t],t+=1,n.originalTTL=_v(e,t),t+=4,n.expiration=_v(e,t),t+=4,n.inception=_v(e,t),t+=4,n.keyTag=kv(e,t),t+=2,n.signersName=Nv.decode(e,t),t+=Nv.decode.bytes,n.signature=e.slice(t,r+s+2),t+=n.signature.length,Yv.decode.bytes=t-r,n},encodingLength:e=>20+Nv.encodingLength(e.signersName)+bv(e.signature)}),Jv=Cv({encode(e,t,r){t||(t=new Uint8Array(Jv.encodingLength(e))),r||(r=0);const n=r;return r+=2,Nv.encode(e.mbox||".",t,r),r+=Nv.encode.bytes,Nv.encode(e.txt||".",t,r),r+=Nv.encode.bytes,Jv.encode.bytes=r-n,Rv(t,Jv.encode.bytes-2,n),t},decode(e,t){t||(t=0);const r=t,n={};return t+=2,n.mbox=Nv.decode(e,t)||".",t+=Nv.decode.bytes,n.txt=Nv.decode(e,t)||".",t+=Nv.decode.bytes,Jv.decode.bytes=t-r,n},encodingLength:e=>2+Nv.encodingLength(e.mbox||".")+Nv.encodingLength(e.txt||".")}),Xv=Cv({encode(e,t,r){t||(t=new Uint8Array(Xv.encodingLength(e))),r||(r=0);const n=r,s=[];for(let t=0;t>8]&&(s[r>>8]=[]),s[r>>8][r>>3&31]|=1<<7-(7&r)}for(let e=0;e>8]=Math.max(t[n>>8]||0,255&n)}let r=0;for(let e=0;e2+Nv.encodingLength(e.nextDomain)+Xv.encodingLength(e.rrtypes)}),Zv=Cv({encode(e,t,r){t||(t=new Uint8Array(Zv.encodingLength(e))),r||(r=0);const n=r,s=e.salt;if(!mv(s))throw new Error("salt must be a Buffer");const o=e.nextDomain;if(!mv(o))throw new Error("nextDomain must be a Buffer");return t[r+=2]=e.algorithm,t[r+=1]=e.flags,r+=1,Rv(t,e.iterations,r),t[r+=2]=s.length,Tv(s,t,r+=1,0,s.length),t[r+=s.length]=o.length,Tv(o,t,r+=1,0,o.length),r+=o.length,Xv.encode(e.rrtypes,t,r),r+=Xv.encode.bytes,Zv.encode.bytes=r-n,Rv(t,Zv.encode.bytes-2,n),t},decode(e,t){t||(t=0);const r=t,n={},s=kv(e,t);t+=2,n.algorithm=e[t],t+=1,n.flags=e[t],t+=1,n.iterations=kv(e,t);const o=e[t+=2];t+=1,n.salt=e.slice(t,t+o);const i=e[t+=o];return t+=1,n.nextDomain=e.slice(t,t+i),t+=i,n.rrtypes=Xv.decode(e,t,s-(t-r)),t+=Xv.decode.bytes,Zv.decode.bytes=t-r,n},encodingLength:e=>8+e.salt.length+e.nextDomain.length+Xv.encodingLength(e.rrtypes)}),eE=Cv({encode(e,t,r){t||(t=new Uint8Array(eE.encodingLength(e))),r||(r=0);const n=r,s=e.digest;if(!mv(s))throw new Error("Digest must be a Buffer");return r+=2,Rv(t,e.keyTag,r),t[r+=2]=e.algorithm,t[r+=1]=e.digestType,Tv(s,t,r+=1,0,s.length),r+=s.length,eE.encode.bytes=r-n,Rv(t,eE.encode.bytes-2,n),t},decode(e,t){t||(t=0);const r=t,n={},s=kv(e,t);return t+=2,n.keyTag=kv(e,t),t+=2,n.algorithm=e[t],t+=1,n.digestType=e[t],t+=1,n.digest=e.slice(t,r+s+2),t+=n.digest.length,eE.decode.bytes=t-r,n},encodingLength:e=>6+bv(e.digest)});function tE(e){switch(e.toUpperCase()){case"A":return Vv;case"PTR":case"CNAME":case"DNAME":return Fv;case"TXT":return Bv;case"NULL":return Uv;case"AAAA":return jv;case"SRV":return $v;case"HINFO":return Mv;case"CAA":return Hv;case"NS":return Dv;case"SOA":return Lv;case"MX":return qv;case"OPT":return Gv;case"DNSKEY":return Wv;case"RRSIG":return Yv;case"RP":return Jv;case"NSEC":return Qv;case"NSEC3":return Zv;case"DS":return eE}return Ov}const rE=Cv({encode(e,t,r){t||(t=new Uint8Array(rE.encodingLength(e))),r||(r=0);const n=r;if(Nv.encode(e.name,t,r),r+=Nv.encode.bytes,Rv(t,iv(e.type),r),"OPT"===e.type.toUpperCase()){if("."!==e.name)throw new Error("OPT name must be root.");Rv(t,e.udpPayloadSize||4096,r+2),t[r+4]=e.extendedRcode||0,t[r+5]=e.ednsVersion||0,Rv(t,e.flags||0,r+6),r+=8,Gv.encode(e.options||[],t,r),r+=Gv.encode.bytes}else{let n=uv(void 0===e.class?"IN":e.class);e.flush&&(n|=32768),Rv(t,n,r+2),Iv(t,e.ttl||0,r+4),r+=8;const s=tE(e.type);s.encode(e.data,t,r),r+=s.encode.bytes}return rE.encode.bytes=r-n,t},decode(e,t){t||(t=0);const r={},n=t;if(r.name=Nv.decode(e,t),t+=Nv.decode.bytes,r.type=ov(kv(e,t)),"OPT"===r.type)r.udpPayloadSize=kv(e,t+2),r.extendedRcode=e[t+4],r.ednsVersion=e[t+5],r.flags=kv(e,t+6),r.flag_do=1==(r.flags>>15&1),r.options=Gv.decode(e,t+8),t+=8+Gv.decode.bytes;else{const n=kv(e,t+2);r.ttl=_v(e,t+4),r.class=lv(-32769&n),r.flush=!!(32768&n);const s=tE(r.type);r.data=s.decode(e,t+8),t+=8+s.decode.bytes}return rE.decode.bytes=t-n,r},encodingLength(e){const t=null!==e.data&&void 0!==e.data?e.data:e.options;return Nv.encodingLength(e.name)+8+tE(e.type).encodingLength(t)}}),nE=Cv({encode(e,t,r){t||(t=new Uint8Array(nE.encodingLength(e))),r||(r=0);const n=r;return Nv.encode(e.name,t,r),r+=Nv.encode.bytes,Rv(t,iv(e.type),r),r+=2,Rv(t,uv(void 0===e.class?"IN":e.class),r),r+=2,nE.encode.bytes=r-n,e},decode(e,t){t||(t=0);const r=t,n={};return n.name=Nv.decode(e,t),t+=Nv.decode.bytes,n.type=ov(kv(e,t)),t+=2,n.class=lv(kv(e,t)),t+=2,!!(32768&n.class)&&(n.class&=-32769),nE.decode.bytes=t-r,n},encodingLength:e=>Nv.encodingLength(e.name)+4}),sE=256,oE={encode:function(e,t,r){const n=!t;n&&(t=new Uint8Array(hE(e))),r||(r=0);const s=r;return e.questions||(e.questions=[]),e.answers||(e.answers=[]),e.authorities||(e.authorities=[]),e.additionals||(e.additionals=[]),Pv.encode(e,t,r),r+=Pv.encode.bytes,r=pE(e.questions,nE,t,r),r=pE(e.answers,rE,t,r),r=pE(e.authorities,rE,t,r),r=pE(e.additionals,rE,t,r),oE.encode.bytes=r-s,n&&lE.bytes!==t.length?t.slice(0,lE.bytes):t},decode:function(e,t){t||(t=0);const r=t,n=Pv.decode(e,t);return t+=Pv.decode.bytes,t=fE(n.questions,nE,e,t),t=fE(n.answers,rE,e,t),t=fE(n.authorities,rE,e,t),t=fE(n.additionals,rE,e,t),oE.decode.bytes=t-r,n},encodingLength:function(e){return Pv.encodingLength(e)+dE(e.questions||[],nE)+dE(e.answers||[],rE)+dE(e.authorities||[],rE)+dE(e.additionals||[],rE)}};function iE(e,t){if(e.questions)throw new Error("Only one .question object expected instead of a .questions array!");const r=Object.assign({type:t},e);return r.question&&(r.questions=[r.question],delete r.question),r}oE.encode.bytes=0,oE.decode.bytes=0;const aE={encode:function(e,t,r){return t=oE.encode(iE(e,"query"),t,r),aE.encode.bytes=oE.encode.bytes,t},decode:function(e,t){const r=oE.decode(e,t);return aE.decode.bytes=oE.decode.bytes,r.questions&&(r.question=r.questions[0],delete r.questions),r},encodingLength:function(e){return oE.encodingLength(iE(e,"query"))}};aE.encode.bytes=0,aE.decode.bytes=0;const cE={encode:function(e,t,r){return t=oE.encode(iE(e,"response"),t,r),cE.encode.bytes=oE.encode.bytes,t},decode:function(e,t){const r=oE.decode(e,t);return cE.decode.bytes=oE.decode.bytes,r.questions&&(r.question=r.questions[0],delete r.questions),r},encodingLength:function(e){return oE.encodingLength(iE(e,"response"))}};cE.encode.bytes=0,cE.decode.bytes=0;const lE=oE.encode,uE=oE.decode,hE=oE.encodingLength;function dE(e,t){let r=0;for(let n=0;n255)throw new Error(`Character #${e} in charset [code=${r}, char=${t.charAt(e)}] is too high! (max=255)`);if(0!==s[r])throw new Error(`Character [code=${r}, char=${t.charAt(e)}] is more than once in the charset!`);s[r]=e,o[e]=r}const i=r.charCodeAt(0),a={name:e,encodingLength(e){const t=e.length,r=.75*t|0;return e.charCodeAt(t-1)===i?e.charCodeAt(t-2)===i?r-2:r-1:r},encode(e,t,r){null==t&&(t=new Uint8Array(a.encodingLength(e))),null==r&&(r=0);let n=e.length;e.charCodeAt(n-1)===i&&(e.charCodeAt(n-2)===i?n-=2:n-=1);const o=n%4,c=n-o;let l=r,u=0;for(;u>16,t[l++]=r>>8,t[l++]=r,u+=4}if(3===o){const r=s[e.charCodeAt(u)]<<10|s[e.charCodeAt(u+1)]<<4|s[e.charCodeAt(u+2)]>>2;t[l++]=r>>8,t[l++]=r}else 2===o&&(t[l++]=s[e.charCodeAt(u)]<<2|s[e.charCodeAt(u+1)]>>4);return a.encode.bytes=l-r,t},decode(e,t,r){null==t&&(t=0),null==r&&(r=e.length);const s=r-t,c=s%3,l=t+s-c,u=[];for(let r=t;r>18&63],o[t>>12&63],o[t>>6&63],o[63&t])}if(2===c){const t=(e[r-2]<<8)+e[r-1];u.push(o[t>>10],o[t>>4&63],o[t<<2&63]),1===n&&u.push(i)}else if(1===c){const t=e[r-1];u.push(o[t>>2],o[t<<4&63]),1===n&&u.push(i,i)}return a.decode.bytes=s,String.fromCharCode.apply(String,u)}};return a}gE("base64","ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/","=",1);const yE=gE("base64-url","ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_","=",2);let mE="undefined"!=typeof global?global.AbortError:"undefined"!=typeof window?window.AbortError:null;mE||(mE=class extends Error{constructor(e="Request aborted."){super(e)}}),mE.prototype.name="AbortError",mE.prototype.code="ABORT_ERR";const bE="undefined"!=typeof globalThis&&globalThis.URL||require("url").URL;class wE extends Error{constructor(e,t,r){super("status="+t+" while requesting "+e+" ["+r+"]"),this.uri=e,this.status=t,this.method=r}toJSON(){return{code:this.code,uri:this.uri,status:this.status,method:this.method,endpoint:this.endpoint}}}wE.prototype.name="HTTPStatusError",wE.prototype.code="HTTP_STATUS";class vE extends Error{constructor(e,t){super(e),this.cause=t}toJSON(){return{message:this.message,endpoint:this.endpoint,code:this.code,cause:_E(this.cause)}}}vE.prototype.name="ResponseError",vE.prototype.code="RESPONSE_ERR";class EE extends Error{constructor(e){super("Timeout (t="+e+")."),this.timeout=e}toJSON(){return{code:this.code,endpoint:this.endpoint,timeout:this.timeout}}}EE.prototype.name="TimeoutError",EE.prototype.code="ETIMEOUT";const SE=/^((\d{1,3}\.){3,3}\d{1,3})(:(\d{2,5}))?$/,AE=/^((::)?(((\d{1,3}\.){3}(\d{1,3}){1})?([0-9a-f]){0,4}:{0,2}){1,8}(::)?)(:(\d{2,5}))?$/i;function _E(e){if("string"==typeof e)return{message:e};try{const t=JSON.stringify(e);if("{}"!==t)return JSON.parse(t)}catch(e){}const t={message:String(e.message||e)};return void 0!==e.code&&(t.code=String(e.code)),t}const kE=/^(([a-z0-9]+:)\/\/)?([^/[\s:]+|\[[^\]]+\])?(:([^/\s]+))?(\/[^\s]*)?(.*)$/,IE=/\[(post|get|((ipv4|ipv6|name)=([^\]]+)))\]/gi,RE=/\[(((pk|name)=([^\]]+)))\]/gi;function TE(e,t){t.lastIndex=0;const r={};for(;;){const n=t.exec(e);if(!n)break;n[2]?r[n[3].toLowerCase()]=n[4]:r[n[1].toLowerCase()]=!0}return r}class CE extends Error{constructor(e,t){super(`Invalid Endpoint: unsupported protocol "${e}" for endpoint: ${t}, supported protocols: ${NE.join(", ")}`),this.protocol=e,this.endpoint=t}toJSON(){return{code:this.code,endpoint:this.endpoint,timeout:this.timeout}}}CE.prototype.name="InvalidProtocolError",CE.prototype.code="EPROTOCOL";const NE=["http:","https:","udp4:","udp6:"];class xE{constructor(e,t){this.name=e.name||null,this.protocol=e.protocol;const r="string"==typeof e.port?e.port=parseInt(e.port,10):e.port;if(null==r)this.port=t?"https:"===this.protocol?443:80:e.pk?443:53;else{if("number"!=typeof r&&!isNaN(r))throw new Error(`Invalid Endpoint: port "${e.port}" needs to be a number: ${JSON.stringify(e)}`);this.port=r}}toJSON(){return this.toString()}}class PE extends xE{constructor(e){super(e,!1),this.pk=e.pk||null}toString(){const e=this.port!==(this.pk?443:53)?`:${this.port}`:"",t=this.pk?` [pk=${this.pk}]`:"",r=this.name?` [name=${this.name}]`:"";return`udp://${this.ipv4||`[${this.ipv6}]`}${e}${t}${r}`}}class OE extends PE{constructor(e){if(super(Object.assign({protocol:"udp4:"},e)),!e.ipv4||"string"!=typeof e.ipv4)throw new Error(`Invalid Endpoint: .ipv4 "${e.ipv4}" needs to be set: ${JSON.stringify(e)}`);this.ipv4=e.ipv4}}class DE extends PE{constructor(e){if(super(Object.assign({protocol:"udp6:"},e)),!e.ipv6||"string"!=typeof e.ipv6)throw new Error(`Invalid Endpoint: .ipv6 "${e.ipv6}" needs to be set: ${JSON.stringify(e)}`);this.ipv6=e.ipv6}}function LE(e){return AE.test(e)&&!SE.test(e)?`[${e}]`:e}class BE extends xE{constructor(e){if(super(Object.assign({protocol:"https:"},e),!0),e.host||(e.ipv4&&(e.host=e.ipv4),e.ipv6&&(e.host=`[${e.ipv6}]`)),!e.host||"string"!=typeof e.host)throw new Error(`Invalid Endpoint: host "${e.path}" needs to be set: ${JSON.stringify(e)}`);if(this.host=e.host,this.path=e.path||"/dns-query",this.method=/^post$/i.test(e.method)?"POST":"GET",this.ipv4=e.ipv4,this.ipv6=e.ipv6,!this.ipv6){const e=AE.exec(this.host);e&&(this.ipv6=e[1])}this.ipv4||SE.test(this.host)&&(this.ipv4=this.host);const t=`${this.protocol}//${LE(this.host)}:${this.port}${this.path}`;try{this.url=new bE(t)}catch(e){throw new Error(e.message+` [${t}]`)}}toString(){const e="https:"===this.protocol?"":"http://",t=this.port!==("https:"===this.protocol?443:80)?`:${this.port}`:"",r="GET"!==this.method?" [post]":"",n="/dns-query"===this.path?"":this.path,s=this.name?` [name=${this.name}]`:"",o=this.ipv4&&this.ipv4!==this.host?` [ipv4=${this.ipv4}]`:"",i=this.ipv6&&this.ipv6!==this.host?` [ipv6=${this.ipv6}]`:"";return`${e}${LE(this.host)}${t}${n}${r}${o}${i}${s}`}}function UE(e){let t;if("string"==typeof e)t=function(e){const t=kE.exec(e),r=t[2]||"https:",n=t[3],s=t[5],o=t[6],i=t[7];if("https:"===r||"http:"===r){const e=TE(i,IE);return{name:e.name,protocol:r,ipv4:e.ipv4,ipv6:e.ipv6,host:n,port:s,path:o,method:e.post?"POST":"GET"}}if("udp:"===r||"udp4:"===r||"udp6:"===r){const t=TE(i,RE),o=/^\[(.*)\]$/.exec(n);if(o&&"udp4:"===r)throw new Error(`Endpoint parsing error: Cannot use ipv6 host with udp4: (endpoint=${e})`);if(!o&&"udp6:"===r)throw new Error(`Endpoint parsing error: Incorrectly formatted host for udp6: (endpoint=${e})`);return o?new DE({protocol:"udp6:",ipv6:o[1],port:s,pk:t.pk,name:t.name}):new OE({protocol:"udp4:",ipv4:n,port:s,pk:t.pk,name:t.name})}throw new CE(r,e)}(e);else{if("object"!=typeof e||null===e||Array.isArray(e))throw new Error(`Can not convert ${e} to an endpoint`);if(e instanceof xE)return e;t=e}null!==t.protocol&&void 0!==t.protocol||(t.protocol="https:");const r=t.protocol;if("udp4:"===r)return new OE(t);if("udp6:"===r)return new DE(t);if("https:"===r||"http:"===r)return new BE(t);throw new CE(r,JSON.stringify(t))}const ME="application/dns-message";function FE(){}function $E(e,t,r,n,s){return new Promise(((o,i)=>{const a=new bE(e);"GET"===t&&r&&(a.search="?dns="+yE.decode(r));const c=a.toString(),l=new XMLHttpRequest;l.open(t,c,!0),l.setRequestHeader("Accept",ME),"POST"===t&&l.setRequestHeader("Content-Type",ME),l.responseType="arraybuffer",l.timeout=n,l.ontimeout=function(){u(new EE(n));try{l.abort()}catch(e){}},l.onreadystatechange=function(){if(l.readyState>1&&200!==l.status&&0!==l.status){u(new wE(c,l.status,t));try{l.abort()}catch(e){}}},l.onerror=function(){u(200===l.status?new Error("Inexplicable XHR Error"):new wE(c,l.status,t))},l.onload=function(){if(200!==l.status)u(new wE(c,l.status,t));else{let e;if("string"==typeof l.response)e=gv(l.response);else if(l.response instanceof Uint8Array)e=l.response;else{if(!(Array.isArray(l.response)||l.response instanceof ArrayBuffer))throw new Error("Unprocessable response "+l.response);e=new Uint8Array(l.response)}u(null,e)}},"POST"===t?l.send(r):l.send(),s&&s.addEventListener("abort",h);let u=function(e,t){u=FE,s&&s.removeEventListener("abort",h),o(e?{error:e,response:l}:{data:t,response:l})};function h(){u(new mE);try{l.abort()}catch(e){}}}))}function HE(e){const t=null===e.time||void 0===e.time?Date.now():e.time,r=function(e){return e.filter((e=>e.cors||e.endpoint.cors))}(e.data.map((e=>(e.endpoint=UE(Object.assign({name:e.name},e.endpoint)),e)))),n=r.map((e=>e.endpoint));return{data:{resolvers:r,resolverByName:r.reduce(((e,t)=>(e[t.name]=t,e)),{}),endpoints:n,endpointByName:n.reduce(((e,t)=>(e[t.name]=t,e)),{})},time:t}}Error;const qE=HE({data:[{name:"adfree.usableprivacy.net",endpoint:{protocol:"https:",host:"adfree.usableprivacy.net"},description:"Public updns DoH service with advertising, tracker and malware filters.\nHosted in Europe by @usableprivacy, details see: https://docs.usableprivacy.com",country:"Germany",location:{lat:51.2993,long:9.491},filter:!0},{name:"adguard-dns-doh",endpoint:{protocol:"https:",host:"dns.adguard.com",ipv4:"94.140.15.15"},description:"Remove ads and protect your computer from malware (over DoH)",country:"France",location:{lat:48.8582,long:2.3387},filter:!0},{name:"adguard-dns-family-doh",endpoint:{protocol:"https:",host:"dns-family.adguard.com",ipv4:"94.140.15.16"},description:"Adguard DNS with safesearch and adult content blocking (over DoH)",country:"France",location:{lat:48.8582,long:2.3387},filter:!0},{name:"adguard-dns-unfiltered-doh",endpoint:{protocol:"https:",host:"dns-unfiltered.adguard.com",ipv4:"94.140.14.140"},description:"AdGuard public DNS servers without filters (over DoH)",country:"France",location:{lat:48.8582,long:2.3387}},{name:"ahadns-doh-chi",endpoint:{protocol:"https:",host:"doh.chi.ahadns.net",cors:!0},description:"A zero logging DNS with support for DNS-over-HTTPS (DoH) & DNS-over-TLS (DoT). Blocks ads, malware, trackers, viruses, ransomware, telemetry and more. No persistent logs. DNSSEC. Hosted in Chicago, USA. By https://ahadns.com/\nServer statistics can be seen at: https://statistics.ahadns.com/?server=chi",country:"United States",location:{lat:41.8483,long:-87.6517},filter:!0,cors:!0},{name:"ahadns-doh-in",endpoint:{protocol:"https:",host:"doh.in.ahadns.net",cors:!0},description:"A zero logging DNS with support for DNS-over-HTTPS (DoH) & DNS-over-TLS (DoT). Blocks ads, malware, trackers, viruses, ransomware, telemetry and more. No persistent logs. DNSSEC. Hosted in Mumbai, India. By https://ahadns.com/\nServer statistics can be seen at: https://statistics.ahadns.com/?server=in",country:"India",location:{lat:19.0748,long:72.8856},filter:!0,cors:!0},{name:"ahadns-doh-la",endpoint:{protocol:"https:",host:"doh.la.ahadns.net",cors:!0},description:"A zero logging DNS with support for DNS-over-HTTPS (DoH) & DNS-over-TLS (DoT). Blocks ads, malware, trackers, viruses, ransomware, telemetry and more. No persistent logs. DNSSEC. Hosted in Los Angeles, USA. By https://ahadns.com/\nServer statistics can be seen at: https://statistics.ahadns.com/?server=la",country:"United States",location:{lat:34.0549,long:-118.2578},filter:!0,cors:!0},{name:"ahadns-doh-nl",endpoint:{protocol:"https:",host:"doh.nl.ahadns.net",cors:!0},description:"A zero logging DNS with support for DNS-over-HTTPS (DoH) & DNS-over-TLS (DoT). Blocks ads, malware, trackers, viruses, ransomware, telemetry and more. No persistent logs. DNSSEC. Hosted in Amsterdam, Netherlands. By https://ahadns.com/\nServer statistics can be seen at: https://statistics.ahadns.com/?server=nl",country:"Netherlands",location:{lat:52.3824,long:4.8995},filter:!0,cors:!0},{name:"ahadns-doh-ny",endpoint:{protocol:"https:",host:"doh.ny.ahadns.net",cors:!0},description:"A zero logging DNS with support for DNS-over-HTTPS (DoH) & DNS-over-TLS (DoT). Blocks ads, malware, trackers, viruses, ransomware, telemetry and more. No persistent logs. DNSSEC. Hosted in New York. By https://ahadns.com/\nServer statistics can be seen at: https://statistics.ahadns.com/?server=ny",country:"United States",location:{lat:40.7308,long:-73.9975},filter:!0,cors:!0},{name:"ahadns-doh-pl",endpoint:{protocol:"https:",host:"doh.pl.ahadns.net",cors:!0},description:"A zero logging DNS with support for DNS-over-HTTPS (DoH) & DNS-over-TLS (DoT). Blocks ads, malware, trackers, viruses, ransomware, telemetry and more. No persistent logs. DNSSEC. Hosted in Poland. By https://ahadns.com/\nServer statistics can be seen at: https://statistics.ahadns.com/?server=pl",country:"Netherlands",location:{lat:52.3824,long:4.8995},filter:!0,cors:!0},{name:"alidns-doh",endpoint:{protocol:"https:",host:"dns.alidns.com",ipv4:"223.5.5.5",cors:!0},description:"A public DNS resolver that supports DoH/DoT in mainland China, provided by Alibaba-Cloud.\nWarning: GFW filtering rules are applied by that resolver.\nHomepage: https://alidns.com/",country:"China",location:{lat:34.7725,long:113.7266},filter:!0,log:!0,cors:!0},{name:"ams-ads-doh-nl",endpoint:{protocol:"https:",host:"dnsnl-noads.alekberg.net"},description:"Resolver in Amsterdam. DoH protocol. Non-logging. Blocks ads, malware and trackers. DNSSEC enabled.",country:"Romania",location:{lat:45.9968,long:24.997},filter:!0},{name:"ams-doh-nl",endpoint:{protocol:"https:",host:"dnsnl.alekberg.net"},description:"Resolver in Amsterdam. DoH protocol. Non-logging, non-filtering, DNSSEC.",country:"Romania",location:{lat:45.9968,long:24.997}},{name:"att",endpoint:{protocol:"https:",host:"dohtrial.att.net"},description:"AT&T test DoH server.",log:!0},{name:"bcn-ads-doh",endpoint:{protocol:"https:",host:"dnses-noads.alekberg.net"},description:"Resolver in Spain. DoH protocol. Non-logging, remove ads and malware, DNSSEC.",country:"Spain",location:{lat:41.3891,long:2.1611},filter:!0},{name:"bcn-doh",endpoint:{protocol:"https:",host:"dnses.alekberg.net"},description:"Resolver in Spain. DoH protocol. Non-logging, non-filtering, DNSSEC.",country:"Spain",location:{lat:41.3891,long:2.1611}},{name:"brahma-world",endpoint:{protocol:"https:",host:"dns.brahma.world"},description:"DNS-over-HTTPS server. Non Logging, filters ads, trackers and malware. DNSSEC ready, QNAME Minimization, No EDNS Client-Subnet.\nHosted in Stockholm, Sweden. (https://dns.brahma.world)",country:"United States",location:{lat:37.751,long:-97.822},filter:!0},{name:"cisco-doh",endpoint:{protocol:"https:",host:"doh.opendns.com",ipv4:"146.112.41.2"},description:"Remove your DNS blind spot (DoH protocol)\nWarning: modifies your queries to include a copy of your network\naddress when forwarding them to a selection of companies and organizations.",country:"United States",location:{lat:37.751,long:-97.822},filter:!0,log:!0},{name:"cloudflare",endpoint:{protocol:"https:",host:"dns.cloudflare.com",ipv4:"1.0.0.1",cors:!0},description:"Cloudflare DNS (anycast) - aka 1.1.1.1 / 1.0.0.1",country:"Australia",location:{lat:-33.494,long:143.2104},cors:!0},{name:"cloudflare-family",endpoint:{protocol:"https:",host:"family.cloudflare-dns.com",ipv4:"1.0.0.3",cors:!0},description:"Cloudflare DNS (anycast) with malware protection and parental control - aka 1.1.1.3 / 1.0.0.3",country:"Australia",location:{lat:-33.494,long:143.2104},filter:!0,cors:!0},{name:"cloudflare-ipv6",endpoint:{protocol:"https:",host:"1dot1dot1dot1.cloudflare-dns.com",cors:!0},description:"Cloudflare DNS over IPv6 (anycast)",country:"United States",location:{lat:37.751,long:-97.822},cors:!0},{name:"cloudflare-security",endpoint:{protocol:"https:",host:"security.cloudflare-dns.com",ipv4:"1.0.0.2",cors:!0},description:"Cloudflare DNS (anycast) with malware blocking - aka 1.1.1.2 / 1.0.0.2",country:"Australia",location:{lat:-33.494,long:143.2104},filter:!0,cors:!0},{name:"controld-block-malware",endpoint:{protocol:"https:",host:"freedns.controld.com",path:"/p1"},description:"ControlD Free DNS. Take CONTROL of your Internet. Block unwanted content, bypass geo-restrictions and be more productive. DoH protocol and No logging. - https://controld.com/free-dns\nThis DNS blocks Malware domains.",country:"Canada",location:{lat:43.6319,long:-79.3716},filter:!0},{name:"controld-block-malware-ad",endpoint:{protocol:"https:",host:"freedns.controld.com",path:"/p2"},description:"ControlD Free DNS. Take CONTROL of your Internet. Block unwanted content, bypass geo-restrictions and be more productive. DoH protocol and No logging. - https://controld.com/free-dns\nThis DNS blocks Malware, Ads & Tracking domains.",country:"Canada",location:{lat:43.6319,long:-79.3716},filter:!0},{name:"controld-block-malware-ad-social",endpoint:{protocol:"https:",host:"freedns.controld.com",path:"/p3"},description:"ControlD Free DNS. Take CONTROL of your Internet. Block unwanted content, bypass geo-restrictions and be more productive. DoH protocol and No logging. - https://controld.com/free-dns\nThis DNS blocks Malware, Ads & Tracking and Social Networks domains.",country:"Canada",location:{lat:43.6319,long:-79.3716},filter:!0},{name:"controld-family-friendly",endpoint:{protocol:"https:",host:"freedns.controld.com",path:"/family"},description:"ControlD Free DNS. Take CONTROL of your Internet. Block unwanted content, bypass geo-restrictions and be more productive. DoH protocol and No logging. - https://controld.com/free-dns\nThis DNS blocks Malware, Ads & Tracking, Adult Content and Drugs domains.",country:"Canada",location:{lat:43.6319,long:-79.3716},filter:!0},{name:"controld-uncensored",endpoint:{protocol:"https:",host:"freedns.controld.com",path:"/uncensored"},description:"ControlD Free DNS. Take CONTROL of your Internet. Block unwanted content, bypass geo-restrictions and be more productive. DoH protocol and No logging. - https://controld.com/free-dns\nThis DNS unblocks censored domains from various countries.",country:"Canada",location:{lat:43.6319,long:-79.3716}},{name:"controld-unfiltered",endpoint:{protocol:"https:",host:"freedns.controld.com",path:"/p0"},description:"ControlD Free DNS. Take CONTROL of your Internet. Block unwanted content, bypass geo-restrictions and be more productive. DoH protocol and No logging. - https://controld.com/free-dns\nThis is a Unfiltered DNS, no DNS record blocking or manipulation here, if you want to block Malware, Ads & Tracking or Social Network domains, use the other ControlD DNS configs.",country:"Canada",location:{lat:43.6319,long:-79.3716}},{name:"dns.digitale-gesellschaft.ch",endpoint:{protocol:"https:",host:"dns.digitale-gesellschaft.ch"},description:"Public DoH resolver operated by the Digital Society (https://www.digitale-gesellschaft.ch).\nHosted in Zurich, Switzerland.\nNon-logging, non-filtering, supports DNSSEC.",country:"Switzerland",location:{lat:47.1449,long:8.1551}},{name:"dns.ryan-palmer",endpoint:{protocol:"https:",host:"dns1.ryan-palmer.com"},description:"Non-logging, non-filtering, DNSSEC DoH Server. Hosted in the UK.",country:"United Kingdom",location:{lat:51.5164,long:-.093}},{name:"dns.sb",endpoint:{protocol:"https:",host:"doh.sb",ipv4:"185.222.222.222",cors:!0},description:"DNSSEC-enabled DoH server by https://xtom.com/\nhttps://dns.sb/doh/",country:"Unknown",location:{lat:47,long:8},cors:!0},{name:"dns.therifleman.name",endpoint:{protocol:"https:",host:"dns.therifleman.name"},description:"DNS-over-HTTPS DNS forwarder from Mumbai, India. Blocks web and Android trackers and ads.\nIP addresses are not logged, but queries are logged for 24 hours for debugging.\nReport issues, send suggestions @ joker349 at protonmail.com.\nAlso supports DoT (for android) @ dns.therifleman.name and plain DNS @ 172.104.206.174",country:"United States",location:{lat:37.751,long:-97.822},filter:!0},{name:"dnsforfamily-doh",endpoint:{protocol:"https:",host:"dns-doh.dnsforfamily.com"},description:"(DoH Protocol) (Now supports DNSSEC). Block adult websites, gambling websites, malwares and advertisements.\nIt also enforces safe search in: Google, YouTube, Bing, DuckDuckGo and Yandex.\nSocial websites like Facebook and Instagram are not blocked. No DNS queries are logged.\nAs of 26-May-2022 5.9 million websites are blocked and new websites are added to blacklist daily.\nCompletely free, no ads or any commercial motive. Operating for 4 years now.\nProvided by: https://dnsforfamily.com",country:"Finland",location:{lat:60.1758,long:24.9349},filter:!0},{name:"dnsforfamily-doh-no-safe-search",endpoint:{protocol:"https:",host:"dns-doh-no-safe-search.dnsforfamily.com"},description:"(DoH Protocol) (Now supports DNSSEC) Block adult websites, gambling websites, malwares and advertisements.\nUnlike other dnsforfamily servers, this one does not enforces safe search. So Google, YouTube, Bing, DuckDuckGo and Yandex are completely accessible without any restriction.\nSocial websites like Facebook and Instagram are not blocked. No DNS queries are logged.\nAs of 26-May-2022 5.9 million websites are blocked and new websites are added to blacklist daily.\nCompletely free, no ads or any commercial motive. Operating for 4 years now.\nWarning: This server is incompatible with anonymization.\nProvided by: https://dnsforfamily.com",country:"Finland",location:{lat:60.1758,long:24.9349},filter:!0},{name:"dnsforge.de",endpoint:{protocol:"https:",host:"dnsforge.de",cors:!0},description:"Public DoH resolver running with Pihole for Adblocking (https://dnsforge.de).\nNon-logging, AD-filtering, supports DNSSEC. Hosted in Germany.",country:"Germany",location:{lat:52.2998,long:9.447},filter:!0,cors:!0},{name:"dnshome-doh",endpoint:{protocol:"https:",host:"dns.dnshome.de"},description:"https://www.dnshome.de/ public resolver in Germany"},{name:"dnspod-doh",endpoint:{protocol:"https:",host:"doh.pub",cors:!0},description:"A public DNS resolver in mainland China provided by DNSPod (Tencent Cloud).\nhttps://www.dnspod.cn/Products/Public.DNS?lang=en",filter:!0,log:!0,cors:!0},{name:"dnswarden-asia-adblock-dohv4",endpoint:{protocol:"https:",host:"doh.asia.dnswarden.com",path:"/adblock"},description:"Hosted in Singapore. For more information look [here](https://github.com/bhanupratapys/dnswarden) or [here](https://dnswarden.com).",country:"Singapore",location:{lat:1.2929,long:103.8547},filter:!0},{name:"dnswarden-asia-adultfilter-dohv4",endpoint:{protocol:"https:",host:"doh.asia.dnswarden.com",path:"/adultfilter"},description:"Hosted in Singapore. For more information look [here](https://github.com/bhanupratapys/dnswarden) or [here](https://dnswarden.com).",country:"Singapore",location:{lat:1.2929,long:103.8547},filter:!0},{name:"dnswarden-asia-uncensor-dohv4",endpoint:{protocol:"https:",host:"doh.asia.dnswarden.com",path:"/uncensored"},description:"Hosted in Singapore. For more information look [here](https://github.com/bhanupratapys/dnswarden) or [here](https://dnswarden.com).",country:"Singapore",location:{lat:1.2929,long:103.8547}},{name:"dnswarden-eu-adblock-dohv4",endpoint:{protocol:"https:",host:"doh.eu.dnswarden.com"},description:"Hosted in Germany. For more information look [here](https://github.com/bhanupratapys/dnswarden) or [here](https://dnswarden.com).",country:"Germany",location:{lat:50.1103,long:8.7147},filter:!0},{name:"dnswarden-us-adblock-dohv4",endpoint:{protocol:"https:",host:"doh.us.dnswarden.com"},description:"Hosted in USA (Dallas) . For more information look [here](https://github.com/bhanupratapys/dnswarden) or [here](https://dnswarden.com).",country:"United States",location:{lat:32.7889,long:-96.8021},filter:!0},{name:"doh-ch-blahdns",endpoint:{protocol:"https:",host:"doh-ch.blahdns.com",cors:!0},description:"Blocks ad and Tracking, no Logging, DNSSEC, Hosted in Switzerland. By https://blahdns.com/",country:"Netherlands",location:{lat:52.3824,long:4.8995},filter:!0,cors:!0},{name:"doh-cleanbrowsing-adult",endpoint:{protocol:"https:",host:"doh.cleanbrowsing.org",path:"/doh/adult-filter/",cors:!0},description:"Blocks access to all adult, pornographic and explicit sites. It does\nnot block proxy or VPNs, nor mixed-content sites. Sites like Reddit\nare allowed. Google and Bing are set to the Safe Mode.\nBy https://cleanbrowsing.org/",filter:!0,cors:!0},{name:"doh-cleanbrowsing-family",endpoint:{protocol:"https:",host:"doh.cleanbrowsing.org",path:"/doh/family-filter/",cors:!0},description:"Blocks access to all adult, pornographic and explicit sites. It also\nblocks proxy and VPN domains that are used to bypass the filters.\nMixed content sites (like Reddit) are also blocked. Google, Bing and\nYoutube are set to the Safe Mode.\nBy https://cleanbrowsing.org/",filter:!0,cors:!0},{name:"doh-cleanbrowsing-security",endpoint:{protocol:"https:",host:"doh.cleanbrowsing.org",path:"/doh/security-filter/",cors:!0},description:"Block access to phishing, malware and malicious domains. It does not block adult content.\nBy https://cleanbrowsing.org/",filter:!0,cors:!0},{name:"doh-crypto-sx",endpoint:{protocol:"https:",host:"doh.crypto.sx",cors:!0},description:"DNS-over-HTTPS server. Anycast, no logs, no censorship, DNSSEC.\nBackend hosted by Scaleway, globally cached via Cloudflare.\nMaintained by Frank Denis.",country:"United States",location:{lat:37.751,long:-97.822},cors:!0},{name:"doh-crypto-sx-ipv6",endpoint:{protocol:"https:",host:"doh-ipv6.crypto.sx",cors:!0},description:"DNS-over-HTTPS server accessible over IPv6. Anycast, no logs, no censorship, DNSSEC.\nBackend hosted by Scaleway, globally cached via Cloudflare.\nMaintained by Frank Denis.",country:"United States",location:{lat:37.751,long:-97.822},cors:!0},{name:"doh-de-blahdns",endpoint:{protocol:"https:",host:"doh-de.blahdns.com",cors:!0},description:"Blocks ad and Tracking, no Logging, DNSSEC, Hosted in Germany. By https://blahdns.com/",country:"Germany",location:{lat:51.2993,long:9.491},filter:!0,cors:!0},{name:"doh-fi-blahdns",endpoint:{protocol:"https:",host:"doh-fi.blahdns.com",cors:!0},description:"Blocks ad and Tracking, no Logging, DNSSEC, Hosted in Finland. By https://blahdns.com/",country:"Finland",location:{lat:60.1758,long:24.9349},filter:!0,cors:!0},{name:"doh-ibksturm",endpoint:{protocol:"https:",host:"ibksturm.synology.me"},description:"DoH & DoT Server, No Logging, No Filters, DNSSEC\nRunning privately by ibksturm in Thurgau, Switzerland"},{name:"doh-jp-blahdns",endpoint:{protocol:"https:",host:"doh-jp.blahdns.com",cors:!0},description:"Blocks ad and Tracking, no Logging, DNSSEC, Hosted in Japan. By https://blahdns.com/",country:"Japan",location:{lat:35.6882,long:139.7532},filter:!0,cors:!0},{name:"doh.ffmuc.net",endpoint:{protocol:"https:",host:"doh.ffmuc.net"},description:"An open (non-logging, non-filtering, non-censoring) DoH resolver operated by Freifunk Munich with nodes in DE.\nhttps://ffmuc.net/",country:"Germany",location:{lat:51.2993,long:9.491}},{name:"doh.tiarap.org",endpoint:{protocol:"https:",host:"doh.tiarap.org"},description:"Non-Logging DNS-over-HTTPS server, cached via Cloudflare.\nFilters out ads, trackers and malware, NO ECS, supports DNSSEC.",country:"United States",location:{lat:37.751,long:-97.822},filter:!0},{name:"google",endpoint:{protocol:"https:",host:"dns.google",ipv4:"8.8.8.8",cors:!0},description:"Google DNS (anycast)",country:"United States",location:{lat:37.751,long:-97.822},log:!0,cors:!0},{name:"hdns",endpoint:{protocol:"https:",host:"query.hdns.io",cors:!0},description:"HDNS is a public DNS resolver that supports Handshake domains.\nhttps://www.hdns.io",country:"United States",location:{lat:37.7771,long:-122.406},cors:!0},{name:"he",endpoint:{protocol:"https:",host:"ordns.he.net"},description:"Hurricane Electric DoH server (anycast)\nUnknown logging policy.",country:"United States",location:{lat:37.751,long:-97.822},log:!0},{name:"id-gmail-doh",endpoint:{protocol:"https:",host:"doh.tiar.app"},description:"Non-Logging DNS-over-HTTPS server located in Singapore.\nFilters out ads, trackers and malware, supports DNSSEC, provided by id-gmail.",country:"Singapore",location:{lat:1.2929,long:103.8547},filter:!0},{name:"iij",endpoint:{protocol:"https:",host:"public.dns.iij.jp"},description:"DoH server operated by Internet Initiative Japan in Tokyo.\nhttps://www.iij.ad.jp/",country:"Japan",location:{lat:35.69,long:139.69},log:!0},{name:"iqdns-doh",endpoint:{protocol:"https:",host:"a.passcloud.xyz"},description:'Non-logging DoH service runned by V2EX.com user johnsonwil.\nReturns "no such domain" for anti-Chinese government websites. Supports DNSSEC.\nFor more information: https://www.v2ex.com/t/785666',filter:!0},{name:"jp.tiar.app-doh",endpoint:{protocol:"https:",host:"jp.tiar.app"},description:"Non-Logging, Non-Filtering DNS-over-HTTPS server in Japan.\nNo ECS, Support DNSSEC",country:"Japan",location:{lat:35.6882,long:139.7532}},{name:"jp.tiarap.org",endpoint:{protocol:"https:",host:"jp.tiarap.org"},description:"DNS-over-HTTPS Server. Non-Logging, Non-Filtering, No ECS, Support DNSSEC.\nCached via Cloudflare."},{name:"libredns",endpoint:{protocol:"https:",host:"doh.libredns.gr"},description:"DoH server in Germany. No logging, but no DNS padding and no DNSSEC support.\nhttps://libredns.gr/",country:"Germany",location:{lat:51.2993,long:9.491}},{name:"nextdns",endpoint:{protocol:"https:",host:"anycsast.dns.nextdns.io"},description:"NextDNS is a cloud-based private DNS service that gives you full control\nover what is allowed and what is blocked on the Internet.\nDNSSEC, Anycast, Non-logging, NoFilters\nhttps://www.nextdns.io/",country:"Netherlands",location:{lat:52.3891,long:4.6563}},{name:"nextdns-ultralow",endpoint:{protocol:"https:",host:"dns.nextdns.io",path:"/dnscrypt-proxy"},description:'NextDNS is a cloud-based private DNS service that gives you full control\nover what is allowed and what is blocked on the Internet.\nhttps://www.nextdns.io/\nTo select the server location, the "-ultralow" variant relies on bootstrap servers\ninstead of anycast.'},{name:"njalla-doh",endpoint:{protocol:"https:",host:"dns.njal.la",cors:!0},description:"Non-logging DoH server in Sweden operated by Njalla.\nhttps://dns.njal.la/",country:"Sweden",location:{lat:59.3247,long:18.056},cors:!0},{name:"odoh-cloudflare",endpoint:{protocol:"https:",host:"odoh.cloudflare-dns.com",cors:!0},description:"Cloudflare ODoH server.\nhttps://cloudflare.com",cors:!0},{name:"odoh-crypto-sx",endpoint:{protocol:"https:",host:"odoh.crypto.sx",cors:!0},description:"ODoH target server. Anycast, no logs.\nBackend hosted by Scaleway. Maintained by Frank Denis.",cors:!0},{name:"odoh-id-gmail",endpoint:{protocol:"https:",host:"doh.tiar.app",path:"/odoh"},description:"ODoH target server. Based in Singapore, no logs.\nFilter ads, trackers and malware.",filter:!0},{name:"odoh-jp.tiar.app",endpoint:{protocol:"https:",host:"jp.tiar.app",path:"/odoh"},description:"ODoH target server. no logs."},{name:"odoh-jp.tiarap.org",endpoint:{protocol:"https:",host:"jp.tiarap.org",path:"/odoh"},description:"ODoH target server via Cloudflare, no logs."},{name:"odoh-resolver4.dns.openinternet.io",endpoint:{protocol:"https:",host:"resolver4.dns.openinternet.io"},description:"ODoH target server. no logs, no filter, DNSSEC.\nRunning on dedicated hardware colocated at Sonic.net in Santa Rosa, CA in the United States.\nUses Sonic's recusrive DNS servers as upstream resolvers (but is not affiliated with Sonic\nin any way). Provided by https://openinternet.io"},{name:"odoh-tiarap.org",endpoint:{protocol:"https:",host:"doh.tiarap.org",path:"/odoh"},description:"ODoH target server via Cloudflare, no logs.\nFilter ads, trackers and malware.",filter:!0},{name:"publicarray-au2-doh",endpoint:{protocol:"https:",host:"doh-2.seby.io",cors:!0},description:"DNSSEC • OpenNIC • Non-logging • Uncensored - hosted on ovh.com.au\nMaintained by publicarray - https://dns.seby.io",country:"Australia",location:{lat:-33.8591,long:151.2002},cors:!0},{name:"puredns-doh",endpoint:{protocol:"https:",host:"puredns.org",ipv4:"146.190.6.13",cors:!0},description:"Public uncensored DNS resolver in Singapore - https://puredns.org\n** Only available in Indonesia and Singapore **",country:"United States",location:{lat:37.751,long:-97.822},cors:!0},{name:"quad101",endpoint:{protocol:"https:",host:"dns.twnic.tw",cors:!0},description:"DNSSEC-aware public resolver by the Taiwan Network Information Center (TWNIC)\nhttps://101.101.101.101/index_en.html",cors:!0},{name:"quad9-doh-ip4-port443-filter-ecs-pri",endpoint:{protocol:"https:",host:"dns11.quad9.net",ipv4:"149.112.112.11"},description:"Quad9 (anycast) dnssec/no-log/filter/ecs 9.9.9.11 - 149.112.112.11",country:"United States",location:{lat:37.751,long:-97.822},filter:!0},{name:"quad9-doh-ip4-port443-filter-pri",endpoint:{protocol:"https:",host:"dns.quad9.net",ipv4:"149.112.112.112"},description:"Quad9 (anycast) dnssec/no-log/filter 9.9.9.9 - 149.112.112.9 - 149.112.112.112",country:"United States",location:{lat:37.751,long:-97.822},filter:!0},{name:"quad9-doh-ip4-port443-nofilter-ecs-pri",endpoint:{protocol:"https:",host:"dns12.quad9.net",ipv4:"9.9.9.12"},description:"Quad9 (anycast) no-dnssec/no-log/no-filter/ecs 9.9.9.12 - 149.112.112.12",country:"United States",location:{lat:37.751,long:-97.822}},{name:"quad9-doh-ip4-port443-nofilter-pri",endpoint:{protocol:"https:",host:"dns10.quad9.net",ipv4:"149.112.112.10"},description:"Quad9 (anycast) no-dnssec/no-log/no-filter 9.9.9.10 - 149.112.112.10",country:"United States",location:{lat:37.751,long:-97.822}},{name:"quad9-doh-ip6-port5053-filter-pri",endpoint:{protocol:"https:",host:"dns9.quad9.net"},description:"Quad9 (anycast) dnssec/no-log/filter 2620:fe::fe - 2620:fe::9 - 2620:fe::fe:9",country:"United States",location:{lat:37.751,long:-97.822},filter:!0},{name:"safesurfer-doh",endpoint:{protocol:"https:",host:"doh.safesurfer.io"},description:"Family safety focused blocklist for over 2 million adult sites, as well as phishing and malware and more.\nFree to use, paid for customizing blocking for more categories+sites and viewing usage at my.safesurfer.io. Logs taken for viewing\nusage, data never sold - https://safesurfer.io",filter:!0,log:!0},{name:"sth-ads-doh-se",endpoint:{protocol:"https:",host:"dnsse-noads.alekberg.net"},description:"Resolver in Stockholm, Sweden. DoH server. Non-logging, remove ads and malware, DNSSEC.",country:"Bulgaria",location:{lat:42.696,long:23.332},filter:!0},{name:"sth-doh-se",endpoint:{protocol:"https:",host:"dnsse.alekberg.net"},description:"Resolver in Stockholm, Sweden. DoH server. Non-logging, non-filtering, DNSSEC.",country:"Bulgaria",location:{lat:42.696,long:23.332}},{name:"switch",endpoint:{protocol:"https:",host:"dns.switch.ch"},description:"Public DoH service provided by SWITCH in Switzerland\nhttps://www.switch.ch\nProvides protection against malware, but does not block ads.",filter:!0},{name:"uncensoreddns-dk-ipv4",endpoint:{protocol:"https:",host:"unicast.uncensoreddns.org"},description:"Also known as censurfridns.\nDoH, no logs, no filter, DNSSEC, unicast hosted in Denmark - https://blog.uncensoreddns.org",country:"Denmark",location:{lat:55.7123,long:12.0564}},{name:"uncensoreddns-ipv4",endpoint:{protocol:"https:",host:"anycast.uncensoreddns.org"},description:"Also known as censurfridns.\nDoH, no logs, no filter, DNSSEC, anycast - https://blog.uncensoreddns.org",country:"Denmark",location:{lat:55.7123,long:12.0564}},{name:"v.dnscrypt.uk-doh-ipv4",endpoint:{protocol:"https:",host:"v.dnscrypt.uk"},description:"DoH, no logs, uncensored, DNSSEC. Hosted in London UK on Digital Ocean\nhttps://www.dnscrypt.uk",country:"United Kingdom",location:{lat:51.4964,long:-.1224}}],time:1654187067783});const VE=new bE("https://martinheidegger.github.io/dns-query/resolvers.json");function jE(e){return/^@/.test(e)}const KE=new class{constructor(e){this.opts=Object.assign({timeout:5e3,update:!0,updateURL:VE,persist:!1,localStoragePrefix:"dnsquery_",maxAge:3e5},e),this._dataP=null}_data(e,t){return e||null===this._dataP?(this._dataP=this.opts.update?async function(e,t,r,n){const s=t?t.localStoragePrefix+t.name:null;if(s)try{const e=JSON.parse(localStorage.getItem(s));if(e&&e.time>t.maxTime)return e}catch(e){}const{data:o}=await $E(e,"GET",null,r,void 0),i={time:Date.now(),data:JSON.parse(yv(o))};if(s)try{localStorage.setItem(s,JSON.stringify(i))}catch(e){i.time=null}return i}(this.opts.updateURL,this.opts.persist?{name:"resolvers.json",localStoragePrefix:this.opts.localStoragePrefix,maxTime:Date.now()-this.opts.maxAge}:null,this.opts.timeout).then((e=>HE({data:e.data.resolvers,time:e.time}))).catch((()=>t||qE)):Promise.resolve(qE),this._dataP):this._dataP.then((e=>e.timee.data))}endpoints(e){if(null==e)return this.data().then((e=>e.endpoints));if("doh"===e&&(e=WE),"dns"===e&&(e=YE),"function"==typeof e)return this.data().then((t=>t.endpoints.filter(e)));if("string"==typeof e||"function"!=typeof e[Symbol.iterator])return Promise.reject(new Error(`Endpoints (${e}) needs to be iterable (array).`));if(-1===(e=Array.from(e).filter(Boolean)).findIndex(jE))try{return Promise.resolve(e.map(UE))}catch(e){return Promise.reject(e)}return this.data().then((t=>e.map((e=>{if(jE(e)){const r=t.endpointByName[e.substring(1)];if(!r)throw new Error(`Endpoint ${e} is not known.`);return r}return UE(e)}))))}};function zE(e,t){return t=Object.assign({retries:5,timeout:3e4},t),e.question?(r=t.endpoints,function(e){return null!==e&&"object"==typeof e&&"function"==typeof e.then}(r)?r:Promise.resolve(r)).then((r=>{if(!Array.isArray(r)||0===r.length)throw new Error("No endpoints defined to lookup dns records.");return GE(r.map(UE),function(e){const t=Object.assign({type:"query"},e);return delete t.question,t.questions=[],e.question&&t.questions.push(e.question),t}(e),t)})).then((e=>(e.question=e.questions[0],delete e.questions,e))):Promise.reject(new Error("To request data you need to specify a .question!"));var r}function GE(e,t,r){const n=1===e.length?e[0]:e[Math.floor(Math.random()*e.length)%e.length];return function(e,t,r,n){return n&&n.aborted?Promise.reject(new mE):"udp4:"===e.protocol||"udp6:"===e.protocol?function(){throw new Error('Only "doh" endpoints are supported in the browser')}():function(e,t,r,n){return function(e,t,r,n,s){return $E(e,t,r,n,s)}(e.url,e.method,lE(Object.assign({flags:sE},t)),r,n).then((function(e){const t=e.data,r=e.response;let n=e.error;if(void 0===n)if(0===t.length)n=new vE("Empty.");else try{const e=uE(t);return e.response=r,e}catch(e){n=new vE("Invalid packet (cause="+e.message+")",e)}throw Object.assign(n,{response:r})}))}(e,t,r,n)}(n,t,r.timeout,r.signal).then((e=>(e.endpoint=n.toString(),e)),(s=>{if("AbortError"===s.name||0===r.retries)throw s.endpoint=n.toString(),s;return r.retries>0&&(r.retries-=1),GE(e,t,r)}))}function WE(e){return"https:"===e.protocol||"http:"===e.protocol}function YE(e){return"udp4:"===e.protocol||"udp6:"===e.protocol}const JE=new An("dns-over-https");class XE{endpoints;retries;static async create(e,t){const r=e??await KE.endpoints("doh");return new XE(r,t)}constructor(e,t=3){this.endpoints=e,this.retries=t}async resolveTXT(e){let t;try{t=(await zE({question:{type:"TXT",name:e}},{endpoints:this.endpoints,retries:this.retries})).answers}catch(e){throw JE.error("query failed: ",e),new Error("DNS query failed")}if(!t)throw new Error(`Could not resolve ${e}`);const r=t.map((e=>e.data)),n=[];return r.forEach((e=>{"string"==typeof e?n.push(e):Array.isArray(e)?e.forEach((e=>{"string"==typeof e?n.push(e):n.push(cn(e))})):n.push(cn(e))})),n}}var QE=__webpack_require__(5818);class ZE{static RECORD_PREFIX=Iw.RECORD_PREFIX;static TREE_PREFIX="enrtree:";static BRANCH_PREFIX="enrtree-branch:";static ROOT_PREFIX="enrtree-root:";static parseAndVerifyRoot(e,t){if(!e.startsWith(this.ROOT_PREFIX))throw new Error(`ENRTree root entry must start with '${this.ROOT_PREFIX}'`);const r=ZE.parseRootValues(e),n=QE.decode.asBytes(t),s=e.split(" sig")[0],o=ln(s);if(!hw(Nt(r.signature,"base64url").slice(0,64),uw(o),new Uint8Array(n)))throw new Error("Unable to verify ENRTree root signature");return r.eRoot}static parseRootValues(e){const t=e.match(/^enrtree-root:v1 e=([^ ]+) l=([^ ]+) seq=(\d+) sig=([^ ]+)$/);if(!Array.isArray(t))throw new Error("Could not parse ENRTree root entry");t.shift();const[r,n,s,o]=t;if(!r)throw new Error("Could not parse 'e' value from ENRTree root entry");if(!n)throw new Error("Could not parse 'l' value from ENRTree root entry");if(!s)throw new Error("Could not parse 'seq' value from ENRTree root entry");if(!o)throw new Error("Could not parse 'sig' value from ENRTree root entry");return{eRoot:r,lRoot:n,seq:Number(s),signature:o}}static parseTree(e){if(!e.startsWith(this.TREE_PREFIX))throw new Error(`ENRTree tree entry must start with '${this.TREE_PREFIX}'`);const t=e.match(/^enrtree:\/\/([^@]+)@(.+)$/);if(!Array.isArray(t))throw new Error("Could not parse ENRTree tree entry");t.shift();const[r,n]=t;if(!r)throw new Error("Could not parse public key from ENRTree tree entry");if(!n)throw new Error("Could not parse domain from ENRTree tree entry");return{publicKey:r,domain:n}}static parseBranch(e){if(!e.startsWith(this.BRANCH_PREFIX))throw new Error(`ENRTree branch entry must start with '${this.BRANCH_PREFIX}'`);return e.split(this.BRANCH_PREFIX)[1].split(",")}}const eS=new An("discovery:fetch_nodes");function tS(e,t){return t.relay>=e.relay&&t.store>=e.store&&t.filter>=e.filter&&t.lightPush>=e.lightPush}function rS(e,t){if(!e.nodeId)return!1;for(const r of t)if(e.nodeId===r.nodeId)return!1;return!0}function nS(e,t){e.relay&&(t.relay+=1),e.store&&(t.store+=1),e.filter&&(t.filter+=1),e.lightPush&&(t.lightPush+=1)}function sS(e,t,r){if(tS(t,r))throw"Internal Error: Waku2 wanted capabilities are already fulfilled";const n=function(e,t){return{relay:t.relaythis._search(s,o)));return oS.info("retrieved peers: ",i.map((e=>({id:e.peerId?.toString(),multiaddrs:e.multiaddrs?.map((e=>e.toString()))})))),i}constructor(e){this._DNSTreeCache={},this.dns=e}async*getNextPeer(e,t){const r=Math.floor(Math.random()*e.length),{publicKey:n,domain:s}=ZE.parseTree(e[r]),o={domain:s,publicKey:n,visits:{}};for await(const e of async function*(e,t,r){const n={relay:e.relay??0,store:e.store??0,filter:e.filter??0,lightPush:e.lightPush??0},s=n.relay+n.store+n.filter+n.lightPush,o={relay:0,store:0,filter:0,lightPush:0};let i=0;const a=new Set;for(;!tS(n,o)&&ithis._search(s,o))))yield e}async _search(e,t){try{const r=await this._getTXTRecord(e,t);let n,s;t.visits[e]=!0;const o=function(e){return e.startsWith(ZE.ROOT_PREFIX)?ZE.ROOT_PREFIX:e.startsWith(ZE.BRANCH_PREFIX)?ZE.BRANCH_PREFIX:e.startsWith(ZE.RECORD_PREFIX)?ZE.RECORD_PREFIX:""}(r);try{switch(o){case ZE.ROOT_PREFIX:return n=ZE.parseAndVerifyRoot(r,t.publicKey),await this._search(n,t);case ZE.BRANCH_PREFIX:return s=ZE.parseBranch(r),n=function(e,t){const r={};for(const[n,s]of e.entries())t.visits[s]&&(r[n]=!0);if(Object.keys(r).length===e.length)throw new Error("Unresolvable circular path detected");let n;do{n=Math.floor(Math.random()*e.length)}while(r[n]);return e[n]}(s,t),await this._search(n,t);case ZE.RECORD_PREFIX:return Zw.fromString(r);default:return null}}catch(t){return oS.error(`Failed to search DNS tree ${o} at subdomain ${e}: ${t}`),null}}catch(t){return oS.error(`Failed to retrieve TXT record at subdomain ${e}: ${t}`),null}}async _getTXTRecord(e,t){if(this._DNSTreeCache[e])return this._DNSTreeCache[e];const r=e!==t.domain?`${e}.${t.domain}`:t.domain,n=await this.dns.resolveTXT(r);if(!n.length)throw new Error("Received empty result array while fetching TXT record");if(!n[0].length)throw new Error("Received empty TXT record");const s=n.join("");return this._DNSTreeCache[e]=s,s}}const aS=new An("peer-discovery-dns");class cS extends Fs{nextPeer;_started;_components;_options;constructor(e,t){super(),this._started=!1,this._components=e,this._options=t;const{enrUrls:r}=t;aS.info("Use following EIP-1459 ENR Tree URLs: ",r)}async start(){aS.info("Starting peer discovery via dns"),this._started=!0,await this.findPeers()}async findPeers(){if(!this.nextPeer){let{enrUrls:e}=this._options;Array.isArray(e)||(e=[e]);const{wantedNodeCapabilityCount:t}=this._options,r=await iS.dnsOverHttp();this.nextPeer=r.getNextPeer.bind(r,e,t)}for await(const e of this.nextPeer()){if(!this._started)return;const{peerInfo:t,shardInfo:r}=e;if(!t)continue;const n={[ob]:{value:this._options.tagValue??50,ttl:this._options.tagTTL??1e8}};let s=!1;await this._components.peerStore.has(t.id)?(await this._components.peerStore.get(t.id)).tags.has(ob)||(s=!0,await this._components.peerStore.merge(t.id,{tags:n})):(s=!0,await this._components.peerStore.save(t.id,{tags:n,...r&&{metadata:{shardInfo:wn(r)}}})),s&&this.dispatchEvent(new $s("peer",{detail:t}))}}stop(){this._started=!1}get[Sd](){return!0}get[Symbol.toStringTag](){return en}}function lS(e,t=ib){return r=>new cS(r,{enrUrls:e,wantedNodeCapabilityCount:t})}class uS{proto;constructor(e){this.proto=e}static createRequest(e){const{numPeers:t}=e;return new uS({query:{numPeers:t},response:void 0})}encode(){return br.encode(this.proto)}static decode(e){const t=br.decode(e);return new uS(t)}get query(){return this.proto.query}get response(){return this.proto.response}}const hS="/vac/waku/peer-exchange/2.0.0-alpha1",dS=new An("peer-exchange");class pS extends is{constructor(e,t){super(hS,e,dS,t)}async query(e){const{numPeers:t,peerId:r}=e,n=uS.createRequest({numPeers:BigInt(t)}),s=await this.peerStore.get(r);if(!s)return{peerInfos:null,error:Jr.NO_PEER_AVAILABLE};let o;try{o=await this.getStream(s)}catch(e){return dS.error("Failed to get stream",e),{peerInfos:null,error:Jr.NO_STREAM_AVAILABLE}}const i=await Zn([n.encode()],Fn,o,zn,(async e=>await Nn(e)));try{const e=new Bn;i.forEach((t=>{e.append(t)}));const{response:t}=uS.decode(e);return t?{peerInfos:await Promise.all(t.peerInfos.map((e=>e.enr)).filter(kr).map((async e=>({ENR:await Zw.fromRLP(e)})))),error:null}:(dS.error("PeerExchangeRPC message did not contains a `response` field"),{peerInfos:null,error:Jr.EMPTY_PAYLOAD})}catch(e){return dS.error("Failed to decode push reply",e),{peerInfos:null,error:Jr.DECODE_FAILED}}}}const fS=new An("peer-exchange-discovery"),gS=1e4,yS=3,mS=Xr.PEER_EXCHANGE;class bS extends Fs{components;peerExchange;options;isStarted;queryingPeers=new Set;queryAttempts=new Map;handleDiscoveredPeer=e=>{const{protocols:t,peerId:r}=e.detail;t.includes(hS)&&!this.queryingPeers.has(r.toString())&&(this.queryingPeers.add(r.toString()),this.startRecurringQueries(r).catch((e=>fS.error(`Error querying peer ${e}`))))};constructor(e,t,r={}){super(),this.components=e,this.peerExchange=new pS(e,t),this.options=r,this.isStarted=!1}start(){this.isStarted||(this.dispatchEvent(new $s("waku:peer-exchange:started",{detail:!0})),fS.info("Starting peer exchange node discovery, discovering peers"),this.components.events.addEventListener("peer:identify",this.handleDiscoveredPeer))}stop(){this.isStarted&&(fS.info("Stopping peer exchange node discovery"),this.isStarted=!1,this.queryingPeers.clear(),this.components.events.removeEventListener("peer:identify",this.handleDiscoveredPeer))}get[Sd](){return!0}get[Symbol.toStringTag](){return"@waku/peer-exchange"}startRecurringQueries=async e=>{const t=e.toString(),{queryInterval:r=gS,maxRetries:n=yS}=this.options;fS.info(`Querying peer: ${t} (attempt ${this.queryAttempts.get(t)??1})`),await this.query(e);const s=this.queryAttempts.get(t)??1;s>n?this.abortQueriesForPeer(t):setTimeout((()=>{this.queryAttempts.set(t,s+1),this.startRecurringQueries(e).catch((e=>{fS.error(`Error in startRecurringQueries: ${e}`)}))}),r*s)};async query(e){const{error:t,peerInfos:r}=await this.peerExchange.query({numPeers:10,peerId:e});if(t)return fS.error("Peer exchange query failed",t),{error:t,peerInfos:null};for(const e of r){const{ENR:t}=e;if(!t){fS.warn("No ENR in peerInfo object, skipping");continue}const{peerId:r,peerInfo:n,shardInfo:s}=t;if(r&&n){if(await this.components.peerStore.has(r)){const{hasMultiaddrDiff:e,hasShardDiff:t}=await this.checkPeerInfoDiff(n,s);if(e||t){fS.info(`Peer ${r.toString()} has updated multiaddrs or shardInfo, updating`),e&&(fS.info(`Peer ${r.toString()} has updated multiaddrs, updating`),await this.components.peerStore.patch(r,{multiaddrs:n.multiaddrs})),t&&s&&(fS.info(`Peer ${r.toString()} has updated shardInfo, updating`),await this.components.peerStore.merge(r,{metadata:{shardInfo:wn(s)}}),this.dispatchEvent(new $s("peer",{detail:{id:r,multiaddrs:n.multiaddrs}})));continue}}await this.components.peerStore.save(r,{tags:{[mS]:{value:this.options.tagValue??50,ttl:this.options.tagTTL??1e8}},...s&&{metadata:{shardInfo:wn(s)}},...n.multiaddrs&&{multiaddrs:n.multiaddrs}}),fS.info(`Discovered peer: ${r.toString()}`),this.dispatchEvent(new $s("peer",{detail:{id:r,multiaddrs:n.multiaddrs}}))}}return{error:null,peerInfos:r}}abortQueriesForPeer(e){fS.info(`Aborting queries for peer: ${e}`),this.queryingPeers.delete(e),this.queryAttempts.delete(e)}async checkPeerInfoDiff(e,t){const{id:r}=e,n=await this.components.peerStore.get(r),s=n.addresses.map((e=>e.multiaddr.toString())),o=e.multiaddrs.map((e=>e.toString())),i=s.some((e=>!o.includes(e)));let a=!1;const c=n.metadata.get("shardInfo");if(c){const e=bn(c);(e||t)&&(a=e.clusterId!==t?.clusterId||e.shards.some((e=>!t?.shards.includes(e))))}return{hasMultiaddrDiff:i,hasShardDiff:a}}}function wS(e){return t=>new bS(t,e)}const vS=new An("peer-exchange-discovery"),ES=Xr.LOCAL;class SS extends Fs{components;options;isStarted;peers=[];constructor(e,t){super(),this.components=e,this.options=t,this.isStarted=!1,this.peers=this.getPeersFromLocalStorage()}get[Symbol.toStringTag](){return"@waku/local-peer-cache-discovery"}async start(){if(!this.isStarted){vS.info("Starting Local Storage Discovery"),this.components.events.addEventListener("peer:identify",this.handleNewPeers);for(const{id:e,address:t}of this.peers){const r=await vg({id:e});await this.components.peerStore.has(r)||(await this.components.peerStore.save(r,{multiaddrs:[Mo(t)],tags:{[this.options?.tagName??ES]:{value:this.options?.tagValue??50,ttl:this.options?.tagTTL??1e8}}}),this.dispatchEvent(new $s("peer",{detail:{id:r,multiaddrs:[Mo(t)]}})))}vS.info(`Discovered ${this.peers.length} peers`),this.isStarted=!0}}stop(){this.isStarted&&(vS.info("Stopping Local Storage Discovery"),this.components.events.removeEventListener("peer:identify",this.handleNewPeers),this.isStarted=!1,this.savePeersToLocalStorage())}handleNewPeers=e=>{const{peerId:t,listenAddrs:r}=e.detail,n=function(e){const t=e.find((e=>e.toString().includes("ws")||e.toString().includes("wss")));if(!t)throw new Error("No ws multiaddr found in the given addresses");return t}(r),s=this.getPeersFromLocalStorage(),o=s.findIndex((e=>e.id===t.toString()));o>=0?s[o].address=n.toString():s.push({id:t.toString(),address:n.toString()}),this.peers=s,this.savePeersToLocalStorage()};getPeersFromLocalStorage(){try{const e=localStorage.getItem("waku:peers");return e?JSON.parse(e).filter(AS):[]}catch(e){return vS.error("Error parsing peers from local storage:",e),[]}}savePeersToLocalStorage(){try{localStorage.setItem("waku:peers",JSON.stringify(this.peers))}catch(e){vS.error("Error saving peers to local storage:",e)}}}function AS(e){return e&&"object"==typeof e&&"string"==typeof e.id&&"string"==typeof e.address}const _S=new An("sdk:create");async function kS(e,t,r){t?.hideWebSocketInfo||(console.info("%cIgnore WebSocket connection failures","background: gray; color: white; font-size: x-large"),console.info("%cWaku tries to discover peers and some of them are expected to fail","background: gray; color: white; font-size: x-large"));const n=e?{metadata:Js(e)}:{};return async function(e={}){const t=await async function(e={}){const t=e.peerId??=await bg();if(null==t.privateKey)throw new eo("peer id was missing private key","ERR_MISSING_PRIVATE_KEY");return e.privateKey??=await qu(t.privateKey),new nb(await async function(e){const t=$y(Vy,e);if(null===t.connectionProtector&&null!=globalThis.process?.env?.LIBP2P_FORCE_PNET)throw new eo(Hy.ERR_PROTECTOR_REQUIRED,qy.ERR_PROTECTOR_REQUIRED);if(null!=t.privateKey&&!(await sh(t.privateKey.public.bytes,t.privateKey.bytes)).equals(t.peerId))throw new eo("Private key doesn't match peer id",qy.ERR_INVALID_KEY);return t}(e))}(e);return!1!==e.start&&await t.start(),t}({connectionManager:{minConnections:1},transports:[tg({filter:!1===t?.filterMultiaddrs?Qf:Zf})],streamMuxers:[xf()],connectionEncryption:[Ed()],...t,services:{identify:af({agentVersion:r??Yo}),ping:Df({maxInboundStreams:t?.pingMaxInboundStreams??Jo}),...n,...t?.services}})}async function IS(e={}){const{libp2p:t,pubsubTopics:r}=await async function(e){const{networkConfig:t}=e,r=function(e){if("clusterId"in(t=e)&&"shards"in t&&!("contentTopics"in t)){if(0===e.shards.length)throw new Error("Invalid shards configuration: please provide at least one shard");return dn(e)}if(function(e){return"contentTopics"in e}(e)){if(0===e.contentTopics.length)throw new Error("Invalid content topics configuration: please provide at least one content topic");return e.contentTopics.map((t=>yn(t,e.clusterId)))}throw new Error("Unknown shard config. Please use ShardInfo or ContentTopicInfo");var t}(t??rn);_S.info("Creating Waku node with pubsub topics",r);const n=e?.libp2p??{},s=n.peerDiscovery??[];var o;return e?.defaultBootstrap&&s.push(...function(e){return[lS([sb.SANDBOX,sb.TEST]),(e,t)=>new SS(e,t),wS(e)]}(r)),e?.bootstrapPeers&&s.push((o={list:e.bootstrapPeers},e=>new tp(e,o))),n.peerDiscovery=s,{libp2p:await kS(r,n,e?.userAgent),pubsubTopics:r}}(e);return new Qo(r,e,t,{store:!0,lightpush:!0,filter:!0})}var RS,TS=__webpack_require__(2549),CS=function(e,t,r,n){return new(r||(r=Promise))((function(s,o){function i(e){try{c(n.next(e))}catch(e){o(e)}}function a(e){try{c(n.throw(e))}catch(e){o(e)}}function c(e){var t;e.done?s(e.value):(t=e.value,t instanceof r?t:new r((function(e){e(t)}))).then(i,a)}c((n=n.apply(e,t||[])).next())}))},NS=function(e,t){var r,n,s,o,i={label:0,sent:function(){if(1&s[0])throw s[1];return s[1]},trys:[],ops:[]};return o={next:a(0),throw:a(1),return:a(2)},"function"==typeof Symbol&&(o[Symbol.iterator]=function(){return this}),o;function a(a){return function(c){return function(a){if(r)throw new TypeError("Generator is already executing.");for(;o&&(o=0,a[0]&&(i=0)),i;)try{if(r=1,n&&(s=2&a[0]?n.return:a[0]?n.throw||((s=n.return)&&s.call(n),0):n.next)&&!(s=s.call(n,a[1])).done)return s;switch(n=0,s&&(a=[2&a[0],s.value]),a[0]){case 0:case 1:s=a;break;case 4:return i.label++,{value:a[1],done:!1};case 5:i.label++,n=a[1],a=[0];continue;case 7:a=i.ops.pop(),i.trys.pop();continue;default:if(!((s=(s=i.trys).length>0&&s[s.length-1])||6!==a[0]&&2!==a[0])){i=0;continue}if(3===a[0]&&(!s||a[1]>s[0]&&a[1]0?[4,this.send(this.queue)]:[3,2];case 1:e.sent()&&(console.log("Sent ",this.queue.length," telemetry logs"),this.queue=[]),e.label=2;case 2:return[2]}}))}))}),this.intervalPeriod)),[2]}))}))},e.prototype.stop=function(){this.intervalId&&(clearInterval(this.intervalId),this.intervalId=null)},e.prototype.send=function(e){return CS(this,void 0,void 0,(function(){var t,r,n,s=this;return NS(this,(function(o){switch(o.label){case 0:t=e.map((function(e){return{id:++s.requestId,telemetryType:e.messageType.toString(),telemetryData:e}})),o.label=1;case 1:return o.trys.push([1,3,,4]),[4,fetch(this.url,{method:"POST",body:JSON.stringify(t)})];case 2:return 201!==(r=o.sent()).status?(console.error("Error sending messages to telemetry service: ",r.status,r.statusText,r.json),[2,!1]):[2,!0];case 3:return n=o.sent(),console.error("Error sending messages to telemetry service: ",n),console.error("Failed trying to send the following messages: ",t),[2,!1];case 4:return[2]}}))}))},e}(),PS=function(e){return t=void 0,r=void 0,s=function(){var t,r,n;return function(e,t){var r,n,s,o,i={label:0,sent:function(){if(1&s[0])throw s[1];return s[1]},trys:[],ops:[]};return o={next:a(0),throw:a(1),return:a(2)},"function"==typeof Symbol&&(o[Symbol.iterator]=function(){return this}),o;function a(a){return function(c){return function(a){if(r)throw new TypeError("Generator is already executing.");for(;o&&(o=0,a[0]&&(i=0)),i;)try{if(r=1,n&&(s=2&a[0]?n.return:a[0]?n.throw||((s=n.return)&&s.call(n),0):n.next)&&!(s=s.call(n,a[1])).done)return s;switch(n=0,s&&(a=[2&a[0],s.value]),a[0]){case 0:case 1:s=a;break;case 4:return i.label++,{value:a[1],done:!1};case 5:i.label++,n=a[1],a=[0];continue;case 7:a=i.ops.pop(),i.trys.pop();continue;default:if(!((s=(s=i.trys).length>0&&s[s.length-1])||6!==a[0]&&2!==a[0])){i=0;continue}if(3===a[0]&&(!s||a[1]>s[0]&&a[1]0&&s[s.length-1])||6!==a[0]&&2!==a[0])){i=0;continue}if(3===a[0]&&(!s||a[1]>s[0]&&a[1]0&&(e.push([{messageType:RS.LIGHT_PUSH_FILTER,timestamp:Math.floor((new Date).getTime()/1e3),peerIdSender:r,peerIdReporter:r,sequenceHash:i,sequenceTotal:a,sequenceIndex:c,contentTopic:LS,pubsubTopic:yn(LS)}]),d=document.createElement("div"),p=document.getElementById("messagesSent"),d.textContent="Message: ".concat(i," ").concat(c," of ").concat(a),p.insertBefore(d,p.firstChild),p.insertBefore(document.createElement("br"),p.firstChild),document.dispatchEvent(MS),c++),h.failures.length>0&&e.push(h.failures.map((function(e){var t;return{messageType:RS.LIGHT_PUSH_ERROR,timestamp:Math.floor((new Date).getTime()/1e3),peerId:r,peerIdRemote:null===(t=e.peerId)||void 0===t?void 0:t.toString(),errorMessage:e.error.toString(),contentTopic:LS}}))),c{var __webpack_modules__={8045:e=>{"use strict";e.exports=function(e,t){for(var r=new Array(arguments.length-1),n=0,s=2,o=!0;s{"use strict";var r=t;r.length=function(e){var t=e.length;if(!t)return 0;for(var r=0;--t%4>1&&"="===e.charAt(t);)++r;return Math.ceil(3*e.length)/4-r};for(var n=new Array(64),s=new Array(123),o=0;o<64;)s[n[o]=o<26?o+65:o<52?o+71:o<62?o-4:o-59|43]=o++;r.encode=function(e,t,r){for(var s,o=null,i=[],a=0,c=0;t>2],s=(3&l)<<4,c=1;break;case 1:i[a++]=n[s|l>>4],s=(15&l)<<2,c=2;break;case 2:i[a++]=n[s|l>>6],i[a++]=n[63&l],c=0}a>8191&&((o||(o=[])).push(String.fromCharCode.apply(String,i)),a=0)}return c&&(i[a++]=n[s],i[a++]=61,1===c&&(i[a++]=61)),o?(a&&o.push(String.fromCharCode.apply(String,i.slice(0,a))),o.join("")):String.fromCharCode.apply(String,i.slice(0,a))};var i="invalid encoding";r.decode=function(e,t,r){for(var n,o=r,a=0,c=0;c1)break;if(void 0===(l=s[l]))throw Error(i);switch(a){case 0:n=l,a=1;break;case 1:t[r++]=n<<2|(48&l)>>4,n=l,a=2;break;case 2:t[r++]=(15&n)<<4|(60&l)>>2,n=l,a=3;break;case 3:t[r++]=(3&n)<<6|l,a=0}}if(1===a)throw Error(i);return r-o},r.test=function(e){return/^(?:[A-Za-z0-9+/]{4})*(?:[A-Za-z0-9+/]{2}==|[A-Za-z0-9+/]{3}=)?$/.test(e)}},8561:e=>{"use strict";function t(e,r){"string"==typeof e&&(r=e,e=void 0);var n=[];function s(e){if("string"!=typeof e){var r=o();if(t.verbose&&console.log("codegen: "+r),r="return "+r,e){for(var i=Object.keys(e),a=new Array(i.length+1),c=new Array(i.length),l=0;l{"use strict";function t(){this._listeners={}}e.exports=t,t.prototype.on=function(e,t,r){return(this._listeners[e]||(this._listeners[e]=[])).push({fn:t,ctx:r||this}),this},t.prototype.off=function(e,t){if(void 0===e)this._listeners={};else if(void 0===t)this._listeners[e]=[];else for(var r=this._listeners[e],n=0;n{"use strict";e.exports=o;var n=r(8045),s=r(4153)("fs");function o(e,t,r){return"function"==typeof t?(r=t,t={}):t||(t={}),r?!t.xhr&&s&&s.readFile?s.readFile(e,(function(n,s){return n&&"undefined"!=typeof XMLHttpRequest?o.xhr(e,t,r):n?r(n):r(null,t.binary?s:s.toString("utf8"))})):o.xhr(e,t,r):n(o,this,e,t)}o.xhr=function(e,t,r){var n=new XMLHttpRequest;n.onreadystatechange=function(){if(4===n.readyState){if(0!==n.status&&200!==n.status)return r(Error("status "+n.status));if(t.binary){var e=n.response;if(!e){e=[];for(var s=0;s{"use strict";function t(e){return"undefined"!=typeof Float32Array?function(){var t=new Float32Array([-0]),r=new Uint8Array(t.buffer),n=128===r[3];function s(e,n,s){t[0]=e,n[s]=r[0],n[s+1]=r[1],n[s+2]=r[2],n[s+3]=r[3]}function o(e,n,s){t[0]=e,n[s]=r[3],n[s+1]=r[2],n[s+2]=r[1],n[s+3]=r[0]}function i(e,n){return r[0]=e[n],r[1]=e[n+1],r[2]=e[n+2],r[3]=e[n+3],t[0]}function a(e,n){return r[3]=e[n],r[2]=e[n+1],r[1]=e[n+2],r[0]=e[n+3],t[0]}e.writeFloatLE=n?s:o,e.writeFloatBE=n?o:s,e.readFloatLE=n?i:a,e.readFloatBE=n?a:i}():function(){function t(e,t,r,n){var s=t<0?1:0;if(s&&(t=-t),0===t)e(1/t>0?0:2147483648,r,n);else if(isNaN(t))e(2143289344,r,n);else if(t>34028234663852886e22)e((s<<31|2139095040)>>>0,r,n);else if(t<11754943508222875e-54)e((s<<31|Math.round(t/1401298464324817e-60))>>>0,r,n);else{var o=Math.floor(Math.log(t)/Math.LN2);e((s<<31|o+127<<23|8388607&Math.round(t*Math.pow(2,-o)*8388608))>>>0,r,n)}}function i(e,t,r){var n=e(t,r),s=2*(n>>31)+1,o=n>>>23&255,i=8388607&n;return 255===o?i?NaN:s*(1/0):0===o?1401298464324817e-60*s*i:s*Math.pow(2,o-150)*(i+8388608)}e.writeFloatLE=t.bind(null,r),e.writeFloatBE=t.bind(null,n),e.readFloatLE=i.bind(null,s),e.readFloatBE=i.bind(null,o)}(),"undefined"!=typeof Float64Array?function(){var t=new Float64Array([-0]),r=new Uint8Array(t.buffer),n=128===r[7];function s(e,n,s){t[0]=e,n[s]=r[0],n[s+1]=r[1],n[s+2]=r[2],n[s+3]=r[3],n[s+4]=r[4],n[s+5]=r[5],n[s+6]=r[6],n[s+7]=r[7]}function o(e,n,s){t[0]=e,n[s]=r[7],n[s+1]=r[6],n[s+2]=r[5],n[s+3]=r[4],n[s+4]=r[3],n[s+5]=r[2],n[s+6]=r[1],n[s+7]=r[0]}function i(e,n){return r[0]=e[n],r[1]=e[n+1],r[2]=e[n+2],r[3]=e[n+3],r[4]=e[n+4],r[5]=e[n+5],r[6]=e[n+6],r[7]=e[n+7],t[0]}function a(e,n){return r[7]=e[n],r[6]=e[n+1],r[5]=e[n+2],r[4]=e[n+3],r[3]=e[n+4],r[2]=e[n+5],r[1]=e[n+6],r[0]=e[n+7],t[0]}e.writeDoubleLE=n?s:o,e.writeDoubleBE=n?o:s,e.readDoubleLE=n?i:a,e.readDoubleBE=n?a:i}():function(){function t(e,t,r,n,s,o){var i=n<0?1:0;if(i&&(n=-n),0===n)e(0,s,o+t),e(1/n>0?0:2147483648,s,o+r);else if(isNaN(n))e(0,s,o+t),e(2146959360,s,o+r);else if(n>17976931348623157e292)e(0,s,o+t),e((i<<31|2146435072)>>>0,s,o+r);else{var a;if(n<22250738585072014e-324)e((a=n/5e-324)>>>0,s,o+t),e((i<<31|a/4294967296)>>>0,s,o+r);else{var c=Math.floor(Math.log(n)/Math.LN2);1024===c&&(c=1023),e(4503599627370496*(a=n*Math.pow(2,-c))>>>0,s,o+t),e((i<<31|c+1023<<20|1048576*a&1048575)>>>0,s,o+r)}}}function i(e,t,r,n,s){var o=e(n,s+t),i=e(n,s+r),a=2*(i>>31)+1,c=i>>>20&2047,l=4294967296*(1048575&i)+o;return 2047===c?l?NaN:a*(1/0):0===c?5e-324*a*l:a*Math.pow(2,c-1075)*(l+4503599627370496)}e.writeDoubleLE=t.bind(null,r,0,4),e.writeDoubleBE=t.bind(null,n,4,0),e.readDoubleLE=i.bind(null,s,0,4),e.readDoubleBE=i.bind(null,o,4,0)}(),e}function r(e,t,r){t[r]=255&e,t[r+1]=e>>>8&255,t[r+2]=e>>>16&255,t[r+3]=e>>>24}function n(e,t,r){t[r]=e>>>24,t[r+1]=e>>>16&255,t[r+2]=e>>>8&255,t[r+3]=255&e}function s(e,t){return(e[t]|e[t+1]<<8|e[t+2]<<16|e[t+3]<<24)>>>0}function o(e,t){return(e[t]<<24|e[t+1]<<16|e[t+2]<<8|e[t+3])>>>0}e.exports=t(t)},4153:module=>{"use strict";function inquire(moduleName){try{var mod=eval("quire".replace(/^/,"re"))(moduleName);if(mod&&(mod.length||Object.keys(mod).length))return mod}catch(e){}return null}module.exports=inquire},9207:(e,t)=>{"use strict";var r=t,n=r.isAbsolute=function(e){return/^(?:\/|\w+:)/.test(e)},s=r.normalize=function(e){var t=(e=e.replace(/\\/g,"/").replace(/\/{2,}/g,"/")).split("/"),r=n(e),s="";r&&(s=t.shift()+"/");for(var o=0;o0&&".."!==t[o-1]?t.splice(--o,2):r?t.splice(o,1):++o:"."===t[o]?t.splice(o,1):++o;return s+t.join("/")};r.resolve=function(e,t,r){return r||(t=s(t)),n(t)?t:(r||(e=s(e)),(e=e.replace(/(?:\/|^)[^/]+$/,"")).length?s(e+"/"+t):t)}},9390:e=>{"use strict";e.exports=function(e,t,r){var n=r||8192,s=n>>>1,o=null,i=n;return function(r){if(r<1||r>s)return e(r);i+r>n&&(o=e(n),i=0);var a=t.call(o,i,i+=r);return 7&i&&(i=1+(7|i)),a}}},1447:(e,t)=>{"use strict";var r=t;r.length=function(e){for(var t=0,r=0,n=0;n191&&n<224?o[i++]=(31&n)<<6|63&e[t++]:n>239&&n<365?(n=((7&n)<<18|(63&e[t++])<<12|(63&e[t++])<<6|63&e[t++])-65536,o[i++]=55296+(n>>10),o[i++]=56320+(1023&n)):o[i++]=(15&n)<<12|(63&e[t++])<<6|63&e[t++],i>8191&&((s||(s=[])).push(String.fromCharCode.apply(String,o)),i=0);return s?(i&&s.push(String.fromCharCode.apply(String,o.slice(0,i))),s.join("")):String.fromCharCode.apply(String,o.slice(0,i))},r.write=function(e,t,r){for(var n,s,o=r,i=0;i>6|192,t[r++]=63&n|128):55296==(64512&n)&&56320==(64512&(s=e.charCodeAt(i+1)))?(n=65536+((1023&n)<<10)+(1023&s),++i,t[r++]=n>>18|240,t[r++]=n>>12&63|128,t[r++]=n>>6&63|128,t[r++]=63&n|128):(t[r++]=n>>12|224,t[r++]=n>>6&63|128,t[r++]=63&n|128);return r-o}},7833:(e,t,r)=>{t.formatArgs=function(t){if(t[0]=(this.useColors?"%c":"")+this.namespace+(this.useColors?" %c":" ")+t[0]+(this.useColors?"%c ":" ")+"+"+e.exports.humanize(this.diff),!this.useColors)return;const r="color: "+this.color;t.splice(1,0,r,"color: inherit");let n=0,s=0;t[0].replace(/%[a-zA-Z%]/g,(e=>{"%%"!==e&&(n++,"%c"===e&&(s=n))})),t.splice(s,0,r)},t.save=function(e){try{e?t.storage.setItem("debug",e):t.storage.removeItem("debug")}catch(e){}},t.load=function(){let e;try{e=t.storage.getItem("debug")}catch(e){}return!e&&"undefined"!=typeof process&&"env"in process&&(e=process.env.DEBUG),e},t.useColors=function(){return!("undefined"==typeof window||!window.process||"renderer"!==window.process.type&&!window.process.__nwjs)||("undefined"==typeof navigator||!navigator.userAgent||!navigator.userAgent.toLowerCase().match(/(edge|trident)\/(\d+)/))&&("undefined"!=typeof document&&document.documentElement&&document.documentElement.style&&document.documentElement.style.WebkitAppearance||"undefined"!=typeof window&&window.console&&(window.console.firebug||window.console.exception&&window.console.table)||"undefined"!=typeof navigator&&navigator.userAgent&&navigator.userAgent.toLowerCase().match(/firefox\/(\d+)/)&&parseInt(RegExp.$1,10)>=31||"undefined"!=typeof navigator&&navigator.userAgent&&navigator.userAgent.toLowerCase().match(/applewebkit\/(\d+)/))},t.storage=function(){try{return localStorage}catch(e){}}(),t.destroy=(()=>{let e=!1;return()=>{e||(e=!0,console.warn("Instance method `debug.destroy()` is deprecated and no longer does anything. It will be removed in the next major version of `debug`."))}})(),t.colors=["#0000CC","#0000FF","#0033CC","#0033FF","#0066CC","#0066FF","#0099CC","#0099FF","#00CC00","#00CC33","#00CC66","#00CC99","#00CCCC","#00CCFF","#3300CC","#3300FF","#3333CC","#3333FF","#3366CC","#3366FF","#3399CC","#3399FF","#33CC00","#33CC33","#33CC66","#33CC99","#33CCCC","#33CCFF","#6600CC","#6600FF","#6633CC","#6633FF","#66CC00","#66CC33","#9900CC","#9900FF","#9933CC","#9933FF","#99CC00","#99CC33","#CC0000","#CC0033","#CC0066","#CC0099","#CC00CC","#CC00FF","#CC3300","#CC3333","#CC3366","#CC3399","#CC33CC","#CC33FF","#CC6600","#CC6633","#CC9900","#CC9933","#CCCC00","#CCCC33","#FF0000","#FF0033","#FF0066","#FF0099","#FF00CC","#FF00FF","#FF3300","#FF3333","#FF3366","#FF3399","#FF33CC","#FF33FF","#FF6600","#FF6633","#FF9900","#FF9933","#FFCC00","#FFCC33"],t.log=console.debug||console.log||(()=>{}),e.exports=r(736)(t);const{formatters:n}=e.exports;n.j=function(e){try{return JSON.stringify(e)}catch(e){return"[UnexpectedJSONParseError]: "+e.message}}},736:(e,t,r)=>{e.exports=function(e){function t(e){let r,s,o,i=null;function a(...e){if(!a.enabled)return;const n=a,s=Number(new Date),o=s-(r||s);n.diff=o,n.prev=r,n.curr=s,r=s,e[0]=t.coerce(e[0]),"string"!=typeof e[0]&&e.unshift("%O");let i=0;e[0]=e[0].replace(/%([a-zA-Z%])/g,((r,s)=>{if("%%"===r)return"%";i++;const o=t.formatters[s];if("function"==typeof o){const t=e[i];r=o.call(n,t),e.splice(i,1),i--}return r})),t.formatArgs.call(n,e),(n.log||t.log).apply(n,e)}return a.namespace=e,a.useColors=t.useColors(),a.color=t.selectColor(e),a.extend=n,a.destroy=t.destroy,Object.defineProperty(a,"enabled",{enumerable:!0,configurable:!1,get:()=>null!==i?i:(s!==t.namespaces&&(s=t.namespaces,o=t.enabled(e)),o),set:e=>{i=e}}),"function"==typeof t.init&&t.init(a),a}function n(e,r){const n=t(this.namespace+(void 0===r?":":r)+e);return n.log=this.log,n}function s(e){return e.toString().substring(2,e.toString().length-2).replace(/\.\*\?$/,"*")}return t.debug=t,t.default=t,t.coerce=function(e){return e instanceof Error?e.stack||e.message:e},t.disable=function(){const e=[...t.names.map(s),...t.skips.map(s).map((e=>"-"+e))].join(",");return t.enable(""),e},t.enable=function(e){let r;t.save(e),t.namespaces=e,t.names=[],t.skips=[];const n=("string"==typeof e?e:"").split(/[\s,]+/),s=n.length;for(r=0;r{t[r]=e[r]})),t.names=[],t.skips=[],t.formatters={},t.selectColor=function(e){let r=0;for(let t=0;t{"use strict";function t(e,t){for(const r in t)Object.defineProperty(e,r,{value:t[r],enumerable:!0,configurable:!0});return e}e.exports=function(e,r,n){if(!e||"string"==typeof e)throw new TypeError("Please pass an Error to err-code");n||(n={}),"object"==typeof r&&(n=r,r=""),r&&(n.code=r);try{return t(e,n)}catch(r){n.message=e.message,n.stack=e.stack;const s=function(){};return s.prototype=Object.create(Object.getPrototypeOf(e)),t(new s,n)}}},544:(e,t,r)=>{"use strict";const n=r(9939);t.PP=n.EventIterator,n.EventIterator},9939:(e,t)=>{"use strict";Object.defineProperty(t,"__esModule",{value:!0});class r{constructor(){this.pullQueue=[],this.pushQueue=[],this.eventHandlers={},this.isPaused=!1,this.isStopped=!1}push(e){if(this.isStopped)return;const t={value:e,done:!1};if(this.pullQueue.length){const e=this.pullQueue.shift();e&&e.resolve(t)}else this.pushQueue.push(Promise.resolve(t)),void 0!==this.highWaterMark&&this.pushQueue.length>=this.highWaterMark&&!this.isPaused&&(this.isPaused=!0,this.eventHandlers.highWater?this.eventHandlers.highWater():console&&console.warn(`EventIterator queue reached ${this.pushQueue.length} items`))}stop(){if(!this.isStopped){this.isStopped=!0,this.remove();for(const e of this.pullQueue)e.resolve({value:void 0,done:!0});this.pullQueue.length=0}}fail(e){if(!this.isStopped)if(this.isStopped=!0,this.remove(),this.pullQueue.length){for(const t of this.pullQueue)t.reject(e);this.pullQueue.length=0}else{const t=Promise.reject(e);t.catch((()=>{})),this.pushQueue.push(t)}}remove(){Promise.resolve().then((()=>{this.removeCallback&&this.removeCallback()}))}[Symbol.asyncIterator](){return{next:e=>{const t=this.pushQueue.shift();return t?(void 0!==this.lowWaterMark&&this.pushQueue.length<=this.lowWaterMark&&this.isPaused&&(this.isPaused=!1,this.eventHandlers.lowWater&&this.eventHandlers.lowWater()),t):this.isStopped?Promise.resolve({value:void 0,done:!0}):new Promise(((e,t)=>{this.pullQueue.push({resolve:e,reject:t})}))},return:()=>(this.isStopped=!0,this.pushQueue.length=0,this.remove(),Promise.resolve({value:void 0,done:!0}))}}}class n{constructor(e,{highWaterMark:t=100,lowWaterMark:n=1}={}){const s=new r;s.highWaterMark=t,s.lowWaterMark=n,s.removeCallback=e({push:e=>s.push(e),stop:()=>s.stop(),fail:e=>s.fail(e),on:(e,t)=>{s.eventHandlers[e]=t}})||(()=>{}),this[Symbol.asyncIterator]=()=>s[Symbol.asyncIterator](),Object.freeze(this)}}t.EventIterator=n,t.default=n},228:e=>{"use strict";var t=Object.prototype.hasOwnProperty,r="~";function n(){}function s(e,t,r){this.fn=e,this.context=t,this.once=r||!1}function o(e,t,n,o,i){if("function"!=typeof n)throw new TypeError("The listener must be a function");var a=new s(n,o||e,i),c=r?r+t:t;return e._events[c]?e._events[c].fn?e._events[c]=[e._events[c],a]:e._events[c].push(a):(e._events[c]=a,e._eventsCount++),e}function i(e,t){0==--e._eventsCount?e._events=new n:delete e._events[t]}function a(){this._events=new n,this._eventsCount=0}Object.create&&(n.prototype=Object.create(null),(new n).__proto__||(r=!1)),a.prototype.eventNames=function(){var e,n,s=[];if(0===this._eventsCount)return s;for(n in e=this._events)t.call(e,n)&&s.push(r?n.slice(1):n);return Object.getOwnPropertySymbols?s.concat(Object.getOwnPropertySymbols(e)):s},a.prototype.listeners=function(e){var t=r?r+e:e,n=this._events[t];if(!n)return[];if(n.fn)return[n.fn];for(var s=0,o=n.length,i=new Array(o);s{e.exports=function(e){if(!e)throw Error("hashlru must have a max value, of type number, greater than 0");var t=0,r=Object.create(null),n=Object.create(null);function s(s,o){r[s]=o,++t>=e&&(t=0,n=r,r=Object.create(null))}return{has:function(e){return void 0!==r[e]||void 0!==n[e]},remove:function(e){void 0!==r[e]&&(r[e]=void 0),void 0!==n[e]&&(n[e]=void 0)},get:function(e){var t=r[e];return void 0!==t?t:void 0!==(t=n[e])?(s(e,t),t):void 0},set:function(e,t){void 0!==r[e]?r[e]=t:s(e,t)},clear:function(){r=Object.create(null),n=Object.create(null)}}}},5818:(e,t,r)=>{var n;!function(){"use strict";var t="object"==typeof window?window:{};!t.HI_BASE32_NO_NODE_JS&&"object"==typeof process&&process.versions&&process.versions.node&&(t=global);var s=!t.HI_BASE32_NO_COMMON_JS&&e.exports,o=r.amdO,i="ABCDEFGHIJKLMNOPQRSTUVWXYZ234567".split(""),a={A:0,B:1,C:2,D:3,E:4,F:5,G:6,H:7,I:8,J:9,K:10,L:11,M:12,N:13,O:14,P:15,Q:16,R:17,S:18,T:19,U:20,V:21,W:22,X:23,Y:24,Z:25,2:26,3:27,4:28,5:29,6:30,7:31},c=[0,0,0,0,0,0,0,0],l=function(e,t){t.length>10&&(t="..."+t.substr(-10));var r=new Error("Decoded data is not valid UTF-8. Maybe try base32.decode.asBytes()? Partial data after reading "+e+" bytes: "+t+" <-");throw r.position=e,r},u=function(e){if(""===e)return[];if(!/^[A-Z2-7=]+$/.test(e))throw new Error("Invalid base32 characters");for(var t,r,n,s,o,i,c,l,u=[],h=0,d=(e=e.replace(/=/g,"")).length,p=0,f=d>>3<<3;p>>2),u[h++]=255&(r<<6|n<<1|s>>>4),u[h++]=255&(s<<4|o>>>1),u[h++]=255&(o<<7|i<<2|c>>>3),u[h++]=255&(c<<5|l);var g=d-f;return 2===g?(t=a[e.charAt(p++)],r=a[e.charAt(p++)],u[h++]=255&(t<<3|r>>>2)):4===g?(t=a[e.charAt(p++)],r=a[e.charAt(p++)],n=a[e.charAt(p++)],s=a[e.charAt(p++)],u[h++]=255&(t<<3|r>>>2),u[h++]=255&(r<<6|n<<1|s>>>4)):5===g?(t=a[e.charAt(p++)],r=a[e.charAt(p++)],n=a[e.charAt(p++)],s=a[e.charAt(p++)],o=a[e.charAt(p++)],u[h++]=255&(t<<3|r>>>2),u[h++]=255&(r<<6|n<<1|s>>>4),u[h++]=255&(s<<4|o>>>1)):7===g&&(t=a[e.charAt(p++)],r=a[e.charAt(p++)],n=a[e.charAt(p++)],s=a[e.charAt(p++)],o=a[e.charAt(p++)],i=a[e.charAt(p++)],c=a[e.charAt(p++)],u[h++]=255&(t<<3|r>>>2),u[h++]=255&(r<<6|n<<1|s>>>4),u[h++]=255&(s<<4|o>>>1),u[h++]=255&(o<<7|i<<2|c>>>3)),u},h=function(e,t){if(!t)return function(e){for(var t,r,n="",s=e.length,o=0,i=0;o191&&t<=223?(r=31&t,i=1):t<=239?(r=15&t,i=2):t<=247?(r=7&t,i=3):l(o,n);for(var a=0;a191)&&l(o,n),r<<=6,r+=63&t;r>=55296&&r<=57343&&l(o,n),r>1114111&&l(o,n),r<=65535?n+=String.fromCharCode(r):(r-=65536,n+=String.fromCharCode(55296+(r>>10)),n+=String.fromCharCode(56320+(1023&r)))}return n}(u(e));if(""===e)return"";if(!/^[A-Z2-7=]+$/.test(e))throw new Error("Invalid base32 characters");var r,n,s,o,i,c,h,d,p="",f=e.indexOf("=");-1===f&&(f=e.length);for(var g=0,y=f>>3<<3;g>>2))+String.fromCharCode(255&(n<<6|s<<1|o>>>4))+String.fromCharCode(255&(o<<4|i>>>1))+String.fromCharCode(255&(i<<7|c<<2|h>>>3))+String.fromCharCode(255&(h<<5|d));var m=f-y;return 2===m?(r=a[e.charAt(g++)],n=a[e.charAt(g++)],p+=String.fromCharCode(255&(r<<3|n>>>2))):4===m?(r=a[e.charAt(g++)],n=a[e.charAt(g++)],s=a[e.charAt(g++)],o=a[e.charAt(g++)],p+=String.fromCharCode(255&(r<<3|n>>>2))+String.fromCharCode(255&(n<<6|s<<1|o>>>4))):5===m?(r=a[e.charAt(g++)],n=a[e.charAt(g++)],s=a[e.charAt(g++)],o=a[e.charAt(g++)],i=a[e.charAt(g++)],p+=String.fromCharCode(255&(r<<3|n>>>2))+String.fromCharCode(255&(n<<6|s<<1|o>>>4))+String.fromCharCode(255&(o<<4|i>>>1))):7===m&&(r=a[e.charAt(g++)],n=a[e.charAt(g++)],s=a[e.charAt(g++)],o=a[e.charAt(g++)],i=a[e.charAt(g++)],c=a[e.charAt(g++)],h=a[e.charAt(g++)],p+=String.fromCharCode(255&(r<<3|n>>>2))+String.fromCharCode(255&(n<<6|s<<1|o>>>4))+String.fromCharCode(255&(o<<4|i>>>1))+String.fromCharCode(255&(i<<7|c<<2|h>>>3))),p},d={encode:function(e,t){var r="string"!=typeof e;return r&&e.constructor===ArrayBuffer&&(e=new Uint8Array(e)),r?function(e){for(var t,r,n,s,o,a="",c=e.length,l=0,u=5*parseInt(c/5);l>>3]+i[31&(t<<2|r>>>6)]+i[r>>>1&31]+i[31&(r<<4|n>>>4)]+i[31&(n<<1|s>>>7)]+i[s>>>2&31]+i[31&(s<<3|o>>>5)]+i[31&o];var h=c-u;return 1===h?(t=e[l],a+=i[t>>>3]+i[t<<2&31]+"======"):2===h?(t=e[l++],r=e[l],a+=i[t>>>3]+i[31&(t<<2|r>>>6)]+i[r>>>1&31]+i[r<<4&31]+"===="):3===h?(t=e[l++],r=e[l++],n=e[l],a+=i[t>>>3]+i[31&(t<<2|r>>>6)]+i[r>>>1&31]+i[31&(r<<4|n>>>4)]+i[n<<1&31]+"==="):4===h&&(t=e[l++],r=e[l++],n=e[l++],s=e[l],a+=i[t>>>3]+i[31&(t<<2|r>>>6)]+i[r>>>1&31]+i[31&(r<<4|n>>>4)]+i[31&(n<<1|s>>>7)]+i[s>>>2&31]+i[s<<3&31]+"="),a}(e):t?function(e){for(var t,r,n,s,o,a="",c=e.length,l=0,u=5*parseInt(c/5);l>>3]+i[31&(t<<2|r>>>6)]+i[r>>>1&31]+i[31&(r<<4|n>>>4)]+i[31&(n<<1|s>>>7)]+i[s>>>2&31]+i[31&(s<<3|o>>>5)]+i[31&o];var h=c-u;return 1===h?(t=e.charCodeAt(l),a+=i[t>>>3]+i[t<<2&31]+"======"):2===h?(t=e.charCodeAt(l++),r=e.charCodeAt(l),a+=i[t>>>3]+i[31&(t<<2|r>>>6)]+i[r>>>1&31]+i[r<<4&31]+"===="):3===h?(t=e.charCodeAt(l++),r=e.charCodeAt(l++),n=e.charCodeAt(l),a+=i[t>>>3]+i[31&(t<<2|r>>>6)]+i[r>>>1&31]+i[31&(r<<4|n>>>4)]+i[n<<1&31]+"==="):4===h&&(t=e.charCodeAt(l++),r=e.charCodeAt(l++),n=e.charCodeAt(l++),s=e.charCodeAt(l),a+=i[t>>>3]+i[31&(t<<2|r>>>6)]+i[r>>>1&31]+i[31&(r<<4|n>>>4)]+i[31&(n<<1|s>>>7)]+i[s>>>2&31]+i[s<<3&31]+"="),a}(e):function(e){var t,r,n,s,o,a,l,u=!1,h="",d=0,p=0,f=e.length;if(""===e)return h;do{for(c[0]=c[5],c[1]=c[6],c[2]=c[7],l=p;d>6,c[l++]=128|63&a):a<55296||a>=57344?(c[l++]=224|a>>12,c[l++]=128|a>>6&63,c[l++]=128|63&a):(a=65536+((1023&a)<<10|1023&e.charCodeAt(++d)),c[l++]=240|a>>18,c[l++]=128|a>>12&63,c[l++]=128|a>>6&63,c[l++]=128|63&a);p=l-5,d===f&&++d,d>f&&l<6&&(u=!0),t=c[0],l>4?(r=c[1],n=c[2],s=c[3],o=c[4],h+=i[t>>>3]+i[31&(t<<2|r>>>6)]+i[r>>>1&31]+i[31&(r<<4|n>>>4)]+i[31&(n<<1|s>>>7)]+i[s>>>2&31]+i[31&(s<<3|o>>>5)]+i[31&o]):1===l?h+=i[t>>>3]+i[t<<2&31]+"======":2===l?(r=c[1],h+=i[t>>>3]+i[31&(t<<2|r>>>6)]+i[r>>>1&31]+i[r<<4&31]+"===="):3===l?(r=c[1],n=c[2],h+=i[t>>>3]+i[31&(t<<2|r>>>6)]+i[r>>>1&31]+i[31&(r<<4|n>>>4)]+i[n<<1&31]+"==="):(r=c[1],n=c[2],s=c[3],h+=i[t>>>3]+i[31&(t<<2|r>>>6)]+i[r>>>1&31]+i[31&(r<<4|n>>>4)]+i[31&(n<<1|s>>>7)]+i[s>>>2&31]+i[s<<3&31]+"=")}while(!u);return h}(e)},decode:h};h.asBytes=u,s?e.exports=d:(t.base32=d,o&&(void 0===(n=function(){return d}.call(d,r,d,e))||(e.exports=n)))}()},4866:e=>{e.exports=function(){return"undefined"!=typeof window&&"object"==typeof window.process&&"renderer"===window.process.type||!("undefined"==typeof process||"object"!=typeof process.versions||!process.versions.electron)||"object"==typeof navigator&&"string"==typeof navigator.userAgent&&navigator.userAgent.indexOf("Electron")>=0}},6368:e=>{"use strict";e.exports=e=>{if("[object Object]"!==Object.prototype.toString.call(e))return!1;const t=Object.getPrototypeOf(e);return null===t||t===Object.prototype}},1176:(e,t,r)=>{var n;!function(){"use strict";var s="input is invalid type",o="object"==typeof window,i=o?window:{};i.JS_SHA3_NO_WINDOW&&(o=!1);var a=!o&&"object"==typeof self;!i.JS_SHA3_NO_NODE_JS&&"object"==typeof process&&process.versions&&process.versions.node?i=global:a&&(i=self);for(var c=!i.JS_SHA3_NO_COMMON_JS&&e.exports,l=r.amdO,u=!i.JS_SHA3_NO_ARRAY_BUFFER&&"undefined"!=typeof ArrayBuffer,h="0123456789abcdef".split(""),d=[4,1024,262144,67108864],p=[0,8,16,24],f=[1,0,32898,0,32906,2147483648,2147516416,2147483648,32907,0,2147483649,0,2147516545,2147483648,32777,2147483648,138,0,136,0,2147516425,0,2147483658,0,2147516555,0,139,2147483648,32905,2147483648,32771,2147483648,32770,2147483648,128,2147483648,32778,0,2147483658,2147483648,2147516545,2147483648,32896,2147483648,2147483649,0,2147516424,2147483648],g=[224,256,384,512],y=[128,256],m=["hex","buffer","arrayBuffer","array","digest"],b={128:168,256:136},w=i.JS_SHA3_NO_NODE_JS||!Array.isArray?function(e){return"[object Array]"===Object.prototype.toString.call(e)}:Array.isArray,v=!u||!i.JS_SHA3_NO_ARRAY_BUFFER_IS_VIEW&&ArrayBuffer.isView?ArrayBuffer.isView:function(e){return"object"==typeof e&&e.buffer&&e.buffer.constructor===ArrayBuffer},E=function(e){var t=typeof e;if("string"===t)return[e,!0];if("object"!==t||null===e)throw new Error(s);if(u&&e.constructor===ArrayBuffer)return[new Uint8Array(e),!1];if(!w(e)&&!v(e))throw new Error(s);return[e,!1]},S=function(e){return 0===E(e)[0].length},A=function(e){for(var t=[],r=0;r>5,this.byteCount=this.blockCount<<2,this.outputBlocks=r>>5,this.extraBytes=(31&r)>>3;for(var n=0;n<50;++n)this.s[n]=0}function $(e,t,r){F.call(this,e,t,r)}F.prototype.update=function(e){if(this.finalized)throw new Error("finalize already called");var t=E(e);e=t[0];for(var r,n,s=t[1],o=this.blocks,i=this.byteCount,a=e.length,c=this.blockCount,l=0,u=this.s;l>2]|=n<>2]|=(192|n>>6)<>2]|=(128|63&n)<=57344?(o[r>>2]|=(224|n>>12)<>2]|=(128|n>>6&63)<>2]|=(128|63&n)<>2]|=(240|n>>18)<>2]|=(128|n>>12&63)<>2]|=(128|n>>6&63)<>2]|=(128|63&n)<>2]|=e[l]<=i){for(this.start=r-i,this.block=o[c],r=0;r>=8);r>0;)s.unshift(r),r=255&(e>>=8),++n;return t?s.push(n):s.unshift(n),this.update(s),s.length},F.prototype.encodeString=function(e){var t=E(e);e=t[0];var r=t[1],n=0,s=e.length;if(r)for(var o=0;o=57344?n+=3:(i=65536+((1023&i)<<10|1023&e.charCodeAt(++o)),n+=4)}else n=s;return n+=this.encode(8*n),this.update(e),n},F.prototype.bytepad=function(e,t){for(var r=this.encode(t),n=0;n>2]|=this.padding[3&t],this.lastByteIndex===this.byteCount)for(e[0]=e[r],t=1;t>4&15]+h[15&e]+h[e>>12&15]+h[e>>8&15]+h[e>>20&15]+h[e>>16&15]+h[e>>28&15]+h[e>>24&15];i%t==0&&(r=A(r),H(r),o=0)}return s&&(e=r[o],a+=h[e>>4&15]+h[15&e],s>1&&(a+=h[e>>12&15]+h[e>>8&15]),s>2&&(a+=h[e>>20&15]+h[e>>16&15])),a},F.prototype.arrayBuffer=function(){this.finalize();var e,t=this.blockCount,r=this.s,n=this.outputBlocks,s=this.extraBytes,o=0,i=0,a=this.outputBits>>3;e=s?new ArrayBuffer(n+1<<2):new ArrayBuffer(a);for(var c=new Uint32Array(e);i>8&255,c[e+2]=t>>16&255,c[e+3]=t>>24&255;a%r==0&&(n=A(n),H(n))}return o&&(e=a<<2,t=n[i],c[e]=255&t,o>1&&(c[e+1]=t>>8&255),o>2&&(c[e+2]=t>>16&255)),c},$.prototype=new F,$.prototype.finalize=function(){return this.encode(this.outputBits,!0),F.prototype.finalize.call(this)};var H=function(e){var t,r,n,s,o,i,a,c,l,u,h,d,p,g,y,m,b,w,v,E,S,A,_,k,I,R,T,C,N,x,P,O,D,L,B,U,M,F,$,H,q,V,j,K,z,G,W,Y,J,X,Q,Z,ee,te,re,ne,se,oe,ie,ae,ce,le,ue;for(n=0;n<48;n+=2)s=e[0]^e[10]^e[20]^e[30]^e[40],o=e[1]^e[11]^e[21]^e[31]^e[41],i=e[2]^e[12]^e[22]^e[32]^e[42],a=e[3]^e[13]^e[23]^e[33]^e[43],c=e[4]^e[14]^e[24]^e[34]^e[44],l=e[5]^e[15]^e[25]^e[35]^e[45],u=e[6]^e[16]^e[26]^e[36]^e[46],h=e[7]^e[17]^e[27]^e[37]^e[47],t=(d=e[8]^e[18]^e[28]^e[38]^e[48])^(i<<1|a>>>31),r=(p=e[9]^e[19]^e[29]^e[39]^e[49])^(a<<1|i>>>31),e[0]^=t,e[1]^=r,e[10]^=t,e[11]^=r,e[20]^=t,e[21]^=r,e[30]^=t,e[31]^=r,e[40]^=t,e[41]^=r,t=s^(c<<1|l>>>31),r=o^(l<<1|c>>>31),e[2]^=t,e[3]^=r,e[12]^=t,e[13]^=r,e[22]^=t,e[23]^=r,e[32]^=t,e[33]^=r,e[42]^=t,e[43]^=r,t=i^(u<<1|h>>>31),r=a^(h<<1|u>>>31),e[4]^=t,e[5]^=r,e[14]^=t,e[15]^=r,e[24]^=t,e[25]^=r,e[34]^=t,e[35]^=r,e[44]^=t,e[45]^=r,t=c^(d<<1|p>>>31),r=l^(p<<1|d>>>31),e[6]^=t,e[7]^=r,e[16]^=t,e[17]^=r,e[26]^=t,e[27]^=r,e[36]^=t,e[37]^=r,e[46]^=t,e[47]^=r,t=u^(s<<1|o>>>31),r=h^(o<<1|s>>>31),e[8]^=t,e[9]^=r,e[18]^=t,e[19]^=r,e[28]^=t,e[29]^=r,e[38]^=t,e[39]^=r,e[48]^=t,e[49]^=r,g=e[0],y=e[1],G=e[11]<<4|e[10]>>>28,W=e[10]<<4|e[11]>>>28,C=e[20]<<3|e[21]>>>29,N=e[21]<<3|e[20]>>>29,ae=e[31]<<9|e[30]>>>23,ce=e[30]<<9|e[31]>>>23,V=e[40]<<18|e[41]>>>14,j=e[41]<<18|e[40]>>>14,L=e[2]<<1|e[3]>>>31,B=e[3]<<1|e[2]>>>31,m=e[13]<<12|e[12]>>>20,b=e[12]<<12|e[13]>>>20,Y=e[22]<<10|e[23]>>>22,J=e[23]<<10|e[22]>>>22,x=e[33]<<13|e[32]>>>19,P=e[32]<<13|e[33]>>>19,le=e[42]<<2|e[43]>>>30,ue=e[43]<<2|e[42]>>>30,te=e[5]<<30|e[4]>>>2,re=e[4]<<30|e[5]>>>2,U=e[14]<<6|e[15]>>>26,M=e[15]<<6|e[14]>>>26,w=e[25]<<11|e[24]>>>21,v=e[24]<<11|e[25]>>>21,X=e[34]<<15|e[35]>>>17,Q=e[35]<<15|e[34]>>>17,O=e[45]<<29|e[44]>>>3,D=e[44]<<29|e[45]>>>3,k=e[6]<<28|e[7]>>>4,I=e[7]<<28|e[6]>>>4,ne=e[17]<<23|e[16]>>>9,se=e[16]<<23|e[17]>>>9,F=e[26]<<25|e[27]>>>7,$=e[27]<<25|e[26]>>>7,E=e[36]<<21|e[37]>>>11,S=e[37]<<21|e[36]>>>11,Z=e[47]<<24|e[46]>>>8,ee=e[46]<<24|e[47]>>>8,K=e[8]<<27|e[9]>>>5,z=e[9]<<27|e[8]>>>5,R=e[18]<<20|e[19]>>>12,T=e[19]<<20|e[18]>>>12,oe=e[29]<<7|e[28]>>>25,ie=e[28]<<7|e[29]>>>25,H=e[38]<<8|e[39]>>>24,q=e[39]<<8|e[38]>>>24,A=e[48]<<14|e[49]>>>18,_=e[49]<<14|e[48]>>>18,e[0]=g^~m&w,e[1]=y^~b&v,e[10]=k^~R&C,e[11]=I^~T&N,e[20]=L^~U&F,e[21]=B^~M&$,e[30]=K^~G&Y,e[31]=z^~W&J,e[40]=te^~ne&oe,e[41]=re^~se&ie,e[2]=m^~w&E,e[3]=b^~v&S,e[12]=R^~C&x,e[13]=T^~N&P,e[22]=U^~F&H,e[23]=M^~$&q,e[32]=G^~Y&X,e[33]=W^~J&Q,e[42]=ne^~oe&ae,e[43]=se^~ie&ce,e[4]=w^~E&A,e[5]=v^~S&_,e[14]=C^~x&O,e[15]=N^~P&D,e[24]=F^~H&V,e[25]=$^~q&j,e[34]=Y^~X&Z,e[35]=J^~Q&ee,e[44]=oe^~ae&le,e[45]=ie^~ce&ue,e[6]=E^~A&g,e[7]=S^~_&y,e[16]=x^~O&k,e[17]=P^~D&I,e[26]=H^~V&L,e[27]=q^~j&B,e[36]=X^~Z&K,e[37]=Q^~ee&z,e[46]=ae^~le&te,e[47]=ce^~ue&re,e[8]=A^~g&m,e[9]=_^~y&b,e[18]=O^~k&R,e[19]=D^~I&T,e[28]=V^~L&U,e[29]=j^~B&M,e[38]=Z^~K&G,e[39]=ee^~z&W,e[48]=le^~te&ne,e[49]=ue^~re&se,e[0]^=f[n],e[1]^=f[n+1]};if(c)e.exports=x;else{for(O=0;OObject.defineProperty(e,t,{value:r,writable:!0,enumerable:!0,configurable:!0}),a=this,c={concatArrays:!1,ignoreUndefined:!1},l=e=>{const t=[];for(const r in e)s.call(e,r)&&t.push(r);if(Object.getOwnPropertySymbols){const r=Object.getOwnPropertySymbols(e);for(const n of r)o.call(e,n)&&t.push(n)}return t};function u(e){return Array.isArray(e)?function(e){const t=e.slice(0,0);return l(e).forEach((r=>{i(t,r,u(e[r]))})),t}(e):n(e)?function(e){const t=null===Object.getPrototypeOf(e)?Object.create(null):{};return l(e).forEach((r=>{i(t,r,u(e[r]))})),t}(e):e}const h=(e,t,r,n)=>(r.forEach((r=>{void 0===t[r]&&n.ignoreUndefined||(r in e&&e[r]!==Object.getPrototypeOf(e)?i(e,r,p(e[r],t[r],n)):i(e,r,u(t[r])))})),e),d=(e,t,r)=>{let n=e.slice(0,0),o=0;return[e,t].forEach((t=>{const a=[];for(let r=0;r!a.includes(e))),r)})),n};function p(e,t,r){return r.concatArrays&&Array.isArray(e)&&Array.isArray(t)?d(e,t,r):n(t)&&n(e)?h(e,t,l(t),r):u(t)}e.exports=function(...e){const t=p(u(c),this!==a&&this||{},c);let r={_:{}};for(const s of e)if(void 0!==s){if(!n(s))throw new TypeError("`"+s+"` is not an Option Object");r=p(r,{_:s},t)}return r._}},6585:e=>{var t=1e3,r=60*t,n=60*r,s=24*n,o=7*s;function i(e,t,r,n){var s=t>=1.5*r;return Math.round(e/r)+" "+n+(s?"s":"")}e.exports=function(e,a){a=a||{};var c,l,u=typeof e;if("string"===u&&e.length>0)return function(e){if(!((e=String(e)).length>100)){var i=/^(-?(?:\d+)?\.?\d+) *(milliseconds?|msecs?|ms|seconds?|secs?|s|minutes?|mins?|m|hours?|hrs?|h|days?|d|weeks?|w|years?|yrs?|y)?$/i.exec(e);if(i){var a=parseFloat(i[1]);switch((i[2]||"ms").toLowerCase()){case"years":case"year":case"yrs":case"yr":case"y":return 315576e5*a;case"weeks":case"week":case"w":return a*o;case"days":case"day":case"d":return a*s;case"hours":case"hour":case"hrs":case"hr":case"h":return a*n;case"minutes":case"minute":case"mins":case"min":case"m":return a*r;case"seconds":case"second":case"secs":case"sec":case"s":return a*t;case"milliseconds":case"millisecond":case"msecs":case"msec":case"ms":return a;default:return}}}}(e);if("number"===u&&isFinite(e))return a.long?(c=e,(l=Math.abs(c))>=s?i(c,l,s,"day"):l>=n?i(c,l,n,"hour"):l>=r?i(c,l,r,"minute"):l>=t?i(c,l,t,"second"):c+" ms"):function(e){var o=Math.abs(e);return o>=s?Math.round(e/s)+"d":o>=n?Math.round(e/n)+"h":o>=r?Math.round(e/r)+"m":o>=t?Math.round(e/t)+"s":e+"ms"}(e);throw new Error("val is not a non-empty string or a valid number. val="+JSON.stringify(e))}},8437:(e,t,r)=>{e.exports=r(4327)},4327:function(e,t){!function(r,n){"use strict";var s={version:"3.0.0",x86:{},x64:{},inputValidation:!0};function o(e){if(!Array.isArray(e)&&!ArrayBuffer.isView(e))return!1;for(var t=0;t255)return!1;return!0}function i(e,t){return(65535&e)*t+(((e>>>16)*t&65535)<<16)}function a(e,t){return e<>>32-t}function c(e){return e=i(e^=e>>>16,2246822507),(e=i(e^=e>>>13,3266489909))^e>>>16}function l(e,t){e=[e[0]>>>16,65535&e[0],e[1]>>>16,65535&e[1]],t=[t[0]>>>16,65535&t[0],t[1]>>>16,65535&t[1]];var r=[0,0,0,0];return r[3]+=e[3]+t[3],r[2]+=r[3]>>>16,r[3]&=65535,r[2]+=e[2]+t[2],r[1]+=r[2]>>>16,r[2]&=65535,r[1]+=e[1]+t[1],r[0]+=r[1]>>>16,r[1]&=65535,r[0]+=e[0]+t[0],r[0]&=65535,[r[0]<<16|r[1],r[2]<<16|r[3]]}function u(e,t){e=[e[0]>>>16,65535&e[0],e[1]>>>16,65535&e[1]],t=[t[0]>>>16,65535&t[0],t[1]>>>16,65535&t[1]];var r=[0,0,0,0];return r[3]+=e[3]*t[3],r[2]+=r[3]>>>16,r[3]&=65535,r[2]+=e[2]*t[3],r[1]+=r[2]>>>16,r[2]&=65535,r[2]+=e[3]*t[2],r[1]+=r[2]>>>16,r[2]&=65535,r[1]+=e[1]*t[3],r[0]+=r[1]>>>16,r[1]&=65535,r[1]+=e[2]*t[2],r[0]+=r[1]>>>16,r[1]&=65535,r[1]+=e[3]*t[1],r[0]+=r[1]>>>16,r[1]&=65535,r[0]+=e[0]*t[3]+e[1]*t[2]+e[2]*t[1]+e[3]*t[0],r[0]&=65535,[r[0]<<16|r[1],r[2]<<16|r[3]]}function h(e,t){return 32==(t%=64)?[e[1],e[0]]:t<32?[e[0]<>>32-t,e[1]<>>32-t]:(t-=32,[e[1]<>>32-t,e[0]<>>32-t])}function d(e,t){return 0==(t%=64)?e:t<32?[e[0]<>>32-t,e[1]<>>1]),e=p(e=u(e,[4283543511,3981806797]),[0,e[0]>>>1]),p(e=u(e,[3301882366,444984403]),[0,e[0]>>>1])}s.x86.hash32=function(e,t){if(s.inputValidation&&!o(e))return n;t=t||0;for(var r=e.length%4,l=e.length-r,u=t,h=0,d=3432918353,p=461845907,f=0;f>>0},s.x86.hash128=function(e,t){if(s.inputValidation&&!o(e))return n;t=t||0;for(var r=e.length%16,l=e.length-r,u=t,h=t,d=t,p=t,f=0,g=0,y=0,m=0,b=597399067,w=2869860233,v=951274213,E=2716044179,S=0;S>>0).toString(16)).slice(-8)+("00000000"+(h>>>0).toString(16)).slice(-8)+("00000000"+(d>>>0).toString(16)).slice(-8)+("00000000"+(p>>>0).toString(16)).slice(-8)},s.x64.hash128=function(e,t){if(s.inputValidation&&!o(e))return n;t=t||0;for(var r=e.length%16,i=e.length-r,a=[0,t],c=[0,t],g=[0,0],y=[0,0],m=[2277735313,289559509],b=[1291169091,658871167],w=0;w>>0).toString(16)).slice(-8)+("00000000"+(a[1]>>>0).toString(16)).slice(-8)+("00000000"+(c[0]>>>0).toString(16)).slice(-8)+("00000000"+(c[1]>>>0).toString(16)).slice(-8)},e.exports&&(t=e.exports=s),t.murmurHash3=s}()},5507:function(e,t){(function(){var e,r,n,s,o,i,a,c;c=function(e){return[(e&255<<24)>>>24,(e&255<<16)>>>16,(65280&e)>>>8,255&e].join(".")},a=function(e){var t,n,s,o,i,a;for(t=[],s=o=0;o<=3&&0!==e.length;s=++o){if(s>0){if("."!==e[0])throw new Error("Invalid IP");e=e.substring(1)}i=(a=r(e))[0],n=a[1],e=e.substring(n),t.push(i)}if(0!==e.length)throw new Error("Invalid IP");switch(t.length){case 1:if(t[0]>4294967295)throw new Error("Invalid IP");return t[0]>>>0;case 2:if(t[0]>255||t[1]>16777215)throw new Error("Invalid IP");return(t[0]<<24|t[1])>>>0;case 3:if(t[0]>255||t[1]>255||t[2]>65535)throw new Error("Invalid IP");return(t[0]<<24|t[1]<<16|t[2])>>>0;case 4:if(t[0]>255||t[1]>255||t[2]>255||t[3]>255)throw new Error("Invalid IP");return(t[0]<<24|t[1]<<16|t[2]<<8|t[3])>>>0;default:throw new Error("Invalid IP")}},s=(n=function(e){return e.charCodeAt(0)})("0"),i=n("a"),o=n("A"),r=function(e){var t,r,a,c,l;for(c=0,t=10,r="9",a=0,e.length>1&&"0"===e[a]&&("x"===e[a+1]||"X"===e[a+1]?(a+=2,t=16):"0"<=e[a+1]&&e[a+1]<="9"&&(a++,t=8,r="7")),l=a;a>>0;else{if(16!==t)break;if("a"<=e[a]&&e[a]<="f")c=c*t+(10+n(e[a])-i)>>>0;else{if(!("A"<=e[a]&&e[a]<="F"))break;c=c*t+(10+n(e[a])-o)>>>0}}if(c>4294967295)throw new Error("too large");a++}if(a===l)throw new Error("empty octet");return[c,a]},e=function(){function e(e,t){var r,n,s;if("string"!=typeof e)throw new Error("Missing `net' parameter");if(t||(s=e.split("/",2),e=s[0],t=s[1]),t||(t=32),"string"==typeof t&&t.indexOf(".")>-1){try{this.maskLong=a(t)}catch(e){throw new Error("Invalid mask: "+t)}for(r=n=32;n>=0;r=--n)if(this.maskLong===4294967295<<32-r>>>0){this.bitmask=r;break}}else{if(!t&&0!==t)throw new Error("Invalid mask: empty");this.bitmask=parseInt(t,10),this.maskLong=0,this.bitmask>0&&(this.maskLong=4294967295<<32-this.bitmask>>>0)}try{this.netLong=(a(e)&this.maskLong)>>>0}catch(t){throw new Error("Invalid net address: "+e)}if(!(this.bitmask<=32))throw new Error("Invalid mask for ip4: "+t);this.size=Math.pow(2,32-this.bitmask),this.base=c(this.netLong),this.mask=c(this.maskLong),this.hostmask=c(~this.maskLong),this.first=this.bitmask<=30?c(this.netLong+1):this.base,this.last=this.bitmask<=30?c(this.netLong+this.size-2):c(this.netLong+this.size-1),this.broadcast=this.bitmask<=30?c(this.netLong+this.size-1):void 0}return e.prototype.contains=function(t){return"string"==typeof t&&(t.indexOf("/")>0||4!==t.split(".").length)&&(t=new e(t)),t instanceof e?this.contains(t.base)&&this.contains(t.broadcast||t.last):(a(t)&this.maskLong)>>>0==(this.netLong&this.maskLong)>>>0},e.prototype.next=function(t){return null==t&&(t=1),new e(c(this.netLong+this.size*t),this.mask)},e.prototype.forEach=function(e){var t,r,n;for(n=a(this.first),r=a(this.last),t=0;n<=r;)e(c(n),n,t),t++,n++},e.prototype.toString=function(){return this.base+"/"+this.bitmask},e}(),t.ip2long=a,t.long2ip=c,t.Netmask=e}).call(this)},2549:(e,t,r)=>{"use strict";e.exports=r(9100)},5095:e=>{"use strict";e.exports=n;var t,r=/\/|\./;function n(e,t){r.test(e)||(e="google/protobuf/"+e+".proto",t={nested:{google:{nested:{protobuf:{nested:t}}}}}),n[e]=t}n("any",{Any:{fields:{type_url:{type:"string",id:1},value:{type:"bytes",id:2}}}}),n("duration",{Duration:t={fields:{seconds:{type:"int64",id:1},nanos:{type:"int32",id:2}}}}),n("timestamp",{Timestamp:t}),n("empty",{Empty:{fields:{}}}),n("struct",{Struct:{fields:{fields:{keyType:"string",type:"Value",id:1}}},Value:{oneofs:{kind:{oneof:["nullValue","numberValue","stringValue","boolValue","structValue","listValue"]}},fields:{nullValue:{type:"NullValue",id:1},numberValue:{type:"double",id:2},stringValue:{type:"string",id:3},boolValue:{type:"bool",id:4},structValue:{type:"Struct",id:5},listValue:{type:"ListValue",id:6}}},NullValue:{values:{NULL_VALUE:0}},ListValue:{fields:{values:{rule:"repeated",type:"Value",id:1}}}}),n("wrappers",{DoubleValue:{fields:{value:{type:"double",id:1}}},FloatValue:{fields:{value:{type:"float",id:1}}},Int64Value:{fields:{value:{type:"int64",id:1}}},UInt64Value:{fields:{value:{type:"uint64",id:1}}},Int32Value:{fields:{value:{type:"int32",id:1}}},UInt32Value:{fields:{value:{type:"uint32",id:1}}},BoolValue:{fields:{value:{type:"bool",id:1}}},StringValue:{fields:{value:{type:"string",id:1}}},BytesValue:{fields:{value:{type:"bytes",id:1}}}}),n("field_mask",{FieldMask:{fields:{paths:{rule:"repeated",type:"string",id:1}}}}),n.get=function(e){return n[e]||null}},744:(e,t,r)=>{"use strict";var n=t,s=r(5643),o=r(3262);function i(e,t,r,n){var o=!1;if(t.resolvedType)if(t.resolvedType instanceof s){e("switch(d%s){",n);for(var i=t.resolvedType.values,a=Object.keys(i),c=0;c>>0",n,n);break;case"int32":case"sint32":case"sfixed32":e("m%s=d%s|0",n,n);break;case"uint64":l=!0;case"int64":case"sint64":case"fixed64":case"sfixed64":e("if(util.Long)")("(m%s=util.Long.fromValue(d%s)).unsigned=%j",n,n,l)('else if(typeof d%s==="string")',n)("m%s=parseInt(d%s,10)",n,n)('else if(typeof d%s==="number")',n)("m%s=d%s",n,n)('else if(typeof d%s==="object")',n)("m%s=new util.LongBits(d%s.low>>>0,d%s.high>>>0).toNumber(%s)",n,n,n,l?"true":"");break;case"bytes":e('if(typeof d%s==="string")',n)("util.base64.decode(d%s,m%s=util.newBuffer(util.base64.length(d%s)),0)",n,n,n)("else if(d%s.length >= 0)",n)("m%s=d%s",n,n);break;case"string":e("m%s=String(d%s)",n,n);break;case"bool":e("m%s=Boolean(d%s)",n,n)}}return e}function a(e,t,r,n){if(t.resolvedType)t.resolvedType instanceof s?e("d%s=o.enums===String?(types[%i].values[m%s]===undefined?m%s:types[%i].values[m%s]):m%s",n,r,n,n,r,n,n):e("d%s=types[%i].toObject(m%s,o)",n,r,n);else{var o=!1;switch(t.type){case"double":case"float":e("d%s=o.json&&!isFinite(m%s)?String(m%s):m%s",n,n,n,n);break;case"uint64":o=!0;case"int64":case"sint64":case"fixed64":case"sfixed64":e('if(typeof m%s==="number")',n)("d%s=o.longs===String?String(m%s):m%s",n,n,n)("else")("d%s=o.longs===String?util.Long.prototype.toString.call(m%s):o.longs===Number?new util.LongBits(m%s.low>>>0,m%s.high>>>0).toNumber(%s):m%s",n,n,n,n,o?"true":"",n);break;case"bytes":e("d%s=o.bytes===String?util.base64.encode(m%s,0,m%s.length):o.bytes===Array?Array.prototype.slice.call(m%s):m%s",n,n,n,n,n);break;default:e("d%s=m%s",n,n)}}return e}n.fromObject=function(e){var t=e.fieldsArray,r=o.codegen(["d"],e.name+"$fromObject")("if(d instanceof this.ctor)")("return d");if(!t.length)return r("return new this.ctor");r("var m=new this.ctor");for(var n=0;n{"use strict";e.exports=function(e){var t=o.codegen(["r","l"],e.name+"$decode")("if(!(r instanceof Reader))")("r=Reader.create(r)")("var c=l===undefined?r.len:r.pos+l,m=new this.ctor"+(e.fieldsArray.filter((function(e){return e.map})).length?",k,value":""))("while(r.pos>>3){");for(var r=0;r>>3){")("case 1: k=r.%s(); break",a.keyType)("case 2:"),void 0===s.basic[c]?t("value=types[%i].decode(r,r.uint32())",r):t("value=r.%s()",c),t("break")("default:")("r.skipType(tag2&7)")("break")("}")("}"),void 0!==s.long[a.keyType]?t('%s[typeof k==="object"?util.longToHash(k):k]=value',l):t("%s[k]=value",l)):a.repeated?(t("if(!(%s&&%s.length))",l,l)("%s=[]",l),void 0!==s.packed[c]&&t("if((t&7)===2){")("var c2=r.uint32()+r.pos")("while(r.pos{"use strict";e.exports=function(e){for(var t,r=o.codegen(["m","w"],e.name+"$encode")("if(!w)")("w=Writer.create()"),a=e.fieldsArray.slice().sort(o.compareFieldsById),c=0;c>>0,8|s.mapKey[l.keyType],l.keyType),void 0===d?r("types[%i].encode(%s[ks[i]],w.uint32(18).fork()).ldelim().ldelim()",u,t):r(".uint32(%i).%s(%s[ks[i]]).ldelim()",16|d,h,t),r("}")("}")):l.repeated?(r("if(%s!=null&&%s.length){",t,t),l.packed&&void 0!==s.packed[h]?r("w.uint32(%i).fork()",(l.id<<3|2)>>>0)("for(var i=0;i<%s.length;++i)",t)("w.%s(%s[i])",h,t)("w.ldelim()"):(r("for(var i=0;i<%s.length;++i)",t),void 0===d?i(r,l,u,t+"[i]"):r("w.uint32(%i).%s(%s[i])",(l.id<<3|d)>>>0,h,t)),r("}")):(l.optional&&r("if(%s!=null&&Object.hasOwnProperty.call(m,%j))",t,l.name),void 0===d?i(r,l,u,t):r("w.uint32(%i).%s(%s)",(l.id<<3|d)>>>0,h,t))}return r("return w")};var n=r(5643),s=r(361),o=r(3262);function i(e,t,r,n){return t.resolvedType.group?e("types[%i].encode(%s,w.uint32(%i)).uint32(%i)",r,n,(t.id<<3|3)>>>0,(t.id<<3|4)>>>0):e("types[%i].encode(%s,w.uint32(%i).fork()).ldelim()",r,n,(t.id<<3|2)>>>0)}},5643:(e,t,r)=>{"use strict";e.exports=i;var n=r(7209);((i.prototype=Object.create(n.prototype)).constructor=i).className="Enum";var s=r(8923),o=r(3262);function i(e,t,r,s,o,i){if(n.call(this,e,r),t&&"object"!=typeof t)throw TypeError("values must be an object");if(this.valuesById={},this.values=Object.create(this.valuesById),this.comment=s,this.comments=o||{},this.valuesOptions=i,this.reserved=void 0,t)for(var a=Object.keys(t),c=0;c{"use strict";e.exports=l;var n=r(7209);((l.prototype=Object.create(n.prototype)).constructor=l).className="Field";var s,o=r(5643),i=r(361),a=r(3262),c=/^required|optional|repeated$/;function l(e,t,r,s,o,l,u){if(a.isObject(s)?(u=o,l=s,s=o=void 0):a.isObject(o)&&(u=l,l=o,o=void 0),n.call(this,e,l),!a.isInteger(t)||t<0)throw TypeError("id must be a non-negative integer");if(!a.isString(r))throw TypeError("type must be a string");if(void 0!==s&&!c.test(s=s.toString().toLowerCase()))throw TypeError("rule must be a string rule");if(void 0!==o&&!a.isString(o))throw TypeError("extend must be a string");"proto3_optional"===s&&(s="optional"),this.rule=s&&"optional"!==s?s:void 0,this.type=r,this.id=t,this.extend=o||void 0,this.required="required"===s,this.optional=!this.required,this.repeated="repeated"===s,this.map=!1,this.message=null,this.partOf=null,this.typeDefault=null,this.defaultValue=null,this.long=!!a.Long&&void 0!==i.long[r],this.bytes="bytes"===r,this.resolvedType=null,this.extensionField=null,this.declaringField=null,this._packed=null,this.comment=u}l.fromJSON=function(e,t){return new l(e,t.id,t.type,t.rule,t.extend,t.options,t.comment)},Object.defineProperty(l.prototype,"packed",{get:function(){return null===this._packed&&(this._packed=!1!==this.getOption("packed")),this._packed}}),l.prototype.setOption=function(e,t,r){return"packed"===e&&(this._packed=null),n.prototype.setOption.call(this,e,t,r)},l.prototype.toJSON=function(e){var t=!!e&&Boolean(e.keepComments);return a.toObject(["rule","optional"!==this.rule&&this.rule||void 0,"type",this.type,"id",this.id,"extend",this.extend,"options",this.options,"comment",t?this.comment:void 0])},l.prototype.resolve=function(){if(this.resolved)return this;if(void 0===(this.typeDefault=i.defaults[this.type])?(this.resolvedType=(this.declaringField?this.declaringField.parent:this.parent).lookupTypeOrEnum(this.type),this.resolvedType instanceof s?this.typeDefault=null:this.typeDefault=this.resolvedType.values[Object.keys(this.resolvedType.values)[0]]):this.options&&this.options.proto3_optional&&(this.typeDefault=null),this.options&&null!=this.options.default&&(this.typeDefault=this.options.default,this.resolvedType instanceof o&&"string"==typeof this.typeDefault&&(this.typeDefault=this.resolvedType.values[this.typeDefault])),this.options&&(!0!==this.options.packed&&(void 0===this.options.packed||!this.resolvedType||this.resolvedType instanceof o)||delete this.options.packed,Object.keys(this.options).length||(this.options=void 0)),this.long)this.typeDefault=a.Long.fromNumber(this.typeDefault,"u"===this.type.charAt(0)),Object.freeze&&Object.freeze(this.typeDefault);else if(this.bytes&&"string"==typeof this.typeDefault){var e;a.base64.test(this.typeDefault)?a.base64.decode(this.typeDefault,e=a.newBuffer(a.base64.length(this.typeDefault)),0):a.utf8.write(this.typeDefault,e=a.newBuffer(a.utf8.length(this.typeDefault)),0),this.typeDefault=e}return this.map?this.defaultValue=a.emptyObject:this.repeated?this.defaultValue=a.emptyArray:this.defaultValue=this.typeDefault,this.parent instanceof s&&(this.parent.ctor.prototype[this.name]=this.defaultValue),n.prototype.resolve.call(this)},l.d=function(e,t,r,n){return"function"==typeof t?t=a.decorateType(t).name:t&&"object"==typeof t&&(t=a.decorateEnum(t).name),function(s,o){a.decorateType(s.constructor).add(new l(o,e,t,r,{default:n}))}},l._configure=function(e){s=e}},5325:(e,t,r)=>{"use strict";var n=e.exports=r(4394);n.build="light",n.load=function(e,t,r){return"function"==typeof t?(r=t,t=new n.Root):t||(t=new n.Root),t.load(e,r)},n.loadSync=function(e,t){return t||(t=new n.Root),t.loadSync(e)},n.encoder=r(1080),n.decoder=r(7728),n.verifier=r(420),n.converter=r(744),n.ReflectionObject=r(7209),n.Namespace=r(8923),n.Root=r(5330),n.Enum=r(5643),n.Type=r(7882),n.Field=r(1344),n.OneOf=r(1457),n.MapField=r(8252),n.Service=r(9687),n.Method=r(8811),n.Message=r(2551),n.wrappers=r(6434),n.types=r(361),n.util=r(3262),n.ReflectionObject._configure(n.Root),n.Namespace._configure(n.Type,n.Service,n.Enum),n.Root._configure(n.Type),n.Field._configure(n.Type)},4394:(e,t,r)=>{"use strict";var n=t;function s(){n.util._configure(),n.Writer._configure(n.BufferWriter),n.Reader._configure(n.BufferReader)}n.build="minimal",n.Writer=r(3449),n.BufferWriter=r(818),n.Reader=r(6237),n.BufferReader=r(3158),n.util=r(3610),n.rpc=r(5047),n.roots=r(4529),n.configure=s,s()},9100:(e,t,r)=>{"use strict";var n=e.exports=r(5325);n.build="full",n.tokenize=r(527),n.parse=r(4863),n.common=r(5095),n.Root._configure(n.Type,n.parse,n.common)},8252:(e,t,r)=>{"use strict";e.exports=i;var n=r(1344);((i.prototype=Object.create(n.prototype)).constructor=i).className="MapField";var s=r(361),o=r(3262);function i(e,t,r,s,i,a){if(n.call(this,e,t,s,void 0,void 0,i,a),!o.isString(r))throw TypeError("keyType must be a string");this.keyType=r,this.resolvedKeyType=null,this.map=!0}i.fromJSON=function(e,t){return new i(e,t.id,t.keyType,t.type,t.options,t.comment)},i.prototype.toJSON=function(e){var t=!!e&&Boolean(e.keepComments);return o.toObject(["keyType",this.keyType,"type",this.type,"id",this.id,"extend",this.extend,"options",this.options,"comment",t?this.comment:void 0])},i.prototype.resolve=function(){if(this.resolved)return this;if(void 0===s.mapKey[this.keyType])throw Error("invalid key type: "+this.keyType);return n.prototype.resolve.call(this)},i.d=function(e,t,r){return"function"==typeof r?r=o.decorateType(r).name:r&&"object"==typeof r&&(r=o.decorateEnum(r).name),function(n,s){o.decorateType(n.constructor).add(new i(s,e,t,r))}}},2551:(e,t,r)=>{"use strict";e.exports=s;var n=r(3610);function s(e){if(e)for(var t=Object.keys(e),r=0;r{"use strict";e.exports=o;var n=r(7209);((o.prototype=Object.create(n.prototype)).constructor=o).className="Method";var s=r(3262);function o(e,t,r,o,i,a,c,l,u){if(s.isObject(i)?(c=i,i=a=void 0):s.isObject(a)&&(c=a,a=void 0),void 0!==t&&!s.isString(t))throw TypeError("type must be a string");if(!s.isString(r))throw TypeError("requestType must be a string");if(!s.isString(o))throw TypeError("responseType must be a string");n.call(this,e,c),this.type=t||"rpc",this.requestType=r,this.requestStream=!!i||void 0,this.responseType=o,this.responseStream=!!a||void 0,this.resolvedRequestType=null,this.resolvedResponseType=null,this.comment=l,this.parsedOptions=u}o.fromJSON=function(e,t){return new o(e,t.type,t.requestType,t.responseType,t.requestStream,t.responseStream,t.options,t.comment,t.parsedOptions)},o.prototype.toJSON=function(e){var t=!!e&&Boolean(e.keepComments);return s.toObject(["type","rpc"!==this.type&&this.type||void 0,"requestType",this.requestType,"requestStream",this.requestStream,"responseType",this.responseType,"responseStream",this.responseStream,"options",this.options,"comment",t?this.comment:void 0,"parsedOptions",this.parsedOptions])},o.prototype.resolve=function(){return this.resolved?this:(this.resolvedRequestType=this.parent.lookupType(this.requestType),this.resolvedResponseType=this.parent.lookupType(this.responseType),n.prototype.resolve.call(this))}},8923:(e,t,r)=>{"use strict";e.exports=h;var n=r(7209);((h.prototype=Object.create(n.prototype)).constructor=h).className="Namespace";var s,o,i,a=r(1344),c=r(3262),l=r(1457);function u(e,t){if(e&&e.length){for(var r={},n=0;nt)return!0;return!1},h.isReservedName=function(e,t){if(e)for(var r=0;r0;){var n=e.shift();if(r.nested&&r.nested[n]){if(!((r=r.nested[n])instanceof h))throw Error("path conflicts with non-namespace objects")}else r.add(r=new h(n))}return t&&r.addJSON(t),r},h.prototype.resolveAll=function(){for(var e=this.nestedArray,t=0;t-1)return n}else if(n instanceof h&&(n=n.lookup(e.slice(1),t,!0)))return n}else for(var s=0;s{"use strict";e.exports=o,o.className="ReflectionObject";var n,s=r(3262);function o(e,t){if(!s.isString(e))throw TypeError("name must be a string");if(t&&!s.isObject(t))throw TypeError("options must be an object");this.options=t,this.parsedOptions=null,this.name=e,this.parent=null,this.resolved=!1,this.comment=null,this.filename=null}Object.defineProperties(o.prototype,{root:{get:function(){for(var e=this;null!==e.parent;)e=e.parent;return e}},fullName:{get:function(){for(var e=[this.name],t=this.parent;t;)e.unshift(t.name),t=t.parent;return e.join(".")}}}),o.prototype.toJSON=function(){throw Error()},o.prototype.onAdd=function(e){this.parent&&this.parent!==e&&this.parent.remove(this),this.parent=e,this.resolved=!1;var t=e.root;t instanceof n&&t._handleAdd(this)},o.prototype.onRemove=function(e){var t=e.root;t instanceof n&&t._handleRemove(this),this.parent=null,this.resolved=!1},o.prototype.resolve=function(){return this.resolved||this.root instanceof n&&(this.resolved=!0),this},o.prototype.getOption=function(e){if(this.options)return this.options[e]},o.prototype.setOption=function(e,t,r){return r&&this.options&&void 0!==this.options[e]||((this.options||(this.options={}))[e]=t),this},o.prototype.setParsedOption=function(e,t,r){this.parsedOptions||(this.parsedOptions=[]);var n=this.parsedOptions;if(r){var o=n.find((function(t){return Object.prototype.hasOwnProperty.call(t,e)}));if(o){var i=o[e];s.setProperty(i,r,t)}else(o={})[e]=s.setProperty({},r,t),n.push(o)}else{var a={};a[e]=t,n.push(a)}return this},o.prototype.setOptions=function(e,t){if(e)for(var r=Object.keys(e),n=0;n{"use strict";e.exports=i;var n=r(7209);((i.prototype=Object.create(n.prototype)).constructor=i).className="OneOf";var s=r(1344),o=r(3262);function i(e,t,r,s){if(Array.isArray(t)||(r=t,t=void 0),n.call(this,e,r),void 0!==t&&!Array.isArray(t))throw TypeError("fieldNames must be an Array");this.oneof=t||[],this.fieldsArray=[],this.comment=s}function a(e){if(e.parent)for(var t=0;t-1&&this.oneof.splice(t,1),e.partOf=null,this},i.prototype.onAdd=function(e){n.prototype.onAdd.call(this,e);for(var t=0;t{"use strict";e.exports=_,_.filename=null,_.defaults={keepCase:!1};var n=r(527),s=r(5330),o=r(7882),i=r(1344),a=r(8252),c=r(1457),l=r(5643),u=r(9687),h=r(8811),d=r(361),p=r(3262),f=/^[1-9][0-9]*$/,g=/^-?[1-9][0-9]*$/,y=/^0[x][0-9a-fA-F]+$/,m=/^-?0[x][0-9a-fA-F]+$/,b=/^0[0-7]+$/,w=/^-?0[0-7]+$/,v=/^(?![eE])[0-9]*(?:\.[0-9]*)?(?:[eE][+-]?[0-9]+)?$/,E=/^[a-zA-Z_][a-zA-Z_0-9]*$/,S=/^(?:\.?[a-zA-Z_][a-zA-Z_0-9]*)(?:\.[a-zA-Z_][a-zA-Z_0-9]*)*$/,A=/^(?:\.[a-zA-Z_][a-zA-Z_0-9]*)+$/;function _(e,t,r){t instanceof s||(r=t,t=new s),r||(r=_.defaults);var k,I,R,T,C,N=r.preferTrailingComment||!1,x=n(e,r.alternateCommentMode||!1),P=x.next,O=x.push,D=x.peek,L=x.skip,B=x.cmnt,U=!0,M=!1,F=t,$=r.keepCase?function(e){return e}:p.camelCase;function H(e,t,r){var n=_.filename;return r||(_.filename=null),Error("illegal "+(t||"token")+" '"+e+"' ("+(n?n+", ":"")+"line "+x.line+")")}function q(){var e,t=[];do{if('"'!==(e=P())&&"'"!==e)throw H(e);t.push(P()),L(e),e=D()}while('"'===e||"'"===e);return t.join("")}function V(e){var t=P();switch(t){case"'":case'"':return O(t),q();case"true":case"TRUE":return!0;case"false":case"FALSE":return!1}try{return function(e,t){var r=1;switch("-"===e.charAt(0)&&(r=-1,e=e.substring(1)),e){case"inf":case"INF":case"Inf":return r*(1/0);case"nan":case"NAN":case"Nan":case"NaN":return NaN;case"0":return 0}if(f.test(e))return r*parseInt(e,10);if(y.test(e))return r*parseInt(e,16);if(b.test(e))return r*parseInt(e,8);if(v.test(e))return r*parseFloat(e);throw H(e,"number",!0)}(t)}catch(r){if(e&&S.test(t))return t;throw H(t,"value")}}function j(e,t){var r,n;do{!t||'"'!==(r=D())&&"'"!==r?e.push([n=K(P()),L("to",!0)?K(P()):n]):e.push(q())}while(L(",",!0));var s={options:void 0,setOption:function(e,t){void 0===this.options&&(this.options={}),this.options[e]=t}};J(s,(function(e){if("option"!==e)throw H(e);ee(s,e),L(";")}),(function(){ne(s)}))}function K(e,t){switch(e){case"max":case"MAX":case"Max":return 536870911;case"0":return 0}if(!t&&"-"===e.charAt(0))throw H(e,"id");if(g.test(e))return parseInt(e,10);if(m.test(e))return parseInt(e,16);if(w.test(e))return parseInt(e,8);throw H(e,"id")}function z(){if(void 0!==k)throw H("package");if(k=P(),!S.test(k))throw H(k,"name");F=F.define(k),L(";")}function G(){var e,t=D();switch(t){case"weak":e=R||(R=[]),P();break;case"public":P();default:e=I||(I=[])}t=q(),L(";"),e.push(t)}function W(){if(L("="),T=q(),!(M="proto3"===T)&&"proto2"!==T)throw H(T,"syntax");L(";")}function Y(e,t){switch(t){case"option":return ee(e,t),L(";"),!0;case"message":return X(e,t),!0;case"enum":return Z(e,t),!0;case"service":return function(e,t){if(!E.test(t=P()))throw H(t,"service name");var r=new u(t);J(r,(function(e){if(!Y(r,e)){if("rpc"!==e)throw H(e);!function(e,t){var r=B(),n=t;if(!E.test(t=P()))throw H(t,"name");var s,o,i,a,c=t;if(L("("),L("stream",!0)&&(o=!0),!S.test(t=P()))throw H(t);if(s=t,L(")"),L("returns"),L("("),L("stream",!0)&&(a=!0),!S.test(t=P()))throw H(t);i=t,L(")");var l=new h(c,n,s,i,o,a);l.comment=r,J(l,(function(e){if("option"!==e)throw H(e);ee(l,e),L(";")})),e.add(l)}(r,e)}})),e.add(r)}(e,t),!0;case"extend":return function(e,t){if(!S.test(t=P()))throw H(t,"reference");var r=t;J(null,(function(t){switch(t){case"required":case"repeated":Q(e,t,r);break;case"optional":Q(e,M?"proto3_optional":"optional",r);break;default:if(!M||!S.test(t))throw H(t);O(t),Q(e,"optional",r)}}))}(e,t),!0}return!1}function J(e,t,r){var n=x.line;if(e&&("string"!=typeof e.comment&&(e.comment=B()),e.filename=_.filename),L("{",!0)){for(var s;"}"!==(s=P());)t(s);L(";",!0)}else r&&r(),L(";"),e&&("string"!=typeof e.comment||N)&&(e.comment=B(n)||e.comment)}function X(e,t){if(!E.test(t=P()))throw H(t,"type name");var r=new o(t);J(r,(function(e){if(!Y(r,e))switch(e){case"map":!function(e){L("<");var t=P();if(void 0===d.mapKey[t])throw H(t,"type");L(",");var r=P();if(!S.test(r))throw H(r,"type");L(">");var n=P();if(!E.test(n))throw H(n,"name");L("=");var s=new a($(n),K(P()),t,r);J(s,(function(e){if("option"!==e)throw H(e);ee(s,e),L(";")}),(function(){ne(s)})),e.add(s)}(r);break;case"required":case"repeated":Q(r,e);break;case"optional":Q(r,M?"proto3_optional":"optional");break;case"oneof":!function(e,t){if(!E.test(t=P()))throw H(t,"name");var r=new c($(t));J(r,(function(e){"option"===e?(ee(r,e),L(";")):(O(e),Q(r,"optional"))})),e.add(r)}(r,e);break;case"extensions":j(r.extensions||(r.extensions=[]));break;case"reserved":j(r.reserved||(r.reserved=[]),!0);break;default:if(!M||!S.test(e))throw H(e);O(e),Q(r,"optional")}})),e.add(r)}function Q(e,t,r){var n=P();if("group"!==n){for(;n.endsWith(".")||D().startsWith(".");)n+=P();if(!S.test(n))throw H(n,"type");var s=P();if(!E.test(s))throw H(s,"name");s=$(s),L("=");var a=new i(s,K(P()),n,t,r);if(J(a,(function(e){if("option"!==e)throw H(e);ee(a,e),L(";")}),(function(){ne(a)})),"proto3_optional"===t){var l=new c("_"+s);a.setOption("proto3_optional",!0),l.add(a),e.add(l)}else e.add(a);M||!a.repeated||void 0===d.packed[n]&&void 0!==d.basic[n]||a.setOption("packed",!1,!0)}else!function(e,t){var r=P();if(!E.test(r))throw H(r,"name");var n=p.lcFirst(r);r===n&&(r=p.ucFirst(r)),L("=");var s=K(P()),a=new o(r);a.group=!0;var c=new i(n,s,r,t);c.filename=_.filename,J(a,(function(e){switch(e){case"option":ee(a,e),L(";");break;case"required":case"repeated":Q(a,e);break;case"optional":Q(a,M?"proto3_optional":"optional");break;case"message":X(a,e);break;case"enum":Z(a,e);break;default:throw H(e)}})),e.add(a).add(c)}(e,t)}function Z(e,t){if(!E.test(t=P()))throw H(t,"name");var r=new l(t);J(r,(function(e){switch(e){case"option":ee(r,e),L(";");break;case"reserved":j(r.reserved||(r.reserved=[]),!0);break;default:!function(e,t){if(!E.test(t))throw H(t,"name");L("=");var r=K(P(),!0),n={options:void 0,setOption:function(e,t){void 0===this.options&&(this.options={}),this.options[e]=t}};J(n,(function(e){if("option"!==e)throw H(e);ee(n,e),L(";")}),(function(){ne(n)})),e.add(t,r,n.comment,n.options)}(r,e)}})),e.add(r)}function ee(e,t){var r=L("(",!0);if(!S.test(t=P()))throw H(t,"name");var n,s=t,o=s;r&&(L(")"),o=s="("+s+")",t=D(),A.test(t)&&(n=t.slice(1),s+=t,P())),L("="),function(e,t,r,n){e.setParsedOption&&e.setParsedOption(t,r,n)}(e,o,te(e,s),n)}function te(e,t){if(L("{",!0)){for(var r={};!L("}",!0);){if(!E.test(C=P()))throw H(C,"name");if(null===C)throw H(C,"end of input");var n,s=C;if(L(":",!0),"{"===D())n=te(e,t+"."+C);else if("["===D()){var o;if(n=[],L("[",!0)){do{o=V(!0),n.push(o)}while(L(",",!0));L("]"),void 0!==o&&re(e,t+"."+C,o)}}else n=V(!0),re(e,t+"."+C,n);var i=r[s];i&&(n=[].concat(i).concat(n)),r[s]=n,L(",",!0),L(";",!0)}return r}var a=V(!0);return re(e,t,a),a}function re(e,t,r){e.setOption&&e.setOption(t,r)}function ne(e){if(L("[",!0)){do{ee(e,"option")}while(L(",",!0));L("]")}return e}for(;null!==(C=P());)switch(C){case"package":if(!U)throw H(C);z();break;case"import":if(!U)throw H(C);G();break;case"syntax":if(!U)throw H(C);W();break;case"option":ee(F,C),L(";");break;default:if(Y(F,C)){U=!1;continue}throw H(C)}return _.filename=null,{package:k,imports:I,weakImports:R,syntax:T,root:t}}},6237:(e,t,r)=>{"use strict";e.exports=c;var n,s=r(3610),o=s.LongBits,i=s.utf8;function a(e,t){return RangeError("index out of range: "+e.pos+" + "+(t||1)+" > "+e.len)}function c(e){this.buf=e,this.pos=0,this.len=e.length}var l,u="undefined"!=typeof Uint8Array?function(e){if(e instanceof Uint8Array||Array.isArray(e))return new c(e);throw Error("illegal buffer")}:function(e){if(Array.isArray(e))return new c(e);throw Error("illegal buffer")},h=function(){return s.Buffer?function(e){return(c.create=function(e){return s.Buffer.isBuffer(e)?new n(e):u(e)})(e)}:u};function d(){var e=new o(0,0),t=0;if(!(this.len-this.pos>4)){for(;t<3;++t){if(this.pos>=this.len)throw a(this);if(e.lo=(e.lo|(127&this.buf[this.pos])<<7*t)>>>0,this.buf[this.pos++]<128)return e}return e.lo=(e.lo|(127&this.buf[this.pos++])<<7*t)>>>0,e}for(;t<4;++t)if(e.lo=(e.lo|(127&this.buf[this.pos])<<7*t)>>>0,this.buf[this.pos++]<128)return e;if(e.lo=(e.lo|(127&this.buf[this.pos])<<28)>>>0,e.hi=(e.hi|(127&this.buf[this.pos])>>4)>>>0,this.buf[this.pos++]<128)return e;if(t=0,this.len-this.pos>4){for(;t<5;++t)if(e.hi=(e.hi|(127&this.buf[this.pos])<<7*t+3)>>>0,this.buf[this.pos++]<128)return e}else for(;t<5;++t){if(this.pos>=this.len)throw a(this);if(e.hi=(e.hi|(127&this.buf[this.pos])<<7*t+3)>>>0,this.buf[this.pos++]<128)return e}throw Error("invalid varint encoding")}function p(e,t){return(e[t-4]|e[t-3]<<8|e[t-2]<<16|e[t-1]<<24)>>>0}function f(){if(this.pos+8>this.len)throw a(this,8);return new o(p(this.buf,this.pos+=4),p(this.buf,this.pos+=4))}c.create=h(),c.prototype._slice=s.Array.prototype.subarray||s.Array.prototype.slice,c.prototype.uint32=(l=4294967295,function(){if(l=(127&this.buf[this.pos])>>>0,this.buf[this.pos++]<128)return l;if(l=(l|(127&this.buf[this.pos])<<7)>>>0,this.buf[this.pos++]<128)return l;if(l=(l|(127&this.buf[this.pos])<<14)>>>0,this.buf[this.pos++]<128)return l;if(l=(l|(127&this.buf[this.pos])<<21)>>>0,this.buf[this.pos++]<128)return l;if(l=(l|(15&this.buf[this.pos])<<28)>>>0,this.buf[this.pos++]<128)return l;if((this.pos+=5)>this.len)throw this.pos=this.len,a(this,10);return l}),c.prototype.int32=function(){return 0|this.uint32()},c.prototype.sint32=function(){var e=this.uint32();return e>>>1^-(1&e)},c.prototype.bool=function(){return 0!==this.uint32()},c.prototype.fixed32=function(){if(this.pos+4>this.len)throw a(this,4);return p(this.buf,this.pos+=4)},c.prototype.sfixed32=function(){if(this.pos+4>this.len)throw a(this,4);return 0|p(this.buf,this.pos+=4)},c.prototype.float=function(){if(this.pos+4>this.len)throw a(this,4);var e=s.float.readFloatLE(this.buf,this.pos);return this.pos+=4,e},c.prototype.double=function(){if(this.pos+8>this.len)throw a(this,4);var e=s.float.readDoubleLE(this.buf,this.pos);return this.pos+=8,e},c.prototype.bytes=function(){var e=this.uint32(),t=this.pos,r=this.pos+e;if(r>this.len)throw a(this,e);if(this.pos+=e,Array.isArray(this.buf))return this.buf.slice(t,r);if(t===r){var n=s.Buffer;return n?n.alloc(0):new this.buf.constructor(0)}return this._slice.call(this.buf,t,r)},c.prototype.string=function(){var e=this.bytes();return i.read(e,0,e.length)},c.prototype.skip=function(e){if("number"==typeof e){if(this.pos+e>this.len)throw a(this,e);this.pos+=e}else do{if(this.pos>=this.len)throw a(this)}while(128&this.buf[this.pos++]);return this},c.prototype.skipType=function(e){switch(e){case 0:this.skip();break;case 1:this.skip(8);break;case 2:this.skip(this.uint32());break;case 3:for(;4!=(e=7&this.uint32());)this.skipType(e);break;case 5:this.skip(4);break;default:throw Error("invalid wire type "+e+" at offset "+this.pos)}return this},c._configure=function(e){n=e,c.create=h(),n._configure();var t=s.Long?"toLong":"toNumber";s.merge(c.prototype,{int64:function(){return d.call(this)[t](!1)},uint64:function(){return d.call(this)[t](!0)},sint64:function(){return d.call(this).zzDecode()[t](!1)},fixed64:function(){return f.call(this)[t](!0)},sfixed64:function(){return f.call(this)[t](!1)}})}},3158:(e,t,r)=>{"use strict";e.exports=o;var n=r(6237);(o.prototype=Object.create(n.prototype)).constructor=o;var s=r(3610);function o(e){n.call(this,e)}o._configure=function(){s.Buffer&&(o.prototype._slice=s.Buffer.prototype.slice)},o.prototype.string=function(){var e=this.uint32();return this.buf.utf8Slice?this.buf.utf8Slice(this.pos,this.pos=Math.min(this.pos+e,this.len)):this.buf.toString("utf-8",this.pos,this.pos=Math.min(this.pos+e,this.len))},o._configure()},5330:(e,t,r)=>{"use strict";e.exports=h;var n=r(8923);((h.prototype=Object.create(n.prototype)).constructor=h).className="Root";var s,o,i,a=r(1344),c=r(5643),l=r(1457),u=r(3262);function h(e){n.call(this,"",e),this.deferred=[],this.files=[]}function d(){}h.fromJSON=function(e,t){return t||(t=new h),e.options&&t.setOptions(e.options),t.addJSON(e.nested)},h.prototype.resolvePath=u.path.resolve,h.prototype.fetch=u.fetch,h.prototype.load=function e(t,r,n){"function"==typeof r&&(n=r,r=void 0);var s=this;if(!n)return u.asPromise(e,s,t,r);var a=n===d;function c(e,t){if(n){if(a)throw e;var r=n;n=null,r(e,t)}}function l(e){var t=e.lastIndexOf("google/protobuf/");if(t>-1){var r=e.substring(t);if(r in i)return r}return null}function h(e,t){try{if(u.isString(t)&&"{"===t.charAt(0)&&(t=JSON.parse(t)),u.isString(t)){o.filename=e;var n,i=o(t,s,r),h=0;if(i.imports)for(;h-1))if(s.files.push(e),e in i)a?h(e,i[e]):(++f,setTimeout((function(){--f,h(e,i[e])})));else if(a){var r;try{r=u.fs.readFileSync(e).toString("utf8")}catch(e){return void(t||c(e))}h(e,r)}else++f,s.fetch(e,(function(r,o){--f,n&&(r?t?f||c(null,s):c(r):h(e,o))}))}var f=0;u.isString(t)&&(t=[t]);for(var g,y=0;y-1&&this.deferred.splice(t,1)}}else if(e instanceof c)p.test(e.name)&&delete e.parent[e.name];else if(e instanceof n){for(var r=0;r{"use strict";e.exports={}},5047:(e,t,r)=>{"use strict";t.Service=r(7595)},7595:(e,t,r)=>{"use strict";e.exports=s;var n=r(3610);function s(e,t,r){if("function"!=typeof e)throw TypeError("rpcImpl must be a function");n.EventEmitter.call(this),this.rpcImpl=e,this.requestDelimited=Boolean(t),this.responseDelimited=Boolean(r)}(s.prototype=Object.create(n.EventEmitter.prototype)).constructor=s,s.prototype.rpcCall=function e(t,r,s,o,i){if(!o)throw TypeError("request must be specified");var a=this;if(!i)return n.asPromise(e,a,t,r,s,o);if(a.rpcImpl)try{return a.rpcImpl(t,r[a.requestDelimited?"encodeDelimited":"encode"](o).finish(),(function(e,r){if(e)return a.emit("error",e,t),i(e);if(null!==r){if(!(r instanceof s))try{r=s[a.responseDelimited?"decodeDelimited":"decode"](r)}catch(e){return a.emit("error",e,t),i(e)}return a.emit("data",r,t),i(null,r)}a.end(!0)}))}catch(e){return a.emit("error",e,t),void setTimeout((function(){i(e)}),0)}else setTimeout((function(){i(Error("already ended"))}),0)},s.prototype.end=function(e){return this.rpcImpl&&(e||this.rpcImpl(null,null,null),this.rpcImpl=null,this.emit("end").off()),this}},9687:(e,t,r)=>{"use strict";e.exports=a;var n=r(8923);((a.prototype=Object.create(n.prototype)).constructor=a).className="Service";var s=r(8811),o=r(3262),i=r(5047);function a(e,t){n.call(this,e,t),this.methods={},this._methodsArray=null}function c(e){return e._methodsArray=null,e}a.fromJSON=function(e,t){var r=new a(e,t.options);if(t.methods)for(var n=Object.keys(t.methods),o=0;o{"use strict";e.exports=h;var t=/[\s{}=;:[\],'"()<>]/g,r=/(?:"([^"\\]*(?:\\.[^"\\]*)*)")/g,n=/(?:'([^'\\]*(?:\\.[^'\\]*)*)')/g,s=/^ *[*/]+ */,o=/^\s*\*?\/*/,i=/\n/g,a=/\s/,c=/\\(.?)/g,l={0:"\0",r:"\r",n:"\n",t:"\t"};function u(e){return e.replace(c,(function(e,t){switch(t){case"\\":case"":return t;default:return l[t]||""}}))}function h(e,c){e=e.toString();var l=0,h=e.length,d=1,p=0,f={},g=[],y=null;function m(e){return Error("illegal "+e+" (line "+d+")")}function b(t){return e.charAt(t)}function w(t,r,n){var a,l={type:e.charAt(t++),lineEmpty:!1,leading:n},u=t-(c?2:3);do{if(--u<0||"\n"===(a=e.charAt(u))){l.lineEmpty=!0;break}}while(" "===a||"\t"===a);for(var h=e.substring(t,r).split(i),g=0;g0)return g.shift();if(y)return function(){var t="'"===y?n:r;t.lastIndex=l-1;var s=t.exec(e);if(!s)throw m("string");return l=t.lastIndex,A(y),y=null,u(s[1])}();var s,o,i,p,f,S=0===l;do{if(l===h)return null;for(s=!1;a.test(i=b(l));)if("\n"===i&&(S=!0,++d),++l===h)return null;if("/"===b(l)){if(++l===h)throw m("comment");if("/"===b(l))if(c){if(p=l,f=!1,v(l-1)){f=!0;do{if((l=E(l))===h)break;if(l++,!S)break}while(v(l))}else l=Math.min(h,E(l)+1);f&&(w(p,l,S),S=!0),d++,s=!0}else{for(f="/"===b(p=l+1);"\n"!==b(++l);)if(l===h)return null;++l,f&&(w(p,l-1,S),S=!0),++d,s=!0}else{if("*"!==(i=b(l)))return"/";p=l+1,f=c||"*"===b(p);do{if("\n"===i&&++d,++l===h)throw m("comment");o=i,i=b(l)}while("*"!==o||"/"!==i);++l,f&&(w(p,l-2,S),S=!0),s=!0}}}while(s);var _=l;if(t.lastIndex=0,!t.test(b(_++)))for(;_{"use strict";e.exports=b;var n=r(8923);((b.prototype=Object.create(n.prototype)).constructor=b).className="Type";var s=r(5643),o=r(1457),i=r(1344),a=r(8252),c=r(9687),l=r(2551),u=r(6237),h=r(3449),d=r(3262),p=r(1080),f=r(7728),g=r(420),y=r(744),m=r(6434);function b(e,t){n.call(this,e,t),this.fields={},this.oneofs=void 0,this.extensions=void 0,this.reserved=void 0,this.group=void 0,this._fieldsById=null,this._fieldsArray=null,this._oneofsArray=null,this._ctor=null}function w(e){return e._fieldsById=e._fieldsArray=e._oneofsArray=null,delete e.encode,delete e.decode,delete e.verify,e}Object.defineProperties(b.prototype,{fieldsById:{get:function(){if(this._fieldsById)return this._fieldsById;this._fieldsById={};for(var e=Object.keys(this.fields),t=0;t{"use strict";var n=t,s=r(3262),o=["double","float","int32","uint32","sint32","fixed32","sfixed32","int64","uint64","sint64","fixed64","sfixed64","bool","string","bytes"];function i(e,t){var r=0,n={};for(t|=0;r{"use strict";var n,s,o=e.exports=r(3610),i=r(4529);o.codegen=r(8561),o.fetch=r(5212),o.path=r(9207),o.fs=o.inquire("fs"),o.toArray=function(e){if(e){for(var t=Object.keys(e),r=new Array(t.length),n=0;n0)t[s]=e(t[s]||{},r,n);else{var o=t[s];o&&(n=[].concat(o).concat(n)),t[s]=n}return t}(e,t=t.split("."),r)},Object.defineProperty(o,"decorateRoot",{get:function(){return i.decorated||(i.decorated=new(r(5330)))}})},2239:(e,t,r)=>{"use strict";e.exports=s;var n=r(3610);function s(e,t){this.lo=e>>>0,this.hi=t>>>0}var o=s.zero=new s(0,0);o.toNumber=function(){return 0},o.zzEncode=o.zzDecode=function(){return this},o.length=function(){return 1};var i=s.zeroHash="\0\0\0\0\0\0\0\0";s.fromNumber=function(e){if(0===e)return o;var t=e<0;t&&(e=-e);var r=e>>>0,n=(e-r)/4294967296>>>0;return t&&(n=~n>>>0,r=~r>>>0,++r>4294967295&&(r=0,++n>4294967295&&(n=0))),new s(r,n)},s.from=function(e){if("number"==typeof e)return s.fromNumber(e);if(n.isString(e)){if(!n.Long)return s.fromNumber(parseInt(e,10));e=n.Long.fromString(e)}return e.low||e.high?new s(e.low>>>0,e.high>>>0):o},s.prototype.toNumber=function(e){if(!e&&this.hi>>>31){var t=1+~this.lo>>>0,r=~this.hi>>>0;return t||(r=r+1>>>0),-(t+4294967296*r)}return this.lo+4294967296*this.hi},s.prototype.toLong=function(e){return n.Long?new n.Long(0|this.lo,0|this.hi,Boolean(e)):{low:0|this.lo,high:0|this.hi,unsigned:Boolean(e)}};var a=String.prototype.charCodeAt;s.fromHash=function(e){return e===i?o:new s((a.call(e,0)|a.call(e,1)<<8|a.call(e,2)<<16|a.call(e,3)<<24)>>>0,(a.call(e,4)|a.call(e,5)<<8|a.call(e,6)<<16|a.call(e,7)<<24)>>>0)},s.prototype.toHash=function(){return String.fromCharCode(255&this.lo,this.lo>>>8&255,this.lo>>>16&255,this.lo>>>24,255&this.hi,this.hi>>>8&255,this.hi>>>16&255,this.hi>>>24)},s.prototype.zzEncode=function(){var e=this.hi>>31;return this.hi=((this.hi<<1|this.lo>>>31)^e)>>>0,this.lo=(this.lo<<1^e)>>>0,this},s.prototype.zzDecode=function(){var e=-(1&this.lo);return this.lo=((this.lo>>>1|this.hi<<31)^e)>>>0,this.hi=(this.hi>>>1^e)>>>0,this},s.prototype.length=function(){var e=this.lo,t=(this.lo>>>28|this.hi<<4)>>>0,r=this.hi>>>24;return 0===r?0===t?e<16384?e<128?1:2:e<2097152?3:4:t<16384?t<128?5:6:t<2097152?7:8:r<128?9:10}},3610:function(e,t,r){"use strict";var n=t;function s(e,t,r){for(var n=Object.keys(t),s=0;s0)},n.Buffer=function(){try{var e=n.inquire("buffer").Buffer;return e.prototype.utf8Write?e:null}catch(e){return null}}(),n._Buffer_from=null,n._Buffer_allocUnsafe=null,n.newBuffer=function(e){return"number"==typeof e?n.Buffer?n._Buffer_allocUnsafe(e):new n.Array(e):n.Buffer?n._Buffer_from(e):"undefined"==typeof Uint8Array?e:new Uint8Array(e)},n.Array="undefined"!=typeof Uint8Array?Uint8Array:Array,n.Long=n.global.dcodeIO&&n.global.dcodeIO.Long||n.global.Long||n.inquire("long"),n.key2Re=/^true|false|0|1$/,n.key32Re=/^-?(?:0|[1-9][0-9]*)$/,n.key64Re=/^(?:[\\x00-\\xff]{8}|-?(?:0|[1-9][0-9]*))$/,n.longToHash=function(e){return e?n.LongBits.from(e).toHash():n.LongBits.zeroHash},n.longFromHash=function(e,t){var r=n.LongBits.fromHash(e);return n.Long?n.Long.fromBits(r.lo,r.hi,t):r.toNumber(Boolean(t))},n.merge=s,n.lcFirst=function(e){return e.charAt(0).toLowerCase()+e.substring(1)},n.newError=o,n.ProtocolError=o("ProtocolError"),n.oneOfGetter=function(e){for(var t={},r=0;r-1;--r)if(1===t[e[r]]&&void 0!==this[e[r]]&&null!==this[e[r]])return e[r]}},n.oneOfSetter=function(e){return function(t){for(var r=0;r{"use strict";e.exports=function(e){var t=s.codegen(["m"],e.name+"$verify")('if(typeof m!=="object"||m===null)')("return%j","object expected"),r={};e.oneofsArray.length&&t("var p={}");for(var n=0;n{"use strict";var n=t,s=r(2551);n[".google.protobuf.Any"]={fromObject:function(e){if(e&&e["@type"]){var t=e["@type"].substring(e["@type"].lastIndexOf("/")+1),r=this.lookup(t);if(r){var n="."===e["@type"].charAt(0)?e["@type"].slice(1):e["@type"];return-1===n.indexOf("/")&&(n="/"+n),this.create({type_url:n,value:r.encode(r.fromObject(e)).finish()})}}return this.fromObject(e)},toObject:function(e,t){var r="",n="";if(t&&t.json&&e.type_url&&e.value){n=e.type_url.substring(e.type_url.lastIndexOf("/")+1),r=e.type_url.substring(0,e.type_url.lastIndexOf("/")+1);var o=this.lookup(n);o&&(e=o.decode(e.value))}if(!(e instanceof this.ctor)&&e instanceof s){var i=e.$type.toObject(e,t);return""===r&&(r="type.googleapis.com/"),n=r+("."===e.$type.fullName[0]?e.$type.fullName.slice(1):e.$type.fullName),i["@type"]=n,i}return this.toObject(e,t)}}},3449:(e,t,r)=>{"use strict";e.exports=h;var n,s=r(3610),o=s.LongBits,i=s.base64,a=s.utf8;function c(e,t,r){this.fn=e,this.len=t,this.next=void 0,this.val=r}function l(){}function u(e){this.head=e.head,this.tail=e.tail,this.len=e.len,this.next=e.states}function h(){this.len=0,this.head=new c(l,0,0),this.tail=this.head,this.states=null}var d=function(){return s.Buffer?function(){return(h.create=function(){return new n})()}:function(){return new h}};function p(e,t,r){t[r]=255&e}function f(e,t){this.len=e,this.next=void 0,this.val=t}function g(e,t,r){for(;e.hi;)t[r++]=127&e.lo|128,e.lo=(e.lo>>>7|e.hi<<25)>>>0,e.hi>>>=7;for(;e.lo>127;)t[r++]=127&e.lo|128,e.lo=e.lo>>>7;t[r++]=e.lo}function y(e,t,r){t[r]=255&e,t[r+1]=e>>>8&255,t[r+2]=e>>>16&255,t[r+3]=e>>>24}h.create=d(),h.alloc=function(e){return new s.Array(e)},s.Array!==Array&&(h.alloc=s.pool(h.alloc,s.Array.prototype.subarray)),h.prototype._push=function(e,t,r){return this.tail=this.tail.next=new c(e,t,r),this.len+=t,this},f.prototype=Object.create(c.prototype),f.prototype.fn=function(e,t,r){for(;e>127;)t[r++]=127&e|128,e>>>=7;t[r]=e},h.prototype.uint32=function(e){return this.len+=(this.tail=this.tail.next=new f((e>>>=0)<128?1:e<16384?2:e<2097152?3:e<268435456?4:5,e)).len,this},h.prototype.int32=function(e){return e<0?this._push(g,10,o.fromNumber(e)):this.uint32(e)},h.prototype.sint32=function(e){return this.uint32((e<<1^e>>31)>>>0)},h.prototype.uint64=function(e){var t=o.from(e);return this._push(g,t.length(),t)},h.prototype.int64=h.prototype.uint64,h.prototype.sint64=function(e){var t=o.from(e).zzEncode();return this._push(g,t.length(),t)},h.prototype.bool=function(e){return this._push(p,1,e?1:0)},h.prototype.fixed32=function(e){return this._push(y,4,e>>>0)},h.prototype.sfixed32=h.prototype.fixed32,h.prototype.fixed64=function(e){var t=o.from(e);return this._push(y,4,t.lo)._push(y,4,t.hi)},h.prototype.sfixed64=h.prototype.fixed64,h.prototype.float=function(e){return this._push(s.float.writeFloatLE,4,e)},h.prototype.double=function(e){return this._push(s.float.writeDoubleLE,8,e)};var m=s.Array.prototype.set?function(e,t,r){t.set(e,r)}:function(e,t,r){for(var n=0;n>>0;if(!t)return this._push(p,1,0);if(s.isString(e)){var r=h.alloc(t=i.length(e));i.decode(e,r,0),e=r}return this.uint32(t)._push(m,t,e)},h.prototype.string=function(e){var t=a.length(e);return t?this.uint32(t)._push(a.write,t,e):this._push(p,1,0)},h.prototype.fork=function(){return this.states=new u(this),this.head=this.tail=new c(l,0,0),this.len=0,this},h.prototype.reset=function(){return this.states?(this.head=this.states.head,this.tail=this.states.tail,this.len=this.states.len,this.states=this.states.next):(this.head=this.tail=new c(l,0,0),this.len=0),this},h.prototype.ldelim=function(){var e=this.head,t=this.tail,r=this.len;return this.reset().uint32(r),r&&(this.tail.next=e.next,this.tail=t,this.len+=r),this},h.prototype.finish=function(){for(var e=this.head.next,t=this.constructor.alloc(this.len),r=0;e;)e.fn(e.val,t,r),r+=e.len,e=e.next;return t},h._configure=function(e){n=e,h.create=d(),n._configure()}},818:(e,t,r)=>{"use strict";e.exports=o;var n=r(3449);(o.prototype=Object.create(n.prototype)).constructor=o;var s=r(3610);function o(){n.call(this)}function i(e,t,r){e.length<40?s.utf8.write(e,t,r):t.utf8Write?t.utf8Write(e,r):t.write(e,r)}o._configure=function(){o.alloc=s._Buffer_allocUnsafe,o.writeBytesBuffer=s.Buffer&&s.Buffer.prototype instanceof Uint8Array&&"set"===s.Buffer.prototype.set.name?function(e,t,r){t.set(e,r)}:function(e,t,r){if(e.copy)e.copy(t,r,0,e.length);else for(var n=0;n>>0;return this.uint32(t),t&&this._push(o.writeBytesBuffer,t,e),this},o.prototype.string=function(e){var t=s.Buffer.byteLength(e);return this.uint32(t),t&&this._push(i,t,e),this},o._configure()},152:(e,t)=>{"use strict";class r{static isArrayBuffer(e){return"[object ArrayBuffer]"===Object.prototype.toString.call(e)}static toArrayBuffer(e){return this.isArrayBuffer(e)?e:e.byteLength===e.buffer.byteLength||0===e.byteOffset&&e.byteLength===e.buffer.byteLength?e.buffer:this.toUint8Array(e.buffer).slice(e.byteOffset,e.byteOffset+e.byteLength).buffer}static toUint8Array(e){return this.toView(e,Uint8Array)}static toView(e,t){if(e.constructor===t)return e;if(this.isArrayBuffer(e))return new t(e);if(this.isArrayBufferView(e))return new t(e.buffer,e.byteOffset,e.byteLength);throw new TypeError("The provided value is not of type '(ArrayBuffer or ArrayBufferView)'")}static isBufferSource(e){return this.isArrayBufferView(e)||this.isArrayBuffer(e)}static isArrayBufferView(e){return ArrayBuffer.isView(e)||e&&this.isArrayBuffer(e.buffer)}static isEqual(e,t){const n=r.toUint8Array(e),s=r.toUint8Array(t);if(n.length!==s.byteLength)return!1;for(let e=0;e{}},__webpack_module_cache__={},leafPrototypes,getProto;function __webpack_require__(e){var t=__webpack_module_cache__[e];if(void 0!==t)return t.exports;var r=__webpack_module_cache__[e]={exports:{}};return __webpack_modules__[e].call(r.exports,r,r.exports,__webpack_require__),r.exports}__webpack_require__.amdO={},getProto=Object.getPrototypeOf?e=>Object.getPrototypeOf(e):e=>e.__proto__,__webpack_require__.t=function(e,t){if(1&t&&(e=this(e)),8&t)return e;if("object"==typeof e&&e){if(4&t&&e.__esModule)return e;if(16&t&&"function"==typeof e.then)return e}var r=Object.create(null);__webpack_require__.r(r);var n={};leafPrototypes=leafPrototypes||[null,getProto({}),getProto([]),getProto(getProto)];for(var s=2&t&&e;"object"==typeof s&&!~leafPrototypes.indexOf(s);s=getProto(s))Object.getOwnPropertyNames(s).forEach((t=>n[t]=()=>e[t]));return n.default=()=>e,__webpack_require__.d(r,n),r},__webpack_require__.d=(e,t)=>{for(var r in t)__webpack_require__.o(t,r)&&!__webpack_require__.o(e,r)&&Object.defineProperty(e,r,{enumerable:!0,get:t[r]})},__webpack_require__.o=(e,t)=>Object.prototype.hasOwnProperty.call(e,t),__webpack_require__.r=e=>{"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(e,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(e,"__esModule",{value:!0})};var __webpack_exports__={};(()=>{"use strict";var e={};__webpack_require__.r(e),__webpack_require__.d(e,{base10:()=>ie});var t={};__webpack_require__.r(t),__webpack_require__.d(t,{base16:()=>ae,base16upper:()=>ce});var r={};__webpack_require__.r(r),__webpack_require__.d(r,{base2:()=>le});var n={};__webpack_require__.r(n),__webpack_require__.d(n,{base256emoji:()=>pe});var s={};__webpack_require__.r(s),__webpack_require__.d(s,{base32:()=>fe,base32hex:()=>be,base32hexpad:()=>ve,base32hexpadupper:()=>Ee,base32hexupper:()=>we,base32pad:()=>ye,base32padupper:()=>me,base32upper:()=>ge,base32z:()=>Se});var o={};__webpack_require__.r(o),__webpack_require__.d(o,{base36:()=>Ae,base36upper:()=>_e});var i={};__webpack_require__.r(i),__webpack_require__.d(i,{base58btc:()=>ke,base58flickr:()=>Ie});var a={};__webpack_require__.r(a),__webpack_require__.d(a,{base64:()=>Re,base64pad:()=>Te,base64url:()=>Ce,base64urlpad:()=>Ne});var c={};__webpack_require__.r(c),__webpack_require__.d(c,{base8:()=>xe});var l={};__webpack_require__.r(l),__webpack_require__.d(l,{identity:()=>Pe});var u={};__webpack_require__.r(u),__webpack_require__.d(u,{code:()=>Be,decode:()=>Me,encode:()=>Ue,name:()=>Le});var h={};__webpack_require__.r(h),__webpack_require__.d(h,{code:()=>$e,decode:()=>qe,encode:()=>He,name:()=>Fe});var d={};__webpack_require__.r(d),__webpack_require__.d(d,{identity:()=>ht});var p={};__webpack_require__.r(p),__webpack_require__.d(p,{sha256:()=>gt,sha512:()=>yt});var f={};__webpack_require__.r(f),__webpack_require__.d(f,{aK:()=>xi,e8:()=>yi,DO:()=>gi,OG:()=>Pi,My:()=>bi,Ph:()=>Ai,lX:()=>_i,Id:()=>Ti,fg:()=>Li,qj:()=>Ri,aT:()=>Si,r4:()=>Ni,aY:()=>fi,x:()=>Mi,lq:()=>ki,z:()=>Ii,Q5:()=>Ui});var g={};__webpack_require__.r(g),__webpack_require__.d(g,{Ed25519PrivateKey:()=>$a,Ed25519PublicKey:()=>Fa,generateKeyPair:()=>Va,generateKeyPairFromSeed:()=>ja,unmarshalEd25519PrivateKey:()=>Ha,unmarshalEd25519PublicKey:()=>qa});var y={};__webpack_require__.r(y),__webpack_require__.d(y,{MAX_RSA_KEY_SIZE:()=>cu,RsaPrivateKey:()=>uu,RsaPublicKey:()=>lu,fromJwk:()=>pu,generateKeyPair:()=>fu,unmarshalRsaPrivateKey:()=>hu,unmarshalRsaPublicKey:()=>du});var m={};function b(e=0){return new Uint8Array(e)}function w(e=0){return new Uint8Array(e)}__webpack_require__.r(m),__webpack_require__.d(m,{Secp256k1PrivateKey:()=>Ou,Secp256k1PublicKey:()=>Pu,generateKeyPair:()=>Bu,unmarshalSecp256k1PrivateKey:()=>Du,unmarshalSecp256k1PublicKey:()=>Lu});const v=Math.pow(2,7),E=Math.pow(2,14),S=Math.pow(2,21),A=Math.pow(2,28),_=Math.pow(2,35),k=Math.pow(2,42),I=Math.pow(2,49),R=128,T=127;function C(e){if(eNumber.MAX_SAFE_INTEGER)throw new RangeError("Could not encode varint");return 8}function N(e,t,r=0){switch(C(e)){case 8:t[r++]=255&e|R,e/=128;case 7:t[r++]=255&e|R,e/=128;case 6:t[r++]=255&e|R,e/=128;case 5:t[r++]=255&e|R,e/=128;case 4:t[r++]=255&e|R,e>>>=7;case 3:t[r++]=255&e|R,e>>>=7;case 2:t[r++]=255&e|R,e>>>=7;case 1:t[r++]=255&e,e>>>=7;break;default:throw new Error("unreachable")}return t}function x(e,t){let r=e[t],n=0;if(n+=r&T,r>>=7;case 3:t.set(r++,255&e|R),e>>>=7;case 2:t.set(r++,255&e|R),e>>>=7;case 1:t.set(r++,255&e),e>>>=7;break;default:throw new Error("unreachable")}return t}(e,t,r)}function O(e,t=0){return e instanceof Uint8Array?x(e,t):function(e,t){let r=e.get(t),n=0;if(n+=r&T,r>>31>0){const e=1+~this.lo>>>0;let t=~this.hi>>>0;return 0===e&&(t=t+1>>>0),-(e+4294967296*t)}return this.lo+4294967296*this.hi}toBigInt(e=!1){if(e)return BigInt(this.lo>>>0)+(BigInt(this.hi>>>0)<<32n);if(this.hi>>>31!=0){const e=1+~this.lo>>>0;let t=~this.hi>>>0;return 0===e&&(t=t+1>>>0),-(BigInt(e)+(BigInt(t)<<32n))}return BigInt(this.lo>>>0)+(BigInt(this.hi>>>0)<<32n)}toString(e=!1){return this.toBigInt(e).toString()}zzEncode(){const e=this.hi>>31;return this.hi=((this.hi<<1|this.lo>>>31)^e)>>>0,this.lo=(this.lo<<1^e)>>>0,this}zzDecode(){const e=-(1&this.lo);return this.lo=((this.lo>>>1|this.hi<<31)^e)>>>0,this.hi=(this.hi>>>1^e)>>>0,this}length(){const e=this.lo,t=(this.lo>>>28|this.hi<<4)>>>0,r=this.hi>>>24;return 0===r?0===t?e<16384?e<128?1:2:e<2097152?3:4:t<16384?t<128?5:6:t<2097152?7:8:r<128?9:10}static fromBigInt(e){if(0n===e)return V;if(e<$&&e>H)return this.fromNumber(Number(e));const t=e<0n;t&&(e=-e);let r=e>>32n,n=e-(r<<32n);return t&&(r=0n|~r,n=0n|~n,++n>j&&(n=0n,++r>j&&(r=0n))),new q(Number(n),Number(r))}static fromNumber(e){if(0===e)return V;const t=e<0;t&&(e=-e);let r=e>>>0,n=(e-r)/4294967296>>>0;return t&&(n=~n>>>0,r=~r>>>0,++r>4294967295&&(r=0,++n>4294967295&&(n=0))),new q(r,n)}static from(e){return"number"==typeof e?q.fromNumber(e):"bigint"==typeof e?q.fromBigInt(e):"string"==typeof e?q.fromBigInt(BigInt(e)):null!=e.low||null!=e.high?new q(e.low>>>0,e.high>>>0):V}}const V=new q(0,0);V.toBigInt=function(){return 0n},V.zzEncode=V.zzDecode=function(){return this},V.length=function(){return 1};const j=4294967296n;function K(e,t,r){const n=r;let s,o;for(let n=0;n>6|192,t[r++]=63&s|128):55296==(64512&s)&&56320==(64512&(o=e.charCodeAt(n+1)))?(s=65536+((1023&s)<<10)+(1023&o),++n,t[r++]=s>>18|240,t[r++]=s>>12&63|128,t[r++]=s>>6&63|128,t[r++]=63&s|128):(t[r++]=s>>12|224,t[r++]=s>>6&63|128,t[r++]=63&s|128);return r-n}function z(e,t){return RangeError(`index out of range: ${e.pos} + ${t??1} > ${e.len}`)}function G(e,t){return(e[t-4]|e[t-3]<<8|e[t-2]<<16|e[t-1]<<24)>>>0}class W{buf;pos;len;_slice=Uint8Array.prototype.subarray;constructor(e){this.buf=e,this.pos=0,this.len=e.length}uint32(){let e=4294967295;if(e=(127&this.buf[this.pos])>>>0,this.buf[this.pos++]<128)return e;if(e=(e|(127&this.buf[this.pos])<<7)>>>0,this.buf[this.pos++]<128)return e;if(e=(e|(127&this.buf[this.pos])<<14)>>>0,this.buf[this.pos++]<128)return e;if(e=(e|(127&this.buf[this.pos])<<21)>>>0,this.buf[this.pos++]<128)return e;if(e=(e|(15&this.buf[this.pos])<<28)>>>0,this.buf[this.pos++]<128)return e;if((this.pos+=5)>this.len)throw this.pos=this.len,z(this,10);return e}int32(){return 0|this.uint32()}sint32(){const e=this.uint32();return e>>>1^-(1&e)}bool(){return 0!==this.uint32()}fixed32(){if(this.pos+4>this.len)throw z(this,4);return G(this.buf,this.pos+=4)}sfixed32(){if(this.pos+4>this.len)throw z(this,4);return 0|G(this.buf,this.pos+=4)}float(){if(this.pos+4>this.len)throw z(this,4);const e=(t=this.buf,r=this.pos,L[0]=t[r],L[1]=t[r+1],L[2]=t[r+2],L[3]=t[r+3],D[0]);var t,r;return this.pos+=4,e}double(){if(this.pos+8>this.len)throw z(this,4);const e=(t=this.buf,r=this.pos,M[0]=t[r],M[1]=t[r+1],M[2]=t[r+2],M[3]=t[r+3],M[4]=t[r+4],M[5]=t[r+5],M[6]=t[r+6],M[7]=t[r+7],U[0]);var t,r;return this.pos+=8,e}bytes(){const e=this.uint32(),t=this.pos,r=this.pos+e;if(r>this.len)throw z(this,e);return this.pos+=e,t===r?new Uint8Array(0):this.buf.subarray(t,r)}string(){const e=this.bytes();return function(e,t,r){if(r-t<1)return"";let n;const s=[];let o,i=0;for(;t191&&o<224?s[i++]=(31&o)<<6|63&e[t++]:o>239&&o<365?(o=((7&o)<<18|(63&e[t++])<<12|(63&e[t++])<<6|63&e[t++])-65536,s[i++]=55296+(o>>10),s[i++]=56320+(1023&o)):s[i++]=(15&o)<<12|(63&e[t++])<<6|63&e[t++],i>8191&&((n??(n=[])).push(String.fromCharCode.apply(String,s)),i=0);return null!=n?(i>0&&n.push(String.fromCharCode.apply(String,s.slice(0,i))),n.join("")):String.fromCharCode.apply(String,s.slice(0,i))}(e,0,e.length)}skip(e){if("number"==typeof e){if(this.pos+e>this.len)throw z(this,e);this.pos+=e}else do{if(this.pos>=this.len)throw z(this)}while(128&this.buf[this.pos++]);return this}skipType(e){switch(e){case 0:this.skip();break;case 1:this.skip(8);break;case 2:this.skip(this.uint32());break;case 3:for(;4!=(e=7&this.uint32());)this.skipType(e);break;case 5:this.skip(4);break;default:throw Error(`invalid wire type ${e} at offset ${this.pos}`)}return this}readLongVarint(){const e=new q(0,0);let t=0;if(!(this.len-this.pos>4)){for(;t<3;++t){if(this.pos>=this.len)throw z(this);if(e.lo=(e.lo|(127&this.buf[this.pos])<<7*t)>>>0,this.buf[this.pos++]<128)return e}return e.lo=(e.lo|(127&this.buf[this.pos++])<<7*t)>>>0,e}for(;t<4;++t)if(e.lo=(e.lo|(127&this.buf[this.pos])<<7*t)>>>0,this.buf[this.pos++]<128)return e;if(e.lo=(e.lo|(127&this.buf[this.pos])<<28)>>>0,e.hi=(e.hi|(127&this.buf[this.pos])>>4)>>>0,this.buf[this.pos++]<128)return e;if(t=0,this.len-this.pos>4){for(;t<5;++t)if(e.hi=(e.hi|(127&this.buf[this.pos])<<7*t+3)>>>0,this.buf[this.pos++]<128)return e}else for(;t<5;++t){if(this.pos>=this.len)throw z(this);if(e.hi=(e.hi|(127&this.buf[this.pos])<<7*t+3)>>>0,this.buf[this.pos++]<128)return e}throw Error("invalid varint encoding")}readFixed64(){if(this.pos+8>this.len)throw z(this,8);const e=G(this.buf,this.pos+=4),t=G(this.buf,this.pos+=4);return new q(e,t)}int64(){return this.readLongVarint().toBigInt()}int64Number(){return this.readLongVarint().toNumber()}int64String(){return this.readLongVarint().toString()}uint64(){return this.readLongVarint().toBigInt(!0)}uint64Number(){const e=x(this.buf,this.pos);return this.pos+=C(e),e}uint64String(){return this.readLongVarint().toString(!0)}sint64(){return this.readLongVarint().zzDecode().toBigInt()}sint64Number(){return this.readLongVarint().zzDecode().toNumber()}sint64String(){return this.readLongVarint().zzDecode().toString()}fixed64(){return this.readFixed64().toBigInt()}fixed64Number(){return this.readFixed64().toNumber()}fixed64String(){return this.readFixed64().toString()}sfixed64(){return this.readFixed64().toBigInt()}sfixed64Number(){return this.readFixed64().toNumber()}sfixed64String(){return this.readFixed64().toString()}}function Y(e,t,r){const n=function(e){return new W(e instanceof Uint8Array?e:e.subarray())}(e);return t.decode(n,void 0,r)}function J(e){if(e instanceof Uint8Array&&"Uint8Array"===e.constructor.name)return e;if(e instanceof ArrayBuffer)return new Uint8Array(e);if(ArrayBuffer.isView(e))return new Uint8Array(e.buffer,e.byteOffset,e.byteLength);throw new Error("Unknown type, must be binary type")}new Uint8Array(0);const X=function(e,t){if(e.length>=255)throw new TypeError("Alphabet too long");for(var r=new Uint8Array(256),n=0;n>>0,i=new Uint8Array(o);e[t];){var u=r[e.charCodeAt(t)];if(255===u)return;for(var h=0,d=o-1;(0!==u||h>>0,i[d]=u%256>>>0,u=u/256>>>0;if(0!==u)throw new Error("Non-zero carry");s=h,t++}if(" "!==e[t]){for(var p=o-s;p!==o&&0===i[p];)p++;for(var f=new Uint8Array(n+(o-p)),g=n;p!==o;)f[g++]=i[p++];return f}}}return{encode:function(t){if(t instanceof Uint8Array||(ArrayBuffer.isView(t)?t=new Uint8Array(t.buffer,t.byteOffset,t.byteLength):Array.isArray(t)&&(t=Uint8Array.from(t))),!(t instanceof Uint8Array))throw new TypeError("Expected Uint8Array");if(0===t.length)return"";for(var r=0,n=0,s=0,o=t.length;s!==o&&0===t[s];)s++,r++;for(var i=(o-s)*u+1>>>0,l=new Uint8Array(i);s!==o;){for(var h=t[s],d=0,p=i-1;(0!==h||d>>0,l[p]=h%a>>>0,h=h/a>>>0;if(0!==h)throw new Error("Non-zero carry");n=d,s++}for(var f=i-n;f!==i&&0===l[f];)f++;for(var g=c.repeat(r);fJ(s(e))})}function oe({name:e,prefix:t,bitsPerChar:r,alphabet:n}){return ne({prefix:t,name:e,encode:e=>function(e,t,r){const n="="===t[t.length-1],s=(1<r;)i-=r,o+=t[s&a>>i];if(0!==i&&(o+=t[s&a<function(e,t,r,n){const s={};for(let e=0;e=8&&(a-=8,i[l++]=255&c>>a)}if(a>=r||255&c<<8-a)throw new SyntaxError("Unexpected end of data");return i}(t,n,r,e)})}const ie=se({prefix:"9",name:"base10",alphabet:"0123456789"}),ae=oe({prefix:"f",name:"base16",alphabet:"0123456789abcdef",bitsPerChar:4}),ce=oe({prefix:"F",name:"base16upper",alphabet:"0123456789ABCDEF",bitsPerChar:4}),le=oe({prefix:"0",name:"base2",alphabet:"01",bitsPerChar:1}),ue=Array.from("🚀🪐☄🛰🌌🌑🌒🌓🌔🌕🌖🌗🌘🌍🌏🌎🐉☀💻🖥💾💿😂❤😍🤣😊🙏💕😭😘👍😅👏😁🔥🥰💔💖💙😢🤔😆🙄💪😉☺👌🤗💜😔😎😇🌹🤦🎉💞✌✨🤷😱😌🌸🙌😋💗💚😏💛🙂💓🤩😄😀🖤😃💯🙈👇🎶😒🤭❣😜💋👀😪😑💥🙋😞😩😡🤪👊🥳😥🤤👉💃😳✋😚😝😴🌟😬🙃🍀🌷😻😓⭐✅🥺🌈😈🤘💦✔😣🏃💐☹🎊💘😠☝😕🌺🎂🌻😐🖕💝🙊😹🗣💫💀👑🎵🤞😛🔴😤🌼😫⚽🤙☕🏆🤫👈😮🙆🍻🍃🐶💁😲🌿🧡🎁⚡🌞🎈❌✊👋😰🤨😶🤝🚶💰🍓💢🤟🙁🚨💨🤬✈🎀🍺🤓😙💟🌱😖👶🥴▶➡❓💎💸⬇😨🌚🦋😷🕺⚠🙅😟😵👎🤲🤠🤧📌🔵💅🧐🐾🍒😗🤑🌊🤯🐷☎💧😯💆👆🎤🙇🍑❄🌴💣🐸💌📍🥀🤢👅💡💩👐📸👻🤐🤮🎼🥵🚩🍎🍊👼💍📣🥂"),he=ue.reduce(((e,t,r)=>(e[r]=t,e)),[]),de=ue.reduce(((e,t,r)=>(e[t.codePointAt(0)]=r,e)),[]),pe=ne({prefix:"🚀",name:"base256emoji",encode:function(e){return e.reduce(((e,t)=>e+he[t]),"")},decode:function(e){const t=[];for(const r of e){const e=de[r.codePointAt(0)];if(void 0===e)throw new Error(`Non-base256emoji character: ${r}`);t.push(e)}return new Uint8Array(t)}}),fe=oe({prefix:"b",name:"base32",alphabet:"abcdefghijklmnopqrstuvwxyz234567",bitsPerChar:5}),ge=oe({prefix:"B",name:"base32upper",alphabet:"ABCDEFGHIJKLMNOPQRSTUVWXYZ234567",bitsPerChar:5}),ye=oe({prefix:"c",name:"base32pad",alphabet:"abcdefghijklmnopqrstuvwxyz234567=",bitsPerChar:5}),me=oe({prefix:"C",name:"base32padupper",alphabet:"ABCDEFGHIJKLMNOPQRSTUVWXYZ234567=",bitsPerChar:5}),be=oe({prefix:"v",name:"base32hex",alphabet:"0123456789abcdefghijklmnopqrstuv",bitsPerChar:5}),we=oe({prefix:"V",name:"base32hexupper",alphabet:"0123456789ABCDEFGHIJKLMNOPQRSTUV",bitsPerChar:5}),ve=oe({prefix:"t",name:"base32hexpad",alphabet:"0123456789abcdefghijklmnopqrstuv=",bitsPerChar:5}),Ee=oe({prefix:"T",name:"base32hexpadupper",alphabet:"0123456789ABCDEFGHIJKLMNOPQRSTUV=",bitsPerChar:5}),Se=oe({prefix:"h",name:"base32z",alphabet:"ybndrfg8ejkmcpqxot1uwisza345h769",bitsPerChar:5}),Ae=se({prefix:"k",name:"base36",alphabet:"0123456789abcdefghijklmnopqrstuvwxyz"}),_e=se({prefix:"K",name:"base36upper",alphabet:"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"}),ke=se({name:"base58btc",prefix:"z",alphabet:"123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz"}),Ie=se({name:"base58flickr",prefix:"Z",alphabet:"123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ"}),Re=oe({prefix:"m",name:"base64",alphabet:"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/",bitsPerChar:6}),Te=oe({prefix:"M",name:"base64pad",alphabet:"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=",bitsPerChar:6}),Ce=oe({prefix:"u",name:"base64url",alphabet:"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_",bitsPerChar:6}),Ne=oe({prefix:"U",name:"base64urlpad",alphabet:"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_=",bitsPerChar:6}),xe=oe({prefix:"7",name:"base8",alphabet:"01234567",bitsPerChar:3}),Pe=ne({prefix:"\0",name:"identity",encode:e=>{return t=e,(new TextDecoder).decode(t);var t},decode:e=>function(e){return(new TextEncoder).encode(e)}(e)}),Oe=new TextEncoder,De=new TextDecoder,Le="json",Be=512;function Ue(e){return Oe.encode(JSON.stringify(e))}function Me(e){return JSON.parse(De.decode(e))}const Fe="raw",$e=85;function He(e){return J(e)}function qe(e){return J(e)}var Ve=128,je=-128,Ke=Math.pow(2,31),ze=128,Ge=127,We=Math.pow(2,7),Ye=Math.pow(2,14),Je=Math.pow(2,21),Xe=Math.pow(2,28),Qe=Math.pow(2,35),Ze=Math.pow(2,42),et=Math.pow(2,49),tt=Math.pow(2,56),rt=Math.pow(2,63);const nt={encode:function e(t,r,n){r=r||[];for(var s=n=n||0;t>=Ke;)r[n++]=255&t|Ve,t/=128;for(;t&je;)r[n++]=255&t|Ve,t>>>=7;return r[n]=0|t,e.bytes=n-s+1,r},decode:function e(t,r){var n,s=0,o=0,i=r=r||0,a=t.length;do{if(i>=a)throw e.bytes=0,new RangeError("Could not decode varint");n=t[i++],s+=o<28?(n&Ge)<=ze);return e.bytes=i-r,s},encodingLength:function(e){return eat(this.code,e)))}throw Error("Unknown type, must be binary type")}}function ft(e){return async t=>new Uint8Array(await crypto.subtle.digest(e,t))}const gt=dt({name:"sha2-256",code:18,encode:ft("SHA-256")}),yt=dt({name:"sha2-512",code:19,encode:ft("SHA-512")});function mt(e,t){const{bytes:r,version:n}=e;return 0===n?function(e,t,r){const{prefix:n}=r;if(n!==ke.prefix)throw Error(`Cannot string encode V0 in ${r.name} encoding`);const s=t.get(n);if(null==s){const s=r.encode(e).slice(1);return t.set(n,s),s}return s}(r,wt(e),t??ke.encoder):function(e,t,r){const{prefix:n}=r,s=t.get(n);if(null==s){const s=r.encode(e);return t.set(n,s),s}return s}(r,wt(e),t??fe.encoder)}const bt=new WeakMap;function wt(e){const t=bt.get(e);if(null==t){const t=new Map;return bt.set(e,t),t}return t}class vt{code;version;multihash;bytes;"/";constructor(e,t,r,n){this.code=t,this.version=e,this.multihash=r,this.bytes=n,this["/"]=n}get asCID(){return this}get byteOffset(){return this.bytes.byteOffset}get byteLength(){return this.bytes.byteLength}toV0(){switch(this.version){case 0:return this;case 1:{const{code:e,multihash:t}=this;if(e!==Et)throw new Error("Cannot convert a non dag-pb CID to CIDv0");if(t.code!==St)throw new Error("Cannot convert non sha2-256 multihash CID to CIDv0");return vt.createV0(t)}default:throw Error(`Can not convert CID version ${this.version} to version 0. This is a bug please report`)}}toV1(){switch(this.version){case 0:{const{code:e,digest:t}=this.multihash,r=at(e,t);return vt.createV1(this.code,r)}case 1:return this;default:throw Error(`Can not convert CID version ${this.version} to version 1. This is a bug please report`)}}equals(e){return vt.equals(this,e)}static equals(e,t){const r=t;return null!=r&&e.code===r.code&&e.version===r.version&&function(e,t){if(e===t)return!0;{const r=t;return e.code===r.code&&e.size===r.size&&r.bytes instanceof Uint8Array&&function(e,t){if(e===t)return!0;if(e.byteLength!==t.byteLength)return!1;for(let r=0;r{const[r,n]=st(e.subarray(t));return t+=n,r};let n=r(),s=Et;if(18===n?(n=0,t=0):s=r(),0!==n&&1!==n)throw new RangeError(`Invalid CID version ${n}`);const o=t,i=r(),a=r(),c=t+a;return{version:n,codec:s,multihashCode:i,digestSize:a,multihashSize:c-o,size:c}}static parse(e,t){const[r,n]=function(e,t){switch(e[0]){case"Q":{const r=t??ke;return[ke.prefix,r.decode(`${ke.prefix}${e}`)]}case ke.prefix:{const r=t??ke;return[ke.prefix,r.decode(e)]}case fe.prefix:{const r=t??fe;return[fe.prefix,r.decode(e)]}default:if(null==t)throw Error("To parse non base32 or base58btc encoded CID multibase decoder must be provided");return[e[0],t.decode(e)]}}(e,t),s=vt.decode(n);if(0===s.version&&"Q"!==e[0])throw Error("Version 0 CID string must not include multibase prefix");return wt(s).set(r,e),s}}const Et=112,St=18;function At(e,t,r){const n=it(e),s=n+it(t),o=new Uint8Array(s+r.byteLength);return ot(e,o,0),ot(t,o,n),o.set(r,s),o}const _t=Symbol.for("@ipld/js-cid/CID"),kt={...l,...r,...c,...e,...t,...s,...o,...i,...a,...n};function It(e,t,r,n){return{name:e,prefix:t,encoder:{name:e,prefix:t,encode:r},decoder:{decode:n}}}const Rt=It("utf8","u",(e=>"u"+new TextDecoder("utf8").decode(e)),(e=>(new TextEncoder).encode(e.substring(1)))),Tt=It("ascii","a",(e=>{let t="a";for(let r=0;r{const t=w((e=e.substring(1)).length);for(let r=0;r4096)return w(e);n+e>t&&(r=w(t),n=0);const s=r.subarray(n,n+=e);return 7&n&&(n=1+(7|n)),s}}();class Lt{len;head;tail;states;constructor(){this.len=0,this.head=new xt(Pt,0,0),this.tail=this.head,this.states=null}_push(e,t,r){return this.tail=this.tail.next=new xt(e,t,r),this.len+=t,this}uint32(e){return this.len+=(this.tail=this.tail.next=new Mt((e>>>=0)<128?1:e<16384?2:e<2097152?3:e<268435456?4:5,e)).len,this}int32(e){return e<0?this._push(Ft,10,q.fromNumber(e)):this.uint32(e)}sint32(e){return this.uint32((e<<1^e>>31)>>>0)}uint64(e){const t=q.fromBigInt(e);return this._push(Ft,t.length(),t)}uint64Number(e){return this._push(N,C(e),e)}uint64String(e){return this.uint64(BigInt(e))}int64(e){return this.uint64(e)}int64Number(e){return this.uint64Number(e)}int64String(e){return this.uint64String(e)}sint64(e){const t=q.fromBigInt(e).zzEncode();return this._push(Ft,t.length(),t)}sint64Number(e){const t=q.fromNumber(e).zzEncode();return this._push(Ft,t.length(),t)}sint64String(e){return this.sint64(BigInt(e))}bool(e){return this._push(Bt,1,e?1:0)}fixed32(e){return this._push($t,4,e>>>0)}sfixed32(e){return this.fixed32(e)}fixed64(e){const t=q.fromBigInt(e);return this._push($t,4,t.lo)._push($t,4,t.hi)}fixed64Number(e){const t=q.fromNumber(e);return this._push($t,4,t.lo)._push($t,4,t.hi)}fixed64String(e){return this.fixed64(BigInt(e))}sfixed64(e){return this.fixed64(e)}sfixed64Number(e){return this.fixed64Number(e)}sfixed64String(e){return this.fixed64String(e)}float(e){return this._push(B,4,e)}double(e){return this._push(F,8,e)}bytes(e){const t=e.length>>>0;return 0===t?this._push(Bt,1,0):this.uint32(t)._push(Ht,t,e)}string(e){const t=function(e){let t=0,r=0;for(let n=0;n127;)t[r++]=127&e|128,e>>>=7;t[r]=e}class Mt extends xt{next;constructor(e,t){super(Ut,e,t),this.next=void 0}}function Ft(e,t,r){for(;0!==e.hi;)t[r++]=127&e.lo|128,e.lo=(e.lo>>>7|e.hi<<25)>>>0,e.hi>>>=7;for(;e.lo>127;)t[r++]=127&e.lo|128,e.lo=e.lo>>>7;t[r++]=e.lo}function $t(e,t,r){t[r]=255&e,t[r+1]=e>>>8&255,t[r+2]=e>>>16&255,t[r+3]=e>>>24}function Ht(e,t,r){t.set(e,r)}function qt(e,t,r){t.set(e,r)}function Vt(e,t,r){e.length<40?K(e,t,r):null!=t.utf8Write?t.utf8Write(e,r):t.set(Nt(e),r)}function jt(e,t){const r=new Lt;return t.encode(e,r,{lengthDelimited:!1}),r.finish()}var Kt,zt,Gt,Wt,Yt,Jt,Xt,Qt,Zt,er,tr,rr,nr,sr,or,ir,ar,cr,lr,ur,hr,dr,pr,fr,gr,yr,mr,br,wr,vr;function Er(e,t,r,n){return{name:e,type:t,encode:r,decode:n}}function Sr(e){function t(t){if(null==e[t.toString()])throw new Error("Invalid enum value");return e[t]}return Er("enum",Kt.VARINT,(function(e,r){const n=t(e);r.int32(n)}),(function(e){return t(e.int32())}))}function Ar(e,t){return Er("message",Kt.LENGTH_DELIMITED,e,t)}null!=globalThis.Buffer&&(Lt.prototype.bytes=function(e){const t=e.length>>>0;return this.uint32(t),t>0&&this._push(qt,t,e),this},Lt.prototype.string=function(e){const t=globalThis.Buffer.byteLength(e);return this.uint32(t),t>0&&this._push(Vt,t,e),this}),function(e){e[e.VARINT=0]="VARINT",e[e.BIT64=1]="BIT64",e[e.LENGTH_DELIMITED=2]="LENGTH_DELIMITED",e[e.START_GROUP=3]="START_GROUP",e[e.END_GROUP=4]="END_GROUP",e[e.BIT32=5]="BIT32"}(Kt||(Kt={})),Error;class _r extends Error{code="ERR_MAX_LENGTH";name="MaxLengthError"}function kr(e){return Boolean(e)}function Ir(e){const t=new Map;return e.forEach((e=>{let r=t.get(e.contentTopic);r||(t.set(e.contentTopic,[]),r=t.get(e.contentTopic)),r.push(e)})),t}function Rr(e){return new Promise((t=>{setTimeout(t,e)}))}!function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.proof&&e.proof.byteLength>0&&(t.uint32(10),t.bytes(e.proof)),null!=e.merkleRoot&&e.merkleRoot.byteLength>0&&(t.uint32(18),t.bytes(e.merkleRoot)),null!=e.epoch&&e.epoch.byteLength>0&&(t.uint32(26),t.bytes(e.epoch)),null!=e.shareX&&e.shareX.byteLength>0&&(t.uint32(34),t.bytes(e.shareX)),null!=e.shareY&&e.shareY.byteLength>0&&(t.uint32(42),t.bytes(e.shareY)),null!=e.nullifier&&e.nullifier.byteLength>0&&(t.uint32(50),t.bytes(e.nullifier)),null!=e.rlnIdentifier&&e.rlnIdentifier.byteLength>0&&(t.uint32(58),t.bytes(e.rlnIdentifier)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={proof:b(0),merkleRoot:b(0),epoch:b(0),shareX:b(0),shareY:b(0),nullifier:b(0),rlnIdentifier:b(0)},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.proof=e.bytes();break;case 2:n.merkleRoot=e.bytes();break;case 3:n.epoch=e.bytes();break;case 4:n.shareX=e.bytes();break;case 5:n.shareY=e.bytes();break;case 6:n.nullifier=e.bytes();break;case 7:n.rlnIdentifier=e.bytes();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(zt||(zt={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.payload&&e.payload.byteLength>0&&(t.uint32(10),t.bytes(e.payload)),null!=e.contentTopic&&""!==e.contentTopic&&(t.uint32(18),t.string(e.contentTopic)),null!=e.version&&(t.uint32(24),t.uint32(e.version)),null!=e.timestamp&&(t.uint32(80),t.sint64(e.timestamp)),null!=e.meta&&(t.uint32(90),t.bytes(e.meta)),null!=e.rateLimitProof&&(t.uint32(170),zt.codec().encode(e.rateLimitProof,t)),null!=e.ephemeral&&(t.uint32(248),t.bool(e.ephemeral)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={payload:b(0),contentTopic:""},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.payload=e.bytes();break;case 2:n.contentTopic=e.string();break;case 3:n.version=e.uint32();break;case 10:n.timestamp=e.sint64();break;case 11:n.meta=e.bytes();break;case 21:n.rateLimitProof=zt.codec().decode(e,e.uint32(),{limits:r.limits?.rateLimitProof});break;case 31:n.ephemeral=e.bool();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(Gt||(Gt={})),function(e){let t,r;!function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.contentTopic&&""!==e.contentTopic&&(t.uint32(10),t.string(e.contentTopic)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={contentTopic:""},s=null==t?e.len:e.pos+t;for(;e.pos>>3==1?n.contentTopic=e.string():e.skipType(7&t)}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(t=e.ContentFilter||(e.ContentFilter={})),e.codec=()=>(null==r&&(r=Ar(((t,r,n={})=>{if(!1!==n.lengthDelimited&&r.fork(),null!=t.subscribe&&!1!==t.subscribe&&(r.uint32(8),r.bool(t.subscribe)),null!=t.topic&&""!==t.topic&&(r.uint32(18),r.string(t.topic)),null!=t.contentFilters)for(const n of t.contentFilters)r.uint32(26),e.ContentFilter.codec().encode(n,r);!1!==n.lengthDelimited&&r.ldelim()}),((t,r,n={})=>{const s={subscribe:!1,topic:"",contentFilters:[]},o=null==r?t.len:t.pos+r;for(;t.pos>>3){case 1:s.subscribe=t.bool();break;case 2:s.topic=t.string();break;case 3:if(null!=n.limits?.contentFilters&&s.contentFilters.length===n.limits.contentFilters)throw new _r('Decode error - map field "contentFilters" had too many elements');s.contentFilters.push(e.ContentFilter.codec().decode(t,t.uint32(),{limits:n.limits?.contentFilters$}));break;default:t.skipType(7&r)}}return s}))),r),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(Wt||(Wt={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{if(!1!==r.lengthDelimited&&t.fork(),null!=e.messages)for(const r of e.messages)t.uint32(10),Qt.codec().encode(r,t);!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={messages:[]},s=null==t?e.len:e.pos+t;for(;e.pos>>3==1){if(null!=r.limits?.messages&&n.messages.length===r.limits.messages)throw new _r('Decode error - map field "messages" had too many elements');n.messages.push(Qt.codec().decode(e,e.uint32(),{limits:r.limits?.messages$}))}else e.skipType(7&t)}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(Yt||(Yt={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.requestId&&""!==e.requestId&&(t.uint32(10),t.string(e.requestId)),null!=e.request&&(t.uint32(18),Wt.codec().encode(e.request,t)),null!=e.push&&(t.uint32(26),Yt.codec().encode(e.push,t)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={requestId:""},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.requestId=e.string();break;case 2:n.request=Wt.codec().decode(e,e.uint32(),{limits:r.limits?.request});break;case 3:n.push=Yt.codec().decode(e,e.uint32(),{limits:r.limits?.push});break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(Jt||(Jt={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.proof&&e.proof.byteLength>0&&(t.uint32(10),t.bytes(e.proof)),null!=e.merkleRoot&&e.merkleRoot.byteLength>0&&(t.uint32(18),t.bytes(e.merkleRoot)),null!=e.epoch&&e.epoch.byteLength>0&&(t.uint32(26),t.bytes(e.epoch)),null!=e.shareX&&e.shareX.byteLength>0&&(t.uint32(34),t.bytes(e.shareX)),null!=e.shareY&&e.shareY.byteLength>0&&(t.uint32(42),t.bytes(e.shareY)),null!=e.nullifier&&e.nullifier.byteLength>0&&(t.uint32(50),t.bytes(e.nullifier)),null!=e.rlnIdentifier&&e.rlnIdentifier.byteLength>0&&(t.uint32(58),t.bytes(e.rlnIdentifier)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={proof:b(0),merkleRoot:b(0),epoch:b(0),shareX:b(0),shareY:b(0),nullifier:b(0),rlnIdentifier:b(0)},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.proof=e.bytes();break;case 2:n.merkleRoot=e.bytes();break;case 3:n.epoch=e.bytes();break;case 4:n.shareX=e.bytes();break;case 5:n.shareY=e.bytes();break;case 6:n.nullifier=e.bytes();break;case 7:n.rlnIdentifier=e.bytes();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(Xt||(Xt={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.payload&&e.payload.byteLength>0&&(t.uint32(10),t.bytes(e.payload)),null!=e.contentTopic&&""!==e.contentTopic&&(t.uint32(18),t.string(e.contentTopic)),null!=e.version&&(t.uint32(24),t.uint32(e.version)),null!=e.timestamp&&(t.uint32(80),t.sint64(e.timestamp)),null!=e.meta&&(t.uint32(90),t.bytes(e.meta)),null!=e.rateLimitProof&&(t.uint32(170),Xt.codec().encode(e.rateLimitProof,t)),null!=e.ephemeral&&(t.uint32(248),t.bool(e.ephemeral)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={payload:b(0),contentTopic:""},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.payload=e.bytes();break;case 2:n.contentTopic=e.string();break;case 3:n.version=e.uint32();break;case 10:n.timestamp=e.sint64();break;case 11:n.meta=e.bytes();break;case 21:n.rateLimitProof=Xt.codec().decode(e,e.uint32(),{limits:r.limits?.rateLimitProof});break;case 31:n.ephemeral=e.bool();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(Qt||(Qt={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.contentTopic&&""!==e.contentTopic&&(t.uint32(18),t.string(e.contentTopic)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={contentTopic:""},s=null==t?e.len:e.pos+t;for(;e.pos>>3==2?n.contentTopic=e.string():e.skipType(7&t)}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(Zt||(Zt={})),function(e){let t,r,n;!function(e){e.SUBSCRIBER_PING="SUBSCRIBER_PING",e.SUBSCRIBE="SUBSCRIBE",e.UNSUBSCRIBE="UNSUBSCRIBE",e.UNSUBSCRIBE_ALL="UNSUBSCRIBE_ALL"}(t=e.FilterSubscribeType||(e.FilterSubscribeType={})),function(e){e[e.SUBSCRIBER_PING=0]="SUBSCRIBER_PING",e[e.SUBSCRIBE=1]="SUBSCRIBE",e[e.UNSUBSCRIBE=2]="UNSUBSCRIBE",e[e.UNSUBSCRIBE_ALL=3]="UNSUBSCRIBE_ALL"}(r||(r={})),function(e){e.codec=()=>Sr(r)}(t=e.FilterSubscribeType||(e.FilterSubscribeType={})),e.codec=()=>(null==n&&(n=Ar(((t,n,s={})=>{if(!1!==s.lengthDelimited&&n.fork(),null!=t.requestId&&""!==t.requestId&&(n.uint32(10),n.string(t.requestId)),null!=t.filterSubscribeType&&0!==r[t.filterSubscribeType]&&(n.uint32(16),e.FilterSubscribeType.codec().encode(t.filterSubscribeType,n)),null!=t.pubsubTopic&&(n.uint32(82),n.string(t.pubsubTopic)),null!=t.contentTopics)for(const e of t.contentTopics)n.uint32(90),n.string(e);!1!==s.lengthDelimited&&n.ldelim()}),((r,n,s={})=>{const o={requestId:"",filterSubscribeType:t.SUBSCRIBER_PING,contentTopics:[]},i=null==n?r.len:r.pos+n;for(;r.pos>>3){case 1:o.requestId=r.string();break;case 2:o.filterSubscribeType=e.FilterSubscribeType.codec().decode(r);break;case 10:o.pubsubTopic=r.string();break;case 11:if(null!=s.limits?.contentTopics&&o.contentTopics.length===s.limits.contentTopics)throw new _r('Decode error - map field "contentTopics" had too many elements');o.contentTopics.push(r.string());break;default:r.skipType(7&t)}}return o}))),n),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(er||(er={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.requestId&&""!==e.requestId&&(t.uint32(10),t.string(e.requestId)),null!=e.statusCode&&0!==e.statusCode&&(t.uint32(80),t.uint32(e.statusCode)),null!=e.statusDesc&&(t.uint32(90),t.string(e.statusDesc)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={requestId:"",statusCode:0},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.requestId=e.string();break;case 10:n.statusCode=e.uint32();break;case 11:n.statusDesc=e.string();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(tr||(tr={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.wakuMessage&&(t.uint32(10),sr.codec().encode(e.wakuMessage,t)),null!=e.pubsubTopic&&(t.uint32(18),t.string(e.pubsubTopic)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.wakuMessage=sr.codec().decode(e,e.uint32(),{limits:r.limits?.wakuMessage});break;case 2:n.pubsubTopic=e.string();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(rr||(rr={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.proof&&e.proof.byteLength>0&&(t.uint32(10),t.bytes(e.proof)),null!=e.merkleRoot&&e.merkleRoot.byteLength>0&&(t.uint32(18),t.bytes(e.merkleRoot)),null!=e.epoch&&e.epoch.byteLength>0&&(t.uint32(26),t.bytes(e.epoch)),null!=e.shareX&&e.shareX.byteLength>0&&(t.uint32(34),t.bytes(e.shareX)),null!=e.shareY&&e.shareY.byteLength>0&&(t.uint32(42),t.bytes(e.shareY)),null!=e.nullifier&&e.nullifier.byteLength>0&&(t.uint32(50),t.bytes(e.nullifier)),null!=e.rlnIdentifier&&e.rlnIdentifier.byteLength>0&&(t.uint32(58),t.bytes(e.rlnIdentifier)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={proof:b(0),merkleRoot:b(0),epoch:b(0),shareX:b(0),shareY:b(0),nullifier:b(0),rlnIdentifier:b(0)},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.proof=e.bytes();break;case 2:n.merkleRoot=e.bytes();break;case 3:n.epoch=e.bytes();break;case 4:n.shareX=e.bytes();break;case 5:n.shareY=e.bytes();break;case 6:n.nullifier=e.bytes();break;case 7:n.rlnIdentifier=e.bytes();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(nr||(nr={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.payload&&e.payload.byteLength>0&&(t.uint32(10),t.bytes(e.payload)),null!=e.contentTopic&&""!==e.contentTopic&&(t.uint32(18),t.string(e.contentTopic)),null!=e.version&&(t.uint32(24),t.uint32(e.version)),null!=e.timestamp&&(t.uint32(80),t.sint64(e.timestamp)),null!=e.meta&&(t.uint32(90),t.bytes(e.meta)),null!=e.rateLimitProof&&(t.uint32(170),nr.codec().encode(e.rateLimitProof,t)),null!=e.ephemeral&&(t.uint32(248),t.bool(e.ephemeral)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={payload:b(0),contentTopic:""},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.payload=e.bytes();break;case 2:n.contentTopic=e.string();break;case 3:n.version=e.uint32();break;case 10:n.timestamp=e.sint64();break;case 11:n.meta=e.bytes();break;case 21:n.rateLimitProof=nr.codec().decode(e,e.uint32(),{limits:r.limits?.rateLimitProof});break;case 31:n.ephemeral=e.bool();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(sr||(sr={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.pubsubTopic&&""!==e.pubsubTopic&&(t.uint32(10),t.string(e.pubsubTopic)),null!=e.message&&(t.uint32(18),lr.codec().encode(e.message,t)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={pubsubTopic:""},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.pubsubTopic=e.string();break;case 2:n.message=lr.codec().decode(e,e.uint32(),{limits:r.limits?.message});break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(or||(or={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.isSuccess&&!1!==e.isSuccess&&(t.uint32(8),t.bool(e.isSuccess)),null!=e.info&&(t.uint32(18),t.string(e.info)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={isSuccess:!1},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.isSuccess=e.bool();break;case 2:n.info=e.string();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(ir||(ir={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.requestId&&""!==e.requestId&&(t.uint32(10),t.string(e.requestId)),null!=e.request&&(t.uint32(18),or.codec().encode(e.request,t)),null!=e.response&&(t.uint32(26),ir.codec().encode(e.response,t)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={requestId:""},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.requestId=e.string();break;case 2:n.request=or.codec().decode(e,e.uint32(),{limits:r.limits?.request});break;case 3:n.response=ir.codec().decode(e,e.uint32(),{limits:r.limits?.response});break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(ar||(ar={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.proof&&e.proof.byteLength>0&&(t.uint32(10),t.bytes(e.proof)),null!=e.merkleRoot&&e.merkleRoot.byteLength>0&&(t.uint32(18),t.bytes(e.merkleRoot)),null!=e.epoch&&e.epoch.byteLength>0&&(t.uint32(26),t.bytes(e.epoch)),null!=e.shareX&&e.shareX.byteLength>0&&(t.uint32(34),t.bytes(e.shareX)),null!=e.shareY&&e.shareY.byteLength>0&&(t.uint32(42),t.bytes(e.shareY)),null!=e.nullifier&&e.nullifier.byteLength>0&&(t.uint32(50),t.bytes(e.nullifier)),null!=e.rlnIdentifier&&e.rlnIdentifier.byteLength>0&&(t.uint32(58),t.bytes(e.rlnIdentifier)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={proof:b(0),merkleRoot:b(0),epoch:b(0),shareX:b(0),shareY:b(0),nullifier:b(0),rlnIdentifier:b(0)},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.proof=e.bytes();break;case 2:n.merkleRoot=e.bytes();break;case 3:n.epoch=e.bytes();break;case 4:n.shareX=e.bytes();break;case 5:n.shareY=e.bytes();break;case 6:n.nullifier=e.bytes();break;case 7:n.rlnIdentifier=e.bytes();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(cr||(cr={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.payload&&e.payload.byteLength>0&&(t.uint32(10),t.bytes(e.payload)),null!=e.contentTopic&&""!==e.contentTopic&&(t.uint32(18),t.string(e.contentTopic)),null!=e.version&&(t.uint32(24),t.uint32(e.version)),null!=e.timestamp&&(t.uint32(80),t.sint64(e.timestamp)),null!=e.meta&&(t.uint32(90),t.bytes(e.meta)),null!=e.rateLimitProof&&(t.uint32(170),cr.codec().encode(e.rateLimitProof,t)),null!=e.ephemeral&&(t.uint32(248),t.bool(e.ephemeral)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={payload:b(0),contentTopic:""},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.payload=e.bytes();break;case 2:n.contentTopic=e.string();break;case 3:n.version=e.uint32();break;case 10:n.timestamp=e.sint64();break;case 11:n.meta=e.bytes();break;case 21:n.rateLimitProof=cr.codec().decode(e,e.uint32(),{limits:r.limits?.rateLimitProof});break;case 31:n.ephemeral=e.bool();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(lr||(lr={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.messageHash&&(t.uint32(10),t.bytes(e.messageHash)),null!=e.message&&(t.uint32(18),fr.codec().encode(e.message,t)),null!=e.pubsubTopic&&(t.uint32(26),t.string(e.pubsubTopic)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.messageHash=e.bytes();break;case 2:n.message=fr.codec().decode(e,e.uint32(),{limits:r.limits?.message});break;case 3:n.pubsubTopic=e.string();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(ur||(ur={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{if(!1!==r.lengthDelimited&&t.fork(),null!=e.requestId&&""!==e.requestId&&(t.uint32(10),t.string(e.requestId)),null!=e.includeData&&!1!==e.includeData&&(t.uint32(16),t.bool(e.includeData)),null!=e.pubsubTopic&&(t.uint32(82),t.string(e.pubsubTopic)),null!=e.contentTopics)for(const r of e.contentTopics)t.uint32(90),t.string(r);if(null!=e.timeStart&&(t.uint32(96),t.sint64(e.timeStart)),null!=e.timeEnd&&(t.uint32(104),t.sint64(e.timeEnd)),null!=e.messageHashes)for(const r of e.messageHashes)t.uint32(162),t.bytes(r);null!=e.paginationCursor&&(t.uint32(410),t.bytes(e.paginationCursor)),null!=e.paginationForward&&!1!==e.paginationForward&&(t.uint32(416),t.bool(e.paginationForward)),null!=e.paginationLimit&&(t.uint32(424),t.uint64(e.paginationLimit)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={requestId:"",includeData:!1,contentTopics:[],messageHashes:[],paginationForward:!1},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.requestId=e.string();break;case 2:n.includeData=e.bool();break;case 10:n.pubsubTopic=e.string();break;case 11:if(null!=r.limits?.contentTopics&&n.contentTopics.length===r.limits.contentTopics)throw new _r('Decode error - map field "contentTopics" had too many elements');n.contentTopics.push(e.string());break;case 12:n.timeStart=e.sint64();break;case 13:n.timeEnd=e.sint64();break;case 20:if(null!=r.limits?.messageHashes&&n.messageHashes.length===r.limits.messageHashes)throw new _r('Decode error - map field "messageHashes" had too many elements');n.messageHashes.push(e.bytes());break;case 51:n.paginationCursor=e.bytes();break;case 52:n.paginationForward=e.bool();break;case 53:n.paginationLimit=e.uint64();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(hr||(hr={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{if(!1!==r.lengthDelimited&&t.fork(),null!=e.requestId&&""!==e.requestId&&(t.uint32(10),t.string(e.requestId)),null!=e.statusCode&&(t.uint32(80),t.uint32(e.statusCode)),null!=e.statusDesc&&(t.uint32(90),t.string(e.statusDesc)),null!=e.messages)for(const r of e.messages)t.uint32(162),ur.codec().encode(r,t);null!=e.paginationCursor&&(t.uint32(410),t.bytes(e.paginationCursor)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={requestId:"",messages:[]},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.requestId=e.string();break;case 10:n.statusCode=e.uint32();break;case 11:n.statusDesc=e.string();break;case 20:if(null!=r.limits?.messages&&n.messages.length===r.limits.messages)throw new _r('Decode error - map field "messages" had too many elements');n.messages.push(ur.codec().decode(e,e.uint32(),{limits:r.limits?.messages$}));break;case 51:n.paginationCursor=e.bytes();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(dr||(dr={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.proof&&e.proof.byteLength>0&&(t.uint32(10),t.bytes(e.proof)),null!=e.merkleRoot&&e.merkleRoot.byteLength>0&&(t.uint32(18),t.bytes(e.merkleRoot)),null!=e.epoch&&e.epoch.byteLength>0&&(t.uint32(26),t.bytes(e.epoch)),null!=e.shareX&&e.shareX.byteLength>0&&(t.uint32(34),t.bytes(e.shareX)),null!=e.shareY&&e.shareY.byteLength>0&&(t.uint32(42),t.bytes(e.shareY)),null!=e.nullifier&&e.nullifier.byteLength>0&&(t.uint32(50),t.bytes(e.nullifier)),null!=e.rlnIdentifier&&e.rlnIdentifier.byteLength>0&&(t.uint32(58),t.bytes(e.rlnIdentifier)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={proof:b(0),merkleRoot:b(0),epoch:b(0),shareX:b(0),shareY:b(0),nullifier:b(0),rlnIdentifier:b(0)},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.proof=e.bytes();break;case 2:n.merkleRoot=e.bytes();break;case 3:n.epoch=e.bytes();break;case 4:n.shareX=e.bytes();break;case 5:n.shareY=e.bytes();break;case 6:n.nullifier=e.bytes();break;case 7:n.rlnIdentifier=e.bytes();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(pr||(pr={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.payload&&e.payload.byteLength>0&&(t.uint32(10),t.bytes(e.payload)),null!=e.contentTopic&&""!==e.contentTopic&&(t.uint32(18),t.string(e.contentTopic)),null!=e.version&&(t.uint32(24),t.uint32(e.version)),null!=e.timestamp&&(t.uint32(80),t.sint64(e.timestamp)),null!=e.meta&&(t.uint32(90),t.bytes(e.meta)),null!=e.rateLimitProof&&(t.uint32(170),pr.codec().encode(e.rateLimitProof,t)),null!=e.ephemeral&&(t.uint32(248),t.bool(e.ephemeral)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={payload:b(0),contentTopic:""},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.payload=e.bytes();break;case 2:n.contentTopic=e.string();break;case 3:n.version=e.uint32();break;case 10:n.timestamp=e.sint64();break;case 11:n.meta=e.bytes();break;case 21:n.rateLimitProof=pr.codec().decode(e,e.uint32(),{limits:r.limits?.rateLimitProof});break;case 31:n.ephemeral=e.bool();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(fr||(fr={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.enr&&(t.uint32(10),t.bytes(e.enr)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={},s=null==t?e.len:e.pos+t;for(;e.pos>>3==1?n.enr=e.bytes():e.skipType(7&t)}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(gr||(gr={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.numPeers&&(t.uint32(8),t.uint64(e.numPeers)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={},s=null==t?e.len:e.pos+t;for(;e.pos>>3==1?n.numPeers=e.uint64():e.skipType(7&t)}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(yr||(yr={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{if(!1!==r.lengthDelimited&&t.fork(),null!=e.peerInfos)for(const r of e.peerInfos)t.uint32(10),gr.codec().encode(r,t);!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={peerInfos:[]},s=null==t?e.len:e.pos+t;for(;e.pos>>3==1){if(null!=r.limits?.peerInfos&&n.peerInfos.length===r.limits.peerInfos)throw new _r('Decode error - map field "peerInfos" had too many elements');n.peerInfos.push(gr.codec().decode(e,e.uint32(),{limits:r.limits?.peerInfos$}))}else e.skipType(7&t)}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(mr||(mr={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.query&&(t.uint32(10),yr.codec().encode(e.query,t)),null!=e.response&&(t.uint32(18),mr.codec().encode(e.response,t)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.query=yr.codec().decode(e,e.uint32(),{limits:r.limits?.query});break;case 2:n.response=mr.codec().decode(e,e.uint32(),{limits:r.limits?.response});break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(br||(br={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{if(!1!==r.lengthDelimited&&t.fork(),null!=e.clusterId&&(t.uint32(8),t.uint32(e.clusterId)),null!=e.shards)for(const r of e.shards)t.uint32(16),t.uint32(r);!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={shards:[]},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.clusterId=e.uint32();break;case 2:if(null!=r.limits?.shards&&n.shards.length===r.limits.shards)throw new _r('Decode error - map field "shards" had too many elements');n.shards.push(e.uint32());break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(wr||(wr={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{if(!1!==r.lengthDelimited&&t.fork(),null!=e.clusterId&&(t.uint32(8),t.uint32(e.clusterId)),null!=e.shards)for(const r of e.shards)t.uint32(16),t.uint32(r);!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={shards:[]},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.clusterId=e.uint32();break;case 2:if(null!=r.limits?.shards&&n.shards.length===r.limits.shards)throw new _r('Decode error - map field "shards" had too many elements');n.shards.push(e.uint32());break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>jt(t,e.codec()),e.decode=(t,r)=>Y(t,e.codec(),r)}(vr||(vr={}));function Tr(e){if(!Number.isSafeInteger(e)||e<0)throw new Error(`positive integer expected, not ${e}`)}function Cr(e,...t){if(!((r=e)instanceof Uint8Array||null!=r&&"object"==typeof r&&"Uint8Array"===r.constructor.name))throw new Error("Uint8Array expected");var r;if(t.length>0&&!t.includes(e.length))throw new Error(`Uint8Array expected of length ${t}, not of length=${e.length}`)}function Nr(e){if("function"!=typeof e||"function"!=typeof e.create)throw new Error("Hash should be wrapped by utils.wrapConstructor");Tr(e.outputLen),Tr(e.blockLen)}function xr(e,t=!0){if(e.destroyed)throw new Error("Hash instance has been destroyed");if(t&&e.finished)throw new Error("Hash#digest() has already been called")}const Pr="object"==typeof globalThis&&"crypto"in globalThis?globalThis.crypto:void 0,Or=e=>new DataView(e.buffer,e.byteOffset,e.byteLength),Dr=(e,t)=>e<<32-t|e>>>t;new Uint8Array(new Uint32Array([287454020]).buffer)[0];const Lr=async()=>{};async function Br(e,t,r){let n=Date.now();for(let s=0;s=0&&ee().update(Ur(t)).digest(),r=e();return t.outputLen=r.outputLen,t.blockLen=r.blockLen,t.create=()=>e(),t}function Hr(e=32){if(Pr&&"function"==typeof Pr.getRandomValues)return Pr.getRandomValues(new Uint8Array(e));throw new Error("crypto.getRandomValues must be defined")}const qr=(e,t,r)=>e&t^e&r^t&r;class Vr extends Mr{constructor(e,t,r,n){super(),this.blockLen=e,this.outputLen=t,this.padOffset=r,this.isLE=n,this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.buffer=new Uint8Array(e),this.view=Or(this.buffer)}update(e){xr(this);const{view:t,buffer:r,blockLen:n}=this,s=(e=Ur(e)).length;for(let o=0;on-o&&(this.process(r,0),o=0);for(let e=o;e>s&o),a=Number(r&o),c=n?4:0,l=n?0:4;e.setUint32(t+c,i,n),e.setUint32(t+l,a,n)}(r,n-8,BigInt(8*this.length),s),this.process(r,0);const i=Or(e),a=this.outputLen;if(a%4)throw new Error("_sha2: outputLen should be aligned to 32bit");const c=a/4,l=this.get();if(c>l.length)throw new Error("_sha2: outputLen bigger than state");for(let e=0;e>>3,s=Dr(r,17)^Dr(r,19)^r>>>10;zr[e]=s+zr[e-7]+n+zr[e-16]|0}let{A:r,B:n,C:s,D:o,E:i,F:a,G:c,H:l}=this;for(let e=0;e<64;e++){const t=l+(Dr(i,6)^Dr(i,11)^Dr(i,25))+((u=i)&a^~u&c)+jr[e]+zr[e]|0,h=(Dr(r,2)^Dr(r,13)^Dr(r,22))+qr(r,n,s)|0;l=c,c=a,a=i,i=o+t|0,o=s,s=n,n=r,r=t+h|0}var u;r=r+this.A|0,n=n+this.B|0,s=s+this.C|0,o=o+this.D|0,i=i+this.E|0,a=a+this.F|0,c=c+this.G|0,l=l+this.H|0,this.set(r,n,s,o,i,a,c,l)}roundClean(){zr.fill(0)}destroy(){this.set(0,0,0,0,0,0,0,0),this.buffer.fill(0)}}const Wr=$r((()=>new Gr));var Yr,Jr,Xr,Qr,Zr;!function(e){e.Relay="relay",e.Store="store",e.LightPush="lightpush",e.Filter="filter"}(Yr||(Yr={})),function(e){e.GENERIC_FAIL="Generic error",e.ENCODE_FAILED="Failed to encode",e.DECODE_FAILED="Failed to decode",e.EMPTY_PAYLOAD="Payload is empty",e.SIZE_TOO_BIG="Size is too big",e.TOPIC_NOT_CONFIGURED="Topic not configured",e.TOPIC_DECODER_MISMATCH="Topic decoder mismatch",e.INVALID_DECODER_TOPICS="Invalid decoder topics",e.NO_PEER_AVAILABLE="No peer available",e.NO_STREAM_AVAILABLE="No stream available",e.NO_RESPONSE="No response received",e.REMOTE_PEER_REJECTED="Remote peer rejected",e.REQUEST_TIMEOUT="Request timeout",e.RLN_IDENTITY_MISSING="Identity credentials are not set",e.RLN_MEMBERSHIP_INDEX="Membership index is not set",e.RLN_LIMIT_MISSING="User message limit is not set",e.RLN_PROOF_GENERATION="Proof generation failed"}(Jr||(Jr={})),function(e){e.BOOTSTRAP="bootstrap",e.PEER_EXCHANGE="peer-exchange",e.LOCAL="local-peer-cache"}(Xr||(Xr={})),function(e){e.PEER_DISCOVERY_BOOTSTRAP="peer:discovery:bootstrap",e.PEER_DISCOVERY_PEER_EXCHANGE="peer:discovery:peer-exchange",e.PEER_CONNECT_BOOTSTRAP="peer:connected:bootstrap",e.PEER_CONNECT_PEER_EXCHANGE="peer:connected:peer-exchange"}(Qr||(Qr={})),function(e){e.CONNECTION_STATUS="waku:connection"}(Zr||(Zr={}));const en="@waku/bootstrap",tn=1,rn={clusterId:tn,shards:[0,1,2,3,4,5,6,7,8]};var nn;function sn(e,t="utf8"){const r=Ct[t];if(null==r)throw new Error(`Unsupported encoding "${t}"`);return r.encoder.encode(e).substring(1)}function on(e){return"string"==typeof e?Nt(e.replace(/^0x/i,"").toLowerCase(),"base16"):e}!function(e){e.Unhealthy="Unhealthy",e.MinimallyHealthy="MinimallyHealthy",e.SufficientlyHealthy="SufficientlyHealthy"}(nn||(nn={}));const an=e=>sn(e,"base16"),cn=e=>sn(e,"utf8"),ln=e=>Nt(e,"utf8");function un(e,t){const r=t??e.reduce(((e,t)=>e+t.length),0),n=new Uint8Array(r);let s=0;for(const t of e)n.set(t,s),s+=t.length;return n}const hn=e=>{if(void 0===e.shard)throw new Error("Invalid shard");return`/waku/2/rs/${e.clusterId??tn}/${e.shard}`},dn=e=>{if("contentTopics"in e&&e.contentTopics)return Array.from(new Set(e.contentTopics.map((t=>yn(t,e.clusterId)))));if("shards"in e){if(void 0===e.shards)throw new Error("Invalid shard");return Array.from(new Set(e.shards.map((t=>`/waku/2/rs/${e.clusterId??tn}/${t}`))))}if("application"in e&&"version"in e)return[yn(`/${e.application}/${e.version}/default/default`,e.clusterId)];throw new Error("Missing required configuration in shard parameters")},pn=e=>{const t=e.split("/");if(6!=t.length||"waku"!==t[1]||"2"!==t[2]||"rs"!==t[3])throw new Error("Invalid pubsub topic");const r=parseInt(t[4]),n=parseInt(t[5]);if(isNaN(r)||isNaN(n))throw new Error("Invalid clusterId or shard");return{clusterId:r,shard:n}},fn=e=>{const t=new Set,r=new Set;for(const n of e){const{clusterId:e,shard:s}=pn(n);t.add(`${e}:${s}`),r.add(e)}if(0===t.size)throw new Error("No valid pubsub topics provided");if(r.size>1)throw new Error("Pubsub topics from multiple cluster IDs are not supported");return{clusterId:r.values().next().value,shards:Array.from(t).map((e=>parseInt(e.split(":")[1])))}};function gn(e,t){if(!t.includes(e))throw new Error(`Pubsub topic ${e} has not been configured on this instance. Configured topics are: ${t}. Please update your configuration by passing in the topic during Waku node instantiation.`)}function yn(e,t=tn,r=8){if(!e)throw Error("Content topic must be specified");return`/waku/2/rs/${t}/${function(e,t=8){const{application:r,version:n}=function(e){const t=e.split("/");if(t.length<5||t.length>6)throw Error("Content topic format is invalid");let r=0;if(6==t.length){if(r=parseInt(t[1]),isNaN(r))throw new Error("Invalid generation field in content topic");if(r>0)throw new Error("Generation greater than 0 is not supported")}const n=t.splice(-4);if(0==n[0].length)throw new Error("Application field cannot be empty");if(0==n[1].length)throw new Error("Version field cannot be empty");if(0==n[2].length)throw new Error("Topic name field cannot be empty");if(0==n[3].length)throw new Error("Encoding field cannot be empty");return{generation:r,application:n[0],version:n[1],topicName:n[2],encoding:n[3]}}(e),s=Wr(un([ln(r),ln(n)])),o=new DataView(s.buffer.slice(-8));return Number(o.getBigUint64(0,!1)%BigInt(t))}(e,r)}`}function mn(e,t){return"string"==typeof t?t:void 0!==t?.shard?hn(t):yn(e,t?.clusterId??tn)}const bn=e=>{if((e=new Uint8Array(e)).length<3)throw new Error("Insufficient data");const t=new DataView(e.buffer),r=t.getUint16(0),n=[];if(130===e.length)for(let e=0;e<1024;e++){const r=Math.floor(e/8)+2,s=7-e%8;t.getUint8(r)&1<=e.length)throw new Error("Unexpected end of data");n.push(t.getUint16(o))}}return{clusterId:r,shards:n}},wn=e=>{const{clusterId:t,shards:r}=e,n=r.length>=64?130:3+2*r.length,s=new ArrayBuffer(n),o=new DataView(s);if(o.setUint16(0,t),r.length>=64)for(const e of r){const t=Math.floor(e/8)+2,r=7-e%8;o.setUint8(t,o.getUint8(t)|1<setTimeout(t,e)))}var En=__webpack_require__(7833);const Sn="waku";class An{_info;_warn;_error;static createDebugNamespace(e,t){return t?`${Sn}:${e}:${t}`:`${Sn}:${e}`}constructor(e){this._info=En(An.createDebugNamespace("info",e)),this._warn=En(An.createDebugNamespace("warn",e)),this._error=En(An.createDebugNamespace("error",e))}get info(){return this._info}get warn(){return this._warn}get error(){return this._error}log(e,...t){(0,this[e])(...t)}}const _n=new An("message:version-0"),kn=BigInt(1e6);class In{pubsubTopic;proto;constructor(e,t){this.pubsubTopic=e,this.proto=t}get ephemeral(){return Boolean(this.proto.ephemeral)}get payload(){return this.proto.payload}get contentTopic(){return this.proto.contentTopic}get _rawTimestamp(){return this.proto.timestamp}get timestamp(){try{if(this.proto.timestamp){const e=this.proto.timestamp/kn;return new Date(Number(e))}return}catch(e){return}}get meta(){return this.proto.meta}get version(){return this.proto.version??0}get rateLimitProof(){return this.proto.rateLimitProof}}class Rn{contentTopic;ephemeral;pubsubTopic;metaSetter;constructor(e,t=!1,r,n){if(this.contentTopic=e,this.ephemeral=t,this.pubsubTopic=r,this.metaSetter=n,!e||""===e)throw new Error("Content topic must be specified")}async toWire(e){return Gt.encode(await this.toProtoObj(e))}async toProtoObj(e){const t=e.timestamp??new Date,r={payload:e.payload,version:0,contentTopic:this.contentTopic,timestamp:BigInt(t.valueOf())*kn,meta:void 0,rateLimitProof:e.rateLimitProof,ephemeral:this.ephemeral};if(this.metaSetter){const e=this.metaSetter(r);return{...r,meta:e}}return r}}function Tn({pubsubTopic:e,pubsubTopicShardInfo:t,contentTopic:r,ephemeral:n,metaSetter:s}){return new Rn(r,n,mn(r,e??t),s)}class Cn{pubsubTopic;contentTopic;constructor(e,t){if(this.pubsubTopic=e,this.contentTopic=t,!t||""===t)throw new Error("Content topic must be specified")}fromWireToProtoObj(e){const t=Gt.decode(e);return Promise.resolve({payload:t.payload,contentTopic:t.contentTopic,version:t.version??void 0,timestamp:t.timestamp??void 0,meta:t.meta??void 0,rateLimitProof:t.rateLimitProof??void 0,ephemeral:t.ephemeral??!1})}async fromProtoObj(e,t){return t.version?(_n.error("Failed to decode due to incorrect version, expected:",0,", actual:",t.version),Promise.resolve(void 0)):new In(e,t)}}const Nn=function(e){if(null!=e[Symbol.asyncIterator])return(async()=>{const t=[];for await(const r of e)t.push(r);return t})();const t=[];for(const r of e)t.push(r);return t};function xn(e,t){null==t&&(t=e.reduce(((e,t)=>e+t.length),0));const r=w(t);let n=0;for(const t of e)r.set(t,n),n+=t.length;return r}function Pn(e,t){if(e===t)return!0;if(e.byteLength!==t.byteLength)return!1;for(let r=0;r0&&this.appendAll(e)}*[Symbol.iterator](){yield*this.bufs}get byteLength(){return this.length}append(...e){this.appendAll(e)}appendAll(e){let t=0;for(const r of e)if(r instanceof Uint8Array)t+=r.byteLength,this.bufs.push(r);else{if(!Ln(r))throw new Error("Could not append value, must be an Uint8Array or a Uint8ArrayList");t+=r.byteLength,this.bufs.push(...r.bufs)}this.length+=t}prepend(...e){this.prependAll(e)}prependAll(e){let t=0;for(const r of e.reverse())if(r instanceof Uint8Array)t+=r.byteLength,this.bufs.unshift(r);else{if(!Ln(r))throw new Error("Could not prepend value, must be an Uint8Array or a Uint8ArrayList");t+=r.byteLength,this.bufs.unshift(...r.bufs)}this.length+=t}get(e){const t=Dn(this.bufs,e);return t.buf[t.index]}set(e,t){const r=Dn(this.bufs,e);r.buf[r.index]=t}write(e,t=0){if(e instanceof Uint8Array)for(let r=0;r0;){if(!(e>=this.bufs[0].byteLength)){this.bufs[0]=this.bufs[0].subarray(e),this.length-=e;break}e-=this.bufs[0].byteLength,this.length-=this.bufs[0].byteLength,this.bufs.shift()}}}slice(e,t){const{bufs:r,length:n}=this._subList(e,t);return xn(r,n)}subarray(e,t){const{bufs:r,length:n}=this._subList(e,t);return 1===r.length?r[0]:xn(r,n)}sublist(e,t){const{bufs:r,length:n}=this._subList(e,t),s=new Bn;return s.length=n,s.bufs=[...r],s}_subList(e,t){if(e=e??0,t=t??this.length,e<0&&(e=this.length+e),t<0&&(t=this.length+t),e<0||t>this.length)throw new RangeError("index is out of bounds");if(e===t)return{bufs:[],length:0};if(0===e&&t===this.length)return{bufs:this.bufs,length:this.length};const r=[];let n=0;for(let s=0;s=a)continue;const c=e>=i&&ei&&t<=a;if(c&&l){if(e===i&&t===a){r.push(o);break}const n=e-i;r.push(o.subarray(n,n+(t-e)));break}if(c){if(0===e){r.push(o);continue}r.push(o.subarray(e-i))}else{if(l){if(t===a){r.push(o);break}r.push(o.subarray(0,t-i));break}r.push(o)}}return{bufs:r,length:t-e}}indexOf(e,t=0){if(!(Ln(e)||e instanceof Uint8Array))throw new TypeError('The "value" argument must be a Uint8ArrayList or Uint8Array');const r=e instanceof Uint8Array?e:e.subarray();if(t=Number(t??0),isNaN(t)&&(t=0),t<0&&(t=this.length+t),t<0&&(t=0),0===e.length)return t>this.length?this.length:t;const n=r.byteLength;if(0===n)throw new TypeError("search must be at least 1 byte long");const s=new Int32Array(256);for(let e=0;e<256;e++)s[e]=-1;for(let e=0;e=0;t--){const n=this.get(e+t);if(r[t]!==n){c=Math.max(1,t-o[n]);break}}if(0===c)return e}return-1}getInt8(e){const t=this.subarray(e,e+1);return new DataView(t.buffer,t.byteOffset,t.byteLength).getInt8(0)}setInt8(e,t){const r=w(1);new DataView(r.buffer,r.byteOffset,r.byteLength).setInt8(0,t),this.write(r,e)}getInt16(e,t){const r=this.subarray(e,e+2);return new DataView(r.buffer,r.byteOffset,r.byteLength).getInt16(0,t)}setInt16(e,t,r){const n=b(2);new DataView(n.buffer,n.byteOffset,n.byteLength).setInt16(0,t,r),this.write(n,e)}getInt32(e,t){const r=this.subarray(e,e+4);return new DataView(r.buffer,r.byteOffset,r.byteLength).getInt32(0,t)}setInt32(e,t,r){const n=b(4);new DataView(n.buffer,n.byteOffset,n.byteLength).setInt32(0,t,r),this.write(n,e)}getBigInt64(e,t){const r=this.subarray(e,e+8);return new DataView(r.buffer,r.byteOffset,r.byteLength).getBigInt64(0,t)}setBigInt64(e,t,r){const n=b(8);new DataView(n.buffer,n.byteOffset,n.byteLength).setBigInt64(0,t,r),this.write(n,e)}getUint8(e){const t=this.subarray(e,e+1);return new DataView(t.buffer,t.byteOffset,t.byteLength).getUint8(0)}setUint8(e,t){const r=w(1);new DataView(r.buffer,r.byteOffset,r.byteLength).setUint8(0,t),this.write(r,e)}getUint16(e,t){const r=this.subarray(e,e+2);return new DataView(r.buffer,r.byteOffset,r.byteLength).getUint16(0,t)}setUint16(e,t,r){const n=b(2);new DataView(n.buffer,n.byteOffset,n.byteLength).setUint16(0,t,r),this.write(n,e)}getUint32(e,t){const r=this.subarray(e,e+4);return new DataView(r.buffer,r.byteOffset,r.byteLength).getUint32(0,t)}setUint32(e,t,r){const n=b(4);new DataView(n.buffer,n.byteOffset,n.byteLength).setUint32(0,t,r),this.write(n,e)}getBigUint64(e,t){const r=this.subarray(e,e+8);return new DataView(r.buffer,r.byteOffset,r.byteLength).getBigUint64(0,t)}setBigUint64(e,t,r){const n=b(8);new DataView(n.buffer,n.byteOffset,n.byteLength).setBigUint64(0,t,r),this.write(n,e)}getFloat32(e,t){const r=this.subarray(e,e+4);return new DataView(r.buffer,r.byteOffset,r.byteLength).getFloat32(0,t)}setFloat32(e,t,r){const n=b(4);new DataView(n.buffer,n.byteOffset,n.byteLength).setFloat32(0,t,r),this.write(n,e)}getFloat64(e,t){const r=this.subarray(e,e+8);return new DataView(r.buffer,r.byteOffset,r.byteLength).getFloat64(0,t)}setFloat64(e,t,r){const n=b(8);new DataView(n.buffer,n.byteOffset,n.byteLength).setFloat64(0,t,r),this.write(n,e)}equals(e){if(null==e)return!1;if(!(e instanceof Bn))return!1;if(e.bufs.length!==this.bufs.length)return!1;for(let t=0;te+t.byteLength),0)),r.length=t,r}}function Un(e){return null!=e[Symbol.asyncIterator]}const Mn=e=>{const t=C(e),r=w(t);return P(e,r),Mn.bytes=t,r};function Fn(e,t){const r=(t=t??{}).lengthEncoder??Mn;function*n(e){const t=r(e.byteLength);t instanceof Uint8Array?yield t:yield*t,e instanceof Uint8Array?yield e:yield*e}return Un(e)?async function*(){for await(const t of e)yield*n(t)}():function*(){for(const t of e)yield*n(t)}()}Mn.bytes=0,Fn.single=(e,t)=>{const r=(t=t??{}).lengthEncoder??Mn;return new Bn(r(e.byteLength),e)};class $n extends Error{name="InvalidMessageLengthError";code="ERR_INVALID_MSG_LENGTH"}class Hn extends Error{name="InvalidDataLengthError";code="ERR_MSG_DATA_TOO_LONG"}class qn extends Error{name="InvalidDataLengthLengthError";code="ERR_MSG_LENGTH_TOO_LONG"}class Vn extends Error{name="UnexpectedEOFError";code="ERR_UNEXPECTED_EOF"}var jn;!function(e){e[e.LENGTH=0]="LENGTH",e[e.DATA=1]="DATA"}(jn||(jn={}));const Kn=e=>{const t=O(e);return Kn.bytes=C(t),t};function zn(e,t){const r=new Bn;let n=jn.LENGTH,s=-1;const o=t?.lengthDecoder??Kn,i=t?.maxLengthLength??8,a=t?.maxDataLength??4194304;function*c(){for(;r.byteLength>0;){if(n===jn.LENGTH)try{if(s=o(r),s<0)throw new $n("Invalid message length");if(s>a)throw new Hn("Message length too long");const e=o.bytes;r.consume(e),null!=t?.onLength&&t.onLength(s),n=jn.DATA}catch(e){if(e instanceof RangeError){if(r.byteLength>i)throw new qn("Message length length too long");break}throw e}if(n===jn.DATA){if(r.byteLength0)throw new Vn("Unexpected end of input")}():function*(){for(const t of e)r.append(t),yield*c();if(r.byteLength>0)throw new Vn("Unexpected end of input")}()}function Gn(){const e={};return e.promise=new Promise(((t,r)=>{e.resolve=t,e.reject=r})),e}Kn.bytes=0,zn.fromReader=(e,t)=>{let r=1;return zn(async function*(){for(;;)try{const{done:t,value:n}=await e.next(r);if(!0===t)return;null!=n&&(yield n)}catch(e){if("ERR_UNDER_READ"===e.code)return{done:!0,value:null};throw e}finally{r=1}}(),{...t??{},onLength:e=>{r=e}})};class Wn{buffer;mask;top;btm;next;constructor(e){if(!(e>0)||e-1&e)throw new Error("Max size for a FixedFIFO should be a power of two");this.buffer=new Array(e),this.mask=e-1,this.top=0,this.btm=0,this.next=null}push(e){return void 0===this.buffer[this.top]&&(this.buffer[this.top]=e,this.top=this.top+1&this.mask,!0)}shift(){const e=this.buffer[this.btm];if(void 0!==e)return this.buffer[this.btm]=void 0,this.btm=this.btm+1&this.mask,e}isEmpty(){return void 0===this.buffer[this.btm]}}class Yn{size;hwm;head;tail;constructor(e={}){this.hwm=e.splitLimit??16,this.head=new Wn(this.hwm),this.tail=this.head,this.size=0}calculateSize(e){return null!=e?.byteLength?e.byteLength:1}push(e){if(null!=e?.value&&(this.size+=this.calculateSize(e.value)),!this.head.push(e)){const t=this.head;this.head=t.next=new Wn(2*this.head.buffer.length),this.head.push(e)}}shift(){let e=this.tail.shift();if(void 0===e&&null!=this.tail.next){const t=this.tail.next;this.tail.next=null,this.tail=t,e=this.tail.shift()}return null!=e?.value&&(this.size-=this.calculateSize(e.value)),e}isEmpty(){return this.head.isEmpty()}}class Jn extends Error{type;code;constructor(e,t){super(e??"The operation was aborted"),this.type="aborted",this.code=t??"ABORT_ERR"}}function Xn(e={}){return function(e,t){let r,n,s,o=(t=t??{}).onEnd,i=new Yn,a=Gn();const c=e=>null!=n?n(e):(i.push(e),r),l=e=>{if(s)return r;if(!0!==t?.objectMode&&null==e?.byteLength)throw new Error("objectMode was not true but tried to push non-Uint8Array value");return c({done:!1,value:e})},u=e=>s?r:(s=!0,null!=e?(e=>(i=new Yn,null!=n?n({error:e}):(i.push({error:e}),r)))(e):c({done:!0}));if(r={[Symbol.asyncIterator](){return this},next:async()=>{try{return i.isEmpty()?s?{done:!0}:await new Promise(((t,s)=>{n=o=>{n=null,i.push(o);try{t(e(i))}catch(e){s(e)}return r}})):e(i)}finally{i.isEmpty()&&queueMicrotask((()=>{a.resolve(),a=Gn()}))}},return:()=>(i=new Yn,u(),{done:!0}),throw:e=>(u(e),{done:!0}),push:l,end:u,get readableLength(){return i.size},onEmpty:async e=>{const t=e?.signal;if(t?.throwIfAborted(),i.isEmpty())return;let r,n;null!=t&&(r=new Promise(((e,r)=>{n=()=>{r(new Jn)},t.addEventListener("abort",n)})));try{await Promise.race([a.promise,r])}finally{null!=n&&null!=t&&t?.removeEventListener("abort",n)}}},null==o)return r;const h=r;return r={[Symbol.asyncIterator](){return this},next:()=>h.next(),throw:e=>(h.throw(e),null!=o&&(o(e),o=void 0),{done:!0}),return:()=>(h.return(),null!=o&&(o(),o=void 0),{done:!0}),push:l,end:e=>(h.end(e),null!=o&&(o(e),o=void 0),r),get readableLength(){return h.readableLength},onEmpty:e=>h.onEmpty(e)},r}((e=>{const t=e.shift();if(null==t)return{done:!0};if(null!=t.error)throw t.error;return{done:!0===t.done,value:t.value}}),e)}const Qn=function(...e){const t=[];for(const r of e)null==r[Symbol.asyncIterator]&&t.push(r);return t.length===e.length?function*(){for(const e of t)yield*e}():async function*(){const t=Xn({objectMode:!0});Promise.resolve().then((async()=>{try{await Promise.all(e.map((async e=>{for await(const r of e)t.push(r)}))),t.end()}catch(e){t.end(e)}})),yield*t}()};function Zn(e,...t){if(null==e)throw new Error("Empty pipeline");if(ns(e)){const t=e;e=()=>t.source}else if(rs(e)||ts(e)){const t=e;e=()=>t}const r=[e,...t];if(r.length>1&&ns(r[r.length-1])&&(r[r.length-1]=r[r.length-1].sink),r.length>2)for(let e=1;e{let t;for(;e.length>0;)t=e.shift()(t);return t},ts=e=>null!=e?.[Symbol.asyncIterator],rs=e=>null!=e?.[Symbol.iterator],ns=e=>null!=e&&null!=e.sink&&null!=e.source,ss=e=>t=>{const r=e.sink(t);if(null!=r?.then){const t=Xn({objectMode:!0});let n;r.then((()=>{t.end()}),(e=>{t.end(e)}));const s=e.source;if(ts(s))n=async function*(){yield*s,t.end()};else{if(!rs(s))throw new Error("Unknown duplex source type - must be Iterable or AsyncIterable");n=function*(){yield*s,t.end()}}return Qn(t,n())}return e.source};class os{multicodec;getConnections;addEventListener;streamPool;log;constructor(e,t,r){this.multicodec=e,this.getConnections=t,this.addEventListener=r,this.log=new An(`stream-manager:${e}`),this.streamPool=new Map,this.addEventListener("peer:update",this.handlePeerUpdateStreamPool)}async getStream(e){const t=e.id.toString(),r=this.streamPool.get(t);if(!r)return this.createStream(e);this.streamPool.delete(t),this.prepareStream(e);try{const e=await r;if(e&&"closed"!==e.status)return e}catch(e){this.log.warn(`Failed to get stream for ${t} -- `,e),this.log.warn("Attempting to create a new stream for the peer")}return this.createStream(e)}async createStream(e,t=0){const r=function(e){if(!e.length)return;if(1===e.length)return e[0];let t;return e.forEach((e=>{"open"===e.status&&(t?e.timeline.open>t.timeline.open&&(t=e):t=e)})),t}(this.getConnections(e.id));if(!r)throw new Error("Failed to get a connection to the peer");try{return await r.newStream(this.multicodec)}catch(r){if(t<3){const r=1e3*Math.pow(2,t);return await new Promise((e=>setTimeout(e,r))),this.createStream(e,t+1)}throw new Error(`Failed to create a new stream for ${e.id.toString()} -- `+r)}}prepareStream(e){const t=new Promise((e=>setTimeout(e,5e3))),r=Promise.race([this.createStream(e),t.then((()=>{throw new Error("Connection timeout")}))]).catch((t=>{this.log.error(`Failed to prepare a new stream for ${e.id.toString()} -- `,t)}));this.streamPool.set(e.id.toString(),r)}handlePeerUpdateStreamPool=e=>{const{peer:t}=e.detail;if(t.protocols.includes(this.multicodec))if(this.isConnectedTo(t.id))this.log.info(`Preemptively opening a stream to ${t.id.toString()}`),this.prepareStream(t);else{const e=t.id.toString();this.streamPool.delete(e),this.log.info(`Removed pending stream for disconnected peer ${e}`)}};isConnectedTo(e){return this.getConnections(e).some((e=>"open"===e.status))}}class is{multicodec;components;log;pubsubTopics;addLibp2pEventListener;removeLibp2pEventListener;streamManager;constructor(e,t,r,n){this.multicodec=e,this.components=t,this.log=r,this.pubsubTopics=n,this.addLibp2pEventListener=t.events.addEventListener.bind(t.events),this.removeLibp2pEventListener=t.events.removeEventListener.bind(t.events),this.streamManager=new os(e,t.connectionManager.getConnections.bind(t.connectionManager),this.addLibp2pEventListener)}async getStream(e){return this.streamManager.getStream(e)}get peerStore(){return this.components.peerStore}async allPeers(){return async function(e,t){const r=[];return await e.forEach((e=>{for(let n=0;nthis.components.connectionManager.getConnections(e.id).length>0))}async getPeers({numPeers:e,maxBootstrapPeers:t}={maxBootstrapPeers:1,numPeers:0}){const r=function(e,t,r){let n=e.filter((e=>e.tags.has(Xr.BOOTSTRAP))).slice(0,r);t>0&&t!e.tags.has(Xr.BOOTSTRAP)));if(0===t)return[...n,...s];const o=[...n];for(;o.length0;){const e=Math.floor(Math.random()*s.length),t=s.splice(e,1)[0];o.push(t)}return o}(await async function(e,t,r,n){const s=e.filter((e=>"open"===e.status)).map((async e=>{const s=await t.get(e.remotePeer);if(r.some((e=>s.protocols.includes(e)))){if(!n)return s;{const e=s.metadata.get("shardInfo"),t=e&&bn(e);if(t&&n.clusterId===t.clusterId)return s}}return null}));return(await Promise.all(s)).filter((e=>null!==e))}(this.components.connectionManager.getConnections(),this.peerStore,[this.multicodec],fn(this.pubsubTopics)),e,t),n=await async function(e,t){return 0===t.length?[]:(await Promise.all(t.map((async t=>{try{const r=(await e.get(t.id)).metadata.get("ping");return r?{peer:t,ping:Number(cn(r))}:{peer:t,ping:1/0}}catch(e){return{peer:t,ping:1/0}}})))).filter((e=>null!==e)).sort(((e,t)=>e.ping-t.ping)).map((e=>e.peer))}(this.peerStore,r);return 0===n.length&&this.log.warn("No peers found. Ensure you have a connection to the network."),n.length{ys.error("Failed to register ",ms,e)}))}async subscribe(e,t,r){const n=await this.getStream(t),s=fs.createSubscribeRequest(e,r);let o;try{o=await Zn([s.encode()],Fn,n,zn,(async e=>await Nn(e)))}catch(e){return ys.error("Failed to send subscribe request",e),{success:null,failure:{error:Jr.GENERIC_FAIL,peerId:t.id}}}const{statusCode:i,requestId:a,statusDesc:c}=gs.decode(o[0].slice());return i<200||i>=300?(ys.error(`Filter subscribe request ${a} failed with status code ${i}: ${c}`),{failure:{error:Jr.REMOTE_PEER_REJECTED,peerId:t.id},success:null}):{failure:null,success:t.id}}async unsubscribe(e,t,r){let n;try{n=await this.getStream(t)}catch(e){return ys.error(`Failed to get a stream for remote peer${t.id.toString()}`,e),{success:null,failure:{error:Jr.NO_STREAM_AVAILABLE,peerId:t.id}}}const s=fs.createUnsubscribeRequest(e,r);try{await Zn([s.encode()],Fn,n.sink)}catch(e){return ys.error("Failed to send unsubscribe request",e),{success:null,failure:{error:Jr.GENERIC_FAIL,peerId:t.id}}}return{success:t.id,failure:null}}async unsubscribeAll(e,t){const r=await this.getStream(t),n=fs.createUnsubscribeAllRequest(e),s=await Zn([n.encode()],Fn,r,zn,(async e=>await Nn(e)));if(!s||!s.length)return{failure:{error:Jr.NO_RESPONSE,peerId:t.id},success:null};const{statusCode:o,requestId:i,statusDesc:a}=gs.decode(s[0].slice());return o<200||o>=300?(ys.error(`Filter unsubscribe all request ${i} failed with status code ${o}: ${a}`),{failure:{error:Jr.REMOTE_PEER_REJECTED,peerId:t.id},success:null}):{failure:null,success:t.id}}async ping(e){let t;try{t=await this.getStream(e)}catch(t){return ys.error(`Failed to get a stream for remote peer${e.id.toString()}`,t),{success:null,failure:{error:Jr.NO_STREAM_AVAILABLE,peerId:e.id}}}const r=fs.createSubscriberPingRequest();let n;try{n=await Zn([r.encode()],Fn,t,zn,(async e=>await Nn(e)))}catch(t){return ys.error("Failed to send ping request",t),{success:null,failure:{error:Jr.GENERIC_FAIL,peerId:e.id}}}if(!n||!n.length)return{success:null,failure:{error:Jr.NO_RESPONSE,peerId:e.id}};const{statusCode:s,requestId:o,statusDesc:i}=gs.decode(n[0].slice());return s<200||s>=300?(ys.error(`Filter ping request ${o} failed with status code ${s}: ${i}`),{success:null,failure:{error:Jr.REMOTE_PEER_REJECTED,peerId:e.id}}):{success:e.id,failure:null}}onRequest(e){const{connection:t,stream:r}=e,{remotePeer:n}=t;ys.info(`Received message from ${n.toString()}`);try{Zn(r,zn,(async e=>{for await(const r of e){const e=ps.decode(r.slice()),{pubsubTopic:n,wakuMessage:s}=e;if(!s)return void ys.error("Received empty message");if(!n)return void ys.error("Pubsub topic missing from push message");await this.handleIncomingMessage(n,s,t.remotePeer.toString())}})).then((()=>{ys.info("Receiving pipe closed.")}),(e=>{ys.error("Error with receiving pipe",e)}))}catch(e){ys.error("Error decoding message",e)}}}class ws{proto;constructor(e){this.proto=e}static createRequest(e,t){return new ws({requestId:ds(),request:{message:e,pubsubTopic:t},response:void 0})}static decode(e){const t=ar.decode(e);return new ws(t)}encode(){return ar.encode(this.proto)}get query(){return this.proto.request}get response(){return this.proto.response}}const vs=new An("light-push");class Es extends is{pubsubTopics;constructor(e,t){super("/vac/waku/lightpush/2.0.0-beta1",t.components,vs,e),this.pubsubTopics=e}async preparePushMessage(e,t){try{if(!t.payload||0===t.payload.length)return vs.error("Failed to send waku light push: payload is empty"),{query:null,error:Jr.EMPTY_PAYLOAD};if(!await async function(e,t){const r=await e.toWire(t);return!!r&&(e=>e.length/1048576<=1)(r)}(e,t))return vs.error("Failed to send waku light push: message is bigger than 1MB"),{query:null,error:Jr.SIZE_TOO_BIG};const r=await e.toProtoObj(t);return r?{query:ws.createRequest(r,e.pubsubTopic),error:null}:(vs.error("Failed to encode to protoMessage, aborting push"),{query:null,error:Jr.ENCODE_FAILED})}catch(e){return vs.error("Failed to prepare push message",e),{query:null,error:Jr.GENERIC_FAIL}}}async send(e,t,r){const{query:n,error:s}=await this.preparePushMessage(e,t);if(s||!n)return{success:null,failure:{error:s,peerId:r.id}};let o,i;try{o=await this.getStream(r)}catch(e){return vs.error("Failed to get stream",e),{success:null,failure:{error:Jr.NO_STREAM_AVAILABLE,peerId:r.id}}}try{i=await Zn([n.encode()],Fn,o,zn,(async e=>await Nn(e)))}catch(e){return vs.error("Failed to send waku light push request",e),{success:null,failure:{error:Jr.GENERIC_FAIL,peerId:r.id}}}const a=new Bn;let c;i.forEach((e=>{a.append(e)}));try{c=ws.decode(a).response}catch(e){return vs.error("Failed to decode push reply",e),{success:null,failure:{error:Jr.DECODE_FAILED,peerId:r.id}}}if(!c)return vs.error("Remote peer fault: No response in PushRPC"),{success:null,failure:{error:Jr.NO_RESPONSE,peerId:r.id}};if((l=c.info)&&l.includes("could not generate rln-v2 proof")){const e=(e=>{const t={[Jr.RLN_IDENTITY_MISSING]:Jr.RLN_IDENTITY_MISSING,[Jr.RLN_MEMBERSHIP_INDEX]:Jr.RLN_MEMBERSHIP_INDEX,[Jr.RLN_LIMIT_MISSING]:Jr.RLN_LIMIT_MISSING},r=e.toLowerCase();for(const e in t)if(r.includes(e.toLowerCase()))return t[e];return Jr.RLN_PROOF_GENERATION})(c.info);return vs.error("Remote peer rejected the message: ",e),{success:null,failure:{error:e,peerId:r.id}}}var l;return c.isSuccess?{success:r.id,failure:null}:(vs.error("Remote peer rejected the message: ",c.info),{success:null,failure:{error:Jr.REMOTE_PEER_REJECTED,peerId:r.id}})}}const Ss={payload:new Uint8Array,contentTopic:"",version:void 0,timestamp:void 0,meta:void 0,rateLimitProof:void 0,ephemeral:void 0},As=1e6;class _s{proto;constructor(e){this.proto=e}static create(e){const t=new _s({...e,requestId:ds(),timeStart:e.timeStart?BigInt(e.timeStart.getTime()*As):void 0,timeEnd:e.timeEnd?BigInt(e.timeEnd.getTime()*As):void 0,messageHashes:e.messageHashes||[],paginationLimit:e.paginationLimit?BigInt(e.paginationLimit):void 0});if(e.pubsubTopic&&!e.contentTopics||!e.pubsubTopic&&e.contentTopics)throw new Error("Both pubsubTopic and contentTopics must be set or unset");if(e.messageHashes&&(e.pubsubTopic||e.contentTopics||e.timeStart||e.timeEnd))throw new Error("Message hash lookup queries cannot include content filter criteria");return t}static decode(e){const t=hr.decode(e);return new _s(t)}encode(){return hr.encode(this.proto)}}class ks{proto;constructor(e){this.proto=e}static decode(e){const t=dr.decode(e);return new ks(t)}encode(){return dr.encode(this.proto)}get statusCode(){return this.proto.statusCode}get statusDesc(){return this.proto.statusDesc}get messages(){return this.proto.messages}get paginationCursor(){return this.proto.paginationCursor}}const Is=new An("store");class Rs extends is{pubsubTopics;constructor(e,t){super("/vac/waku/store-query/3.0.0",t.components,Is,e),this.pubsubTopics=e}async*queryPerPage(e,t,r){if(e.contentTopics.toString()!==Array.from(t.keys()).toString())throw new Error("Internal error, the decoders should match the query's content topics");let n=e.paginationCursor;for(;;){const s=_s.create({...e,paginationCursor:n});let o;try{o=await this.getStream(r)}catch(e){Is.error("Failed to get stream",e);break}const i=await Zn([s.encode()],Fn,o,zn,(async e=>await Nn(e))),a=new Bn;i.forEach((e=>{a.append(e)}));const c=ks.decode(a);if(!c.statusCode||c.statusCode>=300){const e=`Store query failed with status code: ${c.statusCode}, description: ${c.statusDesc}`;throw Is.error(e),new Error(e)}if(!c.messages||!c.messages.length){Is.warn("Stopping pagination due to empty messages in response");break}Is.info(`${c.messages.length} messages retrieved from store`);const l=c.messages.map((e=>{if(!e.message)return Promise.resolve(void 0);const r=e.message.contentTopic;if(r){const s=t.get(r);if(s)return s.fromProtoObj(e.pubsubTopic||"",(n=e.message,{...Ss,...n}))}var n;return Promise.resolve(void 0)}));if(yield l,n=e.paginationForward?c.messages[c.messages.length-1].messageHash:c.messages[0].messageHash,c.messages.length>100&&c.messages.length<(e.paginationLimit||20))break}}}class Ts extends Error{constructor(e){super(e),this.name="TimeoutError"}}class Cs extends Error{constructor(e){super(),this.name="AbortError",this.message=e}}const Ns=e=>void 0===globalThis.DOMException?new Cs(e):new DOMException(e),xs=e=>{const t=void 0===e.reason?Ns("This operation was aborted."):e.reason;return t instanceof Error?t:Ns(t)};function Ps(e,t){const{milliseconds:r,fallback:n,message:s,customTimers:o={setTimeout,clearTimeout}}=t;let i;const a=new Promise(((a,c)=>{if("number"!=typeof r||1!==Math.sign(r))throw new TypeError(`Expected \`milliseconds\` to be a positive number, got \`${r}\``);if(t.signal){const{signal:e}=t;e.aborted&&c(xs(e)),e.addEventListener("abort",(()=>{c(xs(e))}))}if(r===Number.POSITIVE_INFINITY)return void e.then(a,c);const l=new Ts;i=o.setTimeout.call(void 0,(()=>{if(n)try{a(n())}catch(e){c(e)}else"function"==typeof e.cancel&&e.cancel(),!1===s?a():s instanceof Error?c(s):(l.message=s??`Promise timed out after ${r} milliseconds`,c(l))}),r),(async()=>{try{a(await e)}catch(e){c(e)}})()})).finally((()=>{a.clear()}));return a.clear=()=>{o.clearTimeout.call(void 0,i),i=void 0},a}const Os=e=>{const t=e.addEventListener||e.on||e.addListener,r=e.removeEventListener||e.off||e.removeListener;if(!t||!r)throw new TypeError("Emitter is not compatible");return{addListener:t.bind(e),removeListener:r.bind(e)}};function Ds(e,t,r){"function"==typeof r&&(r={filter:r});const n=function(e,t,r){let n;const s=new Promise(((s,o)=>{if(!((r={rejectionEvents:["error"],multiArgs:!1,resolveImmediately:!1,...r}).count>=0)||r.count!==Number.POSITIVE_INFINITY&&!Number.isInteger(r.count))throw new TypeError("The `count` option should be at least 0 or more");r.signal?.throwIfAborted();const i=[t].flat(),a=[],{addListener:c,removeListener:l}=Os(e),u=(...e)=>{const t=r.multiArgs?e:e[0];r.filter&&!r.filter(t)||(a.push(t),r.count===a.length&&(n(),s(a)))},h=e=>{n(),o(e)};n=()=>{for(const e of i)l(e,u);for(const e of r.rejectionEvents)l(e,h)};for(const e of i)c(e,u);for(const e of r.rejectionEvents)c(e,h);r.signal&&r.signal.addEventListener("abort",(()=>{h(r.signal.reason)}),{once:!0}),r.resolveImmediately&&s(a)}));if(s.cancel=n,"number"==typeof r.timeout){const e=Ps(s,{milliseconds:r.timeout});return e.cancel=n,e}return s}(e,t,r={...r,count:1,resolveImmediately:!1}),s=n.then((e=>e[0]));return s.cancel=n.cancel,s}const Ls=new An("wait-for-remote-peer");async function Bs(e,t,r){if(t=t??function(e){const t=[];return e.relay&&t.push(Yr.Relay),e.filter&&t.push(Yr.Filter),e.store&&t.push(Yr.Store),e.lightPush&&t.push(Yr.LightPush),t}(e),!e.isStarted())return Promise.reject("Waku node is not started");const n=[];if(t.includes(Yr.Relay)){if(!e.relay)throw new Error("Cannot wait for Relay peer: protocol not mounted");n.push(async function(e){let t=e.getMeshPeers();const r=e.pubsubTopics;for(const n of r)for(;0==t.length;)await Ds(e.gossipSub,"gossipsub:heartbeat"),t=e.getMeshPeers(n)}(e.relay))}if(t.includes(Yr.Store)){if(!e.store)throw new Error("Cannot wait for Store peer: protocol not mounted");n.push(Us(e.store.protocol,e.libp2p.services.metadata))}if(t.includes(Yr.LightPush)){if(!e.lightPush)throw new Error("Cannot wait for LightPush peer: protocol not mounted");n.push(Us(e.lightPush.protocol,e.libp2p.services.metadata))}if(t.includes(Yr.Filter)){if(!e.filter)throw new Error("Cannot wait for Filter peer: protocol not mounted");n.push(Us(e.filter.protocol,e.libp2p.services.metadata))}r?await async function(e,t,r){await Promise.race([e,Ms(t,"Timed out waiting for a remote peer.")])}(Promise.all(n),r):await Promise.all(n)}async function Us(e,t){const r=e.multicodec,n=await e.connectedPeers();if(n.length){if(!t)return void Ls.info(`${r} peer found: `,n[0].id.toString());try{return void await Promise.any(n.map((e=>t.confirmOrAttemptHandshake(e.id))))}catch(e){"ERR_CONNECTION_BEING_CLOSED"===e.code&&Ls.error(`Connection with the peer was closed and possibly because it's on a different shard. Error: ${e}`),Ls.error(`Error waiting for handshake confirmation: ${e}`)}}Ls.info(`Waiting for ${r} peer`),await new Promise((n=>{const s=o=>{o.detail?.protocols?.includes(r)&&(t?t.confirmOrAttemptHandshake(o.detail.peerId).then((()=>{e.removeLibp2pEventListener("peer:identify",s),n()})).catch((e=>{"ERR_CONNECTION_BEING_CLOSED"===e.code&&Ls.error(`Connection with the peer was closed and possibly because it's on a different shard. Error: ${e}`),Ls.error(`Error waiting for handshake confirmation: ${e}`)})):(e.removeLibp2pEventListener("peer:identify",s),n()))};e.addLibp2pEventListener("peer:identify",s)}))}const Ms=(e,t)=>new Promise(((r,n)=>setTimeout((()=>n(t)),e)));class Fs extends EventTarget{#e=new Map;constructor(){super()}listenerCount(e){const t=this.#e.get(e);return null==t?0:t.length}addEventListener(e,t,r){super.addEventListener(e,t,r);let n=this.#e.get(e);null==n&&(n=[],this.#e.set(e,n)),n.push({callback:t,once:(!0!==r&&!1!==r&&r?.once)??!1})}removeEventListener(e,t,r){super.removeEventListener(e.toString(),t??null,r);let n=this.#e.get(e);null!=n&&(n=n.filter((({callback:e})=>e!==t)),this.#e.set(e,n))}dispatchEvent(e){const t=super.dispatchEvent(e);let r=this.#e.get(e.type);return null==r||(r=r.filter((({once:e})=>!e)),this.#e.set(e.type,r)),t}safeDispatchEvent(e,t={}){return this.dispatchEvent(new $s(e,t))}}const $s=globalThis.CustomEvent,Hs=new An("keep-alive");class qs{relay;libp2p;options;pingKeepAliveTimers=new Map;relayKeepAliveTimers=new Map;constructor({options:e,relay:t,libp2p:r}){this.options=e,this.relay=t,this.libp2p=r}start(e){this.stop(e);const{pingKeepAlive:t,relayKeepAlive:r}=this.options,n=e.toString();if(0!==t){const r=setInterval((()=>{(async()=>{let r;try{try{r=await this.libp2p.services.ping.ping(e),Hs.info(`Ping succeeded (${n})`,r)}catch(e){return void Hs.error(`Ping failed for peer (${n}).\n Next ping will be attempted in ${t} seconds.\n `)}try{await this.libp2p.peerStore.merge(e,{metadata:{ping:ln(r.toString())}})}catch(e){Hs.error("Failed to update ping",e)}}catch(e){Hs.error(`Ping failed (${n})`,e)}})()}),1e3*t);this.pingKeepAliveTimers.set(n,r)}const s=this.relay;if(s&&0!==r){const t=this.scheduleRelayPings(s,r,e.toString());this.relayKeepAliveTimers.set(e,t)}}stop(e){const t=e.toString();this.pingKeepAliveTimers.has(t)&&(clearInterval(this.pingKeepAliveTimers.get(t)),this.pingKeepAliveTimers.delete(t)),this.relayKeepAliveTimers.has(e)&&(this.relayKeepAliveTimers.get(e)?.map(clearInterval),this.relayKeepAliveTimers.delete(e))}stopAll(){for(const e of[...Object.values(this.pingKeepAliveTimers),...Object.values(this.relayKeepAliveTimers)])clearInterval(e);this.pingKeepAliveTimers.clear(),this.relayKeepAliveTimers.clear()}connectionsExist(){return this.pingKeepAliveTimers.size>0||this.relayKeepAliveTimers.size>0}scheduleRelayPings(e,t,r){const n=[];for(const s of e.pubsubTopics){if(!e.getMeshPeers(s).includes(r))continue;const o=Tn({pubsubTopicShardInfo:pn(s),contentTopic:"/relay-ping/1/ping/null",ephemeral:!0}),i=setInterval((()=>{Hs.info("Sending Waku Relay ping message"),e.send(o,{payload:new Uint8Array([1])}).catch((e=>Hs.error("Failed to send relay ping",e)))}),1e3*t);n.push(i)}return n}}const Vs=new An("connection-manager");class js extends Fs{configuredPubsubTopics;static instances=new Map;keepAliveManager;options;libp2p;dialAttemptsForPeer=new Map;dialErrorsForPeer=new Map;currentActiveParallelDialCount=0;pendingPeerDialQueue=[];isP2PNetworkConnected=!1;isConnected(){return!(globalThis?.navigator&&!globalThis?.navigator?.onLine)&&this.isP2PNetworkConnected}static create(e,t,r,n,s,o){let i=js.instances.get(e);return i||(i=new js(t,r,n,s,o),js.instances.set(e,i)),i}stop(){this.keepAliveManager.stopAll(),this.libp2p.removeEventListener("peer:connect",this.onEventHandlers["peer:connect"]),this.libp2p.removeEventListener("peer:disconnect",this.onEventHandlers["peer:disconnect"]),this.libp2p.removeEventListener("peer:discovery",this.onEventHandlers["peer:discovery"]),this.stopNetworkStatusListener()}async dropConnection(e){try{this.keepAliveManager.stop(e),await this.libp2p.hangUp(e),Vs.info(`Dropped connection with peer ${e.toString()}`)}catch(t){Vs.error(`Error dropping connection with peer ${e.toString()} - ${t}`)}}async getPeersByDiscovery(){const e=await this.libp2p.peerStore.all(),t=this.libp2p.getConnections().map((e=>e.remotePeer)),r=[],n=[],s=[],o=[],i=[],a=[];for(const t of e){const e=await this.getTagNamesForPeer(t.id);e.includes(Xr.BOOTSTRAP)?r.push(t):e.includes(Xr.PEER_EXCHANGE)?n.push(t):e.includes(Xr.LOCAL)&&s.push(t)}for(const e of t){const t=await this.libp2p.peerStore.get(e),r=await this.getTagNamesForPeer(e);r.includes(Xr.BOOTSTRAP)?o.push(t):r.includes(Xr.PEER_EXCHANGE)?i.push(t):r.includes(Xr.LOCAL)&&a.push(t)}return{DISCOVERED:{[Xr.BOOTSTRAP]:r,[Xr.PEER_EXCHANGE]:n,[Xr.LOCAL]:s},CONNECTED:{[Xr.BOOTSTRAP]:o,[Xr.PEER_EXCHANGE]:i,[Xr.LOCAL]:a}}}constructor(e,t,r,n,s){super(),this.configuredPubsubTopics=r,this.libp2p=e,this.configuredPubsubTopics=r,this.options={maxDialAttemptsForPeer:3,maxBootstrapPeersAllowed:1,maxParallelDials:3,...s},this.keepAliveManager=new qs({relay:n,libp2p:e,options:t}),this.startEventListeners().then((()=>Vs.info("Connection Manager is now running"))).catch((e=>Vs.error("Unexpected error while running service",e))),this.dialPeerStorePeers().catch((e=>Vs.error("Unexpected error while dialing peer store peers",e)))}async dialPeerStorePeers(){const e=await this.libp2p.peerStore.all(),t=[];for(const r of e)this.libp2p.getConnections().find((e=>e.remotePeer===r.id))||t.push(this.attemptDial(r.id));try{await Promise.all(t)}catch(e){Vs.error("Unexpected error while dialing peer store peers",e)}}async startEventListeners(){this.startPeerDiscoveryListener(),this.startPeerConnectionListener(),this.startPeerDisconnectionListener(),this.startNetworkStatusListener()}async dialPeer(e){this.currentActiveParallelDialCount+=1;let t=0;for(;t{e.tags=Array.from(new Set([...e.tags,...r]))})),this.dialAttemptsForPeer.set(e.toString(),-1),this.keepAliveManager.start(e);break}catch(r){r instanceof AggregateError?Vs.error(`Error dialing peer ${e.toString()} - ${r.errors}`):Vs.error(`Error dialing peer ${e.toString()} - ${r.message}`),this.dialErrorsForPeer.set(e.toString(),r),t++,this.dialAttemptsForPeer.set(e.toString(),t)}if(this.currentActiveParallelDialCount--,this.processDialQueue(),t===this.options.maxDialAttemptsForPeer)try{const t=this.dialErrorsForPeer.get(e.toString());if(t){let r;t instanceof AggregateError?t.errors?0===t.errors.length?Vs.warn("Errors array is empty for AggregateError"):r=JSON.stringify(t.errors[0]):Vs.warn("No errors array found for AggregateError"):r=t.message,Vs.info(`Deleting undialable peer ${e.toString()} from peer store. Reason: ${r}`)}this.dialErrorsForPeer.delete(e.toString()),await this.libp2p.peerStore.delete(e),await this.attemptDnsDiscovery()}catch(t){throw new Error(`Error deleting undialable peer ${e.toString()} from peer store - ${t}`)}}async attemptDnsDiscovery(){if(this.libp2p.getConnections().length>0)return;if((await this.libp2p.peerStore.all()).length>0)return;Vs.info("Attempting to trigger DNS discovery.");const e=Object.values(this.libp2p.components.components).find((e=>!(!e||!e.toString)&&e.toString().includes(en)));e&&await e.findPeers()}processDialQueue(){if(this.pendingPeerDialQueue.length>0&&this.currentActiveParallelDialCount{Vs.error(e)}))}}startPeerDiscoveryListener(){this.libp2p.addEventListener("peer:discovery",this.onEventHandlers["peer:discovery"])}startPeerConnectionListener(){this.libp2p.addEventListener("peer:connect",this.onEventHandlers["peer:connect"])}startPeerDisconnectionListener(){this.libp2p.addEventListener("peer:disconnect",this.onEventHandlers["peer:disconnect"])}async attemptDial(e){await this.shouldDialPeer(e)&&(this.currentActiveParallelDialCount>=this.options.maxParallelDials?this.pendingPeerDialQueue.push(e):await this.dialPeer(e))}onEventHandlers={"peer:discovery":e=>{(async()=>{const{id:t}=e.detail;await this.dispatchDiscoveryEvent(t);try{await this.attemptDial(t)}catch(e){Vs.error(`Error dialing peer ${t.toString()} : ${e}`)}})()},"peer:connect":e=>{(async()=>{Vs.info(`Connected to peer ${e.detail.toString()}`);const t=e.detail;this.keepAliveManager.start(t),(await this.getTagNamesForPeer(t)).includes(Xr.BOOTSTRAP)?this.libp2p.getConnections().filter((e=>e.tags.includes(Xr.BOOTSTRAP))).length>this.options.maxBootstrapPeersAllowed?await this.dropConnection(t):this.dispatchEvent(new $s(Qr.PEER_CONNECT_BOOTSTRAP,{detail:t})):this.dispatchEvent(new $s(Qr.PEER_CONNECT_PEER_EXCHANGE,{detail:t})),this.setP2PNetworkConnected()})()},"peer:disconnect":e=>{(async()=>{this.keepAliveManager.stop(e.detail),this.setP2PNetworkDisconnected()})()},"browser:network":()=>{this.dispatchWakuConnectionEvent()}};async shouldDialPeer(e){if(this.libp2p.getConnections(e).length>0)return Vs.warn(`Already connected to peer ${e.toString()}. Not dialing.`),!1;if(!await this.isPeerTopicConfigured(e)){const t=await this.getPeerShardInfo(e,this.libp2p.peerStore);return Vs.warn(`Discovered peer ${e.toString()} with ShardInfo ${t} is not part of any of the configured pubsub topics (${this.configuredPubsubTopics}).\n Not dialing.`),!1}return await this.isPeerDialableBasedOnBootstrapStatus(e)?!this.dialAttemptsForPeer.has(e.toString())||(Vs.warn(`Peer ${e.toString()} has already been attempted dial before, or already has a dial attempt in progress, skipping dial`),!1):(Vs.warn(`Peer ${e.toString()} is not dialable based on bootstrap status. Not dialing.`),!1)}async isPeerDialableBasedOnBootstrapStatus(e){return!(await this.getTagNamesForPeer(e)).some((e=>e===Xr.BOOTSTRAP))||this.libp2p.getConnections().filter((e=>e.tags.find((e=>e===Xr.BOOTSTRAP)))).lengththis.configuredPubsubTopics.includes(e)))}async getPeerShardInfo(e,t){const r=(await t.get(e)).metadata.get("shardInfo");if(r)return bn(r)}startNetworkStatusListener(){try{globalThis.addEventListener("online",this.onEventHandlers["browser:network"]),globalThis.addEventListener("offline",this.onEventHandlers["browser:network"])}catch(e){Vs.error(`Failed to start network listener: ${e}`)}}stopNetworkStatusListener(){try{globalThis.removeEventListener("online",this.onEventHandlers["browser:network"]),globalThis.removeEventListener("offline",this.onEventHandlers["browser:network"])}catch(e){Vs.error(`Failed to stop network listener: ${e}`)}}setP2PNetworkConnected(){this.isP2PNetworkConnected||(this.isP2PNetworkConnected=!0,this.dispatchWakuConnectionEvent())}setP2PNetworkDisconnected(){this.isP2PNetworkConnected&&0===this.libp2p.getConnections().length&&(this.isP2PNetworkConnected=!1,this.dispatchWakuConnectionEvent())}dispatchWakuConnectionEvent(){this.dispatchEvent(new $s(Zr.CONNECTION_STATUS,{detail:this.isConnected()}))}}class Ks{static instance;health;constructor(){this.health={overallStatus:nn.Unhealthy,protocolStatuses:new Map}}static getInstance(){return Ks.instance||(Ks.instance=new Ks),Ks.instance}getHealthStatus(){return this.health.overallStatus}getProtocolStatus(e){return this.health.protocolStatuses.get(e)}updateProtocolHealth(e,t){const r=this.getNameFromMulticodec(e);let n=nn.Unhealthy;1==t?n=nn.MinimallyHealthy:t>=2&&(n=nn.SufficientlyHealthy),this.health.protocolStatuses.set(r,{name:r,status:n,lastUpdate:new Date}),this.updateOverallHealth()}getNameFromMulticodec(e){let t;if(e.includes("filter"))t=Yr.Filter;else if(e.includes("lightpush"))t=Yr.LightPush;else{if(!e.includes("store"))throw new Error(`Unknown protocol: ${e}`);t=Yr.Store}return t}updateOverallHealth(){const e=[Yr.LightPush,Yr.Filter].map((e=>this.getProtocolStatus(e)?.status));e.some((e=>e===nn.Unhealthy))?this.health.overallStatus=nn.Unhealthy:e.some((e=>e===nn.MinimallyHealthy))?this.health.overallStatus=nn.MinimallyHealthy:this.health.overallStatus=nn.SufficientlyHealthy}}const zs=()=>Ks.getInstance(),Gs=new An("metadata"),Ws="/vac/waku/metadata/1.0.0";class Ys extends is{pubsubTopics;libp2pComponents;handshakesConfirmed=new Map;constructor(e,t){super(Ws,t.components,Gs,e),this.pubsubTopics=e,this.libp2pComponents=t,t.registrar.handle(Ws,(e=>{this.onRequest(e)}))}async query(e){const t=wr.encode(fn(this.pubsubTopics)),r=await this.peerStore.get(e);if(!r)return{shardInfo:null,error:Jr.NO_PEER_AVAILABLE};let n;try{n=await this.getStream(r)}catch(o){return Gs.error("Failed to get stream",o),{shardInfo:null,error:Jr.NO_STREAM_AVAILABLE}}const s=await Zn([t],Fn,n,zn,(async e=>await Nn(e))),{error:o,shardInfo:i}=this.decodeMetadataResponse(s);return o?{shardInfo:null,error:o}:(await this.savePeerShardInfo(e,i),{shardInfo:i,error:null})}async confirmOrAttemptHandshake(e){const t=this.handshakesConfirmed.get(e.toString());return t?{shardInfo:t,error:null}:await this.query(e)}async onRequest(e){try{const{stream:t,connection:r}=e,n=vr.encode(fn(this.pubsubTopics)),s=await Zn([n],Fn,t,zn,(async e=>await Nn(e))),{error:o,shardInfo:i}=this.decodeMetadataResponse(s);if(o)return;await this.savePeerShardInfo(r.remotePeer,i)}catch(e){Gs.error("Error handling metadata request",e)}}decodeMetadataResponse(e){const t=new Bn;e.forEach((e=>{t.append(e)}));const r=vr.decode(t);return r?{shardInfo:r,error:null}:(Gs.error("Error decoding metadata response"),{shardInfo:null,error:Jr.DECODE_FAILED})}async savePeerShardInfo(e,t){await this.libp2pComponents.peerStore.merge(e,{metadata:{shardInfo:wn(t)}}),this.handshakesConfirmed.set(e.toString(),t)}}function Js(e){return t=>new Ys(e,t)}const Xs=Symbol.for("@libp2p/peer-id");function Qs(e){return null!=e&&Boolean(e[Xs])}class Zs extends Error{code;type;constructor(e="The operation was aborted"){super(e),this.name="AbortError",this.code=Zs.code,this.type=Zs.type}static code="ABORT_ERR";static type="aborted"}class eo extends Error{code;props;constructor(e,t,r){super(e),this.code=t,this.name=r?.name??"CodeError",this.props=r??{}}}class to extends AggregateError{code;props;constructor(e,t,r,n){super(e,t),this.code=r,this.name=n?.name??"AggregateCodeError",this.props=n??{}}}Error,Error,Error;const ro="ERR_TIMEOUT",no=45,so=15,oo=new class{index=0;input="";new(e){return this.index=0,this.input=e,this}readAtomically(e){const t=this.index,r=e();return void 0===r&&(this.index=t),r}parseWith(e){const t=e();if(this.index===this.input.length)return t}peekChar(){if(!(this.index>=this.input.length))return this.input[this.index]}readChar(){if(!(this.index>=this.input.length))return this.input[this.index++]}readGivenChar(e){return this.readAtomically((()=>{const t=this.readChar();if(t===e)return t}))}readSeparator(e,t,r){return this.readAtomically((()=>{if(!(t>0&&void 0===this.readGivenChar(e)))return r()}))}readNumber(e,t,r,n){return this.readAtomically((()=>{let s=0,o=0;const i=this.peekChar();if(void 0===i)return;const a="0"===i,c=2**(8*n)-1;for(;;){const r=this.readAtomically((()=>{const t=this.readChar();if(void 0===t)return;const r=Number.parseInt(t,e);return Number.isNaN(r)?void 0:r}));if(void 0===r)break;if(s*=e,s+=r,s>c)return;if(o+=1,void 0!==t&&o>t)return}return 0===o||!r&&a&&o>1?void 0:s}))}readIPv4Addr(){return this.readAtomically((()=>{const e=new Uint8Array(4);for(let t=0;tthis.readNumber(10,3,!1,1)));if(void 0===r)return;e[t]=r}return e}))}readIPv6Addr(){const e=e=>{for(let t=0;tthis.readIPv4Addr()));if(void 0!==n)return e[r]=n[0],e[r+1]=n[1],e[r+2]=n[2],e[r+3]=n[3],[r+4,!0]}const n=this.readSeparator(":",t,(()=>this.readNumber(16,4,!0,2)));if(void 0===n)return[r,!1];e[r]=n>>8,e[r+1]=255&n}return[e.length,!1]};return this.readAtomically((()=>{const t=new Uint8Array(16),[r,n]=e(t);if(16===r)return t;if(n)return;if(void 0===this.readGivenChar(":"))return;if(void 0===this.readGivenChar(":"))return;const s=new Uint8Array(14),o=16-(r+2),[i]=e(s.subarray(0,o));return t.set(s.subarray(0,i),16-i),t}))}readIPAddr(){return this.readIPv4Addr()??this.readIPv6Addr()}};function io(e){return Boolean(function(e){if(!(e.length>so))return oo.new(e).parseWith((()=>oo.readIPv4Addr()))}(e))}function ao(e){return Boolean(function(e){if(e.includes("%")&&(e=e.split("%")[0]),!(e.length>no))return oo.new(e).parseWith((()=>oo.readIPv6Addr()))}(e))}function co(e){return Boolean(function(e){if(e.includes("%")&&(e=e.split("%")[0]),!(e.length>no))return oo.new(e).parseWith((()=>oo.readIPAddr()))}(e))}parseInt("0xFFFF",16),new Uint8Array([0,0,0,0,0,0,0,0,0,0,255,255]);const lo=io,uo=ao,ho=function(e){let t=0;if(e=e.toString().trim(),lo(e)){const r=new Uint8Array(t+4);return e.split(/\./g).forEach((e=>{r[t++]=255&parseInt(e,10)})),r}if(uo(e)){const r=e.split(":",8);let n;for(n=0;n0;n--)e.push("0");r.splice.apply(r,e)}const s=new Uint8Array(t+16);for(n=0;n>8&255,s[t++]=255&e}return s}throw new Error("invalid ip address")},po=function(e,t=0,r){t=~~t,r=r??e.length-t;const n=new DataView(e.buffer);if(4===r){const n=[];for(let s=0;s65536)throw new Error("Port number is not in range(1, 65536)");const s=So(n);return xn([r,s],r.length+s.length)}(t);case 445:return function(e){const t=e.split(":");if(2!==t.length)throw new Error(`failed to parse onion addr: ["'${t.join('", "')}'"]' does not contain a port number`);if(56!==t[0].length)throw new Error(`failed to parse onion addr: ${t[0]} not a Tor onion3 address.`);const r=fe.decode(`b${t[0]}`),n=parseInt(t[1],10);if(n<1||n>65536)throw new Error("Port number is not in range(1, 65536)");const s=So(n);return xn([r,s],r.length+s.length)}(t);case 466:return function(e){const t=Eo.decode(e),r=Uint8Array.from(P(t.length));return xn([r,t],r.length+t.length)}(t);case 481:return _o(globalThis.decodeURIComponent(t));default:return Nt(t,"base16")}}[[4,32,"ip4"],[6,16,"tcp"],[33,16,"dccp"],[41,128,"ip6"],[42,fo,"ip6zone"],[43,8,"ipcidr"],[53,fo,"dns",!0],[54,fo,"dns4",!0],[55,fo,"dns6",!0],[56,fo,"dnsaddr",!0],[132,16,"sctp"],[273,16,"udp"],[275,0,"p2p-webrtc-star"],[276,0,"p2p-webrtc-direct"],[277,0,"p2p-stardust"],[280,0,"webrtc-direct"],[281,0,"webrtc"],[290,0,"p2p-circuit"],[301,0,"udt"],[302,0,"utp"],[400,fo,"unix",!1,!0],[421,fo,"ipfs"],[421,fo,"p2p"],[443,0,"https"],[444,96,"onion"],[445,296,"onion3"],[446,fo,"garlic64"],[448,0,"tls"],[449,fo,"sni"],[460,0,"quic"],[461,0,"quic-v1"],[465,0,"webtransport"],[466,fo,"certhash"],[477,0,"ws"],[478,0,"wss"],[479,0,"p2p-websocket-star"],[480,0,"http"],[481,fo,"http-path"],[777,fo,"memory"]].forEach((e=>{const t=function(e,t,r,n,s){return{code:e,size:t,name:r,resolvable:Boolean(n),path:Boolean(s)}}(...e);yo[t.code]=t,go[t.name]=t})),mo("ip4"),mo("ip6"),mo("ipcidr");const vo=Object.values(kt).map((e=>e.decoder)),Eo=function(){let e=vo[0].or(vo[1]);return vo.slice(2).forEach((t=>e=e.or(t))),e}();function So(e){const t=new ArrayBuffer(2);return new DataView(t).setUint16(0,e),new Uint8Array(t)}function Ao(e){return new DataView(e.buffer).getUint16(e.byteOffset)}function _o(e){const t=Nt(e),r=Uint8Array.from(P(t.length));return xn([r,t],r.length+t.length)}function ko(e){const t=O(e);if((e=e.slice(C(t))).length!==t)throw new Error("inconsistent lengths");return sn(e)}function Io(e){const t=[],r=[];let n=null,s=0;for(;se.length)throw xo("Invalid address Uint8Array: "+sn(e,"base16"));t.push([o,l]);const u=bo(o,l);if(r.push([o,u]),!0===a.path){n=u;break}}return{bytes:Uint8Array.from(e),string:Ro(r),tuples:t,stringTuples:r,path:n}}function Ro(e){const t=[];return e.map((e=>{const r=mo(e[0]);return t.push(r.name),e.length>1&&null!=e[1]&&t.push(e[1]),null})),No(t.join("/"))}function To(e){return xn(e.map((e=>{const t=mo(e[0]);let r=Uint8Array.from(P(t.code));return e.length>1&&null!=e[1]&&(r=xn([r,e[1]])),r})))}function Co(e,t){if(e.size>0)return e.size/8;if(0===e.size)return 0;{const e=O(t instanceof Uint8Array?t:Uint8Array.from(t));return e+C(e)}}function No(e){return"/"+e.trim().split("/").filter((e=>e)).join("/")}function xo(e){return new Error("Error parsing address: "+e)}const Po=Symbol.for("nodejs.util.inspect.custom"),Oo=Symbol.for("@multiformats/js-multiaddr/multiaddr"),Do=[mo("dns").code,mo("dns4").code,mo("dns6").code,mo("dnsaddr").code];class Lo{bytes;#t;#r;#n;#s;[Oo]=!0;constructor(e){let t;if(null==e&&(e=""),e instanceof Uint8Array)t=Io(e);else if("string"==typeof e){if(e.length>0&&"/"!==e.charAt(0))throw new Error(`multiaddr "${e}" must start with a "/"`);t=function(e){const t=[],r=[];let n=null;const s=(e=No(e)).split("/").slice(1);if(1===s.length&&""===s[0])return{bytes:new Uint8Array,string:"/",tuples:[],stringTuples:[],path:null};for(let o=0;o=s.length)throw xo("invalid address: "+e);if(!0===i.path){n=No(s.slice(o).join("/")),t.push([i.code,wo(i.code,n)]),r.push([i.code,n]);break}const a=wo(i.code,s[o]);t.push([i.code,a]),r.push([i.code,bo(i.code,a)])}return{string:Ro(r),bytes:To(t),tuples:t,stringTuples:r,path:n}}(e)}else{if(!Uo(e))throw new Error("addr must be a string, Buffer, or another Multiaddr");t=Io(e.bytes)}this.bytes=t.bytes,this.#t=t.string,this.#r=t.tuples,this.#n=t.stringTuples,this.#s=t.path}toString(){return this.#t}toJSON(){return this.toString()}toOptions(){let e,t,r,n,s="";const o=mo("tcp"),i=mo("udp"),a=mo("ip4"),c=mo("ip6"),l=mo("dns6"),u=mo("ip6zone");for(const[h,d]of this.stringTuples())h===u.code&&(s=`%${d??""}`),Do.includes(h)&&(t=o.name,n=443,r=`${d??""}${s}`,e=h===l.code?6:4),h!==o.code&&h!==i.code||(t=mo(h).name,n=parseInt(d??"")),h!==a.code&&h!==c.code||(t=mo(h).name,r=`${d??""}${s}`,e=h===c.code?6:4);if(null==e||null==t||null==r||null==n)throw new Error('multiaddr must have a valid format: "/{ip4, ip6, dns4, dns6, dnsaddr}/{address}/{tcp, udp}/{port}".');return{family:e,host:r,transport:t,port:n}}protos(){return this.#r.map((([e])=>Object.assign({},mo(e))))}protoCodes(){return this.#r.map((([e])=>e))}protoNames(){return this.#r.map((([e])=>mo(e).name))}tuples(){return this.#r}stringTuples(){return this.#n}encapsulate(e){return e=new Lo(e),new Lo(this.toString()+e.toString())}decapsulate(e){const t=e.toString(),r=this.toString(),n=r.lastIndexOf(t);if(n<0)throw new Error(`Address ${this.toString()} does not contain subaddress: ${e.toString()}`);return new Lo(r.slice(0,n))}decapsulateCode(e){const t=this.tuples();for(let r=t.length-1;r>=0;r--)if(t[r][0]===e)return new Lo(To(t.slice(0,r)));return this}getPeerId(){try{let e=[];this.stringTuples().forEach((([t,r])=>{t===go.p2p.code&&e.push([t,r]),t===go["p2p-circuit"].code&&(e=[])}));const t=e.pop();if(null!=t?.[1]){const e=t[1];return"Q"===e[0]||"1"===e[0]?sn(ke.decode(`z${e}`),"base58btc"):sn(vt.parse(e).multihash.bytes,"base58btc")}return null}catch(e){return null}}getPath(){return this.#s}equals(e){return Pn(this.bytes,e.bytes)}async resolve(e){const t=this.protos().find((e=>e.resolvable));if(null==t)return[this];const r=Bo.get(t.name);if(null==r)throw new eo(`no available resolver for ${t.name}`,"ERR_NO_AVAILABLE_RESOLVER");return(await r(this,e)).map((e=>Mo(e)))}nodeAddress(){const e=this.toOptions();if("tcp"!==e.transport&&"udp"!==e.transport)throw new Error(`multiaddr must have a valid format - no protocol with name: "${e.transport}". Must have a valid transport protocol: "{tcp, udp}"`);return{family:e.family,address:e.host,port:e.port}}isThinWaistAddress(e){const t=(e??this).protos();return!(2!==t.length||4!==t[0].code&&41!==t[0].code||6!==t[1].code&&273!==t[1].code)}[Po](){return`Multiaddr(${this.#t})`}}const Bo=new Map;function Uo(e){return Boolean(e?.[Oo])}function Mo(e){return new Lo(e)}function Fo(e,t){const r=ln(e),n=ln(t.contentTopic),s=function(e){if(!e)return;let t;return t="bigint"==typeof e?e:1000000n*BigInt(e.valueOf()),function(e){const t=new ArrayBuffer(8),r=new DataView(t);return"number"==typeof e?r.setFloat64(0,e,!1):r.setBigInt64(0,e,!1),new Uint8Array(t)}(t)}(t.timestamp),o=un([r,t.payload,n,t.meta,s].filter(kr));return Wr(o)}class $o{core;connectionManager;healthManager;numPeersToUse;peers=[];maintainPeersIntervalId=null;log;maintainPeersLock=!1;renewPeersLocker=new Ho(3e4);constructor(e,t,r){this.core=e,this.connectionManager=t,this.log=new An(`sdk:${e.multicodec}`),this.healthManager=zs(),this.numPeersToUse=r?.numPeersToUse??2;const n=r?.maintainPeersInterval??3e4;this.startMaintainPeersInterval(n)}get connectedPeers(){return this.peers}async renewPeer(e){this.log.info(`Renewing peer ${e}`),await this.connectionManager.dropConnection(e);const t=(await this.findAndAddPeers(1))[0];t||this.log.error("Failed to find a new peer to replace the disconnected one.");const r=this.peers.filter((t=>!t.id.equals(e)));return this.updatePeers(r),this.log.info(`Peer ${e} disconnected and removed from the peer list`),this.renewPeersLocker.lock(e),t}stopMaintainPeersInterval(){this.maintainPeersIntervalId&&(clearInterval(this.maintainPeersIntervalId),this.maintainPeersIntervalId=null,this.log.info("Maintain peers interval stopped"))}hasPeers=async(e={})=>{const{autoRetry:t=!1,forceUseAllPeers:r=!1,initialDelay:n=10,maxAttempts:s=3,maxDelay:o=100}=e;if(!r&&this.connectedPeers.length>0)return!0;let i=0;for(;i{this.maintainPeers().catch((e=>{this.log.error("Error during maintain peers interval:",e)}))}),e),this.log.info(`Maintain peers interval started with interval ${e}ms`)}catch(e){throw this.log.error("Error starting maintain peers interval:",e),e}}async maintainPeers(){if(this.maintainPeersLock)return!1;this.maintainPeersLock=!0,this.log.info(`Maintaining peers, current count: ${this.peers.length}`);try{const e=this.numPeersToUse-this.peers.length;e>0&&await this.findAndAddPeers(e),this.log.info(`Peer maintenance completed, current count: ${this.peers.length}`),this.renewPeersLocker.cleanUnlocked()}finally{this.maintainPeersLock=!1}return!0}async findAndAddPeers(e){this.log.info(`Finding and adding ${e} new peers`);try{const t=await this.findAdditionalPeers(e),r=t.map((e=>this.connectionManager.attemptDial(e.id)));await Promise.all(r);const n=[...this.peers,...t];return this.updatePeers(n),this.log.info(`Added ${t.length} new peers, total peers: ${this.peers.length}`),t}catch(e){throw this.log.error("Error finding and adding new peers:",e),e}}async findAdditionalPeers(e){this.log.info(`Finding ${e} additional peers`);try{let t=await this.core.allPeers();return 0===t.length&&this.log.warn("No new peers found."),t=t.filter((e=>!1===this.peers.some((t=>t.id.equals(e.id))))).filter((e=>!this.renewPeersLocker.isLocked(e.id))).slice(0,e),t}catch(e){throw this.log.error("Error finding additional peers:",e),e}}updatePeers(e){this.peers=e,this.healthManager.updateProtocolHealth(this.core.multicodec,this.peers.length)}}class Ho{lockDuration;peers=new Map;constructor(e){this.lockDuration=e}lock(e){this.peers.set(e.toString(),Date.now())}isLocked(e){const t=this.peers.get(e.toString());return!(!t||this.isTimeUnlocked(t))}cleanUnlocked(){Object.entries(this.peers).forEach((([e,t])=>{this.isTimeUnlocked(t)&&this.peers.delete(e.toString())}))}isTimeUnlocked(e){return Date.now()-e>=this.lockDuration}}const qo=new An("sdk:filter");class Vo{pubsubTopic;protocol;connectionManager;getPeers;renewPeer;subscriptionCallbacks=new Map;receivedMessagesHashStr=[];peerFailures=new Map;receivedMessagesHashes;missedMessagesByPeer=new Map;keepAliveInterval=6e4;maxPingFailures=2;maxMissedMessagesThreshold=3;keepAliveTimer=null;constructor(e,t,r,n,s){this.pubsubTopic=e,this.protocol=t,this.connectionManager=r,this.getPeers=n,this.renewPeer=s,this.pubsubTopic=e;const o=this.getPeers().map((e=>e.id.toString()));this.receivedMessagesHashes={all:new Set,nodes:{...Object.fromEntries(o.map((e=>[e,new Set])))}},o.forEach((e=>this.missedMessagesByPeer.set(e,0)))}addHash(e,t){this.receivedMessagesHashes.all.add(e),t&&(this.receivedMessagesHashes.nodes[t]||(this.receivedMessagesHashes.nodes[t]=new Set),this.receivedMessagesHashes.nodes[t].add(e))}async subscribe(e,t,r={}){this.keepAliveInterval=r.keepAlive||6e4,this.maxPingFailures=r.pingsBeforePeerRenewed||2,this.maxMissedMessagesThreshold=r.maxMissedMessagesThreshold||3;const n=Array.isArray(e)?e:[e];for(const e of n)if(e.pubsubTopic!==this.pubsubTopic)return{failures:[{error:Jr.TOPIC_DECODER_MISMATCH}],successes:[]};const s=Ir(n),o=Array.from(s.keys()),i=this.getPeers().map((async e=>this.protocol.subscribe(this.pubsubTopic,e,o))),a=await Promise.allSettled(i),c=this.handleResult(a,"subscribe");return s.forEach(((e,r)=>{const n={decoders:e,callback:t};this.subscriptionCallbacks.set(r,n)})),this.startSubscriptionsMaintenance(this.keepAliveInterval),c}async unsubscribe(e){const t=this.getPeers().map((async t=>{const r=await this.protocol.unsubscribe(this.pubsubTopic,t,e);return e.forEach((e=>{this.subscriptionCallbacks.delete(e)})),r})),r=await Promise.allSettled(t),n=this.handleResult(r,"unsubscribe");return 0===this.subscriptionCallbacks.size&&this.stopSubscriptionsMaintenance(),n}async ping(e){const t=(e?[e]:this.getPeers().map((e=>e.id))).map((e=>this.pingSpecificPeer(e))),r=await Promise.allSettled(t);return this.handleResult(r,"ping")}async unsubscribeAll(){const e=this.getPeers().map((async e=>this.protocol.unsubscribeAll(this.pubsubTopic,e))),t=await Promise.allSettled(e);this.subscriptionCallbacks.clear();const r=this.handleResult(t,"unsubscribeAll");return this.stopSubscriptionsMaintenance(),r}async validateMessage(){for(const e of this.receivedMessagesHashes.all)for(const[t,r]of Object.entries(this.receivedMessagesHashes.nodes))if(!r.has(e)&&(this.incrementMissedMessageCount(t),this.shouldRenewPeer(t))){qo.info(`Peer ${t} has missed too many messages, renewing.`);const e=this.getPeers().find((e=>e.id.toString()===t))?.id;if(!e){qo.error(`Unexpected Error: Peer ${t} not found in connected peers.`);continue}try{await this.renewAndSubscribePeer(e)}catch(e){qo.error(`Failed to renew peer ${t}: ${e}`)}}}async processIncomingMessage(e,t){const r=function(e,t){const r=Fo(e,t);return cn(r)}(this.pubsubTopic,e);if(this.addHash(r,t),this.validateMessage(),this.receivedMessagesHashStr.includes(r))return void qo.info("Message already received, skipping");this.receivedMessagesHashStr.push(r);const{contentTopic:n}=e,s=this.subscriptionCallbacks.get(n);s?(qo.info("Processing message with content topic ",n," on pubsub topic ",this.pubsubTopic),await async function(e,t,r){const{decoders:n,callback:s}=e,{contentTopic:o}=r;if(o)try{const e=n.map((e=>e.fromProtoObj(t,r).then((e=>e||Promise.reject("Decoding failed"))))),o=await Promise.any(e);await s(o)}catch(e){qo.error("Error decoding message",e)}else qo.warn("Message has no content topic, skipping")}(s,this.pubsubTopic,e)):qo.error("No subscription callback available for ",n)}handleResult(e,t){const r={failures:[],successes:[]};for(const n of e)if("rejected"===n.status)qo.error(`Failed to resolve ${t} promise successfully: `,n.reason),r.failures.push({error:Jr.GENERIC_FAIL});else{const e=n.value;e.failure?r.failures.push(e.failure):r.successes.push(e.success)}return r}async pingSpecificPeer(e){const t=this.getPeers().find((t=>t.id.equals(e)));if(!t)return{success:null,failure:{peerId:e,error:Jr.NO_PEER_AVAILABLE}};try{const r=await this.protocol.ping(t);return r.failure?await this.handlePeerFailure(e):this.peerFailures.delete(e.toString()),r}catch(t){return await this.handlePeerFailure(e),{success:null,failure:{peerId:e,error:Jr.GENERIC_FAIL}}}}async handlePeerFailure(e){const t=(this.peerFailures.get(e.toString())||0)+1;if(this.peerFailures.set(e.toString(),t),t>this.maxPingFailures)try{await this.renewAndSubscribePeer(e),this.peerFailures.delete(e.toString())}catch(t){qo.error(`Failed to renew peer ${e.toString()}: ${t}.`)}}async renewAndSubscribePeer(e){try{const t=await this.renewPeer(e);return await this.protocol.subscribe(this.pubsubTopic,t,Array.from(this.subscriptionCallbacks.keys())),this.receivedMessagesHashes.nodes[t.id.toString()]=new Set,this.missedMessagesByPeer.set(t.id.toString(),0),t}catch(t){return void qo.warn(`Failed to renew peer ${e.toString()}: ${t}.`)}finally{this.peerFailures.delete(e.toString()),this.missedMessagesByPeer.delete(e.toString()),delete this.receivedMessagesHashes.nodes[e.toString()]}}startSubscriptionsMaintenance(e){this.startKeepAlivePings(e),this.startConnectionListener()}stopSubscriptionsMaintenance(){this.stopKeepAlivePings(),this.stopConnectionListener()}startKeepAlivePings(e){this.keepAliveTimer?qo.info("Recurring pings already set up."):this.keepAliveTimer=setInterval((()=>{this.ping().catch((e=>{qo.error("Error in keep-alive ping cycle:",e)}))}),e)}stopKeepAlivePings(){this.keepAliveTimer?(qo.info("Stopping recurring pings."),clearInterval(this.keepAliveTimer),this.keepAliveTimer=null):qo.info("Already stopped recurring pings.")}startConnectionListener(){this.connectionManager.addEventListener(Zr.CONNECTION_STATUS,this.connectionListener.bind(this))}stopConnectionListener(){this.connectionManager.removeEventListener(Zr.CONNECTION_STATUS,this.connectionListener.bind(this))}async connectionListener({detail:e}){if(e){try{const e=(await this.ping()).failures.map((async e=>{e.peerId&&await this.renewAndSubscribePeer(e.peerId)}));await Promise.all(e)}catch(e){qo.error(`networkStateListener failed to recover: ${e}`)}this.startKeepAlivePings(this.keepAliveInterval)}else this.stopKeepAlivePings()}incrementMissedMessageCount(e){const t=this.missedMessagesByPeer.get(e)||0;this.missedMessagesByPeer.set(e,t+1)}shouldRenewPeer(e){return(this.missedMessagesByPeer.get(e)||0)>this.maxMissedMessagesThreshold}}class jo extends $o{protocol;_connectionManager;activeSubscriptions=new Map;constructor(e,t,r){super(new bs((async(e,t,r)=>{const n=this.getActiveSubscription(e);n?await n.processIncomingMessage(t,r):qo.error(`No subscription locally registered for topic ${e}`)}),e.configuredPubsubTopics,t),e,{numPeersToUse:r?.numPeersToUse}),this.protocol=this.core,this._connectionManager=e}async subscribe(e,t,r,n){const s=this.getUniquePubsubTopics(e);if(1!==s.length)return{subscription:null,error:Jr.INVALID_DECODER_TOPICS,results:null};const o=s[0],{subscription:i,error:a}=await this.createSubscription(o,r);if(a)return{subscription:null,error:a,results:null};const{failures:c,successes:l}=await i.subscribe(e,t,n);return{subscription:i,error:null,results:{failures:c,successes:l}}}async createSubscription(e,t){t={autoRetry:!0,...t};const r="string"==typeof e?e:dn(e)?.[0];return gn(r,this.protocol.pubsubTopics),await this.hasPeers(t)?(qo.info(`Creating filter subscription with ${this.connectedPeers.length} peers: `,this.connectedPeers.map((e=>e.id.toString()))),{error:null,subscription:this.getActiveSubscription(r)??this.setActiveSubscription(r,new Vo(r,this.protocol,this._connectionManager,(()=>this.connectedPeers),this.renewPeer.bind(this)))}):{error:Jr.NO_PEER_AVAILABLE,subscription:null}}async subscribeWithUnsubscribe(e,t,r){const n=this.getUniquePubsubTopics(e);if(0===n.length)throw Error("Failed to subscribe: no pubsubTopic found on decoders provided.");if(n.length>1)throw Error("Failed to subscribe: all decoders should have the same pubsub topic. Use createSubscription to be more agile.");const{subscription:s,error:o}=await this.createSubscription(n[0]);if(o)throw Error(`Failed to create subscription: ${o}`);await s.subscribe(e,t,r);const i=Array.from(Ir(Array.isArray(e)?e:[e]).keys());return async()=>{await s.unsubscribe(i)}}toSubscriptionIterator(e){return async function(e,t,r){const n=[];let s;s=await e.subscribeWithUnsubscribe(t,(e=>{n.push(e)}));const o=Number.isInteger(r?.timeoutMs),i=Date.now();return{iterator:async function*(){for(;;){if(o&&Date.now()-i>=0)return;await Rr(60);const e=n.shift();if(!s&&0===n.length)return e;!e&&s||(yield e)}}(),async stop(){s&&(await s(),s=void 0)}}}(this,e)}getActiveSubscription(e){return this.activeSubscriptions.get(e)}setActiveSubscription(e,t){return this.activeSubscriptions.set(e,t),t}getUniquePubsubTopics(e){if(!Array.isArray(e))return[e.pubsubTopic];if(0===e.length)return[];const t=new Set(e.map((e=>e.pubsubTopic)));return[...t]}}const Ko=new An("sdk:light-push");class zo extends $o{protocol;constructor(e,t,r){super(new Es(e.configuredPubsubTopics,t),e,{numPeersToUse:r?.numPeersToUse}),this.protocol=this.core}async send(e,t,r){const n={autoRetry:!0,...r},s=[],o=[],{pubsubTopic:i}=e;try{gn(i,this.protocol.pubsubTopics)}catch(e){return Ko.error("Failed to send waku light push: pubsub topic not configured"),{failures:[{error:Jr.TOPIC_NOT_CONFIGURED}],successes:[]}}if(!await this.hasPeers(n))return{successes:s,failures:[{error:Jr.NO_PEER_AVAILABLE}]};const a=this.connectedPeers.map((r=>this.protocol.send(e,t,r))),c=await Promise.allSettled(a);for(const e of c)if("fulfilled"===e.status){const{failure:t,success:r}=e.value;if(r&&s.push(r),t){if(t.peerId)try{await this.renewPeer(t.peerId),Ko.info("Renewed peer",t.peerId.toString())}catch(e){Ko.error("Failed to renew peer",e)}o.push(t)}}else Ko.error("Failed unexpectedly while sending:",e.reason),o.push({error:Jr.GENERIC_FAIL});return{successes:s,failures:o}}}const Go=new An("waku:store:sdk");class Wo extends $o{protocol;constructor(e,t){super(new Rs(e.configuredPubsubTopics,t),e,{numPeersToUse:1}),this.protocol=this.core}async*queryGenerator(e,t){const{pubsubTopic:r,contentTopics:n,decodersAsMap:s}=this.validateDecodersAndPubsubTopic(e),o={pubsubTopic:r,contentTopics:n,includeData:!0,paginationForward:!0,...t},i=(await this.protocol.getPeers({numPeers:this.numPeersToUse,maxBootstrapPeers:1}))[0];if(!i)throw Go.error("No peers available to query"),new Error("No peers available to query");Go.info(`Querying store with options: ${JSON.stringify(t)}`);const a=this.protocol.queryPerPage(o,s,i);for await(const e of a)yield e}async queryWithOrderedCallback(e,t,r){Go.info("Querying store with ordered callback");for await(const n of this.queryGenerator(e,r))if(await this.processMessages(n,t))break}async queryWithPromiseCallback(e,t,r){Go.info("Querying store with promise callback");let n=!1;for await(const s of this.queryGenerator(e,r)){const e=s.map((async e=>{n||(n=Boolean(await t(e)))}));if(await Promise.all(e),n)break}}async processMessages(e,t){let r=!1;const n=(await Promise.all(e)).filter(kr);return await Promise.all(n.map((async e=>{e&&!r&&(r=Boolean(await t(e)))}))),r}createCursor(e){return Fo(e.pubsubTopic,e)}validateDecodersAndPubsubTopic(e){if(0===e.length)throw Go.error("No decoders provided"),new Error("No decoders provided");const t=Array.from(new Set(e.map((e=>e.pubsubTopic))));if(t.length>1)throw Go.error("API does not support querying multiple pubsub topics at once"),new Error("API does not support querying multiple pubsub topics at once");const r=t[0];gn(r,this.protocol.pubsubTopics);const n=new Map;e.forEach((e=>{if(n.has(e.contentTopic))throw Go.error("API does not support different decoder per content topic"),new Error("API does not support different decoder per content topic");n.set(e.contentTopic,e)}));const s=e.filter((e=>e.pubsubTopic===r)).map((e=>e.contentTopic));if(0===s.length)throw Go.error(`No decoders found for topic ${r}`),new Error("No decoders found for topic "+r);return{pubsubTopic:r,contentTopics:s,decodersAsMap:n}}}const Yo="js-waku",Jo=10,Xo=new An("waku");class Qo{pubsubTopics;libp2p;relay;store;filter;lightPush;connectionManager;health;constructor(e,t,r,n,s){this.pubsubTopics=e,this.relay=s,this.libp2p=r,n={filter:!1,lightpush:!1,store:!1,...n};const o=t.pingKeepAlive||300,i=this.relay?t.relayKeepAlive||300:0,a=this.libp2p.peerId.toString();if(this.connectionManager=js.create(a,r,{pingKeepAlive:o,relayKeepAlive:i},this.pubsubTopics,this.relay),this.health=zs(),n.store){const e=(c=this.connectionManager,e=>new Wo(c,e));this.store=e(r)}var c;if(n.lightpush){const e=function(e,t={}){return r=>new zo(e,r,t)}(this.connectionManager);this.lightPush=e(r)}if(n.filter){const e=function(e,t){return t=>new jo(e,t,undefined)}(this.connectionManager);this.filter=e(r)}Xo.info("Waku node created",a,`relay: ${!!this.relay}, store: ${!!this.store}, light push: ${!!this.lightPush}, filter: ${!!this.filter}`)}async dial(e,t){const r=t??[],n=function(e){return Qs(e)?e:Mo(e)}(e);void 0===t&&(this.relay&&r.push(Yr.Relay),this.store&&r.push(Yr.Store),this.filter&&r.push(Yr.Filter),this.lightPush&&r.push(Yr.LightPush));const s=[];return r.includes(Yr.Relay)&&(this.relay?this.relay.gossipSub.multicodecs.forEach((e=>s.push(e))):Xo.error("Relay codec not included in dial codec: protocol not mounted locally")),r.includes(Yr.Store)&&(this.store?s.push(this.store.protocol.multicodec):Xo.error("Store codec not included in dial codec: protocol not mounted locally")),r.includes(Yr.LightPush)&&(this.lightPush?s.push(this.lightPush.protocol.multicodec):Xo.error("Light Push codec not included in dial codec: protocol not mounted locally")),r.includes(Yr.Filter)&&(this.filter?s.push(this.filter.protocol.multicodec):Xo.error("Filter codec not included in dial codec: protocol not mounted locally")),Xo.info(`Dialing to ${n.toString()} with protocols ${r}`),this.libp2p.dialProtocol(n,s)}async start(){await this.libp2p.start()}async stop(){this.connectionManager.stop(),await this.libp2p.stop()}isStarted(){return"started"==this.libp2p.status}isConnected(){return this.connectionManager.isConnected()}getLocalMultiaddrWithID(){const e=this.libp2p.getMultiaddrs().find((e=>e.toString().match(/127\.0\.0\.1/)));if(!e||""===e.toString())throw"Not listening on localhost";return e+"/p2p/"+this.libp2p.peerId.toString()}}function Zo(e){return null!=e&&"function"==typeof e.then&&"function"==typeof e.catch&&"function"==typeof e.finally}const ei=BigInt(2**32-1),ti=BigInt(32);function ri(e,t=!1){return t?{h:Number(e&ei),l:Number(e>>ti&ei)}:{h:0|Number(e>>ti&ei),l:0|Number(e&ei)}}const ni={fromBig:ri,split:function(e,t=!1){let r=new Uint32Array(e.length),n=new Uint32Array(e.length);for(let s=0;sBigInt(e>>>0)<>>0),shrSH:(e,t,r)=>e>>>r,shrSL:(e,t,r)=>e<<32-r|t>>>r,rotrSH:(e,t,r)=>e>>>r|t<<32-r,rotrSL:(e,t,r)=>e<<32-r|t>>>r,rotrBH:(e,t,r)=>e<<64-r|t>>>r-32,rotrBL:(e,t,r)=>e>>>r-32|t<<64-r,rotr32H:(e,t)=>t,rotr32L:(e,t)=>e,rotlSH:(e,t,r)=>e<>>32-r,rotlSL:(e,t,r)=>t<>>32-r,rotlBH:(e,t,r)=>t<>>64-r,rotlBL:(e,t,r)=>e<>>64-r,add:function(e,t,r,n){const s=(t>>>0)+(n>>>0);return{h:e+r+(s/2**32|0)|0,l:0|s}},add3L:(e,t,r)=>(e>>>0)+(t>>>0)+(r>>>0),add3H:(e,t,r,n)=>t+r+n+(e/2**32|0)|0,add4L:(e,t,r,n)=>(e>>>0)+(t>>>0)+(r>>>0)+(n>>>0),add4H:(e,t,r,n,s)=>t+r+n+s+(e/2**32|0)|0,add5H:(e,t,r,n,s,o)=>t+r+n+s+o+(e/2**32|0)|0,add5L:(e,t,r,n,s)=>(e>>>0)+(t>>>0)+(r>>>0)+(n>>>0)+(s>>>0)},si=ni,[oi,ii]=(()=>si.split(["0x428a2f98d728ae22","0x7137449123ef65cd","0xb5c0fbcfec4d3b2f","0xe9b5dba58189dbbc","0x3956c25bf348b538","0x59f111f1b605d019","0x923f82a4af194f9b","0xab1c5ed5da6d8118","0xd807aa98a3030242","0x12835b0145706fbe","0x243185be4ee4b28c","0x550c7dc3d5ffb4e2","0x72be5d74f27b896f","0x80deb1fe3b1696b1","0x9bdc06a725c71235","0xc19bf174cf692694","0xe49b69c19ef14ad2","0xefbe4786384f25e3","0x0fc19dc68b8cd5b5","0x240ca1cc77ac9c65","0x2de92c6f592b0275","0x4a7484aa6ea6e483","0x5cb0a9dcbd41fbd4","0x76f988da831153b5","0x983e5152ee66dfab","0xa831c66d2db43210","0xb00327c898fb213f","0xbf597fc7beef0ee4","0xc6e00bf33da88fc2","0xd5a79147930aa725","0x06ca6351e003826f","0x142929670a0e6e70","0x27b70a8546d22ffc","0x2e1b21385c26c926","0x4d2c6dfc5ac42aed","0x53380d139d95b3df","0x650a73548baf63de","0x766a0abb3c77b2a8","0x81c2c92e47edaee6","0x92722c851482353b","0xa2bfe8a14cf10364","0xa81a664bbc423001","0xc24b8b70d0f89791","0xc76c51a30654be30","0xd192e819d6ef5218","0xd69906245565a910","0xf40e35855771202a","0x106aa07032bbd1b8","0x19a4c116b8d2d0c8","0x1e376c085141ab53","0x2748774cdf8eeb99","0x34b0bcb5e19b48a8","0x391c0cb3c5c95a63","0x4ed8aa4ae3418acb","0x5b9cca4f7763e373","0x682e6ff3d6b2b8a3","0x748f82ee5defb2fc","0x78a5636f43172f60","0x84c87814a1f0ab72","0x8cc702081a6439ec","0x90befffa23631e28","0xa4506cebde82bde9","0xbef9a3f7b2c67915","0xc67178f2e372532b","0xca273eceea26619c","0xd186b8c721c0c207","0xeada7dd6cde0eb1e","0xf57d4f7fee6ed178","0x06f067aa72176fba","0x0a637dc5a2c898a6","0x113f9804bef90dae","0x1b710b35131c471b","0x28db77f523047d84","0x32caab7b40c72493","0x3c9ebe0a15c9bebc","0x431d67c49c100d4c","0x4cc5d4becb3e42b6","0x597f299cfc657e2a","0x5fcb6fab3ad6faec","0x6c44198c4a475817"].map((e=>BigInt(e)))))(),ai=new Uint32Array(80),ci=new Uint32Array(80);class li extends Vr{constructor(){super(128,64,16,!1),this.Ah=1779033703,this.Al=-205731576,this.Bh=-1150833019,this.Bl=-2067093701,this.Ch=1013904242,this.Cl=-23791573,this.Dh=-1521486534,this.Dl=1595750129,this.Eh=1359893119,this.El=-1377402159,this.Fh=-1694144372,this.Fl=725511199,this.Gh=528734635,this.Gl=-79577749,this.Hh=1541459225,this.Hl=327033209}get(){const{Ah:e,Al:t,Bh:r,Bl:n,Ch:s,Cl:o,Dh:i,Dl:a,Eh:c,El:l,Fh:u,Fl:h,Gh:d,Gl:p,Hh:f,Hl:g}=this;return[e,t,r,n,s,o,i,a,c,l,u,h,d,p,f,g]}set(e,t,r,n,s,o,i,a,c,l,u,h,d,p,f,g){this.Ah=0|e,this.Al=0|t,this.Bh=0|r,this.Bl=0|n,this.Ch=0|s,this.Cl=0|o,this.Dh=0|i,this.Dl=0|a,this.Eh=0|c,this.El=0|l,this.Fh=0|u,this.Fl=0|h,this.Gh=0|d,this.Gl=0|p,this.Hh=0|f,this.Hl=0|g}process(e,t){for(let r=0;r<16;r++,t+=4)ai[r]=e.getUint32(t),ci[r]=e.getUint32(t+=4);for(let e=16;e<80;e++){const t=0|ai[e-15],r=0|ci[e-15],n=si.rotrSH(t,r,1)^si.rotrSH(t,r,8)^si.shrSH(t,r,7),s=si.rotrSL(t,r,1)^si.rotrSL(t,r,8)^si.shrSL(t,r,7),o=0|ai[e-2],i=0|ci[e-2],a=si.rotrSH(o,i,19)^si.rotrBH(o,i,61)^si.shrSH(o,i,6),c=si.rotrSL(o,i,19)^si.rotrBL(o,i,61)^si.shrSL(o,i,6),l=si.add4L(s,c,ci[e-7],ci[e-16]),u=si.add4H(l,n,a,ai[e-7],ai[e-16]);ai[e]=0|u,ci[e]=0|l}let{Ah:r,Al:n,Bh:s,Bl:o,Ch:i,Cl:a,Dh:c,Dl:l,Eh:u,El:h,Fh:d,Fl:p,Gh:f,Gl:g,Hh:y,Hl:m}=this;for(let e=0;e<80;e++){const t=si.rotrSH(u,h,14)^si.rotrSH(u,h,18)^si.rotrBH(u,h,41),b=si.rotrSL(u,h,14)^si.rotrSL(u,h,18)^si.rotrBL(u,h,41),w=u&d^~u&f,v=h&p^~h&g,E=si.add5L(m,b,v,ii[e],ci[e]),S=si.add5H(E,y,t,w,oi[e],ai[e]),A=0|E,_=si.rotrSH(r,n,28)^si.rotrBH(r,n,34)^si.rotrBH(r,n,39),k=si.rotrSL(r,n,28)^si.rotrBL(r,n,34)^si.rotrBL(r,n,39),I=r&s^r&i^s&i,R=n&o^n&a^o&a;y=0|f,m=0|g,f=0|d,g=0|p,d=0|u,p=0|h,({h:u,l:h}=si.add(0|c,0|l,0|S,0|A)),c=0|i,l=0|a,i=0|s,a=0|o,s=0|r,o=0|n;const T=si.add3L(A,k,R);r=si.add3H(T,S,_,I),n=0|T}({h:r,l:n}=si.add(0|this.Ah,0|this.Al,0|r,0|n)),({h:s,l:o}=si.add(0|this.Bh,0|this.Bl,0|s,0|o)),({h:i,l:a}=si.add(0|this.Ch,0|this.Cl,0|i,0|a)),({h:c,l}=si.add(0|this.Dh,0|this.Dl,0|c,0|l)),({h:u,l:h}=si.add(0|this.Eh,0|this.El,0|u,0|h)),({h:d,l:p}=si.add(0|this.Fh,0|this.Fl,0|d,0|p)),({h:f,l:g}=si.add(0|this.Gh,0|this.Gl,0|f,0|g)),({h:y,l:m}=si.add(0|this.Hh,0|this.Hl,0|y,0|m)),this.set(r,n,s,o,i,a,c,l,u,h,d,p,f,g,y,m)}roundClean(){ai.fill(0),ci.fill(0)}destroy(){this.buffer.fill(0),this.set(0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0)}}const ui=$r((()=>new li)),hi=BigInt(0),di=BigInt(1),pi=BigInt(2);function fi(e){return e instanceof Uint8Array||null!=e&&"object"==typeof e&&"Uint8Array"===e.constructor.name}function gi(e){if(!fi(e))throw new Error("Uint8Array expected")}function yi(e,t){if("boolean"!=typeof t)throw new Error(`${e} must be valid boolean, got "${t}".`)}const mi=Array.from({length:256},((e,t)=>t.toString(16).padStart(2,"0")));function bi(e){gi(e);let t="";for(let r=0;r=vi._0&&e<=vi._9?e-vi._0:e>=vi._A&&e<=vi._F?e-(vi._A-10):e>=vi._a&&e<=vi._f?e-(vi._a-10):void 0}function Si(e){if("string"!=typeof e)throw new Error("hex string expected, got "+typeof e);const t=e.length,r=t/2;if(t%2)throw new Error("padded hex string expected, got unpadded hex of length "+t);const n=new Uint8Array(r);for(let t=0,s=0;t"bigint"==typeof e&&hi<=e;function Ni(e,t,r){return Ci(e)&&Ci(t)&&Ci(r)&&t<=e&&e(pi<new Uint8Array(e),Di=e=>Uint8Array.from(e);function Li(e,t,r){if("number"!=typeof e||e<2)throw new Error("hashLen must be a number");if("number"!=typeof t||t<2)throw new Error("qByteLen must be a number");if("function"!=typeof r)throw new Error("hmacFn must be a function");let n=Oi(e),s=Oi(e),o=0;const i=()=>{n.fill(1),s.fill(0),o=0},a=(...e)=>r(s,n,...e),c=(e=Oi())=>{s=a(Di([0]),e),n=a(),0!==e.length&&(s=a(Di([1]),e),n=a())},l=()=>{if(o++>=1e3)throw new Error("drbg: tried 1000 values");let e=0;const r=[];for(;e{let r;for(i(),c(e);!(r=t(l()));)c();return i(),r}}const Bi={bigint:e=>"bigint"==typeof e,function:e=>"function"==typeof e,boolean:e=>"boolean"==typeof e,string:e=>"string"==typeof e,stringOrUint8Array:e=>"string"==typeof e||fi(e),isSafeInteger:e=>Number.isSafeInteger(e),array:e=>Array.isArray(e),field:(e,t)=>t.Fp.isValid(e),hash:e=>"function"==typeof e&&Number.isSafeInteger(e.outputLen)};function Ui(e,t,r={}){const n=(t,r,n)=>{const s=Bi[r];if("function"!=typeof s)throw new Error(`Invalid validator "${r}", expected function`);const o=e[t];if(!(n&&void 0===o||s(o,e)))throw new Error(`Invalid param ${String(t)}=${o} (${typeof o}), expected ${r}`)};for(const[e,r]of Object.entries(t))n(e,r,!1);for(const[e,t]of Object.entries(r))n(e,t,!0);return e}function Mi(e){const t=new WeakMap;return(r,...n)=>{const s=t.get(r);if(void 0!==s)return s;const o=e(r,...n);return t.set(r,o),o}}const Fi=BigInt(0),$i=BigInt(1),Hi=BigInt(2),qi=BigInt(3),Vi=BigInt(4),ji=BigInt(5),Ki=BigInt(8);function zi(e,t){const r=e%t;return r>=Fi?r:t+r}function Gi(e,t,r){if(r<=Fi||t 0");if(r===$i)return Fi;let n=$i;for(;t>Fi;)t&$i&&(n=n*e%r),e=e*e%r,t>>=$i;return n}function Wi(e,t,r){let n=e;for(;t-- >Fi;)n*=n,n%=r;return n}function Yi(e,t){if(e===Fi||t<=Fi)throw new Error(`invert: expected positive integers, got n=${e} mod=${t}`);let r=zi(e,t),n=t,s=Fi,o=$i,i=$i,a=Fi;for(;r!==Fi;){const e=n/r,t=n%r,c=s-i*e,l=o-a*e;n=r,r=t,s=i,o=a,i=c,a=l}if(n!==$i)throw new Error("invert: does not exist");return zi(s,t)}BigInt(9),BigInt(16);const Ji=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function Xi(e,t){const r=void 0!==t?t:e.toString(2).length;return{nBitLength:r,nByteLength:Math.ceil(r/8)}}function Qi(e,t,r=!1,n={}){if(e<=Fi)throw new Error(`Expected Field ORDER > 0, got ${e}`);const{nBitLength:s,nByteLength:o}=Xi(e,t);if(o>2048)throw new Error("Field lengths over 2048 bytes are not supported");const i=function(e){if(e%Vi===qi){const t=(e+$i)/Vi;return function(e,r){const n=e.pow(r,t);if(!e.eql(e.sqr(n),r))throw new Error("Cannot find square root");return n}}if(e%Ki===ji){const t=(e-ji)/Ki;return function(e,r){const n=e.mul(r,Hi),s=e.pow(n,t),o=e.mul(r,s),i=e.mul(e.mul(o,Hi),s),a=e.mul(o,e.sub(i,e.ONE));if(!e.eql(e.sqr(a),r))throw new Error("Cannot find square root");return a}}return function(e){const t=(e-$i)/Hi;let r,n,s;for(r=e-$i,n=0;r%Hi===Fi;r/=Hi,n++);for(s=Hi;szi(t,e),isValid:t=>{if("bigint"!=typeof t)throw new Error("Invalid field element: expected bigint, got "+typeof t);return Fi<=t&&te===Fi,isOdd:e=>(e&$i)===$i,neg:t=>zi(-t,e),eql:(e,t)=>e===t,sqr:t=>zi(t*t,e),add:(t,r)=>zi(t+r,e),sub:(t,r)=>zi(t-r,e),mul:(t,r)=>zi(t*r,e),pow:(e,t)=>function(e,t,r){if(r 0");if(r===Fi)return e.ONE;if(r===$i)return t;let n=e.ONE,s=t;for(;r>Fi;)r&$i&&(n=e.mul(n,s)),s=e.sqr(s),r>>=$i;return n}(a,e,t),div:(t,r)=>zi(t*Yi(r,e),e),sqrN:e=>e*e,addN:(e,t)=>e+t,subN:(e,t)=>e-t,mulN:(e,t)=>e*t,inv:t=>Yi(t,e),sqrt:n.sqrt||(e=>i(a,e)),invertBatch:e=>function(e,t){const r=new Array(t.length),n=t.reduce(((t,n,s)=>e.is0(n)?t:(r[s]=t,e.mul(t,n))),e.ONE),s=e.inv(n);return t.reduceRight(((t,n,s)=>e.is0(n)?t:(r[s]=e.mul(t,r[s]),e.mul(t,n))),s),r}(a,e),cmov:(e,t,r)=>r?t:e,toBytes:e=>r?Ii(e,o):ki(e,o),fromBytes:e=>{if(e.length!==o)throw new Error(`Fp.fromBytes: expected ${o}, got ${e.length}`);return r?_i(e):Ai(e)}});return Object.freeze(a)}function Zi(e){if("bigint"!=typeof e)throw new Error("field order must be bigint");const t=e.toString(2).length;return Math.ceil(t/8)}function ea(e){const t=Zi(e);return t+Math.ceil(t/2)}const ta=BigInt(0),ra=BigInt(1),na=new WeakMap,sa=new WeakMap;function oa(e,t){const r=(e,t)=>{const r=t.negate();return e?r:t},n=e=>{if(!Number.isSafeInteger(e)||e<=0||e>t)throw new Error(`Wrong window size=${e}, should be [1..${t}]`)},s=e=>(n(e),{windows:Math.ceil(t/e)+1,windowSize:2**(e-1)});return{constTimeNegate:r,unsafeLadder(t,r){let n=e.ZERO,s=t;for(;r>ta;)r&ra&&(n=n.add(s)),s=s.double(),r>>=ra;return n},precomputeWindow(e,t){const{windows:r,windowSize:n}=s(t),o=[];let i=e,a=i;for(let e=0;e>=d,s>a&&(s-=h,o+=ra);const i=t,p=t+Math.abs(s)-1,f=e%2!=0,g=s<0;0===s?l=l.add(r(f,n[i])):c=c.add(r(g,n[p]))}return{p:c,f:l}},wNAFCached(e,t,r){const n=sa.get(e)||1;let s=na.get(e);return s||(s=this.precomputeWindow(e,n),1!==n&&na.set(e,r(s))),this.wNAF(n,s,t)},setWindowSize(e,t){n(t),sa.set(e,t),na.delete(e)}}}function ia(e){return function(e){const t=Ji.reduce(((e,t)=>(e[t]="function",e)),{ORDER:"bigint",MASK:"bigint",BYTES:"isSafeInteger",BITS:"isSafeInteger"});Ui(e,t)}(e.Fp),Ui(e,{n:"bigint",h:"bigint",Gx:"field",Gy:"field"},{nBitLength:"isSafeInteger",nByteLength:"isSafeInteger"}),Object.freeze({...Xi(e.n,e.nBitLength),...e,p:e.Fp.ORDER})}const aa=BigInt(0),ca=BigInt(1),la=BigInt(2),ua=BigInt(8),ha={zip215:!0};const da=BigInt(0),pa=BigInt(1);const fa=BigInt("57896044618658097711785492504343953926634992332820282019728792003956564819949"),ga=BigInt("19681161376707505956807079304988542015446066515923890162744021073123829784752"),ya=(BigInt(0),BigInt(1)),ma=BigInt(2),ba=BigInt(3),wa=BigInt(5),va=BigInt(8);function Ea(e){const t=BigInt(10),r=BigInt(20),n=BigInt(40),s=BigInt(80),o=fa,i=e*e%o*e%o,a=Wi(i,ma,o)*i%o,c=Wi(a,ya,o)*e%o,l=Wi(c,wa,o)*c%o,u=Wi(l,t,o)*l%o,h=Wi(u,r,o)*u%o,d=Wi(h,n,o)*h%o,p=Wi(d,s,o)*d%o,f=Wi(p,s,o)*d%o,g=Wi(f,t,o)*l%o;return{pow_p_5_8:Wi(g,ma,o)*e%o,b2:i}}function Sa(e){return e[0]&=248,e[31]&=127,e[31]|=64,e}function Aa(e,t){const r=fa,n=zi(t*t*t,r),s=zi(n*n*t,r);let o=zi(e*n*Ea(e*s).pow_p_5_8,r);const i=zi(t*o*o,r),a=o,c=zi(o*ga,r),l=i===e,u=i===zi(-e,r),h=i===zi(-e*ga,r);return l&&(o=a),(u||h)&&(o=c),(zi(o,r)&$i)===$i&&(o=zi(-o,r)),{isValid:l||u,value:o}}const _a=(()=>Qi(fa,void 0,!0))(),ka=(()=>({a:BigInt(-1),d:BigInt("37095705934669439343138083508754565189542113879843219016388785533085940283555"),Fp:_a,n:BigInt("7237005577332262213973186563042994240857116359379907606001950938285454250989"),h:va,Gx:BigInt("15112221349535400772501151409588531511454012693041857206046113283949847762202"),Gy:BigInt("46316835694926478169428394003475163141307993866256225615783033603165251855960"),hash:ui,randomBytes:Hr,adjustScalarBytes:Sa,uvRatio:Aa}))(),Ia=(()=>function(e){const t=function(e){const t=ia(e);return Ui(e,{hash:"function",a:"bigint",d:"bigint",randomBytes:"function"},{adjustScalarBytes:"function",domain:"function",uvRatio:"function",mapToCurve:"function"}),Object.freeze({...t})}(e),{Fp:r,n,prehash:s,hash:o,randomBytes:i,nByteLength:a,h:c}=t,l=la<{try{return{isValid:!0,value:r.sqrt(e*r.inv(t))}}catch(e){return{isValid:!1,value:aa}}}),d=t.adjustScalarBytes||(e=>e),p=t.domain||((e,t,r)=>{if(yi("phflag",r),t.length||r)throw new Error("Contexts/pre-hash are not supported");return e});function f(e,t){xi("coordinate "+e,t,aa,l)}function g(e){if(!(e instanceof b))throw new Error("ExtendedPoint expected")}const y=Mi(((e,t)=>{const{ex:n,ey:s,ez:o}=e,i=e.is0();null==t&&(t=i?ua:r.inv(o));const a=u(n*t),c=u(s*t),l=u(o*t);if(i)return{x:aa,y:ca};if(l!==ca)throw new Error("invZ was invalid");return{x:a,y:c}})),m=Mi((e=>{const{a:r,d:n}=t;if(e.is0())throw new Error("bad point: ZERO");const{ex:s,ey:o,ez:i,et:a}=e,c=u(s*s),l=u(o*o),h=u(i*i),d=u(h*h),p=u(c*r);if(u(h*u(p+l))!==u(d+u(n*u(c*l))))throw new Error("bad point: equation left != right (1)");if(u(s*o)!==u(i*a))throw new Error("bad point: equation left != right (2)");return!0}));class b{constructor(e,t,r,n){this.ex=e,this.ey=t,this.ez=r,this.et=n,f("x",e),f("y",t),f("z",r),f("t",n),Object.freeze(this)}get x(){return this.toAffine().x}get y(){return this.toAffine().y}static fromAffine(e){if(e instanceof b)throw new Error("extended point not allowed");const{x:t,y:r}=e||{};return f("x",t),f("y",r),new b(t,r,ca,u(t*r))}static normalizeZ(e){const t=r.invertBatch(e.map((e=>e.ez)));return e.map(((e,r)=>e.toAffine(t[r]))).map(b.fromAffine)}_setWindowSize(e){E.setWindowSize(this,e)}assertValidity(){m(this)}equals(e){g(e);const{ex:t,ey:r,ez:n}=this,{ex:s,ey:o,ez:i}=e,a=u(t*i),c=u(s*n),l=u(r*i),h=u(o*n);return a===c&&l===h}is0(){return this.equals(b.ZERO)}negate(){return new b(u(-this.ex),this.ey,this.ez,u(-this.et))}double(){const{a:e}=t,{ex:r,ey:n,ez:s}=this,o=u(r*r),i=u(n*n),a=u(la*u(s*s)),c=u(e*o),l=r+n,h=u(u(l*l)-o-i),d=c+i,p=d-a,f=c-i,g=u(h*p),y=u(d*f),m=u(h*f),w=u(p*d);return new b(g,y,w,m)}add(e){g(e);const{a:r,d:n}=t,{ex:s,ey:o,ez:i,et:a}=this,{ex:c,ey:l,ez:h,et:d}=e;if(r===BigInt(-1)){const e=u((o-s)*(l+c)),t=u((o+s)*(l-c)),r=u(t-e);if(r===aa)return this.double();const n=u(i*la*d),p=u(a*la*h),f=p+n,g=t+e,y=p-n,m=u(f*r),w=u(g*y),v=u(f*y),E=u(r*g);return new b(m,w,E,v)}const p=u(s*c),f=u(o*l),y=u(a*n*d),m=u(i*h),w=u((s+o)*(c+l)-p-f),v=m-y,E=m+y,S=u(f-r*p),A=u(w*v),_=u(E*S),k=u(w*S),I=u(v*E);return new b(A,_,I,k)}subtract(e){return this.add(e.negate())}wNAF(e){return E.wNAFCached(this,e,b.normalizeZ)}multiply(e){const t=e;xi("scalar",t,ca,n);const{p:r,f:s}=this.wNAF(t);return b.normalizeZ([r,s])[0]}multiplyUnsafe(e){const t=e;return xi("scalar",t,aa,n),t===aa?v:this.equals(v)||t===ca?this:this.equals(w)?this.wNAF(t).p:E.unsafeLadder(this,t)}isSmallOrder(){return this.multiplyUnsafe(c).is0()}isTorsionFree(){return E.unsafeLadder(this,n).is0()}toAffine(e){return y(this,e)}clearCofactor(){const{h:e}=t;return e===ca?this:this.multiplyUnsafe(e)}static fromHex(e,n=!1){const{d:s,a:o}=t,i=r.BYTES;e=Ri("pointHex",e,i),yi("zip215",n);const a=e.slice(),c=e[i-1];a[i-1]=-129&c;const d=_i(a),p=n?l:r.ORDER;xi("pointHex.y",d,aa,p);const f=u(d*d),g=u(f-ca),y=u(s*f-o);let{isValid:m,value:w}=h(g,y);if(!m)throw new Error("Point.fromHex: invalid y coordinate");const v=(w&ca)===ca,E=!!(128&c);if(!n&&w===aa&&E)throw new Error("Point.fromHex: x=0 and x_0=1");return E!==v&&(w=u(-w)),b.fromAffine({x:w,y:d})}static fromPrivateKey(e){return _(e).point}toRawBytes(){const{x:e,y:t}=this.toAffine(),n=Ii(t,r.BYTES);return n[n.length-1]|=e&ca?128:0,n}toHex(){return bi(this.toRawBytes())}}b.BASE=new b(t.Gx,t.Gy,ca,u(t.Gx*t.Gy)),b.ZERO=new b(aa,ca,ca,aa);const{BASE:w,ZERO:v}=b,E=oa(b,8*a);function S(e){return zi(e,n)}function A(e){return S(_i(e))}function _(e){const t=a;e=Ri("private key",e,t);const r=Ri("hashed private key",o(e),2*t),n=d(r.slice(0,t)),s=r.slice(t,2*t),i=A(n),c=w.multiply(i),l=c.toRawBytes();return{head:n,prefix:s,scalar:i,point:c,pointBytes:l}}function k(e=new Uint8Array,...t){const r=Ti(...t);return A(o(p(r,Ri("context",e),!!s)))}const I=ha;return w._setWindowSize(8),{CURVE:t,getPublicKey:function(e){return _(e).pointBytes},sign:function(e,t,o={}){e=Ri("message",e),s&&(e=s(e));const{prefix:i,scalar:c,pointBytes:l}=_(t),u=k(o.context,i,e),h=w.multiply(u).toRawBytes(),d=S(u+k(o.context,h,l,e)*c);return xi("signature.s",d,aa,n),Ri("result",Ti(h,Ii(d,r.BYTES)),2*a)},verify:function(e,t,n,o=I){const{context:i,zip215:a}=o,c=r.BYTES;e=Ri("signature",e,2*c),t=Ri("message",t),void 0!==a&&yi("zip215",a),s&&(t=s(t));const l=_i(e.slice(c,2*c));let u,h,d;try{u=b.fromHex(n,a),h=b.fromHex(e.slice(0,c),a),d=w.multiplyUnsafe(l)}catch(e){return!1}if(!a&&u.isSmallOrder())return!1;const p=k(i,h.toRawBytes(),u.toRawBytes(),t);return h.add(u.multiplyUnsafe(p)).subtract(d).clearCofactor().equals(b.ZERO)},ExtendedPoint:b,utils:{getExtendedPublicKey:_,randomPrivateKey:()=>i(r.BYTES),precompute:(e=8,t=b.BASE)=>(t._setWindowSize(e),t.multiply(BigInt(3)),t)}}}(ka))(),Ra=(()=>function(e){const t=(Ui(r=e,{a:"bigint"},{montgomeryBits:"isSafeInteger",nByteLength:"isSafeInteger",adjustScalarBytes:"function",domain:"function",powPminus2:"function",Gu:"bigint"}),Object.freeze({...r}));var r;const{P:n}=t,s=e=>zi(e,n),o=t.montgomeryBits,i=Math.ceil(o/8),a=t.nByteLength,c=t.adjustScalarBytes||(e=>e),l=t.powPminus2||(e=>Gi(e,n-BigInt(2),n));function u(e,t,r){const n=s(e*(t-r));return[t=s(t-n),r=s(r+n)]}const h=(t.a-BigInt(2))/BigInt(4);function d(e){return Ii(s(e),i)}function p(e,t){const r=function(e){const t=Ri("u coordinate",e,i);return 32===a&&(t[31]&=127),_i(t)}(t),p=function(e){const t=Ri("scalar",e),r=t.length;if(r!==i&&r!==a)throw new Error(`Expected ${i} or ${a} bytes, got ${r}`);return _i(c(t))}(e),f=function(e,t){xi("u",e,da,n),xi("scalar",t,da,n);const r=t,i=e;let a,c=pa,d=da,p=e,f=pa,g=da;for(let e=BigInt(o-1);e>=da;e--){const t=r>>e&pa;g^=t,a=u(g,c,p),c=a[0],p=a[1],a=u(g,d,f),d=a[0],f=a[1],g=t;const n=c+d,o=s(n*n),l=c-d,y=s(l*l),m=o-y,b=p+f,w=s((p-f)*n),v=s(b*l),E=w+v,S=w-v;p=s(E*E),f=s(i*s(S*S)),c=s(o*y),d=s(m*(o+s(h*m)))}a=u(g,c,p),c=a[0],p=a[1],a=u(g,d,f),d=a[0],f=a[1];const y=l(d);return s(c*y)}(r,p);if(f===da)throw new Error("Invalid private or public key received");return d(f)}const f=d(t.Gu);function g(e){return p(e,f)}return{scalarMult:p,scalarMultBase:g,getSharedSecret:(e,t)=>p(e,t),getPublicKey:e=>g(e),utils:{randomPrivateKey:()=>t.randomBytes(t.nByteLength)},GuBytes:f}}({P:fa,a:BigInt(486662),montgomeryBits:255,nByteLength:32,Gu:BigInt(9),powPminus2:e=>{const t=fa,{pow_p_5_8:r,b2:n}=Ea(e);return zi(Wi(r,ba,t)*n,t)},adjustScalarBytes:Sa,randomBytes:Hr}))(),Ta=32,Ca=64,Na=32;function xa(e,t){const r=new Uint8Array(Ca);for(let n=0;nSr(Ba)}(La||(La={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.Type&&(t.uint32(8),La.codec().encode(e.Type,t)),null!=e.Data&&(t.uint32(18),t.bytes(e.Data)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t)=>{const r={},n=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:r.Type=La.codec().decode(e);break;case 2:r.Data=e.bytes();break;default:e.skipType(7&t)}}return r}))),t),e.encode=t=>jt(t,e.codec()),e.decode=t=>Y(t,e.codec())}(Ua||(Ua={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.Type&&(t.uint32(8),La.codec().encode(e.Type,t)),null!=e.Data&&(t.uint32(18),t.bytes(e.Data)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t)=>{const r={},n=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:r.Type=La.codec().decode(e);break;case 2:r.Data=e.bytes();break;default:e.skipType(7&t)}}return r}))),t),e.encode=t=>jt(t,e.codec()),e.decode=t=>Y(t,e.codec())}(Ma||(Ma={}));class Fa{_key;constructor(e){this._key=Ka(e,Ta)}verify(e,t){return function(e,t,r){return Ia.verify(t,r instanceof Uint8Array?r:r.subarray(),e)}(this._key,t,e)}marshal(){return this._key}get bytes(){return Ua.encode({Type:La.Ed25519,Data:this.marshal()}).subarray()}equals(e){return Pn(this.bytes,e.bytes)}hash(){const e=gt.digest(this.bytes);return Zo(e)?e.then((({bytes:e})=>e)):e.bytes}}class $a{_key;_publicKey;constructor(e,t){this._key=Ka(e,Ca),this._publicKey=Ka(t,Ta)}sign(e){return function(e,t){const r=e.subarray(0,Na);return Ia.sign(t instanceof Uint8Array?t:t.subarray(),r)}(this._key,e)}get public(){return new Fa(this._publicKey)}marshal(){return this._key}get bytes(){return Ma.encode({Type:La.Ed25519,Data:this.marshal()}).subarray()}equals(e){return Pn(this.bytes,e.bytes)}async hash(){const e=gt.digest(this.bytes);let t;return Zo(e)?({bytes:t}=await e):t=e.bytes,t}async id(){const e=ht.digest(this.public.bytes);return ke.encode(e.bytes).substring(1)}async export(e,t="libp2p-key"){if("libp2p-key"===t)return Da(this.bytes,e);throw new eo(`export format '${t}' is not supported`,"ERR_INVALID_EXPORT_FORMAT")}}function Ha(e){if(e.length>Ca){const t=(e=Ka(e,Ca+Ta)).subarray(0,Ca),r=e.subarray(Ca,e.length);return new $a(t,r)}const t=(e=Ka(e,Ca)).subarray(0,Ca),r=e.subarray(Ta);return new $a(t,r)}function qa(e){return e=Ka(e,Ta),new Fa(e)}async function Va(){const{privateKey:e,publicKey:t}=function(){const e=Ia.utils.randomPrivateKey(),t=Ia.getPublicKey(e);return{privateKey:xa(e,t),publicKey:t}}();return new $a(e,t)}async function ja(e){const{privateKey:t,publicKey:r}=function(e){if(e.length!==Na)throw new TypeError('"seed" must be 32 bytes in length.');if(!(e instanceof Uint8Array))throw new TypeError('"seed" must be a node.js Buffer, or Uint8Array.');const t=e,r=Ia.getPublicKey(t);return{privateKey:xa(t,r),publicKey:r}}(e);return new $a(t,r)}function Ka(e,t){if((e=Uint8Array.from(e??[])).length!==t)throw new eo(`Key must be a Uint8Array of length ${t}, got ${e.length}`,"ERR_INVALID_KEY_TYPE");return e}async function za(e){const t=[await Pa.get().subtle.importKey("jwk",e,{name:"RSASSA-PKCS1-v1_5",hash:{name:"SHA-256"}},!0,["sign"]),await Wa(e)],r=await Ga({privateKey:t[0],publicKey:t[1]});return{privateKey:r[0],publicKey:r[1]}}async function Ga(e){if(null==e.privateKey||null==e.publicKey)throw new eo("Private and public key are required","ERR_INVALID_PARAMETERS");return Promise.all([Pa.get().subtle.exportKey("jwk",e.privateKey),Pa.get().subtle.exportKey("jwk",e.publicKey)])}async function Wa(e){return Pa.get().subtle.importKey("jwk",{kty:e.kty,n:e.n,e:e.e},{name:"RSASSA-PKCS1-v1_5",hash:{name:"SHA-256"}},!0,["verify"])}function Ya(e){if("RSA"!==e.kty)throw new eo("invalid key type","ERR_INVALID_KEY_TYPE");if(null==e.n)throw new eo("invalid key modulus","ERR_INVALID_KEY_MODULUS");return 8*Nt(e.n,"base64url").length}class Ja extends Mr{constructor(e,t){super(),this.finished=!1,this.destroyed=!1,Nr(e);const r=Ur(t);if(this.iHash=e.create(),"function"!=typeof this.iHash.update)throw new Error("Expected instance of class which extends utils.Hash");this.blockLen=this.iHash.blockLen,this.outputLen=this.iHash.outputLen;const n=this.blockLen,s=new Uint8Array(n);s.set(r.length>n?e.create().update(r).digest():r);for(let e=0;enew Ja(e,t).update(r).digest();Xa.create=(e,t)=>new Ja(e,t);var Qa=__webpack_require__(152);function Za(e,t){let r=0;if(1===e.length)return e[0];for(let n=e.length-1;n>=0;n--)r+=e[e.length-1-n]*Math.pow(2,t*n);return r}function ec(e,t,r=-1){const n=r;let s=e,o=0,i=Math.pow(2,t);for(let r=1;r<8;r++){if(e=0;e--){const r=Math.pow(2,e*t);i[o-e-1]=Math.floor(s/r),s-=i[o-e-1]*r}return e}i*=Math.pow(2,t)}return new ArrayBuffer(0)}function tc(...e){let t=0,r=0;for(const r of e)t+=r.length;const n=new ArrayBuffer(t),s=new Uint8Array(n);for(const t of e)s.set(t,r),r+=t.length;return s}function rc(){const e=new Uint8Array(this.valueHex);if(this.valueHex.byteLength>=2){const t=255===e[0]&&128&e[1],r=0===e[0]&&!(128&e[1]);(t||r)&&this.warnings.push("Needlessly long format")}const t=new ArrayBuffer(this.valueHex.byteLength),r=new Uint8Array(t);for(let e=0;e=s.length)return this.error="End of input reached before message was fully decoded",-1;if(e===r){r+=255;const e=new Uint8Array(r);for(let r=0;r8)return this.error="Too big integer",-1;if(o+1>s.length)return this.error="End of input reached before message was fully decoded",-1;const i=t+1,a=n.subarray(i,i+o);return 0===a[o-1]&&this.warnings.push("Needlessly long encoded length"),this.length=Za(a,8),this.longFormUsed&&this.length<=127&&this.warnings.push("Unnecessary usage of long length form"),this.blockLength=o+1,t+this.blockLength}toBER(e=!1){let t,r;if(this.length>127&&(this.longFormUsed=!0),this.isIndefiniteForm)return t=new ArrayBuffer(1),!1===e&&(r=new Uint8Array(t),r[0]=128),t;if(this.longFormUsed){const n=ec(this.length,8);if(n.byteLength>127)return this.error="Too big length",hc;if(t=new ArrayBuffer(n.byteLength+1),e)return t;const s=new Uint8Array(n);r=new Uint8Array(t),r[0]=128|n.byteLength;for(let e=0;e=37&&!1===s.idBlock.isHexOnly)return s.error="UNIVERSAL 37 and upper tags are reserved by ASN.1 standard",{offset:-1,result:s};switch(s.idBlock.tagNumber){case 0:if(s.idBlock.isConstructed&&s.lenBlock.length>0)return s.error="Type [UNIVERSAL 0] is reserved",{offset:-1,result:s};a=Ec.EndOfContent;break;case 1:a=Ec.Boolean;break;case 2:a=Ec.Integer;break;case 3:a=Ec.BitString;break;case 4:a=Ec.OctetString;break;case 5:a=Ec.Null;break;case 6:a=Ec.ObjectIdentifier;break;case 10:a=Ec.Enumerated;break;case 12:a=Ec.Utf8String;break;case 13:a=Ec.RelativeObjectIdentifier;break;case 14:a=Ec.TIME;break;case 15:return s.error="[UNIVERSAL 15] is reserved by ASN.1 standard",{offset:-1,result:s};case 16:a=Ec.Sequence;break;case 17:a=Ec.Set;break;case 18:a=Ec.NumericString;break;case 19:a=Ec.PrintableString;break;case 20:a=Ec.TeletexString;break;case 21:a=Ec.VideotexString;break;case 22:a=Ec.IA5String;break;case 23:a=Ec.UTCTime;break;case 24:a=Ec.GeneralizedTime;break;case 25:a=Ec.GraphicString;break;case 26:a=Ec.VisibleString;break;case 27:a=Ec.GeneralString;break;case 28:a=Ec.UniversalString;break;case 29:a=Ec.CharacterString;break;case 30:a=Ec.BmpString;break;case 31:a=Ec.DATE;break;case 32:a=Ec.TimeOfDay;break;case 33:a=Ec.DateTime;break;case 34:a=Ec.Duration;break;default:{const e=s.idBlock.isConstructed?new Ec.Constructed:new Ec.Primitive;e.idBlock=s.idBlock,e.lenBlock=s.lenBlock,e.warnings=s.warnings,s=e}}}else a=s.idBlock.isConstructed?Ec.Constructed:Ec.Primitive;return s=function(e,t){if(e instanceof t)return e;const r=new t;return r.idBlock=e.idBlock,r.lenBlock=e.lenBlock,r.warnings=e.warnings,r.valueBeforeDecodeView=e.valueBeforeDecodeView,r}(s,a),i=s.fromBER(e,t,s.lenBlock.isIndefiniteForm?r:s.lenBlock.length),s.valueBeforeDecodeView=e.subarray(n,n+s.blockLength),{offset:i,result:s}}function al(e){if(!e.byteLength){const e=new Sc({},bc);return e.error="Input buffer has zero length",{offset:-1,result:e}}return il(Qa._H.toUint8Array(e).slice(),0,e.byteLength)}Ic=ol,Ec.Primitive=Ic,ol.NAME="PRIMITIVE";class cl extends bc{constructor({value:e=[],isIndefiniteForm:t=!1,...r}={}){super(r),this.value=e,this.isIndefiniteForm=t}fromBER(e,t,r){const n=Qa._H.toUint8Array(e);if(!ic(this,n,t,r))return-1;if(this.valueBeforeDecodeView=n.subarray(t,t+r),0===this.valueBeforeDecodeView.length)return this.warnings.push("Zero buffer length"),t;let s=t;for(;(this.isIndefiniteForm?1:r)>0;){const e=il(n,s,r);if(-1===e.offset)return this.error=e.result.error,this.warnings.concat(e.result.warnings),-1;if(s=e.offset,this.blockLength+=e.result.blockLength,r-=e.result.blockLength,this.value.push(e.result),this.isIndefiniteForm&&e.result.constructor.NAME===pc)break}return this.isIndefiniteForm&&(this.value[this.value.length-1].constructor.NAME===pc?this.value.pop():this.warnings.push("No EndOfContent block encoded")),s}toBER(e,t){const r=t||new ac;for(let t=0;t` ${e}`)).join("\n"));const t=3===this.idBlock.tagClass?`[${this.idBlock.tagNumber}]`:this.constructor.NAME;return e.length?`${t} :\n${e.join("\n")}`:`${t} :`}}Rc=ll,Ec.Constructed=Rc,ll.NAME="CONSTRUCTED";class ul extends bc{fromBER(e,t,r){return t}toBER(e){return hc}}ul.override="EndOfContentValueBlock";class hl extends Sc{constructor(e={}){super(e,ul),this.idBlock.tagClass=1,this.idBlock.tagNumber=0}}Tc=hl,Ec.EndOfContent=Tc,hl.NAME=pc;class dl extends Sc{constructor(e={}){super(e,bc),this.idBlock.tagClass=1,this.idBlock.tagNumber=5}fromBER(e,t,r){return this.lenBlock.length>0&&this.warnings.push("Non-zero length of value block for Null type"),this.idBlock.error.length||(this.blockLength+=this.idBlock.blockLength),this.lenBlock.error.length||(this.blockLength+=this.lenBlock.blockLength),this.blockLength+=r,t+r>e.byteLength?(this.error="End of input reached before message was fully decoded (inconsistent offset and length values)",-1):t+r}toBER(e,t){const r=new ArrayBuffer(2);if(!e){const e=new Uint8Array(r);e[0]=5,e[1]=0}return t&&t.write(r),r}onAsciiEncoding(){return`${this.constructor.NAME}`}}Cc=dl,Ec.Null=Cc,dl.NAME="NULL";class pl extends(yc(bc)){constructor({value:e,...t}={}){super(t),t.valueHex?this.valueHexView=Qa._H.toUint8Array(t.valueHex):this.valueHexView=new Uint8Array(1),e&&(this.value=e)}get value(){for(const e of this.valueHexView)if(e>0)return!0;return!1}set value(e){this.valueHexView[0]=e?255:0}fromBER(e,t,r){const n=Qa._H.toUint8Array(e);return ic(this,n,t,r)?(this.valueHexView=n.subarray(t,t+r),r>1&&this.warnings.push("Boolean value encoded in more then 1 octet"),this.isHexOnly=!0,rc.call(this),this.blockLength=r,t+r):-1}toBER(){return this.valueHexView.slice()}toJSON(){return{...super.toJSON(),value:this.value}}}pl.NAME="BooleanValueBlock";class fl extends Sc{constructor(e={}){super(e,pl),this.idBlock.tagClass=1,this.idBlock.tagNumber=1}getValue(){return this.valueBlock.value}setValue(e){this.valueBlock.value=e}onAsciiEncoding(){return`${this.constructor.NAME} : ${this.getValue}`}}Nc=fl,Ec.Boolean=Nc,fl.NAME="BOOLEAN";class gl extends(yc(cl)){constructor({isConstructed:e=!1,...t}={}){super(t),this.isConstructed=e}fromBER(e,t,r){let n=0;if(this.isConstructed){if(this.isHexOnly=!1,n=cl.prototype.fromBER.call(this,e,t,r),-1===n)return n;for(let e=0;e0&&r.unusedBits>0)return this.error='Using of "unused bits" inside constructive BIT STRING allowed for least one only',-1;this.unusedBits=r.unusedBits}return n}const s=Qa._H.toUint8Array(e);if(!ic(this,s,t,r))return-1;const o=s.subarray(t,t+r);if(this.unusedBits=o[0],this.unusedBits>7)return this.error="Unused bits for BitString must be in range 0-7",-1;if(!this.unusedBits){const e=o.subarray(1);try{if(e.byteLength){const t=il(e,0,e.byteLength);-1!==t.offset&&t.offset===r-1&&(this.value=[t.result])}}catch(e){}}return this.valueHexView=o.subarray(1),this.blockLength=o.length,t+r}toBER(e,t){if(this.isConstructed)return cl.prototype.toBER.call(this,e,t);if(e)return new ArrayBuffer(this.valueHexView.byteLength+1);if(!this.valueHexView.byteLength)return hc;const r=new Uint8Array(this.valueHexView.length+1);return r[0]=this.unusedBits,r.set(this.valueHexView,1),r.buffer}toJSON(){return{...super.toJSON(),unusedBits:this.unusedBits,isConstructed:this.isConstructed}}}ml.NAME="BitStringValueBlock";class bl extends Sc{constructor({idBlock:e={},lenBlock:t={},...r}={}){var n,s;null!==(n=r.isConstructed)&&void 0!==n||(r.isConstructed=!!(null===(s=r.value)||void 0===s?void 0:s.length)),super({idBlock:{isConstructed:r.isConstructed,...e},lenBlock:{...t,isIndefiniteForm:!!r.isIndefiniteForm},...r},ml),this.idBlock.tagClass=1,this.idBlock.tagNumber=3}fromBER(e,t,r){return this.valueBlock.isConstructed=this.idBlock.isConstructed,this.valueBlock.isIndefiniteForm=this.lenBlock.isIndefiniteForm,super.fromBER(e,t,r)}onAsciiEncoding(){if(this.valueBlock.isConstructed||this.valueBlock.value&&this.valueBlock.value.length)return ll.prototype.onAsciiEncoding.call(this);{const e=[],t=this.valueBlock.valueHexView;for(const r of t)e.push(r.toString(2).padStart(8,"0"));const r=e.join("");return`${this.constructor.NAME} : ${r.substring(0,r.length-this.valueBlock.unusedBits)}`}}}function wl(e,t){const r=new Uint8Array([0]),n=new Uint8Array(e),s=new Uint8Array(t);let o=n.slice(0);const i=o.length-1,a=s.slice(0),c=a.length-1;let l=0,u=0;for(let e=c=0;e--,u++)l=1==u=o.length?o=tc(new Uint8Array([l%10]),o):o[i-u]=l%10;return r[0]>0&&(o=tc(r,o)),o}function vl(e){if(e>=cc.length)for(let t=cc.length;t<=e;t++){const e=new Uint8Array([0]);let r=cc[t-1].slice(0);for(let t=r.length-1;t>=0;t--){const n=new Uint8Array([(r[t]<<1)+e[0]]);e[0]=n[0]/10,r[t]=n[0]%10}e[0]>0&&(r=tc(e,r)),cc.push(r)}return cc[e]}function El(e,t){let r=0;const n=new Uint8Array(e),s=new Uint8Array(t),o=n.slice(0),i=o.length-1,a=s.slice(0),c=a.length-1;let l,u=0;for(let e=c;e>=0;e--,u++)l=o[i-u]-a[c-u]-r,1==l<0?(r=1,o[i-u]=l+10):(r=0,o[i-u]=l);if(r>0)for(let e=i-c+1;e>=0;e--,u++){if(l=o[i-u]-r,!(l<0)){r=0,o[i-u]=l;break}r=1,o[i-u]=l+10}return o.slice()}Pc=bl,Ec.BitString=Pc,bl.NAME=gc;class Sl extends(yc(bc)){constructor({value:e,...t}={}){super(t),this._valueDec=0,t.valueHex&&this.setValueHex(),void 0!==e&&(this.valueDec=e)}setValueHex(){this.valueHexView.length>=4?(this.warnings.push("Too big Integer for decoding, hex only"),this.isHexOnly=!0,this._valueDec=0):(this.isHexOnly=!1,this.valueHexView.length>0&&(this._valueDec=rc.call(this)))}set valueDec(e){this._valueDec=e,this.isHexOnly=!1,this.valueHexView=new Uint8Array(function(e){const t=e<0?-1*e:e;let r=128;for(let n=1;n<8;n++){if(t<=r){if(e<0){const e=ec(r-t,8,n);return new Uint8Array(e)[0]|=128,e}let s=ec(t,8,n),o=new Uint8Array(s);if(128&o[0]){const e=s.slice(0),t=new Uint8Array(e);s=new ArrayBuffer(s.byteLength+1),o=new Uint8Array(s);for(let r=0;r1&&(n=o.length+1),this.valueHexView=o.subarray(n-o.length)),s}toDER(e=!1){const t=this.valueHexView;switch(!0){case!!(128&t[0]):{const e=new Uint8Array(this.valueHexView.length+1);e[0]=0,e.set(t,1),this.valueHexView=e}break;case 0===t[0]&&!(128&t[1]):this.valueHexView=this.valueHexView.subarray(1)}return this.toBER(e)}fromBER(e,t,r){const n=super.fromBER(e,t,r);return-1===n||this.setValueHex(),n}toBER(e){return e?new ArrayBuffer(this.valueHexView.length):this.valueHexView.slice().buffer}toJSON(){return{...super.toJSON(),valueDec:this.valueDec}}toString(){const e=8*this.valueHexView.length-1;let t,r=new Uint8Array(8*this.valueHexView.length/3),n=0;const s=this.valueHexView;let o="",i=!1;for(let i=s.byteLength-1;i>=0;i--){t=s[i];for(let s=0;s<8;s++)1&~t||(n===e?(r=El(vl(n),r),o="-"):r=wl(r,vl(n))),n++,t>>=1}for(let e=0;e0;){const t=new kl;if(n=t.fromBER(e,n,r),-1===n)return this.blockLength=0,this.error=t.error,n;0===this.value.length&&(t.isFirstSid=!0),this.blockLength+=t.blockLength,r-=t.blockLength,this.value.push(t)}return n}toBER(e){const t=[];for(let r=0;rNumber.MAX_SAFE_INTEGER){sc();const t=BigInt(n);e.valueBigInt=t}else if(e.valueDec=parseInt(n,10),isNaN(e.valueDec))return;this.value.length||(e.isFirstSid=!0,s=!0),this.value.push(e)}}while(-1!==r)}toString(){let e="",t=!1;for(let r=0;r0;){const t=new Tl;if(n=t.fromBER(e,n,r),-1===n)return this.blockLength=0,this.error=t.error,n;this.blockLength+=t.blockLength,r-=t.blockLength,this.value.push(t)}return n}toBER(e,t){const r=[];for(let t=0;t4)continue;const o=4-s.length;for(let e=s.length-1;e>=0;e--)r[4*n+e+o]=s[e]}this.valueBlock.value=e}}$l.NAME="UniversalStringValueBlock";class Hl extends $l{constructor({...e}={}){super(e),this.idBlock.tagClass=1,this.idBlock.tagNumber=28}}qc=Hl,Ec.UniversalString=qc,Hl.NAME="UniversalString";class ql extends Ll{constructor(e={}){super(e),this.idBlock.tagClass=1,this.idBlock.tagNumber=18}}Vc=ql,Ec.NumericString=Vc,ql.NAME="NumericString";class Vl extends Ll{constructor(e={}){super(e),this.idBlock.tagClass=1,this.idBlock.tagNumber=19}}jc=Vl,Ec.PrintableString=jc,Vl.NAME="PrintableString";class jl extends Ll{constructor(e={}){super(e),this.idBlock.tagClass=1,this.idBlock.tagNumber=20}}Kc=jl,Ec.TeletexString=Kc,jl.NAME="TeletexString";class Kl extends Ll{constructor(e={}){super(e),this.idBlock.tagClass=1,this.idBlock.tagNumber=21}}zc=Kl,Ec.VideotexString=zc,Kl.NAME="VideotexString";class zl extends Ll{constructor(e={}){super(e),this.idBlock.tagClass=1,this.idBlock.tagNumber=22}}Gc=zl,Ec.IA5String=Gc,zl.NAME="IA5String";class Gl extends Ll{constructor(e={}){super(e),this.idBlock.tagClass=1,this.idBlock.tagNumber=25}}Wc=Gl,Ec.GraphicString=Wc,Gl.NAME="GraphicString";class Wl extends Ll{constructor(e={}){super(e),this.idBlock.tagClass=1,this.idBlock.tagNumber=26}}Yc=Wl,Ec.VisibleString=Yc,Wl.NAME="VisibleString";class Yl extends Ll{constructor(e={}){super(e),this.idBlock.tagClass=1,this.idBlock.tagNumber=27}}Jc=Yl,Ec.GeneralString=Jc,Yl.NAME="GeneralString";class Jl extends Ll{constructor(e={}){super(e),this.idBlock.tagClass=1,this.idBlock.tagNumber=29}}Xc=Jl,Ec.CharacterString=Xc,Jl.NAME="CharacterString";class Xl extends Wl{constructor({value:e,valueDate:t,...r}={}){if(super(r),this.year=0,this.month=0,this.day=0,this.hour=0,this.minute=0,this.second=0,e){this.fromString(e),this.valueBlock.valueHexView=new Uint8Array(e.length);for(let t=0;t=50?1900+r:2e3+r,this.month=parseInt(t[2],10),this.day=parseInt(t[3],10),this.hour=parseInt(t[4],10),this.minute=parseInt(t[5],10),this.second=parseInt(t[6],10)}toString(e="iso"){if("iso"===e){const e=new Array(7);return e[0]=nc(this.year<2e3?this.year-1900:this.year-2e3,2),e[1]=nc(this.month,2),e[2]=nc(this.day,2),e[3]=nc(this.hour,2),e[4]=nc(this.minute,2),e[5]=nc(this.second,2),e[6]="Z",e.join("")}return super.toString(e)}onAsciiEncoding(){return`${this.constructor.NAME} : ${this.toDate().toISOString()}`}toJSON(){return{...super.toJSON(),year:this.year,month:this.month,day:this.day,hour:this.hour,minute:this.minute,second:this.second}}}Qc=Xl,Ec.UTCTime=Qc,Xl.NAME="UTCTime";class Ql extends Xl{constructor(e={}){var t;super(e),null!==(t=this.millisecond)&&void 0!==t||(this.millisecond=0),this.idBlock.tagClass=1,this.idBlock.tagNumber=24}fromDate(e){super.fromDate(e),this.millisecond=e.getUTCMilliseconds()}toDate(){return new Date(Date.UTC(this.year,this.month-1,this.day,this.hour,this.minute,this.second,this.millisecond))}fromString(e){let t,r=!1,n="",s="",o=0,i=0,a=0;if("Z"===e[e.length-1])n=e.substring(0,e.length-1),r=!0;else{const t=new Number(e[e.length-1]);if(isNaN(t.valueOf()))throw new Error("Wrong input string for conversion");n=e}if(r){if(-1!==n.indexOf("+"))throw new Error("Wrong input string for conversion");if(-1!==n.indexOf("-"))throw new Error("Wrong input string for conversion")}else{let e=1,t=n.indexOf("+"),r="";if(-1===t&&(t=n.indexOf("-"),e=-1),-1!==t){if(r=n.substring(t+1),n=n.substring(0,t),2!==r.length&&4!==r.length)throw new Error("Wrong input string for conversion");let s=parseInt(r.substring(0,2),10);if(isNaN(s.valueOf()))throw new Error("Wrong input string for conversion");if(i=e*s,4===r.length){if(s=parseInt(r.substring(2,4),10),isNaN(s.valueOf()))throw new Error("Wrong input string for conversion");a=e*s}}}let c=n.indexOf(".");if(-1===c&&(c=n.indexOf(",")),-1!==c){const e=new Number(`0${n.substring(c)}`);if(isNaN(e.valueOf()))throw new Error("Wrong input string for conversion");o=e.valueOf(),s=n.substring(0,c)}else s=n;switch(!0){case 8===s.length:if(t=/(\d{4})(\d{2})(\d{2})/gi,-1!==c)throw new Error("Wrong input string for conversion");break;case 10===s.length:if(t=/(\d{4})(\d{2})(\d{2})(\d{2})/gi,-1!==c){let e=60*o;this.minute=Math.floor(e),e=60*(e-this.minute),this.second=Math.floor(e),e=1e3*(e-this.second),this.millisecond=Math.floor(e)}break;case 12===s.length:if(t=/(\d{4})(\d{2})(\d{2})(\d{2})(\d{2})/gi,-1!==c){let e=60*o;this.second=Math.floor(e),e=1e3*(e-this.second),this.millisecond=Math.floor(e)}break;case 14===s.length:if(t=/(\d{4})(\d{2})(\d{2})(\d{2})(\d{2})(\d{2})/gi,-1!==c){const e=1e3*o;this.millisecond=Math.floor(e)}break;default:throw new Error("Wrong input string for conversion")}const l=t.exec(s);if(null===l)throw new Error("Wrong input string for conversion");for(let e=1;e0&&(t=`0${t}`);const r=t.length/2,n=new Uint8Array(r);let s=0,o=0;for(;s0&&(r=`0${r}`),t.push(r)})),BigInt("0x"+t.join(""))}sl=nu,Ec.TIME=sl,nu.NAME="TIME";async function au(e,t){const r=Pa.get(),n=new xl({value:[new Al({value:0}),new xl({value:[new Rl({value:"1.2.840.113549.1.1.1"}),new dl]}),new yl({valueHex:e.marshal()})]}).toBER(),s=new Uint8Array(n,0,n.byteLength),o=su(16),i=await async function(e,t,r,n){const{c:s,dkLen:o,asyncTick:i,DK:a,PRF:c,PRFSalt:l}=function(e,t,r,n){Nr(e);const s=function(e,t){if(void 0!==t&&"[object Object]"!==Fr.call(t))throw new Error("Options should be object or undefined");return Object.assign({dkLen:32,asyncTick:10},t)}(0,n),{c:o,dkLen:i,asyncTick:a}=s;if(Tr(o),Tr(i),Tr(a),o<1)throw new Error("PBKDF2: iterations (c) should be >= 1");const c=Ur(t),l=Ur(r),u=new Uint8Array(i),h=Xa.create(e,c),d=h._cloneInto().update(l);return{c:o,dkLen:i,asyncTick:a,DK:u,PRF:h,PRFSalt:d}}(e,t,r,n);let u;const h=new Uint8Array(4),d=Or(h),p=new Uint8Array(c.outputLen);for(let e=1,t=0;t{c._cloneInto(u).update(p).digestInto(p);for(let e=0;ee)):e.bytes}}class uu{_key;_publicKey;constructor(e,t){this._key=e,this._publicKey=t}genSecret(){return su(16)}sign(e){return async function(e,t){const r=await Pa.get().subtle.importKey("jwk",e,{name:"RSASSA-PKCS1-v1_5",hash:{name:"SHA-256"}},!1,["sign"]),n=await Pa.get().subtle.sign({name:"RSASSA-PKCS1-v1_5"},r,t instanceof Uint8Array?t:t.subarray());return new Uint8Array(n,0,n.byteLength)}(this._key,e)}get public(){if(null==this._publicKey)throw new eo("public key not provided","ERR_PUBKEY_NOT_PROVIDED");return new lu(this._publicKey)}marshal(){return function(e){if(null==e.n||null==e.e||null==e.d||null==e.p||null==e.q||null==e.dp||null==e.dq||null==e.qi)throw new eo("JWK was missing components","ERR_INVALID_PARAMETERS");const t=new xl({value:[new Al({value:0}),Al.fromBigInt(iu(Nt(e.n,"base64url"))),Al.fromBigInt(iu(Nt(e.e,"base64url"))),Al.fromBigInt(iu(Nt(e.d,"base64url"))),Al.fromBigInt(iu(Nt(e.p,"base64url"))),Al.fromBigInt(iu(Nt(e.q,"base64url"))),Al.fromBigInt(iu(Nt(e.dp,"base64url"))),Al.fromBigInt(iu(Nt(e.dq,"base64url"))),Al.fromBigInt(iu(Nt(e.qi,"base64url")))]}).toBER();return new Uint8Array(t,0,t.byteLength)}(this._key)}get bytes(){return Ma.encode({Type:La.RSA,Data:this.marshal()}).subarray()}equals(e){return Pn(this.bytes,e.bytes)}hash(){const e=gt.digest(this.bytes);return Zo(e)?e.then((({bytes:e})=>e)):e.bytes}async id(){return sn(await this.public.hash(),"base58btc")}async export(e,t="pkcs-8"){if("pkcs-8"===t)return au(this,e);if("libp2p-key"===t)return Da(this.bytes,e);throw new eo(`export format '${t}' is not supported`,"ERR_INVALID_EXPORT_FORMAT")}}async function hu(e){const t=function(e){const{result:t}=al(e),r=t.valueBlock.value;return{n:sn(ou(r[1].toBigInt()),"base64url"),e:sn(ou(r[2].toBigInt()),"base64url"),d:sn(ou(r[3].toBigInt()),"base64url"),p:sn(ou(r[4].toBigInt()),"base64url"),q:sn(ou(r[5].toBigInt()),"base64url"),dp:sn(ou(r[6].toBigInt()),"base64url"),dq:sn(ou(r[7].toBigInt()),"base64url"),qi:sn(ou(r[8].toBigInt()),"base64url"),kty:"RSA",alg:"RS256"}}(e);if(Ya(t)>cu)throw new eo("key size is too large","ERR_KEY_SIZE_TOO_LARGE");const r=await za(t);return new uu(r.privateKey,r.publicKey)}function du(e){const t=function(e){const{result:t}=al(e),r=t.valueBlock.value[1].valueBlock.value[0].valueBlock.value;return{kty:"RSA",n:sn(ou(r[0].toBigInt()),"base64url"),e:sn(ou(r[1].toBigInt()),"base64url")}}(e);if(Ya(t)>cu)throw new eo("key size is too large","ERR_KEY_SIZE_TOO_LARGE");return new lu(t)}async function pu(e){if(Ya(e)>cu)throw new eo("key size is too large","ERR_KEY_SIZE_TOO_LARGE");const t=await za(e);return new uu(t.privateKey,t.publicKey)}async function fu(e){if(e>cu)throw new eo("key size is too large","ERR_KEY_SIZE_TOO_LARGE");const t=await async function(e){const t=await Pa.get().subtle.generateKey({name:"RSASSA-PKCS1-v1_5",modulusLength:e,publicExponent:new Uint8Array([1,0,1]),hash:{name:"SHA-256"}},!0,["sign","verify"]),r=await Ga(t);return{privateKey:r[0],publicKey:r[1]}}(e);return new uu(t.privateKey,t.publicKey)}function gu(e){void 0!==e.lowS&&yi("lowS",e.lowS),void 0!==e.prehash&&yi("prehash",e.prehash)}const{Ph:yu,aT:mu}=f,bu={Err:class extends Error{constructor(e=""){super(e)}},_parseInt(e){const{Err:t}=bu;if(e.length<2||2!==e[0])throw new t("Invalid signature integer tag");const r=e[1],n=e.subarray(2,r+2);if(!r||n.length!==r)throw new t("Invalid signature integer: wrong length");if(128&n[0])throw new t("Invalid signature integer: negative");if(0===n[0]&&!(128&n[1]))throw new t("Invalid signature integer: unnecessary leading zero");return{d:yu(n),l:e.subarray(r+2)}},toSig(e){const{Err:t}=bu,r="string"==typeof e?mu(e):e;gi(r);let n=r.length;if(n<2||48!=r[0])throw new t("Invalid signature tag");if(r[1]!==n-2)throw new t("Invalid signature: incorrect length");const{d:s,l:o}=bu._parseInt(r.subarray(2)),{d:i,l:a}=bu._parseInt(o);if(a.length)throw new t("Invalid signature: left bytes after parsing");return{r:s,s:i}},hexFromSig(e){const t=e=>8&Number.parseInt(e[0],16)?"00"+e:e,r=e=>{const t=e.toString(16);return 1&t.length?`0${t}`:t},n=t(r(e.s)),s=t(r(e.r)),o=n.length/2,i=s.length/2,a=r(o),c=r(i);return`30${r(i+o+4)}02${c}${s}02${a}${n}`}},wu=BigInt(0),vu=BigInt(1),Eu=(BigInt(2),BigInt(3));function Su(e){const t=function(e){const t=ia(e);return Ui(t,{hash:"hash",hmac:"function",randomBytes:"function"},{bits2int:"function",bits2int_modN:"function",lowS:"boolean"}),Object.freeze({lowS:!0,...t})}(e),{Fp:r,n}=t,s=r.BYTES+1,o=2*r.BYTES+1;function i(e){return zi(e,n)}function a(e){return Yi(e,n)}const{ProjectivePoint:c,normPrivateKeyToScalar:l,weierstrassEquation:u,isWithinCurveOrder:h}=function(e){const t=function(e){const t=ia(e);Ui(t,{a:"field",b:"field"},{allowedPrivateKeyLengths:"array",wrapPrivateKey:"boolean",isTorsionFree:"function",clearCofactor:"function",allowInfinityPoint:"boolean",fromBytes:"function",toBytes:"function"});const{endo:r,Fp:n,a:s}=t;if(r){if(!n.eql(s,n.ZERO))throw new Error("Endomorphism can only be defined for Koblitz curves that have a=0");if("object"!=typeof r||"bigint"!=typeof r.beta||"function"!=typeof r.splitScalar)throw new Error("Expected endomorphism with beta: bigint and splitScalar: function")}return Object.freeze({...t})}(e),{Fp:r}=t,n=t.toBytes||((e,t,n)=>{const s=t.toAffine();return Ti(Uint8Array.from([4]),r.toBytes(s.x),r.toBytes(s.y))}),s=t.fromBytes||(e=>{const t=e.subarray(1);return{x:r.fromBytes(t.subarray(0,r.BYTES)),y:r.fromBytes(t.subarray(r.BYTES,2*r.BYTES))}});function o(e){const{a:n,b:s}=t,o=r.sqr(e),i=r.mul(o,e);return r.add(r.add(i,r.mul(e,n)),s)}if(!r.eql(r.sqr(t.Gy),o(t.Gx)))throw new Error("bad generator point: equation left != right");function i(e){const{allowedPrivateKeyLengths:r,nByteLength:n,wrapPrivateKey:s,n:o}=t;if(r&&"bigint"!=typeof e){if(fi(e)&&(e=bi(e)),"string"!=typeof e||!r.includes(e.length))throw new Error("Invalid key");e=e.padStart(2*n,"0")}let i;try{i="bigint"==typeof e?e:Ai(Ri("private key",e,n))}catch(t){throw new Error(`private key must be ${n} bytes, hex or bigint, not ${typeof e}`)}return s&&(i=zi(i,o)),xi("private key",i,vu,o),i}function a(e){if(!(e instanceof u))throw new Error("ProjectivePoint expected")}const c=Mi(((e,t)=>{const{px:n,py:s,pz:o}=e;if(r.eql(o,r.ONE))return{x:n,y:s};const i=e.is0();null==t&&(t=i?r.ONE:r.inv(o));const a=r.mul(n,t),c=r.mul(s,t),l=r.mul(o,t);if(i)return{x:r.ZERO,y:r.ZERO};if(!r.eql(l,r.ONE))throw new Error("invZ was invalid");return{x:a,y:c}})),l=Mi((e=>{if(e.is0()){if(t.allowInfinityPoint&&!r.is0(e.py))return;throw new Error("bad point: ZERO")}const{x:n,y:s}=e.toAffine();if(!r.isValid(n)||!r.isValid(s))throw new Error("bad point: x or y not FE");const i=r.sqr(s),a=o(n);if(!r.eql(i,a))throw new Error("bad point: equation left != right");if(!e.isTorsionFree())throw new Error("bad point: not in prime-order subgroup");return!0}));class u{constructor(e,t,n){if(this.px=e,this.py=t,this.pz=n,null==e||!r.isValid(e))throw new Error("x required");if(null==t||!r.isValid(t))throw new Error("y required");if(null==n||!r.isValid(n))throw new Error("z required");Object.freeze(this)}static fromAffine(e){const{x:t,y:n}=e||{};if(!e||!r.isValid(t)||!r.isValid(n))throw new Error("invalid affine point");if(e instanceof u)throw new Error("projective point not allowed");const s=e=>r.eql(e,r.ZERO);return s(t)&&s(n)?u.ZERO:new u(t,n,r.ONE)}get x(){return this.toAffine().x}get y(){return this.toAffine().y}static normalizeZ(e){const t=r.invertBatch(e.map((e=>e.pz)));return e.map(((e,r)=>e.toAffine(t[r]))).map(u.fromAffine)}static fromHex(e){const t=u.fromAffine(s(Ri("pointHex",e)));return t.assertValidity(),t}static fromPrivateKey(e){return u.BASE.multiply(i(e))}_setWindowSize(e){d.setWindowSize(this,e)}assertValidity(){l(this)}hasEvenY(){const{y:e}=this.toAffine();if(r.isOdd)return!r.isOdd(e);throw new Error("Field doesn't support isOdd")}equals(e){a(e);const{px:t,py:n,pz:s}=this,{px:o,py:i,pz:c}=e,l=r.eql(r.mul(t,c),r.mul(o,s)),u=r.eql(r.mul(n,c),r.mul(i,s));return l&&u}negate(){return new u(this.px,r.neg(this.py),this.pz)}double(){const{a:e,b:n}=t,s=r.mul(n,Eu),{px:o,py:i,pz:a}=this;let c=r.ZERO,l=r.ZERO,h=r.ZERO,d=r.mul(o,o),p=r.mul(i,i),f=r.mul(a,a),g=r.mul(o,i);return g=r.add(g,g),h=r.mul(o,a),h=r.add(h,h),c=r.mul(e,h),l=r.mul(s,f),l=r.add(c,l),c=r.sub(p,l),l=r.add(p,l),l=r.mul(c,l),c=r.mul(g,c),h=r.mul(s,h),f=r.mul(e,f),g=r.sub(d,f),g=r.mul(e,g),g=r.add(g,h),h=r.add(d,d),d=r.add(h,d),d=r.add(d,f),d=r.mul(d,g),l=r.add(l,d),f=r.mul(i,a),f=r.add(f,f),d=r.mul(f,g),c=r.sub(c,d),h=r.mul(f,p),h=r.add(h,h),h=r.add(h,h),new u(c,l,h)}add(e){a(e);const{px:n,py:s,pz:o}=this,{px:i,py:c,pz:l}=e;let h=r.ZERO,d=r.ZERO,p=r.ZERO;const f=t.a,g=r.mul(t.b,Eu);let y=r.mul(n,i),m=r.mul(s,c),b=r.mul(o,l),w=r.add(n,s),v=r.add(i,c);w=r.mul(w,v),v=r.add(y,m),w=r.sub(w,v),v=r.add(n,o);let E=r.add(i,l);return v=r.mul(v,E),E=r.add(y,b),v=r.sub(v,E),E=r.add(s,o),h=r.add(c,l),E=r.mul(E,h),h=r.add(m,b),E=r.sub(E,h),p=r.mul(f,v),h=r.mul(g,b),p=r.add(h,p),h=r.sub(m,p),p=r.add(m,p),d=r.mul(h,p),m=r.add(y,y),m=r.add(m,y),b=r.mul(f,b),v=r.mul(g,v),m=r.add(m,b),b=r.sub(y,b),b=r.mul(f,b),v=r.add(v,b),y=r.mul(m,v),d=r.add(d,y),y=r.mul(E,v),h=r.mul(w,h),h=r.sub(h,y),y=r.mul(w,m),p=r.mul(E,p),p=r.add(p,y),new u(h,d,p)}subtract(e){return this.add(e.negate())}is0(){return this.equals(u.ZERO)}wNAF(e){return d.wNAFCached(this,e,u.normalizeZ)}multiplyUnsafe(e){xi("scalar",e,wu,t.n);const n=u.ZERO;if(e===wu)return n;if(e===vu)return this;const{endo:s}=t;if(!s)return d.unsafeLadder(this,e);let{k1neg:o,k1:i,k2neg:a,k2:c}=s.splitScalar(e),l=n,h=n,p=this;for(;i>wu||c>wu;)i&vu&&(l=l.add(p)),c&vu&&(h=h.add(p)),p=p.double(),i>>=vu,c>>=vu;return o&&(l=l.negate()),a&&(h=h.negate()),h=new u(r.mul(h.px,s.beta),h.py,h.pz),l.add(h)}multiply(e){const{endo:n,n:s}=t;let o,i;if(xi("scalar",e,vu,s),n){const{k1neg:t,k1:s,k2neg:a,k2:c}=n.splitScalar(e);let{p:l,f:h}=this.wNAF(s),{p,f}=this.wNAF(c);l=d.constTimeNegate(t,l),p=d.constTimeNegate(a,p),p=new u(r.mul(p.px,n.beta),p.py,p.pz),o=l.add(p),i=h.add(f)}else{const{p:t,f:r}=this.wNAF(e);o=t,i=r}return u.normalizeZ([o,i])[0]}multiplyAndAddUnsafe(e,t,r){const n=u.BASE,s=(e,t)=>t!==wu&&t!==vu&&e.equals(n)?e.multiply(t):e.multiplyUnsafe(t),o=s(this,t).add(s(e,r));return o.is0()?void 0:o}toAffine(e){return c(this,e)}isTorsionFree(){const{h:e,isTorsionFree:r}=t;if(e===vu)return!0;if(r)return r(u,this);throw new Error("isTorsionFree() has not been declared for the elliptic curve")}clearCofactor(){const{h:e,clearCofactor:r}=t;return e===vu?this:r?r(u,this):this.multiplyUnsafe(t.h)}toRawBytes(e=!0){return yi("isCompressed",e),this.assertValidity(),n(u,this,e)}toHex(e=!0){return yi("isCompressed",e),bi(this.toRawBytes(e))}}u.BASE=new u(t.Gx,t.Gy,r.ONE),u.ZERO=new u(r.ZERO,r.ONE,r.ZERO);const h=t.nBitLength,d=oa(u,t.endo?Math.ceil(h/2):h);return{CURVE:t,ProjectivePoint:u,normPrivateKeyToScalar:i,weierstrassEquation:o,isWithinCurveOrder:function(e){return Ni(e,vu,t.n)}}}({...t,toBytes(e,t,n){const s=t.toAffine(),o=r.toBytes(s.x),i=Ti;return yi("isCompressed",n),n?i(Uint8Array.from([t.hasEvenY()?2:3]),o):i(Uint8Array.from([4]),o,r.toBytes(s.y))},fromBytes(e){const t=e.length,n=e[0],i=e.subarray(1);if(t!==s||2!==n&&3!==n){if(t===o&&4===n)return{x:r.fromBytes(i.subarray(0,r.BYTES)),y:r.fromBytes(i.subarray(r.BYTES,2*r.BYTES))};throw new Error(`Point of length ${t} was invalid. Expected ${s} compressed bytes or ${o} uncompressed bytes`)}{const e=Ai(i);if(!Ni(e,vu,r.ORDER))throw new Error("Point is not on curve");const t=u(e);let s;try{s=r.sqrt(t)}catch(e){const t=e instanceof Error?": "+e.message:"";throw new Error("Point is not on curve"+t)}return!(1&~n)!=((s&vu)===vu)&&(s=r.neg(s)),{x:e,y:s}}}}),d=e=>bi(ki(e,t.nByteLength));function p(e){return e>n>>vu}const f=(e,t,r)=>Ai(e.slice(t,r));class g{constructor(e,t,r){this.r=e,this.s=t,this.recovery=r,this.assertValidity()}static fromCompact(e){const r=t.nByteLength;return e=Ri("compactSignature",e,2*r),new g(f(e,0,r),f(e,r,2*r))}static fromDER(e){const{r:t,s:r}=bu.toSig(Ri("DER",e));return new g(t,r)}assertValidity(){xi("r",this.r,vu,n),xi("s",this.s,vu,n)}addRecoveryBit(e){return new g(this.r,this.s,e)}recoverPublicKey(e){const{r:n,s,recovery:o}=this,l=w(Ri("msgHash",e));if(null==o||![0,1,2,3].includes(o))throw new Error("recovery id invalid");const u=2===o||3===o?n+t.n:n;if(u>=r.ORDER)throw new Error("recovery id 2 or 3 invalid");const h=1&o?"03":"02",p=c.fromHex(h+d(u)),f=a(u),g=i(-l*f),y=i(s*f),m=c.BASE.multiplyAndAddUnsafe(p,g,y);if(!m)throw new Error("point at infinify");return m.assertValidity(),m}hasHighS(){return p(this.s)}normalizeS(){return this.hasHighS()?new g(this.r,i(-this.s),this.recovery):this}toDERRawBytes(){return Si(this.toDERHex())}toDERHex(){return bu.hexFromSig({r:this.r,s:this.s})}toCompactRawBytes(){return Si(this.toCompactHex())}toCompactHex(){return d(this.r)+d(this.s)}}const y={isValidPrivateKey(e){try{return l(e),!0}catch(e){return!1}},normPrivateKeyToScalar:l,randomPrivateKey:()=>{const e=ea(t.n);return function(e,t,r=!1){const n=e.length,s=Zi(t),o=ea(t);if(n<16||n1024)throw new Error(`expected ${o}-1024 bytes of input, got ${n}`);const i=zi(r?Ai(e):_i(e),t-$i)+$i;return r?Ii(i,s):ki(i,s)}(t.randomBytes(e),t.n)},precompute:(e=8,t=c.BASE)=>(t._setWindowSize(e),t.multiply(BigInt(3)),t)};function m(e){const t=fi(e),r="string"==typeof e,n=(t||r)&&e.length;return t?n===s||n===o:r?n===2*s||n===2*o:e instanceof c}const b=t.bits2int||function(e){const r=Ai(e),n=8*e.length-t.nBitLength;return n>0?r>>BigInt(n):r},w=t.bits2int_modN||function(e){return i(b(e))},v=Pi(t.nBitLength);function E(e){return xi(`num < 2^${t.nBitLength}`,e,wu,v),ki(e,t.nByteLength)}const S={lowS:t.lowS,prehash:!1},A={lowS:t.lowS,prehash:!1};return c.BASE._setWindowSize(8),{CURVE:t,getPublicKey:function(e,t=!0){return c.fromPrivateKey(e).toRawBytes(t)},getSharedSecret:function(e,t,r=!0){if(m(e))throw new Error("first arg must be private key");if(!m(t))throw new Error("second arg must be public key");return c.fromHex(t).multiply(l(e)).toRawBytes(r)},sign:function(e,n,s=S){const{seed:o,k2sig:u}=function(e,n,s=S){if(["recovered","canonical"].some((e=>e in s)))throw new Error("sign() legacy options not supported");const{hash:o,randomBytes:u}=t;let{lowS:d,prehash:f,extraEntropy:y}=s;null==d&&(d=!0),e=Ri("msgHash",e),gu(s),f&&(e=Ri("prehashed msgHash",o(e)));const m=w(e),v=l(n),A=[E(v),E(m)];if(null!=y&&!1!==y){const e=!0===y?u(r.BYTES):y;A.push(Ri("extraEntropy",e))}const _=Ti(...A),k=m;return{seed:_,k2sig:function(e){const t=b(e);if(!h(t))return;const r=a(t),n=c.BASE.multiply(t).toAffine(),s=i(n.x);if(s===wu)return;const o=i(r*i(k+s*v));if(o===wu)return;let l=(n.x===s?0:2)|Number(n.y&vu),u=o;return d&&p(o)&&(u=function(e){return p(e)?i(-e):e}(o),l^=1),new g(s,u,l)}}}(e,n,s),d=t;return Li(d.hash.outputLen,d.nByteLength,d.hmac)(o,u)},verify:function(e,r,n,s=A){const o=e;if(r=Ri("msgHash",r),n=Ri("publicKey",n),"strict"in s)throw new Error("options.strict was renamed to lowS");gu(s);const{lowS:l,prehash:u}=s;let h,d;try{if("string"==typeof o||fi(o))try{h=g.fromDER(o)}catch(e){if(!(e instanceof bu.Err))throw e;h=g.fromCompact(o)}else{if("object"!=typeof o||"bigint"!=typeof o.r||"bigint"!=typeof o.s)throw new Error("PARSE");{const{r:e,s:t}=o;h=new g(e,t)}}d=c.fromHex(n)}catch(e){if("PARSE"===e.message)throw new Error("signature must be Signature instance, Uint8Array or hex string");return!1}if(l&&h.hasHighS())return!1;u&&(r=t.hash(r));const{r:p,s:f}=h,y=w(r),m=a(f),b=i(y*m),v=i(p*m),E=c.BASE.multiplyAndAddUnsafe(d,b,v)?.toAffine();return!!E&&i(E.x)===p},ProjectivePoint:c,Signature:g,utils:y}}function Au(e){return{hash:e,hmac:(t,...r)=>Xa(e,t,function(...e){let t=0;for(let r=0;r(e+t/Ru)/t;const Cu=Qi(_u,void 0,void 0,{sqrt:function(e){const t=_u,r=BigInt(3),n=BigInt(6),s=BigInt(11),o=BigInt(22),i=BigInt(23),a=BigInt(44),c=BigInt(88),l=e*e*e%t,u=l*l*e%t,h=Wi(u,r,t)*u%t,d=Wi(h,r,t)*u%t,p=Wi(d,Ru,t)*l%t,f=Wi(p,s,t)*p%t,g=Wi(f,o,t)*f%t,y=Wi(g,a,t)*g%t,m=Wi(y,c,t)*y%t,b=Wi(m,a,t)*g%t,w=Wi(b,r,t)*u%t,v=Wi(w,i,t)*f%t,E=Wi(v,n,t)*l%t,S=Wi(E,Ru,t);if(!Cu.eql(Cu.sqr(S),e))throw new Error("Cannot find square root");return S}}),Nu=function(e,t){const r=t=>Su({...e,...Au(t)});return Object.freeze({...r(t),create:r})}({a:BigInt(0),b:BigInt(7),Fp:Cu,n:ku,Gx:BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),Gy:BigInt("32670510020758816978083085130507043184471273380659243275938904335757337482424"),h:BigInt(1),lowS:!0,endo:{beta:BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),splitScalar:e=>{const t=ku,r=BigInt("0x3086d221a7d46bcde86c90e49284eb15"),n=-Iu*BigInt("0xe4437ed6010e88286f547fa90abfe4c3"),s=BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"),o=r,i=BigInt("0x100000000000000000000000000000000"),a=Tu(o*e,t),c=Tu(-n*e,t);let l=zi(e-a*r-c*s,t),u=zi(-a*n-c*o,t);const h=l>i,d=u>i;if(h&&(l=t-l),d&&(u=t-u),l>i||u>i)throw new Error("splitScalar: Endomorphism failed, k="+e);return{k1neg:h,k1:l,k2neg:d,k2:u}}}},Wr);function xu(e){try{Nu.ProjectivePoint.fromHex(e)}catch(e){throw new eo(String(e),"ERR_INVALID_PUBLIC_KEY")}}BigInt(0),Nu.ProjectivePoint;class Pu{_key;constructor(e){xu(e),this._key=e}verify(e,t){return function(e,t,r){const n=gt.digest(r instanceof Uint8Array?r:r.subarray());if(Zo(n))return n.then((({digest:r})=>Nu.verify(t,r,e))).catch((e=>{throw new eo(String(e),"ERR_INVALID_INPUT")}));try{return Nu.verify(t,n.digest,e)}catch(e){throw new eo(String(e),"ERR_INVALID_INPUT")}}(this._key,t,e)}marshal(){return e=this._key,Nu.ProjectivePoint.fromHex(e).toRawBytes(!0);var e}get bytes(){return Ua.encode({Type:La.Secp256k1,Data:this.marshal()}).subarray()}equals(e){return Pn(this.bytes,e.bytes)}async hash(){const e=gt.digest(this.bytes);let t;return Zo(e)?({bytes:t}=await e):t=e.bytes,t}}class Ou{_key;_publicKey;constructor(e,t){this._key=e,this._publicKey=t??function(e){try{return Nu.getPublicKey(e,!0)}catch(e){throw new eo(String(e),"ERR_INVALID_PRIVATE_KEY")}}(e),function(e){try{Nu.getPublicKey(e,!0)}catch(e){throw new eo(String(e),"ERR_INVALID_PRIVATE_KEY")}}(this._key),xu(this._publicKey)}sign(e){return function(e,t){const r=gt.digest(t instanceof Uint8Array?t:t.subarray());if(Zo(r))return r.then((({digest:t})=>Nu.sign(t,e).toDERRawBytes())).catch((e=>{throw new eo(String(e),"ERR_INVALID_INPUT")}));try{return Nu.sign(r.digest,e).toDERRawBytes()}catch(e){throw new eo(String(e),"ERR_INVALID_INPUT")}}(this._key,e)}get public(){return new Pu(this._publicKey)}marshal(){return this._key}get bytes(){return Ma.encode({Type:La.Secp256k1,Data:this.marshal()}).subarray()}equals(e){return Pn(this.bytes,e.bytes)}hash(){const e=gt.digest(this.bytes);return Zo(e)?e.then((({bytes:e})=>e)):e.bytes}async id(){return sn(await this.public.hash(),"base58btc")}async export(e,t="libp2p-key"){if("libp2p-key"===t)return Da(this.bytes,e);throw new eo(`export format '${t}' is not supported`,"ERR_INVALID_EXPORT_FORMAT")}}function Du(e){return new Ou(e)}function Lu(e){return new Pu(e)}async function Bu(){const e=Nu.utils.randomPrivateKey();return new Ou(e)}const Uu={rsa:y,ed25519:g,secp256k1:m};function Mu(e){const t=Object.keys(Uu).join(" / ");return new eo(`invalid or unsupported key type ${e}. Must be ${t}`,"ERR_UNSUPPORTED_KEY_TYPE")}function Fu(e){if("rsa"===(e=e.toLowerCase())||"ed25519"===e||"secp256k1"===e)return Uu[e];throw Mu(e)}function $u(e){const t=Ua.decode(e),r=t.Data??new Uint8Array;switch(t.Type){case La.RSA:return Uu.rsa.unmarshalRsaPublicKey(r);case La.Ed25519:return Uu.ed25519.unmarshalEd25519PublicKey(r);case La.Secp256k1:return Uu.secp256k1.unmarshalSecp256k1PublicKey(r);default:throw Mu(t.Type??"unknown")}}function Hu(e,t){return Fu(t=(t??"rsa").toLowerCase()),e.bytes}async function qu(e){const t=Ma.decode(e),r=t.Data??new Uint8Array;switch(t.Type){case La.RSA:return Uu.rsa.unmarshalRsaPrivateKey(r);case La.Ed25519:return Uu.ed25519.unmarshalEd25519PrivateKey(r);case La.Secp256k1:return Uu.secp256k1.unmarshalSecp256k1PrivateKey(r);default:throw Mu(t.Type??"RSA")}}const Vu=Symbol.for("@libp2p/service-capabilities"),ju=Symbol.for("@libp2p/service-dependencies"),Ku=Symbol.for("nodejs.util.inspect.custom"),zu=Object.values(kt).map((e=>e.decoder)).reduce(((e,t)=>e.or(t)),kt.identity.decoder),Gu=114,Wu=36,Yu=37;class Ju{type;multihash;privateKey;publicKey;string;constructor(e){this.type=e.type,this.multihash=e.multihash,this.privateKey=e.privateKey,Object.defineProperty(this,"string",{enumerable:!1,writable:!0})}get[Symbol.toStringTag](){return`PeerId(${this.toString()})`}[Xs]=!0;toString(){return null==this.string&&(this.string=ke.encode(this.multihash.bytes).slice(1)),this.string}toCID(){return vt.createV1(Gu,this.multihash)}toBytes(){return this.multihash.bytes}toJSON(){return this.toString()}equals(e){if(null==e)return!1;if(e instanceof Uint8Array)return Pn(this.multihash.bytes,e);if("string"==typeof e)return rh(e).equals(this);if(null!=e?.multihash?.bytes)return Pn(this.multihash.bytes,e.multihash.bytes);throw new Error("not valid Id")}[Ku](){return`PeerId(${this.toString()})`}}class Xu extends Ju{type="RSA";publicKey;constructor(e){super({...e,type:"RSA"}),this.publicKey=e.publicKey}}class Qu extends Ju{type="Ed25519";publicKey;constructor(e){super({...e,type:"Ed25519"}),this.publicKey=e.multihash.digest}}class Zu extends Ju{type="secp256k1";publicKey;constructor(e){super({...e,type:"secp256k1"}),this.publicKey=e.multihash.digest}}const eh=2336;class th{type="url";multihash;privateKey;publicKey;url;constructor(e){this.url=e.toString(),this.multihash=ht.digest(Nt(this.url))}[Ku](){return`PeerId(${this.url})`}[Xs]=!0;toString(){return this.toCID().toString()}toCID(){return vt.createV1(eh,this.multihash)}toBytes(){return this.toCID().bytes}equals(e){return null!=e&&(e instanceof Uint8Array&&(e=sn(e)),e.toString()===this.toString())}}function rh(e,t){if(t=t??zu,"1"===e.charAt(0)||"Q"===e.charAt(0)){const t=ct(ke.decode(`z${e}`));return e.startsWith("12D")?new Qu({multihash:t}):e.startsWith("16U")?new Zu({multihash:t}):new Xu({multihash:t})}return nh(zu.decode(e))}function nh(e){try{const t=ct(e);if(t.code===ht.code){if(t.digest.length===Wu)return new Qu({multihash:t});if(t.digest.length===Yu)return new Zu({multihash:t})}if(t.code===gt.code)return new Xu({multihash:t})}catch{return function(e){if(null==e?.multihash||null==e.version||1===e.version&&e.code!==Gu&&e.code!==eh)throw new Error("Supplied PeerID CID is invalid");if(e.code===eh){const t=sn(e.multihash.digest);return new th(new URL(t))}const t=e.multihash;if(t.code===gt.code)return new Xu({multihash:e.multihash});if(t.code===ht.code){if(t.digest.length===Wu)return new Qu({multihash:e.multihash});if(t.digest.length===Yu)return new Zu({multihash:e.multihash})}throw new Error("Supplied PeerID CID is invalid")}(vt.decode(e))}throw new Error("Supplied PeerID CID is invalid")}async function sh(e,t){return e.length===Wu?new Qu({multihash:at(ht.code,e),privateKey:t}):e.length===Yu?new Zu({multihash:at(ht.code,e),privateKey:t}):new Xu({multihash:await gt.digest(e),publicKey:e,privateKey:t})}class oh extends Error{type;code;constructor(e,t,r){super(e??"The operation was aborted"),this.type="aborted",this.name=r??"AbortError",this.code=t??"ABORT_ERR"}}async function ih(e,t,r){if(null==t)return e;if(t.aborted)return Promise.reject(new oh(r?.errorMessage,r?.errorCode,r?.errorName));let n;const s=new oh(r?.errorMessage,r?.errorCode,r?.errorName);try{return await Promise.race([e,new Promise(((e,r)=>{n=()=>{r(s)},t.addEventListener("abort",n)}))])}finally{null!=n&&t.removeEventListener("abort",n)}}class ah{readNext;haveNext;ended;nextResult;constructor(){this.ended=!1,this.readNext=Gn(),this.haveNext=Gn()}[Symbol.asyncIterator](){return this}async next(){if(null==this.nextResult&&await this.haveNext.promise,null==this.nextResult)throw new Error("HaveNext promise resolved but nextResult was undefined");const e=this.nextResult;return this.nextResult=void 0,this.readNext.resolve(),this.readNext=Gn(),e}async throw(e){return this.ended=!0,null!=e&&(this.haveNext.promise.catch((()=>{})),this.haveNext.reject(e)),{done:!0,value:void 0}}async return(){return await this._push(void 0),{done:!0,value:void 0}}async push(e,t){await this._push(e,t)}async end(e,t){null!=e?await this.throw(e):await this._push(void 0,t)}async _push(e,t){if(null!=e&&this.ended)throw new Error("Cannot push value onto an ended pushable");for(;null!=this.nextResult;)await this.readNext.promise;null!=e?this.nextResult={done:!1,value:e}:(this.ended=!0,this.nextResult={done:!0,value:void 0}),this.haveNext.resolve(),this.haveNext=Gn(),await ih(this.readNext.promise,t?.signal,t)}}class ch extends Error{name="UnexpectedEOFError";code="ERR_UNEXPECTED_EOF"}class lh extends Error{code;constructor(e,t){super(e),this.code=t}}class uh extends lh{type;constructor(e){super(e,"ABORT_ERR"),this.type="aborted",this.name="AbortError"}}function hh(e,t){const r=new ah;e.sink(r).catch((async e=>{await r.end(e)})),e.sink=async e=>{for await(const t of e)await r.push(t);await r.end()};let n=e.source;null!=e.source[Symbol.iterator]?n=e.source[Symbol.iterator]():null!=e.source[Symbol.asyncIterator]&&(n=e.source[Symbol.asyncIterator]());const s=new Bn,o={read:async(e,t)=>{let r;t?.signal?.throwIfAborted();const o=new Promise(((e,n)=>{r=()=>{n(new uh("Read aborted"))},t?.signal?.addEventListener("abort",r)}));try{if(null==e){const{done:e,value:t}=await Promise.race([n.next(),o]);return!0===e?new Bn:t}for(;s.byteLength{t?.signal?.throwIfAborted(),e instanceof Uint8Array?await r.push(e,t):await r.push(e.subarray(),t)},unwrap:()=>{if(s.byteLength>0){const r=e.source;e.source=async function*(){!1===t?.yieldBytes?yield s:yield*s,yield*r}()}return e}};return o}class dh extends Error{name="InvalidMessageLengthError";code="ERR_INVALID_MSG_LENGTH"}class ph extends Error{name="InvalidDataLengthError";code="ERR_MSG_DATA_TOO_LONG"}class fh extends Error{name="InvalidDataLengthLengthError";code="ERR_MSG_LENGTH_TOO_LONG"}function gh(e,t={}){const r=hh(e,t);null!=t.maxDataLength&&null==t.maxLengthLength&&(t.maxLengthLength=C(t.maxDataLength));const n=t?.lengthDecoder??O,s=t?.lengthEncoder??P;return{read:async e=>{let s=-1;const o=new Bn;for(;;){o.append(await r.read(1,e));try{s=n(o)}catch(e){if(e instanceof RangeError)continue;throw e}if(s<0)throw new dh("Invalid message length");if(null!=t?.maxLengthLength&&o.byteLength>t.maxLengthLength)throw new fh("message length length too long");if(s>-1)break}if(null!=t?.maxDataLength&&s>t.maxDataLength)throw new ph("message length too long");return r.read(s,e)},write:async(e,t)=>{await r.write(new Bn(s(e.byteLength),e),t)},writeV:async(e,t)=>{const n=new Bn(...e.flatMap((e=>[s(e.byteLength),e])));await r.write(n,t)},unwrap:()=>r.unwrap()}}function yh(){const e=Gn();let t=!1;return{sink:async r=>{if(t)throw new Error("already piped");t=!0,e.resolve(r)},source:async function*(){const t=await e.promise;yield*t}()}}const mh=65535,bh=Boolean(globalThis.process?.env?.DUMP_SESSION_KEYS);function wh(e){if(!Number.isSafeInteger(e)||e<0)throw new Error(`positive integer expected, not ${e}`)}function vh(e){if("boolean"!=typeof e)throw new Error(`boolean expected, not ${e}`)}function Eh(e){return e instanceof Uint8Array||null!=e&&"object"==typeof e&&"Uint8Array"===e.constructor.name}function Sh(e,...t){if(!Eh(e))throw new Error("Uint8Array expected");if(t.length>0&&!t.includes(e.length))throw new Error(`Uint8Array expected of length ${t}, not of length=${e.length}`)}function Ah(e,t=!0){if(e.destroyed)throw new Error("Hash instance has been destroyed");if(t&&e.finished)throw new Error("Hash#digest() has already been called")}const _h=e=>new Uint32Array(e.buffer,e.byteOffset,Math.floor(e.byteLength/4));if(68!==new Uint8Array(new Uint32Array([287454020]).buffer)[0])throw new Error("Non little-endian hardware is not supported");function kh(e){if("string"==typeof e)e=function(e){if("string"!=typeof e)throw new Error("string expected, got "+typeof e);return new Uint8Array((new TextEncoder).encode(e))}(e);else{if(!Eh(e))throw new Error("Uint8Array expected, got "+typeof e);e=Th(e)}return e}const Ih=(e,t)=>(Object.assign(t,e),t);function Rh(e,t,r,n){if("function"==typeof e.setBigUint64)return e.setBigUint64(t,r,n);const s=BigInt(32),o=BigInt(4294967295),i=Number(r>>s&o),a=Number(r&o),c=n?4:0,l=n?0:4;e.setUint32(t+c,i,n),e.setUint32(t+l,a,n)}function Th(e){return Uint8Array.from(e)}function Ch(...e){for(let t=0;tUint8Array.from(e.split("").map((e=>e.charCodeAt(0)))),xh=Nh("expand 16-byte k"),Ph=Nh("expand 32-byte k"),Oh=_h(xh),Dh=_h(Ph);function Lh(e,t){return e<>>32-t}function Bh(e){return e.byteOffset%4==0}Dh.slice();const Uh=2**32-1,Mh=new Uint32Array;function Fh(e,t){const{allowShortKeys:r,extendNonceFn:n,counterLength:s,counterRight:o,rounds:i}=function(e,t){if(null==t||"object"!=typeof t)throw new Error("options must be defined");return Object.assign({allowShortKeys:!1,counterLength:8,counterRight:!1,rounds:20},t)}(0,t);if("function"!=typeof e)throw new Error("core must be a function");return wh(s),wh(i),vh(o),vh(r),(t,a,c,l,u=0)=>{Sh(t),Sh(a),Sh(c);const h=c.length;if(void 0===l&&(l=new Uint8Array(h)),Sh(l),wh(u),u<0||u>=Uh)throw new Error("arx: counter overflow");if(l.length=Uh)throw new Error("arx: counter overflow");const g=Math.min(64,c-f);if(h&&64===g){const e=f/4;if(f%4!=0)throw new Error("arx: invalid block position");for(let t,r=0;r<16;r++)t=e+r,p[t]=d[t]^u[r];f+=64}else{for(let e,t=0;t255&e[t++]|(255&e[t++])<<8;class Hh{constructor(e){this.blockLen=16,this.outputLen=16,this.buffer=new Uint8Array(16),this.r=new Uint16Array(10),this.h=new Uint16Array(10),this.pad=new Uint16Array(8),this.pos=0,this.finished=!1,Sh(e=kh(e),32);const t=$h(e,0),r=$h(e,2),n=$h(e,4),s=$h(e,6),o=$h(e,8),i=$h(e,10),a=$h(e,12),c=$h(e,14);this.r[0]=8191&t,this.r[1]=8191&(t>>>13|r<<3),this.r[2]=7939&(r>>>10|n<<6),this.r[3]=8191&(n>>>7|s<<9),this.r[4]=255&(s>>>4|o<<12),this.r[5]=o>>>1&8190,this.r[6]=8191&(o>>>14|i<<2),this.r[7]=8065&(i>>>11|a<<5),this.r[8]=8191&(a>>>8|c<<8),this.r[9]=c>>>5&127;for(let t=0;t<8;t++)this.pad[t]=$h(e,16+2*t)}process(e,t,r=!1){const n=r?0:2048,{h:s,r:o}=this,i=o[0],a=o[1],c=o[2],l=o[3],u=o[4],h=o[5],d=o[6],p=o[7],f=o[8],g=o[9],y=$h(e,t+0),m=$h(e,t+2),b=$h(e,t+4),w=$h(e,t+6),v=$h(e,t+8),E=$h(e,t+10),S=$h(e,t+12),A=$h(e,t+14);let _=s[0]+(8191&y),k=s[1]+(8191&(y>>>13|m<<3)),I=s[2]+(8191&(m>>>10|b<<6)),R=s[3]+(8191&(b>>>7|w<<9)),T=s[4]+(8191&(w>>>4|v<<12)),C=s[5]+(v>>>1&8191),N=s[6]+(8191&(v>>>14|E<<2)),x=s[7]+(8191&(E>>>11|S<<5)),P=s[8]+(8191&(S>>>8|A<<8)),O=s[9]+(A>>>5|n),D=0,L=D+_*i+k*(5*g)+I*(5*f)+R*(5*p)+T*(5*d);D=L>>>13,L&=8191,L+=C*(5*h)+N*(5*u)+x*(5*l)+P*(5*c)+O*(5*a),D+=L>>>13,L&=8191;let B=D+_*a+k*i+I*(5*g)+R*(5*f)+T*(5*p);D=B>>>13,B&=8191,B+=C*(5*d)+N*(5*h)+x*(5*u)+P*(5*l)+O*(5*c),D+=B>>>13,B&=8191;let U=D+_*c+k*a+I*i+R*(5*g)+T*(5*f);D=U>>>13,U&=8191,U+=C*(5*p)+N*(5*d)+x*(5*h)+P*(5*u)+O*(5*l),D+=U>>>13,U&=8191;let M=D+_*l+k*c+I*a+R*i+T*(5*g);D=M>>>13,M&=8191,M+=C*(5*f)+N*(5*p)+x*(5*d)+P*(5*h)+O*(5*u),D+=M>>>13,M&=8191;let F=D+_*u+k*l+I*c+R*a+T*i;D=F>>>13,F&=8191,F+=C*(5*g)+N*(5*f)+x*(5*p)+P*(5*d)+O*(5*h),D+=F>>>13,F&=8191;let $=D+_*h+k*u+I*l+R*c+T*a;D=$>>>13,$&=8191,$+=C*i+N*(5*g)+x*(5*f)+P*(5*p)+O*(5*d),D+=$>>>13,$&=8191;let H=D+_*d+k*h+I*u+R*l+T*c;D=H>>>13,H&=8191,H+=C*a+N*i+x*(5*g)+P*(5*f)+O*(5*p),D+=H>>>13,H&=8191;let q=D+_*p+k*d+I*h+R*u+T*l;D=q>>>13,q&=8191,q+=C*c+N*a+x*i+P*(5*g)+O*(5*f),D+=q>>>13,q&=8191;let V=D+_*f+k*p+I*d+R*h+T*u;D=V>>>13,V&=8191,V+=C*l+N*c+x*a+P*i+O*(5*g),D+=V>>>13,V&=8191;let j=D+_*g+k*f+I*p+R*d+T*h;D=j>>>13,j&=8191,j+=C*u+N*l+x*c+P*a+O*i,D+=j>>>13,j&=8191,D=(D<<2)+D|0,D=D+L|0,L=8191&D,D>>>=13,B+=D,s[0]=L,s[1]=B,s[2]=U,s[3]=M,s[4]=F,s[5]=$,s[6]=H,s[7]=q,s[8]=V,s[9]=j}finalize(){const{h:e,pad:t}=this,r=new Uint16Array(10);let n=e[1]>>>13;e[1]&=8191;for(let t=2;t<10;t++)e[t]+=n,n=e[t]>>>13,e[t]&=8191;e[0]+=5*n,n=e[0]>>>13,e[0]&=8191,e[1]+=n,n=e[1]>>>13,e[1]&=8191,e[2]+=n,r[0]=e[0]+5,n=r[0]>>>13,r[0]&=8191;for(let t=1;t<10;t++)r[t]=e[t]+n,n=r[t]>>>13,r[t]&=8191;r[9]-=8192;let s=(1^n)-1;for(let e=0;e<10;e++)r[e]&=s;s=~s;for(let t=0;t<10;t++)e[t]=e[t]&s|r[t];e[0]=65535&(e[0]|e[1]<<13),e[1]=65535&(e[1]>>>3|e[2]<<10),e[2]=65535&(e[2]>>>6|e[3]<<7),e[3]=65535&(e[3]>>>9|e[4]<<4),e[4]=65535&(e[4]>>>12|e[5]<<1|e[6]<<14),e[5]=65535&(e[6]>>>2|e[7]<<11),e[6]=65535&(e[7]>>>5|e[8]<<8),e[7]=65535&(e[8]>>>8|e[9]<<5);let o=e[0]+t[0];e[0]=65535&o;for(let r=1;r<8;r++)o=(e[r]+t[r]|0)+(o>>>16)|0,e[r]=65535&o;Ch(r)}update(e){Ah(this);const{buffer:t,blockLen:r}=this,n=(e=kh(e)).length;for(let s=0;s>>0,e[s++]=r[t]>>>8;return e}digest(){const{buffer:e,outputLen:t}=this;this.digestInto(e);const r=e.slice(0,t);return this.destroy(),r}}const qh=function(e){const t=(t,r)=>e(r).update(kh(t)).digest(),r=e(new Uint8Array(32));return t.outputLen=r.outputLen,t.blockLen=r.blockLen,t.create=t=>e(t),t}((e=>new Hh(e)));function Vh(e,t,r,n,s,o=20){let i=e[0],a=e[1],c=e[2],l=e[3],u=t[0],h=t[1],d=t[2],p=t[3],f=t[4],g=t[5],y=t[6],m=t[7],b=s,w=r[0],v=r[1],E=r[2],S=i,A=a,_=c,k=l,I=u,R=h,T=d,C=p,N=f,x=g,P=y,O=m,D=b,L=w,B=v,U=E;for(let e=0;e{e.update(t);const r=t.length%16;r&&e.update(zh.subarray(r))},Wh=new Uint8Array(32);function Yh(e,t,r,n,s){const o=e(t,r,Wh),i=qh.create(o);s&&Gh(i,s),Gh(i,n);const a=new Uint8Array(16),c=(l=a,new DataView(l.buffer,l.byteOffset,l.byteLength));var l;Rh(c,0,BigInt(s?s.length:0),!0),Rh(c,8,BigInt(n.length),!0),i.update(a);const u=i.digest();return Ch(o,a),u}const Jh=e=>(t,r,n)=>(Sh(t,32),Sh(r),{encrypt(s,o){const i=s.length,a=i+16;o?Sh(o,a):o=new Uint8Array(a),e(t,r,s,o,1);const c=Yh(e,t,r,o.subarray(0,-16),n);return o.set(c,i),Ch(c),o},decrypt(s,o){const i=s.length,a=i-16;if(i<16)throw new Error("encrypted data must be at least 16 bytes");o?Sh(o,a):o=new Uint8Array(a);const c=s.subarray(0,-16),l=s.subarray(-16),u=Yh(e,t,r,c,n);if(!function(e,t){if(e.length!==t.length)return!1;let r=0;for(let n=0;nWr(e.subarray()),getHKDF(e,t){const r=function(e,t,r){return Nr(e),void 0===r&&(r=new Uint8Array(e.outputLen)),Xa(e,Ur(r),Ur(t))}(Wr,t,e),n=function(e,t,r,n=32){if(Nr(e),Tr(n),n>255*e.outputLen)throw new Error("Length should be <= 255*HashLen");const s=Math.ceil(n/e.outputLen);void 0===r&&(r=Zh);const o=new Uint8Array(s*e.outputLen),i=Xa.create(e,t),a=i._cloneInto(),c=new Uint8Array(i.outputLen);for(let t=0;t({publicKey:Ra.getPublicKey(e),privateKey:e}),generateX25519SharedKey:(e,t)=>Ra.getSharedSecret(e.subarray(),t.subarray()),chaCha20Poly1305Encrypt:(e,t,r,n)=>Xh(n,t,r).encrypt(e.subarray()),chaCha20Poly1305Decrypt:(e,t,r,n,s)=>Xh(n,t,r).decrypt(e.subarray(),s)},td=e=>{const t=w(2);return t[0]=e>>8,t[1]=e,t};td.bytes=2;const rd=e=>{if(e.length<2)throw RangeError("Could not decode int16BE");if(e instanceof Uint8Array){let t=0;return t+=e[0]<<8,t+=e[1],t}return e.getUint16(0)};function nd(e,t){t.enabled&&bh&&(e?(t(`LOCAL_STATIC_PUBLIC_KEY ${sn(e.publicKey,"hex")}`),t(`LOCAL_STATIC_PRIVATE_KEY ${sn(e.privateKey,"hex")}`)):t("Missing local static keys."))}function sd(e,t){t.enabled&&bh&&(e?(t(`LOCAL_PUBLIC_EPHEMERAL_KEY ${sn(e.publicKey,"hex")}`),t(`LOCAL_PRIVATE_EPHEMERAL_KEY ${sn(e.privateKey,"hex")}`)):t("Missing local ephemeral keys."))}function od(e,t){t.enabled&&bh&&t(e?`REMOTE_EPHEMERAL_PUBLIC_KEY ${sn(e.subarray(),"hex")}`:"Missing remote ephemeral keys.")}function id(e,t,r){r.enabled&&bh&&(r(`CIPHER_STATE_1 ${e.n.getUint64()} ${e.k&&sn(e.k,"hex")}`),r(`CIPHER_STATE_2 ${t.n.getUint64()} ${t.k&&sn(t.k,"hex")}`))}rd.bytes=2;class ad extends Error{code;constructor(e="Unexpected Peer"){super(e),this.code=ad.code}static code="ERR_UNEXPECTED_PEER"}class cd extends Error{code;constructor(e="Invalid crypto exchange"){super(e),this.code=cd.code}static code="ERR_INVALID_CRYPTO_EXCHANGE"}class ld{n;bytes;view;constructor(e=0){this.n=e,this.bytes=b(12),this.view=new DataView(this.bytes.buffer,this.bytes.byteOffset,this.bytes.byteLength),this.view.setUint32(4,e,!0)}increment(){this.n++,this.view.setUint32(4,this.n,!0)}getBytes(){return this.bytes}getUint64(){return this.n}assertValue(){if(this.n>4294967295)throw new Error("Cipherstate has reached maximum n, a new handshake must be performed")}}const ud=b(0);class hd{k;n;crypto;constructor(e,t=void 0,r=0){this.crypto=e,this.k=t,this.n=new ld(r)}hasKey(){return Boolean(this.k)}encryptWithAd(e,t){if(!this.hasKey())return t;this.n.assertValue();const r=this.crypto.encrypt(t,this.n.getBytes(),e,this.k);return this.n.increment(),r}decryptWithAd(e,t,r){if(!this.hasKey())return t;this.n.assertValue();const n=this.crypto.decrypt(t,this.n.getBytes(),e,this.k,r);return this.n.increment(),n}}class dd{cs;ck;h;crypto;constructor(e,t){this.crypto=e;const r=Nt(t,"utf-8");this.h=function(e,t){if(t.length<=32){const e=b(32);return e.set(t),e}return e.hash(t)}(e,r),this.ck=this.h,this.cs=new hd(e)}mixKey(e){const[t,r]=this.crypto.hkdf(this.ck,e);this.ck=t,this.cs=new hd(this.crypto,r)}mixHash(e){this.h=this.crypto.hash(new Bn(this.h,e))}encryptAndHash(e){const t=this.cs.encryptWithAd(this.h,e);return this.mixHash(t),t}decryptAndHash(e){const t=this.cs.decryptWithAd(this.h,e);return this.mixHash(e),t}split(){const[e,t]=this.crypto.hkdf(this.ck,ud);return[new hd(this.crypto,e),new hd(this.crypto,t)]}}class pd{ss;s;e;rs;re;initiator;crypto;constructor(e){const{crypto:t,protocolName:r,prologue:n,initiator:s,s:o,e:i,rs:a,re:c}=e;this.crypto=t,this.ss=new dd(t,r),this.ss.mixHash(n),this.initiator=s,this.s=o,this.e=i,this.rs=a,this.re=c}writeE(){if(this.e)throw new Error("ephemeral keypair is already set");const e=this.crypto.generateKeypair();return this.ss.mixHash(e.publicKey),this.e=e,e.publicKey}writeS(){if(!this.s)throw new Error("static keypair is not set");return this.ss.encryptAndHash(this.s.publicKey)}writeEE(){if(!this.e)throw new Error("ephemeral keypair is not set");if(!this.re)throw new Error("remote ephemeral public key is not set");this.ss.mixKey(this.crypto.dh(this.e,this.re))}writeES(){if(this.initiator){if(!this.e)throw new Error("ephemeral keypair is not set");if(!this.rs)throw new Error("remote static public key is not set");this.ss.mixKey(this.crypto.dh(this.e,this.rs))}else{if(!this.s)throw new Error("static keypair is not set");if(!this.re)throw new Error("remote ephemeral public key is not set");this.ss.mixKey(this.crypto.dh(this.s,this.re))}}writeSE(){if(this.initiator){if(!this.s)throw new Error("static keypair is not set");if(!this.re)throw new Error("remote ephemeral public key is not set");this.ss.mixKey(this.crypto.dh(this.s,this.re))}else{if(!this.e)throw new Error("ephemeral keypair is not set");if(!this.rs)throw new Error("remote static public key is not set");this.ss.mixKey(this.crypto.dh(this.e,this.rs))}}readE(e,t=0){if(this.re)throw new Error("remote ephemeral public key is already set");if(e.byteLength(null==t&&(t=Ar(((e,t,r={})=>{if(!1!==r.lengthDelimited&&t.fork(),null!=e.webtransportCerthashes)for(const r of e.webtransportCerthashes)t.uint32(10),t.bytes(r);!1!==r.lengthDelimited&&t.ldelim()}),((e,t)=>{const r={webtransportCerthashes:[]},n=null==t?e.len:e.pos+t;for(;e.pos>>3==1?r.webtransportCerthashes.push(e.bytes()):e.skipType(7&t)}return r}))),t),e.encode=t=>jt(t,e.codec()),e.decode=t=>Y(t,e.codec())}(gd||(gd={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.identityKey&&e.identityKey.byteLength>0&&(t.uint32(10),t.bytes(e.identityKey)),null!=e.identitySig&&e.identitySig.byteLength>0&&(t.uint32(18),t.bytes(e.identitySig)),null!=e.extensions&&(t.uint32(34),gd.codec().encode(e.extensions,t)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t)=>{const r={identityKey:b(0),identitySig:b(0)},n=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:r.identityKey=e.bytes();break;case 2:r.identitySig=e.bytes();break;case 4:r.extensions=gd.codec().decode(e,e.uint32());break;default:e.skipType(7&t)}}return r}))),t),e.encode=t=>jt(t,e.codec()),e.decode=t=>Y(t,e.codec())}(yd||(yd={}));class vd{protocol="/noise";crypto;prologue;staticKey;extensions;metrics;components;constructor(e,t={}){const{staticNoiseKey:r,extensions:n,crypto:s,prologueBytes:o}=t,{metrics:i}=e;this.components=e;const a=s??ed;this.crypto=function(e){return{generateKeypair:e.generateX25519KeyPair,dh:(t,r)=>e.generateX25519SharedKey(t.privateKey,r).subarray(0,32),encrypt:e.chaCha20Poly1305Encrypt,decrypt:e.chaCha20Poly1305Decrypt,hash:e.hashSHA256,hkdf:e.getHKDF}}(a),this.extensions=n,this.metrics=i?function(e){return{xxHandshakeSuccesses:e.registerCounter("libp2p_noise_xxhandshake_successes_total",{help:"Total count of noise xxHandshakes successes_"}),xxHandshakeErrors:e.registerCounter("libp2p_noise_xxhandshake_error_total",{help:"Total count of noise xxHandshakes errors"}),encryptedPackets:e.registerCounter("libp2p_noise_encrypted_packets_total",{help:"Total count of noise encrypted packets successfully"}),decryptedPackets:e.registerCounter("libp2p_noise_decrypted_packets_total",{help:"Total count of noise decrypted packets"}),decryptErrors:e.registerCounter("libp2p_noise_decrypt_errors_total",{help:"Total count of noise decrypt errors"})}}(i):void 0,this.staticKey=r?a.generateX25519KeyPairFromSeed(r):a.generateX25519KeyPair(),this.prologue=o??b(0)}[Symbol.toStringTag]="@chainsafe/libp2p-noise";[Vu]=["@libp2p/connection-encryption","@chainsafe/libp2p-noise"];async secureOutbound(...e){const{localPeer:t,connection:r,remotePeer:n}=this.parseArgs(e),s=gh(r,{lengthEncoder:td,lengthDecoder:rd,maxDataLength:mh});if(!t.privateKey)throw new eo("local peerId does not contain private key","ERR_NO_PRIVATE_KEY");const o=await qu(t.privateKey),i=n?.publicKey,a=await this.performHandshakeInitiator(s,o,i),c=await this.createSecureConnection(s,a);return r.source=c.source,r.sink=c.sink,{conn:r,remoteExtensions:a.payload.extensions,remotePeer:await sh(a.payload.identityKey)}}async secureInbound(...e){const{localPeer:t,connection:r,remotePeer:n}=this.parseArgs(e),s=gh(r,{lengthEncoder:td,lengthDecoder:rd,maxDataLength:mh});if(!t.privateKey)throw new eo("local peerId does not contain private key","ERR_NO_PRIVATE_KEY");const o=await qu(t.privateKey),i=n?.publicKey,a=await this.performHandshakeResponder(s,o,i),c=await this.createSecureConnection(s,a);return r.source=c.source,r.sink=c.sink,{conn:r,remoteExtensions:a.payload.extensions,remotePeer:await sh(a.payload.identityKey)}}async performHandshakeInitiator(e,t,r){let n;try{n=await async function(e){const{log:t,connection:r,crypto:n,privateKey:s,prologue:o,s:i,remoteIdentityKey:a,extensions:c}=e,l=await md(s,i.publicKey,c),u=new fd({crypto:n,protocolName:"Noise_XX_25519_ChaChaPoly_SHA256",initiator:!0,prologue:o,s:i});nd(u.s,t),t.trace("Stage 0 - Initiator starting to send first message."),await r.write(u.writeMessageA(ud)),t.trace("Stage 0 - Initiator finished sending first message."),sd(u.e,t),t.trace("Stage 1 - Initiator waiting to receive first message from responder...");const h=u.readMessageB(await r.read());var d,p;t.trace("Stage 1 - Initiator received the message."),od(u.re,t),d=u.rs,(p=t).enabled&&bh&&p(d?`REMOTE_STATIC_PUBLIC_KEY ${sn(d.subarray(),"hex")}`:"Missing remote static public key."),t.trace("Initiator going to check remote's signature...");const f=await bd(h,u.rs,a);t.trace("All good with the signature!"),t.trace("Stage 2 - Initiator sending third handshake message."),await r.write(u.writeMessageC(l)),t.trace("Stage 2 - Initiator sent message with signed payload.");const[g,y]=u.ss.split();return id(g,y,t),{payload:f,encrypt:e=>g.encryptWithAd(ud,e),decrypt:(e,t)=>y.decryptWithAd(ud,e,t)}}({connection:e,privateKey:t,remoteIdentityKey:r,log:this.components.logger.forComponent("libp2p:noise:xxhandshake"),crypto:this.crypto,prologue:this.prologue,s:this.staticKey,extensions:this.extensions}),this.metrics?.xxHandshakeSuccesses.increment()}catch(e){throw this.metrics?.xxHandshakeErrors.increment(),e}return n}async performHandshakeResponder(e,t,r){let n;try{n=await async function(e){const{log:t,connection:r,crypto:n,privateKey:s,prologue:o,s:i,remoteIdentityKey:a,extensions:c}=e,l=await md(s,i.publicKey,c),u=new fd({crypto:n,protocolName:"Noise_XX_25519_ChaChaPoly_SHA256",initiator:!1,prologue:o,s:i});nd(u.s,t),t.trace("Stage 0 - Responder waiting to receive first message."),u.readMessageA(await r.read()),t.trace("Stage 0 - Responder received first message."),od(u.re,t),t.trace("Stage 1 - Responder sending out first message with signed payload and static key."),await r.write(u.writeMessageB(l)),t.trace("Stage 1 - Responder sent the second handshake message with signed payload."),sd(u.e,t),t.trace("Stage 2 - Responder waiting for third handshake message...");const h=u.readMessageC(await r.read());t.trace("Stage 2 - Responder received the message, finished handshake.");const d=await bd(h,u.rs,a),[p,f]=u.ss.split();return id(p,f,t),{payload:d,encrypt:e=>f.encryptWithAd(ud,e),decrypt:(e,t)=>p.decryptWithAd(ud,e,t)}}({connection:e,privateKey:t,remoteIdentityKey:r,log:this.components.logger.forComponent("libp2p:noise:xxhandshake"),crypto:this.crypto,prologue:this.prologue,s:this.staticKey,extensions:this.extensions}),this.metrics?.xxHandshakeSuccesses.increment()}catch(e){throw this.metrics?.xxHandshakeErrors.increment(),e}return n}async createSecureConnection(e,t){const[r,n]=function(){const e=yh(),t=yh();return[{source:e.source,sink:t.sink},{source:t.source,sink:e.sink}]}(),s=e.unwrap();return await Zn(r,function(e,t){return async function*(r){for await(const n of r)for(let r=0;rn.length&&(o=n.length),s=n instanceof Uint8Array?e.encrypt(n.subarray(r,o)):e.encrypt(n.sublist(r,o)),t?.encryptedPackets.increment(),yield new Bn(td(s.byteLength),s)}}}(t,this.metrics),s,(e=>zn(e,{lengthDecoder:rd})),function(e,t){return async function*(r){for await(const n of r)for(let r=0;rn.length&&(s=n.length),s-16new vd(t,e)}const Sd=Symbol.for("@libp2p/peer-discovery"),Ad=ep("dns4"),_d=ep("dns6"),kd=ep("dnsaddr"),Id=Zd(ep("dns"),kd,Ad,_d),Rd=Zd(ep("ip4"),ep("ip6")),Td=Zd(Qd(Rd,ep("tcp")),Qd(Id,ep("tcp"))),Cd=Qd(Rd,ep("udp")),Nd=Qd(Cd,ep("utp")),xd=Qd(Cd,ep("quic")),Pd=Qd(Cd,ep("quic-v1")),Od=Zd(Qd(Td,ep("ws")),Qd(Id,ep("ws"))),Dd=Zd(Qd(Od,ep("p2p")),Od),Ld=Zd(Qd(Td,ep("wss")),Qd(Id,ep("wss")),Qd(Td,ep("tls"),ep("ws")),Qd(Id,ep("tls"),ep("ws"))),Bd=Zd(Qd(Ld,ep("p2p")),Ld),Ud=Zd(Qd(Td,ep("http")),Qd(Rd,ep("http")),Qd(Id,ep("http"))),Md=Zd(Qd(Td,ep("https")),Qd(Rd,ep("https")),Qd(Id,ep("https"))),Fd=Qd(Cd,ep("webrtc-direct"),ep("certhash")),$d=Zd(Qd(Fd,ep("p2p")),Fd),Hd=Qd(Pd,ep("webtransport"),ep("certhash"),ep("certhash")),qd=Zd(Qd(Hd,ep("p2p")),Hd),Vd=Zd(Qd(Dd,ep("p2p-webrtc-star"),ep("p2p")),Qd(Bd,ep("p2p-webrtc-star"),ep("p2p")),Qd(Dd,ep("p2p-webrtc-star")),Qd(Bd,ep("p2p-webrtc-star"))),jd=(Zd(Qd(Dd,ep("p2p-websocket-star"),ep("p2p")),Qd(Bd,ep("p2p-websocket-star"),ep("p2p")),Qd(Dd,ep("p2p-websocket-star")),Qd(Bd,ep("p2p-websocket-star"))),Zd(Qd(Ud,ep("p2p-webrtc-direct"),ep("p2p")),Qd(Md,ep("p2p-webrtc-direct"),ep("p2p")),Qd(Ud,ep("p2p-webrtc-direct")),Qd(Md,ep("p2p-webrtc-direct")))),Kd=Zd(Od,Ld,Ud,Md,Vd,jd,Td,Nd,xd,Id,$d,qd),zd=(Zd(Qd(Kd,ep("p2p-stardust"),ep("p2p")),Qd(Kd,ep("p2p-stardust"))),Zd(Qd(Kd,ep("p2p")),Vd,jd,$d,qd,ep("p2p"))),Gd=Zd(Qd(zd,ep("p2p-circuit"),zd),Qd(zd,ep("p2p-circuit")),Qd(ep("p2p-circuit"),zd),Qd(Kd,ep("p2p-circuit")),Qd(ep("p2p-circuit"),Kd),ep("p2p-circuit")),Wd=()=>Zd(Qd(Gd,Wd),Gd),Yd=Wd(),Jd=Zd(Qd(Yd,zd,Yd),Qd(zd,Yd),Qd(Yd,zd),Yd,zd);function Xd(e){return function(t){let r;try{r=Mo(t)}catch(e){return!1}const n=e(r.protoNames());return null!==n&&(!0===n||!1===n?n:0===n.length)}}function Qd(...e){function t(t){if(t.length(r="function"==typeof e?e().partialMatch(t):e.partialMatch(t),Array.isArray(r)&&(t=r),null===r))),r}return{toString:function(){return"{ "+e.join(" ")+" }"},input:e,matches:Xd(t),partialMatch:t}}function Zd(...e){function t(t){let r=null;return e.some((e=>{const n="function"==typeof e?e().partialMatch(t):e.partialMatch(t);return null!=n&&(r=n,!0)})),r}return{toString:function(){return"{ "+e.join(" ")+" }"},input:e,matches:Xd(t),partialMatch:t}}function ep(e){const t=e;return{toString:function(){return t},matches:function(e){let r;try{r=Mo(e)}catch(e){return!1}const n=r.protoNames();return 1===n.length&&n[0]===t},partialMatch:function(e){return 0===e.length?null:e[0]===t?e.slice(1):null}}}Zd(Qd(Yd,ep("webrtc"),ep("p2p")),Qd(Yd,ep("webrtc")),Qd(Kd,ep("webrtc"),ep("p2p")),Qd(Kd,ep("webrtc")),ep("webrtc"));class tp extends Fs{static tag="bootstrap";log;timer;list;timeout;components;_init;constructor(e,t={list:[]}){if(null==t.list||0===t.list.length)throw new Error("Bootstrap requires a list of peer addresses");super(),this.components=e,this.log=e.logger.forComponent("libp2p:bootstrap"),this.timeout=t.timeout??1e3,this.list=[];for(const e of t.list){if(!Jd.matches(e)){this.log.error("Invalid multiaddr");continue}const t=Mo(e),r=t.getPeerId();if(null==r){this.log.error("Invalid bootstrap multiaddr without peer id");continue}const n={id:rh(r),multiaddrs:[t]};this.list.push(n)}this._init=t}[Sd]=this;[Symbol.toStringTag]="@libp2p/bootstrap";[Vu]=["@libp2p/peer-discovery"];isStarted(){return Boolean(this.timer)}start(){this.isStarted()||(this.log("Starting bootstrap node discovery, discovering peers after %s ms",this.timeout),this.timer=setTimeout((()=>{this._discoverBootstrapPeers().catch((e=>{this.log.error(e)}))}),this.timeout))}async _discoverBootstrapPeers(){if(null!=this.timer)for(const e of this.list){if(await this.components.peerStore.merge(e.id,{tags:{[this._init.tagName??"bootstrap"]:{value:this._init.tagValue??50,ttl:this._init.tagTTL??12e4}}}),null==this.timer)return;this.safeDispatchEvent("peer",{detail:e})}}stop(){null!=this.timer&&clearTimeout(this.timer),this.timer=void 0}}const rp=Uint8Array.from([3,1]);var np;!function(e){let t,r;!function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.multiaddr&&e.multiaddr.byteLength>0&&(t.uint32(10),t.bytes(e.multiaddr)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t)=>{const r={multiaddr:new Uint8Array(0)},n=null==t?e.len:e.pos+t;for(;e.pos>>3==1?r.multiaddr=e.bytes():e.skipType(7&t)}return r}))),t),e.encode=t=>jt(t,e.codec()),e.decode=t=>Y(t,e.codec())}(t=e.AddressInfo||(e.AddressInfo={})),e.codec=()=>(null==r&&(r=Ar(((t,r,n={})=>{if(!1!==n.lengthDelimited&&r.fork(),null!=t.peerId&&t.peerId.byteLength>0&&(r.uint32(10),r.bytes(t.peerId)),null!=t.seq&&0n!==t.seq&&(r.uint32(16),r.uint64(t.seq)),null!=t.addresses)for(const n of t.addresses)r.uint32(26),e.AddressInfo.codec().encode(n,r);!1!==n.lengthDelimited&&r.ldelim()}),((t,r)=>{const n={peerId:new Uint8Array(0),seq:0n,addresses:[]},s=null==r?t.len:t.pos+r;for(;t.pos>>3){case 1:n.peerId=t.bytes();break;case 2:n.seq=t.uint64();break;case 3:n.addresses.push(e.AddressInfo.codec().decode(t,t.uint32()));break;default:t.skipType(7&r)}}return n}))),r),e.encode=t=>jt(t,e.codec()),e.decode=t=>Y(t,e.codec())}(np||(np={}));class sp{static createFromProtobuf=e=>{const t=np.decode(e),r=nh(t.peerId),n=(t.addresses??[]).map((e=>Mo(e.multiaddr))),s=t.seq;return new sp({peerId:r,multiaddrs:n,seqNumber:s})};static DOMAIN="libp2p-peer-record";static CODEC=rp;peerId;multiaddrs;seqNumber;domain=sp.DOMAIN;codec=sp.CODEC;marshaled;constructor(e){const{peerId:t,multiaddrs:r,seqNumber:n}=e;this.peerId=t,this.multiaddrs=r??[],this.seqNumber=n??BigInt(Date.now())}marshal(){return null==this.marshaled&&(this.marshaled=np.encode({peerId:this.peerId.toBytes(),seq:BigInt(this.seqNumber),addresses:this.multiaddrs.map((e=>({multiaddr:e.bytes})))})),this.marshaled}equals(e){return e instanceof sp&&!!this.peerId.equals(e.peerId)&&this.seqNumber===e.seqNumber&&!!function(e,t){const r=(e,t)=>e.toString().localeCompare(t.toString());return e.length===t.length&&(t.sort(r),e.sort(r).every(((e,r)=>t[r].equals(e))))}(this.multiaddrs,e.multiaddrs)}}var op;!function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.publicKey&&e.publicKey.byteLength>0&&(t.uint32(10),t.bytes(e.publicKey)),null!=e.payloadType&&e.payloadType.byteLength>0&&(t.uint32(18),t.bytes(e.payloadType)),null!=e.payload&&e.payload.byteLength>0&&(t.uint32(26),t.bytes(e.payload)),null!=e.signature&&e.signature.byteLength>0&&(t.uint32(42),t.bytes(e.signature)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t)=>{const r={publicKey:new Uint8Array(0),payloadType:new Uint8Array(0),payload:new Uint8Array(0),signature:new Uint8Array(0)},n=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:r.publicKey=e.bytes();break;case 2:r.payloadType=e.bytes();break;case 3:r.payload=e.bytes();break;case 5:r.signature=e.bytes();break;default:e.skipType(7&t)}}return r}))),t),e.encode=t=>jt(t,e.codec()),e.decode=t=>Y(t,e.codec())}(op||(op={}));class ip{static createFromProtobuf=async e=>{const t=op.decode(e),r=await sh(t.publicKey);return new ip({peerId:r,payloadType:t.payloadType,payload:t.payload,signature:t.signature})};static seal=async(e,t)=>{if(null==t.privateKey)throw new Error("Missing private key");const r=e.domain,n=e.codec,s=e.marshal(),o=ap(r,n,s),i=await qu(t.privateKey),a=await i.sign(o.subarray());return new ip({peerId:t,payloadType:n,payload:s,signature:a})};static openAndCertify=async(e,t)=>{const r=await ip.createFromProtobuf(e);if(!await r.validate(t))throw new eo("envelope signature is not valid for the given domain","ERR_SIGNATURE_NOT_VALID");return r};peerId;payloadType;payload;signature;marshaled;constructor(e){const{peerId:t,payloadType:r,payload:n,signature:s}=e;this.peerId=t,this.payloadType=r,this.payload=n,this.signature=s}marshal(){if(null==this.peerId.publicKey)throw new Error("Missing public key");return null==this.marshaled&&(this.marshaled=op.encode({publicKey:this.peerId.publicKey,payloadType:this.payloadType,payload:this.payload.subarray(),signature:this.signature})),this.marshaled}equals(e){return Pn(this.marshal(),e.marshal())}async validate(e){const t=ap(e,this.payloadType,this.payload);if(null==this.peerId.publicKey)throw new Error("Missing public key");return $u(this.peerId.publicKey).verify(t.subarray(),this.signature)}}const ap=(e,t,r)=>{const n=Nt(e),s=P(n.byteLength),o=P(t.length),i=P(r.length);return new Bn(s,n,o,t,i,r)},cp=e=>({match:t=>!(t.length<1)&&!!e(t[0])&&t.slice(1),pattern:"fn"}),lp=e=>({match:t=>cp((t=>t===e)).match(t),pattern:e}),up=()=>({match:e=>cp((e=>"string"==typeof e)).match(e),pattern:"{string}"}),hp=()=>({match:e=>cp((e=>!isNaN(parseInt(e)))).match(e),pattern:"{number}"}),dp=()=>({match:e=>{if(e.length<2)return!1;if("p2p"!==e[0]&&"ipfs"!==e[0])return!1;if(!e[1].startsWith("Q")&&!e[1].startsWith("1"))return!1;try{ke.decode(`z${e[1]}`)}catch(e){return!1}return e.slice(2)},pattern:"/p2p/{peerid}"}),pp=()=>({match:e=>{if(e.length<2)return!1;if("certhash"!==e[0])return!1;try{Ce.decode(e[1])}catch{return!1}return e.slice(2)},pattern:"/certhash/{certhash}"}),fp=e=>({match:t=>{const r=e.match(t);return!1===r?t:r},pattern:`optional(${e.pattern})`}),gp=(...e)=>({match:t=>{let r;for(const n of e){const e=n.match(t);!1!==e&&(null==r||e.lengthe.pattern)).join(", ")})`}),yp=(...e)=>({match:t=>{for(const r of e){const e=r.match(t);if(!1===e)return!1;t=e}return t},pattern:`and(${e.map((e=>e.pattern)).join(", ")})`});function mp(...e){function t(t){let r=(e=>e.toString().split("/").slice(1))(t);for(const t of e){const e=t.match(r);if(!1===e)return!1;r=e}return r}return{matches:function(e){return!1!==t(e)},exactMatch:function(e){const r=t(e);return!1!==r&&0===r.length}}}const bp=yp(lp("dns4"),up()),wp=yp(lp("dns6"),up()),vp=yp(lp("dnsaddr"),up()),Ep=yp(lp("dns"),up()),Sp=(mp(bp),mp(wp),mp(vp),mp(gp(Ep,vp,bp,wp)),yp(lp("ip4"),cp(io))),Ap=yp(lp("ip6"),cp(ao)),_p=gp(Sp,Ap),kp=gp(_p,Ep,bp,wp,vp),Ip=mp(kp),Rp=(mp(Sp),mp(Ap),mp(_p),yp(kp,lp("tcp"),hp())),Tp=yp(kp,lp("udp"),hp()),Cp=(mp(Rp),mp(Tp),yp(Tp,lp("quic"))),Np=yp(Tp,lp("quic-v1")),xp=gp(Cp,Np),Pp=(mp(Cp),mp(Np),gp(kp,Rp,Tp,Cp,Np)),Op=gp(yp(Pp,lp("ws"),fp(dp()))),Dp=(mp(Op),gp(yp(Pp,lp("wss"),fp(dp())),yp(Pp,lp("tls"),lp("ws"),fp(dp())))),Lp=(mp(Dp),yp(Tp,lp("webrtc-direct"),fp(pp()),fp(pp()),fp(dp()))),Bp=(mp(Lp),yp(Np,lp("webtransport"),fp(pp()),fp(pp()),fp(dp()))),Up=(mp(Bp),gp(Op,Dp,yp(Rp,fp(dp())),yp(xp,fp(dp())),yp(kp,fp(dp())),Lp,Bp,dp())),Mp=(mp(Up),mp(yp(Up,lp("p2p-circuit"),dp())));function Fp(e,t){const r=gh(e,t),n={read:async(e,t)=>{const n=await r.read(t);return e.decode(n)},write:async(e,t,n)=>{await r.write(t.encode(e),n)},writeV:async(e,t,n)=>{await r.writeV(e.map((e=>t.encode(e))),n)},pb:e=>({read:async t=>n.read(e,t),write:async(t,r)=>n.write(t,e,r),writeV:async(t,r)=>n.writeV(t,e,r),unwrap:()=>n}),unwrap:()=>r.unwrap()};return n}var $p;mp(gp(yp(Up,lp("p2p-circuit"),lp("webrtc"),fp(dp())),yp(Up,lp("webrtc"),fp(dp())),lp("webrtc"))),mp(gp(yp(kp,lp("tcp"),hp(),lp("http"),fp(dp())),yp(kp,lp("http"),fp(dp())))),mp(gp(yp(kp,lp("tcp"),gp(yp(lp("443"),lp("http")),yp(hp(),lp("https"))),fp(dp())),yp(kp,lp("tls"),lp("http"),fp(dp())),yp(kp,lp("https"),fp(dp())))),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{if(!1!==r.lengthDelimited&&t.fork(),null!=e.protocolVersion&&(t.uint32(42),t.string(e.protocolVersion)),null!=e.agentVersion&&(t.uint32(50),t.string(e.agentVersion)),null!=e.publicKey&&(t.uint32(10),t.bytes(e.publicKey)),null!=e.listenAddrs)for(const r of e.listenAddrs)t.uint32(18),t.bytes(r);if(null!=e.observedAddr&&(t.uint32(34),t.bytes(e.observedAddr)),null!=e.protocols)for(const r of e.protocols)t.uint32(26),t.string(r);null!=e.signedPeerRecord&&(t.uint32(66),t.bytes(e.signedPeerRecord)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t)=>{const r={listenAddrs:[],protocols:[]},n=null==t?e.len:e.pos+t;for(;e.pos>>3){case 5:r.protocolVersion=e.string();break;case 6:r.agentVersion=e.string();break;case 1:r.publicKey=e.bytes();break;case 2:r.listenAddrs.push(e.bytes());break;case 4:r.observedAddr=e.bytes();break;case 3:r.protocols.push(e.string());break;case 8:r.signedPeerRecord=e.bytes();break;default:e.skipType(7&t)}}return r}))),t),e.encode=t=>jt(t,e.codec()),e.decode=t=>Y(t,e.codec())}($p||($p={}));var Hp=__webpack_require__(4866);const qp="object"==typeof window&&"object"==typeof document&&9===document.nodeType,Vp=Hp(),jp=qp&&!Vp,Kp=Vp&&!qp,zp=Vp&&qp,Gp=void 0!==globalThis.process&&void 0!==globalThis.process.release&&"node"===globalThis.process.release.name&&!Vp,Wp="function"==typeof importScripts&&"undefined"!=typeof self&&"undefined"!=typeof WorkerGlobalScope&&self instanceof WorkerGlobalScope,Yp=(void 0!==globalThis.process&&void 0!==globalThis.process.env&&globalThis.process.env.NODE_ENV,"undefined"!=typeof navigator&&"ReactNative"===navigator.product),Jp="ipfs",Xp=5e3,Qp=1,Zp=1,ef=10,tf=8192,rf=!0,nf=!0;class sf{host;protocol;started;timeout;peerId;peerStore;registrar;addressManager;maxInboundStreams;maxOutboundStreams;maxMessageSize;maxObservedAddresses;events;runOnTransientConnection;log;constructor(e,t){var r,n;this.protocol=t.protocol,this.started=!1,this.peerId=e.peerId,this.peerStore=e.peerStore,this.registrar=e.registrar,this.addressManager=e.addressManager,this.events=e.events,this.log=t.log,this.timeout=t.timeout??Xp,this.maxInboundStreams=t.maxInboundStreams??Qp,this.maxOutboundStreams=t.maxOutboundStreams??Zp,this.maxMessageSize=t.maxMessageSize??tf,this.maxObservedAddresses=t.maxObservedAddresses??ef,this.runOnTransientConnection=t.runOnTransientConnection??nf,this.host={protocolVersion:`${t.protocolPrefix??Jp}/0.1.0`,agentVersion:(r=e.nodeInfo,n=t.agentVersion,null!=n||(n=`${r.name}/${r.version}`,Gp||Kp?n+=` UserAgent=${globalThis.process.version}`:(jp||Wp||zp||Yp)&&(n+=` UserAgent=${globalThis.navigator.userAgent}`)),n)}}isStarted(){return this.started}async start(){this.started||(await this.peerStore.merge(this.peerId,{metadata:{AgentVersion:Nt(this.host.agentVersion),ProtocolVersion:Nt(this.host.protocolVersion)}}),await this.registrar.handle(this.protocol,(e=>{this.handleProtocol(e).catch((e=>{this.log.error(e)}))}),{maxInboundStreams:this.maxInboundStreams,maxOutboundStreams:this.maxOutboundStreams,runOnTransientConnection:this.runOnTransientConnection}),this.started=!0)}async stop(){await this.registrar.unhandle(this.protocol),this.started=!1}}class of extends sf{constructor(e,t={}){super(e,{...t,protocol:`/${t.protocolPrefix??Jp}/id/1.0.0`,log:e.logger.forComponent("libp2p:identify")}),(t.runOnConnectionOpen??rf)&&e.events.addEventListener("connection:open",(e=>{const t=e.detail;this.identify(t).catch((e=>{this.log.error("error during identify trigged by connection:open",e)}))}))}[Vu]=["@libp2p/identify"];async _identify(e,t={}){let r;if(null==t.signal){const e=AbortSignal.timeout(this.timeout);t={...t,signal:e}}try{r=await e.newStream(this.protocol,{...t,runOnTransientConnection:this.runOnTransientConnection});const n=Fp(r,{maxDataLength:this.maxMessageSize}).pb($p),s=await n.read(t);return await r.close(t),s}catch(e){throw this.log.error("error while reading identify message",e),r?.abort(e),e}}async identify(e,t={}){const r=await this._identify(e,t),{publicKey:n,protocols:s,observedAddr:o}=r;if(null==n)throw new eo("public key was missing from identify message","ERR_MISSING_PUBLIC_KEY");const i=await sh(n);if(!e.remotePeer.equals(i))throw new eo("identified peer does not match the expected peer","ERR_INVALID_PEER");if(this.peerId.equals(i))throw new eo("identified peer is our own peer id?","ERR_INVALID_PEER");const a=function(e){if(null!=e&&e.length>0)try{return Mo(e)}catch{}}(o);return this.log("identify completed for peer %p and protocols %o",i,s),this.log("our observed address is %a",a),null!=a&&this.addressManager.getObservedAddrs().length<(this.maxObservedAddresses??1/0)&&(this.log("storing our observed address %a",a),this.addressManager.addObservedAddr(a)),async function(e,t,r,n,s){if(r("received identify from %p",n.remotePeer),null==s)throw new eo("message was null or undefined","ERR_INVALID_MESSAGE");const o={};if(s.listenAddrs.length>0&&(o.addresses=s.listenAddrs.map((e=>({isCertified:!1,multiaddr:Mo(e)})))),s.protocols.length>0&&(o.protocols=s.protocols),null!=s.publicKey&&(o.publicKey=s.publicKey,!(await sh(s.publicKey)).equals(n.remotePeer)))throw new eo("public key did not match remote PeerId","ERR_INVALID_PUBLIC_KEY");let i;if(null!=s.signedPeerRecord){r("received signedPeerRecord from %p",n.remotePeer);let t=s.signedPeerRecord;const a=await ip.openAndCertify(t,sp.DOMAIN);let c,l=sp.createFromProtobuf(a.payload);if(!l.peerId.equals(a.peerId))throw new eo("signing key does not match PeerId in the PeerRecord","ERR_INVALID_SIGNING_KEY");if(!n.remotePeer.equals(l.peerId))throw new eo("signing key does not match remote PeerId","ERR_INVALID_PEER_RECORD_KEY");try{c=await e.get(l.peerId)}catch(e){if("ERR_NOT_FOUND"!==e.code)throw e}if(null!=c&&(o.metadata=c.metadata,null!=c.peerRecordEnvelope)){const e=await ip.createFromProtobuf(c.peerRecordEnvelope),n=sp.createFromProtobuf(e.payload);n.seqNumber>=l.seqNumber&&(r("sequence number was lower or equal to existing sequence number - stored: %d received: %d",n.seqNumber,l.seqNumber),l=n,t=c.peerRecordEnvelope)}o.peerRecordEnvelope=t,o.addresses=l.multiaddrs.map((e=>({isCertified:!0,multiaddr:e}))),i={seq:l.seqNumber,addresses:l.multiaddrs}}else r("%p did not send a signed peer record",n.remotePeer);if(r("patching %p with",n.remotePeer,o),await e.patch(n.remotePeer,o),null!=s.agentVersion||null!=s.protocolVersion){const t={};null!=s.agentVersion&&(t.AgentVersion=Nt(s.agentVersion)),null!=s.protocolVersion&&(t.ProtocolVersion=Nt(s.protocolVersion)),r("merging %p metadata",n.remotePeer,t),await e.merge(n.remotePeer,{metadata:t})}const a={peerId:n.remotePeer,protocolVersion:s.protocolVersion,agentVersion:s.agentVersion,publicKey:s.publicKey,listenAddrs:s.listenAddrs.map((e=>Mo(e))),observedAddr:null==s.observedAddr?void 0:Mo(s.observedAddr),protocols:s.protocols,signedPeerRecord:i,connection:n};return t.safeDispatchEvent("peer:identify",{detail:a}),a}(this.peerStore,this.events,this.log,e,r)}async handleProtocol(e){const{connection:t,stream:r}=e,n=AbortSignal.timeout(this.timeout);try{const e=this.peerId.publicKey??new Uint8Array(0),s=await this.peerStore.get(this.peerId),o=this.addressManager.getAddresses().map((e=>e.decapsulateCode(mo("p2p").code)));let i=s.peerRecordEnvelope;if(o.length>0&&null==i){const e=new sp({peerId:this.peerId,multiaddrs:o});i=(await ip.seal(e,this.peerId)).marshal().subarray()}let a=t.remoteAddr.bytes;Ip.matches(t.remoteAddr)||(a=void 0);const c=Fp(r).pb($p);await c.write({protocolVersion:this.host.protocolVersion,agentVersion:this.host.agentVersion,publicKey:e,listenAddrs:o.map((e=>e.bytes)),signedPeerRecord:i,observedAddr:a,protocols:s.protocols},{signal:n}),await r.close({signal:n})}catch(e){this.log.error("could not respond to identify request",e),r.abort(e)}}}function af(e={}){return t=>new of(t,e)}function cf(e,t){const r=function(e){if(null!=e){if("function"==typeof e[Symbol.iterator])return e[Symbol.iterator]();if("function"==typeof e[Symbol.asyncIterator])return e[Symbol.asyncIterator]();if("function"==typeof e.next)return e}throw new Error("argument is not an iterator or iterable")}(e).return?.();var n;null!=(n=r)&&"function"==typeof n.then&&"function"==typeof n.catch&&"function"==typeof n.finally&&r.catch((e=>{t.error("could not cause iterator to return",e)}))}const lf=()=>{const e=new Error("Delay aborted");return e.name="AbortError",e},uf=new WeakMap,hf=function({clearTimeout:e,setTimeout:t}={}){return(r,{value:n,signal:s}={})=>{if(s?.aborted)return Promise.reject(lf());let o,i,a;const c=e??clearTimeout,l=()=>{c(o),a(lf())},u=new Promise(((e,c)=>{i=()=>{s&&s.removeEventListener("abort",l),e(n)},a=c,o=(t??setTimeout)(i,r)}));return s&&s.addEventListener("abort",l,{once:!0}),uf.set(u,(()=>{c(o),o=null,i()})),u}}();class df{memoryStorage;points;duration;blockDuration;execEvenly;execEvenlyMinDelayMs;keyPrefix;constructor(e={}){this.points=e.points??4,this.duration=e.duration??1,this.blockDuration=e.blockDuration??0,this.execEvenly=e.execEvenly??!1,this.execEvenlyMinDelayMs=e.execEvenlyMinDelayMs??1e3*this.duration/this.points,this.keyPrefix=e.keyPrefix??"rlflx",this.memoryStorage=new pf}async consume(e,t=1,r={}){const n=this.getKey(e),s=this._getKeySecDuration(r);let o=this.memoryStorage.incrby(n,t,s);if(o.remainingPoints=Math.max(this.points-o.consumedPoints,0),o.consumedPoints>this.points)throw this.blockDuration>0&&o.consumedPoints<=this.points+t&&(o=this.memoryStorage.set(n,o.consumedPoints,this.blockDuration)),new eo("Rate limit exceeded","ERR_RATE_LIMIT_EXCEEDED",o);if(this.execEvenly&&o.msBeforeNext>0&&!o.isFirstInDuration){let e=Math.ceil(o.msBeforeNext/(o.remainingPoints+2));e=0?r:this.duration);return this.memoryStorage.set(this.getKey(e),t,r),{remainingPoints:0,msBeforeNext:0===n?-1:n,consumedPoints:t,isFirstInDuration:!1}}get(e){const t=this.memoryStorage.get(this.getKey(e));return null!=t&&(t.remainingPoints=Math.max(this.points-t.consumedPoints,0)),t}delete(e){this.memoryStorage.delete(this.getKey(e))}_getKeySecDuration(e){return null!=e?.customDuration&&e.customDuration>=0?e.customDuration:this.duration}getKey(e){return this.keyPrefix.length>0?`${this.keyPrefix}:${e}`:e}parseKey(e){return e.substring(this.keyPrefix.length)}}class pf{storage;constructor(){this.storage=new Map}incrby(e,t,r){const n=this.storage.get(e);if(null!=n){const s=null!=n.expiresAt?n.expiresAt.getTime()-(new Date).getTime():-1;return null==n.expiresAt||s>0?(n.value+=t,{remainingPoints:0,msBeforeNext:s,consumedPoints:n.value,isFirstInDuration:!1}):this.set(e,t,r)}return this.set(e,t,r)}set(e,t,r){const n=1e3*r,s=this.storage.get(e);null!=s&&clearTimeout(s.timeoutId);const o={value:t,expiresAt:n>0?new Date(Date.now()+n):void 0};return this.storage.set(e,o),n>0&&(o.timeoutId=setTimeout((()=>{this.storage.delete(e)}),n),null!=o.timeoutId.unref&&o.timeoutId.unref()),{remainingPoints:0,msBeforeNext:0===n?-1:n,consumedPoints:o.value,isFirstInDuration:!0}}get(e){const t=this.storage.get(e);if(null!=t)return{remainingPoints:0,msBeforeNext:null!=t.expiresAt?t.expiresAt.getTime()-(new Date).getTime():-1,consumedPoints:t.value,isFirstInDuration:!1}}delete(e){const t=this.storage.get(e);return null!=t&&(null!=t.timeoutId&&clearTimeout(t.timeoutId),this.storage.delete(e),!0)}}var ff;!function(e){e[e.NEW_STREAM=0]="NEW_STREAM",e[e.MESSAGE_RECEIVER=1]="MESSAGE_RECEIVER",e[e.MESSAGE_INITIATOR=2]="MESSAGE_INITIATOR",e[e.CLOSE_RECEIVER=3]="CLOSE_RECEIVER",e[e.CLOSE_INITIATOR=4]="CLOSE_INITIATOR",e[e.RESET_RECEIVER=5]="RESET_RECEIVER",e[e.RESET_INITIATOR=6]="RESET_INITIATOR"}(ff||(ff={}));const gf=Object.freeze({0:"NEW_STREAM",1:"MESSAGE_RECEIVER",2:"MESSAGE_INITIATOR",3:"CLOSE_RECEIVER",4:"CLOSE_INITIATOR",5:"RESET_RECEIVER",6:"RESET_INITIATOR"}),yf=Object.freeze({NEW_STREAM:ff.NEW_STREAM,MESSAGE:ff.MESSAGE_INITIATOR,CLOSE:ff.CLOSE_INITIATOR,RESET:ff.RESET_INITIATOR}),mf=Object.freeze({MESSAGE:ff.MESSAGE_RECEIVER,CLOSE:ff.CLOSE_RECEIVER,RESET:ff.RESET_RECEIVER}),bf=1<<20;class wf{_buffer;_headerInfo;_maxMessageSize;_maxUnprocessedMessageQueueSize;constructor(e=bf,t=4194304){this._buffer=new Bn,this._headerInfo=null,this._maxMessageSize=e,this._maxUnprocessedMessageQueueSize=t}write(e){if(null==e||0===e.length)return[];if(this._buffer.append(e),this._buffer.byteLength>this._maxUnprocessedMessageQueueSize)throw Object.assign(new Error("unprocessed message queue size too large!"),{code:"ERR_MSG_QUEUE_TOO_BIG"});const t=[];for(;0!==this._buffer.length;){if(null==this._headerInfo)try{this._headerInfo=this._decodeHeader(this._buffer)}catch(e){if("ERR_MSG_TOO_BIG"===e.code)throw e;break}const{id:e,type:r,length:n,offset:s}=this._headerInfo;if(this._buffer.length-sthis._maxMessageSize)throw Object.assign(new Error("message size too large!"),{code:"ERR_MSG_TOO_BIG"});return{id:t>>3,type:o,offset:r+s,length:n}}}const vf=128,Ef=127;function Sf(e,t=0){let r,n=0,s=0,o=t;const i=e.length;do{if(o>=i||s>49)throw t=0,new RangeError("Could not decode varint");r=e.get(o++),n+=s<28?(r&Ef)<=vf);return{value:n,offset:t=o-t}}const Af=10240,_f=new class{_pool;_poolOffset;constructor(){this._pool=w(Af),this._poolOffset=0}write(e,t){const r=this._pool;let n=this._poolOffset;P(e.id<<3|e.type,r,n),n+=C(e.id<<3|e.type),e.type!==ff.NEW_STREAM&&e.type!==ff.MESSAGE_INITIATOR&&e.type!==ff.MESSAGE_RECEIVER||null==e.data?(P(0,r,n),n+=C(0)):(P(e.data.length,r,n),n+=C(e.data.length));const s=r.subarray(this._poolOffset,n);Af-n<100?(this._pool=w(Af),this._poolOffset=0):this._poolOffset=n,t.append(s),e.type!==ff.NEW_STREAM&&e.type!==ff.MESSAGE_INITIATOR&&e.type!==ff.MESSAGE_RECEIVER||null==e.data||t.append(e.data)}};function kf(e){return null!=e&&"function"==typeof e.then&&"function"==typeof e.catch&&"function"==typeof e.finally}class If{id;direction;timeline;protocol;metadata;source;status;readStatus;writeStatus;log;sinkController;sinkEnd;closed;endErr;streamSource;onEnd;onCloseRead;onCloseWrite;onReset;onAbort;sendCloseWriteTimeout;sendingData;constructor(e){this.sinkController=new AbortController,this.sinkEnd=Gn(),this.closed=Gn(),this.log=e.log,this.status="open",this.readStatus="ready",this.writeStatus="ready",this.id=e.id,this.metadata=e.metadata??{},this.direction=e.direction,this.timeline={open:Date.now()},this.sendCloseWriteTimeout=e.sendCloseWriteTimeout??5e3,this.onEnd=e.onEnd,this.onCloseRead=e?.onCloseRead,this.onCloseWrite=e?.onCloseWrite,this.onReset=e?.onReset,this.onAbort=e?.onAbort,this.source=this.streamSource=Xn({onEnd:e=>{null!=e?this.log.trace("source ended with error",e):this.log.trace("source ended"),this.onSourceEnd(e)}}),this.sink=this.sink.bind(this)}async sink(e){if("ready"!==this.writeStatus)throw new eo(`writable end state is "${this.writeStatus}" not "ready"`,"ERR_SINK_INVALID_STATE");try{this.writeStatus="writing";const t={signal:this.sinkController.signal};if("outbound"===this.direction){const e=this.sendNewStream(t);kf(e)&&await e}const r=()=>{cf(e,this.log)};try{this.sinkController.signal.addEventListener("abort",r),this.log.trace("sink reading from source");for await(let r of e){r=r instanceof Uint8Array?new Bn(r):r;const e=this.sendData(r,t);kf(e)&&(this.sendingData=Gn(),await e,this.sendingData.resolve(),this.sendingData=void 0)}}finally{this.sinkController.signal.removeEventListener("abort",r)}this.log.trace('sink finished reading from source, write status is "%s"',this.writeStatus),"writing"===this.writeStatus&&(this.writeStatus="closing",this.log.trace("send close write to remote"),await this.sendCloseWrite({signal:AbortSignal.timeout(this.sendCloseWriteTimeout)}),this.writeStatus="closed"),this.onSinkEnd()}catch(e){throw this.log.trace("sink ended with error, calling abort with error",e),this.abort(e),e}finally{this.log.trace("resolve sink end"),this.sinkEnd.resolve()}}onSourceEnd(e){null==this.timeline.closeRead&&(this.timeline.closeRead=Date.now(),this.readStatus="closed",null!=e&&null==this.endErr&&(this.endErr=e),this.onCloseRead?.(),null!=this.timeline.closeWrite?(this.log.trace("source and sink ended"),this.timeline.close=Date.now(),"aborted"!==this.status&&"reset"!==this.status&&(this.status="closed"),null!=this.onEnd&&this.onEnd(this.endErr),this.closed.resolve()):this.log.trace("source ended, waiting for sink to end"))}onSinkEnd(e){null==this.timeline.closeWrite&&(this.timeline.closeWrite=Date.now(),this.writeStatus="closed",null!=e&&null==this.endErr&&(this.endErr=e),this.onCloseWrite?.(),null!=this.timeline.closeRead?(this.log.trace("sink and source ended"),this.timeline.close=Date.now(),"aborted"!==this.status&&"reset"!==this.status&&(this.status="closed"),null!=this.onEnd&&this.onEnd(this.endErr),this.closed.resolve()):this.log.trace("sink ended, waiting for source to end"))}async close(e){this.log.trace("closing gracefully"),this.status="closing",await ih(Promise.all([this.closeWrite(e),this.closeRead(e),this.closed.promise]),e?.signal),this.status="closed",this.log.trace("closed gracefully")}async closeRead(e={}){if("closing"===this.readStatus||"closed"===this.readStatus)return;this.log.trace('closing readable end of stream with starting read status "%s"',this.readStatus);const t=this.readStatus;this.readStatus="closing","reset"!==this.status&&"aborted"!==this.status&&null==this.timeline.closeRead&&(this.log.trace("send close read to remote"),await this.sendCloseRead(e)),"ready"===t&&(this.log.trace("ending internal source queue with %d queued bytes",this.streamSource.readableLength),this.streamSource.end()),this.log.trace("closed readable end of stream")}async closeWrite(e={}){"closing"!==this.writeStatus&&"closed"!==this.writeStatus&&(this.log.trace('closing writable end of stream with starting write status "%s"',this.writeStatus),"ready"===this.writeStatus&&(this.log.trace("sink was never sunk, sink an empty array"),await ih(this.sink([]),e.signal)),"writing"===this.writeStatus&&(null!=this.sendingData&&await ih(this.sendingData.promise,e.signal),this.log.trace("aborting source passed to .sink"),this.sinkController.abort(),await ih(this.sinkEnd.promise,e.signal)),this.writeStatus="closed",this.log.trace("closed writable end of stream"))}abort(e){if("closed"===this.status||"aborted"===this.status||"reset"===this.status)return;this.log("abort with error",e),this.log("try to send reset to remote");const t=this.sendReset();kf(t)&&t.catch((e=>{this.log.error("error sending reset message",e)})),this.status="aborted",this.timeline.abort=Date.now(),this._closeSinkAndSource(e),this.onAbort?.(e)}reset(){if("closed"===this.status||"aborted"===this.status||"reset"===this.status)return;const e=new eo("stream reset","ERR_STREAM_RESET");this.status="reset",this.timeline.reset=Date.now(),this._closeSinkAndSource(e),this.onReset?.()}_closeSinkAndSource(e){this._closeSink(e),this._closeSource(e)}_closeSink(e){"writing"===this.writeStatus&&(this.log.trace("end sink source"),this.sinkController.abort()),this.onSinkEnd(e)}_closeSource(e){"closing"!==this.readStatus&&"closed"!==this.readStatus&&(this.log.trace("ending source with %d bytes to be read by consumer",this.streamSource.readableLength),this.readStatus="closing",this.streamSource.end(e))}remoteCloseWrite(){"closing"!==this.readStatus&&"closed"!==this.readStatus?(this.log.trace("remote close write"),this._closeSource()):this.log("received remote close write but local source is already closed")}remoteCloseRead(){"closing"!==this.writeStatus&&"closed"!==this.writeStatus?(this.log.trace("remote close read"),this._closeSink()):this.log("received remote close read but local sink is already closed")}destroy(){"closed"!==this.status&&"aborted"!==this.status&&"reset"!==this.status?(this.log.trace("stream destroyed"),this._closeSinkAndSource()):this.log("received destroy but we are already closed")}sourcePush(e){this.streamSource.push(e)}sourceReadableLength(){return this.streamSource.readableLength}}class Rf extends If{name;streamId;send;types;maxDataSize;constructor(e){super(e),this.types="outbound"===e.direction?yf:mf,this.send=e.send,this.name=e.name,this.streamId=e.streamId,this.maxDataSize=e.maxDataSize}async sendNewStream(){await this.send({id:this.streamId,type:yf.NEW_STREAM,data:new Bn(Nt(this.name))})}async sendData(e){for(e=e.sublist();e.byteLength>0;){const t=Math.min(e.byteLength,this.maxDataSize);await this.send({id:this.streamId,type:this.types.MESSAGE,data:e.sublist(0,t)}),e.consume(t)}}async sendReset(){await this.send({id:this.streamId,type:this.types.RESET})}async sendCloseWrite(){await this.send({id:this.streamId,type:this.types.CLOSE})}async sendCloseRead(){}}function Tf(e){const t={...e,type:`${gf[e.type]} (${e.type})`};return e.type===ff.NEW_STREAM&&(t.data=sn(e.data instanceof Uint8Array?e.data:e.data.subarray())),e.type!==ff.MESSAGE_INITIATOR&&e.type!==ff.MESSAGE_RECEIVER||(t.data=sn(e.data instanceof Uint8Array?e.data:e.data.subarray(),"base16")),t}class Cf{protocol="/mplex/6.7.0";sink;source;log;_streamId;_streams;_init;_source;closeController;rateLimiter;closeTimeout;logger;constructor(e,t){t=t??{},this.log=e.logger.forComponent("libp2p:mplex"),this.logger=e.logger,this._streamId=0,this._streams={initiators:new Map,receivers:new Map},this._init=t,this.closeTimeout=t.closeTimeout??500,this.sink=this._createSink(),this._source=Xn({objectMode:!0,onEnd:()=>{for(const e of this._streams.initiators.values())e.destroy();for(const e of this._streams.receivers.values())e.destroy()}}),this.source=Zn(this._source,(e=>async function*(e){for await(const t of e){const e=new Bn;_f.write(t,e),yield e}}(e))),this.closeController=new AbortController,this.rateLimiter=new df({points:t.disconnectThreshold??5,duration:1})}get streams(){const e=[];for(const t of this._streams.initiators.values())e.push(t);for(const t of this._streams.receivers.values())e.push(t);return e}newStream(e){if(this.closeController.signal.aborted)throw new Error("Muxer already closed");const t=this._streamId++;e=null==e?t.toString():e.toString();const r=this._streams.initiators;return this._newStream({id:t,name:e,type:"initiator",registry:r})}async close(e){if(this.closeController.signal.aborted)return;const t=e?.signal??AbortSignal.timeout(this.closeTimeout);try{await Promise.all(this.streams.map((async e=>e.close({signal:t})))),this._source.end(),await this._source.onEmpty({signal:t}),this.closeController.abort()}catch(e){this.abort(e)}}abort(e){this.closeController.signal.aborted||(this.streams.forEach((t=>{t.abort(e)})),this.closeController.abort(e))}_newReceiverStream(e){const{id:t,name:r}=e,n=this._streams.receivers;return this._newStream({id:t,name:r,type:"receiver",registry:n})}_newStream(e){const{id:t,name:r,type:n,registry:s}=e;if(this.log("new %s stream %s",n,t),"initiator"===n&&this._streams.initiators.size===(this._init.maxOutboundStreams??1024))throw new eo("Too many outbound streams open","ERR_TOO_MANY_OUTBOUND_STREAMS");if(s.has(t))throw new Error(`${n} stream ${t} already exists!`);const o=function(e){const{id:t,name:r,send:n,onEnd:s,type:o="initiator",maxMsgSize:i=bf}=e;return new Rf({id:"initiator"===o?`i${t}`:`r${t}`,streamId:t,name:`${r??t}`,direction:"initiator"===o?"outbound":"inbound",maxDataSize:i,onEnd:s,send:n,log:e.logger.forComponent(`libp2p:mplex:stream:${o}:${t}`)})}({id:t,name:r,send:async e=>{this.log.enabled&&this.log.trace("%s stream %s send",n,t,Tf(e)),this._source.push(e)},type:n,onEnd:()=>{this.log("%s stream with id %s and protocol %s ended",n,t,o.protocol),s.delete(t),null!=this._init.onStreamEnd&&this._init.onStreamEnd(o)},maxMsgSize:this._init.maxMsgSize,logger:this.logger});return s.set(t,o),o}_createSink(){return async e=>{const t=()=>{cf(e,this.log)};this.closeController.signal.addEventListener("abort",t);try{const t=new wf(this._init.maxMsgSize,this._init.maxUnprocessedMessageQueueSize);for await(const r of e)for(const e of t.write(r))await this._handleIncoming(e);this._source.end()}catch(e){this.log("error in sink",e),this._source.end(e)}finally{this.closeController.signal.removeEventListener("abort",t)}}}async _handleIncoming(e){const{id:t,type:r}=e;if(this.log.enabled&&this.log.trace("incoming message",Tf(e)),e.type===ff.NEW_STREAM){if(this._streams.receivers.size===(this._init.maxInboundStreams??1024)){this.log("too many inbound streams open"),this._source.push({id:t,type:ff.RESET_RECEIVER});try{await this.rateLimiter.consume("new-stream",1)}catch{return this.log("rate limit hit when opening too many new streams over the inbound stream limit - closing remote connection"),void this.abort(new Error("Too many open streams"))}return}const r=this._newReceiverStream({id:t,name:sn(e.data instanceof Uint8Array?e.data:e.data.subarray())});return void(null!=this._init.onIncomingStream&&this._init.onIncomingStream(r))}const n=(1&~r?this._streams.receivers:this._streams.initiators).get(t);if(null==n){this.log("missing stream %s for message type %s",t,gf[r]);try{await this.rateLimiter.consume("missing-stream",1)}catch{return this.log("rate limit hit when receiving messages for streams that do not exist - closing remote connection"),void this.abort(new Error("Too many messages for missing streams"))}return}const s=this._init.maxStreamBufferSize??4194304;try{switch(r){case ff.MESSAGE_INITIATOR:case ff.MESSAGE_RECEIVER:if(n.sourceReadableLength()>s)throw this._source.push({id:e.id,type:r===ff.MESSAGE_INITIATOR?ff.RESET_RECEIVER:ff.RESET_INITIATOR}),new eo("Input buffer full - increase Mplex maxBufferSize to accommodate slow consumers","ERR_STREAM_INPUT_BUFFER_FULL");n.sourcePush(e.data);break;case ff.CLOSE_INITIATOR:case ff.CLOSE_RECEIVER:n.remoteCloseWrite();break;case ff.RESET_INITIATOR:case ff.RESET_RECEIVER:n.reset();break;default:this.log("unknown message type %s",r)}}catch(e){this.log.error("error while processing message",e),n.abort(e)}}}class Nf{protocol="/mplex/6.7.0";_init;components;constructor(e,t={}){this.components=e,this._init=t}[Symbol.toStringTag]="@libp2p/mplex";[Vu]=["@libp2p/stream-multiplexing"];createStreamMuxer(e={}){return new Cf(this.components,{...e,...this._init})}}function xf(e={}){return t=>new Nf(t,e)}const Pf="ERR_WRONG_PING_ACK";class Of{protocol;components;started;timeout;maxInboundStreams;maxOutboundStreams;runOnTransientConnection;log;constructor(e,t={}){this.components=e,this.log=e.logger.forComponent("libp2p:ping"),this.started=!1,this.protocol=`/${t.protocolPrefix??"ipfs"}/ping/1.0.0`,this.timeout=t.timeout??1e4,this.maxInboundStreams=t.maxInboundStreams??2,this.maxOutboundStreams=t.maxOutboundStreams??1,this.runOnTransientConnection=t.runOnTransientConnection??!0,this.handleMessage=this.handleMessage.bind(this)}[Symbol.toStringTag]="@libp2p/ping";async start(){await this.components.registrar.handle(this.protocol,this.handleMessage,{maxInboundStreams:this.maxInboundStreams,maxOutboundStreams:this.maxOutboundStreams,runOnTransientConnection:this.runOnTransientConnection}),this.started=!0}async stop(){await this.components.registrar.unhandle(this.protocol),this.started=!1}isStarted(){return this.started}handleMessage(e){this.log("incoming ping from %p",e.connection.remotePeer);const{stream:t}=e,r=Date.now();AbortSignal.timeout(this.timeout).addEventListener("abort",(()=>{t?.abort(new eo("ping timeout",ro))})),Zn(t,(async function*(e){let r=0;for await(const n of e){if(r+=n.byteLength,r>32)return void t?.abort(new eo("Too much data received","ERR_INVALID_MESSAGE"));yield n}}),t).catch((r=>{this.log.error("incoming ping from %p failed with error",e.connection.remotePeer,r),t?.abort(r)})).finally((()=>{const t=Date.now()-r;this.log("incoming ping from %p complete in %dms",e.connection.remotePeer,t)}))}async ping(e,t={}){this.log("pinging %p",e);const r=Date.now(),n=su(32),s=await this.components.connectionManager.openConnection(e,t);let o,i=()=>{};if(null==t.signal){const e=AbortSignal.timeout(this.timeout);t={...t,signal:e}}try{o=await s.newStream(this.protocol,{...t,runOnTransientConnection:this.runOnTransientConnection}),i=()=>{o?.abort(new eo("ping timeout",ro))},t.signal?.addEventListener("abort",i,{once:!0});const e=await Zn([n],o,(async e=>function(e){if(null!=e[Symbol.asyncIterator])return(async()=>{for await(const t of e)return t})();for(const t of e)return t}(e))),a=Date.now()-r;if(null==e)throw new eo(`Did not receive a ping ack after ${a}ms`,Pf);if(!Pn(n,e.subarray()))throw new eo(`Received wrong ping ack after ${a}ms`,Pf);return this.log("ping %p complete in %dms",s.remotePeer,a),a}catch(e){throw this.log.error("error while pinging %p",s.remotePeer,e),o?.abort(e),e}finally{t.signal?.removeEventListener("abort",i),null!=o&&await o.close()}}}function Df(e={}){return t=>new Of(t,e)}const Lf=Symbol.for("@libp2p/transport");var Bf;!function(e){e[e.FATAL_ALL=0]="FATAL_ALL",e[e.NO_FATAL=1]="NO_FATAL"}(Bf||(Bf={}));const Uf=[mo("tcp").code,mo("dns").code,mo("dnsaddr").code,mo("dns4").code,mo("dns6").code];function Mf(e){let t;try{t=mo("sni").code}catch(e){return null}for(const[r,n]of e)if(r===t&&void 0!==n)return n;return null}function Ff(e){return e.some((([e,t])=>e===mo("tls").code))}function $f(e,t,r){const n=Hf[mo(e).name];if(void 0===n)throw new Error(`Can't interpret protocol ${mo(e).name}`);const s=n(t,r);return e===mo("ip6").code?`[${s}]`:s}const Hf={ip4:(e,t)=>e,ip6:(e,t)=>0===t.length?e:`[${e}]`,tcp:(e,t)=>{const r=t.pop();if(void 0===r)throw new Error("Unexpected end of multiaddr");return`tcp://${$f(r[0],r[1]??"",t)}:${e}`},udp:(e,t)=>{const r=t.pop();if(void 0===r)throw new Error("Unexpected end of multiaddr");return`udp://${$f(r[0],r[1]??"",t)}:${e}`},dnsaddr:(e,t)=>e,dns4:(e,t)=>e,dns6:(e,t)=>e,dns:(e,t)=>e,ipfs:(e,t)=>{const r=t.pop();if(void 0===r)throw new Error("Unexpected end of multiaddr");return`${$f(r[0],r[1]??"",t)}/ipfs/${e}`},p2p:(e,t)=>{const r=t.pop();if(void 0===r)throw new Error("Unexpected end of multiaddr");return`${$f(r[0],r[1]??"",t)}/p2p/${e}`},http:(e,t)=>{const r=Ff(t),n=Mf(t);if(r&&null!==n)return`https://${n}`;const s=r?"https://":"http://",o=t.pop();if(void 0===o)throw new Error("Unexpected end of multiaddr");let i=$f(o[0],o[1]??"",t);return i=i.replace("tcp://",""),`${s}${i}`},"http-path":(e,t)=>{const r=t.pop();if(void 0===r)throw new Error("Unexpected end of multiaddr");return`${$f(r[0],r[1]??"",t)}/${decodeURIComponent(e)}`},tls:(e,t)=>{const r=t.pop();if(void 0===r)throw new Error("Unexpected end of multiaddr");return $f(r[0],r[1]??"",t)},sni:(e,t)=>{const r=t.pop();if(void 0===r)throw new Error("Unexpected end of multiaddr");return $f(r[0],r[1]??"",t)},https:(e,t)=>{const r=t.pop();if(void 0===r)throw new Error("Unexpected end of multiaddr");let n=$f(r[0],r[1]??"",t);return n=n.replace("tcp://",""),`https://${n}`},ws:(e,t)=>{const r=Ff(t),n=Mf(t);if(r&&null!==n)return`wss://${n}`;const s=r?"wss://":"ws://",o=t.pop();if(void 0===o)throw new Error("Unexpected end of multiaddr");let i=$f(o[0],o[1]??"",t);return i=i.replace("tcp://",""),`${s}${i}`},wss:(e,t)=>{const r=t.pop();if(void 0===r)throw new Error("Unexpected end of multiaddr");let n=$f(r[0],r[1]??"",t);return n=n.replace("tcp://",""),`wss://${n}`},"p2p-websocket-star":(e,t)=>{const r=t.pop();if(void 0===r)throw new Error("Unexpected end of multiaddr");return`${$f(r[0],r[1]??"",t)}/p2p-websocket-star`},"p2p-webrtc-star":(e,t)=>{const r=t.pop();if(void 0===r)throw new Error("Unexpected end of multiaddr");return`${$f(r[0],r[1]??"",t)}/p2p-webrtc-star`},"p2p-webrtc-direct":(e,t)=>{const r=t.pop();if(void 0===r)throw new Error("Unexpected end of multiaddr");return`${$f(r[0],r[1]??"",t)}/p2p-webrtc-direct`}},qf=async e=>{if(e.readyState>=2)throw new Error("socket closed");1!==e.readyState&&await new Promise(((t,r)=>{function n(){e.removeEventListener("open",s),e.removeEventListener("error",o)}function s(){n(),t()}function o(t){n(),r(t.error??new Error(`connect ECONNREFUSED ${e.url}`))}e.addEventListener("open",s),e.addEventListener("error",o)}))},Vf=(e,t)=>((t=t??{}).closeOnEnd=!1!==t.closeOnEnd,async r=>{for await(const t of r){try{await qf(e)}catch(e){if("socket closed"===e.message)break;throw e}if(e.readyState===e.CLOSING||e.readyState===e.CLOSED)break;e.send(t)}null!=t.closeOnEnd&&e.readyState<=1&&await new Promise(((t,r)=>{e.addEventListener("close",(e=>{if(e.wasClean||1006===e.code)t();else{const t=Object.assign(new Error("ws error"),{event:e});r(t)}})),setTimeout((()=>{e.close()}))}))});var jf=__webpack_require__(544);function Kf(e){return e instanceof ArrayBuffer||"ArrayBuffer"===e?.constructor?.name&&"number"==typeof e?.byteLength}const zf=WebSocket,Gf={"http:":"ws:","https:":"wss:"};function Wf(e,t){t=t??{};const r=((e,t)=>{if(e.startsWith("//")&&(e=`${t?.protocol??"ws:"}${e}`),e.startsWith("/")&&null!=t){const r=t.protocol??"ws:",n=t.host,s=null!=t.port&&!0!==n?.endsWith(`:${t.port}`)?`:${t.port}`:"";e=`${r}//${n}${s}${e}`}const r=new URL(e);for(const[e,t]of Object.entries(Gf))r.protocol===e&&(r.protocol=t);return r})(e,"undefined"==typeof window?void 0:window.location);return((e,t)=>{t=t??{};const r=(e=>{e.binaryType="arraybuffer";const t=async()=>{await new Promise(((t,r)=>{if(s)return void t();if(null!=n)return void r(n);const o=t=>{e.removeEventListener("open",i),e.removeEventListener("error",a),t()},i=()=>{o(t)},a=t=>{o((()=>{r(t.error??new Error(`connect ECONNREFUSED ${e.url}`))}))};e.addEventListener("open",i),e.addEventListener("error",a)}))},r=async function*(){const r=new jf.PP((({push:t,stop:r,fail:n})=>{const s=e=>{let r=null;"string"==typeof e.data&&(r=Nt(e.data)),Kf(e.data)&&(r=new Uint8Array(e.data)),e.data instanceof Uint8Array&&(r=e.data),null!=r&&t(r)},o=e=>{n(e.error??new Error("Socket error"))};return e.addEventListener("message",s),e.addEventListener("error",o),e.addEventListener("close",r),()=>{e.removeEventListener("message",s),e.removeEventListener("error",o),e.removeEventListener("close",r)}}),{highWaterMark:1/0});await t();for await(const e of r)yield Kf(e)?new Uint8Array(e):e}();let n,s=1===e.readyState;return e.addEventListener("open",(()=>{s=!0,n=null})),e.addEventListener("close",(()=>{s=!1,n=null})),e.addEventListener("error",(t=>{s||(n=t.error??new Error(`connect ECONNREFUSED ${e.url}`))})),Object.assign(r,{connected:t})})(e);let n=t.remoteAddress,s=t.remotePort;if(null!=e.url)try{const t=new URL(e.url);n=t.hostname,s=parseInt(t.port,10)}catch{}if(null==n||null==s)throw new Error("Remote connection did not have address and/or port");return{sink:Vf(e,t),source:r,connected:async()=>{await r.connected()},close:async()=>{e.readyState!==e.CONNECTING&&e.readyState!==e.OPEN||await new Promise((t=>{e.addEventListener("close",(()=>{t()})),e.close()}))},destroy:()=>{null!=e.terminate?e.terminate():e.close()},remoteAddress:n,remotePort:s,socket:e}})(new zf(r.toString(),t.websocket),t)}class Yf extends Event{constructor(e,t){super(e),this.detail=t}}const Jf=421,Xf=290;function Qf(e){return e.filter((e=>{if(e.protoCodes().includes(Xf))return!1;const t=e.decapsulateCode(Jf);return Dd.matches(t)||Bd.matches(t)}))}function Zf(e){return e.filter((e=>{if(e.protoCodes().includes(Xf))return!1;const t=e.decapsulateCode(Jf);return Bd.matches(t)}))}class eg{log;init;logger;metrics;components;constructor(e,t){this.log=e.logger.forComponent("libp2p:websockets"),this.logger=e.logger,this.components=e,this.init=t,null!=e.metrics&&(this.metrics={dialerEvents:e.metrics.registerCounterGroup("libp2p_websockets_dialer_events_total",{label:"event",help:"Total count of WebSockets dialer events by type"})})}[Lf]=!0;[Symbol.toStringTag]="@libp2p/websockets";[Vu]=["@libp2p/transport"];async dial(e,t){this.log("dialing %s",e),t=t??{};const r=function(e,t,r){const n=r.logger.forComponent("libp2p:websockets:maconn"),s=r.metrics,o=r.metricPrefix??"",i={log:n,async sink(t){try{await e.sink(async function*(){for await(const e of t)e instanceof Uint8Array?yield e:yield e.subarray()}())}catch(e){"aborted"!==e.type&&n.error(e)}},source:e.source,remoteAddr:t,timeline:{open:Date.now()},async close(t={}){const r=Date.now();if(null==t.signal){const e=AbortSignal.timeout(500);t={...t,signal:e}}const s=()=>{const{host:e,port:t}=i.remoteAddr.toOptions();n("timeout closing stream to %s:%s after %dms, destroying it manually",e,t,Date.now()-r),this.abort(new eo("Socket close timeout","ERR_SOCKET_CLOSE_TIMEOUT"))};t.signal?.addEventListener("abort",s);try{await e.close()}catch(e){n.error("error closing WebSocket gracefully",e),this.abort(e)}finally{t.signal?.removeEventListener("abort",s),i.timeline.close=Date.now()}},abort(t){const{host:r,port:a}=i.remoteAddr.toOptions();n("timeout closing stream to %s:%s due to error",r,a,t),e.destroy(),i.timeline.close=Date.now(),s?.increment({[`${o}error`]:!0})}};return e.socket.addEventListener("close",(()=>{s?.increment({[`${o}close`]:!0}),null==i.timeline.close&&(i.timeline.close=Date.now())}),{once:!0}),i}(await this._connect(e,t),e,{logger:this.logger,metrics:this.metrics?.dialerEvents});this.log("new outbound connection %s",r.remoteAddr);const n=await t.upgrader.upgradeOutbound(r,t);return this.log("outbound connection %s upgraded",r.remoteAddr),n}async _connect(e,t){t?.signal?.throwIfAborted();const r=e.toOptions();this.log("dialing %s:%s",r.host,r.port);const n=Gn(),s=Wf(function(e,t){const r=Mo(e).stringTuples(),n=r.pop();if(void 0===n)throw new Error("Unexpected end of multiaddr");const s=mo(n[0]),o=Hf[s.name];if(null==o)throw new Error(`No interpreter found for ${s.name}`);let i=o(n[1]??"",r);return Uf.includes(n[0])&&(i=i.replace(/^.*:\/\//,""),i="443"===n[1]?`https://${i}`:`http://${i}`),(i.startsWith("http://")||i.startsWith("https://"))&&(i=new URL(i).toString(),i.endsWith("/")&&(i=i.substring(0,i.length-1))),i}(e),this.init);s.socket.addEventListener("error",(()=>{const t=new eo(`Could not connect to ${e.toString()}`,"ERR_CONNECTION_FAILED");this.log.error("connection error:",t),this.metrics?.dialerEvents.increment({error:!0}),n.reject(t)}));try{t.onProgress?.(new Yf("websockets:open-connection")),await ih(Promise.race([s.connected(),n.promise]),t.signal)}catch(e){throw!0===t.signal?.aborted&&this.metrics?.dialerEvents.increment({abort:!0}),s.close().catch((e=>{this.log.error("error closing raw socket",e)})),e}return this.log("connected %s",e),this.metrics?.dialerEvents.increment({connect:!0}),s}createListener(e){return function(){throw new Error("WebSocket Servers can not be created in the browser!")}((this.logger,this.components.metrics),this.init)}listenFilter(e){return e=Array.isArray(e)?e:[e],null!=this.init?.filter?this.init?.filter(e):jp||Wp?Zf(e):Qf(e)}dialFilter(e){return this.listenFilter(e)}}function tg(e={}){return t=>new eg(t,e)}const rg=Symbol.for("@libp2p/content-routing"),ng=Symbol.for("@libp2p/peer-routing"),sg=1e3,og=60*sg,ig=60*og,ag=24*ig,cg=7*ag,lg=function(e,t){try{if("string"==typeof e&&e.length>0)return function(e){if((e=String(e)).length>100)throw new Error("Value exceeds the maximum length of 100 characters.");const t=/^(-?(?:\d+)?\.?\d+) *(milliseconds?|msecs?|ms|seconds?|secs?|s|minutes?|mins?|m|hours?|hrs?|h|days?|d|weeks?|w|years?|yrs?|y)?$/i.exec(e);if(!t)return NaN;const r=parseFloat(t[1]),n=(t[2]||"ms").toLowerCase();switch(n){case"years":case"year":case"yrs":case"yr":case"y":return 315576e5*r;case"weeks":case"week":case"w":return r*cg;case"days":case"day":case"d":return r*ag;case"hours":case"hour":case"hrs":case"hr":case"h":return r*ig;case"minutes":case"minute":case"mins":case"min":case"m":return r*og;case"seconds":case"second":case"secs":case"sec":case"s":return r*sg;case"milliseconds":case"millisecond":case"msecs":case"msec":case"ms":return r;default:throw new Error(`The unit ${n} was matched, but no matching case exists.`)}}(e);if("number"==typeof e&&isFinite(e))return t?.long?function(e){const t=Math.abs(e);return t>=ag?ug(e,t,ag,"day"):t>=ig?ug(e,t,ig,"hour"):t>=og?ug(e,t,og,"minute"):t>=sg?ug(e,t,sg,"second"):`${e} ms`}(e):function(e){const t=Math.abs(e);return t>=ag?`${Math.round(e/ag)}d`:t>=ig?`${Math.round(e/ig)}h`:t>=og?`${Math.round(e/og)}m`:t>=sg?`${Math.round(e/sg)}s`:`${e}ms`}(e);throw new Error("Value is not a string or number.")}catch(t){const r=function(e){return"object"==typeof e&&null!==e&&"message"in e}(t)?`${t.message}. value=${JSON.stringify(e)}`:"An unknown error has occured.";throw new Error(r)}};function ug(e,t,r,n){const s=t>=1.5*r;return`${Math.round(e/r)} ${n}${s?"s":""}`}const hg=function(){try{return localStorage}catch(e){}}(),dg=console.debug??console.log??(()=>{}),pg=function(e){function t(e){let n,s,o,i=null;function a(...e){if(!a.enabled)return;const r=a,s=Number(new Date),o=s-(n||s);r.diff=o,r.prev=n,r.curr=s,n=s,e[0]=t.coerce(e[0]),"string"!=typeof e[0]&&e.unshift("%O");let i=0;e[0]=e[0].replace(/%([a-zA-Z%])/g,((n,s)=>{if("%%"===n)return"%";i++;const o=t.formatters[s];if("function"==typeof o){const t=e[i];n=o.call(r,t),e.splice(i,1),i--}return n})),t.formatArgs.call(r,e),(r.log||t.log).apply(r,e)}return a.namespace=e,a.useColors=t.useColors(),a.color=t.selectColor(e),a.extend=r,a.destroy=t.destroy,Object.defineProperty(a,"enabled",{enumerable:!0,configurable:!1,get:()=>null!==i?i:(s!==t.namespaces&&(s=t.namespaces,o=t.enabled(e)),o),set:e=>{i=e}}),"function"==typeof t.init&&t.init(a),a}function r(e,r){const n=t(this.namespace+(void 0===r?":":r)+e);return n.log=this.log,n}function n(e){return e.toString().substring(2,e.toString().length-2).replace(/\.\*\?$/,"*")}return t.debug=t,t.default=t,t.coerce=function(e){return e instanceof Error?e.stack??e.message:e},t.disable=function(){const e=[...t.names.map(n),...t.skips.map(n).map((e=>"-"+e))].join(",");return t.enable(""),e},t.enable=function(e){let r;t.save(e),t.namespaces=e,t.names=[],t.skips=[];const n=("string"==typeof e?e:"").split(/[\s,]+/),s=n.length;for(r=0;r{t[r]=e[r]})),t.names=[],t.skips=[],t.formatters={},t.selectColor=function(e){let r=0;for(let t=0;t{"%%"!==e&&(r++,"%c"===e&&(n=r))})),e.splice(n,0,t)},save:function(e){try{e?hg?.setItem("debug",e):hg?.removeItem("debug")}catch(e){}},load:function(){let e;try{e=hg?.getItem("debug")}catch(e){}return!e&&"undefined"!=typeof process&&"env"in process&&(e=process.env.DEBUG),e},useColors:function(){return!("undefined"==typeof window||!window.process||"renderer"!==window.process.type&&!window.process.__nwjs)||("undefined"==typeof navigator||null==navigator.userAgent?.toLowerCase().match(/(edge|trident)\/(\d+)/))&&("undefined"!=typeof document&&document.documentElement?.style?.WebkitAppearance||"undefined"!=typeof window&&window.console&&(window.console.firebug||window.console.exception&&window.console.table)||"undefined"!=typeof navigator&&null!=navigator.userAgent?.toLowerCase().match(/firefox\/(\d+)/)&&parseInt(RegExp.$1,10)>=31||"undefined"!=typeof navigator&&navigator.userAgent?.toLowerCase().match(/applewebkit\/(\d+)/))},setupFormatters:function(e){e.j=function(e){try{return JSON.stringify(e)}catch(e){return"[UnexpectedJSONParseError]: "+e.message}}},colors:["#0000CC","#0000FF","#0033CC","#0033FF","#0066CC","#0066FF","#0099CC","#0099FF","#00CC00","#00CC33","#00CC66","#00CC99","#00CCCC","#00CCFF","#3300CC","#3300FF","#3333CC","#3333FF","#3366CC","#3366FF","#3399CC","#3399FF","#33CC00","#33CC33","#33CC66","#33CC99","#33CCCC","#33CCFF","#6600CC","#6600FF","#6633CC","#6633FF","#66CC00","#66CC33","#9900CC","#9900FF","#9933CC","#9933FF","#99CC00","#99CC33","#CC0000","#CC0033","#CC0066","#CC0099","#CC00CC","#CC00FF","#CC3300","#CC3333","#CC3366","#CC3399","#CC33CC","#CC33FF","#CC6600","#CC6633","#CC9900","#CC9933","#CCCC00","#CCCC33","#FF0000","#FF0033","#FF0066","#FF0099","#FF00CC","#FF00FF","#FF3300","#FF3333","#FF3366","#FF3399","#FF33CC","#FF33FF","#FF6600","#FF6633","#FF9900","#FF9933","#FFCC00","#FFCC33"],storage:hg,log:dg}),fg=pg;function gg(){return{forComponent:e=>function(e){let t=function(e){const t=()=>{};return t.enabled=!1,t.color="",t.diff=0,t.log=()=>{},t.namespace=e,t.destroy=()=>!0,t.extend=()=>t,t}(`${e}:trace`);return fg.enabled(`${e}:trace`)&&null!=fg.names.map((e=>e.toString())).find((e=>e.includes(":trace")))&&(t=fg(`${e}:trace`)),Object.assign(fg(e),{error:fg(`${e}:error`),trace:t})}(e)}}function yg(e,t){const r={[Symbol.iterator]:()=>r,next:()=>{const r=e.next(),n=r.value;return!0===r.done||null==n?{done:!0,value:void 0}:{done:!1,value:t(n)}}};return r}fg.formatters.b=e=>null==e?"undefined":ke.baseEncode(e),fg.formatters.t=e=>null==e?"undefined":fe.baseEncode(e),fg.formatters.m=e=>null==e?"undefined":Re.baseEncode(e),fg.formatters.p=e=>null==e?"undefined":e.toString(),fg.formatters.c=e=>null==e?"undefined":e.toString(),fg.formatters.k=e=>null==e?"undefined":e.toString(),fg.formatters.a=e=>null==e?"undefined":e.toString();class mg{set;constructor(e){if(this.set=new Set,null!=e)for(const t of e)this.set.add(t.toString())}get size(){return this.set.size}[Symbol.iterator](){return this.values()}add(e){this.set.add(e.toString())}clear(){this.set.clear()}delete(e){this.set.delete(e.toString())}entries(){return yg(this.set.entries(),(e=>{const t=rh(e[0]);return[t,t]}))}forEach(e){this.set.forEach((t=>{const r=rh(t);e(r,r,this)}))}has(e){return this.set.has(e.toString())}values(){return yg(this.set.values(),(e=>rh(e)))}intersection(e){const t=new mg;for(const r of e)this.has(r)&&t.add(r);return t}difference(e){const t=new mg;for(const r of this)e.has(r)||t.add(r);return t}union(e){const t=new mg;for(const r of e)t.add(r);for(const e of this)t.add(e);return t}}const bg=async()=>{const e=await async function(e,t){return Fu("Ed25519").generateKeyPair(2048)}(),t=await wg(e);if("Ed25519"===t.type)return t;throw new Error(`Generated unexpected PeerId type "${t.type}"`)};async function wg(e){return sh(Hu(e.public),(t=e,Fu(r=(r??"rsa").toLowerCase()),t.bytes));var t,r}async function vg(e){return async function(e,t,r){if(null!=t)return wg(await qu(t));if(null!=r)return async function(e){return sh(Hu(e))}($u(r));const n=nh(e);if("Ed25519"!==n.type&&"secp256k1"!==n.type&&"RSA"!==n.type)throw new Error("Supplied PeerID is invalid");return n}(Nt(e.id,"base58btc"),null!=e.privKey?Nt(e.privKey,"base64pad"):void 0,null!=e.pubKey?Nt(e.pubKey,"base64pad"):void 0)}class Eg{map;constructor(e){if(this.map=new Map,null!=e)for(const[t,r]of e.entries())this.map.set(t.toString(),r)}[Symbol.iterator](){return this.entries()}clear(){this.map.clear()}delete(e){return this.map.delete(e.toString())}entries(){return yg(this.map.entries(),(e=>[rh(e[0]),e[1]]))}forEach(e){this.map.forEach(((t,r)=>{e(t,rh(r),this)}))}get(e){return this.map.get(e.toString())}has(e){return this.map.has(e.toString())}set(e,t){this.map.set(e.toString(),t)}keys(){return yg(this.map.keys(),(e=>rh(e)))}values(){return this.map.values()}get size(){return this.map.size}}var Sg=__webpack_require__(228);class Ag{#o=[];enqueue(e,t){const r={priority:(t={priority:0,...t}).priority,run:e};if(this.size&&this.#o[this.size-1].priority>=t.priority)return void this.#o.push(r);const n=function(e,t,r){let n=0,s=e.length;for(;s>0;){const r=Math.trunc(s/2);let i=n+r;o=e[i],t.priority-o.priority<=0?(n=++i,s-=r+1):s=r}var o;return n}(this.#o,r);this.#o.splice(n,0,r)}dequeue(){const e=this.#o.shift();return e?.run}filter(e){return this.#o.filter((t=>t.priority===e.priority)).map((e=>e.run))}get size(){return this.#o.length}}class _g extends Sg{#i;#a;#c=0;#l;#u;#h=0;#d;#p;#o;#f;#g=0;#y;#m;#b;timeout;constructor(e){if(super(),!("number"==typeof(e={carryoverConcurrencyCount:!1,intervalCap:Number.POSITIVE_INFINITY,interval:0,concurrency:Number.POSITIVE_INFINITY,autoStart:!0,queueClass:Ag,...e}).intervalCap&&e.intervalCap>=1))throw new TypeError(`Expected \`intervalCap\` to be a number from 1 and up, got \`${e.intervalCap?.toString()??""}\` (${typeof e.intervalCap})`);if(void 0===e.interval||!(Number.isFinite(e.interval)&&e.interval>=0))throw new TypeError(`Expected \`interval\` to be a finite number >= 0, got \`${e.interval?.toString()??""}\` (${typeof e.interval})`);this.#i=e.carryoverConcurrencyCount,this.#a=e.intervalCap===Number.POSITIVE_INFINITY||0===e.interval,this.#l=e.intervalCap,this.#u=e.interval,this.#o=new e.queueClass,this.#f=e.queueClass,this.concurrency=e.concurrency,this.timeout=e.timeout,this.#b=!0===e.throwOnTimeout,this.#m=!1===e.autoStart}get#w(){return this.#a||this.#c{this.#A()}),t)),!0;this.#c=this.#i?this.#g:0}return!1}#S(){if(0===this.#o.size)return this.#d&&clearInterval(this.#d),this.#d=void 0,this.emit("empty"),0===this.#g&&this.emit("idle"),!1;if(!this.#m){const e=!this.#I;if(this.#w&&this.#v){const t=this.#o.dequeue();return!!t&&(this.emit("active"),t(),e&&this.#k(),!0)}}return!1}#k(){this.#a||void 0!==this.#d||(this.#d=setInterval((()=>{this.#_()}),this.#u),this.#h=Date.now()+this.#u)}#_(){0===this.#c&&0===this.#g&&this.#d&&(clearInterval(this.#d),this.#d=void 0),this.#c=this.#i?this.#g:0,this.#R()}#R(){for(;this.#S(););}get concurrency(){return this.#y}set concurrency(e){if(!("number"==typeof e&&e>=1))throw new TypeError(`Expected \`concurrency\` to be a number from 1 and up, got \`${e}\` (${typeof e})`);this.#y=e,this.#R()}async#T(e){return new Promise(((t,r)=>{e.addEventListener("abort",(()=>{r(e.reason)}),{once:!0})}))}async add(e,t={}){return t={timeout:this.timeout,throwOnTimeout:this.#b,...t},new Promise(((r,n)=>{this.#o.enqueue((async()=>{this.#g++,this.#c++;try{t.signal?.throwIfAborted();let n=e({signal:t.signal});t.timeout&&(n=Ps(Promise.resolve(n),{milliseconds:t.timeout})),t.signal&&(n=Promise.race([n,this.#T(t.signal)]));const s=await n;r(s),this.emit("completed",s)}catch(e){if(e instanceof Ts&&!t.throwOnTimeout)return void r();n(e),this.emit("error",e)}finally{this.#E()}}),t),this.emit("add"),this.#S()}))}async addAll(e,t){return Promise.all(e.map((async e=>this.add(e,t))))}start(){return this.#m?(this.#m=!1,this.#R(),this):this}pause(){this.#m=!0}clear(){this.#o=new this.#f}async onEmpty(){0!==this.#o.size&&await this.#C("empty")}async onSizeLessThan(e){this.#o.sizethis.#o.size{const n=()=>{t&&!t()||(this.off(e,n),r())};this.on(e,n)}))}get size(){return this.#o.size}sizeBy(e){return this.#o.filter(e).length}get pending(){return this.#g}get isPaused(){return this.#m}}const kg={},Ig=e=>{e.addEventListener("message",(t=>{Ig.dispatchEvent("message",e,t)})),null!=e.port&&e.port.addEventListener("message",(t=>{Ig.dispatchEvent("message",e,t)}))};Ig.addEventListener=(e,t)=>{null==kg[e]&&(kg[e]=[]),kg[e].push(t)},Ig.removeEventListener=(e,t)=>{null!=kg[e]&&(kg[e]=kg[e].filter((e=>e===t)))},Ig.dispatchEvent=function(e,t,r){null!=kg[e]&&kg[e].forEach((e=>e(t,r)))};const Rg=Ig,Tg="lock:worker:request-read",Cg="lock:worker:release-read",Ng="lock:master:grant-read",xg="lock:worker:request-write",Pg="lock:worker:release-write",Og="lock:master:grant-write",Dg=(e,t,r,n,s)=>(o,i)=>{if(i.data.type!==r)return;const a={type:i.data.type,name:i.data.name,identifier:i.data.identifier};e.dispatchEvent(new MessageEvent(t,{data:{name:a.name,handler:async()=>{o.postMessage({type:s,name:a.name,identifier:a.identifier}),await new Promise((e=>{const t=r=>{if(null==r||null==r.data)return;const s=r.data.type,i=(r.data.name,r.data.identifier);s===n&&i===a.identifier&&(o.removeEventListener("message",t),e())};o.addEventListener("message",t)}))}}}))},Lg=(e,t,r,n)=>async()=>{const s=Math.random().toString().substring(2);return globalThis.postMessage({type:t,identifier:s,name:e}),new Promise((t=>{const o=i=>{if(null==i||null==i.data)return;const a=i.data.type,c=i.data.identifier;a===r&&c===s&&(globalThis.removeEventListener("message",o),t((()=>{globalThis.postMessage({type:n,identifier:s,name:e})})))};globalThis.addEventListener("message",o)}))},Bg={singleProcess:!1},Ug={};let Mg;async function Fg(e,t){let r;const n=new Promise((e=>{r=e}));return e.add((async()=>Ps((async()=>{await new Promise((e=>{r((()=>{e()}))}))})(),{milliseconds:t.timeout}))),n}const $g={name:"lock",concurrency:1/0,timeout:846e5,singleProcess:!1};const Hg={ERR_INVALID_PARAMETERS:"ERR_INVALID_PARAMETERS"};var qg,Vg,jg;function Kg(e,t){const r=qg.decode(t);null!=r.publicKey&&null==e.publicKey&&(e=function(e){if("RSA"===e.type)return new Xu(e);if("Ed25519"===e.type)return new Qu(e);if("secp256k1"===e.type)return new Zu(e);throw new eo("Not a PeerId","ERR_INVALID_PARAMETERS")}({...e,publicKey:e.publicKey}));const n=new Map,s=BigInt(Date.now());for(const[e,t]of r.tags.entries())null!=t.expiry&&t.expiry({multiaddr:Mo(e),isCertified:t??!1}))),metadata:r.metadata,peerRecordEnvelope:r.peerRecordEnvelope??void 0,tags:n}}!function(e){let t,r,n;!function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.key&&""!==e.key&&(t.uint32(10),t.string(e.key)),null!=e.value&&e.value.byteLength>0&&(t.uint32(18),t.bytes(e.value)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t)=>{const r={key:"",value:new Uint8Array(0)},n=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:r.key=e.string();break;case 2:r.value=e.bytes();break;default:e.skipType(7&t)}}return r}))),t),e.encode=t=>jt(t,e.codec()),e.decode=t=>Y(t,e.codec())}(t=e.Peer$metadataEntry||(e.Peer$metadataEntry={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.key&&""!==e.key&&(t.uint32(10),t.string(e.key)),null!=e.value&&(t.uint32(18),jg.codec().encode(e.value,t)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t)=>{const r={key:""},n=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:r.key=e.string();break;case 2:r.value=jg.codec().decode(e,e.uint32());break;default:e.skipType(7&t)}}return r}))),t),e.encode=t=>jt(t,e.codec()),e.decode=t=>Y(t,e.codec())}(r=e.Peer$tagsEntry||(e.Peer$tagsEntry={})),e.codec=()=>(null==n&&(n=Ar(((t,r,n={})=>{if(!1!==n.lengthDelimited&&r.fork(),null!=t.addresses)for(const e of t.addresses)r.uint32(10),Vg.codec().encode(e,r);if(null!=t.protocols)for(const e of t.protocols)r.uint32(18),r.string(e);if(null!=t.publicKey&&(r.uint32(34),r.bytes(t.publicKey)),null!=t.peerRecordEnvelope&&(r.uint32(42),r.bytes(t.peerRecordEnvelope)),null!=t.metadata&&0!==t.metadata.size)for(const[n,s]of t.metadata.entries())r.uint32(50),e.Peer$metadataEntry.codec().encode({key:n,value:s},r);if(null!=t.tags&&0!==t.tags.size)for(const[n,s]of t.tags.entries())r.uint32(58),e.Peer$tagsEntry.codec().encode({key:n,value:s},r);!1!==n.lengthDelimited&&r.ldelim()}),((t,r)=>{const n={addresses:[],protocols:[],metadata:new Map,tags:new Map},s=null==r?t.len:t.pos+r;for(;t.pos>>3){case 1:n.addresses.push(Vg.codec().decode(t,t.uint32()));break;case 2:n.protocols.push(t.string());break;case 4:n.publicKey=t.bytes();break;case 5:n.peerRecordEnvelope=t.bytes();break;case 6:{const r=e.Peer$metadataEntry.codec().decode(t,t.uint32());n.metadata.set(r.key,r.value);break}case 7:{const r=e.Peer$tagsEntry.codec().decode(t,t.uint32());n.tags.set(r.key,r.value);break}default:t.skipType(7&r)}}return n}))),n),e.encode=t=>jt(t,e.codec()),e.decode=t=>Y(t,e.codec())}(qg||(qg={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.multiaddr&&e.multiaddr.byteLength>0&&(t.uint32(10),t.bytes(e.multiaddr)),null!=e.isCertified&&(t.uint32(16),t.bool(e.isCertified)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t)=>{const r={multiaddr:new Uint8Array(0)},n=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:r.multiaddr=e.bytes();break;case 2:r.isCertified=e.bool();break;default:e.skipType(7&t)}}return r}))),t),e.encode=t=>jt(t,e.codec()),e.decode=t=>Y(t,e.codec())}(Vg||(Vg={})),function(e){let t;e.codec=()=>(null==t&&(t=Ar(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.value&&0!==e.value&&(t.uint32(8),t.uint32(e.value)),null!=e.expiry&&(t.uint32(16),t.uint64(e.expiry)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t)=>{const r={value:0},n=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:r.value=e.uint32();break;case 2:r.expiry=e.uint64();break;default:e.skipType(7&t)}}return r}))),t),e.encode=t=>jt(t,e.codec()),e.decode=t=>Y(t,e.codec())}(jg||(jg={}));const zg="/",Gg=(new TextEncoder).encode(zg),Wg=Gg[0];class Yg{_buf;constructor(e,t){if("string"==typeof e)this._buf=Nt(e);else{if(!(e instanceof Uint8Array))throw new Error("Invalid key, should be String of Uint8Array");this._buf=e}if(null==t&&(t=!0),t&&this.clean(),0===this._buf.byteLength||this._buf[0]!==Wg)throw new Error("Invalid key")}toString(e="utf8"){return sn(this._buf,e)}uint8Array(){return this._buf}get[Symbol.toStringTag](){return`Key(${this.toString()})`}static withNamespaces(e){return new Yg(e.join(zg))}static random(){return new Yg(Math.random().toString().substring(2))}static asKey(e){return e instanceof Uint8Array||"string"==typeof e?new Yg(e):"function"==typeof e.uint8Array?new Yg(e.uint8Array()):null}clean(){if(null!=this._buf&&0!==this._buf.byteLength||(this._buf=Gg),this._buf[0]!==Wg){const e=new Uint8Array(this._buf.byteLength+1);e.fill(Wg,0,1),e.set(this._buf,1),this._buf=e}for(;this._buf.byteLength>1&&this._buf[this._buf.byteLength-1]===Wg;)this._buf=this._buf.subarray(0,-1)}less(e){const t=this.list(),r=e.list();for(let e=0;es)return!1}return t.lengthe.namespaces())),[].concat(...t))]);var t}}const Jg="/peers/";function Xg(e){if(!Qs(e)||null==e.type)throw new eo("Invalid PeerId",Hg.ERR_INVALID_PARAMETERS);const t=e.toCID().toString();return new Yg(`${Jg}${t}`)}async function Qg(e,t,r){const n=new Map;for(const s of r){if(null==s)continue;if(s.multiaddr instanceof Uint8Array&&(s.multiaddr=Mo(s.multiaddr)),!Uo(s.multiaddr))throw new eo("Multiaddr was invalid",Hg.ERR_INVALID_PARAMETERS);if(!await t(e,s.multiaddr))continue;const r=s.isCertified??!1,o=s.multiaddr.toString(),i=n.get(o);null!=i?s.isCertified=i.isCertified||r:n.set(o,{multiaddr:s.multiaddr,isCertified:r})}return[...n.values()].sort(((e,t)=>e.multiaddr.toString().localeCompare(t.multiaddr.toString()))).map((({isCertified:e,multiaddr:t})=>({isCertified:e,multiaddr:t.bytes})))}async function Zg(e,t,r,n){if(null==t)throw new eo("Invalid PeerData",Hg.ERR_INVALID_PARAMETERS);if(null!=t.publicKey&&null!=e.publicKey&&!Pn(t.publicKey,e.publicKey))throw new eo("publicKey bytes do not match peer id publicKey bytes",Hg.ERR_INVALID_PARAMETERS);const s=n.existingPeer;if(null!=s&&!e.equals(s.id))throw new eo("peer id did not match existing peer id",Hg.ERR_INVALID_PARAMETERS);let o=s?.addresses??[],i=new Set(s?.protocols??[]),a=s?.metadata??new Map,c=s?.tags??new Map,l=s?.peerRecordEnvelope;if("patch"===r&&(null==t.multiaddrs&&null==t.addresses||(o=[],null!=t.multiaddrs&&o.push(...t.multiaddrs.map((e=>({isCertified:!1,multiaddr:e})))),null!=t.addresses&&o.push(...t.addresses)),null!=t.protocols&&(i=new Set(t.protocols)),null!=t.metadata&&(a=ey(t.metadata instanceof Map?[...t.metadata.entries()]:Object.entries(t.metadata),{validate:ty})),null!=t.tags&&(c=ey(t.tags instanceof Map?[...t.tags.entries()]:Object.entries(t.tags),{validate:ry,map:ny})),null!=t.peerRecordEnvelope&&(l=t.peerRecordEnvelope)),"merge"===r){if(null!=t.multiaddrs&&o.push(...t.multiaddrs.map((e=>({isCertified:!1,multiaddr:e})))),null!=t.addresses&&o.push(...t.addresses),null!=t.protocols&&(i=new Set([...i,...t.protocols])),null!=t.metadata){const e=t.metadata instanceof Map?[...t.metadata.entries()]:Object.entries(t.metadata);for(const[t,r]of e)null==r?a.delete(t):a.set(t,r);a=ey([...a.entries()],{validate:ty})}if(null!=t.tags){const e=t.tags instanceof Map?[...t.tags.entries()]:Object.entries(t.tags),r=new Map(c);for(const[t,n]of e)null==n?r.delete(t):r.set(t,n);c=ey([...r.entries()],{validate:ry,map:ny})}null!=t.peerRecordEnvelope&&(l=t.peerRecordEnvelope)}const u={addresses:await Qg(e,n.addressFilter??(async()=>!0),o),protocols:[...i.values()].sort(((e,t)=>e.localeCompare(t))),metadata:a,tags:c,publicKey:s?.id.publicKey??t.publicKey??e.publicKey,peerRecordEnvelope:l};return"RSA"!==e.type&&delete u.publicKey,u}function ey(e,t){const r=new Map;for(const[r,n]of e)null!=n&&t.validate(r,n);for(const[n,s]of e.sort((([e],[t])=>e.localeCompare(t))))null!=s&&r.set(n,t.map?.(n,s)??s);return r}function ty(e,t){if("string"!=typeof e)throw new eo("Metadata key must be a string",Hg.ERR_INVALID_PARAMETERS);if(!(t instanceof Uint8Array))throw new eo("Metadata value must be a Uint8Array",Hg.ERR_INVALID_PARAMETERS)}function ry(e,t){if("string"!=typeof e)throw new eo("Tag name must be a string",Hg.ERR_INVALID_PARAMETERS);if(null!=t.value){if(parseInt(`${t.value}`,10)!==t.value)throw new eo("Tag value must be an integer",Hg.ERR_INVALID_PARAMETERS);if(t.value<0||t.value>100)throw new eo("Tag value must be between 0-100",Hg.ERR_INVALID_PARAMETERS)}if(null!=t.ttl){if(parseInt(`${t.ttl}`,10)!==t.ttl)throw new eo("Tag ttl must be an integer",Hg.ERR_INVALID_PARAMETERS);if(t.ttl<0)throw new eo("Tag ttl must be between greater than 0",Hg.ERR_INVALID_PARAMETERS)}}function ny(e,t){let r;return null!=t.expiry&&(r=t.expiry),null!=t.ttl&&(r=BigInt(Date.now()+Number(t.ttl))),{value:t.value??0,expiry:r}}function sy(e,t,r){const n=e.toString().split("/")[2],s=nh(fe.decode(n)),o=r.get(s);if(null!=o)return o;const i=Kg(s,t);return r.set(s,i),i}class oy{peerId;datastore;lock;addressFilter;constructor(e,t={}){this.peerId=e.peerId,this.datastore=e.datastore,this.addressFilter=t.addressFilter,this.lock=function(e){const t=Object.assign({},$g,e);return null==Mg&&(Mg=(e=>{if(e=Object.assign({},Bg,e),Boolean(globalThis.document)||e.singleProcess){const e=new EventTarget;return Rg.addEventListener("message",Dg(e,"requestReadLock",Tg,Cg,Ng)),Rg.addEventListener("message",Dg(e,"requestWriteLock",xg,Pg,Og)),e}return{isWorker:!0,readLock:e=>Lg(e,Tg,Ng,Cg),writeLock:e=>Lg(e,xg,Og,Pg)}})(t),!0!==Mg.isWorker&&(Mg.addEventListener("requestReadLock",(e=>{null!=Ug[e.data.name]&&Ug[e.data.name].readLock().then((async t=>e.data.handler().finally((()=>{t()}))))})),Mg.addEventListener("requestWriteLock",(async e=>{null!=Ug[e.data.name]&&Ug[e.data.name].writeLock().then((async t=>e.data.handler().finally((()=>{t()}))))})))),null==Ug[t.name]&&(Ug[t.name]=((e,t)=>{if(!0===Mg.isWorker)return{readLock:Mg.readLock(e,t),writeLock:Mg.writeLock(e,t)};const r=new _g({concurrency:1});let n;return{async readLock(){if(null!=n)return Fg(n,t);n=new _g({concurrency:t.concurrency,autoStart:!1});const e=n,s=Fg(n,t);return r.add((async()=>{e.start(),await e.onIdle().then((()=>{n===e&&(n=null)}))})),s},writeLock:async()=>(n=null,Fg(r,t))}})(t.name,t)),Ug[t.name]}({name:"peer-store",singleProcess:!0})}async has(e){return this.datastore.has(Xg(e))}async delete(e){if(this.peerId.equals(e))throw new eo("Cannot delete self peer",Hg.ERR_INVALID_PARAMETERS);await this.datastore.delete(Xg(e))}async load(e){return Kg(e,await this.datastore.get(Xg(e)))}async save(e,t){const{existingBuf:r,existingPeer:n}=await this.#N(e),s=await Zg(e,t,"patch",{addressFilter:this.addressFilter});return this.#x(e,s,r,n)}async patch(e,t){const{existingBuf:r,existingPeer:n}=await this.#N(e),s=await Zg(e,t,"patch",{addressFilter:this.addressFilter,existingPeer:n});return this.#x(e,s,r,n)}async merge(e,t){const{existingBuf:r,existingPeer:n}=await this.#N(e),s=await Zg(e,t,"merge",{addressFilter:this.addressFilter,existingPeer:n});return this.#x(e,s,r,n)}async*all(e){const t=new Eg;for await(const{key:r,value:n}of this.datastore.query(function(e,t){return null==e?{}:{prefix:Jg,filters:(e.filters??[]).map((e=>({key:r,value:n})=>e(sy(r,n,t)))),orders:(e.orders??[]).map((e=>(r,n)=>e(sy(r.key,r.value,t),sy(n.key,n.value,t))))}}(e??{},t))){const e=sy(r,n,t);e.id.equals(this.peerId)||(yield e)}}async#N(e){try{const t=await this.datastore.get(Xg(e));return{existingBuf:t,existingPeer:Kg(e,t)}}catch(e){if("ERR_NOT_FOUND"!==e.code)throw e}return{}}async#x(e,t,r,n){const s=qg.encode(t);return null!=r&&Pn(s,r)?{peer:Kg(e,s),previous:n,updated:!1}:(await this.datastore.put(Xg(e),s),{peer:Kg(e,s),previous:n,updated:!0})}}class iy{store;events;peerId;log;constructor(e,t={}){this.log=e.logger.forComponent("libp2p:peer-store"),this.events=e.events,this.peerId=e.peerId,this.store=new oy(e,t)}[Symbol.toStringTag]="@libp2p/peer-store";async forEach(e,t){this.log.trace("forEach await read lock");const r=await this.store.lock.readLock();this.log.trace("forEach got read lock");try{for await(const r of this.store.all(t))e(r)}finally{this.log.trace("forEach release read lock"),r()}}async all(e){this.log.trace("all await read lock");const t=await this.store.lock.readLock();this.log.trace("all got read lock");try{return await Nn(this.store.all(e))}finally{this.log.trace("all release read lock"),t()}}async delete(e){this.log.trace("delete await write lock");const t=await this.store.lock.writeLock();this.log.trace("delete got write lock");try{await this.store.delete(e)}finally{this.log.trace("delete release write lock"),t()}}async has(e){this.log.trace("has await read lock");const t=await this.store.lock.readLock();this.log.trace("has got read lock");try{return await this.store.has(e)}finally{this.log.trace("has release read lock"),t()}}async get(e){this.log.trace("get await read lock");const t=await this.store.lock.readLock();this.log.trace("get got read lock");try{return await this.store.load(e)}finally{this.log.trace("get release read lock"),t()}}async save(e,t){this.log.trace("save await write lock");const r=await this.store.lock.writeLock();this.log.trace("save got write lock");try{const r=await this.store.save(e,t);return this.#P(e,r),r.peer}finally{this.log.trace("save release write lock"),r()}}async patch(e,t){this.log.trace("patch await write lock");const r=await this.store.lock.writeLock();this.log.trace("patch got write lock");try{const r=await this.store.patch(e,t);return this.#P(e,r),r.peer}finally{this.log.trace("patch release write lock"),r()}}async merge(e,t){this.log.trace("merge await write lock");const r=await this.store.lock.writeLock();this.log.trace("merge got write lock");try{const r=await this.store.merge(e,t);return this.#P(e,r),r.peer}finally{this.log.trace("merge release write lock"),r()}}async consumePeerRecord(e,t){const r=await ip.openAndCertify(e,sp.DOMAIN);if(!1===t?.equals(r.peerId))return this.log("envelope peer id was not the expected peer id - expected: %p received: %p",t,r.peerId),!1;const n=sp.createFromProtobuf(r.payload);let s;try{s=await this.get(r.peerId)}catch(e){if("ERR_NOT_FOUND"!==e.code)throw e}if(null!=s?.peerRecordEnvelope){const e=await ip.createFromProtobuf(s.peerRecordEnvelope),t=sp.createFromProtobuf(e.payload);if(t.seqNumber>=n.seqNumber)return this.log("sequence number was lower or equal to existing sequence number - stored: %d received: %d",t.seqNumber,n.seqNumber),!1}return await this.patch(n.peerId,{peerRecordEnvelope:e,addresses:n.multiaddrs.map((e=>({isCertified:!0,multiaddr:e})))}),!0}#P(e,t){t.updated&&(this.peerId.equals(e)?this.events.safeDispatchEvent("self:peer:update",{detail:t}):this.events.safeDispatchEvent("peer:update",{detail:t}))}}const ay=function(e){if(null!=e[Symbol.asyncIterator])return(async()=>{for await(const t of e);})();for(const t of e);},cy=function(e,t){let r=0;if(null!=e[Symbol.asyncIterator])return async function*(){for await(const n of e)await t(n,r++)&&(yield n)}();const n=function(e){const[t,r]=null!=e[Symbol.asyncIterator]?[e[Symbol.asyncIterator](),Symbol.asyncIterator]:[e[Symbol.iterator](),Symbol.iterator],n=[];return{peek:()=>t.next(),push:e=>{n.push(e)},next:()=>n.length>0?{done:!1,value:n.shift()}:t.next(),[r](){return this}}}(e),{value:s,done:o}=n.next();if(!0===o)return function*(){}();const i=t(s,r++);if("function"==typeof i.then)return async function*(){await i&&(yield s);for await(const e of n)await t(e,r++)&&(yield e)}();const a=t;return function*(){!0===i&&(yield s);for(const e of n)a(e,r++)&&(yield e)}()},ly=function(e,t){return null!=e[Symbol.asyncIterator]?async function*(){const r=await Nn(e);yield*r.sort(t)}():function*(){const r=Nn(e);yield*r.sort(t)}()},uy=function(e,t){return null!=e[Symbol.asyncIterator]?async function*(){let r=0;if(!(t<1))for await(const n of e)if(yield n,r++,r===t)return}():function*(){let r=0;if(!(t<1))for(const n of e)if(yield n,r++,r===t)return}()};class hy{put(e,t,r){return Promise.reject(new Error(".put is not implemented"))}get(e,t){return Promise.reject(new Error(".get is not implemented"))}has(e,t){return Promise.reject(new Error(".has is not implemented"))}delete(e,t){return Promise.reject(new Error(".delete is not implemented"))}async*putMany(e,t={}){for await(const{key:r,value:n}of e)await this.put(r,n,t),yield r}async*getMany(e,t={}){for await(const r of e)yield{key:r,value:await this.get(r,t)}}async*deleteMany(e,t={}){for await(const r of e)await this.delete(r,t),yield r}batch(){let e=[],t=[];return{put(t,r){e.push({key:t,value:r})},delete(e){t.push(e)},commit:async r=>{await ay(this.putMany(e,r)),e=[],await ay(this.deleteMany(t,r)),t=[]}}}async*_all(e,t){throw new Error("._all is not implemented")}async*_allKeys(e,t){throw new Error("._allKeys is not implemented")}query(e,t){let r=this._all(e,t);if(null!=e.prefix){const t=e.prefix;r=cy(r,(e=>e.key.toString().startsWith(t)))}if(Array.isArray(e.filters)&&(r=e.filters.reduce(((e,t)=>cy(e,t)),r)),Array.isArray(e.orders)&&(r=e.orders.reduce(((e,t)=>ly(e,t)),r)),null!=e.offset){let t=0;const n=e.offset;r=cy(r,(()=>t++>=n))}return null!=e.limit&&(r=uy(r,e.limit)),r}queryKeys(e,t){let r=this._allKeys(e,t);if(null!=e.prefix){const t=e.prefix;r=cy(r,(e=>e.toString().startsWith(t)))}if(Array.isArray(e.filters)&&(r=e.filters.reduce(((e,t)=>cy(e,t)),r)),Array.isArray(e.orders)&&(r=e.orders.reduce(((e,t)=>ly(e,t)),r)),null!=e.offset){const t=e.offset;let n=0;r=cy(r,(()=>n++>=t))}return null!=e.limit&&(r=uy(r,e.limit)),r}}var dy=__webpack_require__(6310);class py extends hy{data;constructor(){super(),this.data=new Map}put(e,t){return this.data.set(e.toString(),t),e}get(e){const t=this.data.get(e.toString());if(null==t)throw r=r??new Error("Not Found"),dy(r,"ERR_NOT_FOUND");var r;return t}has(e){return this.data.has(e.toString())}delete(e){this.data.delete(e.toString())}*_all(){for(const[e,t]of this.data.entries())yield{key:new Yg(e),value:t}}*_allKeys(){for(const e of this.data.keys())yield new Yg(e)}}const fy=e=>e;function gy(e,t){const r=e.getPeerId();return null!=r&&rh(r).equals(t)&&(e=e.decapsulate(Mo(`/p2p/${t.toString()}`))),e}class yy{log;components;listen;announce;observed;announceFilter;constructor(e,t={}){const{listen:r=[],announce:n=[]}=t;this.components=e,this.log=e.logger.forComponent("libp2p:address-manager"),this.listen=r.map((e=>e.toString())),this.announce=new Set(n.map((e=>e.toString()))),this.observed=new Map,this.announceFilter=t.announceFilter??fy,this._updatePeerStoreAddresses=function(e,t){let r;return function(){clearTimeout(r),r=setTimeout((function(){r=void 0,e()}),1e3)}}(this._updatePeerStoreAddresses.bind(this)),e.events.addEventListener("transport:listening",(()=>{this._updatePeerStoreAddresses()})),e.events.addEventListener("transport:close",(()=>{this._updatePeerStoreAddresses()}))}[Symbol.toStringTag]="@libp2p/address-manager";_updatePeerStoreAddresses(){const e=this.getAnnounceAddrs().concat(this.components.transportManager.getAddrs()).concat([...this.observed.entries()].filter((([e,t])=>t.confident)).map((([e])=>Mo(e)))).map((e=>e.getPeerId()===this.components.peerId.toString()?e.decapsulate(`/p2p/${this.components.peerId.toString()}`):e));this.components.peerStore.patch(this.components.peerId,{multiaddrs:e}).catch((e=>{this.log.error("error updating addresses",e)}))}getListenAddrs(){return Array.from(this.listen).map((e=>Mo(e)))}getAnnounceAddrs(){return Array.from(this.announce).map((e=>Mo(e)))}getObservedAddrs(){return Array.from(this.observed).map((([e])=>Mo(e)))}addObservedAddr(e){const t=(e=gy(e,this.components.peerId)).toString();this.observed.has(t)||this.observed.set(t,{confident:!1})}confirmObservedAddr(e){const t=(e=gy(e,this.components.peerId)).toString(),r=(this.observed.get(t)??{confident:!1}).confident;this.observed.set(t,{confident:!0}),r||this._updatePeerStoreAddresses()}removeObservedAddr(e){const t=(e=gy(e,this.components.peerId)).toString();this.observed.delete(t)}getAddresses(){let e=this.getAnnounceAddrs().map((e=>e.toString()));0===e.length&&(e=this.components.transportManager.getAddrs().map((e=>e.toString()))),e=e.concat(Array.from(this.observed).filter((([e,t])=>t.confident)).map((([e])=>e)));const t=new Set(e);return this.announceFilter(Array.from(t).map((e=>Mo(e)))).map((e=>!0===e.protos().pop()?.path||e.getPeerId()===this.components.peerId.toString()?e:e.encapsulate(`/p2p/${this.components.peerId.toString()}`)))}}class my{components={};_started=!1;constructor(e={}){this.components={};for(const[t,r]of Object.entries(e))this.components[t]=r;null==this.components.logger&&(this.components.logger=gg())}isStarted(){return this._started}async _invokeStartableMethod(e){await Promise.all(Object.values(this.components).filter((e=>function(e){return null!=e&&"function"==typeof e.start&&"function"==typeof e.stop}(e))).map((async t=>{await(t[e]?.())})))}async beforeStart(){await this._invokeStartableMethod("beforeStart")}async start(){await this._invokeStartableMethod("start"),this._started=!0}async afterStart(){await this._invokeStartableMethod("afterStart")}async beforeStop(){await this._invokeStartableMethod("beforeStop")}async stop(){await this._invokeStartableMethod("stop"),this._started=!1}async afterStop(){await this._invokeStartableMethod("afterStop")}}const by=["metrics","connectionProtector","dns"],wy=["components","isStarted","beforeStart","start","afterStart","beforeStop","stop","afterStop","then","_invokeStartableMethod"];function vy(e){return Array.isArray(e?.[Vu])?e[Vu]:[]}function Ey(e){return Array.isArray(e?.[ju])?e[ju]:[]}function Sy(e){return e?.[Symbol.toStringTag]??e?.toString()??"unknown"}var Ay=__webpack_require__(5507);const _y=["0.0.0.0/8","10.0.0.0/8","100.64.0.0/10","127.0.0.0/8","169.254.0.0/16","172.16.0.0/12","192.0.0.0/24","192.0.0.0/29","192.0.0.8/32","192.0.0.9/32","192.0.0.10/32","192.0.0.170/32","192.0.0.171/32","192.0.2.0/24","192.31.196.0/24","192.52.193.0/24","192.88.99.0/24","192.168.0.0/16","192.175.48.0/24","198.18.0.0/15","198.51.100.0/24","203.0.113.0/24","240.0.0.0/4","255.255.255.255/32"].map((e=>new Ay.Netmask(e)));function ky(e){for(const t of _y)if(t.contains(e))return!0;return!1}function Iy(e){return io(e)?ky(e):/^::ffff:([0-9a-fA-F]{1,4}):([0-9a-fA-F]{1,4})$/.test(e)?function(e){const t=e.split(":");if(t.length<2)return!1;const r=t[t.length-1].padStart(4,"0"),n=t[t.length-2].padStart(4,"0");return ky(`${parseInt(n.substring(0,2),16)}.${parseInt(n.substring(2),16)}.${parseInt(r.substring(0,2),16)}.${parseInt(r.substring(2),16)}`)}(e):/^::ffff:([0-9]{1,3})\.([0-9]{1,3})\.([0-9]{1,3})\.([0-9]{1,3})$/.test(e)?function(e){const t=e.split(":");return ky(t[t.length-1])}(e):ao(e)?function(e){return/^::$/.test(e)||/^::1$/.test(e)||/^64:ff9b::([0-9]{1,3})\.([0-9]{1,3})\.([0-9]{1,3})\.([0-9]{1,3})$/.test(e)||/^100::([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4})$/.test(e)||/^2001::([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4})$/.test(e)||/^2001:2[0-9a-fA-F]:([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4})$/.test(e)||/^2001:db8:([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4})$/.test(e)||/^2002:([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4})$/.test(e)||/^f[c-d]([0-9a-fA-F]{2,2}):/i.test(e)||/^fe[8-9a-bA-B][0-9a-fA-F]:/i.test(e)||/^ff([0-9a-fA-F]{2,2}):/i.test(e)}(e):void 0}function Ry(e={}){return{denyDialPeer:async()=>!1,denyDialMultiaddr:async e=>{const t=e.stringTuples();return(4===t[0][0]||41===t[0][0])&&Boolean(Iy(`${t[0][1]}`))},denyInboundConnection:async()=>!1,denyOutboundConnection:async()=>!1,denyInboundEncryptedConnection:async()=>!1,denyOutboundEncryptedConnection:async()=>!1,denyInboundUpgradedConnection:async()=>!1,denyOutboundUpgradedConnection:async()=>!1,filterMultiaddrForPeer:async()=>!0,...e}}function Ty(e){try{const{address:t}=e.nodeAddress();return Boolean(Iy(t))}catch{return!0}}function Cy(e,t){const r=function(e,t){const r=Ty(e.multiaddr),n=Ty(t.multiaddr);return r&&!n?1:!r&&n?-1:0}(e,t);if(0!==r)return r;const n=function(e,t){const r=Mp.exactMatch(e.multiaddr),n=Mp.exactMatch(t.multiaddr);return r&&!n?1:!r&&n?-1:0}(e,t);if(0!==n)return n;const s=function(e,t){return e.isCertified&&!t.isCertified?-1:!e.isCertified&&t.isCertified?1:0}(e,t);return s}function Ny(e){const t=[Dy.A];return null==e?t:Array.isArray(e)?0===e.length?t:e:[e]}const xy=60;function Py(e){return{Status:e.Status??0,TC:e.TC??e.flag_tc??!1,RD:e.RD??e.flag_rd??!1,RA:e.RA??e.flag_ra??!1,AD:e.AD??e.flag_ad??!1,CD:e.CD??e.flag_cd??!1,Question:(e.Question??e.questions??[]).map((e=>({name:e.name,type:Dy[e.type]}))),Answer:(e.Answer??e.answers??[]).map((e=>({name:e.name,type:Dy[e.type],TTL:e.TTL??e.ttl??xy,data:e.data instanceof Uint8Array?sn(e.data):e.data})))}}function Oy(e,t={}){const r=new _g({concurrency:t.queryConcurrency??4});return async(t,n={})=>{const s=new URLSearchParams;s.set("name",t),Ny(n.types).forEach((e=>{s.append("type",Dy[e])})),n.onProgress?.(new Yf("dns:query",{detail:t}));const o=await r.add((async()=>{const t=await fetch(`${e}?${s}`,{headers:{accept:"application/dns-json"},signal:n?.signal});if(200!==t.status)throw new Error(`Unexpected HTTP status: ${t.status} - ${t.statusText}`);const r=Py(await t.json());return n.onProgress?.(new Yf("dns:response",{detail:r})),r}),{signal:n.signal});if(null==o)throw new Error("No DNS response received");return o}}var Dy,Ly=__webpack_require__(194);class By{lru;constructor(e){this.lru=Ly(e)}get(e,t){let r=!0;const n=[];for(const s of t){const t=this.getAnswers(e,s);if(0===t.length){r=!1;break}n.push(...t)}if(r)return Py({answers:n})}getAnswers(e,t){const r=`${e.toLowerCase()}-${t}`,n=this.lru.get(r);if(null!=n){const e=n.filter((e=>e.expires>Date.now())).map((({expires:e,value:t})=>({...t,TTL:Math.round((e-Date.now())/1e3),type:Dy[t.type]})));return 0===e.length&&this.lru.remove(r),e}return[]}add(e,t){const r=`${e.toLowerCase()}-${t.type}`,n=this.lru.get(r)??[];n.push({expires:Date.now()+1e3*(t.TTL??xy),value:t}),this.lru.set(r,n)}remove(e,t){const r=`${e.toLowerCase()}-${t}`;this.lru.remove(r)}clear(){this.lru.clear()}}class Uy{resolvers;cache;constructor(e){var t;this.resolvers={},this.cache=(t=e.cacheSize??1e3,new By(t)),Object.entries(e.resolvers??{}).forEach((([e,t])=>{Array.isArray(t)||(t=[t]),e.endsWith(".")||(e=`${e}.`),this.resolvers[e]=t})),null==this.resolvers["."]&&(this.resolvers["."]=[Oy("https://cloudflare-dns.com/dns-query"),Oy("https://dns.google/resolve")])}async query(e,t={}){const r=Ny(t.types),n=!1!==t.cached?this.cache.get(e,r):void 0;if(null!=n)return t.onProgress?.(new Yf("dns:cache",{detail:n})),n;const s=`${e.split(".").pop()}.`,o=(this.resolvers[s]??this.resolvers["."]).sort((()=>Math.random()>.5?-1:1)),i=[];for(const n of o){if(!0===t.signal?.aborted)break;try{const s=await n(e,{...t,types:r});for(const t of s.Answer)this.cache.add(e,t);return s}catch(e){i.push(e),t.onProgress?.(new Yf("dns:error",{detail:e}))}}if(1===i.length)throw i[0];throw new AggregateError(i,`DNS lookup of ${e} ${r} failed`)}}!function(e){e[e.A=1]="A",e[e.CNAME=5]="CNAME",e[e.TXT=16]="TXT",e[e.AAAA=28]="AAAA"}(Dy||(Dy={}));const{code:My}=mo("dnsaddr"),Fy=async function(e,t={}){const r=t.maxRecursiveDepth??32;if(0===r)throw new eo("Max recursive depth reached","ERR_MAX_RECURSIVE_DEPTH_REACHED");const[,n]=e.stringTuples().find((([e])=>e===My))??[],s=t?.dns??function(e={}){return new Uy(e)}(),o=await s.query(`_dnsaddr.${n}`,{signal:t?.signal,types:[Dy.TXT]}),i=e.getPeerId(),a=[];for(const e of o.Answer){const n=e.data.replace(/["']/g,"").trim().split("=")[1];if(null==n)continue;if(null!=i&&!n.includes(i))continue;const s=Mo(n);if(n.startsWith("/dnsaddr")){const e=await s.resolve({...t,maxRecursiveDepth:r-1});a.push(...e.map((e=>e.toString())))}else a.push(s.toString())}return a},$y=__webpack_require__(6864);var Hy,qy;!function(e){e.NOT_STARTED_YET="The libp2p node is not started yet",e.ERR_PROTECTOR_REQUIRED="Private network is enforced, but no protector was provided",e.NOT_FOUND="Not found"}(Hy||(Hy={})),function(e){e.ERR_PROTECTOR_REQUIRED="ERR_PROTECTOR_REQUIRED",e.ERR_PEER_DIAL_INTERCEPTED="ERR_PEER_DIAL_INTERCEPTED",e.ERR_CONNECTION_INTERCEPTED="ERR_CONNECTION_INTERCEPTED",e.ERR_INVALID_PROTOCOLS_FOR_STREAM="ERR_INVALID_PROTOCOLS_FOR_STREAM",e.ERR_CONNECTION_ENDED="ERR_CONNECTION_ENDED",e.ERR_CONNECTION_FAILED="ERR_CONNECTION_FAILED",e.ERR_NODE_NOT_STARTED="ERR_NODE_NOT_STARTED",e.ERR_ALREADY_ABORTED="ERR_ALREADY_ABORTED",e.ERR_TOO_MANY_ADDRESSES="ERR_TOO_MANY_ADDRESSES",e.ERR_NO_VALID_ADDRESSES="ERR_NO_VALID_ADDRESSES",e.ERR_RELAYED_DIAL="ERR_RELAYED_DIAL",e.ERR_DIALED_SELF="ERR_DIALED_SELF",e.ERR_DISCOVERED_SELF="ERR_DISCOVERED_SELF",e.ERR_DUPLICATE_TRANSPORT="ERR_DUPLICATE_TRANSPORT",e.ERR_ENCRYPTION_FAILED="ERR_ENCRYPTION_FAILED",e.ERR_HOP_REQUEST_FAILED="ERR_HOP_REQUEST_FAILED",e.ERR_INVALID_KEY="ERR_INVALID_KEY",e.ERR_INVALID_MESSAGE="ERR_INVALID_MESSAGE",e.ERR_INVALID_PARAMETERS="ERR_INVALID_PARAMETERS",e.ERR_INVALID_PEER="ERR_INVALID_PEER",e.ERR_MUXER_UNAVAILABLE="ERR_MUXER_UNAVAILABLE",e.ERR_NOT_FOUND="ERR_NOT_FOUND",e.ERR_TRANSPORT_UNAVAILABLE="ERR_TRANSPORT_UNAVAILABLE",e.ERR_TRANSPORT_DIAL_FAILED="ERR_TRANSPORT_DIAL_FAILED",e.ERR_UNSUPPORTED_PROTOCOL="ERR_UNSUPPORTED_PROTOCOL",e.ERR_PROTOCOL_HANDLER_ALREADY_REGISTERED="ERR_PROTOCOL_HANDLER_ALREADY_REGISTERED",e.ERR_INVALID_MULTIADDR="ERR_INVALID_MULTIADDR",e.ERR_SIGNATURE_NOT_VALID="ERR_SIGNATURE_NOT_VALID",e.ERR_FIND_SELF="ERR_FIND_SELF",e.ERR_NO_ROUTERS_AVAILABLE="ERR_NO_ROUTERS_AVAILABLE",e.ERR_CONNECTION_NOT_MULTIPLEXED="ERR_CONNECTION_NOT_MULTIPLEXED",e.ERR_NO_DIAL_TOKENS="ERR_NO_DIAL_TOKENS",e.ERR_INVALID_CMS="ERR_INVALID_CMS",e.ERR_MISSING_KEYS="ERR_MISSING_KEYS",e.ERR_NO_KEY="ERR_NO_KEY",e.ERR_INVALID_KEY_NAME="ERR_INVALID_KEY_NAME",e.ERR_INVALID_KEY_TYPE="ERR_INVALID_KEY_TYPE",e.ERR_KEY_ALREADY_EXISTS="ERR_KEY_ALREADY_EXISTS",e.ERR_INVALID_KEY_SIZE="ERR_INVALID_KEY_SIZE",e.ERR_KEY_NOT_FOUND="ERR_KEY_NOT_FOUND",e.ERR_OLD_KEY_NAME_INVALID="ERR_OLD_KEY_NAME_INVALID",e.ERR_NEW_KEY_NAME_INVALID="ERR_NEW_KEY_NAME_INVALID",e.ERR_PASSWORD_REQUIRED="ERR_PASSWORD_REQUIRED",e.ERR_PEM_REQUIRED="ERR_PEM_REQUIRED",e.ERR_CANNOT_READ_KEY="ERR_CANNOT_READ_KEY",e.ERR_MISSING_PRIVATE_KEY="ERR_MISSING_PRIVATE_KEY",e.ERR_MISSING_PUBLIC_KEY="ERR_MISSING_PUBLIC_KEY",e.ERR_INVALID_OLD_PASS_TYPE="ERR_INVALID_OLD_PASS_TYPE",e.ERR_INVALID_NEW_PASS_TYPE="ERR_INVALID_NEW_PASS_TYPE",e.ERR_INVALID_PASS_LENGTH="ERR_INVALID_PASS_LENGTH",e.ERR_NOT_IMPLEMENTED="ERR_NOT_IMPLEMENTED",e.ERR_WRONG_PING_ACK="ERR_WRONG_PING_ACK",e.ERR_INVALID_RECORD="ERR_INVALID_RECORD",e.ERR_ALREADY_SUCCEEDED="ERR_ALREADY_SUCCEEDED",e.ERR_NO_HANDLER_FOR_PROTOCOL="ERR_NO_HANDLER_FOR_PROTOCOL",e.ERR_TOO_MANY_OUTBOUND_PROTOCOL_STREAMS="ERR_TOO_MANY_OUTBOUND_PROTOCOL_STREAMS",e.ERR_TOO_MANY_INBOUND_PROTOCOL_STREAMS="ERR_TOO_MANY_INBOUND_PROTOCOL_STREAMS",e.ERR_CONNECTION_DENIED="ERR_CONNECTION_DENIED",e.ERR_TRANSFER_LIMIT_EXCEEDED="ERR_TRANSFER_LIMIT_EXCEEDED"}(qy||(qy={}));const Vy={addresses:{listen:[],announce:[],noAnnounce:[],announceFilter:e=>e},connectionManager:{resolvers:{dnsaddr:Fy},addressSorter:Cy},transportManager:{faultTolerance:Bf.FATAL_ALL}};function jy(e){if(Qs(e))return{peerId:e,multiaddrs:[]};let t;if(Array.isArray(e)||(e=[e]),e.length>0){const r=e[0].getPeerId();t=null==r?void 0:rh(r),e.forEach((e=>{if(!Uo(e))throw new eo("Invalid Multiaddr",qy.ERR_INVALID_MULTIADDR);const r=e.getPeerId();if(null==r){if(null!=t)throw new eo("Multiaddrs must all have the same peer id or have no peer id",qy.ERR_INVALID_PARAMETERS)}else{const e=rh(r);if(!0!==t?.equals(e))throw new eo("Multiaddrs must all have the same peer id or have no peer id",qy.ERR_INVALID_PARAMETERS)}}))}return{peerId:t,multiaddrs:e}}class Ky extends Error{type;code;constructor(e,t){super(e??"The operation was aborted"),this.type="aborted",this.name="AbortError",this.code=t??"ABORT_ERR"}}async function zy(e,t,r,n){const s=new Ky(n?.errorMessage,n?.errorCode);return!0===r?.aborted?Promise.reject(s):new Promise(((o,i)=>{function a(){r?.removeEventListener("abort",u),e.removeEventListener(t,c),null!=n?.errorEvent&&e.removeEventListener(n.errorEvent,l)}const c=e=>{try{if(!1===n?.filter?.(e))return}catch(e){return a(),void i(e)}a(),o(e)},l=e=>{a(),i(e.detail)},u=()=>{a(),i(s)};r?.addEventListener("abort",u),e.addEventListener(t,c),null!=n?.errorEvent&&e.addEventListener(n.errorEvent,l)}))}class Gy{deferred;signal;constructor(e){this.signal=e,this.deferred=Gn(),this.onAbort=this.onAbort.bind(this),this.signal?.addEventListener("abort",this.onAbort)}onAbort(){this.deferred.reject(this.signal?.reason??new Zs)}cleanup(){this.signal?.removeEventListener("abort",this.onAbort)}}class Wy{id;fn;options;recipients;status;timeline;controller;constructor(e,t){this.id=`${parseInt(String(1e9*Math.random()),10).toString()}${Date.now()}`,this.status="queued",this.fn=e,this.options=t,this.recipients=[],this.timeline={created:Date.now()},this.controller=new AbortController,this.controller.signal,this.onAbort=this.onAbort.bind(this)}abort(e){this.controller.abort(e)}onAbort(){this.recipients.reduce(((e,t)=>e&&!0===t.signal?.aborted),!0)&&(this.controller.abort(new Zs),this.cleanup())}async join(e={}){const t=new Gy(e.signal);return this.recipients.push(t),e.signal?.addEventListener("abort",this.onAbort),t.deferred.promise}async run(){this.status="running",this.timeline.started=Date.now();try{this.controller.signal.throwIfAborted();const e=await ih(this.fn({...this.options??{},signal:this.controller.signal}),this.controller.signal);this.recipients.forEach((t=>{t.deferred.resolve(e)})),this.status="complete"}catch(e){this.recipients.forEach((t=>{t.deferred.reject(e)})),this.status="errored"}finally{this.timeline.finished=Date.now(),this.cleanup()}}cleanup(){this.recipients.forEach((e=>{e.cleanup(),e.signal?.removeEventListener("abort",this.onAbort)}))}}class Yy extends Fs{concurrency;queue;pending;sort;constructor(e={}){super(),this.concurrency=e.concurrency??Number.POSITIVE_INFINITY,this.pending=0,null!=e.metricName&&e.metrics?.registerMetricGroup(e.metricName,{calculate:()=>({size:this.queue.length,running:this.pending,queued:this.queue.length-this.pending})}),this.sort=e.sort,this.queue=[]}tryToStartAnother(){if(0===this.size)return queueMicrotask((()=>{this.safeDispatchEvent("empty")})),0===this.running&&queueMicrotask((()=>{this.safeDispatchEvent("idle")})),!1;if(this.pending{for(let t=0;t(this.safeDispatchEvent("completed",{detail:e}),this.safeDispatchEvent("success",{detail:{job:r,result:e}}),e))).catch((e=>{if("queued"===r.status)for(let e=0;e{e.abort(new Zs)})),this.clear()}async onEmpty(e){0!==this.size&&await zy(this,"empty",e?.signal)}async onSizeLessThan(e,t){this.sizethis.size{null!=e?this.abort():this.clear(),t.end(e)},n=e=>{null!=e.detail&&t.push(e.detail)},s=e=>{r(e.detail)},o=()=>{r()},i=()=>{r(new eo("Queue aborted","ERR_QUEUE_ABORTED"))};this.addEventListener("completed",n),this.addEventListener("error",s),this.addEventListener("idle",o),e?.signal?.addEventListener("abort",i);try{yield*t}finally{this.removeEventListener("completed",n),this.removeEventListener("error",s),this.removeEventListener("idle",o),e?.signal?.removeEventListener("abort",i),r()}}}class Jy extends Yy{has(e){return null!=this.find(e)}find(e){return this.queue.find((t=>e.equals(t.options.peerId)))}}const Xy=42e4,Qy="last-dial-failure",Zy=5,em=100,tm=25,rm=0,nm=5e3,sm=Xy,om=10;class im{connectionManager;peerStore;queue;minConnections;autoDialPriority;autoDialIntervalMs;autoDialMaxQueueLength;autoDialPeerRetryThresholdMs;autoDialDiscoveredPeersDebounce;autoDialInterval;started;running;log;constructor(e,t){let r;this.connectionManager=e.connectionManager,this.peerStore=e.peerStore,this.minConnections=t.minConnections??Zy,this.autoDialPriority=t.autoDialPriority??rm,this.autoDialIntervalMs=t.autoDialInterval??nm,this.autoDialMaxQueueLength=t.maxQueueLength??em,this.autoDialPeerRetryThresholdMs=t.autoDialPeerRetryThreshold??sm,this.autoDialDiscoveredPeersDebounce=t.autoDialDiscoveredPeersDebounce??om,this.log=e.logger.forComponent("libp2p:connection-manager:auto-dial"),this.started=!1,this.running=!1,this.queue=new Jy({concurrency:t.autoDialConcurrency??tm,metricName:"libp2p_autodial_queue",metrics:e.metrics}),this.queue.addEventListener("error",(e=>{this.log.error("error during auto-dial",e.detail)})),e.events.addEventListener("connection:close",(()=>{this.autoDial().catch((e=>{this.log.error(e)}))})),e.events.addEventListener("peer:discovery",(()=>{clearTimeout(r),r=setTimeout((()=>{this.autoDial().catch((e=>{this.log.error(e)}))}),this.autoDialDiscoveredPeersDebounce)}))}isStarted(){return this.started}start(){this.started=!0}afterStart(){this.autoDial().catch((e=>{this.log.error("error while autodialing",e)}))}stop(){this.queue.clear(),clearTimeout(this.autoDialInterval),this.started=!1,this.running=!1}async autoDial(){if(!this.started||this.running)return;const e=this.connectionManager.getConnectionsMap(),t=e.size;if(t>=this.minConnections)return void(this.minConnections>0&&this.log.trace("have enough connections %d/%d",t,this.minConnections));if(this.queue.size>this.autoDialMaxQueueLength)return this.log("not enough connections %d/%d but auto dial queue is full",t,this.minConnections),void this.sheduleNextAutodial();this.running=!0,this.log("not enough connections %d/%d - will dial peers to increase the number of connections",t,this.minConnections);const r=new mg(this.connectionManager.getDialQueue().map((e=>e.peerId)).filter(Boolean)),n=await this.peerStore.all({filters:[t=>0===t.addresses.length?(this.log.trace("not autodialing %p because they have no addresses",t.id),!1):e.has(t.id)?(this.log.trace("not autodialing %p because they are already connected",t.id),!1):r.has(t.id)?(this.log.trace("not autodialing %p because they are already being dialed",t.id),!1):!this.queue.has(t.id)||(this.log.trace("not autodialing %p because they are already being autodialed",t.id),!1)]}),s=n.sort((()=>Math.random()>.5?1:-1)),o=new Eg;for(const e of s)o.has(e.id)||o.set(e.id,[...e.tags.values()].reduce(((e,t)=>e+t.value),0));const i=s.sort(((e,t)=>{const r=o.get(e.id)??0,n=o.get(t.id)??0;return r>n?-1:r{const t=e.metadata.get(Qy);if(null==t)return!0;const r=parseInt(sn(t));return!!isNaN(r)||Date.now()-r>this.autoDialPeerRetryThresholdMs}));this.log("selected %d/%d peers to dial",i.length,n.length);for(const e of i)this.queue.add((async()=>{const t=this.connectionManager.getConnectionsMap().size;if(t>=this.minConnections)return this.log("got enough connections now %d/%d",t,this.minConnections),void this.queue.clear();this.log("connecting to a peerStore stored peer %p",e.id),await this.connectionManager.openConnection(e.id,{priority:this.autoDialPriority})}),{peerId:e.id}).catch((e=>{this.log.error("could not connect to peerStore stored peer",e)}));this.running=!1,this.sheduleNextAutodial()}sheduleNextAutodial(){this.started&&(this.autoDialInterval=setTimeout((()=>{this.autoDial().catch((e=>{this.log.error("error while autodialing",e)}))}),this.autoDialIntervalMs))}}const am=["/ipfs/id/1.0.0","/ipfs/id/push/1.0.0","/libp2p/autonat/1.0.0","/libp2p/dcutr"],cm={maxConnections:100,allow:[]};class lm{maxConnections;connectionManager;peerStore;allow;events;log;constructor(e,t={}){this.maxConnections=t.maxConnections??cm.maxConnections,this.allow=t.allow??cm.allow,this.connectionManager=e.connectionManager,this.peerStore=e.peerStore,this.events=e.events,this.log=e.logger.forComponent("libp2p:connection-manager:connection-pruner"),e.events.addEventListener("connection:open",(()=>{this.maybePruneConnections().catch((e=>{this.log.error(e)}))}))}async maybePruneConnections(){const e=this.connectionManager.getConnections(),t=e.length;if(this.log("checking max connections limit %d/%d",t,this.maxConnections),t<=this.maxConnections)return;const r=new Eg;for(const t of e){const e=t.remotePeer;if(!r.has(e)){r.set(e,0);try{const t=await this.peerStore.get(e);r.set(e,[...t.tags.values()].reduce(((e,t)=>e+t.value),0))}catch(e){"ERR_NOT_FOUND"!==e.code&&this.log.error("error loading peer tags",e)}}}const n=this.sortConnections(e,r),s=Math.max(t-this.maxConnections,0),o=[];for(const e of n)if(this.log("too many connections open - closing a connection to %p",e.remotePeer),this.allow.some((t=>e.remoteAddr.toString().startsWith(t.toString())))||o.push(e),o.length===s)break;await Promise.all(o.map((async e=>{await async function(e,t){const r=e?.streams?.map((e=>e.protocol))??[],n=t?.closableProtocols??am;if(!(r.filter((e=>null!=e&&!n.includes(e))).length>0))try{await(e?.close(t))}catch(t){e?.abort(t)}}(e,{signal:AbortSignal.timeout(1e3)})}))),this.events.safeDispatchEvent("connection:prune",{detail:o})}sortConnections(e,t){return e.sort(((e,t)=>{const r=e.timeline.open,n=t.timeline.open;return rn?-1:0})).sort(((e,t)=>"outbound"===e.direction&&"inbound"===t.direction?1:"inbound"===e.direction&&"outbound"===t.direction?-1:0)).sort(((e,t)=>e.streams.length>t.streams.length?1:e.streams.length{const n=t.get(e.remotePeer)??0,s=t.get(r.remotePeer)??0;return n>s?1:ne.options.priority>t.options.priority?-1:e.options.priority{this.log.error("error in dial queue",e.detail)}))}start(){this.shutDownController=new AbortController,this.shutDownController.signal}stop(){this.shutDownController.abort(),this.queue.abort()}async dial(e,t={}){const{peerId:r,multiaddrs:n}=jy(e),s=Array.from(this.connections.values()).flat().find((e=>!0!==t.force&&(!!e.remotePeer.equals(r)||n.find((t=>t.equals(e.remoteAddr))))));if(null!=s)return this.log("already connected to %a",s.remoteAddr),t.onProgress?.(new Yf("dial-queue:already-connected")),s;const o=this.queue.queue.find((e=>{if(!0===r?.equals(e.options.peerId))return!0;const t=e.options.multiaddrs;if(null==t)return!1;for(const e of n)if(t.has(e.toString()))return!0;return!1}));if(null!=o){this.log("joining existing dial target for %p",r);for(const e of n)o.options.multiaddrs.add(e.toString());return t.onProgress?.(new Yf("dial-queue:already-in-dial-queue")),o.join(t)}if(this.queue.size>=this.maxDialQueueLength)throw new eo("Dial queue is full","ERR_DIAL_QUEUE_FULL");return this.log("creating dial target for %p",r,n.map((e=>e.toString()))),t.onProgress?.(new Yf("dial-queue:add-to-dial-queue")),this.queue.add((async e=>{e?.onProgress?.(new Yf("dial-queue:start-dial"));const t=this.createDialAbortController(e?.signal);let n;try{n=await this.calculateMultiaddrs(r,e?.multiaddrs,{...e,signal:t}),e?.onProgress?.(new Yf("dial-queue:calculated-addresses",n)),n.map((({multiaddr:e})=>e.toString())).forEach((t=>{e?.multiaddrs.add(t)}))}catch(e){throw t.clear(),e}try{let s=0;const o=[];for(const i of n){if(s===this.maxPeerAddrsToDial)throw this.log("dialed maxPeerAddrsToDial (%d) addresses for %p, not trying any others",s,r),new eo("Peer had more than maxPeerAddrsToDial",qy.ERR_TOO_MANY_ADDRESSES);s++;try{const r=await this.components.transportManager.dial(i.multiaddr,{...e,signal:t});return this.log("dial to %a succeeded",i.multiaddr),r}catch(e){if(this.log.error("dial failed to %a",i.multiaddr,e),null!=r)try{await this.components.peerStore.patch(r,{metadata:{[Qy]:Nt(Date.now().toString())}})}catch(e){this.log.error("could not update last dial failure key for %p",r,e)}if(t.aborted)throw new eo(e.message,ro);o.push(e)}}if(1===o.length)throw o[0];throw new to(o,"All multiaddr dials failed",qy.ERR_TRANSPORT_DIAL_FAILED)}finally{t.clear()}}),{peerId:r,priority:t.priority??fm,multiaddrs:new Set(n.map((e=>e.toString()))),signal:t.signal,onProgress:t.onProgress})}createDialAbortController(e){return hm([AbortSignal.timeout(this.dialTimeout),this.shutDownController.signal,e])}async calculateMultiaddrs(e,t=new Set,r={}){const n=[...t].map((e=>({multiaddr:Mo(e),isCertified:!1})));if(null!=e){if(this.components.peerId.equals(e))throw new eo("Tried to dial self",qy.ERR_DIALED_SELF);if(!0===await(this.components.connectionGater.denyDialPeer?.(e)))throw new eo("The dial request is blocked by gater.allowDialPeer",qy.ERR_PEER_DIAL_INTERCEPTED);if(0===n.length){this.log("loading multiaddrs for %p",e);try{const t=await this.components.peerStore.get(e);n.push(...t.addresses),this.log("loaded multiaddrs for %p",e,n.map((({multiaddr:e})=>e.toString())))}catch(e){if(e.code!==qy.ERR_NOT_FOUND)throw e}}if(0===n.length){this.log("looking up multiaddrs for %p in the peer routing",e);try{const t=await this.components.peerRouting.findPeer(e);this.log("found multiaddrs for %p in the peer routing",e,n.map((({multiaddr:e})=>e.toString()))),n.push(...t.multiaddrs.map((e=>({multiaddr:e,isCertified:!1}))))}catch(t){t.code!==qy.ERR_NO_ROUTERS_AVAILABLE&&this.log.error("looking up multiaddrs for %p in the peer routing failed",e,t)}}}let s=(await Promise.all(n.map((async e=>{const t=await async function(e,t){let r=!1;for(const t of Bo.keys())if(r=e.protoNames().includes(t),r)break;if(!r)return[e];const n=await e.resolve(t);return t.log("resolved %s to",e,n.map((e=>e.toString()))),n}(e.multiaddr,{dns:this.components.dns,...r,log:this.log});return 1===t.length&&t[0].equals(e.multiaddr)?e:t.map((e=>({multiaddr:e,isCertified:!1})))})))).flat();if(null!=e){const t=`/p2p/${e.toString()}`;s=s.map((e=>{const r=e.multiaddr.protos().pop();return!0===r?.path?e:null==e.multiaddr.getPeerId()?{multiaddr:e.multiaddr.encapsulate(t),isCertified:e.isCertified}:e}))}const o=s.filter((t=>{if(null==this.components.transportManager.dialTransportForMultiaddr(t.multiaddr))return!1;const r=t.multiaddr.getPeerId();return null==e||null==r||e.equals(r)})),i=new Map;for(const e of o){const t=e.multiaddr.toString(),r=i.get(t);null==r?i.set(t,e):r.isCertified=r.isCertified||e.isCertified||!1}const a=[...i.values()];if(0===a.length)throw new eo("The dial request has no valid addresses",qy.ERR_NO_VALID_ADDRESSES);const c=[];for(const e of a)null!=this.components.connectionGater.denyDialMultiaddr&&await this.components.connectionGater.denyDialMultiaddr(e.multiaddr)||c.push(e);const l=c.sort(this.addressSorter);if(0===l.length)throw new eo("The connection gater denied all addresses in the dial request",qy.ERR_NO_VALID_ADDRESSES);return this.log.trace("addresses for %p before filtering",e??"unknown peer",s.map((({multiaddr:e})=>e.toString()))),this.log.trace("addresses for %p after filtering",e??"unknown peer",l.map((({multiaddr:e})=>e.toString()))),l}async isDialable(e,t={}){Array.isArray(e)||(e=[e]);try{const r=await this.calculateMultiaddrs(void 0,new Set(e.map((e=>e.toString()))),t);return!1!==t.runOnTransientConnection||null!=r.find((e=>!Mp.matches(e.multiaddr)))}catch(e){this.log.trace("error calculating if multiaddr(s) were dialable",e)}return!1}}const fm=50,gm=5,ym=100,mm=5,bm=10,wm=25,vm=0,Em=100,Sm=Xy,Am=10;class _m{started;connections;allow;deny;maxIncomingPendingConnections;incomingPendingConnections;maxConnections;dialQueue;autoDial;connectionPruner;inboundConnectionRateLimiter;peerStore;metrics;events;log;constructor(e,t={}){this.maxConnections=t.maxConnections??ym;const r=t.minConnections??gm;if(this.maxConnectionsMo(e))),this.deny=(t.deny??[]).map((e=>Mo(e))),this.incomingPendingConnections=0,this.maxIncomingPendingConnections=t.maxIncomingPendingConnections??bm,this.inboundConnectionRateLimiter=new df({points:t.inboundConnectionThreshold??mm,duration:1}),this.autoDial=new im({connectionManager:this,peerStore:e.peerStore,events:e.events,logger:e.logger},{minConnections:r,autoDialConcurrency:t.autoDialConcurrency??wm,autoDialPriority:t.autoDialPriority??vm,autoDialPeerRetryThreshold:t.autoDialPeerRetryThreshold??Sm,autoDialDiscoveredPeersDebounce:t.autoDialDiscoveredPeersDebounce??Am,maxQueueLength:t.autoDialMaxQueueLength??Em}),this.connectionPruner=new lm({connectionManager:this,peerStore:e.peerStore,events:e.events,logger:e.logger},{maxConnections:this.maxConnections,allow:this.allow}),this.dialQueue=new pm(e,{addressSorter:t.addressSorter??Cy,maxParallelDials:t.maxParallelDials??50,maxDialQueueLength:t.maxDialQueueLength??500,maxPeerAddrsToDial:t.maxPeerAddrsToDial??25,dialTimeout:t.dialTimeout??5e3,resolvers:t.resolvers??{dnsaddr:Fy},connections:this.connections})}[Symbol.toStringTag]="@libp2p/connection-manager";isStarted(){return this.started}async start(){this.metrics?.registerMetricGroup("libp2p_connection_manager_connections",{calculate:()=>{const e={inbound:0,outbound:0};for(const t of this.connections.values())for(const r of t)"inbound"===r.direction?e.inbound++:e.outbound++;return e}}),this.metrics?.registerMetricGroup("libp2p_protocol_streams_total",{label:"protocol",calculate:()=>{const e={};for(const t of this.connections.values())for(const r of t)for(const t of r.streams){const r=`${t.direction} ${t.protocol??"unnegotiated"}`;e[r]=(e[r]??0)+1}return e}}),this.metrics?.registerMetricGroup("libp2p_connection_manager_protocol_streams_per_connection_90th_percentile",{label:"protocol",calculate:()=>{const e={};for(const t of this.connections.values())for(const r of t){const t={};for(const e of r.streams){const r=`${e.direction} ${e.protocol??"unnegotiated"}`;t[r]=(t[r]??0)+1}for(const[r,n]of Object.entries(t))e[r]=e[r]??[],e[r].push(n)}const t={};for(let[r,n]of Object.entries(e)){n=n.sort(((e,t)=>e-t));const e=Math.floor(.9*n.length);t[r]=n[e]}return t}}),this.dialQueue.start(),this.autoDial.start(),this.started=!0,this.log("started")}async afterStart(){Promise.resolve().then((async()=>{const e=await this.peerStore.all({filters:[e=>e.tags.has("keep-alive")]});await Promise.all(e.map((async e=>{await this.openConnection(e.id).catch((e=>{this.log.error(e)}))})))})).catch((e=>{this.log.error(e)})),this.autoDial.afterStart()}async stop(){this.dialQueue.stop(),this.autoDial.stop();const e=[];for(const t of this.connections.values())for(const r of t)e.push((async()=>{try{await r.close()}catch(e){this.log.error(e)}})());this.log("closing %d connections",e.length),await Promise.all(e),this.connections.clear(),this.log("stopped")}onConnect(e){this._onConnect(e).catch((e=>{this.log.error(e)}))}async _onConnect(e){const{detail:t}=e;if(!this.started)return void await t.close();const r=t.remotePeer,n=this.connections.get(r);let s=!1;null!=n?n.push(t):(s=!0,this.connections.set(r,[t])),null!=r.publicKey&&"RSA"===r.type&&await this.peerStore.patch(r,{publicKey:r.publicKey}),s&&this.events.safeDispatchEvent("peer:connect",{detail:t.remotePeer})}onDisconnect(e){const{detail:t}=e;if(!this.started)return;const r=t.remotePeer;let n=this.connections.get(r);null!=n&&n.length>1?(n=n.filter((e=>e.id!==t.id)),this.connections.set(r,n)):null!=n&&(this.connections.delete(r),this.events.safeDispatchEvent("peer:disconnect",{detail:t.remotePeer}))}getConnections(e){if(null!=e)return this.connections.get(e)??[];let t=[];for(const e of this.connections.values())t=t.concat(e);return t}getConnectionsMap(){return this.connections}async openConnection(e,t={}){if(!this.isStarted())throw new eo("Not started",qy.ERR_NODE_NOT_STARTED);t.signal?.throwIfAborted();const{peerId:r}=jy(e);if(null!=r&&!0!==t.force){this.log("dial %p",r);const e=this.getConnections(r).find((e=>!e.transient));if(null!=e)return this.log("had an existing non-transient connection to %p",r),t.onProgress?.(new Yf("dial-queue:already-connected")),e}const n=await this.dialQueue.dial(e,{...t,priority:t.priority??fm});let s=this.connections.get(n.remotePeer);null==s&&(s=[],this.connections.set(n.remotePeer,s));let o=!1;for(const e of s)e.id===n.id&&(o=!0);return o||s.push(n),n}async closeConnections(e,t={}){const r=this.connections.get(e)??[];await Promise.all(r.map((async e=>{try{await e.close(t)}catch(t){e.abort(t)}})))}async acceptIncomingConnection(e){if(this.deny.some((t=>e.remoteAddr.toString().startsWith(t.toString()))))return this.log("connection from %a refused - connection remote address was in deny list",e.remoteAddr),!1;if(this.allow.some((t=>e.remoteAddr.toString().startsWith(t.toString()))))return this.incomingPendingConnections++,!0;if(this.incomingPendingConnections===this.maxIncomingPendingConnections)return this.log("connection from %a refused - incomingPendingConnections exceeded by host",e.remoteAddr),!1;if(e.remoteAddr.isThinWaistAddress()){const t=e.remoteAddr.nodeAddress().address;try{await this.inboundConnectionRateLimiter.consume(t,1)}catch{return this.log("connection from %a refused - inboundConnectionThreshold exceeded by host %s",e.remoteAddr,t),!1}}return this.getConnections().length({id:t.id,status:e[t.status],peerId:t.options.peerId,multiaddrs:[...t.options.multiaddrs].map((e=>Mo(e)))})))}async isDialable(e,t={}){return this.dialQueue.isDialable(e,t)}}class km{movingAverage;variance;deviation;forecast;timespan;previousTime;constructor(e){this.timespan=e,this.movingAverage=0,this.variance=0,this.deviation=0,this.forecast=0}alpha(e,t){return 1-Math.exp(-(e-t)/this.timespan)}push(e,t=Date.now()){if(null!=this.previousTime){const r=this.alpha(t,this.previousTime),n=e-this.movingAverage,s=r*n;this.movingAverage=r*e+(1-r)*this.movingAverage,this.variance=(1-r)*(this.variance+n*s),this.deviation=Math.sqrt(this.variance),this.forecast=this.movingAverage+r*n}else this.movingAverage=e;this.previousTime=t}}class Im{success;failure;next;metric;timeoutMultiplier;failureMultiplier;minTimeout;constructor(e={}){this.success=new km(e.interval??5e3),this.failure=new km(e.interval??5e3),this.next=new km(e.interval??5e3),this.failureMultiplier=e.failureMultiplier??2,this.timeoutMultiplier=e.timeoutMultiplier??1.2,this.minTimeout=e.minTimeout??2e3,null!=e.metricName&&(this.metric=e.metrics?.registerMetricGroup(e.metricName))}getTimeoutSignal(e={}){const t=Math.max(Math.round(this.next.movingAverage*(e.timeoutFactor??this.timeoutMultiplier)),this.minTimeout),r=AbortSignal.timeout(t),n=hm([e.signal,r]);return n.start=Date.now(),n.timeout=t,n}cleanUp(e){const t=Date.now()-e.start;e.aborted?(this.failure.push(t),this.next.push(t*this.failureMultiplier),this.metric?.update({failureMovingAverage:this.failure.movingAverage,failureDeviation:this.failure.deviation,failureForecast:this.failure.forecast,failureVariance:this.failure.variance,failure:t})):(this.success.push(t),this.next.push(t),this.metric?.update({successMovingAverage:this.success.movingAverage,successDeviation:this.success.deviation,successForecast:this.success.forecast,successVariance:this.success.variance,success:t}))}}class Rm{protocol;components;log;heartbeatInterval;pingIntervalMs;abortController;timeout;constructor(e,t={}){this.components=e,this.protocol=`/${t.protocolPrefix??"ipfs"}/ping/1.0.0`,this.log=e.logger.forComponent("libp2p:connection-monitor"),this.pingIntervalMs=t.pingInterval??1e4,this.timeout=new Im({...t.pingTimeout??{},metrics:e.metrics,metricName:"libp2p_connection_monitor_ping_time_milliseconds"})}[Symbol.toStringTag]="@libp2p/connection-monitor";[Vu]=["@libp2p/connection-monitor"];start(){this.abortController=new AbortController,this.heartbeatInterval=setInterval((()=>{this.components.connectionManager.getConnections().forEach((e=>{Promise.resolve().then((async()=>{let t=Date.now();try{const r=this.timeout.getTimeoutSignal({signal:this.abortController?.signal}),n=hh(await e.newStream(this.protocol,{signal:r,runOnTransientConnection:!0}));t=Date.now(),await Promise.all([n.write(su(32),{signal:r}),n.read(32,{signal:r})]),e.rtt=Date.now()-t,await n.unwrap().close({signal:r})}catch(r){if("ERR_UNSUPPORTED_PROTOCOL"!==r.code)throw r;e.rtt=(Date.now()-t)/2}})).catch((t=>{this.log.error("error during heartbeat, aborting connection",t),e.abort(t)}))}))}),this.pingIntervalMs)}stop(){this.abortController?.abort(),null!=this.heartbeatInterval&&clearInterval(this.heartbeatInterval)}}class Tm{routers;started;components;constructor(e,t){this.routers=t.routers??[],this.started=!1,this.components=e}[Symbol.toStringTag]="@libp2p/content-routing";isStarted(){return this.started}async start(){this.started=!0}async stop(){this.started=!1}async*findProviders(e,t={}){if(0===this.routers.length)throw new eo("No content routers available",qy.ERR_NO_ROUTERS_AVAILABLE);const r=this,n=new mg;for await(const s of Qn(...r.routers.map((r=>r.findProviders(e,t)))))null!=s&&(s.multiaddrs.length>0&&await this.components.peerStore.merge(s.id,{multiaddrs:s.multiaddrs}),n.has(s.id)||(n.add(s.id),yield s))}async provide(e,t={}){if(0===this.routers.length)throw new eo("No content routers available",qy.ERR_NO_ROUTERS_AVAILABLE);await Promise.all(this.routers.map((async r=>{await r.provide(e,t)})))}async put(e,t,r){if(!this.isStarted())throw new eo(Hy.NOT_STARTED_YET,qy.ERR_NODE_NOT_STARTED);await Promise.all(this.routers.map((async n=>{await n.put(e,t,r)})))}async get(e,t){if(!this.isStarted())throw new eo(Hy.NOT_STARTED_YET,qy.ERR_NODE_NOT_STARTED);return Promise.any(this.routers.map((async r=>r.get(e,t))))}}class Cm{fp;h;seed;constructor(e,t,r,n=2){if(n>64)throw new TypeError("Invalid Fingerprint Size");const s=t.hashV(e,r),o=b(n);for(let e=0;ee.equals(t)))}add(e){if(!(e instanceof Cm))throw new TypeError("Invalid Fingerprint");for(let t=0;te.equals(t)));return t>-1&&(this.contents[t]=null,!0)}}const Pm={32:16777619n,64:1099511628211n,128:309485009821345068724781371n,256:374144419156711147060143317175368453031918731002211n,512:35835915874844867368919076489095108449946327955754392558399825615420669938882575126094039892345713852759n,1024:5016456510113118655434598811035278955030765345404790744303017523831112055108147451509157692220295382716162651878526895249385292291816524375083746691371804094271873160484737966720260389217684476157468082573n},Om={32:2166136261n,64:14695981039346656037n,128:144066263297769815596495629667062367629n,256:100029257958052580907070968620625704837092796014241193945225284501741471925557n,512:9659303129496669498009435400716310466090418745672637896108374329434462657994582932197716438449813051892206539805784495328239340083876191928701583869517785n,1024:14197795064947621068722070641403218320880622795441933960878474914617582723252296732303717722150864096521202355549365628174669108571814760471015076148029755969804077320157692458563003215304957150157403644460363550505412711285966361610267868082893823963790439336411086884584107735010676915n},Dm=new globalThis.TextEncoder;__webpack_require__(8437);const Lm={hash:e=>Number(function(e,{size:t=32,utf8Buffer:r}={}){if(!Pm[t])throw new Error("The `size` option must be one of 32, 64, 128, 256, 512, or 1024");if("string"==typeof e){if(r)return function(e,t,r){if(0===r.length)throw new Error("The `utf8Buffer` option must have a length greater than zero");const n=Pm[t];let s=Om[t],o=e;for(;o.length>0;){const e=Dm.encodeInto(o,r);o=o.slice(e.read);for(let o=0;ofunction(e){let t=e.toString(16);return t.length%2==1&&(t=`0${t}`),Nt(t,"base16")}(Lm.hash(e,t))};class Bm{bucketSize;filterSize;fingerprintSize;buckets;count;hash;seed;constructor(e){this.filterSize=e.filterSize,this.bucketSize=e.bucketSize??4,this.fingerprintSize=e.fingerprintSize??2,this.count=0,this.buckets=[],this.hash=e.hash??Lm,this.seed=e.seed??Nm(0,Math.pow(2,10))}add(e){"string"==typeof e&&(e=Nt(e));const t=new Cm(e,this.hash,this.seed,this.fingerprintSize),r=this.hash.hash(e,this.seed)%this.filterSize,n=(r^t.hash())%this.filterSize;if(null==this.buckets[r]&&(this.buckets[r]=new xm(this.bucketSize)),null==this.buckets[n]&&(this.buckets[n]=new xm(this.bucketSize)),this.buckets[r].add(t)||this.buckets[n].add(t))return this.count++,!0;const s=[r,n];let o=s[Nm(0,s.length-1)];null==this.buckets[o]&&(this.buckets[o]=new xm(this.bucketSize));for(let e=0;e<500;e++){const e=this.buckets[o].swap(t);if(null!=e&&(o=(o^e.hash())%this.filterSize,null==this.buckets[o]&&(this.buckets[o]=new xm(this.bucketSize)),this.buckets[o].add(e)))return this.count++,!0}return!1}has(e){"string"==typeof e&&(e=Nt(e));const t=new Cm(e,this.hash,this.seed,this.fingerprintSize),r=this.hash.hash(e,this.seed)%this.filterSize,n=this.buckets[r]?.has(t)??!1;if(n)return n;const s=(r^t.hash())%this.filterSize;return this.buckets[s]?.has(t)??!1}remove(e){"string"==typeof e&&(e=Nt(e));const t=new Cm(e,this.hash,this.seed,this.fingerprintSize),r=this.hash.hash(e,this.seed)%this.filterSize,n=this.buckets[r]?.remove(t)??!1;if(n)return this.count--,n;const s=(r^t.hash())%this.filterSize,o=this.buckets[s]?.remove(t)??!1;return o&&this.count--,o}get reliable(){return Math.floor(this.count/this.filterSize*100)<=90}}const Um={1:.5,2:.84,4:.95,8:.98};function Mm(e,t=.001){const r=function(e=.001){return e>.002?2:e>1e-5?4:8}(t),n=Um[r];return{filterSize:Math.round(e/n),bucketSize:r,fingerprintSize:Math.min(Math.ceil(Math.log2(1/t)+Math.log2(2*r)),64)}}class Fm{filterSize;bucketSize;fingerprintSize;scale;filterSeries;hash;seed;constructor(e){this.bucketSize=e.bucketSize??4,this.filterSize=e.filterSize??(1<<18)/this.bucketSize,this.fingerprintSize=e.fingerprintSize??2,this.scale=e.scale??2,this.hash=e.hash??Lm,this.seed=e.seed??Nm(0,Math.pow(2,10)),this.filterSeries=[new Bm({filterSize:this.filterSize,bucketSize:this.bucketSize,fingerprintSize:this.fingerprintSize,hash:this.hash,seed:this.seed})]}add(e){if("string"==typeof e&&(e=Nt(e)),this.has(e))return!0;let t=this.filterSeries.find((e=>e.reliable));if(null==t){const e=this.filterSize*Math.pow(this.scale,this.filterSeries.length);t=new Bm({filterSize:e,bucketSize:this.bucketSize,fingerprintSize:this.fingerprintSize,hash:this.hash,seed:this.seed}),this.filterSeries.push(t)}return t.add(e)}has(e){"string"==typeof e&&(e=Nt(e));for(let t=0;te+t.count),0)}}const $m=globalThis.CustomEvent??Event;class Hm{log;peerId;peerStore;routers;constructor(e,t={}){this.log=e.logger.forComponent("libp2p:peer-routing"),this.peerId=e.peerId,this.peerStore=e.peerStore,this.routers=t.routers??[]}[Symbol.toStringTag]="@libp2p/peer-routing";async findPeer(e,t){if(0===this.routers.length)throw new eo("No peer routers available",qy.ERR_NO_ROUTERS_AVAILABLE);if(e.toString()===this.peerId.toString())throw new eo("Should not try to find self",qy.ERR_FIND_SELF);const r=this,n=Qn(...this.routers.map((n=>async function*(){try{yield await n.findPeer(e,t)}catch(e){r.log.error(e)}}())));for await(const e of n)if(null!=e)return e.multiaddrs.length>0&&await this.peerStore.merge(e.id,{multiaddrs:e.multiaddrs}),e;throw new eo(Hy.NOT_FOUND,qy.ERR_NOT_FOUND)}async*getClosestPeers(e,t={}){if(0===this.routers.length)throw new eo("No peer routers available",qy.ERR_NO_ROUTERS_AVAILABLE);const r=this,n=function(e,t=.001,r){return new Fm({...Mm(1024,t),...r??{}})}();for await(const s of async function*(e,t={}){let r=t.concurrency??1/0;r<1&&(r=1/0);const n=null!=t.ordered&&t.ordered,s=new EventTarget,o=[];let i,a=Gn(),c=Gn(),l=!1,u=!1;function h(){return n?o[0]?.done:Boolean(o.find((e=>e.done)))}function*d(){for(;o.length>0&&o[0].done;){const e=o[0];if(o.shift(),!e.ok)throw u=!0,a.resolve(),e.err;yield e.value,a.resolve()}}function*p(){for(;h();)for(let e=0;e{c.resolve()})),Promise.resolve().then((async()=>{try{for await(const t of e){if(o.length===r&&(a=Gn(),await a.promise),u)break;const e={done:!1};o.push(e),t().then((t=>{e.done=!0,e.ok=!0,e.value=t,s.dispatchEvent(new $m("task-complete"))}),(t=>{e.done=!0,e.err=t,s.dispatchEvent(new $m("task-complete"))}))}l=!0,s.dispatchEvent(new $m("task-complete"))}catch(e){i=e,s.dispatchEvent(new $m("task-complete"))}}));;){if(h()||(c=Gn(),await c.promise),null!=i)throw i;if(n?yield*d():yield*p(),l&&0===o.length)break}}(async function*(){const n=Qn(...r.routers.map((r=>r.getClosestPeers(e,t))));for await(let e of n)yield async()=>{if(0===e.multiaddrs.length)try{e=await r.findPeer(e.id,{...t,useCache:!1})}catch(e){return void r.log.error("could not find peer multiaddrs",e)}return e}}()))null!=s&&(s.multiaddrs.length>0&&await this.peerStore.merge(s.id,{multiaddrs:s.multiaddrs}),n.has(s.id.toBytes())||(n.add(s.id.toBytes()),yield s))}}class qm extends Fs{peerRouting;log;walking;walkers;shutdownController;walkController;needNext;constructor(e){super(),this.log=e.logger.forComponent("libp2p:random-walk"),this.peerRouting=e.peerRouting,this.walkers=0,this.walking=!1,this.shutdownController=new AbortController,this.shutdownController.signal}[Symbol.toStringTag]="@libp2p/random-walk";start(){this.shutdownController=new AbortController,this.shutdownController.signal}stop(){this.shutdownController.abort()}async*walk(e){this.walking||this.startWalk(),this.walkers++;const t=hm([this.shutdownController.signal,e?.signal]);try{for(;;){this.needNext?.resolve(),this.needNext=Gn();const e=await zy(this,"walk:peer",t,{errorEvent:"walk:error"});yield e.detail}}finally{t.clear(),this.walkers--,0===this.walkers&&(this.walkController?.abort(),this.walkController=void 0)}}startWalk(){this.walking=!0,this.walkController=new AbortController,this.walkController.signal;const e=hm([this.walkController.signal,this.shutdownController.signal]),t=Date.now();let r=0;Promise.resolve().then((async()=>{for(this.log("start walk");this.walkers>0;)try{const t=su(32);let n=Date.now();for await(const s of this.peerRouting.getClosestPeers(t,{signal:e}))e.aborted&&this.log("aborting walk"),e.throwIfAborted(),this.log("found peer %p after %dms for %d walkers",s.id,Date.now()-n,this.walkers),r++,this.safeDispatchEvent("walk:peer",{detail:s}),1===this.walkers&&null!=this.needNext&&(this.log("wait for need next"),await ih(this.needNext.promise,e)),n=Date.now();this.log("walk iteration for %b and %d walkers finished, found %d peers",t,this.walkers,r)}catch(e){this.log.error("randomwalk errored",e),this.safeDispatchEvent("walk:error",{detail:e})}this.log("no walkers left, ended walk")})).catch((e=>{this.log.error("randomwalk errored",e)})).finally((()=>{this.log("finished walk, found %d peers after %dms",r,Date.now()-t),this.walking=!1}))}}class Vm{log;topologies;handlers;components;constructor(e){this.log=e.logger.forComponent("libp2p:registrar"),this.topologies=new Map,this.handlers=new Map,this.components=e,this._onDisconnect=this._onDisconnect.bind(this),this._onPeerUpdate=this._onPeerUpdate.bind(this),this._onPeerIdentify=this._onPeerIdentify.bind(this),this.components.events.addEventListener("peer:disconnect",this._onDisconnect),this.components.events.addEventListener("peer:update",this._onPeerUpdate),this.components.events.addEventListener("peer:identify",this._onPeerIdentify)}[Symbol.toStringTag]="@libp2p/registrar";getProtocols(){return Array.from(new Set([...this.handlers.keys()])).sort()}getHandler(e){const t=this.handlers.get(e);if(null==t)throw new eo(`No handler registered for protocol ${e}`,qy.ERR_NO_HANDLER_FOR_PROTOCOL);return t}getTopologies(e){const t=this.topologies.get(e);return null==t?[]:[...t.values()]}async handle(e,t,r){if(this.handlers.has(e))throw new eo(`Handler already registered for protocol ${e}`,qy.ERR_PROTOCOL_HANDLER_ALREADY_REGISTERED);const n=$y.bind({ignoreUndefined:!0})({maxInboundStreams:32,maxOutboundStreams:64},r);this.handlers.set(e,{handler:t,options:n}),await this.components.peerStore.merge(this.components.peerId,{protocols:[e]})}async unhandle(e){(Array.isArray(e)?e:[e]).forEach((e=>{this.handlers.delete(e)})),await this.components.peerStore.patch(this.components.peerId,{protocols:this.getProtocols()})}async register(e,t){if(null==t)throw new eo("invalid topology",qy.ERR_INVALID_PARAMETERS);const r=`${(1e9*Math.random()).toString(36)}${Date.now()}`;let n=this.topologies.get(e);return null==n&&(n=new Map,this.topologies.set(e,n)),n.set(r,t),r}unregister(e){for(const[t,r]of this.topologies.entries())r.has(e)&&(r.delete(e),0===r.size&&this.topologies.delete(t))}_onDisconnect(e){const t=e.detail;this.components.peerStore.get(t).then((e=>{for(const r of e.protocols){const e=this.topologies.get(r);if(null!=e)for(const r of e.values())!1!==r.filter?.has(t)&&(r.filter?.remove(t),r.onDisconnect?.(t))}})).catch((e=>{e.code!==qy.ERR_NOT_FOUND&&this.log.error("could not inform topologies of disconnecting peer %p",t,e)}))}_onPeerUpdate(e){const{peer:t,previous:r}=e.detail,n=(r?.protocols??[]).filter((e=>!t.protocols.includes(e)));for(const e of n){const r=this.topologies.get(e);if(null!=r)for(const e of r.values())!1!==e.filter?.has(t.id)&&(e.filter?.remove(t.id),e.onDisconnect?.(t.id))}}_onPeerIdentify(e){const t=e.detail.protocols,r=e.detail.connection,n=e.detail.peerId;for(const e of t){const t=this.topologies.get(e);if(null!=t)for(const e of t.values())r.transient&&!0!==e.notifyOnTransient||!0!==e.filter?.has(n)&&(e.filter?.add(n),e.onConnect?.(n,r))}}}class jm extends Map{metric;constructor(e){super();const{name:t,metrics:r}=e;this.metric=r.registerMetric(t),this.updateComponentMetric()}set(e,t){return super.set(e,t),this.updateComponentMetric(),this}delete(e){const t=super.delete(e);return this.updateComponentMetric(),t}clear(){super.clear(),this.updateComponentMetric()}updateComponentMetric(){this.metric.update(this.size)}}class Km{log;components;transports;listeners;faultTolerance;started;constructor(e,t={}){this.log=e.logger.forComponent("libp2p:transports"),this.components=e,this.started=!1,this.transports=new Map,this.listeners=function(e){const{name:t,metrics:r}=e;let n;return n=null!=r?new jm({name:t,metrics:r}):new Map,n}({name:"libp2p_transport_manager_listeners",metrics:this.components.metrics}),this.faultTolerance=t.faultTolerance??Bf.FATAL_ALL}[Symbol.toStringTag]="@libp2p/transport-manager";add(e){const t=e[Symbol.toStringTag];if(null==t)throw new eo("Transport must have a valid tag",qy.ERR_INVALID_KEY);if(this.transports.has(t))throw new eo(`There is already a transport with the tag ${t}`,qy.ERR_DUPLICATE_TRANSPORT);this.log("adding transport %s",t),this.transports.set(t,e),this.listeners.has(t)||this.listeners.set(t,[])}isStarted(){return this.started}start(){this.started=!0}async afterStart(){const e=this.components.addressManager.getListenAddrs();await this.listen(e)}async stop(){const e=[];for(const[t,r]of this.listeners)for(this.log("closing listeners for %s",t);r.length>0;){const t=r.pop();null!=t&&e.push(t.close())}await Promise.all(e),this.log("all listeners closed");for(const e of this.listeners.keys())this.listeners.set(e,[]);this.started=!1}async dial(e,t){const r=this.dialTransportForMultiaddr(e);if(null==r)throw new eo(`No transport available for address ${String(e)}`,qy.ERR_TRANSPORT_UNAVAILABLE);t?.onProgress?.(new Yf("transport-manager:selected-transport",r[Symbol.toStringTag]));try{return await r.dial(e,{...t,upgrader:this.components.upgrader})}catch(e){throw null==e.code&&(e.code=qy.ERR_TRANSPORT_DIAL_FAILED),e}}getAddrs(){let e=[];for(const t of this.listeners.values())for(const r of t)e=[...e,...r.getAddrs()];return e}getTransports(){return Array.of(...this.transports.values())}getListeners(){return Array.of(...this.listeners.values()).flat()}dialTransportForMultiaddr(e){for(const t of this.transports.values())if(t.dialFilter([e]).length>0)return t}listenTransportForMultiaddr(e){for(const t of this.transports.values())if(t.listenFilter([e]).length>0)return t}async listen(e){if(!this.isStarted())throw new eo("Not started",qy.ERR_NODE_NOT_STARTED);if(null==e||0===e.length)return void this.log("no addresses were provided for listening, this node is dial only");const t=[];for(const[r,n]of this.transports.entries()){const s=n.listenFilter(e),o=[];for(const e of s){this.log("creating listener for %s on %a",r,e);const t=n.createListener({upgrader:this.components.upgrader});let s=this.listeners.get(r)??[];null==s&&(s=[],this.listeners.set(r,s)),s.push(t),t.addEventListener("listening",(()=>{this.components.events.safeDispatchEvent("transport:listening",{detail:t})})),t.addEventListener("close",(()=>{const e=s.findIndex((e=>e===t));s.splice(e,1),this.components.events.safeDispatchEvent("transport:close",{detail:t})})),o.push(t.listen(e))}if(0!==o.length){if(null==(await Promise.allSettled(o)).find((e=>"fulfilled"===e.status))&&this.faultTolerance!==Bf.NO_FATAL)throw new eo(`Transport (${r}) could not listen on any available address`,qy.ERR_NO_VALID_ADDRESSES)}else t.push(r)}if(t.length===this.transports.size){const e=`no valid addresses were provided for transports [${t.join(", ")}]`;if(this.faultTolerance===Bf.FATAL_ALL)throw new eo(e,qy.ERR_NO_VALID_ADDRESSES);this.log(`libp2p in dial mode only: ${e}`)}}async remove(e){const t=this.listeners.get(e)??[];this.log.trace("removing transport %s",e);const r=[];for(this.log.trace("closing listeners for %s",e);t.length>0;){const e=t.pop();null!=e&&r.push(e.close())}await Promise.all(r),this.transports.delete(e),this.listeners.delete(e)}async removeAll(){const e=[];for(const t of this.transports.keys())e.push(this.remove(t));await Promise.all(e)}}const zm="/multistream/1.0.0",Gm=1024,Wm=Nt("\n");async function Ym(e,t,r){await e.write(t,r)}async function Jm(e,t){const r=await async function(e,t){const r=await e.read(t);if(0===r.byteLength||r.get(r.byteLength-1)!==Wm[0])throw t.log.error("Invalid mss message - missing newline",r),new eo("missing newline","ERR_INVALID_MULTISTREAM_SELECT_MESSAGE");return r.sublist(0,-1)}(e,t);return sn(r.subarray())}async function Xm(e,t,r){t=Array.isArray(t)?t:[t],r.log.trace("handle: available protocols %s",t);const n=gh(e,{...r,maxDataLength:Gm,maxLengthLength:2});for(;;){r.log.trace("handle: reading incoming string");const e=await Jm(n,r);if(r.log.trace('handle: read "%s"',e),e!==zm){if(t.includes(e))return r.log.trace('handle: respond with "%s" for "%s"',e,e),await Ym(n,Nt(`${e}\n`),r),r.log.trace('handle: responded with "%s" for "%s"',e,e),{stream:n.unwrap(),protocol:e};if("ls"!==e)r.log('handle: respond with "na" for "%s"',e),await Ym(n,Nt("na\n"),r),r.log('handle: responded with "na" for "%s"',e);else{const s=new Bn(...t.map((e=>Fn.single(Nt(`${e}\n`)))),Nt("\n"));r.log.trace('handle: respond with "%s" for %s',t,e),await Ym(n,s,r),r.log.trace('handle: responded with "%s" for %s',t,e)}}else r.log.trace('handle: respond with "%s" for "%s"',zm,e),await Ym(n,Nt(`${zm}\n`),r),r.log.trace('handle: responded with "%s" for "%s"',zm,e)}}async function Qm(e,t,r){if(1===(t=Array.isArray(t)?[...t]:[t]).length&&!1===r.negotiateFully)return function(e,t,r){const n=e.sink.bind(e),s=e.source;let o=!1,i=!1;const a=Gn();let c=!1,l=!1;const u=Gn();let h=!1,d=!1;const p=Gn(),f=gh({sink:n,source:s},{...r,maxDataLength:Gm});async function g(){if(i)return r.log.trace("optimistic: already negotiating %s stream",t),void await a.promise;i=!0;try{c||(r.log.trace("optimistic: doing send protocol for %s stream",t),await async function(){if(l)await u.promise;else{l=!0;try{r.log.trace('optimistic: write ["%s", "%s", data] in source',zm,t),await f.writeV([Nt(`${zm}\n`),Nt(`${t}\n`)]),r.log.trace('optimistic: wrote ["%s", "%s", data] in source',zm,t)}finally{c=!0,l=!1,u.resolve()}}}()),h||(r.log.trace("optimistic: doing read protocol for %s stream",t),await async function(){if(d)await p.promise;else{d=!0;try{r.log.trace("optimistic: reading multistream select header");let e=await Jm(f,r);if(r.log.trace('optimistic: read multistream select header "%s"',e),e===zm&&(e=await Jm(f,r)),r.log.trace('optimistic: read protocol "%s", expecting "%s"',e,t),e!==t)throw new eo("protocol selection failed","ERR_UNSUPPORTED_PROTOCOL")}finally{h=!0,d=!1,p.resolve()}}}())}finally{i=!1,o=!0,a.resolve()}}if(e.sink=async e=>{const{sink:n}=f.unwrap();await n(async function*(){let n=!1;for await(const s of e){if(l&&await u.promise,c)yield s;else{l=!0,r.log.trace('optimistic: write ["%s", "%s", data(%d)] in sink',zm,t,s.byteLength);const e=`${t}\n`;yield new Bn(Uint8Array.from([19]),Nt(`${zm}\n`),P(e.length),Nt(e),s).subarray(),r.log.trace('optimistic: wrote ["%s", "%s", data(%d)] in sink',zm,t,s.byteLength),c=!0,l=!1,u.resolve(),g().catch((e=>{r.log.error("could not finish optimistic protocol negotiation of %s",t,e)}))}n=!0}n||await g()}())},e.source=async function*(){await g(),r.log.trace('optimistic: reading data from "%s" stream',t),yield*f.unwrap().source}(),null!=e.closeRead){const t=e.closeRead.bind(e);e.closeRead=async e=>{o||await g().catch((e=>{r.log.error("could not negotiate protocol before close read",e)})),await t(e)}}if(null!=e.closeWrite){const t=e.closeWrite.bind(e);e.closeWrite=async e=>{o||await g().catch((e=>{r.log.error("could not negotiate protocol before close write",e)})),await t(e)}}if(null!=e.close){const t=e.close.bind(e);e.close=async e=>{const r=[];l&&r.push(u.promise),d&&r.push(p.promise),r.length>0?await ih(Promise.all(r),e?.signal):(o=!0,i=!1,a.resolve()),await t(e)}}return{stream:e,protocol:t}}(e,t[0],r);const n=gh(e,{...r,maxDataLength:Gm}),s=t.shift();if(null==s)throw new Error("At least one protocol must be specified");r.log.trace('select: write ["%s", "%s"]',zm,s);const o=Nt(`${zm}\n`),i=Nt(`${s}\n`);await async function(e,t,r){await e.writeV(t,r)}(n,[o,i],r),r.log.trace("select: reading multistream-select header");let a=await Jm(n,r);if(r.log.trace('select: read "%s"',a),a===zm&&(r.log.trace("select: reading protocol response"),a=await Jm(n,r),r.log.trace('select: read "%s"',a)),a===s)return{stream:n.unwrap(),protocol:s};for(const e of t){r.log.trace('select: write "%s"',e),await Ym(n,Nt(`${e}\n`),r),r.log.trace("select: reading protocol response");const t=await Jm(n,r);if(r.log.trace('select: read "%s" for "%s"',t,e),t===e)return{stream:n.unwrap(),protocol:e}}throw new eo("protocol selection failed","ERR_UNSUPPORTED_PROTOCOL")}const Zm=Symbol.for("@libp2p/connection");class eb{id;remoteAddr;remotePeer;direction;timeline;multiplexer;encryption;status;transient;log;tags;_newStream;_close;_abort;_getStreams;constructor(e){const{remoteAddr:t,remotePeer:r,newStream:n,close:s,abort:o,getStreams:i}=e;this.id=`${parseInt(String(1e9*Math.random())).toString(36)}${Date.now()}`,this.remoteAddr=t,this.remotePeer=r,this.direction=e.direction,this.status="open",this.timeline=e.timeline,this.multiplexer=e.multiplexer,this.encryption=e.encryption,this.transient=e.transient??!1,this.log=e.logger.forComponent(`libp2p:connection:${this.direction}:${this.id}`),null==this.remoteAddr.getPeerId()&&(this.remoteAddr=this.remoteAddr.encapsulate(`/p2p/${this.remotePeer}`)),this._newStream=n,this._close=s,this._abort=o,this._getStreams=i,this.tags=[]}[Symbol.toStringTag]="Connection";[Zm]=!0;get streams(){return this._getStreams()}async newStream(e,t){if("closing"===this.status)throw new eo("the connection is being closed","ERR_CONNECTION_BEING_CLOSED");if("closed"===this.status)throw new eo("the connection is closed","ERR_CONNECTION_CLOSED");if(Array.isArray(e)||(e=[e]),this.transient&&!0!==t?.runOnTransientConnection)throw new eo("Cannot open protocol stream on transient connection","ERR_TRANSIENT_CONNECTION");const r=await this._newStream(e,t);return r.direction="outbound",r}async close(e={}){if("closed"!==this.status&&"closing"!==this.status){if(this.log("closing connection to %a",this.remoteAddr),this.status="closing",null==e.signal){const t=AbortSignal.timeout(500);e={...e,signal:t}}try{this.log.trace("closing all streams"),await Promise.all(this.streams.map((async t=>t.close(e)))),this.log.trace("closing underlying transport"),await this._close(e),this.log.trace("updating timeline with close time"),this.status="closed",this.timeline.close=Date.now()}catch(e){this.log.error("error encountered during graceful close of connection to %a",this.remoteAddr,e),this.abort(e)}}}abort(e){this.log.error("aborting connection to %a due to error",this.remoteAddr,e),this.status="closing",this.streams.forEach((t=>{t.abort(e)})),this.log.error("all streams aborted",this.streams.length),this._abort(e),this.timeline.close=Date.now(),this.status="closed"}}function tb(e,t,r){let n=0;return r.streams.forEach((r=>{r.direction===t&&r.protocol===e&&n++})),n}class rb{components;connectionEncryption;muxers;inboundUpgradeTimeout;events;constructor(e,t){this.components=e,this.connectionEncryption=new Map,t.connectionEncryption.forEach((e=>{this.connectionEncryption.set(e.protocol,e)})),this.muxers=new Map,t.muxers.forEach((e=>{this.muxers.set(e.protocol,e)})),this.inboundUpgradeTimeout=t.inboundUpgradeTimeout??2e3,this.events=e.events}[Symbol.toStringTag]="@libp2p/upgrader";async shouldBlockConnection(e,t,r){const n=this.components.connectionGater[r];if(void 0!==n&&await n(e,t))throw new eo(`The multiaddr connection is blocked by gater.${r}`,qy.ERR_CONNECTION_INTERCEPTED)}async upgradeInbound(e,t){if(!await this.components.connectionManager.acceptIncomingConnection(e))throw new eo("connection denied",qy.ERR_CONNECTION_DENIED);let r,n,s,o,i;const a=AbortSignal.timeout(this.inboundUpgradeTimeout),c=()=>{e.abort(new eo("inbound upgrade timeout",ro))};a.addEventListener("abort",c,{once:!0});try{if(!0===await(this.components.connectionGater.denyInboundConnection?.(e)))throw new eo("The multiaddr connection is blocked by gater.acceptConnection",qy.ERR_CONNECTION_INTERCEPTED);this.components.metrics?.trackMultiaddrConnection(e),e.log("starting the inbound connection upgrade");let a=e;if(!0!==t?.skipProtection){const t=this.components.connectionProtector;null!=t&&(e.log("protecting the inbound connection"),a=await t.protect(e))}try{if(r=a,!0!==t?.skipEncryption){t?.onProgress?.(new Yf("upgrader:encrypt-inbound-connection")),({conn:r,remotePeer:n,protocol:i}=await this._encryptInbound(a));const e={...a,...r};await this.shouldBlockConnection(n,e,"denyInboundEncryptedConnection")}else{const t=e.remoteAddr.getPeerId();if(null==t)throw new eo("inbound connection that skipped encryption must have a peer id",qy.ERR_INVALID_MULTIADDR);const r=rh(t);i="native",n=r}if(s=r,null!=t?.muxerFactory)o=t.muxerFactory;else if(this.muxers.size>0){t?.onProgress?.(new Yf("upgrader:multiplex-inbound-connection"));const e=await this._multiplexInbound({...a,...r},this.muxers);o=e.muxerFactory,s=e.stream}}catch(t){throw e.log.error("failed to upgrade inbound connection",t),t}return await this.shouldBlockConnection(n,e,"denyInboundUpgradedConnection"),e.log("successfully upgraded inbound connection"),this._createConnection({cryptoProtocol:i,direction:"inbound",maConn:e,upgradedConn:s,muxerFactory:o,remotePeer:n,transient:t?.transient})}finally{a.removeEventListener("abort",c),this.components.connectionManager.afterUpgradeInbound()}}async upgradeOutbound(e,t){const r=e.remoteAddr.getPeerId();let n,s,o,i,a,c;null!=r&&(n=rh(r),await this.shouldBlockConnection(n,e,"denyOutboundConnection")),this.components.metrics?.trackMultiaddrConnection(e),e.log("starting the outbound connection upgrade");let l=e;if(!0!==t?.skipProtection){const t=this.components.connectionProtector;null!=t&&(l=await t.protect(e))}try{if(s=l,!0!==t?.skipEncryption){({conn:s,remotePeer:o,protocol:a}=await this._encryptOutbound(l,n));const e={...l,...s};await this.shouldBlockConnection(o,e,"denyOutboundEncryptedConnection")}else{if(null==n)throw new eo("Encryption was skipped but no peer id was passed",qy.ERR_INVALID_PEER);a="native",o=n}if(i=s,null!=t?.muxerFactory)c=t.muxerFactory;else if(this.muxers.size>0){const e=await this._multiplexOutbound({...l,...s},this.muxers);c=e.muxerFactory,i=e.stream}}catch(t){throw e.log.error("failed to upgrade outbound connection",t),await e.close(t),t}return await this.shouldBlockConnection(o,e,"denyOutboundUpgradedConnection"),e.log("successfully upgraded outbound connection"),this._createConnection({cryptoProtocol:a,direction:"outbound",maConn:e,upgradedConn:i,muxerFactory:c,remotePeer:o,transient:t?.transient})}_createConnection(e){const{cryptoProtocol:t,direction:r,maConn:n,upgradedConn:s,remotePeer:o,muxerFactory:i,transient:a}=e;let c,l,u;null!=i&&(c=i.createStreamMuxer({direction:r,onIncomingStream:e=>{null!=u&&Promise.resolve().then((async()=>{const t=this.components.registrar.getProtocols(),{stream:r,protocol:n}=await Xm(e,t,{log:e.log,yieldBytes:!1});if(null==u)return;u.log("incoming stream opened on %s",n);const s=function(e,t){try{const{options:r}=t.getHandler(e);return r.maxInboundStreams}catch(e){if(e.code!==qy.ERR_NO_HANDLER_FOR_PROTOCOL)throw e}return 32}(n,this.components.registrar);if(tb(n,"inbound",u)===s){const t=new eo(`Too many inbound protocol streams for protocol "${n}" - limit ${s}`,qy.ERR_TOO_MANY_INBOUND_PROTOCOL_STREAMS);throw e.abort(t),t}e.source=r.source,e.sink=r.sink,e.protocol=n,null!=r.closeWrite&&(e.closeWrite=r.closeWrite),null!=r.closeRead&&(e.closeRead=r.closeRead),null!=r.close&&(e.close=r.close),await this.components.peerStore.merge(o,{protocols:[n]}),this.components.metrics?.trackProtocolStream(e,u),this._onStream({connection:u,stream:e,protocol:n})})).catch((async t=>{u.log.error("error handling incoming stream id %s",e.id,t.message,t.code,t.stack),null==e.timeline.close&&await e.close()}))}}),l=async(e,t={})=>{if(null==c)throw new eo("Stream is not multiplexed",qy.ERR_MUXER_UNAVAILABLE);u.log("starting new stream for protocols %s",e);const r=await c.newStream();u.log.trace("started new stream %s for protocols %s",r.id,e);try{if(null==t.signal){r.log("no abort signal was passed while trying to negotiate protocols %s falling back to default timeout",e);const n=AbortSignal.timeout(3e4);t={...t,signal:n}}r.log.trace("selecting protocol from protocols %s",e);const{stream:n,protocol:s}=await Qm(r,e,{...t,log:r.log,yieldBytes:!0});r.log("selected protocol %s",s);const i=function(e,t,r={}){try{const{options:r}=t.getHandler(e);if(null!=r.maxOutboundStreams)return r.maxOutboundStreams}catch(e){if(e.code!==qy.ERR_NO_HANDLER_FOR_PROTOCOL)throw e}return r.maxOutboundStreams??64}(s,this.components.registrar,t),a=tb(s,"outbound",u);if(a>=i){const e=new eo(`Too many outbound protocol streams for protocol "${s}" - ${a}/${i}`,qy.ERR_TOO_MANY_OUTBOUND_PROTOCOL_STREAMS);throw r.abort(e),e}return await this.components.peerStore.merge(o,{protocols:[s]}),r.source=n.source,r.sink=n.sink,r.protocol=s,null!=n.closeWrite&&(r.closeWrite=n.closeWrite),null!=n.closeRead&&(r.closeRead=n.closeRead),null!=n.close&&(r.close=n.close),this.components.metrics?.trackProtocolStream(r,u),r}catch(t){if(u.log.error("could not create new stream for protocols %s",e,t),null==r.timeline.close&&r.abort(t),null!=t.code)throw t;throw new eo(String(t),qy.ERR_UNSUPPORTED_PROTOCOL)}},Promise.all([c.sink(s.source),s.sink(c.source)]).catch((e=>{u.log.error("error piping data through muxer",e)})));const h=n.timeline;var d;return n.timeline=new Proxy(h,{set:(...e)=>(null!=u&&"close"===e[1]&&null!=e[2]&&null==h.close&&(async()=>{try{"open"===u.status&&await u.close()}catch(e){u.log.error("error closing connection after timeline close",e)}finally{this.events.safeDispatchEvent("connection:close",{detail:u})}})().catch((e=>{u.log.error("error thrown while dispatching connection:close event",e)})),Reflect.set(...e))}),n.timeline.upgraded=Date.now(),d={remoteAddr:n.remoteAddr,remotePeer:o,status:"open",direction:r,timeline:n.timeline,multiplexer:c?.protocol,encryption:t,transient:a,logger:this.components.logger,newStream:l??(()=>{throw new eo("connection is not multiplexed",qy.ERR_CONNECTION_NOT_MULTIPLEXED)}),getStreams:()=>null!=c?c.streams:[],close:async e=>{null!=c&&(u.log.trace("close muxer"),await c.close(e)),u.log.trace("close maconn"),await n.close(e),u.log.trace("closed maconn")},abort:e=>{n.abort(e),null!=c&&c.abort(e)}},u=new eb(d),this.events.safeDispatchEvent("connection:open",{detail:u}),u}_onStream(e){const{connection:t,stream:r,protocol:n}=e,{handler:s,options:o}=this.components.registrar.getHandler(n);if(t.transient&&!0!==o.runOnTransientConnection)throw new eo("Cannot open protocol stream on transient connection","ERR_TRANSIENT_CONNECTION");s({connection:t,stream:r})}async _encryptInbound(e){const t=Array.from(this.connectionEncryption.keys());e.log("handling inbound crypto protocol selection",t);try{const{stream:r,protocol:n}=await Xm(e,t,{log:e.log}),s=this.connectionEncryption.get(n);if(null==s)throw new Error(`no crypto module found for ${n}`);return e.log("encrypting inbound connection using",n),{...await s.secureInbound(this.components.peerId,r),protocol:n}}catch(t){throw e.log.error("encrypting inbound connection failed",t),new eo(t.message,qy.ERR_ENCRYPTION_FAILED)}}async _encryptOutbound(e,t){const r=Array.from(this.connectionEncryption.keys());e.log("selecting outbound crypto protocol",r);try{e.log.trace("selecting encrypter from %s",r);const{stream:n,protocol:s}=await Qm(e,r,{log:e.log,yieldBytes:!0}),o=this.connectionEncryption.get(s);if(null==o)throw new Error(`no crypto module found for ${s}`);return e.log("encrypting outbound connection to %p using %s",t,o),{...await o.secureOutbound(this.components.peerId,n,t),protocol:s}}catch(r){throw e.log.error("encrypting outbound connection to %p failed",t,r),new eo(r.message,qy.ERR_ENCRYPTION_FAILED)}}async _multiplexOutbound(e,t){const r=Array.from(t.keys());e.log("outbound selecting muxer %s",r);try{e.log.trace("selecting stream muxer from %s",r);const{stream:n,protocol:s}=await Qm(e,r,{log:e.log,yieldBytes:!0});return e.log("selected %s as muxer protocol",s),{stream:n,muxerFactory:t.get(s)}}catch(t){throw e.log.error("error multiplexing outbound connection",t),new eo(String(t),qy.ERR_MUXER_UNAVAILABLE)}}async _multiplexInbound(e,t){const r=Array.from(t.keys());e.log("inbound handling muxers %s",r);try{const{stream:n,protocol:s}=await Xm(e,r,{log:e.log});return{stream:n,muxerFactory:t.get(s)}}catch(t){throw e.log.error("error multiplexing inbound connection",t),new eo(String(t),qy.ERR_MUXER_UNAVAILABLE)}}}class nb extends Fs{peerId;peerStore;contentRouting;peerRouting;metrics;services;logger;status;components;log;constructor(e){super(),this.status="stopped";const t=new Fs,r=t.dispatchEvent.bind(t);t.dispatchEvent=e=>{const t=r(e),n=this.dispatchEvent(new $s(e.type,{detail:e.detail}));return t||n},this.peerId=e.peerId,this.logger=e.logger??gg(),this.log=this.logger.forComponent("libp2p"),this.services={};const n=this.components=function(e={}){const t=new my(e);return new Proxy(t,{get(e,r,n){if("string"==typeof r&&!wy.includes(r)){const e=t.components[r];if(null==e&&!by.includes(r))throw new eo(`${r} not set`,"ERR_SERVICE_MISSING");return e}return Reflect.get(e,r,n)},set:(e,r,n)=>("string"==typeof r?t.components[r]=n:Reflect.set(e,r,n),!0)})}({peerId:e.peerId,privateKey:e.privateKey,nodeInfo:e.nodeInfo??{name:"libp2p",version:"1.9.4"},logger:this.logger,events:t,datastore:e.datastore??new py,connectionGater:Ry(e.connectionGater),dns:e.dns});this.peerStore=this.configureComponent("peerStore",new iy(n,{addressFilter:this.components.connectionGater.filterMultiaddrForPeer,...e.peerStore})),null!=e.metrics&&(this.metrics=this.configureComponent("metrics",e.metrics(this.components))),n.events.addEventListener("peer:update",(e=>{if(null==e.detail.previous){const t={id:e.detail.peer.id,multiaddrs:e.detail.peer.addresses.map((e=>e.multiaddr))};n.events.safeDispatchEvent("peer:discovery",{detail:t})}})),null!=e.connectionProtector&&this.configureComponent("connectionProtector",e.connectionProtector(n)),this.components.upgrader=new rb(this.components,{connectionEncryption:(e.connectionEncryption??[]).map(((e,t)=>this.configureComponent(`connection-encryption-${t}`,e(this.components)))),muxers:(e.streamMuxers??[]).map(((e,t)=>this.configureComponent(`stream-muxers-${t}`,e(this.components)))),inboundUpgradeTimeout:e.connectionManager?.inboundUpgradeTimeout}),this.configureComponent("transportManager",new Km(this.components,e.transportManager)),this.configureComponent("connectionManager",new _m(this.components,e.connectionManager)),!1!==e.connectionMonitor?.enabled&&this.configureComponent("connectionMonitor",new Rm(this.components,e.connectionMonitor)),this.configureComponent("registrar",new Vm(this.components)),this.configureComponent("addressManager",new yy(this.components,e.addresses));const s=(e.peerRouters??[]).map(((e,t)=>this.configureComponent(`peer-router-${t}`,e(this.components))));this.peerRouting=this.components.peerRouting=this.configureComponent("peerRouting",new Hm(this.components,{routers:s}));const o=(e.contentRouters??[]).map(((e,t)=>this.configureComponent(`content-router-${t}`,e(this.components))));if(this.contentRouting=this.components.contentRouting=this.configureComponent("contentRouting",new Tm(this.components,{routers:o})),this.configureComponent("randomWalk",new qm(this.components)),(e.peerDiscovery??[]).forEach(((e,t)=>{this.configureComponent(`peer-discovery-${t}`,e(this.components)).addEventListener("peer",(e=>{this.#O(e)}))})),e.transports?.forEach(((e,t)=>{this.components.transportManager.add(this.configureComponent(`transport-${t}`,e(this.components)))})),null!=e.services)for(const t of Object.keys(e.services)){const r=(0,e.services[t])(this.components);null!=r?(this.services[t]=r,this.configureComponent(t,r),null!=r[rg]&&(this.log("registering service %s for content routing",t),o.push(r[rg])),null!=r[ng]&&(this.log("registering service %s for peer routing",t),s.push(r[ng])),null!=r[Sd]&&(this.log("registering service %s for peer discovery",t),r[Sd].addEventListener?.("peer",(e=>{this.#O(e)})))):this.log.error("service factory %s returned null or undefined instance",t)}!function(e){const t={};for(const r of Object.values(e.components))for(const e of vy(r))t[e]=!0;for(const r of Object.values(e.components))for(const e of Ey(r))if(!0!==t[e])throw new eo(`Service "${Sy(r)}" required capability "${e}" but it was not provided by any component, you may need to add additional configuration when creating your node.`,"ERR_UNMET_SERVICE_DEPENDENCIES")}(n)}configureComponent(e,t){return null==t&&this.log.error("component %s was null or undefined",e),this.components[e]=t,t}async start(){if("stopped"===this.status){this.status="starting",this.log("libp2p is starting");try{await(this.components.beforeStart?.()),await this.components.start(),await(this.components.afterStart?.()),this.status="started",this.safeDispatchEvent("start",{detail:this}),this.log("libp2p has started")}catch(e){throw this.log.error("An error occurred starting libp2p",e),this.status="started",await this.stop(),e}}}async stop(){"started"===this.status&&(this.log("libp2p is stopping"),this.status="stopping",await(this.components.beforeStop?.()),await this.components.stop(),await(this.components.afterStop?.()),this.status="stopped",this.safeDispatchEvent("stop",{detail:this}),this.log("libp2p has stopped"))}getConnections(e){return this.components.connectionManager.getConnections(e)}getDialQueue(){return this.components.connectionManager.getDialQueue()}getPeers(){const e=new mg;for(const t of this.components.connectionManager.getConnections())e.add(t.remotePeer);return Array.from(e)}async dial(e,t={}){return this.components.connectionManager.openConnection(e,{priority:75,...t})}async dialProtocol(e,t,r={}){if(null==t)throw new eo("no protocols were provided to open a stream",qy.ERR_INVALID_PROTOCOLS_FOR_STREAM);if(0===(t=Array.isArray(t)?t:[t]).length)throw new eo("no protocols were provided to open a stream",qy.ERR_INVALID_PROTOCOLS_FOR_STREAM);return(await this.dial(e,r)).newStream(t,r)}getMultiaddrs(){return this.components.addressManager.getAddresses()}getProtocols(){return this.components.registrar.getProtocols()}async hangUp(e,t={}){Uo(e)&&(e=rh(e.getPeerId()??"")),await this.components.connectionManager.closeConnections(e,t)}async getPublicKey(e,t={}){if(this.log("getPublicKey %p",e),null!=e.publicKey)return e.publicKey;try{const t=await this.peerStore.get(e);if(null!=t.id.publicKey)return t.id.publicKey}catch(e){if(e.code!==qy.ERR_NOT_FOUND)throw e}const r=xn([Nt("/pk/"),e.multihash.digest]),n=await this.contentRouting.get(r,t);return $u(n),await this.peerStore.patch(e,{publicKey:n}),n}async handle(e,t,r){Array.isArray(e)||(e=[e]),await Promise.all(e.map((async e=>{await this.components.registrar.handle(e,t,r)})))}async unhandle(e){Array.isArray(e)||(e=[e]),await Promise.all(e.map((async e=>{await this.components.registrar.unhandle(e)})))}async register(e,t){return this.components.registrar.register(e,t)}unregister(e){this.components.registrar.unregister(e)}async isDialable(e,t={}){return this.components.connectionManager.isDialable(e,t)}#O(e){const{detail:t}=e;t.id.toString()!==this.peerId.toString()?this.components.peerStore.merge(t.id,{multiaddrs:t.multiaddrs}).catch((e=>{this.log.error(e)})):this.log.error(new Error(qy.ERR_DISCOVERED_SELF))}}const sb={SANDBOX:"enrtree://AIRVQ5DDA4FFWLRBCHJWUWOO6X6S4ZTZ5B667LQ6AJU6PEYDLRD5O@sandbox.waku.nodes.status.im",TEST:"enrtree://AOGYWMBYOUIMOENHXCHILPKY3ZRFEULMFI4DOM442QSZ73TT2A7VI@test.waku.nodes.status.im"},ob="bootstrap",ib={store:1,filter:2,lightPush:2};var ab=__webpack_require__(495),cb=__webpack_require__.t(ab,2);const lb=BigInt(0),ub=BigInt(1),hb=BigInt(2),db=BigInt(3),pb=BigInt(8),fb=Object.freeze({a:lb,b:BigInt(7),P:BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),n:BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),h:ub,Gx:BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),Gy:BigInt("32670510020758816978083085130507043184471273380659243275938904335757337482424"),beta:BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee")}),gb=(e,t)=>(e+t/hb)/t,yb={beta:BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),splitScalar(e){const{n:t}=fb,r=BigInt("0x3086d221a7d46bcde86c90e49284eb15"),n=-ub*BigInt("0xe4437ed6010e88286f547fa90abfe4c3"),s=BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"),o=r,i=BigInt("0x100000000000000000000000000000000"),a=gb(o*e,t),c=gb(-n*e,t);let l=jb(e-a*r-c*s,t),u=jb(-a*n-c*o,t);const h=l>i,d=u>i;if(h&&(l=t-l),d&&(u=t-u),l>i||u>i)throw new Error("splitScalarEndo: Endomorphism failed, k="+e);return{k1neg:h,k1:l,k2neg:d,k2:u}}},mb=32,bb=32,wb=mb+1,vb=2*mb+1;function Eb(e){const{a:t,b:r}=fb,n=jb(e*e),s=jb(n*e);return jb(s+t*e+r)}const Sb=fb.a===lb;class Ab extends Error{constructor(e){super(e)}}function _b(e){if(!(e instanceof kb))throw new TypeError("JacobianPoint expected")}class kb{constructor(e,t,r){this.x=e,this.y=t,this.z=r}static fromAffine(e){if(!(e instanceof Tb))throw new TypeError("JacobianPoint#fromAffine: expected Point");return e.equals(Tb.ZERO)?kb.ZERO:new kb(e.x,e.y,ub)}static toAffineBatch(e){const t=function(e,t=fb.P){const r=new Array(e.length),n=zb(e.reduce(((e,n,s)=>n===lb?e:(r[s]=e,jb(e*n,t))),ub),t);return e.reduceRight(((e,n,s)=>n===lb?e:(r[s]=jb(e*r[s],t),jb(e*n,t))),n),r}(e.map((e=>e.z)));return e.map(((e,r)=>e.toAffine(t[r])))}static normalizeZ(e){return kb.toAffineBatch(e).map(kb.fromAffine)}equals(e){_b(e);const{x:t,y:r,z:n}=this,{x:s,y:o,z:i}=e,a=jb(n*n),c=jb(i*i),l=jb(t*c),u=jb(s*a),h=jb(jb(r*i)*c),d=jb(jb(o*n)*a);return l===u&&h===d}negate(){return new kb(this.x,jb(-this.y),this.z)}double(){const{x:e,y:t,z:r}=this,n=jb(e*e),s=jb(t*t),o=jb(s*s),i=e+s,a=jb(hb*(jb(i*i)-n-o)),c=jb(db*n),l=jb(c*c),u=jb(l-hb*a),h=jb(c*(a-u)-pb*o),d=jb(hb*t*r);return new kb(u,h,d)}add(e){_b(e);const{x:t,y:r,z:n}=this,{x:s,y:o,z:i}=e;if(s===lb||o===lb)return this;if(t===lb||r===lb)return e;const a=jb(n*n),c=jb(i*i),l=jb(t*c),u=jb(s*a),h=jb(jb(r*i)*c),d=jb(jb(o*n)*a),p=jb(u-l),f=jb(d-h);if(p===lb)return f===lb?this.double():kb.ZERO;const g=jb(p*p),y=jb(p*g),m=jb(l*g),b=jb(f*f-y-hb*m),w=jb(f*(m-b)-h*y),v=jb(n*i*p);return new kb(b,w,v)}subtract(e){return this.add(e.negate())}multiplyUnsafe(e){const t=kb.ZERO;if("bigint"==typeof e&&e===lb)return t;let r=Vb(e);if(r===ub)return this;if(!Sb){let e=t,n=this;for(;r>lb;)r&ub&&(e=e.add(n)),n=n.double(),r>>=ub;return e}let{k1neg:n,k1:s,k2neg:o,k2:i}=yb.splitScalar(r),a=t,c=t,l=this;for(;s>lb||i>lb;)s&ub&&(a=a.add(l)),i&ub&&(c=c.add(l)),l=l.double(),s>>=ub,i>>=ub;return n&&(a=a.negate()),o&&(c=c.negate()),c=new kb(jb(c.x*yb.beta),c.y,c.z),a.add(c)}precomputeWindow(e){const t=Sb?128/e+1:256/e+1,r=[];let n=this,s=n;for(let o=0;o>=u,i>a&&(i-=l,e+=ub);const h=r,d=r+Math.abs(i)-1,p=t%2!=0,f=i<0;0===i?o=o.add(Ib(p,n[h])):s=s.add(Ib(f,n[d]))}return{p:s,f:o}}multiply(e,t){let r,n,s=Vb(e);if(Sb){const{k1neg:e,k1:o,k2neg:i,k2:a}=yb.splitScalar(s);let{p:c,f:l}=this.wNAF(o,t),{p:u,f:h}=this.wNAF(a,t);c=Ib(e,c),u=Ib(i,u),u=new kb(jb(u.x*yb.beta),u.y,u.z),r=c.add(u),n=l.add(h)}else{const{p:e,f:o}=this.wNAF(s,t);r=e,n=o}return kb.normalizeZ([r,n])[0]}toAffine(e){const{x:t,y:r,z:n}=this,s=this.equals(kb.ZERO);null==e&&(e=s?pb:zb(n));const o=e,i=jb(o*o),a=jb(i*o),c=jb(t*i),l=jb(r*a),u=jb(n*o);if(s)return Tb.ZERO;if(u!==ub)throw new Error("invZ was invalid");return new Tb(c,l)}}function Ib(e,t){const r=t.negate();return e?r:t}kb.BASE=new kb(fb.Gx,fb.Gy,ub),kb.ZERO=new kb(lb,ub,lb);const Rb=new WeakMap;class Tb{constructor(e,t){this.x=e,this.y=t}_setWindowSize(e){this._WINDOW_SIZE=e,Rb.delete(this)}hasEvenY(){return this.y%hb===lb}static fromCompressedHex(e){const t=32===e.length,r=Hb(t?e:e.subarray(1));if(!Qb(r))throw new Error("Point is not on curve");let n=function(e){const{P:t}=fb,r=BigInt(6),n=BigInt(11),s=BigInt(22),o=BigInt(23),i=BigInt(44),a=BigInt(88),c=e*e*e%t,l=c*c*e%t,u=Kb(l,db)*l%t,h=Kb(u,db)*l%t,d=Kb(h,hb)*c%t,p=Kb(d,n)*d%t,f=Kb(p,s)*p%t,g=Kb(f,i)*f%t,y=Kb(g,a)*g%t,m=Kb(y,i)*f%t,b=Kb(m,db)*l%t,w=Kb(b,o)*p%t,v=Kb(w,r)*c%t,E=Kb(v,hb);if(E*E%t!==e)throw new Error("Cannot find square root");return E}(Eb(r));const s=(n&ub)===ub;t?s&&(n=jb(-n)):!(1&~e[0])!==s&&(n=jb(-n));const o=new Tb(r,n);return o.assertValidity(),o}static fromUncompressedHex(e){const t=Hb(e.subarray(1,mb+1)),r=Hb(e.subarray(mb+1,2*mb+1)),n=new Tb(t,r);return n.assertValidity(),n}static fromHex(e){const t=qb(e),r=t.length,n=t[0];if(r===mb)return this.fromCompressedHex(t);if(r===wb&&(2===n||3===n))return this.fromCompressedHex(t);if(r===vb&&4===n)return this.fromUncompressedHex(t);throw new Error(`Point.fromHex: received invalid point. Expected 32-${wb} compressed bytes or ${vb} uncompressed bytes, not ${r}`)}static fromPrivateKey(e){return Tb.BASE.multiply(ew(e))}static fromSignature(e,t,r){const{r:n,s}=tw(t);if(![0,1,2,3].includes(r))throw new Error("Cannot recover: invalid recovery bit");const o=Gb(qb(e)),{n:i}=fb,a=2===r||3===r?n+i:n,c=zb(a,i),l=jb(-o*c,i),u=jb(s*c,i),h=1&r?"03":"02",d=Tb.fromHex(h+Bb(a)),p=Tb.BASE.multiplyAndAddUnsafe(d,l,u);if(!p)throw new Error("Cannot recover signature: point at infinify");return p.assertValidity(),p}toRawBytes(e=!1){return $b(this.toHex(e))}toHex(e=!1){const t=Bb(this.x);return e?`${this.hasEvenY()?"02":"03"}${t}`:`04${t}${Bb(this.y)}`}toHexX(){return this.toHex(!0).slice(2)}toRawX(){return this.toRawBytes(!0).slice(1)}assertValidity(){const e="Point is not on elliptic curve",{x:t,y:r}=this;if(!Qb(t)||!Qb(r))throw new Error(e);const n=jb(r*r);if(jb(n-Eb(t))!==lb)throw new Error(e)}equals(e){return this.x===e.x&&this.y===e.y}negate(){return new Tb(this.x,jb(-this.y))}double(){return kb.fromAffine(this).double().toAffine()}add(e){return kb.fromAffine(this).add(kb.fromAffine(e)).toAffine()}subtract(e){return this.add(e.negate())}multiply(e){return kb.fromAffine(this).multiply(e,this).toAffine()}multiplyAndAddUnsafe(e,t,r){const n=kb.fromAffine(this),s=t===lb||t===ub||this!==Tb.BASE?n.multiplyUnsafe(t):n.multiply(t),o=kb.fromAffine(e).multiplyUnsafe(r),i=s.add(o);return i.equals(kb.ZERO)?void 0:i.toAffine()}}function Cb(e){return Number.parseInt(e[0],16)>=8?"00"+e:e}function Nb(e){if(e.length<2||2!==e[0])throw new Error(`Invalid signature integer tag: ${Db(e)}`);const t=e[1],r=e.subarray(2,t+2);if(!t||r.length!==t)throw new Error("Invalid signature integer: wrong length");if(0===r[0]&&r[1]<=127)throw new Error("Invalid signature integer: trailing length");return{data:Hb(r),left:e.subarray(t+2)}}Tb.BASE=new Tb(fb.Gx,fb.Gy),Tb.ZERO=new Tb(lb,lb);class xb{constructor(e,t){this.r=e,this.s=t,this.assertValidity()}static fromCompact(e){const t=e instanceof Uint8Array,r="Signature.fromCompact";if("string"!=typeof e&&!t)throw new TypeError(`${r}: Expected string or Uint8Array`);const n=t?Db(e):e;if(128!==n.length)throw new Error(`${r}: Expected 64-byte hex`);return new xb(Fb(n.slice(0,64)),Fb(n.slice(64,128)))}static fromDER(e){const t=e instanceof Uint8Array;if("string"!=typeof e&&!t)throw new TypeError("Signature.fromDER: Expected string or Uint8Array");const{r,s:n}=function(e){if(e.length<2||48!=e[0])throw new Error(`Invalid signature tag: ${Db(e)}`);if(e[1]!==e.length-2)throw new Error("Invalid signature: incorrect length");const{data:t,left:r}=Nb(e.subarray(2)),{data:n,left:s}=Nb(r);if(s.length)throw new Error(`Invalid signature: left bytes after parsing: ${Db(s)}`);return{r:t,s:n}}(t?e:$b(e));return new xb(r,n)}static fromHex(e){return this.fromDER(e)}assertValidity(){const{r:e,s:t}=this;if(!Xb(e))throw new Error("Invalid Signature: r must be 0 < r < n");if(!Xb(t))throw new Error("Invalid Signature: s must be 0 < s < n")}hasHighS(){const e=fb.n>>ub;return this.s>e}normalizeS(){return this.hasHighS()?new xb(this.r,jb(-this.s,fb.n)):this}toDERRawBytes(){return $b(this.toDERHex())}toDERHex(){const e=Cb(Mb(this.s)),t=Cb(Mb(this.r)),r=e.length/2,n=t.length/2,s=Mb(r),o=Mb(n);return`30${Mb(n+r+4)}02${o}${t}02${s}${e}`}toRawBytes(){return this.toDERRawBytes()}toHex(){return this.toDERHex()}toCompactRawBytes(){return $b(this.toCompactHex())}toCompactHex(){return Bb(this.r)+Bb(this.s)}}function Pb(...e){if(!e.every((e=>e instanceof Uint8Array)))throw new Error("Uint8Array list expected");if(1===e.length)return e[0];const t=e.reduce(((e,t)=>e+t.length),0),r=new Uint8Array(t);for(let t=0,n=0;tt.toString(16).padStart(2,"0")));function Db(e){if(!(e instanceof Uint8Array))throw new Error("Expected Uint8Array");let t="";for(let r=0;r0)return BigInt(e);if("bigint"==typeof e&&Xb(e))return e;throw new TypeError("Expected valid private scalar: 0 < scalar < curve.n")}function jb(e,t=fb.P){const r=e%t;return r>=lb?r:t+r}function Kb(e,t){const{P:r}=fb;let n=e;for(;t-- >lb;)n*=n,n%=r;return n}function zb(e,t=fb.P){if(e===lb||t<=lb)throw new Error(`invert: expected positive integers, got n=${e} mod=${t}`);let r=jb(e,t),n=t,s=lb,o=ub,i=ub,a=lb;for(;r!==lb;){const e=n/r,t=n%r,c=s-i*e,l=o-a*e;n=r,r=t,s=i,o=a,i=c,a=l}if(n!==ub)throw new Error("invert: does not exist");return jb(s,t)}function Gb(e,t=!1){const r=function(e){const t=8*e.length-8*bb,r=Hb(e);return t>0?r>>BigInt(t):r}(e);if(t)return r;const{n}=fb;return r>=n?r-n:r}let Wb,Yb;class Jb{constructor(e,t){if(this.hashLen=e,this.qByteLen=t,"number"!=typeof e||e<2)throw new Error("hashLen must be a number");if("number"!=typeof t||t<2)throw new Error("qByteLen must be a number");this.v=new Uint8Array(e).fill(1),this.k=new Uint8Array(e).fill(0),this.counter=0}hmac(...e){return cw.hmacSha256(this.k,...e)}hmacSync(...e){return Yb(this.k,...e)}checkSync(){if("function"!=typeof Yb)throw new Ab("hmacSha256Sync needs to be set")}incr(){if(this.counter>=1e3)throw new Error("Tried 1,000 k values for sign(), all were invalid");this.counter+=1}async reseed(e=new Uint8Array){this.k=await this.hmac(this.v,Uint8Array.from([0]),e),this.v=await this.hmac(this.v),0!==e.length&&(this.k=await this.hmac(this.v,Uint8Array.from([1]),e),this.v=await this.hmac(this.v))}reseedSync(e=new Uint8Array){this.checkSync(),this.k=this.hmacSync(this.v,Uint8Array.from([0]),e),this.v=this.hmacSync(this.v),0!==e.length&&(this.k=this.hmacSync(this.v,Uint8Array.from([1]),e),this.v=this.hmacSync(this.v))}async generate(){this.incr();let e=0;const t=[];for(;e0)t=BigInt(e);else if("string"==typeof e){if(e.length!==2*bb)throw new Error("Expected 32 bytes of private key");t=Fb(e)}else{if(!(e instanceof Uint8Array))throw new TypeError("Expected valid private key");if(e.length!==bb)throw new Error("Expected 32 bytes of private key");t=Hb(e)}if(!Xb(t))throw new Error("Expected private key: 0 < key < n");return t}function tw(e){if(e instanceof xb)return e.assertValidity(),e;try{return xb.fromDER(e)}catch(t){return xb.fromCompact(e)}}function rw(e){return Hb(e.length>mb?e.slice(0,mb):e)}function nw(e){const t=rw(e),r=jb(t,fb.n);return sw(r{e=qb(e);const t=bb+8;if(e.length1024)throw new Error("Expected valid bytes of private key as per FIPS 186");return Ub(jb(Hb(e),fb.n-ub)+ub)},randomBytes:(e=32)=>{if(iw.web)return iw.web.getRandomValues(new Uint8Array(e));if(iw.node){const{randomBytes:t}=iw.node;return Uint8Array.from(t(e))}throw new Error("The environment doesn't have randomBytes function")},randomPrivateKey:()=>cw.hashToPrivateKey(cw.randomBytes(bb+8)),precompute(e=8,t=Tb.BASE){const r=t===Tb.BASE?t:new Tb(t.x,t.y);return r._setWindowSize(e),r.multiply(db),r},sha256:async(...e)=>{if(iw.web){const t=await iw.web.subtle.digest("SHA-256",Pb(...e));return new Uint8Array(t)}if(iw.node){const{createHash:t}=iw.node,r=t("sha256");return e.forEach((e=>r.update(e))),Uint8Array.from(r.digest())}throw new Error("The environment doesn't have sha256 function")},hmacSha256:async(e,...t)=>{if(iw.web){const r=await iw.web.subtle.importKey("raw",e,{name:"HMAC",hash:{name:"SHA-256"}},!1,["sign"]),n=Pb(...t),s=await iw.web.subtle.sign("HMAC",r,n);return new Uint8Array(s)}if(iw.node){const{createHmac:r}=iw.node,n=r("sha256",e);return t.forEach((e=>n.update(e))),Uint8Array.from(n.digest())}throw new Error("The environment doesn't have hmac-sha256 function")},sha256Sync:void 0,hmacSha256Sync:void 0,taggedHash:async(e,...t)=>{let r=aw[e];if(void 0===r){const t=await cw.sha256(Uint8Array.from(e,(e=>e.charCodeAt(0))));r=Pb(t,t),aw[e]=r}return cw.sha256(r,...t)},taggedHashSync:(e,...t)=>{if("function"!=typeof Wb)throw new Ab("sha256Sync is undefined, you need to set it");let r=aw[e];if(void 0===r){const t=Wb(Uint8Array.from(e,(e=>e.charCodeAt(0))));r=Pb(t,t),aw[e]=r}return Wb(r,...t)},_JacobianPoint:kb};Object.defineProperties(cw,{sha256Sync:{configurable:!1,get:()=>Wb,set(e){Wb||(Wb=e)}},hmacSha256Sync:{configurable:!1,get:()=>Yb,set(e){Yb||(Yb=e)}}});var lw=__webpack_require__(1176);function uw(e){return new Uint8Array(lw.keccak256.arrayBuffer(e))}function hw(e,t,r){try{return function(e,t,r,n=ow){let s;try{s=tw(e),t=qb(t)}catch(e){return!1}const{r:o,s:i}=s;if(n.strict&&s.hasHighS())return!1;const a=Gb(t);let c;try{c=function(e){return e instanceof Tb?(e.assertValidity(),e):Tb.fromHex(e)}(r)}catch(e){return!1}const{n:l}=fb,u=zb(i,l),h=jb(a*u,l),d=jb(o*u,l),p=Tb.BASE.multiplyAndAddUnsafe(c,h,d);return!!p&&jb(p.x,l)===o}(xb.fromCompact(e.slice(0,64)),t,r)}catch{return!1}}const dw="Invalid record id";function pw(e,t){switch(t){case"udp":return pw(e,"udp4")||pw(e,"udp6");case"tcp":return pw(e,"tcp4")||pw(e,"tcp6")}const r=t.endsWith("6"),n=e.get(r?"ip6":"ip");if(!n)return;const s=t.slice(0,3);let o;switch(s){case"udp":o=r?e.get("udp6"):e.get("udp");break;case"tcp":o=r?e.get("tcp6"):e.get("tcp");break;default:return}return o?function(e,t,r,n){let s=Mo("/"+e+"/"+bo(e,r));return s=s.encapsulate(Mo("/"+t+"/"+bo(t,n))),s}(r?"ip6":"ip4",s,n,o):void 0}function fw(e){const t=e.reduce(((e,t)=>e+2+t.bytes.length),0),r=new Uint8Array(t),n=new DataView(r.buffer);let s=0;return e.forEach((e=>{if(e.getPeerId())throw new Error("`multiaddr` field MUST not contain peer id");n.setUint16(s,e.bytes.length),s+=2,r.set(e.bytes,s),s+=e.bytes.length})),r}function gw(e){let t=0;return e.lightPush&&(t+=1),t<<=1,e.filter&&(t+=1),t<<=1,e.store&&(t+=1),t<<=1,e.relay&&(t+=1),t}class yw extends Map{seq;signature;constructor(e={},t=BigInt(1),r){super(Object.entries(e)),this.seq=t,this.signature=r}set(e,t){return this.signature=void 0,this.seq++,super.set(e,t)}get id(){const e=this.get("id");if(!e)throw new Error("id not found.");return cn(e)}get publicKey(){if("v4"===this.id)return this.get("secp256k1");throw new Error(dw)}get rs(){const e=this.get("rs");if(e)return bn(e)}get rsv(){const e=this.get("rsv");if(e)return bn(e)}get ip(){return mw(this,"ip","ip4")}set ip(e){ww(this,"ip","ip4",e)}get tcp(){return bw(this,"tcp","tcp")}set tcp(e){vw(this,"tcp","tcp",e)}get udp(){return bw(this,"udp","udp")}set udp(e){vw(this,"udp","udp",e)}get ip6(){return mw(this,"ip6","ip6")}set ip6(e){ww(this,"ip6","ip6",e)}get tcp6(){return bw(this,"tcp6","tcp")}set tcp6(e){vw(this,"tcp6","tcp",e)}get udp6(){return bw(this,"udp6","udp")}set udp6(e){vw(this,"udp6","udp",e)}get multiaddrs(){const e=this.get("multiaddrs");if(e)return function(e){const t=[];let r=0;for(;r>=1)%2&&(t.store=!0),(e>>=1)%2&&(t.filter=!0),(e>>=1)%2&&(t.lightPush=!0),t}(e[0])}set waku2(e){Ew(this,"waku2",e,(e=>new Uint8Array([gw(e)])))}}function mw(e,t,r){const n=e.get(t);if(n)return bo(r,n)}function bw(e,t,r){const n=e.get(t);if(n)return Number(bo(r,n))}function ww(e,t,r,n){Ew(e,t,n,wo.bind({},r))}function vw(e,t,r,n){ww(e,t,r,n?.toString(10))}function Ew(e,t,r,n){void 0!==r?e.set(t,n(r)):e.delete(t)}async function Sw(e,t){return async function(e,t,r={}){const{seed:n,m:s,d:o}=function(e,t,r){if(null==e)throw new Error(`sign: expected valid message hash, not "${e}"`);const n=qb(e),s=ew(t),o=[sw(s),nw(n)];if(null!=r){!0===r&&(r=cw.randomBytes(mb));const e=qb(r);if(e.length!==mb)throw new Error(`sign: Expected ${mb} bytes of extra data`);o.push(e)}return{seed:Pb(...o),m:rw(n),d:s}}(e,t,r.extraEntropy),i=new Jb(32,bb);let a;for(await i.reseed(n);!(a=Zb(await i.generate(),s,o,r.canonical));)await i.reseed();return function(e,t){const{sig:r,recovery:n}=e,{der:s,recovered:o}=Object.assign({canonical:!0,der:!0},t),i=s?r.toDERRawBytes():r.toCompactRawBytes();return o?[i,n]:i}(a,r)}(uw(t),e,{der:!1})}const Aw=new An("enr");var _w,kw;!function(e){e.TCP="tcp",e.UDP="udp"}(_w||(_w={})),function(e){e.TCP4="tcp4",e.UDP4="udp4",e.TCP6="tcp6",e.UDP6="udp6"}(kw||(kw={}));class Iw extends yw{static RECORD_PREFIX="enr:";peerId;static async create(e={},t=BigInt(1),r){const n=new Iw(e,t,r);try{const e=n.publicKey;e&&(n.peerId=await function(e){return sh(new Uu.secp256k1.Secp256k1PublicKey(e).bytes,void 0)}(e))}catch(e){Aw.error("Could not calculate peer id for ENR",e)}return n}get nodeId(){if("v4"===this.id)return this.publicKey?function(e){const t=Tb.fromHex(e).toRawBytes(!1);return an(uw(t.slice(1)))}(this.publicKey):void 0;throw new Error(dw)}getLocationMultiaddr=pw.bind({},this);get shardInfo(){return this.rs&&this.rsv&&Aw.warn("ENR contains both `rs` and `rsv` fields."),this.rs||this.rsv}setLocationMultiaddr(e){const t=e.protoNames();if(2!==t.length&&"udp"!==t[1]&&"tcp"!==t[1])throw new Error("Invalid multiaddr");const r=e.tuples();if(!r[0][1]||!r[1][1])throw new Error("Invalid multiaddr");4===r[0][0]?(this.set("ip",r[0][1]),this.set(t[1],r[1][1])):(this.set("ip6",r[0][1]),this.set(t[1]+"6",r[1][1]))}getAllLocationMultiaddrs(){const e=[];for(const t of Object.values(kw)){const r=this.getLocationMultiaddr(t);r&&e.push(r)}const t=this.multiaddrs??[];return e.concat(t).map((e=>this.peerId?e.encapsulate(`/p2p/${this.peerId.toString()}`):e))}get peerInfo(){const e=this.peerId;if(e)return{id:e,multiaddrs:this.getAllLocationMultiaddrs()}}getFullMultiaddr(e){if(this.peerId){const t=this.getLocationMultiaddr(e);if(t)return t.encapsulate(`/p2p/${this.peerId.toString()}`)}}getFullMultiaddrs(){if(this.peerId&&this.multiaddrs){const e=this.peerId;return this.multiaddrs.map((t=>t.encapsulate(`/p2p/${e.toString()}`)))}return[]}verify(e,t){if(!this.get("id")||"v4"!==this.id)throw new Error(dw);if(!this.publicKey)throw new Error("Failed to verify ENR: No public key");return hw(t,uw(e),this.publicKey)}async sign(e,t){if("v4"!==this.id)throw new Error(dw);return this.signature=await Sw(t,e),this.signature}}let Rw=!1,Tw=!1;const Cw={debug:1,default:2,info:2,warning:3,error:4,off:5};let Nw=Cw.default,xw=null;const Pw=function(){try{const e=[];if(["NFD","NFC","NFKD","NFKC"].forEach((t=>{try{if("test"!=="test".normalize(t))throw new Error("bad normalize")}catch(r){e.push(t)}})),e.length)throw new Error("missing "+e.join(", "));if(String.fromCharCode(233).normalize("NFD")!==String.fromCharCode(101,769))throw new Error("broken implementation")}catch(e){return e.message}return null}();var Ow,Dw;!function(e){e.DEBUG="DEBUG",e.INFO="INFO",e.WARNING="WARNING",e.ERROR="ERROR",e.OFF="OFF"}(Ow||(Ow={})),function(e){e.UNKNOWN_ERROR="UNKNOWN_ERROR",e.NOT_IMPLEMENTED="NOT_IMPLEMENTED",e.UNSUPPORTED_OPERATION="UNSUPPORTED_OPERATION",e.NETWORK_ERROR="NETWORK_ERROR",e.SERVER_ERROR="SERVER_ERROR",e.TIMEOUT="TIMEOUT",e.BUFFER_OVERRUN="BUFFER_OVERRUN",e.NUMERIC_FAULT="NUMERIC_FAULT",e.MISSING_NEW="MISSING_NEW",e.INVALID_ARGUMENT="INVALID_ARGUMENT",e.MISSING_ARGUMENT="MISSING_ARGUMENT",e.UNEXPECTED_ARGUMENT="UNEXPECTED_ARGUMENT",e.CALL_EXCEPTION="CALL_EXCEPTION",e.INSUFFICIENT_FUNDS="INSUFFICIENT_FUNDS",e.NONCE_EXPIRED="NONCE_EXPIRED",e.REPLACEMENT_UNDERPRICED="REPLACEMENT_UNDERPRICED",e.UNPREDICTABLE_GAS_LIMIT="UNPREDICTABLE_GAS_LIMIT",e.TRANSACTION_REPLACED="TRANSACTION_REPLACED",e.ACTION_REJECTED="ACTION_REJECTED"}(Dw||(Dw={}));const Lw="0123456789abcdef";class Bw{constructor(e){Object.defineProperty(this,"version",{enumerable:!0,value:e,writable:!1})}_log(e,t){const r=e.toLowerCase();null==Cw[r]&&this.throwArgumentError("invalid log level name","logLevel",e),Nw>Cw[r]||console.log.apply(console,t)}debug(...e){this._log(Bw.levels.DEBUG,e)}info(...e){this._log(Bw.levels.INFO,e)}warn(...e){this._log(Bw.levels.WARNING,e)}makeError(e,t,r){if(Tw)return this.makeError("censored error",t,{});t||(t=Bw.errors.UNKNOWN_ERROR),r||(r={});const n=[];Object.keys(r).forEach((e=>{const t=r[e];try{if(t instanceof Uint8Array){let r="";for(let e=0;e>4],r+=Lw[15&t[e]];n.push(e+"=Uint8Array(0x"+r+")")}else n.push(e+"="+JSON.stringify(t))}catch(t){n.push(e+"="+JSON.stringify(r[e].toString()))}})),n.push(`code=${t}`),n.push(`version=${this.version}`);const s=e;let o="";switch(t){case Dw.NUMERIC_FAULT:{o="NUMERIC_FAULT";const t=e;switch(t){case"overflow":case"underflow":case"division-by-zero":o+="-"+t;break;case"negative-power":case"negative-width":o+="-unsupported";break;case"unbound-bitwise-result":o+="-unbound-result"}break}case Dw.CALL_EXCEPTION:case Dw.INSUFFICIENT_FUNDS:case Dw.MISSING_NEW:case Dw.NONCE_EXPIRED:case Dw.REPLACEMENT_UNDERPRICED:case Dw.TRANSACTION_REPLACED:case Dw.UNPREDICTABLE_GAS_LIMIT:o=t}o&&(e+=" [ See: https://links.ethers.org/v5-errors-"+o+" ]"),n.length&&(e+=" ("+n.join(", ")+")");const i=new Error(e);return i.reason=s,i.code=t,Object.keys(r).forEach((function(e){i[e]=r[e]})),i}throwError(e,t,r){throw this.makeError(e,t,r)}throwArgumentError(e,t,r){return this.throwError(e,Bw.errors.INVALID_ARGUMENT,{argument:t,value:r})}assert(e,t,r,n){e||this.throwError(t,r,n)}assertArgument(e,t,r,n){e||this.throwArgumentError(t,r,n)}checkNormalize(e){null==e&&(e="platform missing String.prototype.normalize"),Pw&&this.throwError("platform missing String.prototype.normalize",Bw.errors.UNSUPPORTED_OPERATION,{operation:"String.prototype.normalize",form:Pw})}checkSafeUint53(e,t){"number"==typeof e&&(null==t&&(t="value not safe"),(e<0||e>=9007199254740991)&&this.throwError(t,Bw.errors.NUMERIC_FAULT,{operation:"checkSafeInteger",fault:"out-of-safe-range",value:e}),e%1&&this.throwError(t,Bw.errors.NUMERIC_FAULT,{operation:"checkSafeInteger",fault:"non-integer",value:e}))}checkArgumentCount(e,t,r){r=r?": "+r:"",et&&this.throwError("too many arguments"+r,Bw.errors.UNEXPECTED_ARGUMENT,{count:e,expectedCount:t})}checkNew(e,t){e!==Object&&null!=e||this.throwError("missing new",Bw.errors.MISSING_NEW,{name:t.name})}checkAbstract(e,t){e===t?this.throwError("cannot instantiate abstract class "+JSON.stringify(t.name)+" directly; use a sub-class",Bw.errors.UNSUPPORTED_OPERATION,{name:e.name,operation:"new"}):e!==Object&&null!=e||this.throwError("missing new",Bw.errors.MISSING_NEW,{name:t.name})}static globalLogger(){return xw||(xw=new Bw("logger/5.7.0")),xw}static setCensorship(e,t){if(!e&&t&&this.globalLogger().throwError("cannot permanently disable censorship",Bw.errors.UNSUPPORTED_OPERATION,{operation:"setCensorship"}),Rw){if(!e)return;this.globalLogger().throwError("error censorship permanent",Bw.errors.UNSUPPORTED_OPERATION,{operation:"setCensorship"})}Tw=!!e,Rw=!!t}static setLogLevel(e){const t=Cw[e.toLowerCase()];null!=t?Nw=t:Bw.globalLogger().warn("invalid log level - "+e)}static from(e){return new Bw(e)}}Bw.errors=Dw,Bw.levels=Ow;const Uw=new Bw("bytes/5.7.0");function Mw(e){return!!e.toHexString}function Fw(e){return e.slice||(e.slice=function(){const t=Array.prototype.slice.call(arguments);return Fw(new Uint8Array(Array.prototype.slice.apply(e,t)))}),e}function $w(e){return"number"==typeof e&&e==e&&e%1==0}function Hw(e){if(null==e)return!1;if(e.constructor===Uint8Array)return!0;if("string"==typeof e)return!1;if(!$w(e.length)||e.length<0)return!1;for(let t=0;t=256)return!1}return!0}function qw(e,t){if(t||(t={}),"number"==typeof e){Uw.checkSafeUint53(e,"invalid arrayify value");const t=[];for(;e;)t.unshift(255&e),e=parseInt(String(e/256));return 0===t.length&&t.push(0),Fw(new Uint8Array(t))}if(t.allowMissingPrefix&&"string"==typeof e&&"0x"!==e.substring(0,2)&&(e="0x"+e),Mw(e)&&(e=e.toHexString()),Vw(e)){let r=e.substring(2);r.length%2&&("left"===t.hexPad?r="0"+r:"right"===t.hexPad?r+="0":Uw.throwArgumentError("hex data is odd-length","value",e));const n=[];for(let e=0;e>4]+jw[15&n]}return t}return Uw.throwArgumentError("invalid hexlify value","value",e)}const zw=new Bw("rlp/5.7.0");function Gw(e){const t=[];for(;e;)t.unshift(255&e),e>>=8;return t}function Ww(e,t,r){let n=0;for(let s=0;st+1+n&&zw.throwError("child data too short",Bw.errors.BUFFER_OVERRUN,{})}return{consumed:1+n,result:s}}function Xw(e,t){if(0===e.length&&zw.throwError("data too short",Bw.errors.BUFFER_OVERRUN,{}),e[t]>=248){const r=e[t]-247;t+1+r>e.length&&zw.throwError("data short segment too short",Bw.errors.BUFFER_OVERRUN,{});const n=Ww(e,t+1,r);return t+1+r+n>e.length&&zw.throwError("data long segment too short",Bw.errors.BUFFER_OVERRUN,{}),Jw(e,t,t+1+r,r+n)}if(e[t]>=192){const r=e[t]-192;return t+1+r>e.length&&zw.throwError("data array too short",Bw.errors.BUFFER_OVERRUN,{}),Jw(e,t,t+1,r)}if(e[t]>=184){const r=e[t]-183;t+1+r>e.length&&zw.throwError("data array too short",Bw.errors.BUFFER_OVERRUN,{});const n=Ww(e,t+1,r);return t+1+r+n>e.length&&zw.throwError("data array too short",Bw.errors.BUFFER_OVERRUN,{}),{consumed:1+r+n,result:Kw(e.slice(t+1+r,t+1+r+n))}}if(e[t]>=128){const r=e[t]-128;return t+1+r>e.length&&zw.throwError("data too short",Bw.errors.BUFFER_OVERRUN,{}),{consumed:1+r,result:Kw(e.slice(t+1,t+1+r))}}return{consumed:1,result:Kw(e[t])}}const Qw=new An("enr:decoder");class Zw{static fromString(e){if(!e.startsWith(Iw.RECORD_PREFIX))throw new Error(`"string encoded ENR must start with '${Iw.RECORD_PREFIX}'`);return Zw.fromRLP(Nt(e.slice(4),"base64url"))}static fromRLP(e){const t=function(e){const t=qw(e),r=Xw(t,0);return r.consumed!==t.length&&zw.throwArgumentError("invalid rlp data","data",e),r.result}(e).map(on);return async function(e){const{signature:t,seq:r,kvs:n}=function(e){if(!Array.isArray(e))throw new Error("Decoded ENR must be an array");if(e.length%2!=0)throw new Error("Decoded ENR must have an even number of elements");const[t,r,...n]=e;if(!t||Array.isArray(t))throw new Error("Decoded ENR invalid signature: must be a byte array");if(!r||Array.isArray(r))throw new Error("Decoded ENR invalid sequence number: must be a byte array");return{signature:t,seq:r,kvs:n}}(e),s={};for(let e=0;eev.test(e),encode(e,t,r){r=~~r,t=t||new Uint8Array(r+4);const n=e.length;let s=0;for(let o=0;o(t=~~t,`${e[t++]}.${e[t++]}.${e[t++]}.${e[t]}`)},nv={name:"v6",size:16,isFormat:e=>e.length>0&&tv.test(e),encode(e,t,r){let n=16+(r=~~r),s=-1,o=0,i=0,a=!0,c=!1;t=t||new Uint8Array(r+16);for(let l=0;l>8),r=97?u-=87:u>=65?u-=55:(u-=48,i=10*i+u),o=(o<<4)+u)}if(!1===a)!0===c?(r>8),r=s+2;e--)t[e]=t[e-2];t[s]=0,t[s+1]=0,s=r}if(s!==r&&-1!==s)for(r>n-2&&(r=n-2);n>s;)t[--n]=rs?t[--r]:0;else for(;r=pv||(64512&e.charCodeAt(o))!==pv?t+=3:(n=o,t+=4)}}return t}function gv(e,t,r){const n=e.length;null==r&&(r=0),void 0===t&&(t=new Uint8Array(fv(e)+r));let s=r;for(let r=0;r>6,t[s++]=128|63&o;else if((63488&o)!==dv)t[s++]=224|(61440&o)>>12,t[s++]=128|(4032&o)>>6,t[s++]=128|63&o;else{const i=r+1;if(i===n||o>=pv)t[s++]=239,t[s++]=191,t[s++]=189;else{const n=e.charCodeAt(i);(64512&n)!==pv?(t[s++]=239,t[s++]=191,t[s++]=189):(r=i,o=65536|(1023&o)<<10|1023&n,t[s++]=240|(1835008&o)>>18,t[s++]=128|(258048&o)>>12,t[s++]=128|(4032&o)>>6,t[s++]=128|63&o)}}}return gv.bytes=s-r,t}function yv(e,t,r){let n="";null==t&&(t=0),null==r&&(r=e.length);for(let s=t;s191&&t<224)r=(31&t)<<6|63&e[s++];else if(t>239&&t<365){r=((7&t)<<18|(63&e[s++])<<12|(63&e[s++])<<6|63&e[s++])-65536;const o=dv|r>>10&1023;n+=String.fromCharCode(o),r=pv|1023&r}else r=(15&t)<<12|(63&e[s++])<<6|63&e[s++];n+=String.fromCharCode(r)}return yv.bytes=r-t,n}gv.bytes=0,yv.bytes=0;const mv=e=>e instanceof Uint8Array;function bv(e){return"string"==typeof e?fv(e):e.byteLength}function wv(e){return e instanceof Uint8Array?e:Array.isArray(e)?new Uint8Array(e):gv(e)}function vv(e,t,r){if("string"!=typeof t)throw new Error("unknown input type");return gv(t,e,r),gv.bytes}const Ev=Math.pow(2,24),Sv=Math.pow(2,16),Av=Math.pow(2,8),_v=(e,t)=>e[t]*Ev+e[t+1]*Sv+e[t+2]*Av+e[t+3],kv=(e,t)=>e[t]<<8|e[t+1],Iv=(e,t,r)=>(t=+t,e[r+3]=t,t>>>=8,e[r+2]=t,t>>>=8,e[r+1]=t,t>>>=8,e[r]=t,r+4),Rv=(e,t,r)=>(e[r]=t>>8,e[r+1]=255&t,r+2);function Tv(e,t,r,n,s){return r<0&&(n-=r,r=0),n<0&&(n=0),s<0?new Uint8Array(0):r>=t.length||n>=s?0:function(e,t,r,n,s){s-n>t.length-r&&(s=n+t.length-r);let o=s-n;const i=e.length-n;return o>i&&(o=i),(0!==n||se)}}const Nv=Cv({encode(e,t,r){t||(t=new Uint8Array(Nv.encodingLength(e))),r||(r=0);const n=r,s=e.replace(/^\.|\.$/gm,"");if(s.length){const e=s.split(".");for(let n=0;n=e.length)throw new Error("Cannot decode name (buffer overflow)");const a=e[t++];if(o+=i?0:1,0===a)break;if(192&a){if(192&~a)throw new Error("Cannot decode name (bad label)");{if(t+1>e.length)throw new Error("Cannot decode name (buffer overflow)");const r=kv(e,t-1)-49152;if(r>=n)throw new Error("Cannot decode name (bad pointer)");t=r,n=r,o+=i?0:1,i=!0}}else{if(t+a>e.length)throw new Error("Cannot decode name (buffer overflow)");if(s+=a+1,s>254)throw new Error("Cannot decode name (name too long)");r.push(yv(e,t,t+a)),t+=a,o+=i?0:a}}return Nv.decode.bytes=o,0===r.length?".":r.join(".")},encodingLength:e=>"."===e||".."===e?1:bv(e.replace(/^\.|\.$/gm,""))+2}),xv=Cv({encode(e,t,r){t||(t=new Uint8Array(xv.encodingLength(e))),r||(r=0);const n=vv(t,e,r+1);return t[r]=n,xv.encode.bytes=n+1,t},decode(e,t){t||(t=0);const r=e[t],n=yv(e,t+1,t+1+r);return xv.decode.bytes=r+1,n},encodingLength:e=>bv(e)+1}),Pv=Cv({bytes:12,encode(e,t,r){t||(t=new Uint8Array(Pv.encodingLength(e))),r||(r=0);const n=32767&(e.flags||0),s="response"===e.type?32768:0;return Rv(t,e.id||0,r),Rv(t,n|s,r+2),Rv(t,e.questions.length,r+4),Rv(t,e.answers.length,r+6),Rv(t,e.authorities.length,r+8),Rv(t,e.additionals.length,r+10),t},decode(e,t){if(t||(t=0),e.length<12)throw new Error("Header must be 12 bytes");const r=kv(e,t+2);return{id:kv(e,t),type:32768&r?"response":"query",flags:32767&r,flag_qr:1==(r>>15&1),opcode:cv(r>>11&15),flag_aa:1==(r>>10&1),flag_tc:1==(r>>9&1),flag_rd:1==(r>>8&1),flag_ra:1==(r>>7&1),flag_z:1==(r>>6&1),flag_ad:1==(r>>5&1),flag_cd:1==(r>>4&1),rcode:av(15&r),questions:new Array(kv(e,t+4)),answers:new Array(kv(e,t+6)),authorities:new Array(kv(e,t+8)),additionals:new Array(kv(e,t+10))}},encodingLength:()=>12}),Ov=Cv({encode(e,t,r){t||(t=new Uint8Array(Ov.encodingLength(e))),r||(r=0);const n=e.length;return Rv(t,n,r),Tv(e,t,r+2,0,n),Ov.encode.bytes=n+2,t},decode(e,t){t||(t=0);const r=kv(e,t),n=e.slice(t+2,t+2+r);return Ov.decode.bytes=r+2,n},encodingLength:e=>e.length+2}),Dv=Cv({encode:(e,t,r)=>(t||(t=new Uint8Array(Dv.encodingLength(e))),r||(r=0),Nv.encode(e,t,r+2),Rv(t,Nv.encode.bytes,r),Dv.encode.bytes=Nv.encode.bytes+2,t),decode(e,t){t||(t=0);const r=kv(e,t),n=Nv.decode(e,t+2);return Dv.decode.bytes=r+2,n},encodingLength:e=>Nv.encodingLength(e)+2}),Lv=Cv({encode(e,t,r){t||(t=new Uint8Array(Lv.encodingLength(e))),r||(r=0);const n=r;return r+=2,Nv.encode(e.mname,t,r),r+=Nv.encode.bytes,Nv.encode(e.rname,t,r),r+=Nv.encode.bytes,Iv(t,e.serial||0,r),r+=4,Iv(t,e.refresh||0,r),r+=4,Iv(t,e.retry||0,r),r+=4,Iv(t,e.expire||0,r),r+=4,Iv(t,e.minimum||0,r),Rv(t,(r+=4)-n-2,n),Lv.encode.bytes=r-n,t},decode(e,t){t||(t=0);const r=t,n={};return t+=2,n.mname=Nv.decode(e,t),t+=Nv.decode.bytes,n.rname=Nv.decode(e,t),t+=Nv.decode.bytes,n.serial=_v(e,t),t+=4,n.refresh=_v(e,t),t+=4,n.retry=_v(e,t),t+=4,n.expire=_v(e,t),t+=4,n.minimum=_v(e,t),t+=4,Lv.decode.bytes=t-r,n},encodingLength:e=>22+Nv.encodingLength(e.mname)+Nv.encodingLength(e.rname)}),Bv=Cv({encode(e,t,r){Array.isArray(e)||(e=[e]);for(let t=0;t0;){const r=e[t++];if(--n,ne?(mv(e)?e.length:bv(e))+2:2}),Mv=Cv({encode(e,t,r){t||(t=new Uint8Array(Mv.encodingLength(e))),r||(r=0);const n=r;return r+=2,xv.encode(e.cpu,t,r),r+=xv.encode.bytes,xv.encode(e.os,t,r),r+=xv.encode.bytes,Rv(t,r-n-2,n),Mv.encode.bytes=r-n,t},decode(e,t){t||(t=0);const r=t,n={};return t+=2,n.cpu=xv.decode(e,t),t+=xv.decode.bytes,n.os=xv.decode(e,t),t+=xv.decode.bytes,Mv.decode.bytes=t-r,n},encodingLength:e=>xv.encodingLength(e.cpu)+xv.encodingLength(e.os)+2}),Fv=Cv({encode:(e,t,r)=>(t||(t=new Uint8Array(Fv.encodingLength(e))),r||(r=0),Nv.encode(e,t,r+2),Rv(t,Nv.encode.bytes,r),Fv.encode.bytes=Nv.encode.bytes+2,t),decode(e,t){t||(t=0);const r=Nv.decode(e,t+2);return Fv.decode.bytes=Nv.decode.bytes+2,r},encodingLength:e=>Nv.encodingLength(e)+2}),$v=Cv({encode(e,t,r){t||(t=new Uint8Array($v.encodingLength(e))),r||(r=0),Rv(t,e.priority||0,r+2),Rv(t,e.weight||0,r+4),Rv(t,e.port||0,r+6),Nv.encode(e.target,t,r+8);const n=Nv.encode.bytes+6;return Rv(t,n,r),$v.encode.bytes=n+2,t},decode(e,t){t||(t=0);const r=kv(e,t),n={};return n.priority=kv(e,t+2),n.weight=kv(e,t+4),n.port=kv(e,t+6),n.target=Nv.decode(e,t+8),$v.decode.bytes=r+2,n},encodingLength:e=>8+Nv.encodingLength(e.target)}),Hv=Cv({encode(e,t,r){const n=Hv.encodingLength(e);return t||(t=new Uint8Array(Hv.encodingLength(e))),r||(r=0),e.issuerCritical&&(e.flags=Hv.ISSUER_CRITICAL),Rv(t,n-2,r),t[r+=2]=e.flags||0,r+=1,xv.encode(e.tag,t,r),r+=xv.encode.bytes,vv(t,e.value,r),r+=bv(e.value),Hv.encode.bytes=n,t},decode(e,t){t||(t=0);const r=kv(e,t),n=t+=2,s={};return s.flags=e[t],t+=1,s.tag=xv.decode(e,t),t+=xv.decode.bytes,s.value=yv(e,t,n+r),s.issuerCritical=!!(s.flags&Hv.ISSUER_CRITICAL),Hv.decode.bytes=r+2,s},encodingLength:e=>xv.encodingLength(e.tag)+xv.encodingLength(e.value)+2});Hv.ISSUER_CRITICAL=128;const qv=Cv({encode(e,t,r){t||(t=new Uint8Array(qv.encodingLength(e))),r||(r=0);const n=r;return r+=2,Rv(t,e.preference||0,r),r+=2,Nv.encode(e.exchange,t,r),r+=Nv.encode.bytes,Rv(t,r-n-2,n),qv.encode.bytes=r-n,t},decode(e,t){t||(t=0);const r=t,n={};return t+=2,n.preference=kv(e,t),t+=2,n.exchange=Nv.decode(e,t),t+=Nv.decode.bytes,qv.decode.bytes=t-r,n},encodingLength:e=>4+Nv.encodingLength(e.exchange)}),Vv=Cv({encode:(e,t,r)=>(t||(t=new Uint8Array(Vv.encodingLength(e))),r||(r=0),Rv(t,4,r),r+=2,rv.encode(e,t,r),t),decode:(e,t)=>(t||(t=0),t+=2,rv.decode(e,t)),bytes:6}),jv=Cv({encode:(e,t,r)=>(t||(t=new Uint8Array(jv.encodingLength(e))),r||(r=0),Rv(t,16,r),r+=2,nv.encode(e,t,r),jv.encode.bytes=18,t),decode(e,t){t||(t=0),t+=2;const r=nv.decode(e,t);return jv.decode.bytes=18,r},bytes:18}),Kv=e=>new Uint8Array(e),zv=Cv({encode(e,t,r){t||(t=new Uint8Array(zv.encodingLength(e))),r||(r=0);const n=r,s=hv(e.code);if(Rv(t,s,r),r+=2,e.data)Rv(t,e.data.length,r),r+=2,Tv(e.data,t,r),r+=e.data.length;else switch(s){case 8:{const n=e.sourcePrefixLength||0,s=e.family||function(e){return sv(e)===rv.size?1:2}(e.ip),o=function(e,t,r){r=~~r;const n=sv(e);return"function"==typeof t&&(t=t(r+n)),n===rv.size?rv.encode(e,t,r):nv.encode(e,t,r)}(e.ip,Kv),i=Math.ceil(n/8);Rv(t,i+4,r),Rv(t,s,r+=2),r+=2,t[r++]=n,t[r++]=e.scopePrefixLength||0,Tv(o,t,r,0,i),r+=i}break;case 11:e.timeout?(Rv(t,2,r),r+=2,Rv(t,e.timeout,r),r+=2):(Rv(t,0,r),r+=2);break;case 12:{const n=e.length||0;Rv(t,n,r),r+=2,t.fill(0,r,r+n),r+=n}break;case 14:{const n=2*e.tags.length;Rv(t,n,r),r+=2;for(const n of e.tags)Rv(t,n,r),r+=2}break;default:throw new Error(`Unknown roption code: ${e.code}`)}return zv.encode.bytes=r-n,t},decode(e,t){t||(t=0);const r={};r.code=kv(e,t),r.type=function(e){switch(e){case 1:return"LLQ";case 2:return"UL";case 3:return"NSID";case 5:return"DAU";case 6:return"DHU";case 7:return"N3U";case 8:return"CLIENT_SUBNET";case 9:return"EXPIRE";case 10:return"COOKIE";case 11:return"TCP_KEEPALIVE";case 12:return"PADDING";case 13:return"CHAIN";case 14:return"KEY_TAG";case 26946:return"DEVICEID"}return e<0?null:`OPTION_${e}`}(r.code);const n=kv(e,t+=2);switch(t+=2,r.data=e.slice(t,t+n),r.code){case 8:r.family=kv(e,t),t+=2,r.sourcePrefixLength=e[t++],r.scopePrefixLength=e[t++];{const s=new Uint8Array(1===r.family?4:16);Tv(e,s,0,t,t+n-4),r.ip=function(e,t,r){if(t=~~t,(r=r||e.length-t)===rv.size)return rv.decode(e,t,r);if(r===nv.size)return nv.decode(e,t,r);throw Error(`Invalid buffer size needs to be ${rv.size} for v4 or ${nv.size} for v6.`)}(s)}break;case 11:n>0&&(r.timeout=kv(e,t),t+=2);break;case 14:r.tags=[];for(let s=0;s0;)n[o++]=zv.decode(e,t),t+=zv.decode.bytes,s-=zv.decode.bytes;return Gv.decode.bytes=t-r,n},encodingLength:e=>2+dE(e||[],zv)}),Wv=Cv({encode(e,t,r){t||(t=new Uint8Array(Wv.encodingLength(e))),r||(r=0);const n=r,s=e.key;if(!mv(s))throw new Error("Key must be a Buffer");return r+=2,Rv(t,e.flags,r),t[r+=2]=Wv.PROTOCOL_DNSSEC,t[r+=1]=e.algorithm,Tv(s,t,r+=1,0,s.length),r+=s.length,Wv.encode.bytes=r-n,Rv(t,Wv.encode.bytes-2,n),t},decode(e,t){t||(t=0);const r=t,n={},s=kv(e,t);if(t+=2,n.flags=kv(e,t),e[t+=2]!==Wv.PROTOCOL_DNSSEC)throw new Error("Protocol must be 3");return t+=1,n.algorithm=e[t],t+=1,n.key=e.slice(t,r+s+2),t+=n.key.length,Wv.decode.bytes=t-r,n},encodingLength:e=>6+bv(e.key)});Wv.PROTOCOL_DNSSEC=3,Wv.ZONE_KEY=128,Wv.SECURE_ENTRYPOINT=32768;const Yv=Cv({encode(e,t,r){t||(t=new Uint8Array(Yv.encodingLength(e))),r||(r=0);const n=r,s=e.signature;if(!mv(s))throw new Error("Signature must be a Buffer");return r+=2,Rv(t,iv(e.typeCovered),r),t[r+=2]=e.algorithm,t[r+=1]=e.labels,r+=1,Iv(t,e.originalTTL,r),r+=4,Iv(t,e.expiration,r),r+=4,Iv(t,e.inception,r),r+=4,Rv(t,e.keyTag,r),r+=2,Nv.encode(e.signersName,t,r),Tv(s,t,r+=Nv.encode.bytes,0,s.length),r+=s.length,Yv.encode.bytes=r-n,Rv(t,Yv.encode.bytes-2,n),t},decode(e,t){t||(t=0);const r=t,n={},s=kv(e,t);return t+=2,n.typeCovered=ov(kv(e,t)),t+=2,n.algorithm=e[t],t+=1,n.labels=e[t],t+=1,n.originalTTL=_v(e,t),t+=4,n.expiration=_v(e,t),t+=4,n.inception=_v(e,t),t+=4,n.keyTag=kv(e,t),t+=2,n.signersName=Nv.decode(e,t),t+=Nv.decode.bytes,n.signature=e.slice(t,r+s+2),t+=n.signature.length,Yv.decode.bytes=t-r,n},encodingLength:e=>20+Nv.encodingLength(e.signersName)+bv(e.signature)}),Jv=Cv({encode(e,t,r){t||(t=new Uint8Array(Jv.encodingLength(e))),r||(r=0);const n=r;return r+=2,Nv.encode(e.mbox||".",t,r),r+=Nv.encode.bytes,Nv.encode(e.txt||".",t,r),r+=Nv.encode.bytes,Jv.encode.bytes=r-n,Rv(t,Jv.encode.bytes-2,n),t},decode(e,t){t||(t=0);const r=t,n={};return t+=2,n.mbox=Nv.decode(e,t)||".",t+=Nv.decode.bytes,n.txt=Nv.decode(e,t)||".",t+=Nv.decode.bytes,Jv.decode.bytes=t-r,n},encodingLength:e=>2+Nv.encodingLength(e.mbox||".")+Nv.encodingLength(e.txt||".")}),Xv=Cv({encode(e,t,r){t||(t=new Uint8Array(Xv.encodingLength(e))),r||(r=0);const n=r,s=[];for(let t=0;t>8]&&(s[r>>8]=[]),s[r>>8][r>>3&31]|=1<<7-(7&r)}for(let e=0;e>8]=Math.max(t[n>>8]||0,255&n)}let r=0;for(let e=0;e2+Nv.encodingLength(e.nextDomain)+Xv.encodingLength(e.rrtypes)}),Zv=Cv({encode(e,t,r){t||(t=new Uint8Array(Zv.encodingLength(e))),r||(r=0);const n=r,s=e.salt;if(!mv(s))throw new Error("salt must be a Buffer");const o=e.nextDomain;if(!mv(o))throw new Error("nextDomain must be a Buffer");return t[r+=2]=e.algorithm,t[r+=1]=e.flags,r+=1,Rv(t,e.iterations,r),t[r+=2]=s.length,Tv(s,t,r+=1,0,s.length),t[r+=s.length]=o.length,Tv(o,t,r+=1,0,o.length),r+=o.length,Xv.encode(e.rrtypes,t,r),r+=Xv.encode.bytes,Zv.encode.bytes=r-n,Rv(t,Zv.encode.bytes-2,n),t},decode(e,t){t||(t=0);const r=t,n={},s=kv(e,t);t+=2,n.algorithm=e[t],t+=1,n.flags=e[t],t+=1,n.iterations=kv(e,t);const o=e[t+=2];t+=1,n.salt=e.slice(t,t+o);const i=e[t+=o];return t+=1,n.nextDomain=e.slice(t,t+i),t+=i,n.rrtypes=Xv.decode(e,t,s-(t-r)),t+=Xv.decode.bytes,Zv.decode.bytes=t-r,n},encodingLength:e=>8+e.salt.length+e.nextDomain.length+Xv.encodingLength(e.rrtypes)}),eE=Cv({encode(e,t,r){t||(t=new Uint8Array(eE.encodingLength(e))),r||(r=0);const n=r,s=e.digest;if(!mv(s))throw new Error("Digest must be a Buffer");return r+=2,Rv(t,e.keyTag,r),t[r+=2]=e.algorithm,t[r+=1]=e.digestType,Tv(s,t,r+=1,0,s.length),r+=s.length,eE.encode.bytes=r-n,Rv(t,eE.encode.bytes-2,n),t},decode(e,t){t||(t=0);const r=t,n={},s=kv(e,t);return t+=2,n.keyTag=kv(e,t),t+=2,n.algorithm=e[t],t+=1,n.digestType=e[t],t+=1,n.digest=e.slice(t,r+s+2),t+=n.digest.length,eE.decode.bytes=t-r,n},encodingLength:e=>6+bv(e.digest)});function tE(e){switch(e.toUpperCase()){case"A":return Vv;case"PTR":case"CNAME":case"DNAME":return Fv;case"TXT":return Bv;case"NULL":return Uv;case"AAAA":return jv;case"SRV":return $v;case"HINFO":return Mv;case"CAA":return Hv;case"NS":return Dv;case"SOA":return Lv;case"MX":return qv;case"OPT":return Gv;case"DNSKEY":return Wv;case"RRSIG":return Yv;case"RP":return Jv;case"NSEC":return Qv;case"NSEC3":return Zv;case"DS":return eE}return Ov}const rE=Cv({encode(e,t,r){t||(t=new Uint8Array(rE.encodingLength(e))),r||(r=0);const n=r;if(Nv.encode(e.name,t,r),r+=Nv.encode.bytes,Rv(t,iv(e.type),r),"OPT"===e.type.toUpperCase()){if("."!==e.name)throw new Error("OPT name must be root.");Rv(t,e.udpPayloadSize||4096,r+2),t[r+4]=e.extendedRcode||0,t[r+5]=e.ednsVersion||0,Rv(t,e.flags||0,r+6),r+=8,Gv.encode(e.options||[],t,r),r+=Gv.encode.bytes}else{let n=uv(void 0===e.class?"IN":e.class);e.flush&&(n|=32768),Rv(t,n,r+2),Iv(t,e.ttl||0,r+4),r+=8;const s=tE(e.type);s.encode(e.data,t,r),r+=s.encode.bytes}return rE.encode.bytes=r-n,t},decode(e,t){t||(t=0);const r={},n=t;if(r.name=Nv.decode(e,t),t+=Nv.decode.bytes,r.type=ov(kv(e,t)),"OPT"===r.type)r.udpPayloadSize=kv(e,t+2),r.extendedRcode=e[t+4],r.ednsVersion=e[t+5],r.flags=kv(e,t+6),r.flag_do=1==(r.flags>>15&1),r.options=Gv.decode(e,t+8),t+=8+Gv.decode.bytes;else{const n=kv(e,t+2);r.ttl=_v(e,t+4),r.class=lv(-32769&n),r.flush=!!(32768&n);const s=tE(r.type);r.data=s.decode(e,t+8),t+=8+s.decode.bytes}return rE.decode.bytes=t-n,r},encodingLength(e){const t=null!==e.data&&void 0!==e.data?e.data:e.options;return Nv.encodingLength(e.name)+8+tE(e.type).encodingLength(t)}}),nE=Cv({encode(e,t,r){t||(t=new Uint8Array(nE.encodingLength(e))),r||(r=0);const n=r;return Nv.encode(e.name,t,r),r+=Nv.encode.bytes,Rv(t,iv(e.type),r),r+=2,Rv(t,uv(void 0===e.class?"IN":e.class),r),r+=2,nE.encode.bytes=r-n,e},decode(e,t){t||(t=0);const r=t,n={};return n.name=Nv.decode(e,t),t+=Nv.decode.bytes,n.type=ov(kv(e,t)),t+=2,n.class=lv(kv(e,t)),t+=2,!!(32768&n.class)&&(n.class&=-32769),nE.decode.bytes=t-r,n},encodingLength:e=>Nv.encodingLength(e.name)+4}),sE=256,oE={encode:function(e,t,r){const n=!t;n&&(t=new Uint8Array(hE(e))),r||(r=0);const s=r;return e.questions||(e.questions=[]),e.answers||(e.answers=[]),e.authorities||(e.authorities=[]),e.additionals||(e.additionals=[]),Pv.encode(e,t,r),r+=Pv.encode.bytes,r=pE(e.questions,nE,t,r),r=pE(e.answers,rE,t,r),r=pE(e.authorities,rE,t,r),r=pE(e.additionals,rE,t,r),oE.encode.bytes=r-s,n&&lE.bytes!==t.length?t.slice(0,lE.bytes):t},decode:function(e,t){t||(t=0);const r=t,n=Pv.decode(e,t);return t+=Pv.decode.bytes,t=fE(n.questions,nE,e,t),t=fE(n.answers,rE,e,t),t=fE(n.authorities,rE,e,t),t=fE(n.additionals,rE,e,t),oE.decode.bytes=t-r,n},encodingLength:function(e){return Pv.encodingLength(e)+dE(e.questions||[],nE)+dE(e.answers||[],rE)+dE(e.authorities||[],rE)+dE(e.additionals||[],rE)}};function iE(e,t){if(e.questions)throw new Error("Only one .question object expected instead of a .questions array!");const r=Object.assign({type:t},e);return r.question&&(r.questions=[r.question],delete r.question),r}oE.encode.bytes=0,oE.decode.bytes=0;const aE={encode:function(e,t,r){return t=oE.encode(iE(e,"query"),t,r),aE.encode.bytes=oE.encode.bytes,t},decode:function(e,t){const r=oE.decode(e,t);return aE.decode.bytes=oE.decode.bytes,r.questions&&(r.question=r.questions[0],delete r.questions),r},encodingLength:function(e){return oE.encodingLength(iE(e,"query"))}};aE.encode.bytes=0,aE.decode.bytes=0;const cE={encode:function(e,t,r){return t=oE.encode(iE(e,"response"),t,r),cE.encode.bytes=oE.encode.bytes,t},decode:function(e,t){const r=oE.decode(e,t);return cE.decode.bytes=oE.decode.bytes,r.questions&&(r.question=r.questions[0],delete r.questions),r},encodingLength:function(e){return oE.encodingLength(iE(e,"response"))}};cE.encode.bytes=0,cE.decode.bytes=0;const lE=oE.encode,uE=oE.decode,hE=oE.encodingLength;function dE(e,t){let r=0;for(let n=0;n255)throw new Error(`Character #${e} in charset [code=${r}, char=${t.charAt(e)}] is too high! (max=255)`);if(0!==s[r])throw new Error(`Character [code=${r}, char=${t.charAt(e)}] is more than once in the charset!`);s[r]=e,o[e]=r}const i=r.charCodeAt(0),a={name:e,encodingLength(e){const t=e.length,r=.75*t|0;return e.charCodeAt(t-1)===i?e.charCodeAt(t-2)===i?r-2:r-1:r},encode(e,t,r){null==t&&(t=new Uint8Array(a.encodingLength(e))),null==r&&(r=0);let n=e.length;e.charCodeAt(n-1)===i&&(e.charCodeAt(n-2)===i?n-=2:n-=1);const o=n%4,c=n-o;let l=r,u=0;for(;u>16,t[l++]=r>>8,t[l++]=r,u+=4}if(3===o){const r=s[e.charCodeAt(u)]<<10|s[e.charCodeAt(u+1)]<<4|s[e.charCodeAt(u+2)]>>2;t[l++]=r>>8,t[l++]=r}else 2===o&&(t[l++]=s[e.charCodeAt(u)]<<2|s[e.charCodeAt(u+1)]>>4);return a.encode.bytes=l-r,t},decode(e,t,r){null==t&&(t=0),null==r&&(r=e.length);const s=r-t,c=s%3,l=t+s-c,u=[];for(let r=t;r>18&63],o[t>>12&63],o[t>>6&63],o[63&t])}if(2===c){const t=(e[r-2]<<8)+e[r-1];u.push(o[t>>10],o[t>>4&63],o[t<<2&63]),1===n&&u.push(i)}else if(1===c){const t=e[r-1];u.push(o[t>>2],o[t<<4&63]),1===n&&u.push(i,i)}return a.decode.bytes=s,String.fromCharCode.apply(String,u)}};return a}gE("base64","ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/","=",1);const yE=gE("base64-url","ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_","=",2);let mE="undefined"!=typeof global?global.AbortError:"undefined"!=typeof window?window.AbortError:null;mE||(mE=class extends Error{constructor(e="Request aborted."){super(e)}}),mE.prototype.name="AbortError",mE.prototype.code="ABORT_ERR";const bE="undefined"!=typeof globalThis&&globalThis.URL||require("url").URL;class wE extends Error{constructor(e,t,r){super("status="+t+" while requesting "+e+" ["+r+"]"),this.uri=e,this.status=t,this.method=r}toJSON(){return{code:this.code,uri:this.uri,status:this.status,method:this.method,endpoint:this.endpoint}}}wE.prototype.name="HTTPStatusError",wE.prototype.code="HTTP_STATUS";class vE extends Error{constructor(e,t){super(e),this.cause=t}toJSON(){return{message:this.message,endpoint:this.endpoint,code:this.code,cause:_E(this.cause)}}}vE.prototype.name="ResponseError",vE.prototype.code="RESPONSE_ERR";class EE extends Error{constructor(e){super("Timeout (t="+e+")."),this.timeout=e}toJSON(){return{code:this.code,endpoint:this.endpoint,timeout:this.timeout}}}EE.prototype.name="TimeoutError",EE.prototype.code="ETIMEOUT";const SE=/^((\d{1,3}\.){3,3}\d{1,3})(:(\d{2,5}))?$/,AE=/^((::)?(((\d{1,3}\.){3}(\d{1,3}){1})?([0-9a-f]){0,4}:{0,2}){1,8}(::)?)(:(\d{2,5}))?$/i;function _E(e){if("string"==typeof e)return{message:e};try{const t=JSON.stringify(e);if("{}"!==t)return JSON.parse(t)}catch(e){}const t={message:String(e.message||e)};return void 0!==e.code&&(t.code=String(e.code)),t}const kE=/^(([a-z0-9]+:)\/\/)?([^/[\s:]+|\[[^\]]+\])?(:([^/\s]+))?(\/[^\s]*)?(.*)$/,IE=/\[(post|get|((ipv4|ipv6|name)=([^\]]+)))\]/gi,RE=/\[(((pk|name)=([^\]]+)))\]/gi;function TE(e,t){t.lastIndex=0;const r={};for(;;){const n=t.exec(e);if(!n)break;n[2]?r[n[3].toLowerCase()]=n[4]:r[n[1].toLowerCase()]=!0}return r}class CE extends Error{constructor(e,t){super(`Invalid Endpoint: unsupported protocol "${e}" for endpoint: ${t}, supported protocols: ${NE.join(", ")}`),this.protocol=e,this.endpoint=t}toJSON(){return{code:this.code,endpoint:this.endpoint,timeout:this.timeout}}}CE.prototype.name="InvalidProtocolError",CE.prototype.code="EPROTOCOL";const NE=["http:","https:","udp4:","udp6:"];class xE{constructor(e,t){this.name=e.name||null,this.protocol=e.protocol;const r="string"==typeof e.port?e.port=parseInt(e.port,10):e.port;if(null==r)this.port=t?"https:"===this.protocol?443:80:e.pk?443:53;else{if("number"!=typeof r&&!isNaN(r))throw new Error(`Invalid Endpoint: port "${e.port}" needs to be a number: ${JSON.stringify(e)}`);this.port=r}}toJSON(){return this.toString()}}class PE extends xE{constructor(e){super(e,!1),this.pk=e.pk||null}toString(){const e=this.port!==(this.pk?443:53)?`:${this.port}`:"",t=this.pk?` [pk=${this.pk}]`:"",r=this.name?` [name=${this.name}]`:"";return`udp://${this.ipv4||`[${this.ipv6}]`}${e}${t}${r}`}}class OE extends PE{constructor(e){if(super(Object.assign({protocol:"udp4:"},e)),!e.ipv4||"string"!=typeof e.ipv4)throw new Error(`Invalid Endpoint: .ipv4 "${e.ipv4}" needs to be set: ${JSON.stringify(e)}`);this.ipv4=e.ipv4}}class DE extends PE{constructor(e){if(super(Object.assign({protocol:"udp6:"},e)),!e.ipv6||"string"!=typeof e.ipv6)throw new Error(`Invalid Endpoint: .ipv6 "${e.ipv6}" needs to be set: ${JSON.stringify(e)}`);this.ipv6=e.ipv6}}function LE(e){return AE.test(e)&&!SE.test(e)?`[${e}]`:e}class BE extends xE{constructor(e){if(super(Object.assign({protocol:"https:"},e),!0),e.host||(e.ipv4&&(e.host=e.ipv4),e.ipv6&&(e.host=`[${e.ipv6}]`)),!e.host||"string"!=typeof e.host)throw new Error(`Invalid Endpoint: host "${e.path}" needs to be set: ${JSON.stringify(e)}`);if(this.host=e.host,this.path=e.path||"/dns-query",this.method=/^post$/i.test(e.method)?"POST":"GET",this.ipv4=e.ipv4,this.ipv6=e.ipv6,!this.ipv6){const e=AE.exec(this.host);e&&(this.ipv6=e[1])}this.ipv4||SE.test(this.host)&&(this.ipv4=this.host);const t=`${this.protocol}//${LE(this.host)}:${this.port}${this.path}`;try{this.url=new bE(t)}catch(e){throw new Error(e.message+` [${t}]`)}}toString(){const e="https:"===this.protocol?"":"http://",t=this.port!==("https:"===this.protocol?443:80)?`:${this.port}`:"",r="GET"!==this.method?" [post]":"",n="/dns-query"===this.path?"":this.path,s=this.name?` [name=${this.name}]`:"",o=this.ipv4&&this.ipv4!==this.host?` [ipv4=${this.ipv4}]`:"",i=this.ipv6&&this.ipv6!==this.host?` [ipv6=${this.ipv6}]`:"";return`${e}${LE(this.host)}${t}${n}${r}${o}${i}${s}`}}function UE(e){let t;if("string"==typeof e)t=function(e){const t=kE.exec(e),r=t[2]||"https:",n=t[3],s=t[5],o=t[6],i=t[7];if("https:"===r||"http:"===r){const e=TE(i,IE);return{name:e.name,protocol:r,ipv4:e.ipv4,ipv6:e.ipv6,host:n,port:s,path:o,method:e.post?"POST":"GET"}}if("udp:"===r||"udp4:"===r||"udp6:"===r){const t=TE(i,RE),o=/^\[(.*)\]$/.exec(n);if(o&&"udp4:"===r)throw new Error(`Endpoint parsing error: Cannot use ipv6 host with udp4: (endpoint=${e})`);if(!o&&"udp6:"===r)throw new Error(`Endpoint parsing error: Incorrectly formatted host for udp6: (endpoint=${e})`);return o?new DE({protocol:"udp6:",ipv6:o[1],port:s,pk:t.pk,name:t.name}):new OE({protocol:"udp4:",ipv4:n,port:s,pk:t.pk,name:t.name})}throw new CE(r,e)}(e);else{if("object"!=typeof e||null===e||Array.isArray(e))throw new Error(`Can not convert ${e} to an endpoint`);if(e instanceof xE)return e;t=e}null!==t.protocol&&void 0!==t.protocol||(t.protocol="https:");const r=t.protocol;if("udp4:"===r)return new OE(t);if("udp6:"===r)return new DE(t);if("https:"===r||"http:"===r)return new BE(t);throw new CE(r,JSON.stringify(t))}const ME="application/dns-message";function FE(){}function $E(e,t,r,n,s){return new Promise(((o,i)=>{const a=new bE(e);"GET"===t&&r&&(a.search="?dns="+yE.decode(r));const c=a.toString(),l=new XMLHttpRequest;l.open(t,c,!0),l.setRequestHeader("Accept",ME),"POST"===t&&l.setRequestHeader("Content-Type",ME),l.responseType="arraybuffer",l.timeout=n,l.ontimeout=function(){u(new EE(n));try{l.abort()}catch(e){}},l.onreadystatechange=function(){if(l.readyState>1&&200!==l.status&&0!==l.status){u(new wE(c,l.status,t));try{l.abort()}catch(e){}}},l.onerror=function(){u(200===l.status?new Error("Inexplicable XHR Error"):new wE(c,l.status,t))},l.onload=function(){if(200!==l.status)u(new wE(c,l.status,t));else{let e;if("string"==typeof l.response)e=gv(l.response);else if(l.response instanceof Uint8Array)e=l.response;else{if(!(Array.isArray(l.response)||l.response instanceof ArrayBuffer))throw new Error("Unprocessable response "+l.response);e=new Uint8Array(l.response)}u(null,e)}},"POST"===t?l.send(r):l.send(),s&&s.addEventListener("abort",h);let u=function(e,t){u=FE,s&&s.removeEventListener("abort",h),o(e?{error:e,response:l}:{data:t,response:l})};function h(){u(new mE);try{l.abort()}catch(e){}}}))}function HE(e){const t=null===e.time||void 0===e.time?Date.now():e.time,r=function(e){return e.filter((e=>e.cors||e.endpoint.cors))}(e.data.map((e=>(e.endpoint=UE(Object.assign({name:e.name},e.endpoint)),e)))),n=r.map((e=>e.endpoint));return{data:{resolvers:r,resolverByName:r.reduce(((e,t)=>(e[t.name]=t,e)),{}),endpoints:n,endpointByName:n.reduce(((e,t)=>(e[t.name]=t,e)),{})},time:t}}Error;const qE=HE({data:[{name:"adfree.usableprivacy.net",endpoint:{protocol:"https:",host:"adfree.usableprivacy.net"},description:"Public updns DoH service with advertising, tracker and malware filters.\nHosted in Europe by @usableprivacy, details see: https://docs.usableprivacy.com",country:"Germany",location:{lat:51.2993,long:9.491},filter:!0},{name:"adguard-dns-doh",endpoint:{protocol:"https:",host:"dns.adguard.com",ipv4:"94.140.15.15"},description:"Remove ads and protect your computer from malware (over DoH)",country:"France",location:{lat:48.8582,long:2.3387},filter:!0},{name:"adguard-dns-family-doh",endpoint:{protocol:"https:",host:"dns-family.adguard.com",ipv4:"94.140.15.16"},description:"Adguard DNS with safesearch and adult content blocking (over DoH)",country:"France",location:{lat:48.8582,long:2.3387},filter:!0},{name:"adguard-dns-unfiltered-doh",endpoint:{protocol:"https:",host:"dns-unfiltered.adguard.com",ipv4:"94.140.14.140"},description:"AdGuard public DNS servers without filters (over DoH)",country:"France",location:{lat:48.8582,long:2.3387}},{name:"ahadns-doh-chi",endpoint:{protocol:"https:",host:"doh.chi.ahadns.net",cors:!0},description:"A zero logging DNS with support for DNS-over-HTTPS (DoH) & DNS-over-TLS (DoT). Blocks ads, malware, trackers, viruses, ransomware, telemetry and more. No persistent logs. DNSSEC. Hosted in Chicago, USA. By https://ahadns.com/\nServer statistics can be seen at: https://statistics.ahadns.com/?server=chi",country:"United States",location:{lat:41.8483,long:-87.6517},filter:!0,cors:!0},{name:"ahadns-doh-in",endpoint:{protocol:"https:",host:"doh.in.ahadns.net",cors:!0},description:"A zero logging DNS with support for DNS-over-HTTPS (DoH) & DNS-over-TLS (DoT). Blocks ads, malware, trackers, viruses, ransomware, telemetry and more. No persistent logs. DNSSEC. Hosted in Mumbai, India. By https://ahadns.com/\nServer statistics can be seen at: https://statistics.ahadns.com/?server=in",country:"India",location:{lat:19.0748,long:72.8856},filter:!0,cors:!0},{name:"ahadns-doh-la",endpoint:{protocol:"https:",host:"doh.la.ahadns.net",cors:!0},description:"A zero logging DNS with support for DNS-over-HTTPS (DoH) & DNS-over-TLS (DoT). Blocks ads, malware, trackers, viruses, ransomware, telemetry and more. No persistent logs. DNSSEC. Hosted in Los Angeles, USA. By https://ahadns.com/\nServer statistics can be seen at: https://statistics.ahadns.com/?server=la",country:"United States",location:{lat:34.0549,long:-118.2578},filter:!0,cors:!0},{name:"ahadns-doh-nl",endpoint:{protocol:"https:",host:"doh.nl.ahadns.net",cors:!0},description:"A zero logging DNS with support for DNS-over-HTTPS (DoH) & DNS-over-TLS (DoT). Blocks ads, malware, trackers, viruses, ransomware, telemetry and more. No persistent logs. DNSSEC. Hosted in Amsterdam, Netherlands. By https://ahadns.com/\nServer statistics can be seen at: https://statistics.ahadns.com/?server=nl",country:"Netherlands",location:{lat:52.3824,long:4.8995},filter:!0,cors:!0},{name:"ahadns-doh-ny",endpoint:{protocol:"https:",host:"doh.ny.ahadns.net",cors:!0},description:"A zero logging DNS with support for DNS-over-HTTPS (DoH) & DNS-over-TLS (DoT). Blocks ads, malware, trackers, viruses, ransomware, telemetry and more. No persistent logs. DNSSEC. Hosted in New York. By https://ahadns.com/\nServer statistics can be seen at: https://statistics.ahadns.com/?server=ny",country:"United States",location:{lat:40.7308,long:-73.9975},filter:!0,cors:!0},{name:"ahadns-doh-pl",endpoint:{protocol:"https:",host:"doh.pl.ahadns.net",cors:!0},description:"A zero logging DNS with support for DNS-over-HTTPS (DoH) & DNS-over-TLS (DoT). Blocks ads, malware, trackers, viruses, ransomware, telemetry and more. No persistent logs. DNSSEC. Hosted in Poland. By https://ahadns.com/\nServer statistics can be seen at: https://statistics.ahadns.com/?server=pl",country:"Netherlands",location:{lat:52.3824,long:4.8995},filter:!0,cors:!0},{name:"alidns-doh",endpoint:{protocol:"https:",host:"dns.alidns.com",ipv4:"223.5.5.5",cors:!0},description:"A public DNS resolver that supports DoH/DoT in mainland China, provided by Alibaba-Cloud.\nWarning: GFW filtering rules are applied by that resolver.\nHomepage: https://alidns.com/",country:"China",location:{lat:34.7725,long:113.7266},filter:!0,log:!0,cors:!0},{name:"ams-ads-doh-nl",endpoint:{protocol:"https:",host:"dnsnl-noads.alekberg.net"},description:"Resolver in Amsterdam. DoH protocol. Non-logging. Blocks ads, malware and trackers. DNSSEC enabled.",country:"Romania",location:{lat:45.9968,long:24.997},filter:!0},{name:"ams-doh-nl",endpoint:{protocol:"https:",host:"dnsnl.alekberg.net"},description:"Resolver in Amsterdam. DoH protocol. Non-logging, non-filtering, DNSSEC.",country:"Romania",location:{lat:45.9968,long:24.997}},{name:"att",endpoint:{protocol:"https:",host:"dohtrial.att.net"},description:"AT&T test DoH server.",log:!0},{name:"bcn-ads-doh",endpoint:{protocol:"https:",host:"dnses-noads.alekberg.net"},description:"Resolver in Spain. DoH protocol. Non-logging, remove ads and malware, DNSSEC.",country:"Spain",location:{lat:41.3891,long:2.1611},filter:!0},{name:"bcn-doh",endpoint:{protocol:"https:",host:"dnses.alekberg.net"},description:"Resolver in Spain. DoH protocol. Non-logging, non-filtering, DNSSEC.",country:"Spain",location:{lat:41.3891,long:2.1611}},{name:"brahma-world",endpoint:{protocol:"https:",host:"dns.brahma.world"},description:"DNS-over-HTTPS server. Non Logging, filters ads, trackers and malware. DNSSEC ready, QNAME Minimization, No EDNS Client-Subnet.\nHosted in Stockholm, Sweden. (https://dns.brahma.world)",country:"United States",location:{lat:37.751,long:-97.822},filter:!0},{name:"cisco-doh",endpoint:{protocol:"https:",host:"doh.opendns.com",ipv4:"146.112.41.2"},description:"Remove your DNS blind spot (DoH protocol)\nWarning: modifies your queries to include a copy of your network\naddress when forwarding them to a selection of companies and organizations.",country:"United States",location:{lat:37.751,long:-97.822},filter:!0,log:!0},{name:"cloudflare",endpoint:{protocol:"https:",host:"dns.cloudflare.com",ipv4:"1.0.0.1",cors:!0},description:"Cloudflare DNS (anycast) - aka 1.1.1.1 / 1.0.0.1",country:"Australia",location:{lat:-33.494,long:143.2104},cors:!0},{name:"cloudflare-family",endpoint:{protocol:"https:",host:"family.cloudflare-dns.com",ipv4:"1.0.0.3",cors:!0},description:"Cloudflare DNS (anycast) with malware protection and parental control - aka 1.1.1.3 / 1.0.0.3",country:"Australia",location:{lat:-33.494,long:143.2104},filter:!0,cors:!0},{name:"cloudflare-ipv6",endpoint:{protocol:"https:",host:"1dot1dot1dot1.cloudflare-dns.com",cors:!0},description:"Cloudflare DNS over IPv6 (anycast)",country:"United States",location:{lat:37.751,long:-97.822},cors:!0},{name:"cloudflare-security",endpoint:{protocol:"https:",host:"security.cloudflare-dns.com",ipv4:"1.0.0.2",cors:!0},description:"Cloudflare DNS (anycast) with malware blocking - aka 1.1.1.2 / 1.0.0.2",country:"Australia",location:{lat:-33.494,long:143.2104},filter:!0,cors:!0},{name:"controld-block-malware",endpoint:{protocol:"https:",host:"freedns.controld.com",path:"/p1"},description:"ControlD Free DNS. Take CONTROL of your Internet. Block unwanted content, bypass geo-restrictions and be more productive. DoH protocol and No logging. - https://controld.com/free-dns\nThis DNS blocks Malware domains.",country:"Canada",location:{lat:43.6319,long:-79.3716},filter:!0},{name:"controld-block-malware-ad",endpoint:{protocol:"https:",host:"freedns.controld.com",path:"/p2"},description:"ControlD Free DNS. Take CONTROL of your Internet. Block unwanted content, bypass geo-restrictions and be more productive. DoH protocol and No logging. - https://controld.com/free-dns\nThis DNS blocks Malware, Ads & Tracking domains.",country:"Canada",location:{lat:43.6319,long:-79.3716},filter:!0},{name:"controld-block-malware-ad-social",endpoint:{protocol:"https:",host:"freedns.controld.com",path:"/p3"},description:"ControlD Free DNS. Take CONTROL of your Internet. Block unwanted content, bypass geo-restrictions and be more productive. DoH protocol and No logging. - https://controld.com/free-dns\nThis DNS blocks Malware, Ads & Tracking and Social Networks domains.",country:"Canada",location:{lat:43.6319,long:-79.3716},filter:!0},{name:"controld-family-friendly",endpoint:{protocol:"https:",host:"freedns.controld.com",path:"/family"},description:"ControlD Free DNS. Take CONTROL of your Internet. Block unwanted content, bypass geo-restrictions and be more productive. DoH protocol and No logging. - https://controld.com/free-dns\nThis DNS blocks Malware, Ads & Tracking, Adult Content and Drugs domains.",country:"Canada",location:{lat:43.6319,long:-79.3716},filter:!0},{name:"controld-uncensored",endpoint:{protocol:"https:",host:"freedns.controld.com",path:"/uncensored"},description:"ControlD Free DNS. Take CONTROL of your Internet. Block unwanted content, bypass geo-restrictions and be more productive. DoH protocol and No logging. - https://controld.com/free-dns\nThis DNS unblocks censored domains from various countries.",country:"Canada",location:{lat:43.6319,long:-79.3716}},{name:"controld-unfiltered",endpoint:{protocol:"https:",host:"freedns.controld.com",path:"/p0"},description:"ControlD Free DNS. Take CONTROL of your Internet. Block unwanted content, bypass geo-restrictions and be more productive. DoH protocol and No logging. - https://controld.com/free-dns\nThis is a Unfiltered DNS, no DNS record blocking or manipulation here, if you want to block Malware, Ads & Tracking or Social Network domains, use the other ControlD DNS configs.",country:"Canada",location:{lat:43.6319,long:-79.3716}},{name:"dns.digitale-gesellschaft.ch",endpoint:{protocol:"https:",host:"dns.digitale-gesellschaft.ch"},description:"Public DoH resolver operated by the Digital Society (https://www.digitale-gesellschaft.ch).\nHosted in Zurich, Switzerland.\nNon-logging, non-filtering, supports DNSSEC.",country:"Switzerland",location:{lat:47.1449,long:8.1551}},{name:"dns.ryan-palmer",endpoint:{protocol:"https:",host:"dns1.ryan-palmer.com"},description:"Non-logging, non-filtering, DNSSEC DoH Server. Hosted in the UK.",country:"United Kingdom",location:{lat:51.5164,long:-.093}},{name:"dns.sb",endpoint:{protocol:"https:",host:"doh.sb",ipv4:"185.222.222.222",cors:!0},description:"DNSSEC-enabled DoH server by https://xtom.com/\nhttps://dns.sb/doh/",country:"Unknown",location:{lat:47,long:8},cors:!0},{name:"dns.therifleman.name",endpoint:{protocol:"https:",host:"dns.therifleman.name"},description:"DNS-over-HTTPS DNS forwarder from Mumbai, India. Blocks web and Android trackers and ads.\nIP addresses are not logged, but queries are logged for 24 hours for debugging.\nReport issues, send suggestions @ joker349 at protonmail.com.\nAlso supports DoT (for android) @ dns.therifleman.name and plain DNS @ 172.104.206.174",country:"United States",location:{lat:37.751,long:-97.822},filter:!0},{name:"dnsforfamily-doh",endpoint:{protocol:"https:",host:"dns-doh.dnsforfamily.com"},description:"(DoH Protocol) (Now supports DNSSEC). Block adult websites, gambling websites, malwares and advertisements.\nIt also enforces safe search in: Google, YouTube, Bing, DuckDuckGo and Yandex.\nSocial websites like Facebook and Instagram are not blocked. No DNS queries are logged.\nAs of 26-May-2022 5.9 million websites are blocked and new websites are added to blacklist daily.\nCompletely free, no ads or any commercial motive. Operating for 4 years now.\nProvided by: https://dnsforfamily.com",country:"Finland",location:{lat:60.1758,long:24.9349},filter:!0},{name:"dnsforfamily-doh-no-safe-search",endpoint:{protocol:"https:",host:"dns-doh-no-safe-search.dnsforfamily.com"},description:"(DoH Protocol) (Now supports DNSSEC) Block adult websites, gambling websites, malwares and advertisements.\nUnlike other dnsforfamily servers, this one does not enforces safe search. So Google, YouTube, Bing, DuckDuckGo and Yandex are completely accessible without any restriction.\nSocial websites like Facebook and Instagram are not blocked. No DNS queries are logged.\nAs of 26-May-2022 5.9 million websites are blocked and new websites are added to blacklist daily.\nCompletely free, no ads or any commercial motive. Operating for 4 years now.\nWarning: This server is incompatible with anonymization.\nProvided by: https://dnsforfamily.com",country:"Finland",location:{lat:60.1758,long:24.9349},filter:!0},{name:"dnsforge.de",endpoint:{protocol:"https:",host:"dnsforge.de",cors:!0},description:"Public DoH resolver running with Pihole for Adblocking (https://dnsforge.de).\nNon-logging, AD-filtering, supports DNSSEC. Hosted in Germany.",country:"Germany",location:{lat:52.2998,long:9.447},filter:!0,cors:!0},{name:"dnshome-doh",endpoint:{protocol:"https:",host:"dns.dnshome.de"},description:"https://www.dnshome.de/ public resolver in Germany"},{name:"dnspod-doh",endpoint:{protocol:"https:",host:"doh.pub",cors:!0},description:"A public DNS resolver in mainland China provided by DNSPod (Tencent Cloud).\nhttps://www.dnspod.cn/Products/Public.DNS?lang=en",filter:!0,log:!0,cors:!0},{name:"dnswarden-asia-adblock-dohv4",endpoint:{protocol:"https:",host:"doh.asia.dnswarden.com",path:"/adblock"},description:"Hosted in Singapore. For more information look [here](https://github.com/bhanupratapys/dnswarden) or [here](https://dnswarden.com).",country:"Singapore",location:{lat:1.2929,long:103.8547},filter:!0},{name:"dnswarden-asia-adultfilter-dohv4",endpoint:{protocol:"https:",host:"doh.asia.dnswarden.com",path:"/adultfilter"},description:"Hosted in Singapore. For more information look [here](https://github.com/bhanupratapys/dnswarden) or [here](https://dnswarden.com).",country:"Singapore",location:{lat:1.2929,long:103.8547},filter:!0},{name:"dnswarden-asia-uncensor-dohv4",endpoint:{protocol:"https:",host:"doh.asia.dnswarden.com",path:"/uncensored"},description:"Hosted in Singapore. For more information look [here](https://github.com/bhanupratapys/dnswarden) or [here](https://dnswarden.com).",country:"Singapore",location:{lat:1.2929,long:103.8547}},{name:"dnswarden-eu-adblock-dohv4",endpoint:{protocol:"https:",host:"doh.eu.dnswarden.com"},description:"Hosted in Germany. For more information look [here](https://github.com/bhanupratapys/dnswarden) or [here](https://dnswarden.com).",country:"Germany",location:{lat:50.1103,long:8.7147},filter:!0},{name:"dnswarden-us-adblock-dohv4",endpoint:{protocol:"https:",host:"doh.us.dnswarden.com"},description:"Hosted in USA (Dallas) . For more information look [here](https://github.com/bhanupratapys/dnswarden) or [here](https://dnswarden.com).",country:"United States",location:{lat:32.7889,long:-96.8021},filter:!0},{name:"doh-ch-blahdns",endpoint:{protocol:"https:",host:"doh-ch.blahdns.com",cors:!0},description:"Blocks ad and Tracking, no Logging, DNSSEC, Hosted in Switzerland. By https://blahdns.com/",country:"Netherlands",location:{lat:52.3824,long:4.8995},filter:!0,cors:!0},{name:"doh-cleanbrowsing-adult",endpoint:{protocol:"https:",host:"doh.cleanbrowsing.org",path:"/doh/adult-filter/",cors:!0},description:"Blocks access to all adult, pornographic and explicit sites. It does\nnot block proxy or VPNs, nor mixed-content sites. Sites like Reddit\nare allowed. Google and Bing are set to the Safe Mode.\nBy https://cleanbrowsing.org/",filter:!0,cors:!0},{name:"doh-cleanbrowsing-family",endpoint:{protocol:"https:",host:"doh.cleanbrowsing.org",path:"/doh/family-filter/",cors:!0},description:"Blocks access to all adult, pornographic and explicit sites. It also\nblocks proxy and VPN domains that are used to bypass the filters.\nMixed content sites (like Reddit) are also blocked. Google, Bing and\nYoutube are set to the Safe Mode.\nBy https://cleanbrowsing.org/",filter:!0,cors:!0},{name:"doh-cleanbrowsing-security",endpoint:{protocol:"https:",host:"doh.cleanbrowsing.org",path:"/doh/security-filter/",cors:!0},description:"Block access to phishing, malware and malicious domains. It does not block adult content.\nBy https://cleanbrowsing.org/",filter:!0,cors:!0},{name:"doh-crypto-sx",endpoint:{protocol:"https:",host:"doh.crypto.sx",cors:!0},description:"DNS-over-HTTPS server. Anycast, no logs, no censorship, DNSSEC.\nBackend hosted by Scaleway, globally cached via Cloudflare.\nMaintained by Frank Denis.",country:"United States",location:{lat:37.751,long:-97.822},cors:!0},{name:"doh-crypto-sx-ipv6",endpoint:{protocol:"https:",host:"doh-ipv6.crypto.sx",cors:!0},description:"DNS-over-HTTPS server accessible over IPv6. Anycast, no logs, no censorship, DNSSEC.\nBackend hosted by Scaleway, globally cached via Cloudflare.\nMaintained by Frank Denis.",country:"United States",location:{lat:37.751,long:-97.822},cors:!0},{name:"doh-de-blahdns",endpoint:{protocol:"https:",host:"doh-de.blahdns.com",cors:!0},description:"Blocks ad and Tracking, no Logging, DNSSEC, Hosted in Germany. By https://blahdns.com/",country:"Germany",location:{lat:51.2993,long:9.491},filter:!0,cors:!0},{name:"doh-fi-blahdns",endpoint:{protocol:"https:",host:"doh-fi.blahdns.com",cors:!0},description:"Blocks ad and Tracking, no Logging, DNSSEC, Hosted in Finland. By https://blahdns.com/",country:"Finland",location:{lat:60.1758,long:24.9349},filter:!0,cors:!0},{name:"doh-ibksturm",endpoint:{protocol:"https:",host:"ibksturm.synology.me"},description:"DoH & DoT Server, No Logging, No Filters, DNSSEC\nRunning privately by ibksturm in Thurgau, Switzerland"},{name:"doh-jp-blahdns",endpoint:{protocol:"https:",host:"doh-jp.blahdns.com",cors:!0},description:"Blocks ad and Tracking, no Logging, DNSSEC, Hosted in Japan. By https://blahdns.com/",country:"Japan",location:{lat:35.6882,long:139.7532},filter:!0,cors:!0},{name:"doh.ffmuc.net",endpoint:{protocol:"https:",host:"doh.ffmuc.net"},description:"An open (non-logging, non-filtering, non-censoring) DoH resolver operated by Freifunk Munich with nodes in DE.\nhttps://ffmuc.net/",country:"Germany",location:{lat:51.2993,long:9.491}},{name:"doh.tiarap.org",endpoint:{protocol:"https:",host:"doh.tiarap.org"},description:"Non-Logging DNS-over-HTTPS server, cached via Cloudflare.\nFilters out ads, trackers and malware, NO ECS, supports DNSSEC.",country:"United States",location:{lat:37.751,long:-97.822},filter:!0},{name:"google",endpoint:{protocol:"https:",host:"dns.google",ipv4:"8.8.8.8",cors:!0},description:"Google DNS (anycast)",country:"United States",location:{lat:37.751,long:-97.822},log:!0,cors:!0},{name:"hdns",endpoint:{protocol:"https:",host:"query.hdns.io",cors:!0},description:"HDNS is a public DNS resolver that supports Handshake domains.\nhttps://www.hdns.io",country:"United States",location:{lat:37.7771,long:-122.406},cors:!0},{name:"he",endpoint:{protocol:"https:",host:"ordns.he.net"},description:"Hurricane Electric DoH server (anycast)\nUnknown logging policy.",country:"United States",location:{lat:37.751,long:-97.822},log:!0},{name:"id-gmail-doh",endpoint:{protocol:"https:",host:"doh.tiar.app"},description:"Non-Logging DNS-over-HTTPS server located in Singapore.\nFilters out ads, trackers and malware, supports DNSSEC, provided by id-gmail.",country:"Singapore",location:{lat:1.2929,long:103.8547},filter:!0},{name:"iij",endpoint:{protocol:"https:",host:"public.dns.iij.jp"},description:"DoH server operated by Internet Initiative Japan in Tokyo.\nhttps://www.iij.ad.jp/",country:"Japan",location:{lat:35.69,long:139.69},log:!0},{name:"iqdns-doh",endpoint:{protocol:"https:",host:"a.passcloud.xyz"},description:'Non-logging DoH service runned by V2EX.com user johnsonwil.\nReturns "no such domain" for anti-Chinese government websites. Supports DNSSEC.\nFor more information: https://www.v2ex.com/t/785666',filter:!0},{name:"jp.tiar.app-doh",endpoint:{protocol:"https:",host:"jp.tiar.app"},description:"Non-Logging, Non-Filtering DNS-over-HTTPS server in Japan.\nNo ECS, Support DNSSEC",country:"Japan",location:{lat:35.6882,long:139.7532}},{name:"jp.tiarap.org",endpoint:{protocol:"https:",host:"jp.tiarap.org"},description:"DNS-over-HTTPS Server. Non-Logging, Non-Filtering, No ECS, Support DNSSEC.\nCached via Cloudflare."},{name:"libredns",endpoint:{protocol:"https:",host:"doh.libredns.gr"},description:"DoH server in Germany. No logging, but no DNS padding and no DNSSEC support.\nhttps://libredns.gr/",country:"Germany",location:{lat:51.2993,long:9.491}},{name:"nextdns",endpoint:{protocol:"https:",host:"anycsast.dns.nextdns.io"},description:"NextDNS is a cloud-based private DNS service that gives you full control\nover what is allowed and what is blocked on the Internet.\nDNSSEC, Anycast, Non-logging, NoFilters\nhttps://www.nextdns.io/",country:"Netherlands",location:{lat:52.3891,long:4.6563}},{name:"nextdns-ultralow",endpoint:{protocol:"https:",host:"dns.nextdns.io",path:"/dnscrypt-proxy"},description:'NextDNS is a cloud-based private DNS service that gives you full control\nover what is allowed and what is blocked on the Internet.\nhttps://www.nextdns.io/\nTo select the server location, the "-ultralow" variant relies on bootstrap servers\ninstead of anycast.'},{name:"njalla-doh",endpoint:{protocol:"https:",host:"dns.njal.la",cors:!0},description:"Non-logging DoH server in Sweden operated by Njalla.\nhttps://dns.njal.la/",country:"Sweden",location:{lat:59.3247,long:18.056},cors:!0},{name:"odoh-cloudflare",endpoint:{protocol:"https:",host:"odoh.cloudflare-dns.com",cors:!0},description:"Cloudflare ODoH server.\nhttps://cloudflare.com",cors:!0},{name:"odoh-crypto-sx",endpoint:{protocol:"https:",host:"odoh.crypto.sx",cors:!0},description:"ODoH target server. Anycast, no logs.\nBackend hosted by Scaleway. Maintained by Frank Denis.",cors:!0},{name:"odoh-id-gmail",endpoint:{protocol:"https:",host:"doh.tiar.app",path:"/odoh"},description:"ODoH target server. Based in Singapore, no logs.\nFilter ads, trackers and malware.",filter:!0},{name:"odoh-jp.tiar.app",endpoint:{protocol:"https:",host:"jp.tiar.app",path:"/odoh"},description:"ODoH target server. no logs."},{name:"odoh-jp.tiarap.org",endpoint:{protocol:"https:",host:"jp.tiarap.org",path:"/odoh"},description:"ODoH target server via Cloudflare, no logs."},{name:"odoh-resolver4.dns.openinternet.io",endpoint:{protocol:"https:",host:"resolver4.dns.openinternet.io"},description:"ODoH target server. no logs, no filter, DNSSEC.\nRunning on dedicated hardware colocated at Sonic.net in Santa Rosa, CA in the United States.\nUses Sonic's recusrive DNS servers as upstream resolvers (but is not affiliated with Sonic\nin any way). Provided by https://openinternet.io"},{name:"odoh-tiarap.org",endpoint:{protocol:"https:",host:"doh.tiarap.org",path:"/odoh"},description:"ODoH target server via Cloudflare, no logs.\nFilter ads, trackers and malware.",filter:!0},{name:"publicarray-au2-doh",endpoint:{protocol:"https:",host:"doh-2.seby.io",cors:!0},description:"DNSSEC • OpenNIC • Non-logging • Uncensored - hosted on ovh.com.au\nMaintained by publicarray - https://dns.seby.io",country:"Australia",location:{lat:-33.8591,long:151.2002},cors:!0},{name:"puredns-doh",endpoint:{protocol:"https:",host:"puredns.org",ipv4:"146.190.6.13",cors:!0},description:"Public uncensored DNS resolver in Singapore - https://puredns.org\n** Only available in Indonesia and Singapore **",country:"United States",location:{lat:37.751,long:-97.822},cors:!0},{name:"quad101",endpoint:{protocol:"https:",host:"dns.twnic.tw",cors:!0},description:"DNSSEC-aware public resolver by the Taiwan Network Information Center (TWNIC)\nhttps://101.101.101.101/index_en.html",cors:!0},{name:"quad9-doh-ip4-port443-filter-ecs-pri",endpoint:{protocol:"https:",host:"dns11.quad9.net",ipv4:"149.112.112.11"},description:"Quad9 (anycast) dnssec/no-log/filter/ecs 9.9.9.11 - 149.112.112.11",country:"United States",location:{lat:37.751,long:-97.822},filter:!0},{name:"quad9-doh-ip4-port443-filter-pri",endpoint:{protocol:"https:",host:"dns.quad9.net",ipv4:"149.112.112.112"},description:"Quad9 (anycast) dnssec/no-log/filter 9.9.9.9 - 149.112.112.9 - 149.112.112.112",country:"United States",location:{lat:37.751,long:-97.822},filter:!0},{name:"quad9-doh-ip4-port443-nofilter-ecs-pri",endpoint:{protocol:"https:",host:"dns12.quad9.net",ipv4:"9.9.9.12"},description:"Quad9 (anycast) no-dnssec/no-log/no-filter/ecs 9.9.9.12 - 149.112.112.12",country:"United States",location:{lat:37.751,long:-97.822}},{name:"quad9-doh-ip4-port443-nofilter-pri",endpoint:{protocol:"https:",host:"dns10.quad9.net",ipv4:"149.112.112.10"},description:"Quad9 (anycast) no-dnssec/no-log/no-filter 9.9.9.10 - 149.112.112.10",country:"United States",location:{lat:37.751,long:-97.822}},{name:"quad9-doh-ip6-port5053-filter-pri",endpoint:{protocol:"https:",host:"dns9.quad9.net"},description:"Quad9 (anycast) dnssec/no-log/filter 2620:fe::fe - 2620:fe::9 - 2620:fe::fe:9",country:"United States",location:{lat:37.751,long:-97.822},filter:!0},{name:"safesurfer-doh",endpoint:{protocol:"https:",host:"doh.safesurfer.io"},description:"Family safety focused blocklist for over 2 million adult sites, as well as phishing and malware and more.\nFree to use, paid for customizing blocking for more categories+sites and viewing usage at my.safesurfer.io. Logs taken for viewing\nusage, data never sold - https://safesurfer.io",filter:!0,log:!0},{name:"sth-ads-doh-se",endpoint:{protocol:"https:",host:"dnsse-noads.alekberg.net"},description:"Resolver in Stockholm, Sweden. DoH server. Non-logging, remove ads and malware, DNSSEC.",country:"Bulgaria",location:{lat:42.696,long:23.332},filter:!0},{name:"sth-doh-se",endpoint:{protocol:"https:",host:"dnsse.alekberg.net"},description:"Resolver in Stockholm, Sweden. DoH server. Non-logging, non-filtering, DNSSEC.",country:"Bulgaria",location:{lat:42.696,long:23.332}},{name:"switch",endpoint:{protocol:"https:",host:"dns.switch.ch"},description:"Public DoH service provided by SWITCH in Switzerland\nhttps://www.switch.ch\nProvides protection against malware, but does not block ads.",filter:!0},{name:"uncensoreddns-dk-ipv4",endpoint:{protocol:"https:",host:"unicast.uncensoreddns.org"},description:"Also known as censurfridns.\nDoH, no logs, no filter, DNSSEC, unicast hosted in Denmark - https://blog.uncensoreddns.org",country:"Denmark",location:{lat:55.7123,long:12.0564}},{name:"uncensoreddns-ipv4",endpoint:{protocol:"https:",host:"anycast.uncensoreddns.org"},description:"Also known as censurfridns.\nDoH, no logs, no filter, DNSSEC, anycast - https://blog.uncensoreddns.org",country:"Denmark",location:{lat:55.7123,long:12.0564}},{name:"v.dnscrypt.uk-doh-ipv4",endpoint:{protocol:"https:",host:"v.dnscrypt.uk"},description:"DoH, no logs, uncensored, DNSSEC. Hosted in London UK on Digital Ocean\nhttps://www.dnscrypt.uk",country:"United Kingdom",location:{lat:51.4964,long:-.1224}}],time:1654187067783});const VE=new bE("https://martinheidegger.github.io/dns-query/resolvers.json");function jE(e){return/^@/.test(e)}const KE=new class{constructor(e){this.opts=Object.assign({timeout:5e3,update:!0,updateURL:VE,persist:!1,localStoragePrefix:"dnsquery_",maxAge:3e5},e),this._dataP=null}_data(e,t){return e||null===this._dataP?(this._dataP=this.opts.update?async function(e,t,r,n){const s=t?t.localStoragePrefix+t.name:null;if(s)try{const e=JSON.parse(localStorage.getItem(s));if(e&&e.time>t.maxTime)return e}catch(e){}const{data:o}=await $E(e,"GET",null,r,void 0),i={time:Date.now(),data:JSON.parse(yv(o))};if(s)try{localStorage.setItem(s,JSON.stringify(i))}catch(e){i.time=null}return i}(this.opts.updateURL,this.opts.persist?{name:"resolvers.json",localStoragePrefix:this.opts.localStoragePrefix,maxTime:Date.now()-this.opts.maxAge}:null,this.opts.timeout).then((e=>HE({data:e.data.resolvers,time:e.time}))).catch((()=>t||qE)):Promise.resolve(qE),this._dataP):this._dataP.then((e=>e.timee.data))}endpoints(e){if(null==e)return this.data().then((e=>e.endpoints));if("doh"===e&&(e=WE),"dns"===e&&(e=YE),"function"==typeof e)return this.data().then((t=>t.endpoints.filter(e)));if("string"==typeof e||"function"!=typeof e[Symbol.iterator])return Promise.reject(new Error(`Endpoints (${e}) needs to be iterable (array).`));if(-1===(e=Array.from(e).filter(Boolean)).findIndex(jE))try{return Promise.resolve(e.map(UE))}catch(e){return Promise.reject(e)}return this.data().then((t=>e.map((e=>{if(jE(e)){const r=t.endpointByName[e.substring(1)];if(!r)throw new Error(`Endpoint ${e} is not known.`);return r}return UE(e)}))))}};function zE(e,t){return t=Object.assign({retries:5,timeout:3e4},t),e.question?(r=t.endpoints,function(e){return null!==e&&"object"==typeof e&&"function"==typeof e.then}(r)?r:Promise.resolve(r)).then((r=>{if(!Array.isArray(r)||0===r.length)throw new Error("No endpoints defined to lookup dns records.");return GE(r.map(UE),function(e){const t=Object.assign({type:"query"},e);return delete t.question,t.questions=[],e.question&&t.questions.push(e.question),t}(e),t)})).then((e=>(e.question=e.questions[0],delete e.questions,e))):Promise.reject(new Error("To request data you need to specify a .question!"));var r}function GE(e,t,r){const n=1===e.length?e[0]:e[Math.floor(Math.random()*e.length)%e.length];return function(e,t,r,n){return n&&n.aborted?Promise.reject(new mE):"udp4:"===e.protocol||"udp6:"===e.protocol?function(){throw new Error('Only "doh" endpoints are supported in the browser')}():function(e,t,r,n){return function(e,t,r,n,s){return $E(e,t,r,n,s)}(e.url,e.method,lE(Object.assign({flags:sE},t)),r,n).then((function(e){const t=e.data,r=e.response;let n=e.error;if(void 0===n)if(0===t.length)n=new vE("Empty.");else try{const e=uE(t);return e.response=r,e}catch(e){n=new vE("Invalid packet (cause="+e.message+")",e)}throw Object.assign(n,{response:r})}))}(e,t,r,n)}(n,t,r.timeout,r.signal).then((e=>(e.endpoint=n.toString(),e)),(s=>{if("AbortError"===s.name||0===r.retries)throw s.endpoint=n.toString(),s;return r.retries>0&&(r.retries-=1),GE(e,t,r)}))}function WE(e){return"https:"===e.protocol||"http:"===e.protocol}function YE(e){return"udp4:"===e.protocol||"udp6:"===e.protocol}const JE=new An("dns-over-https");class XE{endpoints;retries;static async create(e,t){const r=e??await KE.endpoints("doh");return new XE(r,t)}constructor(e,t=3){this.endpoints=e,this.retries=t}async resolveTXT(e){let t;try{t=(await zE({question:{type:"TXT",name:e}},{endpoints:this.endpoints,retries:this.retries})).answers}catch(e){throw JE.error("query failed: ",e),new Error("DNS query failed")}if(!t)throw new Error(`Could not resolve ${e}`);const r=t.map((e=>e.data)),n=[];return r.forEach((e=>{"string"==typeof e?n.push(e):Array.isArray(e)?e.forEach((e=>{"string"==typeof e?n.push(e):n.push(cn(e))})):n.push(cn(e))})),n}}var QE=__webpack_require__(5818);class ZE{static RECORD_PREFIX=Iw.RECORD_PREFIX;static TREE_PREFIX="enrtree:";static BRANCH_PREFIX="enrtree-branch:";static ROOT_PREFIX="enrtree-root:";static parseAndVerifyRoot(e,t){if(!e.startsWith(this.ROOT_PREFIX))throw new Error(`ENRTree root entry must start with '${this.ROOT_PREFIX}'`);const r=ZE.parseRootValues(e),n=QE.decode.asBytes(t),s=e.split(" sig")[0],o=ln(s);if(!hw(Nt(r.signature,"base64url").slice(0,64),uw(o),new Uint8Array(n)))throw new Error("Unable to verify ENRTree root signature");return r.eRoot}static parseRootValues(e){const t=e.match(/^enrtree-root:v1 e=([^ ]+) l=([^ ]+) seq=(\d+) sig=([^ ]+)$/);if(!Array.isArray(t))throw new Error("Could not parse ENRTree root entry");t.shift();const[r,n,s,o]=t;if(!r)throw new Error("Could not parse 'e' value from ENRTree root entry");if(!n)throw new Error("Could not parse 'l' value from ENRTree root entry");if(!s)throw new Error("Could not parse 'seq' value from ENRTree root entry");if(!o)throw new Error("Could not parse 'sig' value from ENRTree root entry");return{eRoot:r,lRoot:n,seq:Number(s),signature:o}}static parseTree(e){if(!e.startsWith(this.TREE_PREFIX))throw new Error(`ENRTree tree entry must start with '${this.TREE_PREFIX}'`);const t=e.match(/^enrtree:\/\/([^@]+)@(.+)$/);if(!Array.isArray(t))throw new Error("Could not parse ENRTree tree entry");t.shift();const[r,n]=t;if(!r)throw new Error("Could not parse public key from ENRTree tree entry");if(!n)throw new Error("Could not parse domain from ENRTree tree entry");return{publicKey:r,domain:n}}static parseBranch(e){if(!e.startsWith(this.BRANCH_PREFIX))throw new Error(`ENRTree branch entry must start with '${this.BRANCH_PREFIX}'`);return e.split(this.BRANCH_PREFIX)[1].split(",")}}const eS=new An("discovery:fetch_nodes");function tS(e,t){return t.relay>=e.relay&&t.store>=e.store&&t.filter>=e.filter&&t.lightPush>=e.lightPush}function rS(e,t){if(!e.nodeId)return!1;for(const r of t)if(e.nodeId===r.nodeId)return!1;return!0}function nS(e,t){e.relay&&(t.relay+=1),e.store&&(t.store+=1),e.filter&&(t.filter+=1),e.lightPush&&(t.lightPush+=1)}function sS(e,t,r){if(tS(t,r))throw"Internal Error: Waku2 wanted capabilities are already fulfilled";const n=function(e,t){return{relay:t.relaythis._search(s,o)));return oS.info("retrieved peers: ",i.map((e=>({id:e.peerId?.toString(),multiaddrs:e.multiaddrs?.map((e=>e.toString()))})))),i}constructor(e){this._DNSTreeCache={},this.dns=e}async*getNextPeer(e,t){const r=Math.floor(Math.random()*e.length),{publicKey:n,domain:s}=ZE.parseTree(e[r]),o={domain:s,publicKey:n,visits:{}};for await(const e of async function*(e,t,r){const n={relay:e.relay??0,store:e.store??0,filter:e.filter??0,lightPush:e.lightPush??0},s=n.relay+n.store+n.filter+n.lightPush,o={relay:0,store:0,filter:0,lightPush:0};let i=0;const a=new Set;for(;!tS(n,o)&&ithis._search(s,o))))yield e}async _search(e,t){try{const r=await this._getTXTRecord(e,t);let n,s;t.visits[e]=!0;const o=function(e){return e.startsWith(ZE.ROOT_PREFIX)?ZE.ROOT_PREFIX:e.startsWith(ZE.BRANCH_PREFIX)?ZE.BRANCH_PREFIX:e.startsWith(ZE.RECORD_PREFIX)?ZE.RECORD_PREFIX:""}(r);try{switch(o){case ZE.ROOT_PREFIX:return n=ZE.parseAndVerifyRoot(r,t.publicKey),await this._search(n,t);case ZE.BRANCH_PREFIX:return s=ZE.parseBranch(r),n=function(e,t){const r={};for(const[n,s]of e.entries())t.visits[s]&&(r[n]=!0);if(Object.keys(r).length===e.length)throw new Error("Unresolvable circular path detected");let n;do{n=Math.floor(Math.random()*e.length)}while(r[n]);return e[n]}(s,t),await this._search(n,t);case ZE.RECORD_PREFIX:return Zw.fromString(r);default:return null}}catch(t){return oS.error(`Failed to search DNS tree ${o} at subdomain ${e}: ${t}`),null}}catch(t){return oS.error(`Failed to retrieve TXT record at subdomain ${e}: ${t}`),null}}async _getTXTRecord(e,t){if(this._DNSTreeCache[e])return this._DNSTreeCache[e];const r=e!==t.domain?`${e}.${t.domain}`:t.domain,n=await this.dns.resolveTXT(r);if(!n.length)throw new Error("Received empty result array while fetching TXT record");if(!n[0].length)throw new Error("Received empty TXT record");const s=n.join("");return this._DNSTreeCache[e]=s,s}}const aS=new An("peer-discovery-dns");class cS extends Fs{nextPeer;_started;_components;_options;constructor(e,t){super(),this._started=!1,this._components=e,this._options=t;const{enrUrls:r}=t;aS.info("Use following EIP-1459 ENR Tree URLs: ",r)}async start(){aS.info("Starting peer discovery via dns"),this._started=!0,await this.findPeers()}async findPeers(){if(!this.nextPeer){let{enrUrls:e}=this._options;Array.isArray(e)||(e=[e]);const{wantedNodeCapabilityCount:t}=this._options,r=await iS.dnsOverHttp();this.nextPeer=r.getNextPeer.bind(r,e,t)}for await(const e of this.nextPeer()){if(!this._started)return;const{peerInfo:t,shardInfo:r}=e;if(!t)continue;const n={[ob]:{value:this._options.tagValue??50,ttl:this._options.tagTTL??1e8}};let s=!1;await this._components.peerStore.has(t.id)?(await this._components.peerStore.get(t.id)).tags.has(ob)||(s=!0,await this._components.peerStore.merge(t.id,{tags:n})):(s=!0,await this._components.peerStore.save(t.id,{tags:n,...r&&{metadata:{shardInfo:wn(r)}}})),s&&this.dispatchEvent(new $s("peer",{detail:t}))}}stop(){this._started=!1}get[Sd](){return!0}get[Symbol.toStringTag](){return en}}function lS(e,t=ib){return r=>new cS(r,{enrUrls:e,wantedNodeCapabilityCount:t})}class uS{proto;constructor(e){this.proto=e}static createRequest(e){const{numPeers:t}=e;return new uS({query:{numPeers:t},response:void 0})}encode(){return br.encode(this.proto)}static decode(e){const t=br.decode(e);return new uS(t)}get query(){return this.proto.query}get response(){return this.proto.response}}const hS="/vac/waku/peer-exchange/2.0.0-alpha1",dS=new An("peer-exchange");class pS extends is{constructor(e,t){super(hS,e,dS,t)}async query(e){const{numPeers:t,peerId:r}=e,n=uS.createRequest({numPeers:BigInt(t)}),s=await this.peerStore.get(r);if(!s)return{peerInfos:null,error:Jr.NO_PEER_AVAILABLE};let o;try{o=await this.getStream(s)}catch(e){return dS.error("Failed to get stream",e),{peerInfos:null,error:Jr.NO_STREAM_AVAILABLE}}const i=await Zn([n.encode()],Fn,o,zn,(async e=>await Nn(e)));try{const e=new Bn;i.forEach((t=>{e.append(t)}));const{response:t}=uS.decode(e);return t?{peerInfos:await Promise.all(t.peerInfos.map((e=>e.enr)).filter(kr).map((async e=>({ENR:await Zw.fromRLP(e)})))),error:null}:(dS.error("PeerExchangeRPC message did not contains a `response` field"),{peerInfos:null,error:Jr.EMPTY_PAYLOAD})}catch(e){return dS.error("Failed to decode push reply",e),{peerInfos:null,error:Jr.DECODE_FAILED}}}}const fS=new An("peer-exchange-discovery"),gS=1e4,yS=3,mS=Xr.PEER_EXCHANGE;class bS extends Fs{components;peerExchange;options;isStarted;queryingPeers=new Set;queryAttempts=new Map;handleDiscoveredPeer=e=>{const{protocols:t,peerId:r}=e.detail;t.includes(hS)&&!this.queryingPeers.has(r.toString())&&(this.queryingPeers.add(r.toString()),this.startRecurringQueries(r).catch((e=>fS.error(`Error querying peer ${e}`))))};constructor(e,t,r={}){super(),this.components=e,this.peerExchange=new pS(e,t),this.options=r,this.isStarted=!1}start(){this.isStarted||(this.dispatchEvent(new $s("waku:peer-exchange:started",{detail:!0})),fS.info("Starting peer exchange node discovery, discovering peers"),this.components.events.addEventListener("peer:identify",this.handleDiscoveredPeer))}stop(){this.isStarted&&(fS.info("Stopping peer exchange node discovery"),this.isStarted=!1,this.queryingPeers.clear(),this.components.events.removeEventListener("peer:identify",this.handleDiscoveredPeer))}get[Sd](){return!0}get[Symbol.toStringTag](){return"@waku/peer-exchange"}startRecurringQueries=async e=>{const t=e.toString(),{queryInterval:r=gS,maxRetries:n=yS}=this.options;fS.info(`Querying peer: ${t} (attempt ${this.queryAttempts.get(t)??1})`),await this.query(e);const s=this.queryAttempts.get(t)??1;s>n?this.abortQueriesForPeer(t):setTimeout((()=>{this.queryAttempts.set(t,s+1),this.startRecurringQueries(e).catch((e=>{fS.error(`Error in startRecurringQueries: ${e}`)}))}),r*s)};async query(e){const{error:t,peerInfos:r}=await this.peerExchange.query({numPeers:10,peerId:e});if(t)return fS.error("Peer exchange query failed",t),{error:t,peerInfos:null};for(const e of r){const{ENR:t}=e;if(!t){fS.warn("No ENR in peerInfo object, skipping");continue}const{peerId:r,peerInfo:n,shardInfo:s}=t;if(r&&n){if(await this.components.peerStore.has(r)){const{hasMultiaddrDiff:e,hasShardDiff:t}=await this.checkPeerInfoDiff(n,s);if(e||t){fS.info(`Peer ${r.toString()} has updated multiaddrs or shardInfo, updating`),e&&(fS.info(`Peer ${r.toString()} has updated multiaddrs, updating`),await this.components.peerStore.patch(r,{multiaddrs:n.multiaddrs})),t&&s&&(fS.info(`Peer ${r.toString()} has updated shardInfo, updating`),await this.components.peerStore.merge(r,{metadata:{shardInfo:wn(s)}}),this.dispatchEvent(new $s("peer",{detail:{id:r,multiaddrs:n.multiaddrs}})));continue}}await this.components.peerStore.save(r,{tags:{[mS]:{value:this.options.tagValue??50,ttl:this.options.tagTTL??1e8}},...s&&{metadata:{shardInfo:wn(s)}},...n.multiaddrs&&{multiaddrs:n.multiaddrs}}),fS.info(`Discovered peer: ${r.toString()}`),this.dispatchEvent(new $s("peer",{detail:{id:r,multiaddrs:n.multiaddrs}}))}}return{error:null,peerInfos:r}}abortQueriesForPeer(e){fS.info(`Aborting queries for peer: ${e}`),this.queryingPeers.delete(e),this.queryAttempts.delete(e)}async checkPeerInfoDiff(e,t){const{id:r}=e,n=await this.components.peerStore.get(r),s=n.addresses.map((e=>e.multiaddr.toString())),o=e.multiaddrs.map((e=>e.toString())),i=s.some((e=>!o.includes(e)));let a=!1;const c=n.metadata.get("shardInfo");if(c){const e=bn(c);(e||t)&&(a=e.clusterId!==t?.clusterId||e.shards.some((e=>!t?.shards.includes(e))))}return{hasMultiaddrDiff:i,hasShardDiff:a}}}function wS(e){return t=>new bS(t,e)}const vS=new An("peer-exchange-discovery"),ES=Xr.LOCAL;class SS extends Fs{components;options;isStarted;peers=[];constructor(e,t){super(),this.components=e,this.options=t,this.isStarted=!1,this.peers=this.getPeersFromLocalStorage()}get[Symbol.toStringTag](){return"@waku/local-peer-cache-discovery"}async start(){if(!this.isStarted){vS.info("Starting Local Storage Discovery"),this.components.events.addEventListener("peer:identify",this.handleNewPeers);for(const{id:e,address:t}of this.peers){const r=await vg({id:e});await this.components.peerStore.has(r)||(await this.components.peerStore.save(r,{multiaddrs:[Mo(t)],tags:{[this.options?.tagName??ES]:{value:this.options?.tagValue??50,ttl:this.options?.tagTTL??1e8}}}),this.dispatchEvent(new $s("peer",{detail:{id:r,multiaddrs:[Mo(t)]}})))}vS.info(`Discovered ${this.peers.length} peers`),this.isStarted=!0}}stop(){this.isStarted&&(vS.info("Stopping Local Storage Discovery"),this.components.events.removeEventListener("peer:identify",this.handleNewPeers),this.isStarted=!1,this.savePeersToLocalStorage())}handleNewPeers=e=>{const{peerId:t,listenAddrs:r}=e.detail,n=function(e){const t=e.find((e=>e.toString().includes("ws")||e.toString().includes("wss")));if(!t)throw new Error("No ws multiaddr found in the given addresses");return t}(r),s=this.getPeersFromLocalStorage(),o=s.findIndex((e=>e.id===t.toString()));o>=0?s[o].address=n.toString():s.push({id:t.toString(),address:n.toString()}),this.peers=s,this.savePeersToLocalStorage()};getPeersFromLocalStorage(){try{const e=localStorage.getItem("waku:peers");return e?JSON.parse(e).filter(AS):[]}catch(e){return vS.error("Error parsing peers from local storage:",e),[]}}savePeersToLocalStorage(){try{localStorage.setItem("waku:peers",JSON.stringify(this.peers))}catch(e){vS.error("Error saving peers to local storage:",e)}}}function AS(e){return e&&"object"==typeof e&&"string"==typeof e.id&&"string"==typeof e.address}const _S=new An("sdk:create");async function kS(e,t,r){t?.hideWebSocketInfo||(console.info("%cIgnore WebSocket connection failures","background: gray; color: white; font-size: x-large"),console.info("%cWaku tries to discover peers and some of them are expected to fail","background: gray; color: white; font-size: x-large"));const n=e?{metadata:Js(e)}:{};return async function(e={}){const t=await async function(e={}){const t=e.peerId??=await bg();if(null==t.privateKey)throw new eo("peer id was missing private key","ERR_MISSING_PRIVATE_KEY");return e.privateKey??=await qu(t.privateKey),new nb(await async function(e){const t=$y(Vy,e);if(null===t.connectionProtector&&null!=globalThis.process?.env?.LIBP2P_FORCE_PNET)throw new eo(Hy.ERR_PROTECTOR_REQUIRED,qy.ERR_PROTECTOR_REQUIRED);if(null!=t.privateKey&&!(await sh(t.privateKey.public.bytes,t.privateKey.bytes)).equals(t.peerId))throw new eo("Private key doesn't match peer id",qy.ERR_INVALID_KEY);return t}(e))}(e);return!1!==e.start&&await t.start(),t}({connectionManager:{minConnections:1},transports:[tg({filter:!1===t?.filterMultiaddrs?Qf:Zf})],streamMuxers:[xf()],connectionEncryption:[Ed()],...t,services:{identify:af({agentVersion:r??Yo}),ping:Df({maxInboundStreams:t?.pingMaxInboundStreams??Jo}),...n,...t?.services}})}async function IS(e={}){const{libp2p:t,pubsubTopics:r}=await async function(e){const{networkConfig:t}=e,r=function(e){if("clusterId"in(t=e)&&"shards"in t&&!("contentTopics"in t)){if(0===e.shards.length)throw new Error("Invalid shards configuration: please provide at least one shard");return dn(e)}if(function(e){return"contentTopics"in e}(e)){if(0===e.contentTopics.length)throw new Error("Invalid content topics configuration: please provide at least one content topic");return e.contentTopics.map((t=>yn(t,e.clusterId)))}throw new Error("Unknown shard config. Please use ShardInfo or ContentTopicInfo");var t}(t??rn);_S.info("Creating Waku node with pubsub topics",r);const n=e?.libp2p??{},s=n.peerDiscovery??[];var o;return e?.defaultBootstrap&&s.push(...function(e){return[lS([sb.SANDBOX,sb.TEST]),(e,t)=>new SS(e,t),wS(e)]}(r)),e?.bootstrapPeers&&s.push((o={list:e.bootstrapPeers},e=>new tp(e,o))),n.peerDiscovery=s,{libp2p:await kS(r,n,e?.userAgent),pubsubTopics:r}}(e);return new Qo(r,e,t,{store:!0,lightpush:!0,filter:!0})}var RS,TS=__webpack_require__(2549),CS=function(e,t,r,n){return new(r||(r=Promise))((function(s,o){function i(e){try{c(n.next(e))}catch(e){o(e)}}function a(e){try{c(n.throw(e))}catch(e){o(e)}}function c(e){var t;e.done?s(e.value):(t=e.value,t instanceof r?t:new r((function(e){e(t)}))).then(i,a)}c((n=n.apply(e,t||[])).next())}))},NS=function(e,t){var r,n,s,o,i={label:0,sent:function(){if(1&s[0])throw s[1];return s[1]},trys:[],ops:[]};return o={next:a(0),throw:a(1),return:a(2)},"function"==typeof Symbol&&(o[Symbol.iterator]=function(){return this}),o;function a(a){return function(c){return function(a){if(r)throw new TypeError("Generator is already executing.");for(;o&&(o=0,a[0]&&(i=0)),i;)try{if(r=1,n&&(s=2&a[0]?n.return:a[0]?n.throw||((s=n.return)&&s.call(n),0):n.next)&&!(s=s.call(n,a[1])).done)return s;switch(n=0,s&&(a=[2&a[0],s.value]),a[0]){case 0:case 1:s=a;break;case 4:return i.label++,{value:a[1],done:!1};case 5:i.label++,n=a[1],a=[0];continue;case 7:a=i.ops.pop(),i.trys.pop();continue;default:if(!((s=(s=i.trys).length>0&&s[s.length-1])||6!==a[0]&&2!==a[0])){i=0;continue}if(3===a[0]&&(!s||a[1]>s[0]&&a[1]0?[4,this.send(this.queue)]:[3,2];case 1:e.sent()&&(console.log("Sent ",this.queue.length," telemetry logs"),this.queue=[]),e.label=2;case 2:return[2]}}))}))}),this.intervalPeriod)),[2]}))}))},e.prototype.stop=function(){this.intervalId&&(clearInterval(this.intervalId),this.intervalId=null)},e.prototype.send=function(e){return CS(this,void 0,void 0,(function(){var t,r,n,s=this;return NS(this,(function(o){switch(o.label){case 0:t=e.map((function(e){return{id:++s.requestId,telemetryType:e.messageType.toString(),telemetryData:e}})),o.label=1;case 1:return o.trys.push([1,3,,4]),[4,fetch(this.url,{method:"POST",body:JSON.stringify(t)})];case 2:return 201!==(r=o.sent()).status?(console.error("Error sending messages to telemetry service: ",r.status,r.statusText,r.json),[2,!1]):[2,!0];case 3:return n=o.sent(),console.error("Error sending messages to telemetry service: ",n),console.error("Failed trying to send the following messages: ",t),[2,!1];case 4:return[2]}}))}))},e}(),PS=function(e){return t=void 0,r=void 0,s=function(){var t,r,n;return function(e,t){var r,n,s,o,i={label:0,sent:function(){if(1&s[0])throw s[1];return s[1]},trys:[],ops:[]};return o={next:a(0),throw:a(1),return:a(2)},"function"==typeof Symbol&&(o[Symbol.iterator]=function(){return this}),o;function a(a){return function(c){return function(a){if(r)throw new TypeError("Generator is already executing.");for(;o&&(o=0,a[0]&&(i=0)),i;)try{if(r=1,n&&(s=2&a[0]?n.return:a[0]?n.throw||((s=n.return)&&s.call(n),0):n.next)&&!(s=s.call(n,a[1])).done)return s;switch(n=0,s&&(a=[2&a[0],s.value]),a[0]){case 0:case 1:s=a;break;case 4:return i.label++,{value:a[1],done:!1};case 5:i.label++,n=a[1],a=[0];continue;case 7:a=i.ops.pop(),i.trys.pop();continue;default:if(!((s=(s=i.trys).length>0&&s[s.length-1])||6!==a[0]&&2!==a[0])){i=0;continue}if(3===a[0]&&(!s||a[1]>s[0]&&a[1]0&&s[s.length-1])||6!==a[0]&&2!==a[0])){i=0;continue}if(3===a[0]&&(!s||a[1]>s[0]&&a[1]0&&(e.push([{messageType:RS.LIGHT_PUSH_FILTER,timestamp:Math.floor((new Date).getTime()/1e3),peerIdSender:r,peerIdReporter:r,sequenceHash:i,sequenceTotal:a,sequenceIndex:c,contentTopic:LS,pubsubTopic:yn(LS)}]),d=document.createElement("div"),p=document.getElementById("messagesSent"),d.textContent="Message: ".concat(i," ").concat(c," of ").concat(a),p.insertBefore(d,p.firstChild),p.insertBefore(document.createElement("br"),p.firstChild),document.dispatchEvent(MS),c++),h.failures.length>0&&e.push(h.failures.map((function(e){var t;return{messageType:RS.LIGHT_PUSH_ERROR,timestamp:Math.floor((new Date).getTime()/1e3),peerId:r,peerIdRemote:null===(t=e.peerId)||void 0===t?void 0:t.toString(),errorMessage:e.error.toString(),contentTopic:LS}}))),c} Promisified function\r\n */\r\nfunction asPromise(fn, ctx/*, varargs */) {\r\n var params = new Array(arguments.length - 1),\r\n offset = 0,\r\n index = 2,\r\n pending = true;\r\n while (index < arguments.length)\r\n params[offset++] = arguments[index++];\r\n return new Promise(function executor(resolve, reject) {\r\n params[offset] = function callback(err/*, varargs */) {\r\n if (pending) {\r\n pending = false;\r\n if (err)\r\n reject(err);\r\n else {\r\n var params = new Array(arguments.length - 1),\r\n offset = 0;\r\n while (offset < params.length)\r\n params[offset++] = arguments[offset];\r\n resolve.apply(null, params);\r\n }\r\n }\r\n };\r\n try {\r\n fn.apply(ctx || null, params);\r\n } catch (err) {\r\n if (pending) {\r\n pending = false;\r\n reject(err);\r\n }\r\n }\r\n });\r\n}\r\n","\"use strict\";\r\n\r\n/**\r\n * A minimal base64 implementation for number arrays.\r\n * @memberof util\r\n * @namespace\r\n */\r\nvar base64 = exports;\r\n\r\n/**\r\n * Calculates the byte length of a base64 encoded string.\r\n * @param {string} string Base64 encoded string\r\n * @returns {number} Byte length\r\n */\r\nbase64.length = function length(string) {\r\n var p = string.length;\r\n if (!p)\r\n return 0;\r\n var n = 0;\r\n while (--p % 4 > 1 && string.charAt(p) === \"=\")\r\n ++n;\r\n return Math.ceil(string.length * 3) / 4 - n;\r\n};\r\n\r\n// Base64 encoding table\r\nvar b64 = new Array(64);\r\n\r\n// Base64 decoding table\r\nvar s64 = new Array(123);\r\n\r\n// 65..90, 97..122, 48..57, 43, 47\r\nfor (var i = 0; i < 64;)\r\n s64[b64[i] = i < 26 ? i + 65 : i < 52 ? i + 71 : i < 62 ? i - 4 : i - 59 | 43] = i++;\r\n\r\n/**\r\n * Encodes a buffer to a base64 encoded string.\r\n * @param {Uint8Array} buffer Source buffer\r\n * @param {number} start Source start\r\n * @param {number} end Source end\r\n * @returns {string} Base64 encoded string\r\n */\r\nbase64.encode = function encode(buffer, start, end) {\r\n var parts = null,\r\n chunk = [];\r\n var i = 0, // output index\r\n j = 0, // goto index\r\n t; // temporary\r\n while (start < end) {\r\n var b = buffer[start++];\r\n switch (j) {\r\n case 0:\r\n chunk[i++] = b64[b >> 2];\r\n t = (b & 3) << 4;\r\n j = 1;\r\n break;\r\n case 1:\r\n chunk[i++] = b64[t | b >> 4];\r\n t = (b & 15) << 2;\r\n j = 2;\r\n break;\r\n case 2:\r\n chunk[i++] = b64[t | b >> 6];\r\n chunk[i++] = b64[b & 63];\r\n j = 0;\r\n break;\r\n }\r\n if (i > 8191) {\r\n (parts || (parts = [])).push(String.fromCharCode.apply(String, chunk));\r\n i = 0;\r\n }\r\n }\r\n if (j) {\r\n chunk[i++] = b64[t];\r\n chunk[i++] = 61;\r\n if (j === 1)\r\n chunk[i++] = 61;\r\n }\r\n if (parts) {\r\n if (i)\r\n parts.push(String.fromCharCode.apply(String, chunk.slice(0, i)));\r\n return parts.join(\"\");\r\n }\r\n return String.fromCharCode.apply(String, chunk.slice(0, i));\r\n};\r\n\r\nvar invalidEncoding = \"invalid encoding\";\r\n\r\n/**\r\n * Decodes a base64 encoded string to a buffer.\r\n * @param {string} string Source string\r\n * @param {Uint8Array} buffer Destination buffer\r\n * @param {number} offset Destination offset\r\n * @returns {number} Number of bytes written\r\n * @throws {Error} If encoding is invalid\r\n */\r\nbase64.decode = function decode(string, buffer, offset) {\r\n var start = offset;\r\n var j = 0, // goto index\r\n t; // temporary\r\n for (var i = 0; i < string.length;) {\r\n var c = string.charCodeAt(i++);\r\n if (c === 61 && j > 1)\r\n break;\r\n if ((c = s64[c]) === undefined)\r\n throw Error(invalidEncoding);\r\n switch (j) {\r\n case 0:\r\n t = c;\r\n j = 1;\r\n break;\r\n case 1:\r\n buffer[offset++] = t << 2 | (c & 48) >> 4;\r\n t = c;\r\n j = 2;\r\n break;\r\n case 2:\r\n buffer[offset++] = (t & 15) << 4 | (c & 60) >> 2;\r\n t = c;\r\n j = 3;\r\n break;\r\n case 3:\r\n buffer[offset++] = (t & 3) << 6 | c;\r\n j = 0;\r\n break;\r\n }\r\n }\r\n if (j === 1)\r\n throw Error(invalidEncoding);\r\n return offset - start;\r\n};\r\n\r\n/**\r\n * Tests if the specified string appears to be base64 encoded.\r\n * @param {string} string String to test\r\n * @returns {boolean} `true` if probably base64 encoded, otherwise false\r\n */\r\nbase64.test = function test(string) {\r\n return /^(?:[A-Za-z0-9+/]{4})*(?:[A-Za-z0-9+/]{2}==|[A-Za-z0-9+/]{3}=)?$/.test(string);\r\n};\r\n","\"use strict\";\r\nmodule.exports = codegen;\r\n\r\n/**\r\n * Begins generating a function.\r\n * @memberof util\r\n * @param {string[]} functionParams Function parameter names\r\n * @param {string} [functionName] Function name if not anonymous\r\n * @returns {Codegen} Appender that appends code to the function's body\r\n */\r\nfunction codegen(functionParams, functionName) {\r\n\r\n /* istanbul ignore if */\r\n if (typeof functionParams === \"string\") {\r\n functionName = functionParams;\r\n functionParams = undefined;\r\n }\r\n\r\n var body = [];\r\n\r\n /**\r\n * Appends code to the function's body or finishes generation.\r\n * @typedef Codegen\r\n * @type {function}\r\n * @param {string|Object.} [formatStringOrScope] Format string or, to finish the function, an object of additional scope variables, if any\r\n * @param {...*} [formatParams] Format parameters\r\n * @returns {Codegen|Function} Itself or the generated function if finished\r\n * @throws {Error} If format parameter counts do not match\r\n */\r\n\r\n function Codegen(formatStringOrScope) {\r\n // note that explicit array handling below makes this ~50% faster\r\n\r\n // finish the function\r\n if (typeof formatStringOrScope !== \"string\") {\r\n var source = toString();\r\n if (codegen.verbose)\r\n console.log(\"codegen: \" + source); // eslint-disable-line no-console\r\n source = \"return \" + source;\r\n if (formatStringOrScope) {\r\n var scopeKeys = Object.keys(formatStringOrScope),\r\n scopeParams = new Array(scopeKeys.length + 1),\r\n scopeValues = new Array(scopeKeys.length),\r\n scopeOffset = 0;\r\n while (scopeOffset < scopeKeys.length) {\r\n scopeParams[scopeOffset] = scopeKeys[scopeOffset];\r\n scopeValues[scopeOffset] = formatStringOrScope[scopeKeys[scopeOffset++]];\r\n }\r\n scopeParams[scopeOffset] = source;\r\n return Function.apply(null, scopeParams).apply(null, scopeValues); // eslint-disable-line no-new-func\r\n }\r\n return Function(source)(); // eslint-disable-line no-new-func\r\n }\r\n\r\n // otherwise append to body\r\n var formatParams = new Array(arguments.length - 1),\r\n formatOffset = 0;\r\n while (formatOffset < formatParams.length)\r\n formatParams[formatOffset] = arguments[++formatOffset];\r\n formatOffset = 0;\r\n formatStringOrScope = formatStringOrScope.replace(/%([%dfijs])/g, function replace($0, $1) {\r\n var value = formatParams[formatOffset++];\r\n switch ($1) {\r\n case \"d\": case \"f\": return String(Number(value));\r\n case \"i\": return String(Math.floor(value));\r\n case \"j\": return JSON.stringify(value);\r\n case \"s\": return String(value);\r\n }\r\n return \"%\";\r\n });\r\n if (formatOffset !== formatParams.length)\r\n throw Error(\"parameter count mismatch\");\r\n body.push(formatStringOrScope);\r\n return Codegen;\r\n }\r\n\r\n function toString(functionNameOverride) {\r\n return \"function \" + (functionNameOverride || functionName || \"\") + \"(\" + (functionParams && functionParams.join(\",\") || \"\") + \"){\\n \" + body.join(\"\\n \") + \"\\n}\";\r\n }\r\n\r\n Codegen.toString = toString;\r\n return Codegen;\r\n}\r\n\r\n/**\r\n * Begins generating a function.\r\n * @memberof util\r\n * @function codegen\r\n * @param {string} [functionName] Function name if not anonymous\r\n * @returns {Codegen} Appender that appends code to the function's body\r\n * @variation 2\r\n */\r\n\r\n/**\r\n * When set to `true`, codegen will log generated code to console. Useful for debugging.\r\n * @name util.codegen.verbose\r\n * @type {boolean}\r\n */\r\ncodegen.verbose = false;\r\n","\"use strict\";\r\nmodule.exports = EventEmitter;\r\n\r\n/**\r\n * Constructs a new event emitter instance.\r\n * @classdesc A minimal event emitter.\r\n * @memberof util\r\n * @constructor\r\n */\r\nfunction EventEmitter() {\r\n\r\n /**\r\n * Registered listeners.\r\n * @type {Object.}\r\n * @private\r\n */\r\n this._listeners = {};\r\n}\r\n\r\n/**\r\n * Registers an event listener.\r\n * @param {string} evt Event name\r\n * @param {function} fn Listener\r\n * @param {*} [ctx] Listener context\r\n * @returns {util.EventEmitter} `this`\r\n */\r\nEventEmitter.prototype.on = function on(evt, fn, ctx) {\r\n (this._listeners[evt] || (this._listeners[evt] = [])).push({\r\n fn : fn,\r\n ctx : ctx || this\r\n });\r\n return this;\r\n};\r\n\r\n/**\r\n * Removes an event listener or any matching listeners if arguments are omitted.\r\n * @param {string} [evt] Event name. Removes all listeners if omitted.\r\n * @param {function} [fn] Listener to remove. Removes all listeners of `evt` if omitted.\r\n * @returns {util.EventEmitter} `this`\r\n */\r\nEventEmitter.prototype.off = function off(evt, fn) {\r\n if (evt === undefined)\r\n this._listeners = {};\r\n else {\r\n if (fn === undefined)\r\n this._listeners[evt] = [];\r\n else {\r\n var listeners = this._listeners[evt];\r\n for (var i = 0; i < listeners.length;)\r\n if (listeners[i].fn === fn)\r\n listeners.splice(i, 1);\r\n else\r\n ++i;\r\n }\r\n }\r\n return this;\r\n};\r\n\r\n/**\r\n * Emits an event by calling its listeners with the specified arguments.\r\n * @param {string} evt Event name\r\n * @param {...*} args Arguments\r\n * @returns {util.EventEmitter} `this`\r\n */\r\nEventEmitter.prototype.emit = function emit(evt) {\r\n var listeners = this._listeners[evt];\r\n if (listeners) {\r\n var args = [],\r\n i = 1;\r\n for (; i < arguments.length;)\r\n args.push(arguments[i++]);\r\n for (i = 0; i < listeners.length;)\r\n listeners[i].fn.apply(listeners[i++].ctx, args);\r\n }\r\n return this;\r\n};\r\n","\"use strict\";\r\nmodule.exports = fetch;\r\n\r\nvar asPromise = require(\"@protobufjs/aspromise\"),\r\n inquire = require(\"@protobufjs/inquire\");\r\n\r\nvar fs = inquire(\"fs\");\r\n\r\n/**\r\n * Node-style callback as used by {@link util.fetch}.\r\n * @typedef FetchCallback\r\n * @type {function}\r\n * @param {?Error} error Error, if any, otherwise `null`\r\n * @param {string} [contents] File contents, if there hasn't been an error\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Options as used by {@link util.fetch}.\r\n * @typedef FetchOptions\r\n * @type {Object}\r\n * @property {boolean} [binary=false] Whether expecting a binary response\r\n * @property {boolean} [xhr=false] If `true`, forces the use of XMLHttpRequest\r\n */\r\n\r\n/**\r\n * Fetches the contents of a file.\r\n * @memberof util\r\n * @param {string} filename File path or url\r\n * @param {FetchOptions} options Fetch options\r\n * @param {FetchCallback} callback Callback function\r\n * @returns {undefined}\r\n */\r\nfunction fetch(filename, options, callback) {\r\n if (typeof options === \"function\") {\r\n callback = options;\r\n options = {};\r\n } else if (!options)\r\n options = {};\r\n\r\n if (!callback)\r\n return asPromise(fetch, this, filename, options); // eslint-disable-line no-invalid-this\r\n\r\n // if a node-like filesystem is present, try it first but fall back to XHR if nothing is found.\r\n if (!options.xhr && fs && fs.readFile)\r\n return fs.readFile(filename, function fetchReadFileCallback(err, contents) {\r\n return err && typeof XMLHttpRequest !== \"undefined\"\r\n ? fetch.xhr(filename, options, callback)\r\n : err\r\n ? callback(err)\r\n : callback(null, options.binary ? contents : contents.toString(\"utf8\"));\r\n });\r\n\r\n // use the XHR version otherwise.\r\n return fetch.xhr(filename, options, callback);\r\n}\r\n\r\n/**\r\n * Fetches the contents of a file.\r\n * @name util.fetch\r\n * @function\r\n * @param {string} path File path or url\r\n * @param {FetchCallback} callback Callback function\r\n * @returns {undefined}\r\n * @variation 2\r\n */\r\n\r\n/**\r\n * Fetches the contents of a file.\r\n * @name util.fetch\r\n * @function\r\n * @param {string} path File path or url\r\n * @param {FetchOptions} [options] Fetch options\r\n * @returns {Promise} Promise\r\n * @variation 3\r\n */\r\n\r\n/**/\r\nfetch.xhr = function fetch_xhr(filename, options, callback) {\r\n var xhr = new XMLHttpRequest();\r\n xhr.onreadystatechange /* works everywhere */ = function fetchOnReadyStateChange() {\r\n\r\n if (xhr.readyState !== 4)\r\n return undefined;\r\n\r\n // local cors security errors return status 0 / empty string, too. afaik this cannot be\r\n // reliably distinguished from an actually empty file for security reasons. feel free\r\n // to send a pull request if you are aware of a solution.\r\n if (xhr.status !== 0 && xhr.status !== 200)\r\n return callback(Error(\"status \" + xhr.status));\r\n\r\n // if binary data is expected, make sure that some sort of array is returned, even if\r\n // ArrayBuffers are not supported. the binary string fallback, however, is unsafe.\r\n if (options.binary) {\r\n var buffer = xhr.response;\r\n if (!buffer) {\r\n buffer = [];\r\n for (var i = 0; i < xhr.responseText.length; ++i)\r\n buffer.push(xhr.responseText.charCodeAt(i) & 255);\r\n }\r\n return callback(null, typeof Uint8Array !== \"undefined\" ? new Uint8Array(buffer) : buffer);\r\n }\r\n return callback(null, xhr.responseText);\r\n };\r\n\r\n if (options.binary) {\r\n // ref: https://developer.mozilla.org/en-US/docs/Web/API/XMLHttpRequest/Sending_and_Receiving_Binary_Data#Receiving_binary_data_in_older_browsers\r\n if (\"overrideMimeType\" in xhr)\r\n xhr.overrideMimeType(\"text/plain; charset=x-user-defined\");\r\n xhr.responseType = \"arraybuffer\";\r\n }\r\n\r\n xhr.open(\"GET\", filename);\r\n xhr.send();\r\n};\r\n","\"use strict\";\r\n\r\nmodule.exports = factory(factory);\r\n\r\n/**\r\n * Reads / writes floats / doubles from / to buffers.\r\n * @name util.float\r\n * @namespace\r\n */\r\n\r\n/**\r\n * Writes a 32 bit float to a buffer using little endian byte order.\r\n * @name util.float.writeFloatLE\r\n * @function\r\n * @param {number} val Value to write\r\n * @param {Uint8Array} buf Target buffer\r\n * @param {number} pos Target buffer offset\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Writes a 32 bit float to a buffer using big endian byte order.\r\n * @name util.float.writeFloatBE\r\n * @function\r\n * @param {number} val Value to write\r\n * @param {Uint8Array} buf Target buffer\r\n * @param {number} pos Target buffer offset\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Reads a 32 bit float from a buffer using little endian byte order.\r\n * @name util.float.readFloatLE\r\n * @function\r\n * @param {Uint8Array} buf Source buffer\r\n * @param {number} pos Source buffer offset\r\n * @returns {number} Value read\r\n */\r\n\r\n/**\r\n * Reads a 32 bit float from a buffer using big endian byte order.\r\n * @name util.float.readFloatBE\r\n * @function\r\n * @param {Uint8Array} buf Source buffer\r\n * @param {number} pos Source buffer offset\r\n * @returns {number} Value read\r\n */\r\n\r\n/**\r\n * Writes a 64 bit double to a buffer using little endian byte order.\r\n * @name util.float.writeDoubleLE\r\n * @function\r\n * @param {number} val Value to write\r\n * @param {Uint8Array} buf Target buffer\r\n * @param {number} pos Target buffer offset\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Writes a 64 bit double to a buffer using big endian byte order.\r\n * @name util.float.writeDoubleBE\r\n * @function\r\n * @param {number} val Value to write\r\n * @param {Uint8Array} buf Target buffer\r\n * @param {number} pos Target buffer offset\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Reads a 64 bit double from a buffer using little endian byte order.\r\n * @name util.float.readDoubleLE\r\n * @function\r\n * @param {Uint8Array} buf Source buffer\r\n * @param {number} pos Source buffer offset\r\n * @returns {number} Value read\r\n */\r\n\r\n/**\r\n * Reads a 64 bit double from a buffer using big endian byte order.\r\n * @name util.float.readDoubleBE\r\n * @function\r\n * @param {Uint8Array} buf Source buffer\r\n * @param {number} pos Source buffer offset\r\n * @returns {number} Value read\r\n */\r\n\r\n// Factory function for the purpose of node-based testing in modified global environments\r\nfunction factory(exports) {\r\n\r\n // float: typed array\r\n if (typeof Float32Array !== \"undefined\") (function() {\r\n\r\n var f32 = new Float32Array([ -0 ]),\r\n f8b = new Uint8Array(f32.buffer),\r\n le = f8b[3] === 128;\r\n\r\n function writeFloat_f32_cpy(val, buf, pos) {\r\n f32[0] = val;\r\n buf[pos ] = f8b[0];\r\n buf[pos + 1] = f8b[1];\r\n buf[pos + 2] = f8b[2];\r\n buf[pos + 3] = f8b[3];\r\n }\r\n\r\n function writeFloat_f32_rev(val, buf, pos) {\r\n f32[0] = val;\r\n buf[pos ] = f8b[3];\r\n buf[pos + 1] = f8b[2];\r\n buf[pos + 2] = f8b[1];\r\n buf[pos + 3] = f8b[0];\r\n }\r\n\r\n /* istanbul ignore next */\r\n exports.writeFloatLE = le ? writeFloat_f32_cpy : writeFloat_f32_rev;\r\n /* istanbul ignore next */\r\n exports.writeFloatBE = le ? writeFloat_f32_rev : writeFloat_f32_cpy;\r\n\r\n function readFloat_f32_cpy(buf, pos) {\r\n f8b[0] = buf[pos ];\r\n f8b[1] = buf[pos + 1];\r\n f8b[2] = buf[pos + 2];\r\n f8b[3] = buf[pos + 3];\r\n return f32[0];\r\n }\r\n\r\n function readFloat_f32_rev(buf, pos) {\r\n f8b[3] = buf[pos ];\r\n f8b[2] = buf[pos + 1];\r\n f8b[1] = buf[pos + 2];\r\n f8b[0] = buf[pos + 3];\r\n return f32[0];\r\n }\r\n\r\n /* istanbul ignore next */\r\n exports.readFloatLE = le ? readFloat_f32_cpy : readFloat_f32_rev;\r\n /* istanbul ignore next */\r\n exports.readFloatBE = le ? readFloat_f32_rev : readFloat_f32_cpy;\r\n\r\n // float: ieee754\r\n })(); else (function() {\r\n\r\n function writeFloat_ieee754(writeUint, val, buf, pos) {\r\n var sign = val < 0 ? 1 : 0;\r\n if (sign)\r\n val = -val;\r\n if (val === 0)\r\n writeUint(1 / val > 0 ? /* positive */ 0 : /* negative 0 */ 2147483648, buf, pos);\r\n else if (isNaN(val))\r\n writeUint(2143289344, buf, pos);\r\n else if (val > 3.4028234663852886e+38) // +-Infinity\r\n writeUint((sign << 31 | 2139095040) >>> 0, buf, pos);\r\n else if (val < 1.1754943508222875e-38) // denormal\r\n writeUint((sign << 31 | Math.round(val / 1.401298464324817e-45)) >>> 0, buf, pos);\r\n else {\r\n var exponent = Math.floor(Math.log(val) / Math.LN2),\r\n mantissa = Math.round(val * Math.pow(2, -exponent) * 8388608) & 8388607;\r\n writeUint((sign << 31 | exponent + 127 << 23 | mantissa) >>> 0, buf, pos);\r\n }\r\n }\r\n\r\n exports.writeFloatLE = writeFloat_ieee754.bind(null, writeUintLE);\r\n exports.writeFloatBE = writeFloat_ieee754.bind(null, writeUintBE);\r\n\r\n function readFloat_ieee754(readUint, buf, pos) {\r\n var uint = readUint(buf, pos),\r\n sign = (uint >> 31) * 2 + 1,\r\n exponent = uint >>> 23 & 255,\r\n mantissa = uint & 8388607;\r\n return exponent === 255\r\n ? mantissa\r\n ? NaN\r\n : sign * Infinity\r\n : exponent === 0 // denormal\r\n ? sign * 1.401298464324817e-45 * mantissa\r\n : sign * Math.pow(2, exponent - 150) * (mantissa + 8388608);\r\n }\r\n\r\n exports.readFloatLE = readFloat_ieee754.bind(null, readUintLE);\r\n exports.readFloatBE = readFloat_ieee754.bind(null, readUintBE);\r\n\r\n })();\r\n\r\n // double: typed array\r\n if (typeof Float64Array !== \"undefined\") (function() {\r\n\r\n var f64 = new Float64Array([-0]),\r\n f8b = new Uint8Array(f64.buffer),\r\n le = f8b[7] === 128;\r\n\r\n function writeDouble_f64_cpy(val, buf, pos) {\r\n f64[0] = val;\r\n buf[pos ] = f8b[0];\r\n buf[pos + 1] = f8b[1];\r\n buf[pos + 2] = f8b[2];\r\n buf[pos + 3] = f8b[3];\r\n buf[pos + 4] = f8b[4];\r\n buf[pos + 5] = f8b[5];\r\n buf[pos + 6] = f8b[6];\r\n buf[pos + 7] = f8b[7];\r\n }\r\n\r\n function writeDouble_f64_rev(val, buf, pos) {\r\n f64[0] = val;\r\n buf[pos ] = f8b[7];\r\n buf[pos + 1] = f8b[6];\r\n buf[pos + 2] = f8b[5];\r\n buf[pos + 3] = f8b[4];\r\n buf[pos + 4] = f8b[3];\r\n buf[pos + 5] = f8b[2];\r\n buf[pos + 6] = f8b[1];\r\n buf[pos + 7] = f8b[0];\r\n }\r\n\r\n /* istanbul ignore next */\r\n exports.writeDoubleLE = le ? writeDouble_f64_cpy : writeDouble_f64_rev;\r\n /* istanbul ignore next */\r\n exports.writeDoubleBE = le ? writeDouble_f64_rev : writeDouble_f64_cpy;\r\n\r\n function readDouble_f64_cpy(buf, pos) {\r\n f8b[0] = buf[pos ];\r\n f8b[1] = buf[pos + 1];\r\n f8b[2] = buf[pos + 2];\r\n f8b[3] = buf[pos + 3];\r\n f8b[4] = buf[pos + 4];\r\n f8b[5] = buf[pos + 5];\r\n f8b[6] = buf[pos + 6];\r\n f8b[7] = buf[pos + 7];\r\n return f64[0];\r\n }\r\n\r\n function readDouble_f64_rev(buf, pos) {\r\n f8b[7] = buf[pos ];\r\n f8b[6] = buf[pos + 1];\r\n f8b[5] = buf[pos + 2];\r\n f8b[4] = buf[pos + 3];\r\n f8b[3] = buf[pos + 4];\r\n f8b[2] = buf[pos + 5];\r\n f8b[1] = buf[pos + 6];\r\n f8b[0] = buf[pos + 7];\r\n return f64[0];\r\n }\r\n\r\n /* istanbul ignore next */\r\n exports.readDoubleLE = le ? readDouble_f64_cpy : readDouble_f64_rev;\r\n /* istanbul ignore next */\r\n exports.readDoubleBE = le ? readDouble_f64_rev : readDouble_f64_cpy;\r\n\r\n // double: ieee754\r\n })(); else (function() {\r\n\r\n function writeDouble_ieee754(writeUint, off0, off1, val, buf, pos) {\r\n var sign = val < 0 ? 1 : 0;\r\n if (sign)\r\n val = -val;\r\n if (val === 0) {\r\n writeUint(0, buf, pos + off0);\r\n writeUint(1 / val > 0 ? /* positive */ 0 : /* negative 0 */ 2147483648, buf, pos + off1);\r\n } else if (isNaN(val)) {\r\n writeUint(0, buf, pos + off0);\r\n writeUint(2146959360, buf, pos + off1);\r\n } else if (val > 1.7976931348623157e+308) { // +-Infinity\r\n writeUint(0, buf, pos + off0);\r\n writeUint((sign << 31 | 2146435072) >>> 0, buf, pos + off1);\r\n } else {\r\n var mantissa;\r\n if (val < 2.2250738585072014e-308) { // denormal\r\n mantissa = val / 5e-324;\r\n writeUint(mantissa >>> 0, buf, pos + off0);\r\n writeUint((sign << 31 | mantissa / 4294967296) >>> 0, buf, pos + off1);\r\n } else {\r\n var exponent = Math.floor(Math.log(val) / Math.LN2);\r\n if (exponent === 1024)\r\n exponent = 1023;\r\n mantissa = val * Math.pow(2, -exponent);\r\n writeUint(mantissa * 4503599627370496 >>> 0, buf, pos + off0);\r\n writeUint((sign << 31 | exponent + 1023 << 20 | mantissa * 1048576 & 1048575) >>> 0, buf, pos + off1);\r\n }\r\n }\r\n }\r\n\r\n exports.writeDoubleLE = writeDouble_ieee754.bind(null, writeUintLE, 0, 4);\r\n exports.writeDoubleBE = writeDouble_ieee754.bind(null, writeUintBE, 4, 0);\r\n\r\n function readDouble_ieee754(readUint, off0, off1, buf, pos) {\r\n var lo = readUint(buf, pos + off0),\r\n hi = readUint(buf, pos + off1);\r\n var sign = (hi >> 31) * 2 + 1,\r\n exponent = hi >>> 20 & 2047,\r\n mantissa = 4294967296 * (hi & 1048575) + lo;\r\n return exponent === 2047\r\n ? mantissa\r\n ? NaN\r\n : sign * Infinity\r\n : exponent === 0 // denormal\r\n ? sign * 5e-324 * mantissa\r\n : sign * Math.pow(2, exponent - 1075) * (mantissa + 4503599627370496);\r\n }\r\n\r\n exports.readDoubleLE = readDouble_ieee754.bind(null, readUintLE, 0, 4);\r\n exports.readDoubleBE = readDouble_ieee754.bind(null, readUintBE, 4, 0);\r\n\r\n })();\r\n\r\n return exports;\r\n}\r\n\r\n// uint helpers\r\n\r\nfunction writeUintLE(val, buf, pos) {\r\n buf[pos ] = val & 255;\r\n buf[pos + 1] = val >>> 8 & 255;\r\n buf[pos + 2] = val >>> 16 & 255;\r\n buf[pos + 3] = val >>> 24;\r\n}\r\n\r\nfunction writeUintBE(val, buf, pos) {\r\n buf[pos ] = val >>> 24;\r\n buf[pos + 1] = val >>> 16 & 255;\r\n buf[pos + 2] = val >>> 8 & 255;\r\n buf[pos + 3] = val & 255;\r\n}\r\n\r\nfunction readUintLE(buf, pos) {\r\n return (buf[pos ]\r\n | buf[pos + 1] << 8\r\n | buf[pos + 2] << 16\r\n | buf[pos + 3] << 24) >>> 0;\r\n}\r\n\r\nfunction readUintBE(buf, pos) {\r\n return (buf[pos ] << 24\r\n | buf[pos + 1] << 16\r\n | buf[pos + 2] << 8\r\n | buf[pos + 3]) >>> 0;\r\n}\r\n","\"use strict\";\r\nmodule.exports = inquire;\r\n\r\n/**\r\n * Requires a module only if available.\r\n * @memberof util\r\n * @param {string} moduleName Module to require\r\n * @returns {?Object} Required module if available and not empty, otherwise `null`\r\n */\r\nfunction inquire(moduleName) {\r\n try {\r\n var mod = eval(\"quire\".replace(/^/,\"re\"))(moduleName); // eslint-disable-line no-eval\r\n if (mod && (mod.length || Object.keys(mod).length))\r\n return mod;\r\n } catch (e) {} // eslint-disable-line no-empty\r\n return null;\r\n}\r\n","\"use strict\";\r\n\r\n/**\r\n * A minimal path module to resolve Unix, Windows and URL paths alike.\r\n * @memberof util\r\n * @namespace\r\n */\r\nvar path = exports;\r\n\r\nvar isAbsolute =\r\n/**\r\n * Tests if the specified path is absolute.\r\n * @param {string} path Path to test\r\n * @returns {boolean} `true` if path is absolute\r\n */\r\npath.isAbsolute = function isAbsolute(path) {\r\n return /^(?:\\/|\\w+:)/.test(path);\r\n};\r\n\r\nvar normalize =\r\n/**\r\n * Normalizes the specified path.\r\n * @param {string} path Path to normalize\r\n * @returns {string} Normalized path\r\n */\r\npath.normalize = function normalize(path) {\r\n path = path.replace(/\\\\/g, \"/\")\r\n .replace(/\\/{2,}/g, \"/\");\r\n var parts = path.split(\"/\"),\r\n absolute = isAbsolute(path),\r\n prefix = \"\";\r\n if (absolute)\r\n prefix = parts.shift() + \"/\";\r\n for (var i = 0; i < parts.length;) {\r\n if (parts[i] === \"..\") {\r\n if (i > 0 && parts[i - 1] !== \"..\")\r\n parts.splice(--i, 2);\r\n else if (absolute)\r\n parts.splice(i, 1);\r\n else\r\n ++i;\r\n } else if (parts[i] === \".\")\r\n parts.splice(i, 1);\r\n else\r\n ++i;\r\n }\r\n return prefix + parts.join(\"/\");\r\n};\r\n\r\n/**\r\n * Resolves the specified include path against the specified origin path.\r\n * @param {string} originPath Path to the origin file\r\n * @param {string} includePath Include path relative to origin path\r\n * @param {boolean} [alreadyNormalized=false] `true` if both paths are already known to be normalized\r\n * @returns {string} Path to the include file\r\n */\r\npath.resolve = function resolve(originPath, includePath, alreadyNormalized) {\r\n if (!alreadyNormalized)\r\n includePath = normalize(includePath);\r\n if (isAbsolute(includePath))\r\n return includePath;\r\n if (!alreadyNormalized)\r\n originPath = normalize(originPath);\r\n return (originPath = originPath.replace(/(?:\\/|^)[^/]+$/, \"\")).length ? normalize(originPath + \"/\" + includePath) : includePath;\r\n};\r\n","\"use strict\";\r\nmodule.exports = pool;\r\n\r\n/**\r\n * An allocator as used by {@link util.pool}.\r\n * @typedef PoolAllocator\r\n * @type {function}\r\n * @param {number} size Buffer size\r\n * @returns {Uint8Array} Buffer\r\n */\r\n\r\n/**\r\n * A slicer as used by {@link util.pool}.\r\n * @typedef PoolSlicer\r\n * @type {function}\r\n * @param {number} start Start offset\r\n * @param {number} end End offset\r\n * @returns {Uint8Array} Buffer slice\r\n * @this {Uint8Array}\r\n */\r\n\r\n/**\r\n * A general purpose buffer pool.\r\n * @memberof util\r\n * @function\r\n * @param {PoolAllocator} alloc Allocator\r\n * @param {PoolSlicer} slice Slicer\r\n * @param {number} [size=8192] Slab size\r\n * @returns {PoolAllocator} Pooled allocator\r\n */\r\nfunction pool(alloc, slice, size) {\r\n var SIZE = size || 8192;\r\n var MAX = SIZE >>> 1;\r\n var slab = null;\r\n var offset = SIZE;\r\n return function pool_alloc(size) {\r\n if (size < 1 || size > MAX)\r\n return alloc(size);\r\n if (offset + size > SIZE) {\r\n slab = alloc(SIZE);\r\n offset = 0;\r\n }\r\n var buf = slice.call(slab, offset, offset += size);\r\n if (offset & 7) // align to 32 bit\r\n offset = (offset | 7) + 1;\r\n return buf;\r\n };\r\n}\r\n","\"use strict\";\r\n\r\n/**\r\n * A minimal UTF8 implementation for number arrays.\r\n * @memberof util\r\n * @namespace\r\n */\r\nvar utf8 = exports;\r\n\r\n/**\r\n * Calculates the UTF8 byte length of a string.\r\n * @param {string} string String\r\n * @returns {number} Byte length\r\n */\r\nutf8.length = function utf8_length(string) {\r\n var len = 0,\r\n c = 0;\r\n for (var i = 0; i < string.length; ++i) {\r\n c = string.charCodeAt(i);\r\n if (c < 128)\r\n len += 1;\r\n else if (c < 2048)\r\n len += 2;\r\n else if ((c & 0xFC00) === 0xD800 && (string.charCodeAt(i + 1) & 0xFC00) === 0xDC00) {\r\n ++i;\r\n len += 4;\r\n } else\r\n len += 3;\r\n }\r\n return len;\r\n};\r\n\r\n/**\r\n * Reads UTF8 bytes as a string.\r\n * @param {Uint8Array} buffer Source buffer\r\n * @param {number} start Source start\r\n * @param {number} end Source end\r\n * @returns {string} String read\r\n */\r\nutf8.read = function utf8_read(buffer, start, end) {\r\n var len = end - start;\r\n if (len < 1)\r\n return \"\";\r\n var parts = null,\r\n chunk = [],\r\n i = 0, // char offset\r\n t; // temporary\r\n while (start < end) {\r\n t = buffer[start++];\r\n if (t < 128)\r\n chunk[i++] = t;\r\n else if (t > 191 && t < 224)\r\n chunk[i++] = (t & 31) << 6 | buffer[start++] & 63;\r\n else if (t > 239 && t < 365) {\r\n t = ((t & 7) << 18 | (buffer[start++] & 63) << 12 | (buffer[start++] & 63) << 6 | buffer[start++] & 63) - 0x10000;\r\n chunk[i++] = 0xD800 + (t >> 10);\r\n chunk[i++] = 0xDC00 + (t & 1023);\r\n } else\r\n chunk[i++] = (t & 15) << 12 | (buffer[start++] & 63) << 6 | buffer[start++] & 63;\r\n if (i > 8191) {\r\n (parts || (parts = [])).push(String.fromCharCode.apply(String, chunk));\r\n i = 0;\r\n }\r\n }\r\n if (parts) {\r\n if (i)\r\n parts.push(String.fromCharCode.apply(String, chunk.slice(0, i)));\r\n return parts.join(\"\");\r\n }\r\n return String.fromCharCode.apply(String, chunk.slice(0, i));\r\n};\r\n\r\n/**\r\n * Writes a string as UTF8 bytes.\r\n * @param {string} string Source string\r\n * @param {Uint8Array} buffer Destination buffer\r\n * @param {number} offset Destination offset\r\n * @returns {number} Bytes written\r\n */\r\nutf8.write = function utf8_write(string, buffer, offset) {\r\n var start = offset,\r\n c1, // character 1\r\n c2; // character 2\r\n for (var i = 0; i < string.length; ++i) {\r\n c1 = string.charCodeAt(i);\r\n if (c1 < 128) {\r\n buffer[offset++] = c1;\r\n } else if (c1 < 2048) {\r\n buffer[offset++] = c1 >> 6 | 192;\r\n buffer[offset++] = c1 & 63 | 128;\r\n } else if ((c1 & 0xFC00) === 0xD800 && ((c2 = string.charCodeAt(i + 1)) & 0xFC00) === 0xDC00) {\r\n c1 = 0x10000 + ((c1 & 0x03FF) << 10) + (c2 & 0x03FF);\r\n ++i;\r\n buffer[offset++] = c1 >> 18 | 240;\r\n buffer[offset++] = c1 >> 12 & 63 | 128;\r\n buffer[offset++] = c1 >> 6 & 63 | 128;\r\n buffer[offset++] = c1 & 63 | 128;\r\n } else {\r\n buffer[offset++] = c1 >> 12 | 224;\r\n buffer[offset++] = c1 >> 6 & 63 | 128;\r\n buffer[offset++] = c1 & 63 | 128;\r\n }\r\n }\r\n return offset - start;\r\n};\r\n","/* eslint-env browser */\n\n/**\n * This is the web browser implementation of `debug()`.\n */\n\nexports.formatArgs = formatArgs;\nexports.save = save;\nexports.load = load;\nexports.useColors = useColors;\nexports.storage = localstorage();\nexports.destroy = (() => {\n\tlet warned = false;\n\n\treturn () => {\n\t\tif (!warned) {\n\t\t\twarned = true;\n\t\t\tconsole.warn('Instance method `debug.destroy()` is deprecated and no longer does anything. It will be removed in the next major version of `debug`.');\n\t\t}\n\t};\n})();\n\n/**\n * Colors.\n */\n\nexports.colors = [\n\t'#0000CC',\n\t'#0000FF',\n\t'#0033CC',\n\t'#0033FF',\n\t'#0066CC',\n\t'#0066FF',\n\t'#0099CC',\n\t'#0099FF',\n\t'#00CC00',\n\t'#00CC33',\n\t'#00CC66',\n\t'#00CC99',\n\t'#00CCCC',\n\t'#00CCFF',\n\t'#3300CC',\n\t'#3300FF',\n\t'#3333CC',\n\t'#3333FF',\n\t'#3366CC',\n\t'#3366FF',\n\t'#3399CC',\n\t'#3399FF',\n\t'#33CC00',\n\t'#33CC33',\n\t'#33CC66',\n\t'#33CC99',\n\t'#33CCCC',\n\t'#33CCFF',\n\t'#6600CC',\n\t'#6600FF',\n\t'#6633CC',\n\t'#6633FF',\n\t'#66CC00',\n\t'#66CC33',\n\t'#9900CC',\n\t'#9900FF',\n\t'#9933CC',\n\t'#9933FF',\n\t'#99CC00',\n\t'#99CC33',\n\t'#CC0000',\n\t'#CC0033',\n\t'#CC0066',\n\t'#CC0099',\n\t'#CC00CC',\n\t'#CC00FF',\n\t'#CC3300',\n\t'#CC3333',\n\t'#CC3366',\n\t'#CC3399',\n\t'#CC33CC',\n\t'#CC33FF',\n\t'#CC6600',\n\t'#CC6633',\n\t'#CC9900',\n\t'#CC9933',\n\t'#CCCC00',\n\t'#CCCC33',\n\t'#FF0000',\n\t'#FF0033',\n\t'#FF0066',\n\t'#FF0099',\n\t'#FF00CC',\n\t'#FF00FF',\n\t'#FF3300',\n\t'#FF3333',\n\t'#FF3366',\n\t'#FF3399',\n\t'#FF33CC',\n\t'#FF33FF',\n\t'#FF6600',\n\t'#FF6633',\n\t'#FF9900',\n\t'#FF9933',\n\t'#FFCC00',\n\t'#FFCC33'\n];\n\n/**\n * Currently only WebKit-based Web Inspectors, Firefox >= v31,\n * and the Firebug extension (any Firefox version) are known\n * to support \"%c\" CSS customizations.\n *\n * TODO: add a `localStorage` variable to explicitly enable/disable colors\n */\n\n// eslint-disable-next-line complexity\nfunction useColors() {\n\t// NB: In an Electron preload script, document will be defined but not fully\n\t// initialized. Since we know we're in Chrome, we'll just detect this case\n\t// explicitly\n\tif (typeof window !== 'undefined' && window.process && (window.process.type === 'renderer' || window.process.__nwjs)) {\n\t\treturn true;\n\t}\n\n\t// Internet Explorer and Edge do not support colors.\n\tif (typeof navigator !== 'undefined' && navigator.userAgent && navigator.userAgent.toLowerCase().match(/(edge|trident)\\/(\\d+)/)) {\n\t\treturn false;\n\t}\n\n\t// Is webkit? http://stackoverflow.com/a/16459606/376773\n\t// document is undefined in react-native: https://github.com/facebook/react-native/pull/1632\n\treturn (typeof document !== 'undefined' && document.documentElement && document.documentElement.style && document.documentElement.style.WebkitAppearance) ||\n\t\t// Is firebug? http://stackoverflow.com/a/398120/376773\n\t\t(typeof window !== 'undefined' && window.console && (window.console.firebug || (window.console.exception && window.console.table))) ||\n\t\t// Is firefox >= v31?\n\t\t// https://developer.mozilla.org/en-US/docs/Tools/Web_Console#Styling_messages\n\t\t(typeof navigator !== 'undefined' && navigator.userAgent && navigator.userAgent.toLowerCase().match(/firefox\\/(\\d+)/) && parseInt(RegExp.$1, 10) >= 31) ||\n\t\t// Double check webkit in userAgent just in case we are in a worker\n\t\t(typeof navigator !== 'undefined' && navigator.userAgent && navigator.userAgent.toLowerCase().match(/applewebkit\\/(\\d+)/));\n}\n\n/**\n * Colorize log arguments if enabled.\n *\n * @api public\n */\n\nfunction formatArgs(args) {\n\targs[0] = (this.useColors ? '%c' : '') +\n\t\tthis.namespace +\n\t\t(this.useColors ? ' %c' : ' ') +\n\t\targs[0] +\n\t\t(this.useColors ? '%c ' : ' ') +\n\t\t'+' + module.exports.humanize(this.diff);\n\n\tif (!this.useColors) {\n\t\treturn;\n\t}\n\n\tconst c = 'color: ' + this.color;\n\targs.splice(1, 0, c, 'color: inherit');\n\n\t// The final \"%c\" is somewhat tricky, because there could be other\n\t// arguments passed either before or after the %c, so we need to\n\t// figure out the correct index to insert the CSS into\n\tlet index = 0;\n\tlet lastC = 0;\n\targs[0].replace(/%[a-zA-Z%]/g, match => {\n\t\tif (match === '%%') {\n\t\t\treturn;\n\t\t}\n\t\tindex++;\n\t\tif (match === '%c') {\n\t\t\t// We only are interested in the *last* %c\n\t\t\t// (the user may have provided their own)\n\t\t\tlastC = index;\n\t\t}\n\t});\n\n\targs.splice(lastC, 0, c);\n}\n\n/**\n * Invokes `console.debug()` when available.\n * No-op when `console.debug` is not a \"function\".\n * If `console.debug` is not available, falls back\n * to `console.log`.\n *\n * @api public\n */\nexports.log = console.debug || console.log || (() => {});\n\n/**\n * Save `namespaces`.\n *\n * @param {String} namespaces\n * @api private\n */\nfunction save(namespaces) {\n\ttry {\n\t\tif (namespaces) {\n\t\t\texports.storage.setItem('debug', namespaces);\n\t\t} else {\n\t\t\texports.storage.removeItem('debug');\n\t\t}\n\t} catch (error) {\n\t\t// Swallow\n\t\t// XXX (@Qix-) should we be logging these?\n\t}\n}\n\n/**\n * Load `namespaces`.\n *\n * @return {String} returns the previously persisted debug modes\n * @api private\n */\nfunction load() {\n\tlet r;\n\ttry {\n\t\tr = exports.storage.getItem('debug');\n\t} catch (error) {\n\t\t// Swallow\n\t\t// XXX (@Qix-) should we be logging these?\n\t}\n\n\t// If debug isn't set in LS, and we're in Electron, try to load $DEBUG\n\tif (!r && typeof process !== 'undefined' && 'env' in process) {\n\t\tr = process.env.DEBUG;\n\t}\n\n\treturn r;\n}\n\n/**\n * Localstorage attempts to return the localstorage.\n *\n * This is necessary because safari throws\n * when a user disables cookies/localstorage\n * and you attempt to access it.\n *\n * @return {LocalStorage}\n * @api private\n */\n\nfunction localstorage() {\n\ttry {\n\t\t// TVMLKit (Apple TV JS Runtime) does not have a window object, just localStorage in the global context\n\t\t// The Browser also has localStorage in the global context.\n\t\treturn localStorage;\n\t} catch (error) {\n\t\t// Swallow\n\t\t// XXX (@Qix-) should we be logging these?\n\t}\n}\n\nmodule.exports = require('./common')(exports);\n\nconst {formatters} = module.exports;\n\n/**\n * Map %j to `JSON.stringify()`, since no Web Inspectors do that by default.\n */\n\nformatters.j = function (v) {\n\ttry {\n\t\treturn JSON.stringify(v);\n\t} catch (error) {\n\t\treturn '[UnexpectedJSONParseError]: ' + error.message;\n\t}\n};\n","\n/**\n * This is the common logic for both the Node.js and web browser\n * implementations of `debug()`.\n */\n\nfunction setup(env) {\n\tcreateDebug.debug = createDebug;\n\tcreateDebug.default = createDebug;\n\tcreateDebug.coerce = coerce;\n\tcreateDebug.disable = disable;\n\tcreateDebug.enable = enable;\n\tcreateDebug.enabled = enabled;\n\tcreateDebug.humanize = require('ms');\n\tcreateDebug.destroy = destroy;\n\n\tObject.keys(env).forEach(key => {\n\t\tcreateDebug[key] = env[key];\n\t});\n\n\t/**\n\t* The currently active debug mode names, and names to skip.\n\t*/\n\n\tcreateDebug.names = [];\n\tcreateDebug.skips = [];\n\n\t/**\n\t* Map of special \"%n\" handling functions, for the debug \"format\" argument.\n\t*\n\t* Valid key names are a single, lower or upper-case letter, i.e. \"n\" and \"N\".\n\t*/\n\tcreateDebug.formatters = {};\n\n\t/**\n\t* Selects a color for a debug namespace\n\t* @param {String} namespace The namespace string for the debug instance to be colored\n\t* @return {Number|String} An ANSI color code for the given namespace\n\t* @api private\n\t*/\n\tfunction selectColor(namespace) {\n\t\tlet hash = 0;\n\n\t\tfor (let i = 0; i < namespace.length; i++) {\n\t\t\thash = ((hash << 5) - hash) + namespace.charCodeAt(i);\n\t\t\thash |= 0; // Convert to 32bit integer\n\t\t}\n\n\t\treturn createDebug.colors[Math.abs(hash) % createDebug.colors.length];\n\t}\n\tcreateDebug.selectColor = selectColor;\n\n\t/**\n\t* Create a debugger with the given `namespace`.\n\t*\n\t* @param {String} namespace\n\t* @return {Function}\n\t* @api public\n\t*/\n\tfunction createDebug(namespace) {\n\t\tlet prevTime;\n\t\tlet enableOverride = null;\n\t\tlet namespacesCache;\n\t\tlet enabledCache;\n\n\t\tfunction debug(...args) {\n\t\t\t// Disabled?\n\t\t\tif (!debug.enabled) {\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tconst self = debug;\n\n\t\t\t// Set `diff` timestamp\n\t\t\tconst curr = Number(new Date());\n\t\t\tconst ms = curr - (prevTime || curr);\n\t\t\tself.diff = ms;\n\t\t\tself.prev = prevTime;\n\t\t\tself.curr = curr;\n\t\t\tprevTime = curr;\n\n\t\t\targs[0] = createDebug.coerce(args[0]);\n\n\t\t\tif (typeof args[0] !== 'string') {\n\t\t\t\t// Anything else let's inspect with %O\n\t\t\t\targs.unshift('%O');\n\t\t\t}\n\n\t\t\t// Apply any `formatters` transformations\n\t\t\tlet index = 0;\n\t\t\targs[0] = args[0].replace(/%([a-zA-Z%])/g, (match, format) => {\n\t\t\t\t// If we encounter an escaped % then don't increase the array index\n\t\t\t\tif (match === '%%') {\n\t\t\t\t\treturn '%';\n\t\t\t\t}\n\t\t\t\tindex++;\n\t\t\t\tconst formatter = createDebug.formatters[format];\n\t\t\t\tif (typeof formatter === 'function') {\n\t\t\t\t\tconst val = args[index];\n\t\t\t\t\tmatch = formatter.call(self, val);\n\n\t\t\t\t\t// Now we need to remove `args[index]` since it's inlined in the `format`\n\t\t\t\t\targs.splice(index, 1);\n\t\t\t\t\tindex--;\n\t\t\t\t}\n\t\t\t\treturn match;\n\t\t\t});\n\n\t\t\t// Apply env-specific formatting (colors, etc.)\n\t\t\tcreateDebug.formatArgs.call(self, args);\n\n\t\t\tconst logFn = self.log || createDebug.log;\n\t\t\tlogFn.apply(self, args);\n\t\t}\n\n\t\tdebug.namespace = namespace;\n\t\tdebug.useColors = createDebug.useColors();\n\t\tdebug.color = createDebug.selectColor(namespace);\n\t\tdebug.extend = extend;\n\t\tdebug.destroy = createDebug.destroy; // XXX Temporary. Will be removed in the next major release.\n\n\t\tObject.defineProperty(debug, 'enabled', {\n\t\t\tenumerable: true,\n\t\t\tconfigurable: false,\n\t\t\tget: () => {\n\t\t\t\tif (enableOverride !== null) {\n\t\t\t\t\treturn enableOverride;\n\t\t\t\t}\n\t\t\t\tif (namespacesCache !== createDebug.namespaces) {\n\t\t\t\t\tnamespacesCache = createDebug.namespaces;\n\t\t\t\t\tenabledCache = createDebug.enabled(namespace);\n\t\t\t\t}\n\n\t\t\t\treturn enabledCache;\n\t\t\t},\n\t\t\tset: v => {\n\t\t\t\tenableOverride = v;\n\t\t\t}\n\t\t});\n\n\t\t// Env-specific initialization logic for debug instances\n\t\tif (typeof createDebug.init === 'function') {\n\t\t\tcreateDebug.init(debug);\n\t\t}\n\n\t\treturn debug;\n\t}\n\n\tfunction extend(namespace, delimiter) {\n\t\tconst newDebug = createDebug(this.namespace + (typeof delimiter === 'undefined' ? ':' : delimiter) + namespace);\n\t\tnewDebug.log = this.log;\n\t\treturn newDebug;\n\t}\n\n\t/**\n\t* Enables a debug mode by namespaces. This can include modes\n\t* separated by a colon and wildcards.\n\t*\n\t* @param {String} namespaces\n\t* @api public\n\t*/\n\tfunction enable(namespaces) {\n\t\tcreateDebug.save(namespaces);\n\t\tcreateDebug.namespaces = namespaces;\n\n\t\tcreateDebug.names = [];\n\t\tcreateDebug.skips = [];\n\n\t\tlet i;\n\t\tconst split = (typeof namespaces === 'string' ? namespaces : '').split(/[\\s,]+/);\n\t\tconst len = split.length;\n\n\t\tfor (i = 0; i < len; i++) {\n\t\t\tif (!split[i]) {\n\t\t\t\t// ignore empty strings\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tnamespaces = split[i].replace(/\\*/g, '.*?');\n\n\t\t\tif (namespaces[0] === '-') {\n\t\t\t\tcreateDebug.skips.push(new RegExp('^' + namespaces.slice(1) + '$'));\n\t\t\t} else {\n\t\t\t\tcreateDebug.names.push(new RegExp('^' + namespaces + '$'));\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t* Disable debug output.\n\t*\n\t* @return {String} namespaces\n\t* @api public\n\t*/\n\tfunction disable() {\n\t\tconst namespaces = [\n\t\t\t...createDebug.names.map(toNamespace),\n\t\t\t...createDebug.skips.map(toNamespace).map(namespace => '-' + namespace)\n\t\t].join(',');\n\t\tcreateDebug.enable('');\n\t\treturn namespaces;\n\t}\n\n\t/**\n\t* Returns true if the given mode name is enabled, false otherwise.\n\t*\n\t* @param {String} name\n\t* @return {Boolean}\n\t* @api public\n\t*/\n\tfunction enabled(name) {\n\t\tif (name[name.length - 1] === '*') {\n\t\t\treturn true;\n\t\t}\n\n\t\tlet i;\n\t\tlet len;\n\n\t\tfor (i = 0, len = createDebug.skips.length; i < len; i++) {\n\t\t\tif (createDebug.skips[i].test(name)) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\tfor (i = 0, len = createDebug.names.length; i < len; i++) {\n\t\t\tif (createDebug.names[i].test(name)) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\n\t\treturn false;\n\t}\n\n\t/**\n\t* Convert regexp to namespace\n\t*\n\t* @param {RegExp} regxep\n\t* @return {String} namespace\n\t* @api private\n\t*/\n\tfunction toNamespace(regexp) {\n\t\treturn regexp.toString()\n\t\t\t.substring(2, regexp.toString().length - 2)\n\t\t\t.replace(/\\.\\*\\?$/, '*');\n\t}\n\n\t/**\n\t* Coerce `val`.\n\t*\n\t* @param {Mixed} val\n\t* @return {Mixed}\n\t* @api private\n\t*/\n\tfunction coerce(val) {\n\t\tif (val instanceof Error) {\n\t\t\treturn val.stack || val.message;\n\t\t}\n\t\treturn val;\n\t}\n\n\t/**\n\t* XXX DO NOT USE. This is a temporary stub function.\n\t* XXX It WILL be removed in the next major release.\n\t*/\n\tfunction destroy() {\n\t\tconsole.warn('Instance method `debug.destroy()` is deprecated and no longer does anything. It will be removed in the next major version of `debug`.');\n\t}\n\n\tcreateDebug.enable(createDebug.load());\n\n\treturn createDebug;\n}\n\nmodule.exports = setup;\n","'use strict';\n\n/**\n * @typedef {{ [key: string]: any }} Extensions\n * @typedef {Error} Err\n * @property {string} message\n */\n\n/**\n *\n * @param {Error} obj\n * @param {Extensions} props\n * @returns {Error & Extensions}\n */\nfunction assign(obj, props) {\n for (const key in props) {\n Object.defineProperty(obj, key, {\n value: props[key],\n enumerable: true,\n configurable: true,\n });\n }\n\n return obj;\n}\n\n/**\n *\n * @param {any} err - An Error\n * @param {string|Extensions} code - A string code or props to set on the error\n * @param {Extensions} [props] - Props to set on the error\n * @returns {Error & Extensions}\n */\nfunction createError(err, code, props) {\n if (!err || typeof err === 'string') {\n throw new TypeError('Please pass an Error to err-code');\n }\n\n if (!props) {\n props = {};\n }\n\n if (typeof code === 'object') {\n props = code;\n code = '';\n }\n\n if (code) {\n props.code = code;\n }\n\n try {\n return assign(err, props);\n } catch (_) {\n props.message = err.message;\n props.stack = err.stack;\n\n const ErrClass = function () {};\n\n ErrClass.prototype = Object.create(Object.getPrototypeOf(err));\n\n // @ts-ignore\n const output = assign(new ErrClass(), props);\n\n return output;\n }\n}\n\nmodule.exports = createError;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst event_iterator_1 = require(\"./event-iterator\");\nexports.EventIterator = event_iterator_1.EventIterator;\nfunction subscribe(event, options, evOptions) {\n return new event_iterator_1.EventIterator(({ push }) => {\n this.addEventListener(event, push, options);\n return () => this.removeEventListener(event, push, options);\n }, evOptions);\n}\nexports.subscribe = subscribe;\nexports.default = event_iterator_1.EventIterator;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nclass EventQueue {\n constructor() {\n this.pullQueue = [];\n this.pushQueue = [];\n this.eventHandlers = {};\n this.isPaused = false;\n this.isStopped = false;\n }\n push(value) {\n if (this.isStopped)\n return;\n const resolution = { value, done: false };\n if (this.pullQueue.length) {\n const placeholder = this.pullQueue.shift();\n if (placeholder)\n placeholder.resolve(resolution);\n }\n else {\n this.pushQueue.push(Promise.resolve(resolution));\n if (this.highWaterMark !== undefined &&\n this.pushQueue.length >= this.highWaterMark &&\n !this.isPaused) {\n this.isPaused = true;\n if (this.eventHandlers.highWater) {\n this.eventHandlers.highWater();\n }\n else if (console) {\n console.warn(`EventIterator queue reached ${this.pushQueue.length} items`);\n }\n }\n }\n }\n stop() {\n if (this.isStopped)\n return;\n this.isStopped = true;\n this.remove();\n for (const placeholder of this.pullQueue) {\n placeholder.resolve({ value: undefined, done: true });\n }\n this.pullQueue.length = 0;\n }\n fail(error) {\n if (this.isStopped)\n return;\n this.isStopped = true;\n this.remove();\n if (this.pullQueue.length) {\n for (const placeholder of this.pullQueue) {\n placeholder.reject(error);\n }\n this.pullQueue.length = 0;\n }\n else {\n const rejection = Promise.reject(error);\n /* Attach error handler to avoid leaking an unhandled promise rejection. */\n rejection.catch(() => { });\n this.pushQueue.push(rejection);\n }\n }\n remove() {\n Promise.resolve().then(() => {\n if (this.removeCallback)\n this.removeCallback();\n });\n }\n [Symbol.asyncIterator]() {\n return {\n next: (value) => {\n const result = this.pushQueue.shift();\n if (result) {\n if (this.lowWaterMark !== undefined &&\n this.pushQueue.length <= this.lowWaterMark &&\n this.isPaused) {\n this.isPaused = false;\n if (this.eventHandlers.lowWater) {\n this.eventHandlers.lowWater();\n }\n }\n return result;\n }\n else if (this.isStopped) {\n return Promise.resolve({ value: undefined, done: true });\n }\n else {\n return new Promise((resolve, reject) => {\n this.pullQueue.push({ resolve, reject });\n });\n }\n },\n return: () => {\n this.isStopped = true;\n this.pushQueue.length = 0;\n this.remove();\n return Promise.resolve({ value: undefined, done: true });\n },\n };\n }\n}\nclass EventIterator {\n constructor(listen, { highWaterMark = 100, lowWaterMark = 1 } = {}) {\n const queue = new EventQueue();\n queue.highWaterMark = highWaterMark;\n queue.lowWaterMark = lowWaterMark;\n queue.removeCallback =\n listen({\n push: value => queue.push(value),\n stop: () => queue.stop(),\n fail: error => queue.fail(error),\n on: (event, fn) => {\n queue.eventHandlers[event] = fn;\n },\n }) || (() => { });\n this[Symbol.asyncIterator] = () => queue[Symbol.asyncIterator]();\n Object.freeze(this);\n }\n}\nexports.EventIterator = EventIterator;\nexports.default = EventIterator;\n","'use strict';\n\nvar has = Object.prototype.hasOwnProperty\n , prefix = '~';\n\n/**\n * Constructor to create a storage for our `EE` objects.\n * An `Events` instance is a plain object whose properties are event names.\n *\n * @constructor\n * @private\n */\nfunction Events() {}\n\n//\n// We try to not inherit from `Object.prototype`. In some engines creating an\n// instance in this way is faster than calling `Object.create(null)` directly.\n// If `Object.create(null)` is not supported we prefix the event names with a\n// character to make sure that the built-in object properties are not\n// overridden or used as an attack vector.\n//\nif (Object.create) {\n Events.prototype = Object.create(null);\n\n //\n // This hack is needed because the `__proto__` property is still inherited in\n // some old browsers like Android 4, iPhone 5.1, Opera 11 and Safari 5.\n //\n if (!new Events().__proto__) prefix = false;\n}\n\n/**\n * Representation of a single event listener.\n *\n * @param {Function} fn The listener function.\n * @param {*} context The context to invoke the listener with.\n * @param {Boolean} [once=false] Specify if the listener is a one-time listener.\n * @constructor\n * @private\n */\nfunction EE(fn, context, once) {\n this.fn = fn;\n this.context = context;\n this.once = once || false;\n}\n\n/**\n * Add a listener for a given event.\n *\n * @param {EventEmitter} emitter Reference to the `EventEmitter` instance.\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} context The context to invoke the listener with.\n * @param {Boolean} once Specify if the listener is a one-time listener.\n * @returns {EventEmitter}\n * @private\n */\nfunction addListener(emitter, event, fn, context, once) {\n if (typeof fn !== 'function') {\n throw new TypeError('The listener must be a function');\n }\n\n var listener = new EE(fn, context || emitter, once)\n , evt = prefix ? prefix + event : event;\n\n if (!emitter._events[evt]) emitter._events[evt] = listener, emitter._eventsCount++;\n else if (!emitter._events[evt].fn) emitter._events[evt].push(listener);\n else emitter._events[evt] = [emitter._events[evt], listener];\n\n return emitter;\n}\n\n/**\n * Clear event by name.\n *\n * @param {EventEmitter} emitter Reference to the `EventEmitter` instance.\n * @param {(String|Symbol)} evt The Event name.\n * @private\n */\nfunction clearEvent(emitter, evt) {\n if (--emitter._eventsCount === 0) emitter._events = new Events();\n else delete emitter._events[evt];\n}\n\n/**\n * Minimal `EventEmitter` interface that is molded against the Node.js\n * `EventEmitter` interface.\n *\n * @constructor\n * @public\n */\nfunction EventEmitter() {\n this._events = new Events();\n this._eventsCount = 0;\n}\n\n/**\n * Return an array listing the events for which the emitter has registered\n * listeners.\n *\n * @returns {Array}\n * @public\n */\nEventEmitter.prototype.eventNames = function eventNames() {\n var names = []\n , events\n , name;\n\n if (this._eventsCount === 0) return names;\n\n for (name in (events = this._events)) {\n if (has.call(events, name)) names.push(prefix ? name.slice(1) : name);\n }\n\n if (Object.getOwnPropertySymbols) {\n return names.concat(Object.getOwnPropertySymbols(events));\n }\n\n return names;\n};\n\n/**\n * Return the listeners registered for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Array} The registered listeners.\n * @public\n */\nEventEmitter.prototype.listeners = function listeners(event) {\n var evt = prefix ? prefix + event : event\n , handlers = this._events[evt];\n\n if (!handlers) return [];\n if (handlers.fn) return [handlers.fn];\n\n for (var i = 0, l = handlers.length, ee = new Array(l); i < l; i++) {\n ee[i] = handlers[i].fn;\n }\n\n return ee;\n};\n\n/**\n * Return the number of listeners listening to a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Number} The number of listeners.\n * @public\n */\nEventEmitter.prototype.listenerCount = function listenerCount(event) {\n var evt = prefix ? prefix + event : event\n , listeners = this._events[evt];\n\n if (!listeners) return 0;\n if (listeners.fn) return 1;\n return listeners.length;\n};\n\n/**\n * Calls each of the listeners registered for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Boolean} `true` if the event had listeners, else `false`.\n * @public\n */\nEventEmitter.prototype.emit = function emit(event, a1, a2, a3, a4, a5) {\n var evt = prefix ? prefix + event : event;\n\n if (!this._events[evt]) return false;\n\n var listeners = this._events[evt]\n , len = arguments.length\n , args\n , i;\n\n if (listeners.fn) {\n if (listeners.once) this.removeListener(event, listeners.fn, undefined, true);\n\n switch (len) {\n case 1: return listeners.fn.call(listeners.context), true;\n case 2: return listeners.fn.call(listeners.context, a1), true;\n case 3: return listeners.fn.call(listeners.context, a1, a2), true;\n case 4: return listeners.fn.call(listeners.context, a1, a2, a3), true;\n case 5: return listeners.fn.call(listeners.context, a1, a2, a3, a4), true;\n case 6: return listeners.fn.call(listeners.context, a1, a2, a3, a4, a5), true;\n }\n\n for (i = 1, args = new Array(len -1); i < len; i++) {\n args[i - 1] = arguments[i];\n }\n\n listeners.fn.apply(listeners.context, args);\n } else {\n var length = listeners.length\n , j;\n\n for (i = 0; i < length; i++) {\n if (listeners[i].once) this.removeListener(event, listeners[i].fn, undefined, true);\n\n switch (len) {\n case 1: listeners[i].fn.call(listeners[i].context); break;\n case 2: listeners[i].fn.call(listeners[i].context, a1); break;\n case 3: listeners[i].fn.call(listeners[i].context, a1, a2); break;\n case 4: listeners[i].fn.call(listeners[i].context, a1, a2, a3); break;\n default:\n if (!args) for (j = 1, args = new Array(len -1); j < len; j++) {\n args[j - 1] = arguments[j];\n }\n\n listeners[i].fn.apply(listeners[i].context, args);\n }\n }\n }\n\n return true;\n};\n\n/**\n * Add a listener for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} [context=this] The context to invoke the listener with.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.on = function on(event, fn, context) {\n return addListener(this, event, fn, context, false);\n};\n\n/**\n * Add a one-time listener for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} [context=this] The context to invoke the listener with.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.once = function once(event, fn, context) {\n return addListener(this, event, fn, context, true);\n};\n\n/**\n * Remove the listeners of a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn Only remove the listeners that match this function.\n * @param {*} context Only remove the listeners that have this context.\n * @param {Boolean} once Only remove one-time listeners.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.removeListener = function removeListener(event, fn, context, once) {\n var evt = prefix ? prefix + event : event;\n\n if (!this._events[evt]) return this;\n if (!fn) {\n clearEvent(this, evt);\n return this;\n }\n\n var listeners = this._events[evt];\n\n if (listeners.fn) {\n if (\n listeners.fn === fn &&\n (!once || listeners.once) &&\n (!context || listeners.context === context)\n ) {\n clearEvent(this, evt);\n }\n } else {\n for (var i = 0, events = [], length = listeners.length; i < length; i++) {\n if (\n listeners[i].fn !== fn ||\n (once && !listeners[i].once) ||\n (context && listeners[i].context !== context)\n ) {\n events.push(listeners[i]);\n }\n }\n\n //\n // Reset the array, or remove it completely if we have no more listeners.\n //\n if (events.length) this._events[evt] = events.length === 1 ? events[0] : events;\n else clearEvent(this, evt);\n }\n\n return this;\n};\n\n/**\n * Remove all listeners, or those of the specified event.\n *\n * @param {(String|Symbol)} [event] The event name.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.removeAllListeners = function removeAllListeners(event) {\n var evt;\n\n if (event) {\n evt = prefix ? prefix + event : event;\n if (this._events[evt]) clearEvent(this, evt);\n } else {\n this._events = new Events();\n this._eventsCount = 0;\n }\n\n return this;\n};\n\n//\n// Alias methods names because people roll like that.\n//\nEventEmitter.prototype.off = EventEmitter.prototype.removeListener;\nEventEmitter.prototype.addListener = EventEmitter.prototype.on;\n\n//\n// Expose the prefix.\n//\nEventEmitter.prefixed = prefix;\n\n//\n// Allow `EventEmitter` to be imported as module namespace.\n//\nEventEmitter.EventEmitter = EventEmitter;\n\n//\n// Expose the module.\n//\nif ('undefined' !== typeof module) {\n module.exports = EventEmitter;\n}\n","module.exports = function (max) {\n\n if (!max) throw Error('hashlru must have a max value, of type number, greater than 0')\n\n var size = 0, cache = Object.create(null), _cache = Object.create(null)\n\n function update (key, value) {\n cache[key] = value\n size ++\n if(size >= max) {\n size = 0\n _cache = cache\n cache = Object.create(null)\n }\n }\n\n return {\n has: function (key) {\n return cache[key] !== undefined || _cache[key] !== undefined\n },\n remove: function (key) {\n if(cache[key] !== undefined)\n cache[key] = undefined\n if(_cache[key] !== undefined)\n _cache[key] = undefined\n },\n get: function (key) {\n var v = cache[key]\n if(v !== undefined) return v\n if((v = _cache[key]) !== undefined) {\n update(key, v)\n return v\n }\n },\n set: function (key, value) {\n if(cache[key] !== undefined) cache[key] = value\n else update(key, value)\n },\n clear: function () {\n cache = Object.create(null)\n _cache = Object.create(null)\n }\n }\n}\n\n\n\n\n\n\n\n","/*\n * [hi-base32]{@link https://github.com/emn178/hi-base32}\n *\n * @version 0.5.0\n * @author Chen, Yi-Cyuan [emn178@gmail.com]\n * @copyright Chen, Yi-Cyuan 2015-2018\n * @license MIT\n */\n/*jslint bitwise: true */\n(function () {\n 'use strict';\n\n var root = typeof window === 'object' ? window : {};\n var NODE_JS = !root.HI_BASE32_NO_NODE_JS && typeof process === 'object' && process.versions && process.versions.node;\n if (NODE_JS) {\n root = global;\n }\n var COMMON_JS = !root.HI_BASE32_NO_COMMON_JS && typeof module === 'object' && module.exports;\n var AMD = typeof define === 'function' && define.amd;\n var BASE32_ENCODE_CHAR = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ234567'.split('');\n var BASE32_DECODE_CHAR = {\n 'A': 0, 'B': 1, 'C': 2, 'D': 3, 'E': 4, 'F': 5, 'G': 6, 'H': 7, 'I': 8,\n 'J': 9, 'K': 10, 'L': 11, 'M': 12, 'N': 13, 'O': 14, 'P': 15, 'Q': 16,\n 'R': 17, 'S': 18, 'T': 19, 'U': 20, 'V': 21, 'W': 22, 'X': 23, 'Y': 24,\n 'Z': 25, '2': 26, '3': 27, '4': 28, '5': 29, '6': 30, '7': 31\n };\n\n var blocks = [0, 0, 0, 0, 0, 0, 0, 0];\n\n var throwInvalidUtf8 = function (position, partial) {\n if (partial.length > 10) {\n partial = '...' + partial.substr(-10);\n }\n var err = new Error('Decoded data is not valid UTF-8.'\n + ' Maybe try base32.decode.asBytes()?'\n + ' Partial data after reading ' + position + ' bytes: ' + partial + ' <-');\n err.position = position;\n throw err;\n };\n\n var toUtf8String = function (bytes) {\n var str = '', length = bytes.length, i = 0, followingChars = 0, b, c;\n while (i < length) {\n b = bytes[i++];\n if (b <= 0x7F) {\n str += String.fromCharCode(b);\n continue;\n } else if (b > 0xBF && b <= 0xDF) {\n c = b & 0x1F;\n followingChars = 1;\n } else if (b <= 0xEF) {\n c = b & 0x0F;\n followingChars = 2;\n } else if (b <= 0xF7) {\n c = b & 0x07;\n followingChars = 3;\n } else {\n throwInvalidUtf8(i, str);\n }\n\n for (var j = 0; j < followingChars; ++j) {\n b = bytes[i++];\n if (b < 0x80 || b > 0xBF) {\n throwInvalidUtf8(i, str);\n }\n c <<= 6;\n c += b & 0x3F;\n }\n if (c >= 0xD800 && c <= 0xDFFF) {\n throwInvalidUtf8(i, str);\n }\n if (c > 0x10FFFF) {\n throwInvalidUtf8(i, str);\n }\n\n if (c <= 0xFFFF) {\n str += String.fromCharCode(c);\n } else {\n c -= 0x10000;\n str += String.fromCharCode((c >> 10) + 0xD800);\n str += String.fromCharCode((c & 0x3FF) + 0xDC00);\n }\n }\n return str;\n };\n\n var decodeAsBytes = function (base32Str) {\n if (base32Str === '') {\n return [];\n } else if (!/^[A-Z2-7=]+$/.test(base32Str)) {\n throw new Error('Invalid base32 characters');\n }\n base32Str = base32Str.replace(/=/g, '');\n var v1, v2, v3, v4, v5, v6, v7, v8, bytes = [], index = 0, length = base32Str.length;\n\n // 4 char to 3 bytes\n for (var i = 0, count = length >> 3 << 3; i < count;) {\n v1 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v2 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v3 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v4 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v5 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v6 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v7 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v8 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n bytes[index++] = (v1 << 3 | v2 >>> 2) & 255;\n bytes[index++] = (v2 << 6 | v3 << 1 | v4 >>> 4) & 255;\n bytes[index++] = (v4 << 4 | v5 >>> 1) & 255;\n bytes[index++] = (v5 << 7 | v6 << 2 | v7 >>> 3) & 255;\n bytes[index++] = (v7 << 5 | v8) & 255;\n }\n\n // remain bytes\n var remain = length - count;\n if (remain === 2) {\n v1 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v2 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n bytes[index++] = (v1 << 3 | v2 >>> 2) & 255;\n } else if (remain === 4) {\n v1 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v2 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v3 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v4 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n bytes[index++] = (v1 << 3 | v2 >>> 2) & 255;\n bytes[index++] = (v2 << 6 | v3 << 1 | v4 >>> 4) & 255;\n } else if (remain === 5) {\n v1 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v2 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v3 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v4 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v5 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n bytes[index++] = (v1 << 3 | v2 >>> 2) & 255;\n bytes[index++] = (v2 << 6 | v3 << 1 | v4 >>> 4) & 255;\n bytes[index++] = (v4 << 4 | v5 >>> 1) & 255;\n } else if (remain === 7) {\n v1 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v2 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v3 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v4 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v5 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v6 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v7 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n bytes[index++] = (v1 << 3 | v2 >>> 2) & 255;\n bytes[index++] = (v2 << 6 | v3 << 1 | v4 >>> 4) & 255;\n bytes[index++] = (v4 << 4 | v5 >>> 1) & 255;\n bytes[index++] = (v5 << 7 | v6 << 2 | v7 >>> 3) & 255;\n }\n return bytes;\n };\n\n var encodeAscii = function (str) {\n var v1, v2, v3, v4, v5, base32Str = '', length = str.length;\n for (var i = 0, count = parseInt(length / 5) * 5; i < count;) {\n v1 = str.charCodeAt(i++);\n v2 = str.charCodeAt(i++);\n v3 = str.charCodeAt(i++);\n v4 = str.charCodeAt(i++);\n v5 = str.charCodeAt(i++);\n base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] +\n BASE32_ENCODE_CHAR[(v1 << 2 | v2 >>> 6) & 31] +\n BASE32_ENCODE_CHAR[(v2 >>> 1) & 31] +\n BASE32_ENCODE_CHAR[(v2 << 4 | v3 >>> 4) & 31] +\n BASE32_ENCODE_CHAR[(v3 << 1 | v4 >>> 7) & 31] +\n BASE32_ENCODE_CHAR[(v4 >>> 2) & 31] +\n BASE32_ENCODE_CHAR[(v4 << 3 | v5 >>> 5) & 31] +\n BASE32_ENCODE_CHAR[v5 & 31];\n }\n\n // remain char\n var remain = length - count;\n if (remain === 1) {\n v1 = str.charCodeAt(i);\n base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] +\n BASE32_ENCODE_CHAR[(v1 << 2) & 31] +\n '======';\n } else if (remain === 2) {\n v1 = str.charCodeAt(i++);\n v2 = str.charCodeAt(i);\n base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] +\n BASE32_ENCODE_CHAR[(v1 << 2 | v2 >>> 6) & 31] +\n BASE32_ENCODE_CHAR[(v2 >>> 1) & 31] +\n BASE32_ENCODE_CHAR[(v2 << 4) & 31] +\n '====';\n } else if (remain === 3) {\n v1 = str.charCodeAt(i++);\n v2 = str.charCodeAt(i++);\n v3 = str.charCodeAt(i);\n base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] +\n BASE32_ENCODE_CHAR[(v1 << 2 | v2 >>> 6) & 31] +\n BASE32_ENCODE_CHAR[(v2 >>> 1) & 31] +\n BASE32_ENCODE_CHAR[(v2 << 4 | v3 >>> 4) & 31] +\n BASE32_ENCODE_CHAR[(v3 << 1) & 31] +\n '===';\n } else if (remain === 4) {\n v1 = str.charCodeAt(i++);\n v2 = str.charCodeAt(i++);\n v3 = str.charCodeAt(i++);\n v4 = str.charCodeAt(i);\n base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] +\n BASE32_ENCODE_CHAR[(v1 << 2 | v2 >>> 6) & 31] +\n BASE32_ENCODE_CHAR[(v2 >>> 1) & 31] +\n BASE32_ENCODE_CHAR[(v2 << 4 | v3 >>> 4) & 31] +\n BASE32_ENCODE_CHAR[(v3 << 1 | v4 >>> 7) & 31] +\n BASE32_ENCODE_CHAR[(v4 >>> 2) & 31] +\n BASE32_ENCODE_CHAR[(v4 << 3) & 31] +\n '=';\n }\n return base32Str;\n };\n\n var encodeUtf8 = function (str) {\n var v1, v2, v3, v4, v5, code, end = false, base32Str = '',\n index = 0, i, start = 0, bytes = 0, length = str.length;\n if (str === '') {\n return base32Str;\n }\n do {\n blocks[0] = blocks[5];\n blocks[1] = blocks[6];\n blocks[2] = blocks[7];\n for (i = start; index < length && i < 5; ++index) {\n code = str.charCodeAt(index);\n if (code < 0x80) {\n blocks[i++] = code;\n } else if (code < 0x800) {\n blocks[i++] = 0xc0 | (code >> 6);\n blocks[i++] = 0x80 | (code & 0x3f);\n } else if (code < 0xd800 || code >= 0xe000) {\n blocks[i++] = 0xe0 | (code >> 12);\n blocks[i++] = 0x80 | ((code >> 6) & 0x3f);\n blocks[i++] = 0x80 | (code & 0x3f);\n } else {\n code = 0x10000 + (((code & 0x3ff) << 10) | (str.charCodeAt(++index) & 0x3ff));\n blocks[i++] = 0xf0 | (code >> 18);\n blocks[i++] = 0x80 | ((code >> 12) & 0x3f);\n blocks[i++] = 0x80 | ((code >> 6) & 0x3f);\n blocks[i++] = 0x80 | (code & 0x3f);\n }\n }\n bytes += i - start;\n start = i - 5;\n if (index === length) {\n ++index;\n }\n if (index > length && i < 6) {\n end = true;\n }\n v1 = blocks[0];\n if (i > 4) {\n v2 = blocks[1];\n v3 = blocks[2];\n v4 = blocks[3];\n v5 = blocks[4];\n base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] +\n BASE32_ENCODE_CHAR[(v1 << 2 | v2 >>> 6) & 31] +\n BASE32_ENCODE_CHAR[(v2 >>> 1) & 31] +\n BASE32_ENCODE_CHAR[(v2 << 4 | v3 >>> 4) & 31] +\n BASE32_ENCODE_CHAR[(v3 << 1 | v4 >>> 7) & 31] +\n BASE32_ENCODE_CHAR[(v4 >>> 2) & 31] +\n BASE32_ENCODE_CHAR[(v4 << 3 | v5 >>> 5) & 31] +\n BASE32_ENCODE_CHAR[v5 & 31];\n } else if (i === 1) {\n base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] +\n BASE32_ENCODE_CHAR[(v1 << 2) & 31] +\n '======';\n } else if (i === 2) {\n v2 = blocks[1];\n base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] +\n BASE32_ENCODE_CHAR[(v1 << 2 | v2 >>> 6) & 31] +\n BASE32_ENCODE_CHAR[(v2 >>> 1) & 31] +\n BASE32_ENCODE_CHAR[(v2 << 4) & 31] +\n '====';\n } else if (i === 3) {\n v2 = blocks[1];\n v3 = blocks[2];\n base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] +\n BASE32_ENCODE_CHAR[(v1 << 2 | v2 >>> 6) & 31] +\n BASE32_ENCODE_CHAR[(v2 >>> 1) & 31] +\n BASE32_ENCODE_CHAR[(v2 << 4 | v3 >>> 4) & 31] +\n BASE32_ENCODE_CHAR[(v3 << 1) & 31] +\n '===';\n } else {\n v2 = blocks[1];\n v3 = blocks[2];\n v4 = blocks[3];\n base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] +\n BASE32_ENCODE_CHAR[(v1 << 2 | v2 >>> 6) & 31] +\n BASE32_ENCODE_CHAR[(v2 >>> 1) & 31] +\n BASE32_ENCODE_CHAR[(v2 << 4 | v3 >>> 4) & 31] +\n BASE32_ENCODE_CHAR[(v3 << 1 | v4 >>> 7) & 31] +\n BASE32_ENCODE_CHAR[(v4 >>> 2) & 31] +\n BASE32_ENCODE_CHAR[(v4 << 3) & 31] +\n '=';\n }\n } while (!end);\n return base32Str;\n };\n\n var encodeBytes = function (bytes) {\n var v1, v2, v3, v4, v5, base32Str = '', length = bytes.length;\n for (var i = 0, count = parseInt(length / 5) * 5; i < count;) {\n v1 = bytes[i++];\n v2 = bytes[i++];\n v3 = bytes[i++];\n v4 = bytes[i++];\n v5 = bytes[i++];\n base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] +\n BASE32_ENCODE_CHAR[(v1 << 2 | v2 >>> 6) & 31] +\n BASE32_ENCODE_CHAR[(v2 >>> 1) & 31] +\n BASE32_ENCODE_CHAR[(v2 << 4 | v3 >>> 4) & 31] +\n BASE32_ENCODE_CHAR[(v3 << 1 | v4 >>> 7) & 31] +\n BASE32_ENCODE_CHAR[(v4 >>> 2) & 31] +\n BASE32_ENCODE_CHAR[(v4 << 3 | v5 >>> 5) & 31] +\n BASE32_ENCODE_CHAR[v5 & 31];\n }\n\n // remain char\n var remain = length - count;\n if (remain === 1) {\n v1 = bytes[i];\n base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] +\n BASE32_ENCODE_CHAR[(v1 << 2) & 31] +\n '======';\n } else if (remain === 2) {\n v1 = bytes[i++];\n v2 = bytes[i];\n base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] +\n BASE32_ENCODE_CHAR[(v1 << 2 | v2 >>> 6) & 31] +\n BASE32_ENCODE_CHAR[(v2 >>> 1) & 31] +\n BASE32_ENCODE_CHAR[(v2 << 4) & 31] +\n '====';\n } else if (remain === 3) {\n v1 = bytes[i++];\n v2 = bytes[i++];\n v3 = bytes[i];\n base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] +\n BASE32_ENCODE_CHAR[(v1 << 2 | v2 >>> 6) & 31] +\n BASE32_ENCODE_CHAR[(v2 >>> 1) & 31] +\n BASE32_ENCODE_CHAR[(v2 << 4 | v3 >>> 4) & 31] +\n BASE32_ENCODE_CHAR[(v3 << 1) & 31] +\n '===';\n } else if (remain === 4) {\n v1 = bytes[i++];\n v2 = bytes[i++];\n v3 = bytes[i++];\n v4 = bytes[i];\n base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] +\n BASE32_ENCODE_CHAR[(v1 << 2 | v2 >>> 6) & 31] +\n BASE32_ENCODE_CHAR[(v2 >>> 1) & 31] +\n BASE32_ENCODE_CHAR[(v2 << 4 | v3 >>> 4) & 31] +\n BASE32_ENCODE_CHAR[(v3 << 1 | v4 >>> 7) & 31] +\n BASE32_ENCODE_CHAR[(v4 >>> 2) & 31] +\n BASE32_ENCODE_CHAR[(v4 << 3) & 31] +\n '=';\n }\n return base32Str;\n };\n\n var encode = function (input, asciiOnly) {\n var notString = typeof(input) !== 'string';\n if (notString && input.constructor === ArrayBuffer) {\n input = new Uint8Array(input);\n }\n if (notString) {\n return encodeBytes(input);\n } else if (asciiOnly) {\n return encodeAscii(input);\n } else {\n return encodeUtf8(input);\n }\n };\n\n var decode = function (base32Str, asciiOnly) {\n if (!asciiOnly) {\n return toUtf8String(decodeAsBytes(base32Str));\n }\n if (base32Str === '') {\n return '';\n } else if (!/^[A-Z2-7=]+$/.test(base32Str)) {\n throw new Error('Invalid base32 characters');\n }\n var v1, v2, v3, v4, v5, v6, v7, v8, str = '', length = base32Str.indexOf('=');\n if (length === -1) {\n length = base32Str.length;\n }\n\n // 8 char to 5 bytes\n for (var i = 0, count = length >> 3 << 3; i < count;) {\n v1 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v2 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v3 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v4 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v5 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v6 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v7 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v8 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n str += String.fromCharCode((v1 << 3 | v2 >>> 2) & 255) +\n String.fromCharCode((v2 << 6 | v3 << 1 | v4 >>> 4) & 255) +\n String.fromCharCode((v4 << 4 | v5 >>> 1) & 255) +\n String.fromCharCode((v5 << 7 | v6 << 2 | v7 >>> 3) & 255) +\n String.fromCharCode((v7 << 5 | v8) & 255);\n }\n\n // remain bytes\n var remain = length - count;\n if (remain === 2) {\n v1 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v2 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n str += String.fromCharCode((v1 << 3 | v2 >>> 2) & 255);\n } else if (remain === 4) {\n v1 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v2 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v3 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v4 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n str += String.fromCharCode((v1 << 3 | v2 >>> 2) & 255) +\n String.fromCharCode((v2 << 6 | v3 << 1 | v4 >>> 4) & 255);\n } else if (remain === 5) {\n v1 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v2 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v3 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v4 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v5 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n str += String.fromCharCode((v1 << 3 | v2 >>> 2) & 255) +\n String.fromCharCode((v2 << 6 | v3 << 1 | v4 >>> 4) & 255) +\n String.fromCharCode((v4 << 4 | v5 >>> 1) & 255);\n } else if (remain === 7) {\n v1 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v2 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v3 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v4 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v5 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v6 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v7 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n str += String.fromCharCode((v1 << 3 | v2 >>> 2) & 255) +\n String.fromCharCode((v2 << 6 | v3 << 1 | v4 >>> 4) & 255) +\n String.fromCharCode((v4 << 4 | v5 >>> 1) & 255) +\n String.fromCharCode((v5 << 7 | v6 << 2 | v7 >>> 3) & 255);\n }\n return str;\n };\n\n var exports = {\n encode: encode,\n decode: decode\n };\n decode.asBytes = decodeAsBytes;\n\n if (COMMON_JS) {\n module.exports = exports;\n } else {\n root.base32 = exports;\n if (AMD) {\n define(function() {\n return exports;\n });\n }\n }\n})();\n","// https://github.com/electron/electron/issues/2288\nfunction isElectron() {\n // Renderer process\n if (typeof window !== 'undefined' && typeof window.process === 'object' && window.process.type === 'renderer') {\n return true;\n }\n\n // Main process\n if (typeof process !== 'undefined' && typeof process.versions === 'object' && !!process.versions.electron) {\n return true;\n }\n\n // Detect the user agent when the `nodeIntegration` option is set to false\n if (typeof navigator === 'object' && typeof navigator.userAgent === 'string' && navigator.userAgent.indexOf('Electron') >= 0) {\n return true;\n }\n\n return false;\n}\n\nmodule.exports = isElectron;\n","'use strict';\n\nmodule.exports = value => {\n\tif (Object.prototype.toString.call(value) !== '[object Object]') {\n\t\treturn false;\n\t}\n\n\tconst prototype = Object.getPrototypeOf(value);\n\treturn prototype === null || prototype === Object.prototype;\n};\n","/**\n * [js-sha3]{@link https://github.com/emn178/js-sha3}\n *\n * @version 0.9.3\n * @author Chen, Yi-Cyuan [emn178@gmail.com]\n * @copyright Chen, Yi-Cyuan 2015-2023\n * @license MIT\n */\n/*jslint bitwise: true */\n(function () {\n 'use strict';\n\n var INPUT_ERROR = 'input is invalid type';\n var FINALIZE_ERROR = 'finalize already called';\n var WINDOW = typeof window === 'object';\n var root = WINDOW ? window : {};\n if (root.JS_SHA3_NO_WINDOW) {\n WINDOW = false;\n }\n var WEB_WORKER = !WINDOW && typeof self === 'object';\n var NODE_JS = !root.JS_SHA3_NO_NODE_JS && typeof process === 'object' && process.versions && process.versions.node;\n if (NODE_JS) {\n root = global;\n } else if (WEB_WORKER) {\n root = self;\n }\n var COMMON_JS = !root.JS_SHA3_NO_COMMON_JS && typeof module === 'object' && module.exports;\n var AMD = typeof define === 'function' && define.amd;\n var ARRAY_BUFFER = !root.JS_SHA3_NO_ARRAY_BUFFER && typeof ArrayBuffer !== 'undefined';\n var HEX_CHARS = '0123456789abcdef'.split('');\n var SHAKE_PADDING = [31, 7936, 2031616, 520093696];\n var CSHAKE_PADDING = [4, 1024, 262144, 67108864];\n var KECCAK_PADDING = [1, 256, 65536, 16777216];\n var PADDING = [6, 1536, 393216, 100663296];\n var SHIFT = [0, 8, 16, 24];\n var RC = [1, 0, 32898, 0, 32906, 2147483648, 2147516416, 2147483648, 32907, 0, 2147483649,\n 0, 2147516545, 2147483648, 32777, 2147483648, 138, 0, 136, 0, 2147516425, 0,\n 2147483658, 0, 2147516555, 0, 139, 2147483648, 32905, 2147483648, 32771,\n 2147483648, 32770, 2147483648, 128, 2147483648, 32778, 0, 2147483658, 2147483648,\n 2147516545, 2147483648, 32896, 2147483648, 2147483649, 0, 2147516424, 2147483648];\n var BITS = [224, 256, 384, 512];\n var SHAKE_BITS = [128, 256];\n var OUTPUT_TYPES = ['hex', 'buffer', 'arrayBuffer', 'array', 'digest'];\n var CSHAKE_BYTEPAD = {\n '128': 168,\n '256': 136\n };\n\n\n var isArray = root.JS_SHA3_NO_NODE_JS || !Array.isArray\n ? function (obj) {\n return Object.prototype.toString.call(obj) === '[object Array]';\n }\n : Array.isArray;\n\n var isView = (ARRAY_BUFFER && (root.JS_SHA3_NO_ARRAY_BUFFER_IS_VIEW || !ArrayBuffer.isView))\n ? function (obj) {\n return typeof obj === 'object' && obj.buffer && obj.buffer.constructor === ArrayBuffer;\n }\n : ArrayBuffer.isView;\n\n // [message: string, isString: bool]\n var formatMessage = function (message) {\n var type = typeof message;\n if (type === 'string') {\n return [message, true];\n }\n if (type !== 'object' || message === null) {\n throw new Error(INPUT_ERROR);\n }\n if (ARRAY_BUFFER && message.constructor === ArrayBuffer) {\n return [new Uint8Array(message), false];\n }\n if (!isArray(message) && !isView(message)) {\n throw new Error(INPUT_ERROR);\n }\n return [message, false];\n }\n\n var empty = function (message) {\n return formatMessage(message)[0].length === 0;\n };\n\n var cloneArray = function (array) {\n var newArray = [];\n for (var i = 0; i < array.length; ++i) {\n newArray[i] = array[i];\n }\n return newArray;\n }\n\n var createOutputMethod = function (bits, padding, outputType) {\n return function (message) {\n return new Keccak(bits, padding, bits).update(message)[outputType]();\n };\n };\n\n var createShakeOutputMethod = function (bits, padding, outputType) {\n return function (message, outputBits) {\n return new Keccak(bits, padding, outputBits).update(message)[outputType]();\n };\n };\n\n var createCshakeOutputMethod = function (bits, padding, outputType) {\n return function (message, outputBits, n, s) {\n return methods['cshake' + bits].update(message, outputBits, n, s)[outputType]();\n };\n };\n\n var createKmacOutputMethod = function (bits, padding, outputType) {\n return function (key, message, outputBits, s) {\n return methods['kmac' + bits].update(key, message, outputBits, s)[outputType]();\n };\n };\n\n var createOutputMethods = function (method, createMethod, bits, padding) {\n for (var i = 0; i < OUTPUT_TYPES.length; ++i) {\n var type = OUTPUT_TYPES[i];\n method[type] = createMethod(bits, padding, type);\n }\n return method;\n };\n\n var createMethod = function (bits, padding) {\n var method = createOutputMethod(bits, padding, 'hex');\n method.create = function () {\n return new Keccak(bits, padding, bits);\n };\n method.update = function (message) {\n return method.create().update(message);\n };\n return createOutputMethods(method, createOutputMethod, bits, padding);\n };\n\n var createShakeMethod = function (bits, padding) {\n var method = createShakeOutputMethod(bits, padding, 'hex');\n method.create = function (outputBits) {\n return new Keccak(bits, padding, outputBits);\n };\n method.update = function (message, outputBits) {\n return method.create(outputBits).update(message);\n };\n return createOutputMethods(method, createShakeOutputMethod, bits, padding);\n };\n\n var createCshakeMethod = function (bits, padding) {\n var w = CSHAKE_BYTEPAD[bits];\n var method = createCshakeOutputMethod(bits, padding, 'hex');\n method.create = function (outputBits, n, s) {\n if (empty(n) && empty(s)) {\n return methods['shake' + bits].create(outputBits);\n } else {\n return new Keccak(bits, padding, outputBits).bytepad([n, s], w);\n }\n };\n method.update = function (message, outputBits, n, s) {\n return method.create(outputBits, n, s).update(message);\n };\n return createOutputMethods(method, createCshakeOutputMethod, bits, padding);\n };\n\n var createKmacMethod = function (bits, padding) {\n var w = CSHAKE_BYTEPAD[bits];\n var method = createKmacOutputMethod(bits, padding, 'hex');\n method.create = function (key, outputBits, s) {\n return new Kmac(bits, padding, outputBits).bytepad(['KMAC', s], w).bytepad([key], w);\n };\n method.update = function (key, message, outputBits, s) {\n return method.create(key, outputBits, s).update(message);\n };\n return createOutputMethods(method, createKmacOutputMethod, bits, padding);\n };\n\n var algorithms = [\n { name: 'keccak', padding: KECCAK_PADDING, bits: BITS, createMethod: createMethod },\n { name: 'sha3', padding: PADDING, bits: BITS, createMethod: createMethod },\n { name: 'shake', padding: SHAKE_PADDING, bits: SHAKE_BITS, createMethod: createShakeMethod },\n { name: 'cshake', padding: CSHAKE_PADDING, bits: SHAKE_BITS, createMethod: createCshakeMethod },\n { name: 'kmac', padding: CSHAKE_PADDING, bits: SHAKE_BITS, createMethod: createKmacMethod }\n ];\n\n var methods = {}, methodNames = [];\n\n for (var i = 0; i < algorithms.length; ++i) {\n var algorithm = algorithms[i];\n var bits = algorithm.bits;\n for (var j = 0; j < bits.length; ++j) {\n var methodName = algorithm.name + '_' + bits[j];\n methodNames.push(methodName);\n methods[methodName] = algorithm.createMethod(bits[j], algorithm.padding);\n if (algorithm.name !== 'sha3') {\n var newMethodName = algorithm.name + bits[j];\n methodNames.push(newMethodName);\n methods[newMethodName] = methods[methodName];\n }\n }\n }\n\n function Keccak(bits, padding, outputBits) {\n this.blocks = [];\n this.s = [];\n this.padding = padding;\n this.outputBits = outputBits;\n this.reset = true;\n this.finalized = false;\n this.block = 0;\n this.start = 0;\n this.blockCount = (1600 - (bits << 1)) >> 5;\n this.byteCount = this.blockCount << 2;\n this.outputBlocks = outputBits >> 5;\n this.extraBytes = (outputBits & 31) >> 3;\n\n for (var i = 0; i < 50; ++i) {\n this.s[i] = 0;\n }\n }\n\n Keccak.prototype.update = function (message) {\n if (this.finalized) {\n throw new Error(FINALIZE_ERROR);\n }\n var result = formatMessage(message);\n message = result[0];\n var isString = result[1];\n var blocks = this.blocks, byteCount = this.byteCount, length = message.length,\n blockCount = this.blockCount, index = 0, s = this.s, i, code;\n\n while (index < length) {\n if (this.reset) {\n this.reset = false;\n blocks[0] = this.block;\n for (i = 1; i < blockCount + 1; ++i) {\n blocks[i] = 0;\n }\n }\n if (isString) {\n for (i = this.start; index < length && i < byteCount; ++index) {\n code = message.charCodeAt(index);\n if (code < 0x80) {\n blocks[i >> 2] |= code << SHIFT[i++ & 3];\n } else if (code < 0x800) {\n blocks[i >> 2] |= (0xc0 | (code >> 6)) << SHIFT[i++ & 3];\n blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];\n } else if (code < 0xd800 || code >= 0xe000) {\n blocks[i >> 2] |= (0xe0 | (code >> 12)) << SHIFT[i++ & 3];\n blocks[i >> 2] |= (0x80 | ((code >> 6) & 0x3f)) << SHIFT[i++ & 3];\n blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];\n } else {\n code = 0x10000 + (((code & 0x3ff) << 10) | (message.charCodeAt(++index) & 0x3ff));\n blocks[i >> 2] |= (0xf0 | (code >> 18)) << SHIFT[i++ & 3];\n blocks[i >> 2] |= (0x80 | ((code >> 12) & 0x3f)) << SHIFT[i++ & 3];\n blocks[i >> 2] |= (0x80 | ((code >> 6) & 0x3f)) << SHIFT[i++ & 3];\n blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];\n }\n }\n } else {\n for (i = this.start; index < length && i < byteCount; ++index) {\n blocks[i >> 2] |= message[index] << SHIFT[i++ & 3];\n }\n }\n this.lastByteIndex = i;\n if (i >= byteCount) {\n this.start = i - byteCount;\n this.block = blocks[blockCount];\n for (i = 0; i < blockCount; ++i) {\n s[i] ^= blocks[i];\n }\n f(s);\n this.reset = true;\n } else {\n this.start = i;\n }\n }\n return this;\n };\n\n Keccak.prototype.encode = function (x, right) {\n var o = x & 255, n = 1;\n var bytes = [o];\n x = x >> 8;\n o = x & 255;\n while (o > 0) {\n bytes.unshift(o);\n x = x >> 8;\n o = x & 255;\n ++n;\n }\n if (right) {\n bytes.push(n);\n } else {\n bytes.unshift(n);\n }\n this.update(bytes);\n return bytes.length;\n };\n\n Keccak.prototype.encodeString = function (str) {\n var result = formatMessage(str);\n str = result[0];\n var isString = result[1];\n var bytes = 0, length = str.length;\n if (isString) {\n for (var i = 0; i < str.length; ++i) {\n var code = str.charCodeAt(i);\n if (code < 0x80) {\n bytes += 1;\n } else if (code < 0x800) {\n bytes += 2;\n } else if (code < 0xd800 || code >= 0xe000) {\n bytes += 3;\n } else {\n code = 0x10000 + (((code & 0x3ff) << 10) | (str.charCodeAt(++i) & 0x3ff));\n bytes += 4;\n }\n }\n } else {\n bytes = length;\n }\n bytes += this.encode(bytes * 8);\n this.update(str);\n return bytes;\n };\n\n Keccak.prototype.bytepad = function (strs, w) {\n var bytes = this.encode(w);\n for (var i = 0; i < strs.length; ++i) {\n bytes += this.encodeString(strs[i]);\n }\n var paddingBytes = (w - bytes % w) % w;\n var zeros = [];\n zeros.length = paddingBytes;\n this.update(zeros);\n return this;\n };\n\n Keccak.prototype.finalize = function () {\n if (this.finalized) {\n return;\n }\n this.finalized = true;\n var blocks = this.blocks, i = this.lastByteIndex, blockCount = this.blockCount, s = this.s;\n blocks[i >> 2] |= this.padding[i & 3];\n if (this.lastByteIndex === this.byteCount) {\n blocks[0] = blocks[blockCount];\n for (i = 1; i < blockCount + 1; ++i) {\n blocks[i] = 0;\n }\n }\n blocks[blockCount - 1] |= 0x80000000;\n for (i = 0; i < blockCount; ++i) {\n s[i] ^= blocks[i];\n }\n f(s);\n };\n\n Keccak.prototype.toString = Keccak.prototype.hex = function () {\n this.finalize();\n\n var blockCount = this.blockCount, s = this.s, outputBlocks = this.outputBlocks,\n extraBytes = this.extraBytes, i = 0, j = 0;\n var hex = '', block;\n while (j < outputBlocks) {\n for (i = 0; i < blockCount && j < outputBlocks; ++i, ++j) {\n block = s[i];\n hex += HEX_CHARS[(block >> 4) & 0x0F] + HEX_CHARS[block & 0x0F] +\n HEX_CHARS[(block >> 12) & 0x0F] + HEX_CHARS[(block >> 8) & 0x0F] +\n HEX_CHARS[(block >> 20) & 0x0F] + HEX_CHARS[(block >> 16) & 0x0F] +\n HEX_CHARS[(block >> 28) & 0x0F] + HEX_CHARS[(block >> 24) & 0x0F];\n }\n if (j % blockCount === 0) {\n s = cloneArray(s);\n f(s);\n i = 0;\n }\n }\n if (extraBytes) {\n block = s[i];\n hex += HEX_CHARS[(block >> 4) & 0x0F] + HEX_CHARS[block & 0x0F];\n if (extraBytes > 1) {\n hex += HEX_CHARS[(block >> 12) & 0x0F] + HEX_CHARS[(block >> 8) & 0x0F];\n }\n if (extraBytes > 2) {\n hex += HEX_CHARS[(block >> 20) & 0x0F] + HEX_CHARS[(block >> 16) & 0x0F];\n }\n }\n return hex;\n };\n\n Keccak.prototype.arrayBuffer = function () {\n this.finalize();\n\n var blockCount = this.blockCount, s = this.s, outputBlocks = this.outputBlocks,\n extraBytes = this.extraBytes, i = 0, j = 0;\n var bytes = this.outputBits >> 3;\n var buffer;\n if (extraBytes) {\n buffer = new ArrayBuffer((outputBlocks + 1) << 2);\n } else {\n buffer = new ArrayBuffer(bytes);\n }\n var array = new Uint32Array(buffer);\n while (j < outputBlocks) {\n for (i = 0; i < blockCount && j < outputBlocks; ++i, ++j) {\n array[j] = s[i];\n }\n if (j % blockCount === 0) {\n s = cloneArray(s);\n f(s);\n }\n }\n if (extraBytes) {\n array[j] = s[i];\n buffer = buffer.slice(0, bytes);\n }\n return buffer;\n };\n\n Keccak.prototype.buffer = Keccak.prototype.arrayBuffer;\n\n Keccak.prototype.digest = Keccak.prototype.array = function () {\n this.finalize();\n\n var blockCount = this.blockCount, s = this.s, outputBlocks = this.outputBlocks,\n extraBytes = this.extraBytes, i = 0, j = 0;\n var array = [], offset, block;\n while (j < outputBlocks) {\n for (i = 0; i < blockCount && j < outputBlocks; ++i, ++j) {\n offset = j << 2;\n block = s[i];\n array[offset] = block & 0xFF;\n array[offset + 1] = (block >> 8) & 0xFF;\n array[offset + 2] = (block >> 16) & 0xFF;\n array[offset + 3] = (block >> 24) & 0xFF;\n }\n if (j % blockCount === 0) {\n s = cloneArray(s);\n f(s);\n }\n }\n if (extraBytes) {\n offset = j << 2;\n block = s[i];\n array[offset] = block & 0xFF;\n if (extraBytes > 1) {\n array[offset + 1] = (block >> 8) & 0xFF;\n }\n if (extraBytes > 2) {\n array[offset + 2] = (block >> 16) & 0xFF;\n }\n }\n return array;\n };\n\n function Kmac(bits, padding, outputBits) {\n Keccak.call(this, bits, padding, outputBits);\n }\n\n Kmac.prototype = new Keccak();\n\n Kmac.prototype.finalize = function () {\n this.encode(this.outputBits, true);\n return Keccak.prototype.finalize.call(this);\n };\n\n var f = function (s) {\n var h, l, n, c0, c1, c2, c3, c4, c5, c6, c7, c8, c9,\n b0, b1, b2, b3, b4, b5, b6, b7, b8, b9, b10, b11, b12, b13, b14, b15, b16, b17,\n b18, b19, b20, b21, b22, b23, b24, b25, b26, b27, b28, b29, b30, b31, b32, b33,\n b34, b35, b36, b37, b38, b39, b40, b41, b42, b43, b44, b45, b46, b47, b48, b49;\n for (n = 0; n < 48; n += 2) {\n c0 = s[0] ^ s[10] ^ s[20] ^ s[30] ^ s[40];\n c1 = s[1] ^ s[11] ^ s[21] ^ s[31] ^ s[41];\n c2 = s[2] ^ s[12] ^ s[22] ^ s[32] ^ s[42];\n c3 = s[3] ^ s[13] ^ s[23] ^ s[33] ^ s[43];\n c4 = s[4] ^ s[14] ^ s[24] ^ s[34] ^ s[44];\n c5 = s[5] ^ s[15] ^ s[25] ^ s[35] ^ s[45];\n c6 = s[6] ^ s[16] ^ s[26] ^ s[36] ^ s[46];\n c7 = s[7] ^ s[17] ^ s[27] ^ s[37] ^ s[47];\n c8 = s[8] ^ s[18] ^ s[28] ^ s[38] ^ s[48];\n c9 = s[9] ^ s[19] ^ s[29] ^ s[39] ^ s[49];\n\n h = c8 ^ ((c2 << 1) | (c3 >>> 31));\n l = c9 ^ ((c3 << 1) | (c2 >>> 31));\n s[0] ^= h;\n s[1] ^= l;\n s[10] ^= h;\n s[11] ^= l;\n s[20] ^= h;\n s[21] ^= l;\n s[30] ^= h;\n s[31] ^= l;\n s[40] ^= h;\n s[41] ^= l;\n h = c0 ^ ((c4 << 1) | (c5 >>> 31));\n l = c1 ^ ((c5 << 1) | (c4 >>> 31));\n s[2] ^= h;\n s[3] ^= l;\n s[12] ^= h;\n s[13] ^= l;\n s[22] ^= h;\n s[23] ^= l;\n s[32] ^= h;\n s[33] ^= l;\n s[42] ^= h;\n s[43] ^= l;\n h = c2 ^ ((c6 << 1) | (c7 >>> 31));\n l = c3 ^ ((c7 << 1) | (c6 >>> 31));\n s[4] ^= h;\n s[5] ^= l;\n s[14] ^= h;\n s[15] ^= l;\n s[24] ^= h;\n s[25] ^= l;\n s[34] ^= h;\n s[35] ^= l;\n s[44] ^= h;\n s[45] ^= l;\n h = c4 ^ ((c8 << 1) | (c9 >>> 31));\n l = c5 ^ ((c9 << 1) | (c8 >>> 31));\n s[6] ^= h;\n s[7] ^= l;\n s[16] ^= h;\n s[17] ^= l;\n s[26] ^= h;\n s[27] ^= l;\n s[36] ^= h;\n s[37] ^= l;\n s[46] ^= h;\n s[47] ^= l;\n h = c6 ^ ((c0 << 1) | (c1 >>> 31));\n l = c7 ^ ((c1 << 1) | (c0 >>> 31));\n s[8] ^= h;\n s[9] ^= l;\n s[18] ^= h;\n s[19] ^= l;\n s[28] ^= h;\n s[29] ^= l;\n s[38] ^= h;\n s[39] ^= l;\n s[48] ^= h;\n s[49] ^= l;\n\n b0 = s[0];\n b1 = s[1];\n b32 = (s[11] << 4) | (s[10] >>> 28);\n b33 = (s[10] << 4) | (s[11] >>> 28);\n b14 = (s[20] << 3) | (s[21] >>> 29);\n b15 = (s[21] << 3) | (s[20] >>> 29);\n b46 = (s[31] << 9) | (s[30] >>> 23);\n b47 = (s[30] << 9) | (s[31] >>> 23);\n b28 = (s[40] << 18) | (s[41] >>> 14);\n b29 = (s[41] << 18) | (s[40] >>> 14);\n b20 = (s[2] << 1) | (s[3] >>> 31);\n b21 = (s[3] << 1) | (s[2] >>> 31);\n b2 = (s[13] << 12) | (s[12] >>> 20);\n b3 = (s[12] << 12) | (s[13] >>> 20);\n b34 = (s[22] << 10) | (s[23] >>> 22);\n b35 = (s[23] << 10) | (s[22] >>> 22);\n b16 = (s[33] << 13) | (s[32] >>> 19);\n b17 = (s[32] << 13) | (s[33] >>> 19);\n b48 = (s[42] << 2) | (s[43] >>> 30);\n b49 = (s[43] << 2) | (s[42] >>> 30);\n b40 = (s[5] << 30) | (s[4] >>> 2);\n b41 = (s[4] << 30) | (s[5] >>> 2);\n b22 = (s[14] << 6) | (s[15] >>> 26);\n b23 = (s[15] << 6) | (s[14] >>> 26);\n b4 = (s[25] << 11) | (s[24] >>> 21);\n b5 = (s[24] << 11) | (s[25] >>> 21);\n b36 = (s[34] << 15) | (s[35] >>> 17);\n b37 = (s[35] << 15) | (s[34] >>> 17);\n b18 = (s[45] << 29) | (s[44] >>> 3);\n b19 = (s[44] << 29) | (s[45] >>> 3);\n b10 = (s[6] << 28) | (s[7] >>> 4);\n b11 = (s[7] << 28) | (s[6] >>> 4);\n b42 = (s[17] << 23) | (s[16] >>> 9);\n b43 = (s[16] << 23) | (s[17] >>> 9);\n b24 = (s[26] << 25) | (s[27] >>> 7);\n b25 = (s[27] << 25) | (s[26] >>> 7);\n b6 = (s[36] << 21) | (s[37] >>> 11);\n b7 = (s[37] << 21) | (s[36] >>> 11);\n b38 = (s[47] << 24) | (s[46] >>> 8);\n b39 = (s[46] << 24) | (s[47] >>> 8);\n b30 = (s[8] << 27) | (s[9] >>> 5);\n b31 = (s[9] << 27) | (s[8] >>> 5);\n b12 = (s[18] << 20) | (s[19] >>> 12);\n b13 = (s[19] << 20) | (s[18] >>> 12);\n b44 = (s[29] << 7) | (s[28] >>> 25);\n b45 = (s[28] << 7) | (s[29] >>> 25);\n b26 = (s[38] << 8) | (s[39] >>> 24);\n b27 = (s[39] << 8) | (s[38] >>> 24);\n b8 = (s[48] << 14) | (s[49] >>> 18);\n b9 = (s[49] << 14) | (s[48] >>> 18);\n\n s[0] = b0 ^ (~b2 & b4);\n s[1] = b1 ^ (~b3 & b5);\n s[10] = b10 ^ (~b12 & b14);\n s[11] = b11 ^ (~b13 & b15);\n s[20] = b20 ^ (~b22 & b24);\n s[21] = b21 ^ (~b23 & b25);\n s[30] = b30 ^ (~b32 & b34);\n s[31] = b31 ^ (~b33 & b35);\n s[40] = b40 ^ (~b42 & b44);\n s[41] = b41 ^ (~b43 & b45);\n s[2] = b2 ^ (~b4 & b6);\n s[3] = b3 ^ (~b5 & b7);\n s[12] = b12 ^ (~b14 & b16);\n s[13] = b13 ^ (~b15 & b17);\n s[22] = b22 ^ (~b24 & b26);\n s[23] = b23 ^ (~b25 & b27);\n s[32] = b32 ^ (~b34 & b36);\n s[33] = b33 ^ (~b35 & b37);\n s[42] = b42 ^ (~b44 & b46);\n s[43] = b43 ^ (~b45 & b47);\n s[4] = b4 ^ (~b6 & b8);\n s[5] = b5 ^ (~b7 & b9);\n s[14] = b14 ^ (~b16 & b18);\n s[15] = b15 ^ (~b17 & b19);\n s[24] = b24 ^ (~b26 & b28);\n s[25] = b25 ^ (~b27 & b29);\n s[34] = b34 ^ (~b36 & b38);\n s[35] = b35 ^ (~b37 & b39);\n s[44] = b44 ^ (~b46 & b48);\n s[45] = b45 ^ (~b47 & b49);\n s[6] = b6 ^ (~b8 & b0);\n s[7] = b7 ^ (~b9 & b1);\n s[16] = b16 ^ (~b18 & b10);\n s[17] = b17 ^ (~b19 & b11);\n s[26] = b26 ^ (~b28 & b20);\n s[27] = b27 ^ (~b29 & b21);\n s[36] = b36 ^ (~b38 & b30);\n s[37] = b37 ^ (~b39 & b31);\n s[46] = b46 ^ (~b48 & b40);\n s[47] = b47 ^ (~b49 & b41);\n s[8] = b8 ^ (~b0 & b2);\n s[9] = b9 ^ (~b1 & b3);\n s[18] = b18 ^ (~b10 & b12);\n s[19] = b19 ^ (~b11 & b13);\n s[28] = b28 ^ (~b20 & b22);\n s[29] = b29 ^ (~b21 & b23);\n s[38] = b38 ^ (~b30 & b32);\n s[39] = b39 ^ (~b31 & b33);\n s[48] = b48 ^ (~b40 & b42);\n s[49] = b49 ^ (~b41 & b43);\n\n s[0] ^= RC[n];\n s[1] ^= RC[n + 1];\n }\n };\n\n if (COMMON_JS) {\n module.exports = methods;\n } else {\n for (i = 0; i < methodNames.length; ++i) {\n root[methodNames[i]] = methods[methodNames[i]];\n }\n if (AMD) {\n define(function () {\n return methods;\n });\n }\n }\n})();\n","'use strict';\nconst isOptionObject = require('is-plain-obj');\n\nconst {hasOwnProperty} = Object.prototype;\nconst {propertyIsEnumerable} = Object;\nconst defineProperty = (object, name, value) => Object.defineProperty(object, name, {\n\tvalue,\n\twritable: true,\n\tenumerable: true,\n\tconfigurable: true\n});\n\nconst globalThis = this;\nconst defaultMergeOptions = {\n\tconcatArrays: false,\n\tignoreUndefined: false\n};\n\nconst getEnumerableOwnPropertyKeys = value => {\n\tconst keys = [];\n\n\tfor (const key in value) {\n\t\tif (hasOwnProperty.call(value, key)) {\n\t\t\tkeys.push(key);\n\t\t}\n\t}\n\n\t/* istanbul ignore else */\n\tif (Object.getOwnPropertySymbols) {\n\t\tconst symbols = Object.getOwnPropertySymbols(value);\n\n\t\tfor (const symbol of symbols) {\n\t\t\tif (propertyIsEnumerable.call(value, symbol)) {\n\t\t\t\tkeys.push(symbol);\n\t\t\t}\n\t\t}\n\t}\n\n\treturn keys;\n};\n\nfunction clone(value) {\n\tif (Array.isArray(value)) {\n\t\treturn cloneArray(value);\n\t}\n\n\tif (isOptionObject(value)) {\n\t\treturn cloneOptionObject(value);\n\t}\n\n\treturn value;\n}\n\nfunction cloneArray(array) {\n\tconst result = array.slice(0, 0);\n\n\tgetEnumerableOwnPropertyKeys(array).forEach(key => {\n\t\tdefineProperty(result, key, clone(array[key]));\n\t});\n\n\treturn result;\n}\n\nfunction cloneOptionObject(object) {\n\tconst result = Object.getPrototypeOf(object) === null ? Object.create(null) : {};\n\n\tgetEnumerableOwnPropertyKeys(object).forEach(key => {\n\t\tdefineProperty(result, key, clone(object[key]));\n\t});\n\n\treturn result;\n}\n\n/**\n * @param {*} merged already cloned\n * @param {*} source something to merge\n * @param {string[]} keys keys to merge\n * @param {Object} config Config Object\n * @returns {*} cloned Object\n */\nconst mergeKeys = (merged, source, keys, config) => {\n\tkeys.forEach(key => {\n\t\tif (typeof source[key] === 'undefined' && config.ignoreUndefined) {\n\t\t\treturn;\n\t\t}\n\n\t\t// Do not recurse into prototype chain of merged\n\t\tif (key in merged && merged[key] !== Object.getPrototypeOf(merged)) {\n\t\t\tdefineProperty(merged, key, merge(merged[key], source[key], config));\n\t\t} else {\n\t\t\tdefineProperty(merged, key, clone(source[key]));\n\t\t}\n\t});\n\n\treturn merged;\n};\n\n/**\n * @param {*} merged already cloned\n * @param {*} source something to merge\n * @param {Object} config Config Object\n * @returns {*} cloned Object\n *\n * see [Array.prototype.concat ( ...arguments )](http://www.ecma-international.org/ecma-262/6.0/#sec-array.prototype.concat)\n */\nconst concatArrays = (merged, source, config) => {\n\tlet result = merged.slice(0, 0);\n\tlet resultIndex = 0;\n\n\t[merged, source].forEach(array => {\n\t\tconst indices = [];\n\n\t\t// `result.concat(array)` with cloning\n\t\tfor (let k = 0; k < array.length; k++) {\n\t\t\tif (!hasOwnProperty.call(array, k)) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tindices.push(String(k));\n\n\t\t\tif (array === merged) {\n\t\t\t\t// Already cloned\n\t\t\t\tdefineProperty(result, resultIndex++, array[k]);\n\t\t\t} else {\n\t\t\t\tdefineProperty(result, resultIndex++, clone(array[k]));\n\t\t\t}\n\t\t}\n\n\t\t// Merge non-index keys\n\t\tresult = mergeKeys(result, array, getEnumerableOwnPropertyKeys(array).filter(key => !indices.includes(key)), config);\n\t});\n\n\treturn result;\n};\n\n/**\n * @param {*} merged already cloned\n * @param {*} source something to merge\n * @param {Object} config Config Object\n * @returns {*} cloned Object\n */\nfunction merge(merged, source, config) {\n\tif (config.concatArrays && Array.isArray(merged) && Array.isArray(source)) {\n\t\treturn concatArrays(merged, source, config);\n\t}\n\n\tif (!isOptionObject(source) || !isOptionObject(merged)) {\n\t\treturn clone(source);\n\t}\n\n\treturn mergeKeys(merged, source, getEnumerableOwnPropertyKeys(source), config);\n}\n\nmodule.exports = function (...options) {\n\tconst config = merge(clone(defaultMergeOptions), (this !== globalThis && this) || {}, defaultMergeOptions);\n\tlet merged = {_: {}};\n\n\tfor (const option of options) {\n\t\tif (option === undefined) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (!isOptionObject(option)) {\n\t\t\tthrow new TypeError('`' + option + '` is not an Option Object');\n\t\t}\n\n\t\tmerged = merge(merged, {_: option}, config);\n\t}\n\n\treturn merged._;\n};\n","/**\n * Helpers.\n */\n\nvar s = 1000;\nvar m = s * 60;\nvar h = m * 60;\nvar d = h * 24;\nvar w = d * 7;\nvar y = d * 365.25;\n\n/**\n * Parse or format the given `val`.\n *\n * Options:\n *\n * - `long` verbose formatting [false]\n *\n * @param {String|Number} val\n * @param {Object} [options]\n * @throws {Error} throw an error if val is not a non-empty string or a number\n * @return {String|Number}\n * @api public\n */\n\nmodule.exports = function(val, options) {\n options = options || {};\n var type = typeof val;\n if (type === 'string' && val.length > 0) {\n return parse(val);\n } else if (type === 'number' && isFinite(val)) {\n return options.long ? fmtLong(val) : fmtShort(val);\n }\n throw new Error(\n 'val is not a non-empty string or a valid number. val=' +\n JSON.stringify(val)\n );\n};\n\n/**\n * Parse the given `str` and return milliseconds.\n *\n * @param {String} str\n * @return {Number}\n * @api private\n */\n\nfunction parse(str) {\n str = String(str);\n if (str.length > 100) {\n return;\n }\n var match = /^(-?(?:\\d+)?\\.?\\d+) *(milliseconds?|msecs?|ms|seconds?|secs?|s|minutes?|mins?|m|hours?|hrs?|h|days?|d|weeks?|w|years?|yrs?|y)?$/i.exec(\n str\n );\n if (!match) {\n return;\n }\n var n = parseFloat(match[1]);\n var type = (match[2] || 'ms').toLowerCase();\n switch (type) {\n case 'years':\n case 'year':\n case 'yrs':\n case 'yr':\n case 'y':\n return n * y;\n case 'weeks':\n case 'week':\n case 'w':\n return n * w;\n case 'days':\n case 'day':\n case 'd':\n return n * d;\n case 'hours':\n case 'hour':\n case 'hrs':\n case 'hr':\n case 'h':\n return n * h;\n case 'minutes':\n case 'minute':\n case 'mins':\n case 'min':\n case 'm':\n return n * m;\n case 'seconds':\n case 'second':\n case 'secs':\n case 'sec':\n case 's':\n return n * s;\n case 'milliseconds':\n case 'millisecond':\n case 'msecs':\n case 'msec':\n case 'ms':\n return n;\n default:\n return undefined;\n }\n}\n\n/**\n * Short format for `ms`.\n *\n * @param {Number} ms\n * @return {String}\n * @api private\n */\n\nfunction fmtShort(ms) {\n var msAbs = Math.abs(ms);\n if (msAbs >= d) {\n return Math.round(ms / d) + 'd';\n }\n if (msAbs >= h) {\n return Math.round(ms / h) + 'h';\n }\n if (msAbs >= m) {\n return Math.round(ms / m) + 'm';\n }\n if (msAbs >= s) {\n return Math.round(ms / s) + 's';\n }\n return ms + 'ms';\n}\n\n/**\n * Long format for `ms`.\n *\n * @param {Number} ms\n * @return {String}\n * @api private\n */\n\nfunction fmtLong(ms) {\n var msAbs = Math.abs(ms);\n if (msAbs >= d) {\n return plural(ms, msAbs, d, 'day');\n }\n if (msAbs >= h) {\n return plural(ms, msAbs, h, 'hour');\n }\n if (msAbs >= m) {\n return plural(ms, msAbs, m, 'minute');\n }\n if (msAbs >= s) {\n return plural(ms, msAbs, s, 'second');\n }\n return ms + ' ms';\n}\n\n/**\n * Pluralization helper.\n */\n\nfunction plural(ms, msAbs, n, name) {\n var isPlural = msAbs >= n * 1.5;\n return Math.round(ms / n) + ' ' + name + (isPlural ? 's' : '');\n}\n","module.exports = require('./lib/murmurHash3js');\n","/* jshint -W086: true */\n// +----------------------------------------------------------------------+\n// | murmurHash3js.js v3.0.1 // https://github.com/pid/murmurHash3js\n// | A javascript implementation of MurmurHash3's x86 hashing algorithms. |\n// |----------------------------------------------------------------------|\n// | Copyright (c) 2012-2015 Karan Lyons |\n// | https://github.com/karanlyons/murmurHash3.js/blob/c1778f75792abef7bdd74bc85d2d4e1a3d25cfe9/murmurHash3.js |\n// | Freely distributable under the MIT license. |\n// +----------------------------------------------------------------------+\n\n;(function (root, undefined) {\n 'use strict';\n\n // Create a local object that'll be exported or referenced globally.\n var library = {\n 'version': '3.0.0',\n 'x86': {},\n 'x64': {},\n 'inputValidation': true\n };\n\n // PRIVATE FUNCTIONS\n // -----------------\n\n function _validBytes(bytes) {\n // check the input is an array or a typed array\n if (!Array.isArray(bytes) && !ArrayBuffer.isView(bytes)) {\n return false;\n }\n\n // check all bytes are actually bytes\n for (var i = 0; i < bytes.length; i++) {\n if (!Number.isInteger(bytes[i]) || bytes[i] < 0 || bytes[i] > 255) {\n return false;\n }\n }\n return true;\n }\n\n function _x86Multiply(m, n) {\n //\n // Given two 32bit ints, returns the two multiplied together as a\n // 32bit int.\n //\n\n return ((m & 0xffff) * n) + ((((m >>> 16) * n) & 0xffff) << 16);\n }\n\n function _x86Rotl(m, n) {\n //\n // Given a 32bit int and an int representing a number of bit positions,\n // returns the 32bit int rotated left by that number of positions.\n //\n\n return (m << n) | (m >>> (32 - n));\n }\n\n function _x86Fmix(h) {\n //\n // Given a block, returns murmurHash3's final x86 mix of that block.\n //\n\n h ^= h >>> 16;\n h = _x86Multiply(h, 0x85ebca6b);\n h ^= h >>> 13;\n h = _x86Multiply(h, 0xc2b2ae35);\n h ^= h >>> 16;\n\n return h;\n }\n\n function _x64Add(m, n) {\n //\n // Given two 64bit ints (as an array of two 32bit ints) returns the two\n // added together as a 64bit int (as an array of two 32bit ints).\n //\n\n m = [m[0] >>> 16, m[0] & 0xffff, m[1] >>> 16, m[1] & 0xffff];\n n = [n[0] >>> 16, n[0] & 0xffff, n[1] >>> 16, n[1] & 0xffff];\n var o = [0, 0, 0, 0];\n\n o[3] += m[3] + n[3];\n o[2] += o[3] >>> 16;\n o[3] &= 0xffff;\n\n o[2] += m[2] + n[2];\n o[1] += o[2] >>> 16;\n o[2] &= 0xffff;\n\n o[1] += m[1] + n[1];\n o[0] += o[1] >>> 16;\n o[1] &= 0xffff;\n\n o[0] += m[0] + n[0];\n o[0] &= 0xffff;\n\n return [(o[0] << 16) | o[1], (o[2] << 16) | o[3]];\n }\n\n function _x64Multiply(m, n) {\n //\n // Given two 64bit ints (as an array of two 32bit ints) returns the two\n // multiplied together as a 64bit int (as an array of two 32bit ints).\n //\n\n m = [m[0] >>> 16, m[0] & 0xffff, m[1] >>> 16, m[1] & 0xffff];\n n = [n[0] >>> 16, n[0] & 0xffff, n[1] >>> 16, n[1] & 0xffff];\n var o = [0, 0, 0, 0];\n\n o[3] += m[3] * n[3];\n o[2] += o[3] >>> 16;\n o[3] &= 0xffff;\n\n o[2] += m[2] * n[3];\n o[1] += o[2] >>> 16;\n o[2] &= 0xffff;\n\n o[2] += m[3] * n[2];\n o[1] += o[2] >>> 16;\n o[2] &= 0xffff;\n\n o[1] += m[1] * n[3];\n o[0] += o[1] >>> 16;\n o[1] &= 0xffff;\n\n o[1] += m[2] * n[2];\n o[0] += o[1] >>> 16;\n o[1] &= 0xffff;\n\n o[1] += m[3] * n[1];\n o[0] += o[1] >>> 16;\n o[1] &= 0xffff;\n\n o[0] += (m[0] * n[3]) + (m[1] * n[2]) + (m[2] * n[1]) + (m[3] * n[0]);\n o[0] &= 0xffff;\n\n return [(o[0] << 16) | o[1], (o[2] << 16) | o[3]];\n }\n\n function _x64Rotl(m, n) {\n //\n // Given a 64bit int (as an array of two 32bit ints) and an int\n // representing a number of bit positions, returns the 64bit int (as an\n // array of two 32bit ints) rotated left by that number of positions.\n //\n\n n %= 64;\n\n if (n === 32) {\n return [m[1], m[0]];\n } else if (n < 32) {\n return [(m[0] << n) | (m[1] >>> (32 - n)), (m[1] << n) | (m[0] >>> (32 - n))];\n } else {\n n -= 32;\n return [(m[1] << n) | (m[0] >>> (32 - n)), (m[0] << n) | (m[1] >>> (32 - n))];\n }\n }\n\n function _x64LeftShift(m, n) {\n //\n // Given a 64bit int (as an array of two 32bit ints) and an int\n // representing a number of bit positions, returns the 64bit int (as an\n // array of two 32bit ints) shifted left by that number of positions.\n //\n\n n %= 64;\n\n if (n === 0) {\n return m;\n } else if (n < 32) {\n return [(m[0] << n) | (m[1] >>> (32 - n)), m[1] << n];\n } else {\n return [m[1] << (n - 32), 0];\n }\n }\n\n function _x64Xor(m, n) {\n //\n // Given two 64bit ints (as an array of two 32bit ints) returns the two\n // xored together as a 64bit int (as an array of two 32bit ints).\n //\n\n return [m[0] ^ n[0], m[1] ^ n[1]];\n }\n\n function _x64Fmix(h) {\n //\n // Given a block, returns murmurHash3's final x64 mix of that block.\n // (`[0, h[0] >>> 1]` is a 33 bit unsigned right shift. This is the\n // only place where we need to right shift 64bit ints.)\n //\n\n h = _x64Xor(h, [0, h[0] >>> 1]);\n h = _x64Multiply(h, [0xff51afd7, 0xed558ccd]);\n h = _x64Xor(h, [0, h[0] >>> 1]);\n h = _x64Multiply(h, [0xc4ceb9fe, 0x1a85ec53]);\n h = _x64Xor(h, [0, h[0] >>> 1]);\n\n return h;\n }\n\n // PUBLIC FUNCTIONS\n // ----------------\n\n library.x86.hash32 = function (bytes, seed) {\n //\n // Given a string and an optional seed as an int, returns a 32 bit hash\n // using the x86 flavor of MurmurHash3, as an unsigned int.\n //\n if (library.inputValidation && !_validBytes(bytes)) {\n return undefined;\n }\n seed = seed || 0;\n\n var remainder = bytes.length % 4;\n var blocks = bytes.length - remainder;\n\n var h1 = seed;\n\n var k1 = 0;\n\n var c1 = 0xcc9e2d51;\n var c2 = 0x1b873593;\n\n for (var i = 0; i < blocks; i = i + 4) {\n k1 = (bytes[i]) | (bytes[i + 1] << 8) | (bytes[i + 2] << 16) | (bytes[i + 3] << 24);\n\n k1 = _x86Multiply(k1, c1);\n k1 = _x86Rotl(k1, 15);\n k1 = _x86Multiply(k1, c2);\n\n h1 ^= k1;\n h1 = _x86Rotl(h1, 13);\n h1 = _x86Multiply(h1, 5) + 0xe6546b64;\n }\n\n k1 = 0;\n\n switch (remainder) {\n case 3:\n k1 ^= bytes[i + 2] << 16;\n\n case 2:\n k1 ^= bytes[i + 1] << 8;\n\n case 1:\n k1 ^= bytes[i];\n k1 = _x86Multiply(k1, c1);\n k1 = _x86Rotl(k1, 15);\n k1 = _x86Multiply(k1, c2);\n h1 ^= k1;\n }\n\n h1 ^= bytes.length;\n h1 = _x86Fmix(h1);\n\n return h1 >>> 0;\n };\n\n library.x86.hash128 = function (bytes, seed) {\n //\n // Given a string and an optional seed as an int, returns a 128 bit\n // hash using the x86 flavor of MurmurHash3, as an unsigned hex.\n //\n if (library.inputValidation && !_validBytes(bytes)) {\n return undefined;\n }\n\n seed = seed || 0;\n var remainder = bytes.length % 16;\n var blocks = bytes.length - remainder;\n\n var h1 = seed;\n var h2 = seed;\n var h3 = seed;\n var h4 = seed;\n\n var k1 = 0;\n var k2 = 0;\n var k3 = 0;\n var k4 = 0;\n\n var c1 = 0x239b961b;\n var c2 = 0xab0e9789;\n var c3 = 0x38b34ae5;\n var c4 = 0xa1e38b93;\n\n for (var i = 0; i < blocks; i = i + 16) {\n k1 = (bytes[i]) | (bytes[i + 1] << 8) | (bytes[i + 2] << 16) | (bytes[i + 3] << 24);\n k2 = (bytes[i + 4]) | (bytes[i + 5] << 8) | (bytes[i + 6] << 16) | (bytes[i + 7] << 24);\n k3 = (bytes[i + 8]) | (bytes[i + 9] << 8) | (bytes[i + 10] << 16) | (bytes[i + 11] << 24);\n k4 = (bytes[i + 12]) | (bytes[i + 13] << 8) | (bytes[i + 14] << 16) | (bytes[i + 15] << 24);\n\n k1 = _x86Multiply(k1, c1);\n k1 = _x86Rotl(k1, 15);\n k1 = _x86Multiply(k1, c2);\n h1 ^= k1;\n\n h1 = _x86Rotl(h1, 19);\n h1 += h2;\n h1 = _x86Multiply(h1, 5) + 0x561ccd1b;\n\n k2 = _x86Multiply(k2, c2);\n k2 = _x86Rotl(k2, 16);\n k2 = _x86Multiply(k2, c3);\n h2 ^= k2;\n\n h2 = _x86Rotl(h2, 17);\n h2 += h3;\n h2 = _x86Multiply(h2, 5) + 0x0bcaa747;\n\n k3 = _x86Multiply(k3, c3);\n k3 = _x86Rotl(k3, 17);\n k3 = _x86Multiply(k3, c4);\n h3 ^= k3;\n\n h3 = _x86Rotl(h3, 15);\n h3 += h4;\n h3 = _x86Multiply(h3, 5) + 0x96cd1c35;\n\n k4 = _x86Multiply(k4, c4);\n k4 = _x86Rotl(k4, 18);\n k4 = _x86Multiply(k4, c1);\n h4 ^= k4;\n\n h4 = _x86Rotl(h4, 13);\n h4 += h1;\n h4 = _x86Multiply(h4, 5) + 0x32ac3b17;\n }\n\n k1 = 0;\n k2 = 0;\n k3 = 0;\n k4 = 0;\n\n switch (remainder) {\n case 15:\n k4 ^= bytes[i + 14] << 16;\n\n case 14:\n k4 ^= bytes[i + 13] << 8;\n\n case 13:\n k4 ^= bytes[i + 12];\n k4 = _x86Multiply(k4, c4);\n k4 = _x86Rotl(k4, 18);\n k4 = _x86Multiply(k4, c1);\n h4 ^= k4;\n\n case 12:\n k3 ^= bytes[i + 11] << 24;\n\n case 11:\n k3 ^= bytes[i + 10] << 16;\n\n case 10:\n k3 ^= bytes[i + 9] << 8;\n\n case 9:\n k3 ^= bytes[i + 8];\n k3 = _x86Multiply(k3, c3);\n k3 = _x86Rotl(k3, 17);\n k3 = _x86Multiply(k3, c4);\n h3 ^= k3;\n\n case 8:\n k2 ^= bytes[i + 7] << 24;\n\n case 7:\n k2 ^= bytes[i + 6] << 16;\n\n case 6:\n k2 ^= bytes[i + 5] << 8;\n\n case 5:\n k2 ^= bytes[i + 4];\n k2 = _x86Multiply(k2, c2);\n k2 = _x86Rotl(k2, 16);\n k2 = _x86Multiply(k2, c3);\n h2 ^= k2;\n\n case 4:\n k1 ^= bytes[i + 3] << 24;\n\n case 3:\n k1 ^= bytes[i + 2] << 16;\n\n case 2:\n k1 ^= bytes[i + 1] << 8;\n\n case 1:\n k1 ^= bytes[i];\n k1 = _x86Multiply(k1, c1);\n k1 = _x86Rotl(k1, 15);\n k1 = _x86Multiply(k1, c2);\n h1 ^= k1;\n }\n\n h1 ^= bytes.length;\n h2 ^= bytes.length;\n h3 ^= bytes.length;\n h4 ^= bytes.length;\n\n h1 += h2;\n h1 += h3;\n h1 += h4;\n h2 += h1;\n h3 += h1;\n h4 += h1;\n\n h1 = _x86Fmix(h1);\n h2 = _x86Fmix(h2);\n h3 = _x86Fmix(h3);\n h4 = _x86Fmix(h4);\n\n h1 += h2;\n h1 += h3;\n h1 += h4;\n h2 += h1;\n h3 += h1;\n h4 += h1;\n\n return (\"00000000\" + (h1 >>> 0).toString(16)).slice(-8) + (\"00000000\" + (h2 >>> 0).toString(16)).slice(-8) + (\"00000000\" + (h3 >>> 0).toString(16)).slice(-8) + (\"00000000\" + (h4 >>> 0).toString(16)).slice(-8);\n };\n\n library.x64.hash128 = function (bytes, seed) {\n //\n // Given a string and an optional seed as an int, returns a 128 bit\n // hash using the x64 flavor of MurmurHash3, as an unsigned hex.\n //\n if (library.inputValidation && !_validBytes(bytes)) {\n return undefined;\n }\n seed = seed || 0;\n\n var remainder = bytes.length % 16;\n var blocks = bytes.length - remainder;\n\n var h1 = [0, seed];\n var h2 = [0, seed];\n\n var k1 = [0, 0];\n var k2 = [0, 0];\n\n var c1 = [0x87c37b91, 0x114253d5];\n var c2 = [0x4cf5ad43, 0x2745937f];\n\n for (var i = 0; i < blocks; i = i + 16) {\n k1 = [(bytes[i + 4]) | (bytes[i + 5] << 8) | (bytes[i + 6] << 16) | (bytes[i + 7] << 24), (bytes[i]) |\n (bytes[i + 1] << 8) | (bytes[i + 2] << 16) | (bytes[i + 3] << 24)];\n k2 = [(bytes[i + 12]) | (bytes[i + 13] << 8) | (bytes[i + 14] << 16) | (bytes[i + 15] << 24), (bytes[i + 8]) |\n (bytes[i + 9] << 8) | (bytes[i + 10] << 16) | (bytes[i + 11] << 24)];\n\n k1 = _x64Multiply(k1, c1);\n k1 = _x64Rotl(k1, 31);\n k1 = _x64Multiply(k1, c2);\n h1 = _x64Xor(h1, k1);\n\n h1 = _x64Rotl(h1, 27);\n h1 = _x64Add(h1, h2);\n h1 = _x64Add(_x64Multiply(h1, [0, 5]), [0, 0x52dce729]);\n\n k2 = _x64Multiply(k2, c2);\n k2 = _x64Rotl(k2, 33);\n k2 = _x64Multiply(k2, c1);\n h2 = _x64Xor(h2, k2);\n\n h2 = _x64Rotl(h2, 31);\n h2 = _x64Add(h2, h1);\n h2 = _x64Add(_x64Multiply(h2, [0, 5]), [0, 0x38495ab5]);\n }\n\n k1 = [0, 0];\n k2 = [0, 0];\n\n switch (remainder) {\n case 15:\n k2 = _x64Xor(k2, _x64LeftShift([0, bytes[i + 14]], 48));\n\n case 14:\n k2 = _x64Xor(k2, _x64LeftShift([0, bytes[i + 13]], 40));\n\n case 13:\n k2 = _x64Xor(k2, _x64LeftShift([0, bytes[i + 12]], 32));\n\n case 12:\n k2 = _x64Xor(k2, _x64LeftShift([0, bytes[i + 11]], 24));\n\n case 11:\n k2 = _x64Xor(k2, _x64LeftShift([0, bytes[i + 10]], 16));\n\n case 10:\n k2 = _x64Xor(k2, _x64LeftShift([0, bytes[i + 9]], 8));\n\n case 9:\n k2 = _x64Xor(k2, [0, bytes[i + 8]]);\n k2 = _x64Multiply(k2, c2);\n k2 = _x64Rotl(k2, 33);\n k2 = _x64Multiply(k2, c1);\n h2 = _x64Xor(h2, k2);\n\n case 8:\n k1 = _x64Xor(k1, _x64LeftShift([0, bytes[i + 7]], 56));\n\n case 7:\n k1 = _x64Xor(k1, _x64LeftShift([0, bytes[i + 6]], 48));\n\n case 6:\n k1 = _x64Xor(k1, _x64LeftShift([0, bytes[i + 5]], 40));\n\n case 5:\n k1 = _x64Xor(k1, _x64LeftShift([0, bytes[i + 4]], 32));\n\n case 4:\n k1 = _x64Xor(k1, _x64LeftShift([0, bytes[i + 3]], 24));\n\n case 3:\n k1 = _x64Xor(k1, _x64LeftShift([0, bytes[i + 2]], 16));\n\n case 2:\n k1 = _x64Xor(k1, _x64LeftShift([0, bytes[i + 1]], 8));\n\n case 1:\n k1 = _x64Xor(k1, [0, bytes[i]]);\n k1 = _x64Multiply(k1, c1);\n k1 = _x64Rotl(k1, 31);\n k1 = _x64Multiply(k1, c2);\n h1 = _x64Xor(h1, k1);\n }\n\n h1 = _x64Xor(h1, [0, bytes.length]);\n h2 = _x64Xor(h2, [0, bytes.length]);\n\n h1 = _x64Add(h1, h2);\n h2 = _x64Add(h2, h1);\n\n h1 = _x64Fmix(h1);\n h2 = _x64Fmix(h2);\n\n h1 = _x64Add(h1, h2);\n h2 = _x64Add(h2, h1);\n\n return (\"00000000\" + (h1[0] >>> 0).toString(16)).slice(-8) + (\"00000000\" + (h1[1] >>> 0).toString(16)).slice(-8) + (\"00000000\" + (h2[0] >>> 0).toString(16)).slice(-8) + (\"00000000\" + (h2[1] >>> 0).toString(16)).slice(-8);\n };\n\n // INITIALIZATION\n // --------------\n\n // Export murmurHash3 for CommonJS, either as an AMD module or just as part\n // of the global object.\n if (typeof exports !== 'undefined') {\n\n if (typeof module !== 'undefined' && module.exports) {\n exports = module.exports = library;\n }\n\n exports.murmurHash3 = library;\n\n } else if (typeof define === 'function' && define.amd) {\n\n define([], function () {\n return library;\n });\n } else {\n\n // Use murmurHash3.noConflict to restore `murmurHash3` back to its\n // original value. Returns a reference to the library object, to allow\n // it to be used under a different name.\n library._murmurHash3 = root.murmurHash3;\n\n library.noConflict = function () {\n root.murmurHash3 = library._murmurHash3;\n library._murmurHash3 = undefined;\n library.noConflict = undefined;\n\n return library;\n };\n\n root.murmurHash3 = library;\n }\n})(this);\n","// Generated by CoffeeScript 1.12.7\n(function() {\n var Netmask, atob, chr, chr0, chrA, chra, ip2long, long2ip;\n\n long2ip = function(long) {\n var a, b, c, d;\n a = (long & (0xff << 24)) >>> 24;\n b = (long & (0xff << 16)) >>> 16;\n c = (long & (0xff << 8)) >>> 8;\n d = long & 0xff;\n return [a, b, c, d].join('.');\n };\n\n ip2long = function(ip) {\n var b, c, i, j, n, ref;\n b = [];\n for (i = j = 0; j <= 3; i = ++j) {\n if (ip.length === 0) {\n break;\n }\n if (i > 0) {\n if (ip[0] !== '.') {\n throw new Error('Invalid IP');\n }\n ip = ip.substring(1);\n }\n ref = atob(ip), n = ref[0], c = ref[1];\n ip = ip.substring(c);\n b.push(n);\n }\n if (ip.length !== 0) {\n throw new Error('Invalid IP');\n }\n switch (b.length) {\n case 1:\n if (b[0] > 0xFFFFFFFF) {\n throw new Error('Invalid IP');\n }\n return b[0] >>> 0;\n case 2:\n if (b[0] > 0xFF || b[1] > 0xFFFFFF) {\n throw new Error('Invalid IP');\n }\n return (b[0] << 24 | b[1]) >>> 0;\n case 3:\n if (b[0] > 0xFF || b[1] > 0xFF || b[2] > 0xFFFF) {\n throw new Error('Invalid IP');\n }\n return (b[0] << 24 | b[1] << 16 | b[2]) >>> 0;\n case 4:\n if (b[0] > 0xFF || b[1] > 0xFF || b[2] > 0xFF || b[3] > 0xFF) {\n throw new Error('Invalid IP');\n }\n return (b[0] << 24 | b[1] << 16 | b[2] << 8 | b[3]) >>> 0;\n default:\n throw new Error('Invalid IP');\n }\n };\n\n chr = function(b) {\n return b.charCodeAt(0);\n };\n\n chr0 = chr('0');\n\n chra = chr('a');\n\n chrA = chr('A');\n\n atob = function(s) {\n var base, dmax, i, n, start;\n n = 0;\n base = 10;\n dmax = '9';\n i = 0;\n if (s.length > 1 && s[i] === '0') {\n if (s[i + 1] === 'x' || s[i + 1] === 'X') {\n i += 2;\n base = 16;\n } else if ('0' <= s[i + 1] && s[i + 1] <= '9') {\n i++;\n base = 8;\n dmax = '7';\n }\n }\n start = i;\n while (i < s.length) {\n if ('0' <= s[i] && s[i] <= dmax) {\n n = (n * base + (chr(s[i]) - chr0)) >>> 0;\n } else if (base === 16) {\n if ('a' <= s[i] && s[i] <= 'f') {\n n = (n * base + (10 + chr(s[i]) - chra)) >>> 0;\n } else if ('A' <= s[i] && s[i] <= 'F') {\n n = (n * base + (10 + chr(s[i]) - chrA)) >>> 0;\n } else {\n break;\n }\n } else {\n break;\n }\n if (n > 0xFFFFFFFF) {\n throw new Error('too large');\n }\n i++;\n }\n if (i === start) {\n throw new Error('empty octet');\n }\n return [n, i];\n };\n\n Netmask = (function() {\n function Netmask(net, mask) {\n var error, i, j, ref;\n if (typeof net !== 'string') {\n throw new Error(\"Missing `net' parameter\");\n }\n if (!mask) {\n ref = net.split('/', 2), net = ref[0], mask = ref[1];\n }\n if (!mask) {\n mask = 32;\n }\n if (typeof mask === 'string' && mask.indexOf('.') > -1) {\n try {\n this.maskLong = ip2long(mask);\n } catch (error1) {\n error = error1;\n throw new Error(\"Invalid mask: \" + mask);\n }\n for (i = j = 32; j >= 0; i = --j) {\n if (this.maskLong === (0xffffffff << (32 - i)) >>> 0) {\n this.bitmask = i;\n break;\n }\n }\n } else if (mask || mask === 0) {\n this.bitmask = parseInt(mask, 10);\n this.maskLong = 0;\n if (this.bitmask > 0) {\n this.maskLong = (0xffffffff << (32 - this.bitmask)) >>> 0;\n }\n } else {\n throw new Error(\"Invalid mask: empty\");\n }\n try {\n this.netLong = (ip2long(net) & this.maskLong) >>> 0;\n } catch (error1) {\n error = error1;\n throw new Error(\"Invalid net address: \" + net);\n }\n if (!(this.bitmask <= 32)) {\n throw new Error(\"Invalid mask for ip4: \" + mask);\n }\n this.size = Math.pow(2, 32 - this.bitmask);\n this.base = long2ip(this.netLong);\n this.mask = long2ip(this.maskLong);\n this.hostmask = long2ip(~this.maskLong);\n this.first = this.bitmask <= 30 ? long2ip(this.netLong + 1) : this.base;\n this.last = this.bitmask <= 30 ? long2ip(this.netLong + this.size - 2) : long2ip(this.netLong + this.size - 1);\n this.broadcast = this.bitmask <= 30 ? long2ip(this.netLong + this.size - 1) : void 0;\n }\n\n Netmask.prototype.contains = function(ip) {\n if (typeof ip === 'string' && (ip.indexOf('/') > 0 || ip.split('.').length !== 4)) {\n ip = new Netmask(ip);\n }\n if (ip instanceof Netmask) {\n return this.contains(ip.base) && this.contains(ip.broadcast || ip.last);\n } else {\n return (ip2long(ip) & this.maskLong) >>> 0 === (this.netLong & this.maskLong) >>> 0;\n }\n };\n\n Netmask.prototype.next = function(count) {\n if (count == null) {\n count = 1;\n }\n return new Netmask(long2ip(this.netLong + (this.size * count)), this.mask);\n };\n\n Netmask.prototype.forEach = function(fn) {\n var index, lastLong, long;\n long = ip2long(this.first);\n lastLong = ip2long(this.last);\n index = 0;\n while (long <= lastLong) {\n fn(long2ip(long), long, index);\n index++;\n long++;\n }\n };\n\n Netmask.prototype.toString = function() {\n return this.base + \"/\" + this.bitmask;\n };\n\n return Netmask;\n\n })();\n\n exports.ip2long = ip2long;\n\n exports.long2ip = long2ip;\n\n exports.Netmask = Netmask;\n\n}).call(this);\n","// full library entry point.\r\n\r\n\"use strict\";\r\nmodule.exports = require(\"./src/index\");\r\n","\"use strict\";\r\nmodule.exports = common;\r\n\r\nvar commonRe = /\\/|\\./;\r\n\r\n/**\r\n * Provides common type definitions.\r\n * Can also be used to provide additional google types or your own custom types.\r\n * @param {string} name Short name as in `google/protobuf/[name].proto` or full file name\r\n * @param {Object.} json JSON definition within `google.protobuf` if a short name, otherwise the file's root definition\r\n * @returns {undefined}\r\n * @property {INamespace} google/protobuf/any.proto Any\r\n * @property {INamespace} google/protobuf/duration.proto Duration\r\n * @property {INamespace} google/protobuf/empty.proto Empty\r\n * @property {INamespace} google/protobuf/field_mask.proto FieldMask\r\n * @property {INamespace} google/protobuf/struct.proto Struct, Value, NullValue and ListValue\r\n * @property {INamespace} google/protobuf/timestamp.proto Timestamp\r\n * @property {INamespace} google/protobuf/wrappers.proto Wrappers\r\n * @example\r\n * // manually provides descriptor.proto (assumes google/protobuf/ namespace and .proto extension)\r\n * protobuf.common(\"descriptor\", descriptorJson);\r\n *\r\n * // manually provides a custom definition (uses my.foo namespace)\r\n * protobuf.common(\"my/foo/bar.proto\", myFooBarJson);\r\n */\r\nfunction common(name, json) {\r\n if (!commonRe.test(name)) {\r\n name = \"google/protobuf/\" + name + \".proto\";\r\n json = { nested: { google: { nested: { protobuf: { nested: json } } } } };\r\n }\r\n common[name] = json;\r\n}\r\n\r\n// Not provided because of limited use (feel free to discuss or to provide yourself):\r\n//\r\n// google/protobuf/descriptor.proto\r\n// google/protobuf/source_context.proto\r\n// google/protobuf/type.proto\r\n//\r\n// Stripped and pre-parsed versions of these non-bundled files are instead available as part of\r\n// the repository or package within the google/protobuf directory.\r\n\r\ncommon(\"any\", {\r\n\r\n /**\r\n * Properties of a google.protobuf.Any message.\r\n * @interface IAny\r\n * @type {Object}\r\n * @property {string} [typeUrl]\r\n * @property {Uint8Array} [bytes]\r\n * @memberof common\r\n */\r\n Any: {\r\n fields: {\r\n type_url: {\r\n type: \"string\",\r\n id: 1\r\n },\r\n value: {\r\n type: \"bytes\",\r\n id: 2\r\n }\r\n }\r\n }\r\n});\r\n\r\nvar timeType;\r\n\r\ncommon(\"duration\", {\r\n\r\n /**\r\n * Properties of a google.protobuf.Duration message.\r\n * @interface IDuration\r\n * @type {Object}\r\n * @property {number|Long} [seconds]\r\n * @property {number} [nanos]\r\n * @memberof common\r\n */\r\n Duration: timeType = {\r\n fields: {\r\n seconds: {\r\n type: \"int64\",\r\n id: 1\r\n },\r\n nanos: {\r\n type: \"int32\",\r\n id: 2\r\n }\r\n }\r\n }\r\n});\r\n\r\ncommon(\"timestamp\", {\r\n\r\n /**\r\n * Properties of a google.protobuf.Timestamp message.\r\n * @interface ITimestamp\r\n * @type {Object}\r\n * @property {number|Long} [seconds]\r\n * @property {number} [nanos]\r\n * @memberof common\r\n */\r\n Timestamp: timeType\r\n});\r\n\r\ncommon(\"empty\", {\r\n\r\n /**\r\n * Properties of a google.protobuf.Empty message.\r\n * @interface IEmpty\r\n * @memberof common\r\n */\r\n Empty: {\r\n fields: {}\r\n }\r\n});\r\n\r\ncommon(\"struct\", {\r\n\r\n /**\r\n * Properties of a google.protobuf.Struct message.\r\n * @interface IStruct\r\n * @type {Object}\r\n * @property {Object.} [fields]\r\n * @memberof common\r\n */\r\n Struct: {\r\n fields: {\r\n fields: {\r\n keyType: \"string\",\r\n type: \"Value\",\r\n id: 1\r\n }\r\n }\r\n },\r\n\r\n /**\r\n * Properties of a google.protobuf.Value message.\r\n * @interface IValue\r\n * @type {Object}\r\n * @property {string} [kind]\r\n * @property {0} [nullValue]\r\n * @property {number} [numberValue]\r\n * @property {string} [stringValue]\r\n * @property {boolean} [boolValue]\r\n * @property {IStruct} [structValue]\r\n * @property {IListValue} [listValue]\r\n * @memberof common\r\n */\r\n Value: {\r\n oneofs: {\r\n kind: {\r\n oneof: [\r\n \"nullValue\",\r\n \"numberValue\",\r\n \"stringValue\",\r\n \"boolValue\",\r\n \"structValue\",\r\n \"listValue\"\r\n ]\r\n }\r\n },\r\n fields: {\r\n nullValue: {\r\n type: \"NullValue\",\r\n id: 1\r\n },\r\n numberValue: {\r\n type: \"double\",\r\n id: 2\r\n },\r\n stringValue: {\r\n type: \"string\",\r\n id: 3\r\n },\r\n boolValue: {\r\n type: \"bool\",\r\n id: 4\r\n },\r\n structValue: {\r\n type: \"Struct\",\r\n id: 5\r\n },\r\n listValue: {\r\n type: \"ListValue\",\r\n id: 6\r\n }\r\n }\r\n },\r\n\r\n NullValue: {\r\n values: {\r\n NULL_VALUE: 0\r\n }\r\n },\r\n\r\n /**\r\n * Properties of a google.protobuf.ListValue message.\r\n * @interface IListValue\r\n * @type {Object}\r\n * @property {Array.} [values]\r\n * @memberof common\r\n */\r\n ListValue: {\r\n fields: {\r\n values: {\r\n rule: \"repeated\",\r\n type: \"Value\",\r\n id: 1\r\n }\r\n }\r\n }\r\n});\r\n\r\ncommon(\"wrappers\", {\r\n\r\n /**\r\n * Properties of a google.protobuf.DoubleValue message.\r\n * @interface IDoubleValue\r\n * @type {Object}\r\n * @property {number} [value]\r\n * @memberof common\r\n */\r\n DoubleValue: {\r\n fields: {\r\n value: {\r\n type: \"double\",\r\n id: 1\r\n }\r\n }\r\n },\r\n\r\n /**\r\n * Properties of a google.protobuf.FloatValue message.\r\n * @interface IFloatValue\r\n * @type {Object}\r\n * @property {number} [value]\r\n * @memberof common\r\n */\r\n FloatValue: {\r\n fields: {\r\n value: {\r\n type: \"float\",\r\n id: 1\r\n }\r\n }\r\n },\r\n\r\n /**\r\n * Properties of a google.protobuf.Int64Value message.\r\n * @interface IInt64Value\r\n * @type {Object}\r\n * @property {number|Long} [value]\r\n * @memberof common\r\n */\r\n Int64Value: {\r\n fields: {\r\n value: {\r\n type: \"int64\",\r\n id: 1\r\n }\r\n }\r\n },\r\n\r\n /**\r\n * Properties of a google.protobuf.UInt64Value message.\r\n * @interface IUInt64Value\r\n * @type {Object}\r\n * @property {number|Long} [value]\r\n * @memberof common\r\n */\r\n UInt64Value: {\r\n fields: {\r\n value: {\r\n type: \"uint64\",\r\n id: 1\r\n }\r\n }\r\n },\r\n\r\n /**\r\n * Properties of a google.protobuf.Int32Value message.\r\n * @interface IInt32Value\r\n * @type {Object}\r\n * @property {number} [value]\r\n * @memberof common\r\n */\r\n Int32Value: {\r\n fields: {\r\n value: {\r\n type: \"int32\",\r\n id: 1\r\n }\r\n }\r\n },\r\n\r\n /**\r\n * Properties of a google.protobuf.UInt32Value message.\r\n * @interface IUInt32Value\r\n * @type {Object}\r\n * @property {number} [value]\r\n * @memberof common\r\n */\r\n UInt32Value: {\r\n fields: {\r\n value: {\r\n type: \"uint32\",\r\n id: 1\r\n }\r\n }\r\n },\r\n\r\n /**\r\n * Properties of a google.protobuf.BoolValue message.\r\n * @interface IBoolValue\r\n * @type {Object}\r\n * @property {boolean} [value]\r\n * @memberof common\r\n */\r\n BoolValue: {\r\n fields: {\r\n value: {\r\n type: \"bool\",\r\n id: 1\r\n }\r\n }\r\n },\r\n\r\n /**\r\n * Properties of a google.protobuf.StringValue message.\r\n * @interface IStringValue\r\n * @type {Object}\r\n * @property {string} [value]\r\n * @memberof common\r\n */\r\n StringValue: {\r\n fields: {\r\n value: {\r\n type: \"string\",\r\n id: 1\r\n }\r\n }\r\n },\r\n\r\n /**\r\n * Properties of a google.protobuf.BytesValue message.\r\n * @interface IBytesValue\r\n * @type {Object}\r\n * @property {Uint8Array} [value]\r\n * @memberof common\r\n */\r\n BytesValue: {\r\n fields: {\r\n value: {\r\n type: \"bytes\",\r\n id: 1\r\n }\r\n }\r\n }\r\n});\r\n\r\ncommon(\"field_mask\", {\r\n\r\n /**\r\n * Properties of a google.protobuf.FieldMask message.\r\n * @interface IDoubleValue\r\n * @type {Object}\r\n * @property {number} [value]\r\n * @memberof common\r\n */\r\n FieldMask: {\r\n fields: {\r\n paths: {\r\n rule: \"repeated\",\r\n type: \"string\",\r\n id: 1\r\n }\r\n }\r\n }\r\n});\r\n\r\n/**\r\n * Gets the root definition of the specified common proto file.\r\n *\r\n * Bundled definitions are:\r\n * - google/protobuf/any.proto\r\n * - google/protobuf/duration.proto\r\n * - google/protobuf/empty.proto\r\n * - google/protobuf/field_mask.proto\r\n * - google/protobuf/struct.proto\r\n * - google/protobuf/timestamp.proto\r\n * - google/protobuf/wrappers.proto\r\n *\r\n * @param {string} file Proto file name\r\n * @returns {INamespace|null} Root definition or `null` if not defined\r\n */\r\ncommon.get = function get(file) {\r\n return common[file] || null;\r\n};\r\n","\"use strict\";\r\n/**\r\n * Runtime message from/to plain object converters.\r\n * @namespace\r\n */\r\nvar converter = exports;\r\n\r\nvar Enum = require(\"./enum\"),\r\n util = require(\"./util\");\r\n\r\n/**\r\n * Generates a partial value fromObject conveter.\r\n * @param {Codegen} gen Codegen instance\r\n * @param {Field} field Reflected field\r\n * @param {number} fieldIndex Field index\r\n * @param {string} prop Property reference\r\n * @returns {Codegen} Codegen instance\r\n * @ignore\r\n */\r\nfunction genValuePartial_fromObject(gen, field, fieldIndex, prop) {\r\n var defaultAlreadyEmitted = false;\r\n /* eslint-disable no-unexpected-multiline, block-scoped-var, no-redeclare */\r\n if (field.resolvedType) {\r\n if (field.resolvedType instanceof Enum) { gen\r\n (\"switch(d%s){\", prop);\r\n for (var values = field.resolvedType.values, keys = Object.keys(values), i = 0; i < keys.length; ++i) {\r\n // enum unknown values passthrough\r\n if (values[keys[i]] === field.typeDefault && !defaultAlreadyEmitted) { gen\r\n (\"default:\")\r\n (\"if(typeof(d%s)===\\\"number\\\"){m%s=d%s;break}\", prop, prop, prop);\r\n if (!field.repeated) gen // fallback to default value only for\r\n // arrays, to avoid leaving holes.\r\n (\"break\"); // for non-repeated fields, just ignore\r\n defaultAlreadyEmitted = true;\r\n }\r\n gen\r\n (\"case%j:\", keys[i])\r\n (\"case %i:\", values[keys[i]])\r\n (\"m%s=%j\", prop, values[keys[i]])\r\n (\"break\");\r\n } gen\r\n (\"}\");\r\n } else gen\r\n (\"if(typeof d%s!==\\\"object\\\")\", prop)\r\n (\"throw TypeError(%j)\", field.fullName + \": object expected\")\r\n (\"m%s=types[%i].fromObject(d%s)\", prop, fieldIndex, prop);\r\n } else {\r\n var isUnsigned = false;\r\n switch (field.type) {\r\n case \"double\":\r\n case \"float\": gen\r\n (\"m%s=Number(d%s)\", prop, prop); // also catches \"NaN\", \"Infinity\"\r\n break;\r\n case \"uint32\":\r\n case \"fixed32\": gen\r\n (\"m%s=d%s>>>0\", prop, prop);\r\n break;\r\n case \"int32\":\r\n case \"sint32\":\r\n case \"sfixed32\": gen\r\n (\"m%s=d%s|0\", prop, prop);\r\n break;\r\n case \"uint64\":\r\n isUnsigned = true;\r\n // eslint-disable-next-line no-fallthrough\r\n case \"int64\":\r\n case \"sint64\":\r\n case \"fixed64\":\r\n case \"sfixed64\": gen\r\n (\"if(util.Long)\")\r\n (\"(m%s=util.Long.fromValue(d%s)).unsigned=%j\", prop, prop, isUnsigned)\r\n (\"else if(typeof d%s===\\\"string\\\")\", prop)\r\n (\"m%s=parseInt(d%s,10)\", prop, prop)\r\n (\"else if(typeof d%s===\\\"number\\\")\", prop)\r\n (\"m%s=d%s\", prop, prop)\r\n (\"else if(typeof d%s===\\\"object\\\")\", prop)\r\n (\"m%s=new util.LongBits(d%s.low>>>0,d%s.high>>>0).toNumber(%s)\", prop, prop, prop, isUnsigned ? \"true\" : \"\");\r\n break;\r\n case \"bytes\": gen\r\n (\"if(typeof d%s===\\\"string\\\")\", prop)\r\n (\"util.base64.decode(d%s,m%s=util.newBuffer(util.base64.length(d%s)),0)\", prop, prop, prop)\r\n (\"else if(d%s.length >= 0)\", prop)\r\n (\"m%s=d%s\", prop, prop);\r\n break;\r\n case \"string\": gen\r\n (\"m%s=String(d%s)\", prop, prop);\r\n break;\r\n case \"bool\": gen\r\n (\"m%s=Boolean(d%s)\", prop, prop);\r\n break;\r\n /* default: gen\r\n (\"m%s=d%s\", prop, prop);\r\n break; */\r\n }\r\n }\r\n return gen;\r\n /* eslint-enable no-unexpected-multiline, block-scoped-var, no-redeclare */\r\n}\r\n\r\n/**\r\n * Generates a plain object to runtime message converter specific to the specified message type.\r\n * @param {Type} mtype Message type\r\n * @returns {Codegen} Codegen instance\r\n */\r\nconverter.fromObject = function fromObject(mtype) {\r\n /* eslint-disable no-unexpected-multiline, block-scoped-var, no-redeclare */\r\n var fields = mtype.fieldsArray;\r\n var gen = util.codegen([\"d\"], mtype.name + \"$fromObject\")\r\n (\"if(d instanceof this.ctor)\")\r\n (\"return d\");\r\n if (!fields.length) return gen\r\n (\"return new this.ctor\");\r\n gen\r\n (\"var m=new this.ctor\");\r\n for (var i = 0; i < fields.length; ++i) {\r\n var field = fields[i].resolve(),\r\n prop = util.safeProp(field.name);\r\n\r\n // Map fields\r\n if (field.map) { gen\r\n (\"if(d%s){\", prop)\r\n (\"if(typeof d%s!==\\\"object\\\")\", prop)\r\n (\"throw TypeError(%j)\", field.fullName + \": object expected\")\r\n (\"m%s={}\", prop)\r\n (\"for(var ks=Object.keys(d%s),i=0;i>>0,m%s.high>>>0).toNumber(%s):m%s\", prop, prop, prop, prop, isUnsigned ? \"true\": \"\", prop);\r\n break;\r\n case \"bytes\": gen\r\n (\"d%s=o.bytes===String?util.base64.encode(m%s,0,m%s.length):o.bytes===Array?Array.prototype.slice.call(m%s):m%s\", prop, prop, prop, prop, prop);\r\n break;\r\n default: gen\r\n (\"d%s=m%s\", prop, prop);\r\n break;\r\n }\r\n }\r\n return gen;\r\n /* eslint-enable no-unexpected-multiline, block-scoped-var, no-redeclare */\r\n}\r\n\r\n/**\r\n * Generates a runtime message to plain object converter specific to the specified message type.\r\n * @param {Type} mtype Message type\r\n * @returns {Codegen} Codegen instance\r\n */\r\nconverter.toObject = function toObject(mtype) {\r\n /* eslint-disable no-unexpected-multiline, block-scoped-var, no-redeclare */\r\n var fields = mtype.fieldsArray.slice().sort(util.compareFieldsById);\r\n if (!fields.length)\r\n return util.codegen()(\"return {}\");\r\n var gen = util.codegen([\"m\", \"o\"], mtype.name + \"$toObject\")\r\n (\"if(!o)\")\r\n (\"o={}\")\r\n (\"var d={}\");\r\n\r\n var repeatedFields = [],\r\n mapFields = [],\r\n normalFields = [],\r\n i = 0;\r\n for (; i < fields.length; ++i)\r\n if (!fields[i].partOf)\r\n ( fields[i].resolve().repeated ? repeatedFields\r\n : fields[i].map ? mapFields\r\n : normalFields).push(fields[i]);\r\n\r\n if (repeatedFields.length) { gen\r\n (\"if(o.arrays||o.defaults){\");\r\n for (i = 0; i < repeatedFields.length; ++i) gen\r\n (\"d%s=[]\", util.safeProp(repeatedFields[i].name));\r\n gen\r\n (\"}\");\r\n }\r\n\r\n if (mapFields.length) { gen\r\n (\"if(o.objects||o.defaults){\");\r\n for (i = 0; i < mapFields.length; ++i) gen\r\n (\"d%s={}\", util.safeProp(mapFields[i].name));\r\n gen\r\n (\"}\");\r\n }\r\n\r\n if (normalFields.length) { gen\r\n (\"if(o.defaults){\");\r\n for (i = 0; i < normalFields.length; ++i) {\r\n var field = normalFields[i],\r\n prop = util.safeProp(field.name);\r\n if (field.resolvedType instanceof Enum) gen\r\n (\"d%s=o.enums===String?%j:%j\", prop, field.resolvedType.valuesById[field.typeDefault], field.typeDefault);\r\n else if (field.long) gen\r\n (\"if(util.Long){\")\r\n (\"var n=new util.Long(%i,%i,%j)\", field.typeDefault.low, field.typeDefault.high, field.typeDefault.unsigned)\r\n (\"d%s=o.longs===String?n.toString():o.longs===Number?n.toNumber():n\", prop)\r\n (\"}else\")\r\n (\"d%s=o.longs===String?%j:%i\", prop, field.typeDefault.toString(), field.typeDefault.toNumber());\r\n else if (field.bytes) {\r\n var arrayDefault = \"[\" + Array.prototype.slice.call(field.typeDefault).join(\",\") + \"]\";\r\n gen\r\n (\"if(o.bytes===String)d%s=%j\", prop, String.fromCharCode.apply(String, field.typeDefault))\r\n (\"else{\")\r\n (\"d%s=%s\", prop, arrayDefault)\r\n (\"if(o.bytes!==Array)d%s=util.newBuffer(d%s)\", prop, prop)\r\n (\"}\");\r\n } else gen\r\n (\"d%s=%j\", prop, field.typeDefault); // also messages (=null)\r\n } gen\r\n (\"}\");\r\n }\r\n var hasKs2 = false;\r\n for (i = 0; i < fields.length; ++i) {\r\n var field = fields[i],\r\n index = mtype._fieldsArray.indexOf(field),\r\n prop = util.safeProp(field.name);\r\n if (field.map) {\r\n if (!hasKs2) { hasKs2 = true; gen\r\n (\"var ks2\");\r\n } gen\r\n (\"if(m%s&&(ks2=Object.keys(m%s)).length){\", prop, prop)\r\n (\"d%s={}\", prop)\r\n (\"for(var j=0;j>>3){\");\r\n\r\n var i = 0;\r\n for (; i < /* initializes */ mtype.fieldsArray.length; ++i) {\r\n var field = mtype._fieldsArray[i].resolve(),\r\n type = field.resolvedType instanceof Enum ? \"int32\" : field.type,\r\n ref = \"m\" + util.safeProp(field.name); gen\r\n (\"case %i: {\", field.id);\r\n\r\n // Map fields\r\n if (field.map) { gen\r\n (\"if(%s===util.emptyObject)\", ref)\r\n (\"%s={}\", ref)\r\n (\"var c2 = r.uint32()+r.pos\");\r\n\r\n if (types.defaults[field.keyType] !== undefined) gen\r\n (\"k=%j\", types.defaults[field.keyType]);\r\n else gen\r\n (\"k=null\");\r\n\r\n if (types.defaults[type] !== undefined) gen\r\n (\"value=%j\", types.defaults[type]);\r\n else gen\r\n (\"value=null\");\r\n\r\n gen\r\n (\"while(r.pos>>3){\")\r\n (\"case 1: k=r.%s(); break\", field.keyType)\r\n (\"case 2:\");\r\n\r\n if (types.basic[type] === undefined) gen\r\n (\"value=types[%i].decode(r,r.uint32())\", i); // can't be groups\r\n else gen\r\n (\"value=r.%s()\", type);\r\n\r\n gen\r\n (\"break\")\r\n (\"default:\")\r\n (\"r.skipType(tag2&7)\")\r\n (\"break\")\r\n (\"}\")\r\n (\"}\");\r\n\r\n if (types.long[field.keyType] !== undefined) gen\r\n (\"%s[typeof k===\\\"object\\\"?util.longToHash(k):k]=value\", ref);\r\n else gen\r\n (\"%s[k]=value\", ref);\r\n\r\n // Repeated fields\r\n } else if (field.repeated) { gen\r\n\r\n (\"if(!(%s&&%s.length))\", ref, ref)\r\n (\"%s=[]\", ref);\r\n\r\n // Packable (always check for forward and backward compatiblity)\r\n if (types.packed[type] !== undefined) gen\r\n (\"if((t&7)===2){\")\r\n (\"var c2=r.uint32()+r.pos\")\r\n (\"while(r.pos>> 0, (field.id << 3 | 4) >>> 0)\r\n : gen(\"types[%i].encode(%s,w.uint32(%i).fork()).ldelim()\", fieldIndex, ref, (field.id << 3 | 2) >>> 0);\r\n}\r\n\r\n/**\r\n * Generates an encoder specific to the specified message type.\r\n * @param {Type} mtype Message type\r\n * @returns {Codegen} Codegen instance\r\n */\r\nfunction encoder(mtype) {\r\n /* eslint-disable no-unexpected-multiline, block-scoped-var, no-redeclare */\r\n var gen = util.codegen([\"m\", \"w\"], mtype.name + \"$encode\")\r\n (\"if(!w)\")\r\n (\"w=Writer.create()\");\r\n\r\n var i, ref;\r\n\r\n // \"when a message is serialized its known fields should be written sequentially by field number\"\r\n var fields = /* initializes */ mtype.fieldsArray.slice().sort(util.compareFieldsById);\r\n\r\n for (var i = 0; i < fields.length; ++i) {\r\n var field = fields[i].resolve(),\r\n index = mtype._fieldsArray.indexOf(field),\r\n type = field.resolvedType instanceof Enum ? \"int32\" : field.type,\r\n wireType = types.basic[type];\r\n ref = \"m\" + util.safeProp(field.name);\r\n\r\n // Map fields\r\n if (field.map) {\r\n gen\r\n (\"if(%s!=null&&Object.hasOwnProperty.call(m,%j)){\", ref, field.name) // !== undefined && !== null\r\n (\"for(var ks=Object.keys(%s),i=0;i>> 0, 8 | types.mapKey[field.keyType], field.keyType);\r\n if (wireType === undefined) gen\r\n (\"types[%i].encode(%s[ks[i]],w.uint32(18).fork()).ldelim().ldelim()\", index, ref); // can't be groups\r\n else gen\r\n (\".uint32(%i).%s(%s[ks[i]]).ldelim()\", 16 | wireType, type, ref);\r\n gen\r\n (\"}\")\r\n (\"}\");\r\n\r\n // Repeated fields\r\n } else if (field.repeated) { gen\r\n (\"if(%s!=null&&%s.length){\", ref, ref); // !== undefined && !== null\r\n\r\n // Packed repeated\r\n if (field.packed && types.packed[type] !== undefined) { gen\r\n\r\n (\"w.uint32(%i).fork()\", (field.id << 3 | 2) >>> 0)\r\n (\"for(var i=0;i<%s.length;++i)\", ref)\r\n (\"w.%s(%s[i])\", type, ref)\r\n (\"w.ldelim()\");\r\n\r\n // Non-packed\r\n } else { gen\r\n\r\n (\"for(var i=0;i<%s.length;++i)\", ref);\r\n if (wireType === undefined)\r\n genTypePartial(gen, field, index, ref + \"[i]\");\r\n else gen\r\n (\"w.uint32(%i).%s(%s[i])\", (field.id << 3 | wireType) >>> 0, type, ref);\r\n\r\n } gen\r\n (\"}\");\r\n\r\n // Non-repeated\r\n } else {\r\n if (field.optional) gen\r\n (\"if(%s!=null&&Object.hasOwnProperty.call(m,%j))\", ref, field.name); // !== undefined && !== null\r\n\r\n if (wireType === undefined)\r\n genTypePartial(gen, field, index, ref);\r\n else gen\r\n (\"w.uint32(%i).%s(%s)\", (field.id << 3 | wireType) >>> 0, type, ref);\r\n\r\n }\r\n }\r\n\r\n return gen\r\n (\"return w\");\r\n /* eslint-enable no-unexpected-multiline, block-scoped-var, no-redeclare */\r\n}\r\n","\"use strict\";\r\nmodule.exports = Enum;\r\n\r\n// extends ReflectionObject\r\nvar ReflectionObject = require(\"./object\");\r\n((Enum.prototype = Object.create(ReflectionObject.prototype)).constructor = Enum).className = \"Enum\";\r\n\r\nvar Namespace = require(\"./namespace\"),\r\n util = require(\"./util\");\r\n\r\n/**\r\n * Constructs a new enum instance.\r\n * @classdesc Reflected enum.\r\n * @extends ReflectionObject\r\n * @constructor\r\n * @param {string} name Unique name within its namespace\r\n * @param {Object.} [values] Enum values as an object, by name\r\n * @param {Object.} [options] Declared options\r\n * @param {string} [comment] The comment for this enum\r\n * @param {Object.} [comments] The value comments for this enum\r\n * @param {Object.>|undefined} [valuesOptions] The value options for this enum\r\n */\r\nfunction Enum(name, values, options, comment, comments, valuesOptions) {\r\n ReflectionObject.call(this, name, options);\r\n\r\n if (values && typeof values !== \"object\")\r\n throw TypeError(\"values must be an object\");\r\n\r\n /**\r\n * Enum values by id.\r\n * @type {Object.}\r\n */\r\n this.valuesById = {};\r\n\r\n /**\r\n * Enum values by name.\r\n * @type {Object.}\r\n */\r\n this.values = Object.create(this.valuesById); // toJSON, marker\r\n\r\n /**\r\n * Enum comment text.\r\n * @type {string|null}\r\n */\r\n this.comment = comment;\r\n\r\n /**\r\n * Value comment texts, if any.\r\n * @type {Object.}\r\n */\r\n this.comments = comments || {};\r\n\r\n /**\r\n * Values options, if any\r\n * @type {Object>|undefined}\r\n */\r\n this.valuesOptions = valuesOptions;\r\n\r\n /**\r\n * Reserved ranges, if any.\r\n * @type {Array.}\r\n */\r\n this.reserved = undefined; // toJSON\r\n\r\n // Note that values inherit valuesById on their prototype which makes them a TypeScript-\r\n // compatible enum. This is used by pbts to write actual enum definitions that work for\r\n // static and reflection code alike instead of emitting generic object definitions.\r\n\r\n if (values)\r\n for (var keys = Object.keys(values), i = 0; i < keys.length; ++i)\r\n if (typeof values[keys[i]] === \"number\") // use forward entries only\r\n this.valuesById[ this.values[keys[i]] = values[keys[i]] ] = keys[i];\r\n}\r\n\r\n/**\r\n * Enum descriptor.\r\n * @interface IEnum\r\n * @property {Object.} values Enum values\r\n * @property {Object.} [options] Enum options\r\n */\r\n\r\n/**\r\n * Constructs an enum from an enum descriptor.\r\n * @param {string} name Enum name\r\n * @param {IEnum} json Enum descriptor\r\n * @returns {Enum} Created enum\r\n * @throws {TypeError} If arguments are invalid\r\n */\r\nEnum.fromJSON = function fromJSON(name, json) {\r\n var enm = new Enum(name, json.values, json.options, json.comment, json.comments);\r\n enm.reserved = json.reserved;\r\n return enm;\r\n};\r\n\r\n/**\r\n * Converts this enum to an enum descriptor.\r\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\r\n * @returns {IEnum} Enum descriptor\r\n */\r\nEnum.prototype.toJSON = function toJSON(toJSONOptions) {\r\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\r\n return util.toObject([\r\n \"options\" , this.options,\r\n \"valuesOptions\" , this.valuesOptions,\r\n \"values\" , this.values,\r\n \"reserved\" , this.reserved && this.reserved.length ? this.reserved : undefined,\r\n \"comment\" , keepComments ? this.comment : undefined,\r\n \"comments\" , keepComments ? this.comments : undefined\r\n ]);\r\n};\r\n\r\n/**\r\n * Adds a value to this enum.\r\n * @param {string} name Value name\r\n * @param {number} id Value id\r\n * @param {string} [comment] Comment, if any\r\n * @param {Object.|undefined} [options] Options, if any\r\n * @returns {Enum} `this`\r\n * @throws {TypeError} If arguments are invalid\r\n * @throws {Error} If there is already a value with this name or id\r\n */\r\nEnum.prototype.add = function add(name, id, comment, options) {\r\n // utilized by the parser but not by .fromJSON\r\n\r\n if (!util.isString(name))\r\n throw TypeError(\"name must be a string\");\r\n\r\n if (!util.isInteger(id))\r\n throw TypeError(\"id must be an integer\");\r\n\r\n if (this.values[name] !== undefined)\r\n throw Error(\"duplicate name '\" + name + \"' in \" + this);\r\n\r\n if (this.isReservedId(id))\r\n throw Error(\"id \" + id + \" is reserved in \" + this);\r\n\r\n if (this.isReservedName(name))\r\n throw Error(\"name '\" + name + \"' is reserved in \" + this);\r\n\r\n if (this.valuesById[id] !== undefined) {\r\n if (!(this.options && this.options.allow_alias))\r\n throw Error(\"duplicate id \" + id + \" in \" + this);\r\n this.values[name] = id;\r\n } else\r\n this.valuesById[this.values[name] = id] = name;\r\n\r\n if (options) {\r\n if (this.valuesOptions === undefined)\r\n this.valuesOptions = {};\r\n this.valuesOptions[name] = options || null;\r\n }\r\n\r\n this.comments[name] = comment || null;\r\n return this;\r\n};\r\n\r\n/**\r\n * Removes a value from this enum\r\n * @param {string} name Value name\r\n * @returns {Enum} `this`\r\n * @throws {TypeError} If arguments are invalid\r\n * @throws {Error} If `name` is not a name of this enum\r\n */\r\nEnum.prototype.remove = function remove(name) {\r\n\r\n if (!util.isString(name))\r\n throw TypeError(\"name must be a string\");\r\n\r\n var val = this.values[name];\r\n if (val == null)\r\n throw Error(\"name '\" + name + \"' does not exist in \" + this);\r\n\r\n delete this.valuesById[val];\r\n delete this.values[name];\r\n delete this.comments[name];\r\n if (this.valuesOptions)\r\n delete this.valuesOptions[name];\r\n\r\n return this;\r\n};\r\n\r\n/**\r\n * Tests if the specified id is reserved.\r\n * @param {number} id Id to test\r\n * @returns {boolean} `true` if reserved, otherwise `false`\r\n */\r\nEnum.prototype.isReservedId = function isReservedId(id) {\r\n return Namespace.isReservedId(this.reserved, id);\r\n};\r\n\r\n/**\r\n * Tests if the specified name is reserved.\r\n * @param {string} name Name to test\r\n * @returns {boolean} `true` if reserved, otherwise `false`\r\n */\r\nEnum.prototype.isReservedName = function isReservedName(name) {\r\n return Namespace.isReservedName(this.reserved, name);\r\n};\r\n","\"use strict\";\r\nmodule.exports = Field;\r\n\r\n// extends ReflectionObject\r\nvar ReflectionObject = require(\"./object\");\r\n((Field.prototype = Object.create(ReflectionObject.prototype)).constructor = Field).className = \"Field\";\r\n\r\nvar Enum = require(\"./enum\"),\r\n types = require(\"./types\"),\r\n util = require(\"./util\");\r\n\r\nvar Type; // cyclic\r\n\r\nvar ruleRe = /^required|optional|repeated$/;\r\n\r\n/**\r\n * Constructs a new message field instance. Note that {@link MapField|map fields} have their own class.\r\n * @name Field\r\n * @classdesc Reflected message field.\r\n * @extends FieldBase\r\n * @constructor\r\n * @param {string} name Unique name within its namespace\r\n * @param {number} id Unique id within its namespace\r\n * @param {string} type Value type\r\n * @param {string|Object.} [rule=\"optional\"] Field rule\r\n * @param {string|Object.} [extend] Extended type if different from parent\r\n * @param {Object.} [options] Declared options\r\n */\r\n\r\n/**\r\n * Constructs a field from a field descriptor.\r\n * @param {string} name Field name\r\n * @param {IField} json Field descriptor\r\n * @returns {Field} Created field\r\n * @throws {TypeError} If arguments are invalid\r\n */\r\nField.fromJSON = function fromJSON(name, json) {\r\n return new Field(name, json.id, json.type, json.rule, json.extend, json.options, json.comment);\r\n};\r\n\r\n/**\r\n * Not an actual constructor. Use {@link Field} instead.\r\n * @classdesc Base class of all reflected message fields. This is not an actual class but here for the sake of having consistent type definitions.\r\n * @exports FieldBase\r\n * @extends ReflectionObject\r\n * @constructor\r\n * @param {string} name Unique name within its namespace\r\n * @param {number} id Unique id within its namespace\r\n * @param {string} type Value type\r\n * @param {string|Object.} [rule=\"optional\"] Field rule\r\n * @param {string|Object.} [extend] Extended type if different from parent\r\n * @param {Object.} [options] Declared options\r\n * @param {string} [comment] Comment associated with this field\r\n */\r\nfunction Field(name, id, type, rule, extend, options, comment) {\r\n\r\n if (util.isObject(rule)) {\r\n comment = extend;\r\n options = rule;\r\n rule = extend = undefined;\r\n } else if (util.isObject(extend)) {\r\n comment = options;\r\n options = extend;\r\n extend = undefined;\r\n }\r\n\r\n ReflectionObject.call(this, name, options);\r\n\r\n if (!util.isInteger(id) || id < 0)\r\n throw TypeError(\"id must be a non-negative integer\");\r\n\r\n if (!util.isString(type))\r\n throw TypeError(\"type must be a string\");\r\n\r\n if (rule !== undefined && !ruleRe.test(rule = rule.toString().toLowerCase()))\r\n throw TypeError(\"rule must be a string rule\");\r\n\r\n if (extend !== undefined && !util.isString(extend))\r\n throw TypeError(\"extend must be a string\");\r\n\r\n /**\r\n * Field rule, if any.\r\n * @type {string|undefined}\r\n */\r\n if (rule === \"proto3_optional\") {\r\n rule = \"optional\";\r\n }\r\n this.rule = rule && rule !== \"optional\" ? rule : undefined; // toJSON\r\n\r\n /**\r\n * Field type.\r\n * @type {string}\r\n */\r\n this.type = type; // toJSON\r\n\r\n /**\r\n * Unique field id.\r\n * @type {number}\r\n */\r\n this.id = id; // toJSON, marker\r\n\r\n /**\r\n * Extended type if different from parent.\r\n * @type {string|undefined}\r\n */\r\n this.extend = extend || undefined; // toJSON\r\n\r\n /**\r\n * Whether this field is required.\r\n * @type {boolean}\r\n */\r\n this.required = rule === \"required\";\r\n\r\n /**\r\n * Whether this field is optional.\r\n * @type {boolean}\r\n */\r\n this.optional = !this.required;\r\n\r\n /**\r\n * Whether this field is repeated.\r\n * @type {boolean}\r\n */\r\n this.repeated = rule === \"repeated\";\r\n\r\n /**\r\n * Whether this field is a map or not.\r\n * @type {boolean}\r\n */\r\n this.map = false;\r\n\r\n /**\r\n * Message this field belongs to.\r\n * @type {Type|null}\r\n */\r\n this.message = null;\r\n\r\n /**\r\n * OneOf this field belongs to, if any,\r\n * @type {OneOf|null}\r\n */\r\n this.partOf = null;\r\n\r\n /**\r\n * The field type's default value.\r\n * @type {*}\r\n */\r\n this.typeDefault = null;\r\n\r\n /**\r\n * The field's default value on prototypes.\r\n * @type {*}\r\n */\r\n this.defaultValue = null;\r\n\r\n /**\r\n * Whether this field's value should be treated as a long.\r\n * @type {boolean}\r\n */\r\n this.long = util.Long ? types.long[type] !== undefined : /* istanbul ignore next */ false;\r\n\r\n /**\r\n * Whether this field's value is a buffer.\r\n * @type {boolean}\r\n */\r\n this.bytes = type === \"bytes\";\r\n\r\n /**\r\n * Resolved type if not a basic type.\r\n * @type {Type|Enum|null}\r\n */\r\n this.resolvedType = null;\r\n\r\n /**\r\n * Sister-field within the extended type if a declaring extension field.\r\n * @type {Field|null}\r\n */\r\n this.extensionField = null;\r\n\r\n /**\r\n * Sister-field within the declaring namespace if an extended field.\r\n * @type {Field|null}\r\n */\r\n this.declaringField = null;\r\n\r\n /**\r\n * Internally remembers whether this field is packed.\r\n * @type {boolean|null}\r\n * @private\r\n */\r\n this._packed = null;\r\n\r\n /**\r\n * Comment for this field.\r\n * @type {string|null}\r\n */\r\n this.comment = comment;\r\n}\r\n\r\n/**\r\n * Determines whether this field is packed. Only relevant when repeated and working with proto2.\r\n * @name Field#packed\r\n * @type {boolean}\r\n * @readonly\r\n */\r\nObject.defineProperty(Field.prototype, \"packed\", {\r\n get: function() {\r\n // defaults to packed=true if not explicity set to false\r\n if (this._packed === null)\r\n this._packed = this.getOption(\"packed\") !== false;\r\n return this._packed;\r\n }\r\n});\r\n\r\n/**\r\n * @override\r\n */\r\nField.prototype.setOption = function setOption(name, value, ifNotSet) {\r\n if (name === \"packed\") // clear cached before setting\r\n this._packed = null;\r\n return ReflectionObject.prototype.setOption.call(this, name, value, ifNotSet);\r\n};\r\n\r\n/**\r\n * Field descriptor.\r\n * @interface IField\r\n * @property {string} [rule=\"optional\"] Field rule\r\n * @property {string} type Field type\r\n * @property {number} id Field id\r\n * @property {Object.} [options] Field options\r\n */\r\n\r\n/**\r\n * Extension field descriptor.\r\n * @interface IExtensionField\r\n * @extends IField\r\n * @property {string} extend Extended type\r\n */\r\n\r\n/**\r\n * Converts this field to a field descriptor.\r\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\r\n * @returns {IField} Field descriptor\r\n */\r\nField.prototype.toJSON = function toJSON(toJSONOptions) {\r\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\r\n return util.toObject([\r\n \"rule\" , this.rule !== \"optional\" && this.rule || undefined,\r\n \"type\" , this.type,\r\n \"id\" , this.id,\r\n \"extend\" , this.extend,\r\n \"options\" , this.options,\r\n \"comment\" , keepComments ? this.comment : undefined\r\n ]);\r\n};\r\n\r\n/**\r\n * Resolves this field's type references.\r\n * @returns {Field} `this`\r\n * @throws {Error} If any reference cannot be resolved\r\n */\r\nField.prototype.resolve = function resolve() {\r\n\r\n if (this.resolved)\r\n return this;\r\n\r\n if ((this.typeDefault = types.defaults[this.type]) === undefined) { // if not a basic type, resolve it\r\n this.resolvedType = (this.declaringField ? this.declaringField.parent : this.parent).lookupTypeOrEnum(this.type);\r\n if (this.resolvedType instanceof Type)\r\n this.typeDefault = null;\r\n else // instanceof Enum\r\n this.typeDefault = this.resolvedType.values[Object.keys(this.resolvedType.values)[0]]; // first defined\r\n } else if (this.options && this.options.proto3_optional) {\r\n // proto3 scalar value marked optional; should default to null\r\n this.typeDefault = null;\r\n }\r\n\r\n // use explicitly set default value if present\r\n if (this.options && this.options[\"default\"] != null) {\r\n this.typeDefault = this.options[\"default\"];\r\n if (this.resolvedType instanceof Enum && typeof this.typeDefault === \"string\")\r\n this.typeDefault = this.resolvedType.values[this.typeDefault];\r\n }\r\n\r\n // remove unnecessary options\r\n if (this.options) {\r\n if (this.options.packed === true || this.options.packed !== undefined && this.resolvedType && !(this.resolvedType instanceof Enum))\r\n delete this.options.packed;\r\n if (!Object.keys(this.options).length)\r\n this.options = undefined;\r\n }\r\n\r\n // convert to internal data type if necesssary\r\n if (this.long) {\r\n this.typeDefault = util.Long.fromNumber(this.typeDefault, this.type.charAt(0) === \"u\");\r\n\r\n /* istanbul ignore else */\r\n if (Object.freeze)\r\n Object.freeze(this.typeDefault); // long instances are meant to be immutable anyway (i.e. use small int cache that even requires it)\r\n\r\n } else if (this.bytes && typeof this.typeDefault === \"string\") {\r\n var buf;\r\n if (util.base64.test(this.typeDefault))\r\n util.base64.decode(this.typeDefault, buf = util.newBuffer(util.base64.length(this.typeDefault)), 0);\r\n else\r\n util.utf8.write(this.typeDefault, buf = util.newBuffer(util.utf8.length(this.typeDefault)), 0);\r\n this.typeDefault = buf;\r\n }\r\n\r\n // take special care of maps and repeated fields\r\n if (this.map)\r\n this.defaultValue = util.emptyObject;\r\n else if (this.repeated)\r\n this.defaultValue = util.emptyArray;\r\n else\r\n this.defaultValue = this.typeDefault;\r\n\r\n // ensure proper value on prototype\r\n if (this.parent instanceof Type)\r\n this.parent.ctor.prototype[this.name] = this.defaultValue;\r\n\r\n return ReflectionObject.prototype.resolve.call(this);\r\n};\r\n\r\n/**\r\n * Decorator function as returned by {@link Field.d} and {@link MapField.d} (TypeScript).\r\n * @typedef FieldDecorator\r\n * @type {function}\r\n * @param {Object} prototype Target prototype\r\n * @param {string} fieldName Field name\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Field decorator (TypeScript).\r\n * @name Field.d\r\n * @function\r\n * @param {number} fieldId Field id\r\n * @param {\"double\"|\"float\"|\"int32\"|\"uint32\"|\"sint32\"|\"fixed32\"|\"sfixed32\"|\"int64\"|\"uint64\"|\"sint64\"|\"fixed64\"|\"sfixed64\"|\"string\"|\"bool\"|\"bytes\"|Object} fieldType Field type\r\n * @param {\"optional\"|\"required\"|\"repeated\"} [fieldRule=\"optional\"] Field rule\r\n * @param {T} [defaultValue] Default value\r\n * @returns {FieldDecorator} Decorator function\r\n * @template T extends number | number[] | Long | Long[] | string | string[] | boolean | boolean[] | Uint8Array | Uint8Array[] | Buffer | Buffer[]\r\n */\r\nField.d = function decorateField(fieldId, fieldType, fieldRule, defaultValue) {\r\n\r\n // submessage: decorate the submessage and use its name as the type\r\n if (typeof fieldType === \"function\")\r\n fieldType = util.decorateType(fieldType).name;\r\n\r\n // enum reference: create a reflected copy of the enum and keep reuseing it\r\n else if (fieldType && typeof fieldType === \"object\")\r\n fieldType = util.decorateEnum(fieldType).name;\r\n\r\n return function fieldDecorator(prototype, fieldName) {\r\n util.decorateType(prototype.constructor)\r\n .add(new Field(fieldName, fieldId, fieldType, fieldRule, { \"default\": defaultValue }));\r\n };\r\n};\r\n\r\n/**\r\n * Field decorator (TypeScript).\r\n * @name Field.d\r\n * @function\r\n * @param {number} fieldId Field id\r\n * @param {Constructor|string} fieldType Field type\r\n * @param {\"optional\"|\"required\"|\"repeated\"} [fieldRule=\"optional\"] Field rule\r\n * @returns {FieldDecorator} Decorator function\r\n * @template T extends Message\r\n * @variation 2\r\n */\r\n// like Field.d but without a default value\r\n\r\n// Sets up cyclic dependencies (called in index-light)\r\nField._configure = function configure(Type_) {\r\n Type = Type_;\r\n};\r\n","\"use strict\";\r\nvar protobuf = module.exports = require(\"./index-minimal\");\r\n\r\nprotobuf.build = \"light\";\r\n\r\n/**\r\n * A node-style callback as used by {@link load} and {@link Root#load}.\r\n * @typedef LoadCallback\r\n * @type {function}\r\n * @param {Error|null} error Error, if any, otherwise `null`\r\n * @param {Root} [root] Root, if there hasn't been an error\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Loads one or multiple .proto or preprocessed .json files into a common root namespace and calls the callback.\r\n * @param {string|string[]} filename One or multiple files to load\r\n * @param {Root} root Root namespace, defaults to create a new one if omitted.\r\n * @param {LoadCallback} callback Callback function\r\n * @returns {undefined}\r\n * @see {@link Root#load}\r\n */\r\nfunction load(filename, root, callback) {\r\n if (typeof root === \"function\") {\r\n callback = root;\r\n root = new protobuf.Root();\r\n } else if (!root)\r\n root = new protobuf.Root();\r\n return root.load(filename, callback);\r\n}\r\n\r\n/**\r\n * Loads one or multiple .proto or preprocessed .json files into a common root namespace and calls the callback.\r\n * @name load\r\n * @function\r\n * @param {string|string[]} filename One or multiple files to load\r\n * @param {LoadCallback} callback Callback function\r\n * @returns {undefined}\r\n * @see {@link Root#load}\r\n * @variation 2\r\n */\r\n// function load(filename:string, callback:LoadCallback):undefined\r\n\r\n/**\r\n * Loads one or multiple .proto or preprocessed .json files into a common root namespace and returns a promise.\r\n * @name load\r\n * @function\r\n * @param {string|string[]} filename One or multiple files to load\r\n * @param {Root} [root] Root namespace, defaults to create a new one if omitted.\r\n * @returns {Promise} Promise\r\n * @see {@link Root#load}\r\n * @variation 3\r\n */\r\n// function load(filename:string, [root:Root]):Promise\r\n\r\nprotobuf.load = load;\r\n\r\n/**\r\n * Synchronously loads one or multiple .proto or preprocessed .json files into a common root namespace (node only).\r\n * @param {string|string[]} filename One or multiple files to load\r\n * @param {Root} [root] Root namespace, defaults to create a new one if omitted.\r\n * @returns {Root} Root namespace\r\n * @throws {Error} If synchronous fetching is not supported (i.e. in browsers) or if a file's syntax is invalid\r\n * @see {@link Root#loadSync}\r\n */\r\nfunction loadSync(filename, root) {\r\n if (!root)\r\n root = new protobuf.Root();\r\n return root.loadSync(filename);\r\n}\r\n\r\nprotobuf.loadSync = loadSync;\r\n\r\n// Serialization\r\nprotobuf.encoder = require(\"./encoder\");\r\nprotobuf.decoder = require(\"./decoder\");\r\nprotobuf.verifier = require(\"./verifier\");\r\nprotobuf.converter = require(\"./converter\");\r\n\r\n// Reflection\r\nprotobuf.ReflectionObject = require(\"./object\");\r\nprotobuf.Namespace = require(\"./namespace\");\r\nprotobuf.Root = require(\"./root\");\r\nprotobuf.Enum = require(\"./enum\");\r\nprotobuf.Type = require(\"./type\");\r\nprotobuf.Field = require(\"./field\");\r\nprotobuf.OneOf = require(\"./oneof\");\r\nprotobuf.MapField = require(\"./mapfield\");\r\nprotobuf.Service = require(\"./service\");\r\nprotobuf.Method = require(\"./method\");\r\n\r\n// Runtime\r\nprotobuf.Message = require(\"./message\");\r\nprotobuf.wrappers = require(\"./wrappers\");\r\n\r\n// Utility\r\nprotobuf.types = require(\"./types\");\r\nprotobuf.util = require(\"./util\");\r\n\r\n// Set up possibly cyclic reflection dependencies\r\nprotobuf.ReflectionObject._configure(protobuf.Root);\r\nprotobuf.Namespace._configure(protobuf.Type, protobuf.Service, protobuf.Enum);\r\nprotobuf.Root._configure(protobuf.Type);\r\nprotobuf.Field._configure(protobuf.Type);\r\n","\"use strict\";\r\nvar protobuf = exports;\r\n\r\n/**\r\n * Build type, one of `\"full\"`, `\"light\"` or `\"minimal\"`.\r\n * @name build\r\n * @type {string}\r\n * @const\r\n */\r\nprotobuf.build = \"minimal\";\r\n\r\n// Serialization\r\nprotobuf.Writer = require(\"./writer\");\r\nprotobuf.BufferWriter = require(\"./writer_buffer\");\r\nprotobuf.Reader = require(\"./reader\");\r\nprotobuf.BufferReader = require(\"./reader_buffer\");\r\n\r\n// Utility\r\nprotobuf.util = require(\"./util/minimal\");\r\nprotobuf.rpc = require(\"./rpc\");\r\nprotobuf.roots = require(\"./roots\");\r\nprotobuf.configure = configure;\r\n\r\n/* istanbul ignore next */\r\n/**\r\n * Reconfigures the library according to the environment.\r\n * @returns {undefined}\r\n */\r\nfunction configure() {\r\n protobuf.util._configure();\r\n protobuf.Writer._configure(protobuf.BufferWriter);\r\n protobuf.Reader._configure(protobuf.BufferReader);\r\n}\r\n\r\n// Set up buffer utility according to the environment\r\nconfigure();\r\n","\"use strict\";\r\nvar protobuf = module.exports = require(\"./index-light\");\r\n\r\nprotobuf.build = \"full\";\r\n\r\n// Parser\r\nprotobuf.tokenize = require(\"./tokenize\");\r\nprotobuf.parse = require(\"./parse\");\r\nprotobuf.common = require(\"./common\");\r\n\r\n// Configure parser\r\nprotobuf.Root._configure(protobuf.Type, protobuf.parse, protobuf.common);\r\n","\"use strict\";\r\nmodule.exports = MapField;\r\n\r\n// extends Field\r\nvar Field = require(\"./field\");\r\n((MapField.prototype = Object.create(Field.prototype)).constructor = MapField).className = \"MapField\";\r\n\r\nvar types = require(\"./types\"),\r\n util = require(\"./util\");\r\n\r\n/**\r\n * Constructs a new map field instance.\r\n * @classdesc Reflected map field.\r\n * @extends FieldBase\r\n * @constructor\r\n * @param {string} name Unique name within its namespace\r\n * @param {number} id Unique id within its namespace\r\n * @param {string} keyType Key type\r\n * @param {string} type Value type\r\n * @param {Object.} [options] Declared options\r\n * @param {string} [comment] Comment associated with this field\r\n */\r\nfunction MapField(name, id, keyType, type, options, comment) {\r\n Field.call(this, name, id, type, undefined, undefined, options, comment);\r\n\r\n /* istanbul ignore if */\r\n if (!util.isString(keyType))\r\n throw TypeError(\"keyType must be a string\");\r\n\r\n /**\r\n * Key type.\r\n * @type {string}\r\n */\r\n this.keyType = keyType; // toJSON, marker\r\n\r\n /**\r\n * Resolved key type if not a basic type.\r\n * @type {ReflectionObject|null}\r\n */\r\n this.resolvedKeyType = null;\r\n\r\n // Overrides Field#map\r\n this.map = true;\r\n}\r\n\r\n/**\r\n * Map field descriptor.\r\n * @interface IMapField\r\n * @extends {IField}\r\n * @property {string} keyType Key type\r\n */\r\n\r\n/**\r\n * Extension map field descriptor.\r\n * @interface IExtensionMapField\r\n * @extends IMapField\r\n * @property {string} extend Extended type\r\n */\r\n\r\n/**\r\n * Constructs a map field from a map field descriptor.\r\n * @param {string} name Field name\r\n * @param {IMapField} json Map field descriptor\r\n * @returns {MapField} Created map field\r\n * @throws {TypeError} If arguments are invalid\r\n */\r\nMapField.fromJSON = function fromJSON(name, json) {\r\n return new MapField(name, json.id, json.keyType, json.type, json.options, json.comment);\r\n};\r\n\r\n/**\r\n * Converts this map field to a map field descriptor.\r\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\r\n * @returns {IMapField} Map field descriptor\r\n */\r\nMapField.prototype.toJSON = function toJSON(toJSONOptions) {\r\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\r\n return util.toObject([\r\n \"keyType\" , this.keyType,\r\n \"type\" , this.type,\r\n \"id\" , this.id,\r\n \"extend\" , this.extend,\r\n \"options\" , this.options,\r\n \"comment\" , keepComments ? this.comment : undefined\r\n ]);\r\n};\r\n\r\n/**\r\n * @override\r\n */\r\nMapField.prototype.resolve = function resolve() {\r\n if (this.resolved)\r\n return this;\r\n\r\n // Besides a value type, map fields have a key type that may be \"any scalar type except for floating point types and bytes\"\r\n if (types.mapKey[this.keyType] === undefined)\r\n throw Error(\"invalid key type: \" + this.keyType);\r\n\r\n return Field.prototype.resolve.call(this);\r\n};\r\n\r\n/**\r\n * Map field decorator (TypeScript).\r\n * @name MapField.d\r\n * @function\r\n * @param {number} fieldId Field id\r\n * @param {\"int32\"|\"uint32\"|\"sint32\"|\"fixed32\"|\"sfixed32\"|\"int64\"|\"uint64\"|\"sint64\"|\"fixed64\"|\"sfixed64\"|\"bool\"|\"string\"} fieldKeyType Field key type\r\n * @param {\"double\"|\"float\"|\"int32\"|\"uint32\"|\"sint32\"|\"fixed32\"|\"sfixed32\"|\"int64\"|\"uint64\"|\"sint64\"|\"fixed64\"|\"sfixed64\"|\"bool\"|\"string\"|\"bytes\"|Object|Constructor<{}>} fieldValueType Field value type\r\n * @returns {FieldDecorator} Decorator function\r\n * @template T extends { [key: string]: number | Long | string | boolean | Uint8Array | Buffer | number[] | Message<{}> }\r\n */\r\nMapField.d = function decorateMapField(fieldId, fieldKeyType, fieldValueType) {\r\n\r\n // submessage value: decorate the submessage and use its name as the type\r\n if (typeof fieldValueType === \"function\")\r\n fieldValueType = util.decorateType(fieldValueType).name;\r\n\r\n // enum reference value: create a reflected copy of the enum and keep reuseing it\r\n else if (fieldValueType && typeof fieldValueType === \"object\")\r\n fieldValueType = util.decorateEnum(fieldValueType).name;\r\n\r\n return function mapFieldDecorator(prototype, fieldName) {\r\n util.decorateType(prototype.constructor)\r\n .add(new MapField(fieldName, fieldId, fieldKeyType, fieldValueType));\r\n };\r\n};\r\n","\"use strict\";\r\nmodule.exports = Message;\r\n\r\nvar util = require(\"./util/minimal\");\r\n\r\n/**\r\n * Constructs a new message instance.\r\n * @classdesc Abstract runtime message.\r\n * @constructor\r\n * @param {Properties} [properties] Properties to set\r\n * @template T extends object = object\r\n */\r\nfunction Message(properties) {\r\n // not used internally\r\n if (properties)\r\n for (var keys = Object.keys(properties), i = 0; i < keys.length; ++i)\r\n this[keys[i]] = properties[keys[i]];\r\n}\r\n\r\n/**\r\n * Reference to the reflected type.\r\n * @name Message.$type\r\n * @type {Type}\r\n * @readonly\r\n */\r\n\r\n/**\r\n * Reference to the reflected type.\r\n * @name Message#$type\r\n * @type {Type}\r\n * @readonly\r\n */\r\n\r\n/*eslint-disable valid-jsdoc*/\r\n\r\n/**\r\n * Creates a new message of this type using the specified properties.\r\n * @param {Object.} [properties] Properties to set\r\n * @returns {Message} Message instance\r\n * @template T extends Message\r\n * @this Constructor\r\n */\r\nMessage.create = function create(properties) {\r\n return this.$type.create(properties);\r\n};\r\n\r\n/**\r\n * Encodes a message of this type.\r\n * @param {T|Object.} message Message to encode\r\n * @param {Writer} [writer] Writer to use\r\n * @returns {Writer} Writer\r\n * @template T extends Message\r\n * @this Constructor\r\n */\r\nMessage.encode = function encode(message, writer) {\r\n return this.$type.encode(message, writer);\r\n};\r\n\r\n/**\r\n * Encodes a message of this type preceeded by its length as a varint.\r\n * @param {T|Object.} message Message to encode\r\n * @param {Writer} [writer] Writer to use\r\n * @returns {Writer} Writer\r\n * @template T extends Message\r\n * @this Constructor\r\n */\r\nMessage.encodeDelimited = function encodeDelimited(message, writer) {\r\n return this.$type.encodeDelimited(message, writer);\r\n};\r\n\r\n/**\r\n * Decodes a message of this type.\r\n * @name Message.decode\r\n * @function\r\n * @param {Reader|Uint8Array} reader Reader or buffer to decode\r\n * @returns {T} Decoded message\r\n * @template T extends Message\r\n * @this Constructor\r\n */\r\nMessage.decode = function decode(reader) {\r\n return this.$type.decode(reader);\r\n};\r\n\r\n/**\r\n * Decodes a message of this type preceeded by its length as a varint.\r\n * @name Message.decodeDelimited\r\n * @function\r\n * @param {Reader|Uint8Array} reader Reader or buffer to decode\r\n * @returns {T} Decoded message\r\n * @template T extends Message\r\n * @this Constructor\r\n */\r\nMessage.decodeDelimited = function decodeDelimited(reader) {\r\n return this.$type.decodeDelimited(reader);\r\n};\r\n\r\n/**\r\n * Verifies a message of this type.\r\n * @name Message.verify\r\n * @function\r\n * @param {Object.} message Plain object to verify\r\n * @returns {string|null} `null` if valid, otherwise the reason why it is not\r\n */\r\nMessage.verify = function verify(message) {\r\n return this.$type.verify(message);\r\n};\r\n\r\n/**\r\n * Creates a new message of this type from a plain object. Also converts values to their respective internal types.\r\n * @param {Object.} object Plain object\r\n * @returns {T} Message instance\r\n * @template T extends Message\r\n * @this Constructor\r\n */\r\nMessage.fromObject = function fromObject(object) {\r\n return this.$type.fromObject(object);\r\n};\r\n\r\n/**\r\n * Creates a plain object from a message of this type. Also converts values to other types if specified.\r\n * @param {T} message Message instance\r\n * @param {IConversionOptions} [options] Conversion options\r\n * @returns {Object.} Plain object\r\n * @template T extends Message\r\n * @this Constructor\r\n */\r\nMessage.toObject = function toObject(message, options) {\r\n return this.$type.toObject(message, options);\r\n};\r\n\r\n/**\r\n * Converts this message to JSON.\r\n * @returns {Object.} JSON object\r\n */\r\nMessage.prototype.toJSON = function toJSON() {\r\n return this.$type.toObject(this, util.toJSONOptions);\r\n};\r\n\r\n/*eslint-enable valid-jsdoc*/","\"use strict\";\r\nmodule.exports = Method;\r\n\r\n// extends ReflectionObject\r\nvar ReflectionObject = require(\"./object\");\r\n((Method.prototype = Object.create(ReflectionObject.prototype)).constructor = Method).className = \"Method\";\r\n\r\nvar util = require(\"./util\");\r\n\r\n/**\r\n * Constructs a new service method instance.\r\n * @classdesc Reflected service method.\r\n * @extends ReflectionObject\r\n * @constructor\r\n * @param {string} name Method name\r\n * @param {string|undefined} type Method type, usually `\"rpc\"`\r\n * @param {string} requestType Request message type\r\n * @param {string} responseType Response message type\r\n * @param {boolean|Object.} [requestStream] Whether the request is streamed\r\n * @param {boolean|Object.} [responseStream] Whether the response is streamed\r\n * @param {Object.} [options] Declared options\r\n * @param {string} [comment] The comment for this method\r\n * @param {Object.} [parsedOptions] Declared options, properly parsed into an object\r\n */\r\nfunction Method(name, type, requestType, responseType, requestStream, responseStream, options, comment, parsedOptions) {\r\n\r\n /* istanbul ignore next */\r\n if (util.isObject(requestStream)) {\r\n options = requestStream;\r\n requestStream = responseStream = undefined;\r\n } else if (util.isObject(responseStream)) {\r\n options = responseStream;\r\n responseStream = undefined;\r\n }\r\n\r\n /* istanbul ignore if */\r\n if (!(type === undefined || util.isString(type)))\r\n throw TypeError(\"type must be a string\");\r\n\r\n /* istanbul ignore if */\r\n if (!util.isString(requestType))\r\n throw TypeError(\"requestType must be a string\");\r\n\r\n /* istanbul ignore if */\r\n if (!util.isString(responseType))\r\n throw TypeError(\"responseType must be a string\");\r\n\r\n ReflectionObject.call(this, name, options);\r\n\r\n /**\r\n * Method type.\r\n * @type {string}\r\n */\r\n this.type = type || \"rpc\"; // toJSON\r\n\r\n /**\r\n * Request type.\r\n * @type {string}\r\n */\r\n this.requestType = requestType; // toJSON, marker\r\n\r\n /**\r\n * Whether requests are streamed or not.\r\n * @type {boolean|undefined}\r\n */\r\n this.requestStream = requestStream ? true : undefined; // toJSON\r\n\r\n /**\r\n * Response type.\r\n * @type {string}\r\n */\r\n this.responseType = responseType; // toJSON\r\n\r\n /**\r\n * Whether responses are streamed or not.\r\n * @type {boolean|undefined}\r\n */\r\n this.responseStream = responseStream ? true : undefined; // toJSON\r\n\r\n /**\r\n * Resolved request type.\r\n * @type {Type|null}\r\n */\r\n this.resolvedRequestType = null;\r\n\r\n /**\r\n * Resolved response type.\r\n * @type {Type|null}\r\n */\r\n this.resolvedResponseType = null;\r\n\r\n /**\r\n * Comment for this method\r\n * @type {string|null}\r\n */\r\n this.comment = comment;\r\n\r\n /**\r\n * Options properly parsed into an object\r\n */\r\n this.parsedOptions = parsedOptions;\r\n}\r\n\r\n/**\r\n * Method descriptor.\r\n * @interface IMethod\r\n * @property {string} [type=\"rpc\"] Method type\r\n * @property {string} requestType Request type\r\n * @property {string} responseType Response type\r\n * @property {boolean} [requestStream=false] Whether requests are streamed\r\n * @property {boolean} [responseStream=false] Whether responses are streamed\r\n * @property {Object.} [options] Method options\r\n * @property {string} comment Method comments\r\n * @property {Object.} [parsedOptions] Method options properly parsed into an object\r\n */\r\n\r\n/**\r\n * Constructs a method from a method descriptor.\r\n * @param {string} name Method name\r\n * @param {IMethod} json Method descriptor\r\n * @returns {Method} Created method\r\n * @throws {TypeError} If arguments are invalid\r\n */\r\nMethod.fromJSON = function fromJSON(name, json) {\r\n return new Method(name, json.type, json.requestType, json.responseType, json.requestStream, json.responseStream, json.options, json.comment, json.parsedOptions);\r\n};\r\n\r\n/**\r\n * Converts this method to a method descriptor.\r\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\r\n * @returns {IMethod} Method descriptor\r\n */\r\nMethod.prototype.toJSON = function toJSON(toJSONOptions) {\r\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\r\n return util.toObject([\r\n \"type\" , this.type !== \"rpc\" && /* istanbul ignore next */ this.type || undefined,\r\n \"requestType\" , this.requestType,\r\n \"requestStream\" , this.requestStream,\r\n \"responseType\" , this.responseType,\r\n \"responseStream\" , this.responseStream,\r\n \"options\" , this.options,\r\n \"comment\" , keepComments ? this.comment : undefined,\r\n \"parsedOptions\" , this.parsedOptions,\r\n ]);\r\n};\r\n\r\n/**\r\n * @override\r\n */\r\nMethod.prototype.resolve = function resolve() {\r\n\r\n /* istanbul ignore if */\r\n if (this.resolved)\r\n return this;\r\n\r\n this.resolvedRequestType = this.parent.lookupType(this.requestType);\r\n this.resolvedResponseType = this.parent.lookupType(this.responseType);\r\n\r\n return ReflectionObject.prototype.resolve.call(this);\r\n};\r\n","\"use strict\";\r\nmodule.exports = Namespace;\r\n\r\n// extends ReflectionObject\r\nvar ReflectionObject = require(\"./object\");\r\n((Namespace.prototype = Object.create(ReflectionObject.prototype)).constructor = Namespace).className = \"Namespace\";\r\n\r\nvar Field = require(\"./field\"),\r\n util = require(\"./util\"),\r\n OneOf = require(\"./oneof\");\r\n\r\nvar Type, // cyclic\r\n Service,\r\n Enum;\r\n\r\n/**\r\n * Constructs a new namespace instance.\r\n * @name Namespace\r\n * @classdesc Reflected namespace.\r\n * @extends NamespaceBase\r\n * @constructor\r\n * @param {string} name Namespace name\r\n * @param {Object.} [options] Declared options\r\n */\r\n\r\n/**\r\n * Constructs a namespace from JSON.\r\n * @memberof Namespace\r\n * @function\r\n * @param {string} name Namespace name\r\n * @param {Object.} json JSON object\r\n * @returns {Namespace} Created namespace\r\n * @throws {TypeError} If arguments are invalid\r\n */\r\nNamespace.fromJSON = function fromJSON(name, json) {\r\n return new Namespace(name, json.options).addJSON(json.nested);\r\n};\r\n\r\n/**\r\n * Converts an array of reflection objects to JSON.\r\n * @memberof Namespace\r\n * @param {ReflectionObject[]} array Object array\r\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\r\n * @returns {Object.|undefined} JSON object or `undefined` when array is empty\r\n */\r\nfunction arrayToJSON(array, toJSONOptions) {\r\n if (!(array && array.length))\r\n return undefined;\r\n var obj = {};\r\n for (var i = 0; i < array.length; ++i)\r\n obj[array[i].name] = array[i].toJSON(toJSONOptions);\r\n return obj;\r\n}\r\n\r\nNamespace.arrayToJSON = arrayToJSON;\r\n\r\n/**\r\n * Tests if the specified id is reserved.\r\n * @param {Array.|undefined} reserved Array of reserved ranges and names\r\n * @param {number} id Id to test\r\n * @returns {boolean} `true` if reserved, otherwise `false`\r\n */\r\nNamespace.isReservedId = function isReservedId(reserved, id) {\r\n if (reserved)\r\n for (var i = 0; i < reserved.length; ++i)\r\n if (typeof reserved[i] !== \"string\" && reserved[i][0] <= id && reserved[i][1] > id)\r\n return true;\r\n return false;\r\n};\r\n\r\n/**\r\n * Tests if the specified name is reserved.\r\n * @param {Array.|undefined} reserved Array of reserved ranges and names\r\n * @param {string} name Name to test\r\n * @returns {boolean} `true` if reserved, otherwise `false`\r\n */\r\nNamespace.isReservedName = function isReservedName(reserved, name) {\r\n if (reserved)\r\n for (var i = 0; i < reserved.length; ++i)\r\n if (reserved[i] === name)\r\n return true;\r\n return false;\r\n};\r\n\r\n/**\r\n * Not an actual constructor. Use {@link Namespace} instead.\r\n * @classdesc Base class of all reflection objects containing nested objects. This is not an actual class but here for the sake of having consistent type definitions.\r\n * @exports NamespaceBase\r\n * @extends ReflectionObject\r\n * @abstract\r\n * @constructor\r\n * @param {string} name Namespace name\r\n * @param {Object.} [options] Declared options\r\n * @see {@link Namespace}\r\n */\r\nfunction Namespace(name, options) {\r\n ReflectionObject.call(this, name, options);\r\n\r\n /**\r\n * Nested objects by name.\r\n * @type {Object.|undefined}\r\n */\r\n this.nested = undefined; // toJSON\r\n\r\n /**\r\n * Cached nested objects as an array.\r\n * @type {ReflectionObject[]|null}\r\n * @private\r\n */\r\n this._nestedArray = null;\r\n}\r\n\r\nfunction clearCache(namespace) {\r\n namespace._nestedArray = null;\r\n return namespace;\r\n}\r\n\r\n/**\r\n * Nested objects of this namespace as an array for iteration.\r\n * @name NamespaceBase#nestedArray\r\n * @type {ReflectionObject[]}\r\n * @readonly\r\n */\r\nObject.defineProperty(Namespace.prototype, \"nestedArray\", {\r\n get: function() {\r\n return this._nestedArray || (this._nestedArray = util.toArray(this.nested));\r\n }\r\n});\r\n\r\n/**\r\n * Namespace descriptor.\r\n * @interface INamespace\r\n * @property {Object.} [options] Namespace options\r\n * @property {Object.} [nested] Nested object descriptors\r\n */\r\n\r\n/**\r\n * Any extension field descriptor.\r\n * @typedef AnyExtensionField\r\n * @type {IExtensionField|IExtensionMapField}\r\n */\r\n\r\n/**\r\n * Any nested object descriptor.\r\n * @typedef AnyNestedObject\r\n * @type {IEnum|IType|IService|AnyExtensionField|INamespace|IOneOf}\r\n */\r\n\r\n/**\r\n * Converts this namespace to a namespace descriptor.\r\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\r\n * @returns {INamespace} Namespace descriptor\r\n */\r\nNamespace.prototype.toJSON = function toJSON(toJSONOptions) {\r\n return util.toObject([\r\n \"options\" , this.options,\r\n \"nested\" , arrayToJSON(this.nestedArray, toJSONOptions)\r\n ]);\r\n};\r\n\r\n/**\r\n * Adds nested objects to this namespace from nested object descriptors.\r\n * @param {Object.} nestedJson Any nested object descriptors\r\n * @returns {Namespace} `this`\r\n */\r\nNamespace.prototype.addJSON = function addJSON(nestedJson) {\r\n var ns = this;\r\n /* istanbul ignore else */\r\n if (nestedJson) {\r\n for (var names = Object.keys(nestedJson), i = 0, nested; i < names.length; ++i) {\r\n nested = nestedJson[names[i]];\r\n ns.add( // most to least likely\r\n ( nested.fields !== undefined\r\n ? Type.fromJSON\r\n : nested.values !== undefined\r\n ? Enum.fromJSON\r\n : nested.methods !== undefined\r\n ? Service.fromJSON\r\n : nested.id !== undefined\r\n ? Field.fromJSON\r\n : Namespace.fromJSON )(names[i], nested)\r\n );\r\n }\r\n }\r\n return this;\r\n};\r\n\r\n/**\r\n * Gets the nested object of the specified name.\r\n * @param {string} name Nested object name\r\n * @returns {ReflectionObject|null} The reflection object or `null` if it doesn't exist\r\n */\r\nNamespace.prototype.get = function get(name) {\r\n return this.nested && this.nested[name]\r\n || null;\r\n};\r\n\r\n/**\r\n * Gets the values of the nested {@link Enum|enum} of the specified name.\r\n * This methods differs from {@link Namespace#get|get} in that it returns an enum's values directly and throws instead of returning `null`.\r\n * @param {string} name Nested enum name\r\n * @returns {Object.} Enum values\r\n * @throws {Error} If there is no such enum\r\n */\r\nNamespace.prototype.getEnum = function getEnum(name) {\r\n if (this.nested && this.nested[name] instanceof Enum)\r\n return this.nested[name].values;\r\n throw Error(\"no such enum: \" + name);\r\n};\r\n\r\n/**\r\n * Adds a nested object to this namespace.\r\n * @param {ReflectionObject} object Nested object to add\r\n * @returns {Namespace} `this`\r\n * @throws {TypeError} If arguments are invalid\r\n * @throws {Error} If there is already a nested object with this name\r\n */\r\nNamespace.prototype.add = function add(object) {\r\n\r\n if (!(object instanceof Field && object.extend !== undefined || object instanceof Type || object instanceof OneOf || object instanceof Enum || object instanceof Service || object instanceof Namespace))\r\n throw TypeError(\"object must be a valid nested object\");\r\n\r\n if (!this.nested)\r\n this.nested = {};\r\n else {\r\n var prev = this.get(object.name);\r\n if (prev) {\r\n if (prev instanceof Namespace && object instanceof Namespace && !(prev instanceof Type || prev instanceof Service)) {\r\n // replace plain namespace but keep existing nested elements and options\r\n var nested = prev.nestedArray;\r\n for (var i = 0; i < nested.length; ++i)\r\n object.add(nested[i]);\r\n this.remove(prev);\r\n if (!this.nested)\r\n this.nested = {};\r\n object.setOptions(prev.options, true);\r\n\r\n } else\r\n throw Error(\"duplicate name '\" + object.name + \"' in \" + this);\r\n }\r\n }\r\n this.nested[object.name] = object;\r\n object.onAdd(this);\r\n return clearCache(this);\r\n};\r\n\r\n/**\r\n * Removes a nested object from this namespace.\r\n * @param {ReflectionObject} object Nested object to remove\r\n * @returns {Namespace} `this`\r\n * @throws {TypeError} If arguments are invalid\r\n * @throws {Error} If `object` is not a member of this namespace\r\n */\r\nNamespace.prototype.remove = function remove(object) {\r\n\r\n if (!(object instanceof ReflectionObject))\r\n throw TypeError(\"object must be a ReflectionObject\");\r\n if (object.parent !== this)\r\n throw Error(object + \" is not a member of \" + this);\r\n\r\n delete this.nested[object.name];\r\n if (!Object.keys(this.nested).length)\r\n this.nested = undefined;\r\n\r\n object.onRemove(this);\r\n return clearCache(this);\r\n};\r\n\r\n/**\r\n * Defines additial namespaces within this one if not yet existing.\r\n * @param {string|string[]} path Path to create\r\n * @param {*} [json] Nested types to create from JSON\r\n * @returns {Namespace} Pointer to the last namespace created or `this` if path is empty\r\n */\r\nNamespace.prototype.define = function define(path, json) {\r\n\r\n if (util.isString(path))\r\n path = path.split(\".\");\r\n else if (!Array.isArray(path))\r\n throw TypeError(\"illegal path\");\r\n if (path && path.length && path[0] === \"\")\r\n throw Error(\"path must be relative\");\r\n\r\n var ptr = this;\r\n while (path.length > 0) {\r\n var part = path.shift();\r\n if (ptr.nested && ptr.nested[part]) {\r\n ptr = ptr.nested[part];\r\n if (!(ptr instanceof Namespace))\r\n throw Error(\"path conflicts with non-namespace objects\");\r\n } else\r\n ptr.add(ptr = new Namespace(part));\r\n }\r\n if (json)\r\n ptr.addJSON(json);\r\n return ptr;\r\n};\r\n\r\n/**\r\n * Resolves this namespace's and all its nested objects' type references. Useful to validate a reflection tree, but comes at a cost.\r\n * @returns {Namespace} `this`\r\n */\r\nNamespace.prototype.resolveAll = function resolveAll() {\r\n var nested = this.nestedArray, i = 0;\r\n while (i < nested.length)\r\n if (nested[i] instanceof Namespace)\r\n nested[i++].resolveAll();\r\n else\r\n nested[i++].resolve();\r\n return this.resolve();\r\n};\r\n\r\n/**\r\n * Recursively looks up the reflection object matching the specified path in the scope of this namespace.\r\n * @param {string|string[]} path Path to look up\r\n * @param {*|Array.<*>} filterTypes Filter types, any combination of the constructors of `protobuf.Type`, `protobuf.Enum`, `protobuf.Service` etc.\r\n * @param {boolean} [parentAlreadyChecked=false] If known, whether the parent has already been checked\r\n * @returns {ReflectionObject|null} Looked up object or `null` if none could be found\r\n */\r\nNamespace.prototype.lookup = function lookup(path, filterTypes, parentAlreadyChecked) {\r\n\r\n /* istanbul ignore next */\r\n if (typeof filterTypes === \"boolean\") {\r\n parentAlreadyChecked = filterTypes;\r\n filterTypes = undefined;\r\n } else if (filterTypes && !Array.isArray(filterTypes))\r\n filterTypes = [ filterTypes ];\r\n\r\n if (util.isString(path) && path.length) {\r\n if (path === \".\")\r\n return this.root;\r\n path = path.split(\".\");\r\n } else if (!path.length)\r\n return this;\r\n\r\n // Start at root if path is absolute\r\n if (path[0] === \"\")\r\n return this.root.lookup(path.slice(1), filterTypes);\r\n\r\n // Test if the first part matches any nested object, and if so, traverse if path contains more\r\n var found = this.get(path[0]);\r\n if (found) {\r\n if (path.length === 1) {\r\n if (!filterTypes || filterTypes.indexOf(found.constructor) > -1)\r\n return found;\r\n } else if (found instanceof Namespace && (found = found.lookup(path.slice(1), filterTypes, true)))\r\n return found;\r\n\r\n // Otherwise try each nested namespace\r\n } else\r\n for (var i = 0; i < this.nestedArray.length; ++i)\r\n if (this._nestedArray[i] instanceof Namespace && (found = this._nestedArray[i].lookup(path, filterTypes, true)))\r\n return found;\r\n\r\n // If there hasn't been a match, try again at the parent\r\n if (this.parent === null || parentAlreadyChecked)\r\n return null;\r\n return this.parent.lookup(path, filterTypes);\r\n};\r\n\r\n/**\r\n * Looks up the reflection object at the specified path, relative to this namespace.\r\n * @name NamespaceBase#lookup\r\n * @function\r\n * @param {string|string[]} path Path to look up\r\n * @param {boolean} [parentAlreadyChecked=false] Whether the parent has already been checked\r\n * @returns {ReflectionObject|null} Looked up object or `null` if none could be found\r\n * @variation 2\r\n */\r\n// lookup(path: string, [parentAlreadyChecked: boolean])\r\n\r\n/**\r\n * Looks up the {@link Type|type} at the specified path, relative to this namespace.\r\n * Besides its signature, this methods differs from {@link Namespace#lookup|lookup} in that it throws instead of returning `null`.\r\n * @param {string|string[]} path Path to look up\r\n * @returns {Type} Looked up type\r\n * @throws {Error} If `path` does not point to a type\r\n */\r\nNamespace.prototype.lookupType = function lookupType(path) {\r\n var found = this.lookup(path, [ Type ]);\r\n if (!found)\r\n throw Error(\"no such type: \" + path);\r\n return found;\r\n};\r\n\r\n/**\r\n * Looks up the values of the {@link Enum|enum} at the specified path, relative to this namespace.\r\n * Besides its signature, this methods differs from {@link Namespace#lookup|lookup} in that it throws instead of returning `null`.\r\n * @param {string|string[]} path Path to look up\r\n * @returns {Enum} Looked up enum\r\n * @throws {Error} If `path` does not point to an enum\r\n */\r\nNamespace.prototype.lookupEnum = function lookupEnum(path) {\r\n var found = this.lookup(path, [ Enum ]);\r\n if (!found)\r\n throw Error(\"no such Enum '\" + path + \"' in \" + this);\r\n return found;\r\n};\r\n\r\n/**\r\n * Looks up the {@link Type|type} or {@link Enum|enum} at the specified path, relative to this namespace.\r\n * Besides its signature, this methods differs from {@link Namespace#lookup|lookup} in that it throws instead of returning `null`.\r\n * @param {string|string[]} path Path to look up\r\n * @returns {Type} Looked up type or enum\r\n * @throws {Error} If `path` does not point to a type or enum\r\n */\r\nNamespace.prototype.lookupTypeOrEnum = function lookupTypeOrEnum(path) {\r\n var found = this.lookup(path, [ Type, Enum ]);\r\n if (!found)\r\n throw Error(\"no such Type or Enum '\" + path + \"' in \" + this);\r\n return found;\r\n};\r\n\r\n/**\r\n * Looks up the {@link Service|service} at the specified path, relative to this namespace.\r\n * Besides its signature, this methods differs from {@link Namespace#lookup|lookup} in that it throws instead of returning `null`.\r\n * @param {string|string[]} path Path to look up\r\n * @returns {Service} Looked up service\r\n * @throws {Error} If `path` does not point to a service\r\n */\r\nNamespace.prototype.lookupService = function lookupService(path) {\r\n var found = this.lookup(path, [ Service ]);\r\n if (!found)\r\n throw Error(\"no such Service '\" + path + \"' in \" + this);\r\n return found;\r\n};\r\n\r\n// Sets up cyclic dependencies (called in index-light)\r\nNamespace._configure = function(Type_, Service_, Enum_) {\r\n Type = Type_;\r\n Service = Service_;\r\n Enum = Enum_;\r\n};\r\n","\"use strict\";\r\nmodule.exports = ReflectionObject;\r\n\r\nReflectionObject.className = \"ReflectionObject\";\r\n\r\nvar util = require(\"./util\");\r\n\r\nvar Root; // cyclic\r\n\r\n/**\r\n * Constructs a new reflection object instance.\r\n * @classdesc Base class of all reflection objects.\r\n * @constructor\r\n * @param {string} name Object name\r\n * @param {Object.} [options] Declared options\r\n * @abstract\r\n */\r\nfunction ReflectionObject(name, options) {\r\n\r\n if (!util.isString(name))\r\n throw TypeError(\"name must be a string\");\r\n\r\n if (options && !util.isObject(options))\r\n throw TypeError(\"options must be an object\");\r\n\r\n /**\r\n * Options.\r\n * @type {Object.|undefined}\r\n */\r\n this.options = options; // toJSON\r\n\r\n /**\r\n * Parsed Options.\r\n * @type {Array.>|undefined}\r\n */\r\n this.parsedOptions = null;\r\n\r\n /**\r\n * Unique name within its namespace.\r\n * @type {string}\r\n */\r\n this.name = name;\r\n\r\n /**\r\n * Parent namespace.\r\n * @type {Namespace|null}\r\n */\r\n this.parent = null;\r\n\r\n /**\r\n * Whether already resolved or not.\r\n * @type {boolean}\r\n */\r\n this.resolved = false;\r\n\r\n /**\r\n * Comment text, if any.\r\n * @type {string|null}\r\n */\r\n this.comment = null;\r\n\r\n /**\r\n * Defining file name.\r\n * @type {string|null}\r\n */\r\n this.filename = null;\r\n}\r\n\r\nObject.defineProperties(ReflectionObject.prototype, {\r\n\r\n /**\r\n * Reference to the root namespace.\r\n * @name ReflectionObject#root\r\n * @type {Root}\r\n * @readonly\r\n */\r\n root: {\r\n get: function() {\r\n var ptr = this;\r\n while (ptr.parent !== null)\r\n ptr = ptr.parent;\r\n return ptr;\r\n }\r\n },\r\n\r\n /**\r\n * Full name including leading dot.\r\n * @name ReflectionObject#fullName\r\n * @type {string}\r\n * @readonly\r\n */\r\n fullName: {\r\n get: function() {\r\n var path = [ this.name ],\r\n ptr = this.parent;\r\n while (ptr) {\r\n path.unshift(ptr.name);\r\n ptr = ptr.parent;\r\n }\r\n return path.join(\".\");\r\n }\r\n }\r\n});\r\n\r\n/**\r\n * Converts this reflection object to its descriptor representation.\r\n * @returns {Object.} Descriptor\r\n * @abstract\r\n */\r\nReflectionObject.prototype.toJSON = /* istanbul ignore next */ function toJSON() {\r\n throw Error(); // not implemented, shouldn't happen\r\n};\r\n\r\n/**\r\n * Called when this object is added to a parent.\r\n * @param {ReflectionObject} parent Parent added to\r\n * @returns {undefined}\r\n */\r\nReflectionObject.prototype.onAdd = function onAdd(parent) {\r\n if (this.parent && this.parent !== parent)\r\n this.parent.remove(this);\r\n this.parent = parent;\r\n this.resolved = false;\r\n var root = parent.root;\r\n if (root instanceof Root)\r\n root._handleAdd(this);\r\n};\r\n\r\n/**\r\n * Called when this object is removed from a parent.\r\n * @param {ReflectionObject} parent Parent removed from\r\n * @returns {undefined}\r\n */\r\nReflectionObject.prototype.onRemove = function onRemove(parent) {\r\n var root = parent.root;\r\n if (root instanceof Root)\r\n root._handleRemove(this);\r\n this.parent = null;\r\n this.resolved = false;\r\n};\r\n\r\n/**\r\n * Resolves this objects type references.\r\n * @returns {ReflectionObject} `this`\r\n */\r\nReflectionObject.prototype.resolve = function resolve() {\r\n if (this.resolved)\r\n return this;\r\n if (this.root instanceof Root)\r\n this.resolved = true; // only if part of a root\r\n return this;\r\n};\r\n\r\n/**\r\n * Gets an option value.\r\n * @param {string} name Option name\r\n * @returns {*} Option value or `undefined` if not set\r\n */\r\nReflectionObject.prototype.getOption = function getOption(name) {\r\n if (this.options)\r\n return this.options[name];\r\n return undefined;\r\n};\r\n\r\n/**\r\n * Sets an option.\r\n * @param {string} name Option name\r\n * @param {*} value Option value\r\n * @param {boolean} [ifNotSet] Sets the option only if it isn't currently set\r\n * @returns {ReflectionObject} `this`\r\n */\r\nReflectionObject.prototype.setOption = function setOption(name, value, ifNotSet) {\r\n if (!ifNotSet || !this.options || this.options[name] === undefined)\r\n (this.options || (this.options = {}))[name] = value;\r\n return this;\r\n};\r\n\r\n/**\r\n * Sets a parsed option.\r\n * @param {string} name parsed Option name\r\n * @param {*} value Option value\r\n * @param {string} propName dot '.' delimited full path of property within the option to set. if undefined\\empty, will add a new option with that value\r\n * @returns {ReflectionObject} `this`\r\n */\r\nReflectionObject.prototype.setParsedOption = function setParsedOption(name, value, propName) {\r\n if (!this.parsedOptions) {\r\n this.parsedOptions = [];\r\n }\r\n var parsedOptions = this.parsedOptions;\r\n if (propName) {\r\n // If setting a sub property of an option then try to merge it\r\n // with an existing option\r\n var opt = parsedOptions.find(function (opt) {\r\n return Object.prototype.hasOwnProperty.call(opt, name);\r\n });\r\n if (opt) {\r\n // If we found an existing option - just merge the property value\r\n var newValue = opt[name];\r\n util.setProperty(newValue, propName, value);\r\n } else {\r\n // otherwise, create a new option, set it's property and add it to the list\r\n opt = {};\r\n opt[name] = util.setProperty({}, propName, value);\r\n parsedOptions.push(opt);\r\n }\r\n } else {\r\n // Always create a new option when setting the value of the option itself\r\n var newOpt = {};\r\n newOpt[name] = value;\r\n parsedOptions.push(newOpt);\r\n }\r\n return this;\r\n};\r\n\r\n/**\r\n * Sets multiple options.\r\n * @param {Object.} options Options to set\r\n * @param {boolean} [ifNotSet] Sets an option only if it isn't currently set\r\n * @returns {ReflectionObject} `this`\r\n */\r\nReflectionObject.prototype.setOptions = function setOptions(options, ifNotSet) {\r\n if (options)\r\n for (var keys = Object.keys(options), i = 0; i < keys.length; ++i)\r\n this.setOption(keys[i], options[keys[i]], ifNotSet);\r\n return this;\r\n};\r\n\r\n/**\r\n * Converts this instance to its string representation.\r\n * @returns {string} Class name[, space, full name]\r\n */\r\nReflectionObject.prototype.toString = function toString() {\r\n var className = this.constructor.className,\r\n fullName = this.fullName;\r\n if (fullName.length)\r\n return className + \" \" + fullName;\r\n return className;\r\n};\r\n\r\n// Sets up cyclic dependencies (called in index-light)\r\nReflectionObject._configure = function(Root_) {\r\n Root = Root_;\r\n};\r\n","\"use strict\";\r\nmodule.exports = OneOf;\r\n\r\n// extends ReflectionObject\r\nvar ReflectionObject = require(\"./object\");\r\n((OneOf.prototype = Object.create(ReflectionObject.prototype)).constructor = OneOf).className = \"OneOf\";\r\n\r\nvar Field = require(\"./field\"),\r\n util = require(\"./util\");\r\n\r\n/**\r\n * Constructs a new oneof instance.\r\n * @classdesc Reflected oneof.\r\n * @extends ReflectionObject\r\n * @constructor\r\n * @param {string} name Oneof name\r\n * @param {string[]|Object.} [fieldNames] Field names\r\n * @param {Object.} [options] Declared options\r\n * @param {string} [comment] Comment associated with this field\r\n */\r\nfunction OneOf(name, fieldNames, options, comment) {\r\n if (!Array.isArray(fieldNames)) {\r\n options = fieldNames;\r\n fieldNames = undefined;\r\n }\r\n ReflectionObject.call(this, name, options);\r\n\r\n /* istanbul ignore if */\r\n if (!(fieldNames === undefined || Array.isArray(fieldNames)))\r\n throw TypeError(\"fieldNames must be an Array\");\r\n\r\n /**\r\n * Field names that belong to this oneof.\r\n * @type {string[]}\r\n */\r\n this.oneof = fieldNames || []; // toJSON, marker\r\n\r\n /**\r\n * Fields that belong to this oneof as an array for iteration.\r\n * @type {Field[]}\r\n * @readonly\r\n */\r\n this.fieldsArray = []; // declared readonly for conformance, possibly not yet added to parent\r\n\r\n /**\r\n * Comment for this field.\r\n * @type {string|null}\r\n */\r\n this.comment = comment;\r\n}\r\n\r\n/**\r\n * Oneof descriptor.\r\n * @interface IOneOf\r\n * @property {Array.} oneof Oneof field names\r\n * @property {Object.} [options] Oneof options\r\n */\r\n\r\n/**\r\n * Constructs a oneof from a oneof descriptor.\r\n * @param {string} name Oneof name\r\n * @param {IOneOf} json Oneof descriptor\r\n * @returns {OneOf} Created oneof\r\n * @throws {TypeError} If arguments are invalid\r\n */\r\nOneOf.fromJSON = function fromJSON(name, json) {\r\n return new OneOf(name, json.oneof, json.options, json.comment);\r\n};\r\n\r\n/**\r\n * Converts this oneof to a oneof descriptor.\r\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\r\n * @returns {IOneOf} Oneof descriptor\r\n */\r\nOneOf.prototype.toJSON = function toJSON(toJSONOptions) {\r\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\r\n return util.toObject([\r\n \"options\" , this.options,\r\n \"oneof\" , this.oneof,\r\n \"comment\" , keepComments ? this.comment : undefined\r\n ]);\r\n};\r\n\r\n/**\r\n * Adds the fields of the specified oneof to the parent if not already done so.\r\n * @param {OneOf} oneof The oneof\r\n * @returns {undefined}\r\n * @inner\r\n * @ignore\r\n */\r\nfunction addFieldsToParent(oneof) {\r\n if (oneof.parent)\r\n for (var i = 0; i < oneof.fieldsArray.length; ++i)\r\n if (!oneof.fieldsArray[i].parent)\r\n oneof.parent.add(oneof.fieldsArray[i]);\r\n}\r\n\r\n/**\r\n * Adds a field to this oneof and removes it from its current parent, if any.\r\n * @param {Field} field Field to add\r\n * @returns {OneOf} `this`\r\n */\r\nOneOf.prototype.add = function add(field) {\r\n\r\n /* istanbul ignore if */\r\n if (!(field instanceof Field))\r\n throw TypeError(\"field must be a Field\");\r\n\r\n if (field.parent && field.parent !== this.parent)\r\n field.parent.remove(field);\r\n this.oneof.push(field.name);\r\n this.fieldsArray.push(field);\r\n field.partOf = this; // field.parent remains null\r\n addFieldsToParent(this);\r\n return this;\r\n};\r\n\r\n/**\r\n * Removes a field from this oneof and puts it back to the oneof's parent.\r\n * @param {Field} field Field to remove\r\n * @returns {OneOf} `this`\r\n */\r\nOneOf.prototype.remove = function remove(field) {\r\n\r\n /* istanbul ignore if */\r\n if (!(field instanceof Field))\r\n throw TypeError(\"field must be a Field\");\r\n\r\n var index = this.fieldsArray.indexOf(field);\r\n\r\n /* istanbul ignore if */\r\n if (index < 0)\r\n throw Error(field + \" is not a member of \" + this);\r\n\r\n this.fieldsArray.splice(index, 1);\r\n index = this.oneof.indexOf(field.name);\r\n\r\n /* istanbul ignore else */\r\n if (index > -1) // theoretical\r\n this.oneof.splice(index, 1);\r\n\r\n field.partOf = null;\r\n return this;\r\n};\r\n\r\n/**\r\n * @override\r\n */\r\nOneOf.prototype.onAdd = function onAdd(parent) {\r\n ReflectionObject.prototype.onAdd.call(this, parent);\r\n var self = this;\r\n // Collect present fields\r\n for (var i = 0; i < this.oneof.length; ++i) {\r\n var field = parent.get(this.oneof[i]);\r\n if (field && !field.partOf) {\r\n field.partOf = self;\r\n self.fieldsArray.push(field);\r\n }\r\n }\r\n // Add not yet present fields\r\n addFieldsToParent(this);\r\n};\r\n\r\n/**\r\n * @override\r\n */\r\nOneOf.prototype.onRemove = function onRemove(parent) {\r\n for (var i = 0, field; i < this.fieldsArray.length; ++i)\r\n if ((field = this.fieldsArray[i]).parent)\r\n field.parent.remove(field);\r\n ReflectionObject.prototype.onRemove.call(this, parent);\r\n};\r\n\r\n/**\r\n * Decorator function as returned by {@link OneOf.d} (TypeScript).\r\n * @typedef OneOfDecorator\r\n * @type {function}\r\n * @param {Object} prototype Target prototype\r\n * @param {string} oneofName OneOf name\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * OneOf decorator (TypeScript).\r\n * @function\r\n * @param {...string} fieldNames Field names\r\n * @returns {OneOfDecorator} Decorator function\r\n * @template T extends string\r\n */\r\nOneOf.d = function decorateOneOf() {\r\n var fieldNames = new Array(arguments.length),\r\n index = 0;\r\n while (index < arguments.length)\r\n fieldNames[index] = arguments[index++];\r\n return function oneOfDecorator(prototype, oneofName) {\r\n util.decorateType(prototype.constructor)\r\n .add(new OneOf(oneofName, fieldNames));\r\n Object.defineProperty(prototype, oneofName, {\r\n get: util.oneOfGetter(fieldNames),\r\n set: util.oneOfSetter(fieldNames)\r\n });\r\n };\r\n};\r\n","\"use strict\";\r\nmodule.exports = parse;\r\n\r\nparse.filename = null;\r\nparse.defaults = { keepCase: false };\r\n\r\nvar tokenize = require(\"./tokenize\"),\r\n Root = require(\"./root\"),\r\n Type = require(\"./type\"),\r\n Field = require(\"./field\"),\r\n MapField = require(\"./mapfield\"),\r\n OneOf = require(\"./oneof\"),\r\n Enum = require(\"./enum\"),\r\n Service = require(\"./service\"),\r\n Method = require(\"./method\"),\r\n types = require(\"./types\"),\r\n util = require(\"./util\");\r\n\r\nvar base10Re = /^[1-9][0-9]*$/,\r\n base10NegRe = /^-?[1-9][0-9]*$/,\r\n base16Re = /^0[x][0-9a-fA-F]+$/,\r\n base16NegRe = /^-?0[x][0-9a-fA-F]+$/,\r\n base8Re = /^0[0-7]+$/,\r\n base8NegRe = /^-?0[0-7]+$/,\r\n numberRe = /^(?![eE])[0-9]*(?:\\.[0-9]*)?(?:[eE][+-]?[0-9]+)?$/,\r\n nameRe = /^[a-zA-Z_][a-zA-Z_0-9]*$/,\r\n typeRefRe = /^(?:\\.?[a-zA-Z_][a-zA-Z_0-9]*)(?:\\.[a-zA-Z_][a-zA-Z_0-9]*)*$/,\r\n fqTypeRefRe = /^(?:\\.[a-zA-Z_][a-zA-Z_0-9]*)+$/;\r\n\r\n/**\r\n * Result object returned from {@link parse}.\r\n * @interface IParserResult\r\n * @property {string|undefined} package Package name, if declared\r\n * @property {string[]|undefined} imports Imports, if any\r\n * @property {string[]|undefined} weakImports Weak imports, if any\r\n * @property {string|undefined} syntax Syntax, if specified (either `\"proto2\"` or `\"proto3\"`)\r\n * @property {Root} root Populated root instance\r\n */\r\n\r\n/**\r\n * Options modifying the behavior of {@link parse}.\r\n * @interface IParseOptions\r\n * @property {boolean} [keepCase=false] Keeps field casing instead of converting to camel case\r\n * @property {boolean} [alternateCommentMode=false] Recognize double-slash comments in addition to doc-block comments.\r\n * @property {boolean} [preferTrailingComment=false] Use trailing comment when both leading comment and trailing comment exist.\r\n */\r\n\r\n/**\r\n * Options modifying the behavior of JSON serialization.\r\n * @interface IToJSONOptions\r\n * @property {boolean} [keepComments=false] Serializes comments.\r\n */\r\n\r\n/**\r\n * Parses the given .proto source and returns an object with the parsed contents.\r\n * @param {string} source Source contents\r\n * @param {Root} root Root to populate\r\n * @param {IParseOptions} [options] Parse options. Defaults to {@link parse.defaults} when omitted.\r\n * @returns {IParserResult} Parser result\r\n * @property {string} filename=null Currently processing file name for error reporting, if known\r\n * @property {IParseOptions} defaults Default {@link IParseOptions}\r\n */\r\nfunction parse(source, root, options) {\r\n /* eslint-disable callback-return */\r\n if (!(root instanceof Root)) {\r\n options = root;\r\n root = new Root();\r\n }\r\n if (!options)\r\n options = parse.defaults;\r\n\r\n var preferTrailingComment = options.preferTrailingComment || false;\r\n var tn = tokenize(source, options.alternateCommentMode || false),\r\n next = tn.next,\r\n push = tn.push,\r\n peek = tn.peek,\r\n skip = tn.skip,\r\n cmnt = tn.cmnt;\r\n\r\n var head = true,\r\n pkg,\r\n imports,\r\n weakImports,\r\n syntax,\r\n isProto3 = false;\r\n\r\n var ptr = root;\r\n\r\n var applyCase = options.keepCase ? function(name) { return name; } : util.camelCase;\r\n\r\n /* istanbul ignore next */\r\n function illegal(token, name, insideTryCatch) {\r\n var filename = parse.filename;\r\n if (!insideTryCatch)\r\n parse.filename = null;\r\n return Error(\"illegal \" + (name || \"token\") + \" '\" + token + \"' (\" + (filename ? filename + \", \" : \"\") + \"line \" + tn.line + \")\");\r\n }\r\n\r\n function readString() {\r\n var values = [],\r\n token;\r\n do {\r\n /* istanbul ignore if */\r\n if ((token = next()) !== \"\\\"\" && token !== \"'\")\r\n throw illegal(token);\r\n\r\n values.push(next());\r\n skip(token);\r\n token = peek();\r\n } while (token === \"\\\"\" || token === \"'\");\r\n return values.join(\"\");\r\n }\r\n\r\n function readValue(acceptTypeRef) {\r\n var token = next();\r\n switch (token) {\r\n case \"'\":\r\n case \"\\\"\":\r\n push(token);\r\n return readString();\r\n case \"true\": case \"TRUE\":\r\n return true;\r\n case \"false\": case \"FALSE\":\r\n return false;\r\n }\r\n try {\r\n return parseNumber(token, /* insideTryCatch */ true);\r\n } catch (e) {\r\n\r\n /* istanbul ignore else */\r\n if (acceptTypeRef && typeRefRe.test(token))\r\n return token;\r\n\r\n /* istanbul ignore next */\r\n throw illegal(token, \"value\");\r\n }\r\n }\r\n\r\n function readRanges(target, acceptStrings) {\r\n var token, start;\r\n do {\r\n if (acceptStrings && ((token = peek()) === \"\\\"\" || token === \"'\"))\r\n target.push(readString());\r\n else\r\n target.push([ start = parseId(next()), skip(\"to\", true) ? parseId(next()) : start ]);\r\n } while (skip(\",\", true));\r\n var dummy = {options: undefined};\r\n dummy.setOption = function(name, value) {\r\n if (this.options === undefined) this.options = {};\r\n this.options[name] = value;\r\n };\r\n ifBlock(\r\n dummy,\r\n function parseRange_block(token) {\r\n /* istanbul ignore else */\r\n if (token === \"option\") {\r\n parseOption(dummy, token); // skip\r\n skip(\";\");\r\n } else\r\n throw illegal(token);\r\n },\r\n function parseRange_line() {\r\n parseInlineOptions(dummy); // skip\r\n });\r\n }\r\n\r\n function parseNumber(token, insideTryCatch) {\r\n var sign = 1;\r\n if (token.charAt(0) === \"-\") {\r\n sign = -1;\r\n token = token.substring(1);\r\n }\r\n switch (token) {\r\n case \"inf\": case \"INF\": case \"Inf\":\r\n return sign * Infinity;\r\n case \"nan\": case \"NAN\": case \"Nan\": case \"NaN\":\r\n return NaN;\r\n case \"0\":\r\n return 0;\r\n }\r\n if (base10Re.test(token))\r\n return sign * parseInt(token, 10);\r\n if (base16Re.test(token))\r\n return sign * parseInt(token, 16);\r\n if (base8Re.test(token))\r\n return sign * parseInt(token, 8);\r\n\r\n /* istanbul ignore else */\r\n if (numberRe.test(token))\r\n return sign * parseFloat(token);\r\n\r\n /* istanbul ignore next */\r\n throw illegal(token, \"number\", insideTryCatch);\r\n }\r\n\r\n function parseId(token, acceptNegative) {\r\n switch (token) {\r\n case \"max\": case \"MAX\": case \"Max\":\r\n return 536870911;\r\n case \"0\":\r\n return 0;\r\n }\r\n\r\n /* istanbul ignore if */\r\n if (!acceptNegative && token.charAt(0) === \"-\")\r\n throw illegal(token, \"id\");\r\n\r\n if (base10NegRe.test(token))\r\n return parseInt(token, 10);\r\n if (base16NegRe.test(token))\r\n return parseInt(token, 16);\r\n\r\n /* istanbul ignore else */\r\n if (base8NegRe.test(token))\r\n return parseInt(token, 8);\r\n\r\n /* istanbul ignore next */\r\n throw illegal(token, \"id\");\r\n }\r\n\r\n function parsePackage() {\r\n\r\n /* istanbul ignore if */\r\n if (pkg !== undefined)\r\n throw illegal(\"package\");\r\n\r\n pkg = next();\r\n\r\n /* istanbul ignore if */\r\n if (!typeRefRe.test(pkg))\r\n throw illegal(pkg, \"name\");\r\n\r\n ptr = ptr.define(pkg);\r\n skip(\";\");\r\n }\r\n\r\n function parseImport() {\r\n var token = peek();\r\n var whichImports;\r\n switch (token) {\r\n case \"weak\":\r\n whichImports = weakImports || (weakImports = []);\r\n next();\r\n break;\r\n case \"public\":\r\n next();\r\n // eslint-disable-next-line no-fallthrough\r\n default:\r\n whichImports = imports || (imports = []);\r\n break;\r\n }\r\n token = readString();\r\n skip(\";\");\r\n whichImports.push(token);\r\n }\r\n\r\n function parseSyntax() {\r\n skip(\"=\");\r\n syntax = readString();\r\n isProto3 = syntax === \"proto3\";\r\n\r\n /* istanbul ignore if */\r\n if (!isProto3 && syntax !== \"proto2\")\r\n throw illegal(syntax, \"syntax\");\r\n\r\n skip(\";\");\r\n }\r\n\r\n function parseCommon(parent, token) {\r\n switch (token) {\r\n\r\n case \"option\":\r\n parseOption(parent, token);\r\n skip(\";\");\r\n return true;\r\n\r\n case \"message\":\r\n parseType(parent, token);\r\n return true;\r\n\r\n case \"enum\":\r\n parseEnum(parent, token);\r\n return true;\r\n\r\n case \"service\":\r\n parseService(parent, token);\r\n return true;\r\n\r\n case \"extend\":\r\n parseExtension(parent, token);\r\n return true;\r\n }\r\n return false;\r\n }\r\n\r\n function ifBlock(obj, fnIf, fnElse) {\r\n var trailingLine = tn.line;\r\n if (obj) {\r\n if(typeof obj.comment !== \"string\") {\r\n obj.comment = cmnt(); // try block-type comment\r\n }\r\n obj.filename = parse.filename;\r\n }\r\n if (skip(\"{\", true)) {\r\n var token;\r\n while ((token = next()) !== \"}\")\r\n fnIf(token);\r\n skip(\";\", true);\r\n } else {\r\n if (fnElse)\r\n fnElse();\r\n skip(\";\");\r\n if (obj && (typeof obj.comment !== \"string\" || preferTrailingComment))\r\n obj.comment = cmnt(trailingLine) || obj.comment; // try line-type comment\r\n }\r\n }\r\n\r\n function parseType(parent, token) {\r\n\r\n /* istanbul ignore if */\r\n if (!nameRe.test(token = next()))\r\n throw illegal(token, \"type name\");\r\n\r\n var type = new Type(token);\r\n ifBlock(type, function parseType_block(token) {\r\n if (parseCommon(type, token))\r\n return;\r\n\r\n switch (token) {\r\n\r\n case \"map\":\r\n parseMapField(type, token);\r\n break;\r\n\r\n case \"required\":\r\n case \"repeated\":\r\n parseField(type, token);\r\n break;\r\n\r\n case \"optional\":\r\n /* istanbul ignore if */\r\n if (isProto3) {\r\n parseField(type, \"proto3_optional\");\r\n } else {\r\n parseField(type, \"optional\");\r\n }\r\n break;\r\n\r\n case \"oneof\":\r\n parseOneOf(type, token);\r\n break;\r\n\r\n case \"extensions\":\r\n readRanges(type.extensions || (type.extensions = []));\r\n break;\r\n\r\n case \"reserved\":\r\n readRanges(type.reserved || (type.reserved = []), true);\r\n break;\r\n\r\n default:\r\n /* istanbul ignore if */\r\n if (!isProto3 || !typeRefRe.test(token))\r\n throw illegal(token);\r\n\r\n push(token);\r\n parseField(type, \"optional\");\r\n break;\r\n }\r\n });\r\n parent.add(type);\r\n }\r\n\r\n function parseField(parent, rule, extend) {\r\n var type = next();\r\n if (type === \"group\") {\r\n parseGroup(parent, rule);\r\n return;\r\n }\r\n // Type names can consume multiple tokens, in multiple variants:\r\n // package.subpackage field tokens: \"package.subpackage\" [TYPE NAME ENDS HERE] \"field\"\r\n // package . subpackage field tokens: \"package\" \".\" \"subpackage\" [TYPE NAME ENDS HERE] \"field\"\r\n // package. subpackage field tokens: \"package.\" \"subpackage\" [TYPE NAME ENDS HERE] \"field\"\r\n // package .subpackage field tokens: \"package\" \".subpackage\" [TYPE NAME ENDS HERE] \"field\"\r\n // Keep reading tokens until we get a type name with no period at the end,\r\n // and the next token does not start with a period.\r\n while (type.endsWith(\".\") || peek().startsWith(\".\")) {\r\n type += next();\r\n }\r\n\r\n /* istanbul ignore if */\r\n if (!typeRefRe.test(type))\r\n throw illegal(type, \"type\");\r\n\r\n var name = next();\r\n\r\n /* istanbul ignore if */\r\n if (!nameRe.test(name))\r\n throw illegal(name, \"name\");\r\n\r\n name = applyCase(name);\r\n skip(\"=\");\r\n\r\n var field = new Field(name, parseId(next()), type, rule, extend);\r\n ifBlock(field, function parseField_block(token) {\r\n\r\n /* istanbul ignore else */\r\n if (token === \"option\") {\r\n parseOption(field, token);\r\n skip(\";\");\r\n } else\r\n throw illegal(token);\r\n\r\n }, function parseField_line() {\r\n parseInlineOptions(field);\r\n });\r\n\r\n if (rule === \"proto3_optional\") {\r\n // for proto3 optional fields, we create a single-member Oneof to mimic \"optional\" behavior\r\n var oneof = new OneOf(\"_\" + name);\r\n field.setOption(\"proto3_optional\", true);\r\n oneof.add(field);\r\n parent.add(oneof);\r\n } else {\r\n parent.add(field);\r\n }\r\n\r\n // JSON defaults to packed=true if not set so we have to set packed=false explicity when\r\n // parsing proto2 descriptors without the option, where applicable. This must be done for\r\n // all known packable types and anything that could be an enum (= is not a basic type).\r\n if (!isProto3 && field.repeated && (types.packed[type] !== undefined || types.basic[type] === undefined))\r\n field.setOption(\"packed\", false, /* ifNotSet */ true);\r\n }\r\n\r\n function parseGroup(parent, rule) {\r\n var name = next();\r\n\r\n /* istanbul ignore if */\r\n if (!nameRe.test(name))\r\n throw illegal(name, \"name\");\r\n\r\n var fieldName = util.lcFirst(name);\r\n if (name === fieldName)\r\n name = util.ucFirst(name);\r\n skip(\"=\");\r\n var id = parseId(next());\r\n var type = new Type(name);\r\n type.group = true;\r\n var field = new Field(fieldName, id, name, rule);\r\n field.filename = parse.filename;\r\n ifBlock(type, function parseGroup_block(token) {\r\n switch (token) {\r\n\r\n case \"option\":\r\n parseOption(type, token);\r\n skip(\";\");\r\n break;\r\n\r\n case \"required\":\r\n case \"repeated\":\r\n parseField(type, token);\r\n break;\r\n\r\n case \"optional\":\r\n /* istanbul ignore if */\r\n if (isProto3) {\r\n parseField(type, \"proto3_optional\");\r\n } else {\r\n parseField(type, \"optional\");\r\n }\r\n break;\r\n\r\n case \"message\":\r\n parseType(type, token);\r\n break;\r\n\r\n case \"enum\":\r\n parseEnum(type, token);\r\n break;\r\n\r\n /* istanbul ignore next */\r\n default:\r\n throw illegal(token); // there are no groups with proto3 semantics\r\n }\r\n });\r\n parent.add(type)\r\n .add(field);\r\n }\r\n\r\n function parseMapField(parent) {\r\n skip(\"<\");\r\n var keyType = next();\r\n\r\n /* istanbul ignore if */\r\n if (types.mapKey[keyType] === undefined)\r\n throw illegal(keyType, \"type\");\r\n\r\n skip(\",\");\r\n var valueType = next();\r\n\r\n /* istanbul ignore if */\r\n if (!typeRefRe.test(valueType))\r\n throw illegal(valueType, \"type\");\r\n\r\n skip(\">\");\r\n var name = next();\r\n\r\n /* istanbul ignore if */\r\n if (!nameRe.test(name))\r\n throw illegal(name, \"name\");\r\n\r\n skip(\"=\");\r\n var field = new MapField(applyCase(name), parseId(next()), keyType, valueType);\r\n ifBlock(field, function parseMapField_block(token) {\r\n\r\n /* istanbul ignore else */\r\n if (token === \"option\") {\r\n parseOption(field, token);\r\n skip(\";\");\r\n } else\r\n throw illegal(token);\r\n\r\n }, function parseMapField_line() {\r\n parseInlineOptions(field);\r\n });\r\n parent.add(field);\r\n }\r\n\r\n function parseOneOf(parent, token) {\r\n\r\n /* istanbul ignore if */\r\n if (!nameRe.test(token = next()))\r\n throw illegal(token, \"name\");\r\n\r\n var oneof = new OneOf(applyCase(token));\r\n ifBlock(oneof, function parseOneOf_block(token) {\r\n if (token === \"option\") {\r\n parseOption(oneof, token);\r\n skip(\";\");\r\n } else {\r\n push(token);\r\n parseField(oneof, \"optional\");\r\n }\r\n });\r\n parent.add(oneof);\r\n }\r\n\r\n function parseEnum(parent, token) {\r\n\r\n /* istanbul ignore if */\r\n if (!nameRe.test(token = next()))\r\n throw illegal(token, \"name\");\r\n\r\n var enm = new Enum(token);\r\n ifBlock(enm, function parseEnum_block(token) {\r\n switch(token) {\r\n case \"option\":\r\n parseOption(enm, token);\r\n skip(\";\");\r\n break;\r\n\r\n case \"reserved\":\r\n readRanges(enm.reserved || (enm.reserved = []), true);\r\n break;\r\n\r\n default:\r\n parseEnumValue(enm, token);\r\n }\r\n });\r\n parent.add(enm);\r\n }\r\n\r\n function parseEnumValue(parent, token) {\r\n\r\n /* istanbul ignore if */\r\n if (!nameRe.test(token))\r\n throw illegal(token, \"name\");\r\n\r\n skip(\"=\");\r\n var value = parseId(next(), true),\r\n dummy = {\r\n options: undefined\r\n };\r\n dummy.setOption = function(name, value) {\r\n if (this.options === undefined)\r\n this.options = {};\r\n this.options[name] = value;\r\n };\r\n ifBlock(dummy, function parseEnumValue_block(token) {\r\n\r\n /* istanbul ignore else */\r\n if (token === \"option\") {\r\n parseOption(dummy, token); // skip\r\n skip(\";\");\r\n } else\r\n throw illegal(token);\r\n\r\n }, function parseEnumValue_line() {\r\n parseInlineOptions(dummy); // skip\r\n });\r\n parent.add(token, value, dummy.comment, dummy.options);\r\n }\r\n\r\n function parseOption(parent, token) {\r\n var isCustom = skip(\"(\", true);\r\n\r\n /* istanbul ignore if */\r\n if (!typeRefRe.test(token = next()))\r\n throw illegal(token, \"name\");\r\n\r\n var name = token;\r\n var option = name;\r\n var propName;\r\n\r\n if (isCustom) {\r\n skip(\")\");\r\n name = \"(\" + name + \")\";\r\n option = name;\r\n token = peek();\r\n if (fqTypeRefRe.test(token)) {\r\n propName = token.slice(1); //remove '.' before property name\r\n name += token;\r\n next();\r\n }\r\n }\r\n skip(\"=\");\r\n var optionValue = parseOptionValue(parent, name);\r\n setParsedOption(parent, option, optionValue, propName);\r\n }\r\n\r\n function parseOptionValue(parent, name) {\r\n // { a: \"foo\" b { c: \"bar\" } }\r\n if (skip(\"{\", true)) {\r\n var objectResult = {};\r\n\r\n while (!skip(\"}\", true)) {\r\n /* istanbul ignore if */\r\n if (!nameRe.test(token = next())) {\r\n throw illegal(token, \"name\");\r\n }\r\n if (token === null) {\r\n throw illegal(token, \"end of input\");\r\n }\r\n\r\n var value;\r\n var propName = token;\r\n\r\n skip(\":\", true);\r\n\r\n if (peek() === \"{\")\r\n value = parseOptionValue(parent, name + \".\" + token);\r\n else if (peek() === \"[\") {\r\n // option (my_option) = {\r\n // repeated_value: [ \"foo\", \"bar\" ]\r\n // };\r\n value = [];\r\n var lastValue;\r\n if (skip(\"[\", true)) {\r\n do {\r\n lastValue = readValue(true);\r\n value.push(lastValue);\r\n } while (skip(\",\", true));\r\n skip(\"]\");\r\n if (typeof lastValue !== \"undefined\") {\r\n setOption(parent, name + \".\" + token, lastValue);\r\n }\r\n }\r\n } else {\r\n value = readValue(true);\r\n setOption(parent, name + \".\" + token, value);\r\n }\r\n\r\n var prevValue = objectResult[propName];\r\n\r\n if (prevValue)\r\n value = [].concat(prevValue).concat(value);\r\n\r\n objectResult[propName] = value;\r\n\r\n // Semicolons and commas can be optional\r\n skip(\",\", true);\r\n skip(\";\", true);\r\n }\r\n\r\n return objectResult;\r\n }\r\n\r\n var simpleValue = readValue(true);\r\n setOption(parent, name, simpleValue);\r\n return simpleValue;\r\n // Does not enforce a delimiter to be universal\r\n }\r\n\r\n function setOption(parent, name, value) {\r\n if (parent.setOption)\r\n parent.setOption(name, value);\r\n }\r\n\r\n function setParsedOption(parent, name, value, propName) {\r\n if (parent.setParsedOption)\r\n parent.setParsedOption(name, value, propName);\r\n }\r\n\r\n function parseInlineOptions(parent) {\r\n if (skip(\"[\", true)) {\r\n do {\r\n parseOption(parent, \"option\");\r\n } while (skip(\",\", true));\r\n skip(\"]\");\r\n }\r\n return parent;\r\n }\r\n\r\n function parseService(parent, token) {\r\n\r\n /* istanbul ignore if */\r\n if (!nameRe.test(token = next()))\r\n throw illegal(token, \"service name\");\r\n\r\n var service = new Service(token);\r\n ifBlock(service, function parseService_block(token) {\r\n if (parseCommon(service, token))\r\n return;\r\n\r\n /* istanbul ignore else */\r\n if (token === \"rpc\")\r\n parseMethod(service, token);\r\n else\r\n throw illegal(token);\r\n });\r\n parent.add(service);\r\n }\r\n\r\n function parseMethod(parent, token) {\r\n // Get the comment of the preceding line now (if one exists) in case the\r\n // method is defined across multiple lines.\r\n var commentText = cmnt();\r\n\r\n var type = token;\r\n\r\n /* istanbul ignore if */\r\n if (!nameRe.test(token = next()))\r\n throw illegal(token, \"name\");\r\n\r\n var name = token,\r\n requestType, requestStream,\r\n responseType, responseStream;\r\n\r\n skip(\"(\");\r\n if (skip(\"stream\", true))\r\n requestStream = true;\r\n\r\n /* istanbul ignore if */\r\n if (!typeRefRe.test(token = next()))\r\n throw illegal(token);\r\n\r\n requestType = token;\r\n skip(\")\"); skip(\"returns\"); skip(\"(\");\r\n if (skip(\"stream\", true))\r\n responseStream = true;\r\n\r\n /* istanbul ignore if */\r\n if (!typeRefRe.test(token = next()))\r\n throw illegal(token);\r\n\r\n responseType = token;\r\n skip(\")\");\r\n\r\n var method = new Method(name, type, requestType, responseType, requestStream, responseStream);\r\n method.comment = commentText;\r\n ifBlock(method, function parseMethod_block(token) {\r\n\r\n /* istanbul ignore else */\r\n if (token === \"option\") {\r\n parseOption(method, token);\r\n skip(\";\");\r\n } else\r\n throw illegal(token);\r\n\r\n });\r\n parent.add(method);\r\n }\r\n\r\n function parseExtension(parent, token) {\r\n\r\n /* istanbul ignore if */\r\n if (!typeRefRe.test(token = next()))\r\n throw illegal(token, \"reference\");\r\n\r\n var reference = token;\r\n ifBlock(null, function parseExtension_block(token) {\r\n switch (token) {\r\n\r\n case \"required\":\r\n case \"repeated\":\r\n parseField(parent, token, reference);\r\n break;\r\n\r\n case \"optional\":\r\n /* istanbul ignore if */\r\n if (isProto3) {\r\n parseField(parent, \"proto3_optional\", reference);\r\n } else {\r\n parseField(parent, \"optional\", reference);\r\n }\r\n break;\r\n\r\n default:\r\n /* istanbul ignore if */\r\n if (!isProto3 || !typeRefRe.test(token))\r\n throw illegal(token);\r\n push(token);\r\n parseField(parent, \"optional\", reference);\r\n break;\r\n }\r\n });\r\n }\r\n\r\n var token;\r\n while ((token = next()) !== null) {\r\n switch (token) {\r\n\r\n case \"package\":\r\n\r\n /* istanbul ignore if */\r\n if (!head)\r\n throw illegal(token);\r\n\r\n parsePackage();\r\n break;\r\n\r\n case \"import\":\r\n\r\n /* istanbul ignore if */\r\n if (!head)\r\n throw illegal(token);\r\n\r\n parseImport();\r\n break;\r\n\r\n case \"syntax\":\r\n\r\n /* istanbul ignore if */\r\n if (!head)\r\n throw illegal(token);\r\n\r\n parseSyntax();\r\n break;\r\n\r\n case \"option\":\r\n\r\n parseOption(ptr, token);\r\n skip(\";\");\r\n break;\r\n\r\n default:\r\n\r\n /* istanbul ignore else */\r\n if (parseCommon(ptr, token)) {\r\n head = false;\r\n continue;\r\n }\r\n\r\n /* istanbul ignore next */\r\n throw illegal(token);\r\n }\r\n }\r\n\r\n parse.filename = null;\r\n return {\r\n \"package\" : pkg,\r\n \"imports\" : imports,\r\n weakImports : weakImports,\r\n syntax : syntax,\r\n root : root\r\n };\r\n}\r\n\r\n/**\r\n * Parses the given .proto source and returns an object with the parsed contents.\r\n * @name parse\r\n * @function\r\n * @param {string} source Source contents\r\n * @param {IParseOptions} [options] Parse options. Defaults to {@link parse.defaults} when omitted.\r\n * @returns {IParserResult} Parser result\r\n * @property {string} filename=null Currently processing file name for error reporting, if known\r\n * @property {IParseOptions} defaults Default {@link IParseOptions}\r\n * @variation 2\r\n */\r\n","\"use strict\";\r\nmodule.exports = Reader;\r\n\r\nvar util = require(\"./util/minimal\");\r\n\r\nvar BufferReader; // cyclic\r\n\r\nvar LongBits = util.LongBits,\r\n utf8 = util.utf8;\r\n\r\n/* istanbul ignore next */\r\nfunction indexOutOfRange(reader, writeLength) {\r\n return RangeError(\"index out of range: \" + reader.pos + \" + \" + (writeLength || 1) + \" > \" + reader.len);\r\n}\r\n\r\n/**\r\n * Constructs a new reader instance using the specified buffer.\r\n * @classdesc Wire format reader using `Uint8Array` if available, otherwise `Array`.\r\n * @constructor\r\n * @param {Uint8Array} buffer Buffer to read from\r\n */\r\nfunction Reader(buffer) {\r\n\r\n /**\r\n * Read buffer.\r\n * @type {Uint8Array}\r\n */\r\n this.buf = buffer;\r\n\r\n /**\r\n * Read buffer position.\r\n * @type {number}\r\n */\r\n this.pos = 0;\r\n\r\n /**\r\n * Read buffer length.\r\n * @type {number}\r\n */\r\n this.len = buffer.length;\r\n}\r\n\r\nvar create_array = typeof Uint8Array !== \"undefined\"\r\n ? function create_typed_array(buffer) {\r\n if (buffer instanceof Uint8Array || Array.isArray(buffer))\r\n return new Reader(buffer);\r\n throw Error(\"illegal buffer\");\r\n }\r\n /* istanbul ignore next */\r\n : function create_array(buffer) {\r\n if (Array.isArray(buffer))\r\n return new Reader(buffer);\r\n throw Error(\"illegal buffer\");\r\n };\r\n\r\nvar create = function create() {\r\n return util.Buffer\r\n ? function create_buffer_setup(buffer) {\r\n return (Reader.create = function create_buffer(buffer) {\r\n return util.Buffer.isBuffer(buffer)\r\n ? new BufferReader(buffer)\r\n /* istanbul ignore next */\r\n : create_array(buffer);\r\n })(buffer);\r\n }\r\n /* istanbul ignore next */\r\n : create_array;\r\n};\r\n\r\n/**\r\n * Creates a new reader using the specified buffer.\r\n * @function\r\n * @param {Uint8Array|Buffer} buffer Buffer to read from\r\n * @returns {Reader|BufferReader} A {@link BufferReader} if `buffer` is a Buffer, otherwise a {@link Reader}\r\n * @throws {Error} If `buffer` is not a valid buffer\r\n */\r\nReader.create = create();\r\n\r\nReader.prototype._slice = util.Array.prototype.subarray || /* istanbul ignore next */ util.Array.prototype.slice;\r\n\r\n/**\r\n * Reads a varint as an unsigned 32 bit value.\r\n * @function\r\n * @returns {number} Value read\r\n */\r\nReader.prototype.uint32 = (function read_uint32_setup() {\r\n var value = 4294967295; // optimizer type-hint, tends to deopt otherwise (?!)\r\n return function read_uint32() {\r\n value = ( this.buf[this.pos] & 127 ) >>> 0; if (this.buf[this.pos++] < 128) return value;\r\n value = (value | (this.buf[this.pos] & 127) << 7) >>> 0; if (this.buf[this.pos++] < 128) return value;\r\n value = (value | (this.buf[this.pos] & 127) << 14) >>> 0; if (this.buf[this.pos++] < 128) return value;\r\n value = (value | (this.buf[this.pos] & 127) << 21) >>> 0; if (this.buf[this.pos++] < 128) return value;\r\n value = (value | (this.buf[this.pos] & 15) << 28) >>> 0; if (this.buf[this.pos++] < 128) return value;\r\n\r\n /* istanbul ignore if */\r\n if ((this.pos += 5) > this.len) {\r\n this.pos = this.len;\r\n throw indexOutOfRange(this, 10);\r\n }\r\n return value;\r\n };\r\n})();\r\n\r\n/**\r\n * Reads a varint as a signed 32 bit value.\r\n * @returns {number} Value read\r\n */\r\nReader.prototype.int32 = function read_int32() {\r\n return this.uint32() | 0;\r\n};\r\n\r\n/**\r\n * Reads a zig-zag encoded varint as a signed 32 bit value.\r\n * @returns {number} Value read\r\n */\r\nReader.prototype.sint32 = function read_sint32() {\r\n var value = this.uint32();\r\n return value >>> 1 ^ -(value & 1) | 0;\r\n};\r\n\r\n/* eslint-disable no-invalid-this */\r\n\r\nfunction readLongVarint() {\r\n // tends to deopt with local vars for octet etc.\r\n var bits = new LongBits(0, 0);\r\n var i = 0;\r\n if (this.len - this.pos > 4) { // fast route (lo)\r\n for (; i < 4; ++i) {\r\n // 1st..4th\r\n bits.lo = (bits.lo | (this.buf[this.pos] & 127) << i * 7) >>> 0;\r\n if (this.buf[this.pos++] < 128)\r\n return bits;\r\n }\r\n // 5th\r\n bits.lo = (bits.lo | (this.buf[this.pos] & 127) << 28) >>> 0;\r\n bits.hi = (bits.hi | (this.buf[this.pos] & 127) >> 4) >>> 0;\r\n if (this.buf[this.pos++] < 128)\r\n return bits;\r\n i = 0;\r\n } else {\r\n for (; i < 3; ++i) {\r\n /* istanbul ignore if */\r\n if (this.pos >= this.len)\r\n throw indexOutOfRange(this);\r\n // 1st..3th\r\n bits.lo = (bits.lo | (this.buf[this.pos] & 127) << i * 7) >>> 0;\r\n if (this.buf[this.pos++] < 128)\r\n return bits;\r\n }\r\n // 4th\r\n bits.lo = (bits.lo | (this.buf[this.pos++] & 127) << i * 7) >>> 0;\r\n return bits;\r\n }\r\n if (this.len - this.pos > 4) { // fast route (hi)\r\n for (; i < 5; ++i) {\r\n // 6th..10th\r\n bits.hi = (bits.hi | (this.buf[this.pos] & 127) << i * 7 + 3) >>> 0;\r\n if (this.buf[this.pos++] < 128)\r\n return bits;\r\n }\r\n } else {\r\n for (; i < 5; ++i) {\r\n /* istanbul ignore if */\r\n if (this.pos >= this.len)\r\n throw indexOutOfRange(this);\r\n // 6th..10th\r\n bits.hi = (bits.hi | (this.buf[this.pos] & 127) << i * 7 + 3) >>> 0;\r\n if (this.buf[this.pos++] < 128)\r\n return bits;\r\n }\r\n }\r\n /* istanbul ignore next */\r\n throw Error(\"invalid varint encoding\");\r\n}\r\n\r\n/* eslint-enable no-invalid-this */\r\n\r\n/**\r\n * Reads a varint as a signed 64 bit value.\r\n * @name Reader#int64\r\n * @function\r\n * @returns {Long} Value read\r\n */\r\n\r\n/**\r\n * Reads a varint as an unsigned 64 bit value.\r\n * @name Reader#uint64\r\n * @function\r\n * @returns {Long} Value read\r\n */\r\n\r\n/**\r\n * Reads a zig-zag encoded varint as a signed 64 bit value.\r\n * @name Reader#sint64\r\n * @function\r\n * @returns {Long} Value read\r\n */\r\n\r\n/**\r\n * Reads a varint as a boolean.\r\n * @returns {boolean} Value read\r\n */\r\nReader.prototype.bool = function read_bool() {\r\n return this.uint32() !== 0;\r\n};\r\n\r\nfunction readFixed32_end(buf, end) { // note that this uses `end`, not `pos`\r\n return (buf[end - 4]\r\n | buf[end - 3] << 8\r\n | buf[end - 2] << 16\r\n | buf[end - 1] << 24) >>> 0;\r\n}\r\n\r\n/**\r\n * Reads fixed 32 bits as an unsigned 32 bit integer.\r\n * @returns {number} Value read\r\n */\r\nReader.prototype.fixed32 = function read_fixed32() {\r\n\r\n /* istanbul ignore if */\r\n if (this.pos + 4 > this.len)\r\n throw indexOutOfRange(this, 4);\r\n\r\n return readFixed32_end(this.buf, this.pos += 4);\r\n};\r\n\r\n/**\r\n * Reads fixed 32 bits as a signed 32 bit integer.\r\n * @returns {number} Value read\r\n */\r\nReader.prototype.sfixed32 = function read_sfixed32() {\r\n\r\n /* istanbul ignore if */\r\n if (this.pos + 4 > this.len)\r\n throw indexOutOfRange(this, 4);\r\n\r\n return readFixed32_end(this.buf, this.pos += 4) | 0;\r\n};\r\n\r\n/* eslint-disable no-invalid-this */\r\n\r\nfunction readFixed64(/* this: Reader */) {\r\n\r\n /* istanbul ignore if */\r\n if (this.pos + 8 > this.len)\r\n throw indexOutOfRange(this, 8);\r\n\r\n return new LongBits(readFixed32_end(this.buf, this.pos += 4), readFixed32_end(this.buf, this.pos += 4));\r\n}\r\n\r\n/* eslint-enable no-invalid-this */\r\n\r\n/**\r\n * Reads fixed 64 bits.\r\n * @name Reader#fixed64\r\n * @function\r\n * @returns {Long} Value read\r\n */\r\n\r\n/**\r\n * Reads zig-zag encoded fixed 64 bits.\r\n * @name Reader#sfixed64\r\n * @function\r\n * @returns {Long} Value read\r\n */\r\n\r\n/**\r\n * Reads a float (32 bit) as a number.\r\n * @function\r\n * @returns {number} Value read\r\n */\r\nReader.prototype.float = function read_float() {\r\n\r\n /* istanbul ignore if */\r\n if (this.pos + 4 > this.len)\r\n throw indexOutOfRange(this, 4);\r\n\r\n var value = util.float.readFloatLE(this.buf, this.pos);\r\n this.pos += 4;\r\n return value;\r\n};\r\n\r\n/**\r\n * Reads a double (64 bit float) as a number.\r\n * @function\r\n * @returns {number} Value read\r\n */\r\nReader.prototype.double = function read_double() {\r\n\r\n /* istanbul ignore if */\r\n if (this.pos + 8 > this.len)\r\n throw indexOutOfRange(this, 4);\r\n\r\n var value = util.float.readDoubleLE(this.buf, this.pos);\r\n this.pos += 8;\r\n return value;\r\n};\r\n\r\n/**\r\n * Reads a sequence of bytes preceeded by its length as a varint.\r\n * @returns {Uint8Array} Value read\r\n */\r\nReader.prototype.bytes = function read_bytes() {\r\n var length = this.uint32(),\r\n start = this.pos,\r\n end = this.pos + length;\r\n\r\n /* istanbul ignore if */\r\n if (end > this.len)\r\n throw indexOutOfRange(this, length);\r\n\r\n this.pos += length;\r\n if (Array.isArray(this.buf)) // plain array\r\n return this.buf.slice(start, end);\r\n\r\n if (start === end) { // fix for IE 10/Win8 and others' subarray returning array of size 1\r\n var nativeBuffer = util.Buffer;\r\n return nativeBuffer\r\n ? nativeBuffer.alloc(0)\r\n : new this.buf.constructor(0);\r\n }\r\n return this._slice.call(this.buf, start, end);\r\n};\r\n\r\n/**\r\n * Reads a string preceeded by its byte length as a varint.\r\n * @returns {string} Value read\r\n */\r\nReader.prototype.string = function read_string() {\r\n var bytes = this.bytes();\r\n return utf8.read(bytes, 0, bytes.length);\r\n};\r\n\r\n/**\r\n * Skips the specified number of bytes if specified, otherwise skips a varint.\r\n * @param {number} [length] Length if known, otherwise a varint is assumed\r\n * @returns {Reader} `this`\r\n */\r\nReader.prototype.skip = function skip(length) {\r\n if (typeof length === \"number\") {\r\n /* istanbul ignore if */\r\n if (this.pos + length > this.len)\r\n throw indexOutOfRange(this, length);\r\n this.pos += length;\r\n } else {\r\n do {\r\n /* istanbul ignore if */\r\n if (this.pos >= this.len)\r\n throw indexOutOfRange(this);\r\n } while (this.buf[this.pos++] & 128);\r\n }\r\n return this;\r\n};\r\n\r\n/**\r\n * Skips the next element of the specified wire type.\r\n * @param {number} wireType Wire type received\r\n * @returns {Reader} `this`\r\n */\r\nReader.prototype.skipType = function(wireType) {\r\n switch (wireType) {\r\n case 0:\r\n this.skip();\r\n break;\r\n case 1:\r\n this.skip(8);\r\n break;\r\n case 2:\r\n this.skip(this.uint32());\r\n break;\r\n case 3:\r\n while ((wireType = this.uint32() & 7) !== 4) {\r\n this.skipType(wireType);\r\n }\r\n break;\r\n case 5:\r\n this.skip(4);\r\n break;\r\n\r\n /* istanbul ignore next */\r\n default:\r\n throw Error(\"invalid wire type \" + wireType + \" at offset \" + this.pos);\r\n }\r\n return this;\r\n};\r\n\r\nReader._configure = function(BufferReader_) {\r\n BufferReader = BufferReader_;\r\n Reader.create = create();\r\n BufferReader._configure();\r\n\r\n var fn = util.Long ? \"toLong\" : /* istanbul ignore next */ \"toNumber\";\r\n util.merge(Reader.prototype, {\r\n\r\n int64: function read_int64() {\r\n return readLongVarint.call(this)[fn](false);\r\n },\r\n\r\n uint64: function read_uint64() {\r\n return readLongVarint.call(this)[fn](true);\r\n },\r\n\r\n sint64: function read_sint64() {\r\n return readLongVarint.call(this).zzDecode()[fn](false);\r\n },\r\n\r\n fixed64: function read_fixed64() {\r\n return readFixed64.call(this)[fn](true);\r\n },\r\n\r\n sfixed64: function read_sfixed64() {\r\n return readFixed64.call(this)[fn](false);\r\n }\r\n\r\n });\r\n};\r\n","\"use strict\";\r\nmodule.exports = BufferReader;\r\n\r\n// extends Reader\r\nvar Reader = require(\"./reader\");\r\n(BufferReader.prototype = Object.create(Reader.prototype)).constructor = BufferReader;\r\n\r\nvar util = require(\"./util/minimal\");\r\n\r\n/**\r\n * Constructs a new buffer reader instance.\r\n * @classdesc Wire format reader using node buffers.\r\n * @extends Reader\r\n * @constructor\r\n * @param {Buffer} buffer Buffer to read from\r\n */\r\nfunction BufferReader(buffer) {\r\n Reader.call(this, buffer);\r\n\r\n /**\r\n * Read buffer.\r\n * @name BufferReader#buf\r\n * @type {Buffer}\r\n */\r\n}\r\n\r\nBufferReader._configure = function () {\r\n /* istanbul ignore else */\r\n if (util.Buffer)\r\n BufferReader.prototype._slice = util.Buffer.prototype.slice;\r\n};\r\n\r\n\r\n/**\r\n * @override\r\n */\r\nBufferReader.prototype.string = function read_string_buffer() {\r\n var len = this.uint32(); // modifies pos\r\n return this.buf.utf8Slice\r\n ? this.buf.utf8Slice(this.pos, this.pos = Math.min(this.pos + len, this.len))\r\n : this.buf.toString(\"utf-8\", this.pos, this.pos = Math.min(this.pos + len, this.len));\r\n};\r\n\r\n/**\r\n * Reads a sequence of bytes preceeded by its length as a varint.\r\n * @name BufferReader#bytes\r\n * @function\r\n * @returns {Buffer} Value read\r\n */\r\n\r\nBufferReader._configure();\r\n","\"use strict\";\r\nmodule.exports = Root;\r\n\r\n// extends Namespace\r\nvar Namespace = require(\"./namespace\");\r\n((Root.prototype = Object.create(Namespace.prototype)).constructor = Root).className = \"Root\";\r\n\r\nvar Field = require(\"./field\"),\r\n Enum = require(\"./enum\"),\r\n OneOf = require(\"./oneof\"),\r\n util = require(\"./util\");\r\n\r\nvar Type, // cyclic\r\n parse, // might be excluded\r\n common; // \"\r\n\r\n/**\r\n * Constructs a new root namespace instance.\r\n * @classdesc Root namespace wrapping all types, enums, services, sub-namespaces etc. that belong together.\r\n * @extends NamespaceBase\r\n * @constructor\r\n * @param {Object.} [options] Top level options\r\n */\r\nfunction Root(options) {\r\n Namespace.call(this, \"\", options);\r\n\r\n /**\r\n * Deferred extension fields.\r\n * @type {Field[]}\r\n */\r\n this.deferred = [];\r\n\r\n /**\r\n * Resolved file names of loaded files.\r\n * @type {string[]}\r\n */\r\n this.files = [];\r\n}\r\n\r\n/**\r\n * Loads a namespace descriptor into a root namespace.\r\n * @param {INamespace} json Nameespace descriptor\r\n * @param {Root} [root] Root namespace, defaults to create a new one if omitted\r\n * @returns {Root} Root namespace\r\n */\r\nRoot.fromJSON = function fromJSON(json, root) {\r\n if (!root)\r\n root = new Root();\r\n if (json.options)\r\n root.setOptions(json.options);\r\n return root.addJSON(json.nested);\r\n};\r\n\r\n/**\r\n * Resolves the path of an imported file, relative to the importing origin.\r\n * This method exists so you can override it with your own logic in case your imports are scattered over multiple directories.\r\n * @function\r\n * @param {string} origin The file name of the importing file\r\n * @param {string} target The file name being imported\r\n * @returns {string|null} Resolved path to `target` or `null` to skip the file\r\n */\r\nRoot.prototype.resolvePath = util.path.resolve;\r\n\r\n/**\r\n * Fetch content from file path or url\r\n * This method exists so you can override it with your own logic.\r\n * @function\r\n * @param {string} path File path or url\r\n * @param {FetchCallback} callback Callback function\r\n * @returns {undefined}\r\n */\r\nRoot.prototype.fetch = util.fetch;\r\n\r\n// A symbol-like function to safely signal synchronous loading\r\n/* istanbul ignore next */\r\nfunction SYNC() {} // eslint-disable-line no-empty-function\r\n\r\n/**\r\n * Loads one or multiple .proto or preprocessed .json files into this root namespace and calls the callback.\r\n * @param {string|string[]} filename Names of one or multiple files to load\r\n * @param {IParseOptions} options Parse options\r\n * @param {LoadCallback} callback Callback function\r\n * @returns {undefined}\r\n */\r\nRoot.prototype.load = function load(filename, options, callback) {\r\n if (typeof options === \"function\") {\r\n callback = options;\r\n options = undefined;\r\n }\r\n var self = this;\r\n if (!callback)\r\n return util.asPromise(load, self, filename, options);\r\n\r\n var sync = callback === SYNC; // undocumented\r\n\r\n // Finishes loading by calling the callback (exactly once)\r\n function finish(err, root) {\r\n /* istanbul ignore if */\r\n if (!callback)\r\n return;\r\n if (sync)\r\n throw err;\r\n var cb = callback;\r\n callback = null;\r\n cb(err, root);\r\n }\r\n\r\n // Bundled definition existence checking\r\n function getBundledFileName(filename) {\r\n var idx = filename.lastIndexOf(\"google/protobuf/\");\r\n if (idx > -1) {\r\n var altname = filename.substring(idx);\r\n if (altname in common) return altname;\r\n }\r\n return null;\r\n }\r\n\r\n // Processes a single file\r\n function process(filename, source) {\r\n try {\r\n if (util.isString(source) && source.charAt(0) === \"{\")\r\n source = JSON.parse(source);\r\n if (!util.isString(source))\r\n self.setOptions(source.options).addJSON(source.nested);\r\n else {\r\n parse.filename = filename;\r\n var parsed = parse(source, self, options),\r\n resolved,\r\n i = 0;\r\n if (parsed.imports)\r\n for (; i < parsed.imports.length; ++i)\r\n if (resolved = getBundledFileName(parsed.imports[i]) || self.resolvePath(filename, parsed.imports[i]))\r\n fetch(resolved);\r\n if (parsed.weakImports)\r\n for (i = 0; i < parsed.weakImports.length; ++i)\r\n if (resolved = getBundledFileName(parsed.weakImports[i]) || self.resolvePath(filename, parsed.weakImports[i]))\r\n fetch(resolved, true);\r\n }\r\n } catch (err) {\r\n finish(err);\r\n }\r\n if (!sync && !queued)\r\n finish(null, self); // only once anyway\r\n }\r\n\r\n // Fetches a single file\r\n function fetch(filename, weak) {\r\n filename = getBundledFileName(filename) || filename;\r\n\r\n // Skip if already loaded / attempted\r\n if (self.files.indexOf(filename) > -1)\r\n return;\r\n self.files.push(filename);\r\n\r\n // Shortcut bundled definitions\r\n if (filename in common) {\r\n if (sync)\r\n process(filename, common[filename]);\r\n else {\r\n ++queued;\r\n setTimeout(function() {\r\n --queued;\r\n process(filename, common[filename]);\r\n });\r\n }\r\n return;\r\n }\r\n\r\n // Otherwise fetch from disk or network\r\n if (sync) {\r\n var source;\r\n try {\r\n source = util.fs.readFileSync(filename).toString(\"utf8\");\r\n } catch (err) {\r\n if (!weak)\r\n finish(err);\r\n return;\r\n }\r\n process(filename, source);\r\n } else {\r\n ++queued;\r\n self.fetch(filename, function(err, source) {\r\n --queued;\r\n /* istanbul ignore if */\r\n if (!callback)\r\n return; // terminated meanwhile\r\n if (err) {\r\n /* istanbul ignore else */\r\n if (!weak)\r\n finish(err);\r\n else if (!queued) // can't be covered reliably\r\n finish(null, self);\r\n return;\r\n }\r\n process(filename, source);\r\n });\r\n }\r\n }\r\n var queued = 0;\r\n\r\n // Assembling the root namespace doesn't require working type\r\n // references anymore, so we can load everything in parallel\r\n if (util.isString(filename))\r\n filename = [ filename ];\r\n for (var i = 0, resolved; i < filename.length; ++i)\r\n if (resolved = self.resolvePath(\"\", filename[i]))\r\n fetch(resolved);\r\n\r\n if (sync)\r\n return self;\r\n if (!queued)\r\n finish(null, self);\r\n return undefined;\r\n};\r\n// function load(filename:string, options:IParseOptions, callback:LoadCallback):undefined\r\n\r\n/**\r\n * Loads one or multiple .proto or preprocessed .json files into this root namespace and calls the callback.\r\n * @function Root#load\r\n * @param {string|string[]} filename Names of one or multiple files to load\r\n * @param {LoadCallback} callback Callback function\r\n * @returns {undefined}\r\n * @variation 2\r\n */\r\n// function load(filename:string, callback:LoadCallback):undefined\r\n\r\n/**\r\n * Loads one or multiple .proto or preprocessed .json files into this root namespace and returns a promise.\r\n * @function Root#load\r\n * @param {string|string[]} filename Names of one or multiple files to load\r\n * @param {IParseOptions} [options] Parse options. Defaults to {@link parse.defaults} when omitted.\r\n * @returns {Promise} Promise\r\n * @variation 3\r\n */\r\n// function load(filename:string, [options:IParseOptions]):Promise\r\n\r\n/**\r\n * Synchronously loads one or multiple .proto or preprocessed .json files into this root namespace (node only).\r\n * @function Root#loadSync\r\n * @param {string|string[]} filename Names of one or multiple files to load\r\n * @param {IParseOptions} [options] Parse options. Defaults to {@link parse.defaults} when omitted.\r\n * @returns {Root} Root namespace\r\n * @throws {Error} If synchronous fetching is not supported (i.e. in browsers) or if a file's syntax is invalid\r\n */\r\nRoot.prototype.loadSync = function loadSync(filename, options) {\r\n if (!util.isNode)\r\n throw Error(\"not supported\");\r\n return this.load(filename, options, SYNC);\r\n};\r\n\r\n/**\r\n * @override\r\n */\r\nRoot.prototype.resolveAll = function resolveAll() {\r\n if (this.deferred.length)\r\n throw Error(\"unresolvable extensions: \" + this.deferred.map(function(field) {\r\n return \"'extend \" + field.extend + \"' in \" + field.parent.fullName;\r\n }).join(\", \"));\r\n return Namespace.prototype.resolveAll.call(this);\r\n};\r\n\r\n// only uppercased (and thus conflict-free) children are exposed, see below\r\nvar exposeRe = /^[A-Z]/;\r\n\r\n/**\r\n * Handles a deferred declaring extension field by creating a sister field to represent it within its extended type.\r\n * @param {Root} root Root instance\r\n * @param {Field} field Declaring extension field witin the declaring type\r\n * @returns {boolean} `true` if successfully added to the extended type, `false` otherwise\r\n * @inner\r\n * @ignore\r\n */\r\nfunction tryHandleExtension(root, field) {\r\n var extendedType = field.parent.lookup(field.extend);\r\n if (extendedType) {\r\n var sisterField = new Field(field.fullName, field.id, field.type, field.rule, undefined, field.options);\r\n //do not allow to extend same field twice to prevent the error\r\n if (extendedType.get(sisterField.name)) {\r\n return true;\r\n }\r\n sisterField.declaringField = field;\r\n field.extensionField = sisterField;\r\n extendedType.add(sisterField);\r\n return true;\r\n }\r\n return false;\r\n}\r\n\r\n/**\r\n * Called when any object is added to this root or its sub-namespaces.\r\n * @param {ReflectionObject} object Object added\r\n * @returns {undefined}\r\n * @private\r\n */\r\nRoot.prototype._handleAdd = function _handleAdd(object) {\r\n if (object instanceof Field) {\r\n\r\n if (/* an extension field (implies not part of a oneof) */ object.extend !== undefined && /* not already handled */ !object.extensionField)\r\n if (!tryHandleExtension(this, object))\r\n this.deferred.push(object);\r\n\r\n } else if (object instanceof Enum) {\r\n\r\n if (exposeRe.test(object.name))\r\n object.parent[object.name] = object.values; // expose enum values as property of its parent\r\n\r\n } else if (!(object instanceof OneOf)) /* everything else is a namespace */ {\r\n\r\n if (object instanceof Type) // Try to handle any deferred extensions\r\n for (var i = 0; i < this.deferred.length;)\r\n if (tryHandleExtension(this, this.deferred[i]))\r\n this.deferred.splice(i, 1);\r\n else\r\n ++i;\r\n for (var j = 0; j < /* initializes */ object.nestedArray.length; ++j) // recurse into the namespace\r\n this._handleAdd(object._nestedArray[j]);\r\n if (exposeRe.test(object.name))\r\n object.parent[object.name] = object; // expose namespace as property of its parent\r\n }\r\n\r\n // The above also adds uppercased (and thus conflict-free) nested types, services and enums as\r\n // properties of namespaces just like static code does. This allows using a .d.ts generated for\r\n // a static module with reflection-based solutions where the condition is met.\r\n};\r\n\r\n/**\r\n * Called when any object is removed from this root or its sub-namespaces.\r\n * @param {ReflectionObject} object Object removed\r\n * @returns {undefined}\r\n * @private\r\n */\r\nRoot.prototype._handleRemove = function _handleRemove(object) {\r\n if (object instanceof Field) {\r\n\r\n if (/* an extension field */ object.extend !== undefined) {\r\n if (/* already handled */ object.extensionField) { // remove its sister field\r\n object.extensionField.parent.remove(object.extensionField);\r\n object.extensionField = null;\r\n } else { // cancel the extension\r\n var index = this.deferred.indexOf(object);\r\n /* istanbul ignore else */\r\n if (index > -1)\r\n this.deferred.splice(index, 1);\r\n }\r\n }\r\n\r\n } else if (object instanceof Enum) {\r\n\r\n if (exposeRe.test(object.name))\r\n delete object.parent[object.name]; // unexpose enum values\r\n\r\n } else if (object instanceof Namespace) {\r\n\r\n for (var i = 0; i < /* initializes */ object.nestedArray.length; ++i) // recurse into the namespace\r\n this._handleRemove(object._nestedArray[i]);\r\n\r\n if (exposeRe.test(object.name))\r\n delete object.parent[object.name]; // unexpose namespaces\r\n\r\n }\r\n};\r\n\r\n// Sets up cyclic dependencies (called in index-light)\r\nRoot._configure = function(Type_, parse_, common_) {\r\n Type = Type_;\r\n parse = parse_;\r\n common = common_;\r\n};\r\n","\"use strict\";\r\nmodule.exports = {};\r\n\r\n/**\r\n * Named roots.\r\n * This is where pbjs stores generated structures (the option `-r, --root` specifies a name).\r\n * Can also be used manually to make roots available across modules.\r\n * @name roots\r\n * @type {Object.}\r\n * @example\r\n * // pbjs -r myroot -o compiled.js ...\r\n *\r\n * // in another module:\r\n * require(\"./compiled.js\");\r\n *\r\n * // in any subsequent module:\r\n * var root = protobuf.roots[\"myroot\"];\r\n */\r\n","\"use strict\";\r\n\r\n/**\r\n * Streaming RPC helpers.\r\n * @namespace\r\n */\r\nvar rpc = exports;\r\n\r\n/**\r\n * RPC implementation passed to {@link Service#create} performing a service request on network level, i.e. by utilizing http requests or websockets.\r\n * @typedef RPCImpl\r\n * @type {function}\r\n * @param {Method|rpc.ServiceMethod,Message<{}>>} method Reflected or static method being called\r\n * @param {Uint8Array} requestData Request data\r\n * @param {RPCImplCallback} callback Callback function\r\n * @returns {undefined}\r\n * @example\r\n * function rpcImpl(method, requestData, callback) {\r\n * if (protobuf.util.lcFirst(method.name) !== \"myMethod\") // compatible with static code\r\n * throw Error(\"no such method\");\r\n * asynchronouslyObtainAResponse(requestData, function(err, responseData) {\r\n * callback(err, responseData);\r\n * });\r\n * }\r\n */\r\n\r\n/**\r\n * Node-style callback as used by {@link RPCImpl}.\r\n * @typedef RPCImplCallback\r\n * @type {function}\r\n * @param {Error|null} error Error, if any, otherwise `null`\r\n * @param {Uint8Array|null} [response] Response data or `null` to signal end of stream, if there hasn't been an error\r\n * @returns {undefined}\r\n */\r\n\r\nrpc.Service = require(\"./rpc/service\");\r\n","\"use strict\";\r\nmodule.exports = Service;\r\n\r\nvar util = require(\"../util/minimal\");\r\n\r\n// Extends EventEmitter\r\n(Service.prototype = Object.create(util.EventEmitter.prototype)).constructor = Service;\r\n\r\n/**\r\n * A service method callback as used by {@link rpc.ServiceMethod|ServiceMethod}.\r\n *\r\n * Differs from {@link RPCImplCallback} in that it is an actual callback of a service method which may not return `response = null`.\r\n * @typedef rpc.ServiceMethodCallback\r\n * @template TRes extends Message\r\n * @type {function}\r\n * @param {Error|null} error Error, if any\r\n * @param {TRes} [response] Response message\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * A service method part of a {@link rpc.Service} as created by {@link Service.create}.\r\n * @typedef rpc.ServiceMethod\r\n * @template TReq extends Message\r\n * @template TRes extends Message\r\n * @type {function}\r\n * @param {TReq|Properties} request Request message or plain object\r\n * @param {rpc.ServiceMethodCallback} [callback] Node-style callback called with the error, if any, and the response message\r\n * @returns {Promise>} Promise if `callback` has been omitted, otherwise `undefined`\r\n */\r\n\r\n/**\r\n * Constructs a new RPC service instance.\r\n * @classdesc An RPC service as returned by {@link Service#create}.\r\n * @exports rpc.Service\r\n * @extends util.EventEmitter\r\n * @constructor\r\n * @param {RPCImpl} rpcImpl RPC implementation\r\n * @param {boolean} [requestDelimited=false] Whether requests are length-delimited\r\n * @param {boolean} [responseDelimited=false] Whether responses are length-delimited\r\n */\r\nfunction Service(rpcImpl, requestDelimited, responseDelimited) {\r\n\r\n if (typeof rpcImpl !== \"function\")\r\n throw TypeError(\"rpcImpl must be a function\");\r\n\r\n util.EventEmitter.call(this);\r\n\r\n /**\r\n * RPC implementation. Becomes `null` once the service is ended.\r\n * @type {RPCImpl|null}\r\n */\r\n this.rpcImpl = rpcImpl;\r\n\r\n /**\r\n * Whether requests are length-delimited.\r\n * @type {boolean}\r\n */\r\n this.requestDelimited = Boolean(requestDelimited);\r\n\r\n /**\r\n * Whether responses are length-delimited.\r\n * @type {boolean}\r\n */\r\n this.responseDelimited = Boolean(responseDelimited);\r\n}\r\n\r\n/**\r\n * Calls a service method through {@link rpc.Service#rpcImpl|rpcImpl}.\r\n * @param {Method|rpc.ServiceMethod} method Reflected or static method\r\n * @param {Constructor} requestCtor Request constructor\r\n * @param {Constructor} responseCtor Response constructor\r\n * @param {TReq|Properties} request Request message or plain object\r\n * @param {rpc.ServiceMethodCallback} callback Service callback\r\n * @returns {undefined}\r\n * @template TReq extends Message\r\n * @template TRes extends Message\r\n */\r\nService.prototype.rpcCall = function rpcCall(method, requestCtor, responseCtor, request, callback) {\r\n\r\n if (!request)\r\n throw TypeError(\"request must be specified\");\r\n\r\n var self = this;\r\n if (!callback)\r\n return util.asPromise(rpcCall, self, method, requestCtor, responseCtor, request);\r\n\r\n if (!self.rpcImpl) {\r\n setTimeout(function() { callback(Error(\"already ended\")); }, 0);\r\n return undefined;\r\n }\r\n\r\n try {\r\n return self.rpcImpl(\r\n method,\r\n requestCtor[self.requestDelimited ? \"encodeDelimited\" : \"encode\"](request).finish(),\r\n function rpcCallback(err, response) {\r\n\r\n if (err) {\r\n self.emit(\"error\", err, method);\r\n return callback(err);\r\n }\r\n\r\n if (response === null) {\r\n self.end(/* endedByRPC */ true);\r\n return undefined;\r\n }\r\n\r\n if (!(response instanceof responseCtor)) {\r\n try {\r\n response = responseCtor[self.responseDelimited ? \"decodeDelimited\" : \"decode\"](response);\r\n } catch (err) {\r\n self.emit(\"error\", err, method);\r\n return callback(err);\r\n }\r\n }\r\n\r\n self.emit(\"data\", response, method);\r\n return callback(null, response);\r\n }\r\n );\r\n } catch (err) {\r\n self.emit(\"error\", err, method);\r\n setTimeout(function() { callback(err); }, 0);\r\n return undefined;\r\n }\r\n};\r\n\r\n/**\r\n * Ends this service and emits the `end` event.\r\n * @param {boolean} [endedByRPC=false] Whether the service has been ended by the RPC implementation.\r\n * @returns {rpc.Service} `this`\r\n */\r\nService.prototype.end = function end(endedByRPC) {\r\n if (this.rpcImpl) {\r\n if (!endedByRPC) // signal end to rpcImpl\r\n this.rpcImpl(null, null, null);\r\n this.rpcImpl = null;\r\n this.emit(\"end\").off();\r\n }\r\n return this;\r\n};\r\n","\"use strict\";\r\nmodule.exports = Service;\r\n\r\n// extends Namespace\r\nvar Namespace = require(\"./namespace\");\r\n((Service.prototype = Object.create(Namespace.prototype)).constructor = Service).className = \"Service\";\r\n\r\nvar Method = require(\"./method\"),\r\n util = require(\"./util\"),\r\n rpc = require(\"./rpc\");\r\n\r\n/**\r\n * Constructs a new service instance.\r\n * @classdesc Reflected service.\r\n * @extends NamespaceBase\r\n * @constructor\r\n * @param {string} name Service name\r\n * @param {Object.} [options] Service options\r\n * @throws {TypeError} If arguments are invalid\r\n */\r\nfunction Service(name, options) {\r\n Namespace.call(this, name, options);\r\n\r\n /**\r\n * Service methods.\r\n * @type {Object.}\r\n */\r\n this.methods = {}; // toJSON, marker\r\n\r\n /**\r\n * Cached methods as an array.\r\n * @type {Method[]|null}\r\n * @private\r\n */\r\n this._methodsArray = null;\r\n}\r\n\r\n/**\r\n * Service descriptor.\r\n * @interface IService\r\n * @extends INamespace\r\n * @property {Object.} methods Method descriptors\r\n */\r\n\r\n/**\r\n * Constructs a service from a service descriptor.\r\n * @param {string} name Service name\r\n * @param {IService} json Service descriptor\r\n * @returns {Service} Created service\r\n * @throws {TypeError} If arguments are invalid\r\n */\r\nService.fromJSON = function fromJSON(name, json) {\r\n var service = new Service(name, json.options);\r\n /* istanbul ignore else */\r\n if (json.methods)\r\n for (var names = Object.keys(json.methods), i = 0; i < names.length; ++i)\r\n service.add(Method.fromJSON(names[i], json.methods[names[i]]));\r\n if (json.nested)\r\n service.addJSON(json.nested);\r\n service.comment = json.comment;\r\n return service;\r\n};\r\n\r\n/**\r\n * Converts this service to a service descriptor.\r\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\r\n * @returns {IService} Service descriptor\r\n */\r\nService.prototype.toJSON = function toJSON(toJSONOptions) {\r\n var inherited = Namespace.prototype.toJSON.call(this, toJSONOptions);\r\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\r\n return util.toObject([\r\n \"options\" , inherited && inherited.options || undefined,\r\n \"methods\" , Namespace.arrayToJSON(this.methodsArray, toJSONOptions) || /* istanbul ignore next */ {},\r\n \"nested\" , inherited && inherited.nested || undefined,\r\n \"comment\" , keepComments ? this.comment : undefined\r\n ]);\r\n};\r\n\r\n/**\r\n * Methods of this service as an array for iteration.\r\n * @name Service#methodsArray\r\n * @type {Method[]}\r\n * @readonly\r\n */\r\nObject.defineProperty(Service.prototype, \"methodsArray\", {\r\n get: function() {\r\n return this._methodsArray || (this._methodsArray = util.toArray(this.methods));\r\n }\r\n});\r\n\r\nfunction clearCache(service) {\r\n service._methodsArray = null;\r\n return service;\r\n}\r\n\r\n/**\r\n * @override\r\n */\r\nService.prototype.get = function get(name) {\r\n return this.methods[name]\r\n || Namespace.prototype.get.call(this, name);\r\n};\r\n\r\n/**\r\n * @override\r\n */\r\nService.prototype.resolveAll = function resolveAll() {\r\n var methods = this.methodsArray;\r\n for (var i = 0; i < methods.length; ++i)\r\n methods[i].resolve();\r\n return Namespace.prototype.resolve.call(this);\r\n};\r\n\r\n/**\r\n * @override\r\n */\r\nService.prototype.add = function add(object) {\r\n\r\n /* istanbul ignore if */\r\n if (this.get(object.name))\r\n throw Error(\"duplicate name '\" + object.name + \"' in \" + this);\r\n\r\n if (object instanceof Method) {\r\n this.methods[object.name] = object;\r\n object.parent = this;\r\n return clearCache(this);\r\n }\r\n return Namespace.prototype.add.call(this, object);\r\n};\r\n\r\n/**\r\n * @override\r\n */\r\nService.prototype.remove = function remove(object) {\r\n if (object instanceof Method) {\r\n\r\n /* istanbul ignore if */\r\n if (this.methods[object.name] !== object)\r\n throw Error(object + \" is not a member of \" + this);\r\n\r\n delete this.methods[object.name];\r\n object.parent = null;\r\n return clearCache(this);\r\n }\r\n return Namespace.prototype.remove.call(this, object);\r\n};\r\n\r\n/**\r\n * Creates a runtime service using the specified rpc implementation.\r\n * @param {RPCImpl} rpcImpl RPC implementation\r\n * @param {boolean} [requestDelimited=false] Whether requests are length-delimited\r\n * @param {boolean} [responseDelimited=false] Whether responses are length-delimited\r\n * @returns {rpc.Service} RPC service. Useful where requests and/or responses are streamed.\r\n */\r\nService.prototype.create = function create(rpcImpl, requestDelimited, responseDelimited) {\r\n var rpcService = new rpc.Service(rpcImpl, requestDelimited, responseDelimited);\r\n for (var i = 0, method; i < /* initializes */ this.methodsArray.length; ++i) {\r\n var methodName = util.lcFirst((method = this._methodsArray[i]).resolve().name).replace(/[^$\\w_]/g, \"\");\r\n rpcService[methodName] = util.codegen([\"r\",\"c\"], util.isReserved(methodName) ? methodName + \"_\" : methodName)(\"return this.rpcCall(m,q,s,r,c)\")({\r\n m: method,\r\n q: method.resolvedRequestType.ctor,\r\n s: method.resolvedResponseType.ctor\r\n });\r\n }\r\n return rpcService;\r\n};\r\n","\"use strict\";\r\nmodule.exports = tokenize;\r\n\r\nvar delimRe = /[\\s{}=;:[\\],'\"()<>]/g,\r\n stringDoubleRe = /(?:\"([^\"\\\\]*(?:\\\\.[^\"\\\\]*)*)\")/g,\r\n stringSingleRe = /(?:'([^'\\\\]*(?:\\\\.[^'\\\\]*)*)')/g;\r\n\r\nvar setCommentRe = /^ *[*/]+ */,\r\n setCommentAltRe = /^\\s*\\*?\\/*/,\r\n setCommentSplitRe = /\\n/g,\r\n whitespaceRe = /\\s/,\r\n unescapeRe = /\\\\(.?)/g;\r\n\r\nvar unescapeMap = {\r\n \"0\": \"\\0\",\r\n \"r\": \"\\r\",\r\n \"n\": \"\\n\",\r\n \"t\": \"\\t\"\r\n};\r\n\r\n/**\r\n * Unescapes a string.\r\n * @param {string} str String to unescape\r\n * @returns {string} Unescaped string\r\n * @property {Object.} map Special characters map\r\n * @memberof tokenize\r\n */\r\nfunction unescape(str) {\r\n return str.replace(unescapeRe, function($0, $1) {\r\n switch ($1) {\r\n case \"\\\\\":\r\n case \"\":\r\n return $1;\r\n default:\r\n return unescapeMap[$1] || \"\";\r\n }\r\n });\r\n}\r\n\r\ntokenize.unescape = unescape;\r\n\r\n/**\r\n * Gets the next token and advances.\r\n * @typedef TokenizerHandleNext\r\n * @type {function}\r\n * @returns {string|null} Next token or `null` on eof\r\n */\r\n\r\n/**\r\n * Peeks for the next token.\r\n * @typedef TokenizerHandlePeek\r\n * @type {function}\r\n * @returns {string|null} Next token or `null` on eof\r\n */\r\n\r\n/**\r\n * Pushes a token back to the stack.\r\n * @typedef TokenizerHandlePush\r\n * @type {function}\r\n * @param {string} token Token\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Skips the next token.\r\n * @typedef TokenizerHandleSkip\r\n * @type {function}\r\n * @param {string} expected Expected token\r\n * @param {boolean} [optional=false] If optional\r\n * @returns {boolean} Whether the token matched\r\n * @throws {Error} If the token didn't match and is not optional\r\n */\r\n\r\n/**\r\n * Gets the comment on the previous line or, alternatively, the line comment on the specified line.\r\n * @typedef TokenizerHandleCmnt\r\n * @type {function}\r\n * @param {number} [line] Line number\r\n * @returns {string|null} Comment text or `null` if none\r\n */\r\n\r\n/**\r\n * Handle object returned from {@link tokenize}.\r\n * @interface ITokenizerHandle\r\n * @property {TokenizerHandleNext} next Gets the next token and advances (`null` on eof)\r\n * @property {TokenizerHandlePeek} peek Peeks for the next token (`null` on eof)\r\n * @property {TokenizerHandlePush} push Pushes a token back to the stack\r\n * @property {TokenizerHandleSkip} skip Skips a token, returns its presence and advances or, if non-optional and not present, throws\r\n * @property {TokenizerHandleCmnt} cmnt Gets the comment on the previous line or the line comment on the specified line, if any\r\n * @property {number} line Current line number\r\n */\r\n\r\n/**\r\n * Tokenizes the given .proto source and returns an object with useful utility functions.\r\n * @param {string} source Source contents\r\n * @param {boolean} alternateCommentMode Whether we should activate alternate comment parsing mode.\r\n * @returns {ITokenizerHandle} Tokenizer handle\r\n */\r\nfunction tokenize(source, alternateCommentMode) {\r\n /* eslint-disable callback-return */\r\n source = source.toString();\r\n\r\n var offset = 0,\r\n length = source.length,\r\n line = 1,\r\n lastCommentLine = 0,\r\n comments = {};\r\n\r\n var stack = [];\r\n\r\n var stringDelim = null;\r\n\r\n /* istanbul ignore next */\r\n /**\r\n * Creates an error for illegal syntax.\r\n * @param {string} subject Subject\r\n * @returns {Error} Error created\r\n * @inner\r\n */\r\n function illegal(subject) {\r\n return Error(\"illegal \" + subject + \" (line \" + line + \")\");\r\n }\r\n\r\n /**\r\n * Reads a string till its end.\r\n * @returns {string} String read\r\n * @inner\r\n */\r\n function readString() {\r\n var re = stringDelim === \"'\" ? stringSingleRe : stringDoubleRe;\r\n re.lastIndex = offset - 1;\r\n var match = re.exec(source);\r\n if (!match)\r\n throw illegal(\"string\");\r\n offset = re.lastIndex;\r\n push(stringDelim);\r\n stringDelim = null;\r\n return unescape(match[1]);\r\n }\r\n\r\n /**\r\n * Gets the character at `pos` within the source.\r\n * @param {number} pos Position\r\n * @returns {string} Character\r\n * @inner\r\n */\r\n function charAt(pos) {\r\n return source.charAt(pos);\r\n }\r\n\r\n /**\r\n * Sets the current comment text.\r\n * @param {number} start Start offset\r\n * @param {number} end End offset\r\n * @param {boolean} isLeading set if a leading comment\r\n * @returns {undefined}\r\n * @inner\r\n */\r\n function setComment(start, end, isLeading) {\r\n var comment = {\r\n type: source.charAt(start++),\r\n lineEmpty: false,\r\n leading: isLeading,\r\n };\r\n var lookback;\r\n if (alternateCommentMode) {\r\n lookback = 2; // alternate comment parsing: \"//\" or \"/*\"\r\n } else {\r\n lookback = 3; // \"///\" or \"/**\"\r\n }\r\n var commentOffset = start - lookback,\r\n c;\r\n do {\r\n if (--commentOffset < 0 ||\r\n (c = source.charAt(commentOffset)) === \"\\n\") {\r\n comment.lineEmpty = true;\r\n break;\r\n }\r\n } while (c === \" \" || c === \"\\t\");\r\n var lines = source\r\n .substring(start, end)\r\n .split(setCommentSplitRe);\r\n for (var i = 0; i < lines.length; ++i)\r\n lines[i] = lines[i]\r\n .replace(alternateCommentMode ? setCommentAltRe : setCommentRe, \"\")\r\n .trim();\r\n comment.text = lines\r\n .join(\"\\n\")\r\n .trim();\r\n\r\n comments[line] = comment;\r\n lastCommentLine = line;\r\n }\r\n\r\n function isDoubleSlashCommentLine(startOffset) {\r\n var endOffset = findEndOfLine(startOffset);\r\n\r\n // see if remaining line matches comment pattern\r\n var lineText = source.substring(startOffset, endOffset);\r\n var isComment = /^\\s*\\/\\//.test(lineText);\r\n return isComment;\r\n }\r\n\r\n function findEndOfLine(cursor) {\r\n // find end of cursor's line\r\n var endOffset = cursor;\r\n while (endOffset < length && charAt(endOffset) !== \"\\n\") {\r\n endOffset++;\r\n }\r\n return endOffset;\r\n }\r\n\r\n /**\r\n * Obtains the next token.\r\n * @returns {string|null} Next token or `null` on eof\r\n * @inner\r\n */\r\n function next() {\r\n if (stack.length > 0)\r\n return stack.shift();\r\n if (stringDelim)\r\n return readString();\r\n var repeat,\r\n prev,\r\n curr,\r\n start,\r\n isDoc,\r\n isLeadingComment = offset === 0;\r\n do {\r\n if (offset === length)\r\n return null;\r\n repeat = false;\r\n while (whitespaceRe.test(curr = charAt(offset))) {\r\n if (curr === \"\\n\") {\r\n isLeadingComment = true;\r\n ++line;\r\n }\r\n if (++offset === length)\r\n return null;\r\n }\r\n\r\n if (charAt(offset) === \"/\") {\r\n if (++offset === length) {\r\n throw illegal(\"comment\");\r\n }\r\n if (charAt(offset) === \"/\") { // Line\r\n if (!alternateCommentMode) {\r\n // check for triple-slash comment\r\n isDoc = charAt(start = offset + 1) === \"/\";\r\n\r\n while (charAt(++offset) !== \"\\n\") {\r\n if (offset === length) {\r\n return null;\r\n }\r\n }\r\n ++offset;\r\n if (isDoc) {\r\n setComment(start, offset - 1, isLeadingComment);\r\n // Trailing comment cannot not be multi-line,\r\n // so leading comment state should be reset to handle potential next comments\r\n isLeadingComment = true;\r\n }\r\n ++line;\r\n repeat = true;\r\n } else {\r\n // check for double-slash comments, consolidating consecutive lines\r\n start = offset;\r\n isDoc = false;\r\n if (isDoubleSlashCommentLine(offset - 1)) {\r\n isDoc = true;\r\n do {\r\n offset = findEndOfLine(offset);\r\n if (offset === length) {\r\n break;\r\n }\r\n offset++;\r\n if (!isLeadingComment) {\r\n // Trailing comment cannot not be multi-line\r\n break;\r\n }\r\n } while (isDoubleSlashCommentLine(offset));\r\n } else {\r\n offset = Math.min(length, findEndOfLine(offset) + 1);\r\n }\r\n if (isDoc) {\r\n setComment(start, offset, isLeadingComment);\r\n isLeadingComment = true;\r\n }\r\n line++;\r\n repeat = true;\r\n }\r\n } else if ((curr = charAt(offset)) === \"*\") { /* Block */\r\n // check for /** (regular comment mode) or /* (alternate comment mode)\r\n start = offset + 1;\r\n isDoc = alternateCommentMode || charAt(start) === \"*\";\r\n do {\r\n if (curr === \"\\n\") {\r\n ++line;\r\n }\r\n if (++offset === length) {\r\n throw illegal(\"comment\");\r\n }\r\n prev = curr;\r\n curr = charAt(offset);\r\n } while (prev !== \"*\" || curr !== \"/\");\r\n ++offset;\r\n if (isDoc) {\r\n setComment(start, offset - 2, isLeadingComment);\r\n isLeadingComment = true;\r\n }\r\n repeat = true;\r\n } else {\r\n return \"/\";\r\n }\r\n }\r\n } while (repeat);\r\n\r\n // offset !== length if we got here\r\n\r\n var end = offset;\r\n delimRe.lastIndex = 0;\r\n var delim = delimRe.test(charAt(end++));\r\n if (!delim)\r\n while (end < length && !delimRe.test(charAt(end)))\r\n ++end;\r\n var token = source.substring(offset, offset = end);\r\n if (token === \"\\\"\" || token === \"'\")\r\n stringDelim = token;\r\n return token;\r\n }\r\n\r\n /**\r\n * Pushes a token back to the stack.\r\n * @param {string} token Token\r\n * @returns {undefined}\r\n * @inner\r\n */\r\n function push(token) {\r\n stack.push(token);\r\n }\r\n\r\n /**\r\n * Peeks for the next token.\r\n * @returns {string|null} Token or `null` on eof\r\n * @inner\r\n */\r\n function peek() {\r\n if (!stack.length) {\r\n var token = next();\r\n if (token === null)\r\n return null;\r\n push(token);\r\n }\r\n return stack[0];\r\n }\r\n\r\n /**\r\n * Skips a token.\r\n * @param {string} expected Expected token\r\n * @param {boolean} [optional=false] Whether the token is optional\r\n * @returns {boolean} `true` when skipped, `false` if not\r\n * @throws {Error} When a required token is not present\r\n * @inner\r\n */\r\n function skip(expected, optional) {\r\n var actual = peek(),\r\n equals = actual === expected;\r\n if (equals) {\r\n next();\r\n return true;\r\n }\r\n if (!optional)\r\n throw illegal(\"token '\" + actual + \"', '\" + expected + \"' expected\");\r\n return false;\r\n }\r\n\r\n /**\r\n * Gets a comment.\r\n * @param {number} [trailingLine] Line number if looking for a trailing comment\r\n * @returns {string|null} Comment text\r\n * @inner\r\n */\r\n function cmnt(trailingLine) {\r\n var ret = null;\r\n var comment;\r\n if (trailingLine === undefined) {\r\n comment = comments[line - 1];\r\n delete comments[line - 1];\r\n if (comment && (alternateCommentMode || comment.type === \"*\" || comment.lineEmpty)) {\r\n ret = comment.leading ? comment.text : null;\r\n }\r\n } else {\r\n /* istanbul ignore else */\r\n if (lastCommentLine < trailingLine) {\r\n peek();\r\n }\r\n comment = comments[trailingLine];\r\n delete comments[trailingLine];\r\n if (comment && !comment.lineEmpty && (alternateCommentMode || comment.type === \"/\")) {\r\n ret = comment.leading ? null : comment.text;\r\n }\r\n }\r\n return ret;\r\n }\r\n\r\n return Object.defineProperty({\r\n next: next,\r\n peek: peek,\r\n push: push,\r\n skip: skip,\r\n cmnt: cmnt\r\n }, \"line\", {\r\n get: function() { return line; }\r\n });\r\n /* eslint-enable callback-return */\r\n}\r\n","\"use strict\";\r\nmodule.exports = Type;\r\n\r\n// extends Namespace\r\nvar Namespace = require(\"./namespace\");\r\n((Type.prototype = Object.create(Namespace.prototype)).constructor = Type).className = \"Type\";\r\n\r\nvar Enum = require(\"./enum\"),\r\n OneOf = require(\"./oneof\"),\r\n Field = require(\"./field\"),\r\n MapField = require(\"./mapfield\"),\r\n Service = require(\"./service\"),\r\n Message = require(\"./message\"),\r\n Reader = require(\"./reader\"),\r\n Writer = require(\"./writer\"),\r\n util = require(\"./util\"),\r\n encoder = require(\"./encoder\"),\r\n decoder = require(\"./decoder\"),\r\n verifier = require(\"./verifier\"),\r\n converter = require(\"./converter\"),\r\n wrappers = require(\"./wrappers\");\r\n\r\n/**\r\n * Constructs a new reflected message type instance.\r\n * @classdesc Reflected message type.\r\n * @extends NamespaceBase\r\n * @constructor\r\n * @param {string} name Message name\r\n * @param {Object.} [options] Declared options\r\n */\r\nfunction Type(name, options) {\r\n Namespace.call(this, name, options);\r\n\r\n /**\r\n * Message fields.\r\n * @type {Object.}\r\n */\r\n this.fields = {}; // toJSON, marker\r\n\r\n /**\r\n * Oneofs declared within this namespace, if any.\r\n * @type {Object.}\r\n */\r\n this.oneofs = undefined; // toJSON\r\n\r\n /**\r\n * Extension ranges, if any.\r\n * @type {number[][]}\r\n */\r\n this.extensions = undefined; // toJSON\r\n\r\n /**\r\n * Reserved ranges, if any.\r\n * @type {Array.}\r\n */\r\n this.reserved = undefined; // toJSON\r\n\r\n /*?\r\n * Whether this type is a legacy group.\r\n * @type {boolean|undefined}\r\n */\r\n this.group = undefined; // toJSON\r\n\r\n /**\r\n * Cached fields by id.\r\n * @type {Object.|null}\r\n * @private\r\n */\r\n this._fieldsById = null;\r\n\r\n /**\r\n * Cached fields as an array.\r\n * @type {Field[]|null}\r\n * @private\r\n */\r\n this._fieldsArray = null;\r\n\r\n /**\r\n * Cached oneofs as an array.\r\n * @type {OneOf[]|null}\r\n * @private\r\n */\r\n this._oneofsArray = null;\r\n\r\n /**\r\n * Cached constructor.\r\n * @type {Constructor<{}>}\r\n * @private\r\n */\r\n this._ctor = null;\r\n}\r\n\r\nObject.defineProperties(Type.prototype, {\r\n\r\n /**\r\n * Message fields by id.\r\n * @name Type#fieldsById\r\n * @type {Object.}\r\n * @readonly\r\n */\r\n fieldsById: {\r\n get: function() {\r\n\r\n /* istanbul ignore if */\r\n if (this._fieldsById)\r\n return this._fieldsById;\r\n\r\n this._fieldsById = {};\r\n for (var names = Object.keys(this.fields), i = 0; i < names.length; ++i) {\r\n var field = this.fields[names[i]],\r\n id = field.id;\r\n\r\n /* istanbul ignore if */\r\n if (this._fieldsById[id])\r\n throw Error(\"duplicate id \" + id + \" in \" + this);\r\n\r\n this._fieldsById[id] = field;\r\n }\r\n return this._fieldsById;\r\n }\r\n },\r\n\r\n /**\r\n * Fields of this message as an array for iteration.\r\n * @name Type#fieldsArray\r\n * @type {Field[]}\r\n * @readonly\r\n */\r\n fieldsArray: {\r\n get: function() {\r\n return this._fieldsArray || (this._fieldsArray = util.toArray(this.fields));\r\n }\r\n },\r\n\r\n /**\r\n * Oneofs of this message as an array for iteration.\r\n * @name Type#oneofsArray\r\n * @type {OneOf[]}\r\n * @readonly\r\n */\r\n oneofsArray: {\r\n get: function() {\r\n return this._oneofsArray || (this._oneofsArray = util.toArray(this.oneofs));\r\n }\r\n },\r\n\r\n /**\r\n * The registered constructor, if any registered, otherwise a generic constructor.\r\n * Assigning a function replaces the internal constructor. If the function does not extend {@link Message} yet, its prototype will be setup accordingly and static methods will be populated. If it already extends {@link Message}, it will just replace the internal constructor.\r\n * @name Type#ctor\r\n * @type {Constructor<{}>}\r\n */\r\n ctor: {\r\n get: function() {\r\n return this._ctor || (this.ctor = Type.generateConstructor(this)());\r\n },\r\n set: function(ctor) {\r\n\r\n // Ensure proper prototype\r\n var prototype = ctor.prototype;\r\n if (!(prototype instanceof Message)) {\r\n (ctor.prototype = new Message()).constructor = ctor;\r\n util.merge(ctor.prototype, prototype);\r\n }\r\n\r\n // Classes and messages reference their reflected type\r\n ctor.$type = ctor.prototype.$type = this;\r\n\r\n // Mix in static methods\r\n util.merge(ctor, Message, true);\r\n\r\n this._ctor = ctor;\r\n\r\n // Messages have non-enumerable default values on their prototype\r\n var i = 0;\r\n for (; i < /* initializes */ this.fieldsArray.length; ++i)\r\n this._fieldsArray[i].resolve(); // ensures a proper value\r\n\r\n // Messages have non-enumerable getters and setters for each virtual oneof field\r\n var ctorProperties = {};\r\n for (i = 0; i < /* initializes */ this.oneofsArray.length; ++i)\r\n ctorProperties[this._oneofsArray[i].resolve().name] = {\r\n get: util.oneOfGetter(this._oneofsArray[i].oneof),\r\n set: util.oneOfSetter(this._oneofsArray[i].oneof)\r\n };\r\n if (i)\r\n Object.defineProperties(ctor.prototype, ctorProperties);\r\n }\r\n }\r\n});\r\n\r\n/**\r\n * Generates a constructor function for the specified type.\r\n * @param {Type} mtype Message type\r\n * @returns {Codegen} Codegen instance\r\n */\r\nType.generateConstructor = function generateConstructor(mtype) {\r\n /* eslint-disable no-unexpected-multiline */\r\n var gen = util.codegen([\"p\"], mtype.name);\r\n // explicitly initialize mutable object/array fields so that these aren't just inherited from the prototype\r\n for (var i = 0, field; i < mtype.fieldsArray.length; ++i)\r\n if ((field = mtype._fieldsArray[i]).map) gen\r\n (\"this%s={}\", util.safeProp(field.name));\r\n else if (field.repeated) gen\r\n (\"this%s=[]\", util.safeProp(field.name));\r\n return gen\r\n (\"if(p)for(var ks=Object.keys(p),i=0;i} [oneofs] Oneof descriptors\r\n * @property {Object.} fields Field descriptors\r\n * @property {number[][]} [extensions] Extension ranges\r\n * @property {Array.} [reserved] Reserved ranges\r\n * @property {boolean} [group=false] Whether a legacy group or not\r\n */\r\n\r\n/**\r\n * Creates a message type from a message type descriptor.\r\n * @param {string} name Message name\r\n * @param {IType} json Message type descriptor\r\n * @returns {Type} Created message type\r\n */\r\nType.fromJSON = function fromJSON(name, json) {\r\n var type = new Type(name, json.options);\r\n type.extensions = json.extensions;\r\n type.reserved = json.reserved;\r\n var names = Object.keys(json.fields),\r\n i = 0;\r\n for (; i < names.length; ++i)\r\n type.add(\r\n ( typeof json.fields[names[i]].keyType !== \"undefined\"\r\n ? MapField.fromJSON\r\n : Field.fromJSON )(names[i], json.fields[names[i]])\r\n );\r\n if (json.oneofs)\r\n for (names = Object.keys(json.oneofs), i = 0; i < names.length; ++i)\r\n type.add(OneOf.fromJSON(names[i], json.oneofs[names[i]]));\r\n if (json.nested)\r\n for (names = Object.keys(json.nested), i = 0; i < names.length; ++i) {\r\n var nested = json.nested[names[i]];\r\n type.add( // most to least likely\r\n ( nested.id !== undefined\r\n ? Field.fromJSON\r\n : nested.fields !== undefined\r\n ? Type.fromJSON\r\n : nested.values !== undefined\r\n ? Enum.fromJSON\r\n : nested.methods !== undefined\r\n ? Service.fromJSON\r\n : Namespace.fromJSON )(names[i], nested)\r\n );\r\n }\r\n if (json.extensions && json.extensions.length)\r\n type.extensions = json.extensions;\r\n if (json.reserved && json.reserved.length)\r\n type.reserved = json.reserved;\r\n if (json.group)\r\n type.group = true;\r\n if (json.comment)\r\n type.comment = json.comment;\r\n return type;\r\n};\r\n\r\n/**\r\n * Converts this message type to a message type descriptor.\r\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\r\n * @returns {IType} Message type descriptor\r\n */\r\nType.prototype.toJSON = function toJSON(toJSONOptions) {\r\n var inherited = Namespace.prototype.toJSON.call(this, toJSONOptions);\r\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\r\n return util.toObject([\r\n \"options\" , inherited && inherited.options || undefined,\r\n \"oneofs\" , Namespace.arrayToJSON(this.oneofsArray, toJSONOptions),\r\n \"fields\" , Namespace.arrayToJSON(this.fieldsArray.filter(function(obj) { return !obj.declaringField; }), toJSONOptions) || {},\r\n \"extensions\" , this.extensions && this.extensions.length ? this.extensions : undefined,\r\n \"reserved\" , this.reserved && this.reserved.length ? this.reserved : undefined,\r\n \"group\" , this.group || undefined,\r\n \"nested\" , inherited && inherited.nested || undefined,\r\n \"comment\" , keepComments ? this.comment : undefined\r\n ]);\r\n};\r\n\r\n/**\r\n * @override\r\n */\r\nType.prototype.resolveAll = function resolveAll() {\r\n var fields = this.fieldsArray, i = 0;\r\n while (i < fields.length)\r\n fields[i++].resolve();\r\n var oneofs = this.oneofsArray; i = 0;\r\n while (i < oneofs.length)\r\n oneofs[i++].resolve();\r\n return Namespace.prototype.resolveAll.call(this);\r\n};\r\n\r\n/**\r\n * @override\r\n */\r\nType.prototype.get = function get(name) {\r\n return this.fields[name]\r\n || this.oneofs && this.oneofs[name]\r\n || this.nested && this.nested[name]\r\n || null;\r\n};\r\n\r\n/**\r\n * Adds a nested object to this type.\r\n * @param {ReflectionObject} object Nested object to add\r\n * @returns {Type} `this`\r\n * @throws {TypeError} If arguments are invalid\r\n * @throws {Error} If there is already a nested object with this name or, if a field, when there is already a field with this id\r\n */\r\nType.prototype.add = function add(object) {\r\n\r\n if (this.get(object.name))\r\n throw Error(\"duplicate name '\" + object.name + \"' in \" + this);\r\n\r\n if (object instanceof Field && object.extend === undefined) {\r\n // NOTE: Extension fields aren't actual fields on the declaring type, but nested objects.\r\n // The root object takes care of adding distinct sister-fields to the respective extended\r\n // type instead.\r\n\r\n // avoids calling the getter if not absolutely necessary because it's called quite frequently\r\n if (this._fieldsById ? /* istanbul ignore next */ this._fieldsById[object.id] : this.fieldsById[object.id])\r\n throw Error(\"duplicate id \" + object.id + \" in \" + this);\r\n if (this.isReservedId(object.id))\r\n throw Error(\"id \" + object.id + \" is reserved in \" + this);\r\n if (this.isReservedName(object.name))\r\n throw Error(\"name '\" + object.name + \"' is reserved in \" + this);\r\n\r\n if (object.parent)\r\n object.parent.remove(object);\r\n this.fields[object.name] = object;\r\n object.message = this;\r\n object.onAdd(this);\r\n return clearCache(this);\r\n }\r\n if (object instanceof OneOf) {\r\n if (!this.oneofs)\r\n this.oneofs = {};\r\n this.oneofs[object.name] = object;\r\n object.onAdd(this);\r\n return clearCache(this);\r\n }\r\n return Namespace.prototype.add.call(this, object);\r\n};\r\n\r\n/**\r\n * Removes a nested object from this type.\r\n * @param {ReflectionObject} object Nested object to remove\r\n * @returns {Type} `this`\r\n * @throws {TypeError} If arguments are invalid\r\n * @throws {Error} If `object` is not a member of this type\r\n */\r\nType.prototype.remove = function remove(object) {\r\n if (object instanceof Field && object.extend === undefined) {\r\n // See Type#add for the reason why extension fields are excluded here.\r\n\r\n /* istanbul ignore if */\r\n if (!this.fields || this.fields[object.name] !== object)\r\n throw Error(object + \" is not a member of \" + this);\r\n\r\n delete this.fields[object.name];\r\n object.parent = null;\r\n object.onRemove(this);\r\n return clearCache(this);\r\n }\r\n if (object instanceof OneOf) {\r\n\r\n /* istanbul ignore if */\r\n if (!this.oneofs || this.oneofs[object.name] !== object)\r\n throw Error(object + \" is not a member of \" + this);\r\n\r\n delete this.oneofs[object.name];\r\n object.parent = null;\r\n object.onRemove(this);\r\n return clearCache(this);\r\n }\r\n return Namespace.prototype.remove.call(this, object);\r\n};\r\n\r\n/**\r\n * Tests if the specified id is reserved.\r\n * @param {number} id Id to test\r\n * @returns {boolean} `true` if reserved, otherwise `false`\r\n */\r\nType.prototype.isReservedId = function isReservedId(id) {\r\n return Namespace.isReservedId(this.reserved, id);\r\n};\r\n\r\n/**\r\n * Tests if the specified name is reserved.\r\n * @param {string} name Name to test\r\n * @returns {boolean} `true` if reserved, otherwise `false`\r\n */\r\nType.prototype.isReservedName = function isReservedName(name) {\r\n return Namespace.isReservedName(this.reserved, name);\r\n};\r\n\r\n/**\r\n * Creates a new message of this type using the specified properties.\r\n * @param {Object.} [properties] Properties to set\r\n * @returns {Message<{}>} Message instance\r\n */\r\nType.prototype.create = function create(properties) {\r\n return new this.ctor(properties);\r\n};\r\n\r\n/**\r\n * Sets up {@link Type#encode|encode}, {@link Type#decode|decode} and {@link Type#verify|verify}.\r\n * @returns {Type} `this`\r\n */\r\nType.prototype.setup = function setup() {\r\n // Sets up everything at once so that the prototype chain does not have to be re-evaluated\r\n // multiple times (V8, soft-deopt prototype-check).\r\n\r\n var fullName = this.fullName,\r\n types = [];\r\n for (var i = 0; i < /* initializes */ this.fieldsArray.length; ++i)\r\n types.push(this._fieldsArray[i].resolve().resolvedType);\r\n\r\n // Replace setup methods with type-specific generated functions\r\n this.encode = encoder(this)({\r\n Writer : Writer,\r\n types : types,\r\n util : util\r\n });\r\n this.decode = decoder(this)({\r\n Reader : Reader,\r\n types : types,\r\n util : util\r\n });\r\n this.verify = verifier(this)({\r\n types : types,\r\n util : util\r\n });\r\n this.fromObject = converter.fromObject(this)({\r\n types : types,\r\n util : util\r\n });\r\n this.toObject = converter.toObject(this)({\r\n types : types,\r\n util : util\r\n });\r\n\r\n // Inject custom wrappers for common types\r\n var wrapper = wrappers[fullName];\r\n if (wrapper) {\r\n var originalThis = Object.create(this);\r\n // if (wrapper.fromObject) {\r\n originalThis.fromObject = this.fromObject;\r\n this.fromObject = wrapper.fromObject.bind(originalThis);\r\n // }\r\n // if (wrapper.toObject) {\r\n originalThis.toObject = this.toObject;\r\n this.toObject = wrapper.toObject.bind(originalThis);\r\n // }\r\n }\r\n\r\n return this;\r\n};\r\n\r\n/**\r\n * Encodes a message of this type. Does not implicitly {@link Type#verify|verify} messages.\r\n * @param {Message<{}>|Object.} message Message instance or plain object\r\n * @param {Writer} [writer] Writer to encode to\r\n * @returns {Writer} writer\r\n */\r\nType.prototype.encode = function encode_setup(message, writer) {\r\n return this.setup().encode(message, writer); // overrides this method\r\n};\r\n\r\n/**\r\n * Encodes a message of this type preceeded by its byte length as a varint. Does not implicitly {@link Type#verify|verify} messages.\r\n * @param {Message<{}>|Object.} message Message instance or plain object\r\n * @param {Writer} [writer] Writer to encode to\r\n * @returns {Writer} writer\r\n */\r\nType.prototype.encodeDelimited = function encodeDelimited(message, writer) {\r\n return this.encode(message, writer && writer.len ? writer.fork() : writer).ldelim();\r\n};\r\n\r\n/**\r\n * Decodes a message of this type.\r\n * @param {Reader|Uint8Array} reader Reader or buffer to decode from\r\n * @param {number} [length] Length of the message, if known beforehand\r\n * @returns {Message<{}>} Decoded message\r\n * @throws {Error} If the payload is not a reader or valid buffer\r\n * @throws {util.ProtocolError<{}>} If required fields are missing\r\n */\r\nType.prototype.decode = function decode_setup(reader, length) {\r\n return this.setup().decode(reader, length); // overrides this method\r\n};\r\n\r\n/**\r\n * Decodes a message of this type preceeded by its byte length as a varint.\r\n * @param {Reader|Uint8Array} reader Reader or buffer to decode from\r\n * @returns {Message<{}>} Decoded message\r\n * @throws {Error} If the payload is not a reader or valid buffer\r\n * @throws {util.ProtocolError} If required fields are missing\r\n */\r\nType.prototype.decodeDelimited = function decodeDelimited(reader) {\r\n if (!(reader instanceof Reader))\r\n reader = Reader.create(reader);\r\n return this.decode(reader, reader.uint32());\r\n};\r\n\r\n/**\r\n * Verifies that field values are valid and that required fields are present.\r\n * @param {Object.} message Plain object to verify\r\n * @returns {null|string} `null` if valid, otherwise the reason why it is not\r\n */\r\nType.prototype.verify = function verify_setup(message) {\r\n return this.setup().verify(message); // overrides this method\r\n};\r\n\r\n/**\r\n * Creates a new message of this type from a plain object. Also converts values to their respective internal types.\r\n * @param {Object.} object Plain object to convert\r\n * @returns {Message<{}>} Message instance\r\n */\r\nType.prototype.fromObject = function fromObject(object) {\r\n return this.setup().fromObject(object);\r\n};\r\n\r\n/**\r\n * Conversion options as used by {@link Type#toObject} and {@link Message.toObject}.\r\n * @interface IConversionOptions\r\n * @property {Function} [longs] Long conversion type.\r\n * Valid values are `String` and `Number` (the global types).\r\n * Defaults to copy the present value, which is a possibly unsafe number without and a {@link Long} with a long library.\r\n * @property {Function} [enums] Enum value conversion type.\r\n * Only valid value is `String` (the global type).\r\n * Defaults to copy the present value, which is the numeric id.\r\n * @property {Function} [bytes] Bytes value conversion type.\r\n * Valid values are `Array` and (a base64 encoded) `String` (the global types).\r\n * Defaults to copy the present value, which usually is a Buffer under node and an Uint8Array in the browser.\r\n * @property {boolean} [defaults=false] Also sets default values on the resulting object\r\n * @property {boolean} [arrays=false] Sets empty arrays for missing repeated fields even if `defaults=false`\r\n * @property {boolean} [objects=false] Sets empty objects for missing map fields even if `defaults=false`\r\n * @property {boolean} [oneofs=false] Includes virtual oneof properties set to the present field's name, if any\r\n * @property {boolean} [json=false] Performs additional JSON compatibility conversions, i.e. NaN and Infinity to strings\r\n */\r\n\r\n/**\r\n * Creates a plain object from a message of this type. Also converts values to other types if specified.\r\n * @param {Message<{}>} message Message instance\r\n * @param {IConversionOptions} [options] Conversion options\r\n * @returns {Object.} Plain object\r\n */\r\nType.prototype.toObject = function toObject(message, options) {\r\n return this.setup().toObject(message, options);\r\n};\r\n\r\n/**\r\n * Decorator function as returned by {@link Type.d} (TypeScript).\r\n * @typedef TypeDecorator\r\n * @type {function}\r\n * @param {Constructor} target Target constructor\r\n * @returns {undefined}\r\n * @template T extends Message\r\n */\r\n\r\n/**\r\n * Type decorator (TypeScript).\r\n * @param {string} [typeName] Type name, defaults to the constructor's name\r\n * @returns {TypeDecorator} Decorator function\r\n * @template T extends Message\r\n */\r\nType.d = function decorateType(typeName) {\r\n return function typeDecorator(target) {\r\n util.decorateType(target, typeName);\r\n };\r\n};\r\n","\"use strict\";\r\n\r\n/**\r\n * Common type constants.\r\n * @namespace\r\n */\r\nvar types = exports;\r\n\r\nvar util = require(\"./util\");\r\n\r\nvar s = [\r\n \"double\", // 0\r\n \"float\", // 1\r\n \"int32\", // 2\r\n \"uint32\", // 3\r\n \"sint32\", // 4\r\n \"fixed32\", // 5\r\n \"sfixed32\", // 6\r\n \"int64\", // 7\r\n \"uint64\", // 8\r\n \"sint64\", // 9\r\n \"fixed64\", // 10\r\n \"sfixed64\", // 11\r\n \"bool\", // 12\r\n \"string\", // 13\r\n \"bytes\" // 14\r\n];\r\n\r\nfunction bake(values, offset) {\r\n var i = 0, o = {};\r\n offset |= 0;\r\n while (i < values.length) o[s[i + offset]] = values[i++];\r\n return o;\r\n}\r\n\r\n/**\r\n * Basic type wire types.\r\n * @type {Object.}\r\n * @const\r\n * @property {number} double=1 Fixed64 wire type\r\n * @property {number} float=5 Fixed32 wire type\r\n * @property {number} int32=0 Varint wire type\r\n * @property {number} uint32=0 Varint wire type\r\n * @property {number} sint32=0 Varint wire type\r\n * @property {number} fixed32=5 Fixed32 wire type\r\n * @property {number} sfixed32=5 Fixed32 wire type\r\n * @property {number} int64=0 Varint wire type\r\n * @property {number} uint64=0 Varint wire type\r\n * @property {number} sint64=0 Varint wire type\r\n * @property {number} fixed64=1 Fixed64 wire type\r\n * @property {number} sfixed64=1 Fixed64 wire type\r\n * @property {number} bool=0 Varint wire type\r\n * @property {number} string=2 Ldelim wire type\r\n * @property {number} bytes=2 Ldelim wire type\r\n */\r\ntypes.basic = bake([\r\n /* double */ 1,\r\n /* float */ 5,\r\n /* int32 */ 0,\r\n /* uint32 */ 0,\r\n /* sint32 */ 0,\r\n /* fixed32 */ 5,\r\n /* sfixed32 */ 5,\r\n /* int64 */ 0,\r\n /* uint64 */ 0,\r\n /* sint64 */ 0,\r\n /* fixed64 */ 1,\r\n /* sfixed64 */ 1,\r\n /* bool */ 0,\r\n /* string */ 2,\r\n /* bytes */ 2\r\n]);\r\n\r\n/**\r\n * Basic type defaults.\r\n * @type {Object.}\r\n * @const\r\n * @property {number} double=0 Double default\r\n * @property {number} float=0 Float default\r\n * @property {number} int32=0 Int32 default\r\n * @property {number} uint32=0 Uint32 default\r\n * @property {number} sint32=0 Sint32 default\r\n * @property {number} fixed32=0 Fixed32 default\r\n * @property {number} sfixed32=0 Sfixed32 default\r\n * @property {number} int64=0 Int64 default\r\n * @property {number} uint64=0 Uint64 default\r\n * @property {number} sint64=0 Sint32 default\r\n * @property {number} fixed64=0 Fixed64 default\r\n * @property {number} sfixed64=0 Sfixed64 default\r\n * @property {boolean} bool=false Bool default\r\n * @property {string} string=\"\" String default\r\n * @property {Array.} bytes=Array(0) Bytes default\r\n * @property {null} message=null Message default\r\n */\r\ntypes.defaults = bake([\r\n /* double */ 0,\r\n /* float */ 0,\r\n /* int32 */ 0,\r\n /* uint32 */ 0,\r\n /* sint32 */ 0,\r\n /* fixed32 */ 0,\r\n /* sfixed32 */ 0,\r\n /* int64 */ 0,\r\n /* uint64 */ 0,\r\n /* sint64 */ 0,\r\n /* fixed64 */ 0,\r\n /* sfixed64 */ 0,\r\n /* bool */ false,\r\n /* string */ \"\",\r\n /* bytes */ util.emptyArray,\r\n /* message */ null\r\n]);\r\n\r\n/**\r\n * Basic long type wire types.\r\n * @type {Object.}\r\n * @const\r\n * @property {number} int64=0 Varint wire type\r\n * @property {number} uint64=0 Varint wire type\r\n * @property {number} sint64=0 Varint wire type\r\n * @property {number} fixed64=1 Fixed64 wire type\r\n * @property {number} sfixed64=1 Fixed64 wire type\r\n */\r\ntypes.long = bake([\r\n /* int64 */ 0,\r\n /* uint64 */ 0,\r\n /* sint64 */ 0,\r\n /* fixed64 */ 1,\r\n /* sfixed64 */ 1\r\n], 7);\r\n\r\n/**\r\n * Allowed types for map keys with their associated wire type.\r\n * @type {Object.}\r\n * @const\r\n * @property {number} int32=0 Varint wire type\r\n * @property {number} uint32=0 Varint wire type\r\n * @property {number} sint32=0 Varint wire type\r\n * @property {number} fixed32=5 Fixed32 wire type\r\n * @property {number} sfixed32=5 Fixed32 wire type\r\n * @property {number} int64=0 Varint wire type\r\n * @property {number} uint64=0 Varint wire type\r\n * @property {number} sint64=0 Varint wire type\r\n * @property {number} fixed64=1 Fixed64 wire type\r\n * @property {number} sfixed64=1 Fixed64 wire type\r\n * @property {number} bool=0 Varint wire type\r\n * @property {number} string=2 Ldelim wire type\r\n */\r\ntypes.mapKey = bake([\r\n /* int32 */ 0,\r\n /* uint32 */ 0,\r\n /* sint32 */ 0,\r\n /* fixed32 */ 5,\r\n /* sfixed32 */ 5,\r\n /* int64 */ 0,\r\n /* uint64 */ 0,\r\n /* sint64 */ 0,\r\n /* fixed64 */ 1,\r\n /* sfixed64 */ 1,\r\n /* bool */ 0,\r\n /* string */ 2\r\n], 2);\r\n\r\n/**\r\n * Allowed types for packed repeated fields with their associated wire type.\r\n * @type {Object.}\r\n * @const\r\n * @property {number} double=1 Fixed64 wire type\r\n * @property {number} float=5 Fixed32 wire type\r\n * @property {number} int32=0 Varint wire type\r\n * @property {number} uint32=0 Varint wire type\r\n * @property {number} sint32=0 Varint wire type\r\n * @property {number} fixed32=5 Fixed32 wire type\r\n * @property {number} sfixed32=5 Fixed32 wire type\r\n * @property {number} int64=0 Varint wire type\r\n * @property {number} uint64=0 Varint wire type\r\n * @property {number} sint64=0 Varint wire type\r\n * @property {number} fixed64=1 Fixed64 wire type\r\n * @property {number} sfixed64=1 Fixed64 wire type\r\n * @property {number} bool=0 Varint wire type\r\n */\r\ntypes.packed = bake([\r\n /* double */ 1,\r\n /* float */ 5,\r\n /* int32 */ 0,\r\n /* uint32 */ 0,\r\n /* sint32 */ 0,\r\n /* fixed32 */ 5,\r\n /* sfixed32 */ 5,\r\n /* int64 */ 0,\r\n /* uint64 */ 0,\r\n /* sint64 */ 0,\r\n /* fixed64 */ 1,\r\n /* sfixed64 */ 1,\r\n /* bool */ 0\r\n]);\r\n","\"use strict\";\r\n\r\n/**\r\n * Various utility functions.\r\n * @namespace\r\n */\r\nvar util = module.exports = require(\"./util/minimal\");\r\n\r\nvar roots = require(\"./roots\");\r\n\r\nvar Type, // cyclic\r\n Enum;\r\n\r\nutil.codegen = require(\"@protobufjs/codegen\");\r\nutil.fetch = require(\"@protobufjs/fetch\");\r\nutil.path = require(\"@protobufjs/path\");\r\n\r\n/**\r\n * Node's fs module if available.\r\n * @type {Object.}\r\n */\r\nutil.fs = util.inquire(\"fs\");\r\n\r\n/**\r\n * Converts an object's values to an array.\r\n * @param {Object.} object Object to convert\r\n * @returns {Array.<*>} Converted array\r\n */\r\nutil.toArray = function toArray(object) {\r\n if (object) {\r\n var keys = Object.keys(object),\r\n array = new Array(keys.length),\r\n index = 0;\r\n while (index < keys.length)\r\n array[index] = object[keys[index++]];\r\n return array;\r\n }\r\n return [];\r\n};\r\n\r\n/**\r\n * Converts an array of keys immediately followed by their respective value to an object, omitting undefined values.\r\n * @param {Array.<*>} array Array to convert\r\n * @returns {Object.} Converted object\r\n */\r\nutil.toObject = function toObject(array) {\r\n var object = {},\r\n index = 0;\r\n while (index < array.length) {\r\n var key = array[index++],\r\n val = array[index++];\r\n if (val !== undefined)\r\n object[key] = val;\r\n }\r\n return object;\r\n};\r\n\r\nvar safePropBackslashRe = /\\\\/g,\r\n safePropQuoteRe = /\"/g;\r\n\r\n/**\r\n * Tests whether the specified name is a reserved word in JS.\r\n * @param {string} name Name to test\r\n * @returns {boolean} `true` if reserved, otherwise `false`\r\n */\r\nutil.isReserved = function isReserved(name) {\r\n return /^(?:do|if|in|for|let|new|try|var|case|else|enum|eval|false|null|this|true|void|with|break|catch|class|const|super|throw|while|yield|delete|export|import|public|return|static|switch|typeof|default|extends|finally|package|private|continue|debugger|function|arguments|interface|protected|implements|instanceof)$/.test(name);\r\n};\r\n\r\n/**\r\n * Returns a safe property accessor for the specified property name.\r\n * @param {string} prop Property name\r\n * @returns {string} Safe accessor\r\n */\r\nutil.safeProp = function safeProp(prop) {\r\n if (!/^[$\\w_]+$/.test(prop) || util.isReserved(prop))\r\n return \"[\\\"\" + prop.replace(safePropBackslashRe, \"\\\\\\\\\").replace(safePropQuoteRe, \"\\\\\\\"\") + \"\\\"]\";\r\n return \".\" + prop;\r\n};\r\n\r\n/**\r\n * Converts the first character of a string to upper case.\r\n * @param {string} str String to convert\r\n * @returns {string} Converted string\r\n */\r\nutil.ucFirst = function ucFirst(str) {\r\n return str.charAt(0).toUpperCase() + str.substring(1);\r\n};\r\n\r\nvar camelCaseRe = /_([a-z])/g;\r\n\r\n/**\r\n * Converts a string to camel case.\r\n * @param {string} str String to convert\r\n * @returns {string} Converted string\r\n */\r\nutil.camelCase = function camelCase(str) {\r\n return str.substring(0, 1)\r\n + str.substring(1)\r\n .replace(camelCaseRe, function($0, $1) { return $1.toUpperCase(); });\r\n};\r\n\r\n/**\r\n * Compares reflected fields by id.\r\n * @param {Field} a First field\r\n * @param {Field} b Second field\r\n * @returns {number} Comparison value\r\n */\r\nutil.compareFieldsById = function compareFieldsById(a, b) {\r\n return a.id - b.id;\r\n};\r\n\r\n/**\r\n * Decorator helper for types (TypeScript).\r\n * @param {Constructor} ctor Constructor function\r\n * @param {string} [typeName] Type name, defaults to the constructor's name\r\n * @returns {Type} Reflected type\r\n * @template T extends Message\r\n * @property {Root} root Decorators root\r\n */\r\nutil.decorateType = function decorateType(ctor, typeName) {\r\n\r\n /* istanbul ignore if */\r\n if (ctor.$type) {\r\n if (typeName && ctor.$type.name !== typeName) {\r\n util.decorateRoot.remove(ctor.$type);\r\n ctor.$type.name = typeName;\r\n util.decorateRoot.add(ctor.$type);\r\n }\r\n return ctor.$type;\r\n }\r\n\r\n /* istanbul ignore next */\r\n if (!Type)\r\n Type = require(\"./type\");\r\n\r\n var type = new Type(typeName || ctor.name);\r\n util.decorateRoot.add(type);\r\n type.ctor = ctor; // sets up .encode, .decode etc.\r\n Object.defineProperty(ctor, \"$type\", { value: type, enumerable: false });\r\n Object.defineProperty(ctor.prototype, \"$type\", { value: type, enumerable: false });\r\n return type;\r\n};\r\n\r\nvar decorateEnumIndex = 0;\r\n\r\n/**\r\n * Decorator helper for enums (TypeScript).\r\n * @param {Object} object Enum object\r\n * @returns {Enum} Reflected enum\r\n */\r\nutil.decorateEnum = function decorateEnum(object) {\r\n\r\n /* istanbul ignore if */\r\n if (object.$type)\r\n return object.$type;\r\n\r\n /* istanbul ignore next */\r\n if (!Enum)\r\n Enum = require(\"./enum\");\r\n\r\n var enm = new Enum(\"Enum\" + decorateEnumIndex++, object);\r\n util.decorateRoot.add(enm);\r\n Object.defineProperty(object, \"$type\", { value: enm, enumerable: false });\r\n return enm;\r\n};\r\n\r\n\r\n/**\r\n * Sets the value of a property by property path. If a value already exists, it is turned to an array\r\n * @param {Object.} dst Destination object\r\n * @param {string} path dot '.' delimited path of the property to set\r\n * @param {Object} value the value to set\r\n * @returns {Object.} Destination object\r\n */\r\nutil.setProperty = function setProperty(dst, path, value) {\r\n function setProp(dst, path, value) {\r\n var part = path.shift();\r\n if (part === \"__proto__\" || part === \"prototype\") {\r\n return dst;\r\n }\r\n if (path.length > 0) {\r\n dst[part] = setProp(dst[part] || {}, path, value);\r\n } else {\r\n var prevValue = dst[part];\r\n if (prevValue)\r\n value = [].concat(prevValue).concat(value);\r\n dst[part] = value;\r\n }\r\n return dst;\r\n }\r\n\r\n if (typeof dst !== \"object\")\r\n throw TypeError(\"dst must be an object\");\r\n if (!path)\r\n throw TypeError(\"path must be specified\");\r\n\r\n path = path.split(\".\");\r\n return setProp(dst, path, value);\r\n};\r\n\r\n/**\r\n * Decorator root (TypeScript).\r\n * @name util.decorateRoot\r\n * @type {Root}\r\n * @readonly\r\n */\r\nObject.defineProperty(util, \"decorateRoot\", {\r\n get: function() {\r\n return roots[\"decorated\"] || (roots[\"decorated\"] = new (require(\"./root\"))());\r\n }\r\n});\r\n","\"use strict\";\r\nmodule.exports = LongBits;\r\n\r\nvar util = require(\"../util/minimal\");\r\n\r\n/**\r\n * Constructs new long bits.\r\n * @classdesc Helper class for working with the low and high bits of a 64 bit value.\r\n * @memberof util\r\n * @constructor\r\n * @param {number} lo Low 32 bits, unsigned\r\n * @param {number} hi High 32 bits, unsigned\r\n */\r\nfunction LongBits(lo, hi) {\r\n\r\n // note that the casts below are theoretically unnecessary as of today, but older statically\r\n // generated converter code might still call the ctor with signed 32bits. kept for compat.\r\n\r\n /**\r\n * Low bits.\r\n * @type {number}\r\n */\r\n this.lo = lo >>> 0;\r\n\r\n /**\r\n * High bits.\r\n * @type {number}\r\n */\r\n this.hi = hi >>> 0;\r\n}\r\n\r\n/**\r\n * Zero bits.\r\n * @memberof util.LongBits\r\n * @type {util.LongBits}\r\n */\r\nvar zero = LongBits.zero = new LongBits(0, 0);\r\n\r\nzero.toNumber = function() { return 0; };\r\nzero.zzEncode = zero.zzDecode = function() { return this; };\r\nzero.length = function() { return 1; };\r\n\r\n/**\r\n * Zero hash.\r\n * @memberof util.LongBits\r\n * @type {string}\r\n */\r\nvar zeroHash = LongBits.zeroHash = \"\\0\\0\\0\\0\\0\\0\\0\\0\";\r\n\r\n/**\r\n * Constructs new long bits from the specified number.\r\n * @param {number} value Value\r\n * @returns {util.LongBits} Instance\r\n */\r\nLongBits.fromNumber = function fromNumber(value) {\r\n if (value === 0)\r\n return zero;\r\n var sign = value < 0;\r\n if (sign)\r\n value = -value;\r\n var lo = value >>> 0,\r\n hi = (value - lo) / 4294967296 >>> 0;\r\n if (sign) {\r\n hi = ~hi >>> 0;\r\n lo = ~lo >>> 0;\r\n if (++lo > 4294967295) {\r\n lo = 0;\r\n if (++hi > 4294967295)\r\n hi = 0;\r\n }\r\n }\r\n return new LongBits(lo, hi);\r\n};\r\n\r\n/**\r\n * Constructs new long bits from a number, long or string.\r\n * @param {Long|number|string} value Value\r\n * @returns {util.LongBits} Instance\r\n */\r\nLongBits.from = function from(value) {\r\n if (typeof value === \"number\")\r\n return LongBits.fromNumber(value);\r\n if (util.isString(value)) {\r\n /* istanbul ignore else */\r\n if (util.Long)\r\n value = util.Long.fromString(value);\r\n else\r\n return LongBits.fromNumber(parseInt(value, 10));\r\n }\r\n return value.low || value.high ? new LongBits(value.low >>> 0, value.high >>> 0) : zero;\r\n};\r\n\r\n/**\r\n * Converts this long bits to a possibly unsafe JavaScript number.\r\n * @param {boolean} [unsigned=false] Whether unsigned or not\r\n * @returns {number} Possibly unsafe number\r\n */\r\nLongBits.prototype.toNumber = function toNumber(unsigned) {\r\n if (!unsigned && this.hi >>> 31) {\r\n var lo = ~this.lo + 1 >>> 0,\r\n hi = ~this.hi >>> 0;\r\n if (!lo)\r\n hi = hi + 1 >>> 0;\r\n return -(lo + hi * 4294967296);\r\n }\r\n return this.lo + this.hi * 4294967296;\r\n};\r\n\r\n/**\r\n * Converts this long bits to a long.\r\n * @param {boolean} [unsigned=false] Whether unsigned or not\r\n * @returns {Long} Long\r\n */\r\nLongBits.prototype.toLong = function toLong(unsigned) {\r\n return util.Long\r\n ? new util.Long(this.lo | 0, this.hi | 0, Boolean(unsigned))\r\n /* istanbul ignore next */\r\n : { low: this.lo | 0, high: this.hi | 0, unsigned: Boolean(unsigned) };\r\n};\r\n\r\nvar charCodeAt = String.prototype.charCodeAt;\r\n\r\n/**\r\n * Constructs new long bits from the specified 8 characters long hash.\r\n * @param {string} hash Hash\r\n * @returns {util.LongBits} Bits\r\n */\r\nLongBits.fromHash = function fromHash(hash) {\r\n if (hash === zeroHash)\r\n return zero;\r\n return new LongBits(\r\n ( charCodeAt.call(hash, 0)\r\n | charCodeAt.call(hash, 1) << 8\r\n | charCodeAt.call(hash, 2) << 16\r\n | charCodeAt.call(hash, 3) << 24) >>> 0\r\n ,\r\n ( charCodeAt.call(hash, 4)\r\n | charCodeAt.call(hash, 5) << 8\r\n | charCodeAt.call(hash, 6) << 16\r\n | charCodeAt.call(hash, 7) << 24) >>> 0\r\n );\r\n};\r\n\r\n/**\r\n * Converts this long bits to a 8 characters long hash.\r\n * @returns {string} Hash\r\n */\r\nLongBits.prototype.toHash = function toHash() {\r\n return String.fromCharCode(\r\n this.lo & 255,\r\n this.lo >>> 8 & 255,\r\n this.lo >>> 16 & 255,\r\n this.lo >>> 24 ,\r\n this.hi & 255,\r\n this.hi >>> 8 & 255,\r\n this.hi >>> 16 & 255,\r\n this.hi >>> 24\r\n );\r\n};\r\n\r\n/**\r\n * Zig-zag encodes this long bits.\r\n * @returns {util.LongBits} `this`\r\n */\r\nLongBits.prototype.zzEncode = function zzEncode() {\r\n var mask = this.hi >> 31;\r\n this.hi = ((this.hi << 1 | this.lo >>> 31) ^ mask) >>> 0;\r\n this.lo = ( this.lo << 1 ^ mask) >>> 0;\r\n return this;\r\n};\r\n\r\n/**\r\n * Zig-zag decodes this long bits.\r\n * @returns {util.LongBits} `this`\r\n */\r\nLongBits.prototype.zzDecode = function zzDecode() {\r\n var mask = -(this.lo & 1);\r\n this.lo = ((this.lo >>> 1 | this.hi << 31) ^ mask) >>> 0;\r\n this.hi = ( this.hi >>> 1 ^ mask) >>> 0;\r\n return this;\r\n};\r\n\r\n/**\r\n * Calculates the length of this longbits when encoded as a varint.\r\n * @returns {number} Length\r\n */\r\nLongBits.prototype.length = function length() {\r\n var part0 = this.lo,\r\n part1 = (this.lo >>> 28 | this.hi << 4) >>> 0,\r\n part2 = this.hi >>> 24;\r\n return part2 === 0\r\n ? part1 === 0\r\n ? part0 < 16384\r\n ? part0 < 128 ? 1 : 2\r\n : part0 < 2097152 ? 3 : 4\r\n : part1 < 16384\r\n ? part1 < 128 ? 5 : 6\r\n : part1 < 2097152 ? 7 : 8\r\n : part2 < 128 ? 9 : 10;\r\n};\r\n","\"use strict\";\r\nvar util = exports;\r\n\r\n// used to return a Promise where callback is omitted\r\nutil.asPromise = require(\"@protobufjs/aspromise\");\r\n\r\n// converts to / from base64 encoded strings\r\nutil.base64 = require(\"@protobufjs/base64\");\r\n\r\n// base class of rpc.Service\r\nutil.EventEmitter = require(\"@protobufjs/eventemitter\");\r\n\r\n// float handling accross browsers\r\nutil.float = require(\"@protobufjs/float\");\r\n\r\n// requires modules optionally and hides the call from bundlers\r\nutil.inquire = require(\"@protobufjs/inquire\");\r\n\r\n// converts to / from utf8 encoded strings\r\nutil.utf8 = require(\"@protobufjs/utf8\");\r\n\r\n// provides a node-like buffer pool in the browser\r\nutil.pool = require(\"@protobufjs/pool\");\r\n\r\n// utility to work with the low and high bits of a 64 bit value\r\nutil.LongBits = require(\"./longbits\");\r\n\r\n/**\r\n * Whether running within node or not.\r\n * @memberof util\r\n * @type {boolean}\r\n */\r\nutil.isNode = Boolean(typeof global !== \"undefined\"\r\n && global\r\n && global.process\r\n && global.process.versions\r\n && global.process.versions.node);\r\n\r\n/**\r\n * Global object reference.\r\n * @memberof util\r\n * @type {Object}\r\n */\r\nutil.global = util.isNode && global\r\n || typeof window !== \"undefined\" && window\r\n || typeof self !== \"undefined\" && self\r\n || this; // eslint-disable-line no-invalid-this\r\n\r\n/**\r\n * An immuable empty array.\r\n * @memberof util\r\n * @type {Array.<*>}\r\n * @const\r\n */\r\nutil.emptyArray = Object.freeze ? Object.freeze([]) : /* istanbul ignore next */ []; // used on prototypes\r\n\r\n/**\r\n * An immutable empty object.\r\n * @type {Object}\r\n * @const\r\n */\r\nutil.emptyObject = Object.freeze ? Object.freeze({}) : /* istanbul ignore next */ {}; // used on prototypes\r\n\r\n/**\r\n * Tests if the specified value is an integer.\r\n * @function\r\n * @param {*} value Value to test\r\n * @returns {boolean} `true` if the value is an integer\r\n */\r\nutil.isInteger = Number.isInteger || /* istanbul ignore next */ function isInteger(value) {\r\n return typeof value === \"number\" && isFinite(value) && Math.floor(value) === value;\r\n};\r\n\r\n/**\r\n * Tests if the specified value is a string.\r\n * @param {*} value Value to test\r\n * @returns {boolean} `true` if the value is a string\r\n */\r\nutil.isString = function isString(value) {\r\n return typeof value === \"string\" || value instanceof String;\r\n};\r\n\r\n/**\r\n * Tests if the specified value is a non-null object.\r\n * @param {*} value Value to test\r\n * @returns {boolean} `true` if the value is a non-null object\r\n */\r\nutil.isObject = function isObject(value) {\r\n return value && typeof value === \"object\";\r\n};\r\n\r\n/**\r\n * Checks if a property on a message is considered to be present.\r\n * This is an alias of {@link util.isSet}.\r\n * @function\r\n * @param {Object} obj Plain object or message instance\r\n * @param {string} prop Property name\r\n * @returns {boolean} `true` if considered to be present, otherwise `false`\r\n */\r\nutil.isset =\r\n\r\n/**\r\n * Checks if a property on a message is considered to be present.\r\n * @param {Object} obj Plain object or message instance\r\n * @param {string} prop Property name\r\n * @returns {boolean} `true` if considered to be present, otherwise `false`\r\n */\r\nutil.isSet = function isSet(obj, prop) {\r\n var value = obj[prop];\r\n if (value != null && obj.hasOwnProperty(prop)) // eslint-disable-line eqeqeq, no-prototype-builtins\r\n return typeof value !== \"object\" || (Array.isArray(value) ? value.length : Object.keys(value).length) > 0;\r\n return false;\r\n};\r\n\r\n/**\r\n * Any compatible Buffer instance.\r\n * This is a minimal stand-alone definition of a Buffer instance. The actual type is that exported by node's typings.\r\n * @interface Buffer\r\n * @extends Uint8Array\r\n */\r\n\r\n/**\r\n * Node's Buffer class if available.\r\n * @type {Constructor}\r\n */\r\nutil.Buffer = (function() {\r\n try {\r\n var Buffer = util.inquire(\"buffer\").Buffer;\r\n // refuse to use non-node buffers if not explicitly assigned (perf reasons):\r\n return Buffer.prototype.utf8Write ? Buffer : /* istanbul ignore next */ null;\r\n } catch (e) {\r\n /* istanbul ignore next */\r\n return null;\r\n }\r\n})();\r\n\r\n// Internal alias of or polyfull for Buffer.from.\r\nutil._Buffer_from = null;\r\n\r\n// Internal alias of or polyfill for Buffer.allocUnsafe.\r\nutil._Buffer_allocUnsafe = null;\r\n\r\n/**\r\n * Creates a new buffer of whatever type supported by the environment.\r\n * @param {number|number[]} [sizeOrArray=0] Buffer size or number array\r\n * @returns {Uint8Array|Buffer} Buffer\r\n */\r\nutil.newBuffer = function newBuffer(sizeOrArray) {\r\n /* istanbul ignore next */\r\n return typeof sizeOrArray === \"number\"\r\n ? util.Buffer\r\n ? util._Buffer_allocUnsafe(sizeOrArray)\r\n : new util.Array(sizeOrArray)\r\n : util.Buffer\r\n ? util._Buffer_from(sizeOrArray)\r\n : typeof Uint8Array === \"undefined\"\r\n ? sizeOrArray\r\n : new Uint8Array(sizeOrArray);\r\n};\r\n\r\n/**\r\n * Array implementation used in the browser. `Uint8Array` if supported, otherwise `Array`.\r\n * @type {Constructor}\r\n */\r\nutil.Array = typeof Uint8Array !== \"undefined\" ? Uint8Array /* istanbul ignore next */ : Array;\r\n\r\n/**\r\n * Any compatible Long instance.\r\n * This is a minimal stand-alone definition of a Long instance. The actual type is that exported by long.js.\r\n * @interface Long\r\n * @property {number} low Low bits\r\n * @property {number} high High bits\r\n * @property {boolean} unsigned Whether unsigned or not\r\n */\r\n\r\n/**\r\n * Long.js's Long class if available.\r\n * @type {Constructor}\r\n */\r\nutil.Long = /* istanbul ignore next */ util.global.dcodeIO && /* istanbul ignore next */ util.global.dcodeIO.Long\r\n || /* istanbul ignore next */ util.global.Long\r\n || util.inquire(\"long\");\r\n\r\n/**\r\n * Regular expression used to verify 2 bit (`bool`) map keys.\r\n * @type {RegExp}\r\n * @const\r\n */\r\nutil.key2Re = /^true|false|0|1$/;\r\n\r\n/**\r\n * Regular expression used to verify 32 bit (`int32` etc.) map keys.\r\n * @type {RegExp}\r\n * @const\r\n */\r\nutil.key32Re = /^-?(?:0|[1-9][0-9]*)$/;\r\n\r\n/**\r\n * Regular expression used to verify 64 bit (`int64` etc.) map keys.\r\n * @type {RegExp}\r\n * @const\r\n */\r\nutil.key64Re = /^(?:[\\\\x00-\\\\xff]{8}|-?(?:0|[1-9][0-9]*))$/;\r\n\r\n/**\r\n * Converts a number or long to an 8 characters long hash string.\r\n * @param {Long|number} value Value to convert\r\n * @returns {string} Hash\r\n */\r\nutil.longToHash = function longToHash(value) {\r\n return value\r\n ? util.LongBits.from(value).toHash()\r\n : util.LongBits.zeroHash;\r\n};\r\n\r\n/**\r\n * Converts an 8 characters long hash string to a long or number.\r\n * @param {string} hash Hash\r\n * @param {boolean} [unsigned=false] Whether unsigned or not\r\n * @returns {Long|number} Original value\r\n */\r\nutil.longFromHash = function longFromHash(hash, unsigned) {\r\n var bits = util.LongBits.fromHash(hash);\r\n if (util.Long)\r\n return util.Long.fromBits(bits.lo, bits.hi, unsigned);\r\n return bits.toNumber(Boolean(unsigned));\r\n};\r\n\r\n/**\r\n * Merges the properties of the source object into the destination object.\r\n * @memberof util\r\n * @param {Object.} dst Destination object\r\n * @param {Object.} src Source object\r\n * @param {boolean} [ifNotSet=false] Merges only if the key is not already set\r\n * @returns {Object.} Destination object\r\n */\r\nfunction merge(dst, src, ifNotSet) { // used by converters\r\n for (var keys = Object.keys(src), i = 0; i < keys.length; ++i)\r\n if (dst[keys[i]] === undefined || !ifNotSet)\r\n dst[keys[i]] = src[keys[i]];\r\n return dst;\r\n}\r\n\r\nutil.merge = merge;\r\n\r\n/**\r\n * Converts the first character of a string to lower case.\r\n * @param {string} str String to convert\r\n * @returns {string} Converted string\r\n */\r\nutil.lcFirst = function lcFirst(str) {\r\n return str.charAt(0).toLowerCase() + str.substring(1);\r\n};\r\n\r\n/**\r\n * Creates a custom error constructor.\r\n * @memberof util\r\n * @param {string} name Error name\r\n * @returns {Constructor} Custom error constructor\r\n */\r\nfunction newError(name) {\r\n\r\n function CustomError(message, properties) {\r\n\r\n if (!(this instanceof CustomError))\r\n return new CustomError(message, properties);\r\n\r\n // Error.call(this, message);\r\n // ^ just returns a new error instance because the ctor can be called as a function\r\n\r\n Object.defineProperty(this, \"message\", { get: function() { return message; } });\r\n\r\n /* istanbul ignore next */\r\n if (Error.captureStackTrace) // node\r\n Error.captureStackTrace(this, CustomError);\r\n else\r\n Object.defineProperty(this, \"stack\", { value: new Error().stack || \"\" });\r\n\r\n if (properties)\r\n merge(this, properties);\r\n }\r\n\r\n CustomError.prototype = Object.create(Error.prototype, {\r\n constructor: {\r\n value: CustomError,\r\n writable: true,\r\n enumerable: false,\r\n configurable: true,\r\n },\r\n name: {\r\n get: function get() { return name; },\r\n set: undefined,\r\n enumerable: false,\r\n // configurable: false would accurately preserve the behavior of\r\n // the original, but I'm guessing that was not intentional.\r\n // For an actual error subclass, this property would\r\n // be configurable.\r\n configurable: true,\r\n },\r\n toString: {\r\n value: function value() { return this.name + \": \" + this.message; },\r\n writable: true,\r\n enumerable: false,\r\n configurable: true,\r\n },\r\n });\r\n\r\n return CustomError;\r\n}\r\n\r\nutil.newError = newError;\r\n\r\n/**\r\n * Constructs a new protocol error.\r\n * @classdesc Error subclass indicating a protocol specifc error.\r\n * @memberof util\r\n * @extends Error\r\n * @template T extends Message\r\n * @constructor\r\n * @param {string} message Error message\r\n * @param {Object.} [properties] Additional properties\r\n * @example\r\n * try {\r\n * MyMessage.decode(someBuffer); // throws if required fields are missing\r\n * } catch (e) {\r\n * if (e instanceof ProtocolError && e.instance)\r\n * console.log(\"decoded so far: \" + JSON.stringify(e.instance));\r\n * }\r\n */\r\nutil.ProtocolError = newError(\"ProtocolError\");\r\n\r\n/**\r\n * So far decoded message instance.\r\n * @name util.ProtocolError#instance\r\n * @type {Message}\r\n */\r\n\r\n/**\r\n * A OneOf getter as returned by {@link util.oneOfGetter}.\r\n * @typedef OneOfGetter\r\n * @type {function}\r\n * @returns {string|undefined} Set field name, if any\r\n */\r\n\r\n/**\r\n * Builds a getter for a oneof's present field name.\r\n * @param {string[]} fieldNames Field names\r\n * @returns {OneOfGetter} Unbound getter\r\n */\r\nutil.oneOfGetter = function getOneOf(fieldNames) {\r\n var fieldMap = {};\r\n for (var i = 0; i < fieldNames.length; ++i)\r\n fieldMap[fieldNames[i]] = 1;\r\n\r\n /**\r\n * @returns {string|undefined} Set field name, if any\r\n * @this Object\r\n * @ignore\r\n */\r\n return function() { // eslint-disable-line consistent-return\r\n for (var keys = Object.keys(this), i = keys.length - 1; i > -1; --i)\r\n if (fieldMap[keys[i]] === 1 && this[keys[i]] !== undefined && this[keys[i]] !== null)\r\n return keys[i];\r\n };\r\n};\r\n\r\n/**\r\n * A OneOf setter as returned by {@link util.oneOfSetter}.\r\n * @typedef OneOfSetter\r\n * @type {function}\r\n * @param {string|undefined} value Field name\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Builds a setter for a oneof's present field name.\r\n * @param {string[]} fieldNames Field names\r\n * @returns {OneOfSetter} Unbound setter\r\n */\r\nutil.oneOfSetter = function setOneOf(fieldNames) {\r\n\r\n /**\r\n * @param {string} name Field name\r\n * @returns {undefined}\r\n * @this Object\r\n * @ignore\r\n */\r\n return function(name) {\r\n for (var i = 0; i < fieldNames.length; ++i)\r\n if (fieldNames[i] !== name)\r\n delete this[fieldNames[i]];\r\n };\r\n};\r\n\r\n/**\r\n * Default conversion options used for {@link Message#toJSON} implementations.\r\n *\r\n * These options are close to proto3's JSON mapping with the exception that internal types like Any are handled just like messages. More precisely:\r\n *\r\n * - Longs become strings\r\n * - Enums become string keys\r\n * - Bytes become base64 encoded strings\r\n * - (Sub-)Messages become plain objects\r\n * - Maps become plain objects with all string keys\r\n * - Repeated fields become arrays\r\n * - NaN and Infinity for float and double fields become strings\r\n *\r\n * @type {IConversionOptions}\r\n * @see https://developers.google.com/protocol-buffers/docs/proto3?hl=en#json\r\n */\r\nutil.toJSONOptions = {\r\n longs: String,\r\n enums: String,\r\n bytes: String,\r\n json: true\r\n};\r\n\r\n// Sets up buffer utility according to the environment (called in index-minimal)\r\nutil._configure = function() {\r\n var Buffer = util.Buffer;\r\n /* istanbul ignore if */\r\n if (!Buffer) {\r\n util._Buffer_from = util._Buffer_allocUnsafe = null;\r\n return;\r\n }\r\n // because node 4.x buffers are incompatible & immutable\r\n // see: https://github.com/dcodeIO/protobuf.js/pull/665\r\n util._Buffer_from = Buffer.from !== Uint8Array.from && Buffer.from ||\r\n /* istanbul ignore next */\r\n function Buffer_from(value, encoding) {\r\n return new Buffer(value, encoding);\r\n };\r\n util._Buffer_allocUnsafe = Buffer.allocUnsafe ||\r\n /* istanbul ignore next */\r\n function Buffer_allocUnsafe(size) {\r\n return new Buffer(size);\r\n };\r\n};\r\n","\"use strict\";\r\nmodule.exports = verifier;\r\n\r\nvar Enum = require(\"./enum\"),\r\n util = require(\"./util\");\r\n\r\nfunction invalid(field, expected) {\r\n return field.name + \": \" + expected + (field.repeated && expected !== \"array\" ? \"[]\" : field.map && expected !== \"object\" ? \"{k:\"+field.keyType+\"}\" : \"\") + \" expected\";\r\n}\r\n\r\n/**\r\n * Generates a partial value verifier.\r\n * @param {Codegen} gen Codegen instance\r\n * @param {Field} field Reflected field\r\n * @param {number} fieldIndex Field index\r\n * @param {string} ref Variable reference\r\n * @returns {Codegen} Codegen instance\r\n * @ignore\r\n */\r\nfunction genVerifyValue(gen, field, fieldIndex, ref) {\r\n /* eslint-disable no-unexpected-multiline */\r\n if (field.resolvedType) {\r\n if (field.resolvedType instanceof Enum) { gen\r\n (\"switch(%s){\", ref)\r\n (\"default:\")\r\n (\"return%j\", invalid(field, \"enum value\"));\r\n for (var keys = Object.keys(field.resolvedType.values), j = 0; j < keys.length; ++j) gen\r\n (\"case %i:\", field.resolvedType.values[keys[j]]);\r\n gen\r\n (\"break\")\r\n (\"}\");\r\n } else {\r\n gen\r\n (\"{\")\r\n (\"var e=types[%i].verify(%s);\", fieldIndex, ref)\r\n (\"if(e)\")\r\n (\"return%j+e\", field.name + \".\")\r\n (\"}\");\r\n }\r\n } else {\r\n switch (field.type) {\r\n case \"int32\":\r\n case \"uint32\":\r\n case \"sint32\":\r\n case \"fixed32\":\r\n case \"sfixed32\": gen\r\n (\"if(!util.isInteger(%s))\", ref)\r\n (\"return%j\", invalid(field, \"integer\"));\r\n break;\r\n case \"int64\":\r\n case \"uint64\":\r\n case \"sint64\":\r\n case \"fixed64\":\r\n case \"sfixed64\": gen\r\n (\"if(!util.isInteger(%s)&&!(%s&&util.isInteger(%s.low)&&util.isInteger(%s.high)))\", ref, ref, ref, ref)\r\n (\"return%j\", invalid(field, \"integer|Long\"));\r\n break;\r\n case \"float\":\r\n case \"double\": gen\r\n (\"if(typeof %s!==\\\"number\\\")\", ref)\r\n (\"return%j\", invalid(field, \"number\"));\r\n break;\r\n case \"bool\": gen\r\n (\"if(typeof %s!==\\\"boolean\\\")\", ref)\r\n (\"return%j\", invalid(field, \"boolean\"));\r\n break;\r\n case \"string\": gen\r\n (\"if(!util.isString(%s))\", ref)\r\n (\"return%j\", invalid(field, \"string\"));\r\n break;\r\n case \"bytes\": gen\r\n (\"if(!(%s&&typeof %s.length===\\\"number\\\"||util.isString(%s)))\", ref, ref, ref)\r\n (\"return%j\", invalid(field, \"buffer\"));\r\n break;\r\n }\r\n }\r\n return gen;\r\n /* eslint-enable no-unexpected-multiline */\r\n}\r\n\r\n/**\r\n * Generates a partial key verifier.\r\n * @param {Codegen} gen Codegen instance\r\n * @param {Field} field Reflected field\r\n * @param {string} ref Variable reference\r\n * @returns {Codegen} Codegen instance\r\n * @ignore\r\n */\r\nfunction genVerifyKey(gen, field, ref) {\r\n /* eslint-disable no-unexpected-multiline */\r\n switch (field.keyType) {\r\n case \"int32\":\r\n case \"uint32\":\r\n case \"sint32\":\r\n case \"fixed32\":\r\n case \"sfixed32\": gen\r\n (\"if(!util.key32Re.test(%s))\", ref)\r\n (\"return%j\", invalid(field, \"integer key\"));\r\n break;\r\n case \"int64\":\r\n case \"uint64\":\r\n case \"sint64\":\r\n case \"fixed64\":\r\n case \"sfixed64\": gen\r\n (\"if(!util.key64Re.test(%s))\", ref) // see comment above: x is ok, d is not\r\n (\"return%j\", invalid(field, \"integer|Long key\"));\r\n break;\r\n case \"bool\": gen\r\n (\"if(!util.key2Re.test(%s))\", ref)\r\n (\"return%j\", invalid(field, \"boolean key\"));\r\n break;\r\n }\r\n return gen;\r\n /* eslint-enable no-unexpected-multiline */\r\n}\r\n\r\n/**\r\n * Generates a verifier specific to the specified message type.\r\n * @param {Type} mtype Message type\r\n * @returns {Codegen} Codegen instance\r\n */\r\nfunction verifier(mtype) {\r\n /* eslint-disable no-unexpected-multiline */\r\n\r\n var gen = util.codegen([\"m\"], mtype.name + \"$verify\")\r\n (\"if(typeof m!==\\\"object\\\"||m===null)\")\r\n (\"return%j\", \"object expected\");\r\n var oneofs = mtype.oneofsArray,\r\n seenFirstField = {};\r\n if (oneofs.length) gen\r\n (\"var p={}\");\r\n\r\n for (var i = 0; i < /* initializes */ mtype.fieldsArray.length; ++i) {\r\n var field = mtype._fieldsArray[i].resolve(),\r\n ref = \"m\" + util.safeProp(field.name);\r\n\r\n if (field.optional) gen\r\n (\"if(%s!=null&&m.hasOwnProperty(%j)){\", ref, field.name); // !== undefined && !== null\r\n\r\n // map fields\r\n if (field.map) { gen\r\n (\"if(!util.isObject(%s))\", ref)\r\n (\"return%j\", invalid(field, \"object\"))\r\n (\"var k=Object.keys(%s)\", ref)\r\n (\"for(var i=0;i}\r\n * @const\r\n */\r\nvar wrappers = exports;\r\n\r\nvar Message = require(\"./message\");\r\n\r\n/**\r\n * From object converter part of an {@link IWrapper}.\r\n * @typedef WrapperFromObjectConverter\r\n * @type {function}\r\n * @param {Object.} object Plain object\r\n * @returns {Message<{}>} Message instance\r\n * @this Type\r\n */\r\n\r\n/**\r\n * To object converter part of an {@link IWrapper}.\r\n * @typedef WrapperToObjectConverter\r\n * @type {function}\r\n * @param {Message<{}>} message Message instance\r\n * @param {IConversionOptions} [options] Conversion options\r\n * @returns {Object.} Plain object\r\n * @this Type\r\n */\r\n\r\n/**\r\n * Common type wrapper part of {@link wrappers}.\r\n * @interface IWrapper\r\n * @property {WrapperFromObjectConverter} [fromObject] From object converter\r\n * @property {WrapperToObjectConverter} [toObject] To object converter\r\n */\r\n\r\n// Custom wrapper for Any\r\nwrappers[\".google.protobuf.Any\"] = {\r\n\r\n fromObject: function(object) {\r\n\r\n // unwrap value type if mapped\r\n if (object && object[\"@type\"]) {\r\n // Only use fully qualified type name after the last '/'\r\n var name = object[\"@type\"].substring(object[\"@type\"].lastIndexOf(\"/\") + 1);\r\n var type = this.lookup(name);\r\n /* istanbul ignore else */\r\n if (type) {\r\n // type_url does not accept leading \".\"\r\n var type_url = object[\"@type\"].charAt(0) === \".\" ?\r\n object[\"@type\"].slice(1) : object[\"@type\"];\r\n // type_url prefix is optional, but path seperator is required\r\n if (type_url.indexOf(\"/\") === -1) {\r\n type_url = \"/\" + type_url;\r\n }\r\n return this.create({\r\n type_url: type_url,\r\n value: type.encode(type.fromObject(object)).finish()\r\n });\r\n }\r\n }\r\n\r\n return this.fromObject(object);\r\n },\r\n\r\n toObject: function(message, options) {\r\n\r\n // Default prefix\r\n var googleApi = \"type.googleapis.com/\";\r\n var prefix = \"\";\r\n var name = \"\";\r\n\r\n // decode value if requested and unmapped\r\n if (options && options.json && message.type_url && message.value) {\r\n // Only use fully qualified type name after the last '/'\r\n name = message.type_url.substring(message.type_url.lastIndexOf(\"/\") + 1);\r\n // Separate the prefix used\r\n prefix = message.type_url.substring(0, message.type_url.lastIndexOf(\"/\") + 1);\r\n var type = this.lookup(name);\r\n /* istanbul ignore else */\r\n if (type)\r\n message = type.decode(message.value);\r\n }\r\n\r\n // wrap value if unmapped\r\n if (!(message instanceof this.ctor) && message instanceof Message) {\r\n var object = message.$type.toObject(message, options);\r\n var messageName = message.$type.fullName[0] === \".\" ?\r\n message.$type.fullName.slice(1) : message.$type.fullName;\r\n // Default to type.googleapis.com prefix if no prefix is used\r\n if (prefix === \"\") {\r\n prefix = googleApi;\r\n }\r\n name = prefix + messageName;\r\n object[\"@type\"] = name;\r\n return object;\r\n }\r\n\r\n return this.toObject(message, options);\r\n }\r\n};\r\n","\"use strict\";\r\nmodule.exports = Writer;\r\n\r\nvar util = require(\"./util/minimal\");\r\n\r\nvar BufferWriter; // cyclic\r\n\r\nvar LongBits = util.LongBits,\r\n base64 = util.base64,\r\n utf8 = util.utf8;\r\n\r\n/**\r\n * Constructs a new writer operation instance.\r\n * @classdesc Scheduled writer operation.\r\n * @constructor\r\n * @param {function(*, Uint8Array, number)} fn Function to call\r\n * @param {number} len Value byte length\r\n * @param {*} val Value to write\r\n * @ignore\r\n */\r\nfunction Op(fn, len, val) {\r\n\r\n /**\r\n * Function to call.\r\n * @type {function(Uint8Array, number, *)}\r\n */\r\n this.fn = fn;\r\n\r\n /**\r\n * Value byte length.\r\n * @type {number}\r\n */\r\n this.len = len;\r\n\r\n /**\r\n * Next operation.\r\n * @type {Writer.Op|undefined}\r\n */\r\n this.next = undefined;\r\n\r\n /**\r\n * Value to write.\r\n * @type {*}\r\n */\r\n this.val = val; // type varies\r\n}\r\n\r\n/* istanbul ignore next */\r\nfunction noop() {} // eslint-disable-line no-empty-function\r\n\r\n/**\r\n * Constructs a new writer state instance.\r\n * @classdesc Copied writer state.\r\n * @memberof Writer\r\n * @constructor\r\n * @param {Writer} writer Writer to copy state from\r\n * @ignore\r\n */\r\nfunction State(writer) {\r\n\r\n /**\r\n * Current head.\r\n * @type {Writer.Op}\r\n */\r\n this.head = writer.head;\r\n\r\n /**\r\n * Current tail.\r\n * @type {Writer.Op}\r\n */\r\n this.tail = writer.tail;\r\n\r\n /**\r\n * Current buffer length.\r\n * @type {number}\r\n */\r\n this.len = writer.len;\r\n\r\n /**\r\n * Next state.\r\n * @type {State|null}\r\n */\r\n this.next = writer.states;\r\n}\r\n\r\n/**\r\n * Constructs a new writer instance.\r\n * @classdesc Wire format writer using `Uint8Array` if available, otherwise `Array`.\r\n * @constructor\r\n */\r\nfunction Writer() {\r\n\r\n /**\r\n * Current length.\r\n * @type {number}\r\n */\r\n this.len = 0;\r\n\r\n /**\r\n * Operations head.\r\n * @type {Object}\r\n */\r\n this.head = new Op(noop, 0, 0);\r\n\r\n /**\r\n * Operations tail\r\n * @type {Object}\r\n */\r\n this.tail = this.head;\r\n\r\n /**\r\n * Linked forked states.\r\n * @type {Object|null}\r\n */\r\n this.states = null;\r\n\r\n // When a value is written, the writer calculates its byte length and puts it into a linked\r\n // list of operations to perform when finish() is called. This both allows us to allocate\r\n // buffers of the exact required size and reduces the amount of work we have to do compared\r\n // to first calculating over objects and then encoding over objects. In our case, the encoding\r\n // part is just a linked list walk calling operations with already prepared values.\r\n}\r\n\r\nvar create = function create() {\r\n return util.Buffer\r\n ? function create_buffer_setup() {\r\n return (Writer.create = function create_buffer() {\r\n return new BufferWriter();\r\n })();\r\n }\r\n /* istanbul ignore next */\r\n : function create_array() {\r\n return new Writer();\r\n };\r\n};\r\n\r\n/**\r\n * Creates a new writer.\r\n * @function\r\n * @returns {BufferWriter|Writer} A {@link BufferWriter} when Buffers are supported, otherwise a {@link Writer}\r\n */\r\nWriter.create = create();\r\n\r\n/**\r\n * Allocates a buffer of the specified size.\r\n * @param {number} size Buffer size\r\n * @returns {Uint8Array} Buffer\r\n */\r\nWriter.alloc = function alloc(size) {\r\n return new util.Array(size);\r\n};\r\n\r\n// Use Uint8Array buffer pool in the browser, just like node does with buffers\r\n/* istanbul ignore else */\r\nif (util.Array !== Array)\r\n Writer.alloc = util.pool(Writer.alloc, util.Array.prototype.subarray);\r\n\r\n/**\r\n * Pushes a new operation to the queue.\r\n * @param {function(Uint8Array, number, *)} fn Function to call\r\n * @param {number} len Value byte length\r\n * @param {number} val Value to write\r\n * @returns {Writer} `this`\r\n * @private\r\n */\r\nWriter.prototype._push = function push(fn, len, val) {\r\n this.tail = this.tail.next = new Op(fn, len, val);\r\n this.len += len;\r\n return this;\r\n};\r\n\r\nfunction writeByte(val, buf, pos) {\r\n buf[pos] = val & 255;\r\n}\r\n\r\nfunction writeVarint32(val, buf, pos) {\r\n while (val > 127) {\r\n buf[pos++] = val & 127 | 128;\r\n val >>>= 7;\r\n }\r\n buf[pos] = val;\r\n}\r\n\r\n/**\r\n * Constructs a new varint writer operation instance.\r\n * @classdesc Scheduled varint writer operation.\r\n * @extends Op\r\n * @constructor\r\n * @param {number} len Value byte length\r\n * @param {number} val Value to write\r\n * @ignore\r\n */\r\nfunction VarintOp(len, val) {\r\n this.len = len;\r\n this.next = undefined;\r\n this.val = val;\r\n}\r\n\r\nVarintOp.prototype = Object.create(Op.prototype);\r\nVarintOp.prototype.fn = writeVarint32;\r\n\r\n/**\r\n * Writes an unsigned 32 bit value as a varint.\r\n * @param {number} value Value to write\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.uint32 = function write_uint32(value) {\r\n // here, the call to this.push has been inlined and a varint specific Op subclass is used.\r\n // uint32 is by far the most frequently used operation and benefits significantly from this.\r\n this.len += (this.tail = this.tail.next = new VarintOp(\r\n (value = value >>> 0)\r\n < 128 ? 1\r\n : value < 16384 ? 2\r\n : value < 2097152 ? 3\r\n : value < 268435456 ? 4\r\n : 5,\r\n value)).len;\r\n return this;\r\n};\r\n\r\n/**\r\n * Writes a signed 32 bit value as a varint.\r\n * @function\r\n * @param {number} value Value to write\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.int32 = function write_int32(value) {\r\n return value < 0\r\n ? this._push(writeVarint64, 10, LongBits.fromNumber(value)) // 10 bytes per spec\r\n : this.uint32(value);\r\n};\r\n\r\n/**\r\n * Writes a 32 bit value as a varint, zig-zag encoded.\r\n * @param {number} value Value to write\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.sint32 = function write_sint32(value) {\r\n return this.uint32((value << 1 ^ value >> 31) >>> 0);\r\n};\r\n\r\nfunction writeVarint64(val, buf, pos) {\r\n while (val.hi) {\r\n buf[pos++] = val.lo & 127 | 128;\r\n val.lo = (val.lo >>> 7 | val.hi << 25) >>> 0;\r\n val.hi >>>= 7;\r\n }\r\n while (val.lo > 127) {\r\n buf[pos++] = val.lo & 127 | 128;\r\n val.lo = val.lo >>> 7;\r\n }\r\n buf[pos++] = val.lo;\r\n}\r\n\r\n/**\r\n * Writes an unsigned 64 bit value as a varint.\r\n * @param {Long|number|string} value Value to write\r\n * @returns {Writer} `this`\r\n * @throws {TypeError} If `value` is a string and no long library is present.\r\n */\r\nWriter.prototype.uint64 = function write_uint64(value) {\r\n var bits = LongBits.from(value);\r\n return this._push(writeVarint64, bits.length(), bits);\r\n};\r\n\r\n/**\r\n * Writes a signed 64 bit value as a varint.\r\n * @function\r\n * @param {Long|number|string} value Value to write\r\n * @returns {Writer} `this`\r\n * @throws {TypeError} If `value` is a string and no long library is present.\r\n */\r\nWriter.prototype.int64 = Writer.prototype.uint64;\r\n\r\n/**\r\n * Writes a signed 64 bit value as a varint, zig-zag encoded.\r\n * @param {Long|number|string} value Value to write\r\n * @returns {Writer} `this`\r\n * @throws {TypeError} If `value` is a string and no long library is present.\r\n */\r\nWriter.prototype.sint64 = function write_sint64(value) {\r\n var bits = LongBits.from(value).zzEncode();\r\n return this._push(writeVarint64, bits.length(), bits);\r\n};\r\n\r\n/**\r\n * Writes a boolish value as a varint.\r\n * @param {boolean} value Value to write\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.bool = function write_bool(value) {\r\n return this._push(writeByte, 1, value ? 1 : 0);\r\n};\r\n\r\nfunction writeFixed32(val, buf, pos) {\r\n buf[pos ] = val & 255;\r\n buf[pos + 1] = val >>> 8 & 255;\r\n buf[pos + 2] = val >>> 16 & 255;\r\n buf[pos + 3] = val >>> 24;\r\n}\r\n\r\n/**\r\n * Writes an unsigned 32 bit value as fixed 32 bits.\r\n * @param {number} value Value to write\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.fixed32 = function write_fixed32(value) {\r\n return this._push(writeFixed32, 4, value >>> 0);\r\n};\r\n\r\n/**\r\n * Writes a signed 32 bit value as fixed 32 bits.\r\n * @function\r\n * @param {number} value Value to write\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.sfixed32 = Writer.prototype.fixed32;\r\n\r\n/**\r\n * Writes an unsigned 64 bit value as fixed 64 bits.\r\n * @param {Long|number|string} value Value to write\r\n * @returns {Writer} `this`\r\n * @throws {TypeError} If `value` is a string and no long library is present.\r\n */\r\nWriter.prototype.fixed64 = function write_fixed64(value) {\r\n var bits = LongBits.from(value);\r\n return this._push(writeFixed32, 4, bits.lo)._push(writeFixed32, 4, bits.hi);\r\n};\r\n\r\n/**\r\n * Writes a signed 64 bit value as fixed 64 bits.\r\n * @function\r\n * @param {Long|number|string} value Value to write\r\n * @returns {Writer} `this`\r\n * @throws {TypeError} If `value` is a string and no long library is present.\r\n */\r\nWriter.prototype.sfixed64 = Writer.prototype.fixed64;\r\n\r\n/**\r\n * Writes a float (32 bit).\r\n * @function\r\n * @param {number} value Value to write\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.float = function write_float(value) {\r\n return this._push(util.float.writeFloatLE, 4, value);\r\n};\r\n\r\n/**\r\n * Writes a double (64 bit float).\r\n * @function\r\n * @param {number} value Value to write\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.double = function write_double(value) {\r\n return this._push(util.float.writeDoubleLE, 8, value);\r\n};\r\n\r\nvar writeBytes = util.Array.prototype.set\r\n ? function writeBytes_set(val, buf, pos) {\r\n buf.set(val, pos); // also works for plain array values\r\n }\r\n /* istanbul ignore next */\r\n : function writeBytes_for(val, buf, pos) {\r\n for (var i = 0; i < val.length; ++i)\r\n buf[pos + i] = val[i];\r\n };\r\n\r\n/**\r\n * Writes a sequence of bytes.\r\n * @param {Uint8Array|string} value Buffer or base64 encoded string to write\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.bytes = function write_bytes(value) {\r\n var len = value.length >>> 0;\r\n if (!len)\r\n return this._push(writeByte, 1, 0);\r\n if (util.isString(value)) {\r\n var buf = Writer.alloc(len = base64.length(value));\r\n base64.decode(value, buf, 0);\r\n value = buf;\r\n }\r\n return this.uint32(len)._push(writeBytes, len, value);\r\n};\r\n\r\n/**\r\n * Writes a string.\r\n * @param {string} value Value to write\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.string = function write_string(value) {\r\n var len = utf8.length(value);\r\n return len\r\n ? this.uint32(len)._push(utf8.write, len, value)\r\n : this._push(writeByte, 1, 0);\r\n};\r\n\r\n/**\r\n * Forks this writer's state by pushing it to a stack.\r\n * Calling {@link Writer#reset|reset} or {@link Writer#ldelim|ldelim} resets the writer to the previous state.\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.fork = function fork() {\r\n this.states = new State(this);\r\n this.head = this.tail = new Op(noop, 0, 0);\r\n this.len = 0;\r\n return this;\r\n};\r\n\r\n/**\r\n * Resets this instance to the last state.\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.reset = function reset() {\r\n if (this.states) {\r\n this.head = this.states.head;\r\n this.tail = this.states.tail;\r\n this.len = this.states.len;\r\n this.states = this.states.next;\r\n } else {\r\n this.head = this.tail = new Op(noop, 0, 0);\r\n this.len = 0;\r\n }\r\n return this;\r\n};\r\n\r\n/**\r\n * Resets to the last state and appends the fork state's current write length as a varint followed by its operations.\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.ldelim = function ldelim() {\r\n var head = this.head,\r\n tail = this.tail,\r\n len = this.len;\r\n this.reset().uint32(len);\r\n if (len) {\r\n this.tail.next = head.next; // skip noop\r\n this.tail = tail;\r\n this.len += len;\r\n }\r\n return this;\r\n};\r\n\r\n/**\r\n * Finishes the write operation.\r\n * @returns {Uint8Array} Finished buffer\r\n */\r\nWriter.prototype.finish = function finish() {\r\n var head = this.head.next, // skip noop\r\n buf = this.constructor.alloc(this.len),\r\n pos = 0;\r\n while (head) {\r\n head.fn(head.val, buf, pos);\r\n pos += head.len;\r\n head = head.next;\r\n }\r\n // this.head = this.tail = null;\r\n return buf;\r\n};\r\n\r\nWriter._configure = function(BufferWriter_) {\r\n BufferWriter = BufferWriter_;\r\n Writer.create = create();\r\n BufferWriter._configure();\r\n};\r\n","\"use strict\";\r\nmodule.exports = BufferWriter;\r\n\r\n// extends Writer\r\nvar Writer = require(\"./writer\");\r\n(BufferWriter.prototype = Object.create(Writer.prototype)).constructor = BufferWriter;\r\n\r\nvar util = require(\"./util/minimal\");\r\n\r\n/**\r\n * Constructs a new buffer writer instance.\r\n * @classdesc Wire format writer using node buffers.\r\n * @extends Writer\r\n * @constructor\r\n */\r\nfunction BufferWriter() {\r\n Writer.call(this);\r\n}\r\n\r\nBufferWriter._configure = function () {\r\n /**\r\n * Allocates a buffer of the specified size.\r\n * @function\r\n * @param {number} size Buffer size\r\n * @returns {Buffer} Buffer\r\n */\r\n BufferWriter.alloc = util._Buffer_allocUnsafe;\r\n\r\n BufferWriter.writeBytesBuffer = util.Buffer && util.Buffer.prototype instanceof Uint8Array && util.Buffer.prototype.set.name === \"set\"\r\n ? function writeBytesBuffer_set(val, buf, pos) {\r\n buf.set(val, pos); // faster than copy (requires node >= 4 where Buffers extend Uint8Array and set is properly inherited)\r\n // also works for plain array values\r\n }\r\n /* istanbul ignore next */\r\n : function writeBytesBuffer_copy(val, buf, pos) {\r\n if (val.copy) // Buffer values\r\n val.copy(buf, pos, 0, val.length);\r\n else for (var i = 0; i < val.length;) // plain array values\r\n buf[pos++] = val[i++];\r\n };\r\n};\r\n\r\n\r\n/**\r\n * @override\r\n */\r\nBufferWriter.prototype.bytes = function write_bytes_buffer(value) {\r\n if (util.isString(value))\r\n value = util._Buffer_from(value, \"base64\");\r\n var len = value.length >>> 0;\r\n this.uint32(len);\r\n if (len)\r\n this._push(BufferWriter.writeBytesBuffer, len, value);\r\n return this;\r\n};\r\n\r\nfunction writeStringBuffer(val, buf, pos) {\r\n if (val.length < 40) // plain js is faster for short strings (probably due to redundant assertions)\r\n util.utf8.write(val, buf, pos);\r\n else if (buf.utf8Write)\r\n buf.utf8Write(val, pos);\r\n else\r\n buf.write(val, pos);\r\n}\r\n\r\n/**\r\n * @override\r\n */\r\nBufferWriter.prototype.string = function write_string_buffer(value) {\r\n var len = util.Buffer.byteLength(value);\r\n this.uint32(len);\r\n if (len)\r\n this._push(writeStringBuffer, len, value);\r\n return this;\r\n};\r\n\r\n\r\n/**\r\n * Finishes the write operation.\r\n * @name BufferWriter#finish\r\n * @function\r\n * @returns {Buffer} Finished buffer\r\n */\r\n\r\nBufferWriter._configure();\r\n","/*!\n * MIT License\n * \n * Copyright (c) 2017-2022 Peculiar Ventures, LLC\n * \n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n * \n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n * \n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n * \n */\n\n'use strict';\n\nconst ARRAY_BUFFER_NAME = \"[object ArrayBuffer]\";\nclass BufferSourceConverter {\n static isArrayBuffer(data) {\n return Object.prototype.toString.call(data) === ARRAY_BUFFER_NAME;\n }\n static toArrayBuffer(data) {\n if (this.isArrayBuffer(data)) {\n return data;\n }\n if (data.byteLength === data.buffer.byteLength) {\n return data.buffer;\n }\n if (data.byteOffset === 0 && data.byteLength === data.buffer.byteLength) {\n return data.buffer;\n }\n return this.toUint8Array(data.buffer)\n .slice(data.byteOffset, data.byteOffset + data.byteLength)\n .buffer;\n }\n static toUint8Array(data) {\n return this.toView(data, Uint8Array);\n }\n static toView(data, type) {\n if (data.constructor === type) {\n return data;\n }\n if (this.isArrayBuffer(data)) {\n return new type(data);\n }\n if (this.isArrayBufferView(data)) {\n return new type(data.buffer, data.byteOffset, data.byteLength);\n }\n throw new TypeError(\"The provided value is not of type '(ArrayBuffer or ArrayBufferView)'\");\n }\n static isBufferSource(data) {\n return this.isArrayBufferView(data)\n || this.isArrayBuffer(data);\n }\n static isArrayBufferView(data) {\n return ArrayBuffer.isView(data)\n || (data && this.isArrayBuffer(data.buffer));\n }\n static isEqual(a, b) {\n const aView = BufferSourceConverter.toUint8Array(a);\n const bView = BufferSourceConverter.toUint8Array(b);\n if (aView.length !== bView.byteLength) {\n return false;\n }\n for (let i = 0; i < aView.length; i++) {\n if (aView[i] !== bView[i]) {\n return false;\n }\n }\n return true;\n }\n static concat(...args) {\n let buffers;\n if (Array.isArray(args[0]) && !(args[1] instanceof Function)) {\n buffers = args[0];\n }\n else if (Array.isArray(args[0]) && args[1] instanceof Function) {\n buffers = args[0];\n }\n else {\n if (args[args.length - 1] instanceof Function) {\n buffers = args.slice(0, args.length - 1);\n }\n else {\n buffers = args;\n }\n }\n let size = 0;\n for (const buffer of buffers) {\n size += buffer.byteLength;\n }\n const res = new Uint8Array(size);\n let offset = 0;\n for (const buffer of buffers) {\n const view = this.toUint8Array(buffer);\n res.set(view, offset);\n offset += view.length;\n }\n if (args[args.length - 1] instanceof Function) {\n return this.toView(res, args[args.length - 1]);\n }\n return res.buffer;\n }\n}\n\nconst STRING_TYPE = \"string\";\nconst HEX_REGEX = /^[0-9a-f]+$/i;\nconst BASE64_REGEX = /^(?:[A-Za-z0-9+/]{4})*(?:[A-Za-z0-9+/]{2}==|[A-Za-z0-9+/]{3}=)?$/;\nconst BASE64URL_REGEX = /^[a-zA-Z0-9-_]+$/;\nclass Utf8Converter {\n static fromString(text) {\n const s = unescape(encodeURIComponent(text));\n const uintArray = new Uint8Array(s.length);\n for (let i = 0; i < s.length; i++) {\n uintArray[i] = s.charCodeAt(i);\n }\n return uintArray.buffer;\n }\n static toString(buffer) {\n const buf = BufferSourceConverter.toUint8Array(buffer);\n let encodedString = \"\";\n for (let i = 0; i < buf.length; i++) {\n encodedString += String.fromCharCode(buf[i]);\n }\n const decodedString = decodeURIComponent(escape(encodedString));\n return decodedString;\n }\n}\nclass Utf16Converter {\n static toString(buffer, littleEndian = false) {\n const arrayBuffer = BufferSourceConverter.toArrayBuffer(buffer);\n const dataView = new DataView(arrayBuffer);\n let res = \"\";\n for (let i = 0; i < arrayBuffer.byteLength; i += 2) {\n const code = dataView.getUint16(i, littleEndian);\n res += String.fromCharCode(code);\n }\n return res;\n }\n static fromString(text, littleEndian = false) {\n const res = new ArrayBuffer(text.length * 2);\n const dataView = new DataView(res);\n for (let i = 0; i < text.length; i++) {\n dataView.setUint16(i * 2, text.charCodeAt(i), littleEndian);\n }\n return res;\n }\n}\nclass Convert {\n static isHex(data) {\n return typeof data === STRING_TYPE\n && HEX_REGEX.test(data);\n }\n static isBase64(data) {\n return typeof data === STRING_TYPE\n && BASE64_REGEX.test(data);\n }\n static isBase64Url(data) {\n return typeof data === STRING_TYPE\n && BASE64URL_REGEX.test(data);\n }\n static ToString(buffer, enc = \"utf8\") {\n const buf = BufferSourceConverter.toUint8Array(buffer);\n switch (enc.toLowerCase()) {\n case \"utf8\":\n return this.ToUtf8String(buf);\n case \"binary\":\n return this.ToBinary(buf);\n case \"hex\":\n return this.ToHex(buf);\n case \"base64\":\n return this.ToBase64(buf);\n case \"base64url\":\n return this.ToBase64Url(buf);\n case \"utf16le\":\n return Utf16Converter.toString(buf, true);\n case \"utf16\":\n case \"utf16be\":\n return Utf16Converter.toString(buf);\n default:\n throw new Error(`Unknown type of encoding '${enc}'`);\n }\n }\n static FromString(str, enc = \"utf8\") {\n if (!str) {\n return new ArrayBuffer(0);\n }\n switch (enc.toLowerCase()) {\n case \"utf8\":\n return this.FromUtf8String(str);\n case \"binary\":\n return this.FromBinary(str);\n case \"hex\":\n return this.FromHex(str);\n case \"base64\":\n return this.FromBase64(str);\n case \"base64url\":\n return this.FromBase64Url(str);\n case \"utf16le\":\n return Utf16Converter.fromString(str, true);\n case \"utf16\":\n case \"utf16be\":\n return Utf16Converter.fromString(str);\n default:\n throw new Error(`Unknown type of encoding '${enc}'`);\n }\n }\n static ToBase64(buffer) {\n const buf = BufferSourceConverter.toUint8Array(buffer);\n if (typeof btoa !== \"undefined\") {\n const binary = this.ToString(buf, \"binary\");\n return btoa(binary);\n }\n else {\n return Buffer.from(buf).toString(\"base64\");\n }\n }\n static FromBase64(base64) {\n const formatted = this.formatString(base64);\n if (!formatted) {\n return new ArrayBuffer(0);\n }\n if (!Convert.isBase64(formatted)) {\n throw new TypeError(\"Argument 'base64Text' is not Base64 encoded\");\n }\n if (typeof atob !== \"undefined\") {\n return this.FromBinary(atob(formatted));\n }\n else {\n return new Uint8Array(Buffer.from(formatted, \"base64\")).buffer;\n }\n }\n static FromBase64Url(base64url) {\n const formatted = this.formatString(base64url);\n if (!formatted) {\n return new ArrayBuffer(0);\n }\n if (!Convert.isBase64Url(formatted)) {\n throw new TypeError(\"Argument 'base64url' is not Base64Url encoded\");\n }\n return this.FromBase64(this.Base64Padding(formatted.replace(/\\-/g, \"+\").replace(/\\_/g, \"/\")));\n }\n static ToBase64Url(data) {\n return this.ToBase64(data).replace(/\\+/g, \"-\").replace(/\\//g, \"_\").replace(/\\=/g, \"\");\n }\n static FromUtf8String(text, encoding = Convert.DEFAULT_UTF8_ENCODING) {\n switch (encoding) {\n case \"ascii\":\n return this.FromBinary(text);\n case \"utf8\":\n return Utf8Converter.fromString(text);\n case \"utf16\":\n case \"utf16be\":\n return Utf16Converter.fromString(text);\n case \"utf16le\":\n case \"usc2\":\n return Utf16Converter.fromString(text, true);\n default:\n throw new Error(`Unknown type of encoding '${encoding}'`);\n }\n }\n static ToUtf8String(buffer, encoding = Convert.DEFAULT_UTF8_ENCODING) {\n switch (encoding) {\n case \"ascii\":\n return this.ToBinary(buffer);\n case \"utf8\":\n return Utf8Converter.toString(buffer);\n case \"utf16\":\n case \"utf16be\":\n return Utf16Converter.toString(buffer);\n case \"utf16le\":\n case \"usc2\":\n return Utf16Converter.toString(buffer, true);\n default:\n throw new Error(`Unknown type of encoding '${encoding}'`);\n }\n }\n static FromBinary(text) {\n const stringLength = text.length;\n const resultView = new Uint8Array(stringLength);\n for (let i = 0; i < stringLength; i++) {\n resultView[i] = text.charCodeAt(i);\n }\n return resultView.buffer;\n }\n static ToBinary(buffer) {\n const buf = BufferSourceConverter.toUint8Array(buffer);\n let res = \"\";\n for (let i = 0; i < buf.length; i++) {\n res += String.fromCharCode(buf[i]);\n }\n return res;\n }\n static ToHex(buffer) {\n const buf = BufferSourceConverter.toUint8Array(buffer);\n let result = \"\";\n const len = buf.length;\n for (let i = 0; i < len; i++) {\n const byte = buf[i];\n if (byte < 16) {\n result += \"0\";\n }\n result += byte.toString(16);\n }\n return result;\n }\n static FromHex(hexString) {\n let formatted = this.formatString(hexString);\n if (!formatted) {\n return new ArrayBuffer(0);\n }\n if (!Convert.isHex(formatted)) {\n throw new TypeError(\"Argument 'hexString' is not HEX encoded\");\n }\n if (formatted.length % 2) {\n formatted = `0${formatted}`;\n }\n const res = new Uint8Array(formatted.length / 2);\n for (let i = 0; i < formatted.length; i = i + 2) {\n const c = formatted.slice(i, i + 2);\n res[i / 2] = parseInt(c, 16);\n }\n return res.buffer;\n }\n static ToUtf16String(buffer, littleEndian = false) {\n return Utf16Converter.toString(buffer, littleEndian);\n }\n static FromUtf16String(text, littleEndian = false) {\n return Utf16Converter.fromString(text, littleEndian);\n }\n static Base64Padding(base64) {\n const padCount = 4 - (base64.length % 4);\n if (padCount < 4) {\n for (let i = 0; i < padCount; i++) {\n base64 += \"=\";\n }\n }\n return base64;\n }\n static formatString(data) {\n return (data === null || data === void 0 ? void 0 : data.replace(/[\\n\\r\\t ]/g, \"\")) || \"\";\n }\n}\nConvert.DEFAULT_UTF8_ENCODING = \"utf8\";\n\nfunction assign(target, ...sources) {\n const res = arguments[0];\n for (let i = 1; i < arguments.length; i++) {\n const obj = arguments[i];\n for (const prop in obj) {\n res[prop] = obj[prop];\n }\n }\n return res;\n}\nfunction combine(...buf) {\n const totalByteLength = buf.map((item) => item.byteLength).reduce((prev, cur) => prev + cur);\n const res = new Uint8Array(totalByteLength);\n let currentPos = 0;\n buf.map((item) => new Uint8Array(item)).forEach((arr) => {\n for (const item2 of arr) {\n res[currentPos++] = item2;\n }\n });\n return res.buffer;\n}\nfunction isEqual(bytes1, bytes2) {\n if (!(bytes1 && bytes2)) {\n return false;\n }\n if (bytes1.byteLength !== bytes2.byteLength) {\n return false;\n }\n const b1 = new Uint8Array(bytes1);\n const b2 = new Uint8Array(bytes2);\n for (let i = 0; i < bytes1.byteLength; i++) {\n if (b1[i] !== b2[i]) {\n return false;\n }\n }\n return true;\n}\n\nexports.BufferSourceConverter = BufferSourceConverter;\nexports.Convert = Convert;\nexports.assign = assign;\nexports.combine = combine;\nexports.isEqual = isEqual;\n","// The module cache\nvar __webpack_module_cache__ = {};\n\n// The require function\nfunction __webpack_require__(moduleId) {\n\t// Check if module is in cache\n\tvar cachedModule = __webpack_module_cache__[moduleId];\n\tif (cachedModule !== undefined) {\n\t\treturn cachedModule.exports;\n\t}\n\t// Create a new module (and put it into the cache)\n\tvar module = __webpack_module_cache__[moduleId] = {\n\t\t// no module.id needed\n\t\t// no module.loaded needed\n\t\texports: {}\n\t};\n\n\t// Execute the module function\n\t__webpack_modules__[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n\t// Return the exports of the module\n\treturn module.exports;\n}\n\n","var getProto = Object.getPrototypeOf ? (obj) => (Object.getPrototypeOf(obj)) : (obj) => (obj.__proto__);\nvar leafPrototypes;\n// create a fake namespace object\n// mode & 1: value is a module id, require it\n// mode & 2: merge all properties of value into the ns\n// mode & 4: return value when already ns object\n// mode & 16: return value when it's Promise-like\n// mode & 8|1: behave like require\n__webpack_require__.t = function(value, mode) {\n\tif(mode & 1) value = this(value);\n\tif(mode & 8) return value;\n\tif(typeof value === 'object' && value) {\n\t\tif((mode & 4) && value.__esModule) return value;\n\t\tif((mode & 16) && typeof value.then === 'function') return value;\n\t}\n\tvar ns = Object.create(null);\n\t__webpack_require__.r(ns);\n\tvar def = {};\n\tleafPrototypes = leafPrototypes || [null, getProto({}), getProto([]), getProto(getProto)];\n\tfor(var current = mode & 2 && value; typeof current == 'object' && !~leafPrototypes.indexOf(current); current = getProto(current)) {\n\t\tObject.getOwnPropertyNames(current).forEach((key) => (def[key] = () => (value[key])));\n\t}\n\tdef['default'] = () => (value);\n\t__webpack_require__.d(ns, def);\n\treturn ns;\n};","__webpack_require__.amdO = {};","// define getter functions for harmony exports\n__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n\t\t}\n\t}\n};","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","// define __esModule on exports\n__webpack_require__.r = (exports) => {\n\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n\t}\n\tObject.defineProperty(exports, '__esModule', { value: true });\n};","/**\n * Returns a `Uint8Array` of the requested size. Referenced memory will\n * be initialized to 0.\n */\nexport function alloc(size = 0) {\n return new Uint8Array(size);\n}\n/**\n * Where possible returns a Uint8Array of the requested size that references\n * uninitialized memory. Only use if you are certain you will immediately\n * overwrite every value in the returned `Uint8Array`.\n */\nexport function allocUnsafe(size = 0) {\n return new Uint8Array(size);\n}\n//# sourceMappingURL=alloc.js.map","/* eslint-disable no-fallthrough */\nimport { allocUnsafe } from 'uint8arrays/alloc';\nconst N1 = Math.pow(2, 7);\nconst N2 = Math.pow(2, 14);\nconst N3 = Math.pow(2, 21);\nconst N4 = Math.pow(2, 28);\nconst N5 = Math.pow(2, 35);\nconst N6 = Math.pow(2, 42);\nconst N7 = Math.pow(2, 49);\n/** Most significant bit of a byte */\nconst MSB = 0x80;\n/** Rest of the bits in a byte */\nconst REST = 0x7f;\nexport function encodingLength(value) {\n if (value < N1) {\n return 1;\n }\n if (value < N2) {\n return 2;\n }\n if (value < N3) {\n return 3;\n }\n if (value < N4) {\n return 4;\n }\n if (value < N5) {\n return 5;\n }\n if (value < N6) {\n return 6;\n }\n if (value < N7) {\n return 7;\n }\n if (Number.MAX_SAFE_INTEGER != null && value > Number.MAX_SAFE_INTEGER) {\n throw new RangeError('Could not encode varint');\n }\n return 8;\n}\nexport function encodeUint8Array(value, buf, offset = 0) {\n switch (encodingLength(value)) {\n case 8: {\n buf[offset++] = (value & 0xFF) | MSB;\n value /= 128;\n }\n case 7: {\n buf[offset++] = (value & 0xFF) | MSB;\n value /= 128;\n }\n case 6: {\n buf[offset++] = (value & 0xFF) | MSB;\n value /= 128;\n }\n case 5: {\n buf[offset++] = (value & 0xFF) | MSB;\n value /= 128;\n }\n case 4: {\n buf[offset++] = (value & 0xFF) | MSB;\n value >>>= 7;\n }\n case 3: {\n buf[offset++] = (value & 0xFF) | MSB;\n value >>>= 7;\n }\n case 2: {\n buf[offset++] = (value & 0xFF) | MSB;\n value >>>= 7;\n }\n case 1: {\n buf[offset++] = (value & 0xFF);\n value >>>= 7;\n break;\n }\n default: throw new Error('unreachable');\n }\n return buf;\n}\nexport function encodeUint8ArrayList(value, buf, offset = 0) {\n switch (encodingLength(value)) {\n case 8: {\n buf.set(offset++, (value & 0xFF) | MSB);\n value /= 128;\n }\n case 7: {\n buf.set(offset++, (value & 0xFF) | MSB);\n value /= 128;\n }\n case 6: {\n buf.set(offset++, (value & 0xFF) | MSB);\n value /= 128;\n }\n case 5: {\n buf.set(offset++, (value & 0xFF) | MSB);\n value /= 128;\n }\n case 4: {\n buf.set(offset++, (value & 0xFF) | MSB);\n value >>>= 7;\n }\n case 3: {\n buf.set(offset++, (value & 0xFF) | MSB);\n value >>>= 7;\n }\n case 2: {\n buf.set(offset++, (value & 0xFF) | MSB);\n value >>>= 7;\n }\n case 1: {\n buf.set(offset++, (value & 0xFF));\n value >>>= 7;\n break;\n }\n default: throw new Error('unreachable');\n }\n return buf;\n}\nexport function decodeUint8Array(buf, offset) {\n let b = buf[offset];\n let res = 0;\n res += b & REST;\n if (b < MSB) {\n return res;\n }\n b = buf[offset + 1];\n res += (b & REST) << 7;\n if (b < MSB) {\n return res;\n }\n b = buf[offset + 2];\n res += (b & REST) << 14;\n if (b < MSB) {\n return res;\n }\n b = buf[offset + 3];\n res += (b & REST) << 21;\n if (b < MSB) {\n return res;\n }\n b = buf[offset + 4];\n res += (b & REST) * N4;\n if (b < MSB) {\n return res;\n }\n b = buf[offset + 5];\n res += (b & REST) * N5;\n if (b < MSB) {\n return res;\n }\n b = buf[offset + 6];\n res += (b & REST) * N6;\n if (b < MSB) {\n return res;\n }\n b = buf[offset + 7];\n res += (b & REST) * N7;\n if (b < MSB) {\n return res;\n }\n throw new RangeError('Could not decode varint');\n}\nexport function decodeUint8ArrayList(buf, offset) {\n let b = buf.get(offset);\n let res = 0;\n res += b & REST;\n if (b < MSB) {\n return res;\n }\n b = buf.get(offset + 1);\n res += (b & REST) << 7;\n if (b < MSB) {\n return res;\n }\n b = buf.get(offset + 2);\n res += (b & REST) << 14;\n if (b < MSB) {\n return res;\n }\n b = buf.get(offset + 3);\n res += (b & REST) << 21;\n if (b < MSB) {\n return res;\n }\n b = buf.get(offset + 4);\n res += (b & REST) * N4;\n if (b < MSB) {\n return res;\n }\n b = buf.get(offset + 5);\n res += (b & REST) * N5;\n if (b < MSB) {\n return res;\n }\n b = buf.get(offset + 6);\n res += (b & REST) * N6;\n if (b < MSB) {\n return res;\n }\n b = buf.get(offset + 7);\n res += (b & REST) * N7;\n if (b < MSB) {\n return res;\n }\n throw new RangeError('Could not decode varint');\n}\nexport function encode(value, buf, offset = 0) {\n if (buf == null) {\n buf = allocUnsafe(encodingLength(value));\n }\n if (buf instanceof Uint8Array) {\n return encodeUint8Array(value, buf, offset);\n }\n else {\n return encodeUint8ArrayList(value, buf, offset);\n }\n}\nexport function decode(buf, offset = 0) {\n if (buf instanceof Uint8Array) {\n return decodeUint8Array(buf, offset);\n }\n else {\n return decodeUint8ArrayList(buf, offset);\n }\n}\n//# sourceMappingURL=index.js.map","const f32 = new Float32Array([-0]);\nconst f8b = new Uint8Array(f32.buffer);\n/**\n * Writes a 32 bit float to a buffer using little endian byte order\n */\nexport function writeFloatLE(val, buf, pos) {\n f32[0] = val;\n buf[pos] = f8b[0];\n buf[pos + 1] = f8b[1];\n buf[pos + 2] = f8b[2];\n buf[pos + 3] = f8b[3];\n}\n/**\n * Writes a 32 bit float to a buffer using big endian byte order\n */\nexport function writeFloatBE(val, buf, pos) {\n f32[0] = val;\n buf[pos] = f8b[3];\n buf[pos + 1] = f8b[2];\n buf[pos + 2] = f8b[1];\n buf[pos + 3] = f8b[0];\n}\n/**\n * Reads a 32 bit float from a buffer using little endian byte order\n */\nexport function readFloatLE(buf, pos) {\n f8b[0] = buf[pos];\n f8b[1] = buf[pos + 1];\n f8b[2] = buf[pos + 2];\n f8b[3] = buf[pos + 3];\n return f32[0];\n}\n/**\n * Reads a 32 bit float from a buffer using big endian byte order\n */\nexport function readFloatBE(buf, pos) {\n f8b[3] = buf[pos];\n f8b[2] = buf[pos + 1];\n f8b[1] = buf[pos + 2];\n f8b[0] = buf[pos + 3];\n return f32[0];\n}\nconst f64 = new Float64Array([-0]);\nconst d8b = new Uint8Array(f64.buffer);\n/**\n * Writes a 64 bit double to a buffer using little endian byte order\n */\nexport function writeDoubleLE(val, buf, pos) {\n f64[0] = val;\n buf[pos] = d8b[0];\n buf[pos + 1] = d8b[1];\n buf[pos + 2] = d8b[2];\n buf[pos + 3] = d8b[3];\n buf[pos + 4] = d8b[4];\n buf[pos + 5] = d8b[5];\n buf[pos + 6] = d8b[6];\n buf[pos + 7] = d8b[7];\n}\n/**\n * Writes a 64 bit double to a buffer using big endian byte order\n */\nexport function writeDoubleBE(val, buf, pos) {\n f64[0] = val;\n buf[pos] = d8b[7];\n buf[pos + 1] = d8b[6];\n buf[pos + 2] = d8b[5];\n buf[pos + 3] = d8b[4];\n buf[pos + 4] = d8b[3];\n buf[pos + 5] = d8b[2];\n buf[pos + 6] = d8b[1];\n buf[pos + 7] = d8b[0];\n}\n/**\n * Reads a 64 bit double from a buffer using little endian byte order\n */\nexport function readDoubleLE(buf, pos) {\n d8b[0] = buf[pos];\n d8b[1] = buf[pos + 1];\n d8b[2] = buf[pos + 2];\n d8b[3] = buf[pos + 3];\n d8b[4] = buf[pos + 4];\n d8b[5] = buf[pos + 5];\n d8b[6] = buf[pos + 6];\n d8b[7] = buf[pos + 7];\n return f64[0];\n}\n/**\n * Reads a 64 bit double from a buffer using big endian byte order\n */\nexport function readDoubleBE(buf, pos) {\n d8b[7] = buf[pos];\n d8b[6] = buf[pos + 1];\n d8b[5] = buf[pos + 2];\n d8b[4] = buf[pos + 3];\n d8b[3] = buf[pos + 4];\n d8b[2] = buf[pos + 5];\n d8b[1] = buf[pos + 6];\n d8b[0] = buf[pos + 7];\n return f64[0];\n}\n//# sourceMappingURL=float.js.map","// the largest BigInt we can safely downcast to a Number\nconst MAX_SAFE_NUMBER_INTEGER = BigInt(Number.MAX_SAFE_INTEGER);\nconst MIN_SAFE_NUMBER_INTEGER = BigInt(Number.MIN_SAFE_INTEGER);\n/**\n * Constructs new long bits.\n *\n * @classdesc Helper class for working with the low and high bits of a 64 bit value.\n * @memberof util\n * @function Object() { [native code] }\n * @param {number} lo - Low 32 bits, unsigned\n * @param {number} hi - High 32 bits, unsigned\n */\nexport class LongBits {\n lo;\n hi;\n constructor(lo, hi) {\n // note that the casts below are theoretically unnecessary as of today, but older statically\n // generated converter code might still call the ctor with signed 32bits. kept for compat.\n /**\n * Low bits\n */\n this.lo = lo | 0;\n /**\n * High bits\n */\n this.hi = hi | 0;\n }\n /**\n * Converts this long bits to a possibly unsafe JavaScript number\n */\n toNumber(unsigned = false) {\n if (!unsigned && (this.hi >>> 31) > 0) {\n const lo = ~this.lo + 1 >>> 0;\n let hi = ~this.hi >>> 0;\n if (lo === 0) {\n hi = hi + 1 >>> 0;\n }\n return -(lo + hi * 4294967296);\n }\n return this.lo + this.hi * 4294967296;\n }\n /**\n * Converts this long bits to a bigint\n */\n toBigInt(unsigned = false) {\n if (unsigned) {\n return BigInt(this.lo >>> 0) + (BigInt(this.hi >>> 0) << 32n);\n }\n if ((this.hi >>> 31) !== 0) {\n const lo = ~this.lo + 1 >>> 0;\n let hi = ~this.hi >>> 0;\n if (lo === 0) {\n hi = hi + 1 >>> 0;\n }\n return -(BigInt(lo) + (BigInt(hi) << 32n));\n }\n return BigInt(this.lo >>> 0) + (BigInt(this.hi >>> 0) << 32n);\n }\n /**\n * Converts this long bits to a string\n */\n toString(unsigned = false) {\n return this.toBigInt(unsigned).toString();\n }\n /**\n * Zig-zag encodes this long bits\n */\n zzEncode() {\n const mask = this.hi >> 31;\n this.hi = ((this.hi << 1 | this.lo >>> 31) ^ mask) >>> 0;\n this.lo = (this.lo << 1 ^ mask) >>> 0;\n return this;\n }\n /**\n * Zig-zag decodes this long bits\n */\n zzDecode() {\n const mask = -(this.lo & 1);\n this.lo = ((this.lo >>> 1 | this.hi << 31) ^ mask) >>> 0;\n this.hi = (this.hi >>> 1 ^ mask) >>> 0;\n return this;\n }\n /**\n * Calculates the length of this longbits when encoded as a varint.\n */\n length() {\n const part0 = this.lo;\n const part1 = (this.lo >>> 28 | this.hi << 4) >>> 0;\n const part2 = this.hi >>> 24;\n return part2 === 0\n ? part1 === 0\n ? part0 < 16384\n ? part0 < 128 ? 1 : 2\n : part0 < 2097152 ? 3 : 4\n : part1 < 16384\n ? part1 < 128 ? 5 : 6\n : part1 < 2097152 ? 7 : 8\n : part2 < 128 ? 9 : 10;\n }\n /**\n * Constructs new long bits from the specified number\n */\n static fromBigInt(value) {\n if (value === 0n) {\n return zero;\n }\n if (value < MAX_SAFE_NUMBER_INTEGER && value > MIN_SAFE_NUMBER_INTEGER) {\n return this.fromNumber(Number(value));\n }\n const negative = value < 0n;\n if (negative) {\n value = -value;\n }\n let hi = value >> 32n;\n let lo = value - (hi << 32n);\n if (negative) {\n hi = ~hi | 0n;\n lo = ~lo | 0n;\n if (++lo > TWO_32) {\n lo = 0n;\n if (++hi > TWO_32) {\n hi = 0n;\n }\n }\n }\n return new LongBits(Number(lo), Number(hi));\n }\n /**\n * Constructs new long bits from the specified number\n */\n static fromNumber(value) {\n if (value === 0) {\n return zero;\n }\n const sign = value < 0;\n if (sign) {\n value = -value;\n }\n let lo = value >>> 0;\n let hi = (value - lo) / 4294967296 >>> 0;\n if (sign) {\n hi = ~hi >>> 0;\n lo = ~lo >>> 0;\n if (++lo > 4294967295) {\n lo = 0;\n if (++hi > 4294967295) {\n hi = 0;\n }\n }\n }\n return new LongBits(lo, hi);\n }\n /**\n * Constructs new long bits from a number, long or string\n */\n static from(value) {\n if (typeof value === 'number') {\n return LongBits.fromNumber(value);\n }\n if (typeof value === 'bigint') {\n return LongBits.fromBigInt(value);\n }\n if (typeof value === 'string') {\n return LongBits.fromBigInt(BigInt(value));\n }\n return value.low != null || value.high != null ? new LongBits(value.low >>> 0, value.high >>> 0) : zero;\n }\n}\nconst zero = new LongBits(0, 0);\nzero.toBigInt = function () { return 0n; };\nzero.zzEncode = zero.zzDecode = function () { return this; };\nzero.length = function () { return 1; };\nconst TWO_32 = 4294967296n;\n//# sourceMappingURL=longbits.js.map","/**\n * Calculates the UTF8 byte length of a string\n */\nexport function length(string) {\n let len = 0;\n let c = 0;\n for (let i = 0; i < string.length; ++i) {\n c = string.charCodeAt(i);\n if (c < 128) {\n len += 1;\n }\n else if (c < 2048) {\n len += 2;\n }\n else if ((c & 0xFC00) === 0xD800 && (string.charCodeAt(i + 1) & 0xFC00) === 0xDC00) {\n ++i;\n len += 4;\n }\n else {\n len += 3;\n }\n }\n return len;\n}\n/**\n * Reads UTF8 bytes as a string\n */\nexport function read(buffer, start, end) {\n const len = end - start;\n if (len < 1) {\n return '';\n }\n let parts;\n const chunk = [];\n let i = 0; // char offset\n let t; // temporary\n while (start < end) {\n t = buffer[start++];\n if (t < 128) {\n chunk[i++] = t;\n }\n else if (t > 191 && t < 224) {\n chunk[i++] = (t & 31) << 6 | buffer[start++] & 63;\n }\n else if (t > 239 && t < 365) {\n t = ((t & 7) << 18 | (buffer[start++] & 63) << 12 | (buffer[start++] & 63) << 6 | buffer[start++] & 63) - 0x10000;\n chunk[i++] = 0xD800 + (t >> 10);\n chunk[i++] = 0xDC00 + (t & 1023);\n }\n else {\n chunk[i++] = (t & 15) << 12 | (buffer[start++] & 63) << 6 | buffer[start++] & 63;\n }\n if (i > 8191) {\n (parts ?? (parts = [])).push(String.fromCharCode.apply(String, chunk));\n i = 0;\n }\n }\n if (parts != null) {\n if (i > 0) {\n parts.push(String.fromCharCode.apply(String, chunk.slice(0, i)));\n }\n return parts.join('');\n }\n return String.fromCharCode.apply(String, chunk.slice(0, i));\n}\n/**\n * Writes a string as UTF8 bytes\n */\nexport function write(string, buffer, offset) {\n const start = offset;\n let c1; // character 1\n let c2; // character 2\n for (let i = 0; i < string.length; ++i) {\n c1 = string.charCodeAt(i);\n if (c1 < 128) {\n buffer[offset++] = c1;\n }\n else if (c1 < 2048) {\n buffer[offset++] = c1 >> 6 | 192;\n buffer[offset++] = c1 & 63 | 128;\n }\n else if ((c1 & 0xFC00) === 0xD800 && ((c2 = string.charCodeAt(i + 1)) & 0xFC00) === 0xDC00) {\n c1 = 0x10000 + ((c1 & 0x03FF) << 10) + (c2 & 0x03FF);\n ++i;\n buffer[offset++] = c1 >> 18 | 240;\n buffer[offset++] = c1 >> 12 & 63 | 128;\n buffer[offset++] = c1 >> 6 & 63 | 128;\n buffer[offset++] = c1 & 63 | 128;\n }\n else {\n buffer[offset++] = c1 >> 12 | 224;\n buffer[offset++] = c1 >> 6 & 63 | 128;\n buffer[offset++] = c1 & 63 | 128;\n }\n }\n return offset - start;\n}\n//# sourceMappingURL=utf8.js.map","import { decodeUint8Array, encodingLength } from 'uint8-varint';\nimport { readFloatLE, readDoubleLE } from './float.js';\nimport { LongBits } from './longbits.js';\nimport * as utf8 from './utf8.js';\n/* istanbul ignore next */\nfunction indexOutOfRange(reader, writeLength) {\n return RangeError(`index out of range: ${reader.pos} + ${writeLength ?? 1} > ${reader.len}`);\n}\nfunction readFixed32End(buf, end) {\n return (buf[end - 4] |\n buf[end - 3] << 8 |\n buf[end - 2] << 16 |\n buf[end - 1] << 24) >>> 0;\n}\n/**\n * Constructs a new reader instance using the specified buffer.\n */\nexport class Uint8ArrayReader {\n buf;\n pos;\n len;\n _slice = Uint8Array.prototype.subarray;\n constructor(buffer) {\n /**\n * Read buffer\n */\n this.buf = buffer;\n /**\n * Read buffer position\n */\n this.pos = 0;\n /**\n * Read buffer length\n */\n this.len = buffer.length;\n }\n /**\n * Reads a varint as an unsigned 32 bit value\n */\n uint32() {\n let value = 4294967295;\n value = (this.buf[this.pos] & 127) >>> 0;\n if (this.buf[this.pos++] < 128)\n return value;\n value = (value | (this.buf[this.pos] & 127) << 7) >>> 0;\n if (this.buf[this.pos++] < 128)\n return value;\n value = (value | (this.buf[this.pos] & 127) << 14) >>> 0;\n if (this.buf[this.pos++] < 128)\n return value;\n value = (value | (this.buf[this.pos] & 127) << 21) >>> 0;\n if (this.buf[this.pos++] < 128)\n return value;\n value = (value | (this.buf[this.pos] & 15) << 28) >>> 0;\n if (this.buf[this.pos++] < 128)\n return value;\n if ((this.pos += 5) > this.len) {\n this.pos = this.len;\n throw indexOutOfRange(this, 10);\n }\n return value;\n }\n /**\n * Reads a varint as a signed 32 bit value\n */\n int32() {\n return this.uint32() | 0;\n }\n /**\n * Reads a zig-zag encoded varint as a signed 32 bit value\n */\n sint32() {\n const value = this.uint32();\n return value >>> 1 ^ -(value & 1) | 0;\n }\n /**\n * Reads a varint as a boolean\n */\n bool() {\n return this.uint32() !== 0;\n }\n /**\n * Reads fixed 32 bits as an unsigned 32 bit integer\n */\n fixed32() {\n if (this.pos + 4 > this.len) {\n throw indexOutOfRange(this, 4);\n }\n const res = readFixed32End(this.buf, this.pos += 4);\n return res;\n }\n /**\n * Reads fixed 32 bits as a signed 32 bit integer\n */\n sfixed32() {\n if (this.pos + 4 > this.len) {\n throw indexOutOfRange(this, 4);\n }\n const res = readFixed32End(this.buf, this.pos += 4) | 0;\n return res;\n }\n /**\n * Reads a float (32 bit) as a number\n */\n float() {\n if (this.pos + 4 > this.len) {\n throw indexOutOfRange(this, 4);\n }\n const value = readFloatLE(this.buf, this.pos);\n this.pos += 4;\n return value;\n }\n /**\n * Reads a double (64 bit float) as a number\n */\n double() {\n /* istanbul ignore if */\n if (this.pos + 8 > this.len) {\n throw indexOutOfRange(this, 4);\n }\n const value = readDoubleLE(this.buf, this.pos);\n this.pos += 8;\n return value;\n }\n /**\n * Reads a sequence of bytes preceded by its length as a varint\n */\n bytes() {\n const length = this.uint32();\n const start = this.pos;\n const end = this.pos + length;\n /* istanbul ignore if */\n if (end > this.len) {\n throw indexOutOfRange(this, length);\n }\n this.pos += length;\n return start === end // fix for IE 10/Win8 and others' subarray returning array of size 1\n ? new Uint8Array(0)\n : this.buf.subarray(start, end);\n }\n /**\n * Reads a string preceded by its byte length as a varint\n */\n string() {\n const bytes = this.bytes();\n return utf8.read(bytes, 0, bytes.length);\n }\n /**\n * Skips the specified number of bytes if specified, otherwise skips a varint\n */\n skip(length) {\n if (typeof length === 'number') {\n /* istanbul ignore if */\n if (this.pos + length > this.len) {\n throw indexOutOfRange(this, length);\n }\n this.pos += length;\n }\n else {\n do {\n /* istanbul ignore if */\n if (this.pos >= this.len) {\n throw indexOutOfRange(this);\n }\n } while ((this.buf[this.pos++] & 128) !== 0);\n }\n return this;\n }\n /**\n * Skips the next element of the specified wire type\n */\n skipType(wireType) {\n switch (wireType) {\n case 0:\n this.skip();\n break;\n case 1:\n this.skip(8);\n break;\n case 2:\n this.skip(this.uint32());\n break;\n case 3:\n while ((wireType = this.uint32() & 7) !== 4) {\n this.skipType(wireType);\n }\n break;\n case 5:\n this.skip(4);\n break;\n /* istanbul ignore next */\n default:\n throw Error(`invalid wire type ${wireType} at offset ${this.pos}`);\n }\n return this;\n }\n readLongVarint() {\n // tends to deopt with local vars for octet etc.\n const bits = new LongBits(0, 0);\n let i = 0;\n if (this.len - this.pos > 4) { // fast route (lo)\n for (; i < 4; ++i) {\n // 1st..4th\n bits.lo = (bits.lo | (this.buf[this.pos] & 127) << i * 7) >>> 0;\n if (this.buf[this.pos++] < 128) {\n return bits;\n }\n }\n // 5th\n bits.lo = (bits.lo | (this.buf[this.pos] & 127) << 28) >>> 0;\n bits.hi = (bits.hi | (this.buf[this.pos] & 127) >> 4) >>> 0;\n if (this.buf[this.pos++] < 128) {\n return bits;\n }\n i = 0;\n }\n else {\n for (; i < 3; ++i) {\n /* istanbul ignore if */\n if (this.pos >= this.len) {\n throw indexOutOfRange(this);\n }\n // 1st..3th\n bits.lo = (bits.lo | (this.buf[this.pos] & 127) << i * 7) >>> 0;\n if (this.buf[this.pos++] < 128) {\n return bits;\n }\n }\n // 4th\n bits.lo = (bits.lo | (this.buf[this.pos++] & 127) << i * 7) >>> 0;\n return bits;\n }\n if (this.len - this.pos > 4) { // fast route (hi)\n for (; i < 5; ++i) {\n // 6th..10th\n bits.hi = (bits.hi | (this.buf[this.pos] & 127) << i * 7 + 3) >>> 0;\n if (this.buf[this.pos++] < 128) {\n return bits;\n }\n }\n }\n else {\n for (; i < 5; ++i) {\n if (this.pos >= this.len) {\n throw indexOutOfRange(this);\n }\n // 6th..10th\n bits.hi = (bits.hi | (this.buf[this.pos] & 127) << i * 7 + 3) >>> 0;\n if (this.buf[this.pos++] < 128) {\n return bits;\n }\n }\n }\n throw Error('invalid varint encoding');\n }\n readFixed64() {\n if (this.pos + 8 > this.len) {\n throw indexOutOfRange(this, 8);\n }\n const lo = readFixed32End(this.buf, this.pos += 4);\n const hi = readFixed32End(this.buf, this.pos += 4);\n return new LongBits(lo, hi);\n }\n /**\n * Reads a varint as a signed 64 bit value\n */\n int64() {\n return this.readLongVarint().toBigInt();\n }\n /**\n * Reads a varint as a signed 64 bit value returned as a possibly unsafe\n * JavaScript number\n */\n int64Number() {\n return this.readLongVarint().toNumber();\n }\n /**\n * Reads a varint as a signed 64 bit value returned as a string\n */\n int64String() {\n return this.readLongVarint().toString();\n }\n /**\n * Reads a varint as an unsigned 64 bit value\n */\n uint64() {\n return this.readLongVarint().toBigInt(true);\n }\n /**\n * Reads a varint as an unsigned 64 bit value returned as a possibly unsafe\n * JavaScript number\n */\n uint64Number() {\n const value = decodeUint8Array(this.buf, this.pos);\n this.pos += encodingLength(value);\n return value;\n }\n /**\n * Reads a varint as an unsigned 64 bit value returned as a string\n */\n uint64String() {\n return this.readLongVarint().toString(true);\n }\n /**\n * Reads a zig-zag encoded varint as a signed 64 bit value\n */\n sint64() {\n return this.readLongVarint().zzDecode().toBigInt();\n }\n /**\n * Reads a zig-zag encoded varint as a signed 64 bit value returned as a\n * possibly unsafe JavaScript number\n */\n sint64Number() {\n return this.readLongVarint().zzDecode().toNumber();\n }\n /**\n * Reads a zig-zag encoded varint as a signed 64 bit value returned as a\n * string\n */\n sint64String() {\n return this.readLongVarint().zzDecode().toString();\n }\n /**\n * Reads fixed 64 bits\n */\n fixed64() {\n return this.readFixed64().toBigInt();\n }\n /**\n * Reads fixed 64 bits returned as a possibly unsafe JavaScript number\n */\n fixed64Number() {\n return this.readFixed64().toNumber();\n }\n /**\n * Reads fixed 64 bits returned as a string\n */\n fixed64String() {\n return this.readFixed64().toString();\n }\n /**\n * Reads zig-zag encoded fixed 64 bits\n */\n sfixed64() {\n return this.readFixed64().toBigInt();\n }\n /**\n * Reads zig-zag encoded fixed 64 bits returned as a possibly unsafe\n * JavaScript number\n */\n sfixed64Number() {\n return this.readFixed64().toNumber();\n }\n /**\n * Reads zig-zag encoded fixed 64 bits returned as a string\n */\n sfixed64String() {\n return this.readFixed64().toString();\n }\n}\nexport function createReader(buf) {\n return new Uint8ArrayReader(buf instanceof Uint8Array ? buf : buf.subarray());\n}\n//# sourceMappingURL=reader.js.map","import { createReader } from './utils/reader.js';\nexport function decodeMessage(buf, codec, opts) {\n const reader = createReader(buf);\n return codec.decode(reader, undefined, opts);\n}\n//# sourceMappingURL=decode.js.map","export const empty = new Uint8Array(0);\nexport function toHex(d) {\n return d.reduce((hex, byte) => hex + byte.toString(16).padStart(2, '0'), '');\n}\nexport function fromHex(hex) {\n const hexes = hex.match(/../g);\n return hexes != null ? new Uint8Array(hexes.map(b => parseInt(b, 16))) : empty;\n}\nexport function equals(aa, bb) {\n if (aa === bb)\n return true;\n if (aa.byteLength !== bb.byteLength) {\n return false;\n }\n for (let ii = 0; ii < aa.byteLength; ii++) {\n if (aa[ii] !== bb[ii]) {\n return false;\n }\n }\n return true;\n}\nexport function coerce(o) {\n if (o instanceof Uint8Array && o.constructor.name === 'Uint8Array')\n return o;\n if (o instanceof ArrayBuffer)\n return new Uint8Array(o);\n if (ArrayBuffer.isView(o)) {\n return new Uint8Array(o.buffer, o.byteOffset, o.byteLength);\n }\n throw new Error('Unknown type, must be binary type');\n}\nexport function isBinary(o) {\n return o instanceof ArrayBuffer || ArrayBuffer.isView(o);\n}\nexport function fromString(str) {\n return new TextEncoder().encode(str);\n}\nexport function toString(b) {\n return new TextDecoder().decode(b);\n}\n//# sourceMappingURL=bytes.js.map","/* eslint-disable */\n// base-x encoding / decoding\n// Copyright (c) 2018 base-x contributors\n// Copyright (c) 2014-2018 The Bitcoin Core developers (base58.cpp)\n// Distributed under the MIT software license, see the accompanying\n// file LICENSE or http://www.opensource.org/licenses/mit-license.php.\n/**\n * @param {string} ALPHABET\n * @param {any} name\n */\nfunction base(ALPHABET, name) {\n if (ALPHABET.length >= 255) {\n throw new TypeError('Alphabet too long');\n }\n var BASE_MAP = new Uint8Array(256);\n for (var j = 0; j < BASE_MAP.length; j++) {\n BASE_MAP[j] = 255;\n }\n for (var i = 0; i < ALPHABET.length; i++) {\n var x = ALPHABET.charAt(i);\n var xc = x.charCodeAt(0);\n if (BASE_MAP[xc] !== 255) {\n throw new TypeError(x + ' is ambiguous');\n }\n BASE_MAP[xc] = i;\n }\n var BASE = ALPHABET.length;\n var LEADER = ALPHABET.charAt(0);\n var FACTOR = Math.log(BASE) / Math.log(256); // log(BASE) / log(256), rounded up\n var iFACTOR = Math.log(256) / Math.log(BASE); // log(256) / log(BASE), rounded up\n /**\n * @param {any[] | Iterable} source\n */\n function encode(source) {\n // @ts-ignore\n if (source instanceof Uint8Array)\n ;\n else if (ArrayBuffer.isView(source)) {\n source = new Uint8Array(source.buffer, source.byteOffset, source.byteLength);\n }\n else if (Array.isArray(source)) {\n source = Uint8Array.from(source);\n }\n if (!(source instanceof Uint8Array)) {\n throw new TypeError('Expected Uint8Array');\n }\n if (source.length === 0) {\n return '';\n }\n // Skip & count leading zeroes.\n var zeroes = 0;\n var length = 0;\n var pbegin = 0;\n var pend = source.length;\n while (pbegin !== pend && source[pbegin] === 0) {\n pbegin++;\n zeroes++;\n }\n // Allocate enough space in big-endian base58 representation.\n var size = ((pend - pbegin) * iFACTOR + 1) >>> 0;\n var b58 = new Uint8Array(size);\n // Process the bytes.\n while (pbegin !== pend) {\n var carry = source[pbegin];\n // Apply \"b58 = b58 * 256 + ch\".\n var i = 0;\n for (var it1 = size - 1; (carry !== 0 || i < length) && (it1 !== -1); it1--, i++) {\n carry += (256 * b58[it1]) >>> 0;\n b58[it1] = (carry % BASE) >>> 0;\n carry = (carry / BASE) >>> 0;\n }\n if (carry !== 0) {\n throw new Error('Non-zero carry');\n }\n length = i;\n pbegin++;\n }\n // Skip leading zeroes in base58 result.\n var it2 = size - length;\n while (it2 !== size && b58[it2] === 0) {\n it2++;\n }\n // Translate the result into a string.\n var str = LEADER.repeat(zeroes);\n for (; it2 < size; ++it2) {\n str += ALPHABET.charAt(b58[it2]);\n }\n return str;\n }\n /**\n * @param {string | string[]} source\n */\n function decodeUnsafe(source) {\n if (typeof source !== 'string') {\n throw new TypeError('Expected String');\n }\n if (source.length === 0) {\n return new Uint8Array();\n }\n var psz = 0;\n // Skip leading spaces.\n if (source[psz] === ' ') {\n return;\n }\n // Skip and count leading '1's.\n var zeroes = 0;\n var length = 0;\n while (source[psz] === LEADER) {\n zeroes++;\n psz++;\n }\n // Allocate enough space in big-endian base256 representation.\n var size = (((source.length - psz) * FACTOR) + 1) >>> 0; // log(58) / log(256), rounded up.\n var b256 = new Uint8Array(size);\n // Process the characters.\n while (source[psz]) {\n // Decode character\n var carry = BASE_MAP[source.charCodeAt(psz)];\n // Invalid character\n if (carry === 255) {\n return;\n }\n var i = 0;\n for (var it3 = size - 1; (carry !== 0 || i < length) && (it3 !== -1); it3--, i++) {\n carry += (BASE * b256[it3]) >>> 0;\n b256[it3] = (carry % 256) >>> 0;\n carry = (carry / 256) >>> 0;\n }\n if (carry !== 0) {\n throw new Error('Non-zero carry');\n }\n length = i;\n psz++;\n }\n // Skip trailing spaces.\n if (source[psz] === ' ') {\n return;\n }\n // Skip leading zeroes in b256.\n var it4 = size - length;\n while (it4 !== size && b256[it4] === 0) {\n it4++;\n }\n var vch = new Uint8Array(zeroes + (size - it4));\n var j = zeroes;\n while (it4 !== size) {\n vch[j++] = b256[it4++];\n }\n return vch;\n }\n /**\n * @param {string | string[]} string\n */\n function decode(string) {\n var buffer = decodeUnsafe(string);\n if (buffer) {\n return buffer;\n }\n throw new Error(`Non-${name} character`);\n }\n return {\n encode: encode,\n decodeUnsafe: decodeUnsafe,\n decode: decode\n };\n}\nvar src = base;\nvar _brrp__multiformats_scope_baseX = src;\nexport default _brrp__multiformats_scope_baseX;\n//# sourceMappingURL=base-x.js.map","import { coerce } from '../bytes.js';\nimport basex from '../vendor/base-x.js';\n/**\n * Class represents both BaseEncoder and MultibaseEncoder meaning it\n * can be used to encode to multibase or base encode without multibase\n * prefix.\n */\nclass Encoder {\n name;\n prefix;\n baseEncode;\n constructor(name, prefix, baseEncode) {\n this.name = name;\n this.prefix = prefix;\n this.baseEncode = baseEncode;\n }\n encode(bytes) {\n if (bytes instanceof Uint8Array) {\n return `${this.prefix}${this.baseEncode(bytes)}`;\n }\n else {\n throw Error('Unknown type, must be binary type');\n }\n }\n}\n/**\n * Class represents both BaseDecoder and MultibaseDecoder so it could be used\n * to decode multibases (with matching prefix) or just base decode strings\n * with corresponding base encoding.\n */\nclass Decoder {\n name;\n prefix;\n baseDecode;\n prefixCodePoint;\n constructor(name, prefix, baseDecode) {\n this.name = name;\n this.prefix = prefix;\n /* c8 ignore next 3 */\n if (prefix.codePointAt(0) === undefined) {\n throw new Error('Invalid prefix character');\n }\n this.prefixCodePoint = prefix.codePointAt(0);\n this.baseDecode = baseDecode;\n }\n decode(text) {\n if (typeof text === 'string') {\n if (text.codePointAt(0) !== this.prefixCodePoint) {\n throw Error(`Unable to decode multibase string ${JSON.stringify(text)}, ${this.name} decoder only supports inputs prefixed with ${this.prefix}`);\n }\n return this.baseDecode(text.slice(this.prefix.length));\n }\n else {\n throw Error('Can only multibase decode strings');\n }\n }\n or(decoder) {\n return or(this, decoder);\n }\n}\nclass ComposedDecoder {\n decoders;\n constructor(decoders) {\n this.decoders = decoders;\n }\n or(decoder) {\n return or(this, decoder);\n }\n decode(input) {\n const prefix = input[0];\n const decoder = this.decoders[prefix];\n if (decoder != null) {\n return decoder.decode(input);\n }\n else {\n throw RangeError(`Unable to decode multibase string ${JSON.stringify(input)}, only inputs prefixed with ${Object.keys(this.decoders)} are supported`);\n }\n }\n}\nexport function or(left, right) {\n // eslint-disable-next-line @typescript-eslint/consistent-type-assertions\n return new ComposedDecoder({\n ...(left.decoders ?? { [left.prefix]: left }),\n ...(right.decoders ?? { [right.prefix]: right })\n });\n}\nexport class Codec {\n name;\n prefix;\n baseEncode;\n baseDecode;\n encoder;\n decoder;\n constructor(name, prefix, baseEncode, baseDecode) {\n this.name = name;\n this.prefix = prefix;\n this.baseEncode = baseEncode;\n this.baseDecode = baseDecode;\n this.encoder = new Encoder(name, prefix, baseEncode);\n this.decoder = new Decoder(name, prefix, baseDecode);\n }\n encode(input) {\n return this.encoder.encode(input);\n }\n decode(input) {\n return this.decoder.decode(input);\n }\n}\nexport function from({ name, prefix, encode, decode }) {\n return new Codec(name, prefix, encode, decode);\n}\nexport function baseX({ name, prefix, alphabet }) {\n const { encode, decode } = basex(alphabet, name);\n return from({\n prefix,\n name,\n encode,\n decode: (text) => coerce(decode(text))\n });\n}\nfunction decode(string, alphabet, bitsPerChar, name) {\n // Build the character lookup table:\n const codes = {};\n for (let i = 0; i < alphabet.length; ++i) {\n codes[alphabet[i]] = i;\n }\n // Count the padding bytes:\n let end = string.length;\n while (string[end - 1] === '=') {\n --end;\n }\n // Allocate the output:\n const out = new Uint8Array((end * bitsPerChar / 8) | 0);\n // Parse the data:\n let bits = 0; // Number of bits currently in the buffer\n let buffer = 0; // Bits waiting to be written out, MSB first\n let written = 0; // Next byte to write\n for (let i = 0; i < end; ++i) {\n // Read one character from the string:\n const value = codes[string[i]];\n if (value === undefined) {\n throw new SyntaxError(`Non-${name} character`);\n }\n // Append the bits to the buffer:\n buffer = (buffer << bitsPerChar) | value;\n bits += bitsPerChar;\n // Write out some bits if the buffer has a byte's worth:\n if (bits >= 8) {\n bits -= 8;\n out[written++] = 0xff & (buffer >> bits);\n }\n }\n // Verify that we have received just enough bits:\n if (bits >= bitsPerChar || (0xff & (buffer << (8 - bits))) !== 0) {\n throw new SyntaxError('Unexpected end of data');\n }\n return out;\n}\nfunction encode(data, alphabet, bitsPerChar) {\n const pad = alphabet[alphabet.length - 1] === '=';\n const mask = (1 << bitsPerChar) - 1;\n let out = '';\n let bits = 0; // Number of bits currently in the buffer\n let buffer = 0; // Bits waiting to be written out, MSB first\n for (let i = 0; i < data.length; ++i) {\n // Slurp data into the buffer:\n buffer = (buffer << 8) | data[i];\n bits += 8;\n // Write out as much as we can:\n while (bits > bitsPerChar) {\n bits -= bitsPerChar;\n out += alphabet[mask & (buffer >> bits)];\n }\n }\n // Partial character:\n if (bits !== 0) {\n out += alphabet[mask & (buffer << (bitsPerChar - bits))];\n }\n // Add padding characters until we hit a byte boundary:\n if (pad) {\n while (((out.length * bitsPerChar) & 7) !== 0) {\n out += '=';\n }\n }\n return out;\n}\n/**\n * RFC4648 Factory\n */\nexport function rfc4648({ name, prefix, bitsPerChar, alphabet }) {\n return from({\n prefix,\n name,\n encode(input) {\n return encode(input, alphabet, bitsPerChar);\n },\n decode(input) {\n return decode(input, alphabet, bitsPerChar, name);\n }\n });\n}\n//# sourceMappingURL=base.js.map","import { baseX } from './base.js';\nexport const base10 = baseX({\n prefix: '9',\n name: 'base10',\n alphabet: '0123456789'\n});\n//# sourceMappingURL=base10.js.map","import { rfc4648 } from './base.js';\nexport const base16 = rfc4648({\n prefix: 'f',\n name: 'base16',\n alphabet: '0123456789abcdef',\n bitsPerChar: 4\n});\nexport const base16upper = rfc4648({\n prefix: 'F',\n name: 'base16upper',\n alphabet: '0123456789ABCDEF',\n bitsPerChar: 4\n});\n//# sourceMappingURL=base16.js.map","import { rfc4648 } from './base.js';\nexport const base2 = rfc4648({\n prefix: '0',\n name: 'base2',\n alphabet: '01',\n bitsPerChar: 1\n});\n//# sourceMappingURL=base2.js.map","import { from } from './base.js';\nconst alphabet = Array.from('🚀🪐☄🛰🌌🌑🌒🌓🌔🌕🌖🌗🌘🌍🌏🌎🐉☀💻🖥💾💿😂❤😍🤣😊🙏💕😭😘👍😅👏😁🔥🥰💔💖💙😢🤔😆🙄💪😉☺👌🤗💜😔😎😇🌹🤦🎉💞✌✨🤷😱😌🌸🙌😋💗💚😏💛🙂💓🤩😄😀🖤😃💯🙈👇🎶😒🤭❣😜💋👀😪😑💥🙋😞😩😡🤪👊🥳😥🤤👉💃😳✋😚😝😴🌟😬🙃🍀🌷😻😓⭐✅🥺🌈😈🤘💦✔😣🏃💐☹🎊💘😠☝😕🌺🎂🌻😐🖕💝🙊😹🗣💫💀👑🎵🤞😛🔴😤🌼😫⚽🤙☕🏆🤫👈😮🙆🍻🍃🐶💁😲🌿🧡🎁⚡🌞🎈❌✊👋😰🤨😶🤝🚶💰🍓💢🤟🙁🚨💨🤬✈🎀🍺🤓😙💟🌱😖👶🥴▶➡❓💎💸⬇😨🌚🦋😷🕺⚠🙅😟😵👎🤲🤠🤧📌🔵💅🧐🐾🍒😗🤑🌊🤯🐷☎💧😯💆👆🎤🙇🍑❄🌴💣🐸💌📍🥀🤢👅💡💩👐📸👻🤐🤮🎼🥵🚩🍎🍊👼💍📣🥂');\nconst alphabetBytesToChars = (alphabet.reduce((p, c, i) => { p[i] = c; return p; }, ([])));\nconst alphabetCharsToBytes = (alphabet.reduce((p, c, i) => { p[c.codePointAt(0)] = i; return p; }, ([])));\nfunction encode(data) {\n return data.reduce((p, c) => {\n p += alphabetBytesToChars[c];\n return p;\n }, '');\n}\nfunction decode(str) {\n const byts = [];\n for (const char of str) {\n const byt = alphabetCharsToBytes[char.codePointAt(0)];\n if (byt === undefined) {\n throw new Error(`Non-base256emoji character: ${char}`);\n }\n byts.push(byt);\n }\n return new Uint8Array(byts);\n}\nexport const base256emoji = from({\n prefix: '🚀',\n name: 'base256emoji',\n encode,\n decode\n});\n//# sourceMappingURL=base256emoji.js.map","import { rfc4648 } from './base.js';\nexport const base32 = rfc4648({\n prefix: 'b',\n name: 'base32',\n alphabet: 'abcdefghijklmnopqrstuvwxyz234567',\n bitsPerChar: 5\n});\nexport const base32upper = rfc4648({\n prefix: 'B',\n name: 'base32upper',\n alphabet: 'ABCDEFGHIJKLMNOPQRSTUVWXYZ234567',\n bitsPerChar: 5\n});\nexport const base32pad = rfc4648({\n prefix: 'c',\n name: 'base32pad',\n alphabet: 'abcdefghijklmnopqrstuvwxyz234567=',\n bitsPerChar: 5\n});\nexport const base32padupper = rfc4648({\n prefix: 'C',\n name: 'base32padupper',\n alphabet: 'ABCDEFGHIJKLMNOPQRSTUVWXYZ234567=',\n bitsPerChar: 5\n});\nexport const base32hex = rfc4648({\n prefix: 'v',\n name: 'base32hex',\n alphabet: '0123456789abcdefghijklmnopqrstuv',\n bitsPerChar: 5\n});\nexport const base32hexupper = rfc4648({\n prefix: 'V',\n name: 'base32hexupper',\n alphabet: '0123456789ABCDEFGHIJKLMNOPQRSTUV',\n bitsPerChar: 5\n});\nexport const base32hexpad = rfc4648({\n prefix: 't',\n name: 'base32hexpad',\n alphabet: '0123456789abcdefghijklmnopqrstuv=',\n bitsPerChar: 5\n});\nexport const base32hexpadupper = rfc4648({\n prefix: 'T',\n name: 'base32hexpadupper',\n alphabet: '0123456789ABCDEFGHIJKLMNOPQRSTUV=',\n bitsPerChar: 5\n});\nexport const base32z = rfc4648({\n prefix: 'h',\n name: 'base32z',\n alphabet: 'ybndrfg8ejkmcpqxot1uwisza345h769',\n bitsPerChar: 5\n});\n//# sourceMappingURL=base32.js.map","import { baseX } from './base.js';\nexport const base36 = baseX({\n prefix: 'k',\n name: 'base36',\n alphabet: '0123456789abcdefghijklmnopqrstuvwxyz'\n});\nexport const base36upper = baseX({\n prefix: 'K',\n name: 'base36upper',\n alphabet: '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ'\n});\n//# sourceMappingURL=base36.js.map","import { baseX } from './base.js';\nexport const base58btc = baseX({\n name: 'base58btc',\n prefix: 'z',\n alphabet: '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'\n});\nexport const base58flickr = baseX({\n name: 'base58flickr',\n prefix: 'Z',\n alphabet: '123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ'\n});\n//# sourceMappingURL=base58.js.map","import { rfc4648 } from './base.js';\nexport const base64 = rfc4648({\n prefix: 'm',\n name: 'base64',\n alphabet: 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/',\n bitsPerChar: 6\n});\nexport const base64pad = rfc4648({\n prefix: 'M',\n name: 'base64pad',\n alphabet: 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=',\n bitsPerChar: 6\n});\nexport const base64url = rfc4648({\n prefix: 'u',\n name: 'base64url',\n alphabet: 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_',\n bitsPerChar: 6\n});\nexport const base64urlpad = rfc4648({\n prefix: 'U',\n name: 'base64urlpad',\n alphabet: 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_=',\n bitsPerChar: 6\n});\n//# sourceMappingURL=base64.js.map","import { rfc4648 } from './base.js';\nexport const base8 = rfc4648({\n prefix: '7',\n name: 'base8',\n alphabet: '01234567',\n bitsPerChar: 3\n});\n//# sourceMappingURL=base8.js.map","import { fromString, toString } from '../bytes.js';\nimport { from } from './base.js';\nexport const identity = from({\n prefix: '\\x00',\n name: 'identity',\n encode: (buf) => toString(buf),\n decode: (str) => fromString(str)\n});\n//# sourceMappingURL=identity.js.map","const textEncoder = new TextEncoder();\nconst textDecoder = new TextDecoder();\nexport const name = 'json';\nexport const code = 0x0200;\nexport function encode(node) {\n return textEncoder.encode(JSON.stringify(node));\n}\nexport function decode(data) {\n return JSON.parse(textDecoder.decode(data));\n}\n//# sourceMappingURL=json.js.map","import { coerce } from '../bytes.js';\nexport const name = 'raw';\nexport const code = 0x55;\nexport function encode(node) {\n return coerce(node);\n}\nexport function decode(data) {\n return coerce(data);\n}\n//# sourceMappingURL=raw.js.map","/* eslint-disable */\nvar encode_1 = encode;\nvar MSB = 0x80, REST = 0x7F, MSBALL = ~REST, INT = Math.pow(2, 31);\n/**\n * @param {number} num\n * @param {number[]} out\n * @param {number} offset\n */\nfunction encode(num, out, offset) {\n out = out || [];\n offset = offset || 0;\n var oldOffset = offset;\n while (num >= INT) {\n out[offset++] = (num & 0xFF) | MSB;\n num /= 128;\n }\n while (num & MSBALL) {\n out[offset++] = (num & 0xFF) | MSB;\n num >>>= 7;\n }\n out[offset] = num | 0;\n // @ts-ignore\n encode.bytes = offset - oldOffset + 1;\n return out;\n}\nvar decode = read;\nvar MSB$1 = 0x80, REST$1 = 0x7F;\n/**\n * @param {string | any[]} buf\n * @param {number} offset\n */\nfunction read(buf, offset) {\n var res = 0, offset = offset || 0, shift = 0, counter = offset, b, l = buf.length;\n do {\n if (counter >= l) {\n // @ts-ignore\n read.bytes = 0;\n throw new RangeError('Could not decode varint');\n }\n b = buf[counter++];\n res += shift < 28\n ? (b & REST$1) << shift\n : (b & REST$1) * Math.pow(2, shift);\n shift += 7;\n } while (b >= MSB$1);\n // @ts-ignore\n read.bytes = counter - offset;\n return res;\n}\nvar N1 = Math.pow(2, 7);\nvar N2 = Math.pow(2, 14);\nvar N3 = Math.pow(2, 21);\nvar N4 = Math.pow(2, 28);\nvar N5 = Math.pow(2, 35);\nvar N6 = Math.pow(2, 42);\nvar N7 = Math.pow(2, 49);\nvar N8 = Math.pow(2, 56);\nvar N9 = Math.pow(2, 63);\nvar length = function (/** @type {number} */ value) {\n return (value < N1 ? 1\n : value < N2 ? 2\n : value < N3 ? 3\n : value < N4 ? 4\n : value < N5 ? 5\n : value < N6 ? 6\n : value < N7 ? 7\n : value < N8 ? 8\n : value < N9 ? 9\n : 10);\n};\nvar varint = {\n encode: encode_1,\n decode: decode,\n encodingLength: length\n};\nvar _brrp_varint = varint;\nexport default _brrp_varint;\n//# sourceMappingURL=varint.js.map","import varint from './vendor/varint.js';\nexport function decode(data, offset = 0) {\n const code = varint.decode(data, offset);\n return [code, varint.decode.bytes];\n}\nexport function encodeTo(int, target, offset = 0) {\n varint.encode(int, target, offset);\n return target;\n}\nexport function encodingLength(int) {\n return varint.encodingLength(int);\n}\n//# sourceMappingURL=varint.js.map","import { coerce, equals as equalBytes } from '../bytes.js';\nimport * as varint from '../varint.js';\n/**\n * Creates a multihash digest.\n */\nexport function create(code, digest) {\n const size = digest.byteLength;\n const sizeOffset = varint.encodingLength(code);\n const digestOffset = sizeOffset + varint.encodingLength(size);\n const bytes = new Uint8Array(digestOffset + size);\n varint.encodeTo(code, bytes, 0);\n varint.encodeTo(size, bytes, sizeOffset);\n bytes.set(digest, digestOffset);\n return new Digest(code, size, digest, bytes);\n}\n/**\n * Turns bytes representation of multihash digest into an instance.\n */\nexport function decode(multihash) {\n const bytes = coerce(multihash);\n const [code, sizeOffset] = varint.decode(bytes);\n const [size, digestOffset] = varint.decode(bytes.subarray(sizeOffset));\n const digest = bytes.subarray(sizeOffset + digestOffset);\n if (digest.byteLength !== size) {\n throw new Error('Incorrect length');\n }\n return new Digest(code, size, digest, bytes);\n}\nexport function equals(a, b) {\n if (a === b) {\n return true;\n }\n else {\n const data = b;\n return (a.code === data.code &&\n a.size === data.size &&\n data.bytes instanceof Uint8Array &&\n equalBytes(a.bytes, data.bytes));\n }\n}\n/**\n * Represents a multihash digest which carries information about the\n * hashing algorithm and an actual hash digest.\n */\nexport class Digest {\n code;\n size;\n digest;\n bytes;\n /**\n * Creates a multihash digest.\n */\n constructor(code, size, digest, bytes) {\n this.code = code;\n this.size = size;\n this.digest = digest;\n this.bytes = bytes;\n }\n}\n//# sourceMappingURL=digest.js.map","import { coerce } from '../bytes.js';\nimport * as Digest from './digest.js';\nconst code = 0x0;\nconst name = 'identity';\nconst encode = coerce;\nfunction digest(input) {\n return Digest.create(code, encode(input));\n}\nexport const identity = { code, name, encode, digest };\n//# sourceMappingURL=identity.js.map","import * as Digest from './digest.js';\nexport function from({ name, code, encode }) {\n return new Hasher(name, code, encode);\n}\n/**\n * Hasher represents a hashing algorithm implementation that produces as\n * `MultihashDigest`.\n */\nexport class Hasher {\n name;\n code;\n encode;\n constructor(name, code, encode) {\n this.name = name;\n this.code = code;\n this.encode = encode;\n }\n digest(input) {\n if (input instanceof Uint8Array) {\n const result = this.encode(input);\n return result instanceof Uint8Array\n ? Digest.create(this.code, result)\n /* c8 ignore next 1 */\n : result.then(digest => Digest.create(this.code, digest));\n }\n else {\n throw Error('Unknown type, must be binary type');\n /* c8 ignore next 1 */\n }\n }\n}\n//# sourceMappingURL=hasher.js.map","/* global crypto */\nimport { from } from './hasher.js';\nfunction sha(name) {\n return async (data) => new Uint8Array(await crypto.subtle.digest(name, data));\n}\nexport const sha256 = from({\n name: 'sha2-256',\n code: 0x12,\n encode: sha('SHA-256')\n});\nexport const sha512 = from({\n name: 'sha2-512',\n code: 0x13,\n encode: sha('SHA-512')\n});\n//# sourceMappingURL=sha2-browser.js.map","import { base32 } from './bases/base32.js';\nimport { base58btc } from './bases/base58.js';\nimport { coerce } from './bytes.js';\nimport * as Digest from './hashes/digest.js';\nimport * as varint from './varint.js';\n// This way TS will also expose all the types from module\nexport * from './link/interface.js';\nexport function format(link, base) {\n const { bytes, version } = link;\n switch (version) {\n case 0:\n return toStringV0(bytes, baseCache(link), base ?? base58btc.encoder);\n default:\n return toStringV1(bytes, baseCache(link), (base ?? base32.encoder));\n }\n}\nexport function toJSON(link) {\n return {\n '/': format(link)\n };\n}\nexport function fromJSON(json) {\n return CID.parse(json['/']);\n}\nconst cache = new WeakMap();\nfunction baseCache(cid) {\n const baseCache = cache.get(cid);\n if (baseCache == null) {\n const baseCache = new Map();\n cache.set(cid, baseCache);\n return baseCache;\n }\n return baseCache;\n}\nexport class CID {\n code;\n version;\n multihash;\n bytes;\n '/';\n /**\n * @param version - Version of the CID\n * @param code - Code of the codec content is encoded in, see https://github.com/multiformats/multicodec/blob/master/table.csv\n * @param multihash - (Multi)hash of the of the content.\n */\n constructor(version, code, multihash, bytes) {\n this.code = code;\n this.version = version;\n this.multihash = multihash;\n this.bytes = bytes;\n // flag to serializers that this is a CID and\n // should be treated specially\n this['/'] = bytes;\n }\n /**\n * Signalling `cid.asCID === cid` has been replaced with `cid['/'] === cid.bytes`\n * please either use `CID.asCID(cid)` or switch to new signalling mechanism\n *\n * @deprecated\n */\n get asCID() {\n return this;\n }\n // ArrayBufferView\n get byteOffset() {\n return this.bytes.byteOffset;\n }\n // ArrayBufferView\n get byteLength() {\n return this.bytes.byteLength;\n }\n toV0() {\n switch (this.version) {\n case 0: {\n return this;\n }\n case 1: {\n const { code, multihash } = this;\n if (code !== DAG_PB_CODE) {\n throw new Error('Cannot convert a non dag-pb CID to CIDv0');\n }\n // sha2-256\n if (multihash.code !== SHA_256_CODE) {\n throw new Error('Cannot convert non sha2-256 multihash CID to CIDv0');\n }\n return (CID.createV0(multihash));\n }\n default: {\n throw Error(`Can not convert CID version ${this.version} to version 0. This is a bug please report`);\n }\n }\n }\n toV1() {\n switch (this.version) {\n case 0: {\n const { code, digest } = this.multihash;\n const multihash = Digest.create(code, digest);\n return (CID.createV1(this.code, multihash));\n }\n case 1: {\n return this;\n }\n default: {\n throw Error(`Can not convert CID version ${this.version} to version 1. This is a bug please report`);\n }\n }\n }\n equals(other) {\n return CID.equals(this, other);\n }\n static equals(self, other) {\n const unknown = other;\n return (unknown != null &&\n self.code === unknown.code &&\n self.version === unknown.version &&\n Digest.equals(self.multihash, unknown.multihash));\n }\n toString(base) {\n return format(this, base);\n }\n toJSON() {\n return { '/': format(this) };\n }\n link() {\n return this;\n }\n [Symbol.toStringTag] = 'CID';\n // Legacy\n [Symbol.for('nodejs.util.inspect.custom')]() {\n return `CID(${this.toString()})`;\n }\n /**\n * Takes any input `value` and returns a `CID` instance if it was\n * a `CID` otherwise returns `null`. If `value` is instanceof `CID`\n * it will return value back. If `value` is not instance of this CID\n * class, but is compatible CID it will return new instance of this\n * `CID` class. Otherwise returns null.\n *\n * This allows two different incompatible versions of CID library to\n * co-exist and interop as long as binary interface is compatible.\n */\n static asCID(input) {\n if (input == null) {\n return null;\n }\n const value = input;\n if (value instanceof CID) {\n // If value is instance of CID then we're all set.\n return value;\n }\n else if ((value['/'] != null && value['/'] === value.bytes) || value.asCID === value) {\n // If value isn't instance of this CID class but `this.asCID === this` or\n // `value['/'] === value.bytes` is true it is CID instance coming from a\n // different implementation (diff version or duplicate). In that case we\n // rebase it to this `CID` implementation so caller is guaranteed to get\n // instance with expected API.\n const { version, code, multihash, bytes } = value;\n return new CID(version, code, multihash, bytes ?? encodeCID(version, code, multihash.bytes));\n }\n else if (value[cidSymbol] === true) {\n // If value is a CID from older implementation that used to be tagged via\n // symbol we still rebase it to the this `CID` implementation by\n // delegating that to a constructor.\n const { version, multihash, code } = value;\n const digest = Digest.decode(multihash);\n return CID.create(version, code, digest);\n }\n else {\n // Otherwise value is not a CID (or an incompatible version of it) in\n // which case we return `null`.\n return null;\n }\n }\n /**\n * @param version - Version of the CID\n * @param code - Code of the codec content is encoded in, see https://github.com/multiformats/multicodec/blob/master/table.csv\n * @param digest - (Multi)hash of the of the content.\n */\n static create(version, code, digest) {\n if (typeof code !== 'number') {\n throw new Error('String codecs are no longer supported');\n }\n if (!(digest.bytes instanceof Uint8Array)) {\n throw new Error('Invalid digest');\n }\n switch (version) {\n case 0: {\n if (code !== DAG_PB_CODE) {\n throw new Error(`Version 0 CID must use dag-pb (code: ${DAG_PB_CODE}) block encoding`);\n }\n else {\n return new CID(version, code, digest, digest.bytes);\n }\n }\n case 1: {\n const bytes = encodeCID(version, code, digest.bytes);\n return new CID(version, code, digest, bytes);\n }\n default: {\n throw new Error('Invalid version');\n }\n }\n }\n /**\n * Simplified version of `create` for CIDv0.\n */\n static createV0(digest) {\n return CID.create(0, DAG_PB_CODE, digest);\n }\n /**\n * Simplified version of `create` for CIDv1.\n *\n * @param code - Content encoding format code.\n * @param digest - Multihash of the content.\n */\n static createV1(code, digest) {\n return CID.create(1, code, digest);\n }\n /**\n * Decoded a CID from its binary representation. The byte array must contain\n * only the CID with no additional bytes.\n *\n * An error will be thrown if the bytes provided do not contain a valid\n * binary representation of a CID.\n */\n static decode(bytes) {\n const [cid, remainder] = CID.decodeFirst(bytes);\n if (remainder.length !== 0) {\n throw new Error('Incorrect length');\n }\n return cid;\n }\n /**\n * Decoded a CID from its binary representation at the beginning of a byte\n * array.\n *\n * Returns an array with the first element containing the CID and the second\n * element containing the remainder of the original byte array. The remainder\n * will be a zero-length byte array if the provided bytes only contained a\n * binary CID representation.\n */\n static decodeFirst(bytes) {\n const specs = CID.inspectBytes(bytes);\n const prefixSize = specs.size - specs.multihashSize;\n const multihashBytes = coerce(bytes.subarray(prefixSize, prefixSize + specs.multihashSize));\n if (multihashBytes.byteLength !== specs.multihashSize) {\n throw new Error('Incorrect length');\n }\n const digestBytes = multihashBytes.subarray(specs.multihashSize - specs.digestSize);\n const digest = new Digest.Digest(specs.multihashCode, specs.digestSize, digestBytes, multihashBytes);\n const cid = specs.version === 0\n ? CID.createV0(digest)\n : CID.createV1(specs.codec, digest);\n return [cid, bytes.subarray(specs.size)];\n }\n /**\n * Inspect the initial bytes of a CID to determine its properties.\n *\n * Involves decoding up to 4 varints. Typically this will require only 4 to 6\n * bytes but for larger multicodec code values and larger multihash digest\n * lengths these varints can be quite large. It is recommended that at least\n * 10 bytes be made available in the `initialBytes` argument for a complete\n * inspection.\n */\n static inspectBytes(initialBytes) {\n let offset = 0;\n const next = () => {\n const [i, length] = varint.decode(initialBytes.subarray(offset));\n offset += length;\n return i;\n };\n let version = next();\n let codec = DAG_PB_CODE;\n if (version === 18) {\n // CIDv0\n version = 0;\n offset = 0;\n }\n else {\n codec = next();\n }\n if (version !== 0 && version !== 1) {\n throw new RangeError(`Invalid CID version ${version}`);\n }\n const prefixSize = offset;\n const multihashCode = next(); // multihash code\n const digestSize = next(); // multihash length\n const size = offset + digestSize;\n const multihashSize = size - prefixSize;\n return { version, codec, multihashCode, digestSize, multihashSize, size };\n }\n /**\n * Takes cid in a string representation and creates an instance. If `base`\n * decoder is not provided will use a default from the configuration. It will\n * throw an error if encoding of the CID is not compatible with supplied (or\n * a default decoder).\n */\n static parse(source, base) {\n const [prefix, bytes] = parseCIDtoBytes(source, base);\n const cid = CID.decode(bytes);\n if (cid.version === 0 && source[0] !== 'Q') {\n throw Error('Version 0 CID string must not include multibase prefix');\n }\n // Cache string representation to avoid computing it on `this.toString()`\n baseCache(cid).set(prefix, source);\n return cid;\n }\n}\nfunction parseCIDtoBytes(source, base) {\n switch (source[0]) {\n // CIDv0 is parsed differently\n case 'Q': {\n const decoder = base ?? base58btc;\n return [\n base58btc.prefix,\n decoder.decode(`${base58btc.prefix}${source}`)\n ];\n }\n case base58btc.prefix: {\n const decoder = base ?? base58btc;\n return [base58btc.prefix, decoder.decode(source)];\n }\n case base32.prefix: {\n const decoder = base ?? base32;\n return [base32.prefix, decoder.decode(source)];\n }\n default: {\n if (base == null) {\n throw Error('To parse non base32 or base58btc encoded CID multibase decoder must be provided');\n }\n return [source[0], base.decode(source)];\n }\n }\n}\nfunction toStringV0(bytes, cache, base) {\n const { prefix } = base;\n if (prefix !== base58btc.prefix) {\n throw Error(`Cannot string encode V0 in ${base.name} encoding`);\n }\n const cid = cache.get(prefix);\n if (cid == null) {\n const cid = base.encode(bytes).slice(1);\n cache.set(prefix, cid);\n return cid;\n }\n else {\n return cid;\n }\n}\nfunction toStringV1(bytes, cache, base) {\n const { prefix } = base;\n const cid = cache.get(prefix);\n if (cid == null) {\n const cid = base.encode(bytes);\n cache.set(prefix, cid);\n return cid;\n }\n else {\n return cid;\n }\n}\nconst DAG_PB_CODE = 0x70;\nconst SHA_256_CODE = 0x12;\nfunction encodeCID(version, code, multihash) {\n const codeOffset = varint.encodingLength(version);\n const hashOffset = codeOffset + varint.encodingLength(code);\n const bytes = new Uint8Array(hashOffset + multihash.byteLength);\n varint.encodeTo(version, bytes, 0);\n varint.encodeTo(code, bytes, codeOffset);\n bytes.set(multihash, hashOffset);\n return bytes;\n}\nconst cidSymbol = Symbol.for('@ipld/js-cid/CID');\n//# sourceMappingURL=cid.js.map","import * as base10 from './bases/base10.js';\nimport * as base16 from './bases/base16.js';\nimport * as base2 from './bases/base2.js';\nimport * as base256emoji from './bases/base256emoji.js';\nimport * as base32 from './bases/base32.js';\nimport * as base36 from './bases/base36.js';\nimport * as base58 from './bases/base58.js';\nimport * as base64 from './bases/base64.js';\nimport * as base8 from './bases/base8.js';\nimport * as identityBase from './bases/identity.js';\nimport * as json from './codecs/json.js';\nimport * as raw from './codecs/raw.js';\nimport * as identity from './hashes/identity.js';\nimport * as sha2 from './hashes/sha2.js';\nimport { CID, hasher, digest, varint, bytes } from './index.js';\nexport const bases = { ...identityBase, ...base2, ...base8, ...base10, ...base16, ...base32, ...base36, ...base58, ...base64, ...base256emoji };\nexport const hashes = { ...sha2, ...identity };\nexport const codecs = { raw, json };\nexport { CID, hasher, digest, varint, bytes };\n//# sourceMappingURL=basics.js.map","import { bases } from 'multiformats/basics';\nimport { allocUnsafe } from '#alloc';\nfunction createCodec(name, prefix, encode, decode) {\n return {\n name,\n prefix,\n encoder: {\n name,\n prefix,\n encode\n },\n decoder: {\n decode\n }\n };\n}\nconst string = createCodec('utf8', 'u', (buf) => {\n const decoder = new TextDecoder('utf8');\n return 'u' + decoder.decode(buf);\n}, (str) => {\n const encoder = new TextEncoder();\n return encoder.encode(str.substring(1));\n});\nconst ascii = createCodec('ascii', 'a', (buf) => {\n let string = 'a';\n for (let i = 0; i < buf.length; i++) {\n string += String.fromCharCode(buf[i]);\n }\n return string;\n}, (str) => {\n str = str.substring(1);\n const buf = allocUnsafe(str.length);\n for (let i = 0; i < str.length; i++) {\n buf[i] = str.charCodeAt(i);\n }\n return buf;\n});\nconst BASES = {\n utf8: string,\n 'utf-8': string,\n hex: bases.base16,\n latin1: ascii,\n ascii,\n binary: ascii,\n ...bases\n};\nexport default BASES;\n//# sourceMappingURL=bases.js.map","import bases, {} from './util/bases.js';\n/**\n * Create a `Uint8Array` from the passed string\n *\n * Supports `utf8`, `utf-8`, `hex`, and any encoding supported by the multiformats module.\n *\n * Also `ascii` which is similar to node's 'binary' encoding.\n */\nexport function fromString(string, encoding = 'utf8') {\n const base = bases[encoding];\n if (base == null) {\n throw new Error(`Unsupported encoding \"${encoding}\"`);\n }\n // add multibase prefix\n return base.decoder.decode(`${base.prefix}${string}`); // eslint-disable-line @typescript-eslint/restrict-template-expressions\n}\n//# sourceMappingURL=from-string.js.map","import { encodeUint8Array, encodingLength } from 'uint8-varint';\nimport { allocUnsafe } from 'uint8arrays/alloc';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport { writeFloatLE, writeDoubleLE } from './float.js';\nimport { LongBits } from './longbits.js';\nimport pool from './pool.js';\nimport * as utf8 from './utf8.js';\n/**\n * Constructs a new writer operation instance.\n *\n * @classdesc Scheduled writer operation\n */\nclass Op {\n /**\n * Function to call\n */\n fn;\n /**\n * Value byte length\n */\n len;\n /**\n * Next operation\n */\n next;\n /**\n * Value to write\n */\n val;\n constructor(fn, len, val) {\n this.fn = fn;\n this.len = len;\n this.next = undefined;\n this.val = val; // type varies\n }\n}\n/* istanbul ignore next */\nfunction noop() { } // eslint-disable-line no-empty-function\n/**\n * Constructs a new writer state instance\n */\nclass State {\n /**\n * Current head\n */\n head;\n /**\n * Current tail\n */\n tail;\n /**\n * Current buffer length\n */\n len;\n /**\n * Next state\n */\n next;\n constructor(writer) {\n this.head = writer.head;\n this.tail = writer.tail;\n this.len = writer.len;\n this.next = writer.states;\n }\n}\nconst bufferPool = pool();\n/**\n * Allocates a buffer of the specified size\n */\nfunction alloc(size) {\n if (globalThis.Buffer != null) {\n return allocUnsafe(size);\n }\n return bufferPool(size);\n}\n/**\n * When a value is written, the writer calculates its byte length and puts it into a linked\n * list of operations to perform when finish() is called. This both allows us to allocate\n * buffers of the exact required size and reduces the amount of work we have to do compared\n * to first calculating over objects and then encoding over objects. In our case, the encoding\n * part is just a linked list walk calling operations with already prepared values.\n */\nclass Uint8ArrayWriter {\n /**\n * Current length\n */\n len;\n /**\n * Operations head\n */\n head;\n /**\n * Operations tail\n */\n tail;\n /**\n * Linked forked states\n */\n states;\n constructor() {\n this.len = 0;\n this.head = new Op(noop, 0, 0);\n this.tail = this.head;\n this.states = null;\n }\n /**\n * Pushes a new operation to the queue\n */\n _push(fn, len, val) {\n this.tail = this.tail.next = new Op(fn, len, val);\n this.len += len;\n return this;\n }\n /**\n * Writes an unsigned 32 bit value as a varint\n */\n uint32(value) {\n // here, the call to this.push has been inlined and a varint specific Op subclass is used.\n // uint32 is by far the most frequently used operation and benefits significantly from this.\n this.len += (this.tail = this.tail.next = new VarintOp((value = value >>> 0) <\n 128\n ? 1\n : value < 16384\n ? 2\n : value < 2097152\n ? 3\n : value < 268435456\n ? 4\n : 5, value)).len;\n return this;\n }\n /**\n * Writes a signed 32 bit value as a varint`\n */\n int32(value) {\n return value < 0\n ? this._push(writeVarint64, 10, LongBits.fromNumber(value)) // 10 bytes per spec\n : this.uint32(value);\n }\n /**\n * Writes a 32 bit value as a varint, zig-zag encoded\n */\n sint32(value) {\n return this.uint32((value << 1 ^ value >> 31) >>> 0);\n }\n /**\n * Writes an unsigned 64 bit value as a varint\n */\n uint64(value) {\n const bits = LongBits.fromBigInt(value);\n return this._push(writeVarint64, bits.length(), bits);\n }\n /**\n * Writes an unsigned 64 bit value as a varint\n */\n uint64Number(value) {\n return this._push(encodeUint8Array, encodingLength(value), value);\n }\n /**\n * Writes an unsigned 64 bit value as a varint\n */\n uint64String(value) {\n return this.uint64(BigInt(value));\n }\n /**\n * Writes a signed 64 bit value as a varint\n */\n int64(value) {\n return this.uint64(value);\n }\n /**\n * Writes a signed 64 bit value as a varint\n */\n int64Number(value) {\n return this.uint64Number(value);\n }\n /**\n * Writes a signed 64 bit value as a varint\n */\n int64String(value) {\n return this.uint64String(value);\n }\n /**\n * Writes a signed 64 bit value as a varint, zig-zag encoded\n */\n sint64(value) {\n const bits = LongBits.fromBigInt(value).zzEncode();\n return this._push(writeVarint64, bits.length(), bits);\n }\n /**\n * Writes a signed 64 bit value as a varint, zig-zag encoded\n */\n sint64Number(value) {\n const bits = LongBits.fromNumber(value).zzEncode();\n return this._push(writeVarint64, bits.length(), bits);\n }\n /**\n * Writes a signed 64 bit value as a varint, zig-zag encoded\n */\n sint64String(value) {\n return this.sint64(BigInt(value));\n }\n /**\n * Writes a boolish value as a varint\n */\n bool(value) {\n return this._push(writeByte, 1, value ? 1 : 0);\n }\n /**\n * Writes an unsigned 32 bit value as fixed 32 bits\n */\n fixed32(value) {\n return this._push(writeFixed32, 4, value >>> 0);\n }\n /**\n * Writes a signed 32 bit value as fixed 32 bits\n */\n sfixed32(value) {\n return this.fixed32(value);\n }\n /**\n * Writes an unsigned 64 bit value as fixed 64 bits\n */\n fixed64(value) {\n const bits = LongBits.fromBigInt(value);\n return this._push(writeFixed32, 4, bits.lo)._push(writeFixed32, 4, bits.hi);\n }\n /**\n * Writes an unsigned 64 bit value as fixed 64 bits\n */\n fixed64Number(value) {\n const bits = LongBits.fromNumber(value);\n return this._push(writeFixed32, 4, bits.lo)._push(writeFixed32, 4, bits.hi);\n }\n /**\n * Writes an unsigned 64 bit value as fixed 64 bits\n */\n fixed64String(value) {\n return this.fixed64(BigInt(value));\n }\n /**\n * Writes a signed 64 bit value as fixed 64 bits\n */\n sfixed64(value) {\n return this.fixed64(value);\n }\n /**\n * Writes a signed 64 bit value as fixed 64 bits\n */\n sfixed64Number(value) {\n return this.fixed64Number(value);\n }\n /**\n * Writes a signed 64 bit value as fixed 64 bits\n */\n sfixed64String(value) {\n return this.fixed64String(value);\n }\n /**\n * Writes a float (32 bit)\n */\n float(value) {\n return this._push(writeFloatLE, 4, value);\n }\n /**\n * Writes a double (64 bit float).\n *\n * @function\n * @param {number} value - Value to write\n * @returns {Writer} `this`\n */\n double(value) {\n return this._push(writeDoubleLE, 8, value);\n }\n /**\n * Writes a sequence of bytes\n */\n bytes(value) {\n const len = value.length >>> 0;\n if (len === 0) {\n return this._push(writeByte, 1, 0);\n }\n return this.uint32(len)._push(writeBytes, len, value);\n }\n /**\n * Writes a string\n */\n string(value) {\n const len = utf8.length(value);\n return len !== 0\n ? this.uint32(len)._push(utf8.write, len, value)\n : this._push(writeByte, 1, 0);\n }\n /**\n * Forks this writer's state by pushing it to a stack.\n * Calling {@link Writer#reset|reset} or {@link Writer#ldelim|ldelim} resets the writer to the previous state.\n */\n fork() {\n this.states = new State(this);\n this.head = this.tail = new Op(noop, 0, 0);\n this.len = 0;\n return this;\n }\n /**\n * Resets this instance to the last state\n */\n reset() {\n if (this.states != null) {\n this.head = this.states.head;\n this.tail = this.states.tail;\n this.len = this.states.len;\n this.states = this.states.next;\n }\n else {\n this.head = this.tail = new Op(noop, 0, 0);\n this.len = 0;\n }\n return this;\n }\n /**\n * Resets to the last state and appends the fork state's current write length as a varint followed by its operations.\n */\n ldelim() {\n const head = this.head;\n const tail = this.tail;\n const len = this.len;\n this.reset().uint32(len);\n if (len !== 0) {\n this.tail.next = head.next; // skip noop\n this.tail = tail;\n this.len += len;\n }\n return this;\n }\n /**\n * Finishes the write operation\n */\n finish() {\n let head = this.head.next; // skip noop\n const buf = alloc(this.len);\n let pos = 0;\n while (head != null) {\n head.fn(head.val, buf, pos);\n pos += head.len;\n head = head.next;\n }\n // this.head = this.tail = null;\n return buf;\n }\n}\nfunction writeByte(val, buf, pos) {\n buf[pos] = val & 255;\n}\nfunction writeVarint32(val, buf, pos) {\n while (val > 127) {\n buf[pos++] = val & 127 | 128;\n val >>>= 7;\n }\n buf[pos] = val;\n}\n/**\n * Constructs a new varint writer operation instance.\n *\n * @classdesc Scheduled varint writer operation\n */\nclass VarintOp extends Op {\n next;\n constructor(len, val) {\n super(writeVarint32, len, val);\n this.next = undefined;\n }\n}\nfunction writeVarint64(val, buf, pos) {\n while (val.hi !== 0) {\n buf[pos++] = val.lo & 127 | 128;\n val.lo = (val.lo >>> 7 | val.hi << 25) >>> 0;\n val.hi >>>= 7;\n }\n while (val.lo > 127) {\n buf[pos++] = val.lo & 127 | 128;\n val.lo = val.lo >>> 7;\n }\n buf[pos++] = val.lo;\n}\nfunction writeFixed32(val, buf, pos) {\n buf[pos] = val & 255;\n buf[pos + 1] = val >>> 8 & 255;\n buf[pos + 2] = val >>> 16 & 255;\n buf[pos + 3] = val >>> 24;\n}\nfunction writeBytes(val, buf, pos) {\n buf.set(val, pos);\n}\nif (globalThis.Buffer != null) {\n Uint8ArrayWriter.prototype.bytes = function (value) {\n const len = value.length >>> 0;\n this.uint32(len);\n if (len > 0) {\n this._push(writeBytesBuffer, len, value);\n }\n return this;\n };\n Uint8ArrayWriter.prototype.string = function (value) {\n const len = globalThis.Buffer.byteLength(value);\n this.uint32(len);\n if (len > 0) {\n this._push(writeStringBuffer, len, value);\n }\n return this;\n };\n}\nfunction writeBytesBuffer(val, buf, pos) {\n buf.set(val, pos); // faster than copy (requires node >= 4 where Buffers extend Uint8Array and set is properly inherited)\n // also works for plain array values\n}\nfunction writeStringBuffer(val, buf, pos) {\n if (val.length < 40) {\n // plain js is faster for short strings (probably due to redundant assertions)\n utf8.write(val, buf, pos);\n // @ts-expect-error buf isn't a Uint8Array?\n }\n else if (buf.utf8Write != null) {\n // @ts-expect-error buf isn't a Uint8Array?\n buf.utf8Write(val, pos);\n }\n else {\n buf.set(uint8ArrayFromString(val), pos);\n }\n}\n/**\n * Creates a new writer\n */\nexport function createWriter() {\n return new Uint8ArrayWriter();\n}\n//# sourceMappingURL=writer.js.map","import { allocUnsafe } from 'uint8arrays/alloc';\n/**\n * A general purpose buffer pool\n */\nexport default function pool(size) {\n const SIZE = size ?? 8192;\n const MAX = SIZE >>> 1;\n let slab;\n let offset = SIZE;\n return function poolAlloc(size) {\n if (size < 1 || size > MAX) {\n return allocUnsafe(size);\n }\n if (offset + size > SIZE) {\n slab = allocUnsafe(SIZE);\n offset = 0;\n }\n const buf = slab.subarray(offset, offset += size);\n if ((offset & 7) !== 0) {\n // align to 32 bit\n offset = (offset | 7) + 1;\n }\n return buf;\n };\n}\n//# sourceMappingURL=pool.js.map","import { createWriter } from './utils/writer.js';\nexport function encodeMessage(message, codec) {\n const w = createWriter();\n codec.encode(message, w, {\n lengthDelimited: false\n });\n return w.finish();\n}\n//# sourceMappingURL=encode.js.map","// https://developers.google.com/protocol-buffers/docs/encoding#structure\nexport var CODEC_TYPES;\n(function (CODEC_TYPES) {\n CODEC_TYPES[CODEC_TYPES[\"VARINT\"] = 0] = \"VARINT\";\n CODEC_TYPES[CODEC_TYPES[\"BIT64\"] = 1] = \"BIT64\";\n CODEC_TYPES[CODEC_TYPES[\"LENGTH_DELIMITED\"] = 2] = \"LENGTH_DELIMITED\";\n CODEC_TYPES[CODEC_TYPES[\"START_GROUP\"] = 3] = \"START_GROUP\";\n CODEC_TYPES[CODEC_TYPES[\"END_GROUP\"] = 4] = \"END_GROUP\";\n CODEC_TYPES[CODEC_TYPES[\"BIT32\"] = 5] = \"BIT32\";\n})(CODEC_TYPES || (CODEC_TYPES = {}));\nexport function createCodec(name, type, encode, decode) {\n return {\n name,\n type,\n encode,\n decode\n };\n}\n//# sourceMappingURL=codec.js.map","/* eslint-disable import/export */\n/* eslint-disable complexity */\n/* eslint-disable @typescript-eslint/no-namespace */\n/* eslint-disable @typescript-eslint/no-unnecessary-boolean-literal-compare */\n/* eslint-disable @typescript-eslint/no-empty-interface */\nimport { decodeMessage, encodeMessage, message } from 'protons-runtime';\nimport { alloc as uint8ArrayAlloc } from 'uint8arrays/alloc';\nexport var RateLimitProof;\n(function (RateLimitProof) {\n let _codec;\n RateLimitProof.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.proof != null && obj.proof.byteLength > 0)) {\n w.uint32(10);\n w.bytes(obj.proof);\n }\n if ((obj.merkleRoot != null && obj.merkleRoot.byteLength > 0)) {\n w.uint32(18);\n w.bytes(obj.merkleRoot);\n }\n if ((obj.epoch != null && obj.epoch.byteLength > 0)) {\n w.uint32(26);\n w.bytes(obj.epoch);\n }\n if ((obj.shareX != null && obj.shareX.byteLength > 0)) {\n w.uint32(34);\n w.bytes(obj.shareX);\n }\n if ((obj.shareY != null && obj.shareY.byteLength > 0)) {\n w.uint32(42);\n w.bytes(obj.shareY);\n }\n if ((obj.nullifier != null && obj.nullifier.byteLength > 0)) {\n w.uint32(50);\n w.bytes(obj.nullifier);\n }\n if ((obj.rlnIdentifier != null && obj.rlnIdentifier.byteLength > 0)) {\n w.uint32(58);\n w.bytes(obj.rlnIdentifier);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n proof: uint8ArrayAlloc(0),\n merkleRoot: uint8ArrayAlloc(0),\n epoch: uint8ArrayAlloc(0),\n shareX: uint8ArrayAlloc(0),\n shareY: uint8ArrayAlloc(0),\n nullifier: uint8ArrayAlloc(0),\n rlnIdentifier: uint8ArrayAlloc(0)\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.proof = reader.bytes();\n break;\n }\n case 2: {\n obj.merkleRoot = reader.bytes();\n break;\n }\n case 3: {\n obj.epoch = reader.bytes();\n break;\n }\n case 4: {\n obj.shareX = reader.bytes();\n break;\n }\n case 5: {\n obj.shareY = reader.bytes();\n break;\n }\n case 6: {\n obj.nullifier = reader.bytes();\n break;\n }\n case 7: {\n obj.rlnIdentifier = reader.bytes();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n RateLimitProof.encode = (obj) => {\n return encodeMessage(obj, RateLimitProof.codec());\n };\n RateLimitProof.decode = (buf, opts) => {\n return decodeMessage(buf, RateLimitProof.codec(), opts);\n };\n})(RateLimitProof || (RateLimitProof = {}));\nexport var WakuMessage;\n(function (WakuMessage) {\n let _codec;\n WakuMessage.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.payload != null && obj.payload.byteLength > 0)) {\n w.uint32(10);\n w.bytes(obj.payload);\n }\n if ((obj.contentTopic != null && obj.contentTopic !== '')) {\n w.uint32(18);\n w.string(obj.contentTopic);\n }\n if (obj.version != null) {\n w.uint32(24);\n w.uint32(obj.version);\n }\n if (obj.timestamp != null) {\n w.uint32(80);\n w.sint64(obj.timestamp);\n }\n if (obj.meta != null) {\n w.uint32(90);\n w.bytes(obj.meta);\n }\n if (obj.rateLimitProof != null) {\n w.uint32(170);\n RateLimitProof.codec().encode(obj.rateLimitProof, w);\n }\n if (obj.ephemeral != null) {\n w.uint32(248);\n w.bool(obj.ephemeral);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n payload: uint8ArrayAlloc(0),\n contentTopic: ''\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.payload = reader.bytes();\n break;\n }\n case 2: {\n obj.contentTopic = reader.string();\n break;\n }\n case 3: {\n obj.version = reader.uint32();\n break;\n }\n case 10: {\n obj.timestamp = reader.sint64();\n break;\n }\n case 11: {\n obj.meta = reader.bytes();\n break;\n }\n case 21: {\n obj.rateLimitProof = RateLimitProof.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.rateLimitProof\n });\n break;\n }\n case 31: {\n obj.ephemeral = reader.bool();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n WakuMessage.encode = (obj) => {\n return encodeMessage(obj, WakuMessage.codec());\n };\n WakuMessage.decode = (buf, opts) => {\n return decodeMessage(buf, WakuMessage.codec(), opts);\n };\n})(WakuMessage || (WakuMessage = {}));\n//# sourceMappingURL=message.js.map","/* eslint-disable import/export */\n/* eslint-disable complexity */\n/* eslint-disable @typescript-eslint/no-namespace */\n/* eslint-disable @typescript-eslint/no-unnecessary-boolean-literal-compare */\n/* eslint-disable @typescript-eslint/no-empty-interface */\nimport { decodeMessage, encodeMessage, MaxLengthError, message } from 'protons-runtime';\nimport { alloc as uint8ArrayAlloc } from 'uint8arrays/alloc';\nexport var FilterRequest;\n(function (FilterRequest) {\n let ContentFilter;\n (function (ContentFilter) {\n let _codec;\n ContentFilter.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.contentTopic != null && obj.contentTopic !== '')) {\n w.uint32(10);\n w.string(obj.contentTopic);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n contentTopic: ''\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.contentTopic = reader.string();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n ContentFilter.encode = (obj) => {\n return encodeMessage(obj, ContentFilter.codec());\n };\n ContentFilter.decode = (buf, opts) => {\n return decodeMessage(buf, ContentFilter.codec(), opts);\n };\n })(ContentFilter = FilterRequest.ContentFilter || (FilterRequest.ContentFilter = {}));\n let _codec;\n FilterRequest.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.subscribe != null && obj.subscribe !== false)) {\n w.uint32(8);\n w.bool(obj.subscribe);\n }\n if ((obj.topic != null && obj.topic !== '')) {\n w.uint32(18);\n w.string(obj.topic);\n }\n if (obj.contentFilters != null) {\n for (const value of obj.contentFilters) {\n w.uint32(26);\n FilterRequest.ContentFilter.codec().encode(value, w);\n }\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n subscribe: false,\n topic: '',\n contentFilters: []\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.subscribe = reader.bool();\n break;\n }\n case 2: {\n obj.topic = reader.string();\n break;\n }\n case 3: {\n if (opts.limits?.contentFilters != null && obj.contentFilters.length === opts.limits.contentFilters) {\n throw new MaxLengthError('Decode error - map field \"contentFilters\" had too many elements');\n }\n obj.contentFilters.push(FilterRequest.ContentFilter.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.contentFilters$\n }));\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n FilterRequest.encode = (obj) => {\n return encodeMessage(obj, FilterRequest.codec());\n };\n FilterRequest.decode = (buf, opts) => {\n return decodeMessage(buf, FilterRequest.codec(), opts);\n };\n})(FilterRequest || (FilterRequest = {}));\nexport var MessagePush;\n(function (MessagePush) {\n let _codec;\n MessagePush.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if (obj.messages != null) {\n for (const value of obj.messages) {\n w.uint32(10);\n WakuMessage.codec().encode(value, w);\n }\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n messages: []\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n if (opts.limits?.messages != null && obj.messages.length === opts.limits.messages) {\n throw new MaxLengthError('Decode error - map field \"messages\" had too many elements');\n }\n obj.messages.push(WakuMessage.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.messages$\n }));\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n MessagePush.encode = (obj) => {\n return encodeMessage(obj, MessagePush.codec());\n };\n MessagePush.decode = (buf, opts) => {\n return decodeMessage(buf, MessagePush.codec(), opts);\n };\n})(MessagePush || (MessagePush = {}));\nexport var FilterRpc;\n(function (FilterRpc) {\n let _codec;\n FilterRpc.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.requestId != null && obj.requestId !== '')) {\n w.uint32(10);\n w.string(obj.requestId);\n }\n if (obj.request != null) {\n w.uint32(18);\n FilterRequest.codec().encode(obj.request, w);\n }\n if (obj.push != null) {\n w.uint32(26);\n MessagePush.codec().encode(obj.push, w);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n requestId: ''\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.requestId = reader.string();\n break;\n }\n case 2: {\n obj.request = FilterRequest.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.request\n });\n break;\n }\n case 3: {\n obj.push = MessagePush.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.push\n });\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n FilterRpc.encode = (obj) => {\n return encodeMessage(obj, FilterRpc.codec());\n };\n FilterRpc.decode = (buf, opts) => {\n return decodeMessage(buf, FilterRpc.codec(), opts);\n };\n})(FilterRpc || (FilterRpc = {}));\nexport var RateLimitProof;\n(function (RateLimitProof) {\n let _codec;\n RateLimitProof.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.proof != null && obj.proof.byteLength > 0)) {\n w.uint32(10);\n w.bytes(obj.proof);\n }\n if ((obj.merkleRoot != null && obj.merkleRoot.byteLength > 0)) {\n w.uint32(18);\n w.bytes(obj.merkleRoot);\n }\n if ((obj.epoch != null && obj.epoch.byteLength > 0)) {\n w.uint32(26);\n w.bytes(obj.epoch);\n }\n if ((obj.shareX != null && obj.shareX.byteLength > 0)) {\n w.uint32(34);\n w.bytes(obj.shareX);\n }\n if ((obj.shareY != null && obj.shareY.byteLength > 0)) {\n w.uint32(42);\n w.bytes(obj.shareY);\n }\n if ((obj.nullifier != null && obj.nullifier.byteLength > 0)) {\n w.uint32(50);\n w.bytes(obj.nullifier);\n }\n if ((obj.rlnIdentifier != null && obj.rlnIdentifier.byteLength > 0)) {\n w.uint32(58);\n w.bytes(obj.rlnIdentifier);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n proof: uint8ArrayAlloc(0),\n merkleRoot: uint8ArrayAlloc(0),\n epoch: uint8ArrayAlloc(0),\n shareX: uint8ArrayAlloc(0),\n shareY: uint8ArrayAlloc(0),\n nullifier: uint8ArrayAlloc(0),\n rlnIdentifier: uint8ArrayAlloc(0)\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.proof = reader.bytes();\n break;\n }\n case 2: {\n obj.merkleRoot = reader.bytes();\n break;\n }\n case 3: {\n obj.epoch = reader.bytes();\n break;\n }\n case 4: {\n obj.shareX = reader.bytes();\n break;\n }\n case 5: {\n obj.shareY = reader.bytes();\n break;\n }\n case 6: {\n obj.nullifier = reader.bytes();\n break;\n }\n case 7: {\n obj.rlnIdentifier = reader.bytes();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n RateLimitProof.encode = (obj) => {\n return encodeMessage(obj, RateLimitProof.codec());\n };\n RateLimitProof.decode = (buf, opts) => {\n return decodeMessage(buf, RateLimitProof.codec(), opts);\n };\n})(RateLimitProof || (RateLimitProof = {}));\nexport var WakuMessage;\n(function (WakuMessage) {\n let _codec;\n WakuMessage.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.payload != null && obj.payload.byteLength > 0)) {\n w.uint32(10);\n w.bytes(obj.payload);\n }\n if ((obj.contentTopic != null && obj.contentTopic !== '')) {\n w.uint32(18);\n w.string(obj.contentTopic);\n }\n if (obj.version != null) {\n w.uint32(24);\n w.uint32(obj.version);\n }\n if (obj.timestamp != null) {\n w.uint32(80);\n w.sint64(obj.timestamp);\n }\n if (obj.meta != null) {\n w.uint32(90);\n w.bytes(obj.meta);\n }\n if (obj.rateLimitProof != null) {\n w.uint32(170);\n RateLimitProof.codec().encode(obj.rateLimitProof, w);\n }\n if (obj.ephemeral != null) {\n w.uint32(248);\n w.bool(obj.ephemeral);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n payload: uint8ArrayAlloc(0),\n contentTopic: ''\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.payload = reader.bytes();\n break;\n }\n case 2: {\n obj.contentTopic = reader.string();\n break;\n }\n case 3: {\n obj.version = reader.uint32();\n break;\n }\n case 10: {\n obj.timestamp = reader.sint64();\n break;\n }\n case 11: {\n obj.meta = reader.bytes();\n break;\n }\n case 21: {\n obj.rateLimitProof = RateLimitProof.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.rateLimitProof\n });\n break;\n }\n case 31: {\n obj.ephemeral = reader.bool();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n WakuMessage.encode = (obj) => {\n return encodeMessage(obj, WakuMessage.codec());\n };\n WakuMessage.decode = (buf, opts) => {\n return decodeMessage(buf, WakuMessage.codec(), opts);\n };\n})(WakuMessage || (WakuMessage = {}));\n//# sourceMappingURL=filter.js.map","/* eslint-disable import/export */\n/* eslint-disable complexity */\n/* eslint-disable @typescript-eslint/no-namespace */\n/* eslint-disable @typescript-eslint/no-unnecessary-boolean-literal-compare */\n/* eslint-disable @typescript-eslint/no-empty-interface */\nimport { decodeMessage, encodeMessage, message } from 'protons-runtime';\nexport var TopicOnlyMessage;\n(function (TopicOnlyMessage) {\n let _codec;\n TopicOnlyMessage.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.contentTopic != null && obj.contentTopic !== '')) {\n w.uint32(18);\n w.string(obj.contentTopic);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n contentTopic: ''\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 2: {\n obj.contentTopic = reader.string();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n TopicOnlyMessage.encode = (obj) => {\n return encodeMessage(obj, TopicOnlyMessage.codec());\n };\n TopicOnlyMessage.decode = (buf, opts) => {\n return decodeMessage(buf, TopicOnlyMessage.codec(), opts);\n };\n})(TopicOnlyMessage || (TopicOnlyMessage = {}));\n//# sourceMappingURL=topic_only_message.js.map","/* eslint-disable import/export */\n/* eslint-disable complexity */\n/* eslint-disable @typescript-eslint/no-namespace */\n/* eslint-disable @typescript-eslint/no-unnecessary-boolean-literal-compare */\n/* eslint-disable @typescript-eslint/no-empty-interface */\nimport { decodeMessage, encodeMessage, enumeration, MaxLengthError, message } from 'protons-runtime';\nimport { alloc as uint8ArrayAlloc } from 'uint8arrays/alloc';\nexport var FilterSubscribeRequest;\n(function (FilterSubscribeRequest) {\n let FilterSubscribeType;\n (function (FilterSubscribeType) {\n FilterSubscribeType[\"SUBSCRIBER_PING\"] = \"SUBSCRIBER_PING\";\n FilterSubscribeType[\"SUBSCRIBE\"] = \"SUBSCRIBE\";\n FilterSubscribeType[\"UNSUBSCRIBE\"] = \"UNSUBSCRIBE\";\n FilterSubscribeType[\"UNSUBSCRIBE_ALL\"] = \"UNSUBSCRIBE_ALL\";\n })(FilterSubscribeType = FilterSubscribeRequest.FilterSubscribeType || (FilterSubscribeRequest.FilterSubscribeType = {}));\n let __FilterSubscribeTypeValues;\n (function (__FilterSubscribeTypeValues) {\n __FilterSubscribeTypeValues[__FilterSubscribeTypeValues[\"SUBSCRIBER_PING\"] = 0] = \"SUBSCRIBER_PING\";\n __FilterSubscribeTypeValues[__FilterSubscribeTypeValues[\"SUBSCRIBE\"] = 1] = \"SUBSCRIBE\";\n __FilterSubscribeTypeValues[__FilterSubscribeTypeValues[\"UNSUBSCRIBE\"] = 2] = \"UNSUBSCRIBE\";\n __FilterSubscribeTypeValues[__FilterSubscribeTypeValues[\"UNSUBSCRIBE_ALL\"] = 3] = \"UNSUBSCRIBE_ALL\";\n })(__FilterSubscribeTypeValues || (__FilterSubscribeTypeValues = {}));\n (function (FilterSubscribeType) {\n FilterSubscribeType.codec = () => {\n return enumeration(__FilterSubscribeTypeValues);\n };\n })(FilterSubscribeType = FilterSubscribeRequest.FilterSubscribeType || (FilterSubscribeRequest.FilterSubscribeType = {}));\n let _codec;\n FilterSubscribeRequest.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.requestId != null && obj.requestId !== '')) {\n w.uint32(10);\n w.string(obj.requestId);\n }\n if (obj.filterSubscribeType != null && __FilterSubscribeTypeValues[obj.filterSubscribeType] !== 0) {\n w.uint32(16);\n FilterSubscribeRequest.FilterSubscribeType.codec().encode(obj.filterSubscribeType, w);\n }\n if (obj.pubsubTopic != null) {\n w.uint32(82);\n w.string(obj.pubsubTopic);\n }\n if (obj.contentTopics != null) {\n for (const value of obj.contentTopics) {\n w.uint32(90);\n w.string(value);\n }\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n requestId: '',\n filterSubscribeType: FilterSubscribeType.SUBSCRIBER_PING,\n contentTopics: []\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.requestId = reader.string();\n break;\n }\n case 2: {\n obj.filterSubscribeType = FilterSubscribeRequest.FilterSubscribeType.codec().decode(reader);\n break;\n }\n case 10: {\n obj.pubsubTopic = reader.string();\n break;\n }\n case 11: {\n if (opts.limits?.contentTopics != null && obj.contentTopics.length === opts.limits.contentTopics) {\n throw new MaxLengthError('Decode error - map field \"contentTopics\" had too many elements');\n }\n obj.contentTopics.push(reader.string());\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n FilterSubscribeRequest.encode = (obj) => {\n return encodeMessage(obj, FilterSubscribeRequest.codec());\n };\n FilterSubscribeRequest.decode = (buf, opts) => {\n return decodeMessage(buf, FilterSubscribeRequest.codec(), opts);\n };\n})(FilterSubscribeRequest || (FilterSubscribeRequest = {}));\nexport var FilterSubscribeResponse;\n(function (FilterSubscribeResponse) {\n let _codec;\n FilterSubscribeResponse.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.requestId != null && obj.requestId !== '')) {\n w.uint32(10);\n w.string(obj.requestId);\n }\n if ((obj.statusCode != null && obj.statusCode !== 0)) {\n w.uint32(80);\n w.uint32(obj.statusCode);\n }\n if (obj.statusDesc != null) {\n w.uint32(90);\n w.string(obj.statusDesc);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n requestId: '',\n statusCode: 0\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.requestId = reader.string();\n break;\n }\n case 10: {\n obj.statusCode = reader.uint32();\n break;\n }\n case 11: {\n obj.statusDesc = reader.string();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n FilterSubscribeResponse.encode = (obj) => {\n return encodeMessage(obj, FilterSubscribeResponse.codec());\n };\n FilterSubscribeResponse.decode = (buf, opts) => {\n return decodeMessage(buf, FilterSubscribeResponse.codec(), opts);\n };\n})(FilterSubscribeResponse || (FilterSubscribeResponse = {}));\nexport var MessagePush;\n(function (MessagePush) {\n let _codec;\n MessagePush.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if (obj.wakuMessage != null) {\n w.uint32(10);\n WakuMessage.codec().encode(obj.wakuMessage, w);\n }\n if (obj.pubsubTopic != null) {\n w.uint32(18);\n w.string(obj.pubsubTopic);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {};\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.wakuMessage = WakuMessage.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.wakuMessage\n });\n break;\n }\n case 2: {\n obj.pubsubTopic = reader.string();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n MessagePush.encode = (obj) => {\n return encodeMessage(obj, MessagePush.codec());\n };\n MessagePush.decode = (buf, opts) => {\n return decodeMessage(buf, MessagePush.codec(), opts);\n };\n})(MessagePush || (MessagePush = {}));\nexport var RateLimitProof;\n(function (RateLimitProof) {\n let _codec;\n RateLimitProof.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.proof != null && obj.proof.byteLength > 0)) {\n w.uint32(10);\n w.bytes(obj.proof);\n }\n if ((obj.merkleRoot != null && obj.merkleRoot.byteLength > 0)) {\n w.uint32(18);\n w.bytes(obj.merkleRoot);\n }\n if ((obj.epoch != null && obj.epoch.byteLength > 0)) {\n w.uint32(26);\n w.bytes(obj.epoch);\n }\n if ((obj.shareX != null && obj.shareX.byteLength > 0)) {\n w.uint32(34);\n w.bytes(obj.shareX);\n }\n if ((obj.shareY != null && obj.shareY.byteLength > 0)) {\n w.uint32(42);\n w.bytes(obj.shareY);\n }\n if ((obj.nullifier != null && obj.nullifier.byteLength > 0)) {\n w.uint32(50);\n w.bytes(obj.nullifier);\n }\n if ((obj.rlnIdentifier != null && obj.rlnIdentifier.byteLength > 0)) {\n w.uint32(58);\n w.bytes(obj.rlnIdentifier);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n proof: uint8ArrayAlloc(0),\n merkleRoot: uint8ArrayAlloc(0),\n epoch: uint8ArrayAlloc(0),\n shareX: uint8ArrayAlloc(0),\n shareY: uint8ArrayAlloc(0),\n nullifier: uint8ArrayAlloc(0),\n rlnIdentifier: uint8ArrayAlloc(0)\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.proof = reader.bytes();\n break;\n }\n case 2: {\n obj.merkleRoot = reader.bytes();\n break;\n }\n case 3: {\n obj.epoch = reader.bytes();\n break;\n }\n case 4: {\n obj.shareX = reader.bytes();\n break;\n }\n case 5: {\n obj.shareY = reader.bytes();\n break;\n }\n case 6: {\n obj.nullifier = reader.bytes();\n break;\n }\n case 7: {\n obj.rlnIdentifier = reader.bytes();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n RateLimitProof.encode = (obj) => {\n return encodeMessage(obj, RateLimitProof.codec());\n };\n RateLimitProof.decode = (buf, opts) => {\n return decodeMessage(buf, RateLimitProof.codec(), opts);\n };\n})(RateLimitProof || (RateLimitProof = {}));\nexport var WakuMessage;\n(function (WakuMessage) {\n let _codec;\n WakuMessage.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.payload != null && obj.payload.byteLength > 0)) {\n w.uint32(10);\n w.bytes(obj.payload);\n }\n if ((obj.contentTopic != null && obj.contentTopic !== '')) {\n w.uint32(18);\n w.string(obj.contentTopic);\n }\n if (obj.version != null) {\n w.uint32(24);\n w.uint32(obj.version);\n }\n if (obj.timestamp != null) {\n w.uint32(80);\n w.sint64(obj.timestamp);\n }\n if (obj.meta != null) {\n w.uint32(90);\n w.bytes(obj.meta);\n }\n if (obj.rateLimitProof != null) {\n w.uint32(170);\n RateLimitProof.codec().encode(obj.rateLimitProof, w);\n }\n if (obj.ephemeral != null) {\n w.uint32(248);\n w.bool(obj.ephemeral);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n payload: uint8ArrayAlloc(0),\n contentTopic: ''\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.payload = reader.bytes();\n break;\n }\n case 2: {\n obj.contentTopic = reader.string();\n break;\n }\n case 3: {\n obj.version = reader.uint32();\n break;\n }\n case 10: {\n obj.timestamp = reader.sint64();\n break;\n }\n case 11: {\n obj.meta = reader.bytes();\n break;\n }\n case 21: {\n obj.rateLimitProof = RateLimitProof.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.rateLimitProof\n });\n break;\n }\n case 31: {\n obj.ephemeral = reader.bool();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n WakuMessage.encode = (obj) => {\n return encodeMessage(obj, WakuMessage.codec());\n };\n WakuMessage.decode = (buf, opts) => {\n return decodeMessage(buf, WakuMessage.codec(), opts);\n };\n})(WakuMessage || (WakuMessage = {}));\n//# sourceMappingURL=filter_v2.js.map","/* eslint-disable import/export */\n/* eslint-disable complexity */\n/* eslint-disable @typescript-eslint/no-namespace */\n/* eslint-disable @typescript-eslint/no-unnecessary-boolean-literal-compare */\n/* eslint-disable @typescript-eslint/no-empty-interface */\nimport { decodeMessage, encodeMessage, message } from 'protons-runtime';\nimport { alloc as uint8ArrayAlloc } from 'uint8arrays/alloc';\nexport var PushRequest;\n(function (PushRequest) {\n let _codec;\n PushRequest.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.pubsubTopic != null && obj.pubsubTopic !== '')) {\n w.uint32(10);\n w.string(obj.pubsubTopic);\n }\n if (obj.message != null) {\n w.uint32(18);\n WakuMessage.codec().encode(obj.message, w);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n pubsubTopic: ''\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.pubsubTopic = reader.string();\n break;\n }\n case 2: {\n obj.message = WakuMessage.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.message\n });\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n PushRequest.encode = (obj) => {\n return encodeMessage(obj, PushRequest.codec());\n };\n PushRequest.decode = (buf, opts) => {\n return decodeMessage(buf, PushRequest.codec(), opts);\n };\n})(PushRequest || (PushRequest = {}));\nexport var PushResponse;\n(function (PushResponse) {\n let _codec;\n PushResponse.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.isSuccess != null && obj.isSuccess !== false)) {\n w.uint32(8);\n w.bool(obj.isSuccess);\n }\n if (obj.info != null) {\n w.uint32(18);\n w.string(obj.info);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n isSuccess: false\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.isSuccess = reader.bool();\n break;\n }\n case 2: {\n obj.info = reader.string();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n PushResponse.encode = (obj) => {\n return encodeMessage(obj, PushResponse.codec());\n };\n PushResponse.decode = (buf, opts) => {\n return decodeMessage(buf, PushResponse.codec(), opts);\n };\n})(PushResponse || (PushResponse = {}));\nexport var PushRpc;\n(function (PushRpc) {\n let _codec;\n PushRpc.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.requestId != null && obj.requestId !== '')) {\n w.uint32(10);\n w.string(obj.requestId);\n }\n if (obj.request != null) {\n w.uint32(18);\n PushRequest.codec().encode(obj.request, w);\n }\n if (obj.response != null) {\n w.uint32(26);\n PushResponse.codec().encode(obj.response, w);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n requestId: ''\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.requestId = reader.string();\n break;\n }\n case 2: {\n obj.request = PushRequest.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.request\n });\n break;\n }\n case 3: {\n obj.response = PushResponse.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.response\n });\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n PushRpc.encode = (obj) => {\n return encodeMessage(obj, PushRpc.codec());\n };\n PushRpc.decode = (buf, opts) => {\n return decodeMessage(buf, PushRpc.codec(), opts);\n };\n})(PushRpc || (PushRpc = {}));\nexport var RateLimitProof;\n(function (RateLimitProof) {\n let _codec;\n RateLimitProof.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.proof != null && obj.proof.byteLength > 0)) {\n w.uint32(10);\n w.bytes(obj.proof);\n }\n if ((obj.merkleRoot != null && obj.merkleRoot.byteLength > 0)) {\n w.uint32(18);\n w.bytes(obj.merkleRoot);\n }\n if ((obj.epoch != null && obj.epoch.byteLength > 0)) {\n w.uint32(26);\n w.bytes(obj.epoch);\n }\n if ((obj.shareX != null && obj.shareX.byteLength > 0)) {\n w.uint32(34);\n w.bytes(obj.shareX);\n }\n if ((obj.shareY != null && obj.shareY.byteLength > 0)) {\n w.uint32(42);\n w.bytes(obj.shareY);\n }\n if ((obj.nullifier != null && obj.nullifier.byteLength > 0)) {\n w.uint32(50);\n w.bytes(obj.nullifier);\n }\n if ((obj.rlnIdentifier != null && obj.rlnIdentifier.byteLength > 0)) {\n w.uint32(58);\n w.bytes(obj.rlnIdentifier);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n proof: uint8ArrayAlloc(0),\n merkleRoot: uint8ArrayAlloc(0),\n epoch: uint8ArrayAlloc(0),\n shareX: uint8ArrayAlloc(0),\n shareY: uint8ArrayAlloc(0),\n nullifier: uint8ArrayAlloc(0),\n rlnIdentifier: uint8ArrayAlloc(0)\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.proof = reader.bytes();\n break;\n }\n case 2: {\n obj.merkleRoot = reader.bytes();\n break;\n }\n case 3: {\n obj.epoch = reader.bytes();\n break;\n }\n case 4: {\n obj.shareX = reader.bytes();\n break;\n }\n case 5: {\n obj.shareY = reader.bytes();\n break;\n }\n case 6: {\n obj.nullifier = reader.bytes();\n break;\n }\n case 7: {\n obj.rlnIdentifier = reader.bytes();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n RateLimitProof.encode = (obj) => {\n return encodeMessage(obj, RateLimitProof.codec());\n };\n RateLimitProof.decode = (buf, opts) => {\n return decodeMessage(buf, RateLimitProof.codec(), opts);\n };\n})(RateLimitProof || (RateLimitProof = {}));\nexport var WakuMessage;\n(function (WakuMessage) {\n let _codec;\n WakuMessage.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.payload != null && obj.payload.byteLength > 0)) {\n w.uint32(10);\n w.bytes(obj.payload);\n }\n if ((obj.contentTopic != null && obj.contentTopic !== '')) {\n w.uint32(18);\n w.string(obj.contentTopic);\n }\n if (obj.version != null) {\n w.uint32(24);\n w.uint32(obj.version);\n }\n if (obj.timestamp != null) {\n w.uint32(80);\n w.sint64(obj.timestamp);\n }\n if (obj.meta != null) {\n w.uint32(90);\n w.bytes(obj.meta);\n }\n if (obj.rateLimitProof != null) {\n w.uint32(170);\n RateLimitProof.codec().encode(obj.rateLimitProof, w);\n }\n if (obj.ephemeral != null) {\n w.uint32(248);\n w.bool(obj.ephemeral);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n payload: uint8ArrayAlloc(0),\n contentTopic: ''\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.payload = reader.bytes();\n break;\n }\n case 2: {\n obj.contentTopic = reader.string();\n break;\n }\n case 3: {\n obj.version = reader.uint32();\n break;\n }\n case 10: {\n obj.timestamp = reader.sint64();\n break;\n }\n case 11: {\n obj.meta = reader.bytes();\n break;\n }\n case 21: {\n obj.rateLimitProof = RateLimitProof.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.rateLimitProof\n });\n break;\n }\n case 31: {\n obj.ephemeral = reader.bool();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n WakuMessage.encode = (obj) => {\n return encodeMessage(obj, WakuMessage.codec());\n };\n WakuMessage.decode = (buf, opts) => {\n return decodeMessage(buf, WakuMessage.codec(), opts);\n };\n})(WakuMessage || (WakuMessage = {}));\n//# sourceMappingURL=light_push.js.map","/* eslint-disable import/export */\n/* eslint-disable complexity */\n/* eslint-disable @typescript-eslint/no-namespace */\n/* eslint-disable @typescript-eslint/no-unnecessary-boolean-literal-compare */\n/* eslint-disable @typescript-eslint/no-empty-interface */\nimport { decodeMessage, encodeMessage, MaxLengthError, message } from 'protons-runtime';\nimport { alloc as uint8ArrayAlloc } from 'uint8arrays/alloc';\nexport var WakuMessageKeyValue;\n(function (WakuMessageKeyValue) {\n let _codec;\n WakuMessageKeyValue.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if (obj.messageHash != null) {\n w.uint32(10);\n w.bytes(obj.messageHash);\n }\n if (obj.message != null) {\n w.uint32(18);\n WakuMessage.codec().encode(obj.message, w);\n }\n if (obj.pubsubTopic != null) {\n w.uint32(26);\n w.string(obj.pubsubTopic);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {};\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.messageHash = reader.bytes();\n break;\n }\n case 2: {\n obj.message = WakuMessage.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.message\n });\n break;\n }\n case 3: {\n obj.pubsubTopic = reader.string();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n WakuMessageKeyValue.encode = (obj) => {\n return encodeMessage(obj, WakuMessageKeyValue.codec());\n };\n WakuMessageKeyValue.decode = (buf, opts) => {\n return decodeMessage(buf, WakuMessageKeyValue.codec(), opts);\n };\n})(WakuMessageKeyValue || (WakuMessageKeyValue = {}));\nexport var StoreQueryRequest;\n(function (StoreQueryRequest) {\n let _codec;\n StoreQueryRequest.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.requestId != null && obj.requestId !== '')) {\n w.uint32(10);\n w.string(obj.requestId);\n }\n if ((obj.includeData != null && obj.includeData !== false)) {\n w.uint32(16);\n w.bool(obj.includeData);\n }\n if (obj.pubsubTopic != null) {\n w.uint32(82);\n w.string(obj.pubsubTopic);\n }\n if (obj.contentTopics != null) {\n for (const value of obj.contentTopics) {\n w.uint32(90);\n w.string(value);\n }\n }\n if (obj.timeStart != null) {\n w.uint32(96);\n w.sint64(obj.timeStart);\n }\n if (obj.timeEnd != null) {\n w.uint32(104);\n w.sint64(obj.timeEnd);\n }\n if (obj.messageHashes != null) {\n for (const value of obj.messageHashes) {\n w.uint32(162);\n w.bytes(value);\n }\n }\n if (obj.paginationCursor != null) {\n w.uint32(410);\n w.bytes(obj.paginationCursor);\n }\n if ((obj.paginationForward != null && obj.paginationForward !== false)) {\n w.uint32(416);\n w.bool(obj.paginationForward);\n }\n if (obj.paginationLimit != null) {\n w.uint32(424);\n w.uint64(obj.paginationLimit);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n requestId: '',\n includeData: false,\n contentTopics: [],\n messageHashes: [],\n paginationForward: false\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.requestId = reader.string();\n break;\n }\n case 2: {\n obj.includeData = reader.bool();\n break;\n }\n case 10: {\n obj.pubsubTopic = reader.string();\n break;\n }\n case 11: {\n if (opts.limits?.contentTopics != null && obj.contentTopics.length === opts.limits.contentTopics) {\n throw new MaxLengthError('Decode error - map field \"contentTopics\" had too many elements');\n }\n obj.contentTopics.push(reader.string());\n break;\n }\n case 12: {\n obj.timeStart = reader.sint64();\n break;\n }\n case 13: {\n obj.timeEnd = reader.sint64();\n break;\n }\n case 20: {\n if (opts.limits?.messageHashes != null && obj.messageHashes.length === opts.limits.messageHashes) {\n throw new MaxLengthError('Decode error - map field \"messageHashes\" had too many elements');\n }\n obj.messageHashes.push(reader.bytes());\n break;\n }\n case 51: {\n obj.paginationCursor = reader.bytes();\n break;\n }\n case 52: {\n obj.paginationForward = reader.bool();\n break;\n }\n case 53: {\n obj.paginationLimit = reader.uint64();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n StoreQueryRequest.encode = (obj) => {\n return encodeMessage(obj, StoreQueryRequest.codec());\n };\n StoreQueryRequest.decode = (buf, opts) => {\n return decodeMessage(buf, StoreQueryRequest.codec(), opts);\n };\n})(StoreQueryRequest || (StoreQueryRequest = {}));\nexport var StoreQueryResponse;\n(function (StoreQueryResponse) {\n let _codec;\n StoreQueryResponse.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.requestId != null && obj.requestId !== '')) {\n w.uint32(10);\n w.string(obj.requestId);\n }\n if (obj.statusCode != null) {\n w.uint32(80);\n w.uint32(obj.statusCode);\n }\n if (obj.statusDesc != null) {\n w.uint32(90);\n w.string(obj.statusDesc);\n }\n if (obj.messages != null) {\n for (const value of obj.messages) {\n w.uint32(162);\n WakuMessageKeyValue.codec().encode(value, w);\n }\n }\n if (obj.paginationCursor != null) {\n w.uint32(410);\n w.bytes(obj.paginationCursor);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n requestId: '',\n messages: []\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.requestId = reader.string();\n break;\n }\n case 10: {\n obj.statusCode = reader.uint32();\n break;\n }\n case 11: {\n obj.statusDesc = reader.string();\n break;\n }\n case 20: {\n if (opts.limits?.messages != null && obj.messages.length === opts.limits.messages) {\n throw new MaxLengthError('Decode error - map field \"messages\" had too many elements');\n }\n obj.messages.push(WakuMessageKeyValue.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.messages$\n }));\n break;\n }\n case 51: {\n obj.paginationCursor = reader.bytes();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n StoreQueryResponse.encode = (obj) => {\n return encodeMessage(obj, StoreQueryResponse.codec());\n };\n StoreQueryResponse.decode = (buf, opts) => {\n return decodeMessage(buf, StoreQueryResponse.codec(), opts);\n };\n})(StoreQueryResponse || (StoreQueryResponse = {}));\nexport var RateLimitProof;\n(function (RateLimitProof) {\n let _codec;\n RateLimitProof.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.proof != null && obj.proof.byteLength > 0)) {\n w.uint32(10);\n w.bytes(obj.proof);\n }\n if ((obj.merkleRoot != null && obj.merkleRoot.byteLength > 0)) {\n w.uint32(18);\n w.bytes(obj.merkleRoot);\n }\n if ((obj.epoch != null && obj.epoch.byteLength > 0)) {\n w.uint32(26);\n w.bytes(obj.epoch);\n }\n if ((obj.shareX != null && obj.shareX.byteLength > 0)) {\n w.uint32(34);\n w.bytes(obj.shareX);\n }\n if ((obj.shareY != null && obj.shareY.byteLength > 0)) {\n w.uint32(42);\n w.bytes(obj.shareY);\n }\n if ((obj.nullifier != null && obj.nullifier.byteLength > 0)) {\n w.uint32(50);\n w.bytes(obj.nullifier);\n }\n if ((obj.rlnIdentifier != null && obj.rlnIdentifier.byteLength > 0)) {\n w.uint32(58);\n w.bytes(obj.rlnIdentifier);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n proof: uint8ArrayAlloc(0),\n merkleRoot: uint8ArrayAlloc(0),\n epoch: uint8ArrayAlloc(0),\n shareX: uint8ArrayAlloc(0),\n shareY: uint8ArrayAlloc(0),\n nullifier: uint8ArrayAlloc(0),\n rlnIdentifier: uint8ArrayAlloc(0)\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.proof = reader.bytes();\n break;\n }\n case 2: {\n obj.merkleRoot = reader.bytes();\n break;\n }\n case 3: {\n obj.epoch = reader.bytes();\n break;\n }\n case 4: {\n obj.shareX = reader.bytes();\n break;\n }\n case 5: {\n obj.shareY = reader.bytes();\n break;\n }\n case 6: {\n obj.nullifier = reader.bytes();\n break;\n }\n case 7: {\n obj.rlnIdentifier = reader.bytes();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n RateLimitProof.encode = (obj) => {\n return encodeMessage(obj, RateLimitProof.codec());\n };\n RateLimitProof.decode = (buf, opts) => {\n return decodeMessage(buf, RateLimitProof.codec(), opts);\n };\n})(RateLimitProof || (RateLimitProof = {}));\nexport var WakuMessage;\n(function (WakuMessage) {\n let _codec;\n WakuMessage.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.payload != null && obj.payload.byteLength > 0)) {\n w.uint32(10);\n w.bytes(obj.payload);\n }\n if ((obj.contentTopic != null && obj.contentTopic !== '')) {\n w.uint32(18);\n w.string(obj.contentTopic);\n }\n if (obj.version != null) {\n w.uint32(24);\n w.uint32(obj.version);\n }\n if (obj.timestamp != null) {\n w.uint32(80);\n w.sint64(obj.timestamp);\n }\n if (obj.meta != null) {\n w.uint32(90);\n w.bytes(obj.meta);\n }\n if (obj.rateLimitProof != null) {\n w.uint32(170);\n RateLimitProof.codec().encode(obj.rateLimitProof, w);\n }\n if (obj.ephemeral != null) {\n w.uint32(248);\n w.bool(obj.ephemeral);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n payload: uint8ArrayAlloc(0),\n contentTopic: ''\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.payload = reader.bytes();\n break;\n }\n case 2: {\n obj.contentTopic = reader.string();\n break;\n }\n case 3: {\n obj.version = reader.uint32();\n break;\n }\n case 10: {\n obj.timestamp = reader.sint64();\n break;\n }\n case 11: {\n obj.meta = reader.bytes();\n break;\n }\n case 21: {\n obj.rateLimitProof = RateLimitProof.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.rateLimitProof\n });\n break;\n }\n case 31: {\n obj.ephemeral = reader.bool();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n WakuMessage.encode = (obj) => {\n return encodeMessage(obj, WakuMessage.codec());\n };\n WakuMessage.decode = (buf, opts) => {\n return decodeMessage(buf, WakuMessage.codec(), opts);\n };\n})(WakuMessage || (WakuMessage = {}));\n//# sourceMappingURL=store_v3.js.map","/* eslint-disable import/export */\n/* eslint-disable complexity */\n/* eslint-disable @typescript-eslint/no-namespace */\n/* eslint-disable @typescript-eslint/no-unnecessary-boolean-literal-compare */\n/* eslint-disable @typescript-eslint/no-empty-interface */\nimport { decodeMessage, encodeMessage, MaxLengthError, message } from 'protons-runtime';\nexport var PeerInfo;\n(function (PeerInfo) {\n let _codec;\n PeerInfo.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if (obj.enr != null) {\n w.uint32(10);\n w.bytes(obj.enr);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {};\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.enr = reader.bytes();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n PeerInfo.encode = (obj) => {\n return encodeMessage(obj, PeerInfo.codec());\n };\n PeerInfo.decode = (buf, opts) => {\n return decodeMessage(buf, PeerInfo.codec(), opts);\n };\n})(PeerInfo || (PeerInfo = {}));\nexport var PeerExchangeQuery;\n(function (PeerExchangeQuery) {\n let _codec;\n PeerExchangeQuery.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if (obj.numPeers != null) {\n w.uint32(8);\n w.uint64(obj.numPeers);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {};\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.numPeers = reader.uint64();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n PeerExchangeQuery.encode = (obj) => {\n return encodeMessage(obj, PeerExchangeQuery.codec());\n };\n PeerExchangeQuery.decode = (buf, opts) => {\n return decodeMessage(buf, PeerExchangeQuery.codec(), opts);\n };\n})(PeerExchangeQuery || (PeerExchangeQuery = {}));\nexport var PeerExchangeResponse;\n(function (PeerExchangeResponse) {\n let _codec;\n PeerExchangeResponse.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if (obj.peerInfos != null) {\n for (const value of obj.peerInfos) {\n w.uint32(10);\n PeerInfo.codec().encode(value, w);\n }\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n peerInfos: []\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n if (opts.limits?.peerInfos != null && obj.peerInfos.length === opts.limits.peerInfos) {\n throw new MaxLengthError('Decode error - map field \"peerInfos\" had too many elements');\n }\n obj.peerInfos.push(PeerInfo.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.peerInfos$\n }));\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n PeerExchangeResponse.encode = (obj) => {\n return encodeMessage(obj, PeerExchangeResponse.codec());\n };\n PeerExchangeResponse.decode = (buf, opts) => {\n return decodeMessage(buf, PeerExchangeResponse.codec(), opts);\n };\n})(PeerExchangeResponse || (PeerExchangeResponse = {}));\nexport var PeerExchangeRPC;\n(function (PeerExchangeRPC) {\n let _codec;\n PeerExchangeRPC.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if (obj.query != null) {\n w.uint32(10);\n PeerExchangeQuery.codec().encode(obj.query, w);\n }\n if (obj.response != null) {\n w.uint32(18);\n PeerExchangeResponse.codec().encode(obj.response, w);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {};\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.query = PeerExchangeQuery.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.query\n });\n break;\n }\n case 2: {\n obj.response = PeerExchangeResponse.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.response\n });\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n PeerExchangeRPC.encode = (obj) => {\n return encodeMessage(obj, PeerExchangeRPC.codec());\n };\n PeerExchangeRPC.decode = (buf, opts) => {\n return decodeMessage(buf, PeerExchangeRPC.codec(), opts);\n };\n})(PeerExchangeRPC || (PeerExchangeRPC = {}));\n//# sourceMappingURL=peer_exchange.js.map","/* eslint-disable import/export */\n/* eslint-disable complexity */\n/* eslint-disable @typescript-eslint/no-namespace */\n/* eslint-disable @typescript-eslint/no-unnecessary-boolean-literal-compare */\n/* eslint-disable @typescript-eslint/no-empty-interface */\nimport { decodeMessage, encodeMessage, MaxLengthError, message } from 'protons-runtime';\nexport var WakuMetadataRequest;\n(function (WakuMetadataRequest) {\n let _codec;\n WakuMetadataRequest.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if (obj.clusterId != null) {\n w.uint32(8);\n w.uint32(obj.clusterId);\n }\n if (obj.shards != null) {\n for (const value of obj.shards) {\n w.uint32(16);\n w.uint32(value);\n }\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n shards: []\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.clusterId = reader.uint32();\n break;\n }\n case 2: {\n if (opts.limits?.shards != null && obj.shards.length === opts.limits.shards) {\n throw new MaxLengthError('Decode error - map field \"shards\" had too many elements');\n }\n obj.shards.push(reader.uint32());\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n WakuMetadataRequest.encode = (obj) => {\n return encodeMessage(obj, WakuMetadataRequest.codec());\n };\n WakuMetadataRequest.decode = (buf, opts) => {\n return decodeMessage(buf, WakuMetadataRequest.codec(), opts);\n };\n})(WakuMetadataRequest || (WakuMetadataRequest = {}));\nexport var WakuMetadataResponse;\n(function (WakuMetadataResponse) {\n let _codec;\n WakuMetadataResponse.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if (obj.clusterId != null) {\n w.uint32(8);\n w.uint32(obj.clusterId);\n }\n if (obj.shards != null) {\n for (const value of obj.shards) {\n w.uint32(16);\n w.uint32(value);\n }\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n shards: []\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.clusterId = reader.uint32();\n break;\n }\n case 2: {\n if (opts.limits?.shards != null && obj.shards.length === opts.limits.shards) {\n throw new MaxLengthError('Decode error - map field \"shards\" had too many elements');\n }\n obj.shards.push(reader.uint32());\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n WakuMetadataResponse.encode = (obj) => {\n return encodeMessage(obj, WakuMetadataResponse.codec());\n };\n WakuMetadataResponse.decode = (buf, opts) => {\n return decodeMessage(buf, WakuMetadataResponse.codec(), opts);\n };\n})(WakuMetadataResponse || (WakuMetadataResponse = {}));\n//# sourceMappingURL=metadata.js.map","import { createCodec, CODEC_TYPES } from '../codec.js';\nexport function enumeration(v) {\n function findValue(val) {\n // Use the reverse mapping to look up the enum key for the stored value\n // https://www.typescriptlang.org/docs/handbook/enums.html#reverse-mappings\n if (v[val.toString()] == null) {\n throw new Error('Invalid enum value');\n }\n return v[val];\n }\n const encode = function enumEncode(val, writer) {\n const enumValue = findValue(val);\n writer.int32(enumValue);\n };\n const decode = function enumDecode(reader) {\n const val = reader.int32();\n return findValue(val);\n };\n // @ts-expect-error yeah yeah\n return createCodec('enum', CODEC_TYPES.VARINT, encode, decode);\n}\n//# sourceMappingURL=enum.js.map","import { createCodec, CODEC_TYPES } from '../codec.js';\nexport function message(encode, decode) {\n return createCodec('message', CODEC_TYPES.LENGTH_DELIMITED, encode, decode);\n}\n//# sourceMappingURL=message.js.map","/**\n * @packageDocumentation\n *\n * This module contains serialization/deserialization code used when encoding/decoding protobufs.\n *\n * It should be declared as a dependency of your project:\n *\n * ```console\n * npm i protons-runtime\n * ```\n */\nexport { decodeMessage } from './decode.js';\nexport { encodeMessage } from './encode.js';\nexport { enumeration } from './codecs/enum.js';\nexport { message } from './codecs/message.js';\nexport { createReader as reader } from './utils/reader.js';\nexport { createWriter as writer } from './utils/writer.js';\n/**\n * This will be removed in a future release\n *\n * @deprecated\n */\nexport class CodeError extends Error {\n code;\n constructor(message, code) {\n super(message);\n this.code = code;\n }\n}\n/**\n * Thrown when a repeated field has too many elements\n */\nexport class MaxLengthError extends Error {\n /**\n * This will be removed in a future release\n *\n * @deprecated use the `.name` property instead\n */\n code = 'ERR_MAX_LENGTH';\n name = 'MaxLengthError';\n}\n/**\n * Thrown when a map has too many elements\n */\nexport class MaxSizeError extends Error {\n /**\n * This will be removed in a future release\n *\n * @deprecated use the `.name` property instead\n */\n code = 'ERR_MAX_SIZE';\n name = 'MaxSizeError';\n}\nexport class ParseError extends Error {\n /**\n * This will be removed in a future release\n *\n * @deprecated use the `.name` property instead\n */\n code = 'ERR_PARSE_ERROR';\n name = 'ParseError';\n}\nexport class NoMessagesFoundError extends Error {\n /**\n * This will be removed in a future release\n *\n * @deprecated use the `.name` property instead\n */\n code = 'ERR_NO_MESSAGES_FOUND';\n name = 'NoMessagesFoundError';\n}\n//# sourceMappingURL=index.js.map","export function isDefined(value) {\n return Boolean(value);\n}\n//# sourceMappingURL=is_defined.js.map","export function groupByContentTopic(values) {\n const groupedDecoders = new Map();\n values.forEach((value) => {\n let decs = groupedDecoders.get(value.contentTopic);\n if (!decs) {\n groupedDecoders.set(value.contentTopic, []);\n decs = groupedDecoders.get(value.contentTopic);\n }\n decs.push(value);\n });\n return groupedDecoders;\n}\n//# sourceMappingURL=group_by.js.map","const FRAME_RATE = 60;\n/**\n * Function that transforms IReceiver subscription to iterable stream of data.\n * @param receiver - object that allows to be subscribed to;\n * @param decoder - parameter to be passed to receiver for subscription;\n * @param options - options for receiver for subscription;\n * @param iteratorOptions - optional configuration for iterator;\n * @returns iterator and stop function to terminate it.\n */\nexport async function toAsyncIterator(receiver, decoder, iteratorOptions) {\n const iteratorDelay = iteratorOptions?.iteratorDelay ?? FRAME_RATE;\n const messages = [];\n let unsubscribe;\n unsubscribe = await receiver.subscribeWithUnsubscribe(decoder, (message) => {\n messages.push(message);\n });\n const isWithTimeout = Number.isInteger(iteratorOptions?.timeoutMs);\n const timeoutMs = iteratorOptions?.timeoutMs ?? 0;\n const startTime = Date.now();\n async function* iterator() {\n while (true) {\n if (isWithTimeout && Date.now() - startTime >= timeoutMs) {\n return;\n }\n await wait(iteratorDelay);\n const message = messages.shift();\n if (!unsubscribe && messages.length === 0) {\n return message;\n }\n if (!message && unsubscribe) {\n continue;\n }\n yield message;\n }\n }\n return {\n iterator: iterator(),\n async stop() {\n if (unsubscribe) {\n await unsubscribe();\n unsubscribe = undefined;\n }\n }\n };\n}\nfunction wait(ms) {\n return new Promise((resolve) => {\n setTimeout(resolve, ms);\n });\n}\n//# sourceMappingURL=to_async_iterator.js.map","function number(n) {\n if (!Number.isSafeInteger(n) || n < 0)\n throw new Error(`positive integer expected, not ${n}`);\n}\nfunction bool(b) {\n if (typeof b !== 'boolean')\n throw new Error(`boolean expected, not ${b}`);\n}\n// copied from utils\nexport function isBytes(a) {\n return (a instanceof Uint8Array ||\n (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array'));\n}\nfunction bytes(b, ...lengths) {\n if (!isBytes(b))\n throw new Error('Uint8Array expected');\n if (lengths.length > 0 && !lengths.includes(b.length))\n throw new Error(`Uint8Array expected of length ${lengths}, not of length=${b.length}`);\n}\nfunction hash(h) {\n if (typeof h !== 'function' || typeof h.create !== 'function')\n throw new Error('Hash should be wrapped by utils.wrapConstructor');\n number(h.outputLen);\n number(h.blockLen);\n}\nfunction exists(instance, checkFinished = true) {\n if (instance.destroyed)\n throw new Error('Hash instance has been destroyed');\n if (checkFinished && instance.finished)\n throw new Error('Hash#digest() has already been called');\n}\nfunction output(out, instance) {\n bytes(out);\n const min = instance.outputLen;\n if (out.length < min) {\n throw new Error(`digestInto() expects output buffer of length at least ${min}`);\n }\n}\nexport { number, bool, bytes, hash, exists, output };\nconst assert = { number, bool, bytes, hash, exists, output };\nexport default assert;\n//# sourceMappingURL=_assert.js.map","export const crypto = typeof globalThis === 'object' && 'crypto' in globalThis ? globalThis.crypto : undefined;\n//# sourceMappingURL=crypto.js.map","/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// We use WebCrypto aka globalThis.crypto, which exists in browsers and node.js 16+.\n// node.js versions earlier than v19 don't declare it in global scope.\n// For node.js, package.json#exports field mapping rewrites import\n// from `crypto` to `cryptoNode`, which imports native module.\n// Makes the utils un-importable in browsers without a bundler.\n// Once node.js 18 is deprecated (2025-04-30), we can just drop the import.\nimport { crypto } from '@noble/hashes/crypto';\nimport { bytes as abytes } from './_assert.js';\n// export { isBytes } from './_assert.js';\n// We can't reuse isBytes from _assert, because somehow this causes huge perf issues\nexport function isBytes(a) {\n return (a instanceof Uint8Array ||\n (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array'));\n}\n// Cast array to different type\nexport const u8 = (arr) => new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\nexport const u32 = (arr) => new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n// Cast array to view\nexport const createView = (arr) => new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n// The rotate right (circular right shift) operation for uint32\nexport const rotr = (word, shift) => (word << (32 - shift)) | (word >>> shift);\n// The rotate left (circular left shift) operation for uint32\nexport const rotl = (word, shift) => (word << shift) | ((word >>> (32 - shift)) >>> 0);\nexport const isLE = new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44;\n// The byte swap operation for uint32\nexport const byteSwap = (word) => ((word << 24) & 0xff000000) |\n ((word << 8) & 0xff0000) |\n ((word >>> 8) & 0xff00) |\n ((word >>> 24) & 0xff);\n// Conditionally byte swap if on a big-endian platform\nexport const byteSwapIfBE = isLE ? (n) => n : (n) => byteSwap(n);\n// In place byte swap for Uint32Array\nexport function byteSwap32(arr) {\n for (let i = 0; i < arr.length; i++) {\n arr[i] = byteSwap(arr[i]);\n }\n}\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'));\n/**\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes) {\n abytes(bytes);\n // pre-caching improves the speed 6x\n let hex = '';\n for (let i = 0; i < bytes.length; i++) {\n hex += hexes[bytes[i]];\n }\n return hex;\n}\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, _A: 65, _F: 70, _a: 97, _f: 102 };\nfunction asciiToBase16(char) {\n if (char >= asciis._0 && char <= asciis._9)\n return char - asciis._0;\n if (char >= asciis._A && char <= asciis._F)\n return char - (asciis._A - 10);\n if (char >= asciis._a && char <= asciis._f)\n return char - (asciis._a - 10);\n return;\n}\n/**\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex) {\n if (typeof hex !== 'string')\n throw new Error('hex string expected, got ' + typeof hex);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2)\n throw new Error('padded hex string expected, got unpadded hex of length ' + hl);\n const array = new Uint8Array(al);\n for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n const n1 = asciiToBase16(hex.charCodeAt(hi));\n const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n if (n1 === undefined || n2 === undefined) {\n const char = hex[hi] + hex[hi + 1];\n throw new Error('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n }\n array[ai] = n1 * 16 + n2;\n }\n return array;\n}\n// There is no setImmediate in browser and setTimeout is slow.\n// call of async fn will return Promise, which will be fullfiled only on\n// next scheduler queue processing step and this is exactly what we need.\nexport const nextTick = async () => { };\n// Returns control to thread each 'tick' ms to avoid blocking\nexport async function asyncLoop(iters, tick, cb) {\n let ts = Date.now();\n for (let i = 0; i < iters; i++) {\n cb(i);\n // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n const diff = Date.now() - ts;\n if (diff >= 0 && diff < tick)\n continue;\n await nextTick();\n ts += diff;\n }\n}\n/**\n * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nexport function utf8ToBytes(str) {\n if (typeof str !== 'string')\n throw new Error(`utf8ToBytes expected string, got ${typeof str}`);\n return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n/**\n * Normalizes (non-hex) string or Uint8Array to Uint8Array.\n * Warning: when Uint8Array is passed, it would NOT get copied.\n * Keep in mind for future mutable operations.\n */\nexport function toBytes(data) {\n if (typeof data === 'string')\n data = utf8ToBytes(data);\n abytes(data);\n return data;\n}\n/**\n * Copies several Uint8Arrays into one.\n */\nexport function concatBytes(...arrays) {\n let sum = 0;\n for (let i = 0; i < arrays.length; i++) {\n const a = arrays[i];\n abytes(a);\n sum += a.length;\n }\n const res = new Uint8Array(sum);\n for (let i = 0, pad = 0; i < arrays.length; i++) {\n const a = arrays[i];\n res.set(a, pad);\n pad += a.length;\n }\n return res;\n}\n// For runtime check if class implements interface\nexport class Hash {\n // Safe version that clones internal state\n clone() {\n return this._cloneInto();\n }\n}\nconst toStr = {}.toString;\nexport function checkOpts(defaults, opts) {\n if (opts !== undefined && toStr.call(opts) !== '[object Object]')\n throw new Error('Options should be object or undefined');\n const merged = Object.assign(defaults, opts);\n return merged;\n}\nexport function wrapConstructor(hashCons) {\n const hashC = (msg) => hashCons().update(toBytes(msg)).digest();\n const tmp = hashCons();\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = () => hashCons();\n return hashC;\n}\nexport function wrapConstructorWithOpts(hashCons) {\n const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();\n const tmp = hashCons({});\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts) => hashCons(opts);\n return hashC;\n}\nexport function wrapXOFConstructorWithOpts(hashCons) {\n const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();\n const tmp = hashCons({});\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts) => hashCons(opts);\n return hashC;\n}\n/**\n * Secure PRNG. Uses `crypto.getRandomValues`, which defers to OS.\n */\nexport function randomBytes(bytesLength = 32) {\n if (crypto && typeof crypto.getRandomValues === 'function') {\n return crypto.getRandomValues(new Uint8Array(bytesLength));\n }\n throw new Error('crypto.getRandomValues must be defined');\n}\n//# sourceMappingURL=utils.js.map","import { exists, output } from './_assert.js';\nimport { Hash, createView, toBytes } from './utils.js';\n// Polyfill for Safari 14\nfunction setBigUint64(view, byteOffset, value, isLE) {\n if (typeof view.setBigUint64 === 'function')\n return view.setBigUint64(byteOffset, value, isLE);\n const _32n = BigInt(32);\n const _u32_max = BigInt(0xffffffff);\n const wh = Number((value >> _32n) & _u32_max);\n const wl = Number(value & _u32_max);\n const h = isLE ? 4 : 0;\n const l = isLE ? 0 : 4;\n view.setUint32(byteOffset + h, wh, isLE);\n view.setUint32(byteOffset + l, wl, isLE);\n}\n// Choice: a ? b : c\nexport const Chi = (a, b, c) => (a & b) ^ (~a & c);\n// Majority function, true if any two inpust is true\nexport const Maj = (a, b, c) => (a & b) ^ (a & c) ^ (b & c);\n/**\n * Merkle-Damgard hash construction base class.\n * Could be used to create MD5, RIPEMD, SHA1, SHA2.\n */\nexport class HashMD extends Hash {\n constructor(blockLen, outputLen, padOffset, isLE) {\n super();\n this.blockLen = blockLen;\n this.outputLen = outputLen;\n this.padOffset = padOffset;\n this.isLE = isLE;\n this.finished = false;\n this.length = 0;\n this.pos = 0;\n this.destroyed = false;\n this.buffer = new Uint8Array(blockLen);\n this.view = createView(this.buffer);\n }\n update(data) {\n exists(this);\n const { view, buffer, blockLen } = this;\n data = toBytes(data);\n const len = data.length;\n for (let pos = 0; pos < len;) {\n const take = Math.min(blockLen - this.pos, len - pos);\n // Fast path: we have at least one block in input, cast it to view and process\n if (take === blockLen) {\n const dataView = createView(data);\n for (; blockLen <= len - pos; pos += blockLen)\n this.process(dataView, pos);\n continue;\n }\n buffer.set(data.subarray(pos, pos + take), this.pos);\n this.pos += take;\n pos += take;\n if (this.pos === blockLen) {\n this.process(view, 0);\n this.pos = 0;\n }\n }\n this.length += data.length;\n this.roundClean();\n return this;\n }\n digestInto(out) {\n exists(this);\n output(out, this);\n this.finished = true;\n // Padding\n // We can avoid allocation of buffer for padding completely if it\n // was previously not allocated here. But it won't change performance.\n const { buffer, view, blockLen, isLE } = this;\n let { pos } = this;\n // append the bit '1' to the message\n buffer[pos++] = 0b10000000;\n this.buffer.subarray(pos).fill(0);\n // we have less than padOffset left in buffer, so we cannot put length in\n // current block, need process it and pad again\n if (this.padOffset > blockLen - pos) {\n this.process(view, 0);\n pos = 0;\n }\n // Pad until full block byte with zeros\n for (let i = pos; i < blockLen; i++)\n buffer[i] = 0;\n // Note: sha512 requires length to be 128bit integer, but length in JS will overflow before that\n // You need to write around 2 exabytes (u64_max / 8 / (1024**6)) for this to happen.\n // So we just write lowest 64 bits of that value.\n setBigUint64(view, blockLen - 8, BigInt(this.length * 8), isLE);\n this.process(view, 0);\n const oview = createView(out);\n const len = this.outputLen;\n // NOTE: we do division by 4 later, which should be fused in single op with modulo by JIT\n if (len % 4)\n throw new Error('_sha2: outputLen should be aligned to 32bit');\n const outLen = len / 4;\n const state = this.get();\n if (outLen > state.length)\n throw new Error('_sha2: outputLen bigger than state');\n for (let i = 0; i < outLen; i++)\n oview.setUint32(4 * i, state[i], isLE);\n }\n digest() {\n const { buffer, outputLen } = this;\n this.digestInto(buffer);\n const res = buffer.slice(0, outputLen);\n this.destroy();\n return res;\n }\n _cloneInto(to) {\n to || (to = new this.constructor());\n to.set(...this.get());\n const { blockLen, buffer, length, finished, destroyed, pos } = this;\n to.length = length;\n to.pos = pos;\n to.finished = finished;\n to.destroyed = destroyed;\n if (length % blockLen)\n to.buffer.set(buffer);\n return to;\n }\n}\n//# sourceMappingURL=_md.js.map","import { HashMD, Chi, Maj } from './_md.js';\nimport { rotr, wrapConstructor } from './utils.js';\n// SHA2-256 need to try 2^128 hashes to execute birthday attack.\n// BTC network is doing 2^67 hashes/sec as per early 2023.\n// Round constants:\n// first 32 bits of the fractional parts of the cube roots of the first 64 primes 2..311)\n// prettier-ignore\nconst SHA256_K = /* @__PURE__ */ new Uint32Array([\n 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2\n]);\n// Initial state:\n// first 32 bits of the fractional parts of the square roots of the first 8 primes 2..19\n// prettier-ignore\nconst SHA256_IV = /* @__PURE__ */ new Uint32Array([\n 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19\n]);\n// Temporary buffer, not used to store anything between runs\n// Named this way because it matches specification.\nconst SHA256_W = /* @__PURE__ */ new Uint32Array(64);\nclass SHA256 extends HashMD {\n constructor() {\n super(64, 32, 8, false);\n // We cannot use array here since array allows indexing by variable\n // which means optimizer/compiler cannot use registers.\n this.A = SHA256_IV[0] | 0;\n this.B = SHA256_IV[1] | 0;\n this.C = SHA256_IV[2] | 0;\n this.D = SHA256_IV[3] | 0;\n this.E = SHA256_IV[4] | 0;\n this.F = SHA256_IV[5] | 0;\n this.G = SHA256_IV[6] | 0;\n this.H = SHA256_IV[7] | 0;\n }\n get() {\n const { A, B, C, D, E, F, G, H } = this;\n return [A, B, C, D, E, F, G, H];\n }\n // prettier-ignore\n set(A, B, C, D, E, F, G, H) {\n this.A = A | 0;\n this.B = B | 0;\n this.C = C | 0;\n this.D = D | 0;\n this.E = E | 0;\n this.F = F | 0;\n this.G = G | 0;\n this.H = H | 0;\n }\n process(view, offset) {\n // Extend the first 16 words into the remaining 48 words w[16..63] of the message schedule array\n for (let i = 0; i < 16; i++, offset += 4)\n SHA256_W[i] = view.getUint32(offset, false);\n for (let i = 16; i < 64; i++) {\n const W15 = SHA256_W[i - 15];\n const W2 = SHA256_W[i - 2];\n const s0 = rotr(W15, 7) ^ rotr(W15, 18) ^ (W15 >>> 3);\n const s1 = rotr(W2, 17) ^ rotr(W2, 19) ^ (W2 >>> 10);\n SHA256_W[i] = (s1 + SHA256_W[i - 7] + s0 + SHA256_W[i - 16]) | 0;\n }\n // Compression function main loop, 64 rounds\n let { A, B, C, D, E, F, G, H } = this;\n for (let i = 0; i < 64; i++) {\n const sigma1 = rotr(E, 6) ^ rotr(E, 11) ^ rotr(E, 25);\n const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;\n const sigma0 = rotr(A, 2) ^ rotr(A, 13) ^ rotr(A, 22);\n const T2 = (sigma0 + Maj(A, B, C)) | 0;\n H = G;\n G = F;\n F = E;\n E = (D + T1) | 0;\n D = C;\n C = B;\n B = A;\n A = (T1 + T2) | 0;\n }\n // Add the compressed chunk to the current hash value\n A = (A + this.A) | 0;\n B = (B + this.B) | 0;\n C = (C + this.C) | 0;\n D = (D + this.D) | 0;\n E = (E + this.E) | 0;\n F = (F + this.F) | 0;\n G = (G + this.G) | 0;\n H = (H + this.H) | 0;\n this.set(A, B, C, D, E, F, G, H);\n }\n roundClean() {\n SHA256_W.fill(0);\n }\n destroy() {\n this.set(0, 0, 0, 0, 0, 0, 0, 0);\n this.buffer.fill(0);\n }\n}\n// Constants from https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf\nclass SHA224 extends SHA256 {\n constructor() {\n super();\n this.A = 0xc1059ed8 | 0;\n this.B = 0x367cd507 | 0;\n this.C = 0x3070dd17 | 0;\n this.D = 0xf70e5939 | 0;\n this.E = 0xffc00b31 | 0;\n this.F = 0x68581511 | 0;\n this.G = 0x64f98fa7 | 0;\n this.H = 0xbefa4fa4 | 0;\n this.outputLen = 28;\n }\n}\n/**\n * SHA2-256 hash function\n * @param message - data that would be hashed\n */\nexport const sha256 = /* @__PURE__ */ wrapConstructor(() => new SHA256());\nexport const sha224 = /* @__PURE__ */ wrapConstructor(() => new SHA224());\n//# sourceMappingURL=sha256.js.map","export var Protocols;\n(function (Protocols) {\n Protocols[\"Relay\"] = \"relay\";\n Protocols[\"Store\"] = \"store\";\n Protocols[\"LightPush\"] = \"lightpush\";\n Protocols[\"Filter\"] = \"filter\";\n})(Protocols || (Protocols = {}));\nexport var ProtocolError;\n(function (ProtocolError) {\n /** Could not determine the origin of the fault. Best to check connectivity and try again */\n ProtocolError[\"GENERIC_FAIL\"] = \"Generic error\";\n /**\n * Failure to protobuf encode the message. This is not recoverable and needs\n * further investigation.\n */\n ProtocolError[\"ENCODE_FAILED\"] = \"Failed to encode\";\n /**\n * Failure to protobuf decode the message. May be due to a remote peer issue,\n * ensuring that messages are sent via several peer enable mitigation of this error.\n */\n ProtocolError[\"DECODE_FAILED\"] = \"Failed to decode\";\n /**\n * The message payload is empty, making the message invalid. Ensure that a non-empty\n * payload is set on the outgoing message.\n */\n ProtocolError[\"EMPTY_PAYLOAD\"] = \"Payload is empty\";\n /**\n * The message size is above the maximum message size allowed on the Waku Network.\n * Compressing the message or using an alternative strategy for large messages is recommended.\n */\n ProtocolError[\"SIZE_TOO_BIG\"] = \"Size is too big\";\n /**\n * The PubsubTopic passed to the send function is not configured on the Waku node.\n * Please ensure that the PubsubTopic is used when initializing the Waku node.\n */\n ProtocolError[\"TOPIC_NOT_CONFIGURED\"] = \"Topic not configured\";\n /**\n * The pubsub topic configured on the decoder does not match the pubsub topic setup on the protocol.\n * Ensure that the pubsub topic used for decoder creation is the same as the one used for protocol.\n */\n ProtocolError[\"TOPIC_DECODER_MISMATCH\"] = \"Topic decoder mismatch\";\n /**\n * The topics passed in the decoders do not match each other, or don't exist at all.\n * Ensure that all the pubsub topics used in the decoders are valid and match each other.\n */\n ProtocolError[\"INVALID_DECODER_TOPICS\"] = \"Invalid decoder topics\";\n /**\n * Failure to find a peer with suitable protocols. This may due to a connection issue.\n * Mitigation can be: retrying after a given time period, display connectivity issue\n * to user or listening for `peer:connected:bootstrap` or `peer:connected:peer-exchange`\n * on the connection manager before retrying.\n */\n ProtocolError[\"NO_PEER_AVAILABLE\"] = \"No peer available\";\n /**\n * Failure to find a stream to the peer. This may be because the connection with the peer is not still alive.\n * Mitigation can be: retrying after a given time period, or mitigation for `NO_PEER_AVAILABLE` can be used.\n */\n ProtocolError[\"NO_STREAM_AVAILABLE\"] = \"No stream available\";\n /**\n * The remote peer did not behave as expected. Mitigation for `NO_PEER_AVAILABLE`\n * or `DECODE_FAILED` can be used.\n */\n ProtocolError[\"NO_RESPONSE\"] = \"No response received\";\n /**\n * The remote peer rejected the message. Information provided by the remote peer\n * is logged. Review message validity, or mitigation for `NO_PEER_AVAILABLE`\n * or `DECODE_FAILED` can be used.\n */\n ProtocolError[\"REMOTE_PEER_REJECTED\"] = \"Remote peer rejected\";\n /**\n * The protocol request timed out without a response. This may be due to a connection issue.\n * Mitigation can be: retrying after a given time period\n */\n ProtocolError[\"REQUEST_TIMEOUT\"] = \"Request timeout\";\n /**\n * Missing credentials info message.\n * nwaku: https://github.com/waku-org/nwaku/blob/c3cb06ac6c03f0f382d3941ea53b330f6a8dd127/waku/waku_rln_relay/group_manager/group_manager_base.nim#L186\n */\n ProtocolError[\"RLN_IDENTITY_MISSING\"] = \"Identity credentials are not set\";\n /**\n * Membership index missing info message.\n * nwaku: https://github.com/waku-org/nwaku/blob/c3cb06ac6c03f0f382d3941ea53b330f6a8dd127/waku/waku_rln_relay/group_manager/group_manager_base.nim#L188\n */\n ProtocolError[\"RLN_MEMBERSHIP_INDEX\"] = \"Membership index is not set\";\n /**\n * Message limit is missing.\n * nwaku: https://github.com/waku-org/nwaku/blob/c3cb06ac6c03f0f382d3941ea53b330f6a8dd127/waku/waku_rln_relay/group_manager/group_manager_base.nim#L190\n */\n ProtocolError[\"RLN_LIMIT_MISSING\"] = \"User message limit is not set\";\n /**\n * General proof generation error message.\n * nwaku: https://github.com/waku-org/nwaku/blob/c3cb06ac6c03f0f382d3941ea53b330f6a8dd127/waku/waku_rln_relay/group_manager/group_manager_base.nim#L201C19-L201C42\n */\n ProtocolError[\"RLN_PROOF_GENERATION\"] = \"Proof generation failed\";\n})(ProtocolError || (ProtocolError = {}));\n//# sourceMappingURL=protocols.js.map","export var Tags;\n(function (Tags) {\n Tags[\"BOOTSTRAP\"] = \"bootstrap\";\n Tags[\"PEER_EXCHANGE\"] = \"peer-exchange\";\n Tags[\"LOCAL\"] = \"local-peer-cache\";\n})(Tags || (Tags = {}));\nexport var EPeersByDiscoveryEvents;\n(function (EPeersByDiscoveryEvents) {\n EPeersByDiscoveryEvents[\"PEER_DISCOVERY_BOOTSTRAP\"] = \"peer:discovery:bootstrap\";\n EPeersByDiscoveryEvents[\"PEER_DISCOVERY_PEER_EXCHANGE\"] = \"peer:discovery:peer-exchange\";\n EPeersByDiscoveryEvents[\"PEER_CONNECT_BOOTSTRAP\"] = \"peer:connected:bootstrap\";\n EPeersByDiscoveryEvents[\"PEER_CONNECT_PEER_EXCHANGE\"] = \"peer:connected:peer-exchange\";\n})(EPeersByDiscoveryEvents || (EPeersByDiscoveryEvents = {}));\nexport var EConnectionStateEvents;\n(function (EConnectionStateEvents) {\n EConnectionStateEvents[\"CONNECTION_STATUS\"] = \"waku:connection\";\n})(EConnectionStateEvents || (EConnectionStateEvents = {}));\n//# sourceMappingURL=connection_manager.js.map","export const DNS_DISCOVERY_TAG = \"@waku/bootstrap\";\n//# sourceMappingURL=dns_discovery.js.map","/**\n * The default cluster ID for The Waku Network\n */\nexport const DEFAULT_CLUSTER_ID = 1;\n/**\n * DefaultShardInfo is default configuration for The Waku Network.\n */\nexport const DefaultShardInfo = {\n clusterId: DEFAULT_CLUSTER_ID,\n shards: [0, 1, 2, 3, 4, 5, 6, 7, 8]\n};\nexport const DefaultNetworkConfig = DefaultShardInfo;\n//# sourceMappingURL=constants.js.map","export var HealthStatus;\n(function (HealthStatus) {\n HealthStatus[\"Unhealthy\"] = \"Unhealthy\";\n HealthStatus[\"MinimallyHealthy\"] = \"MinimallyHealthy\";\n HealthStatus[\"SufficientlyHealthy\"] = \"SufficientlyHealthy\";\n})(HealthStatus || (HealthStatus = {}));\n//# sourceMappingURL=health_manager.js.map","import bases, {} from './util/bases.js';\n/**\n * Turns a `Uint8Array` into a string.\n *\n * Supports `utf8`, `utf-8` and any encoding supported by the multibase module.\n *\n * Also `ascii` which is similar to node's 'binary' encoding.\n */\nexport function toString(array, encoding = 'utf8') {\n const base = bases[encoding];\n if (base == null) {\n throw new Error(`Unsupported encoding \"${encoding}\"`);\n }\n // strip multibase prefix\n return base.encoder.encode(array).substring(1);\n}\n//# sourceMappingURL=to-string.js.map","import { fromString } from \"uint8arrays/from-string\";\nimport { toString } from \"uint8arrays/to-string\";\n/**\n * Convert input to a byte array.\n *\n * Handles both `0x` prefixed and non-prefixed strings.\n */\nexport function hexToBytes(hex) {\n if (typeof hex === \"string\") {\n const _hex = hex.replace(/^0x/i, \"\");\n return fromString(_hex.toLowerCase(), \"base16\");\n }\n return hex;\n}\nexport function numberToBytes(value) {\n const buffer = new ArrayBuffer(8);\n const view = new DataView(buffer);\n if (typeof value === \"number\") {\n view.setFloat64(0, value, false);\n }\n else {\n view.setBigInt64(0, value, false);\n }\n return new Uint8Array(buffer);\n}\n/**\n * Convert byte array to hex string (no `0x` prefix).\n */\nexport const bytesToHex = (bytes) => toString(bytes, \"base16\");\n/**\n * Decode byte array to utf-8 string.\n */\nexport const bytesToUtf8 = (b) => toString(b, \"utf8\");\n/**\n * Encode utf-8 string to byte array.\n */\nexport const utf8ToBytes = (s) => fromString(s, \"utf8\");\n/**\n * Concatenate using Uint8Arrays as `Buffer` has a different behavior with `DataView`\n */\nexport function concat(byteArrays, totalLength) {\n const len = totalLength ?? byteArrays.reduce((acc, curr) => acc + curr.length, 0);\n const res = new Uint8Array(len);\n let offset = 0;\n for (const bytes of byteArrays) {\n res.set(bytes, offset);\n offset += bytes.length;\n }\n return res;\n}\n//# sourceMappingURL=index.js.map","import { sha256 } from \"@noble/hashes/sha256\";\nimport { DEFAULT_CLUSTER_ID } from \"@waku/interfaces\";\nimport { concat, utf8ToBytes } from \"../../bytes/index.js\";\nimport { isAutoSharding, isStaticSharding } from \"./type_guards.js\";\nexport * from \"./type_guards.js\";\nexport function derivePubsubTopicsFromNetworkConfig(networkConfig) {\n if (isStaticSharding(networkConfig)) {\n if (networkConfig.shards.length === 0) {\n throw new Error(\"Invalid shards configuration: please provide at least one shard\");\n }\n return shardInfoToPubsubTopics(networkConfig);\n }\n else if (isAutoSharding(networkConfig)) {\n if (networkConfig.contentTopics.length === 0) {\n throw new Error(\"Invalid content topics configuration: please provide at least one content topic\");\n }\n return networkConfig.contentTopics.map((contentTopic) => contentTopicToPubsubTopic(contentTopic, networkConfig.clusterId));\n }\n else {\n throw new Error(\"Unknown shard config. Please use ShardInfo or ContentTopicInfo\");\n }\n}\nexport const singleShardInfoToPubsubTopic = (shardInfo) => {\n if (shardInfo.shard === undefined)\n throw new Error(\"Invalid shard\");\n return `/waku/2/rs/${shardInfo.clusterId ?? DEFAULT_CLUSTER_ID}/${shardInfo.shard}`;\n};\nexport const singleShardInfosToShardInfo = (singleShardInfos) => {\n if (singleShardInfos.length === 0)\n throw new Error(\"Invalid shard\");\n const clusterIds = singleShardInfos.map((shardInfo) => shardInfo.clusterId);\n if (new Set(clusterIds).size !== 1) {\n throw new Error(\"Passed shard infos have different clusterIds\");\n }\n const shards = singleShardInfos\n .map((shardInfo) => shardInfo.shard)\n .filter((shard) => shard !== undefined);\n return {\n clusterId: singleShardInfos[0].clusterId,\n shards\n };\n};\nexport const shardInfoToPubsubTopics = (shardInfo) => {\n if (\"contentTopics\" in shardInfo && shardInfo.contentTopics) {\n // Autosharding: explicitly defined content topics\n return Array.from(new Set(shardInfo.contentTopics.map((contentTopic) => contentTopicToPubsubTopic(contentTopic, shardInfo.clusterId))));\n }\n else if (\"shards\" in shardInfo) {\n // Static sharding\n if (shardInfo.shards === undefined)\n throw new Error(\"Invalid shard\");\n return Array.from(new Set(shardInfo.shards.map((index) => `/waku/2/rs/${shardInfo.clusterId ?? DEFAULT_CLUSTER_ID}/${index}`)));\n }\n else if (\"application\" in shardInfo && \"version\" in shardInfo) {\n // Autosharding: single shard from application and version\n return [\n contentTopicToPubsubTopic(`/${shardInfo.application}/${shardInfo.version}/default/default`, shardInfo.clusterId)\n ];\n }\n else {\n throw new Error(\"Missing required configuration in shard parameters\");\n }\n};\nexport const pubsubTopicToSingleShardInfo = (pubsubTopics) => {\n const parts = pubsubTopics.split(\"/\");\n if (parts.length != 6 ||\n parts[1] !== \"waku\" ||\n parts[2] !== \"2\" ||\n parts[3] !== \"rs\")\n throw new Error(\"Invalid pubsub topic\");\n const clusterId = parseInt(parts[4]);\n const shard = parseInt(parts[5]);\n if (isNaN(clusterId) || isNaN(shard))\n throw new Error(\"Invalid clusterId or shard\");\n return {\n clusterId,\n shard\n };\n};\nexport const pubsubTopicsToShardInfo = (pubsubTopics) => {\n const shardInfoSet = new Set();\n const clusterIds = new Set();\n for (const topic of pubsubTopics) {\n const { clusterId, shard } = pubsubTopicToSingleShardInfo(topic);\n shardInfoSet.add(`${clusterId}:${shard}`);\n clusterIds.add(clusterId);\n }\n if (shardInfoSet.size === 0) {\n throw new Error(\"No valid pubsub topics provided\");\n }\n if (clusterIds.size > 1) {\n throw new Error(\"Pubsub topics from multiple cluster IDs are not supported\");\n }\n const clusterId = clusterIds.values().next().value;\n const shards = Array.from(shardInfoSet).map((info) => parseInt(info.split(\":\")[1]));\n return {\n clusterId,\n shards\n };\n};\n//TODO: move part of BaseProtocol instead of utils\n// return `ProtocolError.TOPIC_NOT_CONFIGURED` instead of throwing\nexport function ensurePubsubTopicIsConfigured(pubsubTopic, configuredTopics) {\n if (!configuredTopics.includes(pubsubTopic)) {\n throw new Error(`Pubsub topic ${pubsubTopic} has not been configured on this instance. Configured topics are: ${configuredTopics}. Please update your configuration by passing in the topic during Waku node instantiation.`);\n }\n}\n/**\n * Given a string, will throw an error if it is not formatted as a valid content topic for autosharding based on https://rfc.vac.dev/spec/51/\n * @param contentTopic String to validate\n * @returns Object with each content topic field as an attribute\n */\nexport function ensureValidContentTopic(contentTopic) {\n const parts = contentTopic.split(\"/\");\n if (parts.length < 5 || parts.length > 6) {\n throw Error(\"Content topic format is invalid\");\n }\n // Validate generation field if present\n let generation = 0;\n if (parts.length == 6) {\n generation = parseInt(parts[1]);\n if (isNaN(generation)) {\n throw new Error(\"Invalid generation field in content topic\");\n }\n if (generation > 0) {\n throw new Error(\"Generation greater than 0 is not supported\");\n }\n }\n // Validate remaining fields\n const fields = parts.splice(-4);\n // Validate application field\n if (fields[0].length == 0) {\n throw new Error(\"Application field cannot be empty\");\n }\n // Validate version field\n if (fields[1].length == 0) {\n throw new Error(\"Version field cannot be empty\");\n }\n // Validate topic name field\n if (fields[2].length == 0) {\n throw new Error(\"Topic name field cannot be empty\");\n }\n // Validate encoding field\n if (fields[3].length == 0) {\n throw new Error(\"Encoding field cannot be empty\");\n }\n return {\n generation,\n application: fields[0],\n version: fields[1],\n topicName: fields[2],\n encoding: fields[3]\n };\n}\n/**\n * Given a string, determines which autoshard index to use for its pubsub topic.\n * Based on the algorithm described in the RFC: https://rfc.vac.dev/spec/51//#algorithm\n */\nexport function contentTopicToShardIndex(contentTopic, networkShards = 8) {\n const { application, version } = ensureValidContentTopic(contentTopic);\n const digest = sha256(concat([utf8ToBytes(application), utf8ToBytes(version)]));\n const dataview = new DataView(digest.buffer.slice(-8));\n return Number(dataview.getBigUint64(0, false) % BigInt(networkShards));\n}\nexport function contentTopicToPubsubTopic(contentTopic, clusterId = DEFAULT_CLUSTER_ID, networkShards = 8) {\n if (!contentTopic) {\n throw Error(\"Content topic must be specified\");\n }\n const shardIndex = contentTopicToShardIndex(contentTopic, networkShards);\n return `/waku/2/rs/${clusterId}/${shardIndex}`;\n}\n/**\n * Given an array of content topics, groups them together by their Pubsub topic as derived using the algorithm for autosharding.\n * If any of the content topics are not properly formatted, the function will throw an error.\n */\nexport function contentTopicsByPubsubTopic(contentTopics, clusterId = DEFAULT_CLUSTER_ID, networkShards = 8) {\n const groupedContentTopics = new Map();\n for (const contentTopic of contentTopics) {\n const pubsubTopic = contentTopicToPubsubTopic(contentTopic, clusterId, networkShards);\n let topics = groupedContentTopics.get(pubsubTopic);\n if (!topics) {\n groupedContentTopics.set(pubsubTopic, []);\n topics = groupedContentTopics.get(pubsubTopic);\n }\n topics.push(contentTopic);\n }\n return groupedContentTopics;\n}\n/**\n * Used when creating encoders/decoders to determine which pubsub topic to use\n */\nexport function determinePubsubTopic(contentTopic, \n// TODO: make it accept ShardInfo https://github.com/waku-org/js-waku/issues/2086\npubsubTopicShardInfo) {\n if (typeof pubsubTopicShardInfo == \"string\") {\n return pubsubTopicShardInfo;\n }\n return pubsubTopicShardInfo?.shard !== undefined\n ? singleShardInfoToPubsubTopic(pubsubTopicShardInfo)\n : contentTopicToPubsubTopic(contentTopic, pubsubTopicShardInfo?.clusterId ?? DEFAULT_CLUSTER_ID);\n}\n/**\n * Validates sharding configuration and sets defaults where possible.\n * @returns Validated sharding parameters, with any missing values set to defaults\n */\nexport const ensureShardingConfigured = (networkConfig) => {\n const clusterId = networkConfig.clusterId ?? DEFAULT_CLUSTER_ID;\n const shards = \"shards\" in networkConfig ? networkConfig.shards : [];\n const contentTopics = \"contentTopics\" in networkConfig ? networkConfig.contentTopics : [];\n const isShardsConfigured = shards && shards.length > 0;\n const isContentTopicsConfigured = contentTopics && contentTopics.length > 0;\n if (isShardsConfigured) {\n return {\n shardInfo: { clusterId, shards },\n pubsubTopics: shardInfoToPubsubTopics({ clusterId, shards })\n };\n }\n if (isContentTopicsConfigured) {\n const pubsubTopics = Array.from(new Set(contentTopics.map((topic) => contentTopicToPubsubTopic(topic, clusterId))));\n const shards = Array.from(new Set(contentTopics.map((topic) => contentTopicToShardIndex(topic))));\n return {\n shardInfo: { clusterId, shards },\n pubsubTopics\n };\n }\n throw new Error(\"Missing minimum required configuration options for static sharding or autosharding.\");\n};\n//# sourceMappingURL=index.js.map","export const decodeRelayShard = (bytes) => {\n // explicitly converting to Uint8Array to avoid Buffer\n // https://github.com/libp2p/js-libp2p/issues/2146\n bytes = new Uint8Array(bytes);\n if (bytes.length < 3)\n throw new Error(\"Insufficient data\");\n const view = new DataView(bytes.buffer);\n const clusterId = view.getUint16(0);\n const shards = [];\n if (bytes.length === 130) {\n // rsv format (Bit Vector)\n for (let i = 0; i < 1024; i++) {\n const byteIndex = Math.floor(i / 8) + 2; // Adjusted for the 2-byte cluster field\n const bitIndex = 7 - (i % 8);\n if (view.getUint8(byteIndex) & (1 << bitIndex)) {\n shards.push(i);\n }\n }\n }\n else {\n // rs format (Index List)\n const numIndices = view.getUint8(2);\n for (let i = 0, offset = 3; i < numIndices; i++, offset += 2) {\n if (offset + 1 >= bytes.length)\n throw new Error(\"Unexpected end of data\");\n shards.push(view.getUint16(offset));\n }\n }\n return { clusterId, shards };\n};\nexport const encodeRelayShard = (shardInfo) => {\n const { clusterId, shards } = shardInfo;\n const totalLength = shards.length >= 64 ? 130 : 3 + 2 * shards.length;\n const buffer = new ArrayBuffer(totalLength);\n const view = new DataView(buffer);\n view.setUint16(0, clusterId);\n if (shards.length >= 64) {\n // rsv format (Bit Vector)\n for (const index of shards) {\n const byteIndex = Math.floor(index / 8) + 2; // Adjusted for the 2-byte cluster field\n const bitIndex = 7 - (index % 8);\n view.setUint8(byteIndex, view.getUint8(byteIndex) | (1 << bitIndex));\n }\n }\n else {\n // rs format (Index List)\n view.setUint8(2, shards.length);\n for (let i = 0, offset = 3; i < shards.length; i++, offset += 2) {\n view.setUint16(offset, shards[i]);\n }\n }\n return new Uint8Array(buffer);\n};\n//# sourceMappingURL=relay_shard_codec.js.map","export async function delay(ms) {\n return new Promise((resolve) => setTimeout(resolve, ms));\n}\n//# sourceMappingURL=delay.js.map","import debug from \"debug\";\nconst APP_NAME = \"waku\";\nexport class Logger {\n _info;\n _warn;\n _error;\n static createDebugNamespace(level, prefix) {\n return prefix ? `${APP_NAME}:${level}:${prefix}` : `${APP_NAME}:${level}`;\n }\n constructor(prefix) {\n this._info = debug(Logger.createDebugNamespace(\"info\", prefix));\n this._warn = debug(Logger.createDebugNamespace(\"warn\", prefix));\n this._error = debug(Logger.createDebugNamespace(\"error\", prefix));\n }\n get info() {\n return this._info;\n }\n get warn() {\n return this._warn;\n }\n get error() {\n return this._error;\n }\n log(level, ...args) {\n const logger = this[level];\n logger(...args);\n }\n}\n//# sourceMappingURL=index.js.map","import { proto_message as proto } from \"@waku/proto\";\nimport { determinePubsubTopic, Logger } from \"@waku/utils\";\nconst log = new Logger(\"message:version-0\");\nconst OneMillion = BigInt(1_000_000);\nexport const Version = 0;\nexport { proto };\nexport class DecodedMessage {\n pubsubTopic;\n proto;\n constructor(pubsubTopic, proto) {\n this.pubsubTopic = pubsubTopic;\n this.proto = proto;\n }\n get ephemeral() {\n return Boolean(this.proto.ephemeral);\n }\n get payload() {\n return this.proto.payload;\n }\n get contentTopic() {\n return this.proto.contentTopic;\n }\n get _rawTimestamp() {\n return this.proto.timestamp;\n }\n get timestamp() {\n // In the case we receive a value that is bigger than JS's max number,\n // we catch the error and return undefined.\n try {\n if (this.proto.timestamp) {\n // nanoseconds 10^-9 to milliseconds 10^-3\n const timestamp = this.proto.timestamp / OneMillion;\n return new Date(Number(timestamp));\n }\n return;\n }\n catch (e) {\n return;\n }\n }\n get meta() {\n return this.proto.meta;\n }\n get version() {\n // https://rfc.vac.dev/spec/14/\n // > If omitted, the value SHOULD be interpreted as version 0.\n return this.proto.version ?? 0;\n }\n get rateLimitProof() {\n return this.proto.rateLimitProof;\n }\n}\nexport class Encoder {\n contentTopic;\n ephemeral;\n pubsubTopic;\n metaSetter;\n constructor(contentTopic, ephemeral = false, pubsubTopic, metaSetter) {\n this.contentTopic = contentTopic;\n this.ephemeral = ephemeral;\n this.pubsubTopic = pubsubTopic;\n this.metaSetter = metaSetter;\n if (!contentTopic || contentTopic === \"\") {\n throw new Error(\"Content topic must be specified\");\n }\n }\n async toWire(message) {\n return proto.WakuMessage.encode(await this.toProtoObj(message));\n }\n async toProtoObj(message) {\n const timestamp = message.timestamp ?? new Date();\n const protoMessage = {\n payload: message.payload,\n version: Version,\n contentTopic: this.contentTopic,\n timestamp: BigInt(timestamp.valueOf()) * OneMillion,\n meta: undefined,\n rateLimitProof: message.rateLimitProof,\n ephemeral: this.ephemeral\n };\n if (this.metaSetter) {\n const meta = this.metaSetter(protoMessage);\n return { ...protoMessage, meta };\n }\n return protoMessage;\n }\n}\n/**\n * Creates an encoder that encode messages without Waku level encryption or signature.\n *\n * An encoder is used to encode messages in the [14/WAKU2-MESSAGE](https://rfc.vac.dev/spec/14/)\n * format to be sent over the Waku network. The resulting encoder can then be\n * pass to { @link @waku/interfaces!ISender.send } to automatically encode outgoing\n * messages.\n */\nexport function createEncoder({ pubsubTopic, pubsubTopicShardInfo, contentTopic, ephemeral, metaSetter }) {\n return new Encoder(contentTopic, ephemeral, determinePubsubTopic(contentTopic, pubsubTopic ?? pubsubTopicShardInfo), metaSetter);\n}\nexport class Decoder {\n pubsubTopic;\n contentTopic;\n constructor(pubsubTopic, contentTopic) {\n this.pubsubTopic = pubsubTopic;\n this.contentTopic = contentTopic;\n if (!contentTopic || contentTopic === \"\") {\n throw new Error(\"Content topic must be specified\");\n }\n }\n fromWireToProtoObj(bytes) {\n const protoMessage = proto.WakuMessage.decode(bytes);\n return Promise.resolve({\n payload: protoMessage.payload,\n contentTopic: protoMessage.contentTopic,\n version: protoMessage.version ?? undefined,\n timestamp: protoMessage.timestamp ?? undefined,\n meta: protoMessage.meta ?? undefined,\n rateLimitProof: protoMessage.rateLimitProof ?? undefined,\n ephemeral: protoMessage.ephemeral ?? false\n });\n }\n async fromProtoObj(pubsubTopic, proto) {\n // https://rfc.vac.dev/spec/14/\n // > If omitted, the value SHOULD be interpreted as version 0.\n if (proto.version ?? 0 !== Version) {\n log.error(\"Failed to decode due to incorrect version, expected:\", Version, \", actual:\", proto.version);\n return Promise.resolve(undefined);\n }\n return new DecodedMessage(pubsubTopic, proto);\n }\n}\n/**\n * Creates a decoder that decode messages without Waku level encryption.\n *\n * A decoder is used to decode messages from the [14/WAKU2-MESSAGE](https://rfc.vac.dev/spec/14/)\n * format when received from the Waku network. The resulting decoder can then be\n * pass to { @link @waku/interfaces!IReceiver.subscribe } to automatically decode incoming\n * messages.\n *\n * @param contentTopic The resulting decoder will only decode messages with this content topic.\n */\nexport function createDecoder(contentTopic, pubsubTopicShardInfo) {\n return new Decoder(determinePubsubTopic(contentTopic, pubsubTopicShardInfo), contentTopic);\n}\n//# sourceMappingURL=version_0.js.map","/**\n * @packageDocumentation\n *\n * For when you need a one-liner to collect iterable values.\n *\n * @example\n *\n * ```javascript\n * import all from 'it-all'\n *\n * // This can also be an iterator, etc\n * const values = function * () {\n * yield * [0, 1, 2, 3, 4]\n * }\n *\n * const arr = all(values)\n *\n * console.info(arr) // 0, 1, 2, 3, 4\n * ```\n *\n * Async sources must be awaited:\n *\n * ```javascript\n * const values = async function * () {\n * yield * [0, 1, 2, 3, 4]\n * }\n *\n * const arr = await all(values())\n *\n * console.info(arr) // 0, 1, 2, 3, 4\n * ```\n */\nfunction isAsyncIterable(thing) {\n return thing[Symbol.asyncIterator] != null;\n}\nfunction all(source) {\n if (isAsyncIterable(source)) {\n return (async () => {\n const arr = [];\n for await (const entry of source) {\n arr.push(entry);\n }\n return arr;\n })();\n }\n const arr = [];\n for (const entry of source) {\n arr.push(entry);\n }\n return arr;\n}\nexport default all;\n//# sourceMappingURL=index.js.map","import { allocUnsafe } from '#alloc';\nimport { asUint8Array } from '#util/as-uint8array';\n/**\n * Returns a new Uint8Array created by concatenating the passed Uint8Arrays\n */\nexport function concat(arrays, length) {\n if (length == null) {\n length = arrays.reduce((acc, curr) => acc + curr.length, 0);\n }\n const output = allocUnsafe(length);\n let offset = 0;\n for (const arr of arrays) {\n output.set(arr, offset);\n offset += arr.length;\n }\n return asUint8Array(output);\n}\n//# sourceMappingURL=concat.js.map","/**\n * Returns true if the two passed Uint8Arrays have the same content\n */\nexport function equals(a, b) {\n if (a === b) {\n return true;\n }\n if (a.byteLength !== b.byteLength) {\n return false;\n }\n for (let i = 0; i < a.byteLength; i++) {\n if (a[i] !== b[i]) {\n return false;\n }\n }\n return true;\n}\n//# sourceMappingURL=equals.js.map","/**\n * @packageDocumentation\n *\n * A class that lets you do operations over a list of Uint8Arrays without\n * copying them.\n *\n * ```js\n * import { Uint8ArrayList } from 'uint8arraylist'\n *\n * const list = new Uint8ArrayList()\n * list.append(Uint8Array.from([0, 1, 2]))\n * list.append(Uint8Array.from([3, 4, 5]))\n *\n * list.subarray()\n * // -> Uint8Array([0, 1, 2, 3, 4, 5])\n *\n * list.consume(3)\n * list.subarray()\n * // -> Uint8Array([3, 4, 5])\n *\n * // you can also iterate over the list\n * for (const buf of list) {\n * // ..do something with `buf`\n * }\n *\n * list.subarray(0, 1)\n * // -> Uint8Array([0])\n * ```\n *\n * ## Converting Uint8ArrayLists to Uint8Arrays\n *\n * There are two ways to turn a `Uint8ArrayList` into a `Uint8Array` - `.slice` and `.subarray` and one way to turn a `Uint8ArrayList` into a `Uint8ArrayList` with different contents - `.sublist`.\n *\n * ### slice\n *\n * Slice follows the same semantics as [Uint8Array.slice](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/TypedArray/slice) in that it creates a new `Uint8Array` and copies bytes into it using an optional offset & length.\n *\n * ```js\n * const list = new Uint8ArrayList()\n * list.append(Uint8Array.from([0, 1, 2]))\n * list.append(Uint8Array.from([3, 4, 5]))\n *\n * list.slice(0, 1)\n * // -> Uint8Array([0])\n * ```\n *\n * ### subarray\n *\n * Subarray attempts to follow the same semantics as [Uint8Array.subarray](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/TypedArray/subarray) with one important different - this is a no-copy operation, unless the requested bytes span two internal buffers in which case it is a copy operation.\n *\n * ```js\n * const list = new Uint8ArrayList()\n * list.append(Uint8Array.from([0, 1, 2]))\n * list.append(Uint8Array.from([3, 4, 5]))\n *\n * list.subarray(0, 1)\n * // -> Uint8Array([0]) - no-copy\n *\n * list.subarray(2, 5)\n * // -> Uint8Array([2, 3, 4]) - copy\n * ```\n *\n * ### sublist\n *\n * Sublist creates and returns a new `Uint8ArrayList` that shares the underlying buffers with the original so is always a no-copy operation.\n *\n * ```js\n * const list = new Uint8ArrayList()\n * list.append(Uint8Array.from([0, 1, 2]))\n * list.append(Uint8Array.from([3, 4, 5]))\n *\n * list.sublist(0, 1)\n * // -> Uint8ArrayList([0]) - no-copy\n *\n * list.sublist(2, 5)\n * // -> Uint8ArrayList([2], [3, 4]) - no-copy\n * ```\n *\n * ## Inspiration\n *\n * Borrows liberally from [bl](https://www.npmjs.com/package/bl) but only uses native JS types.\n */\nimport { allocUnsafe, alloc } from 'uint8arrays/alloc';\nimport { concat } from 'uint8arrays/concat';\nimport { equals } from 'uint8arrays/equals';\nconst symbol = Symbol.for('@achingbrain/uint8arraylist');\nfunction findBufAndOffset(bufs, index) {\n if (index == null || index < 0) {\n throw new RangeError('index is out of bounds');\n }\n let offset = 0;\n for (const buf of bufs) {\n const bufEnd = offset + buf.byteLength;\n if (index < bufEnd) {\n return {\n buf,\n index: index - offset\n };\n }\n offset = bufEnd;\n }\n throw new RangeError('index is out of bounds');\n}\n/**\n * Check if object is a CID instance\n *\n * @example\n *\n * ```js\n * import { isUint8ArrayList, Uint8ArrayList } from 'uint8arraylist'\n *\n * isUint8ArrayList(true) // false\n * isUint8ArrayList([]) // false\n * isUint8ArrayList(new Uint8ArrayList()) // true\n * ```\n */\nexport function isUint8ArrayList(value) {\n return Boolean(value?.[symbol]);\n}\nexport class Uint8ArrayList {\n bufs;\n length;\n [symbol] = true;\n constructor(...data) {\n this.bufs = [];\n this.length = 0;\n if (data.length > 0) {\n this.appendAll(data);\n }\n }\n *[Symbol.iterator]() {\n yield* this.bufs;\n }\n get byteLength() {\n return this.length;\n }\n /**\n * Add one or more `bufs` to the end of this Uint8ArrayList\n */\n append(...bufs) {\n this.appendAll(bufs);\n }\n /**\n * Add all `bufs` to the end of this Uint8ArrayList\n */\n appendAll(bufs) {\n let length = 0;\n for (const buf of bufs) {\n if (buf instanceof Uint8Array) {\n length += buf.byteLength;\n this.bufs.push(buf);\n }\n else if (isUint8ArrayList(buf)) {\n length += buf.byteLength;\n this.bufs.push(...buf.bufs);\n }\n else {\n throw new Error('Could not append value, must be an Uint8Array or a Uint8ArrayList');\n }\n }\n this.length += length;\n }\n /**\n * Add one or more `bufs` to the start of this Uint8ArrayList\n */\n prepend(...bufs) {\n this.prependAll(bufs);\n }\n /**\n * Add all `bufs` to the start of this Uint8ArrayList\n */\n prependAll(bufs) {\n let length = 0;\n for (const buf of bufs.reverse()) {\n if (buf instanceof Uint8Array) {\n length += buf.byteLength;\n this.bufs.unshift(buf);\n }\n else if (isUint8ArrayList(buf)) {\n length += buf.byteLength;\n this.bufs.unshift(...buf.bufs);\n }\n else {\n throw new Error('Could not prepend value, must be an Uint8Array or a Uint8ArrayList');\n }\n }\n this.length += length;\n }\n /**\n * Read the value at `index`\n */\n get(index) {\n const res = findBufAndOffset(this.bufs, index);\n return res.buf[res.index];\n }\n /**\n * Set the value at `index` to `value`\n */\n set(index, value) {\n const res = findBufAndOffset(this.bufs, index);\n res.buf[res.index] = value;\n }\n /**\n * Copy bytes from `buf` to the index specified by `offset`\n */\n write(buf, offset = 0) {\n if (buf instanceof Uint8Array) {\n for (let i = 0; i < buf.length; i++) {\n this.set(offset + i, buf[i]);\n }\n }\n else if (isUint8ArrayList(buf)) {\n for (let i = 0; i < buf.length; i++) {\n this.set(offset + i, buf.get(i));\n }\n }\n else {\n throw new Error('Could not write value, must be an Uint8Array or a Uint8ArrayList');\n }\n }\n /**\n * Remove bytes from the front of the pool\n */\n consume(bytes) {\n // first, normalize the argument, in accordance with how Buffer does it\n bytes = Math.trunc(bytes);\n // do nothing if not a positive number\n if (Number.isNaN(bytes) || bytes <= 0) {\n return;\n }\n // if consuming all bytes, skip iterating\n if (bytes === this.byteLength) {\n this.bufs = [];\n this.length = 0;\n return;\n }\n while (this.bufs.length > 0) {\n if (bytes >= this.bufs[0].byteLength) {\n bytes -= this.bufs[0].byteLength;\n this.length -= this.bufs[0].byteLength;\n this.bufs.shift();\n }\n else {\n this.bufs[0] = this.bufs[0].subarray(bytes);\n this.length -= bytes;\n break;\n }\n }\n }\n /**\n * Extracts a section of an array and returns a new array.\n *\n * This is a copy operation as it is with Uint8Arrays and Arrays\n * - note this is different to the behaviour of Node Buffers.\n */\n slice(beginInclusive, endExclusive) {\n const { bufs, length } = this._subList(beginInclusive, endExclusive);\n return concat(bufs, length);\n }\n /**\n * Returns a alloc from the given start and end element index.\n *\n * In the best case where the data extracted comes from a single Uint8Array\n * internally this is a no-copy operation otherwise it is a copy operation.\n */\n subarray(beginInclusive, endExclusive) {\n const { bufs, length } = this._subList(beginInclusive, endExclusive);\n if (bufs.length === 1) {\n return bufs[0];\n }\n return concat(bufs, length);\n }\n /**\n * Returns a allocList from the given start and end element index.\n *\n * This is a no-copy operation.\n */\n sublist(beginInclusive, endExclusive) {\n const { bufs, length } = this._subList(beginInclusive, endExclusive);\n const list = new Uint8ArrayList();\n list.length = length;\n // don't loop, just set the bufs\n list.bufs = [...bufs];\n return list;\n }\n _subList(beginInclusive, endExclusive) {\n beginInclusive = beginInclusive ?? 0;\n endExclusive = endExclusive ?? this.length;\n if (beginInclusive < 0) {\n beginInclusive = this.length + beginInclusive;\n }\n if (endExclusive < 0) {\n endExclusive = this.length + endExclusive;\n }\n if (beginInclusive < 0 || endExclusive > this.length) {\n throw new RangeError('index is out of bounds');\n }\n if (beginInclusive === endExclusive) {\n return { bufs: [], length: 0 };\n }\n if (beginInclusive === 0 && endExclusive === this.length) {\n return { bufs: this.bufs, length: this.length };\n }\n const bufs = [];\n let offset = 0;\n for (let i = 0; i < this.bufs.length; i++) {\n const buf = this.bufs[i];\n const bufStart = offset;\n const bufEnd = bufStart + buf.byteLength;\n // for next loop\n offset = bufEnd;\n if (beginInclusive >= bufEnd) {\n // start after this buf\n continue;\n }\n const sliceStartInBuf = beginInclusive >= bufStart && beginInclusive < bufEnd;\n const sliceEndsInBuf = endExclusive > bufStart && endExclusive <= bufEnd;\n if (sliceStartInBuf && sliceEndsInBuf) {\n // slice is wholly contained within this buffer\n if (beginInclusive === bufStart && endExclusive === bufEnd) {\n // requested whole buffer\n bufs.push(buf);\n break;\n }\n // requested part of buffer\n const start = beginInclusive - bufStart;\n bufs.push(buf.subarray(start, start + (endExclusive - beginInclusive)));\n break;\n }\n if (sliceStartInBuf) {\n // slice starts in this buffer\n if (beginInclusive === 0) {\n // requested whole buffer\n bufs.push(buf);\n continue;\n }\n // requested part of buffer\n bufs.push(buf.subarray(beginInclusive - bufStart));\n continue;\n }\n if (sliceEndsInBuf) {\n if (endExclusive === bufEnd) {\n // requested whole buffer\n bufs.push(buf);\n break;\n }\n // requested part of buffer\n bufs.push(buf.subarray(0, endExclusive - bufStart));\n break;\n }\n // slice started before this buffer and ends after it\n bufs.push(buf);\n }\n return { bufs, length: endExclusive - beginInclusive };\n }\n indexOf(search, offset = 0) {\n if (!isUint8ArrayList(search) && !(search instanceof Uint8Array)) {\n throw new TypeError('The \"value\" argument must be a Uint8ArrayList or Uint8Array');\n }\n const needle = search instanceof Uint8Array ? search : search.subarray();\n offset = Number(offset ?? 0);\n if (isNaN(offset)) {\n offset = 0;\n }\n if (offset < 0) {\n offset = this.length + offset;\n }\n if (offset < 0) {\n offset = 0;\n }\n if (search.length === 0) {\n return offset > this.length ? this.length : offset;\n }\n // https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string-search_algorithm\n const M = needle.byteLength;\n if (M === 0) {\n throw new TypeError('search must be at least 1 byte long');\n }\n // radix\n const radix = 256;\n const rightmostPositions = new Int32Array(radix);\n // position of the rightmost occurrence of the byte c in the pattern\n for (let c = 0; c < radix; c++) {\n // -1 for bytes not in pattern\n rightmostPositions[c] = -1;\n }\n for (let j = 0; j < M; j++) {\n // rightmost position for bytes in pattern\n rightmostPositions[needle[j]] = j;\n }\n // Return offset of first match, -1 if no match\n const right = rightmostPositions;\n const lastIndex = this.byteLength - needle.byteLength;\n const lastPatIndex = needle.byteLength - 1;\n let skip;\n for (let i = offset; i <= lastIndex; i += skip) {\n skip = 0;\n for (let j = lastPatIndex; j >= 0; j--) {\n const char = this.get(i + j);\n if (needle[j] !== char) {\n skip = Math.max(1, j - right[char]);\n break;\n }\n }\n if (skip === 0) {\n return i;\n }\n }\n return -1;\n }\n getInt8(byteOffset) {\n const buf = this.subarray(byteOffset, byteOffset + 1);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n return view.getInt8(0);\n }\n setInt8(byteOffset, value) {\n const buf = allocUnsafe(1);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n view.setInt8(0, value);\n this.write(buf, byteOffset);\n }\n getInt16(byteOffset, littleEndian) {\n const buf = this.subarray(byteOffset, byteOffset + 2);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n return view.getInt16(0, littleEndian);\n }\n setInt16(byteOffset, value, littleEndian) {\n const buf = alloc(2);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n view.setInt16(0, value, littleEndian);\n this.write(buf, byteOffset);\n }\n getInt32(byteOffset, littleEndian) {\n const buf = this.subarray(byteOffset, byteOffset + 4);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n return view.getInt32(0, littleEndian);\n }\n setInt32(byteOffset, value, littleEndian) {\n const buf = alloc(4);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n view.setInt32(0, value, littleEndian);\n this.write(buf, byteOffset);\n }\n getBigInt64(byteOffset, littleEndian) {\n const buf = this.subarray(byteOffset, byteOffset + 8);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n return view.getBigInt64(0, littleEndian);\n }\n setBigInt64(byteOffset, value, littleEndian) {\n const buf = alloc(8);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n view.setBigInt64(0, value, littleEndian);\n this.write(buf, byteOffset);\n }\n getUint8(byteOffset) {\n const buf = this.subarray(byteOffset, byteOffset + 1);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n return view.getUint8(0);\n }\n setUint8(byteOffset, value) {\n const buf = allocUnsafe(1);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n view.setUint8(0, value);\n this.write(buf, byteOffset);\n }\n getUint16(byteOffset, littleEndian) {\n const buf = this.subarray(byteOffset, byteOffset + 2);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n return view.getUint16(0, littleEndian);\n }\n setUint16(byteOffset, value, littleEndian) {\n const buf = alloc(2);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n view.setUint16(0, value, littleEndian);\n this.write(buf, byteOffset);\n }\n getUint32(byteOffset, littleEndian) {\n const buf = this.subarray(byteOffset, byteOffset + 4);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n return view.getUint32(0, littleEndian);\n }\n setUint32(byteOffset, value, littleEndian) {\n const buf = alloc(4);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n view.setUint32(0, value, littleEndian);\n this.write(buf, byteOffset);\n }\n getBigUint64(byteOffset, littleEndian) {\n const buf = this.subarray(byteOffset, byteOffset + 8);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n return view.getBigUint64(0, littleEndian);\n }\n setBigUint64(byteOffset, value, littleEndian) {\n const buf = alloc(8);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n view.setBigUint64(0, value, littleEndian);\n this.write(buf, byteOffset);\n }\n getFloat32(byteOffset, littleEndian) {\n const buf = this.subarray(byteOffset, byteOffset + 4);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n return view.getFloat32(0, littleEndian);\n }\n setFloat32(byteOffset, value, littleEndian) {\n const buf = alloc(4);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n view.setFloat32(0, value, littleEndian);\n this.write(buf, byteOffset);\n }\n getFloat64(byteOffset, littleEndian) {\n const buf = this.subarray(byteOffset, byteOffset + 8);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n return view.getFloat64(0, littleEndian);\n }\n setFloat64(byteOffset, value, littleEndian) {\n const buf = alloc(8);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n view.setFloat64(0, value, littleEndian);\n this.write(buf, byteOffset);\n }\n equals(other) {\n if (other == null) {\n return false;\n }\n if (!(other instanceof Uint8ArrayList)) {\n return false;\n }\n if (other.bufs.length !== this.bufs.length) {\n return false;\n }\n for (let i = 0; i < this.bufs.length; i++) {\n if (!equals(this.bufs[i], other.bufs[i])) {\n return false;\n }\n }\n return true;\n }\n /**\n * Create a Uint8ArrayList from a pre-existing list of Uint8Arrays. Use this\n * method if you know the total size of all the Uint8Arrays ahead of time.\n */\n static fromUint8Arrays(bufs, length) {\n const list = new Uint8ArrayList();\n list.bufs = bufs;\n if (length == null) {\n length = bufs.reduce((acc, curr) => acc + curr.byteLength, 0);\n }\n list.length = length;\n return list;\n }\n}\n/*\nfunction indexOf (needle: Uint8Array, haystack: Uint8Array, offset = 0) {\n for (let i = offset; i < haystack.byteLength; i++) {\n for (let j = 0; j < needle.length; j++) {\n if (haystack[i + j] !== needle[j]) {\n break\n }\n\n if (j === needle.byteLength -1) {\n return i\n }\n }\n\n if (haystack.byteLength - i < needle.byteLength) {\n break\n }\n }\n\n return -1\n}\n*/\n//# sourceMappingURL=index.js.map","export function isAsyncIterable(thing) {\n return thing[Symbol.asyncIterator] != null;\n}\n//# sourceMappingURL=utils.js.map","import * as varint from 'uint8-varint';\nimport { Uint8ArrayList } from 'uint8arraylist';\nimport { allocUnsafe } from 'uint8arrays/alloc';\nimport { isAsyncIterable } from './utils.js';\nconst defaultEncoder = (length) => {\n const lengthLength = varint.encodingLength(length);\n const lengthBuf = allocUnsafe(lengthLength);\n varint.encode(length, lengthBuf);\n defaultEncoder.bytes = lengthLength;\n return lengthBuf;\n};\ndefaultEncoder.bytes = 0;\nexport function encode(source, options) {\n options = options ?? {};\n const encodeLength = options.lengthEncoder ?? defaultEncoder;\n function* maybeYield(chunk) {\n // length + data\n const length = encodeLength(chunk.byteLength);\n // yield only Uint8Arrays\n if (length instanceof Uint8Array) {\n yield length;\n }\n else {\n yield* length;\n }\n // yield only Uint8Arrays\n if (chunk instanceof Uint8Array) {\n yield chunk;\n }\n else {\n yield* chunk;\n }\n }\n if (isAsyncIterable(source)) {\n return (async function* () {\n for await (const chunk of source) {\n yield* maybeYield(chunk);\n }\n })();\n }\n return (function* () {\n for (const chunk of source) {\n yield* maybeYield(chunk);\n }\n })();\n}\nencode.single = (chunk, options) => {\n options = options ?? {};\n const encodeLength = options.lengthEncoder ?? defaultEncoder;\n return new Uint8ArrayList(encodeLength(chunk.byteLength), chunk);\n};\n//# sourceMappingURL=encode.js.map","/**\n * The reported length of the next data message was not a positive integer\n */\nexport class InvalidMessageLengthError extends Error {\n name = 'InvalidMessageLengthError';\n code = 'ERR_INVALID_MSG_LENGTH';\n}\n/**\n * The reported length of the next data message was larger than the configured\n * max allowable value\n */\nexport class InvalidDataLengthError extends Error {\n name = 'InvalidDataLengthError';\n code = 'ERR_MSG_DATA_TOO_LONG';\n}\n/**\n * The varint used to specify the length of the next data message contained more\n * bytes than the configured max allowable value\n */\nexport class InvalidDataLengthLengthError extends Error {\n name = 'InvalidDataLengthLengthError';\n code = 'ERR_MSG_LENGTH_TOO_LONG';\n}\n/**\n * The incoming stream ended before the expected number of bytes were read\n */\nexport class UnexpectedEOFError extends Error {\n name = 'UnexpectedEOFError';\n code = 'ERR_UNEXPECTED_EOF';\n}\n//# sourceMappingURL=errors.js.map","/* eslint max-depth: [\"error\", 6] */\nimport * as varint from 'uint8-varint';\nimport { Uint8ArrayList } from 'uint8arraylist';\nimport { InvalidDataLengthError, InvalidDataLengthLengthError, InvalidMessageLengthError, UnexpectedEOFError } from './errors.js';\nimport { isAsyncIterable } from './utils.js';\n// Maximum length of the length section of the message\nexport const MAX_LENGTH_LENGTH = 8; // Varint.encode(Number.MAX_SAFE_INTEGER).length\n// Maximum length of the data section of the message\nexport const MAX_DATA_LENGTH = 1024 * 1024 * 4;\nvar ReadMode;\n(function (ReadMode) {\n ReadMode[ReadMode[\"LENGTH\"] = 0] = \"LENGTH\";\n ReadMode[ReadMode[\"DATA\"] = 1] = \"DATA\";\n})(ReadMode || (ReadMode = {}));\nconst defaultDecoder = (buf) => {\n const length = varint.decode(buf);\n defaultDecoder.bytes = varint.encodingLength(length);\n return length;\n};\ndefaultDecoder.bytes = 0;\nexport function decode(source, options) {\n const buffer = new Uint8ArrayList();\n let mode = ReadMode.LENGTH;\n let dataLength = -1;\n const lengthDecoder = options?.lengthDecoder ?? defaultDecoder;\n const maxLengthLength = options?.maxLengthLength ?? MAX_LENGTH_LENGTH;\n const maxDataLength = options?.maxDataLength ?? MAX_DATA_LENGTH;\n function* maybeYield() {\n while (buffer.byteLength > 0) {\n if (mode === ReadMode.LENGTH) {\n // read length, ignore errors for short reads\n try {\n dataLength = lengthDecoder(buffer);\n if (dataLength < 0) {\n throw new InvalidMessageLengthError('Invalid message length');\n }\n if (dataLength > maxDataLength) {\n throw new InvalidDataLengthError('Message length too long');\n }\n const dataLengthLength = lengthDecoder.bytes;\n buffer.consume(dataLengthLength);\n if (options?.onLength != null) {\n options.onLength(dataLength);\n }\n mode = ReadMode.DATA;\n }\n catch (err) {\n if (err instanceof RangeError) {\n if (buffer.byteLength > maxLengthLength) {\n throw new InvalidDataLengthLengthError('Message length length too long');\n }\n break;\n }\n throw err;\n }\n }\n if (mode === ReadMode.DATA) {\n if (buffer.byteLength < dataLength) {\n // not enough data, wait for more\n break;\n }\n const data = buffer.sublist(0, dataLength);\n buffer.consume(dataLength);\n if (options?.onData != null) {\n options.onData(data);\n }\n yield data;\n mode = ReadMode.LENGTH;\n }\n }\n }\n if (isAsyncIterable(source)) {\n return (async function* () {\n for await (const buf of source) {\n buffer.append(buf);\n yield* maybeYield();\n }\n if (buffer.byteLength > 0) {\n throw new UnexpectedEOFError('Unexpected end of input');\n }\n })();\n }\n return (function* () {\n for (const buf of source) {\n buffer.append(buf);\n yield* maybeYield();\n }\n if (buffer.byteLength > 0) {\n throw new UnexpectedEOFError('Unexpected end of input');\n }\n })();\n}\ndecode.fromReader = (reader, options) => {\n let byteLength = 1; // Read single byte chunks until the length is known\n const varByteSource = (async function* () {\n while (true) {\n try {\n const { done, value } = await reader.next(byteLength);\n if (done === true) {\n return;\n }\n if (value != null) {\n yield value;\n }\n }\n catch (err) {\n if (err.code === 'ERR_UNDER_READ') {\n return { done: true, value: null };\n }\n throw err;\n }\n finally {\n // Reset the byteLength so we continue to check for varints\n byteLength = 1;\n }\n }\n }());\n /**\n * Once the length has been parsed, read chunk for that length\n */\n const onLength = (l) => { byteLength = l; };\n return decode(varByteSource, {\n ...(options ?? {}),\n onLength\n });\n};\n//# sourceMappingURL=decode.js.map","export default function pDefer() {\n\tconst deferred = {};\n\n\tdeferred.promise = new Promise((resolve, reject) => {\n\t\tdeferred.resolve = resolve;\n\t\tdeferred.reject = reject;\n\t});\n\n\treturn deferred;\n}\n","// ported from https://www.npmjs.com/package/fast-fifo\nclass FixedFIFO {\n buffer;\n mask;\n top;\n btm;\n next;\n constructor(hwm) {\n if (!(hwm > 0) || ((hwm - 1) & hwm) !== 0) {\n throw new Error('Max size for a FixedFIFO should be a power of two');\n }\n this.buffer = new Array(hwm);\n this.mask = hwm - 1;\n this.top = 0;\n this.btm = 0;\n this.next = null;\n }\n push(data) {\n if (this.buffer[this.top] !== undefined) {\n return false;\n }\n this.buffer[this.top] = data;\n this.top = (this.top + 1) & this.mask;\n return true;\n }\n shift() {\n const last = this.buffer[this.btm];\n if (last === undefined) {\n return undefined;\n }\n this.buffer[this.btm] = undefined;\n this.btm = (this.btm + 1) & this.mask;\n return last;\n }\n isEmpty() {\n return this.buffer[this.btm] === undefined;\n }\n}\nexport class FIFO {\n size;\n hwm;\n head;\n tail;\n constructor(options = {}) {\n this.hwm = options.splitLimit ?? 16;\n this.head = new FixedFIFO(this.hwm);\n this.tail = this.head;\n this.size = 0;\n }\n calculateSize(obj) {\n if (obj?.byteLength != null) {\n return obj.byteLength;\n }\n return 1;\n }\n push(val) {\n if (val?.value != null) {\n this.size += this.calculateSize(val.value);\n }\n if (!this.head.push(val)) {\n const prev = this.head;\n this.head = prev.next = new FixedFIFO(2 * this.head.buffer.length);\n this.head.push(val);\n }\n }\n shift() {\n let val = this.tail.shift();\n if (val === undefined && (this.tail.next != null)) {\n const next = this.tail.next;\n this.tail.next = null;\n this.tail = next;\n val = this.tail.shift();\n }\n if (val?.value != null) {\n this.size -= this.calculateSize(val.value);\n }\n return val;\n }\n isEmpty() {\n return this.head.isEmpty();\n }\n}\n//# sourceMappingURL=fifo.js.map","/**\n * @packageDocumentation\n *\n * An iterable that you can push values into.\n *\n * @example\n *\n * ```js\n * import { pushable } from 'it-pushable'\n *\n * const source = pushable()\n *\n * setTimeout(() => source.push('hello'), 100)\n * setTimeout(() => source.push('world'), 200)\n * setTimeout(() => source.end(), 300)\n *\n * const start = Date.now()\n *\n * for await (const value of source) {\n * console.log(`got \"${value}\" after ${Date.now() - start}ms`)\n * }\n * console.log(`done after ${Date.now() - start}ms`)\n *\n * // Output:\n * // got \"hello\" after 105ms\n * // got \"world\" after 207ms\n * // done after 309ms\n * ```\n *\n * @example\n *\n * ```js\n * import { pushableV } from 'it-pushable'\n * import all from 'it-all'\n *\n * const source = pushableV()\n *\n * source.push(1)\n * source.push(2)\n * source.push(3)\n * source.end()\n *\n * console.info(await all(source))\n *\n * // Output:\n * // [ [1, 2, 3] ]\n * ```\n */\nimport deferred from 'p-defer';\nimport { FIFO } from './fifo.js';\nexport class AbortError extends Error {\n type;\n code;\n constructor(message, code) {\n super(message ?? 'The operation was aborted');\n this.type = 'aborted';\n this.code = code ?? 'ABORT_ERR';\n }\n}\nexport function pushable(options = {}) {\n const getNext = (buffer) => {\n const next = buffer.shift();\n if (next == null) {\n return { done: true };\n }\n if (next.error != null) {\n throw next.error;\n }\n return {\n done: next.done === true,\n // @ts-expect-error if done is false, value will be present\n value: next.value\n };\n };\n return _pushable(getNext, options);\n}\nexport function pushableV(options = {}) {\n const getNext = (buffer) => {\n let next;\n const values = [];\n while (!buffer.isEmpty()) {\n next = buffer.shift();\n if (next == null) {\n break;\n }\n if (next.error != null) {\n throw next.error;\n }\n if (next.done === false) {\n // @ts-expect-error if done is false value should be pushed\n values.push(next.value);\n }\n }\n if (next == null) {\n return { done: true };\n }\n return {\n done: next.done === true,\n value: values\n };\n };\n return _pushable(getNext, options);\n}\nfunction _pushable(getNext, options) {\n options = options ?? {};\n let onEnd = options.onEnd;\n let buffer = new FIFO();\n let pushable;\n let onNext;\n let ended;\n let drain = deferred();\n const waitNext = async () => {\n try {\n if (!buffer.isEmpty()) {\n return getNext(buffer);\n }\n if (ended) {\n return { done: true };\n }\n return await new Promise((resolve, reject) => {\n onNext = (next) => {\n onNext = null;\n buffer.push(next);\n try {\n resolve(getNext(buffer));\n }\n catch (err) {\n reject(err);\n }\n return pushable;\n };\n });\n }\n finally {\n if (buffer.isEmpty()) {\n // settle promise in the microtask queue to give consumers a chance to\n // await after calling .push\n queueMicrotask(() => {\n drain.resolve();\n drain = deferred();\n });\n }\n }\n };\n const bufferNext = (next) => {\n if (onNext != null) {\n return onNext(next);\n }\n buffer.push(next);\n return pushable;\n };\n const bufferError = (err) => {\n buffer = new FIFO();\n if (onNext != null) {\n return onNext({ error: err });\n }\n buffer.push({ error: err });\n return pushable;\n };\n const push = (value) => {\n if (ended) {\n return pushable;\n }\n // @ts-expect-error `byteLength` is not declared on PushType\n if (options?.objectMode !== true && value?.byteLength == null) {\n throw new Error('objectMode was not true but tried to push non-Uint8Array value');\n }\n return bufferNext({ done: false, value });\n };\n const end = (err) => {\n if (ended)\n return pushable;\n ended = true;\n return (err != null) ? bufferError(err) : bufferNext({ done: true });\n };\n const _return = () => {\n buffer = new FIFO();\n end();\n return { done: true };\n };\n const _throw = (err) => {\n end(err);\n return { done: true };\n };\n pushable = {\n [Symbol.asyncIterator]() { return this; },\n next: waitNext,\n return: _return,\n throw: _throw,\n push,\n end,\n get readableLength() {\n return buffer.size;\n },\n onEmpty: async (options) => {\n const signal = options?.signal;\n signal?.throwIfAborted();\n if (buffer.isEmpty()) {\n return;\n }\n let cancel;\n let listener;\n if (signal != null) {\n cancel = new Promise((resolve, reject) => {\n listener = () => {\n reject(new AbortError());\n };\n signal.addEventListener('abort', listener);\n });\n }\n try {\n await Promise.race([\n drain.promise,\n cancel\n ]);\n }\n finally {\n if (listener != null && signal != null) {\n signal?.removeEventListener('abort', listener);\n }\n }\n }\n };\n if (onEnd == null) {\n return pushable;\n }\n const _pushable = pushable;\n pushable = {\n [Symbol.asyncIterator]() { return this; },\n next() {\n return _pushable.next();\n },\n throw(err) {\n _pushable.throw(err);\n if (onEnd != null) {\n onEnd(err);\n onEnd = undefined;\n }\n return { done: true };\n },\n return() {\n _pushable.return();\n if (onEnd != null) {\n onEnd();\n onEnd = undefined;\n }\n return { done: true };\n },\n push,\n end(err) {\n _pushable.end(err);\n if (onEnd != null) {\n onEnd(err);\n onEnd = undefined;\n }\n return pushable;\n },\n get readableLength() {\n return _pushable.readableLength;\n },\n onEmpty: (opts) => {\n return _pushable.onEmpty(opts);\n }\n };\n return pushable;\n}\n//# sourceMappingURL=index.js.map","/**\n * @packageDocumentation\n *\n * Merge several (async)iterables into one, yield values as they arrive.\n *\n * Nb. sources are iterated over in parallel so the order of emitted items is not guaranteed.\n *\n * @example\n *\n * ```javascript\n * import merge from 'it-merge'\n * import all from 'it-all'\n *\n * // This can also be an iterator, generator, etc\n * const values1 = [0, 1, 2, 3, 4]\n * const values2 = [5, 6, 7, 8, 9]\n *\n * const arr = all(merge(values1, values2))\n *\n * console.info(arr) // 0, 1, 2, 3, 4, 5, 6, 7, 8, 9\n * ```\n *\n * Async sources must be awaited:\n *\n * ```javascript\n * import merge from 'it-merge'\n * import all from 'it-all'\n *\n * // This can also be an iterator, async iterator, generator, etc\n * const values1 = async function * () {\n * yield * [0, 1, 2, 3, 4]\n * }\n * const values2 = async function * () {\n * yield * [5, 6, 7, 8, 9]\n * }\n *\n * const arr = await all(merge(values1(), values2()))\n *\n * console.info(arr) // 0, 1, 5, 6, 2, 3, 4, 7, 8, 9 <- nb. order is not guaranteed\n * ```\n */\nimport { pushable } from 'it-pushable';\nfunction isAsyncIterable(thing) {\n return thing[Symbol.asyncIterator] != null;\n}\nfunction merge(...sources) {\n const syncSources = [];\n for (const source of sources) {\n if (!isAsyncIterable(source)) {\n syncSources.push(source);\n }\n }\n if (syncSources.length === sources.length) {\n // all sources are synchronous\n return (function* () {\n for (const source of syncSources) {\n yield* source;\n }\n })();\n }\n return (async function* () {\n const output = pushable({\n objectMode: true\n });\n void Promise.resolve().then(async () => {\n try {\n await Promise.all(sources.map(async (source) => {\n for await (const item of source) {\n output.push(item);\n }\n }));\n output.end();\n }\n catch (err) {\n output.end(err);\n }\n });\n yield* output;\n })();\n}\nexport default merge;\n//# sourceMappingURL=index.js.map","import { pushable } from 'it-pushable';\nimport merge from 'it-merge';\nexport function pipe(first, ...rest) {\n if (first == null) {\n throw new Error('Empty pipeline');\n }\n // Duplex at start: wrap in function and return duplex source\n if (isDuplex(first)) {\n const duplex = first;\n first = () => duplex.source;\n // Iterable at start: wrap in function\n }\n else if (isIterable(first) || isAsyncIterable(first)) {\n const source = first;\n first = () => source;\n }\n const fns = [first, ...rest];\n if (fns.length > 1) {\n // Duplex at end: use duplex sink\n if (isDuplex(fns[fns.length - 1])) {\n fns[fns.length - 1] = fns[fns.length - 1].sink;\n }\n }\n if (fns.length > 2) {\n // Duplex in the middle, consume source with duplex sink and return duplex source\n for (let i = 1; i < fns.length - 1; i++) {\n if (isDuplex(fns[i])) {\n fns[i] = duplexPipelineFn(fns[i]);\n }\n }\n }\n return rawPipe(...fns);\n}\nexport const rawPipe = (...fns) => {\n let res;\n while (fns.length > 0) {\n res = fns.shift()(res);\n }\n return res;\n};\nconst isAsyncIterable = (obj) => {\n return obj?.[Symbol.asyncIterator] != null;\n};\nconst isIterable = (obj) => {\n return obj?.[Symbol.iterator] != null;\n};\nconst isDuplex = (obj) => {\n if (obj == null) {\n return false;\n }\n return obj.sink != null && obj.source != null;\n};\nconst duplexPipelineFn = (duplex) => {\n return (source) => {\n const p = duplex.sink(source);\n if (p?.then != null) {\n const stream = pushable({\n objectMode: true\n });\n p.then(() => {\n stream.end();\n }, (err) => {\n stream.end(err);\n });\n let sourceWrap;\n const source = duplex.source;\n if (isAsyncIterable(source)) {\n sourceWrap = async function* () {\n yield* source;\n stream.end();\n };\n }\n else if (isIterable(source)) {\n sourceWrap = function* () {\n yield* source;\n stream.end();\n };\n }\n else {\n throw new Error('Unknown duplex source type - must be Iterable or AsyncIterable');\n }\n return merge(stream, sourceWrap());\n }\n return duplex.source;\n };\n};\n//# sourceMappingURL=index.js.map","import { Logger } from \"@waku/utils\";\nimport { selectConnection } from \"./utils.js\";\nconst CONNECTION_TIMEOUT = 5_000;\nconst RETRY_BACKOFF_BASE = 1_000;\nconst MAX_RETRIES = 3;\nexport class StreamManager {\n multicodec;\n getConnections;\n addEventListener;\n streamPool;\n log;\n constructor(multicodec, getConnections, addEventListener) {\n this.multicodec = multicodec;\n this.getConnections = getConnections;\n this.addEventListener = addEventListener;\n this.log = new Logger(`stream-manager:${multicodec}`);\n this.streamPool = new Map();\n this.addEventListener(\"peer:update\", this.handlePeerUpdateStreamPool);\n }\n async getStream(peer) {\n const peerIdStr = peer.id.toString();\n const streamPromise = this.streamPool.get(peerIdStr);\n if (!streamPromise) {\n return this.createStream(peer);\n }\n this.streamPool.delete(peerIdStr);\n this.prepareStream(peer);\n try {\n const stream = await streamPromise;\n if (stream && stream.status !== \"closed\") {\n return stream;\n }\n }\n catch (error) {\n this.log.warn(`Failed to get stream for ${peerIdStr} -- `, error);\n this.log.warn(\"Attempting to create a new stream for the peer\");\n }\n return this.createStream(peer);\n }\n async createStream(peer, retries = 0) {\n const connections = this.getConnections(peer.id);\n const connection = selectConnection(connections);\n if (!connection) {\n throw new Error(\"Failed to get a connection to the peer\");\n }\n try {\n return await connection.newStream(this.multicodec);\n }\n catch (error) {\n if (retries < MAX_RETRIES) {\n const backoff = RETRY_BACKOFF_BASE * Math.pow(2, retries);\n await new Promise((resolve) => setTimeout(resolve, backoff));\n return this.createStream(peer, retries + 1);\n }\n throw new Error(`Failed to create a new stream for ${peer.id.toString()} -- ` + error);\n }\n }\n prepareStream(peer) {\n const timeoutPromise = new Promise((resolve) => setTimeout(resolve, CONNECTION_TIMEOUT));\n const streamPromise = Promise.race([\n this.createStream(peer),\n timeoutPromise.then(() => {\n throw new Error(\"Connection timeout\");\n })\n ]).catch((error) => {\n this.log.error(`Failed to prepare a new stream for ${peer.id.toString()} -- `, error);\n });\n this.streamPool.set(peer.id.toString(), streamPromise);\n }\n handlePeerUpdateStreamPool = (evt) => {\n const { peer } = evt.detail;\n if (peer.protocols.includes(this.multicodec)) {\n const isConnected = this.isConnectedTo(peer.id);\n if (isConnected) {\n this.log.info(`Preemptively opening a stream to ${peer.id.toString()}`);\n this.prepareStream(peer);\n }\n else {\n const peerIdStr = peer.id.toString();\n this.streamPool.delete(peerIdStr);\n this.log.info(`Removed pending stream for disconnected peer ${peerIdStr}`);\n }\n }\n };\n isConnectedTo(peerId) {\n const connections = this.getConnections(peerId);\n return connections.some((connection) => connection.status === \"open\");\n }\n}\n//# sourceMappingURL=stream_manager.js.map","export function selectConnection(connections) {\n if (!connections.length)\n return;\n if (connections.length === 1)\n return connections[0];\n let latestConnection;\n connections.forEach((connection) => {\n if (connection.status === \"open\") {\n if (!latestConnection) {\n latestConnection = connection;\n }\n else if (connection.timeline.open > latestConnection.timeline.open) {\n latestConnection = connection;\n }\n }\n });\n return latestConnection;\n}\n//# sourceMappingURL=utils.js.map","import { pubsubTopicsToShardInfo } from \"@waku/utils\";\nimport { getConnectedPeersForProtocolAndShard, getPeersForProtocol, sortPeersByLatency } from \"@waku/utils/libp2p\";\nimport { filterPeersByDiscovery } from \"./filterPeers.js\";\nimport { StreamManager } from \"./stream_manager/index.js\";\n/**\n * A class with predefined helpers, to be used as a base to implement Waku\n * Protocols.\n */\nexport class BaseProtocol {\n multicodec;\n components;\n log;\n pubsubTopics;\n addLibp2pEventListener;\n removeLibp2pEventListener;\n streamManager;\n constructor(multicodec, components, log, pubsubTopics) {\n this.multicodec = multicodec;\n this.components = components;\n this.log = log;\n this.pubsubTopics = pubsubTopics;\n this.addLibp2pEventListener = components.events.addEventListener.bind(components.events);\n this.removeLibp2pEventListener = components.events.removeEventListener.bind(components.events);\n this.streamManager = new StreamManager(multicodec, components.connectionManager.getConnections.bind(components.connectionManager), this.addLibp2pEventListener);\n }\n async getStream(peer) {\n return this.streamManager.getStream(peer);\n }\n get peerStore() {\n return this.components.peerStore;\n }\n /**\n * Returns known peers from the address book (`libp2p.peerStore`) that support\n * the class protocol. Waku may or may not be currently connected to these\n * peers.\n */\n async allPeers() {\n return getPeersForProtocol(this.peerStore, [this.multicodec]);\n }\n async connectedPeers() {\n const peers = await this.allPeers();\n return peers.filter((peer) => {\n return (this.components.connectionManager.getConnections(peer.id).length > 0);\n });\n }\n /**\n * Retrieves a list of connected peers that support the protocol. The list is sorted by latency.\n *\n * @param numPeers - The total number of peers to retrieve. If 0, all peers are returned.\n * @param maxBootstrapPeers - The maximum number of bootstrap peers to retrieve.\n \n * @returns A list of peers that support the protocol sorted by latency.\n */\n async getPeers({ numPeers, maxBootstrapPeers } = {\n maxBootstrapPeers: 1,\n numPeers: 0\n }) {\n // Retrieve all connected peers that support the protocol & shard (if configured)\n const connectedPeersForProtocolAndShard = await getConnectedPeersForProtocolAndShard(this.components.connectionManager.getConnections(), this.peerStore, [this.multicodec], pubsubTopicsToShardInfo(this.pubsubTopics));\n // Filter the peers based on discovery & number of peers requested\n const filteredPeers = filterPeersByDiscovery(connectedPeersForProtocolAndShard, numPeers, maxBootstrapPeers);\n // Sort the peers by latency\n const sortedFilteredPeers = await sortPeersByLatency(this.peerStore, filteredPeers);\n if (sortedFilteredPeers.length === 0) {\n this.log.warn(\"No peers found. Ensure you have a connection to the network.\");\n }\n if (sortedFilteredPeers.length < numPeers) {\n this.log.warn(`Only ${sortedFilteredPeers.length} peers found. Requested ${numPeers}.`);\n }\n return sortedFilteredPeers;\n }\n}\n//# sourceMappingURL=base_protocol.js.map","import { bytesToUtf8 } from \"../bytes/index.js\";\nimport { decodeRelayShard } from \"../common/relay_shard_codec.js\";\n/**\n * Returns a pseudo-random peer that supports the given protocol.\n * Useful for protocols such as store and light push\n */\nexport function selectRandomPeer(peers) {\n if (peers.length === 0)\n return;\n const index = Math.round(Math.random() * (peers.length - 1));\n return peers[index];\n}\n/**\n * Function to sort peers by latency from lowest to highest\n * @param peerStore - The Libp2p PeerStore\n * @param peers - The list of peers to choose from\n * @returns Sorted array of peers by latency\n */\nexport async function sortPeersByLatency(peerStore, peers) {\n if (peers.length === 0)\n return [];\n const results = await Promise.all(peers.map(async (peer) => {\n try {\n const pingBytes = (await peerStore.get(peer.id)).metadata.get(\"ping\");\n if (!pingBytes)\n return { peer, ping: Infinity };\n const ping = Number(bytesToUtf8(pingBytes));\n return { peer, ping };\n }\n catch (error) {\n return { peer, ping: Infinity };\n }\n }));\n // filter out null values\n const validResults = results.filter((result) => result !== null);\n return validResults\n .sort((a, b) => a.ping - b.ping)\n .map((result) => result.peer);\n}\n/**\n * Returns the list of peers that supports the given protocol.\n */\nexport async function getPeersForProtocol(peerStore, protocols) {\n const peers = [];\n await peerStore.forEach((peer) => {\n for (let i = 0; i < protocols.length; i++) {\n if (peer.protocols.includes(protocols[i])) {\n peers.push(peer);\n break;\n }\n }\n });\n return peers;\n}\nexport async function getConnectedPeersForProtocolAndShard(connections, peerStore, protocols, shardInfo) {\n const openConnections = connections.filter((connection) => connection.status === \"open\");\n const peerPromises = openConnections.map(async (connection) => {\n const peer = await peerStore.get(connection.remotePeer);\n const supportsProtocol = protocols.some((protocol) => peer.protocols.includes(protocol));\n if (supportsProtocol) {\n if (shardInfo) {\n const encodedPeerShardInfo = peer.metadata.get(\"shardInfo\");\n const peerShardInfo = encodedPeerShardInfo && decodeRelayShard(encodedPeerShardInfo);\n if (peerShardInfo && shardInfo.clusterId === peerShardInfo.clusterId) {\n return peer;\n }\n }\n else {\n return peer;\n }\n }\n return null;\n });\n const peersWithNulls = await Promise.all(peerPromises);\n return peersWithNulls.filter((peer) => peer !== null);\n}\n//# sourceMappingURL=index.js.map","import { Tags } from \"@waku/interfaces\";\n/**\n * Retrieves a list of peers based on the specified criteria:\n * 1. If numPeers is 0, return all peers\n * 2. Bootstrap peers are prioritized\n * 3. Non-bootstrap peers are randomly selected to fill up to numPeers\n *\n * @param peers - The list of peers to filter from.\n * @param numPeers - The total number of peers to retrieve. If 0, all peers are returned, irrespective of `maxBootstrapPeers`.\n * @param maxBootstrapPeers - The maximum number of bootstrap peers to retrieve.\n * @returns An array of peers based on the specified criteria.\n */\nexport function filterPeersByDiscovery(peers, numPeers, maxBootstrapPeers) {\n // Collect the bootstrap peers up to the specified maximum\n let bootstrapPeers = peers\n .filter((peer) => peer.tags.has(Tags.BOOTSTRAP))\n .slice(0, maxBootstrapPeers);\n // If numPeers is less than the number of bootstrap peers, adjust the bootstrapPeers array\n if (numPeers > 0 && numPeers < bootstrapPeers.length) {\n bootstrapPeers = bootstrapPeers.slice(0, numPeers);\n }\n // Collect non-bootstrap peers\n const nonBootstrapPeers = peers.filter((peer) => !peer.tags.has(Tags.BOOTSTRAP));\n // If numPeers is 0, return all peers\n if (numPeers === 0) {\n return [...bootstrapPeers, ...nonBootstrapPeers];\n }\n // Initialize the list of selected peers with the bootstrap peers\n const selectedPeers = [...bootstrapPeers];\n // Fill up to numPeers with remaining random peers if needed\n while (selectedPeers.length < numPeers && nonBootstrapPeers.length > 0) {\n const randomIndex = Math.floor(Math.random() * nonBootstrapPeers.length);\n const randomPeer = nonBootstrapPeers.splice(randomIndex, 1)[0];\n selectedPeers.push(randomPeer);\n }\n return selectedPeers;\n}\n//# sourceMappingURL=filterPeers.js.map","const randomUUID = typeof crypto !== 'undefined' && crypto.randomUUID && crypto.randomUUID.bind(crypto);\nexport default {\n randomUUID\n};","// Unique ID creation requires a high quality random # generator. In the browser we therefore\n// require the crypto API and do not support built-in fallback to lower quality random number\n// generators (like Math.random()).\nlet getRandomValues;\nconst rnds8 = new Uint8Array(16);\nexport default function rng() {\n // lazy load so that environments that need to polyfill have a chance to do so\n if (!getRandomValues) {\n // getRandomValues needs to be invoked in a context where \"this\" is a Crypto implementation.\n getRandomValues = typeof crypto !== 'undefined' && crypto.getRandomValues && crypto.getRandomValues.bind(crypto);\n\n if (!getRandomValues) {\n throw new Error('crypto.getRandomValues() not supported. See https://github.com/uuidjs/uuid#getrandomvalues-not-supported');\n }\n }\n\n return getRandomValues(rnds8);\n}","import validate from './validate.js';\n/**\n * Convert array of 16 byte values to UUID string format of the form:\n * XXXXXXXX-XXXX-XXXX-XXXX-XXXXXXXXXXXX\n */\n\nconst byteToHex = [];\n\nfor (let i = 0; i < 256; ++i) {\n byteToHex.push((i + 0x100).toString(16).slice(1));\n}\n\nexport function unsafeStringify(arr, offset = 0) {\n // Note: Be careful editing this code! It's been tuned for performance\n // and works in ways you may not expect. See https://github.com/uuidjs/uuid/pull/434\n return byteToHex[arr[offset + 0]] + byteToHex[arr[offset + 1]] + byteToHex[arr[offset + 2]] + byteToHex[arr[offset + 3]] + '-' + byteToHex[arr[offset + 4]] + byteToHex[arr[offset + 5]] + '-' + byteToHex[arr[offset + 6]] + byteToHex[arr[offset + 7]] + '-' + byteToHex[arr[offset + 8]] + byteToHex[arr[offset + 9]] + '-' + byteToHex[arr[offset + 10]] + byteToHex[arr[offset + 11]] + byteToHex[arr[offset + 12]] + byteToHex[arr[offset + 13]] + byteToHex[arr[offset + 14]] + byteToHex[arr[offset + 15]];\n}\n\nfunction stringify(arr, offset = 0) {\n const uuid = unsafeStringify(arr, offset); // Consistency check for valid UUID. If this throws, it's likely due to one\n // of the following:\n // - One or more input array values don't map to a hex octet (leading to\n // \"undefined\" in the uuid)\n // - Invalid input values for the RFC `version` or `variant` fields\n\n if (!validate(uuid)) {\n throw TypeError('Stringified UUID is invalid');\n }\n\n return uuid;\n}\n\nexport default stringify;","import native from './native.js';\nimport rng from './rng.js';\nimport { unsafeStringify } from './stringify.js';\n\nfunction v4(options, buf, offset) {\n if (native.randomUUID && !buf && !options) {\n return native.randomUUID();\n }\n\n options = options || {};\n const rnds = options.random || (options.rng || rng)(); // Per 4.4, set bits for version and `clock_seq_hi_and_reserved`\n\n rnds[6] = rnds[6] & 0x0f | 0x40;\n rnds[8] = rnds[8] & 0x3f | 0x80; // Copy bytes to buffer, if provided\n\n if (buf) {\n offset = offset || 0;\n\n for (let i = 0; i < 16; ++i) {\n buf[offset + i] = rnds[i];\n }\n\n return buf;\n }\n\n return unsafeStringify(rnds);\n}\n\nexport default v4;","import { proto_filter_v2 as proto } from \"@waku/proto\";\nimport { v4 as uuid } from \"uuid\";\n/**\n * FilterPushRPC represents a message conforming to the Waku FilterPush protocol.\n * Protocol documentation: https://rfc.vac.dev/spec/12/\n */\nexport class FilterPushRpc {\n proto;\n constructor(proto) {\n this.proto = proto;\n }\n static decode(bytes) {\n const res = proto.MessagePush.decode(bytes);\n return new FilterPushRpc(res);\n }\n encode() {\n return proto.MessagePush.encode(this.proto);\n }\n get wakuMessage() {\n return this.proto.wakuMessage;\n }\n /**\n * Get the pubsub topic from the FilterPushRpc object.\n * @returns string\n */\n get pubsubTopic() {\n return this.proto.pubsubTopic;\n }\n}\nexport class FilterSubscribeRpc {\n proto;\n constructor(proto) {\n this.proto = proto;\n }\n static createSubscribeRequest(pubsubTopic, contentTopics) {\n return new FilterSubscribeRpc({\n requestId: uuid(),\n filterSubscribeType: proto.FilterSubscribeRequest.FilterSubscribeType.SUBSCRIBE,\n pubsubTopic,\n contentTopics\n });\n }\n static createUnsubscribeRequest(pubsubTopic, contentTopics) {\n return new FilterSubscribeRpc({\n requestId: uuid(),\n filterSubscribeType: proto.FilterSubscribeRequest.FilterSubscribeType.UNSUBSCRIBE,\n pubsubTopic,\n contentTopics\n });\n }\n static createUnsubscribeAllRequest(pubsubTopic) {\n return new FilterSubscribeRpc({\n requestId: uuid(),\n filterSubscribeType: proto.FilterSubscribeRequest.FilterSubscribeType.UNSUBSCRIBE_ALL,\n pubsubTopic,\n contentTopics: []\n });\n }\n static createSubscriberPingRequest() {\n return new FilterSubscribeRpc({\n requestId: uuid(),\n filterSubscribeType: proto.FilterSubscribeRequest.FilterSubscribeType.SUBSCRIBER_PING,\n pubsubTopic: \"\",\n contentTopics: []\n });\n }\n static decode(bytes) {\n const res = proto.FilterSubscribeRequest.decode(bytes);\n return new FilterSubscribeRpc(res);\n }\n encode() {\n return proto.FilterSubscribeRequest.encode(this.proto);\n }\n get filterSubscribeType() {\n return this.proto.filterSubscribeType;\n }\n get requestId() {\n return this.proto.requestId;\n }\n get pubsubTopic() {\n return this.proto.pubsubTopic;\n }\n get contentTopics() {\n return this.proto.contentTopics;\n }\n}\nexport class FilterSubscribeResponse {\n proto;\n constructor(proto) {\n this.proto = proto;\n }\n static decode(bytes) {\n const res = proto.FilterSubscribeResponse.decode(bytes);\n return new FilterSubscribeResponse(res);\n }\n encode() {\n return proto.FilterSubscribeResponse.encode(this.proto);\n }\n get statusCode() {\n return this.proto.statusCode;\n }\n get statusDesc() {\n return this.proto.statusDesc;\n }\n get requestId() {\n return this.proto.requestId;\n }\n}\n//# sourceMappingURL=filter_rpc.js.map","import { ProtocolError } from \"@waku/interfaces\";\nimport { Logger } from \"@waku/utils\";\nimport all from \"it-all\";\nimport * as lp from \"it-length-prefixed\";\nimport { pipe } from \"it-pipe\";\nimport { BaseProtocol } from \"../base_protocol.js\";\nimport { FilterPushRpc, FilterSubscribeResponse, FilterSubscribeRpc } from \"./filter_rpc.js\";\nconst log = new Logger(\"filter:v2\");\nexport const FilterCodecs = {\n SUBSCRIBE: \"/vac/waku/filter-subscribe/2.0.0-beta1\",\n PUSH: \"/vac/waku/filter-push/2.0.0-beta1\"\n};\nexport class FilterCore extends BaseProtocol {\n handleIncomingMessage;\n pubsubTopics;\n constructor(handleIncomingMessage, pubsubTopics, libp2p) {\n super(FilterCodecs.SUBSCRIBE, libp2p.components, log, pubsubTopics);\n this.handleIncomingMessage = handleIncomingMessage;\n this.pubsubTopics = pubsubTopics;\n libp2p\n .handle(FilterCodecs.PUSH, this.onRequest.bind(this), {\n maxInboundStreams: 100\n })\n .catch((e) => {\n log.error(\"Failed to register \", FilterCodecs.PUSH, e);\n });\n }\n async subscribe(pubsubTopic, peer, contentTopics) {\n const stream = await this.getStream(peer);\n const request = FilterSubscribeRpc.createSubscribeRequest(pubsubTopic, contentTopics);\n let res;\n try {\n res = await pipe([request.encode()], lp.encode, stream, lp.decode, async (source) => await all(source));\n }\n catch (error) {\n log.error(\"Failed to send subscribe request\", error);\n return {\n success: null,\n failure: {\n error: ProtocolError.GENERIC_FAIL,\n peerId: peer.id\n }\n };\n }\n const { statusCode, requestId, statusDesc } = FilterSubscribeResponse.decode(res[0].slice());\n if (statusCode < 200 || statusCode >= 300) {\n log.error(`Filter subscribe request ${requestId} failed with status code ${statusCode}: ${statusDesc}`);\n return {\n failure: {\n error: ProtocolError.REMOTE_PEER_REJECTED,\n peerId: peer.id\n },\n success: null\n };\n }\n return {\n failure: null,\n success: peer.id\n };\n }\n async unsubscribe(pubsubTopic, peer, contentTopics) {\n let stream;\n try {\n stream = await this.getStream(peer);\n }\n catch (error) {\n log.error(`Failed to get a stream for remote peer${peer.id.toString()}`, error);\n return {\n success: null,\n failure: {\n error: ProtocolError.NO_STREAM_AVAILABLE,\n peerId: peer.id\n }\n };\n }\n const unsubscribeRequest = FilterSubscribeRpc.createUnsubscribeRequest(pubsubTopic, contentTopics);\n try {\n await pipe([unsubscribeRequest.encode()], lp.encode, stream.sink);\n }\n catch (error) {\n log.error(\"Failed to send unsubscribe request\", error);\n return {\n success: null,\n failure: {\n error: ProtocolError.GENERIC_FAIL,\n peerId: peer.id\n }\n };\n }\n return {\n success: peer.id,\n failure: null\n };\n }\n async unsubscribeAll(pubsubTopic, peer) {\n const stream = await this.getStream(peer);\n const request = FilterSubscribeRpc.createUnsubscribeAllRequest(pubsubTopic);\n const res = await pipe([request.encode()], lp.encode, stream, lp.decode, async (source) => await all(source));\n if (!res || !res.length) {\n return {\n failure: {\n error: ProtocolError.NO_RESPONSE,\n peerId: peer.id\n },\n success: null\n };\n }\n const { statusCode, requestId, statusDesc } = FilterSubscribeResponse.decode(res[0].slice());\n if (statusCode < 200 || statusCode >= 300) {\n log.error(`Filter unsubscribe all request ${requestId} failed with status code ${statusCode}: ${statusDesc}`);\n return {\n failure: {\n error: ProtocolError.REMOTE_PEER_REJECTED,\n peerId: peer.id\n },\n success: null\n };\n }\n return {\n failure: null,\n success: peer.id\n };\n }\n async ping(peer) {\n let stream;\n try {\n stream = await this.getStream(peer);\n }\n catch (error) {\n log.error(`Failed to get a stream for remote peer${peer.id.toString()}`, error);\n return {\n success: null,\n failure: {\n error: ProtocolError.NO_STREAM_AVAILABLE,\n peerId: peer.id\n }\n };\n }\n const request = FilterSubscribeRpc.createSubscriberPingRequest();\n let res;\n try {\n res = await pipe([request.encode()], lp.encode, stream, lp.decode, async (source) => await all(source));\n }\n catch (error) {\n log.error(\"Failed to send ping request\", error);\n return {\n success: null,\n failure: {\n error: ProtocolError.GENERIC_FAIL,\n peerId: peer.id\n }\n };\n }\n if (!res || !res.length) {\n return {\n success: null,\n failure: {\n error: ProtocolError.NO_RESPONSE,\n peerId: peer.id\n }\n };\n }\n const { statusCode, requestId, statusDesc } = FilterSubscribeResponse.decode(res[0].slice());\n if (statusCode < 200 || statusCode >= 300) {\n log.error(`Filter ping request ${requestId} failed with status code ${statusCode}: ${statusDesc}`);\n return {\n success: null,\n failure: {\n error: ProtocolError.REMOTE_PEER_REJECTED,\n peerId: peer.id\n }\n };\n }\n return {\n success: peer.id,\n failure: null\n };\n }\n onRequest(streamData) {\n const { connection, stream } = streamData;\n const { remotePeer } = connection;\n log.info(`Received message from ${remotePeer.toString()}`);\n try {\n pipe(stream, lp.decode, async (source) => {\n for await (const bytes of source) {\n const response = FilterPushRpc.decode(bytes.slice());\n const { pubsubTopic, wakuMessage } = response;\n if (!wakuMessage) {\n log.error(\"Received empty message\");\n return;\n }\n if (!pubsubTopic) {\n log.error(\"Pubsub topic missing from push message\");\n return;\n }\n await this.handleIncomingMessage(pubsubTopic, wakuMessage, connection.remotePeer.toString());\n }\n }).then(() => {\n log.info(\"Receiving pipe closed.\");\n }, (e) => {\n log.error(\"Error with receiving pipe\", e);\n });\n }\n catch (e) {\n log.error(\"Error decoding message\", e);\n }\n }\n}\n//# sourceMappingURL=index.js.map","import { proto_lightpush as proto } from \"@waku/proto\";\nimport { v4 as uuid } from \"uuid\";\nexport class PushRpc {\n proto;\n constructor(proto) {\n this.proto = proto;\n }\n static createRequest(message, pubsubTopic) {\n return new PushRpc({\n requestId: uuid(),\n request: {\n message: message,\n pubsubTopic: pubsubTopic\n },\n response: undefined\n });\n }\n static decode(bytes) {\n const res = proto.PushRpc.decode(bytes);\n return new PushRpc(res);\n }\n encode() {\n return proto.PushRpc.encode(this.proto);\n }\n get query() {\n return this.proto.request;\n }\n get response() {\n return this.proto.response;\n }\n}\n//# sourceMappingURL=push_rpc.js.map","import { ProtocolError } from \"@waku/interfaces\";\n// should match nwaku\n// https://github.com/waku-org/nwaku/blob/c3cb06ac6c03f0f382d3941ea53b330f6a8dd127/waku/waku_rln_relay/rln_relay.nim#L309\n// https://github.com/waku-org/nwaku/blob/c3cb06ac6c03f0f382d3941ea53b330f6a8dd127/tests/waku_rln_relay/rln/waku_rln_relay_utils.nim#L20\nconst RLN_GENERATION_PREFIX_ERROR = \"could not generate rln-v2 proof\";\nexport const isRLNResponseError = (info) => {\n if (!info) {\n return false;\n }\n return info.includes(RLN_GENERATION_PREFIX_ERROR);\n};\nexport const matchRLNErrorMessage = (info) => {\n const rlnErrorMap = {\n [ProtocolError.RLN_IDENTITY_MISSING]: ProtocolError.RLN_IDENTITY_MISSING,\n [ProtocolError.RLN_MEMBERSHIP_INDEX]: ProtocolError.RLN_MEMBERSHIP_INDEX,\n [ProtocolError.RLN_LIMIT_MISSING]: ProtocolError.RLN_LIMIT_MISSING\n };\n const infoLowerCase = info.toLowerCase();\n for (const errorKey in rlnErrorMap) {\n if (infoLowerCase.includes(errorKey.toLowerCase())) {\n return rlnErrorMap[errorKey];\n }\n }\n return ProtocolError.RLN_PROOF_GENERATION;\n};\n//# sourceMappingURL=utils.js.map","import { ProtocolError } from \"@waku/interfaces\";\nimport { PushResponse } from \"@waku/proto\";\nimport { isMessageSizeUnderCap } from \"@waku/utils\";\nimport { Logger } from \"@waku/utils\";\nimport all from \"it-all\";\nimport * as lp from \"it-length-prefixed\";\nimport { pipe } from \"it-pipe\";\nimport { Uint8ArrayList } from \"uint8arraylist\";\nimport { BaseProtocol } from \"../base_protocol.js\";\nimport { PushRpc } from \"./push_rpc.js\";\nimport { isRLNResponseError, matchRLNErrorMessage } from \"./utils.js\";\nconst log = new Logger(\"light-push\");\nexport const LightPushCodec = \"/vac/waku/lightpush/2.0.0-beta1\";\nexport { PushResponse };\n/**\n * Implements the [Waku v2 Light Push protocol](https://rfc.vac.dev/spec/19/).\n */\nexport class LightPushCore extends BaseProtocol {\n pubsubTopics;\n constructor(pubsubTopics, libp2p) {\n super(LightPushCodec, libp2p.components, log, pubsubTopics);\n this.pubsubTopics = pubsubTopics;\n }\n async preparePushMessage(encoder, message) {\n try {\n if (!message.payload || message.payload.length === 0) {\n log.error(\"Failed to send waku light push: payload is empty\");\n return { query: null, error: ProtocolError.EMPTY_PAYLOAD };\n }\n if (!(await isMessageSizeUnderCap(encoder, message))) {\n log.error(\"Failed to send waku light push: message is bigger than 1MB\");\n return { query: null, error: ProtocolError.SIZE_TOO_BIG };\n }\n const protoMessage = await encoder.toProtoObj(message);\n if (!protoMessage) {\n log.error(\"Failed to encode to protoMessage, aborting push\");\n return {\n query: null,\n error: ProtocolError.ENCODE_FAILED\n };\n }\n const query = PushRpc.createRequest(protoMessage, encoder.pubsubTopic);\n return { query, error: null };\n }\n catch (error) {\n log.error(\"Failed to prepare push message\", error);\n return {\n query: null,\n error: ProtocolError.GENERIC_FAIL\n };\n }\n }\n async send(encoder, message, peer) {\n const { query, error: preparationError } = await this.preparePushMessage(encoder, message);\n if (preparationError || !query) {\n return {\n success: null,\n failure: {\n error: preparationError,\n peerId: peer.id\n }\n };\n }\n let stream;\n try {\n stream = await this.getStream(peer);\n }\n catch (error) {\n log.error(\"Failed to get stream\", error);\n return {\n success: null,\n failure: {\n error: ProtocolError.NO_STREAM_AVAILABLE,\n peerId: peer.id\n }\n };\n }\n let res;\n try {\n res = await pipe([query.encode()], lp.encode, stream, lp.decode, async (source) => await all(source));\n }\n catch (err) {\n log.error(\"Failed to send waku light push request\", err);\n return {\n success: null,\n failure: {\n error: ProtocolError.GENERIC_FAIL,\n peerId: peer.id\n }\n };\n }\n const bytes = new Uint8ArrayList();\n res.forEach((chunk) => {\n bytes.append(chunk);\n });\n let response;\n try {\n response = PushRpc.decode(bytes).response;\n }\n catch (err) {\n log.error(\"Failed to decode push reply\", err);\n return {\n success: null,\n failure: {\n error: ProtocolError.DECODE_FAILED,\n peerId: peer.id\n }\n };\n }\n if (!response) {\n log.error(\"Remote peer fault: No response in PushRPC\");\n return {\n success: null,\n failure: {\n error: ProtocolError.NO_RESPONSE,\n peerId: peer.id\n }\n };\n }\n if (isRLNResponseError(response.info)) {\n const rlnErrorCase = matchRLNErrorMessage(response.info);\n log.error(\"Remote peer rejected the message: \", rlnErrorCase);\n return {\n success: null,\n failure: {\n error: rlnErrorCase,\n peerId: peer.id\n }\n };\n }\n if (!response.isSuccess) {\n log.error(\"Remote peer rejected the message: \", response.info);\n return {\n success: null,\n failure: {\n error: ProtocolError.REMOTE_PEER_REJECTED,\n peerId: peer.id\n }\n };\n }\n return { success: peer.id, failure: null };\n }\n}\n//# sourceMappingURL=index.js.map","const MB = 1024 ** 2;\nconst SIZE_CAP_IN_MB = 1;\n/**\n * Return whether the size of the message is under the upper limit for the network.\n * This performs a protobuf encoding! If you have access to the fully encoded message,\n * use {@link isSizeUnderCapBuf} instead.\n * @param message\n * @param encoder\n */\nexport async function isMessageSizeUnderCap(encoder, message) {\n const buf = await encoder.toWire(message);\n if (!buf)\n return false;\n return isWireSizeUnderCap(buf);\n}\nexport const isWireSizeUnderCap = (buf) => buf.length / MB <= SIZE_CAP_IN_MB;\n//# sourceMappingURL=is_size_valid.js.map","const EmptyMessage = {\n payload: new Uint8Array(),\n contentTopic: \"\",\n version: undefined,\n timestamp: undefined,\n meta: undefined,\n rateLimitProof: undefined,\n ephemeral: undefined\n};\nexport function toProtoMessage(wire) {\n return { ...EmptyMessage, ...wire };\n}\n//# sourceMappingURL=to_proto_message.js.map","import { proto_store as proto } from \"@waku/proto\";\nimport { v4 as uuid } from \"uuid\";\n// https://github.com/waku-org/nwaku/blob/7205f95cff9f49ca0bb762e8fd0bf56a6a7f3b3b/waku/waku_store/common.nim#L12\nexport const DEFAULT_PAGE_SIZE = 20;\nexport const MAX_PAGE_SIZE = 100;\nconst ONE_MILLION = 1_000000;\nexport class StoreQueryRequest {\n proto;\n constructor(proto) {\n this.proto = proto;\n }\n static create(params) {\n const request = new StoreQueryRequest({\n ...params,\n requestId: uuid(),\n timeStart: params.timeStart\n ? BigInt(params.timeStart.getTime() * ONE_MILLION)\n : undefined,\n timeEnd: params.timeEnd\n ? BigInt(params.timeEnd.getTime() * ONE_MILLION)\n : undefined,\n messageHashes: params.messageHashes || [],\n paginationLimit: params.paginationLimit\n ? BigInt(params.paginationLimit)\n : undefined\n });\n // Validate request parameters based on RFC\n if ((params.pubsubTopic && !params.contentTopics) ||\n (!params.pubsubTopic && params.contentTopics)) {\n throw new Error(\"Both pubsubTopic and contentTopics must be set or unset\");\n }\n if (params.messageHashes &&\n (params.pubsubTopic ||\n params.contentTopics ||\n params.timeStart ||\n params.timeEnd)) {\n throw new Error(\"Message hash lookup queries cannot include content filter criteria\");\n }\n return request;\n }\n static decode(bytes) {\n const res = proto.StoreQueryRequest.decode(bytes);\n return new StoreQueryRequest(res);\n }\n encode() {\n return proto.StoreQueryRequest.encode(this.proto);\n }\n}\nexport class StoreQueryResponse {\n proto;\n constructor(proto) {\n this.proto = proto;\n }\n static decode(bytes) {\n const res = proto.StoreQueryResponse.decode(bytes);\n return new StoreQueryResponse(res);\n }\n encode() {\n return proto.StoreQueryResponse.encode(this.proto);\n }\n get statusCode() {\n return this.proto.statusCode;\n }\n get statusDesc() {\n return this.proto.statusDesc;\n }\n get messages() {\n return this.proto.messages;\n }\n get paginationCursor() {\n return this.proto.paginationCursor;\n }\n}\n//# sourceMappingURL=rpc.js.map","import { Logger } from \"@waku/utils\";\nimport all from \"it-all\";\nimport * as lp from \"it-length-prefixed\";\nimport { pipe } from \"it-pipe\";\nimport { Uint8ArrayList } from \"uint8arraylist\";\nimport { BaseProtocol } from \"../base_protocol.js\";\nimport { toProtoMessage } from \"../to_proto_message.js\";\nimport { DEFAULT_PAGE_SIZE, MAX_PAGE_SIZE, StoreQueryRequest, StoreQueryResponse } from \"./rpc.js\";\nconst log = new Logger(\"store\");\nexport const StoreCodec = \"/vac/waku/store-query/3.0.0\";\nexport class StoreCore extends BaseProtocol {\n pubsubTopics;\n constructor(pubsubTopics, libp2p) {\n super(StoreCodec, libp2p.components, log, pubsubTopics);\n this.pubsubTopics = pubsubTopics;\n }\n async *queryPerPage(queryOpts, decoders, peer) {\n if (queryOpts.contentTopics.toString() !==\n Array.from(decoders.keys()).toString()) {\n throw new Error(\"Internal error, the decoders should match the query's content topics\");\n }\n let currentCursor = queryOpts.paginationCursor;\n while (true) {\n const storeQueryRequest = StoreQueryRequest.create({\n ...queryOpts,\n paginationCursor: currentCursor\n });\n let stream;\n try {\n stream = await this.getStream(peer);\n }\n catch (e) {\n log.error(\"Failed to get stream\", e);\n break;\n }\n const res = await pipe([storeQueryRequest.encode()], lp.encode, stream, lp.decode, async (source) => await all(source));\n const bytes = new Uint8ArrayList();\n res.forEach((chunk) => {\n bytes.append(chunk);\n });\n const storeQueryResponse = StoreQueryResponse.decode(bytes);\n if (!storeQueryResponse.statusCode ||\n storeQueryResponse.statusCode >= 300) {\n const errorMessage = `Store query failed with status code: ${storeQueryResponse.statusCode}, description: ${storeQueryResponse.statusDesc}`;\n log.error(errorMessage);\n throw new Error(errorMessage);\n }\n if (!storeQueryResponse.messages || !storeQueryResponse.messages.length) {\n log.warn(\"Stopping pagination due to empty messages in response\");\n break;\n }\n log.info(`${storeQueryResponse.messages.length} messages retrieved from store`);\n const decodedMessages = storeQueryResponse.messages.map((protoMsg) => {\n if (!protoMsg.message) {\n return Promise.resolve(undefined);\n }\n const contentTopic = protoMsg.message.contentTopic;\n if (contentTopic) {\n const decoder = decoders.get(contentTopic);\n if (decoder) {\n return decoder.fromProtoObj(protoMsg.pubsubTopic || \"\", toProtoMessage(protoMsg.message));\n }\n }\n return Promise.resolve(undefined);\n });\n yield decodedMessages;\n if (queryOpts.paginationForward) {\n currentCursor =\n storeQueryResponse.messages[storeQueryResponse.messages.length - 1]\n .messageHash;\n }\n else {\n currentCursor = storeQueryResponse.messages[0].messageHash;\n }\n if (storeQueryResponse.messages.length > MAX_PAGE_SIZE &&\n storeQueryResponse.messages.length <\n (queryOpts.paginationLimit || DEFAULT_PAGE_SIZE)) {\n break;\n }\n }\n }\n}\n//# sourceMappingURL=index.js.map","export class TimeoutError extends Error {\n\tconstructor(message) {\n\t\tsuper(message);\n\t\tthis.name = 'TimeoutError';\n\t}\n}\n\n/**\nAn error to be thrown when the request is aborted by AbortController.\nDOMException is thrown instead of this Error when DOMException is available.\n*/\nexport class AbortError extends Error {\n\tconstructor(message) {\n\t\tsuper();\n\t\tthis.name = 'AbortError';\n\t\tthis.message = message;\n\t}\n}\n\n/**\nTODO: Remove AbortError and just throw DOMException when targeting Node 18.\n*/\nconst getDOMException = errorMessage => globalThis.DOMException === undefined\n\t? new AbortError(errorMessage)\n\t: new DOMException(errorMessage);\n\n/**\nTODO: Remove below function and just 'reject(signal.reason)' when targeting Node 18.\n*/\nconst getAbortedReason = signal => {\n\tconst reason = signal.reason === undefined\n\t\t? getDOMException('This operation was aborted.')\n\t\t: signal.reason;\n\n\treturn reason instanceof Error ? reason : getDOMException(reason);\n};\n\nexport default function pTimeout(promise, options) {\n\tconst {\n\t\tmilliseconds,\n\t\tfallback,\n\t\tmessage,\n\t\tcustomTimers = {setTimeout, clearTimeout},\n\t} = options;\n\n\tlet timer;\n\n\tconst wrappedPromise = new Promise((resolve, reject) => {\n\t\tif (typeof milliseconds !== 'number' || Math.sign(milliseconds) !== 1) {\n\t\t\tthrow new TypeError(`Expected \\`milliseconds\\` to be a positive number, got \\`${milliseconds}\\``);\n\t\t}\n\n\t\tif (options.signal) {\n\t\t\tconst {signal} = options;\n\t\t\tif (signal.aborted) {\n\t\t\t\treject(getAbortedReason(signal));\n\t\t\t}\n\n\t\t\tsignal.addEventListener('abort', () => {\n\t\t\t\treject(getAbortedReason(signal));\n\t\t\t});\n\t\t}\n\n\t\tif (milliseconds === Number.POSITIVE_INFINITY) {\n\t\t\tpromise.then(resolve, reject);\n\t\t\treturn;\n\t\t}\n\n\t\t// We create the error outside of `setTimeout` to preserve the stack trace.\n\t\tconst timeoutError = new TimeoutError();\n\n\t\ttimer = customTimers.setTimeout.call(undefined, () => {\n\t\t\tif (fallback) {\n\t\t\t\ttry {\n\t\t\t\t\tresolve(fallback());\n\t\t\t\t} catch (error) {\n\t\t\t\t\treject(error);\n\t\t\t\t}\n\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tif (typeof promise.cancel === 'function') {\n\t\t\t\tpromise.cancel();\n\t\t\t}\n\n\t\t\tif (message === false) {\n\t\t\t\tresolve();\n\t\t\t} else if (message instanceof Error) {\n\t\t\t\treject(message);\n\t\t\t} else {\n\t\t\t\ttimeoutError.message = message ?? `Promise timed out after ${milliseconds} milliseconds`;\n\t\t\t\treject(timeoutError);\n\t\t\t}\n\t\t}, milliseconds);\n\n\t\t(async () => {\n\t\t\ttry {\n\t\t\t\tresolve(await promise);\n\t\t\t} catch (error) {\n\t\t\t\treject(error);\n\t\t\t}\n\t\t})();\n\t});\n\n\tconst cancelablePromise = wrappedPromise.finally(() => {\n\t\tcancelablePromise.clear();\n\t});\n\n\tcancelablePromise.clear = () => {\n\t\tcustomTimers.clearTimeout.call(undefined, timer);\n\t\ttimer = undefined;\n\t};\n\n\treturn cancelablePromise;\n}\n","import pTimeout from 'p-timeout';\n\nconst normalizeEmitter = emitter => {\n\tconst addListener = emitter.addEventListener || emitter.on || emitter.addListener;\n\tconst removeListener = emitter.removeEventListener || emitter.off || emitter.removeListener;\n\n\tif (!addListener || !removeListener) {\n\t\tthrow new TypeError('Emitter is not compatible');\n\t}\n\n\treturn {\n\t\taddListener: addListener.bind(emitter),\n\t\tremoveListener: removeListener.bind(emitter),\n\t};\n};\n\nexport function pEventMultiple(emitter, event, options) {\n\tlet cancel;\n\tconst returnValue = new Promise((resolve, reject) => {\n\t\toptions = {\n\t\t\trejectionEvents: ['error'],\n\t\t\tmultiArgs: false,\n\t\t\tresolveImmediately: false,\n\t\t\t...options,\n\t\t};\n\n\t\tif (!(options.count >= 0 && (options.count === Number.POSITIVE_INFINITY || Number.isInteger(options.count)))) {\n\t\t\tthrow new TypeError('The `count` option should be at least 0 or more');\n\t\t}\n\n\t\toptions.signal?.throwIfAborted();\n\n\t\t// Allow multiple events\n\t\tconst events = [event].flat();\n\n\t\tconst items = [];\n\t\tconst {addListener, removeListener} = normalizeEmitter(emitter);\n\n\t\tconst onItem = (...arguments_) => {\n\t\t\tconst value = options.multiArgs ? arguments_ : arguments_[0];\n\n\t\t\t// eslint-disable-next-line unicorn/no-array-callback-reference\n\t\t\tif (options.filter && !options.filter(value)) {\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\titems.push(value);\n\n\t\t\tif (options.count === items.length) {\n\t\t\t\tcancel();\n\t\t\t\tresolve(items);\n\t\t\t}\n\t\t};\n\n\t\tconst rejectHandler = error => {\n\t\t\tcancel();\n\t\t\treject(error);\n\t\t};\n\n\t\tcancel = () => {\n\t\t\tfor (const event of events) {\n\t\t\t\tremoveListener(event, onItem);\n\t\t\t}\n\n\t\t\tfor (const rejectionEvent of options.rejectionEvents) {\n\t\t\t\tremoveListener(rejectionEvent, rejectHandler);\n\t\t\t}\n\t\t};\n\n\t\tfor (const event of events) {\n\t\t\taddListener(event, onItem);\n\t\t}\n\n\t\tfor (const rejectionEvent of options.rejectionEvents) {\n\t\t\taddListener(rejectionEvent, rejectHandler);\n\t\t}\n\n\t\tif (options.signal) {\n\t\t\toptions.signal.addEventListener('abort', () => {\n\t\t\t\trejectHandler(options.signal.reason);\n\t\t\t}, {once: true});\n\t\t}\n\n\t\tif (options.resolveImmediately) {\n\t\t\tresolve(items);\n\t\t}\n\t});\n\n\treturnValue.cancel = cancel;\n\n\tif (typeof options.timeout === 'number') {\n\t\tconst timeout = pTimeout(returnValue, {milliseconds: options.timeout});\n\t\ttimeout.cancel = cancel;\n\t\treturn timeout;\n\t}\n\n\treturn returnValue;\n}\n\nexport function pEvent(emitter, event, options) {\n\tif (typeof options === 'function') {\n\t\toptions = {filter: options};\n\t}\n\n\toptions = {\n\t\t...options,\n\t\tcount: 1,\n\t\tresolveImmediately: false,\n\t};\n\n\tconst arrayPromise = pEventMultiple(emitter, event, options);\n\tconst promise = arrayPromise.then(array => array[0]);\n\tpromise.cancel = arrayPromise.cancel;\n\n\treturn promise;\n}\n\nexport function pEventIterator(emitter, event, options) {\n\tif (typeof options === 'function') {\n\t\toptions = {filter: options};\n\t}\n\n\t// Allow multiple events\n\tconst events = [event].flat();\n\n\toptions = {\n\t\trejectionEvents: ['error'],\n\t\tresolutionEvents: [],\n\t\tlimit: Number.POSITIVE_INFINITY,\n\t\tmultiArgs: false,\n\t\t...options,\n\t};\n\n\tconst {limit} = options;\n\tconst isValidLimit = limit >= 0 && (limit === Number.POSITIVE_INFINITY || Number.isInteger(limit));\n\tif (!isValidLimit) {\n\t\tthrow new TypeError('The `limit` option should be a non-negative integer or Infinity');\n\t}\n\n\toptions.signal?.throwIfAborted();\n\n\tif (limit === 0) {\n\t\t// Return an empty async iterator to avoid any further cost\n\t\treturn {\n\t\t\t[Symbol.asyncIterator]() {\n\t\t\t\treturn this;\n\t\t\t},\n\t\t\tasync next() {\n\t\t\t\treturn {\n\t\t\t\t\tdone: true,\n\t\t\t\t\tvalue: undefined,\n\t\t\t\t};\n\t\t\t},\n\t\t};\n\t}\n\n\tconst {addListener, removeListener} = normalizeEmitter(emitter);\n\n\tlet isDone = false;\n\tlet error;\n\tlet hasPendingError = false;\n\tconst nextQueue = [];\n\tconst valueQueue = [];\n\tlet eventCount = 0;\n\tlet isLimitReached = false;\n\n\tconst valueHandler = (...arguments_) => {\n\t\teventCount++;\n\t\tisLimitReached = eventCount === limit;\n\n\t\tconst value = options.multiArgs ? arguments_ : arguments_[0];\n\n\t\tif (nextQueue.length > 0) {\n\t\t\tconst {resolve} = nextQueue.shift();\n\n\t\t\tresolve({done: false, value});\n\n\t\t\tif (isLimitReached) {\n\t\t\t\tcancel();\n\t\t\t}\n\n\t\t\treturn;\n\t\t}\n\n\t\tvalueQueue.push(value);\n\n\t\tif (isLimitReached) {\n\t\t\tcancel();\n\t\t}\n\t};\n\n\tconst cancel = () => {\n\t\tisDone = true;\n\n\t\tfor (const event of events) {\n\t\t\tremoveListener(event, valueHandler);\n\t\t}\n\n\t\tfor (const rejectionEvent of options.rejectionEvents) {\n\t\t\tremoveListener(rejectionEvent, rejectHandler);\n\t\t}\n\n\t\tfor (const resolutionEvent of options.resolutionEvents) {\n\t\t\tremoveListener(resolutionEvent, resolveHandler);\n\t\t}\n\n\t\twhile (nextQueue.length > 0) {\n\t\t\tconst {resolve} = nextQueue.shift();\n\t\t\tresolve({done: true, value: undefined});\n\t\t}\n\t};\n\n\tconst rejectHandler = (...arguments_) => {\n\t\terror = options.multiArgs ? arguments_ : arguments_[0];\n\n\t\tif (nextQueue.length > 0) {\n\t\t\tconst {reject} = nextQueue.shift();\n\t\t\treject(error);\n\t\t} else {\n\t\t\thasPendingError = true;\n\t\t}\n\n\t\tcancel();\n\t};\n\n\tconst resolveHandler = (...arguments_) => {\n\t\tconst value = options.multiArgs ? arguments_ : arguments_[0];\n\n\t\t// eslint-disable-next-line unicorn/no-array-callback-reference\n\t\tif (options.filter && !options.filter(value)) {\n\t\t\tcancel();\n\t\t\treturn;\n\t\t}\n\n\t\tif (nextQueue.length > 0) {\n\t\t\tconst {resolve} = nextQueue.shift();\n\t\t\tresolve({done: true, value});\n\t\t} else {\n\t\t\tvalueQueue.push(value);\n\t\t}\n\n\t\tcancel();\n\t};\n\n\tfor (const event of events) {\n\t\taddListener(event, valueHandler);\n\t}\n\n\tfor (const rejectionEvent of options.rejectionEvents) {\n\t\taddListener(rejectionEvent, rejectHandler);\n\t}\n\n\tfor (const resolutionEvent of options.resolutionEvents) {\n\t\taddListener(resolutionEvent, resolveHandler);\n\t}\n\n\tif (options.signal) {\n\t\toptions.signal.addEventListener('abort', () => {\n\t\t\trejectHandler(options.signal.reason);\n\t\t}, {once: true});\n\t}\n\n\treturn {\n\t\t[Symbol.asyncIterator]() {\n\t\t\treturn this;\n\t\t},\n\t\tasync next() {\n\t\t\tif (valueQueue.length > 0) {\n\t\t\t\tconst value = valueQueue.shift();\n\t\t\t\treturn {\n\t\t\t\t\tdone: isDone && valueQueue.length === 0 && !isLimitReached,\n\t\t\t\t\tvalue,\n\t\t\t\t};\n\t\t\t}\n\n\t\t\tif (hasPendingError) {\n\t\t\t\thasPendingError = false;\n\t\t\t\tthrow error;\n\t\t\t}\n\n\t\t\tif (isDone) {\n\t\t\t\treturn {\n\t\t\t\t\tdone: true,\n\t\t\t\t\tvalue: undefined,\n\t\t\t\t};\n\t\t\t}\n\n\t\t\treturn new Promise((resolve, reject) => {\n\t\t\t\tnextQueue.push({resolve, reject});\n\t\t\t});\n\t\t},\n\t\tasync return(value) {\n\t\t\tcancel();\n\t\t\treturn {\n\t\t\t\tdone: isDone,\n\t\t\t\tvalue,\n\t\t\t};\n\t\t},\n\t};\n}\n\nexport {TimeoutError} from 'p-timeout';\n","import { Protocols } from \"@waku/interfaces\";\nimport { Logger } from \"@waku/utils\";\nimport { pEvent } from \"p-event\";\nconst log = new Logger(\"wait-for-remote-peer\");\n//TODO: move this function within the Waku class: https://github.com/waku-org/js-waku/issues/1761\n/**\n * Wait for a remote peer to be ready given the passed protocols.\n * Must be used after attempting to connect to nodes, using\n * {@link @waku/sdk!WakuNode.dial} or a bootstrap method with\n * {@link @waku/sdk!createLightNode}.\n *\n * If the passed protocols is a GossipSub protocol, then it resolves only once\n * a peer is in a mesh, to help ensure that other peers will send and receive\n * message to us.\n *\n * @param waku The Waku Node\n * @param protocols The protocols that need to be enabled by remote peers.\n * @param timeoutMs A timeout value in milliseconds..\n *\n * @returns A promise that **resolves** if all desired protocols are fulfilled by\n * remote nodes, **rejects** if the timeoutMs is reached.\n * @throws If passing a protocol that is not mounted\n * @default Wait for remote peers with protocols enabled locally and no time out is applied.\n */\nexport async function waitForRemotePeer(waku, protocols, timeoutMs) {\n protocols = protocols ?? getEnabledProtocols(waku);\n if (!waku.isStarted())\n return Promise.reject(\"Waku node is not started\");\n const promises = [];\n if (protocols.includes(Protocols.Relay)) {\n if (!waku.relay)\n throw new Error(\"Cannot wait for Relay peer: protocol not mounted\");\n promises.push(waitForGossipSubPeerInMesh(waku.relay));\n }\n if (protocols.includes(Protocols.Store)) {\n if (!waku.store)\n throw new Error(\"Cannot wait for Store peer: protocol not mounted\");\n promises.push(waitForConnectedPeer(waku.store.protocol, waku.libp2p.services.metadata));\n }\n if (protocols.includes(Protocols.LightPush)) {\n if (!waku.lightPush)\n throw new Error(\"Cannot wait for LightPush peer: protocol not mounted\");\n promises.push(waitForConnectedPeer(waku.lightPush.protocol, waku.libp2p.services.metadata));\n }\n if (protocols.includes(Protocols.Filter)) {\n if (!waku.filter)\n throw new Error(\"Cannot wait for Filter peer: protocol not mounted\");\n promises.push(waitForConnectedPeer(waku.filter.protocol, waku.libp2p.services.metadata));\n }\n if (timeoutMs) {\n await rejectOnTimeout(Promise.all(promises), timeoutMs, \"Timed out waiting for a remote peer.\");\n }\n else {\n await Promise.all(promises);\n }\n}\n//TODO: move this function within protocol SDK class: https://github.com/waku-org/js-waku/issues/1761\n/**\n * Wait for a peer with the given protocol to be connected.\n * If sharding is enabled on the node, it will also wait for the peer to be confirmed by the metadata service.\n */\nasync function waitForConnectedPeer(protocol, metadataService) {\n const codec = protocol.multicodec;\n const peers = await protocol.connectedPeers();\n if (peers.length) {\n if (!metadataService) {\n log.info(`${codec} peer found: `, peers[0].id.toString());\n return;\n }\n // once a peer is connected, we need to confirm the metadata handshake with at least one of those peers if sharding is enabled\n try {\n await Promise.any(peers.map((peer) => metadataService.confirmOrAttemptHandshake(peer.id)));\n return;\n }\n catch (e) {\n if (e.code === \"ERR_CONNECTION_BEING_CLOSED\")\n log.error(`Connection with the peer was closed and possibly because it's on a different shard. Error: ${e}`);\n log.error(`Error waiting for handshake confirmation: ${e}`);\n }\n }\n log.info(`Waiting for ${codec} peer`);\n // else we'll just wait for the next peer to connect\n await new Promise((resolve) => {\n const cb = (evt) => {\n if (evt.detail?.protocols?.includes(codec)) {\n if (metadataService) {\n metadataService\n .confirmOrAttemptHandshake(evt.detail.peerId)\n .then(() => {\n protocol.removeLibp2pEventListener(\"peer:identify\", cb);\n resolve();\n })\n .catch((e) => {\n if (e.code === \"ERR_CONNECTION_BEING_CLOSED\")\n log.error(`Connection with the peer was closed and possibly because it's on a different shard. Error: ${e}`);\n log.error(`Error waiting for handshake confirmation: ${e}`);\n });\n }\n else {\n protocol.removeLibp2pEventListener(\"peer:identify\", cb);\n resolve();\n }\n }\n };\n protocol.addLibp2pEventListener(\"peer:identify\", cb);\n });\n}\n/**\n * Wait for at least one peer with the given protocol to be connected and in the gossipsub\n * mesh for all pubsubTopics.\n */\nasync function waitForGossipSubPeerInMesh(waku) {\n let peers = waku.getMeshPeers();\n const pubsubTopics = waku.pubsubTopics;\n for (const topic of pubsubTopics) {\n while (peers.length == 0) {\n await pEvent(waku.gossipSub, \"gossipsub:heartbeat\");\n peers = waku.getMeshPeers(topic);\n }\n }\n}\nconst awaitTimeout = (ms, rejectReason) => new Promise((_resolve, reject) => setTimeout(() => reject(rejectReason), ms));\nasync function rejectOnTimeout(promise, timeoutMs, rejectReason) {\n await Promise.race([promise, awaitTimeout(timeoutMs, rejectReason)]);\n}\nfunction getEnabledProtocols(waku) {\n const protocols = [];\n if (waku.relay) {\n protocols.push(Protocols.Relay);\n }\n if (waku.filter) {\n protocols.push(Protocols.Filter);\n }\n if (waku.store) {\n protocols.push(Protocols.Store);\n }\n if (waku.lightPush) {\n protocols.push(Protocols.LightPush);\n }\n return protocols;\n}\n//# sourceMappingURL=wait_for_remote_peer.js.map","import { setMaxListeners } from './events.js';\n/**\n * An implementation of a typed event target\n * etc\n */\nexport class TypedEventEmitter extends EventTarget {\n #listeners = new Map();\n constructor() {\n super();\n // silence MaxListenersExceededWarning warning on Node.js, this is a red\n // herring almost all of the time\n setMaxListeners(Infinity, this);\n }\n listenerCount(type) {\n const listeners = this.#listeners.get(type);\n if (listeners == null) {\n return 0;\n }\n return listeners.length;\n }\n addEventListener(type, listener, options) {\n super.addEventListener(type, listener, options);\n let list = this.#listeners.get(type);\n if (list == null) {\n list = [];\n this.#listeners.set(type, list);\n }\n list.push({\n callback: listener,\n once: (options !== true && options !== false && options?.once) ?? false\n });\n }\n removeEventListener(type, listener, options) {\n super.removeEventListener(type.toString(), listener ?? null, options);\n let list = this.#listeners.get(type);\n if (list == null) {\n return;\n }\n list = list.filter(({ callback }) => callback !== listener);\n this.#listeners.set(type, list);\n }\n dispatchEvent(event) {\n const result = super.dispatchEvent(event);\n let list = this.#listeners.get(event.type);\n if (list == null) {\n return result;\n }\n list = list.filter(({ once }) => !once);\n this.#listeners.set(event.type, list);\n return result;\n }\n safeDispatchEvent(type, detail = {}) {\n return this.dispatchEvent(new CustomEvent(type, detail));\n }\n}\nexport const CustomEvent = globalThis.CustomEvent;\n//# sourceMappingURL=event-target.js.map","import { Logger, pubsubTopicToSingleShardInfo } from \"@waku/utils\";\nimport { utf8ToBytes } from \"@waku/utils/bytes\";\nimport { createEncoder } from \"./message/version_0.js\";\nexport const RelayPingContentTopic = \"/relay-ping/1/ping/null\";\nconst log = new Logger(\"keep-alive\");\nexport class KeepAliveManager {\n relay;\n libp2p;\n options;\n pingKeepAliveTimers = new Map();\n relayKeepAliveTimers = new Map();\n constructor({ options, relay, libp2p }) {\n this.options = options;\n this.relay = relay;\n this.libp2p = libp2p;\n }\n start(peerId) {\n // Just in case a timer already exists for this peer\n this.stop(peerId);\n const { pingKeepAlive: pingPeriodSecs, relayKeepAlive: relayPeriodSecs } = this.options;\n const peerIdStr = peerId.toString();\n // Ping the peer every pingPeriodSecs seconds\n // if pingPeriodSecs is 0, don't ping the peer\n if (pingPeriodSecs !== 0) {\n const interval = setInterval(() => {\n void (async () => {\n let ping;\n try {\n // ping the peer for keep alive\n // also update the peer store with the latency\n try {\n ping = await this.libp2p.services.ping.ping(peerId);\n log.info(`Ping succeeded (${peerIdStr})`, ping);\n }\n catch (error) {\n log.error(`Ping failed for peer (${peerIdStr}).\n Next ping will be attempted in ${pingPeriodSecs} seconds.\n `);\n return;\n }\n try {\n await this.libp2p.peerStore.merge(peerId, {\n metadata: {\n ping: utf8ToBytes(ping.toString())\n }\n });\n }\n catch (e) {\n log.error(\"Failed to update ping\", e);\n }\n }\n catch (e) {\n log.error(`Ping failed (${peerIdStr})`, e);\n }\n })();\n }, pingPeriodSecs * 1000);\n this.pingKeepAliveTimers.set(peerIdStr, interval);\n }\n const relay = this.relay;\n if (relay && relayPeriodSecs !== 0) {\n const intervals = this.scheduleRelayPings(relay, relayPeriodSecs, peerId.toString());\n this.relayKeepAliveTimers.set(peerId, intervals);\n }\n }\n stop(peerId) {\n const peerIdStr = peerId.toString();\n if (this.pingKeepAliveTimers.has(peerIdStr)) {\n clearInterval(this.pingKeepAliveTimers.get(peerIdStr));\n this.pingKeepAliveTimers.delete(peerIdStr);\n }\n if (this.relayKeepAliveTimers.has(peerId)) {\n this.relayKeepAliveTimers.get(peerId)?.map(clearInterval);\n this.relayKeepAliveTimers.delete(peerId);\n }\n }\n stopAll() {\n for (const timer of [\n ...Object.values(this.pingKeepAliveTimers),\n ...Object.values(this.relayKeepAliveTimers)\n ]) {\n clearInterval(timer);\n }\n this.pingKeepAliveTimers.clear();\n this.relayKeepAliveTimers.clear();\n }\n connectionsExist() {\n return (this.pingKeepAliveTimers.size > 0 || this.relayKeepAliveTimers.size > 0);\n }\n scheduleRelayPings(relay, relayPeriodSecs, peerIdStr) {\n // send a ping message to each PubsubTopic the peer is part of\n const intervals = [];\n for (const topic of relay.pubsubTopics) {\n const meshPeers = relay.getMeshPeers(topic);\n if (!meshPeers.includes(peerIdStr))\n continue;\n const encoder = createEncoder({\n pubsubTopicShardInfo: pubsubTopicToSingleShardInfo(topic),\n contentTopic: RelayPingContentTopic,\n ephemeral: true\n });\n const interval = setInterval(() => {\n log.info(\"Sending Waku Relay ping message\");\n relay\n .send(encoder, { payload: new Uint8Array([1]) })\n .catch((e) => log.error(\"Failed to send relay ping\", e));\n }, relayPeriodSecs * 1000);\n intervals.push(interval);\n }\n return intervals;\n }\n}\n//# sourceMappingURL=keep_alive_manager.js.map","import { CustomEvent, TypedEventEmitter } from \"@libp2p/interface\";\nimport { DNS_DISCOVERY_TAG, EConnectionStateEvents, EPeersByDiscoveryEvents } from \"@waku/interfaces\";\nimport { Tags } from \"@waku/interfaces\";\nimport { decodeRelayShard, shardInfoToPubsubTopics } from \"@waku/utils\";\nimport { Logger } from \"@waku/utils\";\nimport { KeepAliveManager } from \"./keep_alive_manager.js\";\nconst log = new Logger(\"connection-manager\");\nexport const DEFAULT_MAX_BOOTSTRAP_PEERS_ALLOWED = 1;\nexport const DEFAULT_MAX_DIAL_ATTEMPTS_FOR_PEER = 3;\nexport const DEFAULT_MAX_PARALLEL_DIALS = 3;\nexport class ConnectionManager extends TypedEventEmitter {\n configuredPubsubTopics;\n static instances = new Map();\n keepAliveManager;\n options;\n libp2p;\n dialAttemptsForPeer = new Map();\n dialErrorsForPeer = new Map();\n currentActiveParallelDialCount = 0;\n pendingPeerDialQueue = [];\n isP2PNetworkConnected = false;\n isConnected() {\n if (globalThis?.navigator && !globalThis?.navigator?.onLine) {\n return false;\n }\n return this.isP2PNetworkConnected;\n }\n static create(peerId, libp2p, keepAliveOptions, pubsubTopics, relay, options) {\n let instance = ConnectionManager.instances.get(peerId);\n if (!instance) {\n instance = new ConnectionManager(libp2p, keepAliveOptions, pubsubTopics, relay, options);\n ConnectionManager.instances.set(peerId, instance);\n }\n return instance;\n }\n stop() {\n this.keepAliveManager.stopAll();\n this.libp2p.removeEventListener(\"peer:connect\", this.onEventHandlers[\"peer:connect\"]);\n this.libp2p.removeEventListener(\"peer:disconnect\", this.onEventHandlers[\"peer:disconnect\"]);\n this.libp2p.removeEventListener(\"peer:discovery\", this.onEventHandlers[\"peer:discovery\"]);\n this.stopNetworkStatusListener();\n }\n async dropConnection(peerId) {\n try {\n this.keepAliveManager.stop(peerId);\n await this.libp2p.hangUp(peerId);\n log.info(`Dropped connection with peer ${peerId.toString()}`);\n }\n catch (error) {\n log.error(`Error dropping connection with peer ${peerId.toString()} - ${error}`);\n }\n }\n async getPeersByDiscovery() {\n const peersDiscovered = await this.libp2p.peerStore.all();\n const peersConnected = this.libp2p\n .getConnections()\n .map((conn) => conn.remotePeer);\n const peersDiscoveredByBootstrap = [];\n const peersDiscoveredByPeerExchange = [];\n const peersDiscoveredByLocal = [];\n const peersConnectedByBootstrap = [];\n const peersConnectedByPeerExchange = [];\n const peersConnectedByLocal = [];\n for (const peer of peersDiscovered) {\n const tags = await this.getTagNamesForPeer(peer.id);\n if (tags.includes(Tags.BOOTSTRAP)) {\n peersDiscoveredByBootstrap.push(peer);\n }\n else if (tags.includes(Tags.PEER_EXCHANGE)) {\n peersDiscoveredByPeerExchange.push(peer);\n }\n else if (tags.includes(Tags.LOCAL)) {\n peersDiscoveredByLocal.push(peer);\n }\n }\n for (const peerId of peersConnected) {\n const peer = await this.libp2p.peerStore.get(peerId);\n const tags = await this.getTagNamesForPeer(peerId);\n if (tags.includes(Tags.BOOTSTRAP)) {\n peersConnectedByBootstrap.push(peer);\n }\n else if (tags.includes(Tags.PEER_EXCHANGE)) {\n peersConnectedByPeerExchange.push(peer);\n }\n else if (tags.includes(Tags.LOCAL)) {\n peersConnectedByLocal.push(peer);\n }\n }\n return {\n DISCOVERED: {\n [Tags.BOOTSTRAP]: peersDiscoveredByBootstrap,\n [Tags.PEER_EXCHANGE]: peersDiscoveredByPeerExchange,\n [Tags.LOCAL]: peersDiscoveredByLocal\n },\n CONNECTED: {\n [Tags.BOOTSTRAP]: peersConnectedByBootstrap,\n [Tags.PEER_EXCHANGE]: peersConnectedByPeerExchange,\n [Tags.LOCAL]: peersConnectedByLocal\n }\n };\n }\n constructor(libp2p, keepAliveOptions, configuredPubsubTopics, relay, options) {\n super();\n this.configuredPubsubTopics = configuredPubsubTopics;\n this.libp2p = libp2p;\n this.configuredPubsubTopics = configuredPubsubTopics;\n this.options = {\n maxDialAttemptsForPeer: DEFAULT_MAX_DIAL_ATTEMPTS_FOR_PEER,\n maxBootstrapPeersAllowed: DEFAULT_MAX_BOOTSTRAP_PEERS_ALLOWED,\n maxParallelDials: DEFAULT_MAX_PARALLEL_DIALS,\n ...options\n };\n this.keepAliveManager = new KeepAliveManager({\n relay,\n libp2p,\n options: keepAliveOptions\n });\n this.startEventListeners()\n .then(() => log.info(`Connection Manager is now running`))\n .catch((error) => log.error(`Unexpected error while running service`, error));\n // libp2p emits `peer:discovery` events during its initialization\n // which means that before the ConnectionManager is initialized, some peers may have been discovered\n // we will dial the peers in peerStore ONCE before we start to listen to the `peer:discovery` events within the ConnectionManager\n this.dialPeerStorePeers().catch((error) => log.error(`Unexpected error while dialing peer store peers`, error));\n }\n async dialPeerStorePeers() {\n const peerInfos = await this.libp2p.peerStore.all();\n const dialPromises = [];\n for (const peerInfo of peerInfos) {\n if (this.libp2p.getConnections().find((c) => c.remotePeer === peerInfo.id))\n continue;\n dialPromises.push(this.attemptDial(peerInfo.id));\n }\n try {\n await Promise.all(dialPromises);\n }\n catch (error) {\n log.error(`Unexpected error while dialing peer store peers`, error);\n }\n }\n async startEventListeners() {\n this.startPeerDiscoveryListener();\n this.startPeerConnectionListener();\n this.startPeerDisconnectionListener();\n this.startNetworkStatusListener();\n }\n async dialPeer(peerId) {\n this.currentActiveParallelDialCount += 1;\n let dialAttempt = 0;\n while (dialAttempt < this.options.maxDialAttemptsForPeer) {\n try {\n log.info(`Dialing peer ${peerId.toString()} on attempt ${dialAttempt + 1}`);\n await this.libp2p.dial(peerId);\n const tags = await this.getTagNamesForPeer(peerId);\n // add tag to connection describing discovery mechanism\n // don't add duplicate tags\n this.libp2p.getConnections(peerId).forEach((conn) => {\n conn.tags = Array.from(new Set([...conn.tags, ...tags]));\n });\n // instead of deleting the peer from the peer store, we set the dial attempt to -1\n // this helps us keep track of peers that have been dialed before\n this.dialAttemptsForPeer.set(peerId.toString(), -1);\n // Dialing succeeded, break the loop\n this.keepAliveManager.start(peerId);\n break;\n }\n catch (error) {\n if (error instanceof AggregateError) {\n // Handle AggregateError\n log.error(`Error dialing peer ${peerId.toString()} - ${error.errors}`);\n }\n else {\n // Handle generic error\n log.error(`Error dialing peer ${peerId.toString()} - ${error.message}`);\n }\n this.dialErrorsForPeer.set(peerId.toString(), error);\n dialAttempt++;\n this.dialAttemptsForPeer.set(peerId.toString(), dialAttempt);\n }\n }\n // Always decrease the active dial count and process the dial queue\n this.currentActiveParallelDialCount--;\n this.processDialQueue();\n // If max dial attempts reached and dialing failed, delete the peer\n if (dialAttempt === this.options.maxDialAttemptsForPeer) {\n try {\n const error = this.dialErrorsForPeer.get(peerId.toString());\n if (error) {\n let errorMessage;\n if (error instanceof AggregateError) {\n if (!error.errors) {\n log.warn(`No errors array found for AggregateError`);\n }\n else if (error.errors.length === 0) {\n log.warn(`Errors array is empty for AggregateError`);\n }\n else {\n errorMessage = JSON.stringify(error.errors[0]);\n }\n }\n else {\n errorMessage = error.message;\n }\n log.info(`Deleting undialable peer ${peerId.toString()} from peer store. Reason: ${errorMessage}`);\n }\n this.dialErrorsForPeer.delete(peerId.toString());\n await this.libp2p.peerStore.delete(peerId);\n // if it was last available peer - attempt DNS discovery\n await this.attemptDnsDiscovery();\n }\n catch (error) {\n throw new Error(`Error deleting undialable peer ${peerId.toString()} from peer store - ${error}`);\n }\n }\n }\n async attemptDnsDiscovery() {\n if (this.libp2p.getConnections().length > 0)\n return;\n if ((await this.libp2p.peerStore.all()).length > 0)\n return;\n log.info(\"Attempting to trigger DNS discovery.\");\n const dnsDiscovery = Object.values(this.libp2p.components.components).find((v) => {\n if (v && v.toString) {\n return v.toString().includes(DNS_DISCOVERY_TAG);\n }\n return false;\n });\n if (!dnsDiscovery)\n return;\n await dnsDiscovery.findPeers();\n }\n processDialQueue() {\n if (this.pendingPeerDialQueue.length > 0 &&\n this.currentActiveParallelDialCount < this.options.maxParallelDials) {\n const peerId = this.pendingPeerDialQueue.shift();\n if (!peerId)\n return;\n this.attemptDial(peerId).catch((error) => {\n log.error(error);\n });\n }\n }\n startPeerDiscoveryListener() {\n this.libp2p.addEventListener(\"peer:discovery\", this.onEventHandlers[\"peer:discovery\"]);\n }\n startPeerConnectionListener() {\n this.libp2p.addEventListener(\"peer:connect\", this.onEventHandlers[\"peer:connect\"]);\n }\n startPeerDisconnectionListener() {\n // TODO: ensure that these following issues are updated and confirmed\n /**\n * NOTE: Event is not being emitted on closing nor losing a connection.\n * @see https://github.com/libp2p/js-libp2p/issues/939\n * @see https://github.com/status-im/js-waku/issues/252\n *\n * >This event will be triggered anytime we are disconnected from another peer,\n * >regardless of the circumstances of that disconnection.\n * >If we happen to have multiple connections to a peer,\n * >this event will **only** be triggered when the last connection is closed.\n * @see https://github.com/libp2p/js-libp2p/blob/bad9e8c0ff58d60a78314077720c82ae331cc55b/doc/API.md?plain=1#L2100\n */\n this.libp2p.addEventListener(\"peer:disconnect\", this.onEventHandlers[\"peer:disconnect\"]);\n }\n async attemptDial(peerId) {\n if (!(await this.shouldDialPeer(peerId)))\n return;\n if (this.currentActiveParallelDialCount >= this.options.maxParallelDials) {\n this.pendingPeerDialQueue.push(peerId);\n return;\n }\n await this.dialPeer(peerId);\n }\n onEventHandlers = {\n \"peer:discovery\": (evt) => {\n void (async () => {\n const { id: peerId } = evt.detail;\n await this.dispatchDiscoveryEvent(peerId);\n try {\n await this.attemptDial(peerId);\n }\n catch (error) {\n log.error(`Error dialing peer ${peerId.toString()} : ${error}`);\n }\n })();\n },\n \"peer:connect\": (evt) => {\n void (async () => {\n log.info(`Connected to peer ${evt.detail.toString()}`);\n const peerId = evt.detail;\n this.keepAliveManager.start(peerId);\n const isBootstrap = (await this.getTagNamesForPeer(peerId)).includes(Tags.BOOTSTRAP);\n if (isBootstrap) {\n const bootstrapConnections = this.libp2p\n .getConnections()\n .filter((conn) => conn.tags.includes(Tags.BOOTSTRAP));\n // If we have too many bootstrap connections, drop one\n if (bootstrapConnections.length > this.options.maxBootstrapPeersAllowed) {\n await this.dropConnection(peerId);\n }\n else {\n this.dispatchEvent(new CustomEvent(EPeersByDiscoveryEvents.PEER_CONNECT_BOOTSTRAP, {\n detail: peerId\n }));\n }\n }\n else {\n this.dispatchEvent(new CustomEvent(EPeersByDiscoveryEvents.PEER_CONNECT_PEER_EXCHANGE, {\n detail: peerId\n }));\n }\n this.setP2PNetworkConnected();\n })();\n },\n \"peer:disconnect\": (evt) => {\n void (async () => {\n this.keepAliveManager.stop(evt.detail);\n this.setP2PNetworkDisconnected();\n })();\n },\n \"browser:network\": () => {\n this.dispatchWakuConnectionEvent();\n }\n };\n /**\n * Checks if the peer should be dialed based on the following conditions:\n * 1. If the peer is already connected, don't dial\n * 2. If the peer is not part of any of the configured pubsub topics, don't dial\n * 3. If the peer is not dialable based on bootstrap status, don't dial\n * 4. If the peer is already has an active dial attempt, or has been dialed before, don't dial it\n * @returns true if the peer should be dialed, false otherwise\n */\n async shouldDialPeer(peerId) {\n const isConnected = this.libp2p.getConnections(peerId).length > 0;\n if (isConnected) {\n log.warn(`Already connected to peer ${peerId.toString()}. Not dialing.`);\n return false;\n }\n const isSameShard = await this.isPeerTopicConfigured(peerId);\n if (!isSameShard) {\n const shardInfo = await this.getPeerShardInfo(peerId, this.libp2p.peerStore);\n log.warn(`Discovered peer ${peerId.toString()} with ShardInfo ${shardInfo} is not part of any of the configured pubsub topics (${this.configuredPubsubTopics}).\n Not dialing.`);\n return false;\n }\n const isPreferredBasedOnBootstrap = await this.isPeerDialableBasedOnBootstrapStatus(peerId);\n if (!isPreferredBasedOnBootstrap) {\n log.warn(`Peer ${peerId.toString()} is not dialable based on bootstrap status. Not dialing.`);\n return false;\n }\n const hasBeenDialed = this.dialAttemptsForPeer.has(peerId.toString());\n if (hasBeenDialed) {\n log.warn(`Peer ${peerId.toString()} has already been attempted dial before, or already has a dial attempt in progress, skipping dial`);\n return false;\n }\n return true;\n }\n /**\n * Checks if the peer is dialable based on the following conditions:\n * 1. If the peer is a bootstrap peer, it is only dialable if the number of current bootstrap connections is less than the max allowed.\n * 2. If the peer is not a bootstrap peer\n */\n async isPeerDialableBasedOnBootstrapStatus(peerId) {\n const tagNames = await this.getTagNamesForPeer(peerId);\n const isBootstrap = tagNames.some((tagName) => tagName === Tags.BOOTSTRAP);\n if (!isBootstrap) {\n return true;\n }\n const currentBootstrapConnections = this.libp2p\n .getConnections()\n .filter((conn) => {\n return conn.tags.find((name) => name === Tags.BOOTSTRAP);\n }).length;\n return currentBootstrapConnections < this.options.maxBootstrapPeersAllowed;\n }\n async dispatchDiscoveryEvent(peerId) {\n const isBootstrap = (await this.getTagNamesForPeer(peerId)).includes(Tags.BOOTSTRAP);\n this.dispatchEvent(new CustomEvent(isBootstrap\n ? EPeersByDiscoveryEvents.PEER_DISCOVERY_BOOTSTRAP\n : EPeersByDiscoveryEvents.PEER_DISCOVERY_PEER_EXCHANGE, {\n detail: peerId\n }));\n }\n /**\n * Fetches the tag names for a given peer\n */\n async getTagNamesForPeer(peerId) {\n try {\n const peer = await this.libp2p.peerStore.get(peerId);\n return Array.from(peer.tags.keys());\n }\n catch (error) {\n log.error(`Failed to get peer ${peerId}, error: ${error}`);\n return [];\n }\n }\n async isPeerTopicConfigured(peerId) {\n const shardInfo = await this.getPeerShardInfo(peerId, this.libp2p.peerStore);\n // If there's no shard information, simply return true\n if (!shardInfo)\n return true;\n const pubsubTopics = shardInfoToPubsubTopics(shardInfo);\n const isTopicConfigured = pubsubTopics.some((topic) => this.configuredPubsubTopics.includes(topic));\n return isTopicConfigured;\n }\n async getPeerShardInfo(peerId, peerStore) {\n const peer = await peerStore.get(peerId);\n const shardInfoBytes = peer.metadata.get(\"shardInfo\");\n if (!shardInfoBytes)\n return undefined;\n return decodeRelayShard(shardInfoBytes);\n }\n startNetworkStatusListener() {\n try {\n globalThis.addEventListener(\"online\", this.onEventHandlers[\"browser:network\"]);\n globalThis.addEventListener(\"offline\", this.onEventHandlers[\"browser:network\"]);\n }\n catch (err) {\n log.error(`Failed to start network listener: ${err}`);\n }\n }\n stopNetworkStatusListener() {\n try {\n globalThis.removeEventListener(\"online\", this.onEventHandlers[\"browser:network\"]);\n globalThis.removeEventListener(\"offline\", this.onEventHandlers[\"browser:network\"]);\n }\n catch (err) {\n log.error(`Failed to stop network listener: ${err}`);\n }\n }\n setP2PNetworkConnected() {\n if (!this.isP2PNetworkConnected) {\n this.isP2PNetworkConnected = true;\n this.dispatchWakuConnectionEvent();\n }\n }\n setP2PNetworkDisconnected() {\n if (this.isP2PNetworkConnected &&\n this.libp2p.getConnections().length === 0) {\n this.isP2PNetworkConnected = false;\n this.dispatchWakuConnectionEvent();\n }\n }\n dispatchWakuConnectionEvent() {\n this.dispatchEvent(new CustomEvent(EConnectionStateEvents.CONNECTION_STATUS, {\n detail: this.isConnected()\n }));\n }\n}\n//# sourceMappingURL=connection_manager.js.map","import { HealthStatus, Protocols } from \"@waku/interfaces\";\nclass HealthManager {\n static instance;\n health;\n constructor() {\n this.health = {\n overallStatus: HealthStatus.Unhealthy,\n protocolStatuses: new Map()\n };\n }\n static getInstance() {\n if (!HealthManager.instance) {\n HealthManager.instance = new HealthManager();\n }\n return HealthManager.instance;\n }\n getHealthStatus() {\n return this.health.overallStatus;\n }\n getProtocolStatus(protocol) {\n return this.health.protocolStatuses.get(protocol);\n }\n updateProtocolHealth(multicodec, connectedPeers) {\n const protocol = this.getNameFromMulticodec(multicodec);\n let status = HealthStatus.Unhealthy;\n if (connectedPeers == 1) {\n status = HealthStatus.MinimallyHealthy;\n }\n else if (connectedPeers >= 2) {\n status = HealthStatus.SufficientlyHealthy;\n }\n this.health.protocolStatuses.set(protocol, {\n name: protocol,\n status: status,\n lastUpdate: new Date()\n });\n this.updateOverallHealth();\n }\n getNameFromMulticodec(multicodec) {\n let name;\n if (multicodec.includes(\"filter\")) {\n name = Protocols.Filter;\n }\n else if (multicodec.includes(\"lightpush\")) {\n name = Protocols.LightPush;\n }\n else if (multicodec.includes(\"store\")) {\n name = Protocols.Store;\n }\n else {\n throw new Error(`Unknown protocol: ${multicodec}`);\n }\n return name;\n }\n updateOverallHealth() {\n const relevantProtocols = [Protocols.LightPush, Protocols.Filter];\n const statuses = relevantProtocols.map((p) => this.getProtocolStatus(p)?.status);\n if (statuses.some((status) => status === HealthStatus.Unhealthy)) {\n this.health.overallStatus = HealthStatus.Unhealthy;\n }\n else if (statuses.some((status) => status === HealthStatus.MinimallyHealthy)) {\n this.health.overallStatus = HealthStatus.MinimallyHealthy;\n }\n else {\n this.health.overallStatus = HealthStatus.SufficientlyHealthy;\n }\n }\n}\nexport const getHealthManager = () => HealthManager.getInstance();\n//# sourceMappingURL=health_manager.js.map","import { ProtocolError } from \"@waku/interfaces\";\nimport { proto_metadata } from \"@waku/proto\";\nimport { encodeRelayShard, Logger, pubsubTopicsToShardInfo } from \"@waku/utils\";\nimport all from \"it-all\";\nimport * as lp from \"it-length-prefixed\";\nimport { pipe } from \"it-pipe\";\nimport { Uint8ArrayList } from \"uint8arraylist\";\nimport { BaseProtocol } from \"../base_protocol.js\";\nconst log = new Logger(\"metadata\");\nexport const MetadataCodec = \"/vac/waku/metadata/1.0.0\";\nclass Metadata extends BaseProtocol {\n pubsubTopics;\n libp2pComponents;\n handshakesConfirmed = new Map();\n constructor(pubsubTopics, libp2p) {\n super(MetadataCodec, libp2p.components, log, pubsubTopics);\n this.pubsubTopics = pubsubTopics;\n this.libp2pComponents = libp2p;\n void libp2p.registrar.handle(MetadataCodec, (streamData) => {\n void this.onRequest(streamData);\n });\n }\n /**\n * Make a metadata query to a peer\n */\n async query(peerId) {\n const request = proto_metadata.WakuMetadataRequest.encode(pubsubTopicsToShardInfo(this.pubsubTopics));\n const peer = await this.peerStore.get(peerId);\n if (!peer) {\n return {\n shardInfo: null,\n error: ProtocolError.NO_PEER_AVAILABLE\n };\n }\n let stream;\n try {\n stream = await this.getStream(peer);\n }\n catch (error) {\n log.error(\"Failed to get stream\", error);\n return {\n shardInfo: null,\n error: ProtocolError.NO_STREAM_AVAILABLE\n };\n }\n const encodedResponse = await pipe([request], lp.encode, stream, lp.decode, async (source) => await all(source));\n const { error, shardInfo } = this.decodeMetadataResponse(encodedResponse);\n if (error) {\n return {\n shardInfo: null,\n error\n };\n }\n await this.savePeerShardInfo(peerId, shardInfo);\n return {\n shardInfo,\n error: null\n };\n }\n async confirmOrAttemptHandshake(peerId) {\n const shardInfo = this.handshakesConfirmed.get(peerId.toString());\n if (shardInfo) {\n return {\n shardInfo,\n error: null\n };\n }\n return await this.query(peerId);\n }\n /**\n * Handle an incoming metadata request\n */\n async onRequest(streamData) {\n try {\n const { stream, connection } = streamData;\n const encodedShardInfo = proto_metadata.WakuMetadataResponse.encode(pubsubTopicsToShardInfo(this.pubsubTopics));\n const encodedResponse = await pipe([encodedShardInfo], lp.encode, stream, lp.decode, async (source) => await all(source));\n const { error, shardInfo } = this.decodeMetadataResponse(encodedResponse);\n if (error) {\n return;\n }\n await this.savePeerShardInfo(connection.remotePeer, shardInfo);\n }\n catch (error) {\n log.error(\"Error handling metadata request\", error);\n }\n }\n decodeMetadataResponse(encodedResponse) {\n const bytes = new Uint8ArrayList();\n encodedResponse.forEach((chunk) => {\n bytes.append(chunk);\n });\n const response = proto_metadata.WakuMetadataResponse.decode(bytes);\n if (!response) {\n log.error(\"Error decoding metadata response\");\n return {\n shardInfo: null,\n error: ProtocolError.DECODE_FAILED\n };\n }\n return {\n shardInfo: response,\n error: null\n };\n }\n async savePeerShardInfo(peerId, shardInfo) {\n // add or update the shardInfo to peer store\n await this.libp2pComponents.peerStore.merge(peerId, {\n metadata: {\n shardInfo: encodeRelayShard(shardInfo)\n }\n });\n this.handshakesConfirmed.set(peerId.toString(), shardInfo);\n }\n}\nexport function wakuMetadata(pubsubTopics) {\n return (components) => new Metadata(pubsubTopics, components);\n}\n//# sourceMappingURL=index.js.map","export const peerIdSymbol = Symbol.for('@libp2p/peer-id');\nexport function isPeerId(other) {\n return other != null && Boolean(other[peerIdSymbol]);\n}\n//# sourceMappingURL=index.js.map","/**\n * When this error is thrown it means an operation was aborted,\n * usually in response to the `abort` event being emitted by an\n * AbortSignal.\n */\nexport class AbortError extends Error {\n code;\n type;\n constructor(message = 'The operation was aborted') {\n super(message);\n this.name = 'AbortError';\n this.code = AbortError.code;\n this.type = AbortError.type;\n }\n static code = 'ABORT_ERR';\n static type = 'aborted';\n}\nexport class CodeError extends Error {\n code;\n props;\n constructor(message, code, props) {\n super(message);\n this.code = code;\n this.name = props?.name ?? 'CodeError';\n this.props = props ?? {}; // eslint-disable-line @typescript-eslint/consistent-type-assertions\n }\n}\nexport class AggregateCodeError extends AggregateError {\n code;\n props;\n constructor(errors, message, code, props) {\n super(errors, message);\n this.code = code;\n this.name = props?.name ?? 'AggregateCodeError';\n this.props = props ?? {}; // eslint-disable-line @typescript-eslint/consistent-type-assertions\n }\n}\nexport class UnexpectedPeerError extends Error {\n code;\n constructor(message = 'Unexpected Peer') {\n super(message);\n this.name = 'UnexpectedPeerError';\n this.code = UnexpectedPeerError.code;\n }\n static code = 'ERR_UNEXPECTED_PEER';\n}\nexport class InvalidCryptoExchangeError extends Error {\n code;\n constructor(message = 'Invalid crypto exchange') {\n super(message);\n this.name = 'InvalidCryptoExchangeError';\n this.code = InvalidCryptoExchangeError.code;\n }\n static code = 'ERR_INVALID_CRYPTO_EXCHANGE';\n}\nexport class InvalidCryptoTransmissionError extends Error {\n code;\n constructor(message = 'Invalid crypto transmission') {\n super(message);\n this.name = 'InvalidCryptoTransmissionError';\n this.code = InvalidCryptoTransmissionError.code;\n }\n static code = 'ERR_INVALID_CRYPTO_TRANSMISSION';\n}\n// Error codes\nexport const ERR_TIMEOUT = 'ERR_TIMEOUT';\nexport const ERR_INVALID_PARAMETERS = 'ERR_INVALID_PARAMETERS';\nexport const ERR_NOT_FOUND = 'ERR_NOT_FOUND';\nexport const ERR_INVALID_MESSAGE = 'ERR_INVALID_MESSAGE';\n//# sourceMappingURL=errors.js.map","import { Parser } from \"./parser.js\";\n// See https://stackoverflow.com/questions/166132/maximum-length-of-the-textual-representation-of-an-ipv6-address\nconst MAX_IPV6_LENGTH = 45;\nconst MAX_IPV4_LENGTH = 15;\nconst parser = new Parser();\n/** Parse `input` into IPv4 bytes. */\nexport function parseIPv4(input) {\n if (input.length > MAX_IPV4_LENGTH) {\n return undefined;\n }\n return parser.new(input).parseWith(() => parser.readIPv4Addr());\n}\n/** Parse `input` into IPv6 bytes. */\nexport function parseIPv6(input) {\n // strip zone index if it is present\n if (input.includes(\"%\")) {\n input = input.split(\"%\")[0];\n }\n if (input.length > MAX_IPV6_LENGTH) {\n return undefined;\n }\n return parser.new(input).parseWith(() => parser.readIPv6Addr());\n}\n/** Parse `input` into IPv4 or IPv6 bytes. */\nexport function parseIP(input) {\n // strip zone index if it is present\n if (input.includes(\"%\")) {\n input = input.split(\"%\")[0];\n }\n if (input.length > MAX_IPV6_LENGTH) {\n return undefined;\n }\n return parser.new(input).parseWith(() => parser.readIPAddr());\n}\n//# sourceMappingURL=parse.js.map","/* eslint-disable @typescript-eslint/no-unsafe-return */\nexport class Parser {\n index = 0;\n input = \"\";\n new(input) {\n this.index = 0;\n this.input = input;\n return this;\n }\n /** Run a parser, and restore the pre-parse state if it fails. */\n readAtomically(fn) {\n const index = this.index;\n const result = fn();\n if (result === undefined) {\n this.index = index;\n }\n return result;\n }\n /** Run a parser, but fail if the entire input wasn't consumed. Doesn't run atomically. */\n parseWith(fn) {\n const result = fn();\n if (this.index !== this.input.length) {\n return undefined;\n }\n return result;\n }\n /** Peek the next character from the input */\n peekChar() {\n if (this.index >= this.input.length) {\n return undefined;\n }\n return this.input[this.index];\n }\n /** Read the next character from the input */\n readChar() {\n if (this.index >= this.input.length) {\n return undefined;\n }\n return this.input[this.index++];\n }\n /** Read the next character from the input if it matches the target. */\n readGivenChar(target) {\n return this.readAtomically(() => {\n const char = this.readChar();\n if (char !== target) {\n return undefined;\n }\n return char;\n });\n }\n /**\n * Helper for reading separators in an indexed loop. Reads the separator\n * character iff index > 0, then runs the parser. When used in a loop,\n * the separator character will only be read on index > 0 (see\n * readIPv4Addr for an example)\n */\n readSeparator(sep, index, inner) {\n return this.readAtomically(() => {\n if (index > 0) {\n if (this.readGivenChar(sep) === undefined) {\n return undefined;\n }\n }\n return inner();\n });\n }\n /**\n * Read a number off the front of the input in the given radix, stopping\n * at the first non-digit character or eof. Fails if the number has more\n * digits than max_digits or if there is no number.\n */\n readNumber(radix, maxDigits, allowZeroPrefix, maxBytes) {\n return this.readAtomically(() => {\n let result = 0;\n let digitCount = 0;\n const leadingChar = this.peekChar();\n if (leadingChar === undefined) {\n return undefined;\n }\n const hasLeadingZero = leadingChar === \"0\";\n const maxValue = 2 ** (8 * maxBytes) - 1;\n // eslint-disable-next-line no-constant-condition\n while (true) {\n const digit = this.readAtomically(() => {\n const char = this.readChar();\n if (char === undefined) {\n return undefined;\n }\n const num = Number.parseInt(char, radix);\n if (Number.isNaN(num)) {\n return undefined;\n }\n return num;\n });\n if (digit === undefined) {\n break;\n }\n result *= radix;\n result += digit;\n if (result > maxValue) {\n return undefined;\n }\n digitCount += 1;\n if (maxDigits !== undefined) {\n if (digitCount > maxDigits) {\n return undefined;\n }\n }\n }\n if (digitCount === 0) {\n return undefined;\n }\n else if (!allowZeroPrefix && hasLeadingZero && digitCount > 1) {\n return undefined;\n }\n else {\n return result;\n }\n });\n }\n /** Read an IPv4 address. */\n readIPv4Addr() {\n return this.readAtomically(() => {\n const out = new Uint8Array(4);\n for (let i = 0; i < out.length; i++) {\n const ix = this.readSeparator(\".\", i, () => this.readNumber(10, 3, false, 1));\n if (ix === undefined) {\n return undefined;\n }\n out[i] = ix;\n }\n return out;\n });\n }\n /** Read an IPv6 Address. */\n readIPv6Addr() {\n /**\n * Read a chunk of an IPv6 address into `groups`. Returns the number\n * of groups read, along with a bool indicating if an embedded\n * trailing IPv4 address was read. Specifically, read a series of\n * colon-separated IPv6 groups (0x0000 - 0xFFFF), with an optional\n * trailing embedded IPv4 address.\n */\n const readGroups = (groups) => {\n for (let i = 0; i < groups.length / 2; i++) {\n const ix = i * 2;\n // Try to read a trailing embedded IPv4 address. There must be at least 4 groups left.\n if (i < groups.length - 3) {\n const ipv4 = this.readSeparator(\":\", i, () => this.readIPv4Addr());\n if (ipv4 !== undefined) {\n groups[ix] = ipv4[0];\n groups[ix + 1] = ipv4[1];\n groups[ix + 2] = ipv4[2];\n groups[ix + 3] = ipv4[3];\n return [ix + 4, true];\n }\n }\n const group = this.readSeparator(\":\", i, () => this.readNumber(16, 4, true, 2));\n if (group === undefined) {\n return [ix, false];\n }\n groups[ix] = group >> 8;\n groups[ix + 1] = group & 255;\n }\n return [groups.length, false];\n };\n return this.readAtomically(() => {\n // Read the front part of the address; either the whole thing, or up to the first ::\n const head = new Uint8Array(16);\n const [headSize, headIp4] = readGroups(head);\n if (headSize === 16) {\n return head;\n }\n // IPv4 part is not allowed before `::`\n if (headIp4) {\n return undefined;\n }\n // Read `::` if previous code parsed less than 8 groups.\n // `::` indicates one or more groups of 16 bits of zeros.\n if (this.readGivenChar(\":\") === undefined) {\n return undefined;\n }\n if (this.readGivenChar(\":\") === undefined) {\n return undefined;\n }\n // Read the back part of the address. The :: must contain at least one\n // set of zeroes, so our max length is 7.\n const tail = new Uint8Array(14);\n const limit = 16 - (headSize + 2);\n const [tailSize] = readGroups(tail.subarray(0, limit));\n // Concat the head and tail of the IP address\n head.set(tail.subarray(0, tailSize), 16 - tailSize);\n return head;\n });\n }\n /** Read an IP Address, either IPv4 or IPv6. */\n readIPAddr() {\n return this.readIPv4Addr() ?? this.readIPv6Addr();\n }\n}\n//# sourceMappingURL=parser.js.map","import { parseIP, parseIPv4, parseIPv6 } from \"./parse.js\";\n/** Check if `input` is IPv4. */\nexport function isIPv4(input) {\n return Boolean(parseIPv4(input));\n}\n/** Check if `input` is IPv6. */\nexport function isIPv6(input) {\n return Boolean(parseIPv6(input));\n}\n/** Check if `input` is IPv4 or IPv6. */\nexport function isIP(input) {\n return Boolean(parseIP(input));\n}\n/**\n * @returns `6` if `input` is IPv6, `4` if `input` is IPv4, or `undefined` if `input` is neither.\n */\nexport function ipVersion(input) {\n if (isIPv4(input)) {\n return 4;\n }\n else if (isIPv6(input)) {\n return 6;\n }\n else {\n return undefined;\n }\n}\n//# sourceMappingURL=is-ip.js.map","import { parseIP } from \"@chainsafe/is-ip/parse\";\nimport { allFF, deepEqual } from \"./util.js\";\nexport const IPv4Len = 4;\nexport const IPv6Len = 16;\nexport const maxIPv6Octet = parseInt(\"0xFFFF\", 16);\nexport const ipv4Prefix = new Uint8Array([\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 255,\n]);\nexport function maskIp(ip, mask) {\n if (mask.length === IPv6Len && ip.length === IPv4Len && allFF(mask, 0, 11)) {\n mask = mask.slice(12);\n }\n if (mask.length === IPv4Len &&\n ip.length === IPv6Len &&\n deepEqual(ip, ipv4Prefix, 0, 11)) {\n ip = ip.slice(12);\n }\n const n = ip.length;\n if (n != mask.length) {\n throw new Error(\"Failed to mask ip\");\n }\n const out = new Uint8Array(n);\n for (let i = 0; i < n; i++) {\n out[i] = ip[i] & mask[i];\n }\n return out;\n}\nexport function containsIp(net, ip) {\n if (typeof ip === \"string\") {\n ip = parseIP(ip);\n }\n if (ip == null)\n throw new Error(\"Invalid ip\");\n if (ip.length !== net.network.length) {\n return false;\n }\n for (let i = 0; i < ip.length; i++) {\n if ((net.network[i] & net.mask[i]) !== (ip[i] & net.mask[i])) {\n return false;\n }\n }\n return true;\n}\nexport function iPv4FromIPv6(ip) {\n if (!isIPv4mappedIPv6(ip)) {\n throw new Error(\"Must have 0xffff prefix\");\n }\n return ip.slice(12);\n}\nexport function isIPv4mappedIPv6(ip) {\n return deepEqual(ip, ipv4Prefix, 0, 11);\n}\n//# sourceMappingURL=ip.js.map","import { isIPv4, isIPv6 } from '@chainsafe/is-ip';\nimport { toString as uint8ArrayToString } from 'uint8arrays/to-string';\nexport { isIP } from '@chainsafe/is-ip';\nexport const isV4 = isIPv4;\nexport const isV6 = isIPv6;\n// Copied from https://github.com/indutny/node-ip/blob/master/lib/ip.js#L7\n// but with buf/offset args removed because we don't use them\nexport const toBytes = function (ip) {\n let offset = 0;\n ip = ip.toString().trim();\n if (isV4(ip)) {\n const bytes = new Uint8Array(offset + 4);\n ip.split(/\\./g).forEach((byte) => {\n bytes[offset++] = parseInt(byte, 10) & 0xff;\n });\n return bytes;\n }\n if (isV6(ip)) {\n const sections = ip.split(':', 8);\n let i;\n for (i = 0; i < sections.length; i++) {\n const isv4 = isV4(sections[i]);\n let v4Buffer;\n if (isv4) {\n v4Buffer = toBytes(sections[i]);\n sections[i] = uint8ArrayToString(v4Buffer.slice(0, 2), 'base16');\n }\n if (v4Buffer != null && ++i < 8) {\n sections.splice(i, 0, uint8ArrayToString(v4Buffer.slice(2, 4), 'base16'));\n }\n }\n if (sections[0] === '') {\n while (sections.length < 8)\n sections.unshift('0');\n }\n else if (sections[sections.length - 1] === '') {\n while (sections.length < 8)\n sections.push('0');\n }\n else if (sections.length < 8) {\n for (i = 0; i < sections.length && sections[i] !== ''; i++)\n ;\n const argv = [i, 1];\n for (i = 9 - sections.length; i > 0; i--) {\n argv.push('0');\n }\n sections.splice.apply(sections, argv);\n }\n const bytes = new Uint8Array(offset + 16);\n for (i = 0; i < sections.length; i++) {\n const word = parseInt(sections[i], 16);\n bytes[offset++] = (word >> 8) & 0xff;\n bytes[offset++] = word & 0xff;\n }\n return bytes;\n }\n throw new Error('invalid ip address');\n};\n// Copied from https://github.com/indutny/node-ip/blob/master/lib/ip.js#L63\nexport const toString = function (buf, offset = 0, length) {\n offset = ~~offset;\n length = length ?? (buf.length - offset);\n const view = new DataView(buf.buffer);\n if (length === 4) {\n const result = [];\n // IPv4\n for (let i = 0; i < length; i++) {\n result.push(buf[offset + i]);\n }\n return result.join('.');\n }\n if (length === 16) {\n const result = [];\n // IPv6\n for (let i = 0; i < length; i += 2) {\n result.push(view.getUint16(offset + i).toString(16));\n }\n return result.join(':')\n .replace(/(^|:)0(:0)*:0(:|$)/, '$1::$3')\n .replace(/:{3,4}/, '::');\n }\n return '';\n};\n//# sourceMappingURL=ip.js.map","const V = -1;\nexport const names = {};\nexport const codes = {};\nexport const table = [\n [4, 32, 'ip4'],\n [6, 16, 'tcp'],\n [33, 16, 'dccp'],\n [41, 128, 'ip6'],\n [42, V, 'ip6zone'],\n [43, 8, 'ipcidr'],\n [53, V, 'dns', true],\n [54, V, 'dns4', true],\n [55, V, 'dns6', true],\n [56, V, 'dnsaddr', true],\n [132, 16, 'sctp'],\n [273, 16, 'udp'],\n [275, 0, 'p2p-webrtc-star'],\n [276, 0, 'p2p-webrtc-direct'],\n [277, 0, 'p2p-stardust'],\n [280, 0, 'webrtc-direct'],\n [281, 0, 'webrtc'],\n [290, 0, 'p2p-circuit'],\n [301, 0, 'udt'],\n [302, 0, 'utp'],\n [400, V, 'unix', false, true],\n // `ipfs` is added before `p2p` for legacy support.\n // All text representations will default to `p2p`, but `ipfs` will\n // still be supported\n [421, V, 'ipfs'],\n // `p2p` is the preferred name for 421, and is now the default\n [421, V, 'p2p'],\n [443, 0, 'https'],\n [444, 96, 'onion'],\n [445, 296, 'onion3'],\n [446, V, 'garlic64'],\n [448, 0, 'tls'],\n [449, V, 'sni'],\n [460, 0, 'quic'],\n [461, 0, 'quic-v1'],\n [465, 0, 'webtransport'],\n [466, V, 'certhash'],\n [477, 0, 'ws'],\n [478, 0, 'wss'],\n [479, 0, 'p2p-websocket-star'],\n [480, 0, 'http'],\n [481, V, 'http-path'],\n [777, V, 'memory']\n];\n// populate tables\ntable.forEach(row => {\n const proto = createProtocol(...row);\n codes[proto.code] = proto;\n names[proto.name] = proto;\n});\nexport function createProtocol(code, size, name, resolvable, path) {\n return {\n code,\n size,\n name,\n resolvable: Boolean(resolvable),\n path: Boolean(path)\n };\n}\n/**\n * For the passed proto string or number, return a {@link Protocol}\n *\n * @example\n *\n * ```js\n * import { protocol } from '@multiformats/multiaddr'\n *\n * console.info(protocol(4))\n * // { code: 4, size: 32, name: 'ip4', resolvable: false, path: false }\n * ```\n */\nexport function getProtocol(proto) {\n if (typeof proto === 'number') {\n if (codes[proto] != null) {\n return codes[proto];\n }\n throw new Error(`no protocol with code: ${proto}`);\n }\n else if (typeof proto === 'string') {\n if (names[proto] != null) {\n return names[proto];\n }\n throw new Error(`no protocol with name: ${proto}`);\n }\n throw new Error(`invalid protocol id type: ${typeof proto}`);\n}\n//# sourceMappingURL=protocols-table.js.map","/**\n * @packageDocumentation\n *\n * Provides methods for converting\n */\nimport { IpNet } from '@chainsafe/netmask';\nimport { base32 } from 'multiformats/bases/base32';\nimport { base58btc } from 'multiformats/bases/base58';\nimport { bases } from 'multiformats/basics';\nimport { CID } from 'multiformats/cid';\nimport * as Digest from 'multiformats/hashes/digest';\nimport * as varint from 'uint8-varint';\nimport { concat as uint8ArrayConcat } from 'uint8arrays/concat';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport { toString as uint8ArrayToString } from 'uint8arrays/to-string';\nimport * as ip from './ip.js';\nimport { getProtocol } from './protocols-table.js';\nconst ip4Protocol = getProtocol('ip4');\nconst ip6Protocol = getProtocol('ip6');\nconst ipcidrProtocol = getProtocol('ipcidr');\nexport function convert(proto, a) {\n if (a instanceof Uint8Array) {\n return convertToString(proto, a);\n }\n else {\n return convertToBytes(proto, a);\n }\n}\n/**\n * Convert [code,Uint8Array] to string\n */\nexport function convertToString(proto, buf) {\n const protocol = getProtocol(proto);\n switch (protocol.code) {\n case 4: // ipv4\n case 41: // ipv6\n return bytes2ip(buf);\n case 42: // ipv6zone\n return bytes2str(buf);\n case 6: // tcp\n case 273: // udp\n case 33: // dccp\n case 132: // sctp\n return bytes2port(buf).toString();\n case 53: // dns\n case 54: // dns4\n case 55: // dns6\n case 56: // dnsaddr\n case 400: // unix\n case 449: // sni\n case 777: // memory\n return bytes2str(buf);\n case 421: // ipfs\n return bytes2mh(buf);\n case 444: // onion\n return bytes2onion(buf);\n case 445: // onion3\n return bytes2onion(buf);\n case 466: // certhash\n return bytes2mb(buf);\n case 481: // http-path\n return globalThis.encodeURIComponent(bytes2str(buf));\n default:\n return uint8ArrayToString(buf, 'base16'); // no clue. convert to hex\n }\n}\nexport function convertToBytes(proto, str) {\n const protocol = getProtocol(proto);\n switch (protocol.code) {\n case 4: // ipv4\n return ip2bytes(str);\n case 41: // ipv6\n return ip2bytes(str);\n case 42: // ipv6zone\n return str2bytes(str);\n case 6: // tcp\n case 273: // udp\n case 33: // dccp\n case 132: // sctp\n return port2bytes(parseInt(str, 10));\n case 53: // dns\n case 54: // dns4\n case 55: // dns6\n case 56: // dnsaddr\n case 400: // unix\n case 449: // sni\n case 777: // memory\n return str2bytes(str);\n case 421: // ipfs\n return mh2bytes(str);\n case 444: // onion\n return onion2bytes(str);\n case 445: // onion3\n return onion32bytes(str);\n case 466: // certhash\n return mb2bytes(str);\n case 481: // http-path\n return str2bytes(globalThis.decodeURIComponent(str));\n default:\n return uint8ArrayFromString(str, 'base16'); // no clue. convert from hex\n }\n}\nexport function convertToIpNet(multiaddr) {\n let mask;\n let addr;\n multiaddr.stringTuples().forEach(([code, value]) => {\n if (code === ip4Protocol.code || code === ip6Protocol.code) {\n addr = value;\n }\n if (code === ipcidrProtocol.code) {\n mask = value;\n }\n });\n if (mask == null || addr == null) {\n throw new Error('Invalid multiaddr');\n }\n return new IpNet(addr, mask);\n}\nconst decoders = Object.values(bases).map((c) => c.decoder);\nconst anybaseDecoder = (function () {\n let acc = decoders[0].or(decoders[1]);\n decoders.slice(2).forEach((d) => (acc = acc.or(d)));\n return acc;\n})();\nfunction ip2bytes(ipString) {\n if (!ip.isIP(ipString)) {\n throw new Error('invalid ip address');\n }\n return ip.toBytes(ipString);\n}\nfunction bytes2ip(ipBuff) {\n const ipString = ip.toString(ipBuff, 0, ipBuff.length);\n if (ipString == null) {\n throw new Error('ipBuff is required');\n }\n if (!ip.isIP(ipString)) {\n throw new Error('invalid ip address');\n }\n return ipString;\n}\nfunction port2bytes(port) {\n const buf = new ArrayBuffer(2);\n const view = new DataView(buf);\n view.setUint16(0, port);\n return new Uint8Array(buf);\n}\nfunction bytes2port(buf) {\n const view = new DataView(buf.buffer);\n return view.getUint16(buf.byteOffset);\n}\nfunction str2bytes(str) {\n const buf = uint8ArrayFromString(str);\n const size = Uint8Array.from(varint.encode(buf.length));\n return uint8ArrayConcat([size, buf], size.length + buf.length);\n}\nfunction bytes2str(buf) {\n const size = varint.decode(buf);\n buf = buf.slice(varint.encodingLength(size));\n if (buf.length !== size) {\n throw new Error('inconsistent lengths');\n }\n return uint8ArrayToString(buf);\n}\nfunction mh2bytes(hash) {\n let mh;\n if (hash[0] === 'Q' || hash[0] === '1') {\n mh = Digest.decode(base58btc.decode(`z${hash}`)).bytes;\n }\n else {\n mh = CID.parse(hash).multihash.bytes;\n }\n // the address is a varint prefixed multihash string representation\n const size = Uint8Array.from(varint.encode(mh.length));\n return uint8ArrayConcat([size, mh], size.length + mh.length);\n}\nfunction mb2bytes(mbstr) {\n const mb = anybaseDecoder.decode(mbstr);\n const size = Uint8Array.from(varint.encode(mb.length));\n return uint8ArrayConcat([size, mb], size.length + mb.length);\n}\nfunction bytes2mb(buf) {\n const size = varint.decode(buf);\n const hash = buf.slice(varint.encodingLength(size));\n if (hash.length !== size) {\n throw new Error('inconsistent lengths');\n }\n return 'u' + uint8ArrayToString(hash, 'base64url');\n}\n/**\n * Converts bytes to bas58btc string\n */\nfunction bytes2mh(buf) {\n const size = varint.decode(buf);\n const address = buf.slice(varint.encodingLength(size));\n if (address.length !== size) {\n throw new Error('inconsistent lengths');\n }\n return uint8ArrayToString(address, 'base58btc');\n}\nfunction onion2bytes(str) {\n const addr = str.split(':');\n if (addr.length !== 2) {\n throw new Error(`failed to parse onion addr: [\"'${addr.join('\", \"')}'\"]' does not contain a port number`);\n }\n if (addr[0].length !== 16) {\n throw new Error(`failed to parse onion addr: ${addr[0]} not a Tor onion address.`);\n }\n // onion addresses do not include the multibase prefix, add it before decoding\n const buf = base32.decode('b' + addr[0]);\n // onion port number\n const port = parseInt(addr[1], 10);\n if (port < 1 || port > 65536) {\n throw new Error('Port number is not in range(1, 65536)');\n }\n const portBuf = port2bytes(port);\n return uint8ArrayConcat([buf, portBuf], buf.length + portBuf.length);\n}\nfunction onion32bytes(str) {\n const addr = str.split(':');\n if (addr.length !== 2) {\n throw new Error(`failed to parse onion addr: [\"'${addr.join('\", \"')}'\"]' does not contain a port number`);\n }\n if (addr[0].length !== 56) {\n throw new Error(`failed to parse onion addr: ${addr[0]} not a Tor onion3 address.`);\n }\n // onion addresses do not include the multibase prefix, add it before decoding\n const buf = base32.decode(`b${addr[0]}`);\n // onion port number\n const port = parseInt(addr[1], 10);\n if (port < 1 || port > 65536) {\n throw new Error('Port number is not in range(1, 65536)');\n }\n const portBuf = port2bytes(port);\n return uint8ArrayConcat([buf, portBuf], buf.length + portBuf.length);\n}\nfunction bytes2onion(buf) {\n const addrBytes = buf.slice(0, buf.length - 2);\n const portBytes = buf.slice(buf.length - 2);\n const addr = uint8ArrayToString(addrBytes, 'base32');\n const port = bytes2port(portBytes);\n return `${addr}:${port}`;\n}\n//# sourceMappingURL=convert.js.map","import * as varint from 'uint8-varint';\nimport { concat as uint8ArrayConcat } from 'uint8arrays/concat';\nimport { toString as uint8ArrayToString } from 'uint8arrays/to-string';\nimport { convertToBytes, convertToString } from './convert.js';\nimport { getProtocol } from './protocols-table.js';\nexport function stringToMultiaddrParts(str) {\n str = cleanPath(str);\n const tuples = [];\n const stringTuples = [];\n let path = null;\n const parts = str.split('/').slice(1);\n if (parts.length === 1 && parts[0] === '') {\n return {\n bytes: new Uint8Array(),\n string: '/',\n tuples: [],\n stringTuples: [],\n path: null\n };\n }\n for (let p = 0; p < parts.length; p++) {\n const part = parts[p];\n const proto = getProtocol(part);\n if (proto.size === 0) {\n tuples.push([proto.code]);\n stringTuples.push([proto.code]);\n // eslint-disable-next-line no-continue\n continue;\n }\n p++; // advance addr part\n if (p >= parts.length) {\n throw ParseError('invalid address: ' + str);\n }\n // if it's a path proto, take the rest\n if (proto.path === true) {\n // should we need to check each path part to see if it's a proto?\n // This would allow for other protocols to be added after a unix path,\n // however it would have issues if the path had a protocol name in the path\n path = cleanPath(parts.slice(p).join('/'));\n tuples.push([proto.code, convertToBytes(proto.code, path)]);\n stringTuples.push([proto.code, path]);\n break;\n }\n const bytes = convertToBytes(proto.code, parts[p]);\n tuples.push([proto.code, bytes]);\n stringTuples.push([proto.code, convertToString(proto.code, bytes)]);\n }\n return {\n string: stringTuplesToString(stringTuples),\n bytes: tuplesToBytes(tuples),\n tuples,\n stringTuples,\n path\n };\n}\nexport function bytesToMultiaddrParts(bytes) {\n const tuples = [];\n const stringTuples = [];\n let path = null;\n let i = 0;\n while (i < bytes.length) {\n const code = varint.decode(bytes, i);\n const n = varint.encodingLength(code);\n const p = getProtocol(code);\n const size = sizeForAddr(p, bytes.slice(i + n));\n if (size === 0) {\n tuples.push([code]);\n stringTuples.push([code]);\n i += n;\n // eslint-disable-next-line no-continue\n continue;\n }\n const addr = bytes.slice(i + n, i + n + size);\n i += (size + n);\n if (i > bytes.length) { // did not end _exactly_ at buffer.length\n throw ParseError('Invalid address Uint8Array: ' + uint8ArrayToString(bytes, 'base16'));\n }\n // ok, tuple seems good.\n tuples.push([code, addr]);\n const stringAddr = convertToString(code, addr);\n stringTuples.push([code, stringAddr]);\n if (p.path === true) {\n // should we need to check each path part to see if it's a proto?\n // This would allow for other protocols to be added after a unix path,\n // however it would have issues if the path had a protocol name in the path\n path = stringAddr;\n break;\n }\n }\n return {\n bytes: Uint8Array.from(bytes),\n string: stringTuplesToString(stringTuples),\n tuples,\n stringTuples,\n path\n };\n}\n/**\n * [[str name, str addr]... ] -> string\n */\nfunction stringTuplesToString(tuples) {\n const parts = [];\n tuples.map((tup) => {\n const proto = getProtocol(tup[0]);\n parts.push(proto.name);\n if (tup.length > 1 && tup[1] != null) {\n parts.push(tup[1]);\n }\n return null;\n });\n return cleanPath(parts.join('/'));\n}\n/**\n * [[int code, Uint8Array ]... ] -> Uint8Array\n */\nexport function tuplesToBytes(tuples) {\n return uint8ArrayConcat(tuples.map((tup) => {\n const proto = getProtocol(tup[0]);\n let buf = Uint8Array.from(varint.encode(proto.code));\n if (tup.length > 1 && tup[1] != null) {\n buf = uint8ArrayConcat([buf, tup[1]]); // add address buffer\n }\n return buf;\n }));\n}\n/**\n * For the passed address, return the serialized size\n */\nfunction sizeForAddr(p, addr) {\n if (p.size > 0) {\n return p.size / 8;\n }\n else if (p.size === 0) {\n return 0;\n }\n else {\n const size = varint.decode(addr instanceof Uint8Array ? addr : Uint8Array.from(addr));\n return size + varint.encodingLength(size);\n }\n}\nexport function bytesToTuples(buf) {\n const tuples = [];\n let i = 0;\n while (i < buf.length) {\n const code = varint.decode(buf, i);\n const n = varint.encodingLength(code);\n const p = getProtocol(code);\n const size = sizeForAddr(p, buf.slice(i + n));\n if (size === 0) {\n tuples.push([code]);\n i += n;\n // eslint-disable-next-line no-continue\n continue;\n }\n const addr = buf.slice(i + n, i + n + size);\n i += (size + n);\n if (i > buf.length) { // did not end _exactly_ at buffer.length\n throw ParseError('Invalid address Uint8Array: ' + uint8ArrayToString(buf, 'base16'));\n }\n // ok, tuple seems good.\n tuples.push([code, addr]);\n }\n return tuples;\n}\nexport function cleanPath(str) {\n return '/' + str.trim().split('/').filter((a) => a).join('/');\n}\nexport function ParseError(str) {\n return new Error('Error parsing address: ' + str);\n}\n//# sourceMappingURL=codec.js.map","/**\n * @packageDocumentation\n *\n * An implementation of a Multiaddr in JavaScript\n *\n * @example\n *\n * ```js\n * import { multiaddr } from '@multiformats/multiaddr'\n *\n * const ma = multiaddr('/ip4/127.0.0.1/tcp/1234')\n * ```\n */\nimport { CodeError } from '@libp2p/interface';\nimport { base58btc } from 'multiformats/bases/base58';\nimport { CID } from 'multiformats/cid';\nimport { equals as uint8ArrayEquals } from 'uint8arrays/equals';\nimport { toString as uint8ArrayToString } from 'uint8arrays/to-string';\nimport { bytesToMultiaddrParts, stringToMultiaddrParts, tuplesToBytes } from './codec.js';\nimport { getProtocol, names } from './protocols-table.js';\nimport { isMultiaddr, multiaddr, resolvers } from './index.js';\nconst inspect = Symbol.for('nodejs.util.inspect.custom');\nexport const symbol = Symbol.for('@multiformats/js-multiaddr/multiaddr');\nconst DNS_CODES = [\n getProtocol('dns').code,\n getProtocol('dns4').code,\n getProtocol('dns6').code,\n getProtocol('dnsaddr').code\n];\n/**\n * Creates a {@link Multiaddr} from a {@link MultiaddrInput}\n */\nexport class Multiaddr {\n bytes;\n #string;\n #tuples;\n #stringTuples;\n #path;\n [symbol] = true;\n constructor(addr) {\n // default\n if (addr == null) {\n addr = '';\n }\n let parts;\n if (addr instanceof Uint8Array) {\n parts = bytesToMultiaddrParts(addr);\n }\n else if (typeof addr === 'string') {\n if (addr.length > 0 && addr.charAt(0) !== '/') {\n throw new Error(`multiaddr \"${addr}\" must start with a \"/\"`);\n }\n parts = stringToMultiaddrParts(addr);\n }\n else if (isMultiaddr(addr)) { // Multiaddr\n parts = bytesToMultiaddrParts(addr.bytes);\n }\n else {\n throw new Error('addr must be a string, Buffer, or another Multiaddr');\n }\n this.bytes = parts.bytes;\n this.#string = parts.string;\n this.#tuples = parts.tuples;\n this.#stringTuples = parts.stringTuples;\n this.#path = parts.path;\n }\n toString() {\n return this.#string;\n }\n toJSON() {\n return this.toString();\n }\n toOptions() {\n let family;\n let transport;\n let host;\n let port;\n let zone = '';\n const tcp = getProtocol('tcp');\n const udp = getProtocol('udp');\n const ip4 = getProtocol('ip4');\n const ip6 = getProtocol('ip6');\n const dns6 = getProtocol('dns6');\n const ip6zone = getProtocol('ip6zone');\n for (const [code, value] of this.stringTuples()) {\n if (code === ip6zone.code) {\n zone = `%${value ?? ''}`;\n }\n // default to https when protocol & port are omitted from DNS addrs\n if (DNS_CODES.includes(code)) {\n transport = tcp.name;\n port = 443;\n host = `${value ?? ''}${zone}`;\n family = code === dns6.code ? 6 : 4;\n }\n if (code === tcp.code || code === udp.code) {\n transport = getProtocol(code).name;\n port = parseInt(value ?? '');\n }\n if (code === ip4.code || code === ip6.code) {\n transport = getProtocol(code).name;\n host = `${value ?? ''}${zone}`;\n family = code === ip6.code ? 6 : 4;\n }\n }\n if (family == null || transport == null || host == null || port == null) {\n throw new Error('multiaddr must have a valid format: \"/{ip4, ip6, dns4, dns6, dnsaddr}/{address}/{tcp, udp}/{port}\".');\n }\n const opts = {\n family,\n host,\n transport,\n port\n };\n return opts;\n }\n protos() {\n return this.#tuples.map(([code]) => Object.assign({}, getProtocol(code)));\n }\n protoCodes() {\n return this.#tuples.map(([code]) => code);\n }\n protoNames() {\n return this.#tuples.map(([code]) => getProtocol(code).name);\n }\n tuples() {\n return this.#tuples;\n }\n stringTuples() {\n return this.#stringTuples;\n }\n encapsulate(addr) {\n addr = new Multiaddr(addr);\n return new Multiaddr(this.toString() + addr.toString());\n }\n decapsulate(addr) {\n const addrString = addr.toString();\n const s = this.toString();\n const i = s.lastIndexOf(addrString);\n if (i < 0) {\n throw new Error(`Address ${this.toString()} does not contain subaddress: ${addr.toString()}`);\n }\n return new Multiaddr(s.slice(0, i));\n }\n decapsulateCode(code) {\n const tuples = this.tuples();\n for (let i = tuples.length - 1; i >= 0; i--) {\n if (tuples[i][0] === code) {\n return new Multiaddr(tuplesToBytes(tuples.slice(0, i)));\n }\n }\n return this;\n }\n getPeerId() {\n try {\n let tuples = [];\n this.stringTuples().forEach(([code, name]) => {\n if (code === names.p2p.code) {\n tuples.push([code, name]);\n }\n // if this is a p2p-circuit address, return the target peer id if present\n // not the peer id of the relay\n if (code === names['p2p-circuit'].code) {\n tuples = [];\n }\n });\n // Get the last ipfs tuple ['p2p', 'peerid string']\n const tuple = tuples.pop();\n if (tuple?.[1] != null) {\n const peerIdStr = tuple[1];\n // peer id is base58btc encoded string but not multibase encoded so add the `z`\n // prefix so we can validate that it is correctly encoded\n if (peerIdStr[0] === 'Q' || peerIdStr[0] === '1') {\n return uint8ArrayToString(base58btc.decode(`z${peerIdStr}`), 'base58btc');\n }\n // try to parse peer id as CID\n return uint8ArrayToString(CID.parse(peerIdStr).multihash.bytes, 'base58btc');\n }\n return null;\n }\n catch (e) {\n return null;\n }\n }\n getPath() {\n return this.#path;\n }\n equals(addr) {\n return uint8ArrayEquals(this.bytes, addr.bytes);\n }\n async resolve(options) {\n const resolvableProto = this.protos().find((p) => p.resolvable);\n // Multiaddr is not resolvable?\n if (resolvableProto == null) {\n return [this];\n }\n const resolver = resolvers.get(resolvableProto.name);\n if (resolver == null) {\n throw new CodeError(`no available resolver for ${resolvableProto.name}`, 'ERR_NO_AVAILABLE_RESOLVER');\n }\n const result = await resolver(this, options);\n return result.map(str => multiaddr(str));\n }\n nodeAddress() {\n const options = this.toOptions();\n if (options.transport !== 'tcp' && options.transport !== 'udp') {\n throw new Error(`multiaddr must have a valid format - no protocol with name: \"${options.transport}\". Must have a valid transport protocol: \"{tcp, udp}\"`);\n }\n return {\n family: options.family,\n address: options.host,\n port: options.port\n };\n }\n isThinWaistAddress(addr) {\n const protos = (addr ?? this).protos();\n if (protos.length !== 2) {\n return false;\n }\n if (protos[0].code !== 4 && protos[0].code !== 41) {\n return false;\n }\n if (protos[1].code !== 6 && protos[1].code !== 273) {\n return false;\n }\n return true;\n }\n /**\n * Returns Multiaddr as a human-readable string\n * https://nodejs.org/api/util.html#utilinspectcustom\n *\n * @example\n * ```js\n * import { multiaddr } from '@multiformats/multiaddr'\n *\n * console.info(multiaddr('/ip4/127.0.0.1/tcp/4001'))\n * // 'Multiaddr(/ip4/127.0.0.1/tcp/4001)'\n * ```\n */\n [inspect]() {\n return `Multiaddr(${this.#string})`;\n }\n}\n//# sourceMappingURL=multiaddr.js.map","/**\n * @packageDocumentation\n *\n * A standard way to represent addresses that\n *\n * - support any standard network protocol\n * - are self-describing\n * - have a binary packed format\n * - have a nice string representation\n * - encapsulate well\n *\n * @example\n *\n * ```TypeScript\n * import { multiaddr } from '@multiformats/multiaddr'\n * const addr = multiaddr(\"/ip4/127.0.0.1/udp/1234\")\n * // Multiaddr(/ip4/127.0.0.1/udp/1234)\n *\n * const addr = multiaddr(\"/ip4/127.0.0.1/udp/1234\")\n * // Multiaddr(/ip4/127.0.0.1/udp/1234)\n *\n * addr.bytes\n * // \n *\n * addr.toString()\n * // '/ip4/127.0.0.1/udp/1234'\n *\n * addr.protos()\n * // [\n * // {code: 4, name: 'ip4', size: 32},\n * // {code: 273, name: 'udp', size: 16}\n * // ]\n *\n * // gives you an object that is friendly with what Node.js core modules expect for addresses\n * addr.nodeAddress()\n * // {\n * // family: 4,\n * // port: 1234,\n * // address: \"127.0.0.1\"\n * // }\n *\n * addr.encapsulate('/sctp/5678')\n * // Multiaddr(/ip4/127.0.0.1/udp/1234/sctp/5678)\n * ```\n *\n * ## Resolving DNSADDR addresses\n *\n * [DNSADDR](https://github.com/multiformats/multiaddr/blob/master/protocols/DNSADDR.md) is a spec that allows storing a TXT DNS record that contains a Multiaddr.\n *\n * To resolve DNSADDR addresses, call the `.resolve()` function the multiaddr, optionally passing a `DNS` resolver.\n *\n * DNSADDR addresses can resolve to multiple multiaddrs, since there is no limit to the number of TXT records that can be stored.\n *\n * @example Resolving DNSADDR Multiaddrs\n *\n * ```TypeScript\n * import { multiaddr, resolvers } from '@multiformats/multiaddr'\n * import { dnsaddr } from '@multiformats/multiaddr/resolvers'\n *\n * resolvers.set('dnsaddr', dnsaddr)\n *\n * const ma = multiaddr('/dnsaddr/bootstrap.libp2p.io')\n *\n * // resolve with a 5s timeout\n * const resolved = await ma.resolve({\n * signal: AbortSignal.timeout(5000)\n * })\n *\n * console.info(await ma.resolve(resolved)\n * // [Multiaddr('/ip4/147.75...'), Multiaddr('/ip4/147.75...'), Multiaddr('/ip4/147.75...')...]\n * ```\n *\n * @example Using a custom DNS resolver to resolve DNSADDR Multiaddrs\n *\n * See the docs for [@multiformats/dns](https://www.npmjs.com/package/@multiformats/dns) for a full breakdown of how to specify multiple resolvers or resolvers that can be used for specific TLDs.\n *\n * ```TypeScript\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { dns } from '@multiformats/dns'\n * import { dnsJsonOverHttps } from '@multiformats/dns/resolvers'\n *\n * const resolver = dns({\n * '.': dnsJsonOverHttps('https://cloudflare-dns.com/dns-query')\n * })\n *\n * const ma = multiaddr('/dnsaddr/bootstrap.libp2p.io')\n * const resolved = await ma.resolve({\n * dns: resolver\n * })\n *\n * console.info(resolved)\n * // [Multiaddr('/ip4/147.75...'), Multiaddr('/ip4/147.75...'), Multiaddr('/ip4/147.75...')...]\n * ```\n */\nimport { Multiaddr as MultiaddrClass, symbol } from './multiaddr.js';\nimport { getProtocol } from './protocols-table.js';\n/**\n * All configured {@link Resolver}s\n */\nexport const resolvers = new Map();\nexport { MultiaddrFilter } from './filter/multiaddr-filter.js';\n/**\n * Creates a Multiaddr from a node-friendly address object\n *\n * @example\n * ```js\n * import { fromNodeAddress } from '@multiformats/multiaddr'\n *\n * fromNodeAddress({address: '127.0.0.1', port: '4001'}, 'tcp')\n * // Multiaddr(/ip4/127.0.0.1/tcp/4001)\n * ```\n */\nexport function fromNodeAddress(addr, transport) {\n if (addr == null) {\n throw new Error('requires node address object');\n }\n if (transport == null) {\n throw new Error('requires transport protocol');\n }\n let ip;\n let host = addr.address;\n switch (addr.family) {\n case 4:\n ip = 'ip4';\n break;\n case 6:\n ip = 'ip6';\n if (host.includes('%')) {\n const parts = host.split('%');\n if (parts.length !== 2) {\n throw Error('Multiple ip6 zones in multiaddr');\n }\n host = parts[0];\n const zone = parts[1];\n ip = `/ip6zone/${zone}/ip6`;\n }\n break;\n default:\n throw Error('Invalid addr family, should be 4 or 6.');\n }\n return new MultiaddrClass('/' + [ip, host, transport, addr.port].join('/'));\n}\n/**\n * Returns if something is a {@link Multiaddr} that is a resolvable name\n *\n * @example\n *\n * ```js\n * import { isName, multiaddr } from '@multiformats/multiaddr'\n *\n * isName(multiaddr('/ip4/127.0.0.1'))\n * // false\n * isName(multiaddr('/dns/ipfs.io'))\n * // true\n * ```\n */\nexport function isName(addr) {\n if (!isMultiaddr(addr)) {\n return false;\n }\n // if a part of the multiaddr is resolvable, then return true\n return addr.protos().some((proto) => proto.resolvable);\n}\n/**\n * Check if object is a {@link Multiaddr} instance\n *\n * @example\n *\n * ```js\n * import { isMultiaddr, multiaddr } from '@multiformats/multiaddr'\n *\n * isMultiaddr(5)\n * // false\n * isMultiaddr(multiaddr('/ip4/127.0.0.1'))\n * // true\n * ```\n */\nexport function isMultiaddr(value) {\n return Boolean(value?.[symbol]);\n}\n/**\n * A function that takes a {@link MultiaddrInput} and returns a {@link Multiaddr}\n *\n * @example\n * ```js\n * import { multiaddr } from '@libp2p/multiaddr'\n *\n * multiaddr('/ip4/127.0.0.1/tcp/4001')\n * // Multiaddr(/ip4/127.0.0.1/tcp/4001)\n * ```\n *\n * @param {MultiaddrInput} [addr] - If String or Uint8Array, needs to adhere to the address format of a [multiaddr](https://github.com/multiformats/multiaddr#string-format)\n */\nexport function multiaddr(addr) {\n return new MultiaddrClass(addr);\n}\nexport { getProtocol as protocols };\n//# sourceMappingURL=index.js.map","import { sha256 } from \"@noble/hashes/sha256\";\nimport { isDefined } from \"@waku/utils\";\nimport { bytesToUtf8, concat, numberToBytes, utf8ToBytes } from \"@waku/utils/bytes\";\n/**\n * Deterministic Message Hashing as defined in\n * [14/WAKU2-MESSAGE](https://rfc.vac.dev/spec/14/#deterministic-message-hashing)\n */\nexport function messageHash(pubsubTopic, message) {\n const pubsubTopicBytes = utf8ToBytes(pubsubTopic);\n const contentTopicBytes = utf8ToBytes(message.contentTopic);\n const timestampBytes = tryConvertTimestampToBytes(message.timestamp);\n const bytes = concat([\n pubsubTopicBytes,\n message.payload,\n contentTopicBytes,\n message.meta,\n timestampBytes\n ].filter(isDefined));\n return sha256(bytes);\n}\nfunction tryConvertTimestampToBytes(timestamp) {\n if (!timestamp) {\n return;\n }\n let bigIntTimestamp;\n if (typeof timestamp === \"bigint\") {\n bigIntTimestamp = timestamp;\n }\n else {\n bigIntTimestamp = BigInt(timestamp.valueOf()) * 1000000n;\n }\n return numberToBytes(bigIntTimestamp);\n}\nexport function messageHashStr(pubsubTopic, message) {\n const hash = messageHash(pubsubTopic, message);\n const hashStr = bytesToUtf8(hash);\n return hashStr;\n}\n//# sourceMappingURL=index.js.map","import { getHealthManager } from \"@waku/core\";\nimport { delay, Logger } from \"@waku/utils\";\nconst RENEW_TIME_LOCK_DURATION = 30 * 1000;\nconst DEFAULT_NUM_PEERS_TO_USE = 2;\nconst DEFAULT_MAINTAIN_PEERS_INTERVAL = 30_000;\nexport class BaseProtocolSDK {\n core;\n connectionManager;\n healthManager;\n numPeersToUse;\n peers = [];\n maintainPeersIntervalId = null;\n log;\n maintainPeersLock = false;\n renewPeersLocker = new RenewPeerLocker(RENEW_TIME_LOCK_DURATION);\n constructor(core, connectionManager, options) {\n this.core = core;\n this.connectionManager = connectionManager;\n this.log = new Logger(`sdk:${core.multicodec}`);\n this.healthManager = getHealthManager();\n this.numPeersToUse = options?.numPeersToUse ?? DEFAULT_NUM_PEERS_TO_USE;\n const maintainPeersInterval = options?.maintainPeersInterval ?? DEFAULT_MAINTAIN_PEERS_INTERVAL;\n void this.startMaintainPeersInterval(maintainPeersInterval);\n }\n get connectedPeers() {\n return this.peers;\n }\n /**\n * Disconnects from a peer and tries to find a new one to replace it.\n * @param peerToDisconnect The peer to disconnect from.\n * @returns The new peer that was found and connected to.\n */\n async renewPeer(peerToDisconnect) {\n this.log.info(`Renewing peer ${peerToDisconnect}`);\n await this.connectionManager.dropConnection(peerToDisconnect);\n const peer = (await this.findAndAddPeers(1))[0];\n if (!peer) {\n this.log.error(\"Failed to find a new peer to replace the disconnected one.\");\n }\n const updatedPeers = this.peers.filter((peer) => !peer.id.equals(peerToDisconnect));\n this.updatePeers(updatedPeers);\n this.log.info(`Peer ${peerToDisconnect} disconnected and removed from the peer list`);\n this.renewPeersLocker.lock(peerToDisconnect);\n return peer;\n }\n /**\n * Stops the maintain peers interval.\n */\n stopMaintainPeersInterval() {\n if (this.maintainPeersIntervalId) {\n clearInterval(this.maintainPeersIntervalId);\n this.maintainPeersIntervalId = null;\n this.log.info(\"Maintain peers interval stopped\");\n }\n }\n /**\n * Checks if there are peers to send a message to.\n * If `forceUseAllPeers` is `false` (default) and there are connected peers, returns `true`.\n * If `forceUseAllPeers` is `true` or there are no connected peers, tries to find new peers from the ConnectionManager.\n * If `autoRetry` is `false`, returns `false` if no peers are found.\n * If `autoRetry` is `true`, tries to find new peers from the ConnectionManager with exponential backoff.\n * Returns `true` if peers are found, `false` otherwise.\n * @param options Optional options object\n * @param options.autoRetry Optional flag to enable auto-retry with exponential backoff (default: false)\n * @param options.forceUseAllPeers Optional flag to force using all available peers (default: false)\n * @param options.initialDelay Optional initial delay in milliseconds for exponential backoff (default: 10)\n * @param options.maxAttempts Optional maximum number of attempts for exponential backoff (default: 3)\n * @param options.maxDelay Optional maximum delay in milliseconds for exponential backoff (default: 100)\n */\n hasPeers = async (options = {}) => {\n const { autoRetry = false, forceUseAllPeers = false, initialDelay = 10, maxAttempts = 3, maxDelay = 100 } = options;\n if (!forceUseAllPeers && this.connectedPeers.length > 0)\n return true;\n let attempts = 0;\n while (attempts < maxAttempts) {\n attempts++;\n if (await this.maintainPeers()) {\n if (this.peers.length < this.numPeersToUse) {\n this.log.warn(`Found only ${this.peers.length} peers, expected ${this.numPeersToUse}`);\n }\n return true;\n }\n if (!autoRetry)\n return false;\n const delayMs = Math.min(initialDelay * Math.pow(2, attempts - 1), maxDelay);\n await delay(delayMs);\n }\n this.log.error(\"Failed to find peers to send message to\");\n return false;\n };\n /**\n * Starts an interval to maintain the peers list to `numPeersToUse`.\n * @param interval The interval in milliseconds to maintain the peers.\n */\n async startMaintainPeersInterval(interval) {\n this.log.info(\"Starting maintain peers interval\");\n try {\n await this.maintainPeers();\n this.maintainPeersIntervalId = setInterval(() => {\n this.maintainPeers().catch((error) => {\n this.log.error(\"Error during maintain peers interval:\", error);\n });\n }, interval);\n this.log.info(`Maintain peers interval started with interval ${interval}ms`);\n }\n catch (error) {\n this.log.error(\"Error starting maintain peers interval:\", error);\n throw error;\n }\n }\n /**\n * Maintains the peers list to `numPeersToUse`.\n */\n async maintainPeers() {\n if (this.maintainPeersLock) {\n return false;\n }\n this.maintainPeersLock = true;\n this.log.info(`Maintaining peers, current count: ${this.peers.length}`);\n try {\n const numPeersToAdd = this.numPeersToUse - this.peers.length;\n if (numPeersToAdd > 0) {\n await this.findAndAddPeers(numPeersToAdd);\n }\n this.log.info(`Peer maintenance completed, current count: ${this.peers.length}`);\n this.renewPeersLocker.cleanUnlocked();\n }\n finally {\n this.maintainPeersLock = false;\n }\n return true;\n }\n /**\n * Finds and adds new peers to the peers list.\n * @param numPeers The number of peers to find and add.\n */\n async findAndAddPeers(numPeers) {\n this.log.info(`Finding and adding ${numPeers} new peers`);\n try {\n const additionalPeers = await this.findAdditionalPeers(numPeers);\n const dials = additionalPeers.map((peer) => this.connectionManager.attemptDial(peer.id));\n await Promise.all(dials);\n const updatedPeers = [...this.peers, ...additionalPeers];\n this.updatePeers(updatedPeers);\n this.log.info(`Added ${additionalPeers.length} new peers, total peers: ${this.peers.length}`);\n return additionalPeers;\n }\n catch (error) {\n this.log.error(\"Error finding and adding new peers:\", error);\n throw error;\n }\n }\n /**\n * Finds additional peers.\n * Attempts to find peers without using bootstrap peers first,\n * If no peers are found,\n * tries with bootstrap peers.\n * @param numPeers The number of peers to find.\n */\n async findAdditionalPeers(numPeers) {\n this.log.info(`Finding ${numPeers} additional peers`);\n try {\n let newPeers = await this.core.allPeers();\n if (newPeers.length === 0) {\n this.log.warn(\"No new peers found.\");\n }\n newPeers = newPeers\n .filter((peer) => this.peers.some((p) => p.id.equals(peer.id)) === false)\n .filter((peer) => !this.renewPeersLocker.isLocked(peer.id))\n .slice(0, numPeers);\n return newPeers;\n }\n catch (error) {\n this.log.error(\"Error finding additional peers:\", error);\n throw error;\n }\n }\n updatePeers(peers) {\n this.peers = peers;\n this.healthManager.updateProtocolHealth(this.core.multicodec, this.peers.length);\n }\n}\nclass RenewPeerLocker {\n lockDuration;\n peers = new Map();\n constructor(lockDuration) {\n this.lockDuration = lockDuration;\n }\n lock(id) {\n this.peers.set(id.toString(), Date.now());\n }\n isLocked(id) {\n const time = this.peers.get(id.toString());\n if (time && !this.isTimeUnlocked(time)) {\n return true;\n }\n return false;\n }\n cleanUnlocked() {\n Object.entries(this.peers).forEach(([id, lock]) => {\n if (this.isTimeUnlocked(lock)) {\n this.peers.delete(id.toString());\n }\n });\n }\n isTimeUnlocked(time) {\n return Date.now() - time >= this.lockDuration;\n }\n}\n//# sourceMappingURL=base_protocol.js.map","import { FilterCore } from \"@waku/core\";\nimport { EConnectionStateEvents, ProtocolError } from \"@waku/interfaces\";\nimport { messageHashStr } from \"@waku/message-hash\";\nimport { ensurePubsubTopicIsConfigured, groupByContentTopic, Logger, shardInfoToPubsubTopics, toAsyncIterator } from \"@waku/utils\";\nimport { BaseProtocolSDK } from \"./base_protocol.js\";\nconst log = new Logger(\"sdk:filter\");\nconst DEFAULT_MAX_PINGS = 2;\nconst DEFAULT_MAX_MISSED_MESSAGES_THRESHOLD = 3;\nconst DEFAULT_KEEP_ALIVE = 60 * 1000;\nexport class SubscriptionManager {\n pubsubTopic;\n protocol;\n connectionManager;\n getPeers;\n renewPeer;\n subscriptionCallbacks = new Map();\n receivedMessagesHashStr = [];\n peerFailures = new Map();\n receivedMessagesHashes;\n missedMessagesByPeer = new Map();\n keepAliveInterval = DEFAULT_KEEP_ALIVE;\n maxPingFailures = DEFAULT_MAX_PINGS;\n maxMissedMessagesThreshold = DEFAULT_MAX_MISSED_MESSAGES_THRESHOLD;\n keepAliveTimer = null;\n constructor(pubsubTopic, protocol, connectionManager, getPeers, renewPeer) {\n this.pubsubTopic = pubsubTopic;\n this.protocol = protocol;\n this.connectionManager = connectionManager;\n this.getPeers = getPeers;\n this.renewPeer = renewPeer;\n this.pubsubTopic = pubsubTopic;\n const allPeerIdStr = this.getPeers().map((p) => p.id.toString());\n this.receivedMessagesHashes = {\n all: new Set(),\n nodes: {\n ...Object.fromEntries(allPeerIdStr.map((peerId) => [peerId, new Set()]))\n }\n };\n allPeerIdStr.forEach((peerId) => this.missedMessagesByPeer.set(peerId, 0));\n }\n addHash(hash, peerIdStr) {\n this.receivedMessagesHashes.all.add(hash);\n if (!peerIdStr) {\n return;\n }\n if (!this.receivedMessagesHashes.nodes[peerIdStr]) {\n this.receivedMessagesHashes.nodes[peerIdStr] = new Set();\n }\n this.receivedMessagesHashes.nodes[peerIdStr].add(hash);\n }\n async subscribe(decoders, callback, options = {}) {\n this.keepAliveInterval = options.keepAlive || DEFAULT_KEEP_ALIVE;\n this.maxPingFailures = options.pingsBeforePeerRenewed || DEFAULT_MAX_PINGS;\n this.maxMissedMessagesThreshold =\n options.maxMissedMessagesThreshold ||\n DEFAULT_MAX_MISSED_MESSAGES_THRESHOLD;\n const decodersArray = Array.isArray(decoders) ? decoders : [decoders];\n // check that all decoders are configured for the same pubsub topic as this subscription\n for (const decoder of decodersArray) {\n if (decoder.pubsubTopic !== this.pubsubTopic) {\n return {\n failures: [\n {\n error: ProtocolError.TOPIC_DECODER_MISMATCH\n }\n ],\n successes: []\n };\n }\n }\n const decodersGroupedByCT = groupByContentTopic(decodersArray);\n const contentTopics = Array.from(decodersGroupedByCT.keys());\n const promises = this.getPeers().map(async (peer) => this.protocol.subscribe(this.pubsubTopic, peer, contentTopics));\n const results = await Promise.allSettled(promises);\n const finalResult = this.handleResult(results, \"subscribe\");\n // Save the callback functions by content topics so they\n // can easily be removed (reciprocally replaced) if `unsubscribe` (reciprocally `subscribe`)\n // is called for those content topics\n decodersGroupedByCT.forEach((decoders, contentTopic) => {\n // Cast the type because a given `subscriptionCallbacks` map may hold\n // Decoder that decode to different implementations of `IDecodedMessage`\n const subscriptionCallback = {\n decoders,\n callback\n };\n // The callback and decoder may override previous values, this is on\n // purpose as the user may call `subscribe` to refresh the subscription\n this.subscriptionCallbacks.set(contentTopic, subscriptionCallback);\n });\n this.startSubscriptionsMaintenance(this.keepAliveInterval);\n return finalResult;\n }\n async unsubscribe(contentTopics) {\n const promises = this.getPeers().map(async (peer) => {\n const response = await this.protocol.unsubscribe(this.pubsubTopic, peer, contentTopics);\n contentTopics.forEach((contentTopic) => {\n this.subscriptionCallbacks.delete(contentTopic);\n });\n return response;\n });\n const results = await Promise.allSettled(promises);\n const finalResult = this.handleResult(results, \"unsubscribe\");\n if (this.subscriptionCallbacks.size === 0) {\n this.stopSubscriptionsMaintenance();\n }\n return finalResult;\n }\n async ping(peerId) {\n const peers = peerId ? [peerId] : this.getPeers().map((peer) => peer.id);\n const promises = peers.map((peerId) => this.pingSpecificPeer(peerId));\n const results = await Promise.allSettled(promises);\n return this.handleResult(results, \"ping\");\n }\n async unsubscribeAll() {\n const promises = this.getPeers().map(async (peer) => this.protocol.unsubscribeAll(this.pubsubTopic, peer));\n const results = await Promise.allSettled(promises);\n this.subscriptionCallbacks.clear();\n const finalResult = this.handleResult(results, \"unsubscribeAll\");\n this.stopSubscriptionsMaintenance();\n return finalResult;\n }\n async validateMessage() {\n for (const hash of this.receivedMessagesHashes.all) {\n for (const [peerIdStr, hashes] of Object.entries(this.receivedMessagesHashes.nodes)) {\n if (!hashes.has(hash)) {\n this.incrementMissedMessageCount(peerIdStr);\n if (this.shouldRenewPeer(peerIdStr)) {\n log.info(`Peer ${peerIdStr} has missed too many messages, renewing.`);\n const peerId = this.getPeers().find((p) => p.id.toString() === peerIdStr)?.id;\n if (!peerId) {\n log.error(`Unexpected Error: Peer ${peerIdStr} not found in connected peers.`);\n continue;\n }\n try {\n await this.renewAndSubscribePeer(peerId);\n }\n catch (error) {\n log.error(`Failed to renew peer ${peerIdStr}: ${error}`);\n }\n }\n }\n }\n }\n }\n async processIncomingMessage(message, peerIdStr) {\n const hashedMessageStr = messageHashStr(this.pubsubTopic, message);\n this.addHash(hashedMessageStr, peerIdStr);\n void this.validateMessage();\n if (this.receivedMessagesHashStr.includes(hashedMessageStr)) {\n log.info(\"Message already received, skipping\");\n return;\n }\n this.receivedMessagesHashStr.push(hashedMessageStr);\n const { contentTopic } = message;\n const subscriptionCallback = this.subscriptionCallbacks.get(contentTopic);\n if (!subscriptionCallback) {\n log.error(\"No subscription callback available for \", contentTopic);\n return;\n }\n log.info(\"Processing message with content topic \", contentTopic, \" on pubsub topic \", this.pubsubTopic);\n await pushMessage(subscriptionCallback, this.pubsubTopic, message);\n }\n handleResult(results, type) {\n const result = { failures: [], successes: [] };\n for (const promiseResult of results) {\n if (promiseResult.status === \"rejected\") {\n log.error(`Failed to resolve ${type} promise successfully: `, promiseResult.reason);\n result.failures.push({ error: ProtocolError.GENERIC_FAIL });\n }\n else {\n const coreResult = promiseResult.value;\n if (coreResult.failure) {\n result.failures.push(coreResult.failure);\n }\n else {\n result.successes.push(coreResult.success);\n }\n }\n }\n return result;\n }\n async pingSpecificPeer(peerId) {\n const peer = this.getPeers().find((p) => p.id.equals(peerId));\n if (!peer) {\n return {\n success: null,\n failure: {\n peerId,\n error: ProtocolError.NO_PEER_AVAILABLE\n }\n };\n }\n try {\n const result = await this.protocol.ping(peer);\n if (result.failure) {\n await this.handlePeerFailure(peerId);\n }\n else {\n this.peerFailures.delete(peerId.toString());\n }\n return result;\n }\n catch (error) {\n await this.handlePeerFailure(peerId);\n return {\n success: null,\n failure: {\n peerId,\n error: ProtocolError.GENERIC_FAIL\n }\n };\n }\n }\n async handlePeerFailure(peerId) {\n const failures = (this.peerFailures.get(peerId.toString()) || 0) + 1;\n this.peerFailures.set(peerId.toString(), failures);\n if (failures > this.maxPingFailures) {\n try {\n await this.renewAndSubscribePeer(peerId);\n this.peerFailures.delete(peerId.toString());\n }\n catch (error) {\n log.error(`Failed to renew peer ${peerId.toString()}: ${error}.`);\n }\n }\n }\n async renewAndSubscribePeer(peerId) {\n try {\n const newPeer = await this.renewPeer(peerId);\n await this.protocol.subscribe(this.pubsubTopic, newPeer, Array.from(this.subscriptionCallbacks.keys()));\n this.receivedMessagesHashes.nodes[newPeer.id.toString()] = new Set();\n this.missedMessagesByPeer.set(newPeer.id.toString(), 0);\n return newPeer;\n }\n catch (error) {\n log.warn(`Failed to renew peer ${peerId.toString()}: ${error}.`);\n return;\n }\n finally {\n this.peerFailures.delete(peerId.toString());\n this.missedMessagesByPeer.delete(peerId.toString());\n delete this.receivedMessagesHashes.nodes[peerId.toString()];\n }\n }\n startSubscriptionsMaintenance(interval) {\n this.startKeepAlivePings(interval);\n this.startConnectionListener();\n }\n stopSubscriptionsMaintenance() {\n this.stopKeepAlivePings();\n this.stopConnectionListener();\n }\n startKeepAlivePings(interval) {\n if (this.keepAliveTimer) {\n log.info(\"Recurring pings already set up.\");\n return;\n }\n this.keepAliveTimer = setInterval(() => {\n void this.ping().catch((error) => {\n log.error(\"Error in keep-alive ping cycle:\", error);\n });\n }, interval);\n }\n stopKeepAlivePings() {\n if (!this.keepAliveTimer) {\n log.info(\"Already stopped recurring pings.\");\n return;\n }\n log.info(\"Stopping recurring pings.\");\n clearInterval(this.keepAliveTimer);\n this.keepAliveTimer = null;\n }\n startConnectionListener() {\n this.connectionManager.addEventListener(EConnectionStateEvents.CONNECTION_STATUS, this.connectionListener.bind(this));\n }\n stopConnectionListener() {\n this.connectionManager.removeEventListener(EConnectionStateEvents.CONNECTION_STATUS, this.connectionListener.bind(this));\n }\n async connectionListener({ detail: isConnected }) {\n if (!isConnected) {\n this.stopKeepAlivePings();\n return;\n }\n try {\n const result = await this.ping();\n const renewPeerPromises = result.failures.map(async (v) => {\n if (v.peerId) {\n await this.renewAndSubscribePeer(v.peerId);\n }\n });\n await Promise.all(renewPeerPromises);\n }\n catch (err) {\n log.error(`networkStateListener failed to recover: ${err}`);\n }\n this.startKeepAlivePings(this.keepAliveInterval);\n }\n incrementMissedMessageCount(peerIdStr) {\n const currentCount = this.missedMessagesByPeer.get(peerIdStr) || 0;\n this.missedMessagesByPeer.set(peerIdStr, currentCount + 1);\n }\n shouldRenewPeer(peerIdStr) {\n const missedMessages = this.missedMessagesByPeer.get(peerIdStr) || 0;\n return missedMessages > this.maxMissedMessagesThreshold;\n }\n}\nclass FilterSDK extends BaseProtocolSDK {\n protocol;\n _connectionManager;\n activeSubscriptions = new Map();\n constructor(connectionManager, libp2p, options) {\n super(new FilterCore(async (pubsubTopic, wakuMessage, peerIdStr) => {\n const subscription = this.getActiveSubscription(pubsubTopic);\n if (!subscription) {\n log.error(`No subscription locally registered for topic ${pubsubTopic}`);\n return;\n }\n await subscription.processIncomingMessage(wakuMessage, peerIdStr);\n }, connectionManager.configuredPubsubTopics, libp2p), connectionManager, { numPeersToUse: options?.numPeersToUse });\n this.protocol = this.core;\n this._connectionManager = connectionManager;\n }\n /**\n * Opens a subscription with the Filter protocol using the provided decoders and callback.\n * This method combines the functionality of creating a subscription and subscribing to it.\n *\n * @param {IDecoder | IDecoder[]} decoders - A single decoder or an array of decoders to use for decoding messages.\n * @param {Callback} callback - The callback function to be invoked with decoded messages.\n * @param {ProtocolUseOptions} [protocolUseOptions] - Optional settings for using the protocol.\n * @param {SubscribeOptions} [subscribeOptions] - Options for the subscription.\n *\n * @returns {Promise} A promise that resolves to an object containing:\n * - subscription: The created subscription object if successful, or null if failed.\n * - error: A ProtocolError if the subscription creation failed, or null if successful.\n * - results: An object containing arrays of failures and successes from the subscription process.\n * Only present if the subscription was created successfully.\n *\n * @throws {Error} If there's an unexpected error during the subscription process.\n *\n * @remarks\n * This method attempts to create a subscription using the pubsub topic derived from the provided decoders,\n * then tries to subscribe using the created subscription. The return value should be interpreted as follows:\n * - If `subscription` is null and `error` is non-null, a critical error occurred and the subscription failed completely.\n * - If `subscription` is non-null and `error` is null, the subscription was created successfully.\n * In this case, check the `results` field for detailed information about successes and failures during the subscription process.\n * - Even if the subscription was created successfully, there might be some failures in the results.\n *\n * @example\n * ```typescript\n * const {subscription, error, results} = await waku.filter.subscribe(decoders, callback);\n * if (!subscription || error) {\n * console.error(\"Failed to create subscription:\", error);\n * }\n * console.log(\"Subscription created successfully\");\n * if (results.failures.length > 0) {\n * console.warn(\"Some errors occurred during subscription:\", results.failures);\n * }\n * console.log(\"Successful subscriptions:\", results.successes);\n *\n * ```\n */\n async subscribe(decoders, callback, protocolUseOptions, subscribeOptions) {\n const uniquePubsubTopics = this.getUniquePubsubTopics(decoders);\n if (uniquePubsubTopics.length !== 1) {\n return {\n subscription: null,\n error: ProtocolError.INVALID_DECODER_TOPICS,\n results: null\n };\n }\n const pubsubTopic = uniquePubsubTopics[0];\n const { subscription, error } = await this.createSubscription(pubsubTopic, protocolUseOptions);\n if (error) {\n return {\n subscription: null,\n error: error,\n results: null\n };\n }\n const { failures, successes } = await subscription.subscribe(decoders, callback, subscribeOptions);\n return {\n subscription,\n error: null,\n results: {\n failures: failures,\n successes: successes\n }\n };\n }\n /**\n * Creates a new subscription to the given pubsub topic.\n * The subscription is made to multiple peers for decentralization.\n * @param pubsubTopicShardInfo The pubsub topic to subscribe to.\n * @returns The subscription object.\n */\n async createSubscription(pubsubTopicShardInfo, options) {\n options = {\n autoRetry: true,\n ...options\n };\n const pubsubTopic = typeof pubsubTopicShardInfo == \"string\"\n ? pubsubTopicShardInfo\n : shardInfoToPubsubTopics(pubsubTopicShardInfo)?.[0];\n ensurePubsubTopicIsConfigured(pubsubTopic, this.protocol.pubsubTopics);\n const hasPeers = await this.hasPeers(options);\n if (!hasPeers) {\n return {\n error: ProtocolError.NO_PEER_AVAILABLE,\n subscription: null\n };\n }\n log.info(`Creating filter subscription with ${this.connectedPeers.length} peers: `, this.connectedPeers.map((peer) => peer.id.toString()));\n const subscription = this.getActiveSubscription(pubsubTopic) ??\n this.setActiveSubscription(pubsubTopic, new SubscriptionManager(pubsubTopic, this.protocol, this._connectionManager, () => this.connectedPeers, this.renewPeer.bind(this)));\n return {\n error: null,\n subscription\n };\n }\n /**\n * This method is used to satisfy the `IReceiver` interface.\n *\n * @hidden\n *\n * @param decoders The decoders to use for the subscription.\n * @param callback The callback function to use for the subscription.\n * @param opts Optional protocol options for the subscription.\n *\n * @returns A Promise that resolves to a function that unsubscribes from the subscription.\n *\n * @remarks\n * This method should not be used directly.\n * Instead, use `createSubscription` to create a new subscription.\n */\n async subscribeWithUnsubscribe(decoders, callback, options) {\n const uniquePubsubTopics = this.getUniquePubsubTopics(decoders);\n if (uniquePubsubTopics.length === 0) {\n throw Error(\"Failed to subscribe: no pubsubTopic found on decoders provided.\");\n }\n if (uniquePubsubTopics.length > 1) {\n throw Error(\"Failed to subscribe: all decoders should have the same pubsub topic. Use createSubscription to be more agile.\");\n }\n const { subscription, error } = await this.createSubscription(uniquePubsubTopics[0]);\n if (error) {\n throw Error(`Failed to create subscription: ${error}`);\n }\n await subscription.subscribe(decoders, callback, options);\n const contentTopics = Array.from(groupByContentTopic(Array.isArray(decoders) ? decoders : [decoders]).keys());\n return async () => {\n await subscription.unsubscribe(contentTopics);\n };\n }\n toSubscriptionIterator(decoders) {\n return toAsyncIterator(this, decoders);\n }\n //TODO: move to SubscriptionManager\n getActiveSubscription(pubsubTopic) {\n return this.activeSubscriptions.get(pubsubTopic);\n }\n setActiveSubscription(pubsubTopic, subscription) {\n this.activeSubscriptions.set(pubsubTopic, subscription);\n return subscription;\n }\n getUniquePubsubTopics(decoders) {\n if (!Array.isArray(decoders)) {\n return [decoders.pubsubTopic];\n }\n if (decoders.length === 0) {\n return [];\n }\n const pubsubTopics = new Set(decoders.map((d) => d.pubsubTopic));\n return [...pubsubTopics];\n }\n}\nexport function wakuFilter(connectionManager, init) {\n return (libp2p) => new FilterSDK(connectionManager, libp2p, init);\n}\nasync function pushMessage(subscriptionCallback, pubsubTopic, message) {\n const { decoders, callback } = subscriptionCallback;\n const { contentTopic } = message;\n if (!contentTopic) {\n log.warn(\"Message has no content topic, skipping\");\n return;\n }\n try {\n const decodePromises = decoders.map((dec) => dec\n .fromProtoObj(pubsubTopic, message)\n .then((decoded) => decoded || Promise.reject(\"Decoding failed\")));\n const decodedMessage = await Promise.any(decodePromises);\n await callback(decodedMessage);\n }\n catch (e) {\n log.error(\"Error decoding message\", e);\n }\n}\n//# sourceMappingURL=filter.js.map","import { LightPushCore } from \"@waku/core\";\nimport { ProtocolError } from \"@waku/interfaces\";\nimport { ensurePubsubTopicIsConfigured, Logger } from \"@waku/utils\";\nimport { BaseProtocolSDK } from \"./base_protocol.js\";\nconst log = new Logger(\"sdk:light-push\");\nclass LightPushSDK extends BaseProtocolSDK {\n protocol;\n constructor(connectionManager, libp2p, options) {\n super(new LightPushCore(connectionManager.configuredPubsubTopics, libp2p), connectionManager, {\n numPeersToUse: options?.numPeersToUse\n });\n this.protocol = this.core;\n }\n async send(encoder, message, _options) {\n const options = {\n autoRetry: true,\n ..._options\n };\n const successes = [];\n const failures = [];\n const { pubsubTopic } = encoder;\n try {\n ensurePubsubTopicIsConfigured(pubsubTopic, this.protocol.pubsubTopics);\n }\n catch (error) {\n log.error(\"Failed to send waku light push: pubsub topic not configured\");\n return {\n failures: [\n {\n error: ProtocolError.TOPIC_NOT_CONFIGURED\n }\n ],\n successes: []\n };\n }\n const hasPeers = await this.hasPeers(options);\n if (!hasPeers) {\n return {\n successes,\n failures: [\n {\n error: ProtocolError.NO_PEER_AVAILABLE\n }\n ]\n };\n }\n const sendPromises = this.connectedPeers.map((peer) => this.protocol.send(encoder, message, peer));\n const results = await Promise.allSettled(sendPromises);\n for (const result of results) {\n if (result.status === \"fulfilled\") {\n const { failure, success } = result.value;\n if (success) {\n successes.push(success);\n }\n if (failure) {\n if (failure.peerId) {\n try {\n await this.renewPeer(failure.peerId);\n log.info(\"Renewed peer\", failure.peerId.toString());\n }\n catch (error) {\n log.error(\"Failed to renew peer\", error);\n }\n }\n failures.push(failure);\n }\n }\n else {\n log.error(\"Failed unexpectedly while sending:\", result.reason);\n failures.push({ error: ProtocolError.GENERIC_FAIL });\n }\n }\n return {\n successes,\n failures\n };\n }\n}\nexport function wakuLightPush(connectionManager, init = {}) {\n return (libp2p) => new LightPushSDK(connectionManager, libp2p, init);\n}\n//# sourceMappingURL=light_push.js.map","import { StoreCore } from \"@waku/core\";\nimport { messageHash } from \"@waku/message-hash\";\nimport { ensurePubsubTopicIsConfigured, isDefined, Logger } from \"@waku/utils\";\nimport { BaseProtocolSDK } from \"./base_protocol.js\";\nconst DEFAULT_NUM_PEERS = 1;\nconst log = new Logger(\"waku:store:sdk\");\n/**\n * StoreSDK is an implementation of the IStoreSDK interface.\n * It provides methods to interact with the Waku Store protocol.\n */\nexport class StoreSDK extends BaseProtocolSDK {\n protocol;\n constructor(connectionManager, libp2p) {\n super(new StoreCore(connectionManager.configuredPubsubTopics, libp2p), connectionManager, {\n numPeersToUse: DEFAULT_NUM_PEERS\n });\n this.protocol = this.core;\n }\n /**\n * Queries the Waku Store for historical messages using the provided decoders and options.\n * Returns an asynchronous generator that yields promises of decoded messages.\n *\n * @param decoders - An array of message decoders.\n * @param options - Optional query parameters.\n * @returns An asynchronous generator of promises of decoded messages.\n * @throws If no peers are available to query or if an error occurs during the query.\n */\n async *queryGenerator(decoders, options) {\n const { pubsubTopic, contentTopics, decodersAsMap } = this.validateDecodersAndPubsubTopic(decoders);\n const queryOpts = {\n pubsubTopic,\n contentTopics,\n includeData: true,\n paginationForward: true,\n ...options\n };\n const peer = (await this.protocol.getPeers({\n numPeers: this.numPeersToUse,\n maxBootstrapPeers: 1\n }))[0];\n if (!peer) {\n log.error(\"No peers available to query\");\n throw new Error(\"No peers available to query\");\n }\n log.info(`Querying store with options: ${JSON.stringify(options)}`);\n const responseGenerator = this.protocol.queryPerPage(queryOpts, decodersAsMap, peer);\n for await (const messages of responseGenerator) {\n yield messages;\n }\n }\n /**\n * Queries the Waku Store for historical messages and processes them with the provided callback in order.\n *\n * @param decoders - An array of message decoders.\n * @param callback - A callback function to process each decoded message.\n * @param options - Optional query parameters.\n * @returns A promise that resolves when the query and message processing are completed.\n */\n async queryWithOrderedCallback(decoders, callback, options) {\n log.info(\"Querying store with ordered callback\");\n for await (const promises of this.queryGenerator(decoders, options)) {\n if (await this.processMessages(promises, callback))\n break;\n }\n }\n /**\n * Queries the Waku Store for historical messages and processes them with the provided callback using promises.\n *\n * @param decoders - An array of message decoders.\n * @param callback - A callback function to process each promise of a decoded message.\n * @param options - Optional query parameters.\n * @returns A promise that resolves when the query and message processing are completed.\n */\n async queryWithPromiseCallback(decoders, callback, options) {\n log.info(\"Querying store with promise callback\");\n let abort = false;\n for await (const page of this.queryGenerator(decoders, options)) {\n const _promises = page.map(async (msgPromise) => {\n if (abort)\n return;\n abort = Boolean(await callback(msgPromise));\n });\n await Promise.all(_promises);\n if (abort)\n break;\n }\n }\n /**\n * Processes messages based on the provided callback and options.\n *\n * @param messages - An array of promises of decoded messages.\n * @param callback - A callback function to process each decoded message.\n * @returns A promise that resolves to a boolean indicating whether the processing should abort.\n * @private\n */\n async processMessages(messages, callback) {\n let abort = false;\n const messagesOrUndef = await Promise.all(messages);\n const processedMessages = messagesOrUndef.filter(isDefined);\n await Promise.all(processedMessages.map(async (msg) => {\n if (msg && !abort) {\n abort = Boolean(await callback(msg));\n }\n }));\n return abort;\n }\n /**\n * Creates a cursor based on the provided decoded message.\n *\n * @param message - The decoded message.\n * @returns A StoreCursor representing the message.\n */\n createCursor(message) {\n return messageHash(message.pubsubTopic, message);\n }\n /**\n * Validates the provided decoders and pubsub topic.\n *\n * @param decoders - An array of message decoders.\n * @returns An object containing the pubsub topic, content topics, and a map of decoders.\n * @throws If no decoders are provided, if multiple pubsub topics are provided, or if no decoders are found for the pubsub topic.\n * @private\n */\n validateDecodersAndPubsubTopic(decoders) {\n if (decoders.length === 0) {\n log.error(\"No decoders provided\");\n throw new Error(\"No decoders provided\");\n }\n const uniquePubsubTopicsInQuery = Array.from(new Set(decoders.map((decoder) => decoder.pubsubTopic)));\n if (uniquePubsubTopicsInQuery.length > 1) {\n log.error(\"API does not support querying multiple pubsub topics at once\");\n throw new Error(\"API does not support querying multiple pubsub topics at once\");\n }\n const pubsubTopicForQuery = uniquePubsubTopicsInQuery[0];\n ensurePubsubTopicIsConfigured(pubsubTopicForQuery, this.protocol.pubsubTopics);\n const decodersAsMap = new Map();\n decoders.forEach((dec) => {\n if (decodersAsMap.has(dec.contentTopic)) {\n log.error(\"API does not support different decoder per content topic\");\n throw new Error(\"API does not support different decoder per content topic\");\n }\n decodersAsMap.set(dec.contentTopic, dec);\n });\n const contentTopics = decoders\n .filter((decoder) => decoder.pubsubTopic === pubsubTopicForQuery)\n .map((dec) => dec.contentTopic);\n if (contentTopics.length === 0) {\n log.error(`No decoders found for topic ${pubsubTopicForQuery}`);\n throw new Error(\"No decoders found for topic \" + pubsubTopicForQuery);\n }\n return {\n pubsubTopic: pubsubTopicForQuery,\n contentTopics,\n decodersAsMap\n };\n }\n}\n/**\n * Factory function to create an instance of the StoreSDK.\n *\n * @param init - Partial options for protocol creation.\n * @returns A function that takes a Libp2p instance and returns a StoreSDK instance.\n */\nexport function wakuStore(connectionManager) {\n return (libp2p) => {\n return new StoreSDK(connectionManager, libp2p);\n };\n}\n//# sourceMappingURL=store.js.map","import { isPeerId } from \"@libp2p/interface\";\nimport { multiaddr } from \"@multiformats/multiaddr\";\nimport { ConnectionManager, getHealthManager } from \"@waku/core\";\nimport { Protocols } from \"@waku/interfaces\";\nimport { Logger } from \"@waku/utils\";\nimport { wakuFilter } from \"./protocols/filter.js\";\nimport { wakuLightPush } from \"./protocols/light_push.js\";\nimport { wakuStore } from \"./protocols/store.js\";\nexport const DefaultPingKeepAliveValueSecs = 5 * 60;\nexport const DefaultRelayKeepAliveValueSecs = 5 * 60;\nexport const DefaultUserAgent = \"js-waku\";\nexport const DefaultPingMaxInboundStreams = 10;\nconst log = new Logger(\"waku\");\nexport class WakuNode {\n pubsubTopics;\n libp2p;\n relay;\n store;\n filter;\n lightPush;\n connectionManager;\n health;\n constructor(pubsubTopics, options, libp2p, protocolsEnabled, relay) {\n this.pubsubTopics = pubsubTopics;\n this.relay = relay;\n this.libp2p = libp2p;\n protocolsEnabled = {\n filter: false,\n lightpush: false,\n store: false,\n ...protocolsEnabled\n };\n const pingKeepAlive = options.pingKeepAlive || DefaultPingKeepAliveValueSecs;\n const relayKeepAlive = this.relay\n ? options.relayKeepAlive || DefaultRelayKeepAliveValueSecs\n : 0;\n const peerId = this.libp2p.peerId.toString();\n this.connectionManager = ConnectionManager.create(peerId, libp2p, { pingKeepAlive, relayKeepAlive }, this.pubsubTopics, this.relay);\n this.health = getHealthManager();\n if (protocolsEnabled.store) {\n const store = wakuStore(this.connectionManager);\n this.store = store(libp2p);\n }\n if (protocolsEnabled.lightpush) {\n const lightPush = wakuLightPush(this.connectionManager);\n this.lightPush = lightPush(libp2p);\n }\n if (protocolsEnabled.filter) {\n const filter = wakuFilter(this.connectionManager);\n this.filter = filter(libp2p);\n }\n log.info(\"Waku node created\", peerId, `relay: ${!!this.relay}, store: ${!!this.store}, light push: ${!!this\n .lightPush}, filter: ${!!this.filter}`);\n }\n /**\n * Dials to the provided peer.\n *\n * @param peer The peer to dial\n * @param protocols Waku protocols we expect from the peer; Defaults to mounted protocols\n */\n async dial(peer, protocols) {\n const _protocols = protocols ?? [];\n const peerId = mapToPeerIdOrMultiaddr(peer);\n if (typeof protocols === \"undefined\") {\n this.relay && _protocols.push(Protocols.Relay);\n this.store && _protocols.push(Protocols.Store);\n this.filter && _protocols.push(Protocols.Filter);\n this.lightPush && _protocols.push(Protocols.LightPush);\n }\n const codecs = [];\n if (_protocols.includes(Protocols.Relay)) {\n if (this.relay) {\n this.relay.gossipSub.multicodecs.forEach((codec) => codecs.push(codec));\n }\n else {\n log.error(\"Relay codec not included in dial codec: protocol not mounted locally\");\n }\n }\n if (_protocols.includes(Protocols.Store)) {\n if (this.store) {\n codecs.push(this.store.protocol.multicodec);\n }\n else {\n log.error(\"Store codec not included in dial codec: protocol not mounted locally\");\n }\n }\n if (_protocols.includes(Protocols.LightPush)) {\n if (this.lightPush) {\n codecs.push(this.lightPush.protocol.multicodec);\n }\n else {\n log.error(\"Light Push codec not included in dial codec: protocol not mounted locally\");\n }\n }\n if (_protocols.includes(Protocols.Filter)) {\n if (this.filter) {\n codecs.push(this.filter.protocol.multicodec);\n }\n else {\n log.error(\"Filter codec not included in dial codec: protocol not mounted locally\");\n }\n }\n log.info(`Dialing to ${peerId.toString()} with protocols ${_protocols}`);\n return this.libp2p.dialProtocol(peerId, codecs);\n }\n async start() {\n await this.libp2p.start();\n }\n async stop() {\n this.connectionManager.stop();\n await this.libp2p.stop();\n }\n isStarted() {\n return this.libp2p.status == \"started\";\n }\n isConnected() {\n return this.connectionManager.isConnected();\n }\n /**\n * Return the local multiaddr with peer id on which libp2p is listening.\n *\n * @throws if libp2p is not listening on localhost.\n */\n getLocalMultiaddrWithID() {\n const localMultiaddr = this.libp2p\n .getMultiaddrs()\n .find((addr) => addr.toString().match(/127\\.0\\.0\\.1/));\n if (!localMultiaddr || localMultiaddr.toString() === \"\") {\n throw \"Not listening on localhost\";\n }\n return localMultiaddr + \"/p2p/\" + this.libp2p.peerId.toString();\n }\n}\nfunction mapToPeerIdOrMultiaddr(peerId) {\n return isPeerId(peerId) ? peerId : multiaddr(peerId);\n}\n//# sourceMappingURL=waku.js.map","import { concat as uint8ArrayConcat } from 'uint8arrays/concat';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nexport function base64urlToBuffer(str, len) {\n let buf = uint8ArrayFromString(str, 'base64urlpad');\n if (len != null) {\n if (buf.length > len)\n throw new Error('byte array longer than desired length');\n buf = uint8ArrayConcat([new Uint8Array(len - buf.length), buf]);\n }\n return buf;\n}\nexport function isPromise(thing) {\n if (thing == null) {\n return false;\n }\n return typeof thing.then === 'function' &&\n typeof thing.catch === 'function' &&\n typeof thing.finally === 'function';\n}\n//# sourceMappingURL=util.js.map","const U32_MASK64 = /* @__PURE__ */ BigInt(2 ** 32 - 1);\nconst _32n = /* @__PURE__ */ BigInt(32);\n// We are not using BigUint64Array, because they are extremely slow as per 2022\nfunction fromBig(n, le = false) {\n if (le)\n return { h: Number(n & U32_MASK64), l: Number((n >> _32n) & U32_MASK64) };\n return { h: Number((n >> _32n) & U32_MASK64) | 0, l: Number(n & U32_MASK64) | 0 };\n}\nfunction split(lst, le = false) {\n let Ah = new Uint32Array(lst.length);\n let Al = new Uint32Array(lst.length);\n for (let i = 0; i < lst.length; i++) {\n const { h, l } = fromBig(lst[i], le);\n [Ah[i], Al[i]] = [h, l];\n }\n return [Ah, Al];\n}\nconst toBig = (h, l) => (BigInt(h >>> 0) << _32n) | BigInt(l >>> 0);\n// for Shift in [0, 32)\nconst shrSH = (h, _l, s) => h >>> s;\nconst shrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in [1, 32)\nconst rotrSH = (h, l, s) => (h >>> s) | (l << (32 - s));\nconst rotrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotrBH = (h, l, s) => (h << (64 - s)) | (l >>> (s - 32));\nconst rotrBL = (h, l, s) => (h >>> (s - 32)) | (l << (64 - s));\n// Right rotate for shift===32 (just swaps l&h)\nconst rotr32H = (_h, l) => l;\nconst rotr32L = (h, _l) => h;\n// Left rotate for Shift in [1, 32)\nconst rotlSH = (h, l, s) => (h << s) | (l >>> (32 - s));\nconst rotlSL = (h, l, s) => (l << s) | (h >>> (32 - s));\n// Left rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotlBH = (h, l, s) => (l << (s - 32)) | (h >>> (64 - s));\nconst rotlBL = (h, l, s) => (h << (s - 32)) | (l >>> (64 - s));\n// JS uses 32-bit signed integers for bitwise operations which means we cannot\n// simple take carry out of low bit sum by shift, we need to use division.\nfunction add(Ah, Al, Bh, Bl) {\n const l = (Al >>> 0) + (Bl >>> 0);\n return { h: (Ah + Bh + ((l / 2 ** 32) | 0)) | 0, l: l | 0 };\n}\n// Addition with more than 2 elements\nconst add3L = (Al, Bl, Cl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);\nconst add3H = (low, Ah, Bh, Ch) => (Ah + Bh + Ch + ((low / 2 ** 32) | 0)) | 0;\nconst add4L = (Al, Bl, Cl, Dl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);\nconst add4H = (low, Ah, Bh, Ch, Dh) => (Ah + Bh + Ch + Dh + ((low / 2 ** 32) | 0)) | 0;\nconst add5L = (Al, Bl, Cl, Dl, El) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);\nconst add5H = (low, Ah, Bh, Ch, Dh, Eh) => (Ah + Bh + Ch + Dh + Eh + ((low / 2 ** 32) | 0)) | 0;\n// prettier-ignore\nexport { fromBig, split, toBig, shrSH, shrSL, rotrSH, rotrSL, rotrBH, rotrBL, rotr32H, rotr32L, rotlSH, rotlSL, rotlBH, rotlBL, add, add3L, add3H, add4L, add4H, add5H, add5L, };\n// prettier-ignore\nconst u64 = {\n fromBig, split, toBig,\n shrSH, shrSL,\n rotrSH, rotrSL, rotrBH, rotrBL,\n rotr32H, rotr32L,\n rotlSH, rotlSL, rotlBH, rotlBL,\n add, add3L, add3H, add4L, add4H, add5H, add5L,\n};\nexport default u64;\n//# sourceMappingURL=_u64.js.map","import { HashMD } from './_md.js';\nimport u64 from './_u64.js';\nimport { wrapConstructor } from './utils.js';\n// Round contants (first 32 bits of the fractional parts of the cube roots of the first 80 primes 2..409):\n// prettier-ignore\nconst [SHA512_Kh, SHA512_Kl] = /* @__PURE__ */ (() => u64.split([\n '0x428a2f98d728ae22', '0x7137449123ef65cd', '0xb5c0fbcfec4d3b2f', '0xe9b5dba58189dbbc',\n '0x3956c25bf348b538', '0x59f111f1b605d019', '0x923f82a4af194f9b', '0xab1c5ed5da6d8118',\n '0xd807aa98a3030242', '0x12835b0145706fbe', '0x243185be4ee4b28c', '0x550c7dc3d5ffb4e2',\n '0x72be5d74f27b896f', '0x80deb1fe3b1696b1', '0x9bdc06a725c71235', '0xc19bf174cf692694',\n '0xe49b69c19ef14ad2', '0xefbe4786384f25e3', '0x0fc19dc68b8cd5b5', '0x240ca1cc77ac9c65',\n '0x2de92c6f592b0275', '0x4a7484aa6ea6e483', '0x5cb0a9dcbd41fbd4', '0x76f988da831153b5',\n '0x983e5152ee66dfab', '0xa831c66d2db43210', '0xb00327c898fb213f', '0xbf597fc7beef0ee4',\n '0xc6e00bf33da88fc2', '0xd5a79147930aa725', '0x06ca6351e003826f', '0x142929670a0e6e70',\n '0x27b70a8546d22ffc', '0x2e1b21385c26c926', '0x4d2c6dfc5ac42aed', '0x53380d139d95b3df',\n '0x650a73548baf63de', '0x766a0abb3c77b2a8', '0x81c2c92e47edaee6', '0x92722c851482353b',\n '0xa2bfe8a14cf10364', '0xa81a664bbc423001', '0xc24b8b70d0f89791', '0xc76c51a30654be30',\n '0xd192e819d6ef5218', '0xd69906245565a910', '0xf40e35855771202a', '0x106aa07032bbd1b8',\n '0x19a4c116b8d2d0c8', '0x1e376c085141ab53', '0x2748774cdf8eeb99', '0x34b0bcb5e19b48a8',\n '0x391c0cb3c5c95a63', '0x4ed8aa4ae3418acb', '0x5b9cca4f7763e373', '0x682e6ff3d6b2b8a3',\n '0x748f82ee5defb2fc', '0x78a5636f43172f60', '0x84c87814a1f0ab72', '0x8cc702081a6439ec',\n '0x90befffa23631e28', '0xa4506cebde82bde9', '0xbef9a3f7b2c67915', '0xc67178f2e372532b',\n '0xca273eceea26619c', '0xd186b8c721c0c207', '0xeada7dd6cde0eb1e', '0xf57d4f7fee6ed178',\n '0x06f067aa72176fba', '0x0a637dc5a2c898a6', '0x113f9804bef90dae', '0x1b710b35131c471b',\n '0x28db77f523047d84', '0x32caab7b40c72493', '0x3c9ebe0a15c9bebc', '0x431d67c49c100d4c',\n '0x4cc5d4becb3e42b6', '0x597f299cfc657e2a', '0x5fcb6fab3ad6faec', '0x6c44198c4a475817'\n].map(n => BigInt(n))))();\n// Temporary buffer, not used to store anything between runs\nconst SHA512_W_H = /* @__PURE__ */ new Uint32Array(80);\nconst SHA512_W_L = /* @__PURE__ */ new Uint32Array(80);\nexport class SHA512 extends HashMD {\n constructor() {\n super(128, 64, 16, false);\n // We cannot use array here since array allows indexing by variable which means optimizer/compiler cannot use registers.\n // Also looks cleaner and easier to verify with spec.\n // Initial state (first 32 bits of the fractional parts of the square roots of the first 8 primes 2..19):\n // h -- high 32 bits, l -- low 32 bits\n this.Ah = 0x6a09e667 | 0;\n this.Al = 0xf3bcc908 | 0;\n this.Bh = 0xbb67ae85 | 0;\n this.Bl = 0x84caa73b | 0;\n this.Ch = 0x3c6ef372 | 0;\n this.Cl = 0xfe94f82b | 0;\n this.Dh = 0xa54ff53a | 0;\n this.Dl = 0x5f1d36f1 | 0;\n this.Eh = 0x510e527f | 0;\n this.El = 0xade682d1 | 0;\n this.Fh = 0x9b05688c | 0;\n this.Fl = 0x2b3e6c1f | 0;\n this.Gh = 0x1f83d9ab | 0;\n this.Gl = 0xfb41bd6b | 0;\n this.Hh = 0x5be0cd19 | 0;\n this.Hl = 0x137e2179 | 0;\n }\n // prettier-ignore\n get() {\n const { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n return [Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl];\n }\n // prettier-ignore\n set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl) {\n this.Ah = Ah | 0;\n this.Al = Al | 0;\n this.Bh = Bh | 0;\n this.Bl = Bl | 0;\n this.Ch = Ch | 0;\n this.Cl = Cl | 0;\n this.Dh = Dh | 0;\n this.Dl = Dl | 0;\n this.Eh = Eh | 0;\n this.El = El | 0;\n this.Fh = Fh | 0;\n this.Fl = Fl | 0;\n this.Gh = Gh | 0;\n this.Gl = Gl | 0;\n this.Hh = Hh | 0;\n this.Hl = Hl | 0;\n }\n process(view, offset) {\n // Extend the first 16 words into the remaining 64 words w[16..79] of the message schedule array\n for (let i = 0; i < 16; i++, offset += 4) {\n SHA512_W_H[i] = view.getUint32(offset);\n SHA512_W_L[i] = view.getUint32((offset += 4));\n }\n for (let i = 16; i < 80; i++) {\n // s0 := (w[i-15] rightrotate 1) xor (w[i-15] rightrotate 8) xor (w[i-15] rightshift 7)\n const W15h = SHA512_W_H[i - 15] | 0;\n const W15l = SHA512_W_L[i - 15] | 0;\n const s0h = u64.rotrSH(W15h, W15l, 1) ^ u64.rotrSH(W15h, W15l, 8) ^ u64.shrSH(W15h, W15l, 7);\n const s0l = u64.rotrSL(W15h, W15l, 1) ^ u64.rotrSL(W15h, W15l, 8) ^ u64.shrSL(W15h, W15l, 7);\n // s1 := (w[i-2] rightrotate 19) xor (w[i-2] rightrotate 61) xor (w[i-2] rightshift 6)\n const W2h = SHA512_W_H[i - 2] | 0;\n const W2l = SHA512_W_L[i - 2] | 0;\n const s1h = u64.rotrSH(W2h, W2l, 19) ^ u64.rotrBH(W2h, W2l, 61) ^ u64.shrSH(W2h, W2l, 6);\n const s1l = u64.rotrSL(W2h, W2l, 19) ^ u64.rotrBL(W2h, W2l, 61) ^ u64.shrSL(W2h, W2l, 6);\n // SHA256_W[i] = s0 + s1 + SHA256_W[i - 7] + SHA256_W[i - 16];\n const SUMl = u64.add4L(s0l, s1l, SHA512_W_L[i - 7], SHA512_W_L[i - 16]);\n const SUMh = u64.add4H(SUMl, s0h, s1h, SHA512_W_H[i - 7], SHA512_W_H[i - 16]);\n SHA512_W_H[i] = SUMh | 0;\n SHA512_W_L[i] = SUMl | 0;\n }\n let { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n // Compression function main loop, 80 rounds\n for (let i = 0; i < 80; i++) {\n // S1 := (e rightrotate 14) xor (e rightrotate 18) xor (e rightrotate 41)\n const sigma1h = u64.rotrSH(Eh, El, 14) ^ u64.rotrSH(Eh, El, 18) ^ u64.rotrBH(Eh, El, 41);\n const sigma1l = u64.rotrSL(Eh, El, 14) ^ u64.rotrSL(Eh, El, 18) ^ u64.rotrBL(Eh, El, 41);\n //const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;\n const CHIh = (Eh & Fh) ^ (~Eh & Gh);\n const CHIl = (El & Fl) ^ (~El & Gl);\n // T1 = H + sigma1 + Chi(E, F, G) + SHA512_K[i] + SHA512_W[i]\n // prettier-ignore\n const T1ll = u64.add5L(Hl, sigma1l, CHIl, SHA512_Kl[i], SHA512_W_L[i]);\n const T1h = u64.add5H(T1ll, Hh, sigma1h, CHIh, SHA512_Kh[i], SHA512_W_H[i]);\n const T1l = T1ll | 0;\n // S0 := (a rightrotate 28) xor (a rightrotate 34) xor (a rightrotate 39)\n const sigma0h = u64.rotrSH(Ah, Al, 28) ^ u64.rotrBH(Ah, Al, 34) ^ u64.rotrBH(Ah, Al, 39);\n const sigma0l = u64.rotrSL(Ah, Al, 28) ^ u64.rotrBL(Ah, Al, 34) ^ u64.rotrBL(Ah, Al, 39);\n const MAJh = (Ah & Bh) ^ (Ah & Ch) ^ (Bh & Ch);\n const MAJl = (Al & Bl) ^ (Al & Cl) ^ (Bl & Cl);\n Hh = Gh | 0;\n Hl = Gl | 0;\n Gh = Fh | 0;\n Gl = Fl | 0;\n Fh = Eh | 0;\n Fl = El | 0;\n ({ h: Eh, l: El } = u64.add(Dh | 0, Dl | 0, T1h | 0, T1l | 0));\n Dh = Ch | 0;\n Dl = Cl | 0;\n Ch = Bh | 0;\n Cl = Bl | 0;\n Bh = Ah | 0;\n Bl = Al | 0;\n const All = u64.add3L(T1l, sigma0l, MAJl);\n Ah = u64.add3H(All, T1h, sigma0h, MAJh);\n Al = All | 0;\n }\n // Add the compressed chunk to the current hash value\n ({ h: Ah, l: Al } = u64.add(this.Ah | 0, this.Al | 0, Ah | 0, Al | 0));\n ({ h: Bh, l: Bl } = u64.add(this.Bh | 0, this.Bl | 0, Bh | 0, Bl | 0));\n ({ h: Ch, l: Cl } = u64.add(this.Ch | 0, this.Cl | 0, Ch | 0, Cl | 0));\n ({ h: Dh, l: Dl } = u64.add(this.Dh | 0, this.Dl | 0, Dh | 0, Dl | 0));\n ({ h: Eh, l: El } = u64.add(this.Eh | 0, this.El | 0, Eh | 0, El | 0));\n ({ h: Fh, l: Fl } = u64.add(this.Fh | 0, this.Fl | 0, Fh | 0, Fl | 0));\n ({ h: Gh, l: Gl } = u64.add(this.Gh | 0, this.Gl | 0, Gh | 0, Gl | 0));\n ({ h: Hh, l: Hl } = u64.add(this.Hh | 0, this.Hl | 0, Hh | 0, Hl | 0));\n this.set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl);\n }\n roundClean() {\n SHA512_W_H.fill(0);\n SHA512_W_L.fill(0);\n }\n destroy() {\n this.buffer.fill(0);\n this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);\n }\n}\nclass SHA512_224 extends SHA512 {\n constructor() {\n super();\n // h -- high 32 bits, l -- low 32 bits\n this.Ah = 0x8c3d37c8 | 0;\n this.Al = 0x19544da2 | 0;\n this.Bh = 0x73e19966 | 0;\n this.Bl = 0x89dcd4d6 | 0;\n this.Ch = 0x1dfab7ae | 0;\n this.Cl = 0x32ff9c82 | 0;\n this.Dh = 0x679dd514 | 0;\n this.Dl = 0x582f9fcf | 0;\n this.Eh = 0x0f6d2b69 | 0;\n this.El = 0x7bd44da8 | 0;\n this.Fh = 0x77e36f73 | 0;\n this.Fl = 0x04c48942 | 0;\n this.Gh = 0x3f9d85a8 | 0;\n this.Gl = 0x6a1d36c8 | 0;\n this.Hh = 0x1112e6ad | 0;\n this.Hl = 0x91d692a1 | 0;\n this.outputLen = 28;\n }\n}\nclass SHA512_256 extends SHA512 {\n constructor() {\n super();\n // h -- high 32 bits, l -- low 32 bits\n this.Ah = 0x22312194 | 0;\n this.Al = 0xfc2bf72c | 0;\n this.Bh = 0x9f555fa3 | 0;\n this.Bl = 0xc84c64c2 | 0;\n this.Ch = 0x2393b86b | 0;\n this.Cl = 0x6f53b151 | 0;\n this.Dh = 0x96387719 | 0;\n this.Dl = 0x5940eabd | 0;\n this.Eh = 0x96283ee2 | 0;\n this.El = 0xa88effe3 | 0;\n this.Fh = 0xbe5e1e25 | 0;\n this.Fl = 0x53863992 | 0;\n this.Gh = 0x2b0199fc | 0;\n this.Gl = 0x2c85b8aa | 0;\n this.Hh = 0x0eb72ddc | 0;\n this.Hl = 0x81c52ca2 | 0;\n this.outputLen = 32;\n }\n}\nclass SHA384 extends SHA512 {\n constructor() {\n super();\n // h -- high 32 bits, l -- low 32 bits\n this.Ah = 0xcbbb9d5d | 0;\n this.Al = 0xc1059ed8 | 0;\n this.Bh = 0x629a292a | 0;\n this.Bl = 0x367cd507 | 0;\n this.Ch = 0x9159015a | 0;\n this.Cl = 0x3070dd17 | 0;\n this.Dh = 0x152fecd8 | 0;\n this.Dl = 0xf70e5939 | 0;\n this.Eh = 0x67332667 | 0;\n this.El = 0xffc00b31 | 0;\n this.Fh = 0x8eb44a87 | 0;\n this.Fl = 0x68581511 | 0;\n this.Gh = 0xdb0c2e0d | 0;\n this.Gl = 0x64f98fa7 | 0;\n this.Hh = 0x47b5481d | 0;\n this.Hl = 0xbefa4fa4 | 0;\n this.outputLen = 48;\n }\n}\nexport const sha512 = /* @__PURE__ */ wrapConstructor(() => new SHA512());\nexport const sha512_224 = /* @__PURE__ */ wrapConstructor(() => new SHA512_224());\nexport const sha512_256 = /* @__PURE__ */ wrapConstructor(() => new SHA512_256());\nexport const sha384 = /* @__PURE__ */ wrapConstructor(() => new SHA384());\n//# sourceMappingURL=sha512.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// 100 lines of code in the file are duplicated from noble-hashes (utils).\n// This is OK: `abstract` directory does not use noble-hashes.\n// User may opt-in into using different hashing library. This way, noble-hashes\n// won't be included into their bundle.\nconst _0n = /* @__PURE__ */ BigInt(0);\nconst _1n = /* @__PURE__ */ BigInt(1);\nconst _2n = /* @__PURE__ */ BigInt(2);\nexport function isBytes(a) {\n return (a instanceof Uint8Array ||\n (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array'));\n}\nexport function abytes(item) {\n if (!isBytes(item))\n throw new Error('Uint8Array expected');\n}\nexport function abool(title, value) {\n if (typeof value !== 'boolean')\n throw new Error(`${title} must be valid boolean, got \"${value}\".`);\n}\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'));\n/**\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes) {\n abytes(bytes);\n // pre-caching improves the speed 6x\n let hex = '';\n for (let i = 0; i < bytes.length; i++) {\n hex += hexes[bytes[i]];\n }\n return hex;\n}\nexport function numberToHexUnpadded(num) {\n const hex = num.toString(16);\n return hex.length & 1 ? `0${hex}` : hex;\n}\nexport function hexToNumber(hex) {\n if (typeof hex !== 'string')\n throw new Error('hex string expected, got ' + typeof hex);\n // Big Endian\n return BigInt(hex === '' ? '0' : `0x${hex}`);\n}\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, _A: 65, _F: 70, _a: 97, _f: 102 };\nfunction asciiToBase16(char) {\n if (char >= asciis._0 && char <= asciis._9)\n return char - asciis._0;\n if (char >= asciis._A && char <= asciis._F)\n return char - (asciis._A - 10);\n if (char >= asciis._a && char <= asciis._f)\n return char - (asciis._a - 10);\n return;\n}\n/**\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex) {\n if (typeof hex !== 'string')\n throw new Error('hex string expected, got ' + typeof hex);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2)\n throw new Error('padded hex string expected, got unpadded hex of length ' + hl);\n const array = new Uint8Array(al);\n for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n const n1 = asciiToBase16(hex.charCodeAt(hi));\n const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n if (n1 === undefined || n2 === undefined) {\n const char = hex[hi] + hex[hi + 1];\n throw new Error('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n }\n array[ai] = n1 * 16 + n2;\n }\n return array;\n}\n// BE: Big Endian, LE: Little Endian\nexport function bytesToNumberBE(bytes) {\n return hexToNumber(bytesToHex(bytes));\n}\nexport function bytesToNumberLE(bytes) {\n abytes(bytes);\n return hexToNumber(bytesToHex(Uint8Array.from(bytes).reverse()));\n}\nexport function numberToBytesBE(n, len) {\n return hexToBytes(n.toString(16).padStart(len * 2, '0'));\n}\nexport function numberToBytesLE(n, len) {\n return numberToBytesBE(n, len).reverse();\n}\n// Unpadded, rarely used\nexport function numberToVarBytesBE(n) {\n return hexToBytes(numberToHexUnpadded(n));\n}\n/**\n * Takes hex string or Uint8Array, converts to Uint8Array.\n * Validates output length.\n * Will throw error for other types.\n * @param title descriptive title for an error e.g. 'private key'\n * @param hex hex string or Uint8Array\n * @param expectedLength optional, will compare to result array's length\n * @returns\n */\nexport function ensureBytes(title, hex, expectedLength) {\n let res;\n if (typeof hex === 'string') {\n try {\n res = hexToBytes(hex);\n }\n catch (e) {\n throw new Error(`${title} must be valid hex string, got \"${hex}\". Cause: ${e}`);\n }\n }\n else if (isBytes(hex)) {\n // Uint8Array.from() instead of hash.slice() because node.js Buffer\n // is instance of Uint8Array, and its slice() creates **mutable** copy\n res = Uint8Array.from(hex);\n }\n else {\n throw new Error(`${title} must be hex string or Uint8Array`);\n }\n const len = res.length;\n if (typeof expectedLength === 'number' && len !== expectedLength)\n throw new Error(`${title} expected ${expectedLength} bytes, got ${len}`);\n return res;\n}\n/**\n * Copies several Uint8Arrays into one.\n */\nexport function concatBytes(...arrays) {\n let sum = 0;\n for (let i = 0; i < arrays.length; i++) {\n const a = arrays[i];\n abytes(a);\n sum += a.length;\n }\n const res = new Uint8Array(sum);\n for (let i = 0, pad = 0; i < arrays.length; i++) {\n const a = arrays[i];\n res.set(a, pad);\n pad += a.length;\n }\n return res;\n}\n// Compares 2 u8a-s in kinda constant time\nexport function equalBytes(a, b) {\n if (a.length !== b.length)\n return false;\n let diff = 0;\n for (let i = 0; i < a.length; i++)\n diff |= a[i] ^ b[i];\n return diff === 0;\n}\n/**\n * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nexport function utf8ToBytes(str) {\n if (typeof str !== 'string')\n throw new Error(`utf8ToBytes expected string, got ${typeof str}`);\n return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n// Is positive bigint\nconst isPosBig = (n) => typeof n === 'bigint' && _0n <= n;\nexport function inRange(n, min, max) {\n return isPosBig(n) && isPosBig(min) && isPosBig(max) && min <= n && n < max;\n}\n/**\n * Asserts min <= n < max. NOTE: It's < max and not <= max.\n * @example\n * aInRange('x', x, 1n, 256n); // would assume x is in (1n..255n)\n */\nexport function aInRange(title, n, min, max) {\n // Why min <= n < max and not a (min < n < max) OR b (min <= n <= max)?\n // consider P=256n, min=0n, max=P\n // - a for min=0 would require -1: `inRange('x', x, -1n, P)`\n // - b would commonly require subtraction: `inRange('x', x, 0n, P - 1n)`\n // - our way is the cleanest: `inRange('x', x, 0n, P)\n if (!inRange(n, min, max))\n throw new Error(`expected valid ${title}: ${min} <= n < ${max}, got ${typeof n} ${n}`);\n}\n// Bit operations\n/**\n * Calculates amount of bits in a bigint.\n * Same as `n.toString(2).length`\n */\nexport function bitLen(n) {\n let len;\n for (len = 0; n > _0n; n >>= _1n, len += 1)\n ;\n return len;\n}\n/**\n * Gets single bit at position.\n * NOTE: first bit position is 0 (same as arrays)\n * Same as `!!+Array.from(n.toString(2)).reverse()[pos]`\n */\nexport function bitGet(n, pos) {\n return (n >> BigInt(pos)) & _1n;\n}\n/**\n * Sets single bit at position.\n */\nexport function bitSet(n, pos, value) {\n return n | ((value ? _1n : _0n) << BigInt(pos));\n}\n/**\n * Calculate mask for N bits. Not using ** operator with bigints because of old engines.\n * Same as BigInt(`0b${Array(i).fill('1').join('')}`)\n */\nexport const bitMask = (n) => (_2n << BigInt(n - 1)) - _1n;\n// DRBG\nconst u8n = (data) => new Uint8Array(data); // creates Uint8Array\nconst u8fr = (arr) => Uint8Array.from(arr); // another shortcut\n/**\n * Minimal HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n * @returns function that will call DRBG until 2nd arg returns something meaningful\n * @example\n * const drbg = createHmacDRBG(32, 32, hmac);\n * drbg(seed, bytesToKey); // bytesToKey must return Key or undefined\n */\nexport function createHmacDrbg(hashLen, qByteLen, hmacFn) {\n if (typeof hashLen !== 'number' || hashLen < 2)\n throw new Error('hashLen must be a number');\n if (typeof qByteLen !== 'number' || qByteLen < 2)\n throw new Error('qByteLen must be a number');\n if (typeof hmacFn !== 'function')\n throw new Error('hmacFn must be a function');\n // Step B, Step C: set hashLen to 8*ceil(hlen/8)\n let v = u8n(hashLen); // Minimal non-full-spec HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n let k = u8n(hashLen); // Steps B and C of RFC6979 3.2: set hashLen, in our case always same\n let i = 0; // Iterations counter, will throw when over 1000\n const reset = () => {\n v.fill(1);\n k.fill(0);\n i = 0;\n };\n const h = (...b) => hmacFn(k, v, ...b); // hmac(k)(v, ...values)\n const reseed = (seed = u8n()) => {\n // HMAC-DRBG reseed() function. Steps D-G\n k = h(u8fr([0x00]), seed); // k = hmac(k || v || 0x00 || seed)\n v = h(); // v = hmac(k || v)\n if (seed.length === 0)\n return;\n k = h(u8fr([0x01]), seed); // k = hmac(k || v || 0x01 || seed)\n v = h(); // v = hmac(k || v)\n };\n const gen = () => {\n // HMAC-DRBG generate() function\n if (i++ >= 1000)\n throw new Error('drbg: tried 1000 values');\n let len = 0;\n const out = [];\n while (len < qByteLen) {\n v = h();\n const sl = v.slice();\n out.push(sl);\n len += v.length;\n }\n return concatBytes(...out);\n };\n const genUntil = (seed, pred) => {\n reset();\n reseed(seed); // Steps D-G\n let res = undefined; // Step H: grind until k is in [1..n-1]\n while (!(res = pred(gen())))\n reseed();\n reset();\n return res;\n };\n return genUntil;\n}\n// Validating curves and fields\nconst validatorFns = {\n bigint: (val) => typeof val === 'bigint',\n function: (val) => typeof val === 'function',\n boolean: (val) => typeof val === 'boolean',\n string: (val) => typeof val === 'string',\n stringOrUint8Array: (val) => typeof val === 'string' || isBytes(val),\n isSafeInteger: (val) => Number.isSafeInteger(val),\n array: (val) => Array.isArray(val),\n field: (val, object) => object.Fp.isValid(val),\n hash: (val) => typeof val === 'function' && Number.isSafeInteger(val.outputLen),\n};\n// type Record = { [P in K]: T; }\nexport function validateObject(object, validators, optValidators = {}) {\n const checkField = (fieldName, type, isOptional) => {\n const checkVal = validatorFns[type];\n if (typeof checkVal !== 'function')\n throw new Error(`Invalid validator \"${type}\", expected function`);\n const val = object[fieldName];\n if (isOptional && val === undefined)\n return;\n if (!checkVal(val, object)) {\n throw new Error(`Invalid param ${String(fieldName)}=${val} (${typeof val}), expected ${type}`);\n }\n };\n for (const [fieldName, type] of Object.entries(validators))\n checkField(fieldName, type, false);\n for (const [fieldName, type] of Object.entries(optValidators))\n checkField(fieldName, type, true);\n return object;\n}\n// validate type tests\n// const o: { a: number; b: number; c: number } = { a: 1, b: 5, c: 6 };\n// const z0 = validateObject(o, { a: 'isSafeInteger' }, { c: 'bigint' }); // Ok!\n// // Should fail type-check\n// const z1 = validateObject(o, { a: 'tmp' }, { c: 'zz' });\n// const z2 = validateObject(o, { a: 'isSafeInteger' }, { c: 'zz' });\n// const z3 = validateObject(o, { test: 'boolean', z: 'bug' });\n// const z4 = validateObject(o, { a: 'boolean', z: 'bug' });\n/**\n * throws not implemented error\n */\nexport const notImplemented = () => {\n throw new Error('not implemented');\n};\n/**\n * Memoizes (caches) computation result.\n * Uses WeakMap: the value is going auto-cleaned by GC after last reference is removed.\n */\nexport function memoized(fn) {\n const map = new WeakMap();\n return (arg, ...args) => {\n const val = map.get(arg);\n if (val !== undefined)\n return val;\n const computed = fn(arg, ...args);\n map.set(arg, computed);\n return computed;\n };\n}\n//# sourceMappingURL=utils.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Utilities for modular arithmetics and finite fields\nimport { bitMask, bytesToNumberBE, bytesToNumberLE, ensureBytes, numberToBytesBE, numberToBytesLE, validateObject, } from './utils.js';\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = BigInt(2), _3n = BigInt(3);\n// prettier-ignore\nconst _4n = BigInt(4), _5n = BigInt(5), _8n = BigInt(8);\n// prettier-ignore\nconst _9n = BigInt(9), _16n = BigInt(16);\n// Calculates a modulo b\nexport function mod(a, b) {\n const result = a % b;\n return result >= _0n ? result : b + result;\n}\n/**\n * Efficiently raise num to power and do modular division.\n * Unsafe in some contexts: uses ladder, so can expose bigint bits.\n * @example\n * pow(2n, 6n, 11n) // 64n % 11n == 9n\n */\n// TODO: use field version && remove\nexport function pow(num, power, modulo) {\n if (modulo <= _0n || power < _0n)\n throw new Error('Expected power/modulo > 0');\n if (modulo === _1n)\n return _0n;\n let res = _1n;\n while (power > _0n) {\n if (power & _1n)\n res = (res * num) % modulo;\n num = (num * num) % modulo;\n power >>= _1n;\n }\n return res;\n}\n// Does x ^ (2 ^ power) mod p. pow2(30, 4) == 30 ^ (2 ^ 4)\nexport function pow2(x, power, modulo) {\n let res = x;\n while (power-- > _0n) {\n res *= res;\n res %= modulo;\n }\n return res;\n}\n// Inverses number over modulo\nexport function invert(number, modulo) {\n if (number === _0n || modulo <= _0n) {\n throw new Error(`invert: expected positive integers, got n=${number} mod=${modulo}`);\n }\n // Euclidean GCD https://brilliant.org/wiki/extended-euclidean-algorithm/\n // Fermat's little theorem \"CT-like\" version inv(n) = n^(m-2) mod m is 30x slower.\n let a = mod(number, modulo);\n let b = modulo;\n // prettier-ignore\n let x = _0n, y = _1n, u = _1n, v = _0n;\n while (a !== _0n) {\n // JIT applies optimization if those two lines follow each other\n const q = b / a;\n const r = b % a;\n const m = x - u * q;\n const n = y - v * q;\n // prettier-ignore\n b = a, a = r, x = u, y = v, u = m, v = n;\n }\n const gcd = b;\n if (gcd !== _1n)\n throw new Error('invert: does not exist');\n return mod(x, modulo);\n}\n/**\n * Tonelli-Shanks square root search algorithm.\n * 1. https://eprint.iacr.org/2012/685.pdf (page 12)\n * 2. Square Roots from 1; 24, 51, 10 to Dan Shanks\n * Will start an infinite loop if field order P is not prime.\n * @param P field order\n * @returns function that takes field Fp (created from P) and number n\n */\nexport function tonelliShanks(P) {\n // Legendre constant: used to calculate Legendre symbol (a | p),\n // which denotes the value of a^((p-1)/2) (mod p).\n // (a | p) ≡ 1 if a is a square (mod p)\n // (a | p) ≡ -1 if a is not a square (mod p)\n // (a | p) ≡ 0 if a ≡ 0 (mod p)\n const legendreC = (P - _1n) / _2n;\n let Q, S, Z;\n // Step 1: By factoring out powers of 2 from p - 1,\n // find q and s such that p - 1 = q*(2^s) with q odd\n for (Q = P - _1n, S = 0; Q % _2n === _0n; Q /= _2n, S++)\n ;\n // Step 2: Select a non-square z such that (z | p) ≡ -1 and set c ≡ zq\n for (Z = _2n; Z < P && pow(Z, legendreC, P) !== P - _1n; Z++)\n ;\n // Fast-path\n if (S === 1) {\n const p1div4 = (P + _1n) / _4n;\n return function tonelliFast(Fp, n) {\n const root = Fp.pow(n, p1div4);\n if (!Fp.eql(Fp.sqr(root), n))\n throw new Error('Cannot find square root');\n return root;\n };\n }\n // Slow-path\n const Q1div2 = (Q + _1n) / _2n;\n return function tonelliSlow(Fp, n) {\n // Step 0: Check that n is indeed a square: (n | p) should not be ≡ -1\n if (Fp.pow(n, legendreC) === Fp.neg(Fp.ONE))\n throw new Error('Cannot find square root');\n let r = S;\n // TODO: will fail at Fp2/etc\n let g = Fp.pow(Fp.mul(Fp.ONE, Z), Q); // will update both x and b\n let x = Fp.pow(n, Q1div2); // first guess at the square root\n let b = Fp.pow(n, Q); // first guess at the fudge factor\n while (!Fp.eql(b, Fp.ONE)) {\n if (Fp.eql(b, Fp.ZERO))\n return Fp.ZERO; // https://en.wikipedia.org/wiki/Tonelli%E2%80%93Shanks_algorithm (4. If t = 0, return r = 0)\n // Find m such b^(2^m)==1\n let m = 1;\n for (let t2 = Fp.sqr(b); m < r; m++) {\n if (Fp.eql(t2, Fp.ONE))\n break;\n t2 = Fp.sqr(t2); // t2 *= t2\n }\n // NOTE: r-m-1 can be bigger than 32, need to convert to bigint before shift, otherwise there will be overflow\n const ge = Fp.pow(g, _1n << BigInt(r - m - 1)); // ge = 2^(r-m-1)\n g = Fp.sqr(ge); // g = ge * ge\n x = Fp.mul(x, ge); // x *= ge\n b = Fp.mul(b, g); // b *= g\n r = m;\n }\n return x;\n };\n}\nexport function FpSqrt(P) {\n // NOTE: different algorithms can give different roots, it is up to user to decide which one they want.\n // For example there is FpSqrtOdd/FpSqrtEven to choice root based on oddness (used for hash-to-curve).\n // P ≡ 3 (mod 4)\n // √n = n^((P+1)/4)\n if (P % _4n === _3n) {\n // Not all roots possible!\n // const ORDER =\n // 0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaabn;\n // const NUM = 72057594037927816n;\n const p1div4 = (P + _1n) / _4n;\n return function sqrt3mod4(Fp, n) {\n const root = Fp.pow(n, p1div4);\n // Throw if root**2 != n\n if (!Fp.eql(Fp.sqr(root), n))\n throw new Error('Cannot find square root');\n return root;\n };\n }\n // Atkin algorithm for q ≡ 5 (mod 8), https://eprint.iacr.org/2012/685.pdf (page 10)\n if (P % _8n === _5n) {\n const c1 = (P - _5n) / _8n;\n return function sqrt5mod8(Fp, n) {\n const n2 = Fp.mul(n, _2n);\n const v = Fp.pow(n2, c1);\n const nv = Fp.mul(n, v);\n const i = Fp.mul(Fp.mul(nv, _2n), v);\n const root = Fp.mul(nv, Fp.sub(i, Fp.ONE));\n if (!Fp.eql(Fp.sqr(root), n))\n throw new Error('Cannot find square root');\n return root;\n };\n }\n // P ≡ 9 (mod 16)\n if (P % _16n === _9n) {\n // NOTE: tonelli is too slow for bls-Fp2 calculations even on start\n // Means we cannot use sqrt for constants at all!\n //\n // const c1 = Fp.sqrt(Fp.negate(Fp.ONE)); // 1. c1 = sqrt(-1) in F, i.e., (c1^2) == -1 in F\n // const c2 = Fp.sqrt(c1); // 2. c2 = sqrt(c1) in F, i.e., (c2^2) == c1 in F\n // const c3 = Fp.sqrt(Fp.negate(c1)); // 3. c3 = sqrt(-c1) in F, i.e., (c3^2) == -c1 in F\n // const c4 = (P + _7n) / _16n; // 4. c4 = (q + 7) / 16 # Integer arithmetic\n // sqrt = (x) => {\n // let tv1 = Fp.pow(x, c4); // 1. tv1 = x^c4\n // let tv2 = Fp.mul(c1, tv1); // 2. tv2 = c1 * tv1\n // const tv3 = Fp.mul(c2, tv1); // 3. tv3 = c2 * tv1\n // let tv4 = Fp.mul(c3, tv1); // 4. tv4 = c3 * tv1\n // const e1 = Fp.equals(Fp.square(tv2), x); // 5. e1 = (tv2^2) == x\n // const e2 = Fp.equals(Fp.square(tv3), x); // 6. e2 = (tv3^2) == x\n // tv1 = Fp.cmov(tv1, tv2, e1); // 7. tv1 = CMOV(tv1, tv2, e1) # Select tv2 if (tv2^2) == x\n // tv2 = Fp.cmov(tv4, tv3, e2); // 8. tv2 = CMOV(tv4, tv3, e2) # Select tv3 if (tv3^2) == x\n // const e3 = Fp.equals(Fp.square(tv2), x); // 9. e3 = (tv2^2) == x\n // return Fp.cmov(tv1, tv2, e3); // 10. z = CMOV(tv1, tv2, e3) # Select the sqrt from tv1 and tv2\n // }\n }\n // Other cases: Tonelli-Shanks algorithm\n return tonelliShanks(P);\n}\n// Little-endian check for first LE bit (last BE bit);\nexport const isNegativeLE = (num, modulo) => (mod(num, modulo) & _1n) === _1n;\n// prettier-ignore\nconst FIELD_FIELDS = [\n 'create', 'isValid', 'is0', 'neg', 'inv', 'sqrt', 'sqr',\n 'eql', 'add', 'sub', 'mul', 'pow', 'div',\n 'addN', 'subN', 'mulN', 'sqrN'\n];\nexport function validateField(field) {\n const initial = {\n ORDER: 'bigint',\n MASK: 'bigint',\n BYTES: 'isSafeInteger',\n BITS: 'isSafeInteger',\n };\n const opts = FIELD_FIELDS.reduce((map, val) => {\n map[val] = 'function';\n return map;\n }, initial);\n return validateObject(field, opts);\n}\n// Generic field functions\n/**\n * Same as `pow` but for Fp: non-constant-time.\n * Unsafe in some contexts: uses ladder, so can expose bigint bits.\n */\nexport function FpPow(f, num, power) {\n // Should have same speed as pow for bigints\n // TODO: benchmark!\n if (power < _0n)\n throw new Error('Expected power > 0');\n if (power === _0n)\n return f.ONE;\n if (power === _1n)\n return num;\n let p = f.ONE;\n let d = num;\n while (power > _0n) {\n if (power & _1n)\n p = f.mul(p, d);\n d = f.sqr(d);\n power >>= _1n;\n }\n return p;\n}\n/**\n * Efficiently invert an array of Field elements.\n * `inv(0)` will return `undefined` here: make sure to throw an error.\n */\nexport function FpInvertBatch(f, nums) {\n const tmp = new Array(nums.length);\n // Walk from first to last, multiply them by each other MOD p\n const lastMultiplied = nums.reduce((acc, num, i) => {\n if (f.is0(num))\n return acc;\n tmp[i] = acc;\n return f.mul(acc, num);\n }, f.ONE);\n // Invert last element\n const inverted = f.inv(lastMultiplied);\n // Walk from last to first, multiply them by inverted each other MOD p\n nums.reduceRight((acc, num, i) => {\n if (f.is0(num))\n return acc;\n tmp[i] = f.mul(acc, tmp[i]);\n return f.mul(acc, num);\n }, inverted);\n return tmp;\n}\nexport function FpDiv(f, lhs, rhs) {\n return f.mul(lhs, typeof rhs === 'bigint' ? invert(rhs, f.ORDER) : f.inv(rhs));\n}\nexport function FpLegendre(order) {\n // (a | p) ≡ 1 if a is a square (mod p), quadratic residue\n // (a | p) ≡ -1 if a is not a square (mod p), quadratic non residue\n // (a | p) ≡ 0 if a ≡ 0 (mod p)\n const legendreConst = (order - _1n) / _2n; // Integer arithmetic\n return (f, x) => f.pow(x, legendreConst);\n}\n// This function returns True whenever the value x is a square in the field F.\nexport function FpIsSquare(f) {\n const legendre = FpLegendre(f.ORDER);\n return (x) => {\n const p = legendre(f, x);\n return f.eql(p, f.ZERO) || f.eql(p, f.ONE);\n };\n}\n// CURVE.n lengths\nexport function nLength(n, nBitLength) {\n // Bit size, byte size of CURVE.n\n const _nBitLength = nBitLength !== undefined ? nBitLength : n.toString(2).length;\n const nByteLength = Math.ceil(_nBitLength / 8);\n return { nBitLength: _nBitLength, nByteLength };\n}\n/**\n * Initializes a finite field over prime. **Non-primes are not supported.**\n * Do not init in loop: slow. Very fragile: always run a benchmark on a change.\n * Major performance optimizations:\n * * a) denormalized operations like mulN instead of mul\n * * b) same object shape: never add or remove keys\n * * c) Object.freeze\n * NOTE: operations don't check 'isValid' for all elements for performance reasons,\n * it is caller responsibility to check this.\n * This is low-level code, please make sure you know what you doing.\n * @param ORDER prime positive bigint\n * @param bitLen how many bits the field consumes\n * @param isLE (def: false) if encoding / decoding should be in little-endian\n * @param redef optional faster redefinitions of sqrt and other methods\n */\nexport function Field(ORDER, bitLen, isLE = false, redef = {}) {\n if (ORDER <= _0n)\n throw new Error(`Expected Field ORDER > 0, got ${ORDER}`);\n const { nBitLength: BITS, nByteLength: BYTES } = nLength(ORDER, bitLen);\n if (BYTES > 2048)\n throw new Error('Field lengths over 2048 bytes are not supported');\n const sqrtP = FpSqrt(ORDER);\n const f = Object.freeze({\n ORDER,\n BITS,\n BYTES,\n MASK: bitMask(BITS),\n ZERO: _0n,\n ONE: _1n,\n create: (num) => mod(num, ORDER),\n isValid: (num) => {\n if (typeof num !== 'bigint')\n throw new Error(`Invalid field element: expected bigint, got ${typeof num}`);\n return _0n <= num && num < ORDER; // 0 is valid element, but it's not invertible\n },\n is0: (num) => num === _0n,\n isOdd: (num) => (num & _1n) === _1n,\n neg: (num) => mod(-num, ORDER),\n eql: (lhs, rhs) => lhs === rhs,\n sqr: (num) => mod(num * num, ORDER),\n add: (lhs, rhs) => mod(lhs + rhs, ORDER),\n sub: (lhs, rhs) => mod(lhs - rhs, ORDER),\n mul: (lhs, rhs) => mod(lhs * rhs, ORDER),\n pow: (num, power) => FpPow(f, num, power),\n div: (lhs, rhs) => mod(lhs * invert(rhs, ORDER), ORDER),\n // Same as above, but doesn't normalize\n sqrN: (num) => num * num,\n addN: (lhs, rhs) => lhs + rhs,\n subN: (lhs, rhs) => lhs - rhs,\n mulN: (lhs, rhs) => lhs * rhs,\n inv: (num) => invert(num, ORDER),\n sqrt: redef.sqrt || ((n) => sqrtP(f, n)),\n invertBatch: (lst) => FpInvertBatch(f, lst),\n // TODO: do we really need constant cmov?\n // We don't have const-time bigints anyway, so probably will be not very useful\n cmov: (a, b, c) => (c ? b : a),\n toBytes: (num) => (isLE ? numberToBytesLE(num, BYTES) : numberToBytesBE(num, BYTES)),\n fromBytes: (bytes) => {\n if (bytes.length !== BYTES)\n throw new Error(`Fp.fromBytes: expected ${BYTES}, got ${bytes.length}`);\n return isLE ? bytesToNumberLE(bytes) : bytesToNumberBE(bytes);\n },\n });\n return Object.freeze(f);\n}\nexport function FpSqrtOdd(Fp, elm) {\n if (!Fp.isOdd)\n throw new Error(`Field doesn't have isOdd`);\n const root = Fp.sqrt(elm);\n return Fp.isOdd(root) ? root : Fp.neg(root);\n}\nexport function FpSqrtEven(Fp, elm) {\n if (!Fp.isOdd)\n throw new Error(`Field doesn't have isOdd`);\n const root = Fp.sqrt(elm);\n return Fp.isOdd(root) ? Fp.neg(root) : root;\n}\n/**\n * \"Constant-time\" private key generation utility.\n * Same as mapKeyToField, but accepts less bytes (40 instead of 48 for 32-byte field).\n * Which makes it slightly more biased, less secure.\n * @deprecated use mapKeyToField instead\n */\nexport function hashToPrivateScalar(hash, groupOrder, isLE = false) {\n hash = ensureBytes('privateHash', hash);\n const hashLen = hash.length;\n const minLen = nLength(groupOrder).nByteLength + 8;\n if (minLen < 24 || hashLen < minLen || hashLen > 1024)\n throw new Error(`hashToPrivateScalar: expected ${minLen}-1024 bytes of input, got ${hashLen}`);\n const num = isLE ? bytesToNumberLE(hash) : bytesToNumberBE(hash);\n return mod(num, groupOrder - _1n) + _1n;\n}\n/**\n * Returns total number of bytes consumed by the field element.\n * For example, 32 bytes for usual 256-bit weierstrass curve.\n * @param fieldOrder number of field elements, usually CURVE.n\n * @returns byte length of field\n */\nexport function getFieldBytesLength(fieldOrder) {\n if (typeof fieldOrder !== 'bigint')\n throw new Error('field order must be bigint');\n const bitLength = fieldOrder.toString(2).length;\n return Math.ceil(bitLength / 8);\n}\n/**\n * Returns minimal amount of bytes that can be safely reduced\n * by field order.\n * Should be 2^-128 for 128-bit curve such as P256.\n * @param fieldOrder number of field elements, usually CURVE.n\n * @returns byte length of target hash\n */\nexport function getMinHashLength(fieldOrder) {\n const length = getFieldBytesLength(fieldOrder);\n return length + Math.ceil(length / 2);\n}\n/**\n * \"Constant-time\" private key generation utility.\n * Can take (n + n/2) or more bytes of uniform input e.g. from CSPRNG or KDF\n * and convert them into private scalar, with the modulo bias being negligible.\n * Needs at least 48 bytes of input for 32-byte private key.\n * https://research.kudelskisecurity.com/2020/07/28/the-definitive-guide-to-modulo-bias-and-how-to-avoid-it/\n * FIPS 186-5, A.2 https://csrc.nist.gov/publications/detail/fips/186/5/final\n * RFC 9380, https://www.rfc-editor.org/rfc/rfc9380#section-5\n * @param hash hash output from SHA3 or a similar function\n * @param groupOrder size of subgroup - (e.g. secp256k1.CURVE.n)\n * @param isLE interpret hash bytes as LE num\n * @returns valid private scalar\n */\nexport function mapHashToField(key, fieldOrder, isLE = false) {\n const len = key.length;\n const fieldLen = getFieldBytesLength(fieldOrder);\n const minLen = getMinHashLength(fieldOrder);\n // No small numbers: need to understand bias story. No huge numbers: easier to detect JS timings.\n if (len < 16 || len < minLen || len > 1024)\n throw new Error(`expected ${minLen}-1024 bytes of input, got ${len}`);\n const num = isLE ? bytesToNumberBE(key) : bytesToNumberLE(key);\n // `mod(x, 11)` can sometimes produce 0. `mod(x, 10) + 1` is the same, but no 0\n const reduced = mod(num, fieldOrder - _1n) + _1n;\n return isLE ? numberToBytesLE(reduced, fieldLen) : numberToBytesBE(reduced, fieldLen);\n}\n//# sourceMappingURL=modular.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Abelian group utilities\nimport { validateField, nLength } from './modular.js';\nimport { validateObject } from './utils.js';\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\n// Since points in different groups cannot be equal (different object constructor),\n// we can have single place to store precomputes\nconst pointPrecomputes = new WeakMap();\nconst pointWindowSizes = new WeakMap(); // This allows use make points immutable (nothing changes inside)\n// Elliptic curve multiplication of Point by scalar. Fragile.\n// Scalars should always be less than curve order: this should be checked inside of a curve itself.\n// Creates precomputation tables for fast multiplication:\n// - private scalar is split by fixed size windows of W bits\n// - every window point is collected from window's table & added to accumulator\n// - since windows are different, same point inside tables won't be accessed more than once per calc\n// - each multiplication is 'Math.ceil(CURVE_ORDER / 𝑊) + 1' point additions (fixed for any scalar)\n// - +1 window is neccessary for wNAF\n// - wNAF reduces table size: 2x less memory + 2x faster generation, but 10% slower multiplication\n// TODO: Research returning 2d JS array of windows, instead of a single window. This would allow\n// windows to be in different memory locations\nexport function wNAF(c, bits) {\n const constTimeNegate = (condition, item) => {\n const neg = item.negate();\n return condition ? neg : item;\n };\n const validateW = (W) => {\n if (!Number.isSafeInteger(W) || W <= 0 || W > bits)\n throw new Error(`Wrong window size=${W}, should be [1..${bits}]`);\n };\n const opts = (W) => {\n validateW(W);\n const windows = Math.ceil(bits / W) + 1; // +1, because\n const windowSize = 2 ** (W - 1); // -1 because we skip zero\n return { windows, windowSize };\n };\n return {\n constTimeNegate,\n // non-const time multiplication ladder\n unsafeLadder(elm, n) {\n let p = c.ZERO;\n let d = elm;\n while (n > _0n) {\n if (n & _1n)\n p = p.add(d);\n d = d.double();\n n >>= _1n;\n }\n return p;\n },\n /**\n * Creates a wNAF precomputation window. Used for caching.\n * Default window size is set by `utils.precompute()` and is equal to 8.\n * Number of precomputed points depends on the curve size:\n * 2^(𝑊−1) * (Math.ceil(𝑛 / 𝑊) + 1), where:\n * - 𝑊 is the window size\n * - 𝑛 is the bitlength of the curve order.\n * For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.\n * @returns precomputed point tables flattened to a single array\n */\n precomputeWindow(elm, W) {\n const { windows, windowSize } = opts(W);\n const points = [];\n let p = elm;\n let base = p;\n for (let window = 0; window < windows; window++) {\n base = p;\n points.push(base);\n // =1, because we skip zero\n for (let i = 1; i < windowSize; i++) {\n base = base.add(p);\n points.push(base);\n }\n p = base.double();\n }\n return points;\n },\n /**\n * Implements ec multiplication using precomputed tables and w-ary non-adjacent form.\n * @param W window size\n * @param precomputes precomputed tables\n * @param n scalar (we don't check here, but should be less than curve order)\n * @returns real and fake (for const-time) points\n */\n wNAF(W, precomputes, n) {\n // TODO: maybe check that scalar is less than group order? wNAF behavious is undefined otherwise\n // But need to carefully remove other checks before wNAF. ORDER == bits here\n const { windows, windowSize } = opts(W);\n let p = c.ZERO;\n let f = c.BASE;\n const mask = BigInt(2 ** W - 1); // Create mask with W ones: 0b1111 for W=4 etc.\n const maxNumber = 2 ** W;\n const shiftBy = BigInt(W);\n for (let window = 0; window < windows; window++) {\n const offset = window * windowSize;\n // Extract W bits.\n let wbits = Number(n & mask);\n // Shift number by W bits.\n n >>= shiftBy;\n // If the bits are bigger than max size, we'll split those.\n // +224 => 256 - 32\n if (wbits > windowSize) {\n wbits -= maxNumber;\n n += _1n;\n }\n // This code was first written with assumption that 'f' and 'p' will never be infinity point:\n // since each addition is multiplied by 2 ** W, it cannot cancel each other. However,\n // there is negate now: it is possible that negated element from low value\n // would be the same as high element, which will create carry into next window.\n // It's not obvious how this can fail, but still worth investigating later.\n // Check if we're onto Zero point.\n // Add random point inside current window to f.\n const offset1 = offset;\n const offset2 = offset + Math.abs(wbits) - 1; // -1 because we skip zero\n const cond1 = window % 2 !== 0;\n const cond2 = wbits < 0;\n if (wbits === 0) {\n // The most important part for const-time getPublicKey\n f = f.add(constTimeNegate(cond1, precomputes[offset1]));\n }\n else {\n p = p.add(constTimeNegate(cond2, precomputes[offset2]));\n }\n }\n // JIT-compiler should not eliminate f here, since it will later be used in normalizeZ()\n // Even if the variable is still unused, there are some checks which will\n // throw an exception, so compiler needs to prove they won't happen, which is hard.\n // At this point there is a way to F be infinity-point even if p is not,\n // which makes it less const-time: around 1 bigint multiply.\n return { p, f };\n },\n wNAFCached(P, n, transform) {\n const W = pointWindowSizes.get(P) || 1;\n // Calculate precomputes on a first run, reuse them after\n let comp = pointPrecomputes.get(P);\n if (!comp) {\n comp = this.precomputeWindow(P, W);\n if (W !== 1)\n pointPrecomputes.set(P, transform(comp));\n }\n return this.wNAF(W, comp, n);\n },\n // We calculate precomputes for elliptic curve point multiplication\n // using windowed method. This specifies window size and\n // stores precomputed values. Usually only base point would be precomputed.\n setWindowSize(P, W) {\n validateW(W);\n pointWindowSizes.set(P, W);\n pointPrecomputes.delete(P);\n },\n };\n}\nexport function validateBasic(curve) {\n validateField(curve.Fp);\n validateObject(curve, {\n n: 'bigint',\n h: 'bigint',\n Gx: 'field',\n Gy: 'field',\n }, {\n nBitLength: 'isSafeInteger',\n nByteLength: 'isSafeInteger',\n });\n // Set defaults\n return Object.freeze({\n ...nLength(curve.n, curve.nBitLength),\n ...curve,\n ...{ p: curve.Fp.ORDER },\n });\n}\n//# sourceMappingURL=curve.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Twisted Edwards curve. The formula is: ax² + y² = 1 + dx²y²\nimport { validateBasic, wNAF } from './curve.js';\nimport { mod } from './modular.js';\nimport * as ut from './utils.js';\nimport { ensureBytes, memoized, abool } from './utils.js';\n// Be friendly to bad ECMAScript parsers by not using bigint literals\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = BigInt(2), _8n = BigInt(8);\n// verification rule is either zip215 or rfc8032 / nist186-5. Consult fromHex:\nconst VERIFY_DEFAULT = { zip215: true };\nfunction validateOpts(curve) {\n const opts = validateBasic(curve);\n ut.validateObject(curve, {\n hash: 'function',\n a: 'bigint',\n d: 'bigint',\n randomBytes: 'function',\n }, {\n adjustScalarBytes: 'function',\n domain: 'function',\n uvRatio: 'function',\n mapToCurve: 'function',\n });\n // Set defaults\n return Object.freeze({ ...opts });\n}\n/**\n * Creates Twisted Edwards curve with EdDSA signatures.\n * @example\n * import { Field } from '@noble/curves/abstract/modular';\n * // Before that, define BigInt-s: a, d, p, n, Gx, Gy, h\n * const curve = twistedEdwards({ a, d, Fp: Field(p), n, Gx, Gy, h })\n */\nexport function twistedEdwards(curveDef) {\n const CURVE = validateOpts(curveDef);\n const { Fp, n: CURVE_ORDER, prehash: prehash, hash: cHash, randomBytes, nByteLength, h: cofactor, } = CURVE;\n const MASK = _2n << (BigInt(nByteLength * 8) - _1n);\n const modP = Fp.create; // Function overrides\n // sqrt(u/v)\n const uvRatio = CURVE.uvRatio ||\n ((u, v) => {\n try {\n return { isValid: true, value: Fp.sqrt(u * Fp.inv(v)) };\n }\n catch (e) {\n return { isValid: false, value: _0n };\n }\n });\n const adjustScalarBytes = CURVE.adjustScalarBytes || ((bytes) => bytes); // NOOP\n const domain = CURVE.domain ||\n ((data, ctx, phflag) => {\n abool('phflag', phflag);\n if (ctx.length || phflag)\n throw new Error('Contexts/pre-hash are not supported');\n return data;\n }); // NOOP\n // 0 <= n < MASK\n // Coordinates larger than Fp.ORDER are allowed for zip215\n function aCoordinate(title, n) {\n ut.aInRange('coordinate ' + title, n, _0n, MASK);\n }\n function assertPoint(other) {\n if (!(other instanceof Point))\n throw new Error('ExtendedPoint expected');\n }\n // Converts Extended point to default (x, y) coordinates.\n // Can accept precomputed Z^-1 - for example, from invertBatch.\n const toAffineMemo = memoized((p, iz) => {\n const { ex: x, ey: y, ez: z } = p;\n const is0 = p.is0();\n if (iz == null)\n iz = is0 ? _8n : Fp.inv(z); // 8 was chosen arbitrarily\n const ax = modP(x * iz);\n const ay = modP(y * iz);\n const zz = modP(z * iz);\n if (is0)\n return { x: _0n, y: _1n };\n if (zz !== _1n)\n throw new Error('invZ was invalid');\n return { x: ax, y: ay };\n });\n const assertValidMemo = memoized((p) => {\n const { a, d } = CURVE;\n if (p.is0())\n throw new Error('bad point: ZERO'); // TODO: optimize, with vars below?\n // Equation in affine coordinates: ax² + y² = 1 + dx²y²\n // Equation in projective coordinates (X/Z, Y/Z, Z): (aX² + Y²)Z² = Z⁴ + dX²Y²\n const { ex: X, ey: Y, ez: Z, et: T } = p;\n const X2 = modP(X * X); // X²\n const Y2 = modP(Y * Y); // Y²\n const Z2 = modP(Z * Z); // Z²\n const Z4 = modP(Z2 * Z2); // Z⁴\n const aX2 = modP(X2 * a); // aX²\n const left = modP(Z2 * modP(aX2 + Y2)); // (aX² + Y²)Z²\n const right = modP(Z4 + modP(d * modP(X2 * Y2))); // Z⁴ + dX²Y²\n if (left !== right)\n throw new Error('bad point: equation left != right (1)');\n // In Extended coordinates we also have T, which is x*y=T/Z: check X*Y == Z*T\n const XY = modP(X * Y);\n const ZT = modP(Z * T);\n if (XY !== ZT)\n throw new Error('bad point: equation left != right (2)');\n return true;\n });\n // Extended Point works in extended coordinates: (x, y, z, t) ∋ (x=x/z, y=y/z, t=xy).\n // https://en.wikipedia.org/wiki/Twisted_Edwards_curve#Extended_coordinates\n class Point {\n constructor(ex, ey, ez, et) {\n this.ex = ex;\n this.ey = ey;\n this.ez = ez;\n this.et = et;\n aCoordinate('x', ex);\n aCoordinate('y', ey);\n aCoordinate('z', ez);\n aCoordinate('t', et);\n Object.freeze(this);\n }\n get x() {\n return this.toAffine().x;\n }\n get y() {\n return this.toAffine().y;\n }\n static fromAffine(p) {\n if (p instanceof Point)\n throw new Error('extended point not allowed');\n const { x, y } = p || {};\n aCoordinate('x', x);\n aCoordinate('y', y);\n return new Point(x, y, _1n, modP(x * y));\n }\n static normalizeZ(points) {\n const toInv = Fp.invertBatch(points.map((p) => p.ez));\n return points.map((p, i) => p.toAffine(toInv[i])).map(Point.fromAffine);\n }\n // \"Private method\", don't use it directly\n _setWindowSize(windowSize) {\n wnaf.setWindowSize(this, windowSize);\n }\n // Not required for fromHex(), which always creates valid points.\n // Could be useful for fromAffine().\n assertValidity() {\n assertValidMemo(this);\n }\n // Compare one point to another.\n equals(other) {\n assertPoint(other);\n const { ex: X1, ey: Y1, ez: Z1 } = this;\n const { ex: X2, ey: Y2, ez: Z2 } = other;\n const X1Z2 = modP(X1 * Z2);\n const X2Z1 = modP(X2 * Z1);\n const Y1Z2 = modP(Y1 * Z2);\n const Y2Z1 = modP(Y2 * Z1);\n return X1Z2 === X2Z1 && Y1Z2 === Y2Z1;\n }\n is0() {\n return this.equals(Point.ZERO);\n }\n negate() {\n // Flips point sign to a negative one (-x, y in affine coords)\n return new Point(modP(-this.ex), this.ey, this.ez, modP(-this.et));\n }\n // Fast algo for doubling Extended Point.\n // https://hyperelliptic.org/EFD/g1p/auto-twisted-extended.html#doubling-dbl-2008-hwcd\n // Cost: 4M + 4S + 1*a + 6add + 1*2.\n double() {\n const { a } = CURVE;\n const { ex: X1, ey: Y1, ez: Z1 } = this;\n const A = modP(X1 * X1); // A = X12\n const B = modP(Y1 * Y1); // B = Y12\n const C = modP(_2n * modP(Z1 * Z1)); // C = 2*Z12\n const D = modP(a * A); // D = a*A\n const x1y1 = X1 + Y1;\n const E = modP(modP(x1y1 * x1y1) - A - B); // E = (X1+Y1)2-A-B\n const G = D + B; // G = D+B\n const F = G - C; // F = G-C\n const H = D - B; // H = D-B\n const X3 = modP(E * F); // X3 = E*F\n const Y3 = modP(G * H); // Y3 = G*H\n const T3 = modP(E * H); // T3 = E*H\n const Z3 = modP(F * G); // Z3 = F*G\n return new Point(X3, Y3, Z3, T3);\n }\n // Fast algo for adding 2 Extended Points.\n // https://hyperelliptic.org/EFD/g1p/auto-twisted-extended.html#addition-add-2008-hwcd\n // Cost: 9M + 1*a + 1*d + 7add.\n add(other) {\n assertPoint(other);\n const { a, d } = CURVE;\n const { ex: X1, ey: Y1, ez: Z1, et: T1 } = this;\n const { ex: X2, ey: Y2, ez: Z2, et: T2 } = other;\n // Faster algo for adding 2 Extended Points when curve's a=-1.\n // http://hyperelliptic.org/EFD/g1p/auto-twisted-extended-1.html#addition-add-2008-hwcd-4\n // Cost: 8M + 8add + 2*2.\n // Note: It does not check whether the `other` point is valid.\n if (a === BigInt(-1)) {\n const A = modP((Y1 - X1) * (Y2 + X2));\n const B = modP((Y1 + X1) * (Y2 - X2));\n const F = modP(B - A);\n if (F === _0n)\n return this.double(); // Same point. Tests say it doesn't affect timing\n const C = modP(Z1 * _2n * T2);\n const D = modP(T1 * _2n * Z2);\n const E = D + C;\n const G = B + A;\n const H = D - C;\n const X3 = modP(E * F);\n const Y3 = modP(G * H);\n const T3 = modP(E * H);\n const Z3 = modP(F * G);\n return new Point(X3, Y3, Z3, T3);\n }\n const A = modP(X1 * X2); // A = X1*X2\n const B = modP(Y1 * Y2); // B = Y1*Y2\n const C = modP(T1 * d * T2); // C = T1*d*T2\n const D = modP(Z1 * Z2); // D = Z1*Z2\n const E = modP((X1 + Y1) * (X2 + Y2) - A - B); // E = (X1+Y1)*(X2+Y2)-A-B\n const F = D - C; // F = D-C\n const G = D + C; // G = D+C\n const H = modP(B - a * A); // H = B-a*A\n const X3 = modP(E * F); // X3 = E*F\n const Y3 = modP(G * H); // Y3 = G*H\n const T3 = modP(E * H); // T3 = E*H\n const Z3 = modP(F * G); // Z3 = F*G\n return new Point(X3, Y3, Z3, T3);\n }\n subtract(other) {\n return this.add(other.negate());\n }\n wNAF(n) {\n return wnaf.wNAFCached(this, n, Point.normalizeZ);\n }\n // Constant-time multiplication.\n multiply(scalar) {\n const n = scalar;\n ut.aInRange('scalar', n, _1n, CURVE_ORDER); // 1 <= scalar < L\n const { p, f } = this.wNAF(n);\n return Point.normalizeZ([p, f])[0];\n }\n // Non-constant-time multiplication. Uses double-and-add algorithm.\n // It's faster, but should only be used when you don't care about\n // an exposed private key e.g. sig verification.\n // Does NOT allow scalars higher than CURVE.n.\n multiplyUnsafe(scalar) {\n const n = scalar;\n ut.aInRange('scalar', n, _0n, CURVE_ORDER); // 0 <= scalar < L\n if (n === _0n)\n return I;\n if (this.equals(I) || n === _1n)\n return this;\n if (this.equals(G))\n return this.wNAF(n).p;\n return wnaf.unsafeLadder(this, n);\n }\n // Checks if point is of small order.\n // If you add something to small order point, you will have \"dirty\"\n // point with torsion component.\n // Multiplies point by cofactor and checks if the result is 0.\n isSmallOrder() {\n return this.multiplyUnsafe(cofactor).is0();\n }\n // Multiplies point by curve order and checks if the result is 0.\n // Returns `false` is the point is dirty.\n isTorsionFree() {\n return wnaf.unsafeLadder(this, CURVE_ORDER).is0();\n }\n // Converts Extended point to default (x, y) coordinates.\n // Can accept precomputed Z^-1 - for example, from invertBatch.\n toAffine(iz) {\n return toAffineMemo(this, iz);\n }\n clearCofactor() {\n const { h: cofactor } = CURVE;\n if (cofactor === _1n)\n return this;\n return this.multiplyUnsafe(cofactor);\n }\n // Converts hash string or Uint8Array to Point.\n // Uses algo from RFC8032 5.1.3.\n static fromHex(hex, zip215 = false) {\n const { d, a } = CURVE;\n const len = Fp.BYTES;\n hex = ensureBytes('pointHex', hex, len); // copy hex to a new array\n abool('zip215', zip215);\n const normed = hex.slice(); // copy again, we'll manipulate it\n const lastByte = hex[len - 1]; // select last byte\n normed[len - 1] = lastByte & ~0x80; // clear last bit\n const y = ut.bytesToNumberLE(normed);\n // RFC8032 prohibits >= p, but ZIP215 doesn't\n // zip215=true: 0 <= y < MASK (2^256 for ed25519)\n // zip215=false: 0 <= y < P (2^255-19 for ed25519)\n const max = zip215 ? MASK : Fp.ORDER;\n ut.aInRange('pointHex.y', y, _0n, max);\n // Ed25519: x² = (y²-1)/(dy²+1) mod p. Ed448: x² = (y²-1)/(dy²-1) mod p. Generic case:\n // ax²+y²=1+dx²y² => y²-1=dx²y²-ax² => y²-1=x²(dy²-a) => x²=(y²-1)/(dy²-a)\n const y2 = modP(y * y); // denominator is always non-0 mod p.\n const u = modP(y2 - _1n); // u = y² - 1\n const v = modP(d * y2 - a); // v = d y² + 1.\n let { isValid, value: x } = uvRatio(u, v); // √(u/v)\n if (!isValid)\n throw new Error('Point.fromHex: invalid y coordinate');\n const isXOdd = (x & _1n) === _1n; // There are 2 square roots. Use x_0 bit to select proper\n const isLastByteOdd = (lastByte & 0x80) !== 0; // x_0, last bit\n if (!zip215 && x === _0n && isLastByteOdd)\n // if x=0 and x_0 = 1, fail\n throw new Error('Point.fromHex: x=0 and x_0=1');\n if (isLastByteOdd !== isXOdd)\n x = modP(-x); // if x_0 != x mod 2, set x = p-x\n return Point.fromAffine({ x, y });\n }\n static fromPrivateKey(privKey) {\n return getExtendedPublicKey(privKey).point;\n }\n toRawBytes() {\n const { x, y } = this.toAffine();\n const bytes = ut.numberToBytesLE(y, Fp.BYTES); // each y has 2 x values (x, -y)\n bytes[bytes.length - 1] |= x & _1n ? 0x80 : 0; // when compressing, it's enough to store y\n return bytes; // and use the last byte to encode sign of x\n }\n toHex() {\n return ut.bytesToHex(this.toRawBytes()); // Same as toRawBytes, but returns string.\n }\n }\n Point.BASE = new Point(CURVE.Gx, CURVE.Gy, _1n, modP(CURVE.Gx * CURVE.Gy));\n Point.ZERO = new Point(_0n, _1n, _1n, _0n); // 0, 1, 1, 0\n const { BASE: G, ZERO: I } = Point;\n const wnaf = wNAF(Point, nByteLength * 8);\n function modN(a) {\n return mod(a, CURVE_ORDER);\n }\n // Little-endian SHA512 with modulo n\n function modN_LE(hash) {\n return modN(ut.bytesToNumberLE(hash));\n }\n /** Convenience method that creates public key and other stuff. RFC8032 5.1.5 */\n function getExtendedPublicKey(key) {\n const len = nByteLength;\n key = ensureBytes('private key', key, len);\n // Hash private key with curve's hash function to produce uniformingly random input\n // Check byte lengths: ensure(64, h(ensure(32, key)))\n const hashed = ensureBytes('hashed private key', cHash(key), 2 * len);\n const head = adjustScalarBytes(hashed.slice(0, len)); // clear first half bits, produce FE\n const prefix = hashed.slice(len, 2 * len); // second half is called key prefix (5.1.6)\n const scalar = modN_LE(head); // The actual private scalar\n const point = G.multiply(scalar); // Point on Edwards curve aka public key\n const pointBytes = point.toRawBytes(); // Uint8Array representation\n return { head, prefix, scalar, point, pointBytes };\n }\n // Calculates EdDSA pub key. RFC8032 5.1.5. Privkey is hashed. Use first half with 3 bits cleared\n function getPublicKey(privKey) {\n return getExtendedPublicKey(privKey).pointBytes;\n }\n // int('LE', SHA512(dom2(F, C) || msgs)) mod N\n function hashDomainToScalar(context = new Uint8Array(), ...msgs) {\n const msg = ut.concatBytes(...msgs);\n return modN_LE(cHash(domain(msg, ensureBytes('context', context), !!prehash)));\n }\n /** Signs message with privateKey. RFC8032 5.1.6 */\n function sign(msg, privKey, options = {}) {\n msg = ensureBytes('message', msg);\n if (prehash)\n msg = prehash(msg); // for ed25519ph etc.\n const { prefix, scalar, pointBytes } = getExtendedPublicKey(privKey);\n const r = hashDomainToScalar(options.context, prefix, msg); // r = dom2(F, C) || prefix || PH(M)\n const R = G.multiply(r).toRawBytes(); // R = rG\n const k = hashDomainToScalar(options.context, R, pointBytes, msg); // R || A || PH(M)\n const s = modN(r + k * scalar); // S = (r + k * s) mod L\n ut.aInRange('signature.s', s, _0n, CURVE_ORDER); // 0 <= s < l\n const res = ut.concatBytes(R, ut.numberToBytesLE(s, Fp.BYTES));\n return ensureBytes('result', res, nByteLength * 2); // 64-byte signature\n }\n const verifyOpts = VERIFY_DEFAULT;\n function verify(sig, msg, publicKey, options = verifyOpts) {\n const { context, zip215 } = options;\n const len = Fp.BYTES; // Verifies EdDSA signature against message and public key. RFC8032 5.1.7.\n sig = ensureBytes('signature', sig, 2 * len); // An extended group equation is checked.\n msg = ensureBytes('message', msg);\n if (zip215 !== undefined)\n abool('zip215', zip215);\n if (prehash)\n msg = prehash(msg); // for ed25519ph, etc\n const s = ut.bytesToNumberLE(sig.slice(len, 2 * len));\n // zip215: true is good for consensus-critical apps and allows points < 2^256\n // zip215: false follows RFC8032 / NIST186-5 and restricts points to CURVE.p\n let A, R, SB;\n try {\n A = Point.fromHex(publicKey, zip215);\n R = Point.fromHex(sig.slice(0, len), zip215);\n SB = G.multiplyUnsafe(s); // 0 <= s < l is done inside\n }\n catch (error) {\n return false;\n }\n if (!zip215 && A.isSmallOrder())\n return false;\n const k = hashDomainToScalar(context, R.toRawBytes(), A.toRawBytes(), msg);\n const RkA = R.add(A.multiplyUnsafe(k));\n // [8][S]B = [8]R + [8][k]A'\n return RkA.subtract(SB).clearCofactor().equals(Point.ZERO);\n }\n G._setWindowSize(8); // Enable precomputes. Slows down first publicKey computation by 20ms.\n const utils = {\n getExtendedPublicKey,\n // ed25519 private keys are uniform 32b. No need to check for modulo bias, like in secp256k1.\n randomPrivateKey: () => randomBytes(Fp.BYTES),\n /**\n * We're doing scalar multiplication (used in getPublicKey etc) with precomputed BASE_POINT\n * values. This slows down first getPublicKey() by milliseconds (see Speed section),\n * but allows to speed-up subsequent getPublicKey() calls up to 20x.\n * @param windowSize 2, 4, 8, 16\n */\n precompute(windowSize = 8, point = Point.BASE) {\n point._setWindowSize(windowSize);\n point.multiply(BigInt(3));\n return point;\n },\n };\n return {\n CURVE,\n getPublicKey,\n sign,\n verify,\n ExtendedPoint: Point,\n utils,\n };\n}\n//# sourceMappingURL=edwards.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { mod, pow } from './modular.js';\nimport { aInRange, bytesToNumberLE, ensureBytes, numberToBytesLE, validateObject, } from './utils.js';\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\nfunction validateOpts(curve) {\n validateObject(curve, {\n a: 'bigint',\n }, {\n montgomeryBits: 'isSafeInteger',\n nByteLength: 'isSafeInteger',\n adjustScalarBytes: 'function',\n domain: 'function',\n powPminus2: 'function',\n Gu: 'bigint',\n });\n // Set defaults\n return Object.freeze({ ...curve });\n}\n// NOTE: not really montgomery curve, just bunch of very specific methods for X25519/X448 (RFC 7748, https://www.rfc-editor.org/rfc/rfc7748)\n// Uses only one coordinate instead of two\nexport function montgomery(curveDef) {\n const CURVE = validateOpts(curveDef);\n const { P } = CURVE;\n const modP = (n) => mod(n, P);\n const montgomeryBits = CURVE.montgomeryBits;\n const montgomeryBytes = Math.ceil(montgomeryBits / 8);\n const fieldLen = CURVE.nByteLength;\n const adjustScalarBytes = CURVE.adjustScalarBytes || ((bytes) => bytes);\n const powPminus2 = CURVE.powPminus2 || ((x) => pow(x, P - BigInt(2), P));\n // cswap from RFC7748. But it is not from RFC7748!\n /*\n cswap(swap, x_2, x_3):\n dummy = mask(swap) AND (x_2 XOR x_3)\n x_2 = x_2 XOR dummy\n x_3 = x_3 XOR dummy\n Return (x_2, x_3)\n Where mask(swap) is the all-1 or all-0 word of the same length as x_2\n and x_3, computed, e.g., as mask(swap) = 0 - swap.\n */\n function cswap(swap, x_2, x_3) {\n const dummy = modP(swap * (x_2 - x_3));\n x_2 = modP(x_2 - dummy);\n x_3 = modP(x_3 + dummy);\n return [x_2, x_3];\n }\n // x25519 from 4\n // The constant a24 is (486662 - 2) / 4 = 121665 for curve25519/X25519\n const a24 = (CURVE.a - BigInt(2)) / BigInt(4);\n /**\n *\n * @param pointU u coordinate (x) on Montgomery Curve 25519\n * @param scalar by which the point would be multiplied\n * @returns new Point on Montgomery curve\n */\n function montgomeryLadder(u, scalar) {\n aInRange('u', u, _0n, P);\n aInRange('scalar', scalar, _0n, P);\n // Section 5: Implementations MUST accept non-canonical values and process them as\n // if they had been reduced modulo the field prime.\n const k = scalar;\n const x_1 = u;\n let x_2 = _1n;\n let z_2 = _0n;\n let x_3 = u;\n let z_3 = _1n;\n let swap = _0n;\n let sw;\n for (let t = BigInt(montgomeryBits - 1); t >= _0n; t--) {\n const k_t = (k >> t) & _1n;\n swap ^= k_t;\n sw = cswap(swap, x_2, x_3);\n x_2 = sw[0];\n x_3 = sw[1];\n sw = cswap(swap, z_2, z_3);\n z_2 = sw[0];\n z_3 = sw[1];\n swap = k_t;\n const A = x_2 + z_2;\n const AA = modP(A * A);\n const B = x_2 - z_2;\n const BB = modP(B * B);\n const E = AA - BB;\n const C = x_3 + z_3;\n const D = x_3 - z_3;\n const DA = modP(D * A);\n const CB = modP(C * B);\n const dacb = DA + CB;\n const da_cb = DA - CB;\n x_3 = modP(dacb * dacb);\n z_3 = modP(x_1 * modP(da_cb * da_cb));\n x_2 = modP(AA * BB);\n z_2 = modP(E * (AA + modP(a24 * E)));\n }\n // (x_2, x_3) = cswap(swap, x_2, x_3)\n sw = cswap(swap, x_2, x_3);\n x_2 = sw[0];\n x_3 = sw[1];\n // (z_2, z_3) = cswap(swap, z_2, z_3)\n sw = cswap(swap, z_2, z_3);\n z_2 = sw[0];\n z_3 = sw[1];\n // z_2^(p - 2)\n const z2 = powPminus2(z_2);\n // Return x_2 * (z_2^(p - 2))\n return modP(x_2 * z2);\n }\n function encodeUCoordinate(u) {\n return numberToBytesLE(modP(u), montgomeryBytes);\n }\n function decodeUCoordinate(uEnc) {\n // Section 5: When receiving such an array, implementations of X25519\n // MUST mask the most significant bit in the final byte.\n const u = ensureBytes('u coordinate', uEnc, montgomeryBytes);\n if (fieldLen === 32)\n u[31] &= 127; // 0b0111_1111\n return bytesToNumberLE(u);\n }\n function decodeScalar(n) {\n const bytes = ensureBytes('scalar', n);\n const len = bytes.length;\n if (len !== montgomeryBytes && len !== fieldLen)\n throw new Error(`Expected ${montgomeryBytes} or ${fieldLen} bytes, got ${len}`);\n return bytesToNumberLE(adjustScalarBytes(bytes));\n }\n function scalarMult(scalar, u) {\n const pointU = decodeUCoordinate(u);\n const _scalar = decodeScalar(scalar);\n const pu = montgomeryLadder(pointU, _scalar);\n // The result was not contributory\n // https://cr.yp.to/ecdh.html#validate\n if (pu === _0n)\n throw new Error('Invalid private or public key received');\n return encodeUCoordinate(pu);\n }\n // Computes public key from private. By doing scalar multiplication of base point.\n const GuBytes = encodeUCoordinate(CURVE.Gu);\n function scalarMultBase(scalar) {\n return scalarMult(scalar, GuBytes);\n }\n return {\n scalarMult,\n scalarMultBase,\n getSharedSecret: (privateKey, publicKey) => scalarMult(privateKey, publicKey),\n getPublicKey: (privateKey) => scalarMultBase(privateKey),\n utils: { randomPrivateKey: () => CURVE.randomBytes(CURVE.nByteLength) },\n GuBytes: GuBytes,\n };\n}\n//# sourceMappingURL=montgomery.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { sha512 } from '@noble/hashes/sha512';\nimport { concatBytes, randomBytes, utf8ToBytes } from '@noble/hashes/utils';\nimport { twistedEdwards } from './abstract/edwards.js';\nimport { createHasher, expand_message_xmd } from './abstract/hash-to-curve.js';\nimport { Field, FpSqrtEven, isNegativeLE, mod, pow2 } from './abstract/modular.js';\nimport { montgomery } from './abstract/montgomery.js';\nimport { bytesToHex, bytesToNumberLE, ensureBytes, equalBytes, numberToBytesLE, } from './abstract/utils.js';\n/**\n * ed25519 Twisted Edwards curve with following addons:\n * - X25519 ECDH\n * - Ristretto cofactor elimination\n * - Elligator hash-to-group / point indistinguishability\n */\nconst ED25519_P = BigInt('57896044618658097711785492504343953926634992332820282019728792003956564819949');\n// √(-1) aka √(a) aka 2^((p-1)/4)\nconst ED25519_SQRT_M1 = /* @__PURE__ */ BigInt('19681161376707505956807079304988542015446066515923890162744021073123829784752');\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = BigInt(2), _3n = BigInt(3);\n// prettier-ignore\nconst _5n = BigInt(5), _8n = BigInt(8);\nfunction ed25519_pow_2_252_3(x) {\n // prettier-ignore\n const _10n = BigInt(10), _20n = BigInt(20), _40n = BigInt(40), _80n = BigInt(80);\n const P = ED25519_P;\n const x2 = (x * x) % P;\n const b2 = (x2 * x) % P; // x^3, 11\n const b4 = (pow2(b2, _2n, P) * b2) % P; // x^15, 1111\n const b5 = (pow2(b4, _1n, P) * x) % P; // x^31\n const b10 = (pow2(b5, _5n, P) * b5) % P;\n const b20 = (pow2(b10, _10n, P) * b10) % P;\n const b40 = (pow2(b20, _20n, P) * b20) % P;\n const b80 = (pow2(b40, _40n, P) * b40) % P;\n const b160 = (pow2(b80, _80n, P) * b80) % P;\n const b240 = (pow2(b160, _80n, P) * b80) % P;\n const b250 = (pow2(b240, _10n, P) * b10) % P;\n const pow_p_5_8 = (pow2(b250, _2n, P) * x) % P;\n // ^ To pow to (p+3)/8, multiply it by x.\n return { pow_p_5_8, b2 };\n}\nfunction adjustScalarBytes(bytes) {\n // Section 5: For X25519, in order to decode 32 random bytes as an integer scalar,\n // set the three least significant bits of the first byte\n bytes[0] &= 248; // 0b1111_1000\n // and the most significant bit of the last to zero,\n bytes[31] &= 127; // 0b0111_1111\n // set the second most significant bit of the last byte to 1\n bytes[31] |= 64; // 0b0100_0000\n return bytes;\n}\n// sqrt(u/v)\nfunction uvRatio(u, v) {\n const P = ED25519_P;\n const v3 = mod(v * v * v, P); // v³\n const v7 = mod(v3 * v3 * v, P); // v⁷\n // (p+3)/8 and (p-5)/8\n const pow = ed25519_pow_2_252_3(u * v7).pow_p_5_8;\n let x = mod(u * v3 * pow, P); // (uv³)(uv⁷)^(p-5)/8\n const vx2 = mod(v * x * x, P); // vx²\n const root1 = x; // First root candidate\n const root2 = mod(x * ED25519_SQRT_M1, P); // Second root candidate\n const useRoot1 = vx2 === u; // If vx² = u (mod p), x is a square root\n const useRoot2 = vx2 === mod(-u, P); // If vx² = -u, set x <-- x * 2^((p-1)/4)\n const noRoot = vx2 === mod(-u * ED25519_SQRT_M1, P); // There is no valid root, vx² = -u√(-1)\n if (useRoot1)\n x = root1;\n if (useRoot2 || noRoot)\n x = root2; // We return root2 anyway, for const-time\n if (isNegativeLE(x, P))\n x = mod(-x, P);\n return { isValid: useRoot1 || useRoot2, value: x };\n}\n// Just in case\nexport const ED25519_TORSION_SUBGROUP = [\n '0100000000000000000000000000000000000000000000000000000000000000',\n 'c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a',\n '0000000000000000000000000000000000000000000000000000000000000080',\n '26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc05',\n 'ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f',\n '26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc85',\n '0000000000000000000000000000000000000000000000000000000000000000',\n 'c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa',\n];\nconst Fp = /* @__PURE__ */ (() => Field(ED25519_P, undefined, true))();\nconst ed25519Defaults = /* @__PURE__ */ (() => ({\n // Param: a\n a: BigInt(-1), // Fp.create(-1) is proper; our way still works and is faster\n // d is equal to -121665/121666 over finite field.\n // Negative number is P - number, and division is invert(number, P)\n d: BigInt('37095705934669439343138083508754565189542113879843219016388785533085940283555'),\n // Finite field 𝔽p over which we'll do calculations; 2n**255n - 19n\n Fp,\n // Subgroup order: how many points curve has\n // 2n**252n + 27742317777372353535851937790883648493n;\n n: BigInt('7237005577332262213973186563042994240857116359379907606001950938285454250989'),\n // Cofactor\n h: _8n,\n // Base point (x, y) aka generator point\n Gx: BigInt('15112221349535400772501151409588531511454012693041857206046113283949847762202'),\n Gy: BigInt('46316835694926478169428394003475163141307993866256225615783033603165251855960'),\n hash: sha512,\n randomBytes,\n adjustScalarBytes,\n // dom2\n // Ratio of u to v. Allows us to combine inversion and square root. Uses algo from RFC8032 5.1.3.\n // Constant-time, u/√v\n uvRatio,\n}))();\n/**\n * ed25519 curve with EdDSA signatures.\n */\nexport const ed25519 = /* @__PURE__ */ (() => twistedEdwards(ed25519Defaults))();\nfunction ed25519_domain(data, ctx, phflag) {\n if (ctx.length > 255)\n throw new Error('Context is too big');\n return concatBytes(utf8ToBytes('SigEd25519 no Ed25519 collisions'), new Uint8Array([phflag ? 1 : 0, ctx.length]), ctx, data);\n}\nexport const ed25519ctx = /* @__PURE__ */ (() => twistedEdwards({\n ...ed25519Defaults,\n domain: ed25519_domain,\n}))();\nexport const ed25519ph = /* @__PURE__ */ (() => twistedEdwards(Object.assign({}, ed25519Defaults, {\n domain: ed25519_domain,\n prehash: sha512,\n})))();\nexport const x25519 = /* @__PURE__ */ (() => montgomery({\n P: ED25519_P,\n a: BigInt(486662),\n montgomeryBits: 255, // n is 253 bits\n nByteLength: 32,\n Gu: BigInt(9),\n powPminus2: (x) => {\n const P = ED25519_P;\n // x^(p-2) aka x^(2^255-21)\n const { pow_p_5_8, b2 } = ed25519_pow_2_252_3(x);\n return mod(pow2(pow_p_5_8, _3n, P) * b2, P);\n },\n adjustScalarBytes,\n randomBytes,\n}))();\n/**\n * Converts ed25519 public key to x25519 public key. Uses formula:\n * * `(u, v) = ((1+y)/(1-y), sqrt(-486664)*u/x)`\n * * `(x, y) = (sqrt(-486664)*u/v, (u-1)/(u+1))`\n * @example\n * const someonesPub = ed25519.getPublicKey(ed25519.utils.randomPrivateKey());\n * const aPriv = x25519.utils.randomPrivateKey();\n * x25519.getSharedSecret(aPriv, edwardsToMontgomeryPub(someonesPub))\n */\nexport function edwardsToMontgomeryPub(edwardsPub) {\n const { y } = ed25519.ExtendedPoint.fromHex(edwardsPub);\n const _1n = BigInt(1);\n return Fp.toBytes(Fp.create((_1n + y) * Fp.inv(_1n - y)));\n}\nexport const edwardsToMontgomery = edwardsToMontgomeryPub; // deprecated\n/**\n * Converts ed25519 secret key to x25519 secret key.\n * @example\n * const someonesPub = x25519.getPublicKey(x25519.utils.randomPrivateKey());\n * const aPriv = ed25519.utils.randomPrivateKey();\n * x25519.getSharedSecret(edwardsToMontgomeryPriv(aPriv), someonesPub)\n */\nexport function edwardsToMontgomeryPriv(edwardsPriv) {\n const hashed = ed25519Defaults.hash(edwardsPriv.subarray(0, 32));\n return ed25519Defaults.adjustScalarBytes(hashed).subarray(0, 32);\n}\n// Hash To Curve Elligator2 Map (NOTE: different from ristretto255 elligator)\n// NOTE: very important part is usage of FpSqrtEven for ELL2_C1_EDWARDS, since\n// SageMath returns different root first and everything falls apart\nconst ELL2_C1 = /* @__PURE__ */ (() => (Fp.ORDER + _3n) / _8n)(); // 1. c1 = (q + 3) / 8 # Integer arithmetic\nconst ELL2_C2 = /* @__PURE__ */ (() => Fp.pow(_2n, ELL2_C1))(); // 2. c2 = 2^c1\nconst ELL2_C3 = /* @__PURE__ */ (() => Fp.sqrt(Fp.neg(Fp.ONE)))(); // 3. c3 = sqrt(-1)\n// prettier-ignore\nfunction map_to_curve_elligator2_curve25519(u) {\n const ELL2_C4 = (Fp.ORDER - _5n) / _8n; // 4. c4 = (q - 5) / 8 # Integer arithmetic\n const ELL2_J = BigInt(486662);\n let tv1 = Fp.sqr(u); // 1. tv1 = u^2\n tv1 = Fp.mul(tv1, _2n); // 2. tv1 = 2 * tv1\n let xd = Fp.add(tv1, Fp.ONE); // 3. xd = tv1 + 1 # Nonzero: -1 is square (mod p), tv1 is not\n let x1n = Fp.neg(ELL2_J); // 4. x1n = -J # x1 = x1n / xd = -J / (1 + 2 * u^2)\n let tv2 = Fp.sqr(xd); // 5. tv2 = xd^2\n let gxd = Fp.mul(tv2, xd); // 6. gxd = tv2 * xd # gxd = xd^3\n let gx1 = Fp.mul(tv1, ELL2_J); // 7. gx1 = J * tv1 # x1n + J * xd\n gx1 = Fp.mul(gx1, x1n); // 8. gx1 = gx1 * x1n # x1n^2 + J * x1n * xd\n gx1 = Fp.add(gx1, tv2); // 9. gx1 = gx1 + tv2 # x1n^2 + J * x1n * xd + xd^2\n gx1 = Fp.mul(gx1, x1n); // 10. gx1 = gx1 * x1n # x1n^3 + J * x1n^2 * xd + x1n * xd^2\n let tv3 = Fp.sqr(gxd); // 11. tv3 = gxd^2\n tv2 = Fp.sqr(tv3); // 12. tv2 = tv3^2 # gxd^4\n tv3 = Fp.mul(tv3, gxd); // 13. tv3 = tv3 * gxd # gxd^3\n tv3 = Fp.mul(tv3, gx1); // 14. tv3 = tv3 * gx1 # gx1 * gxd^3\n tv2 = Fp.mul(tv2, tv3); // 15. tv2 = tv2 * tv3 # gx1 * gxd^7\n let y11 = Fp.pow(tv2, ELL2_C4); // 16. y11 = tv2^c4 # (gx1 * gxd^7)^((p - 5) / 8)\n y11 = Fp.mul(y11, tv3); // 17. y11 = y11 * tv3 # gx1*gxd^3*(gx1*gxd^7)^((p-5)/8)\n let y12 = Fp.mul(y11, ELL2_C3); // 18. y12 = y11 * c3\n tv2 = Fp.sqr(y11); // 19. tv2 = y11^2\n tv2 = Fp.mul(tv2, gxd); // 20. tv2 = tv2 * gxd\n let e1 = Fp.eql(tv2, gx1); // 21. e1 = tv2 == gx1\n let y1 = Fp.cmov(y12, y11, e1); // 22. y1 = CMOV(y12, y11, e1) # If g(x1) is square, this is its sqrt\n let x2n = Fp.mul(x1n, tv1); // 23. x2n = x1n * tv1 # x2 = x2n / xd = 2 * u^2 * x1n / xd\n let y21 = Fp.mul(y11, u); // 24. y21 = y11 * u\n y21 = Fp.mul(y21, ELL2_C2); // 25. y21 = y21 * c2\n let y22 = Fp.mul(y21, ELL2_C3); // 26. y22 = y21 * c3\n let gx2 = Fp.mul(gx1, tv1); // 27. gx2 = gx1 * tv1 # g(x2) = gx2 / gxd = 2 * u^2 * g(x1)\n tv2 = Fp.sqr(y21); // 28. tv2 = y21^2\n tv2 = Fp.mul(tv2, gxd); // 29. tv2 = tv2 * gxd\n let e2 = Fp.eql(tv2, gx2); // 30. e2 = tv2 == gx2\n let y2 = Fp.cmov(y22, y21, e2); // 31. y2 = CMOV(y22, y21, e2) # If g(x2) is square, this is its sqrt\n tv2 = Fp.sqr(y1); // 32. tv2 = y1^2\n tv2 = Fp.mul(tv2, gxd); // 33. tv2 = tv2 * gxd\n let e3 = Fp.eql(tv2, gx1); // 34. e3 = tv2 == gx1\n let xn = Fp.cmov(x2n, x1n, e3); // 35. xn = CMOV(x2n, x1n, e3) # If e3, x = x1, else x = x2\n let y = Fp.cmov(y2, y1, e3); // 36. y = CMOV(y2, y1, e3) # If e3, y = y1, else y = y2\n let e4 = Fp.isOdd(y); // 37. e4 = sgn0(y) == 1 # Fix sign of y\n y = Fp.cmov(y, Fp.neg(y), e3 !== e4); // 38. y = CMOV(y, -y, e3 XOR e4)\n return { xMn: xn, xMd: xd, yMn: y, yMd: _1n }; // 39. return (xn, xd, y, 1)\n}\nconst ELL2_C1_EDWARDS = /* @__PURE__ */ (() => FpSqrtEven(Fp, Fp.neg(BigInt(486664))))(); // sgn0(c1) MUST equal 0\nfunction map_to_curve_elligator2_edwards25519(u) {\n const { xMn, xMd, yMn, yMd } = map_to_curve_elligator2_curve25519(u); // 1. (xMn, xMd, yMn, yMd) =\n // map_to_curve_elligator2_curve25519(u)\n let xn = Fp.mul(xMn, yMd); // 2. xn = xMn * yMd\n xn = Fp.mul(xn, ELL2_C1_EDWARDS); // 3. xn = xn * c1\n let xd = Fp.mul(xMd, yMn); // 4. xd = xMd * yMn # xn / xd = c1 * xM / yM\n let yn = Fp.sub(xMn, xMd); // 5. yn = xMn - xMd\n let yd = Fp.add(xMn, xMd); // 6. yd = xMn + xMd # (n / d - 1) / (n / d + 1) = (n - d) / (n + d)\n let tv1 = Fp.mul(xd, yd); // 7. tv1 = xd * yd\n let e = Fp.eql(tv1, Fp.ZERO); // 8. e = tv1 == 0\n xn = Fp.cmov(xn, Fp.ZERO, e); // 9. xn = CMOV(xn, 0, e)\n xd = Fp.cmov(xd, Fp.ONE, e); // 10. xd = CMOV(xd, 1, e)\n yn = Fp.cmov(yn, Fp.ONE, e); // 11. yn = CMOV(yn, 1, e)\n yd = Fp.cmov(yd, Fp.ONE, e); // 12. yd = CMOV(yd, 1, e)\n const inv = Fp.invertBatch([xd, yd]); // batch division\n return { x: Fp.mul(xn, inv[0]), y: Fp.mul(yn, inv[1]) }; // 13. return (xn, xd, yn, yd)\n}\nconst htf = /* @__PURE__ */ (() => createHasher(ed25519.ExtendedPoint, (scalars) => map_to_curve_elligator2_edwards25519(scalars[0]), {\n DST: 'edwards25519_XMD:SHA-512_ELL2_RO_',\n encodeDST: 'edwards25519_XMD:SHA-512_ELL2_NU_',\n p: Fp.ORDER,\n m: 1,\n k: 128,\n expand: 'xmd',\n hash: sha512,\n}))();\nexport const hashToCurve = /* @__PURE__ */ (() => htf.hashToCurve)();\nexport const encodeToCurve = /* @__PURE__ */ (() => htf.encodeToCurve)();\nfunction assertRstPoint(other) {\n if (!(other instanceof RistPoint))\n throw new Error('RistrettoPoint expected');\n}\n// √(-1) aka √(a) aka 2^((p-1)/4)\nconst SQRT_M1 = ED25519_SQRT_M1;\n// √(ad - 1)\nconst SQRT_AD_MINUS_ONE = /* @__PURE__ */ BigInt('25063068953384623474111414158702152701244531502492656460079210482610430750235');\n// 1 / √(a-d)\nconst INVSQRT_A_MINUS_D = /* @__PURE__ */ BigInt('54469307008909316920995813868745141605393597292927456921205312896311721017578');\n// 1-d²\nconst ONE_MINUS_D_SQ = /* @__PURE__ */ BigInt('1159843021668779879193775521855586647937357759715417654439879720876111806838');\n// (d-1)²\nconst D_MINUS_ONE_SQ = /* @__PURE__ */ BigInt('40440834346308536858101042469323190826248399146238708352240133220865137265952');\n// Calculates 1/√(number)\nconst invertSqrt = (number) => uvRatio(_1n, number);\nconst MAX_255B = /* @__PURE__ */ BigInt('0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff');\nconst bytes255ToNumberLE = (bytes) => ed25519.CURVE.Fp.create(bytesToNumberLE(bytes) & MAX_255B);\n// Computes Elligator map for Ristretto\n// https://ristretto.group/formulas/elligator.html\nfunction calcElligatorRistrettoMap(r0) {\n const { d } = ed25519.CURVE;\n const P = ed25519.CURVE.Fp.ORDER;\n const mod = ed25519.CURVE.Fp.create;\n const r = mod(SQRT_M1 * r0 * r0); // 1\n const Ns = mod((r + _1n) * ONE_MINUS_D_SQ); // 2\n let c = BigInt(-1); // 3\n const D = mod((c - d * r) * mod(r + d)); // 4\n let { isValid: Ns_D_is_sq, value: s } = uvRatio(Ns, D); // 5\n let s_ = mod(s * r0); // 6\n if (!isNegativeLE(s_, P))\n s_ = mod(-s_);\n if (!Ns_D_is_sq)\n s = s_; // 7\n if (!Ns_D_is_sq)\n c = r; // 8\n const Nt = mod(c * (r - _1n) * D_MINUS_ONE_SQ - D); // 9\n const s2 = s * s;\n const W0 = mod((s + s) * D); // 10\n const W1 = mod(Nt * SQRT_AD_MINUS_ONE); // 11\n const W2 = mod(_1n - s2); // 12\n const W3 = mod(_1n + s2); // 13\n return new ed25519.ExtendedPoint(mod(W0 * W3), mod(W2 * W1), mod(W1 * W3), mod(W0 * W2));\n}\n/**\n * Each ed25519/ExtendedPoint has 8 different equivalent points. This can be\n * a source of bugs for protocols like ring signatures. Ristretto was created to solve this.\n * Ristretto point operates in X:Y:Z:T extended coordinates like ExtendedPoint,\n * but it should work in its own namespace: do not combine those two.\n * https://datatracker.ietf.org/doc/html/draft-irtf-cfrg-ristretto255-decaf448\n */\nclass RistPoint {\n // Private property to discourage combining ExtendedPoint + RistrettoPoint\n // Always use Ristretto encoding/decoding instead.\n constructor(ep) {\n this.ep = ep;\n }\n static fromAffine(ap) {\n return new RistPoint(ed25519.ExtendedPoint.fromAffine(ap));\n }\n /**\n * Takes uniform output of 64-byte hash function like sha512 and converts it to `RistrettoPoint`.\n * The hash-to-group operation applies Elligator twice and adds the results.\n * **Note:** this is one-way map, there is no conversion from point to hash.\n * https://ristretto.group/formulas/elligator.html\n * @param hex 64-byte output of a hash function\n */\n static hashToCurve(hex) {\n hex = ensureBytes('ristrettoHash', hex, 64);\n const r1 = bytes255ToNumberLE(hex.slice(0, 32));\n const R1 = calcElligatorRistrettoMap(r1);\n const r2 = bytes255ToNumberLE(hex.slice(32, 64));\n const R2 = calcElligatorRistrettoMap(r2);\n return new RistPoint(R1.add(R2));\n }\n /**\n * Converts ristretto-encoded string to ristretto point.\n * https://ristretto.group/formulas/decoding.html\n * @param hex Ristretto-encoded 32 bytes. Not every 32-byte string is valid ristretto encoding\n */\n static fromHex(hex) {\n hex = ensureBytes('ristrettoHex', hex, 32);\n const { a, d } = ed25519.CURVE;\n const P = ed25519.CURVE.Fp.ORDER;\n const mod = ed25519.CURVE.Fp.create;\n const emsg = 'RistrettoPoint.fromHex: the hex is not valid encoding of RistrettoPoint';\n const s = bytes255ToNumberLE(hex);\n // 1. Check that s_bytes is the canonical encoding of a field element, or else abort.\n // 3. Check that s is non-negative, or else abort\n if (!equalBytes(numberToBytesLE(s, 32), hex) || isNegativeLE(s, P))\n throw new Error(emsg);\n const s2 = mod(s * s);\n const u1 = mod(_1n + a * s2); // 4 (a is -1)\n const u2 = mod(_1n - a * s2); // 5\n const u1_2 = mod(u1 * u1);\n const u2_2 = mod(u2 * u2);\n const v = mod(a * d * u1_2 - u2_2); // 6\n const { isValid, value: I } = invertSqrt(mod(v * u2_2)); // 7\n const Dx = mod(I * u2); // 8\n const Dy = mod(I * Dx * v); // 9\n let x = mod((s + s) * Dx); // 10\n if (isNegativeLE(x, P))\n x = mod(-x); // 10\n const y = mod(u1 * Dy); // 11\n const t = mod(x * y); // 12\n if (!isValid || isNegativeLE(t, P) || y === _0n)\n throw new Error(emsg);\n return new RistPoint(new ed25519.ExtendedPoint(x, y, _1n, t));\n }\n /**\n * Encodes ristretto point to Uint8Array.\n * https://ristretto.group/formulas/encoding.html\n */\n toRawBytes() {\n let { ex: x, ey: y, ez: z, et: t } = this.ep;\n const P = ed25519.CURVE.Fp.ORDER;\n const mod = ed25519.CURVE.Fp.create;\n const u1 = mod(mod(z + y) * mod(z - y)); // 1\n const u2 = mod(x * y); // 2\n // Square root always exists\n const u2sq = mod(u2 * u2);\n const { value: invsqrt } = invertSqrt(mod(u1 * u2sq)); // 3\n const D1 = mod(invsqrt * u1); // 4\n const D2 = mod(invsqrt * u2); // 5\n const zInv = mod(D1 * D2 * t); // 6\n let D; // 7\n if (isNegativeLE(t * zInv, P)) {\n let _x = mod(y * SQRT_M1);\n let _y = mod(x * SQRT_M1);\n x = _x;\n y = _y;\n D = mod(D1 * INVSQRT_A_MINUS_D);\n }\n else {\n D = D2; // 8\n }\n if (isNegativeLE(x * zInv, P))\n y = mod(-y); // 9\n let s = mod((z - y) * D); // 10 (check footer's note, no sqrt(-a))\n if (isNegativeLE(s, P))\n s = mod(-s);\n return numberToBytesLE(s, 32); // 11\n }\n toHex() {\n return bytesToHex(this.toRawBytes());\n }\n toString() {\n return this.toHex();\n }\n // Compare one point to another.\n equals(other) {\n assertRstPoint(other);\n const { ex: X1, ey: Y1 } = this.ep;\n const { ex: X2, ey: Y2 } = other.ep;\n const mod = ed25519.CURVE.Fp.create;\n // (x1 * y2 == y1 * x2) | (y1 * y2 == x1 * x2)\n const one = mod(X1 * Y2) === mod(Y1 * X2);\n const two = mod(Y1 * Y2) === mod(X1 * X2);\n return one || two;\n }\n add(other) {\n assertRstPoint(other);\n return new RistPoint(this.ep.add(other.ep));\n }\n subtract(other) {\n assertRstPoint(other);\n return new RistPoint(this.ep.subtract(other.ep));\n }\n multiply(scalar) {\n return new RistPoint(this.ep.multiply(scalar));\n }\n multiplyUnsafe(scalar) {\n return new RistPoint(this.ep.multiplyUnsafe(scalar));\n }\n double() {\n return new RistPoint(this.ep.double());\n }\n negate() {\n return new RistPoint(this.ep.negate());\n }\n}\nexport const RistrettoPoint = /* @__PURE__ */ (() => {\n if (!RistPoint.BASE)\n RistPoint.BASE = new RistPoint(ed25519.ExtendedPoint.BASE);\n if (!RistPoint.ZERO)\n RistPoint.ZERO = new RistPoint(ed25519.ExtendedPoint.ZERO);\n return RistPoint;\n})();\n// Hashing to ristretto255. https://www.rfc-editor.org/rfc/rfc9380#appendix-B\nexport const hashToRistretto255 = (msg, options) => {\n const d = options.DST;\n const DST = typeof d === 'string' ? utf8ToBytes(d) : d;\n const uniform_bytes = expand_message_xmd(msg, DST, 64, sha512);\n const P = RistPoint.hashToCurve(uniform_bytes);\n return P;\n};\nexport const hash_to_ristretto255 = hashToRistretto255; // legacy\n//# sourceMappingURL=ed25519.js.map","import { ed25519 as ed } from '@noble/curves/ed25519';\nconst PUBLIC_KEY_BYTE_LENGTH = 32;\nconst PRIVATE_KEY_BYTE_LENGTH = 64; // private key is actually 32 bytes but for historical reasons we concat private and public keys\nconst KEYS_BYTE_LENGTH = 32;\nexport { PUBLIC_KEY_BYTE_LENGTH as publicKeyLength };\nexport { PRIVATE_KEY_BYTE_LENGTH as privateKeyLength };\nexport function generateKey() {\n // the actual private key (32 bytes)\n const privateKeyRaw = ed.utils.randomPrivateKey();\n const publicKey = ed.getPublicKey(privateKeyRaw);\n // concatenated the public key to the private key\n const privateKey = concatKeys(privateKeyRaw, publicKey);\n return {\n privateKey,\n publicKey\n };\n}\n/**\n * Generate keypair from a 32 byte uint8array\n */\nexport function generateKeyFromSeed(seed) {\n if (seed.length !== KEYS_BYTE_LENGTH) {\n throw new TypeError('\"seed\" must be 32 bytes in length.');\n }\n else if (!(seed instanceof Uint8Array)) {\n throw new TypeError('\"seed\" must be a node.js Buffer, or Uint8Array.');\n }\n // based on node forges algorithm, the seed is used directly as private key\n const privateKeyRaw = seed;\n const publicKey = ed.getPublicKey(privateKeyRaw);\n const privateKey = concatKeys(privateKeyRaw, publicKey);\n return {\n privateKey,\n publicKey\n };\n}\nexport function hashAndSign(privateKey, msg) {\n const privateKeyRaw = privateKey.subarray(0, KEYS_BYTE_LENGTH);\n return ed.sign(msg instanceof Uint8Array ? msg : msg.subarray(), privateKeyRaw);\n}\nexport function hashAndVerify(publicKey, sig, msg) {\n return ed.verify(sig, msg instanceof Uint8Array ? msg : msg.subarray(), publicKey);\n}\nfunction concatKeys(privateKeyRaw, publicKey) {\n const privateKey = new Uint8Array(PRIVATE_KEY_BYTE_LENGTH);\n for (let i = 0; i < KEYS_BYTE_LENGTH; i++) {\n privateKey[i] = privateKeyRaw[i];\n privateKey[KEYS_BYTE_LENGTH + i] = publicKey[i];\n }\n return privateKey;\n}\n//# sourceMappingURL=ed25519-browser.js.map","/* eslint-env browser */\n// Check native crypto exists and is enabled (In insecure context `self.crypto`\n// exists but `self.crypto.subtle` does not).\nexport default {\n get(win = globalThis) {\n const nativeCrypto = win.crypto;\n if (nativeCrypto?.subtle == null) {\n throw Object.assign(new Error('Missing Web Crypto API. ' +\n 'The most likely cause of this error is that this page is being accessed ' +\n 'from an insecure context (i.e. not HTTPS). For more information and ' +\n 'possible resolutions see ' +\n 'https://github.com/libp2p/js-libp2p/blob/main/packages/crypto/README.md#web-crypto-api'), { code: 'ERR_MISSING_WEB_CRYPTO' });\n }\n return nativeCrypto;\n }\n};\n//# sourceMappingURL=webcrypto-browser.js.map","import { concat } from 'uint8arrays/concat';\nimport { fromString } from 'uint8arrays/from-string';\nimport webcrypto from '../webcrypto.js';\n// WebKit on Linux does not support deriving a key from an empty PBKDF2 key.\n// So, as a workaround, we provide the generated key as a constant. We test that\n// this generated key is accurate in test/workaround.spec.ts\n// Generated via:\n// await crypto.subtle.exportKey('jwk',\n// await crypto.subtle.deriveKey(\n// { name: 'PBKDF2', salt: new Uint8Array(16), iterations: 32767, hash: { name: 'SHA-256' } },\n// await crypto.subtle.importKey('raw', new Uint8Array(0), { name: 'PBKDF2' }, false, ['deriveKey']),\n// { name: 'AES-GCM', length: 128 }, true, ['encrypt', 'decrypt'])\n// )\nexport const derivedEmptyPasswordKey = { alg: 'A128GCM', ext: true, k: 'scm9jmO_4BJAgdwWGVulLg', key_ops: ['encrypt', 'decrypt'], kty: 'oct' };\n// Based off of code from https://github.com/luke-park/SecureCompatibleEncryptionExamples\nexport function create(opts) {\n const algorithm = opts?.algorithm ?? 'AES-GCM';\n let keyLength = opts?.keyLength ?? 16;\n const nonceLength = opts?.nonceLength ?? 12;\n const digest = opts?.digest ?? 'SHA-256';\n const saltLength = opts?.saltLength ?? 16;\n const iterations = opts?.iterations ?? 32767;\n const crypto = webcrypto.get();\n keyLength *= 8; // Browser crypto uses bits instead of bytes\n /**\n * Uses the provided password to derive a pbkdf2 key. The key\n * will then be used to encrypt the data.\n */\n async function encrypt(data, password) {\n const salt = crypto.getRandomValues(new Uint8Array(saltLength));\n const nonce = crypto.getRandomValues(new Uint8Array(nonceLength));\n const aesGcm = { name: algorithm, iv: nonce };\n if (typeof password === 'string') {\n password = fromString(password);\n }\n let cryptoKey;\n if (password.length === 0) {\n cryptoKey = await crypto.subtle.importKey('jwk', derivedEmptyPasswordKey, { name: 'AES-GCM' }, true, ['encrypt']);\n try {\n const deriveParams = { name: 'PBKDF2', salt, iterations, hash: { name: digest } };\n const runtimeDerivedEmptyPassword = await crypto.subtle.importKey('raw', password, { name: 'PBKDF2' }, false, ['deriveKey']);\n cryptoKey = await crypto.subtle.deriveKey(deriveParams, runtimeDerivedEmptyPassword, { name: algorithm, length: keyLength }, true, ['encrypt']);\n }\n catch {\n cryptoKey = await crypto.subtle.importKey('jwk', derivedEmptyPasswordKey, { name: 'AES-GCM' }, true, ['encrypt']);\n }\n }\n else {\n // Derive a key using PBKDF2.\n const deriveParams = { name: 'PBKDF2', salt, iterations, hash: { name: digest } };\n const rawKey = await crypto.subtle.importKey('raw', password, { name: 'PBKDF2' }, false, ['deriveKey']);\n cryptoKey = await crypto.subtle.deriveKey(deriveParams, rawKey, { name: algorithm, length: keyLength }, true, ['encrypt']);\n }\n // Encrypt the string.\n const ciphertext = await crypto.subtle.encrypt(aesGcm, cryptoKey, data);\n return concat([salt, aesGcm.iv, new Uint8Array(ciphertext)]);\n }\n /**\n * Uses the provided password to derive a pbkdf2 key. The key\n * will then be used to decrypt the data. The options used to create\n * this decryption cipher must be the same as those used to create\n * the encryption cipher.\n */\n async function decrypt(data, password) {\n const salt = data.subarray(0, saltLength);\n const nonce = data.subarray(saltLength, saltLength + nonceLength);\n const ciphertext = data.subarray(saltLength + nonceLength);\n const aesGcm = { name: algorithm, iv: nonce };\n if (typeof password === 'string') {\n password = fromString(password);\n }\n let cryptoKey;\n if (password.length === 0) {\n try {\n const deriveParams = { name: 'PBKDF2', salt, iterations, hash: { name: digest } };\n const runtimeDerivedEmptyPassword = await crypto.subtle.importKey('raw', password, { name: 'PBKDF2' }, false, ['deriveKey']);\n cryptoKey = await crypto.subtle.deriveKey(deriveParams, runtimeDerivedEmptyPassword, { name: algorithm, length: keyLength }, true, ['decrypt']);\n }\n catch {\n cryptoKey = await crypto.subtle.importKey('jwk', derivedEmptyPasswordKey, { name: 'AES-GCM' }, true, ['decrypt']);\n }\n }\n else {\n // Derive the key using PBKDF2.\n const deriveParams = { name: 'PBKDF2', salt, iterations, hash: { name: digest } };\n const rawKey = await crypto.subtle.importKey('raw', password, { name: 'PBKDF2' }, false, ['deriveKey']);\n cryptoKey = await crypto.subtle.deriveKey(deriveParams, rawKey, { name: algorithm, length: keyLength }, true, ['decrypt']);\n }\n // Decrypt the string.\n const plaintext = await crypto.subtle.decrypt(aesGcm, cryptoKey, ciphertext);\n return new Uint8Array(plaintext);\n }\n const cipher = {\n encrypt,\n decrypt\n };\n return cipher;\n}\n//# sourceMappingURL=aes-gcm.browser.js.map","import { base64 } from 'multiformats/bases/base64';\nimport * as ciphers from '../ciphers/aes-gcm.js';\n/**\n * Exports the given PrivateKey as a base64 encoded string.\n * The PrivateKey is encrypted via a password derived PBKDF2 key\n * leveraging the aes-gcm cipher algorithm.\n */\nexport async function exporter(privateKey, password) {\n const cipher = ciphers.create();\n const encryptedKey = await cipher.encrypt(privateKey, password);\n return base64.encode(encryptedKey);\n}\n//# sourceMappingURL=exporter.js.map","/* eslint-disable import/export */\n/* eslint-disable complexity */\n/* eslint-disable @typescript-eslint/no-namespace */\n/* eslint-disable @typescript-eslint/no-unnecessary-boolean-literal-compare */\n/* eslint-disable @typescript-eslint/no-empty-interface */\nimport { enumeration, encodeMessage, decodeMessage, message } from 'protons-runtime';\nexport var KeyType;\n(function (KeyType) {\n KeyType[\"RSA\"] = \"RSA\";\n KeyType[\"Ed25519\"] = \"Ed25519\";\n KeyType[\"Secp256k1\"] = \"Secp256k1\";\n})(KeyType || (KeyType = {}));\nvar __KeyTypeValues;\n(function (__KeyTypeValues) {\n __KeyTypeValues[__KeyTypeValues[\"RSA\"] = 0] = \"RSA\";\n __KeyTypeValues[__KeyTypeValues[\"Ed25519\"] = 1] = \"Ed25519\";\n __KeyTypeValues[__KeyTypeValues[\"Secp256k1\"] = 2] = \"Secp256k1\";\n})(__KeyTypeValues || (__KeyTypeValues = {}));\n(function (KeyType) {\n KeyType.codec = () => {\n return enumeration(__KeyTypeValues);\n };\n})(KeyType || (KeyType = {}));\nexport var PublicKey;\n(function (PublicKey) {\n let _codec;\n PublicKey.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if (obj.Type != null) {\n w.uint32(8);\n KeyType.codec().encode(obj.Type, w);\n }\n if (obj.Data != null) {\n w.uint32(18);\n w.bytes(obj.Data);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length) => {\n const obj = {};\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1:\n obj.Type = KeyType.codec().decode(reader);\n break;\n case 2:\n obj.Data = reader.bytes();\n break;\n default:\n reader.skipType(tag & 7);\n break;\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n PublicKey.encode = (obj) => {\n return encodeMessage(obj, PublicKey.codec());\n };\n PublicKey.decode = (buf) => {\n return decodeMessage(buf, PublicKey.codec());\n };\n})(PublicKey || (PublicKey = {}));\nexport var PrivateKey;\n(function (PrivateKey) {\n let _codec;\n PrivateKey.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if (obj.Type != null) {\n w.uint32(8);\n KeyType.codec().encode(obj.Type, w);\n }\n if (obj.Data != null) {\n w.uint32(18);\n w.bytes(obj.Data);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length) => {\n const obj = {};\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1:\n obj.Type = KeyType.codec().decode(reader);\n break;\n case 2:\n obj.Data = reader.bytes();\n break;\n default:\n reader.skipType(tag & 7);\n break;\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n PrivateKey.encode = (obj) => {\n return encodeMessage(obj, PrivateKey.codec());\n };\n PrivateKey.decode = (buf) => {\n return decodeMessage(buf, PrivateKey.codec());\n };\n})(PrivateKey || (PrivateKey = {}));\n//# sourceMappingURL=keys.js.map","import { CodeError } from '@libp2p/interface';\nimport { base58btc } from 'multiformats/bases/base58';\nimport { identity } from 'multiformats/hashes/identity';\nimport { sha256 } from 'multiformats/hashes/sha2';\nimport { equals as uint8ArrayEquals } from 'uint8arrays/equals';\nimport { isPromise } from '../util.js';\nimport * as crypto from './ed25519.js';\nimport { exporter } from './exporter.js';\nimport * as pbm from './keys.js';\nexport class Ed25519PublicKey {\n _key;\n constructor(key) {\n this._key = ensureKey(key, crypto.publicKeyLength);\n }\n verify(data, sig) {\n return crypto.hashAndVerify(this._key, sig, data);\n }\n marshal() {\n return this._key;\n }\n get bytes() {\n return pbm.PublicKey.encode({\n Type: pbm.KeyType.Ed25519,\n Data: this.marshal()\n }).subarray();\n }\n equals(key) {\n return uint8ArrayEquals(this.bytes, key.bytes);\n }\n hash() {\n const p = sha256.digest(this.bytes);\n if (isPromise(p)) {\n return p.then(({ bytes }) => bytes);\n }\n return p.bytes;\n }\n}\nexport class Ed25519PrivateKey {\n _key;\n _publicKey;\n // key - 64 byte Uint8Array containing private key\n // publicKey - 32 byte Uint8Array containing public key\n constructor(key, publicKey) {\n this._key = ensureKey(key, crypto.privateKeyLength);\n this._publicKey = ensureKey(publicKey, crypto.publicKeyLength);\n }\n sign(message) {\n return crypto.hashAndSign(this._key, message);\n }\n get public() {\n return new Ed25519PublicKey(this._publicKey);\n }\n marshal() {\n return this._key;\n }\n get bytes() {\n return pbm.PrivateKey.encode({\n Type: pbm.KeyType.Ed25519,\n Data: this.marshal()\n }).subarray();\n }\n equals(key) {\n return uint8ArrayEquals(this.bytes, key.bytes);\n }\n async hash() {\n const p = sha256.digest(this.bytes);\n let bytes;\n if (isPromise(p)) {\n ({ bytes } = await p);\n }\n else {\n bytes = p.bytes;\n }\n return bytes;\n }\n /**\n * Gets the ID of the key.\n *\n * The key id is the base58 encoding of the identity multihash containing its public key.\n * The public key is a protobuf encoding containing a type and the DER encoding\n * of the PKCS SubjectPublicKeyInfo.\n *\n * @returns {Promise}\n */\n async id() {\n const encoding = identity.digest(this.public.bytes);\n return base58btc.encode(encoding.bytes).substring(1);\n }\n /**\n * Exports the key into a password protected `format`\n */\n async export(password, format = 'libp2p-key') {\n if (format === 'libp2p-key') {\n return exporter(this.bytes, password);\n }\n else {\n throw new CodeError(`export format '${format}' is not supported`, 'ERR_INVALID_EXPORT_FORMAT');\n }\n }\n}\nexport function unmarshalEd25519PrivateKey(bytes) {\n // Try the old, redundant public key version\n if (bytes.length > crypto.privateKeyLength) {\n bytes = ensureKey(bytes, crypto.privateKeyLength + crypto.publicKeyLength);\n const privateKeyBytes = bytes.subarray(0, crypto.privateKeyLength);\n const publicKeyBytes = bytes.subarray(crypto.privateKeyLength, bytes.length);\n return new Ed25519PrivateKey(privateKeyBytes, publicKeyBytes);\n }\n bytes = ensureKey(bytes, crypto.privateKeyLength);\n const privateKeyBytes = bytes.subarray(0, crypto.privateKeyLength);\n const publicKeyBytes = bytes.subarray(crypto.publicKeyLength);\n return new Ed25519PrivateKey(privateKeyBytes, publicKeyBytes);\n}\nexport function unmarshalEd25519PublicKey(bytes) {\n bytes = ensureKey(bytes, crypto.publicKeyLength);\n return new Ed25519PublicKey(bytes);\n}\nexport async function generateKeyPair() {\n const { privateKey, publicKey } = crypto.generateKey();\n return new Ed25519PrivateKey(privateKey, publicKey);\n}\nexport async function generateKeyPairFromSeed(seed) {\n const { privateKey, publicKey } = crypto.generateKeyFromSeed(seed);\n return new Ed25519PrivateKey(privateKey, publicKey);\n}\nfunction ensureKey(key, length) {\n key = Uint8Array.from(key ?? []);\n if (key.length !== length) {\n throw new CodeError(`Key must be a Uint8Array of length ${length}, got ${key.length}`, 'ERR_INVALID_KEY_TYPE');\n }\n return key;\n}\n//# sourceMappingURL=ed25519-class.js.map","import { CodeError } from '@libp2p/interface';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport randomBytes from '../random-bytes.js';\nimport webcrypto from '../webcrypto.js';\nimport * as utils from './rsa-utils.js';\nexport { utils };\nexport async function generateKey(bits) {\n const pair = await webcrypto.get().subtle.generateKey({\n name: 'RSASSA-PKCS1-v1_5',\n modulusLength: bits,\n publicExponent: new Uint8Array([0x01, 0x00, 0x01]),\n hash: { name: 'SHA-256' }\n }, true, ['sign', 'verify']);\n const keys = await exportKey(pair);\n return {\n privateKey: keys[0],\n publicKey: keys[1]\n };\n}\n// Takes a jwk key\nexport async function unmarshalPrivateKey(key) {\n const privateKey = await webcrypto.get().subtle.importKey('jwk', key, {\n name: 'RSASSA-PKCS1-v1_5',\n hash: { name: 'SHA-256' }\n }, true, ['sign']);\n const pair = [\n privateKey,\n await derivePublicFromPrivate(key)\n ];\n const keys = await exportKey({\n privateKey: pair[0],\n publicKey: pair[1]\n });\n return {\n privateKey: keys[0],\n publicKey: keys[1]\n };\n}\nexport { randomBytes as getRandomValues };\nexport async function hashAndSign(key, msg) {\n const privateKey = await webcrypto.get().subtle.importKey('jwk', key, {\n name: 'RSASSA-PKCS1-v1_5',\n hash: { name: 'SHA-256' }\n }, false, ['sign']);\n const sig = await webcrypto.get().subtle.sign({ name: 'RSASSA-PKCS1-v1_5' }, privateKey, msg instanceof Uint8Array ? msg : msg.subarray());\n return new Uint8Array(sig, 0, sig.byteLength);\n}\nexport async function hashAndVerify(key, sig, msg) {\n const publicKey = await webcrypto.get().subtle.importKey('jwk', key, {\n name: 'RSASSA-PKCS1-v1_5',\n hash: { name: 'SHA-256' }\n }, false, ['verify']);\n return webcrypto.get().subtle.verify({ name: 'RSASSA-PKCS1-v1_5' }, publicKey, sig, msg instanceof Uint8Array ? msg : msg.subarray());\n}\nasync function exportKey(pair) {\n if (pair.privateKey == null || pair.publicKey == null) {\n throw new CodeError('Private and public key are required', 'ERR_INVALID_PARAMETERS');\n }\n return Promise.all([\n webcrypto.get().subtle.exportKey('jwk', pair.privateKey),\n webcrypto.get().subtle.exportKey('jwk', pair.publicKey)\n ]);\n}\nasync function derivePublicFromPrivate(jwKey) {\n return webcrypto.get().subtle.importKey('jwk', {\n kty: jwKey.kty,\n n: jwKey.n,\n e: jwKey.e\n }, {\n name: 'RSASSA-PKCS1-v1_5',\n hash: { name: 'SHA-256' }\n }, true, ['verify']);\n}\nexport function keySize(jwk) {\n if (jwk.kty !== 'RSA') {\n throw new CodeError('invalid key type', 'ERR_INVALID_KEY_TYPE');\n }\n else if (jwk.n == null) {\n throw new CodeError('invalid key modulus', 'ERR_INVALID_KEY_MODULUS');\n }\n const bytes = uint8ArrayFromString(jwk.n, 'base64url');\n return bytes.length * 8;\n}\n//# sourceMappingURL=rsa-browser.js.map","import { hash as assertHash, bytes as assertBytes, exists as assertExists } from './_assert.js';\nimport { Hash, toBytes } from './utils.js';\n// HMAC (RFC 2104)\nexport class HMAC extends Hash {\n constructor(hash, _key) {\n super();\n this.finished = false;\n this.destroyed = false;\n assertHash(hash);\n const key = toBytes(_key);\n this.iHash = hash.create();\n if (typeof this.iHash.update !== 'function')\n throw new Error('Expected instance of class which extends utils.Hash');\n this.blockLen = this.iHash.blockLen;\n this.outputLen = this.iHash.outputLen;\n const blockLen = this.blockLen;\n const pad = new Uint8Array(blockLen);\n // blockLen can be bigger than outputLen\n pad.set(key.length > blockLen ? hash.create().update(key).digest() : key);\n for (let i = 0; i < pad.length; i++)\n pad[i] ^= 0x36;\n this.iHash.update(pad);\n // By doing update (processing of first block) of outer hash here we can re-use it between multiple calls via clone\n this.oHash = hash.create();\n // Undo internal XOR && apply outer XOR\n for (let i = 0; i < pad.length; i++)\n pad[i] ^= 0x36 ^ 0x5c;\n this.oHash.update(pad);\n pad.fill(0);\n }\n update(buf) {\n assertExists(this);\n this.iHash.update(buf);\n return this;\n }\n digestInto(out) {\n assertExists(this);\n assertBytes(out, this.outputLen);\n this.finished = true;\n this.iHash.digestInto(out);\n this.oHash.update(out);\n this.oHash.digestInto(out);\n this.destroy();\n }\n digest() {\n const out = new Uint8Array(this.oHash.outputLen);\n this.digestInto(out);\n return out;\n }\n _cloneInto(to) {\n // Create new instance without calling constructor since key already in state and we don't know it.\n to || (to = Object.create(Object.getPrototypeOf(this), {}));\n const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;\n to = to;\n to.finished = finished;\n to.destroyed = destroyed;\n to.blockLen = blockLen;\n to.outputLen = outputLen;\n to.oHash = oHash._cloneInto(to.oHash);\n to.iHash = iHash._cloneInto(to.iHash);\n return to;\n }\n destroy() {\n this.destroyed = true;\n this.oHash.destroy();\n this.iHash.destroy();\n }\n}\n/**\n * HMAC: RFC2104 message authentication code.\n * @param hash - function that would be used e.g. sha256\n * @param key - message key\n * @param message - message data\n */\nexport const hmac = (hash, key, message) => new HMAC(hash, key).update(message).digest();\nhmac.create = (hash, key) => new HMAC(hash, key);\n//# sourceMappingURL=hmac.js.map","/*!\n Copyright (c) Peculiar Ventures, LLC\n*/\n\nfunction getUTCDate(date) {\r\n return new Date(date.getTime() + (date.getTimezoneOffset() * 60000));\r\n}\r\nfunction getParametersValue(parameters, name, defaultValue) {\r\n var _a;\r\n if ((parameters instanceof Object) === false) {\r\n return defaultValue;\r\n }\r\n return (_a = parameters[name]) !== null && _a !== void 0 ? _a : defaultValue;\r\n}\r\nfunction bufferToHexCodes(inputBuffer, inputOffset = 0, inputLength = (inputBuffer.byteLength - inputOffset), insertSpace = false) {\r\n let result = \"\";\r\n for (const item of (new Uint8Array(inputBuffer, inputOffset, inputLength))) {\r\n const str = item.toString(16).toUpperCase();\r\n if (str.length === 1) {\r\n result += \"0\";\r\n }\r\n result += str;\r\n if (insertSpace) {\r\n result += \" \";\r\n }\r\n }\r\n return result.trim();\r\n}\r\nfunction checkBufferParams(baseBlock, inputBuffer, inputOffset, inputLength) {\r\n if (!(inputBuffer instanceof ArrayBuffer)) {\r\n baseBlock.error = \"Wrong parameter: inputBuffer must be \\\"ArrayBuffer\\\"\";\r\n return false;\r\n }\r\n if (!inputBuffer.byteLength) {\r\n baseBlock.error = \"Wrong parameter: inputBuffer has zero length\";\r\n return false;\r\n }\r\n if (inputOffset < 0) {\r\n baseBlock.error = \"Wrong parameter: inputOffset less than zero\";\r\n return false;\r\n }\r\n if (inputLength < 0) {\r\n baseBlock.error = \"Wrong parameter: inputLength less than zero\";\r\n return false;\r\n }\r\n if ((inputBuffer.byteLength - inputOffset - inputLength) < 0) {\r\n baseBlock.error = \"End of input reached before message was fully decoded (inconsistent offset and length values)\";\r\n return false;\r\n }\r\n return true;\r\n}\r\nfunction utilFromBase(inputBuffer, inputBase) {\r\n let result = 0;\r\n if (inputBuffer.length === 1) {\r\n return inputBuffer[0];\r\n }\r\n for (let i = (inputBuffer.length - 1); i >= 0; i--) {\r\n result += inputBuffer[(inputBuffer.length - 1) - i] * Math.pow(2, inputBase * i);\r\n }\r\n return result;\r\n}\r\nfunction utilToBase(value, base, reserved = (-1)) {\r\n const internalReserved = reserved;\r\n let internalValue = value;\r\n let result = 0;\r\n let biggest = Math.pow(2, base);\r\n for (let i = 1; i < 8; i++) {\r\n if (value < biggest) {\r\n let retBuf;\r\n if (internalReserved < 0) {\r\n retBuf = new ArrayBuffer(i);\r\n result = i;\r\n }\r\n else {\r\n if (internalReserved < i) {\r\n return (new ArrayBuffer(0));\r\n }\r\n retBuf = new ArrayBuffer(internalReserved);\r\n result = internalReserved;\r\n }\r\n const retView = new Uint8Array(retBuf);\r\n for (let j = (i - 1); j >= 0; j--) {\r\n const basis = Math.pow(2, j * base);\r\n retView[result - j - 1] = Math.floor(internalValue / basis);\r\n internalValue -= (retView[result - j - 1]) * basis;\r\n }\r\n return retBuf;\r\n }\r\n biggest *= Math.pow(2, base);\r\n }\r\n return new ArrayBuffer(0);\r\n}\r\nfunction utilConcatBuf(...buffers) {\r\n let outputLength = 0;\r\n let prevLength = 0;\r\n for (const buffer of buffers) {\r\n outputLength += buffer.byteLength;\r\n }\r\n const retBuf = new ArrayBuffer(outputLength);\r\n const retView = new Uint8Array(retBuf);\r\n for (const buffer of buffers) {\r\n retView.set(new Uint8Array(buffer), prevLength);\r\n prevLength += buffer.byteLength;\r\n }\r\n return retBuf;\r\n}\r\nfunction utilConcatView(...views) {\r\n let outputLength = 0;\r\n let prevLength = 0;\r\n for (const view of views) {\r\n outputLength += view.length;\r\n }\r\n const retBuf = new ArrayBuffer(outputLength);\r\n const retView = new Uint8Array(retBuf);\r\n for (const view of views) {\r\n retView.set(view, prevLength);\r\n prevLength += view.length;\r\n }\r\n return retView;\r\n}\r\nfunction utilDecodeTC() {\r\n const buf = new Uint8Array(this.valueHex);\r\n if (this.valueHex.byteLength >= 2) {\r\n const condition1 = (buf[0] === 0xFF) && (buf[1] & 0x80);\r\n const condition2 = (buf[0] === 0x00) && ((buf[1] & 0x80) === 0x00);\r\n if (condition1 || condition2) {\r\n this.warnings.push(\"Needlessly long format\");\r\n }\r\n }\r\n const bigIntBuffer = new ArrayBuffer(this.valueHex.byteLength);\r\n const bigIntView = new Uint8Array(bigIntBuffer);\r\n for (let i = 0; i < this.valueHex.byteLength; i++) {\r\n bigIntView[i] = 0;\r\n }\r\n bigIntView[0] = (buf[0] & 0x80);\r\n const bigInt = utilFromBase(bigIntView, 8);\r\n const smallIntBuffer = new ArrayBuffer(this.valueHex.byteLength);\r\n const smallIntView = new Uint8Array(smallIntBuffer);\r\n for (let j = 0; j < this.valueHex.byteLength; j++) {\r\n smallIntView[j] = buf[j];\r\n }\r\n smallIntView[0] &= 0x7F;\r\n const smallInt = utilFromBase(smallIntView, 8);\r\n return (smallInt - bigInt);\r\n}\r\nfunction utilEncodeTC(value) {\r\n const modValue = (value < 0) ? (value * (-1)) : value;\r\n let bigInt = 128;\r\n for (let i = 1; i < 8; i++) {\r\n if (modValue <= bigInt) {\r\n if (value < 0) {\r\n const smallInt = bigInt - modValue;\r\n const retBuf = utilToBase(smallInt, 8, i);\r\n const retView = new Uint8Array(retBuf);\r\n retView[0] |= 0x80;\r\n return retBuf;\r\n }\r\n let retBuf = utilToBase(modValue, 8, i);\r\n let retView = new Uint8Array(retBuf);\r\n if (retView[0] & 0x80) {\r\n const tempBuf = retBuf.slice(0);\r\n const tempView = new Uint8Array(tempBuf);\r\n retBuf = new ArrayBuffer(retBuf.byteLength + 1);\r\n retView = new Uint8Array(retBuf);\r\n for (let k = 0; k < tempBuf.byteLength; k++) {\r\n retView[k + 1] = tempView[k];\r\n }\r\n retView[0] = 0x00;\r\n }\r\n return retBuf;\r\n }\r\n bigInt *= Math.pow(2, 8);\r\n }\r\n return (new ArrayBuffer(0));\r\n}\r\nfunction isEqualBuffer(inputBuffer1, inputBuffer2) {\r\n if (inputBuffer1.byteLength !== inputBuffer2.byteLength) {\r\n return false;\r\n }\r\n const view1 = new Uint8Array(inputBuffer1);\r\n const view2 = new Uint8Array(inputBuffer2);\r\n for (let i = 0; i < view1.length; i++) {\r\n if (view1[i] !== view2[i]) {\r\n return false;\r\n }\r\n }\r\n return true;\r\n}\r\nfunction padNumber(inputNumber, fullLength) {\r\n const str = inputNumber.toString(10);\r\n if (fullLength < str.length) {\r\n return \"\";\r\n }\r\n const dif = fullLength - str.length;\r\n const padding = new Array(dif);\r\n for (let i = 0; i < dif; i++) {\r\n padding[i] = \"0\";\r\n }\r\n const paddingString = padding.join(\"\");\r\n return paddingString.concat(str);\r\n}\r\nconst base64Template = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=\";\r\nconst base64UrlTemplate = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_=\";\r\nfunction toBase64(input, useUrlTemplate = false, skipPadding = false, skipLeadingZeros = false) {\r\n let i = 0;\r\n let flag1 = 0;\r\n let flag2 = 0;\r\n let output = \"\";\r\n const template = (useUrlTemplate) ? base64UrlTemplate : base64Template;\r\n if (skipLeadingZeros) {\r\n let nonZeroPosition = 0;\r\n for (let i = 0; i < input.length; i++) {\r\n if (input.charCodeAt(i) !== 0) {\r\n nonZeroPosition = i;\r\n break;\r\n }\r\n }\r\n input = input.slice(nonZeroPosition);\r\n }\r\n while (i < input.length) {\r\n const chr1 = input.charCodeAt(i++);\r\n if (i >= input.length) {\r\n flag1 = 1;\r\n }\r\n const chr2 = input.charCodeAt(i++);\r\n if (i >= input.length) {\r\n flag2 = 1;\r\n }\r\n const chr3 = input.charCodeAt(i++);\r\n const enc1 = chr1 >> 2;\r\n const enc2 = ((chr1 & 0x03) << 4) | (chr2 >> 4);\r\n let enc3 = ((chr2 & 0x0F) << 2) | (chr3 >> 6);\r\n let enc4 = chr3 & 0x3F;\r\n if (flag1 === 1) {\r\n enc3 = enc4 = 64;\r\n }\r\n else {\r\n if (flag2 === 1) {\r\n enc4 = 64;\r\n }\r\n }\r\n if (skipPadding) {\r\n if (enc3 === 64) {\r\n output += `${template.charAt(enc1)}${template.charAt(enc2)}`;\r\n }\r\n else {\r\n if (enc4 === 64) {\r\n output += `${template.charAt(enc1)}${template.charAt(enc2)}${template.charAt(enc3)}`;\r\n }\r\n else {\r\n output += `${template.charAt(enc1)}${template.charAt(enc2)}${template.charAt(enc3)}${template.charAt(enc4)}`;\r\n }\r\n }\r\n }\r\n else {\r\n output += `${template.charAt(enc1)}${template.charAt(enc2)}${template.charAt(enc3)}${template.charAt(enc4)}`;\r\n }\r\n }\r\n return output;\r\n}\r\nfunction fromBase64(input, useUrlTemplate = false, cutTailZeros = false) {\r\n const template = (useUrlTemplate) ? base64UrlTemplate : base64Template;\r\n function indexOf(toSearch) {\r\n for (let i = 0; i < 64; i++) {\r\n if (template.charAt(i) === toSearch)\r\n return i;\r\n }\r\n return 64;\r\n }\r\n function test(incoming) {\r\n return ((incoming === 64) ? 0x00 : incoming);\r\n }\r\n let i = 0;\r\n let output = \"\";\r\n while (i < input.length) {\r\n const enc1 = indexOf(input.charAt(i++));\r\n const enc2 = (i >= input.length) ? 0x00 : indexOf(input.charAt(i++));\r\n const enc3 = (i >= input.length) ? 0x00 : indexOf(input.charAt(i++));\r\n const enc4 = (i >= input.length) ? 0x00 : indexOf(input.charAt(i++));\r\n const chr1 = (test(enc1) << 2) | (test(enc2) >> 4);\r\n const chr2 = ((test(enc2) & 0x0F) << 4) | (test(enc3) >> 2);\r\n const chr3 = ((test(enc3) & 0x03) << 6) | test(enc4);\r\n output += String.fromCharCode(chr1);\r\n if (enc3 !== 64) {\r\n output += String.fromCharCode(chr2);\r\n }\r\n if (enc4 !== 64) {\r\n output += String.fromCharCode(chr3);\r\n }\r\n }\r\n if (cutTailZeros) {\r\n const outputLength = output.length;\r\n let nonZeroStart = (-1);\r\n for (let i = (outputLength - 1); i >= 0; i--) {\r\n if (output.charCodeAt(i) !== 0) {\r\n nonZeroStart = i;\r\n break;\r\n }\r\n }\r\n if (nonZeroStart !== (-1)) {\r\n output = output.slice(0, nonZeroStart + 1);\r\n }\r\n else {\r\n output = \"\";\r\n }\r\n }\r\n return output;\r\n}\r\nfunction arrayBufferToString(buffer) {\r\n let resultString = \"\";\r\n const view = new Uint8Array(buffer);\r\n for (const element of view) {\r\n resultString += String.fromCharCode(element);\r\n }\r\n return resultString;\r\n}\r\nfunction stringToArrayBuffer(str) {\r\n const stringLength = str.length;\r\n const resultBuffer = new ArrayBuffer(stringLength);\r\n const resultView = new Uint8Array(resultBuffer);\r\n for (let i = 0; i < stringLength; i++) {\r\n resultView[i] = str.charCodeAt(i);\r\n }\r\n return resultBuffer;\r\n}\r\nconst log2 = Math.log(2);\r\nfunction nearestPowerOf2(length) {\r\n const base = (Math.log(length) / log2);\r\n const floor = Math.floor(base);\r\n const round = Math.round(base);\r\n return ((floor === round) ? floor : round);\r\n}\r\nfunction clearProps(object, propsArray) {\r\n for (const prop of propsArray) {\r\n delete object[prop];\r\n }\r\n}\n\nexport { arrayBufferToString, bufferToHexCodes, checkBufferParams, clearProps, fromBase64, getParametersValue, getUTCDate, isEqualBuffer, nearestPowerOf2, padNumber, stringToArrayBuffer, toBase64, utilConcatBuf, utilConcatView, utilDecodeTC, utilEncodeTC, utilFromBase, utilToBase };\n","/*!\n * Copyright (c) 2014, GMO GlobalSign\n * Copyright (c) 2015-2022, Peculiar Ventures\n * All rights reserved.\n * \n * Author 2014-2019, Yury Strozhevsky\n * \n * Redistribution and use in source and binary forms, with or without modification,\n * are permitted provided that the following conditions are met:\n * \n * * Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n * \n * * Redistributions in binary form must reproduce the above copyright notice, this\n * list of conditions and the following disclaimer in the documentation and/or\n * other materials provided with the distribution.\n * \n * * Neither the name of the copyright holder nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n * \n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON\n * ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n * \n */\n\nimport * as pvtsutils from 'pvtsutils';\nimport * as pvutils from 'pvutils';\n\nfunction assertBigInt() {\r\n if (typeof BigInt === \"undefined\") {\r\n throw new Error(\"BigInt is not defined. Your environment doesn't implement BigInt.\");\r\n }\r\n}\r\nfunction concat(buffers) {\r\n let outputLength = 0;\r\n let prevLength = 0;\r\n for (let i = 0; i < buffers.length; i++) {\r\n const buffer = buffers[i];\r\n outputLength += buffer.byteLength;\r\n }\r\n const retView = new Uint8Array(outputLength);\r\n for (let i = 0; i < buffers.length; i++) {\r\n const buffer = buffers[i];\r\n retView.set(new Uint8Array(buffer), prevLength);\r\n prevLength += buffer.byteLength;\r\n }\r\n return retView.buffer;\r\n}\r\nfunction checkBufferParams(baseBlock, inputBuffer, inputOffset, inputLength) {\r\n if (!(inputBuffer instanceof Uint8Array)) {\r\n baseBlock.error = \"Wrong parameter: inputBuffer must be 'Uint8Array'\";\r\n return false;\r\n }\r\n if (!inputBuffer.byteLength) {\r\n baseBlock.error = \"Wrong parameter: inputBuffer has zero length\";\r\n return false;\r\n }\r\n if (inputOffset < 0) {\r\n baseBlock.error = \"Wrong parameter: inputOffset less than zero\";\r\n return false;\r\n }\r\n if (inputLength < 0) {\r\n baseBlock.error = \"Wrong parameter: inputLength less than zero\";\r\n return false;\r\n }\r\n if ((inputBuffer.byteLength - inputOffset - inputLength) < 0) {\r\n baseBlock.error = \"End of input reached before message was fully decoded (inconsistent offset and length values)\";\r\n return false;\r\n }\r\n return true;\r\n}\n\nclass ViewWriter {\r\n constructor() {\r\n this.items = [];\r\n }\r\n write(buf) {\r\n this.items.push(buf);\r\n }\r\n final() {\r\n return concat(this.items);\r\n }\r\n}\n\nconst powers2 = [new Uint8Array([1])];\r\nconst digitsString = \"0123456789\";\r\nconst NAME = \"name\";\r\nconst VALUE_HEX_VIEW = \"valueHexView\";\r\nconst IS_HEX_ONLY = \"isHexOnly\";\r\nconst ID_BLOCK = \"idBlock\";\r\nconst TAG_CLASS = \"tagClass\";\r\nconst TAG_NUMBER = \"tagNumber\";\r\nconst IS_CONSTRUCTED = \"isConstructed\";\r\nconst FROM_BER = \"fromBER\";\r\nconst TO_BER = \"toBER\";\r\nconst LOCAL = \"local\";\r\nconst EMPTY_STRING = \"\";\r\nconst EMPTY_BUFFER = new ArrayBuffer(0);\r\nconst EMPTY_VIEW = new Uint8Array(0);\r\nconst END_OF_CONTENT_NAME = \"EndOfContent\";\r\nconst OCTET_STRING_NAME = \"OCTET STRING\";\r\nconst BIT_STRING_NAME = \"BIT STRING\";\n\nfunction HexBlock(BaseClass) {\r\n var _a;\r\n return _a = class Some extends BaseClass {\r\n constructor(...args) {\r\n var _a;\r\n super(...args);\r\n const params = args[0] || {};\r\n this.isHexOnly = (_a = params.isHexOnly) !== null && _a !== void 0 ? _a : false;\r\n this.valueHexView = params.valueHex ? pvtsutils.BufferSourceConverter.toUint8Array(params.valueHex) : EMPTY_VIEW;\r\n }\r\n get valueHex() {\r\n return this.valueHexView.slice().buffer;\r\n }\r\n set valueHex(value) {\r\n this.valueHexView = new Uint8Array(value);\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n const view = inputBuffer instanceof ArrayBuffer ? new Uint8Array(inputBuffer) : inputBuffer;\r\n if (!checkBufferParams(this, view, inputOffset, inputLength)) {\r\n return -1;\r\n }\r\n const endLength = inputOffset + inputLength;\r\n this.valueHexView = view.subarray(inputOffset, endLength);\r\n if (!this.valueHexView.length) {\r\n this.warnings.push(\"Zero buffer length\");\r\n return inputOffset;\r\n }\r\n this.blockLength = inputLength;\r\n return endLength;\r\n }\r\n toBER(sizeOnly = false) {\r\n if (!this.isHexOnly) {\r\n this.error = \"Flag 'isHexOnly' is not set, abort\";\r\n return EMPTY_BUFFER;\r\n }\r\n if (sizeOnly) {\r\n return new ArrayBuffer(this.valueHexView.byteLength);\r\n }\r\n return (this.valueHexView.byteLength === this.valueHexView.buffer.byteLength)\r\n ? this.valueHexView.buffer\r\n : this.valueHexView.slice().buffer;\r\n }\r\n toJSON() {\r\n return {\r\n ...super.toJSON(),\r\n isHexOnly: this.isHexOnly,\r\n valueHex: pvtsutils.Convert.ToHex(this.valueHexView),\r\n };\r\n }\r\n },\r\n _a.NAME = \"hexBlock\",\r\n _a;\r\n}\n\nclass LocalBaseBlock {\r\n constructor({ blockLength = 0, error = EMPTY_STRING, warnings = [], valueBeforeDecode = EMPTY_VIEW, } = {}) {\r\n this.blockLength = blockLength;\r\n this.error = error;\r\n this.warnings = warnings;\r\n this.valueBeforeDecodeView = pvtsutils.BufferSourceConverter.toUint8Array(valueBeforeDecode);\r\n }\r\n static blockName() {\r\n return this.NAME;\r\n }\r\n get valueBeforeDecode() {\r\n return this.valueBeforeDecodeView.slice().buffer;\r\n }\r\n set valueBeforeDecode(value) {\r\n this.valueBeforeDecodeView = new Uint8Array(value);\r\n }\r\n toJSON() {\r\n return {\r\n blockName: this.constructor.NAME,\r\n blockLength: this.blockLength,\r\n error: this.error,\r\n warnings: this.warnings,\r\n valueBeforeDecode: pvtsutils.Convert.ToHex(this.valueBeforeDecodeView),\r\n };\r\n }\r\n}\r\nLocalBaseBlock.NAME = \"baseBlock\";\n\nclass ValueBlock extends LocalBaseBlock {\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n throw TypeError(\"User need to make a specific function in a class which extends 'ValueBlock'\");\r\n }\r\n toBER(sizeOnly, writer) {\r\n throw TypeError(\"User need to make a specific function in a class which extends 'ValueBlock'\");\r\n }\r\n}\r\nValueBlock.NAME = \"valueBlock\";\n\nclass LocalIdentificationBlock extends HexBlock(LocalBaseBlock) {\r\n constructor({ idBlock = {}, } = {}) {\r\n var _a, _b, _c, _d;\r\n super();\r\n if (idBlock) {\r\n this.isHexOnly = (_a = idBlock.isHexOnly) !== null && _a !== void 0 ? _a : false;\r\n this.valueHexView = idBlock.valueHex ? pvtsutils.BufferSourceConverter.toUint8Array(idBlock.valueHex) : EMPTY_VIEW;\r\n this.tagClass = (_b = idBlock.tagClass) !== null && _b !== void 0 ? _b : -1;\r\n this.tagNumber = (_c = idBlock.tagNumber) !== null && _c !== void 0 ? _c : -1;\r\n this.isConstructed = (_d = idBlock.isConstructed) !== null && _d !== void 0 ? _d : false;\r\n }\r\n else {\r\n this.tagClass = -1;\r\n this.tagNumber = -1;\r\n this.isConstructed = false;\r\n }\r\n }\r\n toBER(sizeOnly = false) {\r\n let firstOctet = 0;\r\n switch (this.tagClass) {\r\n case 1:\r\n firstOctet |= 0x00;\r\n break;\r\n case 2:\r\n firstOctet |= 0x40;\r\n break;\r\n case 3:\r\n firstOctet |= 0x80;\r\n break;\r\n case 4:\r\n firstOctet |= 0xC0;\r\n break;\r\n default:\r\n this.error = \"Unknown tag class\";\r\n return EMPTY_BUFFER;\r\n }\r\n if (this.isConstructed)\r\n firstOctet |= 0x20;\r\n if (this.tagNumber < 31 && !this.isHexOnly) {\r\n const retView = new Uint8Array(1);\r\n if (!sizeOnly) {\r\n let number = this.tagNumber;\r\n number &= 0x1F;\r\n firstOctet |= number;\r\n retView[0] = firstOctet;\r\n }\r\n return retView.buffer;\r\n }\r\n if (!this.isHexOnly) {\r\n const encodedBuf = pvutils.utilToBase(this.tagNumber, 7);\r\n const encodedView = new Uint8Array(encodedBuf);\r\n const size = encodedBuf.byteLength;\r\n const retView = new Uint8Array(size + 1);\r\n retView[0] = (firstOctet | 0x1F);\r\n if (!sizeOnly) {\r\n for (let i = 0; i < (size - 1); i++)\r\n retView[i + 1] = encodedView[i] | 0x80;\r\n retView[size] = encodedView[size - 1];\r\n }\r\n return retView.buffer;\r\n }\r\n const retView = new Uint8Array(this.valueHexView.byteLength + 1);\r\n retView[0] = (firstOctet | 0x1F);\r\n if (!sizeOnly) {\r\n const curView = this.valueHexView;\r\n for (let i = 0; i < (curView.length - 1); i++)\r\n retView[i + 1] = curView[i] | 0x80;\r\n retView[this.valueHexView.byteLength] = curView[curView.length - 1];\r\n }\r\n return retView.buffer;\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n const inputView = pvtsutils.BufferSourceConverter.toUint8Array(inputBuffer);\r\n if (!checkBufferParams(this, inputView, inputOffset, inputLength)) {\r\n return -1;\r\n }\r\n const intBuffer = inputView.subarray(inputOffset, inputOffset + inputLength);\r\n if (intBuffer.length === 0) {\r\n this.error = \"Zero buffer length\";\r\n return -1;\r\n }\r\n const tagClassMask = intBuffer[0] & 0xC0;\r\n switch (tagClassMask) {\r\n case 0x00:\r\n this.tagClass = (1);\r\n break;\r\n case 0x40:\r\n this.tagClass = (2);\r\n break;\r\n case 0x80:\r\n this.tagClass = (3);\r\n break;\r\n case 0xC0:\r\n this.tagClass = (4);\r\n break;\r\n default:\r\n this.error = \"Unknown tag class\";\r\n return -1;\r\n }\r\n this.isConstructed = (intBuffer[0] & 0x20) === 0x20;\r\n this.isHexOnly = false;\r\n const tagNumberMask = intBuffer[0] & 0x1F;\r\n if (tagNumberMask !== 0x1F) {\r\n this.tagNumber = (tagNumberMask);\r\n this.blockLength = 1;\r\n }\r\n else {\r\n let count = 1;\r\n let intTagNumberBuffer = this.valueHexView = new Uint8Array(255);\r\n let tagNumberBufferMaxLength = 255;\r\n while (intBuffer[count] & 0x80) {\r\n intTagNumberBuffer[count - 1] = intBuffer[count] & 0x7F;\r\n count++;\r\n if (count >= intBuffer.length) {\r\n this.error = \"End of input reached before message was fully decoded\";\r\n return -1;\r\n }\r\n if (count === tagNumberBufferMaxLength) {\r\n tagNumberBufferMaxLength += 255;\r\n const tempBufferView = new Uint8Array(tagNumberBufferMaxLength);\r\n for (let i = 0; i < intTagNumberBuffer.length; i++)\r\n tempBufferView[i] = intTagNumberBuffer[i];\r\n intTagNumberBuffer = this.valueHexView = new Uint8Array(tagNumberBufferMaxLength);\r\n }\r\n }\r\n this.blockLength = (count + 1);\r\n intTagNumberBuffer[count - 1] = intBuffer[count] & 0x7F;\r\n const tempBufferView = new Uint8Array(count);\r\n for (let i = 0; i < count; i++)\r\n tempBufferView[i] = intTagNumberBuffer[i];\r\n intTagNumberBuffer = this.valueHexView = new Uint8Array(count);\r\n intTagNumberBuffer.set(tempBufferView);\r\n if (this.blockLength <= 9)\r\n this.tagNumber = pvutils.utilFromBase(intTagNumberBuffer, 7);\r\n else {\r\n this.isHexOnly = true;\r\n this.warnings.push(\"Tag too long, represented as hex-coded\");\r\n }\r\n }\r\n if (((this.tagClass === 1)) &&\r\n (this.isConstructed)) {\r\n switch (this.tagNumber) {\r\n case 1:\r\n case 2:\r\n case 5:\r\n case 6:\r\n case 9:\r\n case 13:\r\n case 14:\r\n case 23:\r\n case 24:\r\n case 31:\r\n case 32:\r\n case 33:\r\n case 34:\r\n this.error = \"Constructed encoding used for primitive type\";\r\n return -1;\r\n }\r\n }\r\n return (inputOffset + this.blockLength);\r\n }\r\n toJSON() {\r\n return {\r\n ...super.toJSON(),\r\n tagClass: this.tagClass,\r\n tagNumber: this.tagNumber,\r\n isConstructed: this.isConstructed,\r\n };\r\n }\r\n}\r\nLocalIdentificationBlock.NAME = \"identificationBlock\";\n\nclass LocalLengthBlock extends LocalBaseBlock {\r\n constructor({ lenBlock = {}, } = {}) {\r\n var _a, _b, _c;\r\n super();\r\n this.isIndefiniteForm = (_a = lenBlock.isIndefiniteForm) !== null && _a !== void 0 ? _a : false;\r\n this.longFormUsed = (_b = lenBlock.longFormUsed) !== null && _b !== void 0 ? _b : false;\r\n this.length = (_c = lenBlock.length) !== null && _c !== void 0 ? _c : 0;\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n const view = pvtsutils.BufferSourceConverter.toUint8Array(inputBuffer);\r\n if (!checkBufferParams(this, view, inputOffset, inputLength)) {\r\n return -1;\r\n }\r\n const intBuffer = view.subarray(inputOffset, inputOffset + inputLength);\r\n if (intBuffer.length === 0) {\r\n this.error = \"Zero buffer length\";\r\n return -1;\r\n }\r\n if (intBuffer[0] === 0xFF) {\r\n this.error = \"Length block 0xFF is reserved by standard\";\r\n return -1;\r\n }\r\n this.isIndefiniteForm = intBuffer[0] === 0x80;\r\n if (this.isIndefiniteForm) {\r\n this.blockLength = 1;\r\n return (inputOffset + this.blockLength);\r\n }\r\n this.longFormUsed = !!(intBuffer[0] & 0x80);\r\n if (this.longFormUsed === false) {\r\n this.length = (intBuffer[0]);\r\n this.blockLength = 1;\r\n return (inputOffset + this.blockLength);\r\n }\r\n const count = intBuffer[0] & 0x7F;\r\n if (count > 8) {\r\n this.error = \"Too big integer\";\r\n return -1;\r\n }\r\n if ((count + 1) > intBuffer.length) {\r\n this.error = \"End of input reached before message was fully decoded\";\r\n return -1;\r\n }\r\n const lenOffset = inputOffset + 1;\r\n const lengthBufferView = view.subarray(lenOffset, lenOffset + count);\r\n if (lengthBufferView[count - 1] === 0x00)\r\n this.warnings.push(\"Needlessly long encoded length\");\r\n this.length = pvutils.utilFromBase(lengthBufferView, 8);\r\n if (this.longFormUsed && (this.length <= 127))\r\n this.warnings.push(\"Unnecessary usage of long length form\");\r\n this.blockLength = count + 1;\r\n return (inputOffset + this.blockLength);\r\n }\r\n toBER(sizeOnly = false) {\r\n let retBuf;\r\n let retView;\r\n if (this.length > 127)\r\n this.longFormUsed = true;\r\n if (this.isIndefiniteForm) {\r\n retBuf = new ArrayBuffer(1);\r\n if (sizeOnly === false) {\r\n retView = new Uint8Array(retBuf);\r\n retView[0] = 0x80;\r\n }\r\n return retBuf;\r\n }\r\n if (this.longFormUsed) {\r\n const encodedBuf = pvutils.utilToBase(this.length, 8);\r\n if (encodedBuf.byteLength > 127) {\r\n this.error = \"Too big length\";\r\n return (EMPTY_BUFFER);\r\n }\r\n retBuf = new ArrayBuffer(encodedBuf.byteLength + 1);\r\n if (sizeOnly)\r\n return retBuf;\r\n const encodedView = new Uint8Array(encodedBuf);\r\n retView = new Uint8Array(retBuf);\r\n retView[0] = encodedBuf.byteLength | 0x80;\r\n for (let i = 0; i < encodedBuf.byteLength; i++)\r\n retView[i + 1] = encodedView[i];\r\n return retBuf;\r\n }\r\n retBuf = new ArrayBuffer(1);\r\n if (sizeOnly === false) {\r\n retView = new Uint8Array(retBuf);\r\n retView[0] = this.length;\r\n }\r\n return retBuf;\r\n }\r\n toJSON() {\r\n return {\r\n ...super.toJSON(),\r\n isIndefiniteForm: this.isIndefiniteForm,\r\n longFormUsed: this.longFormUsed,\r\n length: this.length,\r\n };\r\n }\r\n}\r\nLocalLengthBlock.NAME = \"lengthBlock\";\n\nconst typeStore = {};\n\nclass BaseBlock extends LocalBaseBlock {\r\n constructor({ name = EMPTY_STRING, optional = false, primitiveSchema, ...parameters } = {}, valueBlockType) {\r\n super(parameters);\r\n this.name = name;\r\n this.optional = optional;\r\n if (primitiveSchema) {\r\n this.primitiveSchema = primitiveSchema;\r\n }\r\n this.idBlock = new LocalIdentificationBlock(parameters);\r\n this.lenBlock = new LocalLengthBlock(parameters);\r\n this.valueBlock = valueBlockType ? new valueBlockType(parameters) : new ValueBlock(parameters);\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n const resultOffset = this.valueBlock.fromBER(inputBuffer, inputOffset, (this.lenBlock.isIndefiniteForm) ? inputLength : this.lenBlock.length);\r\n if (resultOffset === -1) {\r\n this.error = this.valueBlock.error;\r\n return resultOffset;\r\n }\r\n if (!this.idBlock.error.length)\r\n this.blockLength += this.idBlock.blockLength;\r\n if (!this.lenBlock.error.length)\r\n this.blockLength += this.lenBlock.blockLength;\r\n if (!this.valueBlock.error.length)\r\n this.blockLength += this.valueBlock.blockLength;\r\n return resultOffset;\r\n }\r\n toBER(sizeOnly, writer) {\r\n const _writer = writer || new ViewWriter();\r\n if (!writer) {\r\n prepareIndefiniteForm(this);\r\n }\r\n const idBlockBuf = this.idBlock.toBER(sizeOnly);\r\n _writer.write(idBlockBuf);\r\n if (this.lenBlock.isIndefiniteForm) {\r\n _writer.write(new Uint8Array([0x80]).buffer);\r\n this.valueBlock.toBER(sizeOnly, _writer);\r\n _writer.write(new ArrayBuffer(2));\r\n }\r\n else {\r\n const valueBlockBuf = this.valueBlock.toBER(sizeOnly);\r\n this.lenBlock.length = valueBlockBuf.byteLength;\r\n const lenBlockBuf = this.lenBlock.toBER(sizeOnly);\r\n _writer.write(lenBlockBuf);\r\n _writer.write(valueBlockBuf);\r\n }\r\n if (!writer) {\r\n return _writer.final();\r\n }\r\n return EMPTY_BUFFER;\r\n }\r\n toJSON() {\r\n const object = {\r\n ...super.toJSON(),\r\n idBlock: this.idBlock.toJSON(),\r\n lenBlock: this.lenBlock.toJSON(),\r\n valueBlock: this.valueBlock.toJSON(),\r\n name: this.name,\r\n optional: this.optional,\r\n };\r\n if (this.primitiveSchema)\r\n object.primitiveSchema = this.primitiveSchema.toJSON();\r\n return object;\r\n }\r\n toString(encoding = \"ascii\") {\r\n if (encoding === \"ascii\") {\r\n return this.onAsciiEncoding();\r\n }\r\n return pvtsutils.Convert.ToHex(this.toBER());\r\n }\r\n onAsciiEncoding() {\r\n return `${this.constructor.NAME} : ${pvtsutils.Convert.ToHex(this.valueBlock.valueBeforeDecodeView)}`;\r\n }\r\n isEqual(other) {\r\n if (this === other) {\r\n return true;\r\n }\r\n if (!(other instanceof this.constructor)) {\r\n return false;\r\n }\r\n const thisRaw = this.toBER();\r\n const otherRaw = other.toBER();\r\n return pvutils.isEqualBuffer(thisRaw, otherRaw);\r\n }\r\n}\r\nBaseBlock.NAME = \"BaseBlock\";\r\nfunction prepareIndefiniteForm(baseBlock) {\r\n if (baseBlock instanceof typeStore.Constructed) {\r\n for (const value of baseBlock.valueBlock.value) {\r\n if (prepareIndefiniteForm(value)) {\r\n baseBlock.lenBlock.isIndefiniteForm = true;\r\n }\r\n }\r\n }\r\n return !!baseBlock.lenBlock.isIndefiniteForm;\r\n}\n\nclass BaseStringBlock extends BaseBlock {\r\n constructor({ value = EMPTY_STRING, ...parameters } = {}, stringValueBlockType) {\r\n super(parameters, stringValueBlockType);\r\n if (value) {\r\n this.fromString(value);\r\n }\r\n }\r\n getValue() {\r\n return this.valueBlock.value;\r\n }\r\n setValue(value) {\r\n this.valueBlock.value = value;\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n const resultOffset = this.valueBlock.fromBER(inputBuffer, inputOffset, (this.lenBlock.isIndefiniteForm) ? inputLength : this.lenBlock.length);\r\n if (resultOffset === -1) {\r\n this.error = this.valueBlock.error;\r\n return resultOffset;\r\n }\r\n this.fromBuffer(this.valueBlock.valueHexView);\r\n if (!this.idBlock.error.length)\r\n this.blockLength += this.idBlock.blockLength;\r\n if (!this.lenBlock.error.length)\r\n this.blockLength += this.lenBlock.blockLength;\r\n if (!this.valueBlock.error.length)\r\n this.blockLength += this.valueBlock.blockLength;\r\n return resultOffset;\r\n }\r\n onAsciiEncoding() {\r\n return `${this.constructor.NAME} : '${this.valueBlock.value}'`;\r\n }\r\n}\r\nBaseStringBlock.NAME = \"BaseStringBlock\";\n\nclass LocalPrimitiveValueBlock extends HexBlock(ValueBlock) {\r\n constructor({ isHexOnly = true, ...parameters } = {}) {\r\n super(parameters);\r\n this.isHexOnly = isHexOnly;\r\n }\r\n}\r\nLocalPrimitiveValueBlock.NAME = \"PrimitiveValueBlock\";\n\nvar _a$w;\r\nclass Primitive extends BaseBlock {\r\n constructor(parameters = {}) {\r\n super(parameters, LocalPrimitiveValueBlock);\r\n this.idBlock.isConstructed = false;\r\n }\r\n}\r\n_a$w = Primitive;\r\n(() => {\r\n typeStore.Primitive = _a$w;\r\n})();\r\nPrimitive.NAME = \"PRIMITIVE\";\n\nfunction localChangeType(inputObject, newType) {\r\n if (inputObject instanceof newType) {\r\n return inputObject;\r\n }\r\n const newObject = new newType();\r\n newObject.idBlock = inputObject.idBlock;\r\n newObject.lenBlock = inputObject.lenBlock;\r\n newObject.warnings = inputObject.warnings;\r\n newObject.valueBeforeDecodeView = inputObject.valueBeforeDecodeView;\r\n return newObject;\r\n}\r\nfunction localFromBER(inputBuffer, inputOffset = 0, inputLength = inputBuffer.length) {\r\n const incomingOffset = inputOffset;\r\n let returnObject = new BaseBlock({}, ValueBlock);\r\n const baseBlock = new LocalBaseBlock();\r\n if (!checkBufferParams(baseBlock, inputBuffer, inputOffset, inputLength)) {\r\n returnObject.error = baseBlock.error;\r\n return {\r\n offset: -1,\r\n result: returnObject\r\n };\r\n }\r\n const intBuffer = inputBuffer.subarray(inputOffset, inputOffset + inputLength);\r\n if (!intBuffer.length) {\r\n returnObject.error = \"Zero buffer length\";\r\n return {\r\n offset: -1,\r\n result: returnObject\r\n };\r\n }\r\n let resultOffset = returnObject.idBlock.fromBER(inputBuffer, inputOffset, inputLength);\r\n if (returnObject.idBlock.warnings.length) {\r\n returnObject.warnings.concat(returnObject.idBlock.warnings);\r\n }\r\n if (resultOffset === -1) {\r\n returnObject.error = returnObject.idBlock.error;\r\n return {\r\n offset: -1,\r\n result: returnObject\r\n };\r\n }\r\n inputOffset = resultOffset;\r\n inputLength -= returnObject.idBlock.blockLength;\r\n resultOffset = returnObject.lenBlock.fromBER(inputBuffer, inputOffset, inputLength);\r\n if (returnObject.lenBlock.warnings.length) {\r\n returnObject.warnings.concat(returnObject.lenBlock.warnings);\r\n }\r\n if (resultOffset === -1) {\r\n returnObject.error = returnObject.lenBlock.error;\r\n return {\r\n offset: -1,\r\n result: returnObject\r\n };\r\n }\r\n inputOffset = resultOffset;\r\n inputLength -= returnObject.lenBlock.blockLength;\r\n if (!returnObject.idBlock.isConstructed &&\r\n returnObject.lenBlock.isIndefiniteForm) {\r\n returnObject.error = \"Indefinite length form used for primitive encoding form\";\r\n return {\r\n offset: -1,\r\n result: returnObject\r\n };\r\n }\r\n let newASN1Type = BaseBlock;\r\n switch (returnObject.idBlock.tagClass) {\r\n case 1:\r\n if ((returnObject.idBlock.tagNumber >= 37) &&\r\n (returnObject.idBlock.isHexOnly === false)) {\r\n returnObject.error = \"UNIVERSAL 37 and upper tags are reserved by ASN.1 standard\";\r\n return {\r\n offset: -1,\r\n result: returnObject\r\n };\r\n }\r\n switch (returnObject.idBlock.tagNumber) {\r\n case 0:\r\n if ((returnObject.idBlock.isConstructed) &&\r\n (returnObject.lenBlock.length > 0)) {\r\n returnObject.error = \"Type [UNIVERSAL 0] is reserved\";\r\n return {\r\n offset: -1,\r\n result: returnObject\r\n };\r\n }\r\n newASN1Type = typeStore.EndOfContent;\r\n break;\r\n case 1:\r\n newASN1Type = typeStore.Boolean;\r\n break;\r\n case 2:\r\n newASN1Type = typeStore.Integer;\r\n break;\r\n case 3:\r\n newASN1Type = typeStore.BitString;\r\n break;\r\n case 4:\r\n newASN1Type = typeStore.OctetString;\r\n break;\r\n case 5:\r\n newASN1Type = typeStore.Null;\r\n break;\r\n case 6:\r\n newASN1Type = typeStore.ObjectIdentifier;\r\n break;\r\n case 10:\r\n newASN1Type = typeStore.Enumerated;\r\n break;\r\n case 12:\r\n newASN1Type = typeStore.Utf8String;\r\n break;\r\n case 13:\r\n newASN1Type = typeStore.RelativeObjectIdentifier;\r\n break;\r\n case 14:\r\n newASN1Type = typeStore.TIME;\r\n break;\r\n case 15:\r\n returnObject.error = \"[UNIVERSAL 15] is reserved by ASN.1 standard\";\r\n return {\r\n offset: -1,\r\n result: returnObject\r\n };\r\n case 16:\r\n newASN1Type = typeStore.Sequence;\r\n break;\r\n case 17:\r\n newASN1Type = typeStore.Set;\r\n break;\r\n case 18:\r\n newASN1Type = typeStore.NumericString;\r\n break;\r\n case 19:\r\n newASN1Type = typeStore.PrintableString;\r\n break;\r\n case 20:\r\n newASN1Type = typeStore.TeletexString;\r\n break;\r\n case 21:\r\n newASN1Type = typeStore.VideotexString;\r\n break;\r\n case 22:\r\n newASN1Type = typeStore.IA5String;\r\n break;\r\n case 23:\r\n newASN1Type = typeStore.UTCTime;\r\n break;\r\n case 24:\r\n newASN1Type = typeStore.GeneralizedTime;\r\n break;\r\n case 25:\r\n newASN1Type = typeStore.GraphicString;\r\n break;\r\n case 26:\r\n newASN1Type = typeStore.VisibleString;\r\n break;\r\n case 27:\r\n newASN1Type = typeStore.GeneralString;\r\n break;\r\n case 28:\r\n newASN1Type = typeStore.UniversalString;\r\n break;\r\n case 29:\r\n newASN1Type = typeStore.CharacterString;\r\n break;\r\n case 30:\r\n newASN1Type = typeStore.BmpString;\r\n break;\r\n case 31:\r\n newASN1Type = typeStore.DATE;\r\n break;\r\n case 32:\r\n newASN1Type = typeStore.TimeOfDay;\r\n break;\r\n case 33:\r\n newASN1Type = typeStore.DateTime;\r\n break;\r\n case 34:\r\n newASN1Type = typeStore.Duration;\r\n break;\r\n default: {\r\n const newObject = returnObject.idBlock.isConstructed\r\n ? new typeStore.Constructed()\r\n : new typeStore.Primitive();\r\n newObject.idBlock = returnObject.idBlock;\r\n newObject.lenBlock = returnObject.lenBlock;\r\n newObject.warnings = returnObject.warnings;\r\n returnObject = newObject;\r\n }\r\n }\r\n break;\r\n case 2:\r\n case 3:\r\n case 4:\r\n default: {\r\n newASN1Type = returnObject.idBlock.isConstructed\r\n ? typeStore.Constructed\r\n : typeStore.Primitive;\r\n }\r\n }\r\n returnObject = localChangeType(returnObject, newASN1Type);\r\n resultOffset = returnObject.fromBER(inputBuffer, inputOffset, returnObject.lenBlock.isIndefiniteForm ? inputLength : returnObject.lenBlock.length);\r\n returnObject.valueBeforeDecodeView = inputBuffer.subarray(incomingOffset, incomingOffset + returnObject.blockLength);\r\n return {\r\n offset: resultOffset,\r\n result: returnObject\r\n };\r\n}\r\nfunction fromBER(inputBuffer) {\r\n if (!inputBuffer.byteLength) {\r\n const result = new BaseBlock({}, ValueBlock);\r\n result.error = \"Input buffer has zero length\";\r\n return {\r\n offset: -1,\r\n result\r\n };\r\n }\r\n return localFromBER(pvtsutils.BufferSourceConverter.toUint8Array(inputBuffer).slice(), 0, inputBuffer.byteLength);\r\n}\n\nfunction checkLen(indefiniteLength, length) {\r\n if (indefiniteLength) {\r\n return 1;\r\n }\r\n return length;\r\n}\r\nclass LocalConstructedValueBlock extends ValueBlock {\r\n constructor({ value = [], isIndefiniteForm = false, ...parameters } = {}) {\r\n super(parameters);\r\n this.value = value;\r\n this.isIndefiniteForm = isIndefiniteForm;\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n const view = pvtsutils.BufferSourceConverter.toUint8Array(inputBuffer);\r\n if (!checkBufferParams(this, view, inputOffset, inputLength)) {\r\n return -1;\r\n }\r\n this.valueBeforeDecodeView = view.subarray(inputOffset, inputOffset + inputLength);\r\n if (this.valueBeforeDecodeView.length === 0) {\r\n this.warnings.push(\"Zero buffer length\");\r\n return inputOffset;\r\n }\r\n let currentOffset = inputOffset;\r\n while (checkLen(this.isIndefiniteForm, inputLength) > 0) {\r\n const returnObject = localFromBER(view, currentOffset, inputLength);\r\n if (returnObject.offset === -1) {\r\n this.error = returnObject.result.error;\r\n this.warnings.concat(returnObject.result.warnings);\r\n return -1;\r\n }\r\n currentOffset = returnObject.offset;\r\n this.blockLength += returnObject.result.blockLength;\r\n inputLength -= returnObject.result.blockLength;\r\n this.value.push(returnObject.result);\r\n if (this.isIndefiniteForm && returnObject.result.constructor.NAME === END_OF_CONTENT_NAME) {\r\n break;\r\n }\r\n }\r\n if (this.isIndefiniteForm) {\r\n if (this.value[this.value.length - 1].constructor.NAME === END_OF_CONTENT_NAME) {\r\n this.value.pop();\r\n }\r\n else {\r\n this.warnings.push(\"No EndOfContent block encoded\");\r\n }\r\n }\r\n return currentOffset;\r\n }\r\n toBER(sizeOnly, writer) {\r\n const _writer = writer || new ViewWriter();\r\n for (let i = 0; i < this.value.length; i++) {\r\n this.value[i].toBER(sizeOnly, _writer);\r\n }\r\n if (!writer) {\r\n return _writer.final();\r\n }\r\n return EMPTY_BUFFER;\r\n }\r\n toJSON() {\r\n const object = {\r\n ...super.toJSON(),\r\n isIndefiniteForm: this.isIndefiniteForm,\r\n value: [],\r\n };\r\n for (const value of this.value) {\r\n object.value.push(value.toJSON());\r\n }\r\n return object;\r\n }\r\n}\r\nLocalConstructedValueBlock.NAME = \"ConstructedValueBlock\";\n\nvar _a$v;\r\nclass Constructed extends BaseBlock {\r\n constructor(parameters = {}) {\r\n super(parameters, LocalConstructedValueBlock);\r\n this.idBlock.isConstructed = true;\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n this.valueBlock.isIndefiniteForm = this.lenBlock.isIndefiniteForm;\r\n const resultOffset = this.valueBlock.fromBER(inputBuffer, inputOffset, (this.lenBlock.isIndefiniteForm) ? inputLength : this.lenBlock.length);\r\n if (resultOffset === -1) {\r\n this.error = this.valueBlock.error;\r\n return resultOffset;\r\n }\r\n if (!this.idBlock.error.length)\r\n this.blockLength += this.idBlock.blockLength;\r\n if (!this.lenBlock.error.length)\r\n this.blockLength += this.lenBlock.blockLength;\r\n if (!this.valueBlock.error.length)\r\n this.blockLength += this.valueBlock.blockLength;\r\n return resultOffset;\r\n }\r\n onAsciiEncoding() {\r\n const values = [];\r\n for (const value of this.valueBlock.value) {\r\n values.push(value.toString(\"ascii\").split(\"\\n\").map(o => ` ${o}`).join(\"\\n\"));\r\n }\r\n const blockName = this.idBlock.tagClass === 3\r\n ? `[${this.idBlock.tagNumber}]`\r\n : this.constructor.NAME;\r\n return values.length\r\n ? `${blockName} :\\n${values.join(\"\\n\")}`\r\n : `${blockName} :`;\r\n }\r\n}\r\n_a$v = Constructed;\r\n(() => {\r\n typeStore.Constructed = _a$v;\r\n})();\r\nConstructed.NAME = \"CONSTRUCTED\";\n\nclass LocalEndOfContentValueBlock extends ValueBlock {\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n return inputOffset;\r\n }\r\n toBER(sizeOnly) {\r\n return EMPTY_BUFFER;\r\n }\r\n}\r\nLocalEndOfContentValueBlock.override = \"EndOfContentValueBlock\";\n\nvar _a$u;\r\nclass EndOfContent extends BaseBlock {\r\n constructor(parameters = {}) {\r\n super(parameters, LocalEndOfContentValueBlock);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 0;\r\n }\r\n}\r\n_a$u = EndOfContent;\r\n(() => {\r\n typeStore.EndOfContent = _a$u;\r\n})();\r\nEndOfContent.NAME = END_OF_CONTENT_NAME;\n\nvar _a$t;\r\nclass Null extends BaseBlock {\r\n constructor(parameters = {}) {\r\n super(parameters, ValueBlock);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 5;\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n if (this.lenBlock.length > 0)\r\n this.warnings.push(\"Non-zero length of value block for Null type\");\r\n if (!this.idBlock.error.length)\r\n this.blockLength += this.idBlock.blockLength;\r\n if (!this.lenBlock.error.length)\r\n this.blockLength += this.lenBlock.blockLength;\r\n this.blockLength += inputLength;\r\n if ((inputOffset + inputLength) > inputBuffer.byteLength) {\r\n this.error = \"End of input reached before message was fully decoded (inconsistent offset and length values)\";\r\n return -1;\r\n }\r\n return (inputOffset + inputLength);\r\n }\r\n toBER(sizeOnly, writer) {\r\n const retBuf = new ArrayBuffer(2);\r\n if (!sizeOnly) {\r\n const retView = new Uint8Array(retBuf);\r\n retView[0] = 0x05;\r\n retView[1] = 0x00;\r\n }\r\n if (writer) {\r\n writer.write(retBuf);\r\n }\r\n return retBuf;\r\n }\r\n onAsciiEncoding() {\r\n return `${this.constructor.NAME}`;\r\n }\r\n}\r\n_a$t = Null;\r\n(() => {\r\n typeStore.Null = _a$t;\r\n})();\r\nNull.NAME = \"NULL\";\n\nclass LocalBooleanValueBlock extends HexBlock(ValueBlock) {\r\n constructor({ value, ...parameters } = {}) {\r\n super(parameters);\r\n if (parameters.valueHex) {\r\n this.valueHexView = pvtsutils.BufferSourceConverter.toUint8Array(parameters.valueHex);\r\n }\r\n else {\r\n this.valueHexView = new Uint8Array(1);\r\n }\r\n if (value) {\r\n this.value = value;\r\n }\r\n }\r\n get value() {\r\n for (const octet of this.valueHexView) {\r\n if (octet > 0) {\r\n return true;\r\n }\r\n }\r\n return false;\r\n }\r\n set value(value) {\r\n this.valueHexView[0] = value ? 0xFF : 0x00;\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n const inputView = pvtsutils.BufferSourceConverter.toUint8Array(inputBuffer);\r\n if (!checkBufferParams(this, inputView, inputOffset, inputLength)) {\r\n return -1;\r\n }\r\n this.valueHexView = inputView.subarray(inputOffset, inputOffset + inputLength);\r\n if (inputLength > 1)\r\n this.warnings.push(\"Boolean value encoded in more then 1 octet\");\r\n this.isHexOnly = true;\r\n pvutils.utilDecodeTC.call(this);\r\n this.blockLength = inputLength;\r\n return (inputOffset + inputLength);\r\n }\r\n toBER() {\r\n return this.valueHexView.slice();\r\n }\r\n toJSON() {\r\n return {\r\n ...super.toJSON(),\r\n value: this.value,\r\n };\r\n }\r\n}\r\nLocalBooleanValueBlock.NAME = \"BooleanValueBlock\";\n\nvar _a$s;\r\nclass Boolean extends BaseBlock {\r\n constructor(parameters = {}) {\r\n super(parameters, LocalBooleanValueBlock);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 1;\r\n }\r\n getValue() {\r\n return this.valueBlock.value;\r\n }\r\n setValue(value) {\r\n this.valueBlock.value = value;\r\n }\r\n onAsciiEncoding() {\r\n return `${this.constructor.NAME} : ${this.getValue}`;\r\n }\r\n}\r\n_a$s = Boolean;\r\n(() => {\r\n typeStore.Boolean = _a$s;\r\n})();\r\nBoolean.NAME = \"BOOLEAN\";\n\nclass LocalOctetStringValueBlock extends HexBlock(LocalConstructedValueBlock) {\r\n constructor({ isConstructed = false, ...parameters } = {}) {\r\n super(parameters);\r\n this.isConstructed = isConstructed;\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n let resultOffset = 0;\r\n if (this.isConstructed) {\r\n this.isHexOnly = false;\r\n resultOffset = LocalConstructedValueBlock.prototype.fromBER.call(this, inputBuffer, inputOffset, inputLength);\r\n if (resultOffset === -1)\r\n return resultOffset;\r\n for (let i = 0; i < this.value.length; i++) {\r\n const currentBlockName = this.value[i].constructor.NAME;\r\n if (currentBlockName === END_OF_CONTENT_NAME) {\r\n if (this.isIndefiniteForm)\r\n break;\r\n else {\r\n this.error = \"EndOfContent is unexpected, OCTET STRING may consists of OCTET STRINGs only\";\r\n return -1;\r\n }\r\n }\r\n if (currentBlockName !== OCTET_STRING_NAME) {\r\n this.error = \"OCTET STRING may consists of OCTET STRINGs only\";\r\n return -1;\r\n }\r\n }\r\n }\r\n else {\r\n this.isHexOnly = true;\r\n resultOffset = super.fromBER(inputBuffer, inputOffset, inputLength);\r\n this.blockLength = inputLength;\r\n }\r\n return resultOffset;\r\n }\r\n toBER(sizeOnly, writer) {\r\n if (this.isConstructed)\r\n return LocalConstructedValueBlock.prototype.toBER.call(this, sizeOnly, writer);\r\n return sizeOnly\r\n ? new ArrayBuffer(this.valueHexView.byteLength)\r\n : this.valueHexView.slice().buffer;\r\n }\r\n toJSON() {\r\n return {\r\n ...super.toJSON(),\r\n isConstructed: this.isConstructed,\r\n };\r\n }\r\n}\r\nLocalOctetStringValueBlock.NAME = \"OctetStringValueBlock\";\n\nvar _a$r;\r\nclass OctetString extends BaseBlock {\r\n constructor({ idBlock = {}, lenBlock = {}, ...parameters } = {}) {\r\n var _b, _c;\r\n (_b = parameters.isConstructed) !== null && _b !== void 0 ? _b : (parameters.isConstructed = !!((_c = parameters.value) === null || _c === void 0 ? void 0 : _c.length));\r\n super({\r\n idBlock: {\r\n isConstructed: parameters.isConstructed,\r\n ...idBlock,\r\n },\r\n lenBlock: {\r\n ...lenBlock,\r\n isIndefiniteForm: !!parameters.isIndefiniteForm,\r\n },\r\n ...parameters,\r\n }, LocalOctetStringValueBlock);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 4;\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n this.valueBlock.isConstructed = this.idBlock.isConstructed;\r\n this.valueBlock.isIndefiniteForm = this.lenBlock.isIndefiniteForm;\r\n if (inputLength === 0) {\r\n if (this.idBlock.error.length === 0)\r\n this.blockLength += this.idBlock.blockLength;\r\n if (this.lenBlock.error.length === 0)\r\n this.blockLength += this.lenBlock.blockLength;\r\n return inputOffset;\r\n }\r\n if (!this.valueBlock.isConstructed) {\r\n const view = inputBuffer instanceof ArrayBuffer ? new Uint8Array(inputBuffer) : inputBuffer;\r\n const buf = view.subarray(inputOffset, inputOffset + inputLength);\r\n try {\r\n if (buf.byteLength) {\r\n const asn = localFromBER(buf, 0, buf.byteLength);\r\n if (asn.offset !== -1 && asn.offset === inputLength) {\r\n this.valueBlock.value = [asn.result];\r\n }\r\n }\r\n }\r\n catch (e) {\r\n }\r\n }\r\n return super.fromBER(inputBuffer, inputOffset, inputLength);\r\n }\r\n onAsciiEncoding() {\r\n if (this.valueBlock.isConstructed || (this.valueBlock.value && this.valueBlock.value.length)) {\r\n return Constructed.prototype.onAsciiEncoding.call(this);\r\n }\r\n return `${this.constructor.NAME} : ${pvtsutils.Convert.ToHex(this.valueBlock.valueHexView)}`;\r\n }\r\n getValue() {\r\n if (!this.idBlock.isConstructed) {\r\n return this.valueBlock.valueHexView.slice().buffer;\r\n }\r\n const array = [];\r\n for (const content of this.valueBlock.value) {\r\n if (content instanceof OctetString) {\r\n array.push(content.valueBlock.valueHexView);\r\n }\r\n }\r\n return pvtsutils.BufferSourceConverter.concat(array);\r\n }\r\n}\r\n_a$r = OctetString;\r\n(() => {\r\n typeStore.OctetString = _a$r;\r\n})();\r\nOctetString.NAME = OCTET_STRING_NAME;\n\nclass LocalBitStringValueBlock extends HexBlock(LocalConstructedValueBlock) {\r\n constructor({ unusedBits = 0, isConstructed = false, ...parameters } = {}) {\r\n super(parameters);\r\n this.unusedBits = unusedBits;\r\n this.isConstructed = isConstructed;\r\n this.blockLength = this.valueHexView.byteLength;\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n if (!inputLength) {\r\n return inputOffset;\r\n }\r\n let resultOffset = -1;\r\n if (this.isConstructed) {\r\n resultOffset = LocalConstructedValueBlock.prototype.fromBER.call(this, inputBuffer, inputOffset, inputLength);\r\n if (resultOffset === -1)\r\n return resultOffset;\r\n for (const value of this.value) {\r\n const currentBlockName = value.constructor.NAME;\r\n if (currentBlockName === END_OF_CONTENT_NAME) {\r\n if (this.isIndefiniteForm)\r\n break;\r\n else {\r\n this.error = \"EndOfContent is unexpected, BIT STRING may consists of BIT STRINGs only\";\r\n return -1;\r\n }\r\n }\r\n if (currentBlockName !== BIT_STRING_NAME) {\r\n this.error = \"BIT STRING may consists of BIT STRINGs only\";\r\n return -1;\r\n }\r\n const valueBlock = value.valueBlock;\r\n if ((this.unusedBits > 0) && (valueBlock.unusedBits > 0)) {\r\n this.error = \"Using of \\\"unused bits\\\" inside constructive BIT STRING allowed for least one only\";\r\n return -1;\r\n }\r\n this.unusedBits = valueBlock.unusedBits;\r\n }\r\n return resultOffset;\r\n }\r\n const inputView = pvtsutils.BufferSourceConverter.toUint8Array(inputBuffer);\r\n if (!checkBufferParams(this, inputView, inputOffset, inputLength)) {\r\n return -1;\r\n }\r\n const intBuffer = inputView.subarray(inputOffset, inputOffset + inputLength);\r\n this.unusedBits = intBuffer[0];\r\n if (this.unusedBits > 7) {\r\n this.error = \"Unused bits for BitString must be in range 0-7\";\r\n return -1;\r\n }\r\n if (!this.unusedBits) {\r\n const buf = intBuffer.subarray(1);\r\n try {\r\n if (buf.byteLength) {\r\n const asn = localFromBER(buf, 0, buf.byteLength);\r\n if (asn.offset !== -1 && asn.offset === (inputLength - 1)) {\r\n this.value = [asn.result];\r\n }\r\n }\r\n }\r\n catch (e) {\r\n }\r\n }\r\n this.valueHexView = intBuffer.subarray(1);\r\n this.blockLength = intBuffer.length;\r\n return (inputOffset + inputLength);\r\n }\r\n toBER(sizeOnly, writer) {\r\n if (this.isConstructed) {\r\n return LocalConstructedValueBlock.prototype.toBER.call(this, sizeOnly, writer);\r\n }\r\n if (sizeOnly) {\r\n return new ArrayBuffer(this.valueHexView.byteLength + 1);\r\n }\r\n if (!this.valueHexView.byteLength) {\r\n return EMPTY_BUFFER;\r\n }\r\n const retView = new Uint8Array(this.valueHexView.length + 1);\r\n retView[0] = this.unusedBits;\r\n retView.set(this.valueHexView, 1);\r\n return retView.buffer;\r\n }\r\n toJSON() {\r\n return {\r\n ...super.toJSON(),\r\n unusedBits: this.unusedBits,\r\n isConstructed: this.isConstructed,\r\n };\r\n }\r\n}\r\nLocalBitStringValueBlock.NAME = \"BitStringValueBlock\";\n\nvar _a$q;\r\nclass BitString extends BaseBlock {\r\n constructor({ idBlock = {}, lenBlock = {}, ...parameters } = {}) {\r\n var _b, _c;\r\n (_b = parameters.isConstructed) !== null && _b !== void 0 ? _b : (parameters.isConstructed = !!((_c = parameters.value) === null || _c === void 0 ? void 0 : _c.length));\r\n super({\r\n idBlock: {\r\n isConstructed: parameters.isConstructed,\r\n ...idBlock,\r\n },\r\n lenBlock: {\r\n ...lenBlock,\r\n isIndefiniteForm: !!parameters.isIndefiniteForm,\r\n },\r\n ...parameters,\r\n }, LocalBitStringValueBlock);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 3;\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n this.valueBlock.isConstructed = this.idBlock.isConstructed;\r\n this.valueBlock.isIndefiniteForm = this.lenBlock.isIndefiniteForm;\r\n return super.fromBER(inputBuffer, inputOffset, inputLength);\r\n }\r\n onAsciiEncoding() {\r\n if (this.valueBlock.isConstructed || (this.valueBlock.value && this.valueBlock.value.length)) {\r\n return Constructed.prototype.onAsciiEncoding.call(this);\r\n }\r\n else {\r\n const bits = [];\r\n const valueHex = this.valueBlock.valueHexView;\r\n for (const byte of valueHex) {\r\n bits.push(byte.toString(2).padStart(8, \"0\"));\r\n }\r\n const bitsStr = bits.join(\"\");\r\n return `${this.constructor.NAME} : ${bitsStr.substring(0, bitsStr.length - this.valueBlock.unusedBits)}`;\r\n }\r\n }\r\n}\r\n_a$q = BitString;\r\n(() => {\r\n typeStore.BitString = _a$q;\r\n})();\r\nBitString.NAME = BIT_STRING_NAME;\n\nvar _a$p;\r\nfunction viewAdd(first, second) {\r\n const c = new Uint8Array([0]);\r\n const firstView = new Uint8Array(first);\r\n const secondView = new Uint8Array(second);\r\n let firstViewCopy = firstView.slice(0);\r\n const firstViewCopyLength = firstViewCopy.length - 1;\r\n const secondViewCopy = secondView.slice(0);\r\n const secondViewCopyLength = secondViewCopy.length - 1;\r\n let value = 0;\r\n const max = (secondViewCopyLength < firstViewCopyLength) ? firstViewCopyLength : secondViewCopyLength;\r\n let counter = 0;\r\n for (let i = max; i >= 0; i--, counter++) {\r\n switch (true) {\r\n case (counter < secondViewCopy.length):\r\n value = firstViewCopy[firstViewCopyLength - counter] + secondViewCopy[secondViewCopyLength - counter] + c[0];\r\n break;\r\n default:\r\n value = firstViewCopy[firstViewCopyLength - counter] + c[0];\r\n }\r\n c[0] = value / 10;\r\n switch (true) {\r\n case (counter >= firstViewCopy.length):\r\n firstViewCopy = pvutils.utilConcatView(new Uint8Array([value % 10]), firstViewCopy);\r\n break;\r\n default:\r\n firstViewCopy[firstViewCopyLength - counter] = value % 10;\r\n }\r\n }\r\n if (c[0] > 0)\r\n firstViewCopy = pvutils.utilConcatView(c, firstViewCopy);\r\n return firstViewCopy;\r\n}\r\nfunction power2(n) {\r\n if (n >= powers2.length) {\r\n for (let p = powers2.length; p <= n; p++) {\r\n const c = new Uint8Array([0]);\r\n let digits = (powers2[p - 1]).slice(0);\r\n for (let i = (digits.length - 1); i >= 0; i--) {\r\n const newValue = new Uint8Array([(digits[i] << 1) + c[0]]);\r\n c[0] = newValue[0] / 10;\r\n digits[i] = newValue[0] % 10;\r\n }\r\n if (c[0] > 0)\r\n digits = pvutils.utilConcatView(c, digits);\r\n powers2.push(digits);\r\n }\r\n }\r\n return powers2[n];\r\n}\r\nfunction viewSub(first, second) {\r\n let b = 0;\r\n const firstView = new Uint8Array(first);\r\n const secondView = new Uint8Array(second);\r\n const firstViewCopy = firstView.slice(0);\r\n const firstViewCopyLength = firstViewCopy.length - 1;\r\n const secondViewCopy = secondView.slice(0);\r\n const secondViewCopyLength = secondViewCopy.length - 1;\r\n let value;\r\n let counter = 0;\r\n for (let i = secondViewCopyLength; i >= 0; i--, counter++) {\r\n value = firstViewCopy[firstViewCopyLength - counter] - secondViewCopy[secondViewCopyLength - counter] - b;\r\n switch (true) {\r\n case (value < 0):\r\n b = 1;\r\n firstViewCopy[firstViewCopyLength - counter] = value + 10;\r\n break;\r\n default:\r\n b = 0;\r\n firstViewCopy[firstViewCopyLength - counter] = value;\r\n }\r\n }\r\n if (b > 0) {\r\n for (let i = (firstViewCopyLength - secondViewCopyLength + 1); i >= 0; i--, counter++) {\r\n value = firstViewCopy[firstViewCopyLength - counter] - b;\r\n if (value < 0) {\r\n b = 1;\r\n firstViewCopy[firstViewCopyLength - counter] = value + 10;\r\n }\r\n else {\r\n b = 0;\r\n firstViewCopy[firstViewCopyLength - counter] = value;\r\n break;\r\n }\r\n }\r\n }\r\n return firstViewCopy.slice();\r\n}\r\nclass LocalIntegerValueBlock extends HexBlock(ValueBlock) {\r\n constructor({ value, ...parameters } = {}) {\r\n super(parameters);\r\n this._valueDec = 0;\r\n if (parameters.valueHex) {\r\n this.setValueHex();\r\n }\r\n if (value !== undefined) {\r\n this.valueDec = value;\r\n }\r\n }\r\n setValueHex() {\r\n if (this.valueHexView.length >= 4) {\r\n this.warnings.push(\"Too big Integer for decoding, hex only\");\r\n this.isHexOnly = true;\r\n this._valueDec = 0;\r\n }\r\n else {\r\n this.isHexOnly = false;\r\n if (this.valueHexView.length > 0) {\r\n this._valueDec = pvutils.utilDecodeTC.call(this);\r\n }\r\n }\r\n }\r\n set valueDec(v) {\r\n this._valueDec = v;\r\n this.isHexOnly = false;\r\n this.valueHexView = new Uint8Array(pvutils.utilEncodeTC(v));\r\n }\r\n get valueDec() {\r\n return this._valueDec;\r\n }\r\n fromDER(inputBuffer, inputOffset, inputLength, expectedLength = 0) {\r\n const offset = this.fromBER(inputBuffer, inputOffset, inputLength);\r\n if (offset === -1)\r\n return offset;\r\n const view = this.valueHexView;\r\n if ((view[0] === 0x00) && ((view[1] & 0x80) !== 0)) {\r\n this.valueHexView = view.subarray(1);\r\n }\r\n else {\r\n if (expectedLength !== 0) {\r\n if (view.length < expectedLength) {\r\n if ((expectedLength - view.length) > 1)\r\n expectedLength = view.length + 1;\r\n this.valueHexView = view.subarray(expectedLength - view.length);\r\n }\r\n }\r\n }\r\n return offset;\r\n }\r\n toDER(sizeOnly = false) {\r\n const view = this.valueHexView;\r\n switch (true) {\r\n case ((view[0] & 0x80) !== 0):\r\n {\r\n const updatedView = new Uint8Array(this.valueHexView.length + 1);\r\n updatedView[0] = 0x00;\r\n updatedView.set(view, 1);\r\n this.valueHexView = updatedView;\r\n }\r\n break;\r\n case ((view[0] === 0x00) && ((view[1] & 0x80) === 0)):\r\n {\r\n this.valueHexView = this.valueHexView.subarray(1);\r\n }\r\n break;\r\n }\r\n return this.toBER(sizeOnly);\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n const resultOffset = super.fromBER(inputBuffer, inputOffset, inputLength);\r\n if (resultOffset === -1) {\r\n return resultOffset;\r\n }\r\n this.setValueHex();\r\n return resultOffset;\r\n }\r\n toBER(sizeOnly) {\r\n return sizeOnly\r\n ? new ArrayBuffer(this.valueHexView.length)\r\n : this.valueHexView.slice().buffer;\r\n }\r\n toJSON() {\r\n return {\r\n ...super.toJSON(),\r\n valueDec: this.valueDec,\r\n };\r\n }\r\n toString() {\r\n const firstBit = (this.valueHexView.length * 8) - 1;\r\n let digits = new Uint8Array((this.valueHexView.length * 8) / 3);\r\n let bitNumber = 0;\r\n let currentByte;\r\n const asn1View = this.valueHexView;\r\n let result = \"\";\r\n let flag = false;\r\n for (let byteNumber = (asn1View.byteLength - 1); byteNumber >= 0; byteNumber--) {\r\n currentByte = asn1View[byteNumber];\r\n for (let i = 0; i < 8; i++) {\r\n if ((currentByte & 1) === 1) {\r\n switch (bitNumber) {\r\n case firstBit:\r\n digits = viewSub(power2(bitNumber), digits);\r\n result = \"-\";\r\n break;\r\n default:\r\n digits = viewAdd(digits, power2(bitNumber));\r\n }\r\n }\r\n bitNumber++;\r\n currentByte >>= 1;\r\n }\r\n }\r\n for (let i = 0; i < digits.length; i++) {\r\n if (digits[i])\r\n flag = true;\r\n if (flag)\r\n result += digitsString.charAt(digits[i]);\r\n }\r\n if (flag === false)\r\n result += digitsString.charAt(0);\r\n return result;\r\n }\r\n}\r\n_a$p = LocalIntegerValueBlock;\r\nLocalIntegerValueBlock.NAME = \"IntegerValueBlock\";\r\n(() => {\r\n Object.defineProperty(_a$p.prototype, \"valueHex\", {\r\n set: function (v) {\r\n this.valueHexView = new Uint8Array(v);\r\n this.setValueHex();\r\n },\r\n get: function () {\r\n return this.valueHexView.slice().buffer;\r\n },\r\n });\r\n})();\n\nvar _a$o;\r\nclass Integer extends BaseBlock {\r\n constructor(parameters = {}) {\r\n super(parameters, LocalIntegerValueBlock);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 2;\r\n }\r\n toBigInt() {\r\n assertBigInt();\r\n return BigInt(this.valueBlock.toString());\r\n }\r\n static fromBigInt(value) {\r\n assertBigInt();\r\n const bigIntValue = BigInt(value);\r\n const writer = new ViewWriter();\r\n const hex = bigIntValue.toString(16).replace(/^-/, \"\");\r\n const view = new Uint8Array(pvtsutils.Convert.FromHex(hex));\r\n if (bigIntValue < 0) {\r\n const first = new Uint8Array(view.length + (view[0] & 0x80 ? 1 : 0));\r\n first[0] |= 0x80;\r\n const firstInt = BigInt(`0x${pvtsutils.Convert.ToHex(first)}`);\r\n const secondInt = firstInt + bigIntValue;\r\n const second = pvtsutils.BufferSourceConverter.toUint8Array(pvtsutils.Convert.FromHex(secondInt.toString(16)));\r\n second[0] |= 0x80;\r\n writer.write(second);\r\n }\r\n else {\r\n if (view[0] & 0x80) {\r\n writer.write(new Uint8Array([0]));\r\n }\r\n writer.write(view);\r\n }\r\n const res = new Integer({\r\n valueHex: writer.final(),\r\n });\r\n return res;\r\n }\r\n convertToDER() {\r\n const integer = new Integer({ valueHex: this.valueBlock.valueHexView });\r\n integer.valueBlock.toDER();\r\n return integer;\r\n }\r\n convertFromDER() {\r\n return new Integer({\r\n valueHex: this.valueBlock.valueHexView[0] === 0\r\n ? this.valueBlock.valueHexView.subarray(1)\r\n : this.valueBlock.valueHexView,\r\n });\r\n }\r\n onAsciiEncoding() {\r\n return `${this.constructor.NAME} : ${this.valueBlock.toString()}`;\r\n }\r\n}\r\n_a$o = Integer;\r\n(() => {\r\n typeStore.Integer = _a$o;\r\n})();\r\nInteger.NAME = \"INTEGER\";\n\nvar _a$n;\r\nclass Enumerated extends Integer {\r\n constructor(parameters = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 10;\r\n }\r\n}\r\n_a$n = Enumerated;\r\n(() => {\r\n typeStore.Enumerated = _a$n;\r\n})();\r\nEnumerated.NAME = \"ENUMERATED\";\n\nclass LocalSidValueBlock extends HexBlock(ValueBlock) {\r\n constructor({ valueDec = -1, isFirstSid = false, ...parameters } = {}) {\r\n super(parameters);\r\n this.valueDec = valueDec;\r\n this.isFirstSid = isFirstSid;\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n if (!inputLength) {\r\n return inputOffset;\r\n }\r\n const inputView = pvtsutils.BufferSourceConverter.toUint8Array(inputBuffer);\r\n if (!checkBufferParams(this, inputView, inputOffset, inputLength)) {\r\n return -1;\r\n }\r\n const intBuffer = inputView.subarray(inputOffset, inputOffset + inputLength);\r\n this.valueHexView = new Uint8Array(inputLength);\r\n for (let i = 0; i < inputLength; i++) {\r\n this.valueHexView[i] = intBuffer[i] & 0x7F;\r\n this.blockLength++;\r\n if ((intBuffer[i] & 0x80) === 0x00)\r\n break;\r\n }\r\n const tempView = new Uint8Array(this.blockLength);\r\n for (let i = 0; i < this.blockLength; i++) {\r\n tempView[i] = this.valueHexView[i];\r\n }\r\n this.valueHexView = tempView;\r\n if ((intBuffer[this.blockLength - 1] & 0x80) !== 0x00) {\r\n this.error = \"End of input reached before message was fully decoded\";\r\n return -1;\r\n }\r\n if (this.valueHexView[0] === 0x00)\r\n this.warnings.push(\"Needlessly long format of SID encoding\");\r\n if (this.blockLength <= 8)\r\n this.valueDec = pvutils.utilFromBase(this.valueHexView, 7);\r\n else {\r\n this.isHexOnly = true;\r\n this.warnings.push(\"Too big SID for decoding, hex only\");\r\n }\r\n return (inputOffset + this.blockLength);\r\n }\r\n set valueBigInt(value) {\r\n assertBigInt();\r\n let bits = BigInt(value).toString(2);\r\n while (bits.length % 7) {\r\n bits = \"0\" + bits;\r\n }\r\n const bytes = new Uint8Array(bits.length / 7);\r\n for (let i = 0; i < bytes.length; i++) {\r\n bytes[i] = parseInt(bits.slice(i * 7, i * 7 + 7), 2) + (i + 1 < bytes.length ? 0x80 : 0);\r\n }\r\n this.fromBER(bytes.buffer, 0, bytes.length);\r\n }\r\n toBER(sizeOnly) {\r\n if (this.isHexOnly) {\r\n if (sizeOnly)\r\n return (new ArrayBuffer(this.valueHexView.byteLength));\r\n const curView = this.valueHexView;\r\n const retView = new Uint8Array(this.blockLength);\r\n for (let i = 0; i < (this.blockLength - 1); i++)\r\n retView[i] = curView[i] | 0x80;\r\n retView[this.blockLength - 1] = curView[this.blockLength - 1];\r\n return retView.buffer;\r\n }\r\n const encodedBuf = pvutils.utilToBase(this.valueDec, 7);\r\n if (encodedBuf.byteLength === 0) {\r\n this.error = \"Error during encoding SID value\";\r\n return EMPTY_BUFFER;\r\n }\r\n const retView = new Uint8Array(encodedBuf.byteLength);\r\n if (!sizeOnly) {\r\n const encodedView = new Uint8Array(encodedBuf);\r\n const len = encodedBuf.byteLength - 1;\r\n for (let i = 0; i < len; i++)\r\n retView[i] = encodedView[i] | 0x80;\r\n retView[len] = encodedView[len];\r\n }\r\n return retView;\r\n }\r\n toString() {\r\n let result = \"\";\r\n if (this.isHexOnly)\r\n result = pvtsutils.Convert.ToHex(this.valueHexView);\r\n else {\r\n if (this.isFirstSid) {\r\n let sidValue = this.valueDec;\r\n if (this.valueDec <= 39)\r\n result = \"0.\";\r\n else {\r\n if (this.valueDec <= 79) {\r\n result = \"1.\";\r\n sidValue -= 40;\r\n }\r\n else {\r\n result = \"2.\";\r\n sidValue -= 80;\r\n }\r\n }\r\n result += sidValue.toString();\r\n }\r\n else\r\n result = this.valueDec.toString();\r\n }\r\n return result;\r\n }\r\n toJSON() {\r\n return {\r\n ...super.toJSON(),\r\n valueDec: this.valueDec,\r\n isFirstSid: this.isFirstSid,\r\n };\r\n }\r\n}\r\nLocalSidValueBlock.NAME = \"sidBlock\";\n\nclass LocalObjectIdentifierValueBlock extends ValueBlock {\r\n constructor({ value = EMPTY_STRING, ...parameters } = {}) {\r\n super(parameters);\r\n this.value = [];\r\n if (value) {\r\n this.fromString(value);\r\n }\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n let resultOffset = inputOffset;\r\n while (inputLength > 0) {\r\n const sidBlock = new LocalSidValueBlock();\r\n resultOffset = sidBlock.fromBER(inputBuffer, resultOffset, inputLength);\r\n if (resultOffset === -1) {\r\n this.blockLength = 0;\r\n this.error = sidBlock.error;\r\n return resultOffset;\r\n }\r\n if (this.value.length === 0)\r\n sidBlock.isFirstSid = true;\r\n this.blockLength += sidBlock.blockLength;\r\n inputLength -= sidBlock.blockLength;\r\n this.value.push(sidBlock);\r\n }\r\n return resultOffset;\r\n }\r\n toBER(sizeOnly) {\r\n const retBuffers = [];\r\n for (let i = 0; i < this.value.length; i++) {\r\n const valueBuf = this.value[i].toBER(sizeOnly);\r\n if (valueBuf.byteLength === 0) {\r\n this.error = this.value[i].error;\r\n return EMPTY_BUFFER;\r\n }\r\n retBuffers.push(valueBuf);\r\n }\r\n return concat(retBuffers);\r\n }\r\n fromString(string) {\r\n this.value = [];\r\n let pos1 = 0;\r\n let pos2 = 0;\r\n let sid = \"\";\r\n let flag = false;\r\n do {\r\n pos2 = string.indexOf(\".\", pos1);\r\n if (pos2 === -1)\r\n sid = string.substring(pos1);\r\n else\r\n sid = string.substring(pos1, pos2);\r\n pos1 = pos2 + 1;\r\n if (flag) {\r\n const sidBlock = this.value[0];\r\n let plus = 0;\r\n switch (sidBlock.valueDec) {\r\n case 0:\r\n break;\r\n case 1:\r\n plus = 40;\r\n break;\r\n case 2:\r\n plus = 80;\r\n break;\r\n default:\r\n this.value = [];\r\n return;\r\n }\r\n const parsedSID = parseInt(sid, 10);\r\n if (isNaN(parsedSID))\r\n return;\r\n sidBlock.valueDec = parsedSID + plus;\r\n flag = false;\r\n }\r\n else {\r\n const sidBlock = new LocalSidValueBlock();\r\n if (sid > Number.MAX_SAFE_INTEGER) {\r\n assertBigInt();\r\n const sidValue = BigInt(sid);\r\n sidBlock.valueBigInt = sidValue;\r\n }\r\n else {\r\n sidBlock.valueDec = parseInt(sid, 10);\r\n if (isNaN(sidBlock.valueDec))\r\n return;\r\n }\r\n if (!this.value.length) {\r\n sidBlock.isFirstSid = true;\r\n flag = true;\r\n }\r\n this.value.push(sidBlock);\r\n }\r\n } while (pos2 !== -1);\r\n }\r\n toString() {\r\n let result = \"\";\r\n let isHexOnly = false;\r\n for (let i = 0; i < this.value.length; i++) {\r\n isHexOnly = this.value[i].isHexOnly;\r\n let sidStr = this.value[i].toString();\r\n if (i !== 0)\r\n result = `${result}.`;\r\n if (isHexOnly) {\r\n sidStr = `{${sidStr}}`;\r\n if (this.value[i].isFirstSid)\r\n result = `2.{${sidStr} - 80}`;\r\n else\r\n result += sidStr;\r\n }\r\n else\r\n result += sidStr;\r\n }\r\n return result;\r\n }\r\n toJSON() {\r\n const object = {\r\n ...super.toJSON(),\r\n value: this.toString(),\r\n sidArray: [],\r\n };\r\n for (let i = 0; i < this.value.length; i++) {\r\n object.sidArray.push(this.value[i].toJSON());\r\n }\r\n return object;\r\n }\r\n}\r\nLocalObjectIdentifierValueBlock.NAME = \"ObjectIdentifierValueBlock\";\n\nvar _a$m;\r\nclass ObjectIdentifier extends BaseBlock {\r\n constructor(parameters = {}) {\r\n super(parameters, LocalObjectIdentifierValueBlock);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 6;\r\n }\r\n getValue() {\r\n return this.valueBlock.toString();\r\n }\r\n setValue(value) {\r\n this.valueBlock.fromString(value);\r\n }\r\n onAsciiEncoding() {\r\n return `${this.constructor.NAME} : ${this.valueBlock.toString() || \"empty\"}`;\r\n }\r\n toJSON() {\r\n return {\r\n ...super.toJSON(),\r\n value: this.getValue(),\r\n };\r\n }\r\n}\r\n_a$m = ObjectIdentifier;\r\n(() => {\r\n typeStore.ObjectIdentifier = _a$m;\r\n})();\r\nObjectIdentifier.NAME = \"OBJECT IDENTIFIER\";\n\nclass LocalRelativeSidValueBlock extends HexBlock(LocalBaseBlock) {\r\n constructor({ valueDec = 0, ...parameters } = {}) {\r\n super(parameters);\r\n this.valueDec = valueDec;\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n if (inputLength === 0)\r\n return inputOffset;\r\n const inputView = pvtsutils.BufferSourceConverter.toUint8Array(inputBuffer);\r\n if (!checkBufferParams(this, inputView, inputOffset, inputLength))\r\n return -1;\r\n const intBuffer = inputView.subarray(inputOffset, inputOffset + inputLength);\r\n this.valueHexView = new Uint8Array(inputLength);\r\n for (let i = 0; i < inputLength; i++) {\r\n this.valueHexView[i] = intBuffer[i] & 0x7F;\r\n this.blockLength++;\r\n if ((intBuffer[i] & 0x80) === 0x00)\r\n break;\r\n }\r\n const tempView = new Uint8Array(this.blockLength);\r\n for (let i = 0; i < this.blockLength; i++)\r\n tempView[i] = this.valueHexView[i];\r\n this.valueHexView = tempView;\r\n if ((intBuffer[this.blockLength - 1] & 0x80) !== 0x00) {\r\n this.error = \"End of input reached before message was fully decoded\";\r\n return -1;\r\n }\r\n if (this.valueHexView[0] === 0x00)\r\n this.warnings.push(\"Needlessly long format of SID encoding\");\r\n if (this.blockLength <= 8)\r\n this.valueDec = pvutils.utilFromBase(this.valueHexView, 7);\r\n else {\r\n this.isHexOnly = true;\r\n this.warnings.push(\"Too big SID for decoding, hex only\");\r\n }\r\n return (inputOffset + this.blockLength);\r\n }\r\n toBER(sizeOnly) {\r\n if (this.isHexOnly) {\r\n if (sizeOnly)\r\n return (new ArrayBuffer(this.valueHexView.byteLength));\r\n const curView = this.valueHexView;\r\n const retView = new Uint8Array(this.blockLength);\r\n for (let i = 0; i < (this.blockLength - 1); i++)\r\n retView[i] = curView[i] | 0x80;\r\n retView[this.blockLength - 1] = curView[this.blockLength - 1];\r\n return retView.buffer;\r\n }\r\n const encodedBuf = pvutils.utilToBase(this.valueDec, 7);\r\n if (encodedBuf.byteLength === 0) {\r\n this.error = \"Error during encoding SID value\";\r\n return EMPTY_BUFFER;\r\n }\r\n const retView = new Uint8Array(encodedBuf.byteLength);\r\n if (!sizeOnly) {\r\n const encodedView = new Uint8Array(encodedBuf);\r\n const len = encodedBuf.byteLength - 1;\r\n for (let i = 0; i < len; i++)\r\n retView[i] = encodedView[i] | 0x80;\r\n retView[len] = encodedView[len];\r\n }\r\n return retView.buffer;\r\n }\r\n toString() {\r\n let result = \"\";\r\n if (this.isHexOnly)\r\n result = pvtsutils.Convert.ToHex(this.valueHexView);\r\n else {\r\n result = this.valueDec.toString();\r\n }\r\n return result;\r\n }\r\n toJSON() {\r\n return {\r\n ...super.toJSON(),\r\n valueDec: this.valueDec,\r\n };\r\n }\r\n}\r\nLocalRelativeSidValueBlock.NAME = \"relativeSidBlock\";\n\nclass LocalRelativeObjectIdentifierValueBlock extends ValueBlock {\r\n constructor({ value = EMPTY_STRING, ...parameters } = {}) {\r\n super(parameters);\r\n this.value = [];\r\n if (value) {\r\n this.fromString(value);\r\n }\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n let resultOffset = inputOffset;\r\n while (inputLength > 0) {\r\n const sidBlock = new LocalRelativeSidValueBlock();\r\n resultOffset = sidBlock.fromBER(inputBuffer, resultOffset, inputLength);\r\n if (resultOffset === -1) {\r\n this.blockLength = 0;\r\n this.error = sidBlock.error;\r\n return resultOffset;\r\n }\r\n this.blockLength += sidBlock.blockLength;\r\n inputLength -= sidBlock.blockLength;\r\n this.value.push(sidBlock);\r\n }\r\n return resultOffset;\r\n }\r\n toBER(sizeOnly, writer) {\r\n const retBuffers = [];\r\n for (let i = 0; i < this.value.length; i++) {\r\n const valueBuf = this.value[i].toBER(sizeOnly);\r\n if (valueBuf.byteLength === 0) {\r\n this.error = this.value[i].error;\r\n return EMPTY_BUFFER;\r\n }\r\n retBuffers.push(valueBuf);\r\n }\r\n return concat(retBuffers);\r\n }\r\n fromString(string) {\r\n this.value = [];\r\n let pos1 = 0;\r\n let pos2 = 0;\r\n let sid = \"\";\r\n do {\r\n pos2 = string.indexOf(\".\", pos1);\r\n if (pos2 === -1)\r\n sid = string.substring(pos1);\r\n else\r\n sid = string.substring(pos1, pos2);\r\n pos1 = pos2 + 1;\r\n const sidBlock = new LocalRelativeSidValueBlock();\r\n sidBlock.valueDec = parseInt(sid, 10);\r\n if (isNaN(sidBlock.valueDec))\r\n return true;\r\n this.value.push(sidBlock);\r\n } while (pos2 !== -1);\r\n return true;\r\n }\r\n toString() {\r\n let result = \"\";\r\n let isHexOnly = false;\r\n for (let i = 0; i < this.value.length; i++) {\r\n isHexOnly = this.value[i].isHexOnly;\r\n let sidStr = this.value[i].toString();\r\n if (i !== 0)\r\n result = `${result}.`;\r\n if (isHexOnly) {\r\n sidStr = `{${sidStr}}`;\r\n result += sidStr;\r\n }\r\n else\r\n result += sidStr;\r\n }\r\n return result;\r\n }\r\n toJSON() {\r\n const object = {\r\n ...super.toJSON(),\r\n value: this.toString(),\r\n sidArray: [],\r\n };\r\n for (let i = 0; i < this.value.length; i++)\r\n object.sidArray.push(this.value[i].toJSON());\r\n return object;\r\n }\r\n}\r\nLocalRelativeObjectIdentifierValueBlock.NAME = \"RelativeObjectIdentifierValueBlock\";\n\nvar _a$l;\r\nclass RelativeObjectIdentifier extends BaseBlock {\r\n constructor(parameters = {}) {\r\n super(parameters, LocalRelativeObjectIdentifierValueBlock);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 13;\r\n }\r\n getValue() {\r\n return this.valueBlock.toString();\r\n }\r\n setValue(value) {\r\n this.valueBlock.fromString(value);\r\n }\r\n onAsciiEncoding() {\r\n return `${this.constructor.NAME} : ${this.valueBlock.toString() || \"empty\"}`;\r\n }\r\n toJSON() {\r\n return {\r\n ...super.toJSON(),\r\n value: this.getValue(),\r\n };\r\n }\r\n}\r\n_a$l = RelativeObjectIdentifier;\r\n(() => {\r\n typeStore.RelativeObjectIdentifier = _a$l;\r\n})();\r\nRelativeObjectIdentifier.NAME = \"RelativeObjectIdentifier\";\n\nvar _a$k;\r\nclass Sequence extends Constructed {\r\n constructor(parameters = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 16;\r\n }\r\n}\r\n_a$k = Sequence;\r\n(() => {\r\n typeStore.Sequence = _a$k;\r\n})();\r\nSequence.NAME = \"SEQUENCE\";\n\nvar _a$j;\r\nclass Set extends Constructed {\r\n constructor(parameters = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 17;\r\n }\r\n}\r\n_a$j = Set;\r\n(() => {\r\n typeStore.Set = _a$j;\r\n})();\r\nSet.NAME = \"SET\";\n\nclass LocalStringValueBlock extends HexBlock(ValueBlock) {\r\n constructor({ ...parameters } = {}) {\r\n super(parameters);\r\n this.isHexOnly = true;\r\n this.value = EMPTY_STRING;\r\n }\r\n toJSON() {\r\n return {\r\n ...super.toJSON(),\r\n value: this.value,\r\n };\r\n }\r\n}\r\nLocalStringValueBlock.NAME = \"StringValueBlock\";\n\nclass LocalSimpleStringValueBlock extends LocalStringValueBlock {\r\n}\r\nLocalSimpleStringValueBlock.NAME = \"SimpleStringValueBlock\";\n\nclass LocalSimpleStringBlock extends BaseStringBlock {\r\n constructor({ ...parameters } = {}) {\r\n super(parameters, LocalSimpleStringValueBlock);\r\n }\r\n fromBuffer(inputBuffer) {\r\n this.valueBlock.value = String.fromCharCode.apply(null, pvtsutils.BufferSourceConverter.toUint8Array(inputBuffer));\r\n }\r\n fromString(inputString) {\r\n const strLen = inputString.length;\r\n const view = this.valueBlock.valueHexView = new Uint8Array(strLen);\r\n for (let i = 0; i < strLen; i++)\r\n view[i] = inputString.charCodeAt(i);\r\n this.valueBlock.value = inputString;\r\n }\r\n}\r\nLocalSimpleStringBlock.NAME = \"SIMPLE STRING\";\n\nclass LocalUtf8StringValueBlock extends LocalSimpleStringBlock {\r\n fromBuffer(inputBuffer) {\r\n this.valueBlock.valueHexView = pvtsutils.BufferSourceConverter.toUint8Array(inputBuffer);\r\n try {\r\n this.valueBlock.value = pvtsutils.Convert.ToUtf8String(inputBuffer);\r\n }\r\n catch (ex) {\r\n this.warnings.push(`Error during \"decodeURIComponent\": ${ex}, using raw string`);\r\n this.valueBlock.value = pvtsutils.Convert.ToBinary(inputBuffer);\r\n }\r\n }\r\n fromString(inputString) {\r\n this.valueBlock.valueHexView = new Uint8Array(pvtsutils.Convert.FromUtf8String(inputString));\r\n this.valueBlock.value = inputString;\r\n }\r\n}\r\nLocalUtf8StringValueBlock.NAME = \"Utf8StringValueBlock\";\n\nvar _a$i;\r\nclass Utf8String extends LocalUtf8StringValueBlock {\r\n constructor(parameters = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 12;\r\n }\r\n}\r\n_a$i = Utf8String;\r\n(() => {\r\n typeStore.Utf8String = _a$i;\r\n})();\r\nUtf8String.NAME = \"UTF8String\";\n\nclass LocalBmpStringValueBlock extends LocalSimpleStringBlock {\r\n fromBuffer(inputBuffer) {\r\n this.valueBlock.value = pvtsutils.Convert.ToUtf16String(inputBuffer);\r\n this.valueBlock.valueHexView = pvtsutils.BufferSourceConverter.toUint8Array(inputBuffer);\r\n }\r\n fromString(inputString) {\r\n this.valueBlock.value = inputString;\r\n this.valueBlock.valueHexView = new Uint8Array(pvtsutils.Convert.FromUtf16String(inputString));\r\n }\r\n}\r\nLocalBmpStringValueBlock.NAME = \"BmpStringValueBlock\";\n\nvar _a$h;\r\nclass BmpString extends LocalBmpStringValueBlock {\r\n constructor({ ...parameters } = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 30;\r\n }\r\n}\r\n_a$h = BmpString;\r\n(() => {\r\n typeStore.BmpString = _a$h;\r\n})();\r\nBmpString.NAME = \"BMPString\";\n\nclass LocalUniversalStringValueBlock extends LocalSimpleStringBlock {\r\n fromBuffer(inputBuffer) {\r\n const copyBuffer = ArrayBuffer.isView(inputBuffer) ? inputBuffer.slice().buffer : inputBuffer.slice(0);\r\n const valueView = new Uint8Array(copyBuffer);\r\n for (let i = 0; i < valueView.length; i += 4) {\r\n valueView[i] = valueView[i + 3];\r\n valueView[i + 1] = valueView[i + 2];\r\n valueView[i + 2] = 0x00;\r\n valueView[i + 3] = 0x00;\r\n }\r\n this.valueBlock.value = String.fromCharCode.apply(null, new Uint32Array(copyBuffer));\r\n }\r\n fromString(inputString) {\r\n const strLength = inputString.length;\r\n const valueHexView = this.valueBlock.valueHexView = new Uint8Array(strLength * 4);\r\n for (let i = 0; i < strLength; i++) {\r\n const codeBuf = pvutils.utilToBase(inputString.charCodeAt(i), 8);\r\n const codeView = new Uint8Array(codeBuf);\r\n if (codeView.length > 4)\r\n continue;\r\n const dif = 4 - codeView.length;\r\n for (let j = (codeView.length - 1); j >= 0; j--)\r\n valueHexView[i * 4 + j + dif] = codeView[j];\r\n }\r\n this.valueBlock.value = inputString;\r\n }\r\n}\r\nLocalUniversalStringValueBlock.NAME = \"UniversalStringValueBlock\";\n\nvar _a$g;\r\nclass UniversalString extends LocalUniversalStringValueBlock {\r\n constructor({ ...parameters } = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 28;\r\n }\r\n}\r\n_a$g = UniversalString;\r\n(() => {\r\n typeStore.UniversalString = _a$g;\r\n})();\r\nUniversalString.NAME = \"UniversalString\";\n\nvar _a$f;\r\nclass NumericString extends LocalSimpleStringBlock {\r\n constructor(parameters = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 18;\r\n }\r\n}\r\n_a$f = NumericString;\r\n(() => {\r\n typeStore.NumericString = _a$f;\r\n})();\r\nNumericString.NAME = \"NumericString\";\n\nvar _a$e;\r\nclass PrintableString extends LocalSimpleStringBlock {\r\n constructor(parameters = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 19;\r\n }\r\n}\r\n_a$e = PrintableString;\r\n(() => {\r\n typeStore.PrintableString = _a$e;\r\n})();\r\nPrintableString.NAME = \"PrintableString\";\n\nvar _a$d;\r\nclass TeletexString extends LocalSimpleStringBlock {\r\n constructor(parameters = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 20;\r\n }\r\n}\r\n_a$d = TeletexString;\r\n(() => {\r\n typeStore.TeletexString = _a$d;\r\n})();\r\nTeletexString.NAME = \"TeletexString\";\n\nvar _a$c;\r\nclass VideotexString extends LocalSimpleStringBlock {\r\n constructor(parameters = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 21;\r\n }\r\n}\r\n_a$c = VideotexString;\r\n(() => {\r\n typeStore.VideotexString = _a$c;\r\n})();\r\nVideotexString.NAME = \"VideotexString\";\n\nvar _a$b;\r\nclass IA5String extends LocalSimpleStringBlock {\r\n constructor(parameters = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 22;\r\n }\r\n}\r\n_a$b = IA5String;\r\n(() => {\r\n typeStore.IA5String = _a$b;\r\n})();\r\nIA5String.NAME = \"IA5String\";\n\nvar _a$a;\r\nclass GraphicString extends LocalSimpleStringBlock {\r\n constructor(parameters = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 25;\r\n }\r\n}\r\n_a$a = GraphicString;\r\n(() => {\r\n typeStore.GraphicString = _a$a;\r\n})();\r\nGraphicString.NAME = \"GraphicString\";\n\nvar _a$9;\r\nclass VisibleString extends LocalSimpleStringBlock {\r\n constructor(parameters = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 26;\r\n }\r\n}\r\n_a$9 = VisibleString;\r\n(() => {\r\n typeStore.VisibleString = _a$9;\r\n})();\r\nVisibleString.NAME = \"VisibleString\";\n\nvar _a$8;\r\nclass GeneralString extends LocalSimpleStringBlock {\r\n constructor(parameters = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 27;\r\n }\r\n}\r\n_a$8 = GeneralString;\r\n(() => {\r\n typeStore.GeneralString = _a$8;\r\n})();\r\nGeneralString.NAME = \"GeneralString\";\n\nvar _a$7;\r\nclass CharacterString extends LocalSimpleStringBlock {\r\n constructor(parameters = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 29;\r\n }\r\n}\r\n_a$7 = CharacterString;\r\n(() => {\r\n typeStore.CharacterString = _a$7;\r\n})();\r\nCharacterString.NAME = \"CharacterString\";\n\nvar _a$6;\r\nclass UTCTime extends VisibleString {\r\n constructor({ value, valueDate, ...parameters } = {}) {\r\n super(parameters);\r\n this.year = 0;\r\n this.month = 0;\r\n this.day = 0;\r\n this.hour = 0;\r\n this.minute = 0;\r\n this.second = 0;\r\n if (value) {\r\n this.fromString(value);\r\n this.valueBlock.valueHexView = new Uint8Array(value.length);\r\n for (let i = 0; i < value.length; i++)\r\n this.valueBlock.valueHexView[i] = value.charCodeAt(i);\r\n }\r\n if (valueDate) {\r\n this.fromDate(valueDate);\r\n this.valueBlock.valueHexView = new Uint8Array(this.toBuffer());\r\n }\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 23;\r\n }\r\n fromBuffer(inputBuffer) {\r\n this.fromString(String.fromCharCode.apply(null, pvtsutils.BufferSourceConverter.toUint8Array(inputBuffer)));\r\n }\r\n toBuffer() {\r\n const str = this.toString();\r\n const buffer = new ArrayBuffer(str.length);\r\n const view = new Uint8Array(buffer);\r\n for (let i = 0; i < str.length; i++)\r\n view[i] = str.charCodeAt(i);\r\n return buffer;\r\n }\r\n fromDate(inputDate) {\r\n this.year = inputDate.getUTCFullYear();\r\n this.month = inputDate.getUTCMonth() + 1;\r\n this.day = inputDate.getUTCDate();\r\n this.hour = inputDate.getUTCHours();\r\n this.minute = inputDate.getUTCMinutes();\r\n this.second = inputDate.getUTCSeconds();\r\n }\r\n toDate() {\r\n return (new Date(Date.UTC(this.year, this.month - 1, this.day, this.hour, this.minute, this.second)));\r\n }\r\n fromString(inputString) {\r\n const parser = /(\\d{2})(\\d{2})(\\d{2})(\\d{2})(\\d{2})(\\d{2})Z/ig;\r\n const parserArray = parser.exec(inputString);\r\n if (parserArray === null) {\r\n this.error = \"Wrong input string for conversion\";\r\n return;\r\n }\r\n const year = parseInt(parserArray[1], 10);\r\n if (year >= 50)\r\n this.year = 1900 + year;\r\n else\r\n this.year = 2000 + year;\r\n this.month = parseInt(parserArray[2], 10);\r\n this.day = parseInt(parserArray[3], 10);\r\n this.hour = parseInt(parserArray[4], 10);\r\n this.minute = parseInt(parserArray[5], 10);\r\n this.second = parseInt(parserArray[6], 10);\r\n }\r\n toString(encoding = \"iso\") {\r\n if (encoding === \"iso\") {\r\n const outputArray = new Array(7);\r\n outputArray[0] = pvutils.padNumber(((this.year < 2000) ? (this.year - 1900) : (this.year - 2000)), 2);\r\n outputArray[1] = pvutils.padNumber(this.month, 2);\r\n outputArray[2] = pvutils.padNumber(this.day, 2);\r\n outputArray[3] = pvutils.padNumber(this.hour, 2);\r\n outputArray[4] = pvutils.padNumber(this.minute, 2);\r\n outputArray[5] = pvutils.padNumber(this.second, 2);\r\n outputArray[6] = \"Z\";\r\n return outputArray.join(\"\");\r\n }\r\n return super.toString(encoding);\r\n }\r\n onAsciiEncoding() {\r\n return `${this.constructor.NAME} : ${this.toDate().toISOString()}`;\r\n }\r\n toJSON() {\r\n return {\r\n ...super.toJSON(),\r\n year: this.year,\r\n month: this.month,\r\n day: this.day,\r\n hour: this.hour,\r\n minute: this.minute,\r\n second: this.second,\r\n };\r\n }\r\n}\r\n_a$6 = UTCTime;\r\n(() => {\r\n typeStore.UTCTime = _a$6;\r\n})();\r\nUTCTime.NAME = \"UTCTime\";\n\nvar _a$5;\r\nclass GeneralizedTime extends UTCTime {\r\n constructor(parameters = {}) {\r\n var _b;\r\n super(parameters);\r\n (_b = this.millisecond) !== null && _b !== void 0 ? _b : (this.millisecond = 0);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 24;\r\n }\r\n fromDate(inputDate) {\r\n super.fromDate(inputDate);\r\n this.millisecond = inputDate.getUTCMilliseconds();\r\n }\r\n toDate() {\r\n return (new Date(Date.UTC(this.year, this.month - 1, this.day, this.hour, this.minute, this.second, this.millisecond)));\r\n }\r\n fromString(inputString) {\r\n let isUTC = false;\r\n let timeString = \"\";\r\n let dateTimeString = \"\";\r\n let fractionPart = 0;\r\n let parser;\r\n let hourDifference = 0;\r\n let minuteDifference = 0;\r\n if (inputString[inputString.length - 1] === \"Z\") {\r\n timeString = inputString.substring(0, inputString.length - 1);\r\n isUTC = true;\r\n }\r\n else {\r\n const number = new Number(inputString[inputString.length - 1]);\r\n if (isNaN(number.valueOf()))\r\n throw new Error(\"Wrong input string for conversion\");\r\n timeString = inputString;\r\n }\r\n if (isUTC) {\r\n if (timeString.indexOf(\"+\") !== -1)\r\n throw new Error(\"Wrong input string for conversion\");\r\n if (timeString.indexOf(\"-\") !== -1)\r\n throw new Error(\"Wrong input string for conversion\");\r\n }\r\n else {\r\n let multiplier = 1;\r\n let differencePosition = timeString.indexOf(\"+\");\r\n let differenceString = \"\";\r\n if (differencePosition === -1) {\r\n differencePosition = timeString.indexOf(\"-\");\r\n multiplier = -1;\r\n }\r\n if (differencePosition !== -1) {\r\n differenceString = timeString.substring(differencePosition + 1);\r\n timeString = timeString.substring(0, differencePosition);\r\n if ((differenceString.length !== 2) && (differenceString.length !== 4))\r\n throw new Error(\"Wrong input string for conversion\");\r\n let number = parseInt(differenceString.substring(0, 2), 10);\r\n if (isNaN(number.valueOf()))\r\n throw new Error(\"Wrong input string for conversion\");\r\n hourDifference = multiplier * number;\r\n if (differenceString.length === 4) {\r\n number = parseInt(differenceString.substring(2, 4), 10);\r\n if (isNaN(number.valueOf()))\r\n throw new Error(\"Wrong input string for conversion\");\r\n minuteDifference = multiplier * number;\r\n }\r\n }\r\n }\r\n let fractionPointPosition = timeString.indexOf(\".\");\r\n if (fractionPointPosition === -1)\r\n fractionPointPosition = timeString.indexOf(\",\");\r\n if (fractionPointPosition !== -1) {\r\n const fractionPartCheck = new Number(`0${timeString.substring(fractionPointPosition)}`);\r\n if (isNaN(fractionPartCheck.valueOf()))\r\n throw new Error(\"Wrong input string for conversion\");\r\n fractionPart = fractionPartCheck.valueOf();\r\n dateTimeString = timeString.substring(0, fractionPointPosition);\r\n }\r\n else\r\n dateTimeString = timeString;\r\n switch (true) {\r\n case (dateTimeString.length === 8):\r\n parser = /(\\d{4})(\\d{2})(\\d{2})/ig;\r\n if (fractionPointPosition !== -1)\r\n throw new Error(\"Wrong input string for conversion\");\r\n break;\r\n case (dateTimeString.length === 10):\r\n parser = /(\\d{4})(\\d{2})(\\d{2})(\\d{2})/ig;\r\n if (fractionPointPosition !== -1) {\r\n let fractionResult = 60 * fractionPart;\r\n this.minute = Math.floor(fractionResult);\r\n fractionResult = 60 * (fractionResult - this.minute);\r\n this.second = Math.floor(fractionResult);\r\n fractionResult = 1000 * (fractionResult - this.second);\r\n this.millisecond = Math.floor(fractionResult);\r\n }\r\n break;\r\n case (dateTimeString.length === 12):\r\n parser = /(\\d{4})(\\d{2})(\\d{2})(\\d{2})(\\d{2})/ig;\r\n if (fractionPointPosition !== -1) {\r\n let fractionResult = 60 * fractionPart;\r\n this.second = Math.floor(fractionResult);\r\n fractionResult = 1000 * (fractionResult - this.second);\r\n this.millisecond = Math.floor(fractionResult);\r\n }\r\n break;\r\n case (dateTimeString.length === 14):\r\n parser = /(\\d{4})(\\d{2})(\\d{2})(\\d{2})(\\d{2})(\\d{2})/ig;\r\n if (fractionPointPosition !== -1) {\r\n const fractionResult = 1000 * fractionPart;\r\n this.millisecond = Math.floor(fractionResult);\r\n }\r\n break;\r\n default:\r\n throw new Error(\"Wrong input string for conversion\");\r\n }\r\n const parserArray = parser.exec(dateTimeString);\r\n if (parserArray === null)\r\n throw new Error(\"Wrong input string for conversion\");\r\n for (let j = 1; j < parserArray.length; j++) {\r\n switch (j) {\r\n case 1:\r\n this.year = parseInt(parserArray[j], 10);\r\n break;\r\n case 2:\r\n this.month = parseInt(parserArray[j], 10);\r\n break;\r\n case 3:\r\n this.day = parseInt(parserArray[j], 10);\r\n break;\r\n case 4:\r\n this.hour = parseInt(parserArray[j], 10) + hourDifference;\r\n break;\r\n case 5:\r\n this.minute = parseInt(parserArray[j], 10) + minuteDifference;\r\n break;\r\n case 6:\r\n this.second = parseInt(parserArray[j], 10);\r\n break;\r\n default:\r\n throw new Error(\"Wrong input string for conversion\");\r\n }\r\n }\r\n if (isUTC === false) {\r\n const tempDate = new Date(this.year, this.month, this.day, this.hour, this.minute, this.second, this.millisecond);\r\n this.year = tempDate.getUTCFullYear();\r\n this.month = tempDate.getUTCMonth();\r\n this.day = tempDate.getUTCDay();\r\n this.hour = tempDate.getUTCHours();\r\n this.minute = tempDate.getUTCMinutes();\r\n this.second = tempDate.getUTCSeconds();\r\n this.millisecond = tempDate.getUTCMilliseconds();\r\n }\r\n }\r\n toString(encoding = \"iso\") {\r\n if (encoding === \"iso\") {\r\n const outputArray = [];\r\n outputArray.push(pvutils.padNumber(this.year, 4));\r\n outputArray.push(pvutils.padNumber(this.month, 2));\r\n outputArray.push(pvutils.padNumber(this.day, 2));\r\n outputArray.push(pvutils.padNumber(this.hour, 2));\r\n outputArray.push(pvutils.padNumber(this.minute, 2));\r\n outputArray.push(pvutils.padNumber(this.second, 2));\r\n if (this.millisecond !== 0) {\r\n outputArray.push(\".\");\r\n outputArray.push(pvutils.padNumber(this.millisecond, 3));\r\n }\r\n outputArray.push(\"Z\");\r\n return outputArray.join(\"\");\r\n }\r\n return super.toString(encoding);\r\n }\r\n toJSON() {\r\n return {\r\n ...super.toJSON(),\r\n millisecond: this.millisecond,\r\n };\r\n }\r\n}\r\n_a$5 = GeneralizedTime;\r\n(() => {\r\n typeStore.GeneralizedTime = _a$5;\r\n})();\r\nGeneralizedTime.NAME = \"GeneralizedTime\";\n\nvar _a$4;\r\nclass DATE extends Utf8String {\r\n constructor(parameters = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 31;\r\n }\r\n}\r\n_a$4 = DATE;\r\n(() => {\r\n typeStore.DATE = _a$4;\r\n})();\r\nDATE.NAME = \"DATE\";\n\nvar _a$3;\r\nclass TimeOfDay extends Utf8String {\r\n constructor(parameters = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 32;\r\n }\r\n}\r\n_a$3 = TimeOfDay;\r\n(() => {\r\n typeStore.TimeOfDay = _a$3;\r\n})();\r\nTimeOfDay.NAME = \"TimeOfDay\";\n\nvar _a$2;\r\nclass DateTime extends Utf8String {\r\n constructor(parameters = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 33;\r\n }\r\n}\r\n_a$2 = DateTime;\r\n(() => {\r\n typeStore.DateTime = _a$2;\r\n})();\r\nDateTime.NAME = \"DateTime\";\n\nvar _a$1;\r\nclass Duration extends Utf8String {\r\n constructor(parameters = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 34;\r\n }\r\n}\r\n_a$1 = Duration;\r\n(() => {\r\n typeStore.Duration = _a$1;\r\n})();\r\nDuration.NAME = \"Duration\";\n\nvar _a;\r\nclass TIME extends Utf8String {\r\n constructor(parameters = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 14;\r\n }\r\n}\r\n_a = TIME;\r\n(() => {\r\n typeStore.TIME = _a;\r\n})();\r\nTIME.NAME = \"TIME\";\n\nclass Any {\r\n constructor({ name = EMPTY_STRING, optional = false, } = {}) {\r\n this.name = name;\r\n this.optional = optional;\r\n }\r\n}\n\nclass Choice extends Any {\r\n constructor({ value = [], ...parameters } = {}) {\r\n super(parameters);\r\n this.value = value;\r\n }\r\n}\n\nclass Repeated extends Any {\r\n constructor({ value = new Any(), local = false, ...parameters } = {}) {\r\n super(parameters);\r\n this.value = value;\r\n this.local = local;\r\n }\r\n}\n\nclass RawData {\r\n constructor({ data = EMPTY_VIEW } = {}) {\r\n this.dataView = pvtsutils.BufferSourceConverter.toUint8Array(data);\r\n }\r\n get data() {\r\n return this.dataView.slice().buffer;\r\n }\r\n set data(value) {\r\n this.dataView = pvtsutils.BufferSourceConverter.toUint8Array(value);\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n const endLength = inputOffset + inputLength;\r\n this.dataView = pvtsutils.BufferSourceConverter.toUint8Array(inputBuffer).subarray(inputOffset, endLength);\r\n return endLength;\r\n }\r\n toBER(sizeOnly) {\r\n return this.dataView.slice().buffer;\r\n }\r\n}\n\nfunction compareSchema(root, inputData, inputSchema) {\r\n if (inputSchema instanceof Choice) {\r\n for (let j = 0; j < inputSchema.value.length; j++) {\r\n const result = compareSchema(root, inputData, inputSchema.value[j]);\r\n if (result.verified) {\r\n return {\r\n verified: true,\r\n result: root\r\n };\r\n }\r\n }\r\n {\r\n const _result = {\r\n verified: false,\r\n result: {\r\n error: \"Wrong values for Choice type\"\r\n },\r\n };\r\n if (inputSchema.hasOwnProperty(NAME))\r\n _result.name = inputSchema.name;\r\n return _result;\r\n }\r\n }\r\n if (inputSchema instanceof Any) {\r\n if (inputSchema.hasOwnProperty(NAME))\r\n root[inputSchema.name] = inputData;\r\n return {\r\n verified: true,\r\n result: root\r\n };\r\n }\r\n if ((root instanceof Object) === false) {\r\n return {\r\n verified: false,\r\n result: { error: \"Wrong root object\" }\r\n };\r\n }\r\n if ((inputData instanceof Object) === false) {\r\n return {\r\n verified: false,\r\n result: { error: \"Wrong ASN.1 data\" }\r\n };\r\n }\r\n if ((inputSchema instanceof Object) === false) {\r\n return {\r\n verified: false,\r\n result: { error: \"Wrong ASN.1 schema\" }\r\n };\r\n }\r\n if ((ID_BLOCK in inputSchema) === false) {\r\n return {\r\n verified: false,\r\n result: { error: \"Wrong ASN.1 schema\" }\r\n };\r\n }\r\n if ((FROM_BER in inputSchema.idBlock) === false) {\r\n return {\r\n verified: false,\r\n result: { error: \"Wrong ASN.1 schema\" }\r\n };\r\n }\r\n if ((TO_BER in inputSchema.idBlock) === false) {\r\n return {\r\n verified: false,\r\n result: { error: \"Wrong ASN.1 schema\" }\r\n };\r\n }\r\n const encodedId = inputSchema.idBlock.toBER(false);\r\n if (encodedId.byteLength === 0) {\r\n return {\r\n verified: false,\r\n result: { error: \"Error encoding idBlock for ASN.1 schema\" }\r\n };\r\n }\r\n const decodedOffset = inputSchema.idBlock.fromBER(encodedId, 0, encodedId.byteLength);\r\n if (decodedOffset === -1) {\r\n return {\r\n verified: false,\r\n result: { error: \"Error decoding idBlock for ASN.1 schema\" }\r\n };\r\n }\r\n if (inputSchema.idBlock.hasOwnProperty(TAG_CLASS) === false) {\r\n return {\r\n verified: false,\r\n result: { error: \"Wrong ASN.1 schema\" }\r\n };\r\n }\r\n if (inputSchema.idBlock.tagClass !== inputData.idBlock.tagClass) {\r\n return {\r\n verified: false,\r\n result: root\r\n };\r\n }\r\n if (inputSchema.idBlock.hasOwnProperty(TAG_NUMBER) === false) {\r\n return {\r\n verified: false,\r\n result: { error: \"Wrong ASN.1 schema\" }\r\n };\r\n }\r\n if (inputSchema.idBlock.tagNumber !== inputData.idBlock.tagNumber) {\r\n return {\r\n verified: false,\r\n result: root\r\n };\r\n }\r\n if (inputSchema.idBlock.hasOwnProperty(IS_CONSTRUCTED) === false) {\r\n return {\r\n verified: false,\r\n result: { error: \"Wrong ASN.1 schema\" }\r\n };\r\n }\r\n if (inputSchema.idBlock.isConstructed !== inputData.idBlock.isConstructed) {\r\n return {\r\n verified: false,\r\n result: root\r\n };\r\n }\r\n if (!(IS_HEX_ONLY in inputSchema.idBlock)) {\r\n return {\r\n verified: false,\r\n result: { error: \"Wrong ASN.1 schema\" }\r\n };\r\n }\r\n if (inputSchema.idBlock.isHexOnly !== inputData.idBlock.isHexOnly) {\r\n return {\r\n verified: false,\r\n result: root\r\n };\r\n }\r\n if (inputSchema.idBlock.isHexOnly) {\r\n if ((VALUE_HEX_VIEW in inputSchema.idBlock) === false) {\r\n return {\r\n verified: false,\r\n result: { error: \"Wrong ASN.1 schema\" }\r\n };\r\n }\r\n const schemaView = inputSchema.idBlock.valueHexView;\r\n const asn1View = inputData.idBlock.valueHexView;\r\n if (schemaView.length !== asn1View.length) {\r\n return {\r\n verified: false,\r\n result: root\r\n };\r\n }\r\n for (let i = 0; i < schemaView.length; i++) {\r\n if (schemaView[i] !== asn1View[1]) {\r\n return {\r\n verified: false,\r\n result: root\r\n };\r\n }\r\n }\r\n }\r\n if (inputSchema.name) {\r\n inputSchema.name = inputSchema.name.replace(/^\\s+|\\s+$/g, EMPTY_STRING);\r\n if (inputSchema.name)\r\n root[inputSchema.name] = inputData;\r\n }\r\n if (inputSchema instanceof typeStore.Constructed) {\r\n let admission = 0;\r\n let result = {\r\n verified: false,\r\n result: {\r\n error: \"Unknown error\",\r\n }\r\n };\r\n let maxLength = inputSchema.valueBlock.value.length;\r\n if (maxLength > 0) {\r\n if (inputSchema.valueBlock.value[0] instanceof Repeated) {\r\n maxLength = inputData.valueBlock.value.length;\r\n }\r\n }\r\n if (maxLength === 0) {\r\n return {\r\n verified: true,\r\n result: root\r\n };\r\n }\r\n if ((inputData.valueBlock.value.length === 0) &&\r\n (inputSchema.valueBlock.value.length !== 0)) {\r\n let _optional = true;\r\n for (let i = 0; i < inputSchema.valueBlock.value.length; i++)\r\n _optional = _optional && (inputSchema.valueBlock.value[i].optional || false);\r\n if (_optional) {\r\n return {\r\n verified: true,\r\n result: root\r\n };\r\n }\r\n if (inputSchema.name) {\r\n inputSchema.name = inputSchema.name.replace(/^\\s+|\\s+$/g, EMPTY_STRING);\r\n if (inputSchema.name)\r\n delete root[inputSchema.name];\r\n }\r\n root.error = \"Inconsistent object length\";\r\n return {\r\n verified: false,\r\n result: root\r\n };\r\n }\r\n for (let i = 0; i < maxLength; i++) {\r\n if ((i - admission) >= inputData.valueBlock.value.length) {\r\n if (inputSchema.valueBlock.value[i].optional === false) {\r\n const _result = {\r\n verified: false,\r\n result: root\r\n };\r\n root.error = \"Inconsistent length between ASN.1 data and schema\";\r\n if (inputSchema.name) {\r\n inputSchema.name = inputSchema.name.replace(/^\\s+|\\s+$/g, EMPTY_STRING);\r\n if (inputSchema.name) {\r\n delete root[inputSchema.name];\r\n _result.name = inputSchema.name;\r\n }\r\n }\r\n return _result;\r\n }\r\n }\r\n else {\r\n if (inputSchema.valueBlock.value[0] instanceof Repeated) {\r\n result = compareSchema(root, inputData.valueBlock.value[i], inputSchema.valueBlock.value[0].value);\r\n if (result.verified === false) {\r\n if (inputSchema.valueBlock.value[0].optional)\r\n admission++;\r\n else {\r\n if (inputSchema.name) {\r\n inputSchema.name = inputSchema.name.replace(/^\\s+|\\s+$/g, EMPTY_STRING);\r\n if (inputSchema.name)\r\n delete root[inputSchema.name];\r\n }\r\n return result;\r\n }\r\n }\r\n if ((NAME in inputSchema.valueBlock.value[0]) && (inputSchema.valueBlock.value[0].name.length > 0)) {\r\n let arrayRoot = {};\r\n if ((LOCAL in inputSchema.valueBlock.value[0]) && (inputSchema.valueBlock.value[0].local))\r\n arrayRoot = inputData;\r\n else\r\n arrayRoot = root;\r\n if (typeof arrayRoot[inputSchema.valueBlock.value[0].name] === \"undefined\")\r\n arrayRoot[inputSchema.valueBlock.value[0].name] = [];\r\n arrayRoot[inputSchema.valueBlock.value[0].name].push(inputData.valueBlock.value[i]);\r\n }\r\n }\r\n else {\r\n result = compareSchema(root, inputData.valueBlock.value[i - admission], inputSchema.valueBlock.value[i]);\r\n if (result.verified === false) {\r\n if (inputSchema.valueBlock.value[i].optional)\r\n admission++;\r\n else {\r\n if (inputSchema.name) {\r\n inputSchema.name = inputSchema.name.replace(/^\\s+|\\s+$/g, EMPTY_STRING);\r\n if (inputSchema.name)\r\n delete root[inputSchema.name];\r\n }\r\n return result;\r\n }\r\n }\r\n }\r\n }\r\n }\r\n if (result.verified === false) {\r\n const _result = {\r\n verified: false,\r\n result: root\r\n };\r\n if (inputSchema.name) {\r\n inputSchema.name = inputSchema.name.replace(/^\\s+|\\s+$/g, EMPTY_STRING);\r\n if (inputSchema.name) {\r\n delete root[inputSchema.name];\r\n _result.name = inputSchema.name;\r\n }\r\n }\r\n return _result;\r\n }\r\n return {\r\n verified: true,\r\n result: root\r\n };\r\n }\r\n if (inputSchema.primitiveSchema &&\r\n (VALUE_HEX_VIEW in inputData.valueBlock)) {\r\n const asn1 = localFromBER(inputData.valueBlock.valueHexView);\r\n if (asn1.offset === -1) {\r\n const _result = {\r\n verified: false,\r\n result: asn1.result\r\n };\r\n if (inputSchema.name) {\r\n inputSchema.name = inputSchema.name.replace(/^\\s+|\\s+$/g, EMPTY_STRING);\r\n if (inputSchema.name) {\r\n delete root[inputSchema.name];\r\n _result.name = inputSchema.name;\r\n }\r\n }\r\n return _result;\r\n }\r\n return compareSchema(root, asn1.result, inputSchema.primitiveSchema);\r\n }\r\n return {\r\n verified: true,\r\n result: root\r\n };\r\n}\r\nfunction verifySchema(inputBuffer, inputSchema) {\r\n if ((inputSchema instanceof Object) === false) {\r\n return {\r\n verified: false,\r\n result: { error: \"Wrong ASN.1 schema type\" }\r\n };\r\n }\r\n const asn1 = localFromBER(pvtsutils.BufferSourceConverter.toUint8Array(inputBuffer));\r\n if (asn1.offset === -1) {\r\n return {\r\n verified: false,\r\n result: asn1.result\r\n };\r\n }\r\n return compareSchema(asn1.result, asn1.result, inputSchema);\r\n}\n\nexport { Any, BaseBlock, BaseStringBlock, BitString, BmpString, Boolean, CharacterString, Choice, Constructed, DATE, DateTime, Duration, EndOfContent, Enumerated, GeneralString, GeneralizedTime, GraphicString, HexBlock, IA5String, Integer, Null, NumericString, ObjectIdentifier, OctetString, Primitive, PrintableString, RawData, RelativeObjectIdentifier, Repeated, Sequence, Set, TIME, TeletexString, TimeOfDay, UTCTime, UniversalString, Utf8String, ValueBlock, VideotexString, ViewWriter, VisibleString, compareSchema, fromBER, verifySchema };\n","import { CodeError } from '@libp2p/interface';\nimport { randomBytes as randB } from '@noble/hashes/utils';\n/**\n * Generates a Uint8Array with length `number` populated by random bytes\n */\nexport default function randomBytes(length) {\n if (isNaN(length) || length <= 0) {\n throw new CodeError('random bytes length must be a Number bigger than 0', 'ERR_INVALID_LENGTH');\n }\n return randB(length);\n}\n//# sourceMappingURL=random-bytes.js.map","import { CodeError } from '@libp2p/interface';\nimport { pbkdf2Async } from '@noble/hashes/pbkdf2';\nimport { sha512 } from '@noble/hashes/sha512';\nimport * as asn1js from 'asn1js';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport { toString as uint8ArrayToString } from 'uint8arrays/to-string';\nimport randomBytes from '../random-bytes.js';\nimport webcrypto from '../webcrypto.js';\nimport { unmarshalRsaPrivateKey } from './rsa-class.js';\n/**\n * Convert a PKCS#1 in ASN1 DER format to a JWK key\n */\nexport function pkcs1ToJwk(bytes) {\n const { result } = asn1js.fromBER(bytes);\n // @ts-expect-error this looks fragile but DER is a canonical format so we are\n // safe to have deeply property chains like this\n const values = result.valueBlock.value;\n const key = {\n n: uint8ArrayToString(bnToBuf(values[1].toBigInt()), 'base64url'),\n e: uint8ArrayToString(bnToBuf(values[2].toBigInt()), 'base64url'),\n d: uint8ArrayToString(bnToBuf(values[3].toBigInt()), 'base64url'),\n p: uint8ArrayToString(bnToBuf(values[4].toBigInt()), 'base64url'),\n q: uint8ArrayToString(bnToBuf(values[5].toBigInt()), 'base64url'),\n dp: uint8ArrayToString(bnToBuf(values[6].toBigInt()), 'base64url'),\n dq: uint8ArrayToString(bnToBuf(values[7].toBigInt()), 'base64url'),\n qi: uint8ArrayToString(bnToBuf(values[8].toBigInt()), 'base64url'),\n kty: 'RSA',\n alg: 'RS256'\n };\n return key;\n}\n/**\n * Convert a JWK key into PKCS#1 in ASN1 DER format\n */\nexport function jwkToPkcs1(jwk) {\n if (jwk.n == null || jwk.e == null || jwk.d == null || jwk.p == null || jwk.q == null || jwk.dp == null || jwk.dq == null || jwk.qi == null) {\n throw new CodeError('JWK was missing components', 'ERR_INVALID_PARAMETERS');\n }\n const root = new asn1js.Sequence({\n value: [\n new asn1js.Integer({ value: 0 }),\n asn1js.Integer.fromBigInt(bufToBn(uint8ArrayFromString(jwk.n, 'base64url'))),\n asn1js.Integer.fromBigInt(bufToBn(uint8ArrayFromString(jwk.e, 'base64url'))),\n asn1js.Integer.fromBigInt(bufToBn(uint8ArrayFromString(jwk.d, 'base64url'))),\n asn1js.Integer.fromBigInt(bufToBn(uint8ArrayFromString(jwk.p, 'base64url'))),\n asn1js.Integer.fromBigInt(bufToBn(uint8ArrayFromString(jwk.q, 'base64url'))),\n asn1js.Integer.fromBigInt(bufToBn(uint8ArrayFromString(jwk.dp, 'base64url'))),\n asn1js.Integer.fromBigInt(bufToBn(uint8ArrayFromString(jwk.dq, 'base64url'))),\n asn1js.Integer.fromBigInt(bufToBn(uint8ArrayFromString(jwk.qi, 'base64url')))\n ]\n });\n const der = root.toBER();\n return new Uint8Array(der, 0, der.byteLength);\n}\n/**\n * Convert a PKCIX in ASN1 DER format to a JWK key\n */\nexport function pkixToJwk(bytes) {\n const { result } = asn1js.fromBER(bytes);\n // @ts-expect-error this looks fragile but DER is a canonical format so we are\n // safe to have deeply property chains like this\n const values = result.valueBlock.value[1].valueBlock.value[0].valueBlock.value;\n return {\n kty: 'RSA',\n n: uint8ArrayToString(bnToBuf(values[0].toBigInt()), 'base64url'),\n e: uint8ArrayToString(bnToBuf(values[1].toBigInt()), 'base64url')\n };\n}\n/**\n * Convert a JWK key to PKCIX in ASN1 DER format\n */\nexport function jwkToPkix(jwk) {\n if (jwk.n == null || jwk.e == null) {\n throw new CodeError('JWK was missing components', 'ERR_INVALID_PARAMETERS');\n }\n const root = new asn1js.Sequence({\n value: [\n new asn1js.Sequence({\n value: [\n // rsaEncryption\n new asn1js.ObjectIdentifier({\n value: '1.2.840.113549.1.1.1'\n }),\n new asn1js.Null()\n ]\n }),\n // this appears to be a bug in asn1js.js - this should really be a Sequence\n // and not a BitString but it generates the same bytes as node-forge so 🤷‍♂️\n new asn1js.BitString({\n valueHex: new asn1js.Sequence({\n value: [\n asn1js.Integer.fromBigInt(bufToBn(uint8ArrayFromString(jwk.n, 'base64url'))),\n asn1js.Integer.fromBigInt(bufToBn(uint8ArrayFromString(jwk.e, 'base64url')))\n ]\n }).toBER()\n })\n ]\n });\n const der = root.toBER();\n return new Uint8Array(der, 0, der.byteLength);\n}\nfunction bnToBuf(bn) {\n let hex = bn.toString(16);\n if (hex.length % 2 > 0) {\n hex = `0${hex}`;\n }\n const len = hex.length / 2;\n const u8 = new Uint8Array(len);\n let i = 0;\n let j = 0;\n while (i < len) {\n u8[i] = parseInt(hex.slice(j, j + 2), 16);\n i += 1;\n j += 2;\n }\n return u8;\n}\nfunction bufToBn(u8) {\n const hex = [];\n u8.forEach(function (i) {\n let h = i.toString(16);\n if (h.length % 2 > 0) {\n h = `0${h}`;\n }\n hex.push(h);\n });\n return BigInt('0x' + hex.join(''));\n}\nconst SALT_LENGTH = 16;\nconst KEY_SIZE = 32;\nconst ITERATIONS = 10000;\nexport async function exportToPem(privateKey, password) {\n const crypto = webcrypto.get();\n // PrivateKeyInfo\n const keyWrapper = new asn1js.Sequence({\n value: [\n // version (0)\n new asn1js.Integer({ value: 0 }),\n // privateKeyAlgorithm\n new asn1js.Sequence({\n value: [\n // rsaEncryption OID\n new asn1js.ObjectIdentifier({\n value: '1.2.840.113549.1.1.1'\n }),\n new asn1js.Null()\n ]\n }),\n // PrivateKey\n new asn1js.OctetString({\n valueHex: privateKey.marshal()\n })\n ]\n });\n const keyBuf = keyWrapper.toBER();\n const keyArr = new Uint8Array(keyBuf, 0, keyBuf.byteLength);\n const salt = randomBytes(SALT_LENGTH);\n const encryptionKey = await pbkdf2Async(sha512, password, salt, {\n c: ITERATIONS,\n dkLen: KEY_SIZE\n });\n const iv = randomBytes(16);\n const cryptoKey = await crypto.subtle.importKey('raw', encryptionKey, 'AES-CBC', false, ['encrypt']);\n const encrypted = await crypto.subtle.encrypt({\n name: 'AES-CBC',\n iv\n }, cryptoKey, keyArr);\n const pbkdf2Params = new asn1js.Sequence({\n value: [\n // salt\n new asn1js.OctetString({ valueHex: salt }),\n // iteration count\n new asn1js.Integer({ value: ITERATIONS }),\n // key length\n new asn1js.Integer({ value: KEY_SIZE }),\n // AlgorithmIdentifier\n new asn1js.Sequence({\n value: [\n // hmacWithSHA512\n new asn1js.ObjectIdentifier({ value: '1.2.840.113549.2.11' }),\n new asn1js.Null()\n ]\n })\n ]\n });\n const encryptionAlgorithm = new asn1js.Sequence({\n value: [\n // pkcs5PBES2\n new asn1js.ObjectIdentifier({\n value: '1.2.840.113549.1.5.13'\n }),\n new asn1js.Sequence({\n value: [\n // keyDerivationFunc\n new asn1js.Sequence({\n value: [\n // pkcs5PBKDF2\n new asn1js.ObjectIdentifier({\n value: '1.2.840.113549.1.5.12'\n }),\n // PBKDF2-params\n pbkdf2Params\n ]\n }),\n // encryptionScheme\n new asn1js.Sequence({\n value: [\n // aes256-CBC\n new asn1js.ObjectIdentifier({\n value: '2.16.840.1.101.3.4.1.42'\n }),\n // iv\n new asn1js.OctetString({\n valueHex: iv\n })\n ]\n })\n ]\n })\n ]\n });\n const finalWrapper = new asn1js.Sequence({\n value: [\n encryptionAlgorithm,\n new asn1js.OctetString({ valueHex: encrypted })\n ]\n });\n const finalWrapperBuf = finalWrapper.toBER();\n const finalWrapperArr = new Uint8Array(finalWrapperBuf, 0, finalWrapperBuf.byteLength);\n return [\n '-----BEGIN ENCRYPTED PRIVATE KEY-----',\n ...uint8ArrayToString(finalWrapperArr, 'base64pad').split(/(.{64})/).filter(Boolean),\n '-----END ENCRYPTED PRIVATE KEY-----'\n ].join('\\n');\n}\nexport async function importFromPem(pem, password) {\n const crypto = webcrypto.get();\n let plaintext;\n if (pem.includes('-----BEGIN ENCRYPTED PRIVATE KEY-----')) {\n const key = uint8ArrayFromString(pem\n .replace('-----BEGIN ENCRYPTED PRIVATE KEY-----', '')\n .replace('-----END ENCRYPTED PRIVATE KEY-----', '')\n .replace(/\\n/g, '')\n .trim(), 'base64pad');\n const { result } = asn1js.fromBER(key);\n const { iv, salt, iterations, keySize, cipherText } = findEncryptedPEMData(result);\n const encryptionKey = await pbkdf2Async(sha512, password, salt, {\n c: iterations,\n dkLen: keySize\n });\n const cryptoKey = await crypto.subtle.importKey('raw', encryptionKey, 'AES-CBC', false, ['decrypt']);\n const decrypted = toUint8Array(await crypto.subtle.decrypt({\n name: 'AES-CBC',\n iv\n }, cryptoKey, cipherText));\n const { result: decryptedResult } = asn1js.fromBER(decrypted);\n plaintext = findPEMData(decryptedResult);\n }\n else if (pem.includes('-----BEGIN PRIVATE KEY-----')) {\n const key = uint8ArrayFromString(pem\n .replace('-----BEGIN PRIVATE KEY-----', '')\n .replace('-----END PRIVATE KEY-----', '')\n .replace(/\\n/g, '')\n .trim(), 'base64pad');\n const { result } = asn1js.fromBER(key);\n plaintext = findPEMData(result);\n }\n else {\n throw new CodeError('Could not parse private key from PEM data', 'ERR_INVALID_PARAMETERS');\n }\n return unmarshalRsaPrivateKey(plaintext);\n}\nfunction findEncryptedPEMData(root) {\n const encryptionAlgorithm = root.valueBlock.value[0];\n const scheme = encryptionAlgorithm.valueBlock.value[0].toString();\n if (scheme !== 'OBJECT IDENTIFIER : 1.2.840.113549.1.5.13') {\n throw new CodeError('Only pkcs5PBES2 encrypted private keys are supported', 'ERR_INVALID_PARAMS');\n }\n const keyDerivationFunc = encryptionAlgorithm.valueBlock.value[1].valueBlock.value[0];\n const keyDerivationFuncName = keyDerivationFunc.valueBlock.value[0].toString();\n if (keyDerivationFuncName !== 'OBJECT IDENTIFIER : 1.2.840.113549.1.5.12') {\n throw new CodeError('Only pkcs5PBKDF2 key derivation functions are supported', 'ERR_INVALID_PARAMS');\n }\n const pbkdf2Params = keyDerivationFunc.valueBlock.value[1];\n const salt = toUint8Array(pbkdf2Params.valueBlock.value[0].getValue());\n let iterations = ITERATIONS;\n let keySize = KEY_SIZE;\n if (pbkdf2Params.valueBlock.value.length === 3) {\n iterations = Number(pbkdf2Params.valueBlock.value[1].toBigInt());\n keySize = Number((pbkdf2Params.valueBlock.value[2]).toBigInt());\n }\n else if (pbkdf2Params.valueBlock.value.length === 2) {\n throw new CodeError('Could not derive key size and iterations from PEM file - please use @libp2p/rsa to re-import your key', 'ERR_INVALID_PARAMS');\n }\n const encryptionScheme = encryptionAlgorithm.valueBlock.value[1].valueBlock.value[1];\n const encryptionSchemeName = encryptionScheme.valueBlock.value[0].toString();\n if (encryptionSchemeName === 'OBJECT IDENTIFIER : 1.2.840.113549.3.7') {\n // des-EDE3-CBC\n }\n else if (encryptionSchemeName === 'OBJECT IDENTIFIER : 1.3.14.3.2.7') {\n // des-CBC\n }\n else if (encryptionSchemeName === 'OBJECT IDENTIFIER : 2.16.840.1.101.3.4.1.2') {\n // aes128-CBC\n }\n else if (encryptionSchemeName === 'OBJECT IDENTIFIER : 2.16.840.1.101.3.4.1.22') {\n // aes192-CBC\n }\n else if (encryptionSchemeName === 'OBJECT IDENTIFIER : 2.16.840.1.101.3.4.1.42') {\n // aes256-CBC\n }\n else {\n throw new CodeError('Only AES-CBC encryption schemes are supported', 'ERR_INVALID_PARAMS');\n }\n const iv = toUint8Array(encryptionScheme.valueBlock.value[1].getValue());\n return {\n cipherText: toUint8Array(root.valueBlock.value[1].getValue()),\n salt,\n iterations,\n keySize,\n iv\n };\n}\nfunction findPEMData(seq) {\n return toUint8Array(seq.valueBlock.value[2].getValue());\n}\nfunction toUint8Array(buf) {\n return new Uint8Array(buf, 0, buf.byteLength);\n}\n//# sourceMappingURL=rsa-utils.js.map","import { hash as assertHash, number as assertNumber } from './_assert.js';\nimport { hmac } from './hmac.js';\nimport { createView, toBytes, checkOpts, asyncLoop } from './utils.js';\n// Common prologue and epilogue for sync/async functions\nfunction pbkdf2Init(hash, _password, _salt, _opts) {\n assertHash(hash);\n const opts = checkOpts({ dkLen: 32, asyncTick: 10 }, _opts);\n const { c, dkLen, asyncTick } = opts;\n assertNumber(c);\n assertNumber(dkLen);\n assertNumber(asyncTick);\n if (c < 1)\n throw new Error('PBKDF2: iterations (c) should be >= 1');\n const password = toBytes(_password);\n const salt = toBytes(_salt);\n // DK = PBKDF2(PRF, Password, Salt, c, dkLen);\n const DK = new Uint8Array(dkLen);\n // U1 = PRF(Password, Salt + INT_32_BE(i))\n const PRF = hmac.create(hash, password);\n const PRFSalt = PRF._cloneInto().update(salt);\n return { c, dkLen, asyncTick, DK, PRF, PRFSalt };\n}\nfunction pbkdf2Output(PRF, PRFSalt, DK, prfW, u) {\n PRF.destroy();\n PRFSalt.destroy();\n if (prfW)\n prfW.destroy();\n u.fill(0);\n return DK;\n}\n/**\n * PBKDF2-HMAC: RFC 2898 key derivation function\n * @param hash - hash function that would be used e.g. sha256\n * @param password - password from which a derived key is generated\n * @param salt - cryptographic salt\n * @param opts - {c, dkLen} where c is work factor and dkLen is output message size\n */\nexport function pbkdf2(hash, password, salt, opts) {\n const { c, dkLen, DK, PRF, PRFSalt } = pbkdf2Init(hash, password, salt, opts);\n let prfW; // Working copy\n const arr = new Uint8Array(4);\n const view = createView(arr);\n const u = new Uint8Array(PRF.outputLen);\n // DK = T1 + T2 + ⋯ + Tdklen/hlen\n for (let ti = 1, pos = 0; pos < dkLen; ti++, pos += PRF.outputLen) {\n // Ti = F(Password, Salt, c, i)\n const Ti = DK.subarray(pos, pos + PRF.outputLen);\n view.setInt32(0, ti, false);\n // F(Password, Salt, c, i) = U1 ^ U2 ^ ⋯ ^ Uc\n // U1 = PRF(Password, Salt + INT_32_BE(i))\n (prfW = PRFSalt._cloneInto(prfW)).update(arr).digestInto(u);\n Ti.set(u.subarray(0, Ti.length));\n for (let ui = 1; ui < c; ui++) {\n // Uc = PRF(Password, Uc−1)\n PRF._cloneInto(prfW).update(u).digestInto(u);\n for (let i = 0; i < Ti.length; i++)\n Ti[i] ^= u[i];\n }\n }\n return pbkdf2Output(PRF, PRFSalt, DK, prfW, u);\n}\nexport async function pbkdf2Async(hash, password, salt, opts) {\n const { c, dkLen, asyncTick, DK, PRF, PRFSalt } = pbkdf2Init(hash, password, salt, opts);\n let prfW; // Working copy\n const arr = new Uint8Array(4);\n const view = createView(arr);\n const u = new Uint8Array(PRF.outputLen);\n // DK = T1 + T2 + ⋯ + Tdklen/hlen\n for (let ti = 1, pos = 0; pos < dkLen; ti++, pos += PRF.outputLen) {\n // Ti = F(Password, Salt, c, i)\n const Ti = DK.subarray(pos, pos + PRF.outputLen);\n view.setInt32(0, ti, false);\n // F(Password, Salt, c, i) = U1 ^ U2 ^ ⋯ ^ Uc\n // U1 = PRF(Password, Salt + INT_32_BE(i))\n (prfW = PRFSalt._cloneInto(prfW)).update(arr).digestInto(u);\n Ti.set(u.subarray(0, Ti.length));\n await asyncLoop(c - 1, asyncTick, () => {\n // Uc = PRF(Password, Uc−1)\n PRF._cloneInto(prfW).update(u).digestInto(u);\n for (let i = 0; i < Ti.length; i++)\n Ti[i] ^= u[i];\n });\n }\n return pbkdf2Output(PRF, PRFSalt, DK, prfW, u);\n}\n//# sourceMappingURL=pbkdf2.js.map","import { CodeError } from '@libp2p/interface';\nimport { sha256 } from 'multiformats/hashes/sha2';\nimport { equals as uint8ArrayEquals } from 'uint8arrays/equals';\nimport { toString as uint8ArrayToString } from 'uint8arrays/to-string';\nimport { isPromise } from '../util.js';\nimport { exporter } from './exporter.js';\nimport * as pbm from './keys.js';\nimport * as crypto from './rsa.js';\nexport const MAX_RSA_KEY_SIZE = 8192;\nexport class RsaPublicKey {\n _key;\n constructor(key) {\n this._key = key;\n }\n verify(data, sig) {\n return crypto.hashAndVerify(this._key, sig, data);\n }\n marshal() {\n return crypto.utils.jwkToPkix(this._key);\n }\n get bytes() {\n return pbm.PublicKey.encode({\n Type: pbm.KeyType.RSA,\n Data: this.marshal()\n }).subarray();\n }\n equals(key) {\n return uint8ArrayEquals(this.bytes, key.bytes);\n }\n hash() {\n const p = sha256.digest(this.bytes);\n if (isPromise(p)) {\n return p.then(({ bytes }) => bytes);\n }\n return p.bytes;\n }\n}\nexport class RsaPrivateKey {\n _key;\n _publicKey;\n constructor(key, publicKey) {\n this._key = key;\n this._publicKey = publicKey;\n }\n genSecret() {\n return crypto.getRandomValues(16);\n }\n sign(message) {\n return crypto.hashAndSign(this._key, message);\n }\n get public() {\n if (this._publicKey == null) {\n throw new CodeError('public key not provided', 'ERR_PUBKEY_NOT_PROVIDED');\n }\n return new RsaPublicKey(this._publicKey);\n }\n marshal() {\n return crypto.utils.jwkToPkcs1(this._key);\n }\n get bytes() {\n return pbm.PrivateKey.encode({\n Type: pbm.KeyType.RSA,\n Data: this.marshal()\n }).subarray();\n }\n equals(key) {\n return uint8ArrayEquals(this.bytes, key.bytes);\n }\n hash() {\n const p = sha256.digest(this.bytes);\n if (isPromise(p)) {\n return p.then(({ bytes }) => bytes);\n }\n return p.bytes;\n }\n /**\n * Gets the ID of the key.\n *\n * The key id is the base58 encoding of the SHA-256 multihash of its public key.\n * The public key is a protobuf encoding containing a type and the DER encoding\n * of the PKCS SubjectPublicKeyInfo.\n */\n async id() {\n const hash = await this.public.hash();\n return uint8ArrayToString(hash, 'base58btc');\n }\n /**\n * Exports the key as libp2p-key - a aes-gcm encrypted value with the key\n * derived from the password.\n *\n * To export it as a password protected PEM file, please use the `exportPEM`\n * function from `@libp2p/rsa`.\n */\n async export(password, format = 'pkcs-8') {\n if (format === 'pkcs-8') {\n return crypto.utils.exportToPem(this, password);\n }\n else if (format === 'libp2p-key') {\n return exporter(this.bytes, password);\n }\n else {\n throw new CodeError(`export format '${format}' is not supported`, 'ERR_INVALID_EXPORT_FORMAT');\n }\n }\n}\nexport async function unmarshalRsaPrivateKey(bytes) {\n const jwk = crypto.utils.pkcs1ToJwk(bytes);\n if (crypto.keySize(jwk) > MAX_RSA_KEY_SIZE) {\n throw new CodeError('key size is too large', 'ERR_KEY_SIZE_TOO_LARGE');\n }\n const keys = await crypto.unmarshalPrivateKey(jwk);\n return new RsaPrivateKey(keys.privateKey, keys.publicKey);\n}\nexport function unmarshalRsaPublicKey(bytes) {\n const jwk = crypto.utils.pkixToJwk(bytes);\n if (crypto.keySize(jwk) > MAX_RSA_KEY_SIZE) {\n throw new CodeError('key size is too large', 'ERR_KEY_SIZE_TOO_LARGE');\n }\n return new RsaPublicKey(jwk);\n}\nexport async function fromJwk(jwk) {\n if (crypto.keySize(jwk) > MAX_RSA_KEY_SIZE) {\n throw new CodeError('key size is too large', 'ERR_KEY_SIZE_TOO_LARGE');\n }\n const keys = await crypto.unmarshalPrivateKey(jwk);\n return new RsaPrivateKey(keys.privateKey, keys.publicKey);\n}\nexport async function generateKeyPair(bits) {\n if (bits > MAX_RSA_KEY_SIZE) {\n throw new CodeError('key size is too large', 'ERR_KEY_SIZE_TOO_LARGE');\n }\n const keys = await crypto.generateKey(bits);\n return new RsaPrivateKey(keys.privateKey, keys.publicKey);\n}\n//# sourceMappingURL=rsa-class.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Short Weierstrass curve. The formula is: y² = x³ + ax + b\nimport { validateBasic, wNAF } from './curve.js';\nimport * as mod from './modular.js';\nimport * as ut from './utils.js';\nimport { ensureBytes, memoized, abool } from './utils.js';\nfunction validateSigVerOpts(opts) {\n if (opts.lowS !== undefined)\n abool('lowS', opts.lowS);\n if (opts.prehash !== undefined)\n abool('prehash', opts.prehash);\n}\nfunction validatePointOpts(curve) {\n const opts = validateBasic(curve);\n ut.validateObject(opts, {\n a: 'field',\n b: 'field',\n }, {\n allowedPrivateKeyLengths: 'array',\n wrapPrivateKey: 'boolean',\n isTorsionFree: 'function',\n clearCofactor: 'function',\n allowInfinityPoint: 'boolean',\n fromBytes: 'function',\n toBytes: 'function',\n });\n const { endo, Fp, a } = opts;\n if (endo) {\n if (!Fp.eql(a, Fp.ZERO)) {\n throw new Error('Endomorphism can only be defined for Koblitz curves that have a=0');\n }\n if (typeof endo !== 'object' ||\n typeof endo.beta !== 'bigint' ||\n typeof endo.splitScalar !== 'function') {\n throw new Error('Expected endomorphism with beta: bigint and splitScalar: function');\n }\n }\n return Object.freeze({ ...opts });\n}\n// ASN.1 DER encoding utilities\nconst { bytesToNumberBE: b2n, hexToBytes: h2b } = ut;\nexport const DER = {\n // asn.1 DER encoding utils\n Err: class DERErr extends Error {\n constructor(m = '') {\n super(m);\n }\n },\n _parseInt(data) {\n const { Err: E } = DER;\n if (data.length < 2 || data[0] !== 0x02)\n throw new E('Invalid signature integer tag');\n const len = data[1];\n const res = data.subarray(2, len + 2);\n if (!len || res.length !== len)\n throw new E('Invalid signature integer: wrong length');\n // https://crypto.stackexchange.com/a/57734 Leftmost bit of first byte is 'negative' flag,\n // since we always use positive integers here. It must always be empty:\n // - add zero byte if exists\n // - if next byte doesn't have a flag, leading zero is not allowed (minimal encoding)\n if (res[0] & 0b10000000)\n throw new E('Invalid signature integer: negative');\n if (res[0] === 0x00 && !(res[1] & 0b10000000))\n throw new E('Invalid signature integer: unnecessary leading zero');\n return { d: b2n(res), l: data.subarray(len + 2) }; // d is data, l is left\n },\n toSig(hex) {\n // parse DER signature\n const { Err: E } = DER;\n const data = typeof hex === 'string' ? h2b(hex) : hex;\n ut.abytes(data);\n let l = data.length;\n if (l < 2 || data[0] != 0x30)\n throw new E('Invalid signature tag');\n if (data[1] !== l - 2)\n throw new E('Invalid signature: incorrect length');\n const { d: r, l: sBytes } = DER._parseInt(data.subarray(2));\n const { d: s, l: rBytesLeft } = DER._parseInt(sBytes);\n if (rBytesLeft.length)\n throw new E('Invalid signature: left bytes after parsing');\n return { r, s };\n },\n hexFromSig(sig) {\n // Add leading zero if first byte has negative bit enabled. More details in '_parseInt'\n const slice = (s) => (Number.parseInt(s[0], 16) & 0b1000 ? '00' + s : s);\n const h = (num) => {\n const hex = num.toString(16);\n return hex.length & 1 ? `0${hex}` : hex;\n };\n const s = slice(h(sig.s));\n const r = slice(h(sig.r));\n const shl = s.length / 2;\n const rhl = r.length / 2;\n const sl = h(shl);\n const rl = h(rhl);\n return `30${h(rhl + shl + 4)}02${rl}${r}02${sl}${s}`;\n },\n};\n// Be friendly to bad ECMAScript parsers by not using bigint literals\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = BigInt(2), _3n = BigInt(3), _4n = BigInt(4);\nexport function weierstrassPoints(opts) {\n const CURVE = validatePointOpts(opts);\n const { Fp } = CURVE; // All curves has same field / group length as for now, but they can differ\n const toBytes = CURVE.toBytes ||\n ((_c, point, _isCompressed) => {\n const a = point.toAffine();\n return ut.concatBytes(Uint8Array.from([0x04]), Fp.toBytes(a.x), Fp.toBytes(a.y));\n });\n const fromBytes = CURVE.fromBytes ||\n ((bytes) => {\n // const head = bytes[0];\n const tail = bytes.subarray(1);\n // if (head !== 0x04) throw new Error('Only non-compressed encoding is supported');\n const x = Fp.fromBytes(tail.subarray(0, Fp.BYTES));\n const y = Fp.fromBytes(tail.subarray(Fp.BYTES, 2 * Fp.BYTES));\n return { x, y };\n });\n /**\n * y² = x³ + ax + b: Short weierstrass curve formula\n * @returns y²\n */\n function weierstrassEquation(x) {\n const { a, b } = CURVE;\n const x2 = Fp.sqr(x); // x * x\n const x3 = Fp.mul(x2, x); // x2 * x\n return Fp.add(Fp.add(x3, Fp.mul(x, a)), b); // x3 + a * x + b\n }\n // Validate whether the passed curve params are valid.\n // We check if curve equation works for generator point.\n // `assertValidity()` won't work: `isTorsionFree()` is not available at this point in bls12-381.\n // ProjectivePoint class has not been initialized yet.\n if (!Fp.eql(Fp.sqr(CURVE.Gy), weierstrassEquation(CURVE.Gx)))\n throw new Error('bad generator point: equation left != right');\n // Valid group elements reside in range 1..n-1\n function isWithinCurveOrder(num) {\n return ut.inRange(num, _1n, CURVE.n);\n }\n // Validates if priv key is valid and converts it to bigint.\n // Supports options allowedPrivateKeyLengths and wrapPrivateKey.\n function normPrivateKeyToScalar(key) {\n const { allowedPrivateKeyLengths: lengths, nByteLength, wrapPrivateKey, n: N } = CURVE;\n if (lengths && typeof key !== 'bigint') {\n if (ut.isBytes(key))\n key = ut.bytesToHex(key);\n // Normalize to hex string, pad. E.g. P521 would norm 130-132 char hex to 132-char bytes\n if (typeof key !== 'string' || !lengths.includes(key.length))\n throw new Error('Invalid key');\n key = key.padStart(nByteLength * 2, '0');\n }\n let num;\n try {\n num =\n typeof key === 'bigint'\n ? key\n : ut.bytesToNumberBE(ensureBytes('private key', key, nByteLength));\n }\n catch (error) {\n throw new Error(`private key must be ${nByteLength} bytes, hex or bigint, not ${typeof key}`);\n }\n if (wrapPrivateKey)\n num = mod.mod(num, N); // disabled by default, enabled for BLS\n ut.aInRange('private key', num, _1n, N); // num in range [1..N-1]\n return num;\n }\n function assertPrjPoint(other) {\n if (!(other instanceof Point))\n throw new Error('ProjectivePoint expected');\n }\n // Memoized toAffine / validity check. They are heavy. Points are immutable.\n // Converts Projective point to affine (x, y) coordinates.\n // Can accept precomputed Z^-1 - for example, from invertBatch.\n // (x, y, z) ∋ (x=x/z, y=y/z)\n const toAffineMemo = memoized((p, iz) => {\n const { px: x, py: y, pz: z } = p;\n // Fast-path for normalized points\n if (Fp.eql(z, Fp.ONE))\n return { x, y };\n const is0 = p.is0();\n // If invZ was 0, we return zero point. However we still want to execute\n // all operations, so we replace invZ with a random number, 1.\n if (iz == null)\n iz = is0 ? Fp.ONE : Fp.inv(z);\n const ax = Fp.mul(x, iz);\n const ay = Fp.mul(y, iz);\n const zz = Fp.mul(z, iz);\n if (is0)\n return { x: Fp.ZERO, y: Fp.ZERO };\n if (!Fp.eql(zz, Fp.ONE))\n throw new Error('invZ was invalid');\n return { x: ax, y: ay };\n });\n // NOTE: on exception this will crash 'cached' and no value will be set.\n // Otherwise true will be return\n const assertValidMemo = memoized((p) => {\n if (p.is0()) {\n // (0, 1, 0) aka ZERO is invalid in most contexts.\n // In BLS, ZERO can be serialized, so we allow it.\n // (0, 0, 0) is wrong representation of ZERO and is always invalid.\n if (CURVE.allowInfinityPoint && !Fp.is0(p.py))\n return;\n throw new Error('bad point: ZERO');\n }\n // Some 3rd-party test vectors require different wording between here & `fromCompressedHex`\n const { x, y } = p.toAffine();\n // Check if x, y are valid field elements\n if (!Fp.isValid(x) || !Fp.isValid(y))\n throw new Error('bad point: x or y not FE');\n const left = Fp.sqr(y); // y²\n const right = weierstrassEquation(x); // x³ + ax + b\n if (!Fp.eql(left, right))\n throw new Error('bad point: equation left != right');\n if (!p.isTorsionFree())\n throw new Error('bad point: not in prime-order subgroup');\n return true;\n });\n /**\n * Projective Point works in 3d / projective (homogeneous) coordinates: (x, y, z) ∋ (x=x/z, y=y/z)\n * Default Point works in 2d / affine coordinates: (x, y)\n * We're doing calculations in projective, because its operations don't require costly inversion.\n */\n class Point {\n constructor(px, py, pz) {\n this.px = px;\n this.py = py;\n this.pz = pz;\n if (px == null || !Fp.isValid(px))\n throw new Error('x required');\n if (py == null || !Fp.isValid(py))\n throw new Error('y required');\n if (pz == null || !Fp.isValid(pz))\n throw new Error('z required');\n Object.freeze(this);\n }\n // Does not validate if the point is on-curve.\n // Use fromHex instead, or call assertValidity() later.\n static fromAffine(p) {\n const { x, y } = p || {};\n if (!p || !Fp.isValid(x) || !Fp.isValid(y))\n throw new Error('invalid affine point');\n if (p instanceof Point)\n throw new Error('projective point not allowed');\n const is0 = (i) => Fp.eql(i, Fp.ZERO);\n // fromAffine(x:0, y:0) would produce (x:0, y:0, z:1), but we need (x:0, y:1, z:0)\n if (is0(x) && is0(y))\n return Point.ZERO;\n return new Point(x, y, Fp.ONE);\n }\n get x() {\n return this.toAffine().x;\n }\n get y() {\n return this.toAffine().y;\n }\n /**\n * Takes a bunch of Projective Points but executes only one\n * inversion on all of them. Inversion is very slow operation,\n * so this improves performance massively.\n * Optimization: converts a list of projective points to a list of identical points with Z=1.\n */\n static normalizeZ(points) {\n const toInv = Fp.invertBatch(points.map((p) => p.pz));\n return points.map((p, i) => p.toAffine(toInv[i])).map(Point.fromAffine);\n }\n /**\n * Converts hash string or Uint8Array to Point.\n * @param hex short/long ECDSA hex\n */\n static fromHex(hex) {\n const P = Point.fromAffine(fromBytes(ensureBytes('pointHex', hex)));\n P.assertValidity();\n return P;\n }\n // Multiplies generator point by privateKey.\n static fromPrivateKey(privateKey) {\n return Point.BASE.multiply(normPrivateKeyToScalar(privateKey));\n }\n // \"Private method\", don't use it directly\n _setWindowSize(windowSize) {\n wnaf.setWindowSize(this, windowSize);\n }\n // A point on curve is valid if it conforms to equation.\n assertValidity() {\n assertValidMemo(this);\n }\n hasEvenY() {\n const { y } = this.toAffine();\n if (Fp.isOdd)\n return !Fp.isOdd(y);\n throw new Error(\"Field doesn't support isOdd\");\n }\n /**\n * Compare one point to another.\n */\n equals(other) {\n assertPrjPoint(other);\n const { px: X1, py: Y1, pz: Z1 } = this;\n const { px: X2, py: Y2, pz: Z2 } = other;\n const U1 = Fp.eql(Fp.mul(X1, Z2), Fp.mul(X2, Z1));\n const U2 = Fp.eql(Fp.mul(Y1, Z2), Fp.mul(Y2, Z1));\n return U1 && U2;\n }\n /**\n * Flips point to one corresponding to (x, -y) in Affine coordinates.\n */\n negate() {\n return new Point(this.px, Fp.neg(this.py), this.pz);\n }\n // Renes-Costello-Batina exception-free doubling formula.\n // There is 30% faster Jacobian formula, but it is not complete.\n // https://eprint.iacr.org/2015/1060, algorithm 3\n // Cost: 8M + 3S + 3*a + 2*b3 + 15add.\n double() {\n const { a, b } = CURVE;\n const b3 = Fp.mul(b, _3n);\n const { px: X1, py: Y1, pz: Z1 } = this;\n let X3 = Fp.ZERO, Y3 = Fp.ZERO, Z3 = Fp.ZERO; // prettier-ignore\n let t0 = Fp.mul(X1, X1); // step 1\n let t1 = Fp.mul(Y1, Y1);\n let t2 = Fp.mul(Z1, Z1);\n let t3 = Fp.mul(X1, Y1);\n t3 = Fp.add(t3, t3); // step 5\n Z3 = Fp.mul(X1, Z1);\n Z3 = Fp.add(Z3, Z3);\n X3 = Fp.mul(a, Z3);\n Y3 = Fp.mul(b3, t2);\n Y3 = Fp.add(X3, Y3); // step 10\n X3 = Fp.sub(t1, Y3);\n Y3 = Fp.add(t1, Y3);\n Y3 = Fp.mul(X3, Y3);\n X3 = Fp.mul(t3, X3);\n Z3 = Fp.mul(b3, Z3); // step 15\n t2 = Fp.mul(a, t2);\n t3 = Fp.sub(t0, t2);\n t3 = Fp.mul(a, t3);\n t3 = Fp.add(t3, Z3);\n Z3 = Fp.add(t0, t0); // step 20\n t0 = Fp.add(Z3, t0);\n t0 = Fp.add(t0, t2);\n t0 = Fp.mul(t0, t3);\n Y3 = Fp.add(Y3, t0);\n t2 = Fp.mul(Y1, Z1); // step 25\n t2 = Fp.add(t2, t2);\n t0 = Fp.mul(t2, t3);\n X3 = Fp.sub(X3, t0);\n Z3 = Fp.mul(t2, t1);\n Z3 = Fp.add(Z3, Z3); // step 30\n Z3 = Fp.add(Z3, Z3);\n return new Point(X3, Y3, Z3);\n }\n // Renes-Costello-Batina exception-free addition formula.\n // There is 30% faster Jacobian formula, but it is not complete.\n // https://eprint.iacr.org/2015/1060, algorithm 1\n // Cost: 12M + 0S + 3*a + 3*b3 + 23add.\n add(other) {\n assertPrjPoint(other);\n const { px: X1, py: Y1, pz: Z1 } = this;\n const { px: X2, py: Y2, pz: Z2 } = other;\n let X3 = Fp.ZERO, Y3 = Fp.ZERO, Z3 = Fp.ZERO; // prettier-ignore\n const a = CURVE.a;\n const b3 = Fp.mul(CURVE.b, _3n);\n let t0 = Fp.mul(X1, X2); // step 1\n let t1 = Fp.mul(Y1, Y2);\n let t2 = Fp.mul(Z1, Z2);\n let t3 = Fp.add(X1, Y1);\n let t4 = Fp.add(X2, Y2); // step 5\n t3 = Fp.mul(t3, t4);\n t4 = Fp.add(t0, t1);\n t3 = Fp.sub(t3, t4);\n t4 = Fp.add(X1, Z1);\n let t5 = Fp.add(X2, Z2); // step 10\n t4 = Fp.mul(t4, t5);\n t5 = Fp.add(t0, t2);\n t4 = Fp.sub(t4, t5);\n t5 = Fp.add(Y1, Z1);\n X3 = Fp.add(Y2, Z2); // step 15\n t5 = Fp.mul(t5, X3);\n X3 = Fp.add(t1, t2);\n t5 = Fp.sub(t5, X3);\n Z3 = Fp.mul(a, t4);\n X3 = Fp.mul(b3, t2); // step 20\n Z3 = Fp.add(X3, Z3);\n X3 = Fp.sub(t1, Z3);\n Z3 = Fp.add(t1, Z3);\n Y3 = Fp.mul(X3, Z3);\n t1 = Fp.add(t0, t0); // step 25\n t1 = Fp.add(t1, t0);\n t2 = Fp.mul(a, t2);\n t4 = Fp.mul(b3, t4);\n t1 = Fp.add(t1, t2);\n t2 = Fp.sub(t0, t2); // step 30\n t2 = Fp.mul(a, t2);\n t4 = Fp.add(t4, t2);\n t0 = Fp.mul(t1, t4);\n Y3 = Fp.add(Y3, t0);\n t0 = Fp.mul(t5, t4); // step 35\n X3 = Fp.mul(t3, X3);\n X3 = Fp.sub(X3, t0);\n t0 = Fp.mul(t3, t1);\n Z3 = Fp.mul(t5, Z3);\n Z3 = Fp.add(Z3, t0); // step 40\n return new Point(X3, Y3, Z3);\n }\n subtract(other) {\n return this.add(other.negate());\n }\n is0() {\n return this.equals(Point.ZERO);\n }\n wNAF(n) {\n return wnaf.wNAFCached(this, n, Point.normalizeZ);\n }\n /**\n * Non-constant-time multiplication. Uses double-and-add algorithm.\n * It's faster, but should only be used when you don't care about\n * an exposed private key e.g. sig verification, which works over *public* keys.\n */\n multiplyUnsafe(sc) {\n ut.aInRange('scalar', sc, _0n, CURVE.n);\n const I = Point.ZERO;\n if (sc === _0n)\n return I;\n if (sc === _1n)\n return this;\n const { endo } = CURVE;\n if (!endo)\n return wnaf.unsafeLadder(this, sc);\n // Apply endomorphism\n let { k1neg, k1, k2neg, k2 } = endo.splitScalar(sc);\n let k1p = I;\n let k2p = I;\n let d = this;\n while (k1 > _0n || k2 > _0n) {\n if (k1 & _1n)\n k1p = k1p.add(d);\n if (k2 & _1n)\n k2p = k2p.add(d);\n d = d.double();\n k1 >>= _1n;\n k2 >>= _1n;\n }\n if (k1neg)\n k1p = k1p.negate();\n if (k2neg)\n k2p = k2p.negate();\n k2p = new Point(Fp.mul(k2p.px, endo.beta), k2p.py, k2p.pz);\n return k1p.add(k2p);\n }\n /**\n * Constant time multiplication.\n * Uses wNAF method. Windowed method may be 10% faster,\n * but takes 2x longer to generate and consumes 2x memory.\n * Uses precomputes when available.\n * Uses endomorphism for Koblitz curves.\n * @param scalar by which the point would be multiplied\n * @returns New point\n */\n multiply(scalar) {\n const { endo, n: N } = CURVE;\n ut.aInRange('scalar', scalar, _1n, N);\n let point, fake; // Fake point is used to const-time mult\n if (endo) {\n const { k1neg, k1, k2neg, k2 } = endo.splitScalar(scalar);\n let { p: k1p, f: f1p } = this.wNAF(k1);\n let { p: k2p, f: f2p } = this.wNAF(k2);\n k1p = wnaf.constTimeNegate(k1neg, k1p);\n k2p = wnaf.constTimeNegate(k2neg, k2p);\n k2p = new Point(Fp.mul(k2p.px, endo.beta), k2p.py, k2p.pz);\n point = k1p.add(k2p);\n fake = f1p.add(f2p);\n }\n else {\n const { p, f } = this.wNAF(scalar);\n point = p;\n fake = f;\n }\n // Normalize `z` for both points, but return only real one\n return Point.normalizeZ([point, fake])[0];\n }\n /**\n * Efficiently calculate `aP + bQ`. Unsafe, can expose private key, if used incorrectly.\n * Not using Strauss-Shamir trick: precomputation tables are faster.\n * The trick could be useful if both P and Q are not G (not in our case).\n * @returns non-zero affine point\n */\n multiplyAndAddUnsafe(Q, a, b) {\n const G = Point.BASE; // No Strauss-Shamir trick: we have 10% faster G precomputes\n const mul = (P, a // Select faster multiply() method\n ) => (a === _0n || a === _1n || !P.equals(G) ? P.multiplyUnsafe(a) : P.multiply(a));\n const sum = mul(this, a).add(mul(Q, b));\n return sum.is0() ? undefined : sum;\n }\n // Converts Projective point to affine (x, y) coordinates.\n // Can accept precomputed Z^-1 - for example, from invertBatch.\n // (x, y, z) ∋ (x=x/z, y=y/z)\n toAffine(iz) {\n return toAffineMemo(this, iz);\n }\n isTorsionFree() {\n const { h: cofactor, isTorsionFree } = CURVE;\n if (cofactor === _1n)\n return true; // No subgroups, always torsion-free\n if (isTorsionFree)\n return isTorsionFree(Point, this);\n throw new Error('isTorsionFree() has not been declared for the elliptic curve');\n }\n clearCofactor() {\n const { h: cofactor, clearCofactor } = CURVE;\n if (cofactor === _1n)\n return this; // Fast-path\n if (clearCofactor)\n return clearCofactor(Point, this);\n return this.multiplyUnsafe(CURVE.h);\n }\n toRawBytes(isCompressed = true) {\n abool('isCompressed', isCompressed);\n this.assertValidity();\n return toBytes(Point, this, isCompressed);\n }\n toHex(isCompressed = true) {\n abool('isCompressed', isCompressed);\n return ut.bytesToHex(this.toRawBytes(isCompressed));\n }\n }\n Point.BASE = new Point(CURVE.Gx, CURVE.Gy, Fp.ONE);\n Point.ZERO = new Point(Fp.ZERO, Fp.ONE, Fp.ZERO);\n const _bits = CURVE.nBitLength;\n const wnaf = wNAF(Point, CURVE.endo ? Math.ceil(_bits / 2) : _bits);\n // Validate if generator point is on curve\n return {\n CURVE,\n ProjectivePoint: Point,\n normPrivateKeyToScalar,\n weierstrassEquation,\n isWithinCurveOrder,\n };\n}\nfunction validateOpts(curve) {\n const opts = validateBasic(curve);\n ut.validateObject(opts, {\n hash: 'hash',\n hmac: 'function',\n randomBytes: 'function',\n }, {\n bits2int: 'function',\n bits2int_modN: 'function',\n lowS: 'boolean',\n });\n return Object.freeze({ lowS: true, ...opts });\n}\n/**\n * Creates short weierstrass curve and ECDSA signature methods for it.\n * @example\n * import { Field } from '@noble/curves/abstract/modular';\n * // Before that, define BigInt-s: a, b, p, n, Gx, Gy\n * const curve = weierstrass({ a, b, Fp: Field(p), n, Gx, Gy, h: 1n })\n */\nexport function weierstrass(curveDef) {\n const CURVE = validateOpts(curveDef);\n const { Fp, n: CURVE_ORDER } = CURVE;\n const compressedLen = Fp.BYTES + 1; // e.g. 33 for 32\n const uncompressedLen = 2 * Fp.BYTES + 1; // e.g. 65 for 32\n function modN(a) {\n return mod.mod(a, CURVE_ORDER);\n }\n function invN(a) {\n return mod.invert(a, CURVE_ORDER);\n }\n const { ProjectivePoint: Point, normPrivateKeyToScalar, weierstrassEquation, isWithinCurveOrder, } = weierstrassPoints({\n ...CURVE,\n toBytes(_c, point, isCompressed) {\n const a = point.toAffine();\n const x = Fp.toBytes(a.x);\n const cat = ut.concatBytes;\n abool('isCompressed', isCompressed);\n if (isCompressed) {\n return cat(Uint8Array.from([point.hasEvenY() ? 0x02 : 0x03]), x);\n }\n else {\n return cat(Uint8Array.from([0x04]), x, Fp.toBytes(a.y));\n }\n },\n fromBytes(bytes) {\n const len = bytes.length;\n const head = bytes[0];\n const tail = bytes.subarray(1);\n // this.assertValidity() is done inside of fromHex\n if (len === compressedLen && (head === 0x02 || head === 0x03)) {\n const x = ut.bytesToNumberBE(tail);\n if (!ut.inRange(x, _1n, Fp.ORDER))\n throw new Error('Point is not on curve');\n const y2 = weierstrassEquation(x); // y² = x³ + ax + b\n let y;\n try {\n y = Fp.sqrt(y2); // y = y² ^ (p+1)/4\n }\n catch (sqrtError) {\n const suffix = sqrtError instanceof Error ? ': ' + sqrtError.message : '';\n throw new Error('Point is not on curve' + suffix);\n }\n const isYOdd = (y & _1n) === _1n;\n // ECDSA\n const isHeadOdd = (head & 1) === 1;\n if (isHeadOdd !== isYOdd)\n y = Fp.neg(y);\n return { x, y };\n }\n else if (len === uncompressedLen && head === 0x04) {\n const x = Fp.fromBytes(tail.subarray(0, Fp.BYTES));\n const y = Fp.fromBytes(tail.subarray(Fp.BYTES, 2 * Fp.BYTES));\n return { x, y };\n }\n else {\n throw new Error(`Point of length ${len} was invalid. Expected ${compressedLen} compressed bytes or ${uncompressedLen} uncompressed bytes`);\n }\n },\n });\n const numToNByteStr = (num) => ut.bytesToHex(ut.numberToBytesBE(num, CURVE.nByteLength));\n function isBiggerThanHalfOrder(number) {\n const HALF = CURVE_ORDER >> _1n;\n return number > HALF;\n }\n function normalizeS(s) {\n return isBiggerThanHalfOrder(s) ? modN(-s) : s;\n }\n // slice bytes num\n const slcNum = (b, from, to) => ut.bytesToNumberBE(b.slice(from, to));\n /**\n * ECDSA signature with its (r, s) properties. Supports DER & compact representations.\n */\n class Signature {\n constructor(r, s, recovery) {\n this.r = r;\n this.s = s;\n this.recovery = recovery;\n this.assertValidity();\n }\n // pair (bytes of r, bytes of s)\n static fromCompact(hex) {\n const l = CURVE.nByteLength;\n hex = ensureBytes('compactSignature', hex, l * 2);\n return new Signature(slcNum(hex, 0, l), slcNum(hex, l, 2 * l));\n }\n // DER encoded ECDSA signature\n // https://bitcoin.stackexchange.com/questions/57644/what-are-the-parts-of-a-bitcoin-transaction-input-script\n static fromDER(hex) {\n const { r, s } = DER.toSig(ensureBytes('DER', hex));\n return new Signature(r, s);\n }\n assertValidity() {\n ut.aInRange('r', this.r, _1n, CURVE_ORDER); // r in [1..N]\n ut.aInRange('s', this.s, _1n, CURVE_ORDER); // s in [1..N]\n }\n addRecoveryBit(recovery) {\n return new Signature(this.r, this.s, recovery);\n }\n recoverPublicKey(msgHash) {\n const { r, s, recovery: rec } = this;\n const h = bits2int_modN(ensureBytes('msgHash', msgHash)); // Truncate hash\n if (rec == null || ![0, 1, 2, 3].includes(rec))\n throw new Error('recovery id invalid');\n const radj = rec === 2 || rec === 3 ? r + CURVE.n : r;\n if (radj >= Fp.ORDER)\n throw new Error('recovery id 2 or 3 invalid');\n const prefix = (rec & 1) === 0 ? '02' : '03';\n const R = Point.fromHex(prefix + numToNByteStr(radj));\n const ir = invN(radj); // r^-1\n const u1 = modN(-h * ir); // -hr^-1\n const u2 = modN(s * ir); // sr^-1\n const Q = Point.BASE.multiplyAndAddUnsafe(R, u1, u2); // (sr^-1)R-(hr^-1)G = -(hr^-1)G + (sr^-1)\n if (!Q)\n throw new Error('point at infinify'); // unsafe is fine: no priv data leaked\n Q.assertValidity();\n return Q;\n }\n // Signatures should be low-s, to prevent malleability.\n hasHighS() {\n return isBiggerThanHalfOrder(this.s);\n }\n normalizeS() {\n return this.hasHighS() ? new Signature(this.r, modN(-this.s), this.recovery) : this;\n }\n // DER-encoded\n toDERRawBytes() {\n return ut.hexToBytes(this.toDERHex());\n }\n toDERHex() {\n return DER.hexFromSig({ r: this.r, s: this.s });\n }\n // padded bytes of r, then padded bytes of s\n toCompactRawBytes() {\n return ut.hexToBytes(this.toCompactHex());\n }\n toCompactHex() {\n return numToNByteStr(this.r) + numToNByteStr(this.s);\n }\n }\n const utils = {\n isValidPrivateKey(privateKey) {\n try {\n normPrivateKeyToScalar(privateKey);\n return true;\n }\n catch (error) {\n return false;\n }\n },\n normPrivateKeyToScalar: normPrivateKeyToScalar,\n /**\n * Produces cryptographically secure private key from random of size\n * (groupLen + ceil(groupLen / 2)) with modulo bias being negligible.\n */\n randomPrivateKey: () => {\n const length = mod.getMinHashLength(CURVE.n);\n return mod.mapHashToField(CURVE.randomBytes(length), CURVE.n);\n },\n /**\n * Creates precompute table for an arbitrary EC point. Makes point \"cached\".\n * Allows to massively speed-up `point.multiply(scalar)`.\n * @returns cached point\n * @example\n * const fast = utils.precompute(8, ProjectivePoint.fromHex(someonesPubKey));\n * fast.multiply(privKey); // much faster ECDH now\n */\n precompute(windowSize = 8, point = Point.BASE) {\n point._setWindowSize(windowSize);\n point.multiply(BigInt(3)); // 3 is arbitrary, just need any number here\n return point;\n },\n };\n /**\n * Computes public key for a private key. Checks for validity of the private key.\n * @param privateKey private key\n * @param isCompressed whether to return compact (default), or full key\n * @returns Public key, full when isCompressed=false; short when isCompressed=true\n */\n function getPublicKey(privateKey, isCompressed = true) {\n return Point.fromPrivateKey(privateKey).toRawBytes(isCompressed);\n }\n /**\n * Quick and dirty check for item being public key. Does not validate hex, or being on-curve.\n */\n function isProbPub(item) {\n const arr = ut.isBytes(item);\n const str = typeof item === 'string';\n const len = (arr || str) && item.length;\n if (arr)\n return len === compressedLen || len === uncompressedLen;\n if (str)\n return len === 2 * compressedLen || len === 2 * uncompressedLen;\n if (item instanceof Point)\n return true;\n return false;\n }\n /**\n * ECDH (Elliptic Curve Diffie Hellman).\n * Computes shared public key from private key and public key.\n * Checks: 1) private key validity 2) shared key is on-curve.\n * Does NOT hash the result.\n * @param privateA private key\n * @param publicB different public key\n * @param isCompressed whether to return compact (default), or full key\n * @returns shared public key\n */\n function getSharedSecret(privateA, publicB, isCompressed = true) {\n if (isProbPub(privateA))\n throw new Error('first arg must be private key');\n if (!isProbPub(publicB))\n throw new Error('second arg must be public key');\n const b = Point.fromHex(publicB); // check for being on-curve\n return b.multiply(normPrivateKeyToScalar(privateA)).toRawBytes(isCompressed);\n }\n // RFC6979: ensure ECDSA msg is X bytes and < N. RFC suggests optional truncating via bits2octets.\n // FIPS 186-4 4.6 suggests the leftmost min(nBitLen, outLen) bits, which matches bits2int.\n // bits2int can produce res>N, we can do mod(res, N) since the bitLen is the same.\n // int2octets can't be used; pads small msgs with 0: unacceptatble for trunc as per RFC vectors\n const bits2int = CURVE.bits2int ||\n function (bytes) {\n // For curves with nBitLength % 8 !== 0: bits2octets(bits2octets(m)) !== bits2octets(m)\n // for some cases, since bytes.length * 8 is not actual bitLength.\n const num = ut.bytesToNumberBE(bytes); // check for == u8 done here\n const delta = bytes.length * 8 - CURVE.nBitLength; // truncate to nBitLength leftmost bits\n return delta > 0 ? num >> BigInt(delta) : num;\n };\n const bits2int_modN = CURVE.bits2int_modN ||\n function (bytes) {\n return modN(bits2int(bytes)); // can't use bytesToNumberBE here\n };\n // NOTE: pads output with zero as per spec\n const ORDER_MASK = ut.bitMask(CURVE.nBitLength);\n /**\n * Converts to bytes. Checks if num in `[0..ORDER_MASK-1]` e.g.: `[0..2^256-1]`.\n */\n function int2octets(num) {\n ut.aInRange(`num < 2^${CURVE.nBitLength}`, num, _0n, ORDER_MASK);\n // works with order, can have different size than numToField!\n return ut.numberToBytesBE(num, CURVE.nByteLength);\n }\n // Steps A, D of RFC6979 3.2\n // Creates RFC6979 seed; converts msg/privKey to numbers.\n // Used only in sign, not in verify.\n // NOTE: we cannot assume here that msgHash has same amount of bytes as curve order, this will be wrong at least for P521.\n // Also it can be bigger for P224 + SHA256\n function prepSig(msgHash, privateKey, opts = defaultSigOpts) {\n if (['recovered', 'canonical'].some((k) => k in opts))\n throw new Error('sign() legacy options not supported');\n const { hash, randomBytes } = CURVE;\n let { lowS, prehash, extraEntropy: ent } = opts; // generates low-s sigs by default\n if (lowS == null)\n lowS = true; // RFC6979 3.2: we skip step A, because we already provide hash\n msgHash = ensureBytes('msgHash', msgHash);\n validateSigVerOpts(opts);\n if (prehash)\n msgHash = ensureBytes('prehashed msgHash', hash(msgHash));\n // We can't later call bits2octets, since nested bits2int is broken for curves\n // with nBitLength % 8 !== 0. Because of that, we unwrap it here as int2octets call.\n // const bits2octets = (bits) => int2octets(bits2int_modN(bits))\n const h1int = bits2int_modN(msgHash);\n const d = normPrivateKeyToScalar(privateKey); // validate private key, convert to bigint\n const seedArgs = [int2octets(d), int2octets(h1int)];\n // extraEntropy. RFC6979 3.6: additional k' (optional).\n if (ent != null && ent !== false) {\n // K = HMAC_K(V || 0x00 || int2octets(x) || bits2octets(h1) || k')\n const e = ent === true ? randomBytes(Fp.BYTES) : ent; // generate random bytes OR pass as-is\n seedArgs.push(ensureBytes('extraEntropy', e)); // check for being bytes\n }\n const seed = ut.concatBytes(...seedArgs); // Step D of RFC6979 3.2\n const m = h1int; // NOTE: no need to call bits2int second time here, it is inside truncateHash!\n // Converts signature params into point w r/s, checks result for validity.\n function k2sig(kBytes) {\n // RFC 6979 Section 3.2, step 3: k = bits2int(T)\n const k = bits2int(kBytes); // Cannot use fields methods, since it is group element\n if (!isWithinCurveOrder(k))\n return; // Important: all mod() calls here must be done over N\n const ik = invN(k); // k^-1 mod n\n const q = Point.BASE.multiply(k).toAffine(); // q = Gk\n const r = modN(q.x); // r = q.x mod n\n if (r === _0n)\n return;\n // Can use scalar blinding b^-1(bm + bdr) where b ∈ [1,q−1] according to\n // https://tches.iacr.org/index.php/TCHES/article/view/7337/6509. We've decided against it:\n // a) dependency on CSPRNG b) 15% slowdown c) doesn't really help since bigints are not CT\n const s = modN(ik * modN(m + r * d)); // Not using blinding here\n if (s === _0n)\n return;\n let recovery = (q.x === r ? 0 : 2) | Number(q.y & _1n); // recovery bit (2 or 3, when q.x > n)\n let normS = s;\n if (lowS && isBiggerThanHalfOrder(s)) {\n normS = normalizeS(s); // if lowS was passed, ensure s is always\n recovery ^= 1; // // in the bottom half of N\n }\n return new Signature(r, normS, recovery); // use normS, not s\n }\n return { seed, k2sig };\n }\n const defaultSigOpts = { lowS: CURVE.lowS, prehash: false };\n const defaultVerOpts = { lowS: CURVE.lowS, prehash: false };\n /**\n * Signs message hash with a private key.\n * ```\n * sign(m, d, k) where\n * (x, y) = G × k\n * r = x mod n\n * s = (m + dr)/k mod n\n * ```\n * @param msgHash NOT message. msg needs to be hashed to `msgHash`, or use `prehash`.\n * @param privKey private key\n * @param opts lowS for non-malleable sigs. extraEntropy for mixing randomness into k. prehash will hash first arg.\n * @returns signature with recovery param\n */\n function sign(msgHash, privKey, opts = defaultSigOpts) {\n const { seed, k2sig } = prepSig(msgHash, privKey, opts); // Steps A, D of RFC6979 3.2.\n const C = CURVE;\n const drbg = ut.createHmacDrbg(C.hash.outputLen, C.nByteLength, C.hmac);\n return drbg(seed, k2sig); // Steps B, C, D, E, F, G\n }\n // Enable precomputes. Slows down first publicKey computation by 20ms.\n Point.BASE._setWindowSize(8);\n // utils.precompute(8, ProjectivePoint.BASE)\n /**\n * Verifies a signature against message hash and public key.\n * Rejects lowS signatures by default: to override,\n * specify option `{lowS: false}`. Implements section 4.1.4 from https://www.secg.org/sec1-v2.pdf:\n *\n * ```\n * verify(r, s, h, P) where\n * U1 = hs^-1 mod n\n * U2 = rs^-1 mod n\n * R = U1⋅G - U2⋅P\n * mod(R.x, n) == r\n * ```\n */\n function verify(signature, msgHash, publicKey, opts = defaultVerOpts) {\n const sg = signature;\n msgHash = ensureBytes('msgHash', msgHash);\n publicKey = ensureBytes('publicKey', publicKey);\n if ('strict' in opts)\n throw new Error('options.strict was renamed to lowS');\n validateSigVerOpts(opts);\n const { lowS, prehash } = opts;\n let _sig = undefined;\n let P;\n try {\n if (typeof sg === 'string' || ut.isBytes(sg)) {\n // Signature can be represented in 2 ways: compact (2*nByteLength) & DER (variable-length).\n // Since DER can also be 2*nByteLength bytes, we check for it first.\n try {\n _sig = Signature.fromDER(sg);\n }\n catch (derError) {\n if (!(derError instanceof DER.Err))\n throw derError;\n _sig = Signature.fromCompact(sg);\n }\n }\n else if (typeof sg === 'object' && typeof sg.r === 'bigint' && typeof sg.s === 'bigint') {\n const { r, s } = sg;\n _sig = new Signature(r, s);\n }\n else {\n throw new Error('PARSE');\n }\n P = Point.fromHex(publicKey);\n }\n catch (error) {\n if (error.message === 'PARSE')\n throw new Error(`signature must be Signature instance, Uint8Array or hex string`);\n return false;\n }\n if (lowS && _sig.hasHighS())\n return false;\n if (prehash)\n msgHash = CURVE.hash(msgHash);\n const { r, s } = _sig;\n const h = bits2int_modN(msgHash); // Cannot use fields methods, since it is group element\n const is = invN(s); // s^-1\n const u1 = modN(h * is); // u1 = hs^-1 mod n\n const u2 = modN(r * is); // u2 = rs^-1 mod n\n const R = Point.BASE.multiplyAndAddUnsafe(P, u1, u2)?.toAffine(); // R = u1⋅G + u2⋅P\n if (!R)\n return false;\n const v = modN(R.x);\n return v === r;\n }\n return {\n CURVE,\n getPublicKey,\n getSharedSecret,\n sign,\n verify,\n ProjectivePoint: Point,\n Signature,\n utils,\n };\n}\n/**\n * Implementation of the Shallue and van de Woestijne method for any weierstrass curve.\n * TODO: check if there is a way to merge this with uvRatio in Edwards; move to modular.\n * b = True and y = sqrt(u / v) if (u / v) is square in F, and\n * b = False and y = sqrt(Z * (u / v)) otherwise.\n * @param Fp\n * @param Z\n * @returns\n */\nexport function SWUFpSqrtRatio(Fp, Z) {\n // Generic implementation\n const q = Fp.ORDER;\n let l = _0n;\n for (let o = q - _1n; o % _2n === _0n; o /= _2n)\n l += _1n;\n const c1 = l; // 1. c1, the largest integer such that 2^c1 divides q - 1.\n // We need 2n ** c1 and 2n ** (c1-1). We can't use **; but we can use <<.\n // 2n ** c1 == 2n << (c1-1)\n const _2n_pow_c1_1 = _2n << (c1 - _1n - _1n);\n const _2n_pow_c1 = _2n_pow_c1_1 * _2n;\n const c2 = (q - _1n) / _2n_pow_c1; // 2. c2 = (q - 1) / (2^c1) # Integer arithmetic\n const c3 = (c2 - _1n) / _2n; // 3. c3 = (c2 - 1) / 2 # Integer arithmetic\n const c4 = _2n_pow_c1 - _1n; // 4. c4 = 2^c1 - 1 # Integer arithmetic\n const c5 = _2n_pow_c1_1; // 5. c5 = 2^(c1 - 1) # Integer arithmetic\n const c6 = Fp.pow(Z, c2); // 6. c6 = Z^c2\n const c7 = Fp.pow(Z, (c2 + _1n) / _2n); // 7. c7 = Z^((c2 + 1) / 2)\n let sqrtRatio = (u, v) => {\n let tv1 = c6; // 1. tv1 = c6\n let tv2 = Fp.pow(v, c4); // 2. tv2 = v^c4\n let tv3 = Fp.sqr(tv2); // 3. tv3 = tv2^2\n tv3 = Fp.mul(tv3, v); // 4. tv3 = tv3 * v\n let tv5 = Fp.mul(u, tv3); // 5. tv5 = u * tv3\n tv5 = Fp.pow(tv5, c3); // 6. tv5 = tv5^c3\n tv5 = Fp.mul(tv5, tv2); // 7. tv5 = tv5 * tv2\n tv2 = Fp.mul(tv5, v); // 8. tv2 = tv5 * v\n tv3 = Fp.mul(tv5, u); // 9. tv3 = tv5 * u\n let tv4 = Fp.mul(tv3, tv2); // 10. tv4 = tv3 * tv2\n tv5 = Fp.pow(tv4, c5); // 11. tv5 = tv4^c5\n let isQR = Fp.eql(tv5, Fp.ONE); // 12. isQR = tv5 == 1\n tv2 = Fp.mul(tv3, c7); // 13. tv2 = tv3 * c7\n tv5 = Fp.mul(tv4, tv1); // 14. tv5 = tv4 * tv1\n tv3 = Fp.cmov(tv2, tv3, isQR); // 15. tv3 = CMOV(tv2, tv3, isQR)\n tv4 = Fp.cmov(tv5, tv4, isQR); // 16. tv4 = CMOV(tv5, tv4, isQR)\n // 17. for i in (c1, c1 - 1, ..., 2):\n for (let i = c1; i > _1n; i--) {\n let tv5 = i - _2n; // 18. tv5 = i - 2\n tv5 = _2n << (tv5 - _1n); // 19. tv5 = 2^tv5\n let tvv5 = Fp.pow(tv4, tv5); // 20. tv5 = tv4^tv5\n const e1 = Fp.eql(tvv5, Fp.ONE); // 21. e1 = tv5 == 1\n tv2 = Fp.mul(tv3, tv1); // 22. tv2 = tv3 * tv1\n tv1 = Fp.mul(tv1, tv1); // 23. tv1 = tv1 * tv1\n tvv5 = Fp.mul(tv4, tv1); // 24. tv5 = tv4 * tv1\n tv3 = Fp.cmov(tv2, tv3, e1); // 25. tv3 = CMOV(tv2, tv3, e1)\n tv4 = Fp.cmov(tvv5, tv4, e1); // 26. tv4 = CMOV(tv5, tv4, e1)\n }\n return { isValid: isQR, value: tv3 };\n };\n if (Fp.ORDER % _4n === _3n) {\n // sqrt_ratio_3mod4(u, v)\n const c1 = (Fp.ORDER - _3n) / _4n; // 1. c1 = (q - 3) / 4 # Integer arithmetic\n const c2 = Fp.sqrt(Fp.neg(Z)); // 2. c2 = sqrt(-Z)\n sqrtRatio = (u, v) => {\n let tv1 = Fp.sqr(v); // 1. tv1 = v^2\n const tv2 = Fp.mul(u, v); // 2. tv2 = u * v\n tv1 = Fp.mul(tv1, tv2); // 3. tv1 = tv1 * tv2\n let y1 = Fp.pow(tv1, c1); // 4. y1 = tv1^c1\n y1 = Fp.mul(y1, tv2); // 5. y1 = y1 * tv2\n const y2 = Fp.mul(y1, c2); // 6. y2 = y1 * c2\n const tv3 = Fp.mul(Fp.sqr(y1), v); // 7. tv3 = y1^2; 8. tv3 = tv3 * v\n const isQR = Fp.eql(tv3, u); // 9. isQR = tv3 == u\n let y = Fp.cmov(y2, y1, isQR); // 10. y = CMOV(y2, y1, isQR)\n return { isValid: isQR, value: y }; // 11. return (isQR, y) isQR ? y : y*c2\n };\n }\n // No curves uses that\n // if (Fp.ORDER % _8n === _5n) // sqrt_ratio_5mod8\n return sqrtRatio;\n}\n/**\n * Simplified Shallue-van de Woestijne-Ulas Method\n * https://www.rfc-editor.org/rfc/rfc9380#section-6.6.2\n */\nexport function mapToCurveSimpleSWU(Fp, opts) {\n mod.validateField(Fp);\n if (!Fp.isValid(opts.A) || !Fp.isValid(opts.B) || !Fp.isValid(opts.Z))\n throw new Error('mapToCurveSimpleSWU: invalid opts');\n const sqrtRatio = SWUFpSqrtRatio(Fp, opts.Z);\n if (!Fp.isOdd)\n throw new Error('Fp.isOdd is not implemented!');\n // Input: u, an element of F.\n // Output: (x, y), a point on E.\n return (u) => {\n // prettier-ignore\n let tv1, tv2, tv3, tv4, tv5, tv6, x, y;\n tv1 = Fp.sqr(u); // 1. tv1 = u^2\n tv1 = Fp.mul(tv1, opts.Z); // 2. tv1 = Z * tv1\n tv2 = Fp.sqr(tv1); // 3. tv2 = tv1^2\n tv2 = Fp.add(tv2, tv1); // 4. tv2 = tv2 + tv1\n tv3 = Fp.add(tv2, Fp.ONE); // 5. tv3 = tv2 + 1\n tv3 = Fp.mul(tv3, opts.B); // 6. tv3 = B * tv3\n tv4 = Fp.cmov(opts.Z, Fp.neg(tv2), !Fp.eql(tv2, Fp.ZERO)); // 7. tv4 = CMOV(Z, -tv2, tv2 != 0)\n tv4 = Fp.mul(tv4, opts.A); // 8. tv4 = A * tv4\n tv2 = Fp.sqr(tv3); // 9. tv2 = tv3^2\n tv6 = Fp.sqr(tv4); // 10. tv6 = tv4^2\n tv5 = Fp.mul(tv6, opts.A); // 11. tv5 = A * tv6\n tv2 = Fp.add(tv2, tv5); // 12. tv2 = tv2 + tv5\n tv2 = Fp.mul(tv2, tv3); // 13. tv2 = tv2 * tv3\n tv6 = Fp.mul(tv6, tv4); // 14. tv6 = tv6 * tv4\n tv5 = Fp.mul(tv6, opts.B); // 15. tv5 = B * tv6\n tv2 = Fp.add(tv2, tv5); // 16. tv2 = tv2 + tv5\n x = Fp.mul(tv1, tv3); // 17. x = tv1 * tv3\n const { isValid, value } = sqrtRatio(tv2, tv6); // 18. (is_gx1_square, y1) = sqrt_ratio(tv2, tv6)\n y = Fp.mul(tv1, u); // 19. y = tv1 * u -> Z * u^3 * y1\n y = Fp.mul(y, value); // 20. y = y * y1\n x = Fp.cmov(x, tv3, isValid); // 21. x = CMOV(x, tv3, is_gx1_square)\n y = Fp.cmov(y, value, isValid); // 22. y = CMOV(y, y1, is_gx1_square)\n const e1 = Fp.isOdd(u) === Fp.isOdd(y); // 23. e1 = sgn0(u) == sgn0(y)\n y = Fp.cmov(Fp.neg(y), y, e1); // 24. y = CMOV(-y, y, e1)\n x = Fp.div(x, tv4); // 25. x = x / tv4\n return { x, y };\n };\n}\n//# sourceMappingURL=weierstrass.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { hmac } from '@noble/hashes/hmac';\nimport { concatBytes, randomBytes } from '@noble/hashes/utils';\nimport { weierstrass } from './abstract/weierstrass.js';\n// connects noble-curves to noble-hashes\nexport function getHash(hash) {\n return {\n hash,\n hmac: (key, ...msgs) => hmac(hash, key, concatBytes(...msgs)),\n randomBytes,\n };\n}\nexport function createCurve(curveDef, defHash) {\n const create = (hash) => weierstrass({ ...curveDef, ...getHash(hash) });\n return Object.freeze({ ...create(defHash), create });\n}\n//# sourceMappingURL=_shortw_utils.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { sha256 } from '@noble/hashes/sha256';\nimport { randomBytes } from '@noble/hashes/utils';\nimport { createCurve } from './_shortw_utils.js';\nimport { createHasher, isogenyMap } from './abstract/hash-to-curve.js';\nimport { Field, mod, pow2 } from './abstract/modular.js';\nimport { inRange, aInRange, bytesToNumberBE, concatBytes, ensureBytes, numberToBytesBE, } from './abstract/utils.js';\nimport { mapToCurveSimpleSWU } from './abstract/weierstrass.js';\nconst secp256k1P = BigInt('0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f');\nconst secp256k1N = BigInt('0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141');\nconst _1n = BigInt(1);\nconst _2n = BigInt(2);\nconst divNearest = (a, b) => (a + b / _2n) / b;\n/**\n * √n = n^((p+1)/4) for fields p = 3 mod 4. We unwrap the loop and multiply bit-by-bit.\n * (P+1n/4n).toString(2) would produce bits [223x 1, 0, 22x 1, 4x 0, 11, 00]\n */\nfunction sqrtMod(y) {\n const P = secp256k1P;\n // prettier-ignore\n const _3n = BigInt(3), _6n = BigInt(6), _11n = BigInt(11), _22n = BigInt(22);\n // prettier-ignore\n const _23n = BigInt(23), _44n = BigInt(44), _88n = BigInt(88);\n const b2 = (y * y * y) % P; // x^3, 11\n const b3 = (b2 * b2 * y) % P; // x^7\n const b6 = (pow2(b3, _3n, P) * b3) % P;\n const b9 = (pow2(b6, _3n, P) * b3) % P;\n const b11 = (pow2(b9, _2n, P) * b2) % P;\n const b22 = (pow2(b11, _11n, P) * b11) % P;\n const b44 = (pow2(b22, _22n, P) * b22) % P;\n const b88 = (pow2(b44, _44n, P) * b44) % P;\n const b176 = (pow2(b88, _88n, P) * b88) % P;\n const b220 = (pow2(b176, _44n, P) * b44) % P;\n const b223 = (pow2(b220, _3n, P) * b3) % P;\n const t1 = (pow2(b223, _23n, P) * b22) % P;\n const t2 = (pow2(t1, _6n, P) * b2) % P;\n const root = pow2(t2, _2n, P);\n if (!Fp.eql(Fp.sqr(root), y))\n throw new Error('Cannot find square root');\n return root;\n}\nconst Fp = Field(secp256k1P, undefined, undefined, { sqrt: sqrtMod });\n/**\n * secp256k1 short weierstrass curve and ECDSA signatures over it.\n */\nexport const secp256k1 = createCurve({\n a: BigInt(0), // equation params: a, b\n b: BigInt(7), // Seem to be rigid: bitcointalk.org/index.php?topic=289795.msg3183975#msg3183975\n Fp, // Field's prime: 2n**256n - 2n**32n - 2n**9n - 2n**8n - 2n**7n - 2n**6n - 2n**4n - 1n\n n: secp256k1N, // Curve order, total count of valid points in the field\n // Base point (x, y) aka generator point\n Gx: BigInt('55066263022277343669578718895168534326250603453777594175500187360389116729240'),\n Gy: BigInt('32670510020758816978083085130507043184471273380659243275938904335757337482424'),\n h: BigInt(1), // Cofactor\n lowS: true, // Allow only low-S signatures by default in sign() and verify()\n /**\n * secp256k1 belongs to Koblitz curves: it has efficiently computable endomorphism.\n * Endomorphism uses 2x less RAM, speeds up precomputation by 2x and ECDH / key recovery by 20%.\n * For precomputed wNAF it trades off 1/2 init time & 1/3 ram for 20% perf hit.\n * Explanation: https://gist.github.com/paulmillr/eb670806793e84df628a7c434a873066\n */\n endo: {\n beta: BigInt('0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee'),\n splitScalar: (k) => {\n const n = secp256k1N;\n const a1 = BigInt('0x3086d221a7d46bcde86c90e49284eb15');\n const b1 = -_1n * BigInt('0xe4437ed6010e88286f547fa90abfe4c3');\n const a2 = BigInt('0x114ca50f7a8e2f3f657c1108d9d44cfd8');\n const b2 = a1;\n const POW_2_128 = BigInt('0x100000000000000000000000000000000'); // (2n**128n).toString(16)\n const c1 = divNearest(b2 * k, n);\n const c2 = divNearest(-b1 * k, n);\n let k1 = mod(k - c1 * a1 - c2 * a2, n);\n let k2 = mod(-c1 * b1 - c2 * b2, n);\n const k1neg = k1 > POW_2_128;\n const k2neg = k2 > POW_2_128;\n if (k1neg)\n k1 = n - k1;\n if (k2neg)\n k2 = n - k2;\n if (k1 > POW_2_128 || k2 > POW_2_128) {\n throw new Error('splitScalar: Endomorphism failed, k=' + k);\n }\n return { k1neg, k1, k2neg, k2 };\n },\n },\n}, sha256);\n// Schnorr signatures are superior to ECDSA from above. Below is Schnorr-specific BIP0340 code.\n// https://github.com/bitcoin/bips/blob/master/bip-0340.mediawiki\nconst _0n = BigInt(0);\n/** An object mapping tags to their tagged hash prefix of [SHA256(tag) | SHA256(tag)] */\nconst TAGGED_HASH_PREFIXES = {};\nfunction taggedHash(tag, ...messages) {\n let tagP = TAGGED_HASH_PREFIXES[tag];\n if (tagP === undefined) {\n const tagH = sha256(Uint8Array.from(tag, (c) => c.charCodeAt(0)));\n tagP = concatBytes(tagH, tagH);\n TAGGED_HASH_PREFIXES[tag] = tagP;\n }\n return sha256(concatBytes(tagP, ...messages));\n}\n// ECDSA compact points are 33-byte. Schnorr is 32: we strip first byte 0x02 or 0x03\nconst pointToBytes = (point) => point.toRawBytes(true).slice(1);\nconst numTo32b = (n) => numberToBytesBE(n, 32);\nconst modP = (x) => mod(x, secp256k1P);\nconst modN = (x) => mod(x, secp256k1N);\nconst Point = secp256k1.ProjectivePoint;\nconst GmulAdd = (Q, a, b) => Point.BASE.multiplyAndAddUnsafe(Q, a, b);\n// Calculate point, scalar and bytes\nfunction schnorrGetExtPubKey(priv) {\n let d_ = secp256k1.utils.normPrivateKeyToScalar(priv); // same method executed in fromPrivateKey\n let p = Point.fromPrivateKey(d_); // P = d'⋅G; 0 < d' < n check is done inside\n const scalar = p.hasEvenY() ? d_ : modN(-d_);\n return { scalar: scalar, bytes: pointToBytes(p) };\n}\n/**\n * lift_x from BIP340. Convert 32-byte x coordinate to elliptic curve point.\n * @returns valid point checked for being on-curve\n */\nfunction lift_x(x) {\n aInRange('x', x, _1n, secp256k1P); // Fail if x ≥ p.\n const xx = modP(x * x);\n const c = modP(xx * x + BigInt(7)); // Let c = x³ + 7 mod p.\n let y = sqrtMod(c); // Let y = c^(p+1)/4 mod p.\n if (y % _2n !== _0n)\n y = modP(-y); // Return the unique point P such that x(P) = x and\n const p = new Point(x, y, _1n); // y(P) = y if y mod 2 = 0 or y(P) = p-y otherwise.\n p.assertValidity();\n return p;\n}\nconst num = bytesToNumberBE;\n/**\n * Create tagged hash, convert it to bigint, reduce modulo-n.\n */\nfunction challenge(...args) {\n return modN(num(taggedHash('BIP0340/challenge', ...args)));\n}\n/**\n * Schnorr public key is just `x` coordinate of Point as per BIP340.\n */\nfunction schnorrGetPublicKey(privateKey) {\n return schnorrGetExtPubKey(privateKey).bytes; // d'=int(sk). Fail if d'=0 or d'≥n. Ret bytes(d'⋅G)\n}\n/**\n * Creates Schnorr signature as per BIP340. Verifies itself before returning anything.\n * auxRand is optional and is not the sole source of k generation: bad CSPRNG won't be dangerous.\n */\nfunction schnorrSign(message, privateKey, auxRand = randomBytes(32)) {\n const m = ensureBytes('message', message);\n const { bytes: px, scalar: d } = schnorrGetExtPubKey(privateKey); // checks for isWithinCurveOrder\n const a = ensureBytes('auxRand', auxRand, 32); // Auxiliary random data a: a 32-byte array\n const t = numTo32b(d ^ num(taggedHash('BIP0340/aux', a))); // Let t be the byte-wise xor of bytes(d) and hash/aux(a)\n const rand = taggedHash('BIP0340/nonce', t, px, m); // Let rand = hash/nonce(t || bytes(P) || m)\n const k_ = modN(num(rand)); // Let k' = int(rand) mod n\n if (k_ === _0n)\n throw new Error('sign failed: k is zero'); // Fail if k' = 0.\n const { bytes: rx, scalar: k } = schnorrGetExtPubKey(k_); // Let R = k'⋅G.\n const e = challenge(rx, px, m); // Let e = int(hash/challenge(bytes(R) || bytes(P) || m)) mod n.\n const sig = new Uint8Array(64); // Let sig = bytes(R) || bytes((k + ed) mod n).\n sig.set(rx, 0);\n sig.set(numTo32b(modN(k + e * d)), 32);\n // If Verify(bytes(P), m, sig) (see below) returns failure, abort\n if (!schnorrVerify(sig, m, px))\n throw new Error('sign: Invalid signature produced');\n return sig;\n}\n/**\n * Verifies Schnorr signature.\n * Will swallow errors & return false except for initial type validation of arguments.\n */\nfunction schnorrVerify(signature, message, publicKey) {\n const sig = ensureBytes('signature', signature, 64);\n const m = ensureBytes('message', message);\n const pub = ensureBytes('publicKey', publicKey, 32);\n try {\n const P = lift_x(num(pub)); // P = lift_x(int(pk)); fail if that fails\n const r = num(sig.subarray(0, 32)); // Let r = int(sig[0:32]); fail if r ≥ p.\n if (!inRange(r, _1n, secp256k1P))\n return false;\n const s = num(sig.subarray(32, 64)); // Let s = int(sig[32:64]); fail if s ≥ n.\n if (!inRange(s, _1n, secp256k1N))\n return false;\n const e = challenge(numTo32b(r), pointToBytes(P), m); // int(challenge(bytes(r)||bytes(P)||m))%n\n const R = GmulAdd(P, s, modN(-e)); // R = s⋅G - e⋅P\n if (!R || !R.hasEvenY() || R.toAffine().x !== r)\n return false; // -eP == (n-e)P\n return true; // Fail if is_infinite(R) / not has_even_y(R) / x(R) ≠ r.\n }\n catch (error) {\n return false;\n }\n}\n/**\n * Schnorr signatures over secp256k1.\n */\nexport const schnorr = /* @__PURE__ */ (() => ({\n getPublicKey: schnorrGetPublicKey,\n sign: schnorrSign,\n verify: schnorrVerify,\n utils: {\n randomPrivateKey: secp256k1.utils.randomPrivateKey,\n lift_x,\n pointToBytes,\n numberToBytesBE,\n bytesToNumberBE,\n taggedHash,\n mod,\n },\n}))();\nconst isoMap = /* @__PURE__ */ (() => isogenyMap(Fp, [\n // xNum\n [\n '0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa8c7',\n '0x7d3d4c80bc321d5b9f315cea7fd44c5d595d2fc0bf63b92dfff1044f17c6581',\n '0x534c328d23f234e6e2a413deca25caece4506144037c40314ecbd0b53d9dd262',\n '0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa88c',\n ],\n // xDen\n [\n '0xd35771193d94918a9ca34ccbb7b640dd86cd409542f8487d9fe6b745781eb49b',\n '0xedadc6f64383dc1df7c4b2d51b54225406d36b641f5e41bbc52a56612a8c6d14',\n '0x0000000000000000000000000000000000000000000000000000000000000001', // LAST 1\n ],\n // yNum\n [\n '0x4bda12f684bda12f684bda12f684bda12f684bda12f684bda12f684b8e38e23c',\n '0xc75e0c32d5cb7c0fa9d0a54b12a0a6d5647ab046d686da6fdffc90fc201d71a3',\n '0x29a6194691f91a73715209ef6512e576722830a201be2018a765e85a9ecee931',\n '0x2f684bda12f684bda12f684bda12f684bda12f684bda12f684bda12f38e38d84',\n ],\n // yDen\n [\n '0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffff93b',\n '0x7a06534bb8bdb49fd5e9e6632722c2989467c1bfc8e8d978dfb425d2685c2573',\n '0x6484aa716545ca2cf3a70c3fa8fe337e0a3d21162f0d6299a7bf8192bfd2a76f',\n '0x0000000000000000000000000000000000000000000000000000000000000001', // LAST 1\n ],\n].map((i) => i.map((j) => BigInt(j)))))();\nconst mapSWU = /* @__PURE__ */ (() => mapToCurveSimpleSWU(Fp, {\n A: BigInt('0x3f8731abdd661adca08a5558f0f5d272e953d363cb6f0e5d405447c01a444533'),\n B: BigInt('1771'),\n Z: Fp.create(BigInt('-11')),\n}))();\nconst htf = /* @__PURE__ */ (() => createHasher(secp256k1.ProjectivePoint, (scalars) => {\n const { x, y } = mapSWU(Fp.create(scalars[0]));\n return isoMap(x, y);\n}, {\n DST: 'secp256k1_XMD:SHA-256_SSWU_RO_',\n encodeDST: 'secp256k1_XMD:SHA-256_SSWU_NU_',\n p: Fp.ORDER,\n m: 1,\n k: 128,\n expand: 'xmd',\n hash: sha256,\n}))();\nexport const hashToCurve = /* @__PURE__ */ (() => htf.hashToCurve)();\nexport const encodeToCurve = /* @__PURE__ */ (() => htf.encodeToCurve)();\n//# sourceMappingURL=secp256k1.js.map","import { CodeError } from '@libp2p/interface';\nimport { secp256k1 as secp } from '@noble/curves/secp256k1';\nimport { sha256 } from 'multiformats/hashes/sha2';\nimport { isPromise } from '../util.js';\nconst PRIVATE_KEY_BYTE_LENGTH = 32;\nexport { PRIVATE_KEY_BYTE_LENGTH as privateKeyLength };\nexport function generateKey() {\n return secp.utils.randomPrivateKey();\n}\n/**\n * Hash and sign message with private key\n */\nexport function hashAndSign(key, msg) {\n const p = sha256.digest(msg instanceof Uint8Array ? msg : msg.subarray());\n if (isPromise(p)) {\n return p.then(({ digest }) => secp.sign(digest, key).toDERRawBytes())\n .catch(err => {\n throw new CodeError(String(err), 'ERR_INVALID_INPUT');\n });\n }\n try {\n return secp.sign(p.digest, key).toDERRawBytes();\n }\n catch (err) {\n throw new CodeError(String(err), 'ERR_INVALID_INPUT');\n }\n}\n/**\n * Hash message and verify signature with public key\n */\nexport function hashAndVerify(key, sig, msg) {\n const p = sha256.digest(msg instanceof Uint8Array ? msg : msg.subarray());\n if (isPromise(p)) {\n return p.then(({ digest }) => secp.verify(sig, digest, key))\n .catch(err => {\n throw new CodeError(String(err), 'ERR_INVALID_INPUT');\n });\n }\n try {\n return secp.verify(sig, p.digest, key);\n }\n catch (err) {\n throw new CodeError(String(err), 'ERR_INVALID_INPUT');\n }\n}\nexport function compressPublicKey(key) {\n const point = secp.ProjectivePoint.fromHex(key).toRawBytes(true);\n return point;\n}\nexport function decompressPublicKey(key) {\n const point = secp.ProjectivePoint.fromHex(key).toRawBytes(false);\n return point;\n}\nexport function validatePrivateKey(key) {\n try {\n secp.getPublicKey(key, true);\n }\n catch (err) {\n throw new CodeError(String(err), 'ERR_INVALID_PRIVATE_KEY');\n }\n}\nexport function validatePublicKey(key) {\n try {\n secp.ProjectivePoint.fromHex(key);\n }\n catch (err) {\n throw new CodeError(String(err), 'ERR_INVALID_PUBLIC_KEY');\n }\n}\nexport function computePublicKey(privateKey) {\n try {\n return secp.getPublicKey(privateKey, true);\n }\n catch (err) {\n throw new CodeError(String(err), 'ERR_INVALID_PRIVATE_KEY');\n }\n}\n//# sourceMappingURL=secp256k1-browser.js.map","import { CodeError } from '@libp2p/interface';\nimport { sha256 } from 'multiformats/hashes/sha2';\nimport { equals as uint8ArrayEquals } from 'uint8arrays/equals';\nimport { toString as uint8ArrayToString } from 'uint8arrays/to-string';\nimport { isPromise } from '../util.js';\nimport { exporter } from './exporter.js';\nimport * as keysProtobuf from './keys.js';\nimport * as crypto from './secp256k1.js';\nexport class Secp256k1PublicKey {\n _key;\n constructor(key) {\n crypto.validatePublicKey(key);\n this._key = key;\n }\n verify(data, sig) {\n return crypto.hashAndVerify(this._key, sig, data);\n }\n marshal() {\n return crypto.compressPublicKey(this._key);\n }\n get bytes() {\n return keysProtobuf.PublicKey.encode({\n Type: keysProtobuf.KeyType.Secp256k1,\n Data: this.marshal()\n }).subarray();\n }\n equals(key) {\n return uint8ArrayEquals(this.bytes, key.bytes);\n }\n async hash() {\n const p = sha256.digest(this.bytes);\n let bytes;\n if (isPromise(p)) {\n ({ bytes } = await p);\n }\n else {\n bytes = p.bytes;\n }\n return bytes;\n }\n}\nexport class Secp256k1PrivateKey {\n _key;\n _publicKey;\n constructor(key, publicKey) {\n this._key = key;\n this._publicKey = publicKey ?? crypto.computePublicKey(key);\n crypto.validatePrivateKey(this._key);\n crypto.validatePublicKey(this._publicKey);\n }\n sign(message) {\n return crypto.hashAndSign(this._key, message);\n }\n get public() {\n return new Secp256k1PublicKey(this._publicKey);\n }\n marshal() {\n return this._key;\n }\n get bytes() {\n return keysProtobuf.PrivateKey.encode({\n Type: keysProtobuf.KeyType.Secp256k1,\n Data: this.marshal()\n }).subarray();\n }\n equals(key) {\n return uint8ArrayEquals(this.bytes, key.bytes);\n }\n hash() {\n const p = sha256.digest(this.bytes);\n if (isPromise(p)) {\n return p.then(({ bytes }) => bytes);\n }\n return p.bytes;\n }\n /**\n * Gets the ID of the key.\n *\n * The key id is the base58 encoding of the SHA-256 multihash of its public key.\n * The public key is a protobuf encoding containing a type and the DER encoding\n * of the PKCS SubjectPublicKeyInfo.\n */\n async id() {\n const hash = await this.public.hash();\n return uint8ArrayToString(hash, 'base58btc');\n }\n /**\n * Exports the key into a password protected `format`\n */\n async export(password, format = 'libp2p-key') {\n if (format === 'libp2p-key') {\n return exporter(this.bytes, password);\n }\n else {\n throw new CodeError(`export format '${format}' is not supported`, 'ERR_INVALID_EXPORT_FORMAT');\n }\n }\n}\nexport function unmarshalSecp256k1PrivateKey(bytes) {\n return new Secp256k1PrivateKey(bytes);\n}\nexport function unmarshalSecp256k1PublicKey(bytes) {\n return new Secp256k1PublicKey(bytes);\n}\nexport async function generateKeyPair() {\n const privateKeyBytes = crypto.generateKey();\n return new Secp256k1PrivateKey(privateKeyBytes);\n}\n//# sourceMappingURL=secp256k1-class.js.map","/**\n * @packageDocumentation\n *\n * **Supported Key Types**\n *\n * The {@link generateKeyPair}, {@link marshalPublicKey}, and {@link marshalPrivateKey} functions accept a string `type` argument.\n *\n * Currently the `'RSA'`, `'ed25519'`, and `secp256k1` types are supported, although ed25519 and secp256k1 keys support only signing and verification of messages.\n *\n * For encryption / decryption support, RSA keys should be used.\n */\nimport { CodeError } from '@libp2p/interface';\nimport * as Ed25519 from './ed25519-class.js';\nimport generateEphemeralKeyPair from './ephemeral-keys.js';\nimport { importer } from './importer.js';\nimport { keyStretcher } from './key-stretcher.js';\nimport * as keysPBM from './keys.js';\nimport * as RSA from './rsa-class.js';\nimport { importFromPem } from './rsa-utils.js';\nimport * as Secp256k1 from './secp256k1-class.js';\nexport { keyStretcher };\nexport { generateEphemeralKeyPair };\nexport { keysPBM };\nexport { RsaPrivateKey, RsaPublicKey, MAX_RSA_KEY_SIZE } from './rsa-class.js';\nexport { Ed25519PrivateKey, Ed25519PublicKey } from './ed25519-class.js';\nexport { Secp256k1PrivateKey, Secp256k1PublicKey } from './secp256k1-class.js';\nexport const supportedKeys = {\n rsa: RSA,\n ed25519: Ed25519,\n secp256k1: Secp256k1\n};\nfunction unsupportedKey(type) {\n const supported = Object.keys(supportedKeys).join(' / ');\n return new CodeError(`invalid or unsupported key type ${type}. Must be ${supported}`, 'ERR_UNSUPPORTED_KEY_TYPE');\n}\nfunction typeToKey(type) {\n type = type.toLowerCase();\n if (type === 'rsa' || type === 'ed25519' || type === 'secp256k1') {\n return supportedKeys[type];\n }\n throw unsupportedKey(type);\n}\n/**\n * Generates a keypair of the given type and bitsize\n */\nexport async function generateKeyPair(type, bits) {\n return typeToKey(type).generateKeyPair(bits ?? 2048);\n}\n/**\n * Generates a keypair of the given type and bitsize.\n *\n * Seed is a 32 byte uint8array\n */\nexport async function generateKeyPairFromSeed(type, seed, bits) {\n if (type.toLowerCase() !== 'ed25519') {\n throw new CodeError('Seed key derivation is unimplemented for RSA or secp256k1', 'ERR_UNSUPPORTED_KEY_DERIVATION_TYPE');\n }\n return Ed25519.generateKeyPairFromSeed(seed);\n}\n/**\n * Converts a protobuf serialized public key into its representative object\n */\nexport function unmarshalPublicKey(buf) {\n const decoded = keysPBM.PublicKey.decode(buf);\n const data = decoded.Data ?? new Uint8Array();\n switch (decoded.Type) {\n case keysPBM.KeyType.RSA:\n return supportedKeys.rsa.unmarshalRsaPublicKey(data);\n case keysPBM.KeyType.Ed25519:\n return supportedKeys.ed25519.unmarshalEd25519PublicKey(data);\n case keysPBM.KeyType.Secp256k1:\n return supportedKeys.secp256k1.unmarshalSecp256k1PublicKey(data);\n default:\n throw unsupportedKey(decoded.Type ?? 'unknown');\n }\n}\n/**\n * Converts a public key object into a protobuf serialized public key\n */\nexport function marshalPublicKey(key, type) {\n type = (type ?? 'rsa').toLowerCase();\n typeToKey(type); // check type\n return key.bytes;\n}\n/**\n * Converts a protobuf serialized private key into its representative object\n */\nexport async function unmarshalPrivateKey(buf) {\n const decoded = keysPBM.PrivateKey.decode(buf);\n const data = decoded.Data ?? new Uint8Array();\n switch (decoded.Type) {\n case keysPBM.KeyType.RSA:\n return supportedKeys.rsa.unmarshalRsaPrivateKey(data);\n case keysPBM.KeyType.Ed25519:\n return supportedKeys.ed25519.unmarshalEd25519PrivateKey(data);\n case keysPBM.KeyType.Secp256k1:\n return supportedKeys.secp256k1.unmarshalSecp256k1PrivateKey(data);\n default:\n throw unsupportedKey(decoded.Type ?? 'RSA');\n }\n}\n/**\n * Converts a private key object into a protobuf serialized private key\n */\nexport function marshalPrivateKey(key, type) {\n type = (type ?? 'rsa').toLowerCase();\n typeToKey(type); // check type\n return key.bytes;\n}\n/**\n * Converts an exported private key into its representative object.\n *\n * Supported formats are 'pem' (RSA only) and 'libp2p-key'.\n */\nexport async function importKey(encryptedKey, password) {\n try {\n const key = await importer(encryptedKey, password);\n return await unmarshalPrivateKey(key);\n }\n catch (_) {\n // Ignore and try the old pem decrypt\n }\n if (!encryptedKey.includes('BEGIN')) {\n throw new CodeError('Encrypted key was not a libp2p-key or a PEM file', 'ERR_INVALID_IMPORT_FORMAT');\n }\n return importFromPem(encryptedKey, password);\n}\n//# sourceMappingURL=index.js.map","/**\n * @packageDocumentation\n *\n * Exports a `Libp2p` type for modules to use as a type argument.\n *\n * @example\n *\n * ```typescript\n * import type { Libp2p } from '@libp2p/interface'\n *\n * function doSomethingWithLibp2p (node: Libp2p) {\n * // ...\n * }\n * ```\n */\n/**\n * This symbol is used by libp2p services to define the capabilities they can\n * provide to other libp2p services.\n *\n * The service should define a property with this symbol as the key and the\n * value should be a string array of provided capabilities.\n */\nexport const serviceCapabilities = Symbol.for('@libp2p/service-capabilities');\n/**\n * This symbol is used by libp2p services to define the capabilities they\n * require from other libp2p services.\n *\n * The service should define a property with this symbol as the key and the\n * value should be a string array of required capabilities.\n */\nexport const serviceDependencies = Symbol.for('@libp2p/service-dependencies');\nexport * from './connection/index.js';\nexport * from './connection-encrypter/index.js';\nexport * from './connection-gater/index.js';\nexport * from './content-routing/index.js';\nexport * from './keys/index.js';\nexport * from './metrics/index.js';\nexport * from './peer-discovery/index.js';\nexport * from './peer-id/index.js';\nexport * from './peer-info/index.js';\nexport * from './peer-routing/index.js';\nexport * from './peer-store/index.js';\nexport * from './peer-store/tags.js';\nexport * from './pubsub/index.js';\nexport * from './record/index.js';\nexport * from './stream-handler/index.js';\nexport * from './stream-muxer/index.js';\nexport * from './topology/index.js';\nexport * from './transport/index.js';\nexport * from './errors.js';\nexport * from './event-target.js';\nexport * from './events.js';\nexport * from './startable.js';\n//# sourceMappingURL=index.js.map","/**\n * @packageDocumentation\n *\n * An implementation of a peer id\n *\n * @example\n *\n * ```TypeScript\n * import { peerIdFromString } from '@libp2p/peer-id'\n * const peer = peerIdFromString('k51qzi5uqu5dkwkqm42v9j9kqcam2jiuvloi16g72i4i4amoo2m8u3ol3mqu6s')\n *\n * console.log(peer.toCID()) // CID(bafzaa...)\n * console.log(peer.toString()) // \"12D3K...\"\n * ```\n */\nimport { CodeError } from '@libp2p/interface';\nimport { peerIdSymbol } from '@libp2p/interface';\nimport { base58btc } from 'multiformats/bases/base58';\nimport { bases } from 'multiformats/basics';\nimport { CID } from 'multiformats/cid';\nimport * as Digest from 'multiformats/hashes/digest';\nimport { identity } from 'multiformats/hashes/identity';\nimport { sha256 } from 'multiformats/hashes/sha2';\nimport { equals as uint8ArrayEquals } from 'uint8arrays/equals';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport { toString as uint8ArrayToString } from 'uint8arrays/to-string';\nconst inspect = Symbol.for('nodejs.util.inspect.custom');\nconst baseDecoder = Object\n .values(bases)\n .map(codec => codec.decoder)\n // @ts-expect-error https://github.com/multiformats/js-multiformats/issues/141\n .reduce((acc, curr) => acc.or(curr), bases.identity.decoder);\n// these values are from https://github.com/multiformats/multicodec/blob/master/table.csv\nconst LIBP2P_KEY_CODE = 0x72;\nconst MARSHALLED_ED225519_PUBLIC_KEY_LENGTH = 36;\nconst MARSHALLED_SECP256K1_PUBLIC_KEY_LENGTH = 37;\nclass PeerIdImpl {\n type;\n multihash;\n privateKey;\n publicKey;\n string;\n constructor(init) {\n this.type = init.type;\n this.multihash = init.multihash;\n this.privateKey = init.privateKey;\n // mark string cache as non-enumerable\n Object.defineProperty(this, 'string', {\n enumerable: false,\n writable: true\n });\n }\n get [Symbol.toStringTag]() {\n return `PeerId(${this.toString()})`;\n }\n [peerIdSymbol] = true;\n toString() {\n if (this.string == null) {\n this.string = base58btc.encode(this.multihash.bytes).slice(1);\n }\n return this.string;\n }\n // return self-describing String representation\n // in default format from RFC 0001: https://github.com/libp2p/specs/pull/209\n toCID() {\n return CID.createV1(LIBP2P_KEY_CODE, this.multihash);\n }\n toBytes() {\n return this.multihash.bytes;\n }\n /**\n * Returns Multiaddr as a JSON string\n */\n toJSON() {\n return this.toString();\n }\n /**\n * Checks the equality of `this` peer against a given PeerId\n */\n equals(id) {\n if (id == null) {\n return false;\n }\n if (id instanceof Uint8Array) {\n return uint8ArrayEquals(this.multihash.bytes, id);\n }\n else if (typeof id === 'string') {\n return peerIdFromString(id).equals(this);\n }\n else if (id?.multihash?.bytes != null) {\n return uint8ArrayEquals(this.multihash.bytes, id.multihash.bytes);\n }\n else {\n throw new Error('not valid Id');\n }\n }\n /**\n * Returns PeerId as a human-readable string\n * https://nodejs.org/api/util.html#utilinspectcustom\n *\n * @example\n * ```TypeScript\n * import { peerIdFromString } from '@libp2p/peer-id'\n *\n * console.info(peerIdFromString('QmFoo'))\n * // 'PeerId(QmFoo)'\n * ```\n */\n [inspect]() {\n return `PeerId(${this.toString()})`;\n }\n}\nclass RSAPeerIdImpl extends PeerIdImpl {\n type = 'RSA';\n publicKey;\n constructor(init) {\n super({ ...init, type: 'RSA' });\n this.publicKey = init.publicKey;\n }\n}\nclass Ed25519PeerIdImpl extends PeerIdImpl {\n type = 'Ed25519';\n publicKey;\n constructor(init) {\n super({ ...init, type: 'Ed25519' });\n this.publicKey = init.multihash.digest;\n }\n}\nclass Secp256k1PeerIdImpl extends PeerIdImpl {\n type = 'secp256k1';\n publicKey;\n constructor(init) {\n super({ ...init, type: 'secp256k1' });\n this.publicKey = init.multihash.digest;\n }\n}\n// these values are from https://github.com/multiformats/multicodec/blob/master/table.csv\nconst TRANSPORT_IPFS_GATEWAY_HTTP_CODE = 0x0920;\nclass URLPeerIdImpl {\n type = 'url';\n multihash;\n privateKey;\n publicKey;\n url;\n constructor(url) {\n this.url = url.toString();\n this.multihash = identity.digest(uint8ArrayFromString(this.url));\n }\n [inspect]() {\n return `PeerId(${this.url})`;\n }\n [peerIdSymbol] = true;\n toString() {\n return this.toCID().toString();\n }\n toCID() {\n return CID.createV1(TRANSPORT_IPFS_GATEWAY_HTTP_CODE, this.multihash);\n }\n toBytes() {\n return this.toCID().bytes;\n }\n equals(other) {\n if (other == null) {\n return false;\n }\n if (other instanceof Uint8Array) {\n other = uint8ArrayToString(other);\n }\n return other.toString() === this.toString();\n }\n}\nexport function createPeerId(init) {\n if (init.type === 'RSA') {\n return new RSAPeerIdImpl(init);\n }\n if (init.type === 'Ed25519') {\n return new Ed25519PeerIdImpl(init);\n }\n if (init.type === 'secp256k1') {\n return new Secp256k1PeerIdImpl(init);\n }\n throw new CodeError('Type must be \"RSA\", \"Ed25519\" or \"secp256k1\"', 'ERR_INVALID_PARAMETERS');\n}\nexport function peerIdFromPeerId(other) {\n if (other.type === 'RSA') {\n return new RSAPeerIdImpl(other);\n }\n if (other.type === 'Ed25519') {\n return new Ed25519PeerIdImpl(other);\n }\n if (other.type === 'secp256k1') {\n return new Secp256k1PeerIdImpl(other);\n }\n throw new CodeError('Not a PeerId', 'ERR_INVALID_PARAMETERS');\n}\nexport function peerIdFromString(str, decoder) {\n decoder = decoder ?? baseDecoder;\n if (str.charAt(0) === '1' || str.charAt(0) === 'Q') {\n // identity hash ed25519/secp256k1 key or sha2-256 hash of\n // rsa public key - base58btc encoded either way\n const multihash = Digest.decode(base58btc.decode(`z${str}`));\n if (str.startsWith('12D')) {\n return new Ed25519PeerIdImpl({ multihash });\n }\n else if (str.startsWith('16U')) {\n return new Secp256k1PeerIdImpl({ multihash });\n }\n else {\n return new RSAPeerIdImpl({ multihash });\n }\n }\n return peerIdFromBytes(baseDecoder.decode(str));\n}\nexport function peerIdFromBytes(buf) {\n try {\n const multihash = Digest.decode(buf);\n if (multihash.code === identity.code) {\n if (multihash.digest.length === MARSHALLED_ED225519_PUBLIC_KEY_LENGTH) {\n return new Ed25519PeerIdImpl({ multihash });\n }\n else if (multihash.digest.length === MARSHALLED_SECP256K1_PUBLIC_KEY_LENGTH) {\n return new Secp256k1PeerIdImpl({ multihash });\n }\n }\n if (multihash.code === sha256.code) {\n return new RSAPeerIdImpl({ multihash });\n }\n }\n catch {\n return peerIdFromCID(CID.decode(buf));\n }\n throw new Error('Supplied PeerID CID is invalid');\n}\nexport function peerIdFromCID(cid) {\n if (cid?.multihash == null || cid.version == null || (cid.version === 1 && (cid.code !== LIBP2P_KEY_CODE) && cid.code !== TRANSPORT_IPFS_GATEWAY_HTTP_CODE)) {\n throw new Error('Supplied PeerID CID is invalid');\n }\n if (cid.code === TRANSPORT_IPFS_GATEWAY_HTTP_CODE) {\n const url = uint8ArrayToString(cid.multihash.digest);\n return new URLPeerIdImpl(new URL(url));\n }\n const multihash = cid.multihash;\n if (multihash.code === sha256.code) {\n return new RSAPeerIdImpl({ multihash: cid.multihash });\n }\n else if (multihash.code === identity.code) {\n if (multihash.digest.length === MARSHALLED_ED225519_PUBLIC_KEY_LENGTH) {\n return new Ed25519PeerIdImpl({ multihash: cid.multihash });\n }\n else if (multihash.digest.length === MARSHALLED_SECP256K1_PUBLIC_KEY_LENGTH) {\n return new Secp256k1PeerIdImpl({ multihash: cid.multihash });\n }\n }\n throw new Error('Supplied PeerID CID is invalid');\n}\n/**\n * @param publicKey - A marshalled public key\n * @param privateKey - A marshalled private key\n */\nexport async function peerIdFromKeys(publicKey, privateKey) {\n if (publicKey.length === MARSHALLED_ED225519_PUBLIC_KEY_LENGTH) {\n return new Ed25519PeerIdImpl({ multihash: Digest.create(identity.code, publicKey), privateKey });\n }\n if (publicKey.length === MARSHALLED_SECP256K1_PUBLIC_KEY_LENGTH) {\n return new Secp256k1PeerIdImpl({ multihash: Digest.create(identity.code, publicKey), privateKey });\n }\n return new RSAPeerIdImpl({ multihash: await sha256.digest(publicKey), publicKey, privateKey });\n}\n//# sourceMappingURL=index.js.map","/**\n * An abort error class that extends error\n */\nexport class AbortError extends Error {\n type;\n code;\n constructor(message, code, name) {\n super(message ?? 'The operation was aborted');\n this.type = 'aborted';\n this.name = name ?? 'AbortError';\n this.code = code ?? 'ABORT_ERR';\n }\n}\n/**\n * Race a promise against an abort signal\n */\nexport async function raceSignal(promise, signal, opts) {\n if (signal == null) {\n return promise;\n }\n if (signal.aborted) {\n return Promise.reject(new AbortError(opts?.errorMessage, opts?.errorCode, opts?.errorName));\n }\n let listener;\n // create the error here so we have more context in the stack trace\n const error = new AbortError(opts?.errorMessage, opts?.errorCode, opts?.errorName);\n try {\n return await Promise.race([\n promise,\n new Promise((resolve, reject) => {\n listener = () => {\n reject(error);\n };\n signal.addEventListener('abort', listener);\n })\n ]);\n }\n finally {\n if (listener != null) {\n signal.removeEventListener('abort', listener);\n }\n }\n}\n//# sourceMappingURL=index.js.map","/**\n * @packageDocumentation\n *\n * A pushable async generator that waits until the current value is consumed\n * before allowing a new value to be pushed.\n *\n * Useful for when you don't want to keep memory usage under control and/or\n * allow a downstream consumer to dictate how fast data flows through a pipe,\n * but you want to be able to apply a transform to that data.\n *\n * @example\n *\n * ```typescript\n * import { queuelessPushable } from 'it-queueless-pushable'\n *\n * const pushable = queuelessPushable()\n *\n * // run asynchronously\n * Promise.resolve().then(async () => {\n * // push a value - the returned promise will not resolve until the value is\n * // read from the pushable\n * await pushable.push('hello')\n * })\n *\n * // read a value\n * const result = await pushable.next()\n * console.info(result) // { done: false, value: 'hello' }\n * ```\n */\nimport deferred, {} from 'p-defer';\nimport { raceSignal } from 'race-signal';\nclass QueuelessPushable {\n readNext;\n haveNext;\n ended;\n nextResult;\n constructor() {\n this.ended = false;\n this.readNext = deferred();\n this.haveNext = deferred();\n }\n [Symbol.asyncIterator]() {\n return this;\n }\n async next() {\n if (this.nextResult == null) {\n // wait for the supplier to push a value\n await this.haveNext.promise;\n }\n if (this.nextResult == null) {\n throw new Error('HaveNext promise resolved but nextResult was undefined');\n }\n const nextResult = this.nextResult;\n this.nextResult = undefined;\n // signal to the supplier that we read the value\n this.readNext.resolve();\n this.readNext = deferred();\n return nextResult;\n }\n async throw(err) {\n this.ended = true;\n if (err != null) {\n // this can cause unhandled promise rejections if nothing is awaiting the\n // next value so attach a dummy catch listener to the promise\n this.haveNext.promise.catch(() => { });\n this.haveNext.reject(err);\n }\n const result = {\n done: true,\n value: undefined\n };\n return result;\n }\n async return() {\n const result = {\n done: true,\n value: undefined\n };\n await this._push(undefined);\n return result;\n }\n async push(value, options) {\n await this._push(value, options);\n }\n async end(err, options) {\n if (err != null) {\n await this.throw(err);\n }\n else {\n // abortable return\n await this._push(undefined, options);\n }\n }\n async _push(value, options) {\n if (value != null && this.ended) {\n throw new Error('Cannot push value onto an ended pushable');\n }\n // wait for all values to be read\n while (this.nextResult != null) {\n await this.readNext.promise;\n }\n if (value != null) {\n this.nextResult = { done: false, value };\n }\n else {\n this.ended = true;\n this.nextResult = { done: true, value: undefined };\n }\n // let the consumer know we have a new value\n this.haveNext.resolve();\n this.haveNext = deferred();\n // wait for the consumer to have finished processing the value and requested\n // the next one or for the passed signal to abort the waiting\n await raceSignal(this.readNext.promise, options?.signal, options);\n }\n}\nexport function queuelessPushable() {\n return new QueuelessPushable();\n}\n//# sourceMappingURL=index.js.map","/**\n * The incoming stream ended before the expected number of bytes were read\n */\nexport class UnexpectedEOFError extends Error {\n name = 'UnexpectedEOFError';\n code = 'ERR_UNEXPECTED_EOF';\n}\n//# sourceMappingURL=errors.js.map","/**\n * @packageDocumentation\n *\n * This module makes it easy to send and receive bytes over streams.\n *\n * @example\n *\n * ```typescript\n * import { byteStream } from 'it-byte-stream'\n *\n * const stream = byteStream(duplex)\n *\n * // read the next chunk\n * const bytes = await stream.read()\n *\n * // read the next five bytes\n * const fiveBytes = await stream.read(5)\n *\n * // write bytes into the stream\n * await stream.write(Uint8Array.from([0, 1, 2, 3, 4]))\n * ```\n */\nimport { queuelessPushable } from 'it-queueless-pushable';\nimport { Uint8ArrayList } from 'uint8arraylist';\nimport { UnexpectedEOFError } from './errors.js';\n/**\n * @deprecated This will not be exported in a future release\n */\nexport class CodeError extends Error {\n code;\n constructor(message, code) {\n super(message);\n this.code = code;\n }\n}\n/**\n * @deprecated This will not be exported in a future release\n */\nexport class AbortError extends CodeError {\n type;\n constructor(message) {\n super(message, 'ABORT_ERR');\n this.type = 'aborted';\n this.name = 'AbortError';\n }\n}\nexport function byteStream(duplex, opts) {\n const write = queuelessPushable();\n duplex.sink(write).catch(async (err) => {\n await write.end(err);\n });\n duplex.sink = async (source) => {\n for await (const buf of source) {\n await write.push(buf);\n }\n await write.end();\n };\n let source = duplex.source;\n if (duplex.source[Symbol.iterator] != null) {\n source = duplex.source[Symbol.iterator]();\n }\n else if (duplex.source[Symbol.asyncIterator] != null) {\n source = duplex.source[Symbol.asyncIterator]();\n }\n const readBuffer = new Uint8ArrayList();\n const W = {\n read: async (bytes, options) => {\n options?.signal?.throwIfAborted();\n let listener;\n const abortPromise = new Promise((resolve, reject) => {\n listener = () => {\n reject(new AbortError('Read aborted'));\n };\n options?.signal?.addEventListener('abort', listener);\n });\n try {\n if (bytes == null) {\n // just read whatever arrives\n const { done, value } = await Promise.race([\n source.next(),\n abortPromise\n ]);\n if (done === true) {\n return new Uint8ArrayList();\n }\n return value;\n }\n while (readBuffer.byteLength < bytes) {\n const { value, done } = await Promise.race([\n source.next(),\n abortPromise\n ]);\n if (done === true) {\n throw new UnexpectedEOFError('unexpected end of input');\n }\n readBuffer.append(value);\n }\n const buf = readBuffer.sublist(0, bytes);\n readBuffer.consume(bytes);\n return buf;\n }\n finally {\n if (listener != null) {\n options?.signal?.removeEventListener('abort', listener);\n }\n }\n },\n write: async (data, options) => {\n options?.signal?.throwIfAborted();\n // just write\n if (data instanceof Uint8Array) {\n await write.push(data, options);\n }\n else {\n await write.push(data.subarray(), options);\n }\n },\n unwrap: () => {\n if (readBuffer.byteLength > 0) {\n const originalStream = duplex.source;\n duplex.source = (async function* () {\n if (opts?.yieldBytes === false) {\n yield readBuffer;\n }\n else {\n yield* readBuffer;\n }\n yield* originalStream;\n }());\n }\n return duplex;\n }\n };\n return W;\n}\n//# sourceMappingURL=index.js.map","/**\n * The reported length of the next data message was not a positive integer\n */\nexport class InvalidMessageLengthError extends Error {\n name = 'InvalidMessageLengthError';\n code = 'ERR_INVALID_MSG_LENGTH';\n}\n/**\n * The reported length of the next data message was larger than the configured\n * max allowable value\n */\nexport class InvalidDataLengthError extends Error {\n name = 'InvalidDataLengthError';\n code = 'ERR_MSG_DATA_TOO_LONG';\n}\n/**\n * The varint used to specify the length of the next data message contained more\n * bytes than the configured max allowable value\n */\nexport class InvalidDataLengthLengthError extends Error {\n name = 'InvalidDataLengthLengthError';\n code = 'ERR_MSG_LENGTH_TOO_LONG';\n}\n//# sourceMappingURL=errors.js.map","/**\n * @packageDocumentation\n *\n * This module makes it easy to send and receive length-prefixed byte arrays over streams.\n *\n * @example\n *\n * ```typescript\n * import { lpStream } from 'it-length-prefixed-stream'\n *\n * const stream = lpStream(duplex)\n *\n * // read the next length-prefixed chunk\n * const bytes = await stream.read()\n *\n * // write a length-prefixed chunk\n * await stream.write(Uint8Array.from([0, 1, 2, 3, 4]))\n *\n * // write several chunks, all individually length-prefixed\n * await stream.writeV([\n * Uint8Array.from([0, 1, 2, 3, 4]),\n * Uint8Array.from([5, 6, 7, 8, 9])\n * ])\n * ```\n */\nimport { byteStream } from 'it-byte-stream';\nimport * as varint from 'uint8-varint';\nimport { Uint8ArrayList } from 'uint8arraylist';\nimport { InvalidDataLengthError, InvalidDataLengthLengthError, InvalidMessageLengthError } from './errors.js';\nexport function lpStream(duplex, opts = {}) {\n const bytes = byteStream(duplex, opts);\n if (opts.maxDataLength != null && opts.maxLengthLength == null) {\n // if max data length is set but max length length is not, calculate the\n // max length length needed to encode max data length\n opts.maxLengthLength = varint.encodingLength(opts.maxDataLength);\n }\n const decodeLength = opts?.lengthDecoder ?? varint.decode;\n const encodeLength = opts?.lengthEncoder ?? varint.encode;\n const W = {\n read: async (options) => {\n let dataLength = -1;\n const lengthBuffer = new Uint8ArrayList();\n while (true) {\n // read one byte at a time until we can decode a varint\n lengthBuffer.append(await bytes.read(1, options));\n try {\n dataLength = decodeLength(lengthBuffer);\n }\n catch (err) {\n if (err instanceof RangeError) {\n continue;\n }\n throw err;\n }\n if (dataLength < 0) {\n throw new InvalidMessageLengthError('Invalid message length');\n }\n if (opts?.maxLengthLength != null && lengthBuffer.byteLength > opts.maxLengthLength) {\n throw new InvalidDataLengthLengthError('message length length too long');\n }\n if (dataLength > -1) {\n break;\n }\n }\n if (opts?.maxDataLength != null && dataLength > opts.maxDataLength) {\n throw new InvalidDataLengthError('message length too long');\n }\n return bytes.read(dataLength, options);\n },\n write: async (data, options) => {\n // encode, write\n await bytes.write(new Uint8ArrayList(encodeLength(data.byteLength), data), options);\n },\n writeV: async (data, options) => {\n const list = new Uint8ArrayList(...data.flatMap(buf => ([encodeLength(buf.byteLength), buf])));\n // encode, write\n await bytes.write(list, options);\n },\n unwrap: () => {\n return bytes.unwrap();\n }\n };\n return W;\n}\n//# sourceMappingURL=index.js.map","import defer from 'p-defer';\n/**\n * A pair of streams where one drains from the other\n */\nexport function pair() {\n const deferred = defer();\n let piped = false;\n return {\n sink: async (source) => {\n if (piped) {\n throw new Error('already piped');\n }\n piped = true;\n deferred.resolve(source);\n },\n source: (async function* () {\n const source = await deferred.promise;\n yield* source;\n }())\n };\n}\n//# sourceMappingURL=index.js.map","export const NOISE_MSG_MAX_LENGTH_BYTES = 65535;\nexport const NOISE_MSG_MAX_LENGTH_BYTES_WITHOUT_TAG = NOISE_MSG_MAX_LENGTH_BYTES - 16;\nexport const DUMP_SESSION_KEYS = Boolean(globalThis.process?.env?.DUMP_SESSION_KEYS);\n//# sourceMappingURL=constants.js.map","function number(n) {\n if (!Number.isSafeInteger(n) || n < 0)\n throw new Error(`positive integer expected, not ${n}`);\n}\nfunction bool(b) {\n if (typeof b !== 'boolean')\n throw new Error(`boolean expected, not ${b}`);\n}\nexport function isBytes(a) {\n return (a instanceof Uint8Array ||\n (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array'));\n}\nfunction bytes(b, ...lengths) {\n if (!isBytes(b))\n throw new Error('Uint8Array expected');\n if (lengths.length > 0 && !lengths.includes(b.length))\n throw new Error(`Uint8Array expected of length ${lengths}, not of length=${b.length}`);\n}\nfunction hash(hash) {\n if (typeof hash !== 'function' || typeof hash.create !== 'function')\n throw new Error('hash must be wrapped by utils.wrapConstructor');\n number(hash.outputLen);\n number(hash.blockLen);\n}\nfunction exists(instance, checkFinished = true) {\n if (instance.destroyed)\n throw new Error('Hash instance has been destroyed');\n if (checkFinished && instance.finished)\n throw new Error('Hash#digest() has already been called');\n}\nfunction output(out, instance) {\n bytes(out);\n const min = instance.outputLen;\n if (out.length < min) {\n throw new Error(`digestInto() expects output buffer of length at least ${min}`);\n }\n}\nexport { number, bool, bytes, hash, exists, output };\nconst assert = { number, bool, bytes, hash, exists, output };\nexport default assert;\n//# sourceMappingURL=_assert.js.map","/*! noble-ciphers - MIT License (c) 2023 Paul Miller (paulmillr.com) */\nimport { bytes as abytes, isBytes } from './_assert.js';\n// Cast array to different type\nexport const u8 = (arr) => new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\nexport const u16 = (arr) => new Uint16Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 2));\nexport const u32 = (arr) => new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n// Cast array to view\nexport const createView = (arr) => new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n// big-endian hardware is rare. Just in case someone still decides to run ciphers:\n// early-throw an error because we don't support BE yet.\nexport const isLE = new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44;\nif (!isLE)\n throw new Error('Non little-endian hardware is not supported');\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'));\n/**\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes) {\n abytes(bytes);\n // pre-caching improves the speed 6x\n let hex = '';\n for (let i = 0; i < bytes.length; i++) {\n hex += hexes[bytes[i]];\n }\n return hex;\n}\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, _A: 65, _F: 70, _a: 97, _f: 102 };\nfunction asciiToBase16(char) {\n if (char >= asciis._0 && char <= asciis._9)\n return char - asciis._0;\n if (char >= asciis._A && char <= asciis._F)\n return char - (asciis._A - 10);\n if (char >= asciis._a && char <= asciis._f)\n return char - (asciis._a - 10);\n return;\n}\n/**\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex) {\n if (typeof hex !== 'string')\n throw new Error('hex string expected, got ' + typeof hex);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2)\n throw new Error('padded hex string expected, got unpadded hex of length ' + hl);\n const array = new Uint8Array(al);\n for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n const n1 = asciiToBase16(hex.charCodeAt(hi));\n const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n if (n1 === undefined || n2 === undefined) {\n const char = hex[hi] + hex[hi + 1];\n throw new Error('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n }\n array[ai] = n1 * 16 + n2;\n }\n return array;\n}\nexport function hexToNumber(hex) {\n if (typeof hex !== 'string')\n throw new Error('hex string expected, got ' + typeof hex);\n // Big Endian\n return BigInt(hex === '' ? '0' : `0x${hex}`);\n}\n// BE: Big Endian, LE: Little Endian\nexport function bytesToNumberBE(bytes) {\n return hexToNumber(bytesToHex(bytes));\n}\nexport function numberToBytesBE(n, len) {\n return hexToBytes(n.toString(16).padStart(len * 2, '0'));\n}\n// There is no setImmediate in browser and setTimeout is slow.\n// call of async fn will return Promise, which will be fullfiled only on\n// next scheduler queue processing step and this is exactly what we need.\nexport const nextTick = async () => { };\n// Returns control to thread each 'tick' ms to avoid blocking\nexport async function asyncLoop(iters, tick, cb) {\n let ts = Date.now();\n for (let i = 0; i < iters; i++) {\n cb(i);\n // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n const diff = Date.now() - ts;\n if (diff >= 0 && diff < tick)\n continue;\n await nextTick();\n ts += diff;\n }\n}\n/**\n * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nexport function utf8ToBytes(str) {\n if (typeof str !== 'string')\n throw new Error(`string expected, got ${typeof str}`);\n return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n/**\n * @example bytesToUtf8(new Uint8Array([97, 98, 99])) // 'abc'\n */\nexport function bytesToUtf8(bytes) {\n return new TextDecoder().decode(bytes);\n}\n/**\n * Normalizes (non-hex) string or Uint8Array to Uint8Array.\n * Warning: when Uint8Array is passed, it would NOT get copied.\n * Keep in mind for future mutable operations.\n */\nexport function toBytes(data) {\n if (typeof data === 'string')\n data = utf8ToBytes(data);\n else if (isBytes(data))\n data = copyBytes(data);\n else\n throw new Error(`Uint8Array expected, got ${typeof data}`);\n return data;\n}\n/**\n * Copies several Uint8Arrays into one.\n */\nexport function concatBytes(...arrays) {\n let sum = 0;\n for (let i = 0; i < arrays.length; i++) {\n const a = arrays[i];\n abytes(a);\n sum += a.length;\n }\n const res = new Uint8Array(sum);\n for (let i = 0, pad = 0; i < arrays.length; i++) {\n const a = arrays[i];\n res.set(a, pad);\n pad += a.length;\n }\n return res;\n}\nexport function checkOpts(defaults, opts) {\n if (opts == null || typeof opts !== 'object')\n throw new Error('options must be defined');\n const merged = Object.assign(defaults, opts);\n return merged;\n}\n// Compares 2 u8a-s in kinda constant time\nexport function equalBytes(a, b) {\n if (a.length !== b.length)\n return false;\n let diff = 0;\n for (let i = 0; i < a.length; i++)\n diff |= a[i] ^ b[i];\n return diff === 0;\n}\n// For runtime check if class implements interface\nexport class Hash {\n}\n/**\n * @__NO_SIDE_EFFECTS__\n */\nexport const wrapCipher = (params, c) => {\n Object.assign(c, params);\n return c;\n};\n// Polyfill for Safari 14\nexport function setBigUint64(view, byteOffset, value, isLE) {\n if (typeof view.setBigUint64 === 'function')\n return view.setBigUint64(byteOffset, value, isLE);\n const _32n = BigInt(32);\n const _u32_max = BigInt(0xffffffff);\n const wh = Number((value >> _32n) & _u32_max);\n const wl = Number(value & _u32_max);\n const h = isLE ? 4 : 0;\n const l = isLE ? 0 : 4;\n view.setUint32(byteOffset + h, wh, isLE);\n view.setUint32(byteOffset + l, wl, isLE);\n}\nexport function u64Lengths(ciphertext, AAD) {\n const num = new Uint8Array(16);\n const view = createView(num);\n setBigUint64(view, 0, BigInt(AAD ? AAD.length : 0), true);\n setBigUint64(view, 8, BigInt(ciphertext.length), true);\n return num;\n}\n// Is byte array aligned to 4 byte offset (u32)?\nexport function isAligned32(bytes) {\n return bytes.byteOffset % 4 === 0;\n}\n// copy bytes to new u8a (aligned). Because Buffer.slice is broken.\nexport function copyBytes(bytes) {\n return Uint8Array.from(bytes);\n}\nexport function clean(...arrays) {\n for (let i = 0; i < arrays.length; i++) {\n arrays[i].fill(0);\n }\n}\n//# sourceMappingURL=utils.js.map","// Basic utils for ARX (add-rotate-xor) salsa and chacha ciphers.\nimport { bool as abool, bytes as abytes, number as anumber } from './_assert.js';\nimport { checkOpts, clean, copyBytes, u32 } from './utils.js';\n/*\nRFC8439 requires multi-step cipher stream, where\nauthKey starts with counter: 0, actual msg with counter: 1.\n\nFor this, we need a way to re-use nonce / counter:\n\n const counter = new Uint8Array(4);\n chacha(..., counter, ...); // counter is now 1\n chacha(..., counter, ...); // counter is now 2\n\nThis is complicated:\n\n- 32-bit counters are enough, no need for 64-bit: max ArrayBuffer size in JS is 4GB\n- Original papers don't allow mutating counters\n- Counter overflow is undefined [^1]\n- Idea A: allow providing (nonce | counter) instead of just nonce, re-use it\n- Caveat: Cannot be re-used through all cases:\n- * chacha has (counter | nonce)\n- * xchacha has (nonce16 | counter | nonce16)\n- Idea B: separate nonce / counter and provide separate API for counter re-use\n- Caveat: there are different counter sizes depending on an algorithm.\n- salsa & chacha also differ in structures of key & sigma:\n salsa20: s[0] | k(4) | s[1] | nonce(2) | ctr(2) | s[2] | k(4) | s[3]\n chacha: s(4) | k(8) | ctr(1) | nonce(3)\n chacha20orig: s(4) | k(8) | ctr(2) | nonce(2)\n- Idea C: helper method such as `setSalsaState(key, nonce, sigma, data)`\n- Caveat: we can't re-use counter array\n\nxchacha [^2] uses the subkey and remaining 8 byte nonce with ChaCha20 as normal\n(prefixed by 4 NUL bytes, since [RFC8439] specifies a 12-byte nonce).\n\n[^1]: https://mailarchive.ietf.org/arch/msg/cfrg/gsOnTJzcbgG6OqD8Sc0GO5aR_tU/\n[^2]: https://datatracker.ietf.org/doc/html/draft-irtf-cfrg-xchacha#appendix-A.2\n*/\n// We can't make top-level var depend on utils.utf8ToBytes\n// because it's not present in all envs. Creating a similar fn here\nconst _utf8ToBytes = (str) => Uint8Array.from(str.split('').map((c) => c.charCodeAt(0)));\nconst sigma16 = _utf8ToBytes('expand 16-byte k');\nconst sigma32 = _utf8ToBytes('expand 32-byte k');\nconst sigma16_32 = u32(sigma16);\nconst sigma32_32 = u32(sigma32);\nexport const sigma = sigma32_32.slice();\nexport function rotl(a, b) {\n return (a << b) | (a >>> (32 - b));\n}\n// Is byte array aligned to 4 byte offset (u32)?\nfunction isAligned32(b) {\n return b.byteOffset % 4 === 0;\n}\n// Salsa and Chacha block length is always 512-bit\nconst BLOCK_LEN = 64;\nconst BLOCK_LEN32 = 16;\n// new Uint32Array([2**32]) // => Uint32Array(1) [ 0 ]\n// new Uint32Array([2**32-1]) // => Uint32Array(1) [ 4294967295 ]\nconst MAX_COUNTER = 2 ** 32 - 1;\nconst U32_EMPTY = new Uint32Array();\nfunction runCipher(core, sigma, key, nonce, data, output, counter, rounds) {\n const len = data.length;\n const block = new Uint8Array(BLOCK_LEN);\n const b32 = u32(block);\n // Make sure that buffers aligned to 4 bytes\n const isAligned = isAligned32(data) && isAligned32(output);\n const d32 = isAligned ? u32(data) : U32_EMPTY;\n const o32 = isAligned ? u32(output) : U32_EMPTY;\n for (let pos = 0; pos < len; counter++) {\n core(sigma, key, nonce, b32, counter, rounds);\n if (counter >= MAX_COUNTER)\n throw new Error('arx: counter overflow');\n const take = Math.min(BLOCK_LEN, len - pos);\n // aligned to 4 bytes\n if (isAligned && take === BLOCK_LEN) {\n const pos32 = pos / 4;\n if (pos % 4 !== 0)\n throw new Error('arx: invalid block position');\n for (let j = 0, posj; j < BLOCK_LEN32; j++) {\n posj = pos32 + j;\n o32[posj] = d32[posj] ^ b32[j];\n }\n pos += BLOCK_LEN;\n continue;\n }\n for (let j = 0, posj; j < take; j++) {\n posj = pos + j;\n output[posj] = data[posj] ^ block[j];\n }\n pos += take;\n }\n}\nexport function createCipher(core, opts) {\n const { allowShortKeys, extendNonceFn, counterLength, counterRight, rounds } = checkOpts({ allowShortKeys: false, counterLength: 8, counterRight: false, rounds: 20 }, opts);\n if (typeof core !== 'function')\n throw new Error('core must be a function');\n anumber(counterLength);\n anumber(rounds);\n abool(counterRight);\n abool(allowShortKeys);\n return (key, nonce, data, output, counter = 0) => {\n abytes(key);\n abytes(nonce);\n abytes(data);\n const len = data.length;\n if (output === undefined)\n output = new Uint8Array(len);\n abytes(output);\n anumber(counter);\n if (counter < 0 || counter >= MAX_COUNTER)\n throw new Error('arx: counter overflow');\n if (output.length < len)\n throw new Error(`arx: output (${output.length}) is shorter than data (${len})`);\n const toClean = [];\n // Key & sigma\n // key=16 -> sigma16, k=key|key\n // key=32 -> sigma32, k=key\n let l = key.length, k, sigma;\n if (l === 32) {\n toClean.push((k = copyBytes(key)));\n sigma = sigma32_32;\n }\n else if (l === 16 && allowShortKeys) {\n k = new Uint8Array(32);\n k.set(key);\n k.set(key, 16);\n sigma = sigma16_32;\n toClean.push(k);\n }\n else {\n throw new Error(`arx: invalid 32-byte key, got length=${l}`);\n }\n // Nonce\n // salsa20: 8 (8-byte counter)\n // chacha20orig: 8 (8-byte counter)\n // chacha20: 12 (4-byte counter)\n // xsalsa20: 24 (16 -> hsalsa, 8 -> old nonce)\n // xchacha20: 24 (16 -> hchacha, 8 -> old nonce)\n // Align nonce to 4 bytes\n if (!isAligned32(nonce))\n toClean.push((nonce = copyBytes(nonce)));\n const k32 = u32(k);\n // hsalsa & hchacha: handle extended nonce\n if (extendNonceFn) {\n if (nonce.length !== 24)\n throw new Error(`arx: extended nonce must be 24 bytes`);\n extendNonceFn(sigma, k32, u32(nonce.subarray(0, 16)), k32);\n nonce = nonce.subarray(16);\n }\n // Handle nonce counter\n const nonceNcLen = 16 - counterLength;\n if (nonceNcLen !== nonce.length)\n throw new Error(`arx: nonce must be ${nonceNcLen} or 16 bytes`);\n // Pad counter when nonce is 64 bit\n if (nonceNcLen !== 12) {\n const nc = new Uint8Array(12);\n nc.set(nonce, counterRight ? 0 : 12 - nonce.length);\n nonce = nc;\n toClean.push(nonce);\n }\n const n32 = u32(nonce);\n runCipher(core, sigma, k32, n32, data, output, counter, rounds);\n clean(...toClean);\n return output;\n };\n}\n//# sourceMappingURL=_arx.js.map","import { bytes as abytes, exists as aexists, output as aoutput } from './_assert.js';\nimport { clean, toBytes } from './utils.js';\n// Poly1305 is a fast and parallel secret-key message-authentication code.\n// https://cr.yp.to/mac.html, https://cr.yp.to/mac/poly1305-20050329.pdf\n// https://datatracker.ietf.org/doc/html/rfc8439\n// Based on Public Domain poly1305-donna https://github.com/floodyberry/poly1305-donna\nconst u8to16 = (a, i) => (a[i++] & 0xff) | ((a[i++] & 0xff) << 8);\nclass Poly1305 {\n constructor(key) {\n this.blockLen = 16;\n this.outputLen = 16;\n this.buffer = new Uint8Array(16);\n this.r = new Uint16Array(10);\n this.h = new Uint16Array(10);\n this.pad = new Uint16Array(8);\n this.pos = 0;\n this.finished = false;\n key = toBytes(key);\n abytes(key, 32);\n const t0 = u8to16(key, 0);\n const t1 = u8to16(key, 2);\n const t2 = u8to16(key, 4);\n const t3 = u8to16(key, 6);\n const t4 = u8to16(key, 8);\n const t5 = u8to16(key, 10);\n const t6 = u8to16(key, 12);\n const t7 = u8to16(key, 14);\n // https://github.com/floodyberry/poly1305-donna/blob/e6ad6e091d30d7f4ec2d4f978be1fcfcbce72781/poly1305-donna-16.h#L47\n this.r[0] = t0 & 0x1fff;\n this.r[1] = ((t0 >>> 13) | (t1 << 3)) & 0x1fff;\n this.r[2] = ((t1 >>> 10) | (t2 << 6)) & 0x1f03;\n this.r[3] = ((t2 >>> 7) | (t3 << 9)) & 0x1fff;\n this.r[4] = ((t3 >>> 4) | (t4 << 12)) & 0x00ff;\n this.r[5] = (t4 >>> 1) & 0x1ffe;\n this.r[6] = ((t4 >>> 14) | (t5 << 2)) & 0x1fff;\n this.r[7] = ((t5 >>> 11) | (t6 << 5)) & 0x1f81;\n this.r[8] = ((t6 >>> 8) | (t7 << 8)) & 0x1fff;\n this.r[9] = (t7 >>> 5) & 0x007f;\n for (let i = 0; i < 8; i++)\n this.pad[i] = u8to16(key, 16 + 2 * i);\n }\n process(data, offset, isLast = false) {\n const hibit = isLast ? 0 : 1 << 11;\n const { h, r } = this;\n const r0 = r[0];\n const r1 = r[1];\n const r2 = r[2];\n const r3 = r[3];\n const r4 = r[4];\n const r5 = r[5];\n const r6 = r[6];\n const r7 = r[7];\n const r8 = r[8];\n const r9 = r[9];\n const t0 = u8to16(data, offset + 0);\n const t1 = u8to16(data, offset + 2);\n const t2 = u8to16(data, offset + 4);\n const t3 = u8to16(data, offset + 6);\n const t4 = u8to16(data, offset + 8);\n const t5 = u8to16(data, offset + 10);\n const t6 = u8to16(data, offset + 12);\n const t7 = u8to16(data, offset + 14);\n let h0 = h[0] + (t0 & 0x1fff);\n let h1 = h[1] + (((t0 >>> 13) | (t1 << 3)) & 0x1fff);\n let h2 = h[2] + (((t1 >>> 10) | (t2 << 6)) & 0x1fff);\n let h3 = h[3] + (((t2 >>> 7) | (t3 << 9)) & 0x1fff);\n let h4 = h[4] + (((t3 >>> 4) | (t4 << 12)) & 0x1fff);\n let h5 = h[5] + ((t4 >>> 1) & 0x1fff);\n let h6 = h[6] + (((t4 >>> 14) | (t5 << 2)) & 0x1fff);\n let h7 = h[7] + (((t5 >>> 11) | (t6 << 5)) & 0x1fff);\n let h8 = h[8] + (((t6 >>> 8) | (t7 << 8)) & 0x1fff);\n let h9 = h[9] + ((t7 >>> 5) | hibit);\n let c = 0;\n let d0 = c + h0 * r0 + h1 * (5 * r9) + h2 * (5 * r8) + h3 * (5 * r7) + h4 * (5 * r6);\n c = d0 >>> 13;\n d0 &= 0x1fff;\n d0 += h5 * (5 * r5) + h6 * (5 * r4) + h7 * (5 * r3) + h8 * (5 * r2) + h9 * (5 * r1);\n c += d0 >>> 13;\n d0 &= 0x1fff;\n let d1 = c + h0 * r1 + h1 * r0 + h2 * (5 * r9) + h3 * (5 * r8) + h4 * (5 * r7);\n c = d1 >>> 13;\n d1 &= 0x1fff;\n d1 += h5 * (5 * r6) + h6 * (5 * r5) + h7 * (5 * r4) + h8 * (5 * r3) + h9 * (5 * r2);\n c += d1 >>> 13;\n d1 &= 0x1fff;\n let d2 = c + h0 * r2 + h1 * r1 + h2 * r0 + h3 * (5 * r9) + h4 * (5 * r8);\n c = d2 >>> 13;\n d2 &= 0x1fff;\n d2 += h5 * (5 * r7) + h6 * (5 * r6) + h7 * (5 * r5) + h8 * (5 * r4) + h9 * (5 * r3);\n c += d2 >>> 13;\n d2 &= 0x1fff;\n let d3 = c + h0 * r3 + h1 * r2 + h2 * r1 + h3 * r0 + h4 * (5 * r9);\n c = d3 >>> 13;\n d3 &= 0x1fff;\n d3 += h5 * (5 * r8) + h6 * (5 * r7) + h7 * (5 * r6) + h8 * (5 * r5) + h9 * (5 * r4);\n c += d3 >>> 13;\n d3 &= 0x1fff;\n let d4 = c + h0 * r4 + h1 * r3 + h2 * r2 + h3 * r1 + h4 * r0;\n c = d4 >>> 13;\n d4 &= 0x1fff;\n d4 += h5 * (5 * r9) + h6 * (5 * r8) + h7 * (5 * r7) + h8 * (5 * r6) + h9 * (5 * r5);\n c += d4 >>> 13;\n d4 &= 0x1fff;\n let d5 = c + h0 * r5 + h1 * r4 + h2 * r3 + h3 * r2 + h4 * r1;\n c = d5 >>> 13;\n d5 &= 0x1fff;\n d5 += h5 * r0 + h6 * (5 * r9) + h7 * (5 * r8) + h8 * (5 * r7) + h9 * (5 * r6);\n c += d5 >>> 13;\n d5 &= 0x1fff;\n let d6 = c + h0 * r6 + h1 * r5 + h2 * r4 + h3 * r3 + h4 * r2;\n c = d6 >>> 13;\n d6 &= 0x1fff;\n d6 += h5 * r1 + h6 * r0 + h7 * (5 * r9) + h8 * (5 * r8) + h9 * (5 * r7);\n c += d6 >>> 13;\n d6 &= 0x1fff;\n let d7 = c + h0 * r7 + h1 * r6 + h2 * r5 + h3 * r4 + h4 * r3;\n c = d7 >>> 13;\n d7 &= 0x1fff;\n d7 += h5 * r2 + h6 * r1 + h7 * r0 + h8 * (5 * r9) + h9 * (5 * r8);\n c += d7 >>> 13;\n d7 &= 0x1fff;\n let d8 = c + h0 * r8 + h1 * r7 + h2 * r6 + h3 * r5 + h4 * r4;\n c = d8 >>> 13;\n d8 &= 0x1fff;\n d8 += h5 * r3 + h6 * r2 + h7 * r1 + h8 * r0 + h9 * (5 * r9);\n c += d8 >>> 13;\n d8 &= 0x1fff;\n let d9 = c + h0 * r9 + h1 * r8 + h2 * r7 + h3 * r6 + h4 * r5;\n c = d9 >>> 13;\n d9 &= 0x1fff;\n d9 += h5 * r4 + h6 * r3 + h7 * r2 + h8 * r1 + h9 * r0;\n c += d9 >>> 13;\n d9 &= 0x1fff;\n c = ((c << 2) + c) | 0;\n c = (c + d0) | 0;\n d0 = c & 0x1fff;\n c = c >>> 13;\n d1 += c;\n h[0] = d0;\n h[1] = d1;\n h[2] = d2;\n h[3] = d3;\n h[4] = d4;\n h[5] = d5;\n h[6] = d6;\n h[7] = d7;\n h[8] = d8;\n h[9] = d9;\n }\n finalize() {\n const { h, pad } = this;\n const g = new Uint16Array(10);\n let c = h[1] >>> 13;\n h[1] &= 0x1fff;\n for (let i = 2; i < 10; i++) {\n h[i] += c;\n c = h[i] >>> 13;\n h[i] &= 0x1fff;\n }\n h[0] += c * 5;\n c = h[0] >>> 13;\n h[0] &= 0x1fff;\n h[1] += c;\n c = h[1] >>> 13;\n h[1] &= 0x1fff;\n h[2] += c;\n g[0] = h[0] + 5;\n c = g[0] >>> 13;\n g[0] &= 0x1fff;\n for (let i = 1; i < 10; i++) {\n g[i] = h[i] + c;\n c = g[i] >>> 13;\n g[i] &= 0x1fff;\n }\n g[9] -= 1 << 13;\n let mask = (c ^ 1) - 1;\n for (let i = 0; i < 10; i++)\n g[i] &= mask;\n mask = ~mask;\n for (let i = 0; i < 10; i++)\n h[i] = (h[i] & mask) | g[i];\n h[0] = (h[0] | (h[1] << 13)) & 0xffff;\n h[1] = ((h[1] >>> 3) | (h[2] << 10)) & 0xffff;\n h[2] = ((h[2] >>> 6) | (h[3] << 7)) & 0xffff;\n h[3] = ((h[3] >>> 9) | (h[4] << 4)) & 0xffff;\n h[4] = ((h[4] >>> 12) | (h[5] << 1) | (h[6] << 14)) & 0xffff;\n h[5] = ((h[6] >>> 2) | (h[7] << 11)) & 0xffff;\n h[6] = ((h[7] >>> 5) | (h[8] << 8)) & 0xffff;\n h[7] = ((h[8] >>> 8) | (h[9] << 5)) & 0xffff;\n let f = h[0] + pad[0];\n h[0] = f & 0xffff;\n for (let i = 1; i < 8; i++) {\n f = (((h[i] + pad[i]) | 0) + (f >>> 16)) | 0;\n h[i] = f & 0xffff;\n }\n clean(g);\n }\n update(data) {\n aexists(this);\n const { buffer, blockLen } = this;\n data = toBytes(data);\n const len = data.length;\n for (let pos = 0; pos < len;) {\n const take = Math.min(blockLen - this.pos, len - pos);\n // Fast path: we have at least one block in input\n if (take === blockLen) {\n for (; blockLen <= len - pos; pos += blockLen)\n this.process(data, pos);\n continue;\n }\n buffer.set(data.subarray(pos, pos + take), this.pos);\n this.pos += take;\n pos += take;\n if (this.pos === blockLen) {\n this.process(buffer, 0, false);\n this.pos = 0;\n }\n }\n return this;\n }\n destroy() {\n clean(this.h, this.r, this.buffer, this.pad);\n }\n digestInto(out) {\n aexists(this);\n aoutput(out, this);\n this.finished = true;\n const { buffer, h } = this;\n let { pos } = this;\n if (pos) {\n buffer[pos++] = 1;\n for (; pos < 16; pos++)\n buffer[pos] = 0;\n this.process(buffer, 0, true);\n }\n this.finalize();\n let opos = 0;\n for (let i = 0; i < 8; i++) {\n out[opos++] = h[i] >>> 0;\n out[opos++] = h[i] >>> 8;\n }\n return out;\n }\n digest() {\n const { buffer, outputLen } = this;\n this.digestInto(buffer);\n const res = buffer.slice(0, outputLen);\n this.destroy();\n return res;\n }\n}\nexport function wrapConstructorWithKey(hashCons) {\n const hashC = (msg, key) => hashCons(key).update(toBytes(msg)).digest();\n const tmp = hashCons(new Uint8Array(32));\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (key) => hashCons(key);\n return hashC;\n}\nexport const poly1305 = wrapConstructorWithKey((key) => new Poly1305(key));\n//# sourceMappingURL=_poly1305.js.map","// prettier-ignore\nimport { createCipher, rotl } from './_arx.js';\nimport { bytes as abytes } from './_assert.js';\nimport { poly1305 } from './_poly1305.js';\nimport { clean, createView, equalBytes, setBigUint64, wrapCipher, } from './utils.js';\n// ChaCha20 stream cipher was released in 2008. ChaCha aims to increase\n// the diffusion per round, but had slightly less cryptanalysis.\n// https://cr.yp.to/chacha.html, http://cr.yp.to/chacha/chacha-20080128.pdf\n/**\n * ChaCha core function.\n */\n// prettier-ignore\nfunction chachaCore(s, k, n, out, cnt, rounds = 20) {\n let y00 = s[0], y01 = s[1], y02 = s[2], y03 = s[3], // \"expa\" \"nd 3\" \"2-by\" \"te k\"\n y04 = k[0], y05 = k[1], y06 = k[2], y07 = k[3], // Key Key Key Key\n y08 = k[4], y09 = k[5], y10 = k[6], y11 = k[7], // Key Key Key Key\n y12 = cnt, y13 = n[0], y14 = n[1], y15 = n[2]; // Counter Counter\tNonce Nonce\n // Save state to temporary variables\n let x00 = y00, x01 = y01, x02 = y02, x03 = y03, x04 = y04, x05 = y05, x06 = y06, x07 = y07, x08 = y08, x09 = y09, x10 = y10, x11 = y11, x12 = y12, x13 = y13, x14 = y14, x15 = y15;\n for (let r = 0; r < rounds; r += 2) {\n x00 = (x00 + x04) | 0;\n x12 = rotl(x12 ^ x00, 16);\n x08 = (x08 + x12) | 0;\n x04 = rotl(x04 ^ x08, 12);\n x00 = (x00 + x04) | 0;\n x12 = rotl(x12 ^ x00, 8);\n x08 = (x08 + x12) | 0;\n x04 = rotl(x04 ^ x08, 7);\n x01 = (x01 + x05) | 0;\n x13 = rotl(x13 ^ x01, 16);\n x09 = (x09 + x13) | 0;\n x05 = rotl(x05 ^ x09, 12);\n x01 = (x01 + x05) | 0;\n x13 = rotl(x13 ^ x01, 8);\n x09 = (x09 + x13) | 0;\n x05 = rotl(x05 ^ x09, 7);\n x02 = (x02 + x06) | 0;\n x14 = rotl(x14 ^ x02, 16);\n x10 = (x10 + x14) | 0;\n x06 = rotl(x06 ^ x10, 12);\n x02 = (x02 + x06) | 0;\n x14 = rotl(x14 ^ x02, 8);\n x10 = (x10 + x14) | 0;\n x06 = rotl(x06 ^ x10, 7);\n x03 = (x03 + x07) | 0;\n x15 = rotl(x15 ^ x03, 16);\n x11 = (x11 + x15) | 0;\n x07 = rotl(x07 ^ x11, 12);\n x03 = (x03 + x07) | 0;\n x15 = rotl(x15 ^ x03, 8);\n x11 = (x11 + x15) | 0;\n x07 = rotl(x07 ^ x11, 7);\n x00 = (x00 + x05) | 0;\n x15 = rotl(x15 ^ x00, 16);\n x10 = (x10 + x15) | 0;\n x05 = rotl(x05 ^ x10, 12);\n x00 = (x00 + x05) | 0;\n x15 = rotl(x15 ^ x00, 8);\n x10 = (x10 + x15) | 0;\n x05 = rotl(x05 ^ x10, 7);\n x01 = (x01 + x06) | 0;\n x12 = rotl(x12 ^ x01, 16);\n x11 = (x11 + x12) | 0;\n x06 = rotl(x06 ^ x11, 12);\n x01 = (x01 + x06) | 0;\n x12 = rotl(x12 ^ x01, 8);\n x11 = (x11 + x12) | 0;\n x06 = rotl(x06 ^ x11, 7);\n x02 = (x02 + x07) | 0;\n x13 = rotl(x13 ^ x02, 16);\n x08 = (x08 + x13) | 0;\n x07 = rotl(x07 ^ x08, 12);\n x02 = (x02 + x07) | 0;\n x13 = rotl(x13 ^ x02, 8);\n x08 = (x08 + x13) | 0;\n x07 = rotl(x07 ^ x08, 7);\n x03 = (x03 + x04) | 0;\n x14 = rotl(x14 ^ x03, 16);\n x09 = (x09 + x14) | 0;\n x04 = rotl(x04 ^ x09, 12);\n x03 = (x03 + x04) | 0;\n x14 = rotl(x14 ^ x03, 8);\n x09 = (x09 + x14) | 0;\n x04 = rotl(x04 ^ x09, 7);\n }\n // Write output\n let oi = 0;\n out[oi++] = (y00 + x00) | 0;\n out[oi++] = (y01 + x01) | 0;\n out[oi++] = (y02 + x02) | 0;\n out[oi++] = (y03 + x03) | 0;\n out[oi++] = (y04 + x04) | 0;\n out[oi++] = (y05 + x05) | 0;\n out[oi++] = (y06 + x06) | 0;\n out[oi++] = (y07 + x07) | 0;\n out[oi++] = (y08 + x08) | 0;\n out[oi++] = (y09 + x09) | 0;\n out[oi++] = (y10 + x10) | 0;\n out[oi++] = (y11 + x11) | 0;\n out[oi++] = (y12 + x12) | 0;\n out[oi++] = (y13 + x13) | 0;\n out[oi++] = (y14 + x14) | 0;\n out[oi++] = (y15 + x15) | 0;\n}\n/**\n * hchacha helper method, used primarily in xchacha, to hash\n * key and nonce into key' and nonce'.\n * Same as chachaCore, but there doesn't seem to be a way to move the block\n * out without 25% performance hit.\n */\n// prettier-ignore\nexport function hchacha(s, k, i, o32) {\n let x00 = s[0], x01 = s[1], x02 = s[2], x03 = s[3], x04 = k[0], x05 = k[1], x06 = k[2], x07 = k[3], x08 = k[4], x09 = k[5], x10 = k[6], x11 = k[7], x12 = i[0], x13 = i[1], x14 = i[2], x15 = i[3];\n for (let r = 0; r < 20; r += 2) {\n x00 = (x00 + x04) | 0;\n x12 = rotl(x12 ^ x00, 16);\n x08 = (x08 + x12) | 0;\n x04 = rotl(x04 ^ x08, 12);\n x00 = (x00 + x04) | 0;\n x12 = rotl(x12 ^ x00, 8);\n x08 = (x08 + x12) | 0;\n x04 = rotl(x04 ^ x08, 7);\n x01 = (x01 + x05) | 0;\n x13 = rotl(x13 ^ x01, 16);\n x09 = (x09 + x13) | 0;\n x05 = rotl(x05 ^ x09, 12);\n x01 = (x01 + x05) | 0;\n x13 = rotl(x13 ^ x01, 8);\n x09 = (x09 + x13) | 0;\n x05 = rotl(x05 ^ x09, 7);\n x02 = (x02 + x06) | 0;\n x14 = rotl(x14 ^ x02, 16);\n x10 = (x10 + x14) | 0;\n x06 = rotl(x06 ^ x10, 12);\n x02 = (x02 + x06) | 0;\n x14 = rotl(x14 ^ x02, 8);\n x10 = (x10 + x14) | 0;\n x06 = rotl(x06 ^ x10, 7);\n x03 = (x03 + x07) | 0;\n x15 = rotl(x15 ^ x03, 16);\n x11 = (x11 + x15) | 0;\n x07 = rotl(x07 ^ x11, 12);\n x03 = (x03 + x07) | 0;\n x15 = rotl(x15 ^ x03, 8);\n x11 = (x11 + x15) | 0;\n x07 = rotl(x07 ^ x11, 7);\n x00 = (x00 + x05) | 0;\n x15 = rotl(x15 ^ x00, 16);\n x10 = (x10 + x15) | 0;\n x05 = rotl(x05 ^ x10, 12);\n x00 = (x00 + x05) | 0;\n x15 = rotl(x15 ^ x00, 8);\n x10 = (x10 + x15) | 0;\n x05 = rotl(x05 ^ x10, 7);\n x01 = (x01 + x06) | 0;\n x12 = rotl(x12 ^ x01, 16);\n x11 = (x11 + x12) | 0;\n x06 = rotl(x06 ^ x11, 12);\n x01 = (x01 + x06) | 0;\n x12 = rotl(x12 ^ x01, 8);\n x11 = (x11 + x12) | 0;\n x06 = rotl(x06 ^ x11, 7);\n x02 = (x02 + x07) | 0;\n x13 = rotl(x13 ^ x02, 16);\n x08 = (x08 + x13) | 0;\n x07 = rotl(x07 ^ x08, 12);\n x02 = (x02 + x07) | 0;\n x13 = rotl(x13 ^ x02, 8);\n x08 = (x08 + x13) | 0;\n x07 = rotl(x07 ^ x08, 7);\n x03 = (x03 + x04) | 0;\n x14 = rotl(x14 ^ x03, 16);\n x09 = (x09 + x14) | 0;\n x04 = rotl(x04 ^ x09, 12);\n x03 = (x03 + x04) | 0;\n x14 = rotl(x14 ^ x03, 8);\n x09 = (x09 + x14) | 0;\n x04 = rotl(x04 ^ x09, 7);\n }\n let oi = 0;\n o32[oi++] = x00;\n o32[oi++] = x01;\n o32[oi++] = x02;\n o32[oi++] = x03;\n o32[oi++] = x12;\n o32[oi++] = x13;\n o32[oi++] = x14;\n o32[oi++] = x15;\n}\n/**\n * Original, non-RFC chacha20 from DJB. 8-byte nonce, 8-byte counter.\n */\nexport const chacha20orig = /* @__PURE__ */ createCipher(chachaCore, {\n counterRight: false,\n counterLength: 8,\n allowShortKeys: true,\n});\n/**\n * ChaCha stream cipher. Conforms to RFC 8439 (IETF, TLS). 12-byte nonce, 4-byte counter.\n * With 12-byte nonce, it's not safe to use fill it with random (CSPRNG), due to collision chance.\n */\nexport const chacha20 = /* @__PURE__ */ createCipher(chachaCore, {\n counterRight: false,\n counterLength: 4,\n allowShortKeys: false,\n});\n/**\n * XChaCha eXtended-nonce ChaCha. 24-byte nonce.\n * With 24-byte nonce, it's safe to use fill it with random (CSPRNG).\n * https://datatracker.ietf.org/doc/html/draft-irtf-cfrg-xchacha\n */\nexport const xchacha20 = /* @__PURE__ */ createCipher(chachaCore, {\n counterRight: false,\n counterLength: 8,\n extendNonceFn: hchacha,\n allowShortKeys: false,\n});\n/**\n * Reduced 8-round chacha, described in original paper.\n */\nexport const chacha8 = /* @__PURE__ */ createCipher(chachaCore, {\n counterRight: false,\n counterLength: 4,\n rounds: 8,\n});\n/**\n * Reduced 12-round chacha, described in original paper.\n */\nexport const chacha12 = /* @__PURE__ */ createCipher(chachaCore, {\n counterRight: false,\n counterLength: 4,\n rounds: 12,\n});\nconst ZEROS16 = /* @__PURE__ */ new Uint8Array(16);\n// Pad to digest size with zeros\nconst updatePadded = (h, msg) => {\n h.update(msg);\n const left = msg.length % 16;\n if (left)\n h.update(ZEROS16.subarray(left));\n};\nconst ZEROS32 = /* @__PURE__ */ new Uint8Array(32);\nfunction computeTag(fn, key, nonce, data, AAD) {\n const authKey = fn(key, nonce, ZEROS32);\n const h = poly1305.create(authKey);\n if (AAD)\n updatePadded(h, AAD);\n updatePadded(h, data);\n const num = new Uint8Array(16);\n const view = createView(num);\n setBigUint64(view, 0, BigInt(AAD ? AAD.length : 0), true);\n setBigUint64(view, 8, BigInt(data.length), true);\n h.update(num);\n const res = h.digest();\n clean(authKey, num);\n return res;\n}\n/**\n * AEAD algorithm from RFC 8439.\n * Salsa20 and chacha (RFC 8439) use poly1305 differently.\n * We could have composed them similar to:\n * https://github.com/paulmillr/scure-base/blob/b266c73dde977b1dd7ef40ef7a23cc15aab526b3/index.ts#L250\n * But it's hard because of authKey:\n * In salsa20, authKey changes position in salsa stream.\n * In chacha, authKey can't be computed inside computeTag, it modifies the counter.\n */\nexport const _poly1305_aead = (xorStream) => (key, nonce, AAD) => {\n const tagLength = 16;\n abytes(key, 32);\n abytes(nonce);\n return {\n encrypt(plaintext, output) {\n const plength = plaintext.length;\n const clength = plength + tagLength;\n if (output) {\n abytes(output, clength);\n }\n else {\n output = new Uint8Array(clength);\n }\n xorStream(key, nonce, plaintext, output, 1);\n const tag = computeTag(xorStream, key, nonce, output.subarray(0, -tagLength), AAD);\n output.set(tag, plength); // append tag\n clean(tag);\n return output;\n },\n decrypt(ciphertext, output) {\n const clength = ciphertext.length;\n const plength = clength - tagLength;\n if (clength < tagLength)\n throw new Error(`encrypted data must be at least ${tagLength} bytes`);\n if (output) {\n abytes(output, plength);\n }\n else {\n output = new Uint8Array(plength);\n }\n const data = ciphertext.subarray(0, -tagLength);\n const passedTag = ciphertext.subarray(-tagLength);\n const tag = computeTag(xorStream, key, nonce, data, AAD);\n if (!equalBytes(passedTag, tag))\n throw new Error('invalid tag');\n xorStream(key, nonce, data, output, 1);\n clean(tag);\n return output;\n },\n };\n};\n/**\n * ChaCha20-Poly1305 from RFC 8439.\n * With 12-byte nonce, it's not safe to use fill it with random (CSPRNG), due to collision chance.\n */\nexport const chacha20poly1305 = /* @__PURE__ */ wrapCipher({ blockSize: 64, nonceLength: 12, tagLength: 16 }, _poly1305_aead(chacha20));\n/**\n * XChaCha20-Poly1305 extended-nonce chacha.\n * https://datatracker.ietf.org/doc/html/draft-irtf-cfrg-xchacha\n * With 24-byte nonce, it's safe to use fill it with random (CSPRNG).\n */\nexport const xchacha20poly1305 = /* @__PURE__ */ wrapCipher({ blockSize: 64, nonceLength: 24, tagLength: 16 }, _poly1305_aead(xchacha20));\n//# sourceMappingURL=chacha.js.map","import { hash as assertHash, number as assertNumber } from './_assert.js';\nimport { toBytes } from './utils.js';\nimport { hmac } from './hmac.js';\n// HKDF (RFC 5869)\n// https://soatok.blog/2021/11/17/understanding-hkdf/\n/**\n * HKDF-Extract(IKM, salt) -> PRK\n * Arguments position differs from spec (IKM is first one, since it is not optional)\n * @param hash\n * @param ikm\n * @param salt\n * @returns\n */\nexport function extract(hash, ikm, salt) {\n assertHash(hash);\n // NOTE: some libraries treat zero-length array as 'not provided';\n // we don't, since we have undefined as 'not provided'\n // https://github.com/RustCrypto/KDFs/issues/15\n if (salt === undefined)\n salt = new Uint8Array(hash.outputLen); // if not provided, it is set to a string of HashLen zeros\n return hmac(hash, toBytes(salt), toBytes(ikm));\n}\n// HKDF-Expand(PRK, info, L) -> OKM\nconst HKDF_COUNTER = /* @__PURE__ */ new Uint8Array([0]);\nconst EMPTY_BUFFER = /* @__PURE__ */ new Uint8Array();\n/**\n * HKDF-expand from the spec.\n * @param prk - a pseudorandom key of at least HashLen octets (usually, the output from the extract step)\n * @param info - optional context and application specific information (can be a zero-length string)\n * @param length - length of output keying material in octets\n */\nexport function expand(hash, prk, info, length = 32) {\n assertHash(hash);\n assertNumber(length);\n if (length > 255 * hash.outputLen)\n throw new Error('Length should be <= 255*HashLen');\n const blocks = Math.ceil(length / hash.outputLen);\n if (info === undefined)\n info = EMPTY_BUFFER;\n // first L(ength) octets of T\n const okm = new Uint8Array(blocks * hash.outputLen);\n // Re-use HMAC instance between blocks\n const HMAC = hmac.create(hash, prk);\n const HMACTmp = HMAC._cloneInto();\n const T = new Uint8Array(HMAC.outputLen);\n for (let counter = 0; counter < blocks; counter++) {\n HKDF_COUNTER[0] = counter + 1;\n // T(0) = empty string (zero length)\n // T(N) = HMAC-Hash(PRK, T(N-1) | info | N)\n HMACTmp.update(counter === 0 ? EMPTY_BUFFER : T)\n .update(info)\n .update(HKDF_COUNTER)\n .digestInto(T);\n okm.set(T, hash.outputLen * counter);\n HMAC._cloneInto(HMACTmp);\n }\n HMAC.destroy();\n HMACTmp.destroy();\n T.fill(0);\n HKDF_COUNTER.fill(0);\n return okm.slice(0, length);\n}\n/**\n * HKDF (RFC 5869): extract + expand in one step.\n * @param hash - hash function that would be used (e.g. sha256)\n * @param ikm - input keying material, the initial key\n * @param salt - optional salt value (a non-secret random value)\n * @param info - optional context and application specific information\n * @param length - length of output keying material in octets\n */\nexport const hkdf = (hash, ikm, salt, info, length) => expand(hash, extract(hash, ikm, salt), info, length);\n//# sourceMappingURL=hkdf.js.map","import { pureJsCrypto } from './js.js';\nexport const defaultCrypto = pureJsCrypto;\n//# sourceMappingURL=index.browser.js.map","import { chacha20poly1305 } from '@noble/ciphers/chacha';\nimport { x25519 } from '@noble/curves/ed25519';\nimport { extract, expand } from '@noble/hashes/hkdf';\nimport { sha256 } from '@noble/hashes/sha256';\nexport const pureJsCrypto = {\n hashSHA256(data) {\n return sha256(data.subarray());\n },\n getHKDF(ck, ikm) {\n const prk = extract(sha256, ikm, ck);\n const okmU8Array = expand(sha256, prk, undefined, 96);\n const okm = okmU8Array;\n const k1 = okm.subarray(0, 32);\n const k2 = okm.subarray(32, 64);\n const k3 = okm.subarray(64, 96);\n return [k1, k2, k3];\n },\n generateX25519KeyPair() {\n const secretKey = x25519.utils.randomPrivateKey();\n const publicKey = x25519.getPublicKey(secretKey);\n return {\n publicKey,\n privateKey: secretKey\n };\n },\n generateX25519KeyPairFromSeed(seed) {\n const publicKey = x25519.getPublicKey(seed);\n return {\n publicKey,\n privateKey: seed\n };\n },\n generateX25519SharedKey(privateKey, publicKey) {\n return x25519.getSharedSecret(privateKey.subarray(), publicKey.subarray());\n },\n chaCha20Poly1305Encrypt(plaintext, nonce, ad, k) {\n return chacha20poly1305(k, nonce, ad).encrypt(plaintext.subarray());\n },\n chaCha20Poly1305Decrypt(ciphertext, nonce, ad, k, dst) {\n return chacha20poly1305(k, nonce, ad).decrypt(ciphertext.subarray(), dst);\n }\n};\n//# sourceMappingURL=js.js.map","import {} from 'uint8arraylist';\nimport { allocUnsafe as uint8ArrayAllocUnsafe } from 'uint8arrays/alloc';\nexport const uint16BEEncode = (value) => {\n const target = uint8ArrayAllocUnsafe(2);\n target[0] = value >> 8;\n target[1] = value;\n return target;\n};\nuint16BEEncode.bytes = 2;\nexport const uint16BEDecode = (data) => {\n if (data.length < 2)\n throw RangeError('Could not decode int16BE');\n if (data instanceof Uint8Array) {\n let value = 0;\n value += data[0] << 8;\n value += data[1];\n return value;\n }\n return data.getUint16(0);\n};\nuint16BEDecode.bytes = 2;\n//# sourceMappingURL=encoder.js.map","import { toString as uint8ArrayToString } from 'uint8arrays/to-string';\nimport { DUMP_SESSION_KEYS } from './constants.js';\nexport function logLocalStaticKeys(s, keyLogger) {\n if (!keyLogger.enabled || !DUMP_SESSION_KEYS) {\n return;\n }\n if (s) {\n keyLogger(`LOCAL_STATIC_PUBLIC_KEY ${uint8ArrayToString(s.publicKey, 'hex')}`);\n keyLogger(`LOCAL_STATIC_PRIVATE_KEY ${uint8ArrayToString(s.privateKey, 'hex')}`);\n }\n else {\n keyLogger('Missing local static keys.');\n }\n}\nexport function logLocalEphemeralKeys(e, keyLogger) {\n if (!keyLogger.enabled || !DUMP_SESSION_KEYS) {\n return;\n }\n if (e) {\n keyLogger(`LOCAL_PUBLIC_EPHEMERAL_KEY ${uint8ArrayToString(e.publicKey, 'hex')}`);\n keyLogger(`LOCAL_PRIVATE_EPHEMERAL_KEY ${uint8ArrayToString(e.privateKey, 'hex')}`);\n }\n else {\n keyLogger('Missing local ephemeral keys.');\n }\n}\nexport function logRemoteStaticKey(rs, keyLogger) {\n if (!keyLogger.enabled || !DUMP_SESSION_KEYS) {\n return;\n }\n if (rs) {\n keyLogger(`REMOTE_STATIC_PUBLIC_KEY ${uint8ArrayToString(rs.subarray(), 'hex')}`);\n }\n else {\n keyLogger('Missing remote static public key.');\n }\n}\nexport function logRemoteEphemeralKey(re, keyLogger) {\n if (!keyLogger.enabled || !DUMP_SESSION_KEYS) {\n return;\n }\n if (re) {\n keyLogger(`REMOTE_EPHEMERAL_PUBLIC_KEY ${uint8ArrayToString(re.subarray(), 'hex')}`);\n }\n else {\n keyLogger('Missing remote ephemeral keys.');\n }\n}\nexport function logCipherState(cs1, cs2, keyLogger) {\n if (!keyLogger.enabled || !DUMP_SESSION_KEYS) {\n return;\n }\n keyLogger(`CIPHER_STATE_1 ${cs1.n.getUint64()} ${cs1.k && uint8ArrayToString(cs1.k, 'hex')}`);\n keyLogger(`CIPHER_STATE_2 ${cs2.n.getUint64()} ${cs2.k && uint8ArrayToString(cs2.k, 'hex')}`);\n}\n//# sourceMappingURL=logger.js.map","export class UnexpectedPeerError extends Error {\n code;\n constructor(message = 'Unexpected Peer') {\n super(message);\n this.code = UnexpectedPeerError.code;\n }\n static code = 'ERR_UNEXPECTED_PEER';\n}\nexport class InvalidCryptoExchangeError extends Error {\n code;\n constructor(message = 'Invalid crypto exchange') {\n super(message);\n this.code = InvalidCryptoExchangeError.code;\n }\n static code = 'ERR_INVALID_CRYPTO_EXCHANGE';\n}\n//# sourceMappingURL=errors.js.map","import { alloc as uint8ArrayAlloc } from 'uint8arrays/alloc';\nexport const MIN_NONCE = 0;\n// For performance reasons, the nonce is represented as a JS `number`\n// Although JS `number` can safely represent integers up to 2 ** 53 - 1, we choose to only use\n// 4 bytes to store the data for performance reason.\n// This is a slight deviation from the noise spec, which describes the max nonce as 2 ** 64 - 2\n// The effect is that this implementation will need a new handshake to be performed after fewer messages are exchanged than other implementations with full uint64 nonces.\n// this MAX_NONCE is still a large number of messages, so the practical effect of this is negligible.\nexport const MAX_NONCE = 0xffffffff;\nconst ERR_MAX_NONCE = 'Cipherstate has reached maximum n, a new handshake must be performed';\n/**\n * The nonce is an uint that's increased over time.\n * Maintaining different representations help improve performance.\n */\nexport class Nonce {\n n;\n bytes;\n view;\n constructor(n = MIN_NONCE) {\n this.n = n;\n this.bytes = uint8ArrayAlloc(12);\n this.view = new DataView(this.bytes.buffer, this.bytes.byteOffset, this.bytes.byteLength);\n this.view.setUint32(4, n, true);\n }\n increment() {\n this.n++;\n // Even though we're treating the nonce as 8 bytes, RFC7539 specifies 12 bytes for a nonce.\n this.view.setUint32(4, this.n, true);\n }\n getBytes() {\n return this.bytes;\n }\n getUint64() {\n return this.n;\n }\n assertValue() {\n if (this.n > MAX_NONCE) {\n throw new Error(ERR_MAX_NONCE);\n }\n }\n}\n//# sourceMappingURL=nonce.js.map","import { Uint8ArrayList } from 'uint8arraylist';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays';\nimport { alloc as uint8ArrayAlloc } from 'uint8arrays/alloc';\nimport { InvalidCryptoExchangeError } from './errors.js';\nimport { Nonce } from './nonce.js';\n// Code in this file is a direct translation of a subset of the noise protocol https://noiseprotocol.org/noise.html,\n// agnostic to libp2p's usage of noise\nexport const ZEROLEN = uint8ArrayAlloc(0);\nexport class CipherState {\n k;\n n;\n crypto;\n constructor(crypto, k = undefined, n = 0) {\n this.crypto = crypto;\n this.k = k;\n this.n = new Nonce(n);\n }\n hasKey() {\n return Boolean(this.k);\n }\n encryptWithAd(ad, plaintext) {\n if (!this.hasKey()) {\n return plaintext;\n }\n this.n.assertValue();\n const e = this.crypto.encrypt(plaintext, this.n.getBytes(), ad, this.k);\n this.n.increment();\n return e;\n }\n decryptWithAd(ad, ciphertext, dst) {\n if (!this.hasKey()) {\n return ciphertext;\n }\n this.n.assertValue();\n const plaintext = this.crypto.decrypt(ciphertext, this.n.getBytes(), ad, this.k, dst);\n this.n.increment();\n return plaintext;\n }\n}\nexport class SymmetricState {\n cs;\n ck;\n h;\n crypto;\n constructor(crypto, protocolName) {\n this.crypto = crypto;\n const protocolNameBytes = uint8ArrayFromString(protocolName, 'utf-8');\n this.h = hashProtocolName(crypto, protocolNameBytes);\n this.ck = this.h;\n this.cs = new CipherState(crypto);\n }\n mixKey(ikm) {\n const [ck, tempK] = this.crypto.hkdf(this.ck, ikm);\n this.ck = ck;\n this.cs = new CipherState(this.crypto, tempK);\n }\n mixHash(data) {\n this.h = this.crypto.hash(new Uint8ArrayList(this.h, data));\n }\n encryptAndHash(plaintext) {\n const ciphertext = this.cs.encryptWithAd(this.h, plaintext);\n this.mixHash(ciphertext);\n return ciphertext;\n }\n decryptAndHash(ciphertext) {\n const plaintext = this.cs.decryptWithAd(this.h, ciphertext);\n this.mixHash(ciphertext);\n return plaintext;\n }\n split() {\n const [tempK1, tempK2] = this.crypto.hkdf(this.ck, ZEROLEN);\n return [new CipherState(this.crypto, tempK1), new CipherState(this.crypto, tempK2)];\n }\n}\nexport class AbstractHandshakeState {\n ss;\n s;\n e;\n rs;\n re;\n initiator;\n crypto;\n constructor(init) {\n const { crypto, protocolName, prologue, initiator, s, e, rs, re } = init;\n this.crypto = crypto;\n this.ss = new SymmetricState(crypto, protocolName);\n this.ss.mixHash(prologue);\n this.initiator = initiator;\n this.s = s;\n this.e = e;\n this.rs = rs;\n this.re = re;\n }\n writeE() {\n if (this.e) {\n throw new Error('ephemeral keypair is already set');\n }\n const e = this.crypto.generateKeypair();\n this.ss.mixHash(e.publicKey);\n this.e = e;\n return e.publicKey;\n }\n writeS() {\n if (!this.s) {\n throw new Error('static keypair is not set');\n }\n return this.ss.encryptAndHash(this.s.publicKey);\n }\n writeEE() {\n if (!this.e) {\n throw new Error('ephemeral keypair is not set');\n }\n if (!this.re) {\n throw new Error('remote ephemeral public key is not set');\n }\n this.ss.mixKey(this.crypto.dh(this.e, this.re));\n }\n writeES() {\n if (this.initiator) {\n if (!this.e) {\n throw new Error('ephemeral keypair is not set');\n }\n if (!this.rs) {\n throw new Error('remote static public key is not set');\n }\n this.ss.mixKey(this.crypto.dh(this.e, this.rs));\n }\n else {\n if (!this.s) {\n throw new Error('static keypair is not set');\n }\n if (!this.re) {\n throw new Error('remote ephemeral public key is not set');\n }\n this.ss.mixKey(this.crypto.dh(this.s, this.re));\n }\n }\n writeSE() {\n if (this.initiator) {\n if (!this.s) {\n throw new Error('static keypair is not set');\n }\n if (!this.re) {\n throw new Error('remote ephemeral public key is not set');\n }\n this.ss.mixKey(this.crypto.dh(this.s, this.re));\n }\n else {\n if (!this.e) {\n throw new Error('ephemeral keypair is not set');\n }\n if (!this.rs) {\n throw new Error('remote static public key is not set');\n }\n this.ss.mixKey(this.crypto.dh(this.e, this.rs));\n }\n }\n readE(message, offset = 0) {\n if (this.re) {\n throw new Error('remote ephemeral public key is already set');\n }\n if (message.byteLength < offset + 32) {\n throw new Error('message is not long enough');\n }\n this.re = message.sublist(offset, offset + 32);\n this.ss.mixHash(this.re);\n }\n readS(message, offset = 0) {\n if (this.rs) {\n throw new Error('remote static public key is already set');\n }\n const cipherLength = 32 + (this.ss.cs.hasKey() ? 16 : 0);\n if (message.byteLength < offset + cipherLength) {\n throw new Error('message is not long enough');\n }\n const temp = message.sublist(offset, offset + cipherLength);\n this.rs = this.ss.decryptAndHash(temp);\n return cipherLength;\n }\n readEE() {\n this.writeEE();\n }\n readES() {\n this.writeES();\n }\n readSE() {\n this.writeSE();\n }\n}\n/**\n * A IHandshakeState that's optimized for the XX pattern\n */\nexport class XXHandshakeState extends AbstractHandshakeState {\n // e\n writeMessageA(payload) {\n return new Uint8ArrayList(this.writeE(), this.ss.encryptAndHash(payload));\n }\n // e, ee, s, es\n writeMessageB(payload) {\n const e = this.writeE();\n this.writeEE();\n const encS = this.writeS();\n this.writeES();\n return new Uint8ArrayList(e, encS, this.ss.encryptAndHash(payload));\n }\n // s, se\n writeMessageC(payload) {\n const encS = this.writeS();\n this.writeSE();\n return new Uint8ArrayList(encS, this.ss.encryptAndHash(payload));\n }\n // e\n readMessageA(message) {\n try {\n this.readE(message);\n return this.ss.decryptAndHash(message.sublist(32));\n }\n catch (e) {\n throw new InvalidCryptoExchangeError(`handshake stage 0 validation fail: ${e.message}`);\n }\n }\n // e, ee, s, es\n readMessageB(message) {\n try {\n this.readE(message);\n this.readEE();\n const consumed = this.readS(message, 32);\n this.readES();\n return this.ss.decryptAndHash(message.sublist(32 + consumed));\n }\n catch (e) {\n throw new InvalidCryptoExchangeError(`handshake stage 1 validation fail: ${e.message}`);\n }\n }\n // s, se\n readMessageC(message) {\n try {\n const consumed = this.readS(message);\n this.readSE();\n return this.ss.decryptAndHash(message.sublist(consumed));\n }\n catch (e) {\n throw new InvalidCryptoExchangeError(`handshake stage 2 validation fail: ${e.message}`);\n }\n }\n}\nfunction hashProtocolName(crypto, protocolName) {\n if (protocolName.length <= 32) {\n const h = uint8ArrayAlloc(32);\n h.set(protocolName);\n return h;\n }\n else {\n return crypto.hash(protocolName);\n }\n}\n//# sourceMappingURL=protocol.js.map","/* eslint-disable import/export */\n/* eslint-disable complexity */\n/* eslint-disable @typescript-eslint/no-namespace */\n/* eslint-disable @typescript-eslint/no-unnecessary-boolean-literal-compare */\n/* eslint-disable @typescript-eslint/no-empty-interface */\nimport { decodeMessage, encodeMessage, message } from 'protons-runtime';\nimport { alloc as uint8ArrayAlloc } from 'uint8arrays/alloc';\nexport var NoiseExtensions;\n(function (NoiseExtensions) {\n let _codec;\n NoiseExtensions.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if (obj.webtransportCerthashes != null) {\n for (const value of obj.webtransportCerthashes) {\n w.uint32(10);\n w.bytes(value);\n }\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length) => {\n const obj = {\n webtransportCerthashes: []\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.webtransportCerthashes.push(reader.bytes());\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n NoiseExtensions.encode = (obj) => {\n return encodeMessage(obj, NoiseExtensions.codec());\n };\n NoiseExtensions.decode = (buf) => {\n return decodeMessage(buf, NoiseExtensions.codec());\n };\n})(NoiseExtensions || (NoiseExtensions = {}));\nexport var NoiseHandshakePayload;\n(function (NoiseHandshakePayload) {\n let _codec;\n NoiseHandshakePayload.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.identityKey != null && obj.identityKey.byteLength > 0)) {\n w.uint32(10);\n w.bytes(obj.identityKey);\n }\n if ((obj.identitySig != null && obj.identitySig.byteLength > 0)) {\n w.uint32(18);\n w.bytes(obj.identitySig);\n }\n if (obj.extensions != null) {\n w.uint32(34);\n NoiseExtensions.codec().encode(obj.extensions, w);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length) => {\n const obj = {\n identityKey: uint8ArrayAlloc(0),\n identitySig: uint8ArrayAlloc(0)\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.identityKey = reader.bytes();\n break;\n }\n case 2: {\n obj.identitySig = reader.bytes();\n break;\n }\n case 4: {\n obj.extensions = NoiseExtensions.codec().decode(reader, reader.uint32());\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n NoiseHandshakePayload.encode = (obj) => {\n return encodeMessage(obj, NoiseHandshakePayload.codec());\n };\n NoiseHandshakePayload.decode = (buf) => {\n return decodeMessage(buf, NoiseHandshakePayload.codec());\n };\n})(NoiseHandshakePayload || (NoiseHandshakePayload = {}));\n//# sourceMappingURL=payload.js.map","import { unmarshalPublicKey } from '@libp2p/crypto/keys';\nimport {} from 'uint8arraylist';\nimport { equals, toString } from 'uint8arrays';\nimport { concat as uint8ArrayConcat } from 'uint8arrays/concat';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport { UnexpectedPeerError } from './errors.js';\nimport { NoiseHandshakePayload } from './proto/payload.js';\nexport async function createHandshakePayload(privateKey, staticPublicKey, extensions) {\n const identitySig = await privateKey.sign(getSignaturePayload(staticPublicKey));\n return NoiseHandshakePayload.encode({\n identityKey: privateKey.public.bytes,\n identitySig,\n extensions\n });\n}\nexport async function decodeHandshakePayload(payloadBytes, remoteStaticKey, remoteIdentityKey) {\n try {\n const payload = NoiseHandshakePayload.decode(payloadBytes);\n if (remoteIdentityKey) {\n const remoteIdentityKeyBytes = remoteIdentityKey.subarray();\n if (!equals(remoteIdentityKeyBytes, payload.identityKey)) {\n throw new Error(`Payload identity key ${toString(payload.identityKey, 'hex')} does not match expected remote identity key ${toString(remoteIdentityKeyBytes, 'hex')}`);\n }\n }\n if (!remoteStaticKey) {\n throw new Error('Remote static does not exist');\n }\n const signaturePayload = getSignaturePayload(remoteStaticKey);\n const publicKey = unmarshalPublicKey(payload.identityKey);\n if (!(await publicKey.verify(signaturePayload, payload.identitySig))) {\n throw new Error('Invalid payload signature');\n }\n return payload;\n }\n catch (e) {\n throw new UnexpectedPeerError(e.message);\n }\n}\nexport function getSignaturePayload(publicKey) {\n const prefix = uint8ArrayFromString('noise-libp2p-static-key:');\n if (publicKey instanceof Uint8Array) {\n return uint8ArrayConcat([prefix, publicKey], prefix.length + publicKey.length);\n }\n publicKey.prepend(prefix);\n return publicKey;\n}\n//# sourceMappingURL=utils.js.map","import { unmarshalPrivateKey } from '@libp2p/crypto/keys';\nimport { CodeError, serviceCapabilities, isPeerId } from '@libp2p/interface';\nimport { peerIdFromKeys } from '@libp2p/peer-id';\nimport { decode } from 'it-length-prefixed';\nimport { lpStream } from 'it-length-prefixed-stream';\nimport { duplexPair } from 'it-pair/duplex';\nimport { pipe } from 'it-pipe';\nimport { alloc as uint8ArrayAlloc } from 'uint8arrays/alloc';\nimport { NOISE_MSG_MAX_LENGTH_BYTES } from './constants.js';\nimport { defaultCrypto } from './crypto/index.js';\nimport { wrapCrypto } from './crypto.js';\nimport { uint16BEDecode, uint16BEEncode } from './encoder.js';\nimport { registerMetrics } from './metrics.js';\nimport { performHandshakeInitiator, performHandshakeResponder } from './performHandshake.js';\nimport { decryptStream, encryptStream } from './streaming.js';\nexport class Noise {\n protocol = '/noise';\n crypto;\n prologue;\n staticKey;\n extensions;\n metrics;\n components;\n constructor(components, init = {}) {\n const { staticNoiseKey, extensions, crypto, prologueBytes } = init;\n const { metrics } = components;\n this.components = components;\n const _crypto = crypto ?? defaultCrypto;\n this.crypto = wrapCrypto(_crypto);\n this.extensions = extensions;\n this.metrics = metrics ? registerMetrics(metrics) : undefined;\n if (staticNoiseKey) {\n // accepts x25519 private key of length 32\n this.staticKey = _crypto.generateX25519KeyPairFromSeed(staticNoiseKey);\n }\n else {\n this.staticKey = _crypto.generateX25519KeyPair();\n }\n this.prologue = prologueBytes ?? uint8ArrayAlloc(0);\n }\n [Symbol.toStringTag] = '@chainsafe/libp2p-noise';\n [serviceCapabilities] = [\n '@libp2p/connection-encryption',\n '@chainsafe/libp2p-noise'\n ];\n async secureOutbound(...args) {\n const { localPeer, connection, remotePeer } = this.parseArgs(args);\n const wrappedConnection = lpStream(connection, {\n lengthEncoder: uint16BEEncode,\n lengthDecoder: uint16BEDecode,\n maxDataLength: NOISE_MSG_MAX_LENGTH_BYTES\n });\n if (!localPeer.privateKey) {\n throw new CodeError('local peerId does not contain private key', 'ERR_NO_PRIVATE_KEY');\n }\n const privateKey = await unmarshalPrivateKey(localPeer.privateKey);\n const remoteIdentityKey = remotePeer?.publicKey;\n const handshake = await this.performHandshakeInitiator(wrappedConnection, privateKey, remoteIdentityKey);\n const conn = await this.createSecureConnection(wrappedConnection, handshake);\n connection.source = conn.source;\n connection.sink = conn.sink;\n return {\n conn: connection,\n remoteExtensions: handshake.payload.extensions,\n remotePeer: await peerIdFromKeys(handshake.payload.identityKey)\n };\n }\n async secureInbound(...args) {\n const { localPeer, connection, remotePeer } = this.parseArgs(args);\n const wrappedConnection = lpStream(connection, {\n lengthEncoder: uint16BEEncode,\n lengthDecoder: uint16BEDecode,\n maxDataLength: NOISE_MSG_MAX_LENGTH_BYTES\n });\n if (!localPeer.privateKey) {\n throw new CodeError('local peerId does not contain private key', 'ERR_NO_PRIVATE_KEY');\n }\n const privateKey = await unmarshalPrivateKey(localPeer.privateKey);\n const remoteIdentityKey = remotePeer?.publicKey;\n const handshake = await this.performHandshakeResponder(wrappedConnection, privateKey, remoteIdentityKey);\n const conn = await this.createSecureConnection(wrappedConnection, handshake);\n connection.source = conn.source;\n connection.sink = conn.sink;\n return {\n conn: connection,\n remoteExtensions: handshake.payload.extensions,\n remotePeer: await peerIdFromKeys(handshake.payload.identityKey)\n };\n }\n /**\n * Perform XX handshake as initiator.\n */\n async performHandshakeInitiator(connection, \n // TODO: pass private key in noise constructor via Components\n privateKey, remoteIdentityKey) {\n let result;\n try {\n result = await performHandshakeInitiator({\n connection,\n privateKey,\n remoteIdentityKey,\n log: this.components.logger.forComponent('libp2p:noise:xxhandshake'),\n crypto: this.crypto,\n prologue: this.prologue,\n s: this.staticKey,\n extensions: this.extensions\n });\n this.metrics?.xxHandshakeSuccesses.increment();\n }\n catch (e) {\n this.metrics?.xxHandshakeErrors.increment();\n throw e;\n }\n return result;\n }\n /**\n * Perform XX handshake as responder.\n */\n async performHandshakeResponder(connection, \n // TODO: pass private key in noise constructor via Components\n privateKey, remoteIdentityKey) {\n let result;\n try {\n result = await performHandshakeResponder({\n connection,\n privateKey,\n remoteIdentityKey,\n log: this.components.logger.forComponent('libp2p:noise:xxhandshake'),\n crypto: this.crypto,\n prologue: this.prologue,\n s: this.staticKey,\n extensions: this.extensions\n });\n this.metrics?.xxHandshakeSuccesses.increment();\n }\n catch (e) {\n this.metrics?.xxHandshakeErrors.increment();\n throw e;\n }\n return result;\n }\n async createSecureConnection(connection, handshake) {\n // Create encryption box/unbox wrapper\n const [secure, user] = duplexPair();\n const network = connection.unwrap();\n await pipe(secure, // write to wrapper\n encryptStream(handshake, this.metrics), // encrypt data + prefix with message length\n network, // send to the remote peer\n (source) => decode(source, { lengthDecoder: uint16BEDecode }), // read message length prefix\n decryptStream(handshake, this.metrics), // decrypt the incoming data\n secure // pipe to the wrapper\n );\n return user;\n }\n /**\n * Detect call signature in `libp2p@1.x.x` or `libp2p@2.x.x` style.\n *\n * TODO: remove this after `libp2p@2.x.x` is released and only support the\n * newer style\n */\n parseArgs(args) {\n // if the first argument is a peer id, we're using the libp2p@1.x.x style\n if (isPeerId(args[0])) {\n return {\n localPeer: args[0],\n connection: args[1],\n remotePeer: args[2]\n };\n }\n else {\n // handle upcoming changes in libp2p@2.x.x where the first argument is the\n // connection and the second is optionally the remote peer\n // @see https://github.com/libp2p/js-libp2p/pull/2304\n return {\n localPeer: this.components.peerId,\n connection: args[0],\n remotePeer: args[1]\n };\n }\n }\n}\n//# sourceMappingURL=noise.js.map","export function wrapCrypto(crypto) {\n return {\n generateKeypair: crypto.generateX25519KeyPair,\n dh: (keypair, publicKey) => crypto.generateX25519SharedKey(keypair.privateKey, publicKey).subarray(0, 32),\n encrypt: crypto.chaCha20Poly1305Encrypt,\n decrypt: crypto.chaCha20Poly1305Decrypt,\n hash: crypto.hashSHA256,\n hkdf: crypto.getHKDF\n };\n}\n//# sourceMappingURL=crypto.js.map","export function registerMetrics(metrics) {\n return {\n xxHandshakeSuccesses: metrics.registerCounter('libp2p_noise_xxhandshake_successes_total', {\n help: 'Total count of noise xxHandshakes successes_'\n }),\n xxHandshakeErrors: metrics.registerCounter('libp2p_noise_xxhandshake_error_total', {\n help: 'Total count of noise xxHandshakes errors'\n }),\n encryptedPackets: metrics.registerCounter('libp2p_noise_encrypted_packets_total', {\n help: 'Total count of noise encrypted packets successfully'\n }),\n decryptedPackets: metrics.registerCounter('libp2p_noise_decrypted_packets_total', {\n help: 'Total count of noise decrypted packets'\n }),\n decryptErrors: metrics.registerCounter('libp2p_noise_decrypt_errors_total', {\n help: 'Total count of noise decrypt errors'\n })\n };\n}\n//# sourceMappingURL=metrics.js.map","import { logLocalStaticKeys, logLocalEphemeralKeys, logRemoteEphemeralKey, logRemoteStaticKey, logCipherState } from './logger.js';\nimport { ZEROLEN, XXHandshakeState } from './protocol.js';\nimport { createHandshakePayload, decodeHandshakePayload } from './utils.js';\nexport async function performHandshakeInitiator(init) {\n const { log, connection, crypto, privateKey, prologue, s, remoteIdentityKey, extensions } = init;\n const payload = await createHandshakePayload(privateKey, s.publicKey, extensions);\n const xx = new XXHandshakeState({\n crypto,\n protocolName: 'Noise_XX_25519_ChaChaPoly_SHA256',\n initiator: true,\n prologue,\n s\n });\n logLocalStaticKeys(xx.s, log);\n log.trace('Stage 0 - Initiator starting to send first message.');\n await connection.write(xx.writeMessageA(ZEROLEN));\n log.trace('Stage 0 - Initiator finished sending first message.');\n logLocalEphemeralKeys(xx.e, log);\n log.trace('Stage 1 - Initiator waiting to receive first message from responder...');\n const plaintext = xx.readMessageB(await connection.read());\n log.trace('Stage 1 - Initiator received the message.');\n logRemoteEphemeralKey(xx.re, log);\n logRemoteStaticKey(xx.rs, log);\n log.trace(\"Initiator going to check remote's signature...\");\n const receivedPayload = await decodeHandshakePayload(plaintext, xx.rs, remoteIdentityKey);\n log.trace('All good with the signature!');\n log.trace('Stage 2 - Initiator sending third handshake message.');\n await connection.write(xx.writeMessageC(payload));\n log.trace('Stage 2 - Initiator sent message with signed payload.');\n const [cs1, cs2] = xx.ss.split();\n logCipherState(cs1, cs2, log);\n return {\n payload: receivedPayload,\n encrypt: (plaintext) => cs1.encryptWithAd(ZEROLEN, plaintext),\n decrypt: (ciphertext, dst) => cs2.decryptWithAd(ZEROLEN, ciphertext, dst)\n };\n}\nexport async function performHandshakeResponder(init) {\n const { log, connection, crypto, privateKey, prologue, s, remoteIdentityKey, extensions } = init;\n const payload = await createHandshakePayload(privateKey, s.publicKey, extensions);\n const xx = new XXHandshakeState({\n crypto,\n protocolName: 'Noise_XX_25519_ChaChaPoly_SHA256',\n initiator: false,\n prologue,\n s\n });\n logLocalStaticKeys(xx.s, log);\n log.trace('Stage 0 - Responder waiting to receive first message.');\n xx.readMessageA(await connection.read());\n log.trace('Stage 0 - Responder received first message.');\n logRemoteEphemeralKey(xx.re, log);\n log.trace('Stage 1 - Responder sending out first message with signed payload and static key.');\n await connection.write(xx.writeMessageB(payload));\n log.trace('Stage 1 - Responder sent the second handshake message with signed payload.');\n logLocalEphemeralKeys(xx.e, log);\n log.trace('Stage 2 - Responder waiting for third handshake message...');\n const plaintext = xx.readMessageC(await connection.read());\n log.trace('Stage 2 - Responder received the message, finished handshake.');\n const receivedPayload = await decodeHandshakePayload(plaintext, xx.rs, remoteIdentityKey);\n const [cs1, cs2] = xx.ss.split();\n logCipherState(cs1, cs2, log);\n return {\n payload: receivedPayload,\n encrypt: (plaintext) => cs2.encryptWithAd(ZEROLEN, plaintext),\n decrypt: (ciphertext, dst) => cs1.decryptWithAd(ZEROLEN, ciphertext, dst)\n };\n}\n//# sourceMappingURL=performHandshake.js.map","import { pair } from './index.js';\n/**\n * Two duplex streams that are attached to each other\n */\nexport function duplexPair() {\n const a = pair();\n const b = pair();\n return [\n {\n source: a.source,\n sink: b.sink\n },\n {\n source: b.source,\n sink: a.sink\n }\n ];\n}\n//# sourceMappingURL=duplex.js.map","import { Uint8ArrayList } from 'uint8arraylist';\nimport { NOISE_MSG_MAX_LENGTH_BYTES, NOISE_MSG_MAX_LENGTH_BYTES_WITHOUT_TAG } from './constants.js';\nimport { uint16BEEncode } from './encoder.js';\nconst CHACHA_TAG_LENGTH = 16;\n// Returns generator that encrypts payload from the user\nexport function encryptStream(handshake, metrics) {\n return async function* (source) {\n for await (const chunk of source) {\n for (let i = 0; i < chunk.length; i += NOISE_MSG_MAX_LENGTH_BYTES_WITHOUT_TAG) {\n let end = i + NOISE_MSG_MAX_LENGTH_BYTES_WITHOUT_TAG;\n if (end > chunk.length) {\n end = chunk.length;\n }\n let data;\n if (chunk instanceof Uint8Array) {\n data = handshake.encrypt(chunk.subarray(i, end));\n }\n else {\n data = handshake.encrypt(chunk.sublist(i, end));\n }\n metrics?.encryptedPackets.increment();\n yield new Uint8ArrayList(uint16BEEncode(data.byteLength), data);\n }\n }\n };\n}\n// Decrypt received payload to the user\nexport function decryptStream(handshake, metrics) {\n return async function* (source) {\n for await (const chunk of source) {\n for (let i = 0; i < chunk.length; i += NOISE_MSG_MAX_LENGTH_BYTES) {\n let end = i + NOISE_MSG_MAX_LENGTH_BYTES;\n if (end > chunk.length) {\n end = chunk.length;\n }\n if (end - CHACHA_TAG_LENGTH < i) {\n throw new Error('Invalid chunk');\n }\n const encrypted = chunk.sublist(i, end);\n // memory allocation is not cheap so reuse the encrypted Uint8Array\n // see https://github.com/ChainSafe/js-libp2p-noise/pull/242#issue-1422126164\n // this is ok because chacha20 reads bytes one by one and don't reread after that\n // it's also tested in https://github.com/ChainSafe/as-chacha20poly1305/pull/1/files#diff-25252846b58979dcaf4e41d47b3eadd7e4f335e7fb98da6c049b1f9cd011f381R48\n const dst = chunk.subarray(i, end - CHACHA_TAG_LENGTH);\n try {\n const plaintext = handshake.decrypt(encrypted, dst);\n metrics?.decryptedPackets.increment();\n yield plaintext;\n }\n catch (e) {\n metrics?.decryptErrors.increment();\n throw e;\n }\n }\n }\n };\n}\n//# sourceMappingURL=streaming.js.map","import { Noise } from './noise.js';\nexport { pureJsCrypto } from './crypto/js.js';\nexport function noise(init = {}) {\n return (components) => new Noise(components, init);\n}\n//# sourceMappingURL=index.js.map","/**\n * Any object that implements this Symbol as a property should return a\n * PeerDiscovery instance as the property value, similar to how\n * `Symbol.Iterable` can be used to return an `Iterable` from an `Iterator`.\n *\n * @example\n *\n * ```TypeScript\n * import { peerDiscovery, PeerDiscovery } from '@libp2p/peer-discovery'\n *\n * class MyPeerDiscoverer implements PeerDiscovery {\n * get [peerDiscovery] () {\n * return this\n * }\n *\n * // ...other methods\n * }\n * ```\n */\nexport const peerDiscoverySymbol = Symbol.for('@libp2p/peer-discovery');\n//# sourceMappingURL=index.js.map","import { multiaddr } from '@multiformats/multiaddr';\n/*\n * Valid combinations\n */\nexport const DNS4 = base('dns4');\nexport const DNS6 = base('dns6');\nexport const DNSADDR = base('dnsaddr');\nexport const DNS = or(base('dns'), DNSADDR, DNS4, DNS6);\nexport const IP = or(base('ip4'), base('ip6'));\nexport const TCP = or(and(IP, base('tcp')), and(DNS, base('tcp')));\nexport const UDP = and(IP, base('udp'));\nexport const UTP = and(UDP, base('utp'));\nexport const QUIC = and(UDP, base('quic'));\nexport const QUICV1 = and(UDP, base('quic-v1'));\nconst _WebSockets = or(and(TCP, base('ws')), and(DNS, base('ws')));\nexport const WebSockets = or(and(_WebSockets, base('p2p')), _WebSockets);\nconst _WebSocketsSecure = or(and(TCP, base('wss')), and(DNS, base('wss')), and(TCP, base('tls'), base('ws')), and(DNS, base('tls'), base('ws')));\nexport const WebSocketsSecure = or(and(_WebSocketsSecure, base('p2p')), _WebSocketsSecure);\nexport const HTTP = or(and(TCP, base('http')), and(IP, base('http')), and(DNS, base('http')));\nexport const HTTPS = or(and(TCP, base('https')), and(IP, base('https')), and(DNS, base('https')));\nconst _WebRTCDirect = and(UDP, base('webrtc-direct'), base('certhash'));\nexport const WebRTCDirect = or(and(_WebRTCDirect, base('p2p')), _WebRTCDirect);\nconst _WebTransport = and(QUICV1, base('webtransport'), base('certhash'), base('certhash'));\nexport const WebTransport = or(and(_WebTransport, base('p2p')), _WebTransport);\n/**\n * @deprecated\n */\nexport const P2PWebRTCStar = or(and(WebSockets, base('p2p-webrtc-star'), base('p2p')), and(WebSocketsSecure, base('p2p-webrtc-star'), base('p2p')), and(WebSockets, base('p2p-webrtc-star')), and(WebSocketsSecure, base('p2p-webrtc-star')));\nexport const WebSocketStar = or(and(WebSockets, base('p2p-websocket-star'), base('p2p')), and(WebSocketsSecure, base('p2p-websocket-star'), base('p2p')), and(WebSockets, base('p2p-websocket-star')), and(WebSocketsSecure, base('p2p-websocket-star')));\n/**\n * @deprecated\n */\nexport const P2PWebRTCDirect = or(and(HTTP, base('p2p-webrtc-direct'), base('p2p')), and(HTTPS, base('p2p-webrtc-direct'), base('p2p')), and(HTTP, base('p2p-webrtc-direct')), and(HTTPS, base('p2p-webrtc-direct')));\nexport const Reliable = or(_WebSockets, _WebSocketsSecure, HTTP, HTTPS, P2PWebRTCStar, P2PWebRTCDirect, TCP, UTP, QUIC, DNS, WebRTCDirect, WebTransport);\n// Unlike ws-star, stardust can run over any transport thus removing the requirement for websockets (but don't even think about running a stardust server over webrtc-star ;) )\nexport const Stardust = or(and(Reliable, base('p2p-stardust'), base('p2p')), and(Reliable, base('p2p-stardust')));\nconst _P2P = or(and(Reliable, base('p2p')), P2PWebRTCStar, P2PWebRTCDirect, WebRTCDirect, WebTransport, base('p2p'));\nconst _Circuit = or(and(_P2P, base('p2p-circuit'), _P2P), and(_P2P, base('p2p-circuit')), and(base('p2p-circuit'), _P2P), and(Reliable, base('p2p-circuit')), and(base('p2p-circuit'), Reliable), base('p2p-circuit'));\nconst CircuitRecursive = () => or(and(_Circuit, CircuitRecursive), _Circuit);\nexport const Circuit = CircuitRecursive();\nexport const P2P = or(and(Circuit, _P2P, Circuit), and(_P2P, Circuit), and(Circuit, _P2P), Circuit, _P2P);\nexport const IPFS = P2P;\nexport const WebRTC = or(and(Circuit, base('webrtc'), base('p2p')), and(Circuit, base('webrtc')), and(Reliable, base('webrtc'), base('p2p')), and(Reliable, base('webrtc')), base('webrtc'));\n/*\n * Validation funcs\n */\nfunction makeMatchesFunction(partialMatch) {\n function matches(a) {\n let ma;\n try {\n ma = multiaddr(a);\n }\n catch (err) { // catch error\n return false; // also if it's invalid it's probably not matching as well so return false\n }\n const out = partialMatch(ma.protoNames());\n if (out === null) {\n return false;\n }\n if (out === true || out === false) {\n return out;\n }\n return out.length === 0;\n }\n return matches;\n}\nfunction and(...args) {\n function partialMatch(a) {\n if (a.length < args.length) {\n return null;\n }\n let out = a;\n args.some((arg) => {\n out = typeof arg === 'function'\n ? arg().partialMatch(a)\n : arg.partialMatch(a);\n if (Array.isArray(out)) {\n a = out;\n }\n if (out === null) {\n return true;\n }\n return false;\n });\n return out;\n }\n return {\n toString: function () { return '{ ' + args.join(' ') + ' }'; },\n input: args,\n matches: makeMatchesFunction(partialMatch),\n partialMatch\n };\n}\nfunction or(...args) {\n function partialMatch(a) {\n let out = null;\n args.some((arg) => {\n const res = typeof arg === 'function'\n ? arg().partialMatch(a)\n : arg.partialMatch(a);\n if (res != null) {\n out = res;\n return true;\n }\n return false;\n });\n return out;\n }\n const result = {\n toString: function () { return '{ ' + args.join(' ') + ' }'; },\n input: args,\n matches: makeMatchesFunction(partialMatch),\n partialMatch\n };\n return result;\n}\nfunction base(n) {\n const name = n;\n function matches(a) {\n let ma;\n try {\n ma = multiaddr(a);\n }\n catch (err) { // catch error\n return false; // also if it's invalid it's probably not matching as well so return false\n }\n const pnames = ma.protoNames();\n if (pnames.length === 1 && pnames[0] === name) {\n return true;\n }\n return false;\n }\n function partialMatch(protos) {\n if (protos.length === 0) {\n return null;\n }\n if (protos[0] === name) {\n return protos.slice(1);\n }\n return null;\n }\n return {\n toString: function () { return name; },\n matches,\n partialMatch\n };\n}\n//# sourceMappingURL=index.js.map","/**\n * @packageDocumentation\n *\n * The configured bootstrap peers will be discovered after the configured timeout. This will ensure there are some peers in the peer store for the node to use to discover other peers.\n *\n * They will be tagged with a tag with the name `'bootstrap'` tag, the value `50` and it will expire after two minutes which means the nodes connections may be closed if the maximum number of connections is reached.\n *\n * Clients that need constant connections to bootstrap nodes (e.g. browsers) can set the TTL to `Infinity`.\n *\n * @example Configuring a list of bootstrap nodes\n *\n * ```TypeScript\n * import { createLibp2p } from 'libp2p'\n * import { bootstrap } from '@libp2p/bootstrap'\n *\n * const libp2p = await createLibp2p({\n * peerDiscovery: [\n * bootstrap({\n * list: [\n * // a list of bootstrap peer multiaddrs to connect to on node startup\n * '/ip4/104.131.131.82/tcp/4001/ipfs/QmaCpDMGvV2BGHeYERUEnRQAwe3N8SzbUtfsmvsqQLuvuJ',\n * '/dnsaddr/bootstrap.libp2p.io/ipfs/QmNnooDu7bfjPFoTZYxMNLWUQJyrVwtbZg5gBMjTezGAJN',\n * '/dnsaddr/bootstrap.libp2p.io/ipfs/QmQCU2EcMqAqQPR2i9bChDtGNJchTbq5TbXJJ16u19uLTa'\n * ]\n * })\n * ]\n * })\n *\n * libp2p.addEventListener('peer:discovery', (evt) => {\n * console.log('found peer: ', evt.detail.toString())\n * })\n * ```\n */\nimport { TypedEventEmitter, peerDiscoverySymbol, serviceCapabilities } from '@libp2p/interface';\nimport { peerIdFromString } from '@libp2p/peer-id';\nimport { P2P } from '@multiformats/mafmt';\nimport { multiaddr } from '@multiformats/multiaddr';\nconst DEFAULT_BOOTSTRAP_TAG_NAME = 'bootstrap';\nconst DEFAULT_BOOTSTRAP_TAG_VALUE = 50;\nconst DEFAULT_BOOTSTRAP_TAG_TTL = 120000;\nconst DEFAULT_BOOTSTRAP_DISCOVERY_TIMEOUT = 1000;\n/**\n * Emits 'peer' events on a regular interval for each peer in the provided list.\n */\nclass Bootstrap extends TypedEventEmitter {\n static tag = 'bootstrap';\n log;\n timer;\n list;\n timeout;\n components;\n _init;\n constructor(components, options = { list: [] }) {\n if (options.list == null || options.list.length === 0) {\n throw new Error('Bootstrap requires a list of peer addresses');\n }\n super();\n this.components = components;\n this.log = components.logger.forComponent('libp2p:bootstrap');\n this.timeout = options.timeout ?? DEFAULT_BOOTSTRAP_DISCOVERY_TIMEOUT;\n this.list = [];\n for (const candidate of options.list) {\n if (!P2P.matches(candidate)) {\n this.log.error('Invalid multiaddr');\n continue;\n }\n const ma = multiaddr(candidate);\n const peerIdStr = ma.getPeerId();\n if (peerIdStr == null) {\n this.log.error('Invalid bootstrap multiaddr without peer id');\n continue;\n }\n const peerData = {\n id: peerIdFromString(peerIdStr),\n multiaddrs: [ma]\n };\n this.list.push(peerData);\n }\n this._init = options;\n }\n [peerDiscoverySymbol] = this;\n [Symbol.toStringTag] = '@libp2p/bootstrap';\n [serviceCapabilities] = [\n '@libp2p/peer-discovery'\n ];\n isStarted() {\n return Boolean(this.timer);\n }\n /**\n * Start emitting events\n */\n start() {\n if (this.isStarted()) {\n return;\n }\n this.log('Starting bootstrap node discovery, discovering peers after %s ms', this.timeout);\n this.timer = setTimeout(() => {\n void this._discoverBootstrapPeers()\n .catch(err => {\n this.log.error(err);\n });\n }, this.timeout);\n }\n /**\n * Emit each address in the list as a PeerInfo\n */\n async _discoverBootstrapPeers() {\n if (this.timer == null) {\n return;\n }\n for (const peerData of this.list) {\n await this.components.peerStore.merge(peerData.id, {\n tags: {\n [this._init.tagName ?? DEFAULT_BOOTSTRAP_TAG_NAME]: {\n value: this._init.tagValue ?? DEFAULT_BOOTSTRAP_TAG_VALUE,\n ttl: this._init.tagTTL ?? DEFAULT_BOOTSTRAP_TAG_TTL\n }\n }\n });\n // check we are still running\n if (this.timer == null) {\n return;\n }\n this.safeDispatchEvent('peer', { detail: peerData });\n }\n }\n /**\n * Stop emitting events\n */\n stop() {\n if (this.timer != null) {\n clearTimeout(this.timer);\n }\n this.timer = undefined;\n }\n}\nexport function bootstrap(init) {\n return (components) => new Bootstrap(components, init);\n}\n//# sourceMappingURL=index.js.map","// The domain string used for peer records contained in a Envelope.\nexport const ENVELOPE_DOMAIN_PEER_RECORD = 'libp2p-peer-record';\n// The type hint used to identify peer records in a Envelope.\n// Defined in https://github.com/multiformats/multicodec/blob/master/table.csv\n// with name \"libp2p-peer-record\"\nexport const ENVELOPE_PAYLOAD_TYPE_PEER_RECORD = Uint8Array.from([3, 1]);\n//# sourceMappingURL=consts.js.map","/* eslint-disable import/export */\n/* eslint-disable complexity */\n/* eslint-disable @typescript-eslint/no-namespace */\n/* eslint-disable @typescript-eslint/no-unnecessary-boolean-literal-compare */\n/* eslint-disable @typescript-eslint/no-empty-interface */\nimport { encodeMessage, decodeMessage, message } from 'protons-runtime';\nexport var PeerRecord;\n(function (PeerRecord) {\n let AddressInfo;\n (function (AddressInfo) {\n let _codec;\n AddressInfo.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.multiaddr != null && obj.multiaddr.byteLength > 0)) {\n w.uint32(10);\n w.bytes(obj.multiaddr);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length) => {\n const obj = {\n multiaddr: new Uint8Array(0)\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1:\n obj.multiaddr = reader.bytes();\n break;\n default:\n reader.skipType(tag & 7);\n break;\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n AddressInfo.encode = (obj) => {\n return encodeMessage(obj, AddressInfo.codec());\n };\n AddressInfo.decode = (buf) => {\n return decodeMessage(buf, AddressInfo.codec());\n };\n })(AddressInfo = PeerRecord.AddressInfo || (PeerRecord.AddressInfo = {}));\n let _codec;\n PeerRecord.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.peerId != null && obj.peerId.byteLength > 0)) {\n w.uint32(10);\n w.bytes(obj.peerId);\n }\n if ((obj.seq != null && obj.seq !== 0n)) {\n w.uint32(16);\n w.uint64(obj.seq);\n }\n if (obj.addresses != null) {\n for (const value of obj.addresses) {\n w.uint32(26);\n PeerRecord.AddressInfo.codec().encode(value, w);\n }\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length) => {\n const obj = {\n peerId: new Uint8Array(0),\n seq: 0n,\n addresses: []\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1:\n obj.peerId = reader.bytes();\n break;\n case 2:\n obj.seq = reader.uint64();\n break;\n case 3:\n obj.addresses.push(PeerRecord.AddressInfo.codec().decode(reader, reader.uint32()));\n break;\n default:\n reader.skipType(tag & 7);\n break;\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n PeerRecord.encode = (obj) => {\n return encodeMessage(obj, PeerRecord.codec());\n };\n PeerRecord.decode = (buf) => {\n return decodeMessage(buf, PeerRecord.codec());\n };\n})(PeerRecord || (PeerRecord = {}));\n//# sourceMappingURL=peer-record.js.map","import { peerIdFromBytes } from '@libp2p/peer-id';\nimport { arrayEquals } from '@libp2p/utils/array-equals';\nimport { multiaddr } from '@multiformats/multiaddr';\nimport { ENVELOPE_DOMAIN_PEER_RECORD, ENVELOPE_PAYLOAD_TYPE_PEER_RECORD } from './consts.js';\nimport { PeerRecord as Protobuf } from './peer-record.js';\n/**\n * The PeerRecord is used for distributing peer routing records across the network.\n * It contains the peer's reachable listen addresses.\n */\nexport class PeerRecord {\n /**\n * Unmarshal Peer Record Protobuf\n */\n static createFromProtobuf = (buf) => {\n const peerRecord = Protobuf.decode(buf);\n const peerId = peerIdFromBytes(peerRecord.peerId);\n const multiaddrs = (peerRecord.addresses ?? []).map((a) => multiaddr(a.multiaddr));\n const seqNumber = peerRecord.seq;\n return new PeerRecord({ peerId, multiaddrs, seqNumber });\n };\n static DOMAIN = ENVELOPE_DOMAIN_PEER_RECORD;\n static CODEC = ENVELOPE_PAYLOAD_TYPE_PEER_RECORD;\n peerId;\n multiaddrs;\n seqNumber;\n domain = PeerRecord.DOMAIN;\n codec = PeerRecord.CODEC;\n marshaled;\n constructor(init) {\n const { peerId, multiaddrs, seqNumber } = init;\n this.peerId = peerId;\n this.multiaddrs = multiaddrs ?? [];\n this.seqNumber = seqNumber ?? BigInt(Date.now());\n }\n /**\n * Marshal a record to be used in an envelope\n */\n marshal() {\n if (this.marshaled == null) {\n this.marshaled = Protobuf.encode({\n peerId: this.peerId.toBytes(),\n seq: BigInt(this.seqNumber),\n addresses: this.multiaddrs.map((m) => ({\n multiaddr: m.bytes\n }))\n });\n }\n return this.marshaled;\n }\n /**\n * Returns true if `this` record equals the `other`\n */\n equals(other) {\n if (!(other instanceof PeerRecord)) {\n return false;\n }\n // Validate PeerId\n if (!this.peerId.equals(other.peerId)) {\n return false;\n }\n // Validate seqNumber\n if (this.seqNumber !== other.seqNumber) {\n return false;\n }\n // Validate multiaddrs\n if (!arrayEquals(this.multiaddrs, other.multiaddrs)) {\n return false;\n }\n return true;\n }\n}\n//# sourceMappingURL=index.js.map","/**\n * @packageDocumentation\n *\n * Provides strategies ensure arrays are equivalent.\n *\n * @example\n *\n * ```typescript\n * import { arrayEquals } from '@libp2p/utils/array-equals'\n * import { multiaddr } from '@multformats/multiaddr'\n *\n * const ma1 = multiaddr('/ip4/127.0.0.1/tcp/9000'),\n * const ma2 = multiaddr('/ip4/82.41.53.1/tcp/9000')\n *\n * console.info(arrayEquals([ma1], [ma1])) // true\n * console.info(arrayEquals([ma1], [ma2])) // false\n * ```\n */\n/**\n * Verify if two arrays of non primitive types with the \"equals\" function are equal.\n * Compatible with multiaddr, peer-id and others.\n */\nexport function arrayEquals(a, b) {\n const sort = (a, b) => a.toString().localeCompare(b.toString());\n if (a.length !== b.length) {\n return false;\n }\n b.sort(sort);\n return a.sort(sort).every((item, index) => b[index].equals(item));\n}\n//# sourceMappingURL=array-equals.js.map","/* eslint-disable import/export */\n/* eslint-disable complexity */\n/* eslint-disable @typescript-eslint/no-namespace */\n/* eslint-disable @typescript-eslint/no-unnecessary-boolean-literal-compare */\n/* eslint-disable @typescript-eslint/no-empty-interface */\nimport { encodeMessage, decodeMessage, message } from 'protons-runtime';\nexport var Envelope;\n(function (Envelope) {\n let _codec;\n Envelope.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.publicKey != null && obj.publicKey.byteLength > 0)) {\n w.uint32(10);\n w.bytes(obj.publicKey);\n }\n if ((obj.payloadType != null && obj.payloadType.byteLength > 0)) {\n w.uint32(18);\n w.bytes(obj.payloadType);\n }\n if ((obj.payload != null && obj.payload.byteLength > 0)) {\n w.uint32(26);\n w.bytes(obj.payload);\n }\n if ((obj.signature != null && obj.signature.byteLength > 0)) {\n w.uint32(42);\n w.bytes(obj.signature);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length) => {\n const obj = {\n publicKey: new Uint8Array(0),\n payloadType: new Uint8Array(0),\n payload: new Uint8Array(0),\n signature: new Uint8Array(0)\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1:\n obj.publicKey = reader.bytes();\n break;\n case 2:\n obj.payloadType = reader.bytes();\n break;\n case 3:\n obj.payload = reader.bytes();\n break;\n case 5:\n obj.signature = reader.bytes();\n break;\n default:\n reader.skipType(tag & 7);\n break;\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n Envelope.encode = (obj) => {\n return encodeMessage(obj, Envelope.codec());\n };\n Envelope.decode = (buf) => {\n return decodeMessage(buf, Envelope.codec());\n };\n})(Envelope || (Envelope = {}));\n//# sourceMappingURL=envelope.js.map","import { unmarshalPrivateKey, unmarshalPublicKey } from '@libp2p/crypto/keys';\nimport { CodeError } from '@libp2p/interface';\nimport { peerIdFromKeys } from '@libp2p/peer-id';\nimport * as varint from 'uint8-varint';\nimport { Uint8ArrayList } from 'uint8arraylist';\nimport { equals as uint8ArrayEquals } from 'uint8arrays/equals';\nimport { fromString as uint8arraysFromString } from 'uint8arrays/from-string';\nimport { codes } from '../errors.js';\nimport { Envelope as Protobuf } from './envelope.js';\nexport class RecordEnvelope {\n /**\n * Unmarshal a serialized Envelope protobuf message\n */\n static createFromProtobuf = async (data) => {\n const envelopeData = Protobuf.decode(data);\n const peerId = await peerIdFromKeys(envelopeData.publicKey);\n return new RecordEnvelope({\n peerId,\n payloadType: envelopeData.payloadType,\n payload: envelopeData.payload,\n signature: envelopeData.signature\n });\n };\n /**\n * Seal marshals the given Record, places the marshaled bytes inside an Envelope\n * and signs it with the given peerId's private key\n */\n static seal = async (record, peerId) => {\n if (peerId.privateKey == null) {\n throw new Error('Missing private key');\n }\n const domain = record.domain;\n const payloadType = record.codec;\n const payload = record.marshal();\n const signData = formatSignaturePayload(domain, payloadType, payload);\n const key = await unmarshalPrivateKey(peerId.privateKey);\n const signature = await key.sign(signData.subarray());\n return new RecordEnvelope({\n peerId,\n payloadType,\n payload,\n signature\n });\n };\n /**\n * Open and certify a given marshalled envelope.\n * Data is unmarshalled and the signature validated for the given domain.\n */\n static openAndCertify = async (data, domain) => {\n const envelope = await RecordEnvelope.createFromProtobuf(data);\n const valid = await envelope.validate(domain);\n if (!valid) {\n throw new CodeError('envelope signature is not valid for the given domain', codes.ERR_SIGNATURE_NOT_VALID);\n }\n return envelope;\n };\n peerId;\n payloadType;\n payload;\n signature;\n marshaled;\n /**\n * The Envelope is responsible for keeping an arbitrary signed record\n * by a libp2p peer.\n */\n constructor(init) {\n const { peerId, payloadType, payload, signature } = init;\n this.peerId = peerId;\n this.payloadType = payloadType;\n this.payload = payload;\n this.signature = signature;\n }\n /**\n * Marshal the envelope content\n */\n marshal() {\n if (this.peerId.publicKey == null) {\n throw new Error('Missing public key');\n }\n if (this.marshaled == null) {\n this.marshaled = Protobuf.encode({\n publicKey: this.peerId.publicKey,\n payloadType: this.payloadType,\n payload: this.payload.subarray(),\n signature: this.signature\n });\n }\n return this.marshaled;\n }\n /**\n * Verifies if the other Envelope is identical to this one\n */\n equals(other) {\n return uint8ArrayEquals(this.marshal(), other.marshal());\n }\n /**\n * Validate envelope data signature for the given domain\n */\n async validate(domain) {\n const signData = formatSignaturePayload(domain, this.payloadType, this.payload);\n if (this.peerId.publicKey == null) {\n throw new Error('Missing public key');\n }\n const key = unmarshalPublicKey(this.peerId.publicKey);\n return key.verify(signData.subarray(), this.signature);\n }\n}\n/**\n * Helper function that prepares a Uint8Array to sign or verify a signature\n */\nconst formatSignaturePayload = (domain, payloadType, payload) => {\n // When signing, a peer will prepare a Uint8Array by concatenating the following:\n // - The length of the domain separation string string in bytes\n // - The domain separation string, encoded as UTF-8\n // - The length of the payload_type field in bytes\n // - The value of the payload_type field\n // - The length of the payload field in bytes\n // - The value of the payload field\n const domainUint8Array = uint8arraysFromString(domain);\n const domainLength = varint.encode(domainUint8Array.byteLength);\n const payloadTypeLength = varint.encode(payloadType.length);\n const payloadLength = varint.encode(payload.length);\n return new Uint8ArrayList(domainLength, domainUint8Array, payloadTypeLength, payloadType, payloadLength, payload);\n};\n//# sourceMappingURL=index.js.map","export const codes = {\n ERR_SIGNATURE_NOT_VALID: 'ERR_SIGNATURE_NOT_VALID'\n};\n//# sourceMappingURL=errors.js.map","/**\n * @packageDocumentation\n *\n * This module exports various matchers that can be used to infer the type of a\n * passed multiaddr.\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { DNS } from '@multiformats/multiaddr-matcher'\n *\n * const ma = multiaddr('/dnsaddr/example.org')\n *\n * DNS.matches(ma) // true - this is a multiaddr with a DNS address at the start\n * ```\n *\n * @example\n *\n * The default matching behaviour ignores any subsequent tuples in the multiaddr.\n * If you want stricter matching you can use `.exactMatch`:\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { DNS, Circuit } from '@multiformats/multiaddr-matcher'\n *\n * const ma = multiaddr('/dnsaddr/example.org/p2p/QmFoo/p2p-circuit/p2p/QmBar')\n *\n * DNS.exactMatch(ma) // false - this address has extra tuples after the DNS component\n * Circuit.matches(ma) // true\n * Circuit.exactMatch(ma) // true - the extra tuples are circuit relay related\n * ```\n */\nimport { isIPv4, isIPv6 } from '@chainsafe/is-ip';\nimport {} from '@multiformats/multiaddr';\nimport { base58btc } from 'multiformats/bases/base58';\nimport { base64url } from 'multiformats/bases/base64';\n/**\n * Split a multiaddr into path components\n */\nconst toParts = (ma) => {\n return ma.toString().split('/').slice(1);\n};\nconst func = (fn) => {\n return {\n match: (vals) => {\n if (vals.length < 1) {\n return false;\n }\n if (fn(vals[0])) {\n return vals.slice(1);\n }\n return false;\n },\n pattern: 'fn'\n };\n};\nconst literal = (str) => {\n return {\n match: (vals) => func((val) => val === str).match(vals),\n pattern: str\n };\n};\nconst string = () => {\n return {\n match: (vals) => func((val) => typeof val === 'string').match(vals),\n pattern: '{string}'\n };\n};\nconst number = () => {\n return {\n match: (vals) => func((val) => !isNaN(parseInt(val))).match(vals),\n pattern: '{number}'\n };\n};\nconst peerId = () => {\n return {\n match: (vals) => {\n if (vals.length < 2) {\n return false;\n }\n if (vals[0] !== 'p2p' && vals[0] !== 'ipfs') {\n return false;\n }\n // Q is RSA, 1 is Ed25519 or Secp256k1\n if (vals[1].startsWith('Q') || vals[1].startsWith('1')) {\n try {\n base58btc.decode(`z${vals[1]}`);\n }\n catch (err) {\n return false;\n }\n }\n else {\n return false;\n }\n return vals.slice(2);\n },\n pattern: '/p2p/{peerid}'\n };\n};\nconst certhash = () => {\n return {\n match: (vals) => {\n if (vals.length < 2) {\n return false;\n }\n if (vals[0] !== 'certhash') {\n return false;\n }\n try {\n base64url.decode(vals[1]);\n }\n catch {\n return false;\n }\n return vals.slice(2);\n },\n pattern: '/certhash/{certhash}'\n };\n};\nconst optional = (matcher) => {\n return {\n match: (vals) => {\n const result = matcher.match(vals);\n if (result === false) {\n return vals;\n }\n return result;\n },\n pattern: `optional(${matcher.pattern})`\n };\n};\nconst or = (...matchers) => {\n return {\n match: (vals) => {\n let matches;\n for (const matcher of matchers) {\n const result = matcher.match(vals);\n // no match\n if (result === false) {\n continue;\n }\n // choose greediest matcher\n if (matches == null || result.length < matches.length) {\n matches = result;\n }\n }\n if (matches == null) {\n return false;\n }\n return matches;\n },\n pattern: `or(${matchers.map(m => m.pattern).join(', ')})`\n };\n};\nconst and = (...matchers) => {\n return {\n match: (vals) => {\n for (const matcher of matchers) {\n // pass what's left of the array\n const result = matcher.match(vals);\n // no match\n if (result === false) {\n return false;\n }\n vals = result;\n }\n return vals;\n },\n pattern: `and(${matchers.map(m => m.pattern).join(', ')})`\n };\n};\nfunction fmt(...matchers) {\n function match(ma) {\n let parts = toParts(ma);\n for (const matcher of matchers) {\n const result = matcher.match(parts);\n if (result === false) {\n return false;\n }\n parts = result;\n }\n return parts;\n }\n function matches(ma) {\n const result = match(ma);\n return result !== false;\n }\n function exactMatch(ma) {\n const result = match(ma);\n if (result === false) {\n return false;\n }\n return result.length === 0;\n }\n return {\n matches,\n exactMatch\n };\n}\n/**\n * DNS matchers\n */\nconst _DNS4 = and(literal('dns4'), string());\nconst _DNS6 = and(literal('dns6'), string());\nconst _DNSADDR = and(literal('dnsaddr'), string());\nconst _DNS = and(literal('dns'), string());\n/**\n * Matches dns4 addresses.\n *\n * Use {@link DNS DNS} instead to match any type of DNS address.\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { DNS4 } from '@multiformats/multiaddr-matcher'\n *\n * DNS4.matches(multiaddr('/dns4/example.org')) // true\n * ```\n */\nexport const DNS4 = fmt(_DNS4);\n/**\n * Matches dns6 addresses.\n *\n * Use {@link DNS DNS} instead to match any type of DNS address.\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { DNS6 } from '@multiformats/multiaddr-matcher'\n *\n * DNS6.matches(multiaddr('/dns6/example.org')) // true\n * ```\n */\nexport const DNS6 = fmt(_DNS6);\n/**\n * Matches dnsaddr addresses.\n *\n * Use {@link DNS DNS} instead to match any type of DNS address.\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { DNSADDR } from '@multiformats/multiaddr-matcher'\n *\n * DNSADDR.matches(multiaddr('/dnsaddr/example.org')) // true\n * ```\n */\nexport const DNSADDR = fmt(_DNSADDR);\n/**\n * Matches any dns address.\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { DNS } from '@multiformats/multiaddr-matcher'\n *\n * DNS.matches(multiaddr('/dnsaddr/example.org')) // true\n * DNS.matches(multiaddr('/dns4/example.org')) // true\n * DNS.matches(multiaddr('/dns6/example.org')) // true\n * ```\n */\nexport const DNS = fmt(or(_DNS, _DNSADDR, _DNS4, _DNS6));\nconst _IP4 = and(literal('ip4'), func(isIPv4));\nconst _IP6 = and(literal('ip6'), func(isIPv6));\nconst _IP = or(_IP4, _IP6);\nconst _IP_OR_DOMAIN = or(_IP, _DNS, _DNS4, _DNS6, _DNSADDR);\n/**\n * A matcher for addresses that start with IP or DNS tuples.\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { IP_OR_DOMAIN } from '@multiformats/multiaddr-matcher'\n *\n * IP_OR_DOMAIN.matches(multiaddr('/ip4/123.123.123.123/p2p/QmFoo')) // true\n * IP_OR_DOMAIN.matches(multiaddr('/dns/example.com/p2p/QmFoo')) // true\n * IP_OR_DOMAIN.matches(multiaddr('/p2p/QmFoo')) // false\n * ```\n */\nexport const IP_OR_DOMAIN = fmt(_IP_OR_DOMAIN);\n/**\n * Matches ip4 addresses.\n *\n * Use {@link IP IP} instead to match any ip4/ip6 address.\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { IP4 } from '@multiformats/multiaddr-matcher'\n *\n * const ma = multiaddr('/ip4/123.123.123.123')\n *\n * IP4.matches(ma) // true\n * ```\n */\nexport const IP4 = fmt(_IP4);\n/**\n * Matches ip6 addresses.\n *\n * Use {@link IP IP} instead to match any ip4/ip6 address.\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { IP6 } from '@multiformats/multiaddr-matcher'\n *\n * const ma = multiaddr('/ip6/fe80::1cc1:a3b8:322f:cf22')\n *\n * IP6.matches(ma) // true\n * ```\n */\nexport const IP6 = fmt(_IP6);\n/**\n * Matches ip4 or ip6 addresses.\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { IP } from '@multiformats/multiaddr-matcher'\n *\n * IP.matches(multiaddr('/ip4/123.123.123.123')) // true\n * IP.matches(multiaddr('/ip6/fe80::1cc1:a3b8:322f:cf22')) // true\n * ```\n */\nexport const IP = fmt(_IP);\nconst _TCP = and(_IP_OR_DOMAIN, literal('tcp'), number());\nconst _UDP = and(_IP_OR_DOMAIN, literal('udp'), number());\n/**\n * Matches TCP addresses.\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { TCP } from '@multiformats/multiaddr-matcher'\n *\n * TCP.matches(multiaddr('/ip4/123.123.123.123/tcp/1234')) // true\n * ```\n */\nexport const TCP = fmt(_TCP);\n/**\n * Matches UDP addresses.\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { UDP } from '@multiformats/multiaddr-matcher'\n *\n * UDP.matches(multiaddr('/ip4/123.123.123.123/udp/1234')) // true\n * ```\n */\nexport const UDP = fmt(_UDP);\nconst _QUIC = and(_UDP, literal('quic'));\nconst _QUICV1 = and(_UDP, literal('quic-v1'));\nconst QUIC_V0_OR_V1 = or(_QUIC, _QUICV1);\n/**\n * Matches QUIC addresses.\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { QUIC } from '@multiformats/multiaddr-matcher'\n *\n * QUIC.matches(multiaddr('/ip4/123.123.123.123/udp/1234/quic')) // true\n * ```\n */\nexport const QUIC = fmt(_QUIC);\n/**\n * Matches QUICv1 addresses.\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { QUICV1 } from '@multiformats/multiaddr-matcher'\n *\n * QUICV1.matches(multiaddr('/ip4/123.123.123.123/udp/1234/quic-v1')) // true\n * ```\n */\nexport const QUICV1 = fmt(_QUICV1);\nconst _WEB = or(_IP_OR_DOMAIN, _TCP, _UDP, _QUIC, _QUICV1);\nconst _WebSockets = or(and(_WEB, literal('ws'), optional(peerId())));\n/**\n * Matches WebSocket addresses.\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { WebSockets } from '@multiformats/multiaddr-matcher'\n *\n * WebSockets.matches(multiaddr('/ip4/123.123.123.123/tcp/1234/ws')) // true\n * ```\n */\nexport const WebSockets = fmt(_WebSockets);\nconst _WebSocketsSecure = or(and(_WEB, literal('wss'), optional(peerId())), and(_WEB, literal('tls'), literal('ws'), optional(peerId())));\n/**\n * Matches secure WebSocket addresses.\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { WebSocketsSecure } from '@multiformats/multiaddr-matcher'\n *\n * WebSocketsSecure.matches(multiaddr('/ip4/123.123.123.123/tcp/1234/wss')) // true\n * ```\n */\nexport const WebSocketsSecure = fmt(_WebSocketsSecure);\nconst _WebRTCDirect = and(_UDP, literal('webrtc-direct'), optional(certhash()), optional(certhash()), optional(peerId()));\n/**\n * Matches WebRTC-direct addresses.\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { WebRTCDirect } from '@multiformats/multiaddr-matcher'\n *\n * WebRTCDirect.matches(multiaddr('/ip4/123.123.123.123/tcp/1234/p2p/QmFoo/webrtc-direct/certhash/u....')) // true\n * ```\n */\nexport const WebRTCDirect = fmt(_WebRTCDirect);\nconst _WebTransport = and(_QUICV1, literal('webtransport'), optional(certhash()), optional(certhash()), optional(peerId()));\n/**\n * Matches WebTransport addresses.\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { WebRTCDirect } from '@multiformats/multiaddr-matcher'\n *\n * WebRTCDirect.matches(multiaddr('/ip4/123.123.123.123/udp/1234/quic-v1/webtransport/certhash/u..../certhash/u..../p2p/QmFoo')) // true\n * ```\n */\nexport const WebTransport = fmt(_WebTransport);\nconst _P2P = or(_WebSockets, _WebSocketsSecure, and(_TCP, optional(peerId())), and(QUIC_V0_OR_V1, optional(peerId())), and(_IP_OR_DOMAIN, optional(peerId())), _WebRTCDirect, _WebTransport, peerId());\n/**\n * Matches peer addresses\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { P2P } from '@multiformats/multiaddr-matcher'\n *\n * P2P.matches(multiaddr('/ip4/123.123.123.123/tcp/1234/p2p/QmFoo')) // true\n * ```\n */\nexport const P2P = fmt(_P2P);\nconst _Circuit = and(_P2P, literal('p2p-circuit'), peerId());\n/**\n * Matches circuit relay addresses\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { Circuit } from '@multiformats/multiaddr-matcher'\n *\n * Circuit.matches(multiaddr('/ip4/123.123.123.123/tcp/1234/p2p/QmRelay/p2p-circuit/p2p/QmTarget')) // true\n * ```\n */\nexport const Circuit = fmt(_Circuit);\nconst _WebRTC = or(and(_P2P, literal('p2p-circuit'), literal('webrtc'), optional(peerId())), and(_P2P, literal('webrtc'), optional(peerId())), literal('webrtc'));\n/**\n * Matches WebRTC addresses\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { WebRTC } from '@multiformats/multiaddr-matcher'\n *\n * WebRTC.matches(multiaddr('/ip4/123.123.123.123/tcp/1234/p2p/QmRelay/p2p-circuit/webrtc/p2p/QmTarget')) // true\n * ```\n */\nexport const WebRTC = fmt(_WebRTC);\nconst _HTTP = or(and(_IP_OR_DOMAIN, literal('tcp'), number(), literal('http'), optional(peerId())), and(_IP_OR_DOMAIN, literal('http'), optional(peerId())));\n/**\n * Matches HTTP addresses\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { HTTP } from '@multiformats/multiaddr-matcher'\n *\n * HTTP.matches(multiaddr('/dns/example.org/http')) // true\n * ```\n */\nexport const HTTP = fmt(_HTTP);\nconst _HTTPS = or(and(_IP_OR_DOMAIN, literal('tcp'), or(and(literal('443'), literal('http')), and(number(), literal('https'))), optional(peerId())), and(_IP_OR_DOMAIN, literal('tls'), literal('http'), optional(peerId())), and(_IP_OR_DOMAIN, literal('https'), optional(peerId())));\n/**\n * Matches HTTPS addresses\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { HTTP } from '@multiformats/multiaddr-matcher'\n *\n * HTTP.matches(multiaddr('/dns/example.org/tls/http')) // true\n * ```\n */\nexport const HTTPS = fmt(_HTTPS);\n//# sourceMappingURL=index.js.map","/**\n * @packageDocumentation\n *\n * This module makes it easy to send and receive length-prefixed Protobuf encoded\n * messages over streams.\n *\n * @example\n *\n * ```typescript\n * import { pbStream } from 'it-protobuf-stream'\n * import { MessageType } from './src/my-message-type.js'\n *\n * // RequestType and ResponseType have been generate from `.proto` files and have\n * // `.encode` and `.decode` methods for serialization/deserialization\n *\n * const stream = pbStream(duplex)\n *\n * // write a message to the stream\n * stream.write({\n * foo: 'bar'\n * }, MessageType)\n *\n * // read a message from the stream\n * const res = await stream.read(MessageType)\n * ```\n */\nimport { lpStream } from 'it-length-prefixed-stream';\nexport function pbStream(duplex, opts) {\n const lp = lpStream(duplex, opts);\n const W = {\n read: async (proto, options) => {\n // readLP, decode\n const value = await lp.read(options);\n return proto.decode(value);\n },\n write: async (message, proto, options) => {\n // encode, writeLP\n await lp.write(proto.encode(message), options);\n },\n writeV: async (messages, proto, options) => {\n // encode, writeLP\n await lp.writeV(messages.map(message => proto.encode(message)), options);\n },\n pb: (proto) => {\n return {\n read: async (options) => W.read(proto, options),\n write: async (d, options) => W.write(d, proto, options),\n writeV: async (d, options) => W.writeV(d, proto, options),\n unwrap: () => W\n };\n },\n unwrap: () => {\n return lp.unwrap();\n }\n };\n return W;\n}\n//# sourceMappingURL=index.js.map","/* eslint-disable import/export */\n/* eslint-disable complexity */\n/* eslint-disable @typescript-eslint/no-namespace */\n/* eslint-disable @typescript-eslint/no-unnecessary-boolean-literal-compare */\n/* eslint-disable @typescript-eslint/no-empty-interface */\nimport { encodeMessage, decodeMessage, message } from 'protons-runtime';\nexport var Identify;\n(function (Identify) {\n let _codec;\n Identify.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if (obj.protocolVersion != null) {\n w.uint32(42);\n w.string(obj.protocolVersion);\n }\n if (obj.agentVersion != null) {\n w.uint32(50);\n w.string(obj.agentVersion);\n }\n if (obj.publicKey != null) {\n w.uint32(10);\n w.bytes(obj.publicKey);\n }\n if (obj.listenAddrs != null) {\n for (const value of obj.listenAddrs) {\n w.uint32(18);\n w.bytes(value);\n }\n }\n if (obj.observedAddr != null) {\n w.uint32(34);\n w.bytes(obj.observedAddr);\n }\n if (obj.protocols != null) {\n for (const value of obj.protocols) {\n w.uint32(26);\n w.string(value);\n }\n }\n if (obj.signedPeerRecord != null) {\n w.uint32(66);\n w.bytes(obj.signedPeerRecord);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length) => {\n const obj = {\n listenAddrs: [],\n protocols: []\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 5:\n obj.protocolVersion = reader.string();\n break;\n case 6:\n obj.agentVersion = reader.string();\n break;\n case 1:\n obj.publicKey = reader.bytes();\n break;\n case 2:\n obj.listenAddrs.push(reader.bytes());\n break;\n case 4:\n obj.observedAddr = reader.bytes();\n break;\n case 3:\n obj.protocols.push(reader.string());\n break;\n case 8:\n obj.signedPeerRecord = reader.bytes();\n break;\n default:\n reader.skipType(tag & 7);\n break;\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n Identify.encode = (obj) => {\n return encodeMessage(obj, Identify.codec());\n };\n Identify.decode = (buf) => {\n return decodeMessage(buf, Identify.codec());\n };\n})(Identify || (Identify = {}));\n//# sourceMappingURL=message.js.map","import detectElectron from 'is-electron'\n\nexport const isEnvWithDom = typeof window === 'object' && typeof document === 'object' && document.nodeType === 9\nexport const isElectron = detectElectron()\n\n/**\n * Detects browser main thread **NOT** web worker or service worker\n */\nexport const isBrowser = isEnvWithDom && !isElectron\nexport const isElectronMain = isElectron && !isEnvWithDom\nexport const isElectronRenderer = isElectron && isEnvWithDom\nexport const isNode = typeof globalThis.process !== 'undefined' && typeof globalThis.process.release !== 'undefined' && globalThis.process.release.name === 'node' && !isElectron\n// @ts-ignore\n// eslint-disable-next-line no-undef\nexport const isWebWorker = typeof importScripts === 'function' && typeof self !== 'undefined' && typeof WorkerGlobalScope !== 'undefined' && self instanceof WorkerGlobalScope\n\n// defeat bundlers replacing process.env.NODE_ENV with \"development\" or whatever\nexport const isTest = typeof globalThis.process !== 'undefined' && typeof globalThis.process.env !== 'undefined' && globalThis.process.env['NODE' + (() => '_')() + 'ENV'] === 'test'\nexport const isReactNative = typeof navigator !== 'undefined' && navigator.product === 'ReactNative'\n","import { CodeError } from '@libp2p/interface';\nimport { peerIdFromKeys } from '@libp2p/peer-id';\nimport { RecordEnvelope, PeerRecord } from '@libp2p/peer-record';\nimport { multiaddr } from '@multiformats/multiaddr';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport { isNode, isBrowser, isWebWorker, isElectronMain, isElectronRenderer, isReactNative } from 'wherearewe';\nimport { IDENTIFY_PROTOCOL_VERSION, MAX_IDENTIFY_MESSAGE_SIZE, MAX_PUSH_CONCURRENCY } from './consts.js';\nexport const defaultValues = {\n protocolPrefix: 'ipfs',\n timeout: 5000,\n maxInboundStreams: 1,\n maxOutboundStreams: 1,\n maxObservedAddresses: 10,\n maxMessageSize: MAX_IDENTIFY_MESSAGE_SIZE,\n runOnConnectionOpen: true,\n runOnSelfUpdate: true,\n runOnTransientConnection: true,\n concurrency: MAX_PUSH_CONCURRENCY\n};\n/**\n * Takes the `addr` and converts it to a Multiaddr if possible\n */\nexport function getCleanMultiaddr(addr) {\n if (addr != null && addr.length > 0) {\n try {\n return multiaddr(addr);\n }\n catch {\n }\n }\n}\nexport function getAgentVersion(nodeInfo, agentVersion) {\n if (agentVersion != null) {\n return agentVersion;\n }\n agentVersion = `${nodeInfo.name}/${nodeInfo.version}`;\n // Append user agent version to default AGENT_VERSION depending on the environment\n if (isNode || isElectronMain) {\n agentVersion += ` UserAgent=${globalThis.process.version}`;\n }\n else if (isBrowser || isWebWorker || isElectronRenderer || isReactNative) {\n agentVersion += ` UserAgent=${globalThis.navigator.userAgent}`;\n }\n return agentVersion;\n}\nexport async function consumeIdentifyMessage(peerStore, events, log, connection, message) {\n log('received identify from %p', connection.remotePeer);\n if (message == null) {\n throw new CodeError('message was null or undefined', 'ERR_INVALID_MESSAGE');\n }\n const peer = {};\n if (message.listenAddrs.length > 0) {\n peer.addresses = message.listenAddrs.map(buf => ({\n isCertified: false,\n multiaddr: multiaddr(buf)\n }));\n }\n if (message.protocols.length > 0) {\n peer.protocols = message.protocols;\n }\n if (message.publicKey != null) {\n peer.publicKey = message.publicKey;\n const peerId = await peerIdFromKeys(message.publicKey);\n if (!peerId.equals(connection.remotePeer)) {\n throw new CodeError('public key did not match remote PeerId', 'ERR_INVALID_PUBLIC_KEY');\n }\n }\n let output;\n // if the peer record has been sent, prefer the addresses in the record as they are signed by the remote peer\n if (message.signedPeerRecord != null) {\n log('received signedPeerRecord from %p', connection.remotePeer);\n let peerRecordEnvelope = message.signedPeerRecord;\n const envelope = await RecordEnvelope.openAndCertify(peerRecordEnvelope, PeerRecord.DOMAIN);\n let peerRecord = PeerRecord.createFromProtobuf(envelope.payload);\n // Verify peerId\n if (!peerRecord.peerId.equals(envelope.peerId)) {\n throw new CodeError('signing key does not match PeerId in the PeerRecord', 'ERR_INVALID_SIGNING_KEY');\n }\n // Make sure remote peer is the one sending the record\n if (!connection.remotePeer.equals(peerRecord.peerId)) {\n throw new CodeError('signing key does not match remote PeerId', 'ERR_INVALID_PEER_RECORD_KEY');\n }\n let existingPeer;\n try {\n existingPeer = await peerStore.get(peerRecord.peerId);\n }\n catch (err) {\n if (err.code !== 'ERR_NOT_FOUND') {\n throw err;\n }\n }\n if (existingPeer != null) {\n // don't lose any existing metadata\n peer.metadata = existingPeer.metadata;\n // if we have previously received a signed record for this peer, compare it to the incoming one\n if (existingPeer.peerRecordEnvelope != null) {\n const storedEnvelope = await RecordEnvelope.createFromProtobuf(existingPeer.peerRecordEnvelope);\n const storedRecord = PeerRecord.createFromProtobuf(storedEnvelope.payload);\n // ensure seq is greater than, or equal to, the last received\n if (storedRecord.seqNumber >= peerRecord.seqNumber) {\n log('sequence number was lower or equal to existing sequence number - stored: %d received: %d', storedRecord.seqNumber, peerRecord.seqNumber);\n peerRecord = storedRecord;\n peerRecordEnvelope = existingPeer.peerRecordEnvelope;\n }\n }\n }\n // store the signed record for next time\n peer.peerRecordEnvelope = peerRecordEnvelope;\n // override the stored addresses with the signed multiaddrs\n peer.addresses = peerRecord.multiaddrs.map(multiaddr => ({\n isCertified: true,\n multiaddr\n }));\n output = {\n seq: peerRecord.seqNumber,\n addresses: peerRecord.multiaddrs\n };\n }\n else {\n log('%p did not send a signed peer record', connection.remotePeer);\n }\n log('patching %p with', connection.remotePeer, peer);\n await peerStore.patch(connection.remotePeer, peer);\n if (message.agentVersion != null || message.protocolVersion != null) {\n const metadata = {};\n if (message.agentVersion != null) {\n metadata.AgentVersion = uint8ArrayFromString(message.agentVersion);\n }\n if (message.protocolVersion != null) {\n metadata.ProtocolVersion = uint8ArrayFromString(message.protocolVersion);\n }\n log('merging %p metadata', connection.remotePeer, metadata);\n await peerStore.merge(connection.remotePeer, {\n metadata\n });\n }\n const result = {\n peerId: connection.remotePeer,\n protocolVersion: message.protocolVersion,\n agentVersion: message.agentVersion,\n publicKey: message.publicKey,\n listenAddrs: message.listenAddrs.map(buf => multiaddr(buf)),\n observedAddr: message.observedAddr == null ? undefined : multiaddr(message.observedAddr),\n protocols: message.protocols,\n signedPeerRecord: output,\n connection\n };\n events.safeDispatchEvent('peer:identify', { detail: result });\n return result;\n}\nexport class AbstractIdentify {\n host;\n protocol;\n started;\n timeout;\n peerId;\n peerStore;\n registrar;\n addressManager;\n maxInboundStreams;\n maxOutboundStreams;\n maxMessageSize;\n maxObservedAddresses;\n events;\n runOnTransientConnection;\n log;\n constructor(components, init) {\n this.protocol = init.protocol;\n this.started = false;\n this.peerId = components.peerId;\n this.peerStore = components.peerStore;\n this.registrar = components.registrar;\n this.addressManager = components.addressManager;\n this.events = components.events;\n this.log = init.log;\n this.timeout = init.timeout ?? defaultValues.timeout;\n this.maxInboundStreams = init.maxInboundStreams ?? defaultValues.maxInboundStreams;\n this.maxOutboundStreams = init.maxOutboundStreams ?? defaultValues.maxOutboundStreams;\n this.maxMessageSize = init.maxMessageSize ?? defaultValues.maxMessageSize;\n this.maxObservedAddresses = init.maxObservedAddresses ?? defaultValues.maxObservedAddresses;\n this.runOnTransientConnection = init.runOnTransientConnection ?? defaultValues.runOnTransientConnection;\n // Store self host metadata\n this.host = {\n protocolVersion: `${init.protocolPrefix ?? defaultValues.protocolPrefix}/${IDENTIFY_PROTOCOL_VERSION}`,\n agentVersion: getAgentVersion(components.nodeInfo, init.agentVersion)\n };\n }\n isStarted() {\n return this.started;\n }\n async start() {\n if (this.started) {\n return;\n }\n await this.peerStore.merge(this.peerId, {\n metadata: {\n AgentVersion: uint8ArrayFromString(this.host.agentVersion),\n ProtocolVersion: uint8ArrayFromString(this.host.protocolVersion)\n }\n });\n await this.registrar.handle(this.protocol, (data) => {\n void this.handleProtocol(data).catch(err => {\n this.log.error(err);\n });\n }, {\n maxInboundStreams: this.maxInboundStreams,\n maxOutboundStreams: this.maxOutboundStreams,\n runOnTransientConnection: this.runOnTransientConnection\n });\n this.started = true;\n }\n async stop() {\n await this.registrar.unhandle(this.protocol);\n this.started = false;\n }\n}\n//# sourceMappingURL=utils.js.map","export const PROTOCOL_VERSION = 'ipfs/0.1.0'; // deprecated\nexport const MULTICODEC_IDENTIFY = '/ipfs/id/1.0.0'; // deprecated\nexport const MULTICODEC_IDENTIFY_PUSH = '/ipfs/id/push/1.0.0'; // deprecated\nexport const IDENTIFY_PROTOCOL_VERSION = '0.1.0';\nexport const MULTICODEC_IDENTIFY_PROTOCOL_NAME = 'id';\nexport const MULTICODEC_IDENTIFY_PUSH_PROTOCOL_NAME = 'id/push';\nexport const MULTICODEC_IDENTIFY_PROTOCOL_VERSION = '1.0.0';\nexport const MULTICODEC_IDENTIFY_PUSH_PROTOCOL_VERSION = '1.0.0';\n// https://github.com/libp2p/go-libp2p/blob/8d2e54e1637041d5cf4fac1e531287560bd1f4ac/p2p/protocol/identify/id.go#L52\nexport const MAX_IDENTIFY_MESSAGE_SIZE = 1024 * 8;\n// https://github.com/libp2p/go-libp2p/blob/0385ec924bad172f74a74db09939e97c079b1420/p2p/protocol/identify/id.go#L47C7-L47C25\nexport const MAX_PUSH_CONCURRENCY = 32;\n//# sourceMappingURL=consts.js.map","/* eslint-disable complexity */\nimport { CodeError, serviceCapabilities, setMaxListeners } from '@libp2p/interface';\nimport { peerIdFromKeys } from '@libp2p/peer-id';\nimport { RecordEnvelope, PeerRecord } from '@libp2p/peer-record';\nimport { protocols } from '@multiformats/multiaddr';\nimport { IP_OR_DOMAIN } from '@multiformats/multiaddr-matcher';\nimport { pbStream } from 'it-protobuf-stream';\nimport { MULTICODEC_IDENTIFY_PROTOCOL_NAME, MULTICODEC_IDENTIFY_PROTOCOL_VERSION } from './consts.js';\nimport { Identify as IdentifyMessage } from './pb/message.js';\nimport { AbstractIdentify, consumeIdentifyMessage, defaultValues, getCleanMultiaddr } from './utils.js';\nexport class Identify extends AbstractIdentify {\n constructor(components, init = {}) {\n super(components, {\n ...init,\n protocol: `/${init.protocolPrefix ?? defaultValues.protocolPrefix}/${MULTICODEC_IDENTIFY_PROTOCOL_NAME}/${MULTICODEC_IDENTIFY_PROTOCOL_VERSION}`,\n log: components.logger.forComponent('libp2p:identify')\n });\n if (init.runOnConnectionOpen ?? defaultValues.runOnConnectionOpen) {\n // When a new connection happens, trigger identify\n components.events.addEventListener('connection:open', (evt) => {\n const connection = evt.detail;\n this.identify(connection).catch(err => { this.log.error('error during identify trigged by connection:open', err); });\n });\n }\n }\n [serviceCapabilities] = [\n '@libp2p/identify'\n ];\n async _identify(connection, options = {}) {\n let stream;\n if (options.signal == null) {\n const signal = AbortSignal.timeout(this.timeout);\n setMaxListeners(Infinity, signal);\n options = {\n ...options,\n signal\n };\n }\n try {\n stream = await connection.newStream(this.protocol, {\n ...options,\n runOnTransientConnection: this.runOnTransientConnection\n });\n const pb = pbStream(stream, {\n maxDataLength: this.maxMessageSize\n }).pb(IdentifyMessage);\n const message = await pb.read(options);\n await stream.close(options);\n return message;\n }\n catch (err) {\n this.log.error('error while reading identify message', err);\n stream?.abort(err);\n throw err;\n }\n }\n async identify(connection, options = {}) {\n const message = await this._identify(connection, options);\n const { publicKey, protocols, observedAddr } = message;\n if (publicKey == null) {\n throw new CodeError('public key was missing from identify message', 'ERR_MISSING_PUBLIC_KEY');\n }\n const id = await peerIdFromKeys(publicKey);\n if (!connection.remotePeer.equals(id)) {\n throw new CodeError('identified peer does not match the expected peer', 'ERR_INVALID_PEER');\n }\n if (this.peerId.equals(id)) {\n throw new CodeError('identified peer is our own peer id?', 'ERR_INVALID_PEER');\n }\n // Get the observedAddr if there is one\n const cleanObservedAddr = getCleanMultiaddr(observedAddr);\n this.log('identify completed for peer %p and protocols %o', id, protocols);\n this.log('our observed address is %a', cleanObservedAddr);\n if (cleanObservedAddr != null &&\n this.addressManager.getObservedAddrs().length < (this.maxObservedAddresses ?? Infinity)) {\n this.log('storing our observed address %a', cleanObservedAddr);\n this.addressManager.addObservedAddr(cleanObservedAddr);\n }\n return consumeIdentifyMessage(this.peerStore, this.events, this.log, connection, message);\n }\n /**\n * Sends the `Identify` response with the Signed Peer Record\n * to the requesting peer over the given `connection`\n */\n async handleProtocol(data) {\n const { connection, stream } = data;\n const signal = AbortSignal.timeout(this.timeout);\n setMaxListeners(Infinity, signal);\n try {\n const publicKey = this.peerId.publicKey ?? new Uint8Array(0);\n const peerData = await this.peerStore.get(this.peerId);\n const multiaddrs = this.addressManager.getAddresses().map(ma => ma.decapsulateCode(protocols('p2p').code));\n let signedPeerRecord = peerData.peerRecordEnvelope;\n if (multiaddrs.length > 0 && signedPeerRecord == null) {\n const peerRecord = new PeerRecord({\n peerId: this.peerId,\n multiaddrs\n });\n const envelope = await RecordEnvelope.seal(peerRecord, this.peerId);\n signedPeerRecord = envelope.marshal().subarray();\n }\n let observedAddr = connection.remoteAddr.bytes;\n if (!IP_OR_DOMAIN.matches(connection.remoteAddr)) {\n observedAddr = undefined;\n }\n const pb = pbStream(stream).pb(IdentifyMessage);\n await pb.write({\n protocolVersion: this.host.protocolVersion,\n agentVersion: this.host.agentVersion,\n publicKey,\n listenAddrs: multiaddrs.map(addr => addr.bytes),\n signedPeerRecord,\n observedAddr,\n protocols: peerData.protocols\n }, {\n signal\n });\n await stream.close({\n signal\n });\n }\n catch (err) {\n this.log.error('could not respond to identify request', err);\n stream.abort(err);\n }\n }\n}\n//# sourceMappingURL=identify.js.map","/**\n * @packageDocumentation\n *\n * Use the `identify` function to add support for the [Identify protocol](https://github.com/libp2p/specs/blob/master/identify/README.md) to libp2p.\n *\n * This protocol allows network peers to discover the multiaddrs the current node listens on, and the protocols it supports.\n *\n * A second function, `identifyPush` is also exported to add support for [identify/push](https://github.com/libp2p/specs/blob/master/identify/README.md#identifypush).\n *\n * This protocol will send updates to all connected peers when the multiaddrs or protocols of the current node change.\n *\n * > [!TIP]\n * > For maximum network compatibility you should configure both protocols\n *\n * @example Enabling identify\n *\n * ```typescript\n * import { createLibp2p } from 'libp2p'\n * import { identify } from '@libp2p/identify'\n *\n * const node = await createLibp2p({\n * // ...other options\n * services: {\n * identify: identify()\n * }\n * })\n * ```\n *\n * @example Enabling identify push\n *\n * ```typescript\n * import { createLibp2p } from 'libp2p'\n * import { identifyPush } from '@libp2p/identify'\n *\n * const node = await createLibp2p({\n * // ...other options\n * services: {\n * identifyPush: identifyPush()\n * }\n * })\n * ```\n */\nimport { IdentifyPush as IdentifyPushClass } from './identify-push.js';\nimport { Identify as IdentifyClass } from './identify.js';\nexport function identify(init = {}) {\n return (components) => new IdentifyClass(components, init);\n}\nexport function identifyPush(init = {}) {\n return (components) => new IdentifyPushClass(components, init);\n}\n//# sourceMappingURL=index.js.map","import { getIterator } from 'get-iterator';\nimport { isPromise } from './is-promise.js';\nexport function closeSource(source, log) {\n const res = getIterator(source).return?.();\n if (isPromise(res)) {\n res.catch(err => {\n log.error('could not cause iterator to return', err);\n });\n }\n}\n//# sourceMappingURL=close-source.js.map","export function getIterator(obj) {\n if (obj != null) {\n if (typeof obj[Symbol.iterator] === 'function') {\n return obj[Symbol.iterator]();\n }\n if (typeof obj[Symbol.asyncIterator] === 'function') {\n return obj[Symbol.asyncIterator]();\n }\n if (typeof obj.next === 'function') {\n return obj; // probably an iterator\n }\n }\n throw new Error('argument is not an iterator or iterable');\n}\n//# sourceMappingURL=index.js.map","export function isPromise(thing) {\n if (thing == null) {\n return false;\n }\n return typeof thing.then === 'function' &&\n typeof thing.catch === 'function' &&\n typeof thing.finally === 'function';\n}\n//# sourceMappingURL=is-promise.js.map","// From https://github.com/sindresorhus/random-int/blob/c37741b56f76b9160b0b63dae4e9c64875128146/index.js#L13-L15\nconst randomInteger = (minimum, maximum) => Math.floor((Math.random() * (maximum - minimum + 1)) + minimum);\n\nconst createAbortError = () => {\n\tconst error = new Error('Delay aborted');\n\terror.name = 'AbortError';\n\treturn error;\n};\n\nconst clearMethods = new WeakMap();\n\nexport function createDelay({clearTimeout: defaultClear, setTimeout: defaultSet} = {}) {\n\t// We cannot use `async` here as we need the promise identity.\n\treturn (milliseconds, {value, signal} = {}) => {\n\t\t// TODO: Use `signal?.throwIfAborted()` when targeting Node.js 18.\n\t\tif (signal?.aborted) {\n\t\t\treturn Promise.reject(createAbortError());\n\t\t}\n\n\t\tlet timeoutId;\n\t\tlet settle;\n\t\tlet rejectFunction;\n\t\tconst clear = defaultClear ?? clearTimeout;\n\n\t\tconst signalListener = () => {\n\t\t\tclear(timeoutId);\n\t\t\trejectFunction(createAbortError());\n\t\t};\n\n\t\tconst cleanup = () => {\n\t\t\tif (signal) {\n\t\t\t\tsignal.removeEventListener('abort', signalListener);\n\t\t\t}\n\t\t};\n\n\t\tconst delayPromise = new Promise((resolve, reject) => {\n\t\t\tsettle = () => {\n\t\t\t\tcleanup();\n\t\t\t\tresolve(value);\n\t\t\t};\n\n\t\t\trejectFunction = reject;\n\t\t\ttimeoutId = (defaultSet ?? setTimeout)(settle, milliseconds);\n\t\t});\n\n\t\tif (signal) {\n\t\t\tsignal.addEventListener('abort', signalListener, {once: true});\n\t\t}\n\n\t\tclearMethods.set(delayPromise, () => {\n\t\t\tclear(timeoutId);\n\t\t\ttimeoutId = null;\n\t\t\tsettle();\n\t\t});\n\n\t\treturn delayPromise;\n\t};\n}\n\nconst delay = createDelay();\n\nexport default delay;\n\nexport async function rangeDelay(minimum, maximum, options = {}) {\n\treturn delay(randomInteger(minimum, maximum), options);\n}\n\nexport function clearDelay(promise) {\n\tclearMethods.get(promise)?.();\n}\n","import { CodeError } from '@libp2p/interface';\nimport delay from 'delay';\nexport class RateLimiter {\n memoryStorage;\n points;\n duration;\n blockDuration;\n execEvenly;\n execEvenlyMinDelayMs;\n keyPrefix;\n constructor(opts = {}) {\n this.points = opts.points ?? 4;\n this.duration = opts.duration ?? 1;\n this.blockDuration = opts.blockDuration ?? 0;\n this.execEvenly = opts.execEvenly ?? false;\n this.execEvenlyMinDelayMs = opts.execEvenlyMinDelayMs ?? (this.duration * 1000 / this.points);\n this.keyPrefix = opts.keyPrefix ?? 'rlflx';\n this.memoryStorage = new MemoryStorage();\n }\n async consume(key, pointsToConsume = 1, options = {}) {\n const rlKey = this.getKey(key);\n const secDuration = this._getKeySecDuration(options);\n let res = this.memoryStorage.incrby(rlKey, pointsToConsume, secDuration);\n res.remainingPoints = Math.max(this.points - res.consumedPoints, 0);\n if (res.consumedPoints > this.points) {\n // Block only first time when consumed more than points\n if (this.blockDuration > 0 && res.consumedPoints <= (this.points + pointsToConsume)) {\n // Block key\n res = this.memoryStorage.set(rlKey, res.consumedPoints, this.blockDuration);\n }\n throw new CodeError('Rate limit exceeded', 'ERR_RATE_LIMIT_EXCEEDED', res);\n }\n else if (this.execEvenly && res.msBeforeNext > 0 && !res.isFirstInDuration) {\n // Execute evenly\n let delayMs = Math.ceil(res.msBeforeNext / (res.remainingPoints + 2));\n if (delayMs < this.execEvenlyMinDelayMs) {\n delayMs = res.consumedPoints * this.execEvenlyMinDelayMs;\n }\n await delay(delayMs);\n }\n return res;\n }\n penalty(key, points = 1, options = {}) {\n const rlKey = this.getKey(key);\n const secDuration = this._getKeySecDuration(options);\n const res = this.memoryStorage.incrby(rlKey, points, secDuration);\n res.remainingPoints = Math.max(this.points - res.consumedPoints, 0);\n return res;\n }\n reward(key, points = 1, options = {}) {\n const rlKey = this.getKey(key);\n const secDuration = this._getKeySecDuration(options);\n const res = this.memoryStorage.incrby(rlKey, -points, secDuration);\n res.remainingPoints = Math.max(this.points - res.consumedPoints, 0);\n return res;\n }\n /**\n * Block any key for secDuration seconds\n *\n * @param key\n * @param secDuration\n */\n block(key, secDuration) {\n const msDuration = secDuration * 1000;\n const initPoints = this.points + 1;\n this.memoryStorage.set(this.getKey(key), initPoints, secDuration);\n return {\n remainingPoints: 0,\n msBeforeNext: msDuration === 0 ? -1 : msDuration,\n consumedPoints: initPoints,\n isFirstInDuration: false\n };\n }\n set(key, points, secDuration = 0) {\n const msDuration = (secDuration >= 0 ? secDuration : this.duration) * 1000;\n this.memoryStorage.set(this.getKey(key), points, secDuration);\n return {\n remainingPoints: 0,\n msBeforeNext: msDuration === 0 ? -1 : msDuration,\n consumedPoints: points,\n isFirstInDuration: false\n };\n }\n get(key) {\n const res = this.memoryStorage.get(this.getKey(key));\n if (res != null) {\n res.remainingPoints = Math.max(this.points - res.consumedPoints, 0);\n }\n return res;\n }\n delete(key) {\n this.memoryStorage.delete(this.getKey(key));\n }\n _getKeySecDuration(options) {\n if (options?.customDuration != null && options.customDuration >= 0) {\n return options.customDuration;\n }\n return this.duration;\n }\n getKey(key) {\n return this.keyPrefix.length > 0 ? `${this.keyPrefix}:${key}` : key;\n }\n parseKey(rlKey) {\n return rlKey.substring(this.keyPrefix.length);\n }\n}\nclass MemoryStorage {\n storage;\n constructor() {\n this.storage = new Map();\n }\n incrby(key, value, durationSec) {\n const existing = this.storage.get(key);\n if (existing != null) {\n const msBeforeExpires = existing.expiresAt != null\n ? existing.expiresAt.getTime() - new Date().getTime()\n : -1;\n if (existing.expiresAt == null || msBeforeExpires > 0) {\n // Change value\n existing.value += value;\n return {\n remainingPoints: 0,\n msBeforeNext: msBeforeExpires,\n consumedPoints: existing.value,\n isFirstInDuration: false\n };\n }\n return this.set(key, value, durationSec);\n }\n return this.set(key, value, durationSec);\n }\n set(key, value, durationSec) {\n const durationMs = durationSec * 1000;\n const existing = this.storage.get(key);\n if (existing != null) {\n clearTimeout(existing.timeoutId);\n }\n const record = {\n value,\n expiresAt: durationMs > 0 ? new Date(Date.now() + durationMs) : undefined\n };\n this.storage.set(key, record);\n if (durationMs > 0) {\n record.timeoutId = setTimeout(() => {\n this.storage.delete(key);\n }, durationMs);\n if (record.timeoutId.unref != null) {\n record.timeoutId.unref();\n }\n }\n return {\n remainingPoints: 0,\n msBeforeNext: durationMs === 0 ? -1 : durationMs,\n consumedPoints: record.value,\n isFirstInDuration: true\n };\n }\n get(key) {\n const existing = this.storage.get(key);\n if (existing != null) {\n const msBeforeExpires = existing.expiresAt != null\n ? existing.expiresAt.getTime() - new Date().getTime()\n : -1;\n return {\n remainingPoints: 0,\n msBeforeNext: msBeforeExpires,\n consumedPoints: existing.value,\n isFirstInDuration: false\n };\n }\n }\n delete(key) {\n const record = this.storage.get(key);\n if (record != null) {\n if (record.timeoutId != null) {\n clearTimeout(record.timeoutId);\n }\n this.storage.delete(key);\n return true;\n }\n return false;\n }\n}\n//# sourceMappingURL=rate-limiter.js.map","export var MessageTypes;\n(function (MessageTypes) {\n MessageTypes[MessageTypes[\"NEW_STREAM\"] = 0] = \"NEW_STREAM\";\n MessageTypes[MessageTypes[\"MESSAGE_RECEIVER\"] = 1] = \"MESSAGE_RECEIVER\";\n MessageTypes[MessageTypes[\"MESSAGE_INITIATOR\"] = 2] = \"MESSAGE_INITIATOR\";\n MessageTypes[MessageTypes[\"CLOSE_RECEIVER\"] = 3] = \"CLOSE_RECEIVER\";\n MessageTypes[MessageTypes[\"CLOSE_INITIATOR\"] = 4] = \"CLOSE_INITIATOR\";\n MessageTypes[MessageTypes[\"RESET_RECEIVER\"] = 5] = \"RESET_RECEIVER\";\n MessageTypes[MessageTypes[\"RESET_INITIATOR\"] = 6] = \"RESET_INITIATOR\";\n})(MessageTypes || (MessageTypes = {}));\nexport const MessageTypeNames = Object.freeze({\n 0: 'NEW_STREAM',\n 1: 'MESSAGE_RECEIVER',\n 2: 'MESSAGE_INITIATOR',\n 3: 'CLOSE_RECEIVER',\n 4: 'CLOSE_INITIATOR',\n 5: 'RESET_RECEIVER',\n 6: 'RESET_INITIATOR'\n});\nexport const InitiatorMessageTypes = Object.freeze({\n NEW_STREAM: MessageTypes.NEW_STREAM,\n MESSAGE: MessageTypes.MESSAGE_INITIATOR,\n CLOSE: MessageTypes.CLOSE_INITIATOR,\n RESET: MessageTypes.RESET_INITIATOR\n});\nexport const ReceiverMessageTypes = Object.freeze({\n MESSAGE: MessageTypes.MESSAGE_RECEIVER,\n CLOSE: MessageTypes.CLOSE_RECEIVER,\n RESET: MessageTypes.RESET_RECEIVER\n});\n//# sourceMappingURL=message-types.js.map","import { Uint8ArrayList } from 'uint8arraylist';\nimport { MessageTypeNames, MessageTypes } from './message-types.js';\nexport const MAX_MSG_SIZE = 1 << 20; // 1MB\nexport const MAX_MSG_QUEUE_SIZE = 4 << 20; // 4MB\nexport class Decoder {\n _buffer;\n _headerInfo;\n _maxMessageSize;\n _maxUnprocessedMessageQueueSize;\n constructor(maxMessageSize = MAX_MSG_SIZE, maxUnprocessedMessageQueueSize = MAX_MSG_QUEUE_SIZE) {\n this._buffer = new Uint8ArrayList();\n this._headerInfo = null;\n this._maxMessageSize = maxMessageSize;\n this._maxUnprocessedMessageQueueSize = maxUnprocessedMessageQueueSize;\n }\n write(chunk) {\n if (chunk == null || chunk.length === 0) {\n return [];\n }\n this._buffer.append(chunk);\n if (this._buffer.byteLength > this._maxUnprocessedMessageQueueSize) {\n throw Object.assign(new Error('unprocessed message queue size too large!'), { code: 'ERR_MSG_QUEUE_TOO_BIG' });\n }\n const msgs = [];\n while (this._buffer.length !== 0) {\n if (this._headerInfo == null) {\n try {\n this._headerInfo = this._decodeHeader(this._buffer);\n }\n catch (err) {\n if (err.code === 'ERR_MSG_TOO_BIG') {\n throw err;\n }\n break; // We haven't received enough data yet\n }\n }\n const { id, type, length, offset } = this._headerInfo;\n const bufferedDataLength = this._buffer.length - offset;\n if (bufferedDataLength < length) {\n break; // not enough data yet\n }\n const msg = {\n id,\n type\n };\n if (type === MessageTypes.NEW_STREAM || type === MessageTypes.MESSAGE_INITIATOR || type === MessageTypes.MESSAGE_RECEIVER) {\n msg.data = this._buffer.sublist(offset, offset + length);\n }\n msgs.push(msg);\n this._buffer.consume(offset + length);\n this._headerInfo = null;\n }\n return msgs;\n }\n /**\n * Attempts to decode the message header from the buffer\n */\n _decodeHeader(data) {\n const { value: h, offset } = readVarInt(data);\n const { value: length, offset: end } = readVarInt(data, offset);\n const type = h & 7;\n // @ts-expect-error h is a number not a CODE\n if (MessageTypeNames[type] == null) {\n throw new Error(`Invalid type received: ${type}`);\n }\n // test message type varint + data length\n if (length > this._maxMessageSize) {\n throw Object.assign(new Error('message size too large!'), { code: 'ERR_MSG_TOO_BIG' });\n }\n // @ts-expect-error h is a number not a CODE\n return { id: h >> 3, type, offset: offset + end, length };\n }\n}\nconst MSB = 0x80;\nconst REST = 0x7F;\nfunction readVarInt(buf, offset = 0) {\n let res = 0;\n let shift = 0;\n let counter = offset;\n let b;\n const l = buf.length;\n do {\n if (counter >= l || shift > 49) {\n offset = 0;\n throw new RangeError('Could not decode varint');\n }\n b = buf.get(counter++);\n res += shift < 28\n ? (b & REST) << shift\n : (b & REST) * Math.pow(2, shift);\n shift += 7;\n } while (b >= MSB);\n offset = counter - offset;\n return {\n value: res,\n offset\n };\n}\n//# sourceMappingURL=decode.js.map","import * as varint from 'uint8-varint';\nimport { Uint8ArrayList } from 'uint8arraylist';\nimport { allocUnsafe } from 'uint8arrays/alloc';\nimport { MessageTypes } from './message-types.js';\nconst POOL_SIZE = 10 * 1024;\nclass Encoder {\n _pool;\n _poolOffset;\n constructor() {\n this._pool = allocUnsafe(POOL_SIZE);\n this._poolOffset = 0;\n }\n /**\n * Encodes the given message and adds it to the passed list\n */\n write(msg, list) {\n const pool = this._pool;\n let offset = this._poolOffset;\n varint.encode(msg.id << 3 | msg.type, pool, offset);\n offset += varint.encodingLength(msg.id << 3 | msg.type);\n if ((msg.type === MessageTypes.NEW_STREAM || msg.type === MessageTypes.MESSAGE_INITIATOR || msg.type === MessageTypes.MESSAGE_RECEIVER) && msg.data != null) {\n varint.encode(msg.data.length, pool, offset);\n offset += varint.encodingLength(msg.data.length);\n }\n else {\n varint.encode(0, pool, offset);\n offset += varint.encodingLength(0);\n }\n const header = pool.subarray(this._poolOffset, offset);\n if (POOL_SIZE - offset < 100) {\n this._pool = allocUnsafe(POOL_SIZE);\n this._poolOffset = 0;\n }\n else {\n this._poolOffset = offset;\n }\n list.append(header);\n if ((msg.type === MessageTypes.NEW_STREAM || msg.type === MessageTypes.MESSAGE_INITIATOR || msg.type === MessageTypes.MESSAGE_RECEIVER) && msg.data != null) {\n list.append(msg.data);\n }\n }\n}\nconst encoder = new Encoder();\n/**\n * Encode and yield one or more messages\n */\nexport async function* encode(source) {\n for await (const message of source) {\n const list = new Uint8ArrayList();\n encoder.write(message, list);\n yield list;\n }\n}\n//# sourceMappingURL=encode.js.map","import { CodeError } from '@libp2p/interface';\nimport { pushable } from 'it-pushable';\nimport defer, {} from 'p-defer';\nimport pDefer from 'p-defer';\nimport { raceSignal } from 'race-signal';\nimport { Uint8ArrayList } from 'uint8arraylist';\nimport { closeSource } from './close-source.js';\nconst ERR_STREAM_RESET = 'ERR_STREAM_RESET';\nconst ERR_SINK_INVALID_STATE = 'ERR_SINK_INVALID_STATE';\nconst DEFAULT_SEND_CLOSE_WRITE_TIMEOUT = 5000;\nfunction isPromise(thing) {\n if (thing == null) {\n return false;\n }\n return typeof thing.then === 'function' &&\n typeof thing.catch === 'function' &&\n typeof thing.finally === 'function';\n}\nexport class AbstractStream {\n id;\n direction;\n timeline;\n protocol;\n metadata;\n source;\n status;\n readStatus;\n writeStatus;\n log;\n sinkController;\n sinkEnd;\n closed;\n endErr;\n streamSource;\n onEnd;\n onCloseRead;\n onCloseWrite;\n onReset;\n onAbort;\n sendCloseWriteTimeout;\n sendingData;\n constructor(init) {\n this.sinkController = new AbortController();\n this.sinkEnd = defer();\n this.closed = defer();\n this.log = init.log;\n // stream status\n this.status = 'open';\n this.readStatus = 'ready';\n this.writeStatus = 'ready';\n this.id = init.id;\n this.metadata = init.metadata ?? {};\n this.direction = init.direction;\n this.timeline = {\n open: Date.now()\n };\n this.sendCloseWriteTimeout = init.sendCloseWriteTimeout ?? DEFAULT_SEND_CLOSE_WRITE_TIMEOUT;\n this.onEnd = init.onEnd;\n this.onCloseRead = init?.onCloseRead;\n this.onCloseWrite = init?.onCloseWrite;\n this.onReset = init?.onReset;\n this.onAbort = init?.onAbort;\n this.source = this.streamSource = pushable({\n onEnd: (err) => {\n if (err != null) {\n this.log.trace('source ended with error', err);\n }\n else {\n this.log.trace('source ended');\n }\n this.onSourceEnd(err);\n }\n });\n // necessary because the libp2p upgrader wraps the sink function\n this.sink = this.sink.bind(this);\n }\n async sink(source) {\n if (this.writeStatus !== 'ready') {\n throw new CodeError(`writable end state is \"${this.writeStatus}\" not \"ready\"`, ERR_SINK_INVALID_STATE);\n }\n try {\n this.writeStatus = 'writing';\n const options = {\n signal: this.sinkController.signal\n };\n if (this.direction === 'outbound') { // If initiator, open a new stream\n const res = this.sendNewStream(options);\n if (isPromise(res)) {\n await res;\n }\n }\n const abortListener = () => {\n closeSource(source, this.log);\n };\n try {\n this.sinkController.signal.addEventListener('abort', abortListener);\n this.log.trace('sink reading from source');\n for await (let data of source) {\n data = data instanceof Uint8Array ? new Uint8ArrayList(data) : data;\n const res = this.sendData(data, options);\n if (isPromise(res)) {\n this.sendingData = pDefer();\n await res;\n this.sendingData.resolve();\n this.sendingData = undefined;\n }\n }\n }\n finally {\n this.sinkController.signal.removeEventListener('abort', abortListener);\n }\n this.log.trace('sink finished reading from source, write status is \"%s\"', this.writeStatus);\n if (this.writeStatus === 'writing') {\n this.writeStatus = 'closing';\n this.log.trace('send close write to remote');\n await this.sendCloseWrite({\n signal: AbortSignal.timeout(this.sendCloseWriteTimeout)\n });\n this.writeStatus = 'closed';\n }\n this.onSinkEnd();\n }\n catch (err) {\n this.log.trace('sink ended with error, calling abort with error', err);\n this.abort(err);\n throw err;\n }\n finally {\n this.log.trace('resolve sink end');\n this.sinkEnd.resolve();\n }\n }\n onSourceEnd(err) {\n if (this.timeline.closeRead != null) {\n return;\n }\n this.timeline.closeRead = Date.now();\n this.readStatus = 'closed';\n if (err != null && this.endErr == null) {\n this.endErr = err;\n }\n this.onCloseRead?.();\n if (this.timeline.closeWrite != null) {\n this.log.trace('source and sink ended');\n this.timeline.close = Date.now();\n if (this.status !== 'aborted' && this.status !== 'reset') {\n this.status = 'closed';\n }\n if (this.onEnd != null) {\n this.onEnd(this.endErr);\n }\n this.closed.resolve();\n }\n else {\n this.log.trace('source ended, waiting for sink to end');\n }\n }\n onSinkEnd(err) {\n if (this.timeline.closeWrite != null) {\n return;\n }\n this.timeline.closeWrite = Date.now();\n this.writeStatus = 'closed';\n if (err != null && this.endErr == null) {\n this.endErr = err;\n }\n this.onCloseWrite?.();\n if (this.timeline.closeRead != null) {\n this.log.trace('sink and source ended');\n this.timeline.close = Date.now();\n if (this.status !== 'aborted' && this.status !== 'reset') {\n this.status = 'closed';\n }\n if (this.onEnd != null) {\n this.onEnd(this.endErr);\n }\n this.closed.resolve();\n }\n else {\n this.log.trace('sink ended, waiting for source to end');\n }\n }\n // Close for both Reading and Writing\n async close(options) {\n this.log.trace('closing gracefully');\n this.status = 'closing';\n // wait for read and write ends to close\n await raceSignal(Promise.all([\n this.closeWrite(options),\n this.closeRead(options),\n this.closed.promise\n ]), options?.signal);\n this.status = 'closed';\n this.log.trace('closed gracefully');\n }\n async closeRead(options = {}) {\n if (this.readStatus === 'closing' || this.readStatus === 'closed') {\n return;\n }\n this.log.trace('closing readable end of stream with starting read status \"%s\"', this.readStatus);\n const readStatus = this.readStatus;\n this.readStatus = 'closing';\n if (this.status !== 'reset' && this.status !== 'aborted' && this.timeline.closeRead == null) {\n this.log.trace('send close read to remote');\n await this.sendCloseRead(options);\n }\n if (readStatus === 'ready') {\n this.log.trace('ending internal source queue with %d queued bytes', this.streamSource.readableLength);\n this.streamSource.end();\n }\n this.log.trace('closed readable end of stream');\n }\n async closeWrite(options = {}) {\n if (this.writeStatus === 'closing' || this.writeStatus === 'closed') {\n return;\n }\n this.log.trace('closing writable end of stream with starting write status \"%s\"', this.writeStatus);\n if (this.writeStatus === 'ready') {\n this.log.trace('sink was never sunk, sink an empty array');\n await raceSignal(this.sink([]), options.signal);\n }\n if (this.writeStatus === 'writing') {\n // try to let sending outgoing data succeed\n if (this.sendingData != null) {\n await raceSignal(this.sendingData.promise, options.signal);\n }\n // stop reading from the source passed to `.sink`\n this.log.trace('aborting source passed to .sink');\n this.sinkController.abort();\n await raceSignal(this.sinkEnd.promise, options.signal);\n }\n this.writeStatus = 'closed';\n this.log.trace('closed writable end of stream');\n }\n /**\n * Close immediately for reading and writing and send a reset message (local\n * error)\n */\n abort(err) {\n if (this.status === 'closed' || this.status === 'aborted' || this.status === 'reset') {\n return;\n }\n this.log('abort with error', err);\n // try to send a reset message\n this.log('try to send reset to remote');\n const res = this.sendReset();\n if (isPromise(res)) {\n res.catch((err) => {\n this.log.error('error sending reset message', err);\n });\n }\n this.status = 'aborted';\n this.timeline.abort = Date.now();\n this._closeSinkAndSource(err);\n this.onAbort?.(err);\n }\n /**\n * Receive a reset message - close immediately for reading and writing (remote\n * error)\n */\n reset() {\n if (this.status === 'closed' || this.status === 'aborted' || this.status === 'reset') {\n return;\n }\n const err = new CodeError('stream reset', ERR_STREAM_RESET);\n this.status = 'reset';\n this.timeline.reset = Date.now();\n this._closeSinkAndSource(err);\n this.onReset?.();\n }\n _closeSinkAndSource(err) {\n this._closeSink(err);\n this._closeSource(err);\n }\n _closeSink(err) {\n // if the sink function is running, cause it to end\n if (this.writeStatus === 'writing') {\n this.log.trace('end sink source');\n this.sinkController.abort();\n }\n this.onSinkEnd(err);\n }\n _closeSource(err) {\n // if the source is not ending, end it\n if (this.readStatus !== 'closing' && this.readStatus !== 'closed') {\n this.log.trace('ending source with %d bytes to be read by consumer', this.streamSource.readableLength);\n this.readStatus = 'closing';\n this.streamSource.end(err);\n }\n }\n /**\n * The remote closed for writing so we should expect to receive no more\n * messages\n */\n remoteCloseWrite() {\n if (this.readStatus === 'closing' || this.readStatus === 'closed') {\n this.log('received remote close write but local source is already closed');\n return;\n }\n this.log.trace('remote close write');\n this._closeSource();\n }\n /**\n * The remote closed for reading so we should not send any more\n * messages\n */\n remoteCloseRead() {\n if (this.writeStatus === 'closing' || this.writeStatus === 'closed') {\n this.log('received remote close read but local sink is already closed');\n return;\n }\n this.log.trace('remote close read');\n this._closeSink();\n }\n /**\n * The underlying muxer has closed, no more messages can be sent or will\n * be received, close immediately to free up resources\n */\n destroy() {\n if (this.status === 'closed' || this.status === 'aborted' || this.status === 'reset') {\n this.log('received destroy but we are already closed');\n return;\n }\n this.log.trace('stream destroyed');\n this._closeSinkAndSource();\n }\n /**\n * When an extending class reads data from it's implementation-specific source,\n * call this method to allow the stream consumer to read the data.\n */\n sourcePush(data) {\n this.streamSource.push(data);\n }\n /**\n * Returns the amount of unread data - can be used to prevent large amounts of\n * data building up when the stream consumer is too slow.\n */\n sourceReadableLength() {\n return this.streamSource.readableLength;\n }\n}\n//# sourceMappingURL=abstract-stream.js.map","import { AbstractStream } from '@libp2p/utils/abstract-stream';\nimport { Uint8ArrayList } from 'uint8arraylist';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport { MAX_MSG_SIZE } from './decode.js';\nimport { InitiatorMessageTypes, ReceiverMessageTypes } from './message-types.js';\nexport class MplexStream extends AbstractStream {\n name;\n streamId;\n send;\n types;\n maxDataSize;\n constructor(init) {\n super(init);\n this.types = init.direction === 'outbound' ? InitiatorMessageTypes : ReceiverMessageTypes;\n this.send = init.send;\n this.name = init.name;\n this.streamId = init.streamId;\n this.maxDataSize = init.maxDataSize;\n }\n async sendNewStream() {\n await this.send({ id: this.streamId, type: InitiatorMessageTypes.NEW_STREAM, data: new Uint8ArrayList(uint8ArrayFromString(this.name)) });\n }\n async sendData(data) {\n data = data.sublist();\n while (data.byteLength > 0) {\n const toSend = Math.min(data.byteLength, this.maxDataSize);\n await this.send({\n id: this.streamId,\n type: this.types.MESSAGE,\n data: data.sublist(0, toSend)\n });\n data.consume(toSend);\n }\n }\n async sendReset() {\n await this.send({ id: this.streamId, type: this.types.RESET });\n }\n async sendCloseWrite() {\n await this.send({ id: this.streamId, type: this.types.CLOSE });\n }\n async sendCloseRead() {\n // mplex does not support close read, only close write\n }\n}\nexport function createStream(options) {\n const { id, name, send, onEnd, type = 'initiator', maxMsgSize = MAX_MSG_SIZE } = options;\n return new MplexStream({\n id: type === 'initiator' ? (`i${id}`) : `r${id}`,\n streamId: id,\n name: `${name ?? id}`,\n direction: type === 'initiator' ? 'outbound' : 'inbound',\n maxDataSize: maxMsgSize,\n onEnd,\n send,\n log: options.logger.forComponent(`libp2p:mplex:stream:${type}:${id}`)\n });\n}\n//# sourceMappingURL=stream.js.map","import { CodeError } from '@libp2p/interface';\nimport { closeSource } from '@libp2p/utils/close-source';\nimport { RateLimiter } from '@libp2p/utils/rate-limiter';\nimport { pipe } from 'it-pipe';\nimport { pushable } from 'it-pushable';\nimport { toString as uint8ArrayToString } from 'uint8arrays';\nimport { Decoder } from './decode.js';\nimport { encode } from './encode.js';\nimport { MessageTypes, MessageTypeNames } from './message-types.js';\nimport { createStream } from './stream.js';\nconst MAX_STREAMS_INBOUND_STREAMS_PER_CONNECTION = 1024;\nconst MAX_STREAMS_OUTBOUND_STREAMS_PER_CONNECTION = 1024;\nconst MAX_STREAM_BUFFER_SIZE = 1024 * 1024 * 4; // 4MB\nconst DISCONNECT_THRESHOLD = 5;\nconst CLOSE_TIMEOUT = 500;\nfunction printMessage(msg) {\n const output = {\n ...msg,\n type: `${MessageTypeNames[msg.type]} (${msg.type})`\n };\n if (msg.type === MessageTypes.NEW_STREAM) {\n output.data = uint8ArrayToString(msg.data instanceof Uint8Array ? msg.data : msg.data.subarray());\n }\n if (msg.type === MessageTypes.MESSAGE_INITIATOR || msg.type === MessageTypes.MESSAGE_RECEIVER) {\n output.data = uint8ArrayToString(msg.data instanceof Uint8Array ? msg.data : msg.data.subarray(), 'base16');\n }\n return output;\n}\nexport class MplexStreamMuxer {\n protocol = '/mplex/6.7.0';\n sink;\n source;\n log;\n _streamId;\n _streams;\n _init;\n _source;\n closeController;\n rateLimiter;\n closeTimeout;\n logger;\n constructor(components, init) {\n init = init ?? {};\n this.log = components.logger.forComponent('libp2p:mplex');\n this.logger = components.logger;\n this._streamId = 0;\n this._streams = {\n /**\n * Stream to ids map\n */\n initiators: new Map(),\n /**\n * Stream to ids map\n */\n receivers: new Map()\n };\n this._init = init;\n this.closeTimeout = init.closeTimeout ?? CLOSE_TIMEOUT;\n /**\n * An iterable sink\n */\n this.sink = this._createSink();\n /**\n * An iterable source\n */\n this._source = pushable({\n objectMode: true,\n onEnd: () => {\n // the source has ended, we can't write any more messages to gracefully\n // close streams so all we can do is destroy them\n for (const stream of this._streams.initiators.values()) {\n stream.destroy();\n }\n for (const stream of this._streams.receivers.values()) {\n stream.destroy();\n }\n }\n });\n this.source = pipe(this._source, source => encode(source));\n /**\n * Close controller\n */\n this.closeController = new AbortController();\n this.rateLimiter = new RateLimiter({\n points: init.disconnectThreshold ?? DISCONNECT_THRESHOLD,\n duration: 1\n });\n }\n /**\n * Returns a Map of streams and their ids\n */\n get streams() {\n // Inbound and Outbound streams may have the same ids, so we need to make those unique\n const streams = [];\n for (const stream of this._streams.initiators.values()) {\n streams.push(stream);\n }\n for (const stream of this._streams.receivers.values()) {\n streams.push(stream);\n }\n return streams;\n }\n /**\n * Initiate a new stream with the given name. If no name is\n * provided, the id of the stream will be used.\n */\n newStream(name) {\n if (this.closeController.signal.aborted) {\n throw new Error('Muxer already closed');\n }\n const id = this._streamId++;\n name = name == null ? id.toString() : name.toString();\n const registry = this._streams.initiators;\n return this._newStream({ id, name, type: 'initiator', registry });\n }\n /**\n * Close or abort all tracked streams and stop the muxer\n */\n async close(options) {\n if (this.closeController.signal.aborted) {\n return;\n }\n const signal = options?.signal ?? AbortSignal.timeout(this.closeTimeout);\n try {\n // try to gracefully close all streams\n await Promise.all(this.streams.map(async (s) => s.close({\n signal\n })));\n this._source.end();\n // try to gracefully close the muxer\n await this._source.onEmpty({\n signal\n });\n this.closeController.abort();\n }\n catch (err) {\n this.abort(err);\n }\n }\n abort(err) {\n if (this.closeController.signal.aborted) {\n return;\n }\n this.streams.forEach(s => { s.abort(err); });\n this.closeController.abort(err);\n }\n /**\n * Called whenever an inbound stream is created\n */\n _newReceiverStream(options) {\n const { id, name } = options;\n const registry = this._streams.receivers;\n return this._newStream({ id, name, type: 'receiver', registry });\n }\n _newStream(options) {\n const { id, name, type, registry } = options;\n this.log('new %s stream %s', type, id);\n if (type === 'initiator' && this._streams.initiators.size === (this._init.maxOutboundStreams ?? MAX_STREAMS_OUTBOUND_STREAMS_PER_CONNECTION)) {\n throw new CodeError('Too many outbound streams open', 'ERR_TOO_MANY_OUTBOUND_STREAMS');\n }\n if (registry.has(id)) {\n throw new Error(`${type} stream ${id} already exists!`);\n }\n const send = async (msg) => {\n if (this.log.enabled) {\n this.log.trace('%s stream %s send', type, id, printMessage(msg));\n }\n this._source.push(msg);\n };\n const onEnd = () => {\n this.log('%s stream with id %s and protocol %s ended', type, id, stream.protocol);\n registry.delete(id);\n if (this._init.onStreamEnd != null) {\n this._init.onStreamEnd(stream);\n }\n };\n const stream = createStream({ id, name, send, type, onEnd, maxMsgSize: this._init.maxMsgSize, logger: this.logger });\n registry.set(id, stream);\n return stream;\n }\n /**\n * Creates a sink with an abortable source. Incoming messages will\n * also have their size restricted. All messages will be varint decoded.\n */\n _createSink() {\n const sink = async (source) => {\n const abortListener = () => {\n closeSource(source, this.log);\n };\n this.closeController.signal.addEventListener('abort', abortListener);\n try {\n const decoder = new Decoder(this._init.maxMsgSize, this._init.maxUnprocessedMessageQueueSize);\n for await (const chunk of source) {\n for (const msg of decoder.write(chunk)) {\n await this._handleIncoming(msg);\n }\n }\n this._source.end();\n }\n catch (err) {\n this.log('error in sink', err);\n this._source.end(err); // End the source with an error\n }\n finally {\n this.closeController.signal.removeEventListener('abort', abortListener);\n }\n };\n return sink;\n }\n async _handleIncoming(message) {\n const { id, type } = message;\n if (this.log.enabled) {\n this.log.trace('incoming message', printMessage(message));\n }\n // Create a new stream?\n if (message.type === MessageTypes.NEW_STREAM) {\n if (this._streams.receivers.size === (this._init.maxInboundStreams ?? MAX_STREAMS_INBOUND_STREAMS_PER_CONNECTION)) {\n this.log('too many inbound streams open');\n // not going to allow this stream, send the reset message manually\n // instead of setting it up just to tear it down\n this._source.push({\n id,\n type: MessageTypes.RESET_RECEIVER\n });\n // if we've hit our stream limit, and the remote keeps trying to open\n // more new streams, if they are doing this very quickly maybe they\n // are attacking us and we should close the connection\n try {\n await this.rateLimiter.consume('new-stream', 1);\n }\n catch {\n this.log('rate limit hit when opening too many new streams over the inbound stream limit - closing remote connection');\n // since there's no backpressure in mplex, the only thing we can really do to protect ourselves is close the connection\n this.abort(new Error('Too many open streams'));\n return;\n }\n return;\n }\n const stream = this._newReceiverStream({ id, name: uint8ArrayToString(message.data instanceof Uint8Array ? message.data : message.data.subarray()) });\n if (this._init.onIncomingStream != null) {\n this._init.onIncomingStream(stream);\n }\n return;\n }\n const list = (type & 1) === 1 ? this._streams.initiators : this._streams.receivers;\n const stream = list.get(id);\n if (stream == null) {\n this.log('missing stream %s for message type %s', id, MessageTypeNames[type]);\n // if the remote keeps sending us messages for streams that have been\n // closed or were never opened they may be attacking us so if they do\n // this very quickly all we can do is close the connection\n try {\n await this.rateLimiter.consume('missing-stream', 1);\n }\n catch {\n this.log('rate limit hit when receiving messages for streams that do not exist - closing remote connection');\n // since there's no backpressure in mplex, the only thing we can really do to protect ourselves is close the connection\n this.abort(new Error('Too many messages for missing streams'));\n return;\n }\n return;\n }\n const maxBufferSize = this._init.maxStreamBufferSize ?? MAX_STREAM_BUFFER_SIZE;\n try {\n switch (type) {\n case MessageTypes.MESSAGE_INITIATOR:\n case MessageTypes.MESSAGE_RECEIVER:\n if (stream.sourceReadableLength() > maxBufferSize) {\n // Stream buffer has got too large, reset the stream\n this._source.push({\n id: message.id,\n type: type === MessageTypes.MESSAGE_INITIATOR ? MessageTypes.RESET_RECEIVER : MessageTypes.RESET_INITIATOR\n });\n // Inform the stream consumer they are not fast enough\n throw new CodeError('Input buffer full - increase Mplex maxBufferSize to accommodate slow consumers', 'ERR_STREAM_INPUT_BUFFER_FULL');\n }\n // We got data from the remote, push it into our local stream\n stream.sourcePush(message.data);\n break;\n case MessageTypes.CLOSE_INITIATOR:\n case MessageTypes.CLOSE_RECEIVER:\n // The remote has stopped writing, so we can stop reading\n stream.remoteCloseWrite();\n break;\n case MessageTypes.RESET_INITIATOR:\n case MessageTypes.RESET_RECEIVER:\n // The remote has errored, stop reading and writing to the stream immediately\n stream.reset();\n break;\n default:\n this.log('unknown message type %s', type);\n }\n }\n catch (err) {\n this.log.error('error while processing message', err);\n stream.abort(err);\n }\n }\n}\n//# sourceMappingURL=mplex.js.map","/**\n * @packageDocumentation\n *\n * This is a [simple stream multiplexer(https://docs.libp2p.io/concepts/multiplex/mplex/) that has been deprecated.\n *\n * Please use [@chainsafe/libp2p-yamux](https://www.npmjs.com/package/@chainsafe/libp2p-yamux) instead.\n *\n * @example\n *\n * ```TypeScript\n * import { mplex } from '@libp2p/mplex'\n * import { pipe } from 'it-pipe'\n *\n * const factory = mplex()\n *\n * const muxer = factory.createStreamMuxer(components, {\n * onStream: stream => { // Receive a duplex stream from the remote\n * // ...receive data from the remote and optionally send data back\n * },\n * onStreamEnd: stream => {\n * // ...handle any tracking you may need of stream closures\n * }\n * })\n *\n * pipe(conn, muxer, conn) // conn is duplex connection to another peer\n *\n * const stream = muxer.newStream() // Create a new duplex stream to the remote\n *\n * // Use the duplex stream to send some data to the remote...\n * pipe([1, 2, 3], stream)\n * ```\n */\nimport { serviceCapabilities } from '@libp2p/interface';\nimport { MplexStreamMuxer } from './mplex.js';\nclass Mplex {\n protocol = '/mplex/6.7.0';\n _init;\n components;\n constructor(components, init = {}) {\n this.components = components;\n this._init = init;\n }\n [Symbol.toStringTag] = '@libp2p/mplex';\n [serviceCapabilities] = [\n '@libp2p/stream-multiplexing'\n ];\n createStreamMuxer(init = {}) {\n return new MplexStreamMuxer(this.components, {\n ...init,\n ...this._init\n });\n }\n}\nexport function mplex(init = {}) {\n return (components) => new Mplex(components, init);\n}\n//# sourceMappingURL=index.js.map","/**\n * @packageDocumentation\n *\n * Return the first value in an (async)iterable\n *\n * @example\n *\n * ```javascript\n * import first from 'it-first'\n *\n * // This can also be an iterator, generator, etc\n * const values = [0, 1, 2, 3, 4]\n *\n * const res = first(values)\n *\n * console.info(res) // 0\n * ```\n *\n * Async sources must be awaited:\n *\n * ```javascript\n * import first from 'it-first'\n *\n * const values = async function * () {\n * yield * [0, 1, 2, 3, 4]\n * }\n *\n * const res = await first(values())\n *\n * console.info(res) // 0\n * ```\n */\nfunction isAsyncIterable(thing) {\n return thing[Symbol.asyncIterator] != null;\n}\nfunction first(source) {\n if (isAsyncIterable(source)) {\n return (async () => {\n for await (const entry of source) { // eslint-disable-line no-unreachable-loop\n return entry;\n }\n return undefined;\n })();\n }\n for (const entry of source) { // eslint-disable-line no-unreachable-loop\n return entry;\n }\n return undefined;\n}\nexport default first;\n//# sourceMappingURL=index.js.map","export const PING_PROTOCOL = '/ipfs/ping/1.0.0';\nexport const PING_LENGTH = 32;\nexport const PROTOCOL_VERSION = '1.0.0';\nexport const PROTOCOL_NAME = 'ping';\nexport const PROTOCOL_PREFIX = 'ipfs';\nexport const TIMEOUT = 10000;\n// See https://github.com/libp2p/specs/blob/d4b5fb0152a6bb86cfd9ea/ping/ping.md?plain=1#L38-L43\n// The dialing peer MUST NOT keep more than one outbound stream for the ping protocol per peer.\n// The listening peer SHOULD accept at most two streams per peer since cross-stream behavior is\n// non-linear and stream writes occur asynchronously. The listening peer may perceive the\n// dialing peer closing and opening the wrong streams (for instance, closing stream B and\n// opening stream A even though the dialing peer is opening stream B and closing stream A).\nexport const MAX_INBOUND_STREAMS = 2;\nexport const MAX_OUTBOUND_STREAMS = 1;\nexport const ERR_WRONG_PING_ACK = 'ERR_WRONG_PING_ACK';\n//# sourceMappingURL=constants.js.map","import { randomBytes } from '@libp2p/crypto';\nimport { CodeError, ERR_INVALID_MESSAGE, ERR_TIMEOUT } from '@libp2p/interface';\nimport first from 'it-first';\nimport { pipe } from 'it-pipe';\nimport { equals as uint8ArrayEquals } from 'uint8arrays/equals';\nimport { PROTOCOL_PREFIX, PROTOCOL_NAME, PING_LENGTH, PROTOCOL_VERSION, TIMEOUT, MAX_INBOUND_STREAMS, MAX_OUTBOUND_STREAMS, ERR_WRONG_PING_ACK } from './constants.js';\nexport class PingService {\n protocol;\n components;\n started;\n timeout;\n maxInboundStreams;\n maxOutboundStreams;\n runOnTransientConnection;\n log;\n constructor(components, init = {}) {\n this.components = components;\n this.log = components.logger.forComponent('libp2p:ping');\n this.started = false;\n this.protocol = `/${init.protocolPrefix ?? PROTOCOL_PREFIX}/${PROTOCOL_NAME}/${PROTOCOL_VERSION}`;\n this.timeout = init.timeout ?? TIMEOUT;\n this.maxInboundStreams = init.maxInboundStreams ?? MAX_INBOUND_STREAMS;\n this.maxOutboundStreams = init.maxOutboundStreams ?? MAX_OUTBOUND_STREAMS;\n this.runOnTransientConnection = init.runOnTransientConnection ?? true;\n this.handleMessage = this.handleMessage.bind(this);\n }\n [Symbol.toStringTag] = '@libp2p/ping';\n async start() {\n await this.components.registrar.handle(this.protocol, this.handleMessage, {\n maxInboundStreams: this.maxInboundStreams,\n maxOutboundStreams: this.maxOutboundStreams,\n runOnTransientConnection: this.runOnTransientConnection\n });\n this.started = true;\n }\n async stop() {\n await this.components.registrar.unhandle(this.protocol);\n this.started = false;\n }\n isStarted() {\n return this.started;\n }\n /**\n * A handler to register with Libp2p to process ping messages\n */\n handleMessage(data) {\n this.log('incoming ping from %p', data.connection.remotePeer);\n const { stream } = data;\n const start = Date.now();\n const signal = AbortSignal.timeout(this.timeout);\n signal.addEventListener('abort', () => {\n stream?.abort(new CodeError('ping timeout', ERR_TIMEOUT));\n });\n void pipe(stream, async function* (source) {\n let received = 0;\n for await (const buf of source) {\n received += buf.byteLength;\n if (received > PING_LENGTH) {\n stream?.abort(new CodeError('Too much data received', ERR_INVALID_MESSAGE));\n return;\n }\n yield buf;\n }\n }, stream)\n .catch(err => {\n this.log.error('incoming ping from %p failed with error', data.connection.remotePeer, err);\n stream?.abort(err);\n })\n .finally(() => {\n const ms = Date.now() - start;\n this.log('incoming ping from %p complete in %dms', data.connection.remotePeer, ms);\n });\n }\n /**\n * Ping a given peer and wait for its response, getting the operation latency.\n */\n async ping(peer, options = {}) {\n this.log('pinging %p', peer);\n const start = Date.now();\n const data = randomBytes(PING_LENGTH);\n const connection = await this.components.connectionManager.openConnection(peer, options);\n let stream;\n let onAbort = () => { };\n if (options.signal == null) {\n const signal = AbortSignal.timeout(this.timeout);\n options = {\n ...options,\n signal\n };\n }\n try {\n stream = await connection.newStream(this.protocol, {\n ...options,\n runOnTransientConnection: this.runOnTransientConnection\n });\n onAbort = () => {\n stream?.abort(new CodeError('ping timeout', ERR_TIMEOUT));\n };\n // make stream abortable\n options.signal?.addEventListener('abort', onAbort, { once: true });\n const result = await pipe([data], stream, async (source) => first(source));\n const ms = Date.now() - start;\n if (result == null) {\n throw new CodeError(`Did not receive a ping ack after ${ms}ms`, ERR_WRONG_PING_ACK);\n }\n if (!uint8ArrayEquals(data, result.subarray())) {\n throw new CodeError(`Received wrong ping ack after ${ms}ms`, ERR_WRONG_PING_ACK);\n }\n this.log('ping %p complete in %dms', connection.remotePeer, ms);\n return ms;\n }\n catch (err) {\n this.log.error('error while pinging %p', connection.remotePeer, err);\n stream?.abort(err);\n throw err;\n }\n finally {\n options.signal?.removeEventListener('abort', onAbort);\n if (stream != null) {\n await stream.close();\n }\n }\n }\n}\n//# sourceMappingURL=ping.js.map","/**\n * @packageDocumentation\n *\n * The ping service implements the [libp2p ping spec](https://github.com/libp2p/specs/blob/master/ping/ping.md) allowing you to make a latency measurement to a remote peer.\n *\n * @example\n *\n * ```typescript\n * import { createLibp2p } from 'libp2p'\n * import { ping } from '@libp2p/ping'\n * import { multiaddr } from '@multiformats/multiaddr'\n *\n * const node = await createLibp2p({\n * services: {\n * ping: ping()\n * }\n * })\n *\n * const rtt = await node.services.ping.ping(multiaddr('/ip4/...'))\n *\n * console.info(rtt)\n * ```\n */\nimport { PingService as PingServiceClass } from './ping.js';\nexport function ping(init = {}) {\n return (components) => new PingServiceClass(components, init);\n}\nexport { PING_PROTOCOL } from './constants.js';\n//# sourceMappingURL=index.js.map","export const transportSymbol = Symbol.for('@libp2p/transport');\nexport function isTransport(other) {\n return other != null && Boolean(other[transportSymbol]);\n}\n/**\n * Enum Transport Manager Fault Tolerance values\n */\nexport var FaultTolerance;\n(function (FaultTolerance) {\n /**\n * should be used for failing in any listen circumstance\n */\n FaultTolerance[FaultTolerance[\"FATAL_ALL\"] = 0] = \"FATAL_ALL\";\n /**\n * should be used for not failing when not listening\n */\n FaultTolerance[FaultTolerance[\"NO_FATAL\"] = 1] = \"NO_FATAL\";\n})(FaultTolerance || (FaultTolerance = {}));\n//# sourceMappingURL=index.js.map","/**\n * @packageDocumentation\n *\n * This module allows easy conversion of Multiaddrs to string URIs.\n *\n * @example Converting multiaddrs to string URIs\n *\n * ```js\n * import { multiaddrToUri } from '@multiformats/multiaddr-to-uri'\n *\n * console.log(multiaddrToUri('/dnsaddr/protocol.ai/https'))\n * // -> https://protocol.ai\n *\n * console.log(multiaddrToUri('/ip4/127.0.0.1/tcp/8080'))\n * // -> http://127.0.0.1:8080\n *\n * console.log(multiaddrToUri('/ip4/127.0.0.1/tcp/8080', { assumeHttp: false }))\n * // -> tcp://127.0.0.1:8080\n * ```\n *\n * Note:\n *\n * - When `/tcp` is the last (terminating) protocol HTTP is assumed by default (implicit `assumeHttp: true`)\n * - this means produced URIs will start with `http://` instead of `tcp://`\n * - passing `{ assumeHttp: false }` disables this behavior\n * - Might be lossy - e.g. a DNSv6 multiaddr\n * - Can throw if the passed multiaddr:\n * - is not a valid multiaddr\n * - is not supported as a URI e.g. circuit\n */\nimport { multiaddr, protocols } from '@multiformats/multiaddr';\nconst ASSUME_HTTP_CODES = [\n protocols('tcp').code,\n protocols('dns').code,\n protocols('dnsaddr').code,\n protocols('dns4').code,\n protocols('dns6').code\n];\nfunction extractSNI(ma) {\n let sniProtoCode;\n try {\n sniProtoCode = protocols('sni').code;\n }\n catch (e) {\n // No SNI protocol in multiaddr\n return null;\n }\n for (const [proto, value] of ma) {\n if (proto === sniProtoCode && value !== undefined) {\n return value;\n }\n }\n return null;\n}\nfunction hasTLS(ma) {\n return ma.some(([proto, _]) => proto === protocols('tls').code);\n}\nfunction interpretNext(headProtoCode, headProtoVal, restMa) {\n const interpreter = interpreters[protocols(headProtoCode).name];\n if (interpreter === undefined) {\n throw new Error(`Can't interpret protocol ${protocols(headProtoCode).name}`);\n }\n const restVal = interpreter(headProtoVal, restMa);\n if (headProtoCode === protocols('ip6').code) {\n return `[${restVal}]`;\n }\n return restVal;\n}\nconst interpreters = {\n ip4: (value, restMa) => value,\n ip6: (value, restMa) => {\n if (restMa.length === 0) {\n return value;\n }\n return `[${value}]`;\n },\n tcp: (value, restMa) => {\n const tailProto = restMa.pop();\n if (tailProto === undefined) {\n throw new Error('Unexpected end of multiaddr');\n }\n return `tcp://${interpretNext(tailProto[0], tailProto[1] ?? '', restMa)}:${value}`;\n },\n udp: (value, restMa) => {\n const tailProto = restMa.pop();\n if (tailProto === undefined) {\n throw new Error('Unexpected end of multiaddr');\n }\n return `udp://${interpretNext(tailProto[0], tailProto[1] ?? '', restMa)}:${value}`;\n },\n dnsaddr: (value, restMa) => value,\n dns4: (value, restMa) => value,\n dns6: (value, restMa) => value,\n dns: (value, restMa) => value,\n ipfs: (value, restMa) => {\n const tailProto = restMa.pop();\n if (tailProto === undefined) {\n throw new Error('Unexpected end of multiaddr');\n }\n return `${interpretNext(tailProto[0], tailProto[1] ?? '', restMa)}/ipfs/${value}`;\n },\n p2p: (value, restMa) => {\n const tailProto = restMa.pop();\n if (tailProto === undefined) {\n throw new Error('Unexpected end of multiaddr');\n }\n return `${interpretNext(tailProto[0], tailProto[1] ?? '', restMa)}/p2p/${value}`;\n },\n http: (value, restMa) => {\n const maHasTLS = hasTLS(restMa);\n const sni = extractSNI(restMa);\n if (maHasTLS && sni !== null) {\n return `https://${sni}`;\n }\n const protocol = maHasTLS ? 'https://' : 'http://';\n const tailProto = restMa.pop();\n if (tailProto === undefined) {\n throw new Error('Unexpected end of multiaddr');\n }\n let baseVal = interpretNext(tailProto[0], tailProto[1] ?? '', restMa);\n // We are reinterpreting the base as http, so we need to remove the tcp:// if it's there\n baseVal = baseVal.replace('tcp://', '');\n return `${protocol}${baseVal}`;\n },\n 'http-path': (value, restMa) => {\n const tailProto = restMa.pop();\n if (tailProto === undefined) {\n throw new Error('Unexpected end of multiaddr');\n }\n const baseVal = interpretNext(tailProto[0], tailProto[1] ?? '', restMa);\n const decodedValue = decodeURIComponent(value);\n return `${baseVal}/${decodedValue}`;\n },\n tls: (value, restMa) => {\n // Noop, the parent context knows that it's tls. We don't need to do\n // anything here\n const tailProto = restMa.pop();\n if (tailProto === undefined) {\n throw new Error('Unexpected end of multiaddr');\n }\n return interpretNext(tailProto[0], tailProto[1] ?? '', restMa);\n },\n sni: (value, restMa) => {\n // Noop, the parent context uses the sni information, we don't need to do\n // anything here\n const tailProto = restMa.pop();\n if (tailProto === undefined) {\n throw new Error('Unexpected end of multiaddr');\n }\n return interpretNext(tailProto[0], tailProto[1] ?? '', restMa);\n },\n https: (value, restMa) => {\n const tailProto = restMa.pop();\n if (tailProto === undefined) {\n throw new Error('Unexpected end of multiaddr');\n }\n let baseVal = interpretNext(tailProto[0], tailProto[1] ?? '', restMa);\n // We are reinterpreting the base as http, so we need to remove the tcp:// if it's there\n baseVal = baseVal.replace('tcp://', '');\n return `https://${baseVal}`;\n },\n ws: (value, restMa) => {\n const maHasTLS = hasTLS(restMa);\n const sni = extractSNI(restMa);\n if (maHasTLS && sni !== null) {\n return `wss://${sni}`;\n }\n const protocol = maHasTLS ? 'wss://' : 'ws://';\n const tailProto = restMa.pop();\n if (tailProto === undefined) {\n throw new Error('Unexpected end of multiaddr');\n }\n let baseVal = interpretNext(tailProto[0], tailProto[1] ?? '', restMa);\n // We are reinterpreting the base, so we need to remove the tcp:// if it's there\n baseVal = baseVal.replace('tcp://', '');\n return `${protocol}${baseVal}`;\n },\n wss: (value, restMa) => {\n const tailProto = restMa.pop();\n if (tailProto === undefined) {\n throw new Error('Unexpected end of multiaddr');\n }\n let baseVal = interpretNext(tailProto[0], tailProto[1] ?? '', restMa);\n // We are reinterpreting the base as http, so we need to remove the tcp:// if it's there\n baseVal = baseVal.replace('tcp://', '');\n return `wss://${baseVal}`;\n },\n 'p2p-websocket-star': (value, restMa) => {\n const tailProto = restMa.pop();\n if (tailProto === undefined) {\n throw new Error('Unexpected end of multiaddr');\n }\n return `${interpretNext(tailProto[0], tailProto[1] ?? '', restMa)}/p2p-websocket-star`;\n },\n 'p2p-webrtc-star': (value, restMa) => {\n const tailProto = restMa.pop();\n if (tailProto === undefined) {\n throw new Error('Unexpected end of multiaddr');\n }\n return `${interpretNext(tailProto[0], tailProto[1] ?? '', restMa)}/p2p-webrtc-star`;\n },\n 'p2p-webrtc-direct': (value, restMa) => {\n const tailProto = restMa.pop();\n if (tailProto === undefined) {\n throw new Error('Unexpected end of multiaddr');\n }\n return `${interpretNext(tailProto[0], tailProto[1] ?? '', restMa)}/p2p-webrtc-direct`;\n }\n};\nexport function multiaddrToUri(input, opts) {\n const ma = multiaddr(input);\n const parts = ma.stringTuples();\n const head = parts.pop();\n if (head === undefined) {\n throw new Error('Unexpected end of multiaddr');\n }\n const protocol = protocols(head[0]);\n const interpreter = interpreters[protocol.name];\n if (interpreter == null) {\n throw new Error(`No interpreter found for ${protocol.name}`);\n }\n let uri = interpreter(head[1] ?? '', parts);\n if (opts?.assumeHttp !== false && ASSUME_HTTP_CODES.includes(head[0])) {\n // strip any declared protocol\n uri = uri.replace(/^.*:\\/\\//, '');\n if (head[1] === '443') {\n uri = `https://${uri}`;\n }\n else {\n uri = `http://${uri}`;\n }\n }\n if (uri.startsWith('http://') || uri.startsWith('https://')) {\n // this will strip default ports while keeping paths intact\n uri = new URL(uri).toString();\n // strip trailing slash, e.g. http://127.0.0.1/ -> http://127.0.0.1\n if (uri.endsWith('/')) {\n uri = uri.substring(0, uri.length - 1);\n }\n }\n return uri;\n}\n//# sourceMappingURL=index.js.map","export default async (socket) => {\n // if the socket is closing or closed, return end\n if (socket.readyState >= 2) {\n throw new Error('socket closed');\n }\n // if open, return\n if (socket.readyState === 1) {\n return;\n }\n await new Promise((resolve, reject) => {\n function cleanup() {\n socket.removeEventListener('open', handleOpen);\n socket.removeEventListener('error', handleErr);\n }\n function handleOpen() {\n cleanup();\n resolve();\n }\n function handleErr(event) {\n cleanup();\n reject(event.error ?? new Error(`connect ECONNREFUSED ${socket.url}`));\n }\n socket.addEventListener('open', handleOpen);\n socket.addEventListener('error', handleErr);\n });\n};\n//# sourceMappingURL=ready.js.map","import ready from './ready.js';\nexport default (socket, options) => {\n options = options ?? {};\n options.closeOnEnd = options.closeOnEnd !== false;\n const sink = async (source) => {\n for await (const data of source) {\n try {\n await ready(socket);\n }\n catch (err) {\n if (err.message === 'socket closed')\n break;\n throw err;\n }\n // the ready promise resolved without error but the socket was closing so\n // exit the loop and don't send data\n if (socket.readyState === socket.CLOSING || socket.readyState === socket.CLOSED) {\n break;\n }\n socket.send(data);\n }\n if (options.closeOnEnd != null && socket.readyState <= 1) {\n await new Promise((resolve, reject) => {\n socket.addEventListener('close', event => {\n if (event.wasClean || event.code === 1006) {\n resolve();\n }\n else {\n const err = Object.assign(new Error('ws error'), { event });\n reject(err);\n }\n });\n setTimeout(() => { socket.close(); });\n });\n }\n };\n return sink;\n};\n//# sourceMappingURL=sink.js.map","import { EventIterator } from 'event-iterator';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\n// copied from github.com/feross/buffer\n// Some ArrayBuffers are not passing the instanceof check, so we need to do a bit more work :(\nfunction isArrayBuffer(obj) {\n return (obj instanceof ArrayBuffer) ||\n (obj?.constructor?.name === 'ArrayBuffer' && typeof obj?.byteLength === 'number');\n}\nexport default (socket) => {\n socket.binaryType = 'arraybuffer';\n const connected = async () => {\n await new Promise((resolve, reject) => {\n if (isConnected) {\n resolve();\n return;\n }\n if (connError != null) {\n reject(connError);\n return;\n }\n const cleanUp = (cont) => {\n socket.removeEventListener('open', onOpen);\n socket.removeEventListener('error', onError);\n cont();\n };\n const onOpen = () => { cleanUp(resolve); };\n const onError = (event) => {\n cleanUp(() => { reject(event.error ?? new Error(`connect ECONNREFUSED ${socket.url}`)); });\n };\n socket.addEventListener('open', onOpen);\n socket.addEventListener('error', onError);\n });\n };\n const source = (async function* () {\n const messages = new EventIterator(({ push, stop, fail }) => {\n const onMessage = (event) => {\n let data = null;\n if (typeof event.data === 'string') {\n data = uint8ArrayFromString(event.data);\n }\n if (isArrayBuffer(event.data)) {\n data = new Uint8Array(event.data);\n }\n if (event.data instanceof Uint8Array) {\n data = event.data;\n }\n if (data == null) {\n return;\n }\n push(data);\n };\n const onError = (event) => { fail(event.error ?? new Error('Socket error')); };\n socket.addEventListener('message', onMessage);\n socket.addEventListener('error', onError);\n socket.addEventListener('close', stop);\n return () => {\n socket.removeEventListener('message', onMessage);\n socket.removeEventListener('error', onError);\n socket.removeEventListener('close', stop);\n };\n }, { highWaterMark: Infinity });\n await connected();\n for await (const chunk of messages) {\n yield isArrayBuffer(chunk) ? new Uint8Array(chunk) : chunk;\n }\n }());\n let isConnected = socket.readyState === 1;\n let connError;\n socket.addEventListener('open', () => {\n isConnected = true;\n connError = null;\n });\n socket.addEventListener('close', () => {\n isConnected = false;\n connError = null;\n });\n socket.addEventListener('error', event => {\n if (!isConnected) {\n connError = event.error ?? new Error(`connect ECONNREFUSED ${socket.url}`);\n }\n });\n return Object.assign(source, {\n connected\n });\n};\n//# sourceMappingURL=source.js.map","/* eslint-env browser */\nexport default WebSocket;\n//# sourceMappingURL=web-socket.browser.js.map","const map = { 'http:': 'ws:', 'https:': 'wss:' };\nconst defaultProtocol = 'ws:';\nexport default (url, location) => {\n if (url.startsWith('//')) {\n url = `${location?.protocol ?? defaultProtocol}${url}`;\n }\n if (url.startsWith('/') && location != null) {\n const proto = location.protocol ?? defaultProtocol;\n const host = location.host;\n const port = location.port != null && host?.endsWith(`:${location.port}`) !== true ? `:${location.port}` : '';\n url = `${proto}//${host}${port}${url}`;\n }\n const wsUrl = new URL(url);\n for (const [httpProto, wsProto] of Object.entries(map)) {\n if (wsUrl.protocol === httpProto) {\n wsUrl.protocol = wsProto;\n }\n }\n return wsUrl;\n};\n//# sourceMappingURL=ws-url.js.map","// load websocket library if we are not in the browser\nimport duplex from './duplex.js';\nimport WebSocket from './web-socket.js';\nimport wsurl from './ws-url.js';\nexport function connect(addr, opts) {\n const location = typeof window === 'undefined' ? undefined : window.location;\n opts = opts ?? {};\n const url = wsurl(addr, location);\n // it's necessary to stringify the URL object otherwise react-native crashes\n const socket = new WebSocket(url.toString(), opts.websocket);\n return duplex(socket, opts);\n}\n//# sourceMappingURL=client.js.map","import sink from './sink.js';\nimport source from './source.js';\nexport default (socket, options) => {\n options = options ?? {};\n const connectedSource = source(socket);\n let remoteAddress = options.remoteAddress;\n let remotePort = options.remotePort;\n if (socket.url != null) {\n // only client->server sockets have urls, server->client connections do not\n try {\n const url = new URL(socket.url);\n remoteAddress = url.hostname;\n remotePort = parseInt(url.port, 10);\n }\n catch { }\n }\n if (remoteAddress == null || remotePort == null) {\n throw new Error('Remote connection did not have address and/or port');\n }\n const duplex = {\n sink: sink(socket, options),\n source: connectedSource,\n connected: async () => { await connectedSource.connected(); },\n close: async () => {\n if (socket.readyState === socket.CONNECTING || socket.readyState === socket.OPEN) {\n await new Promise((resolve) => {\n socket.addEventListener('close', () => {\n resolve();\n });\n socket.close();\n });\n }\n },\n destroy: () => {\n if (socket.terminate != null) {\n socket.terminate();\n }\n else {\n socket.close();\n }\n },\n remoteAddress,\n remotePort,\n socket\n };\n return duplex;\n};\n//# sourceMappingURL=duplex.js.map","/**\n * An implementation of the ProgressEvent interface, this is essentially\n * a typed `CustomEvent` with a `type` property that lets us disambiguate\n * events passed to `progress` callbacks.\n */\nexport class CustomProgressEvent extends Event {\n constructor(type, detail) {\n super(type);\n this.detail = detail;\n }\n}\n//# sourceMappingURL=index.js.map","// p2p multi-address code\nexport const CODE_P2P = 421;\nexport const CODE_CIRCUIT = 290;\nexport const CODE_TCP = 6;\nexport const CODE_WS = 477;\nexport const CODE_WSS = 478;\n// Time to wait for a connection to close gracefully before destroying it manually\nexport const CLOSE_TIMEOUT = 500;\n//# sourceMappingURL=constants.js.map","import * as mafmt from '@multiformats/mafmt';\nimport { CODE_CIRCUIT, CODE_P2P, CODE_TCP, CODE_WS, CODE_WSS } from './constants.js';\nexport function all(multiaddrs) {\n return multiaddrs.filter((ma) => {\n if (ma.protoCodes().includes(CODE_CIRCUIT)) {\n return false;\n }\n const testMa = ma.decapsulateCode(CODE_P2P);\n return mafmt.WebSockets.matches(testMa) ||\n mafmt.WebSocketsSecure.matches(testMa);\n });\n}\nexport function wss(multiaddrs) {\n return multiaddrs.filter((ma) => {\n if (ma.protoCodes().includes(CODE_CIRCUIT)) {\n return false;\n }\n const testMa = ma.decapsulateCode(CODE_P2P);\n return mafmt.WebSocketsSecure.matches(testMa);\n });\n}\nexport function dnsWss(multiaddrs) {\n return multiaddrs.filter((ma) => {\n if (ma.protoCodes().includes(CODE_CIRCUIT)) {\n return false;\n }\n const testMa = ma.decapsulateCode(CODE_P2P);\n return mafmt.WebSocketsSecure.matches(testMa) &&\n mafmt.DNS.matches(testMa.decapsulateCode(CODE_TCP).decapsulateCode(CODE_WSS));\n });\n}\nexport function dnsWsOrWss(multiaddrs) {\n return multiaddrs.filter((ma) => {\n if (ma.protoCodes().includes(CODE_CIRCUIT)) {\n return false;\n }\n const testMa = ma.decapsulateCode(CODE_P2P);\n // WS\n if (mafmt.WebSockets.matches(testMa)) {\n return mafmt.DNS.matches(testMa.decapsulateCode(CODE_TCP).decapsulateCode(CODE_WS));\n }\n // WSS\n return mafmt.WebSocketsSecure.matches(testMa) &&\n mafmt.DNS.matches(testMa.decapsulateCode(CODE_TCP).decapsulateCode(CODE_WSS));\n });\n}\n//# sourceMappingURL=filters.js.map","/**\n * @packageDocumentation\n *\n * A [libp2p transport](https://docs.libp2p.io/concepts/transports/overview/) based on [WebSockets](https://developer.mozilla.org/en-US/docs/Web/API/WebSockets_API).\n *\n * @example\n *\n * ```TypeScript\n * import { createLibp2p } from 'libp2p'\n * import { webSockets } from '@libp2p/websockets'\n * import { multiaddr } from '@multiformats/multiaddr'\n *\n * const node = await createLibp2p({\n * transports: [\n * webSockets()\n * ]\n * //... other config\n * })\n * await node.start()\n *\n * const ma = multiaddr('/ip4/127.0.0.1/tcp/9090/ws')\n * await node.dial(ma)\n * ```\n *\n * ## Filters\n *\n * When run in a browser by default this module will only connect to secure web socket addresses.\n *\n * To change this you should pass a filter to the factory function.\n *\n * You can create your own address filters for this transports, or rely in the filters [provided](./src/filters.js).\n *\n * The available filters are:\n *\n * - `filters.all`\n * - Returns all TCP and DNS based addresses, both with `ws` or `wss`.\n * - `filters.dnsWss`\n * - Returns all DNS based addresses with `wss`.\n * - `filters.dnsWsOrWss`\n * - Returns all DNS based addresses, both with `ws` or `wss`.\n *\n * @example Allow dialing insecure WebSockets\n *\n * ```TypeScript\n * import { createLibp2p } from 'libp2p'\n * import { webSockets } from '@libp2p/websockets'\n * import * as filters from '@libp2p/websockets/filters'\n *\n * const node = await createLibp2p({\n * transports: [\n * webSockets({\n * // connect to all sockets, even insecure ones\n * filter: filters.all\n * })\n * ]\n * })\n * ```\n */\nimport { CodeError, transportSymbol, serviceCapabilities } from '@libp2p/interface';\nimport { multiaddrToUri as toUri } from '@multiformats/multiaddr-to-uri';\nimport { connect } from 'it-ws/client';\nimport pDefer from 'p-defer';\nimport { CustomProgressEvent } from 'progress-events';\nimport { raceSignal } from 'race-signal';\nimport { isBrowser, isWebWorker } from 'wherearewe';\nimport * as filters from './filters.js';\nimport { createListener } from './listener.js';\nimport { socketToMaConn } from './socket-to-conn.js';\nclass WebSockets {\n log;\n init;\n logger;\n metrics;\n components;\n constructor(components, init) {\n this.log = components.logger.forComponent('libp2p:websockets');\n this.logger = components.logger;\n this.components = components;\n this.init = init;\n if (components.metrics != null) {\n this.metrics = {\n dialerEvents: components.metrics.registerCounterGroup('libp2p_websockets_dialer_events_total', {\n label: 'event',\n help: 'Total count of WebSockets dialer events by type'\n })\n };\n }\n }\n [transportSymbol] = true;\n [Symbol.toStringTag] = '@libp2p/websockets';\n [serviceCapabilities] = [\n '@libp2p/transport'\n ];\n async dial(ma, options) {\n this.log('dialing %s', ma);\n options = options ?? {};\n const socket = await this._connect(ma, options);\n const maConn = socketToMaConn(socket, ma, {\n logger: this.logger,\n metrics: this.metrics?.dialerEvents\n });\n this.log('new outbound connection %s', maConn.remoteAddr);\n const conn = await options.upgrader.upgradeOutbound(maConn, options);\n this.log('outbound connection %s upgraded', maConn.remoteAddr);\n return conn;\n }\n async _connect(ma, options) {\n options?.signal?.throwIfAborted();\n const cOpts = ma.toOptions();\n this.log('dialing %s:%s', cOpts.host, cOpts.port);\n const errorPromise = pDefer();\n const rawSocket = connect(toUri(ma), this.init);\n rawSocket.socket.addEventListener('error', () => {\n // the WebSocket.ErrorEvent type doesn't actually give us any useful\n // information about what happened\n // https://developer.mozilla.org/en-US/docs/Web/API/WebSocket/error_event\n const err = new CodeError(`Could not connect to ${ma.toString()}`, 'ERR_CONNECTION_FAILED');\n this.log.error('connection error:', err);\n this.metrics?.dialerEvents.increment({ error: true });\n errorPromise.reject(err);\n });\n try {\n options.onProgress?.(new CustomProgressEvent('websockets:open-connection'));\n await raceSignal(Promise.race([rawSocket.connected(), errorPromise.promise]), options.signal);\n }\n catch (err) {\n if (options.signal?.aborted === true) {\n this.metrics?.dialerEvents.increment({ abort: true });\n }\n rawSocket.close()\n .catch(err => {\n this.log.error('error closing raw socket', err);\n });\n throw err;\n }\n this.log('connected %s', ma);\n this.metrics?.dialerEvents.increment({ connect: true });\n return rawSocket;\n }\n /**\n * Creates a Websockets listener. The provided `handler` function will be called\n * anytime a new incoming Connection has been successfully upgraded via\n * `upgrader.upgradeInbound`\n */\n createListener(options) {\n return createListener({\n logger: this.logger,\n metrics: this.components.metrics\n }, {\n ...this.init,\n ...options\n });\n }\n /**\n * Takes a list of `Multiaddr`s and returns only valid Websockets addresses.\n * By default, in a browser environment only DNS+WSS multiaddr is accepted,\n * while in a Node.js environment DNS+{WS, WSS} multiaddrs are accepted.\n */\n listenFilter(multiaddrs) {\n multiaddrs = Array.isArray(multiaddrs) ? multiaddrs : [multiaddrs];\n if (this.init?.filter != null) {\n return this.init?.filter(multiaddrs);\n }\n // Browser\n if (isBrowser || isWebWorker) {\n return filters.wss(multiaddrs);\n }\n return filters.all(multiaddrs);\n }\n /**\n * Filter check for all Multiaddrs that this transport can dial\n */\n dialFilter(multiaddrs) {\n return this.listenFilter(multiaddrs);\n }\n}\nexport function webSockets(init = {}) {\n return (components) => {\n return new WebSockets(components, init);\n };\n}\n//# sourceMappingURL=index.js.map","import { CodeError } from '@libp2p/interface';\nimport { CLOSE_TIMEOUT } from './constants.js';\n// Convert a stream into a MultiaddrConnection\n// https://github.com/libp2p/interface-transport#multiaddrconnection\nexport function socketToMaConn(stream, remoteAddr, options) {\n const log = options.logger.forComponent('libp2p:websockets:maconn');\n const metrics = options.metrics;\n const metricPrefix = options.metricPrefix ?? '';\n const maConn = {\n log,\n async sink(source) {\n try {\n await stream.sink((async function* () {\n for await (const buf of source) {\n if (buf instanceof Uint8Array) {\n yield buf;\n }\n else {\n yield buf.subarray();\n }\n }\n })());\n }\n catch (err) {\n if (err.type !== 'aborted') {\n log.error(err);\n }\n }\n },\n source: stream.source,\n remoteAddr,\n timeline: { open: Date.now() },\n async close(options = {}) {\n const start = Date.now();\n if (options.signal == null) {\n const signal = AbortSignal.timeout(CLOSE_TIMEOUT);\n options = {\n ...options,\n signal\n };\n }\n const listener = () => {\n const { host, port } = maConn.remoteAddr.toOptions();\n log('timeout closing stream to %s:%s after %dms, destroying it manually', host, port, Date.now() - start);\n this.abort(new CodeError('Socket close timeout', 'ERR_SOCKET_CLOSE_TIMEOUT'));\n };\n options.signal?.addEventListener('abort', listener);\n try {\n await stream.close();\n }\n catch (err) {\n log.error('error closing WebSocket gracefully', err);\n this.abort(err);\n }\n finally {\n options.signal?.removeEventListener('abort', listener);\n maConn.timeline.close = Date.now();\n }\n },\n abort(err) {\n const { host, port } = maConn.remoteAddr.toOptions();\n log('timeout closing stream to %s:%s due to error', host, port, err);\n stream.destroy();\n maConn.timeline.close = Date.now();\n // ws WebSocket.terminate does not accept an Error arg to emit an 'error'\n // event on destroy like other node streams so we can't update a metric\n // with an event listener\n // https://github.com/websockets/ws/issues/1752#issuecomment-622380981\n metrics?.increment({ [`${metricPrefix}error`]: true });\n }\n };\n stream.socket.addEventListener('close', () => {\n metrics?.increment({ [`${metricPrefix}close`]: true });\n // In instances where `close` was not explicitly called,\n // such as an iterable stream ending, ensure we have set the close\n // timeline\n if (maConn.timeline.close == null) {\n maConn.timeline.close = Date.now();\n }\n }, { once: true });\n return maConn;\n}\n//# sourceMappingURL=socket-to-conn.js.map","export function createListener() {\n throw new Error('WebSocket Servers can not be created in the browser!');\n}\n//# sourceMappingURL=listener.browser.js.map","/**\n * Any object that implements this Symbol as a property should return a\n * ContentRouting instance as the property value, similar to how\n * `Symbol.Iterable` can be used to return an `Iterable` from an `Iterator`.\n *\n * @example\n *\n * ```TypeScript\n * import { contentRoutingSymbol, ContentRouting } from '@libp2p/content-routing'\n *\n * class MyContentRouter implements ContentRouting {\n * get [contentRoutingSymbol] () {\n * return this\n * }\n *\n * // ...other methods\n * }\n * ```\n */\nexport const contentRoutingSymbol = Symbol.for('@libp2p/content-routing');\n//# sourceMappingURL=index.js.map","/**\n * Any object that implements this Symbol as a property should return a\n * PeerRouting instance as the property value, similar to how\n * `Symbol.Iterable` can be used to return an `Iterable` from an `Iterator`.\n *\n * @example\n *\n * ```TypeScript\n * import { peerRouting, PeerRouting } from '@libp2p/peer-routing'\n *\n * class MyPeerRouter implements PeerRouting {\n * get [peerRouting] () {\n * return this\n * }\n *\n * // ...other methods\n * }\n * ```\n */\nexport const peerRoutingSymbol = Symbol.for('@libp2p/peer-routing');\n//# sourceMappingURL=index.js.map","// Helpers.\nconst s = 1000;\nconst m = s * 60;\nconst h = m * 60;\nconst d = h * 24;\nconst w = d * 7;\nconst y = d * 365.25;\nfunction ms(value, options) {\n try {\n if (typeof value === 'string' && value.length > 0) {\n return parse(value);\n }\n else if (typeof value === 'number' && isFinite(value)) {\n return options?.long ? fmtLong(value) : fmtShort(value);\n }\n throw new Error('Value is not a string or number.');\n }\n catch (error) {\n const message = isError(error)\n ? `${error.message}. value=${JSON.stringify(value)}`\n : 'An unknown error has occured.';\n throw new Error(message);\n }\n}\n/**\n * Parse the given `str` and return milliseconds.\n */\nfunction parse(str) {\n str = String(str);\n if (str.length > 100) {\n throw new Error('Value exceeds the maximum length of 100 characters.');\n }\n const match = /^(-?(?:\\d+)?\\.?\\d+) *(milliseconds?|msecs?|ms|seconds?|secs?|s|minutes?|mins?|m|hours?|hrs?|h|days?|d|weeks?|w|years?|yrs?|y)?$/i.exec(str);\n if (!match) {\n return NaN;\n }\n const n = parseFloat(match[1]);\n const type = (match[2] || 'ms').toLowerCase();\n switch (type) {\n case 'years':\n case 'year':\n case 'yrs':\n case 'yr':\n case 'y':\n return n * y;\n case 'weeks':\n case 'week':\n case 'w':\n return n * w;\n case 'days':\n case 'day':\n case 'd':\n return n * d;\n case 'hours':\n case 'hour':\n case 'hrs':\n case 'hr':\n case 'h':\n return n * h;\n case 'minutes':\n case 'minute':\n case 'mins':\n case 'min':\n case 'm':\n return n * m;\n case 'seconds':\n case 'second':\n case 'secs':\n case 'sec':\n case 's':\n return n * s;\n case 'milliseconds':\n case 'millisecond':\n case 'msecs':\n case 'msec':\n case 'ms':\n return n;\n default:\n // This should never occur.\n throw new Error(`The unit ${type} was matched, but no matching case exists.`);\n }\n}\nexport default ms;\n/**\n * Short format for `ms`.\n */\nfunction fmtShort(ms) {\n const msAbs = Math.abs(ms);\n if (msAbs >= d) {\n return `${Math.round(ms / d)}d`;\n }\n if (msAbs >= h) {\n return `${Math.round(ms / h)}h`;\n }\n if (msAbs >= m) {\n return `${Math.round(ms / m)}m`;\n }\n if (msAbs >= s) {\n return `${Math.round(ms / s)}s`;\n }\n return `${ms}ms`;\n}\n/**\n * Long format for `ms`.\n */\nfunction fmtLong(ms) {\n const msAbs = Math.abs(ms);\n if (msAbs >= d) {\n return plural(ms, msAbs, d, 'day');\n }\n if (msAbs >= h) {\n return plural(ms, msAbs, h, 'hour');\n }\n if (msAbs >= m) {\n return plural(ms, msAbs, m, 'minute');\n }\n if (msAbs >= s) {\n return plural(ms, msAbs, s, 'second');\n }\n return `${ms} ms`;\n}\n/**\n * Pluralization helper.\n */\nfunction plural(ms, msAbs, n, name) {\n const isPlural = msAbs >= n * 1.5;\n return `${Math.round(ms / n)} ${name}${isPlural ? 's' : ''}`;\n}\n/**\n * A type guard for errors.\n */\nfunction isError(error) {\n return typeof error === 'object' && error !== null && 'message' in error;\n}\n","/* eslint-disable no-console */\n/* eslint-disable @typescript-eslint/restrict-plus-operands */\n/* eslint-disable @typescript-eslint/strict-boolean-expressions */\n/* eslint-env browser */\n/**\n * This is the web browser implementation of `debug()`.\n */\nimport humanize from 'ms';\nimport setup from './common.js';\nconst storage = localstorage();\n/**\n * Colors.\n */\nconst colors = [\n '#0000CC',\n '#0000FF',\n '#0033CC',\n '#0033FF',\n '#0066CC',\n '#0066FF',\n '#0099CC',\n '#0099FF',\n '#00CC00',\n '#00CC33',\n '#00CC66',\n '#00CC99',\n '#00CCCC',\n '#00CCFF',\n '#3300CC',\n '#3300FF',\n '#3333CC',\n '#3333FF',\n '#3366CC',\n '#3366FF',\n '#3399CC',\n '#3399FF',\n '#33CC00',\n '#33CC33',\n '#33CC66',\n '#33CC99',\n '#33CCCC',\n '#33CCFF',\n '#6600CC',\n '#6600FF',\n '#6633CC',\n '#6633FF',\n '#66CC00',\n '#66CC33',\n '#9900CC',\n '#9900FF',\n '#9933CC',\n '#9933FF',\n '#99CC00',\n '#99CC33',\n '#CC0000',\n '#CC0033',\n '#CC0066',\n '#CC0099',\n '#CC00CC',\n '#CC00FF',\n '#CC3300',\n '#CC3333',\n '#CC3366',\n '#CC3399',\n '#CC33CC',\n '#CC33FF',\n '#CC6600',\n '#CC6633',\n '#CC9900',\n '#CC9933',\n '#CCCC00',\n '#CCCC33',\n '#FF0000',\n '#FF0033',\n '#FF0066',\n '#FF0099',\n '#FF00CC',\n '#FF00FF',\n '#FF3300',\n '#FF3333',\n '#FF3366',\n '#FF3399',\n '#FF33CC',\n '#FF33FF',\n '#FF6600',\n '#FF6633',\n '#FF9900',\n '#FF9933',\n '#FFCC00',\n '#FFCC33'\n];\n/**\n * Currently only WebKit-based Web Inspectors, Firefox >= v31,\n * and the Firebug extension (any Firefox version) are known\n * to support \"%c\" CSS customizations.\n *\n * TODO: add a `localStorage` variable to explicitly enable/disable colors\n */\n// eslint-disable-next-line complexity\nfunction useColors() {\n // NB: In an Electron preload script, document will be defined but not fully\n // initialized. Since we know we're in Chrome, we'll just detect this case\n // explicitly\n // @ts-expect-error window.process.type and window.process.__nwjs are not in the types\n if (typeof window !== 'undefined' && window.process && (window.process.type === 'renderer' || window.process.__nwjs)) {\n return true;\n }\n // Internet Explorer and Edge do not support colors.\n if (typeof navigator !== 'undefined' && (navigator.userAgent?.toLowerCase().match(/(edge|trident)\\/(\\d+)/) != null)) {\n return false;\n }\n // Is webkit? http://stackoverflow.com/a/16459606/376773\n // document is undefined in react-native: https://github.com/facebook/react-native/pull/1632\n // @ts-expect-error document.documentElement.style.WebkitAppearance is not in the types\n return (typeof document !== 'undefined' && document.documentElement?.style?.WebkitAppearance) ||\n // Is firebug? http://stackoverflow.com/a/398120/376773\n // @ts-expect-error window.console.firebug and window.console.exception are not in the types\n (typeof window !== 'undefined' && window.console && (window.console.firebug || (window.console.exception && window.console.table))) ||\n // Is firefox >= v31?\n // https://developer.mozilla.org/en-US/docs/Tools/Web_Console#Styling_messages\n (typeof navigator !== 'undefined' && (navigator.userAgent?.toLowerCase().match(/firefox\\/(\\d+)/) != null) && parseInt(RegExp.$1, 10) >= 31) ||\n // Double check webkit in userAgent just in case we are in a worker\n (typeof navigator !== 'undefined' && navigator.userAgent?.toLowerCase().match(/applewebkit\\/(\\d+)/));\n}\n/**\n * Colorize log arguments if enabled.\n */\nfunction formatArgs(args) {\n args[0] = (this.useColors ? '%c' : '') +\n this.namespace +\n (this.useColors ? ' %c' : ' ') +\n args[0] +\n (this.useColors ? '%c ' : ' ') +\n '+' + humanize(this.diff);\n if (!this.useColors) {\n return;\n }\n const c = 'color: ' + this.color;\n args.splice(1, 0, c, 'color: inherit');\n // The final \"%c\" is somewhat tricky, because there could be other\n // arguments passed either before or after the %c, so we need to\n // figure out the correct index to insert the CSS into\n let index = 0;\n let lastC = 0;\n args[0].replace(/%[a-zA-Z%]/g, (match) => {\n if (match === '%%') {\n return;\n }\n index++;\n if (match === '%c') {\n // We only are interested in the *last* %c\n // (the user may have provided their own)\n lastC = index;\n }\n });\n args.splice(lastC, 0, c);\n}\n/**\n * Invokes `console.debug()` when available.\n * No-op when `console.debug` is not a \"function\".\n * If `console.debug` is not available, falls back\n * to `console.log`.\n */\nconst log = console.debug ?? console.log ?? (() => { });\n/**\n * Save `namespaces`.\n *\n * @param {string} namespaces\n */\nfunction save(namespaces) {\n try {\n if (namespaces) {\n storage?.setItem('debug', namespaces);\n }\n else {\n storage?.removeItem('debug');\n }\n }\n catch (error) {\n // Swallow\n // XXX (@Qix-) should we be logging these?\n }\n}\n/**\n * Load `namespaces`.\n *\n * @returns {string} returns the previously persisted debug modes\n */\nfunction load() {\n let r;\n try {\n r = storage?.getItem('debug');\n }\n catch (error) {\n // Swallow\n // XXX (@Qix-) should we be logging these?\n }\n // If debug isn't set in LS, and we're in Electron, try to load $DEBUG\n if (!r && typeof process !== 'undefined' && 'env' in process) {\n r = process.env.DEBUG;\n }\n return r;\n}\n/**\n * Localstorage attempts to return the localstorage.\n *\n * This is necessary because safari throws\n * when a user disables cookies/localstorage\n * and you attempt to access it.\n */\nfunction localstorage() {\n try {\n // TVMLKit (Apple TV JS Runtime) does not have a window object, just localStorage in the global context\n // The Browser also has localStorage in the global context.\n return localStorage;\n }\n catch (error) {\n // Swallow\n // XXX (@Qix-) should we be logging these?\n }\n}\nfunction setupFormatters(formatters) {\n /**\n * Map %j to `JSON.stringify()`, since no Web Inspectors do that by default.\n */\n formatters.j = function (v) {\n try {\n return JSON.stringify(v);\n }\n catch (error) {\n return '[UnexpectedJSONParseError]: ' + error.message;\n }\n };\n}\nexport default setup({ formatArgs, save, load, useColors, setupFormatters, colors, storage, log });\n//# sourceMappingURL=browser.js.map","/* eslint-disable no-console */\n/* eslint-disable @typescript-eslint/strict-boolean-expressions */\n/**\n * This is the common logic for both the Node.js and web browser\n * implementations of `debug()`.\n */\nimport humanize from 'ms';\nexport default function setup(env) {\n createDebug.debug = createDebug;\n createDebug.default = createDebug;\n createDebug.coerce = coerce;\n createDebug.disable = disable;\n createDebug.enable = enable;\n createDebug.enabled = enabled;\n createDebug.humanize = humanize;\n createDebug.destroy = destroy;\n Object.keys(env).forEach(key => {\n // @ts-expect-error cannot use string to index type\n createDebug[key] = env[key];\n });\n /**\n * The currently active debug mode names, and names to skip.\n */\n createDebug.names = [];\n createDebug.skips = [];\n /**\n * Map of special \"%n\" handling functions, for the debug \"format\" argument.\n *\n * Valid key names are a single, lower or upper-case letter, i.e. \"n\" and \"N\".\n */\n createDebug.formatters = {};\n /**\n * Selects a color for a debug namespace\n *\n * @param {string} namespace - The namespace string for the debug instance to be colored\n * @returns {number | string} An ANSI color code for the given namespace\n */\n function selectColor(namespace) {\n let hash = 0;\n for (let i = 0; i < namespace.length; i++) {\n hash = ((hash << 5) - hash) + namespace.charCodeAt(i);\n hash |= 0; // Convert to 32bit integer\n }\n // @ts-expect-error colors is not in the types\n return createDebug.colors[Math.abs(hash) % createDebug.colors.length];\n }\n createDebug.selectColor = selectColor;\n /**\n * Create a debugger with the given `namespace`.\n *\n * @param {string} namespace\n * @returns {Function}\n */\n function createDebug(namespace) {\n let prevTime;\n let enableOverride = null;\n let namespacesCache;\n let enabledCache;\n function debug(...args) {\n // Disabled?\n // @ts-expect-error enabled is not in the types\n if (!debug.enabled) {\n return;\n }\n const self = debug;\n // Set `diff` timestamp\n const curr = Number(new Date());\n const ms = curr - (prevTime || curr);\n self.diff = ms;\n self.prev = prevTime;\n self.curr = curr;\n prevTime = curr;\n args[0] = createDebug.coerce(args[0]);\n if (typeof args[0] !== 'string') {\n // Anything else let's inspect with %O\n args.unshift('%O');\n }\n // Apply any `formatters` transformations\n let index = 0;\n args[0] = args[0].replace(/%([a-zA-Z%])/g, (match, format) => {\n // If we encounter an escaped % then don't increase the array index\n if (match === '%%') {\n return '%';\n }\n index++;\n // @ts-expect-error formatters is not in the types\n const formatter = createDebug.formatters[format];\n if (typeof formatter === 'function') {\n const val = args[index];\n match = formatter.call(self, val);\n // Now we need to remove `args[index]` since it's inlined in the `format`\n args.splice(index, 1);\n index--;\n }\n return match;\n });\n // Apply env-specific formatting (colors, etc.)\n // @ts-expect-error formatArgs is not in the types\n createDebug.formatArgs.call(self, args);\n // @ts-expect-error log is not in the types\n const logFn = self.log || createDebug.log;\n logFn.apply(self, args);\n }\n debug.namespace = namespace;\n // @ts-expect-error useColors is not in the types\n debug.useColors = createDebug.useColors();\n debug.color = createDebug.selectColor(namespace);\n debug.extend = extend;\n debug.destroy = createDebug.destroy; // XXX Temporary. Will be removed in the next major release.\n Object.defineProperty(debug, 'enabled', {\n enumerable: true,\n configurable: false,\n get: () => {\n if (enableOverride !== null) {\n return enableOverride;\n }\n // @ts-expect-error namespaces is not in the types\n if (namespacesCache !== createDebug.namespaces) {\n // @ts-expect-error namespaces is not in the types\n namespacesCache = createDebug.namespaces;\n enabledCache = createDebug.enabled(namespace);\n }\n return enabledCache;\n },\n set: v => {\n enableOverride = v;\n }\n });\n // Env-specific initialization logic for debug instances\n // @ts-expect-error init is not in the types\n if (typeof createDebug.init === 'function') {\n // @ts-expect-error init is not in the types\n createDebug.init(debug);\n }\n // @ts-expect-error some properties are added dynamically\n return debug;\n }\n function extend(namespace, delimiter) {\n const newDebug = createDebug(this.namespace + (typeof delimiter === 'undefined' ? ':' : delimiter) + namespace);\n newDebug.log = this.log;\n return newDebug;\n }\n /**\n * Enables a debug mode by namespaces. This can include modes\n * separated by a colon and wildcards.\n *\n * @param {string} namespaces\n */\n function enable(namespaces) {\n // @ts-expect-error save is not in the types\n createDebug.save(namespaces);\n // @ts-expect-error namespaces is not in the types\n createDebug.namespaces = namespaces;\n createDebug.names = [];\n createDebug.skips = [];\n let i;\n const split = (typeof namespaces === 'string' ? namespaces : '').split(/[\\s,]+/);\n const len = split.length;\n for (i = 0; i < len; i++) {\n if (!split[i]) {\n // ignore empty strings\n continue;\n }\n namespaces = split[i].replace(/\\*/g, '.*?');\n if (namespaces[0] === '-') {\n createDebug.skips.push(new RegExp('^' + namespaces.substr(1) + '$'));\n }\n else {\n createDebug.names.push(new RegExp('^' + namespaces + '$'));\n }\n }\n }\n /**\n * Disable debug output.\n *\n * @returns {string} namespaces\n */\n function disable() {\n const namespaces = [\n ...createDebug.names.map(toNamespace),\n ...createDebug.skips.map(toNamespace).map(namespace => '-' + namespace)\n ].join(',');\n createDebug.enable('');\n return namespaces;\n }\n /**\n * Returns true if the given mode name is enabled, false otherwise.\n *\n * @param {string} name\n * @returns {boolean}\n */\n function enabled(name) {\n if (name[name.length - 1] === '*') {\n return true;\n }\n let i;\n let len;\n for (i = 0, len = createDebug.skips.length; i < len; i++) {\n if (createDebug.skips[i].test(name)) {\n return false;\n }\n }\n for (i = 0, len = createDebug.names.length; i < len; i++) {\n if (createDebug.names[i].test(name)) {\n return true;\n }\n }\n return false;\n }\n /**\n * Convert regexp to namespace\n */\n function toNamespace(regexp) {\n return regexp.toString()\n .substring(2, regexp.toString().length - 2)\n .replace(/\\.\\*\\?$/, '*');\n }\n /**\n * Coerce `val`.\n */\n function coerce(val) {\n if (val instanceof Error) {\n return val.stack ?? val.message;\n }\n return val;\n }\n /**\n * XXX DO NOT USE. This is a temporary stub function.\n * XXX It WILL be removed in the next major release.\n */\n function destroy() {\n console.warn('Instance method `debug.destroy()` is deprecated and no longer does anything. It will be removed in the next major version of `debug`.');\n }\n // @ts-expect-error setupFormatters is not in the types\n createDebug.setupFormatters(createDebug.formatters);\n // @ts-expect-error load is not in the types\n createDebug.enable(createDebug.load());\n // @ts-expect-error some properties are added dynamically\n return createDebug;\n}\n//# sourceMappingURL=common.js.map","/**\n * @packageDocumentation\n *\n * This module is a fork of the [debug](https://www.npmjs.com/package/debug) module. It has been converted to TypeScript and the output is ESM.\n *\n * It is API compatible with no extra features or bug fixes, it should only be used if you want a 100% ESM application.\n *\n * ESM should be arriving in `debug@5.x.x` so this module can be retired after that.\n *\n * Please see [debug](https://www.npmjs.com/package/debug) for API details.\n */\n/**\n * Module dependencies.\n */\nimport weald from './node.js';\nexport default weald;\n//# sourceMappingURL=index.js.map","/**\n * @packageDocumentation\n *\n * A logger for libp2p based on the venerable [debug](https://www.npmjs.com/package/debug) module.\n *\n * @example\n *\n * ```TypeScript\n * import { logger } from '@libp2p/logger'\n *\n * const log = logger('libp2p:my:component:name')\n *\n * try {\n * // an operation\n * log('something happened: %s', 'it was ok')\n * } catch (err) {\n * log.error('something bad happened: %o', err)\n * }\n *\n * log('with this peer: %p', {})\n * log('and this base58btc: %b', Uint8Array.from([0, 1, 2, 3]))\n * log('and this base32: %t', Uint8Array.from([4, 5, 6, 7]))\n * ```\n *\n * ```console\n * $ DEBUG=libp2p:* node index.js\n * something happened: it was ok\n * something bad happened: \n * with this peer: 12D3Foo\n * with this base58btc: Qmfoo\n * with this base32: bafyfoo\n * ```\n */\nimport { base32 } from 'multiformats/bases/base32';\nimport { base58btc } from 'multiformats/bases/base58';\nimport { base64 } from 'multiformats/bases/base64';\nimport debug from 'weald';\nimport { truncatePeerId } from './utils.js';\n// Add a formatter for converting to a base58 string\ndebug.formatters.b = (v) => {\n return v == null ? 'undefined' : base58btc.baseEncode(v);\n};\n// Add a formatter for converting to a base32 string\ndebug.formatters.t = (v) => {\n return v == null ? 'undefined' : base32.baseEncode(v);\n};\n// Add a formatter for converting to a base64 string\ndebug.formatters.m = (v) => {\n return v == null ? 'undefined' : base64.baseEncode(v);\n};\n// Add a formatter for stringifying peer ids\ndebug.formatters.p = (v) => {\n return v == null ? 'undefined' : v.toString();\n};\n// Add a formatter for stringifying CIDs\ndebug.formatters.c = (v) => {\n return v == null ? 'undefined' : v.toString();\n};\n// Add a formatter for stringifying Datastore keys\ndebug.formatters.k = (v) => {\n return v == null ? 'undefined' : v.toString();\n};\n// Add a formatter for stringifying Multiaddrs\ndebug.formatters.a = (v) => {\n return v == null ? 'undefined' : v.toString();\n};\nfunction createDisabledLogger(namespace) {\n const logger = () => { };\n logger.enabled = false;\n logger.color = '';\n logger.diff = 0;\n logger.log = () => { };\n logger.namespace = namespace;\n logger.destroy = () => true;\n logger.extend = () => logger;\n return logger;\n}\n/**\n * Create a component logger that will prefix any log messages with a truncated\n * peer id.\n *\n * @example\n *\n * ```TypeScript\n * import { peerLogger } from '@libp2p/logger'\n * import { peerIdFromString } from '@libp2p/peer-id'\n *\n * const peerId = peerIdFromString('12D3FooBar')\n * const logger = peerLogger(peerId)\n *\n * const log = logger.forComponent('my-component')\n * log.info('hello world')\n * // logs \"12…oBar:my-component hello world\"\n * ```\n */\nexport function peerLogger(peerId, options = {}) {\n return prefixLogger(truncatePeerId(peerId, options));\n}\n/**\n * Create a component logger that will prefix any log messages with the passed\n * string.\n *\n * @example\n *\n * ```TypeScript\n * import { prefixLogger } from '@libp2p/logger'\n *\n * const logger = prefixLogger('my-node')\n *\n * const log = logger.forComponent('my-component')\n * log.info('hello world')\n * // logs \"my-node:my-component hello world\"\n * ```\n */\nexport function prefixLogger(prefix) {\n return {\n forComponent(name) {\n return logger(`${prefix}:${name}`);\n }\n };\n}\n/**\n * Create a component logger\n *\n * @example\n *\n * ```TypeScript\n * import { defaultLogger } from '@libp2p/logger'\n * import { peerIdFromString } from '@libp2p/peer-id'\n *\n * const logger = defaultLogger()\n *\n * const log = logger.forComponent('my-component')\n * log.info('hello world')\n * // logs \"my-component hello world\"\n * ```\n */\nexport function defaultLogger() {\n return {\n forComponent(name) {\n return logger(name);\n }\n };\n}\n/**\n * Creates a logger for the passed component name.\n *\n * @example\n *\n * ```TypeScript\n * import { logger } from '@libp2p/logger'\n *\n * const log = logger('my-component')\n * log.info('hello world')\n * // logs \"my-component hello world\"\n * ```\n */\nexport function logger(name) {\n // trace logging is a no-op by default\n let trace = createDisabledLogger(`${name}:trace`);\n // look at all the debug names and see if trace logging has explicitly been enabled\n if (debug.enabled(`${name}:trace`) && debug.names.map((r) => r.toString()).find((n) => n.includes(':trace')) != null) {\n trace = debug(`${name}:trace`);\n }\n return Object.assign(debug(name), {\n error: debug(`${name}:error`),\n trace\n });\n}\nexport function disable() {\n debug.disable();\n}\nexport function enable(namespaces) {\n debug.enable(namespaces);\n}\nexport function enabled(namespaces) {\n return debug.enabled(namespaces);\n}\n//# sourceMappingURL=index.js.map","/**\n * Calls the passed map function on every entry of the passed iterable iterator\n */\nexport function mapIterable(iter, map) {\n const iterator = {\n [Symbol.iterator]: () => {\n return iterator;\n },\n next: () => {\n const next = iter.next();\n const val = next.value;\n if (next.done === true || val == null) {\n const result = {\n done: true,\n value: undefined\n };\n return result;\n }\n return {\n done: false,\n value: map(val)\n };\n }\n };\n return iterator;\n}\n//# sourceMappingURL=util.js.map","import { peerIdFromString } from '@libp2p/peer-id';\nimport { mapIterable } from './util.js';\n/**\n * We can't use PeerIds as set entries because set entries are\n * compared using same-value-zero equality, so this is just\n * a map that stringifies the PeerIds before storing them.\n *\n * PeerIds cache stringified versions of themselves so this\n * should be a cheap operation.\n *\n * @example\n *\n * ```TypeScript\n * import { peerSet } from '@libp2p/peer-collections'\n *\n * const set = peerSet()\n * set.add(peerId)\n * ```\n */\nexport class PeerSet {\n set;\n constructor(set) {\n this.set = new Set();\n if (set != null) {\n for (const key of set) {\n this.set.add(key.toString());\n }\n }\n }\n get size() {\n return this.set.size;\n }\n [Symbol.iterator]() {\n return this.values();\n }\n add(peer) {\n this.set.add(peer.toString());\n }\n clear() {\n this.set.clear();\n }\n delete(peer) {\n this.set.delete(peer.toString());\n }\n entries() {\n return mapIterable(this.set.entries(), (val) => {\n const peerId = peerIdFromString(val[0]);\n return [peerId, peerId];\n });\n }\n forEach(predicate) {\n this.set.forEach((str) => {\n const id = peerIdFromString(str);\n predicate(id, id, this);\n });\n }\n has(peer) {\n return this.set.has(peer.toString());\n }\n values() {\n return mapIterable(this.set.values(), (val) => {\n return peerIdFromString(val);\n });\n }\n intersection(other) {\n const output = new PeerSet();\n for (const peerId of other) {\n if (this.has(peerId)) {\n output.add(peerId);\n }\n }\n return output;\n }\n difference(other) {\n const output = new PeerSet();\n for (const peerId of this) {\n if (!other.has(peerId)) {\n output.add(peerId);\n }\n }\n return output;\n }\n union(other) {\n const output = new PeerSet();\n for (const peerId of other) {\n output.add(peerId);\n }\n for (const peerId of this) {\n output.add(peerId);\n }\n return output;\n }\n}\nexport function peerSet() {\n return new PeerSet();\n}\n//# sourceMappingURL=set.js.map","/**\n * @packageDocumentation\n *\n * Generate, import, and export PeerIDs.\n *\n * A Peer ID is the SHA-256 [multihash](https://github.com/multiformats/multihash) of a public key.\n *\n * The public key is a base64 encoded string of a protobuf containing an RSA DER buffer. This uses a node buffer to pass the base64 encoded public key protobuf to the multihash for ID generation.\n *\n * @example\n *\n * ```TypeScript\n * import { createEd25519PeerId } from '@libp2p/peer-id-factory'\n *\n * const peerId = await createEd25519PeerId()\n * console.log(peerId.toString())\n * ```\n *\n * ```bash\n * 12D3KooWRm8J3iL796zPFi2EtGGtUJn58AG67gcqzMFHZnnsTzqD\n * ```\n */\nimport { generateKeyPair, marshalPrivateKey, unmarshalPrivateKey, marshalPublicKey, unmarshalPublicKey } from '@libp2p/crypto/keys';\nimport { peerIdFromKeys, peerIdFromBytes } from '@libp2p/peer-id';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport { PeerIdProto } from './proto.js';\nexport const createEd25519PeerId = async () => {\n const key = await generateKeyPair('Ed25519');\n const id = await createFromPrivKey(key);\n if (id.type === 'Ed25519') {\n return id;\n }\n throw new Error(`Generated unexpected PeerId type \"${id.type}\"`);\n};\nexport const createSecp256k1PeerId = async () => {\n const key = await generateKeyPair('secp256k1');\n const id = await createFromPrivKey(key);\n if (id.type === 'secp256k1') {\n return id;\n }\n throw new Error(`Generated unexpected PeerId type \"${id.type}\"`);\n};\nexport const createRSAPeerId = async (opts) => {\n const key = await generateKeyPair('RSA', opts?.bits ?? 2048);\n const id = await createFromPrivKey(key);\n if (id.type === 'RSA') {\n return id;\n }\n throw new Error(`Generated unexpected PeerId type \"${id.type}\"`);\n};\nexport async function createFromPubKey(publicKey) {\n return peerIdFromKeys(marshalPublicKey(publicKey));\n}\nexport async function createFromPrivKey(privateKey) {\n return peerIdFromKeys(marshalPublicKey(privateKey.public), marshalPrivateKey(privateKey));\n}\nexport function exportToProtobuf(peerId, excludePrivateKey) {\n return PeerIdProto.encode({\n id: peerId.multihash.bytes,\n pubKey: peerId.publicKey,\n privKey: excludePrivateKey === true || peerId.privateKey == null ? undefined : peerId.privateKey\n });\n}\nexport async function createFromProtobuf(buf) {\n const { id, privKey, pubKey } = PeerIdProto.decode(buf);\n return createFromParts(id ?? new Uint8Array(0), privKey, pubKey);\n}\nexport async function createFromJSON(obj) {\n return createFromParts(uint8ArrayFromString(obj.id, 'base58btc'), obj.privKey != null ? uint8ArrayFromString(obj.privKey, 'base64pad') : undefined, obj.pubKey != null ? uint8ArrayFromString(obj.pubKey, 'base64pad') : undefined);\n}\nasync function createFromParts(multihash, privKey, pubKey) {\n if (privKey != null) {\n const key = await unmarshalPrivateKey(privKey);\n return createFromPrivKey(key);\n }\n else if (pubKey != null) {\n const key = unmarshalPublicKey(pubKey);\n return createFromPubKey(key);\n }\n const peerId = peerIdFromBytes(multihash);\n if (peerId.type !== 'Ed25519' && peerId.type !== 'secp256k1' && peerId.type !== 'RSA') {\n // should not be possible since `multihash` is derived from keys and these\n // are the cryptographic peer id types\n throw new Error('Supplied PeerID is invalid');\n }\n return peerId;\n}\n//# sourceMappingURL=index.js.map","import { peerIdFromString } from '@libp2p/peer-id';\nimport { mapIterable } from './util.js';\n/**\n * We can't use PeerIds as map keys because map keys are\n * compared using same-value-zero equality, so this is just\n * a map that stringifies the PeerIds before storing them.\n *\n * PeerIds cache stringified versions of themselves so this\n * should be a cheap operation.\n *\n * @example\n *\n * ```TypeScript\n * import { peerMap } from '@libp2p/peer-collections'\n *\n * const map = peerMap()\n * map.set(peerId, 'value')\n * ```\n */\nexport class PeerMap {\n map;\n constructor(map) {\n this.map = new Map();\n if (map != null) {\n for (const [key, value] of map.entries()) {\n this.map.set(key.toString(), value);\n }\n }\n }\n [Symbol.iterator]() {\n return this.entries();\n }\n clear() {\n this.map.clear();\n }\n delete(peer) {\n return this.map.delete(peer.toString());\n }\n entries() {\n return mapIterable(this.map.entries(), (val) => {\n return [peerIdFromString(val[0]), val[1]];\n });\n }\n forEach(fn) {\n this.map.forEach((value, key) => {\n fn(value, peerIdFromString(key), this);\n });\n }\n get(peer) {\n return this.map.get(peer.toString());\n }\n has(peer) {\n return this.map.has(peer.toString());\n }\n set(peer, value) {\n this.map.set(peer.toString(), value);\n }\n keys() {\n return mapIterable(this.map.keys(), (val) => {\n return peerIdFromString(val);\n });\n }\n values() {\n return this.map.values();\n }\n get size() {\n return this.map.size;\n }\n}\nexport function peerMap() {\n return new PeerMap();\n}\n//# sourceMappingURL=map.js.map","import lowerBound from './lower-bound.js';\nexport default class PriorityQueue {\n #queue = [];\n enqueue(run, options) {\n options = {\n priority: 0,\n ...options,\n };\n const element = {\n priority: options.priority,\n run,\n };\n if (this.size && this.#queue[this.size - 1].priority >= options.priority) {\n this.#queue.push(element);\n return;\n }\n const index = lowerBound(this.#queue, element, (a, b) => b.priority - a.priority);\n this.#queue.splice(index, 0, element);\n }\n dequeue() {\n const item = this.#queue.shift();\n return item?.run;\n }\n filter(options) {\n return this.#queue.filter((element) => element.priority === options.priority).map((element) => element.run);\n }\n get size() {\n return this.#queue.length;\n }\n}\n","// Port of lower_bound from https://en.cppreference.com/w/cpp/algorithm/lower_bound\n// Used to compute insertion index to keep queue sorted after insertion\nexport default function lowerBound(array, value, comparator) {\n let first = 0;\n let count = array.length;\n while (count > 0) {\n const step = Math.trunc(count / 2);\n let it = first + step;\n if (comparator(array[it], value) <= 0) {\n first = ++it;\n count -= step + 1;\n }\n else {\n count = step;\n }\n }\n return first;\n}\n","import { EventEmitter } from 'eventemitter3';\nimport pTimeout, { TimeoutError } from 'p-timeout';\nimport PriorityQueue from './priority-queue.js';\n/**\nPromise queue with concurrency control.\n*/\nexport default class PQueue extends EventEmitter {\n #carryoverConcurrencyCount;\n #isIntervalIgnored;\n #intervalCount = 0;\n #intervalCap;\n #interval;\n #intervalEnd = 0;\n #intervalId;\n #timeoutId;\n #queue;\n #queueClass;\n #pending = 0;\n // The `!` is needed because of https://github.com/microsoft/TypeScript/issues/32194\n #concurrency;\n #isPaused;\n #throwOnTimeout;\n /**\n Per-operation timeout in milliseconds. Operations fulfill once `timeout` elapses if they haven't already.\n\n Applies to each future operation.\n */\n timeout;\n // TODO: The `throwOnTimeout` option should affect the return types of `add()` and `addAll()`\n constructor(options) {\n super();\n // eslint-disable-next-line @typescript-eslint/consistent-type-assertions\n options = {\n carryoverConcurrencyCount: false,\n intervalCap: Number.POSITIVE_INFINITY,\n interval: 0,\n concurrency: Number.POSITIVE_INFINITY,\n autoStart: true,\n queueClass: PriorityQueue,\n ...options,\n };\n if (!(typeof options.intervalCap === 'number' && options.intervalCap >= 1)) {\n throw new TypeError(`Expected \\`intervalCap\\` to be a number from 1 and up, got \\`${options.intervalCap?.toString() ?? ''}\\` (${typeof options.intervalCap})`);\n }\n if (options.interval === undefined || !(Number.isFinite(options.interval) && options.interval >= 0)) {\n throw new TypeError(`Expected \\`interval\\` to be a finite number >= 0, got \\`${options.interval?.toString() ?? ''}\\` (${typeof options.interval})`);\n }\n this.#carryoverConcurrencyCount = options.carryoverConcurrencyCount;\n this.#isIntervalIgnored = options.intervalCap === Number.POSITIVE_INFINITY || options.interval === 0;\n this.#intervalCap = options.intervalCap;\n this.#interval = options.interval;\n this.#queue = new options.queueClass();\n this.#queueClass = options.queueClass;\n this.concurrency = options.concurrency;\n this.timeout = options.timeout;\n this.#throwOnTimeout = options.throwOnTimeout === true;\n this.#isPaused = options.autoStart === false;\n }\n get #doesIntervalAllowAnother() {\n return this.#isIntervalIgnored || this.#intervalCount < this.#intervalCap;\n }\n get #doesConcurrentAllowAnother() {\n return this.#pending < this.#concurrency;\n }\n #next() {\n this.#pending--;\n this.#tryToStartAnother();\n this.emit('next');\n }\n #onResumeInterval() {\n this.#onInterval();\n this.#initializeIntervalIfNeeded();\n this.#timeoutId = undefined;\n }\n get #isIntervalPaused() {\n const now = Date.now();\n if (this.#intervalId === undefined) {\n const delay = this.#intervalEnd - now;\n if (delay < 0) {\n // Act as the interval was done\n // We don't need to resume it here because it will be resumed on line 160\n this.#intervalCount = (this.#carryoverConcurrencyCount) ? this.#pending : 0;\n }\n else {\n // Act as the interval is pending\n if (this.#timeoutId === undefined) {\n this.#timeoutId = setTimeout(() => {\n this.#onResumeInterval();\n }, delay);\n }\n return true;\n }\n }\n return false;\n }\n #tryToStartAnother() {\n if (this.#queue.size === 0) {\n // We can clear the interval (\"pause\")\n // Because we can redo it later (\"resume\")\n if (this.#intervalId) {\n clearInterval(this.#intervalId);\n }\n this.#intervalId = undefined;\n this.emit('empty');\n if (this.#pending === 0) {\n this.emit('idle');\n }\n return false;\n }\n if (!this.#isPaused) {\n const canInitializeInterval = !this.#isIntervalPaused;\n if (this.#doesIntervalAllowAnother && this.#doesConcurrentAllowAnother) {\n const job = this.#queue.dequeue();\n if (!job) {\n return false;\n }\n this.emit('active');\n job();\n if (canInitializeInterval) {\n this.#initializeIntervalIfNeeded();\n }\n return true;\n }\n }\n return false;\n }\n #initializeIntervalIfNeeded() {\n if (this.#isIntervalIgnored || this.#intervalId !== undefined) {\n return;\n }\n this.#intervalId = setInterval(() => {\n this.#onInterval();\n }, this.#interval);\n this.#intervalEnd = Date.now() + this.#interval;\n }\n #onInterval() {\n if (this.#intervalCount === 0 && this.#pending === 0 && this.#intervalId) {\n clearInterval(this.#intervalId);\n this.#intervalId = undefined;\n }\n this.#intervalCount = this.#carryoverConcurrencyCount ? this.#pending : 0;\n this.#processQueue();\n }\n /**\n Executes all queued functions until it reaches the limit.\n */\n #processQueue() {\n // eslint-disable-next-line no-empty\n while (this.#tryToStartAnother()) { }\n }\n get concurrency() {\n return this.#concurrency;\n }\n set concurrency(newConcurrency) {\n if (!(typeof newConcurrency === 'number' && newConcurrency >= 1)) {\n throw new TypeError(`Expected \\`concurrency\\` to be a number from 1 and up, got \\`${newConcurrency}\\` (${typeof newConcurrency})`);\n }\n this.#concurrency = newConcurrency;\n this.#processQueue();\n }\n async #throwOnAbort(signal) {\n return new Promise((_resolve, reject) => {\n signal.addEventListener('abort', () => {\n reject(signal.reason);\n }, { once: true });\n });\n }\n async add(function_, options = {}) {\n options = {\n timeout: this.timeout,\n throwOnTimeout: this.#throwOnTimeout,\n ...options,\n };\n return new Promise((resolve, reject) => {\n this.#queue.enqueue(async () => {\n this.#pending++;\n this.#intervalCount++;\n try {\n options.signal?.throwIfAborted();\n let operation = function_({ signal: options.signal });\n if (options.timeout) {\n operation = pTimeout(Promise.resolve(operation), { milliseconds: options.timeout });\n }\n if (options.signal) {\n operation = Promise.race([operation, this.#throwOnAbort(options.signal)]);\n }\n const result = await operation;\n resolve(result);\n this.emit('completed', result);\n }\n catch (error) {\n if (error instanceof TimeoutError && !options.throwOnTimeout) {\n resolve();\n return;\n }\n reject(error);\n this.emit('error', error);\n }\n finally {\n this.#next();\n }\n }, options);\n this.emit('add');\n this.#tryToStartAnother();\n });\n }\n async addAll(functions, options) {\n return Promise.all(functions.map(async (function_) => this.add(function_, options)));\n }\n /**\n Start (or resume) executing enqueued tasks within concurrency limit. No need to call this if queue is not paused (via `options.autoStart = false` or by `.pause()` method.)\n */\n start() {\n if (!this.#isPaused) {\n return this;\n }\n this.#isPaused = false;\n this.#processQueue();\n return this;\n }\n /**\n Put queue execution on hold.\n */\n pause() {\n this.#isPaused = true;\n }\n /**\n Clear the queue.\n */\n clear() {\n this.#queue = new this.#queueClass();\n }\n /**\n Can be called multiple times. Useful if you for example add additional items at a later time.\n\n @returns A promise that settles when the queue becomes empty.\n */\n async onEmpty() {\n // Instantly resolve if the queue is empty\n if (this.#queue.size === 0) {\n return;\n }\n await this.#onEvent('empty');\n }\n /**\n @returns A promise that settles when the queue size is less than the given limit: `queue.size < limit`.\n\n If you want to avoid having the queue grow beyond a certain size you can `await queue.onSizeLessThan()` before adding a new item.\n\n Note that this only limits the number of items waiting to start. There could still be up to `concurrency` jobs already running that this call does not include in its calculation.\n */\n async onSizeLessThan(limit) {\n // Instantly resolve if the queue is empty.\n if (this.#queue.size < limit) {\n return;\n }\n await this.#onEvent('next', () => this.#queue.size < limit);\n }\n /**\n The difference with `.onEmpty` is that `.onIdle` guarantees that all work from the queue has finished. `.onEmpty` merely signals that the queue is empty, but it could mean that some promises haven't completed yet.\n\n @returns A promise that settles when the queue becomes empty, and all promises have completed; `queue.size === 0 && queue.pending === 0`.\n */\n async onIdle() {\n // Instantly resolve if none pending and if nothing else is queued\n if (this.#pending === 0 && this.#queue.size === 0) {\n return;\n }\n await this.#onEvent('idle');\n }\n async #onEvent(event, filter) {\n return new Promise(resolve => {\n const listener = () => {\n if (filter && !filter()) {\n return;\n }\n this.off(event, listener);\n resolve();\n };\n this.on(event, listener);\n });\n }\n /**\n Size of the queue, the number of queued items waiting to run.\n */\n get size() {\n return this.#queue.size;\n }\n /**\n Size of the queue, filtered by the given options.\n\n For example, this can be used to find the number of items remaining in the queue with a specific priority level.\n */\n sizeBy(options) {\n // eslint-disable-next-line unicorn/no-array-callback-reference\n return this.#queue.filter(options).length;\n }\n /**\n Number of running items (no longer in the queue).\n */\n get pending() {\n return this.#pending;\n }\n /**\n Whether the queue is currently paused.\n */\n get isPaused() {\n return this.#isPaused;\n }\n}\n","const events = {};\nconst observable = (worker) => {\n worker.addEventListener('message', (event) => {\n observable.dispatchEvent('message', worker, event);\n });\n if (worker.port != null) {\n worker.port.addEventListener('message', (event) => {\n observable.dispatchEvent('message', worker, event);\n });\n }\n};\nobservable.addEventListener = (type, fn) => {\n if (events[type] == null) {\n events[type] = [];\n }\n events[type].push(fn);\n};\nobservable.removeEventListener = (type, fn) => {\n if (events[type] == null) {\n return;\n }\n events[type] = events[type]\n .filter(listener => listener === fn);\n};\nobservable.dispatchEvent = function (type, worker, event) {\n if (events[type] == null) {\n return;\n }\n events[type].forEach(fn => fn(worker, event));\n};\nexport default observable;\n//# sourceMappingURL=index.js.map","export const WORKER_REQUEST_READ_LOCK = 'lock:worker:request-read';\nexport const WORKER_RELEASE_READ_LOCK = 'lock:worker:release-read';\nexport const MASTER_GRANT_READ_LOCK = 'lock:master:grant-read';\nexport const WORKER_REQUEST_WRITE_LOCK = 'lock:worker:request-write';\nexport const WORKER_RELEASE_WRITE_LOCK = 'lock:worker:release-write';\nexport const MASTER_GRANT_WRITE_LOCK = 'lock:master:grant-write';\n//# sourceMappingURL=constants.js.map","import observer from 'observable-webworkers';\nimport { WORKER_REQUEST_READ_LOCK, WORKER_RELEASE_READ_LOCK, MASTER_GRANT_READ_LOCK, WORKER_REQUEST_WRITE_LOCK, WORKER_RELEASE_WRITE_LOCK, MASTER_GRANT_WRITE_LOCK } from './constants.js';\nimport { nanoid } from './utils.js';\nconst handleWorkerLockRequest = (emitter, masterEvent, requestType, releaseType, grantType) => {\n return (worker, event) => {\n if (event.data.type !== requestType) {\n return;\n }\n const requestEvent = {\n type: event.data.type,\n name: event.data.name,\n identifier: event.data.identifier\n };\n emitter.dispatchEvent(new MessageEvent(masterEvent, {\n data: {\n name: requestEvent.name,\n handler: async () => {\n // grant lock to worker\n worker.postMessage({\n type: grantType,\n name: requestEvent.name,\n identifier: requestEvent.identifier\n });\n // wait for worker to finish\n await new Promise((resolve) => {\n const releaseEventListener = (event) => {\n if (event == null || event.data == null) {\n return;\n }\n const releaseEvent = {\n type: event.data.type,\n name: event.data.name,\n identifier: event.data.identifier\n };\n if (releaseEvent.type === releaseType && releaseEvent.identifier === requestEvent.identifier) {\n worker.removeEventListener('message', releaseEventListener);\n resolve();\n }\n };\n worker.addEventListener('message', releaseEventListener);\n });\n }\n }\n }));\n };\n};\nconst makeWorkerLockRequest = (name, requestType, grantType, releaseType) => {\n return async () => {\n const id = nanoid();\n globalThis.postMessage({\n type: requestType,\n identifier: id,\n name\n });\n return new Promise((resolve) => {\n const listener = (event) => {\n if (event == null || event.data == null) {\n return;\n }\n const responseEvent = {\n type: event.data.type,\n identifier: event.data.identifier\n };\n if (responseEvent.type === grantType && responseEvent.identifier === id) {\n globalThis.removeEventListener('message', listener);\n // grant lock\n resolve(() => {\n // release lock\n globalThis.postMessage({\n type: releaseType,\n identifier: id,\n name\n });\n });\n }\n };\n globalThis.addEventListener('message', listener);\n });\n };\n};\nconst defaultOptions = {\n singleProcess: false\n};\nexport default (options) => {\n options = Object.assign({}, defaultOptions, options);\n const isPrimary = Boolean(globalThis.document) || options.singleProcess;\n if (isPrimary) {\n const emitter = new EventTarget();\n observer.addEventListener('message', handleWorkerLockRequest(emitter, 'requestReadLock', WORKER_REQUEST_READ_LOCK, WORKER_RELEASE_READ_LOCK, MASTER_GRANT_READ_LOCK));\n observer.addEventListener('message', handleWorkerLockRequest(emitter, 'requestWriteLock', WORKER_REQUEST_WRITE_LOCK, WORKER_RELEASE_WRITE_LOCK, MASTER_GRANT_WRITE_LOCK));\n return emitter;\n }\n return {\n isWorker: true,\n readLock: (name) => makeWorkerLockRequest(name, WORKER_REQUEST_READ_LOCK, MASTER_GRANT_READ_LOCK, WORKER_RELEASE_READ_LOCK),\n writeLock: (name) => makeWorkerLockRequest(name, WORKER_REQUEST_WRITE_LOCK, MASTER_GRANT_WRITE_LOCK, WORKER_RELEASE_WRITE_LOCK)\n };\n};\n//# sourceMappingURL=browser.js.map","export const nanoid = (size = 21) => {\n return Math.random().toString().substring(2);\n};\n//# sourceMappingURL=utils.js.map","/**\n * @packageDocumentation\n *\n * - Reads occur concurrently\n * - Writes occur one at a time\n * - No reads occur while a write operation is in progress\n * - Locks can be created with different names\n * - Reads/writes can time out\n *\n * ## Usage\n *\n * ```javascript\n * import mortice from 'mortice'\n * import delay from 'delay'\n *\n * // the lock name & options objects are both optional\n * const mutex = mortice('my-lock', {\n *\n * // how long before write locks time out (default: 24 hours)\n * timeout: 30000,\n *\n * // control how many read operations are executed concurrently (default: Infinity)\n * concurrency: 5,\n *\n * // by default the the lock will be held on the main thread, set this to true if the\n * // a lock should reside on each worker (default: false)\n * singleProcess: false\n * })\n *\n * Promise.all([\n * (async () => {\n * const release = await mutex.readLock()\n *\n * try {\n * console.info('read 1')\n * } finally {\n * release()\n * }\n * })(),\n * (async () => {\n * const release = await mutex.readLock()\n *\n * try {\n * console.info('read 2')\n * } finally {\n * release()\n * }\n * })(),\n * (async () => {\n * const release = await mutex.writeLock()\n *\n * try {\n * await delay(1000)\n *\n * console.info('write 1')\n * } finally {\n * release()\n * }\n * })(),\n * (async () => {\n * const release = await mutex.readLock()\n *\n * try {\n * console.info('read 3')\n * } finally {\n * release()\n * }\n * })()\n * ])\n * ```\n *\n * read 1\n * read 2\n * \n * write 1\n * read 3\n *\n * ## Browser\n *\n * Because there's no global way to evesdrop on messages sent by Web Workers, please pass all created Web Workers to the [`observable-webworkers`](https://npmjs.org/package/observable-webworkers) module:\n *\n * ```javascript\n * // main.js\n * import mortice from 'mortice'\n * import observe from 'observable-webworkers'\n *\n * // create our lock on the main thread, it will be held here\n * const mutex = mortice()\n *\n * const worker = new Worker('worker.js')\n *\n * observe(worker)\n * ```\n *\n * ```javascript\n * // worker.js\n * import mortice from 'mortice'\n * import delay from 'delay'\n *\n * const mutex = mortice()\n *\n * let release = await mutex.readLock()\n * // read something\n * release()\n *\n * release = await mutex.writeLock()\n * // write something\n * release()\n * ```\n */\nimport PQueue from 'p-queue';\nimport pTimeout from 'p-timeout';\nimport impl from './node.js';\nconst mutexes = {};\nlet implementation;\nasync function createReleaseable(queue, options) {\n let res;\n const p = new Promise((resolve) => {\n res = resolve;\n });\n void queue.add(async () => pTimeout((async () => {\n await new Promise((resolve) => {\n res(() => {\n resolve();\n });\n });\n })(), {\n milliseconds: options.timeout\n }));\n return p;\n}\nconst createMutex = (name, options) => {\n if (implementation.isWorker === true) {\n return {\n readLock: implementation.readLock(name, options),\n writeLock: implementation.writeLock(name, options)\n };\n }\n const masterQueue = new PQueue({ concurrency: 1 });\n let readQueue;\n return {\n async readLock() {\n // If there's already a read queue, just add the task to it\n if (readQueue != null) {\n return createReleaseable(readQueue, options);\n }\n // Create a new read queue\n readQueue = new PQueue({\n concurrency: options.concurrency,\n autoStart: false\n });\n const localReadQueue = readQueue;\n // Add the task to the read queue\n const readPromise = createReleaseable(readQueue, options);\n void masterQueue.add(async () => {\n // Start the task only once the master queue has completed processing\n // any previous tasks\n localReadQueue.start();\n // Once all the tasks in the read queue have completed, remove it so\n // that the next read lock will occur after any write locks that were\n // started in the interim\n await localReadQueue.onIdle()\n .then(() => {\n if (readQueue === localReadQueue) {\n readQueue = null;\n }\n });\n });\n return readPromise;\n },\n async writeLock() {\n // Remove the read queue reference, so that any later read locks will be\n // added to a new queue that starts after this write lock has been\n // released\n readQueue = null;\n return createReleaseable(masterQueue, options);\n }\n };\n};\nconst defaultOptions = {\n name: 'lock',\n concurrency: Infinity,\n timeout: 84600000,\n singleProcess: false\n};\nexport default function createMortice(options) {\n const opts = Object.assign({}, defaultOptions, options);\n if (implementation == null) {\n implementation = impl(opts);\n if (implementation.isWorker !== true) {\n // we are master, set up worker requests\n implementation.addEventListener('requestReadLock', (event) => {\n if (mutexes[event.data.name] == null) {\n return;\n }\n void mutexes[event.data.name].readLock()\n .then(async (release) => event.data.handler().finally(() => { release(); }));\n });\n implementation.addEventListener('requestWriteLock', async (event) => {\n if (mutexes[event.data.name] == null) {\n return;\n }\n void mutexes[event.data.name].writeLock()\n .then(async (release) => event.data.handler().finally(() => { release(); }));\n });\n }\n }\n if (mutexes[opts.name] == null) {\n mutexes[opts.name] = createMutex(opts.name, opts);\n }\n return mutexes[opts.name];\n}\n//# sourceMappingURL=index.js.map","export const codes = {\n ERR_INVALID_PARAMETERS: 'ERR_INVALID_PARAMETERS'\n};\n//# sourceMappingURL=errors.js.map","/* eslint-disable import/export */\n/* eslint-disable complexity */\n/* eslint-disable @typescript-eslint/no-namespace */\n/* eslint-disable @typescript-eslint/no-unnecessary-boolean-literal-compare */\n/* eslint-disable @typescript-eslint/no-empty-interface */\nimport { encodeMessage, decodeMessage, message } from 'protons-runtime';\nexport var Peer;\n(function (Peer) {\n let Peer$metadataEntry;\n (function (Peer$metadataEntry) {\n let _codec;\n Peer$metadataEntry.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.key != null && obj.key !== '')) {\n w.uint32(10);\n w.string(obj.key);\n }\n if ((obj.value != null && obj.value.byteLength > 0)) {\n w.uint32(18);\n w.bytes(obj.value);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length) => {\n const obj = {\n key: '',\n value: new Uint8Array(0)\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1:\n obj.key = reader.string();\n break;\n case 2:\n obj.value = reader.bytes();\n break;\n default:\n reader.skipType(tag & 7);\n break;\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n Peer$metadataEntry.encode = (obj) => {\n return encodeMessage(obj, Peer$metadataEntry.codec());\n };\n Peer$metadataEntry.decode = (buf) => {\n return decodeMessage(buf, Peer$metadataEntry.codec());\n };\n })(Peer$metadataEntry = Peer.Peer$metadataEntry || (Peer.Peer$metadataEntry = {}));\n let Peer$tagsEntry;\n (function (Peer$tagsEntry) {\n let _codec;\n Peer$tagsEntry.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.key != null && obj.key !== '')) {\n w.uint32(10);\n w.string(obj.key);\n }\n if (obj.value != null) {\n w.uint32(18);\n Tag.codec().encode(obj.value, w);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length) => {\n const obj = {\n key: ''\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1:\n obj.key = reader.string();\n break;\n case 2:\n obj.value = Tag.codec().decode(reader, reader.uint32());\n break;\n default:\n reader.skipType(tag & 7);\n break;\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n Peer$tagsEntry.encode = (obj) => {\n return encodeMessage(obj, Peer$tagsEntry.codec());\n };\n Peer$tagsEntry.decode = (buf) => {\n return decodeMessage(buf, Peer$tagsEntry.codec());\n };\n })(Peer$tagsEntry = Peer.Peer$tagsEntry || (Peer.Peer$tagsEntry = {}));\n let _codec;\n Peer.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if (obj.addresses != null) {\n for (const value of obj.addresses) {\n w.uint32(10);\n Address.codec().encode(value, w);\n }\n }\n if (obj.protocols != null) {\n for (const value of obj.protocols) {\n w.uint32(18);\n w.string(value);\n }\n }\n if (obj.publicKey != null) {\n w.uint32(34);\n w.bytes(obj.publicKey);\n }\n if (obj.peerRecordEnvelope != null) {\n w.uint32(42);\n w.bytes(obj.peerRecordEnvelope);\n }\n if (obj.metadata != null && obj.metadata.size !== 0) {\n for (const [key, value] of obj.metadata.entries()) {\n w.uint32(50);\n Peer.Peer$metadataEntry.codec().encode({ key, value }, w);\n }\n }\n if (obj.tags != null && obj.tags.size !== 0) {\n for (const [key, value] of obj.tags.entries()) {\n w.uint32(58);\n Peer.Peer$tagsEntry.codec().encode({ key, value }, w);\n }\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length) => {\n const obj = {\n addresses: [],\n protocols: [],\n metadata: new Map(),\n tags: new Map()\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1:\n obj.addresses.push(Address.codec().decode(reader, reader.uint32()));\n break;\n case 2:\n obj.protocols.push(reader.string());\n break;\n case 4:\n obj.publicKey = reader.bytes();\n break;\n case 5:\n obj.peerRecordEnvelope = reader.bytes();\n break;\n case 6: {\n const entry = Peer.Peer$metadataEntry.codec().decode(reader, reader.uint32());\n obj.metadata.set(entry.key, entry.value);\n break;\n }\n case 7: {\n const entry = Peer.Peer$tagsEntry.codec().decode(reader, reader.uint32());\n obj.tags.set(entry.key, entry.value);\n break;\n }\n default:\n reader.skipType(tag & 7);\n break;\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n Peer.encode = (obj) => {\n return encodeMessage(obj, Peer.codec());\n };\n Peer.decode = (buf) => {\n return decodeMessage(buf, Peer.codec());\n };\n})(Peer || (Peer = {}));\nexport var Address;\n(function (Address) {\n let _codec;\n Address.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.multiaddr != null && obj.multiaddr.byteLength > 0)) {\n w.uint32(10);\n w.bytes(obj.multiaddr);\n }\n if (obj.isCertified != null) {\n w.uint32(16);\n w.bool(obj.isCertified);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length) => {\n const obj = {\n multiaddr: new Uint8Array(0)\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1:\n obj.multiaddr = reader.bytes();\n break;\n case 2:\n obj.isCertified = reader.bool();\n break;\n default:\n reader.skipType(tag & 7);\n break;\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n Address.encode = (obj) => {\n return encodeMessage(obj, Address.codec());\n };\n Address.decode = (buf) => {\n return decodeMessage(buf, Address.codec());\n };\n})(Address || (Address = {}));\nexport var Tag;\n(function (Tag) {\n let _codec;\n Tag.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.value != null && obj.value !== 0)) {\n w.uint32(8);\n w.uint32(obj.value);\n }\n if (obj.expiry != null) {\n w.uint32(16);\n w.uint64(obj.expiry);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length) => {\n const obj = {\n value: 0\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1:\n obj.value = reader.uint32();\n break;\n case 2:\n obj.expiry = reader.uint64();\n break;\n default:\n reader.skipType(tag & 7);\n break;\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n Tag.encode = (obj) => {\n return encodeMessage(obj, Tag.codec());\n };\n Tag.decode = (buf) => {\n return decodeMessage(buf, Tag.codec());\n };\n})(Tag || (Tag = {}));\n//# sourceMappingURL=peer.js.map","import { peerIdFromPeerId } from '@libp2p/peer-id';\nimport { multiaddr } from '@multiformats/multiaddr';\nimport { Peer as PeerPB } from '../pb/peer.js';\nexport function bytesToPeer(peerId, buf) {\n const peer = PeerPB.decode(buf);\n if (peer.publicKey != null && peerId.publicKey == null) {\n peerId = peerIdFromPeerId({\n ...peerId,\n publicKey: peerId.publicKey\n });\n }\n const tags = new Map();\n // remove any expired tags\n const now = BigInt(Date.now());\n for (const [key, tag] of peer.tags.entries()) {\n if (tag.expiry != null && tag.expiry < now) {\n continue;\n }\n tags.set(key, tag);\n }\n return {\n ...peer,\n id: peerId,\n addresses: peer.addresses.map(({ multiaddr: ma, isCertified }) => {\n return {\n multiaddr: multiaddr(ma),\n isCertified: isCertified ?? false\n };\n }),\n metadata: peer.metadata,\n peerRecordEnvelope: peer.peerRecordEnvelope ?? undefined,\n tags\n };\n}\n//# sourceMappingURL=bytes-to-peer.js.map","import { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport { toString as uint8ArrayToString } from 'uint8arrays/to-string';\nconst pathSepS = '/';\nconst pathSepB = new TextEncoder().encode(pathSepS);\nconst pathSep = pathSepB[0];\n/**\n * A Key represents the unique identifier of an object.\n * Our Key scheme is inspired by file systems and Google App Engine key model.\n * Keys are meant to be unique across a system. Keys are hierarchical,\n * incorporating more and more specific namespaces. Thus keys can be deemed\n * 'children' or 'ancestors' of other keys:\n * - `new Key('/Comedy')`\n * - `new Key('/Comedy/MontyPython')`\n * Also, every namespace can be parametrized to embed relevant object\n * information. For example, the Key `name` (most specific namespace) could\n * include the object type:\n * - `new Key('/Comedy/MontyPython/Actor:JohnCleese')`\n * - `new Key('/Comedy/MontyPython/Sketch:CheeseShop')`\n * - `new Key('/Comedy/MontyPython/Sketch:CheeseShop/Character:Mousebender')`\n *\n */\nexport class Key {\n _buf;\n /**\n * @param {string | Uint8Array} s\n * @param {boolean} [clean]\n */\n constructor(s, clean) {\n if (typeof s === 'string') {\n this._buf = uint8ArrayFromString(s);\n }\n else if (s instanceof Uint8Array) {\n this._buf = s;\n }\n else {\n throw new Error('Invalid key, should be String of Uint8Array');\n }\n if (clean == null) {\n clean = true;\n }\n if (clean) {\n this.clean();\n }\n if (this._buf.byteLength === 0 || this._buf[0] !== pathSep) {\n throw new Error('Invalid key');\n }\n }\n /**\n * Convert to the string representation\n *\n * @param {import('uint8arrays/to-string').SupportedEncodings} [encoding='utf8'] - The encoding to use.\n * @returns {string}\n */\n toString(encoding = 'utf8') {\n return uint8ArrayToString(this._buf, encoding);\n }\n /**\n * Return the Uint8Array representation of the key\n *\n * @returns {Uint8Array}\n */\n uint8Array() {\n return this._buf;\n }\n /**\n * Return string representation of the key\n *\n * @returns {string}\n */\n get [Symbol.toStringTag]() {\n return `Key(${this.toString()})`;\n }\n /**\n * Constructs a key out of a namespace array.\n *\n * @param {Array} list - The array of namespaces\n * @returns {Key}\n *\n * @example\n * ```js\n * Key.withNamespaces(['one', 'two'])\n * // => Key('/one/two')\n * ```\n */\n static withNamespaces(list) {\n return new Key(list.join(pathSepS));\n }\n /**\n * Returns a randomly (uuid) generated key.\n *\n * @returns {Key}\n *\n * @example\n * ```js\n * Key.random()\n * // => Key('/344502982398')\n * ```\n */\n static random() {\n return new Key(Math.random().toString().substring(2));\n }\n /**\n * @param {*} other\n */\n static asKey(other) {\n if (other instanceof Uint8Array || typeof other === 'string') {\n // we can create a key from this\n return new Key(other);\n }\n if (typeof other.uint8Array === 'function') {\n // this is an older version or may have crossed the esm/cjs boundary\n return new Key(other.uint8Array());\n }\n return null;\n }\n /**\n * Cleanup the current key\n *\n * @returns {void}\n */\n clean() {\n if (this._buf == null || this._buf.byteLength === 0) {\n this._buf = pathSepB;\n }\n if (this._buf[0] !== pathSep) {\n const bytes = new Uint8Array(this._buf.byteLength + 1);\n bytes.fill(pathSep, 0, 1);\n bytes.set(this._buf, 1);\n this._buf = bytes;\n }\n // normalize does not remove trailing slashes\n while (this._buf.byteLength > 1 && this._buf[this._buf.byteLength - 1] === pathSep) {\n this._buf = this._buf.subarray(0, -1);\n }\n }\n /**\n * Check if the given key is sorted lower than ourself.\n *\n * @param {Key} key - The other Key to check against\n * @returns {boolean}\n */\n less(key) {\n const list1 = this.list();\n const list2 = key.list();\n for (let i = 0; i < list1.length; i++) {\n if (list2.length < i + 1) {\n return false;\n }\n const c1 = list1[i];\n const c2 = list2[i];\n if (c1 < c2) {\n return true;\n }\n else if (c1 > c2) {\n return false;\n }\n }\n return list1.length < list2.length;\n }\n /**\n * Returns the key with all parts in reversed order.\n *\n * @returns {Key}\n *\n * @example\n * ```js\n * new Key('/Comedy/MontyPython/Actor:JohnCleese').reverse()\n * // => Key('/Actor:JohnCleese/MontyPython/Comedy')\n * ```\n */\n reverse() {\n return Key.withNamespaces(this.list().slice().reverse());\n }\n /**\n * Returns the `namespaces` making up this Key.\n *\n * @returns {Array}\n */\n namespaces() {\n return this.list();\n }\n /** Returns the \"base\" namespace of this key.\n *\n * @returns {string}\n *\n * @example\n * ```js\n * new Key('/Comedy/MontyPython/Actor:JohnCleese').baseNamespace()\n * // => 'Actor:JohnCleese'\n * ```\n */\n baseNamespace() {\n const ns = this.namespaces();\n return ns[ns.length - 1];\n }\n /**\n * Returns the `list` representation of this key.\n *\n * @returns {Array}\n *\n * @example\n * ```js\n * new Key('/Comedy/MontyPython/Actor:JohnCleese').list()\n * // => ['Comedy', 'MontyPythong', 'Actor:JohnCleese']\n * ```\n */\n list() {\n return this.toString().split(pathSepS).slice(1);\n }\n /**\n * Returns the \"type\" of this key (value of last namespace).\n *\n * @returns {string}\n *\n * @example\n * ```js\n * new Key('/Comedy/MontyPython/Actor:JohnCleese').type()\n * // => 'Actor'\n * ```\n */\n type() {\n return namespaceType(this.baseNamespace());\n }\n /**\n * Returns the \"name\" of this key (field of last namespace).\n *\n * @returns {string}\n *\n * @example\n * ```js\n * new Key('/Comedy/MontyPython/Actor:JohnCleese').name()\n * // => 'JohnCleese'\n * ```\n */\n name() {\n return namespaceValue(this.baseNamespace());\n }\n /**\n * Returns an \"instance\" of this type key (appends value to namespace).\n *\n * @param {string} s - The string to append.\n * @returns {Key}\n *\n * @example\n * ```js\n * new Key('/Comedy/MontyPython/Actor').instance('JohnClesse')\n * // => Key('/Comedy/MontyPython/Actor:JohnCleese')\n * ```\n */\n instance(s) {\n return new Key(this.toString() + ':' + s);\n }\n /**\n * Returns the \"path\" of this key (parent + type).\n *\n * @returns {Key}\n *\n * @example\n * ```js\n * new Key('/Comedy/MontyPython/Actor:JohnCleese').path()\n * // => Key('/Comedy/MontyPython/Actor')\n * ```\n */\n path() {\n let p = this.parent().toString();\n if (!p.endsWith(pathSepS)) {\n p += pathSepS;\n }\n p += this.type();\n return new Key(p);\n }\n /**\n * Returns the `parent` Key of this Key.\n *\n * @returns {Key}\n *\n * @example\n * ```js\n * new Key(\"/Comedy/MontyPython/Actor:JohnCleese\").parent()\n * // => Key(\"/Comedy/MontyPython\")\n * ```\n */\n parent() {\n const list = this.list();\n if (list.length === 1) {\n return new Key(pathSepS);\n }\n return new Key(list.slice(0, -1).join(pathSepS));\n }\n /**\n * Returns the `child` Key of this Key.\n *\n * @param {Key} key - The child Key to add\n * @returns {Key}\n *\n * @example\n * ```js\n * new Key('/Comedy/MontyPython').child(new Key('Actor:JohnCleese'))\n * // => Key('/Comedy/MontyPython/Actor:JohnCleese')\n * ```\n */\n child(key) {\n if (this.toString() === pathSepS) {\n return key;\n }\n else if (key.toString() === pathSepS) {\n return this;\n }\n return new Key(this.toString() + key.toString(), false);\n }\n /**\n * Returns whether this key is a prefix of `other`\n *\n * @param {Key} other - The other key to test against\n * @returns {boolean}\n *\n * @example\n * ```js\n * new Key('/Comedy').isAncestorOf('/Comedy/MontyPython')\n * // => true\n * ```\n */\n isAncestorOf(other) {\n if (other.toString() === this.toString()) {\n return false;\n }\n return other.toString().startsWith(this.toString());\n }\n /**\n * Returns whether this key is a contains another as prefix.\n *\n * @param {Key} other - The other Key to test against\n * @returns {boolean}\n *\n * @example\n * ```js\n * new Key('/Comedy/MontyPython').isDecendantOf('/Comedy')\n * // => true\n * ```\n */\n isDecendantOf(other) {\n if (other.toString() === this.toString()) {\n return false;\n }\n return this.toString().startsWith(other.toString());\n }\n /**\n * Checks if this key has only one namespace.\n *\n * @returns {boolean}\n */\n isTopLevel() {\n return this.list().length === 1;\n }\n /**\n * Concats one or more Keys into one new Key.\n *\n * @param {Array} keys - The array of keys to concatenate\n * @returns {Key}\n */\n concat(...keys) {\n return Key.withNamespaces([...this.namespaces(), ...flatten(keys.map(key => key.namespaces()))]);\n }\n}\n/**\n * The first component of a namespace. `foo` in `foo:bar`\n *\n * @param {string} ns\n * @returns {string}\n */\nfunction namespaceType(ns) {\n const parts = ns.split(':');\n if (parts.length < 2) {\n return '';\n }\n return parts.slice(0, -1).join(':');\n}\n/**\n * The last component of a namespace, `baz` in `foo:bar:baz`.\n *\n * @param {string} ns\n * @returns {string}\n */\nfunction namespaceValue(ns) {\n const parts = ns.split(':');\n return parts[parts.length - 1];\n}\n/**\n * Flatten array of arrays (only one level)\n *\n * @template T\n * @param {Array} arr\n * @returns {T[]}\n */\nfunction flatten(arr) {\n return ([]).concat(...arr);\n}\n//# sourceMappingURL=key.js.map","import { CodeError } from '@libp2p/interface';\nimport { isPeerId } from '@libp2p/interface';\nimport { Key } from 'interface-datastore/key';\nimport { codes } from '../errors.js';\nexport const NAMESPACE_COMMON = '/peers/';\nexport function peerIdToDatastoreKey(peerId) {\n if (!isPeerId(peerId) || peerId.type == null) {\n throw new CodeError('Invalid PeerId', codes.ERR_INVALID_PARAMETERS);\n }\n const b32key = peerId.toCID().toString();\n return new Key(`${NAMESPACE_COMMON}${b32key}`);\n}\n//# sourceMappingURL=peer-id-to-datastore-key.js.map","import { CodeError } from '@libp2p/interface';\nimport { isMultiaddr, multiaddr } from '@multiformats/multiaddr';\nimport { codes } from '../errors.js';\nexport async function dedupeFilterAndSortAddresses(peerId, filter, addresses) {\n const addressMap = new Map();\n for (const addr of addresses) {\n if (addr == null) {\n continue;\n }\n if (addr.multiaddr instanceof Uint8Array) {\n addr.multiaddr = multiaddr(addr.multiaddr);\n }\n if (!isMultiaddr(addr.multiaddr)) {\n throw new CodeError('Multiaddr was invalid', codes.ERR_INVALID_PARAMETERS);\n }\n if (!(await filter(peerId, addr.multiaddr))) {\n continue;\n }\n const isCertified = addr.isCertified ?? false;\n const maStr = addr.multiaddr.toString();\n const existingAddr = addressMap.get(maStr);\n if (existingAddr != null) {\n addr.isCertified = existingAddr.isCertified || isCertified;\n }\n else {\n addressMap.set(maStr, {\n multiaddr: addr.multiaddr,\n isCertified\n });\n }\n }\n return [...addressMap.values()]\n .sort((a, b) => {\n return a.multiaddr.toString().localeCompare(b.multiaddr.toString());\n })\n .map(({ isCertified, multiaddr }) => ({\n isCertified,\n multiaddr: multiaddr.bytes\n }));\n}\n//# sourceMappingURL=dedupe-addresses.js.map","import { CodeError } from '@libp2p/interface';\nimport { equals as uint8arrayEquals } from 'uint8arrays/equals';\nimport { codes } from '../errors.js';\nimport { dedupeFilterAndSortAddresses } from './dedupe-addresses.js';\nexport async function toPeerPB(peerId, data, strategy, options) {\n if (data == null) {\n throw new CodeError('Invalid PeerData', codes.ERR_INVALID_PARAMETERS);\n }\n if (data.publicKey != null && peerId.publicKey != null && !uint8arrayEquals(data.publicKey, peerId.publicKey)) {\n throw new CodeError('publicKey bytes do not match peer id publicKey bytes', codes.ERR_INVALID_PARAMETERS);\n }\n const existingPeer = options.existingPeer;\n if (existingPeer != null && !peerId.equals(existingPeer.id)) {\n throw new CodeError('peer id did not match existing peer id', codes.ERR_INVALID_PARAMETERS);\n }\n let addresses = existingPeer?.addresses ?? [];\n let protocols = new Set(existingPeer?.protocols ?? []);\n let metadata = existingPeer?.metadata ?? new Map();\n let tags = existingPeer?.tags ?? new Map();\n let peerRecordEnvelope = existingPeer?.peerRecordEnvelope;\n // when patching, we replace the original fields with passed values\n if (strategy === 'patch') {\n if (data.multiaddrs != null || data.addresses != null) {\n addresses = [];\n if (data.multiaddrs != null) {\n addresses.push(...data.multiaddrs.map(multiaddr => ({\n isCertified: false,\n multiaddr\n })));\n }\n if (data.addresses != null) {\n addresses.push(...data.addresses);\n }\n }\n if (data.protocols != null) {\n protocols = new Set(data.protocols);\n }\n if (data.metadata != null) {\n const metadataEntries = data.metadata instanceof Map ? [...data.metadata.entries()] : Object.entries(data.metadata);\n metadata = createSortedMap(metadataEntries, {\n validate: validateMetadata\n });\n }\n if (data.tags != null) {\n const tagsEntries = data.tags instanceof Map ? [...data.tags.entries()] : Object.entries(data.tags);\n tags = createSortedMap(tagsEntries, {\n validate: validateTag,\n map: mapTag\n });\n }\n if (data.peerRecordEnvelope != null) {\n peerRecordEnvelope = data.peerRecordEnvelope;\n }\n }\n // when merging, we join the original fields with passed values\n if (strategy === 'merge') {\n if (data.multiaddrs != null) {\n addresses.push(...data.multiaddrs.map(multiaddr => ({\n isCertified: false,\n multiaddr\n })));\n }\n if (data.addresses != null) {\n addresses.push(...data.addresses);\n }\n if (data.protocols != null) {\n protocols = new Set([...protocols, ...data.protocols]);\n }\n if (data.metadata != null) {\n const metadataEntries = data.metadata instanceof Map ? [...data.metadata.entries()] : Object.entries(data.metadata);\n for (const [key, value] of metadataEntries) {\n if (value == null) {\n metadata.delete(key);\n }\n else {\n metadata.set(key, value);\n }\n }\n metadata = createSortedMap([...metadata.entries()], {\n validate: validateMetadata\n });\n }\n if (data.tags != null) {\n const tagsEntries = data.tags instanceof Map ? [...data.tags.entries()] : Object.entries(data.tags);\n const mergedTags = new Map(tags);\n for (const [key, value] of tagsEntries) {\n if (value == null) {\n mergedTags.delete(key);\n }\n else {\n mergedTags.set(key, value);\n }\n }\n tags = createSortedMap([...mergedTags.entries()], {\n validate: validateTag,\n map: mapTag\n });\n }\n if (data.peerRecordEnvelope != null) {\n peerRecordEnvelope = data.peerRecordEnvelope;\n }\n }\n const output = {\n addresses: await dedupeFilterAndSortAddresses(peerId, options.addressFilter ?? (async () => true), addresses),\n protocols: [...protocols.values()].sort((a, b) => {\n return a.localeCompare(b);\n }),\n metadata,\n tags,\n publicKey: existingPeer?.id.publicKey ?? data.publicKey ?? peerId.publicKey,\n peerRecordEnvelope\n };\n // Ed25519 and secp256k1 have their public key embedded in them so no need to duplicate it\n if (peerId.type !== 'RSA') {\n delete output.publicKey;\n }\n return output;\n}\n/**\n * In JS maps are ordered by insertion order so create a new map with the\n * keys inserted in alphabetical order.\n */\nfunction createSortedMap(entries, options) {\n const output = new Map();\n for (const [key, value] of entries) {\n if (value == null) {\n continue;\n }\n options.validate(key, value);\n }\n for (const [key, value] of entries.sort(([a], [b]) => {\n return a.localeCompare(b);\n })) {\n if (value != null) {\n output.set(key, options.map?.(key, value) ?? value);\n }\n }\n return output;\n}\nfunction validateMetadata(key, value) {\n if (typeof key !== 'string') {\n throw new CodeError('Metadata key must be a string', codes.ERR_INVALID_PARAMETERS);\n }\n if (!(value instanceof Uint8Array)) {\n throw new CodeError('Metadata value must be a Uint8Array', codes.ERR_INVALID_PARAMETERS);\n }\n}\nfunction validateTag(key, tag) {\n if (typeof key !== 'string') {\n throw new CodeError('Tag name must be a string', codes.ERR_INVALID_PARAMETERS);\n }\n if (tag.value != null) {\n if (parseInt(`${tag.value}`, 10) !== tag.value) {\n throw new CodeError('Tag value must be an integer', codes.ERR_INVALID_PARAMETERS);\n }\n if (tag.value < 0 || tag.value > 100) {\n throw new CodeError('Tag value must be between 0-100', codes.ERR_INVALID_PARAMETERS);\n }\n }\n if (tag.ttl != null) {\n if (parseInt(`${tag.ttl}`, 10) !== tag.ttl) {\n throw new CodeError('Tag ttl must be an integer', codes.ERR_INVALID_PARAMETERS);\n }\n if (tag.ttl < 0) {\n throw new CodeError('Tag ttl must be between greater than 0', codes.ERR_INVALID_PARAMETERS);\n }\n }\n}\nfunction mapTag(key, tag) {\n let expiry;\n if (tag.expiry != null) {\n expiry = tag.expiry;\n }\n if (tag.ttl != null) {\n expiry = BigInt(Date.now() + Number(tag.ttl));\n }\n return {\n value: tag.value ?? 0,\n expiry\n };\n}\n//# sourceMappingURL=to-peer-pb.js.map","import { CodeError } from '@libp2p/interface';\nimport { PeerMap } from '@libp2p/peer-collections';\nimport { peerIdFromBytes } from '@libp2p/peer-id';\nimport mortice, {} from 'mortice';\nimport { base32 } from 'multiformats/bases/base32';\nimport { equals as uint8ArrayEquals } from 'uint8arrays/equals';\nimport { codes } from './errors.js';\nimport { Peer as PeerPB } from './pb/peer.js';\nimport { bytesToPeer } from './utils/bytes-to-peer.js';\nimport { NAMESPACE_COMMON, peerIdToDatastoreKey } from './utils/peer-id-to-datastore-key.js';\nimport { toPeerPB } from './utils/to-peer-pb.js';\nfunction decodePeer(key, value, cache) {\n // /peers/${peer-id-as-libp2p-key-cid-string-in-base-32}\n const base32Str = key.toString().split('/')[2];\n const buf = base32.decode(base32Str);\n const peerId = peerIdFromBytes(buf);\n const cached = cache.get(peerId);\n if (cached != null) {\n return cached;\n }\n const peer = bytesToPeer(peerId, value);\n cache.set(peerId, peer);\n return peer;\n}\nfunction mapQuery(query, cache) {\n if (query == null) {\n return {};\n }\n return {\n prefix: NAMESPACE_COMMON,\n filters: (query.filters ?? []).map(fn => ({ key, value }) => {\n return fn(decodePeer(key, value, cache));\n }),\n orders: (query.orders ?? []).map(fn => (a, b) => {\n return fn(decodePeer(a.key, a.value, cache), decodePeer(b.key, b.value, cache));\n })\n };\n}\nexport class PersistentStore {\n peerId;\n datastore;\n lock;\n addressFilter;\n constructor(components, init = {}) {\n this.peerId = components.peerId;\n this.datastore = components.datastore;\n this.addressFilter = init.addressFilter;\n this.lock = mortice({\n name: 'peer-store',\n singleProcess: true\n });\n }\n async has(peerId) {\n return this.datastore.has(peerIdToDatastoreKey(peerId));\n }\n async delete(peerId) {\n if (this.peerId.equals(peerId)) {\n throw new CodeError('Cannot delete self peer', codes.ERR_INVALID_PARAMETERS);\n }\n await this.datastore.delete(peerIdToDatastoreKey(peerId));\n }\n async load(peerId) {\n const buf = await this.datastore.get(peerIdToDatastoreKey(peerId));\n return bytesToPeer(peerId, buf);\n }\n async save(peerId, data) {\n const { existingBuf, existingPeer } = await this.#findExistingPeer(peerId);\n const peerPb = await toPeerPB(peerId, data, 'patch', {\n addressFilter: this.addressFilter\n });\n return this.#saveIfDifferent(peerId, peerPb, existingBuf, existingPeer);\n }\n async patch(peerId, data) {\n const { existingBuf, existingPeer } = await this.#findExistingPeer(peerId);\n const peerPb = await toPeerPB(peerId, data, 'patch', {\n addressFilter: this.addressFilter,\n existingPeer\n });\n return this.#saveIfDifferent(peerId, peerPb, existingBuf, existingPeer);\n }\n async merge(peerId, data) {\n const { existingBuf, existingPeer } = await this.#findExistingPeer(peerId);\n const peerPb = await toPeerPB(peerId, data, 'merge', {\n addressFilter: this.addressFilter,\n existingPeer\n });\n return this.#saveIfDifferent(peerId, peerPb, existingBuf, existingPeer);\n }\n async *all(query) {\n const peerCache = new PeerMap();\n for await (const { key, value } of this.datastore.query(mapQuery(query ?? {}, peerCache))) {\n const peer = decodePeer(key, value, peerCache);\n if (peer.id.equals(this.peerId)) {\n // Skip self peer if present\n continue;\n }\n yield peer;\n }\n }\n async #findExistingPeer(peerId) {\n try {\n const existingBuf = await this.datastore.get(peerIdToDatastoreKey(peerId));\n const existingPeer = bytesToPeer(peerId, existingBuf);\n return {\n existingBuf,\n existingPeer\n };\n }\n catch (err) {\n if (err.code !== 'ERR_NOT_FOUND') {\n throw err;\n }\n }\n return {};\n }\n async #saveIfDifferent(peerId, peer, existingBuf, existingPeer) {\n const buf = PeerPB.encode(peer);\n if (existingBuf != null && uint8ArrayEquals(buf, existingBuf)) {\n return {\n peer: bytesToPeer(peerId, buf),\n previous: existingPeer,\n updated: false\n };\n }\n await this.datastore.put(peerIdToDatastoreKey(peerId), buf);\n return {\n peer: bytesToPeer(peerId, buf),\n previous: existingPeer,\n updated: true\n };\n }\n}\n//# sourceMappingURL=store.js.map","/**\n * @packageDocumentation\n *\n * The peer store is where libp2p stores data about the peers it has encountered on the network.\n */\nimport { RecordEnvelope, PeerRecord } from '@libp2p/peer-record';\nimport all from 'it-all';\nimport { PersistentStore } from './store.js';\n/**\n * An implementation of PeerStore that stores data in a Datastore\n */\nexport class PersistentPeerStore {\n store;\n events;\n peerId;\n log;\n constructor(components, init = {}) {\n this.log = components.logger.forComponent('libp2p:peer-store');\n this.events = components.events;\n this.peerId = components.peerId;\n this.store = new PersistentStore(components, init);\n }\n [Symbol.toStringTag] = '@libp2p/peer-store';\n async forEach(fn, query) {\n this.log.trace('forEach await read lock');\n const release = await this.store.lock.readLock();\n this.log.trace('forEach got read lock');\n try {\n for await (const peer of this.store.all(query)) {\n fn(peer);\n }\n }\n finally {\n this.log.trace('forEach release read lock');\n release();\n }\n }\n async all(query) {\n this.log.trace('all await read lock');\n const release = await this.store.lock.readLock();\n this.log.trace('all got read lock');\n try {\n return await all(this.store.all(query));\n }\n finally {\n this.log.trace('all release read lock');\n release();\n }\n }\n async delete(peerId) {\n this.log.trace('delete await write lock');\n const release = await this.store.lock.writeLock();\n this.log.trace('delete got write lock');\n try {\n await this.store.delete(peerId);\n }\n finally {\n this.log.trace('delete release write lock');\n release();\n }\n }\n async has(peerId) {\n this.log.trace('has await read lock');\n const release = await this.store.lock.readLock();\n this.log.trace('has got read lock');\n try {\n return await this.store.has(peerId);\n }\n finally {\n this.log.trace('has release read lock');\n release();\n }\n }\n async get(peerId) {\n this.log.trace('get await read lock');\n const release = await this.store.lock.readLock();\n this.log.trace('get got read lock');\n try {\n return await this.store.load(peerId);\n }\n finally {\n this.log.trace('get release read lock');\n release();\n }\n }\n async save(id, data) {\n this.log.trace('save await write lock');\n const release = await this.store.lock.writeLock();\n this.log.trace('save got write lock');\n try {\n const result = await this.store.save(id, data);\n this.#emitIfUpdated(id, result);\n return result.peer;\n }\n finally {\n this.log.trace('save release write lock');\n release();\n }\n }\n async patch(id, data) {\n this.log.trace('patch await write lock');\n const release = await this.store.lock.writeLock();\n this.log.trace('patch got write lock');\n try {\n const result = await this.store.patch(id, data);\n this.#emitIfUpdated(id, result);\n return result.peer;\n }\n finally {\n this.log.trace('patch release write lock');\n release();\n }\n }\n async merge(id, data) {\n this.log.trace('merge await write lock');\n const release = await this.store.lock.writeLock();\n this.log.trace('merge got write lock');\n try {\n const result = await this.store.merge(id, data);\n this.#emitIfUpdated(id, result);\n return result.peer;\n }\n finally {\n this.log.trace('merge release write lock');\n release();\n }\n }\n async consumePeerRecord(buf, expectedPeer) {\n const envelope = await RecordEnvelope.openAndCertify(buf, PeerRecord.DOMAIN);\n if (expectedPeer?.equals(envelope.peerId) === false) {\n this.log('envelope peer id was not the expected peer id - expected: %p received: %p', expectedPeer, envelope.peerId);\n return false;\n }\n const peerRecord = PeerRecord.createFromProtobuf(envelope.payload);\n let peer;\n try {\n peer = await this.get(envelope.peerId);\n }\n catch (err) {\n if (err.code !== 'ERR_NOT_FOUND') {\n throw err;\n }\n }\n // ensure seq is greater than, or equal to, the last received\n if (peer?.peerRecordEnvelope != null) {\n const storedEnvelope = await RecordEnvelope.createFromProtobuf(peer.peerRecordEnvelope);\n const storedRecord = PeerRecord.createFromProtobuf(storedEnvelope.payload);\n if (storedRecord.seqNumber >= peerRecord.seqNumber) {\n this.log('sequence number was lower or equal to existing sequence number - stored: %d received: %d', storedRecord.seqNumber, peerRecord.seqNumber);\n return false;\n }\n }\n await this.patch(peerRecord.peerId, {\n peerRecordEnvelope: buf,\n addresses: peerRecord.multiaddrs.map(multiaddr => ({\n isCertified: true,\n multiaddr\n }))\n });\n return true;\n }\n #emitIfUpdated(id, result) {\n if (!result.updated) {\n return;\n }\n if (this.peerId.equals(id)) {\n this.events.safeDispatchEvent('self:peer:update', { detail: result });\n }\n else {\n this.events.safeDispatchEvent('peer:update', { detail: result });\n }\n }\n}\n//# sourceMappingURL=index.js.map","/**\n * @packageDocumentation\n *\n * Mostly useful for tests or when you want to be explicit about consuming an iterable without doing anything with any yielded values.\n *\n * @example\n *\n * ```javascript\n * import drain from 'it-drain'\n *\n * // This can also be an iterator, generator, etc\n * const values = [0, 1, 2, 3, 4]\n *\n * drain(values)\n * ```\n *\n * Async sources must be awaited:\n *\n * ```javascript\n * import drain from 'it-drain'\n *\n * const values = async function * {\n * yield * [0, 1, 2, 3, 4]\n * }\n *\n * await drain(values())\n * ```\n */\nfunction isAsyncIterable(thing) {\n return thing[Symbol.asyncIterator] != null;\n}\nfunction drain(source) {\n if (isAsyncIterable(source)) {\n return (async () => {\n for await (const _ of source) { } // eslint-disable-line no-unused-vars,no-empty,@typescript-eslint/no-unused-vars\n })();\n }\n else {\n for (const _ of source) { } // eslint-disable-line no-unused-vars,no-empty,@typescript-eslint/no-unused-vars\n }\n}\nexport default drain;\n//# sourceMappingURL=index.js.map","/**\n * @packageDocumentation\n *\n * Filter values out of an (async)iterable\n *\n * @example\n *\n * ```javascript\n * import all from 'it-all'\n * import filter from 'it-filter'\n *\n * // This can also be an iterator, generator, etc\n * const values = [0, 1, 2, 3, 4]\n *\n * const fn = (val, index) => val > 2 // Return boolean to keep item\n *\n * const arr = all(filter(values, fn))\n *\n * console.info(arr) // 3, 4\n * ```\n *\n * Async sources and filter functions must be awaited:\n *\n * ```javascript\n * import all from 'it-all'\n * import filter from 'it-filter'\n *\n * const values = async function * () {\n * yield * [0, 1, 2, 3, 4]\n * }\n *\n * const fn = async val => (val, index) > 2 // Return boolean or promise of boolean to keep item\n *\n * const arr = await all(filter(values, fn))\n *\n * console.info(arr) // 3, 4\n * ```\n */\nimport peek from 'it-peekable';\nfunction isAsyncIterable(thing) {\n return thing[Symbol.asyncIterator] != null;\n}\nfunction filter(source, fn) {\n let index = 0;\n if (isAsyncIterable(source)) {\n return (async function* () {\n for await (const entry of source) {\n if (await fn(entry, index++)) {\n yield entry;\n }\n }\n })();\n }\n // if mapping function returns a promise we have to return an async generator\n const peekable = peek(source);\n const { value, done } = peekable.next();\n if (done === true) {\n return (function* () { }());\n }\n const res = fn(value, index++);\n // @ts-expect-error .then is not present on O\n if (typeof res.then === 'function') {\n return (async function* () {\n if (await res) {\n yield value;\n }\n for await (const entry of peekable) {\n if (await fn(entry, index++)) {\n yield entry;\n }\n }\n })();\n }\n const func = fn;\n return (function* () {\n if (res === true) {\n yield value;\n }\n for (const entry of peekable) {\n if (func(entry, index++)) {\n yield entry;\n }\n }\n })();\n}\nexport default filter;\n//# sourceMappingURL=index.js.map","/**\n * @packageDocumentation\n *\n * Lets you look at the contents of an async iterator and decide what to do\n *\n * @example\n *\n * ```javascript\n * import peekable from 'it-peekable'\n *\n * // This can also be an iterator, generator, etc\n * const values = [0, 1, 2, 3, 4]\n *\n * const it = peekable(value)\n *\n * const first = it.peek()\n *\n * console.info(first) // 0\n *\n * it.push(first)\n *\n * console.info([...it])\n * // [ 0, 1, 2, 3, 4 ]\n * ```\n *\n * Async sources must be awaited:\n *\n * ```javascript\n * import peekable from 'it-peekable'\n *\n * const values = async function * () {\n * yield * [0, 1, 2, 3, 4]\n * }\n *\n * const it = peekable(values())\n *\n * const first = await it.peek()\n *\n * console.info(first) // 0\n *\n * it.push(first)\n *\n * console.info(await all(it))\n * // [ 0, 1, 2, 3, 4 ]\n * ```\n */\nfunction peekable(iterable) {\n // @ts-expect-error can't use Symbol.asyncIterator to index iterable since it might be Iterable\n const [iterator, symbol] = iterable[Symbol.asyncIterator] != null\n // @ts-expect-error can't use Symbol.asyncIterator to index iterable since it might be Iterable\n ? [iterable[Symbol.asyncIterator](), Symbol.asyncIterator]\n // @ts-expect-error can't use Symbol.iterator to index iterable since it might be AsyncIterable\n : [iterable[Symbol.iterator](), Symbol.iterator];\n const queue = [];\n // @ts-expect-error can't use symbol to index peekable\n return {\n peek: () => {\n return iterator.next();\n },\n push: (value) => {\n queue.push(value);\n },\n next: () => {\n if (queue.length > 0) {\n return {\n done: false,\n value: queue.shift()\n };\n }\n return iterator.next();\n },\n [symbol]() {\n return this;\n }\n };\n}\nexport default peekable;\n//# sourceMappingURL=index.js.map","/**\n * @packageDocumentation\n *\n * Consumes all values from an (async)iterable and returns them sorted by the passed sort function.\n *\n * @example\n *\n * ```javascript\n * import sort from 'it-sort'\n * import all from 'it-all'\n *\n * const sorter = (a, b) => {\n * return a.localeCompare(b)\n * }\n *\n * // This can also be an iterator, generator, etc\n * const values = ['foo', 'bar']\n *\n * const arr = all(sort(values, sorter))\n *\n * console.info(arr) // 'bar', 'foo'\n * ```\n *\n * Async sources must be awaited:\n *\n * ```javascript\n * import sort from 'it-sort'\n * import all from 'it-all'\n *\n * const sorter = (a, b) => {\n * return a.localeCompare(b)\n * }\n *\n * const values = async function * () {\n * yield * ['foo', 'bar']\n * }\n *\n * const arr = await all(sort(values, sorter))\n *\n * console.info(arr) // 'bar', 'foo'\n * ```\n */\nimport all from 'it-all';\nfunction isAsyncIterable(thing) {\n return thing[Symbol.asyncIterator] != null;\n}\nfunction sort(source, sorter) {\n if (isAsyncIterable(source)) {\n return (async function* () {\n const arr = await all(source);\n yield* arr.sort(sorter);\n })();\n }\n return (function* () {\n const arr = all(source);\n yield* arr.sort(sorter);\n })();\n}\nexport default sort;\n//# sourceMappingURL=index.js.map","/**\n * @packageDocumentation\n *\n * For when you only want a few values out of an (async)iterable.\n *\n * @example\n *\n * ```javascript\n * import take from 'it-take'\n * import all from 'it-all'\n *\n * // This can also be an iterator, generator, etc\n * const values = [0, 1, 2, 3, 4]\n *\n * const arr = all(take(values, 2))\n *\n * console.info(arr) // 0, 1\n * ```\n *\n * Async sources must be awaited:\n *\n * ```javascript\n * import take from 'it-take'\n * import all from 'it-all'\n *\n * const values = async function * () {\n * yield * [0, 1, 2, 3, 4]\n * }\n *\n * const arr = await all(take(values(), 2))\n *\n * console.info(arr) // 0, 1\n * ```\n */\nfunction isAsyncIterable(thing) {\n return thing[Symbol.asyncIterator] != null;\n}\nfunction take(source, limit) {\n if (isAsyncIterable(source)) {\n return (async function* () {\n let items = 0;\n if (limit < 1) {\n return;\n }\n for await (const entry of source) {\n yield entry;\n items++;\n if (items === limit) {\n return;\n }\n }\n })();\n }\n return (function* () {\n let items = 0;\n if (limit < 1) {\n return;\n }\n for (const entry of source) {\n yield entry;\n items++;\n if (items === limit) {\n return;\n }\n }\n })();\n}\nexport default take;\n//# sourceMappingURL=index.js.map","import drain from 'it-drain';\nimport filter from 'it-filter';\nimport sort from 'it-sort';\nimport take from 'it-take';\nexport class BaseDatastore {\n put(key, val, options) {\n return Promise.reject(new Error('.put is not implemented'));\n }\n get(key, options) {\n return Promise.reject(new Error('.get is not implemented'));\n }\n has(key, options) {\n return Promise.reject(new Error('.has is not implemented'));\n }\n delete(key, options) {\n return Promise.reject(new Error('.delete is not implemented'));\n }\n async *putMany(source, options = {}) {\n for await (const { key, value } of source) {\n await this.put(key, value, options);\n yield key;\n }\n }\n async *getMany(source, options = {}) {\n for await (const key of source) {\n yield {\n key,\n value: await this.get(key, options)\n };\n }\n }\n async *deleteMany(source, options = {}) {\n for await (const key of source) {\n await this.delete(key, options);\n yield key;\n }\n }\n batch() {\n let puts = [];\n let dels = [];\n return {\n put(key, value) {\n puts.push({ key, value });\n },\n delete(key) {\n dels.push(key);\n },\n commit: async (options) => {\n await drain(this.putMany(puts, options));\n puts = [];\n await drain(this.deleteMany(dels, options));\n dels = [];\n }\n };\n }\n /**\n * Extending classes should override `query` or implement this method\n */\n // eslint-disable-next-line require-yield\n async *_all(q, options) {\n throw new Error('._all is not implemented');\n }\n /**\n * Extending classes should override `queryKeys` or implement this method\n */\n // eslint-disable-next-line require-yield\n async *_allKeys(q, options) {\n throw new Error('._allKeys is not implemented');\n }\n query(q, options) {\n let it = this._all(q, options);\n if (q.prefix != null) {\n const prefix = q.prefix;\n it = filter(it, (e) => e.key.toString().startsWith(prefix));\n }\n if (Array.isArray(q.filters)) {\n it = q.filters.reduce((it, f) => filter(it, f), it);\n }\n if (Array.isArray(q.orders)) {\n it = q.orders.reduce((it, f) => sort(it, f), it);\n }\n if (q.offset != null) {\n let i = 0;\n const offset = q.offset;\n it = filter(it, () => i++ >= offset);\n }\n if (q.limit != null) {\n it = take(it, q.limit);\n }\n return it;\n }\n queryKeys(q, options) {\n let it = this._allKeys(q, options);\n if (q.prefix != null) {\n const prefix = q.prefix;\n it = filter(it, (key) => key.toString().startsWith(prefix));\n }\n if (Array.isArray(q.filters)) {\n it = q.filters.reduce((it, f) => filter(it, f), it);\n }\n if (Array.isArray(q.orders)) {\n it = q.orders.reduce((it, f) => sort(it, f), it);\n }\n if (q.offset != null) {\n const offset = q.offset;\n let i = 0;\n it = filter(it, () => i++ >= offset);\n }\n if (q.limit != null) {\n it = take(it, q.limit);\n }\n return it;\n }\n}\n//# sourceMappingURL=base.js.map","import { Key } from 'interface-datastore/key';\nimport { BaseDatastore } from './base.js';\nimport * as Errors from './errors.js';\nexport class MemoryDatastore extends BaseDatastore {\n data;\n constructor() {\n super();\n this.data = new Map();\n }\n put(key, val) {\n this.data.set(key.toString(), val);\n return key;\n }\n get(key) {\n const result = this.data.get(key.toString());\n if (result == null) {\n throw Errors.notFoundError();\n }\n return result;\n }\n has(key) {\n return this.data.has(key.toString());\n }\n delete(key) {\n this.data.delete(key.toString());\n }\n *_all() {\n for (const [key, value] of this.data.entries()) {\n yield { key: new Key(key), value };\n }\n }\n *_allKeys() {\n for (const key of this.data.keys()) {\n yield new Key(key);\n }\n }\n}\n//# sourceMappingURL=memory.js.map","import errCode from 'err-code';\nexport function dbOpenFailedError(err) {\n err = err ?? new Error('Cannot open database');\n return errCode(err, 'ERR_DB_OPEN_FAILED');\n}\nexport function dbDeleteFailedError(err) {\n err = err ?? new Error('Delete failed');\n return errCode(err, 'ERR_DB_DELETE_FAILED');\n}\nexport function dbWriteFailedError(err) {\n err = err ?? new Error('Write failed');\n return errCode(err, 'ERR_DB_WRITE_FAILED');\n}\nexport function dbReadFailedError(err) {\n err = err ?? new Error('Read failed');\n return errCode(err, 'ERR_DB_READ_FAILED');\n}\nexport function notFoundError(err) {\n err = err ?? new Error('Not Found');\n return errCode(err, 'ERR_NOT_FOUND');\n}\nexport function abortedError(err) {\n err = err ?? new Error('Aborted');\n return errCode(err, 'ERR_ABORTED');\n}\n//# sourceMappingURL=errors.js.map","import { peerIdFromString } from '@libp2p/peer-id';\nimport { multiaddr } from '@multiformats/multiaddr';\nimport { debounce } from './utils.js';\nconst defaultAddressFilter = (addrs) => addrs;\n/**\n * If the passed multiaddr contains the passed peer id, remove it\n */\nfunction stripPeerId(ma, peerId) {\n const observedPeerIdStr = ma.getPeerId();\n // strip our peer id if it has been passed\n if (observedPeerIdStr != null) {\n const observedPeerId = peerIdFromString(observedPeerIdStr);\n // use same encoding for comparison\n if (observedPeerId.equals(peerId)) {\n ma = ma.decapsulate(multiaddr(`/p2p/${peerId.toString()}`));\n }\n }\n return ma;\n}\nexport class DefaultAddressManager {\n log;\n components;\n // this is an array to allow for duplicates, e.g. multiples of `/ip4/0.0.0.0/tcp/0`\n listen;\n announce;\n observed;\n announceFilter;\n /**\n * Responsible for managing the peer addresses.\n * Peers can specify their listen and announce addresses.\n * The listen addresses will be used by the libp2p transports to listen for new connections,\n * while the announce addresses will be used for the peer addresses' to other peers in the network.\n */\n constructor(components, init = {}) {\n const { listen = [], announce = [] } = init;\n this.components = components;\n this.log = components.logger.forComponent('libp2p:address-manager');\n this.listen = listen.map(ma => ma.toString());\n this.announce = new Set(announce.map(ma => ma.toString()));\n this.observed = new Map();\n this.announceFilter = init.announceFilter ?? defaultAddressFilter;\n // this method gets called repeatedly on startup when transports start listening so\n // debounce it so we don't cause multiple self:peer:update events to be emitted\n this._updatePeerStoreAddresses = debounce(this._updatePeerStoreAddresses.bind(this), 1000);\n // update our stored addresses when new transports listen\n components.events.addEventListener('transport:listening', () => {\n this._updatePeerStoreAddresses();\n });\n // update our stored addresses when existing transports stop listening\n components.events.addEventListener('transport:close', () => {\n this._updatePeerStoreAddresses();\n });\n }\n [Symbol.toStringTag] = '@libp2p/address-manager';\n _updatePeerStoreAddresses() {\n // if announce addresses have been configured, ensure they make it into our peer\n // record for things like identify\n const addrs = this.getAnnounceAddrs()\n .concat(this.components.transportManager.getAddrs())\n .concat([...this.observed.entries()]\n .filter(([_, metadata]) => metadata.confident)\n .map(([str]) => multiaddr(str))).map(ma => {\n // strip our peer id if it is present\n if (ma.getPeerId() === this.components.peerId.toString()) {\n return ma.decapsulate(`/p2p/${this.components.peerId.toString()}`);\n }\n return ma;\n });\n this.components.peerStore.patch(this.components.peerId, {\n multiaddrs: addrs\n })\n .catch(err => { this.log.error('error updating addresses', err); });\n }\n /**\n * Get peer listen multiaddrs\n */\n getListenAddrs() {\n return Array.from(this.listen).map((a) => multiaddr(a));\n }\n /**\n * Get peer announcing multiaddrs\n */\n getAnnounceAddrs() {\n return Array.from(this.announce).map((a) => multiaddr(a));\n }\n /**\n * Get observed multiaddrs\n */\n getObservedAddrs() {\n return Array.from(this.observed).map(([a]) => multiaddr(a));\n }\n /**\n * Add peer observed addresses\n */\n addObservedAddr(addr) {\n addr = stripPeerId(addr, this.components.peerId);\n const addrString = addr.toString();\n // do not trigger the change:addresses event if we already know about this address\n if (this.observed.has(addrString)) {\n return;\n }\n this.observed.set(addrString, {\n confident: false\n });\n }\n confirmObservedAddr(addr) {\n addr = stripPeerId(addr, this.components.peerId);\n const addrString = addr.toString();\n const metadata = this.observed.get(addrString) ?? {\n confident: false\n };\n const startingConfidence = metadata.confident;\n this.observed.set(addrString, {\n confident: true\n });\n // only trigger the 'self:peer:update' event if our confidence in an address has changed\n if (!startingConfidence) {\n this._updatePeerStoreAddresses();\n }\n }\n removeObservedAddr(addr) {\n addr = stripPeerId(addr, this.components.peerId);\n const addrString = addr.toString();\n this.observed.delete(addrString);\n }\n getAddresses() {\n let addrs = this.getAnnounceAddrs().map(ma => ma.toString());\n if (addrs.length === 0) {\n // no configured announce addrs, add configured listen addresses\n addrs = this.components.transportManager.getAddrs().map(ma => ma.toString());\n }\n // add observed addresses we are confident in\n addrs = addrs.concat(Array.from(this.observed)\n .filter(([ma, metadata]) => metadata.confident)\n .map(([ma]) => ma));\n // dedupe multiaddrs\n const addrSet = new Set(addrs);\n // Create advertising list\n return this.announceFilter(Array.from(addrSet)\n .map(str => multiaddr(str)))\n .map(ma => {\n // do not append our peer id to a path multiaddr as it will become invalid\n if (ma.protos().pop()?.path === true) {\n return ma;\n }\n if (ma.getPeerId() === this.components.peerId.toString()) {\n return ma;\n }\n return ma.encapsulate(`/p2p/${this.components.peerId.toString()}`);\n });\n }\n}\n//# sourceMappingURL=index.js.map","export function debounce(func, wait) {\n let timeout;\n return function () {\n const later = function () {\n timeout = undefined;\n func();\n };\n clearTimeout(timeout);\n timeout = setTimeout(later, wait);\n };\n}\n//# sourceMappingURL=utils.js.map","import { CodeError, serviceCapabilities, serviceDependencies } from '@libp2p/interface';\nimport { isStartable } from '@libp2p/interface';\nimport { defaultLogger } from '@libp2p/logger';\nclass DefaultComponents {\n components = {};\n _started = false;\n constructor(init = {}) {\n this.components = {};\n for (const [key, value] of Object.entries(init)) {\n this.components[key] = value;\n }\n if (this.components.logger == null) {\n this.components.logger = defaultLogger();\n }\n }\n isStarted() {\n return this._started;\n }\n async _invokeStartableMethod(methodName) {\n await Promise.all(Object.values(this.components)\n .filter(obj => isStartable(obj))\n .map(async (startable) => {\n await startable[methodName]?.();\n }));\n }\n async beforeStart() {\n await this._invokeStartableMethod('beforeStart');\n }\n async start() {\n await this._invokeStartableMethod('start');\n this._started = true;\n }\n async afterStart() {\n await this._invokeStartableMethod('afterStart');\n }\n async beforeStop() {\n await this._invokeStartableMethod('beforeStop');\n }\n async stop() {\n await this._invokeStartableMethod('stop');\n this._started = false;\n }\n async afterStop() {\n await this._invokeStartableMethod('afterStop');\n }\n}\nconst OPTIONAL_SERVICES = [\n 'metrics',\n 'connectionProtector',\n 'dns'\n];\nconst NON_SERVICE_PROPERTIES = [\n 'components',\n 'isStarted',\n 'beforeStart',\n 'start',\n 'afterStart',\n 'beforeStop',\n 'stop',\n 'afterStop',\n 'then',\n '_invokeStartableMethod'\n];\nexport function defaultComponents(init = {}) {\n const components = new DefaultComponents(init);\n const proxy = new Proxy(components, {\n get(target, prop, receiver) {\n if (typeof prop === 'string' && !NON_SERVICE_PROPERTIES.includes(prop)) {\n const service = components.components[prop];\n if (service == null && !OPTIONAL_SERVICES.includes(prop)) {\n throw new CodeError(`${prop} not set`, 'ERR_SERVICE_MISSING');\n }\n return service;\n }\n return Reflect.get(target, prop, receiver);\n },\n set(target, prop, value) {\n if (typeof prop === 'string') {\n components.components[prop] = value;\n }\n else {\n Reflect.set(target, prop, value);\n }\n return true;\n }\n });\n // @ts-expect-error component keys are proxied\n return proxy;\n}\nexport function checkServiceDependencies(components) {\n const serviceCapabilities = {};\n for (const service of Object.values(components.components)) {\n for (const capability of getServiceCapabilities(service)) {\n serviceCapabilities[capability] = true;\n }\n }\n for (const service of Object.values(components.components)) {\n for (const capability of getServiceDependencies(service)) {\n if (serviceCapabilities[capability] !== true) {\n throw new CodeError(`Service \"${getServiceName(service)}\" required capability \"${capability}\" but it was not provided by any component, you may need to add additional configuration when creating your node.`, 'ERR_UNMET_SERVICE_DEPENDENCIES');\n }\n }\n }\n}\nfunction getServiceCapabilities(service) {\n if (Array.isArray(service?.[serviceCapabilities])) {\n return service[serviceCapabilities];\n }\n return [];\n}\nfunction getServiceDependencies(service) {\n if (Array.isArray(service?.[serviceDependencies])) {\n return service[serviceDependencies];\n }\n return [];\n}\nfunction getServiceName(service) {\n return service?.[Symbol.toStringTag] ?? service?.toString() ?? 'unknown';\n}\n//# sourceMappingURL=components.js.map","export function isStartable(obj) {\n return obj != null && typeof obj.start === 'function' && typeof obj.stop === 'function';\n}\nexport async function start(...objs) {\n const startables = [];\n for (const obj of objs) {\n if (isStartable(obj)) {\n startables.push(obj);\n }\n }\n await Promise.all(startables.map(async (s) => {\n if (s.beforeStart != null) {\n await s.beforeStart();\n }\n }));\n await Promise.all(startables.map(async (s) => {\n await s.start();\n }));\n await Promise.all(startables.map(async (s) => {\n if (s.afterStart != null) {\n await s.afterStart();\n }\n }));\n}\nexport async function stop(...objs) {\n const startables = [];\n for (const obj of objs) {\n if (isStartable(obj)) {\n startables.push(obj);\n }\n }\n await Promise.all(startables.map(async (s) => {\n if (s.beforeStop != null) {\n await s.beforeStop();\n }\n }));\n await Promise.all(startables.map(async (s) => {\n await s.stop();\n }));\n await Promise.all(startables.map(async (s) => {\n if (s.afterStop != null) {\n await s.afterStop();\n }\n }));\n}\n//# sourceMappingURL=startable.js.map","import { isIPv4, isIPv6 } from '@chainsafe/is-ip';\nimport { Netmask } from 'netmask';\nconst PRIVATE_IP_RANGES = [\n '0.0.0.0/8',\n '10.0.0.0/8',\n '100.64.0.0/10',\n '127.0.0.0/8',\n '169.254.0.0/16',\n '172.16.0.0/12',\n '192.0.0.0/24',\n '192.0.0.0/29',\n '192.0.0.8/32',\n '192.0.0.9/32',\n '192.0.0.10/32',\n '192.0.0.170/32',\n '192.0.0.171/32',\n '192.0.2.0/24',\n '192.31.196.0/24',\n '192.52.193.0/24',\n '192.88.99.0/24',\n '192.168.0.0/16',\n '192.175.48.0/24',\n '198.18.0.0/15',\n '198.51.100.0/24',\n '203.0.113.0/24',\n '240.0.0.0/4',\n '255.255.255.255/32'\n];\nconst NETMASK_RANGES = PRIVATE_IP_RANGES.map(ipRange => new Netmask(ipRange));\nfunction ipv4Check(ipAddr) {\n for (const r of NETMASK_RANGES) {\n if (r.contains(ipAddr))\n return true;\n }\n return false;\n}\nfunction isIpv4MappedIpv6(ipAddr) {\n return /^::ffff:([0-9a-fA-F]{1,4}):([0-9a-fA-F]{1,4})$/.test(ipAddr);\n}\n/**\n * @see https://datatracker.ietf.org/doc/html/rfc4291#section-2.5.5.2\n */\nfunction ipv4MappedIpv6Check(ipAddr) {\n const parts = ipAddr.split(':');\n if (parts.length < 2) {\n return false;\n }\n const octet34 = parts[parts.length - 1].padStart(4, '0');\n const octet12 = parts[parts.length - 2].padStart(4, '0');\n const ip4 = `${parseInt(octet12.substring(0, 2), 16)}.${parseInt(octet12.substring(2), 16)}.${parseInt(octet34.substring(0, 2), 16)}.${parseInt(octet34.substring(2), 16)}`;\n return ipv4Check(ip4);\n}\n/**\n * @see https://datatracker.ietf.org/doc/html/rfc4291#section-2.2 example 3\n */\nfunction isIpv4EmbeddedIpv6(ipAddr) {\n return /^::ffff:([0-9]{1,3})\\.([0-9]{1,3})\\.([0-9]{1,3})\\.([0-9]{1,3})$/.test(ipAddr);\n}\nfunction ipv4EmbeddedIpv6Check(ipAddr) {\n const parts = ipAddr.split(':');\n const ip4 = parts[parts.length - 1];\n return ipv4Check(ip4);\n}\nfunction ipv6Check(ipAddr) {\n return /^::$/.test(ipAddr) ||\n /^::1$/.test(ipAddr) ||\n /^64:ff9b::([0-9]{1,3})\\.([0-9]{1,3})\\.([0-9]{1,3})\\.([0-9]{1,3})$/.test(ipAddr) ||\n /^100::([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4})$/.test(ipAddr) ||\n /^2001::([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4})$/.test(ipAddr) ||\n /^2001:2[0-9a-fA-F]:([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4})$/.test(ipAddr) ||\n /^2001:db8:([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4})$/.test(ipAddr) ||\n /^2002:([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4})$/.test(ipAddr) ||\n /^f[c-d]([0-9a-fA-F]{2,2}):/i.test(ipAddr) ||\n /^fe[8-9a-bA-B][0-9a-fA-F]:/i.test(ipAddr) ||\n /^ff([0-9a-fA-F]{2,2}):/i.test(ipAddr);\n}\nexport function isPrivateIp(ip) {\n if (isIPv4(ip))\n return ipv4Check(ip);\n else if (isIpv4MappedIpv6(ip))\n return ipv4MappedIpv6Check(ip);\n else if (isIpv4EmbeddedIpv6(ip))\n return ipv4EmbeddedIpv6Check(ip);\n else if (isIPv6(ip))\n return ipv6Check(ip);\n else\n return undefined;\n}\n//# sourceMappingURL=private-ip.js.map","import { isPrivateIp } from '@libp2p/utils/private-ip';\n/**\n * Returns a connection gater that disallows dialling private addresses by\n * default. Browsers are severely limited in their resource usage so don't\n * waste time trying to dial undiallable addresses.\n */\nexport function connectionGater(gater = {}) {\n return {\n denyDialPeer: async () => false,\n denyDialMultiaddr: async (multiaddr) => {\n const tuples = multiaddr.stringTuples();\n if (tuples[0][0] === 4 || tuples[0][0] === 41) {\n return Boolean(isPrivateIp(`${tuples[0][1]}`));\n }\n return false;\n },\n denyInboundConnection: async () => false,\n denyOutboundConnection: async () => false,\n denyInboundEncryptedConnection: async () => false,\n denyOutboundEncryptedConnection: async () => false,\n denyInboundUpgradedConnection: async () => false,\n denyOutboundUpgradedConnection: async () => false,\n filterMultiaddrForPeer: async () => true,\n ...gater\n };\n}\n//# sourceMappingURL=connection-gater.browser.js.map","import { isPrivateIp } from '../private-ip.js';\n/**\n * Check if a given multiaddr has a private address.\n */\nexport function isPrivate(ma) {\n try {\n const { address } = ma.nodeAddress();\n return Boolean(isPrivateIp(address));\n }\n catch {\n return true;\n }\n}\n//# sourceMappingURL=is-private.js.map","/**\n * @packageDocumentation\n *\n * Provides strategies to sort a list of multiaddrs.\n *\n * @example\n *\n * ```typescript\n * import { publicAddressesFirst } from '@libp2p/utils/address-sort'\n * import { multiaddr } from '@multformats/multiaddr'\n *\n *\n * const addresses = [\n * multiaddr('/ip4/127.0.0.1/tcp/9000'),\n * multiaddr('/ip4/82.41.53.1/tcp/9000')\n * ].sort(publicAddressesFirst)\n *\n * console.info(addresses)\n * // ['/ip4/82.41.53.1/tcp/9000', '/ip4/127.0.0.1/tcp/9000']\n * ```\n */\nimport { Circuit } from '@multiformats/multiaddr-matcher';\nimport { isPrivate } from './multiaddr/is-private.js';\n/**\n * Compare function for array.sort() that moves public addresses to the start\n * of the array.\n */\nexport function publicAddressesFirst(a, b) {\n const isAPrivate = isPrivate(a.multiaddr);\n const isBPrivate = isPrivate(b.multiaddr);\n if (isAPrivate && !isBPrivate) {\n return 1;\n }\n else if (!isAPrivate && isBPrivate) {\n return -1;\n }\n return 0;\n}\n/**\n * Compare function for array.sort() that moves certified addresses to the start\n * of the array.\n */\nexport function certifiedAddressesFirst(a, b) {\n if (a.isCertified && !b.isCertified) {\n return -1;\n }\n else if (!a.isCertified && b.isCertified) {\n return 1;\n }\n return 0;\n}\n/**\n * Compare function for array.sort() that moves circuit relay addresses to the\n * start of the array.\n */\nexport function circuitRelayAddressesLast(a, b) {\n const isACircuit = Circuit.exactMatch(a.multiaddr);\n const isBCircuit = Circuit.exactMatch(b.multiaddr);\n if (isACircuit && !isBCircuit) {\n return 1;\n }\n else if (!isACircuit && isBCircuit) {\n return -1;\n }\n return 0;\n}\nexport function defaultAddressSort(a, b) {\n const publicResult = publicAddressesFirst(a, b);\n if (publicResult !== 0) {\n return publicResult;\n }\n const relayResult = circuitRelayAddressesLast(a, b);\n if (relayResult !== 0) {\n return relayResult;\n }\n const certifiedResult = certifiedAddressesFirst(a, b);\n return certifiedResult;\n}\n//# sourceMappingURL=address-sort.js.map","import { RecordType } from '../index.js';\nexport function getTypes(types) {\n const DEFAULT_TYPES = [\n RecordType.A\n ];\n if (types == null) {\n return DEFAULT_TYPES;\n }\n if (Array.isArray(types)) {\n if (types.length === 0) {\n return DEFAULT_TYPES;\n }\n return types;\n }\n return [\n types\n ];\n}\n//# sourceMappingURL=get-types.js.map","import { toString as uint8ArrayToString } from 'uint8arrays/to-string';\nimport { RecordType } from '../index.js';\n/**\n * This TTL will be used if the remote service does not return one\n */\nexport const DEFAULT_TTL = 60;\nexport function toDNSResponse(obj) {\n return {\n Status: obj.Status ?? 0,\n TC: obj.TC ?? obj.flag_tc ?? false,\n RD: obj.RD ?? obj.flag_rd ?? false,\n RA: obj.RA ?? obj.flag_ra ?? false,\n AD: obj.AD ?? obj.flag_ad ?? false,\n CD: obj.CD ?? obj.flag_cd ?? false,\n Question: (obj.Question ?? obj.questions ?? []).map((question) => {\n return {\n name: question.name,\n type: RecordType[question.type]\n };\n }),\n Answer: (obj.Answer ?? obj.answers ?? []).map((answer) => {\n return {\n name: answer.name,\n type: RecordType[answer.type],\n TTL: (answer.TTL ?? answer.ttl ?? DEFAULT_TTL),\n data: answer.data instanceof Uint8Array ? uint8ArrayToString(answer.data) : answer.data\n };\n })\n };\n}\n//# sourceMappingURL=to-dns-response.js.map","/* eslint-env browser */\nimport PQueue from 'p-queue';\nimport { CustomProgressEvent } from 'progress-events';\nimport { RecordType } from '../index.js';\nimport { getTypes } from '../utils/get-types.js';\nimport { toDNSResponse } from '../utils/to-dns-response.js';\n/**\n * Browsers limit concurrent connections per host (~6), we don't want to exhaust\n * the limit so this value controls how many DNS queries can be in flight at\n * once.\n */\nexport const DEFAULT_QUERY_CONCURRENCY = 4;\n/**\n * Uses the RFC 8427 'application/dns-json' content-type to resolve DNS queries.\n *\n * Supports and server that uses the same schema as Google's DNS over HTTPS\n * resolver.\n *\n * This resolver needs fewer dependencies than the regular DNS-over-HTTPS\n * resolver so can result in a smaller bundle size and consequently is preferred\n * for browser use.\n *\n * @see https://developers.cloudflare.com/1.1.1.1/encryption/dns-over-https/make-api-requests/dns-json/\n * @see https://github.com/curl/curl/wiki/DNS-over-HTTPS#publicly-available-servers\n * @see https://dnsprivacy.org/public_resolvers/\n * @see https://datatracker.ietf.org/doc/html/rfc8427\n */\nexport function dnsJsonOverHttps(url, init = {}) {\n const httpQueue = new PQueue({\n concurrency: init.queryConcurrency ?? DEFAULT_QUERY_CONCURRENCY\n });\n return async (fqdn, options = {}) => {\n const searchParams = new URLSearchParams();\n searchParams.set('name', fqdn);\n getTypes(options.types).forEach(type => {\n // We pass record type as a string to the server because cloudflare DNS bug. see https://github.com/ipfs/helia/issues/474\n searchParams.append('type', RecordType[type]);\n });\n options.onProgress?.(new CustomProgressEvent('dns:query', { detail: fqdn }));\n // query DNS-JSON over HTTPS server\n const response = await httpQueue.add(async () => {\n const res = await fetch(`${url}?${searchParams}`, {\n headers: {\n accept: 'application/dns-json'\n },\n signal: options?.signal\n });\n if (res.status !== 200) {\n throw new Error(`Unexpected HTTP status: ${res.status} - ${res.statusText}`);\n }\n const response = toDNSResponse(await res.json());\n options.onProgress?.(new CustomProgressEvent('dns:response', { detail: response }));\n return response;\n }, {\n signal: options.signal\n });\n if (response == null) {\n throw new Error('No DNS response received');\n }\n return response;\n };\n}\n//# sourceMappingURL=dns-json-over-https.js.map","/**\n * @packageDocumentation\n *\n * Query DNS records using `node:dns`, DNS over HTTP and/or DNSJSON over HTTP.\n *\n * A list of publicly accessible servers can be found [here](https://github.com/curl/curl/wiki/DNS-over-HTTPS#publicly-available-servers).\n *\n * @example Using the default resolver\n *\n * ```TypeScript\n * import { dns } from '@multiformats/dns'\n *\n * const resolver = dns()\n *\n * // resolve A records with a 5s timeout\n * const result = await dns.query('google.com', {\n * signal: AbortSignal.timeout(5000)\n * })\n * ```\n *\n * @example Using per-TLD resolvers\n *\n * ```TypeScript\n * import { dns } from '@multiformats/dns'\n * import { dnsJsonOverHttps } from '@multiformats/dns/resolvers'\n *\n * const resolver = dns({\n * resolvers: {\n * // will only be used to resolve `.com` addresses\n * 'com.': dnsJsonOverHttps('https://cloudflare-dns.com/dns-query'),\n *\n * // this can also be an array, resolvers will be shuffled and tried in\n * // series\n * 'net.': [\n * dnsJsonOverHttps('https://dns.google/resolve'),\n * dnsJsonOverHttps('https://dns.pub/dns-query')\n * ],\n *\n * // will only be used to resolve all other addresses\n * '.': dnsJsonOverHttps('https://dnsforge.de/dns-query'),\n * }\n * })\n * ```\n *\n * @example Query for specific record types\n *\n * ```TypeScript\n * import { dns, RecordType } from '@multiformats/dns'\n *\n * const resolver = dns()\n *\n * // resolve only TXT records\n * const result = await dns.query('google.com', {\n * types: [\n * RecordType.TXT\n * ]\n * })\n * ```\n *\n * ## Caching\n *\n * Individual Aanswers are cached so. If you make a request, for which all\n * record types are cached, all values will be pulled from the cache.\n *\n * If any of the record types are not cached, a new request will be resolved as\n * if none of the records were cached, and the cache will be updated to include\n * the new results.\n *\n * @example Ignoring the cache\n *\n * ```TypeScript\n * import { dns, RecordType } from '@multiformats/dns'\n *\n * const resolver = dns()\n *\n * // do not used cached results, always resolve a new query\n * const result = await dns.query('google.com', {\n * cached: false\n * })\n * ```\n */\nimport { DNS as DNSClass } from './dns.js';\n/**\n * A subset of DNS Record Types\n *\n * @see https://www.iana.org/assignments/dns-parameters/dns-parameters.xhtml#dns-parameters-4.\n */\nexport var RecordType;\n(function (RecordType) {\n RecordType[RecordType[\"A\"] = 1] = \"A\";\n RecordType[RecordType[\"CNAME\"] = 5] = \"CNAME\";\n RecordType[RecordType[\"TXT\"] = 16] = \"TXT\";\n RecordType[RecordType[\"AAAA\"] = 28] = \"AAAA\";\n})(RecordType || (RecordType = {}));\n/**\n * The default maximum amount of recursion allowed during a query\n */\nexport const MAX_RECURSIVE_DEPTH = 32;\nexport function dns(init = {}) {\n return new DNSClass(init);\n}\n//# sourceMappingURL=index.js.map","import hashlru from 'hashlru';\nimport { RecordType } from '../index.js';\nimport { DEFAULT_TTL, toDNSResponse } from './to-dns-response.js';\n/**\n * Time Aware Least Recent Used Cache\n *\n * @see https://arxiv.org/pdf/1801.00390\n */\nclass CachedAnswers {\n lru;\n constructor(maxSize) {\n this.lru = hashlru(maxSize);\n }\n get(fqdn, types) {\n let foundAllAnswers = true;\n const answers = [];\n for (const type of types) {\n const cached = this.getAnswers(fqdn, type);\n if (cached.length === 0) {\n foundAllAnswers = false;\n break;\n }\n answers.push(...cached);\n }\n if (foundAllAnswers) {\n return toDNSResponse({ answers });\n }\n }\n getAnswers(domain, type) {\n const key = `${domain.toLowerCase()}-${type}`;\n const answers = this.lru.get(key);\n if (answers != null) {\n const cachedAnswers = answers\n .filter((entry) => {\n return entry.expires > Date.now();\n })\n .map(({ expires, value }) => ({\n ...value,\n TTL: Math.round((expires - Date.now()) / 1000),\n type: RecordType[value.type]\n }));\n if (cachedAnswers.length === 0) {\n this.lru.remove(key);\n }\n // @ts-expect-error hashlru stringifies stored types which turns enums\n // into strings, we convert back into enums above but tsc doesn't know\n return cachedAnswers;\n }\n return [];\n }\n add(domain, answer) {\n const key = `${domain.toLowerCase()}-${answer.type}`;\n const answers = this.lru.get(key) ?? [];\n answers.push({\n expires: Date.now() + ((answer.TTL ?? DEFAULT_TTL) * 1000),\n value: answer\n });\n this.lru.set(key, answers);\n }\n remove(domain, type) {\n const key = `${domain.toLowerCase()}-${type}`;\n this.lru.remove(key);\n }\n clear() {\n this.lru.clear();\n }\n}\n/**\n * Avoid sending multiple queries for the same hostname by caching results\n */\nexport function cache(size) {\n return new CachedAnswers(size);\n}\n//# sourceMappingURL=cache.js.map","import { CustomProgressEvent } from 'progress-events';\nimport { defaultResolver } from './resolvers/default.js';\nimport { cache } from './utils/cache.js';\nimport { getTypes } from './utils/get-types.js';\nconst DEFAULT_ANSWER_CACHE_SIZE = 1000;\nexport class DNS {\n resolvers;\n cache;\n constructor(init) {\n this.resolvers = {};\n this.cache = cache(init.cacheSize ?? DEFAULT_ANSWER_CACHE_SIZE);\n Object.entries(init.resolvers ?? {}).forEach(([tld, resolver]) => {\n if (!Array.isArray(resolver)) {\n resolver = [resolver];\n }\n // convert `com` -> `com.`\n if (!tld.endsWith('.')) {\n tld = `${tld}.`;\n }\n this.resolvers[tld] = resolver;\n });\n // configure default resolver if none specified\n if (this.resolvers['.'] == null) {\n this.resolvers['.'] = defaultResolver();\n }\n }\n /**\n * Queries DNS resolvers for the passed record types for the passed domain.\n *\n * If cached records exist for all desired types they will be returned\n * instead.\n *\n * Any new responses will be added to the cache for subsequent requests.\n */\n async query(domain, options = {}) {\n const types = getTypes(options.types);\n const cached = options.cached !== false ? this.cache.get(domain, types) : undefined;\n if (cached != null) {\n options.onProgress?.(new CustomProgressEvent('dns:cache', { detail: cached }));\n return cached;\n }\n const tld = `${domain.split('.').pop()}.`;\n const resolvers = (this.resolvers[tld] ?? this.resolvers['.']).sort(() => {\n return (Math.random() > 0.5) ? -1 : 1;\n });\n const errors = [];\n for (const resolver of resolvers) {\n // skip further resolutions if the user aborted the signal\n if (options.signal?.aborted === true) {\n break;\n }\n try {\n const result = await resolver(domain, {\n ...options,\n types\n });\n for (const answer of result.Answer) {\n this.cache.add(domain, answer);\n }\n return result;\n }\n catch (err) {\n errors.push(err);\n options.onProgress?.(new CustomProgressEvent('dns:error', { detail: err }));\n }\n }\n if (errors.length === 1) {\n throw errors[0];\n }\n throw new AggregateError(errors, `DNS lookup of ${domain} ${types} failed`);\n }\n}\n//# sourceMappingURL=dns.js.map","import { dnsJsonOverHttps } from './dns-json-over-https.js';\nexport function defaultResolver() {\n return [\n dnsJsonOverHttps('https://cloudflare-dns.com/dns-query'),\n dnsJsonOverHttps('https://dns.google/resolve')\n ];\n}\n//# sourceMappingURL=default.browser.js.map","import { CodeError } from '@libp2p/interface';\nimport { dns, RecordType } from '@multiformats/dns';\nimport { multiaddr } from '../index.js';\nimport { getProtocol } from '../protocols-table.js';\nconst MAX_RECURSIVE_DEPTH = 32;\nconst { code: dnsaddrCode } = getProtocol('dnsaddr');\nexport const dnsaddrResolver = async function dnsaddrResolver(ma, options = {}) {\n const recursionLimit = options.maxRecursiveDepth ?? MAX_RECURSIVE_DEPTH;\n if (recursionLimit === 0) {\n throw new CodeError('Max recursive depth reached', 'ERR_MAX_RECURSIVE_DEPTH_REACHED');\n }\n const [, hostname] = ma.stringTuples().find(([proto]) => proto === dnsaddrCode) ?? [];\n const resolver = options?.dns ?? dns();\n const result = await resolver.query(`_dnsaddr.${hostname}`, {\n signal: options?.signal,\n types: [\n RecordType.TXT\n ]\n });\n const peerId = ma.getPeerId();\n const output = [];\n for (const answer of result.Answer) {\n const addr = answer.data\n .replace(/[\"']/g, '')\n .trim()\n .split('=')[1];\n if (addr == null) {\n continue;\n }\n if (peerId != null && !addr.includes(peerId)) {\n continue;\n }\n const ma = multiaddr(addr);\n if (addr.startsWith('/dnsaddr')) {\n const resolved = await ma.resolve({\n ...options,\n maxRecursiveDepth: recursionLimit - 1\n });\n output.push(...resolved.map(ma => ma.toString()));\n }\n else {\n output.push(ma.toString());\n }\n }\n return output;\n};\n//# sourceMappingURL=dnsaddr.js.map","/**\n * Thin ESM wrapper for CJS named exports.\n *\n * Ref: https://redfin.engineering/node-modules-at-war-why-commonjs-and-es-modules-cant-get-along-9617135eeca1\n */\n\nimport mergeOptions from './index.js';\nexport default mergeOptions;\n","export var messages;\n(function (messages) {\n messages[\"NOT_STARTED_YET\"] = \"The libp2p node is not started yet\";\n messages[\"ERR_PROTECTOR_REQUIRED\"] = \"Private network is enforced, but no protector was provided\";\n messages[\"NOT_FOUND\"] = \"Not found\";\n})(messages || (messages = {}));\nexport var codes;\n(function (codes) {\n codes[\"ERR_PROTECTOR_REQUIRED\"] = \"ERR_PROTECTOR_REQUIRED\";\n codes[\"ERR_PEER_DIAL_INTERCEPTED\"] = \"ERR_PEER_DIAL_INTERCEPTED\";\n codes[\"ERR_CONNECTION_INTERCEPTED\"] = \"ERR_CONNECTION_INTERCEPTED\";\n codes[\"ERR_INVALID_PROTOCOLS_FOR_STREAM\"] = \"ERR_INVALID_PROTOCOLS_FOR_STREAM\";\n codes[\"ERR_CONNECTION_ENDED\"] = \"ERR_CONNECTION_ENDED\";\n codes[\"ERR_CONNECTION_FAILED\"] = \"ERR_CONNECTION_FAILED\";\n codes[\"ERR_NODE_NOT_STARTED\"] = \"ERR_NODE_NOT_STARTED\";\n codes[\"ERR_ALREADY_ABORTED\"] = \"ERR_ALREADY_ABORTED\";\n codes[\"ERR_TOO_MANY_ADDRESSES\"] = \"ERR_TOO_MANY_ADDRESSES\";\n codes[\"ERR_NO_VALID_ADDRESSES\"] = \"ERR_NO_VALID_ADDRESSES\";\n codes[\"ERR_RELAYED_DIAL\"] = \"ERR_RELAYED_DIAL\";\n codes[\"ERR_DIALED_SELF\"] = \"ERR_DIALED_SELF\";\n codes[\"ERR_DISCOVERED_SELF\"] = \"ERR_DISCOVERED_SELF\";\n codes[\"ERR_DUPLICATE_TRANSPORT\"] = \"ERR_DUPLICATE_TRANSPORT\";\n codes[\"ERR_ENCRYPTION_FAILED\"] = \"ERR_ENCRYPTION_FAILED\";\n codes[\"ERR_HOP_REQUEST_FAILED\"] = \"ERR_HOP_REQUEST_FAILED\";\n codes[\"ERR_INVALID_KEY\"] = \"ERR_INVALID_KEY\";\n codes[\"ERR_INVALID_MESSAGE\"] = \"ERR_INVALID_MESSAGE\";\n codes[\"ERR_INVALID_PARAMETERS\"] = \"ERR_INVALID_PARAMETERS\";\n codes[\"ERR_INVALID_PEER\"] = \"ERR_INVALID_PEER\";\n codes[\"ERR_MUXER_UNAVAILABLE\"] = \"ERR_MUXER_UNAVAILABLE\";\n codes[\"ERR_NOT_FOUND\"] = \"ERR_NOT_FOUND\";\n codes[\"ERR_TRANSPORT_UNAVAILABLE\"] = \"ERR_TRANSPORT_UNAVAILABLE\";\n codes[\"ERR_TRANSPORT_DIAL_FAILED\"] = \"ERR_TRANSPORT_DIAL_FAILED\";\n codes[\"ERR_UNSUPPORTED_PROTOCOL\"] = \"ERR_UNSUPPORTED_PROTOCOL\";\n codes[\"ERR_PROTOCOL_HANDLER_ALREADY_REGISTERED\"] = \"ERR_PROTOCOL_HANDLER_ALREADY_REGISTERED\";\n codes[\"ERR_INVALID_MULTIADDR\"] = \"ERR_INVALID_MULTIADDR\";\n codes[\"ERR_SIGNATURE_NOT_VALID\"] = \"ERR_SIGNATURE_NOT_VALID\";\n codes[\"ERR_FIND_SELF\"] = \"ERR_FIND_SELF\";\n codes[\"ERR_NO_ROUTERS_AVAILABLE\"] = \"ERR_NO_ROUTERS_AVAILABLE\";\n codes[\"ERR_CONNECTION_NOT_MULTIPLEXED\"] = \"ERR_CONNECTION_NOT_MULTIPLEXED\";\n codes[\"ERR_NO_DIAL_TOKENS\"] = \"ERR_NO_DIAL_TOKENS\";\n codes[\"ERR_INVALID_CMS\"] = \"ERR_INVALID_CMS\";\n codes[\"ERR_MISSING_KEYS\"] = \"ERR_MISSING_KEYS\";\n codes[\"ERR_NO_KEY\"] = \"ERR_NO_KEY\";\n codes[\"ERR_INVALID_KEY_NAME\"] = \"ERR_INVALID_KEY_NAME\";\n codes[\"ERR_INVALID_KEY_TYPE\"] = \"ERR_INVALID_KEY_TYPE\";\n codes[\"ERR_KEY_ALREADY_EXISTS\"] = \"ERR_KEY_ALREADY_EXISTS\";\n codes[\"ERR_INVALID_KEY_SIZE\"] = \"ERR_INVALID_KEY_SIZE\";\n codes[\"ERR_KEY_NOT_FOUND\"] = \"ERR_KEY_NOT_FOUND\";\n codes[\"ERR_OLD_KEY_NAME_INVALID\"] = \"ERR_OLD_KEY_NAME_INVALID\";\n codes[\"ERR_NEW_KEY_NAME_INVALID\"] = \"ERR_NEW_KEY_NAME_INVALID\";\n codes[\"ERR_PASSWORD_REQUIRED\"] = \"ERR_PASSWORD_REQUIRED\";\n codes[\"ERR_PEM_REQUIRED\"] = \"ERR_PEM_REQUIRED\";\n codes[\"ERR_CANNOT_READ_KEY\"] = \"ERR_CANNOT_READ_KEY\";\n codes[\"ERR_MISSING_PRIVATE_KEY\"] = \"ERR_MISSING_PRIVATE_KEY\";\n codes[\"ERR_MISSING_PUBLIC_KEY\"] = \"ERR_MISSING_PUBLIC_KEY\";\n codes[\"ERR_INVALID_OLD_PASS_TYPE\"] = \"ERR_INVALID_OLD_PASS_TYPE\";\n codes[\"ERR_INVALID_NEW_PASS_TYPE\"] = \"ERR_INVALID_NEW_PASS_TYPE\";\n codes[\"ERR_INVALID_PASS_LENGTH\"] = \"ERR_INVALID_PASS_LENGTH\";\n codes[\"ERR_NOT_IMPLEMENTED\"] = \"ERR_NOT_IMPLEMENTED\";\n codes[\"ERR_WRONG_PING_ACK\"] = \"ERR_WRONG_PING_ACK\";\n codes[\"ERR_INVALID_RECORD\"] = \"ERR_INVALID_RECORD\";\n codes[\"ERR_ALREADY_SUCCEEDED\"] = \"ERR_ALREADY_SUCCEEDED\";\n codes[\"ERR_NO_HANDLER_FOR_PROTOCOL\"] = \"ERR_NO_HANDLER_FOR_PROTOCOL\";\n codes[\"ERR_TOO_MANY_OUTBOUND_PROTOCOL_STREAMS\"] = \"ERR_TOO_MANY_OUTBOUND_PROTOCOL_STREAMS\";\n codes[\"ERR_TOO_MANY_INBOUND_PROTOCOL_STREAMS\"] = \"ERR_TOO_MANY_INBOUND_PROTOCOL_STREAMS\";\n codes[\"ERR_CONNECTION_DENIED\"] = \"ERR_CONNECTION_DENIED\";\n codes[\"ERR_TRANSFER_LIMIT_EXCEEDED\"] = \"ERR_TRANSFER_LIMIT_EXCEEDED\";\n})(codes || (codes = {}));\n//# sourceMappingURL=errors.js.map","import { CodeError, FaultTolerance } from '@libp2p/interface';\nimport { peerIdFromKeys } from '@libp2p/peer-id';\nimport { defaultAddressSort } from '@libp2p/utils/address-sort';\nimport { dnsaddrResolver } from '@multiformats/multiaddr/resolvers';\nimport mergeOptions from 'merge-options';\nimport { codes, messages } from './errors.js';\nconst DefaultConfig = {\n addresses: {\n listen: [],\n announce: [],\n noAnnounce: [],\n announceFilter: (multiaddrs) => multiaddrs\n },\n connectionManager: {\n resolvers: {\n dnsaddr: dnsaddrResolver\n },\n addressSorter: defaultAddressSort\n },\n transportManager: {\n faultTolerance: FaultTolerance.FATAL_ALL\n }\n};\nexport async function validateConfig(opts) {\n const resultingOptions = mergeOptions(DefaultConfig, opts);\n if (resultingOptions.connectionProtector === null && globalThis.process?.env?.LIBP2P_FORCE_PNET != null) { // eslint-disable-line no-undef\n throw new CodeError(messages.ERR_PROTECTOR_REQUIRED, codes.ERR_PROTECTOR_REQUIRED);\n }\n if (resultingOptions.privateKey != null && !(await peerIdFromKeys(resultingOptions.privateKey.public.bytes, resultingOptions.privateKey.bytes)).equals(resultingOptions.peerId)) {\n throw new CodeError('Private key doesn\\'t match peer id', codes.ERR_INVALID_KEY);\n }\n return resultingOptions;\n}\n//# sourceMappingURL=config.js.map","import { CodeError, isPeerId } from '@libp2p/interface';\nimport { peerIdFromString } from '@libp2p/peer-id';\nimport { isMultiaddr } from '@multiformats/multiaddr';\nimport { codes } from './errors.js';\n/**\n * Extracts a PeerId and/or multiaddr from the passed PeerId or Multiaddr or an array of Multiaddrs\n */\nexport function getPeerAddress(peer) {\n if (isPeerId(peer)) {\n return { peerId: peer, multiaddrs: [] };\n }\n if (!Array.isArray(peer)) {\n peer = [peer];\n }\n let peerId;\n if (peer.length > 0) {\n const peerIdStr = peer[0].getPeerId();\n peerId = peerIdStr == null ? undefined : peerIdFromString(peerIdStr);\n // ensure PeerId is either not set or is consistent\n peer.forEach(ma => {\n if (!isMultiaddr(ma)) {\n throw new CodeError('Invalid Multiaddr', codes.ERR_INVALID_MULTIADDR);\n }\n const maPeerIdStr = ma.getPeerId();\n if (maPeerIdStr == null) {\n if (peerId != null) {\n throw new CodeError('Multiaddrs must all have the same peer id or have no peer id', codes.ERR_INVALID_PARAMETERS);\n }\n }\n else {\n const maPeerId = peerIdFromString(maPeerIdStr);\n if (peerId?.equals(maPeerId) !== true) {\n throw new CodeError('Multiaddrs must all have the same peer id or have no peer id', codes.ERR_INVALID_PARAMETERS);\n }\n }\n });\n }\n return {\n peerId,\n multiaddrs: peer\n };\n}\n//# sourceMappingURL=get-peer.js.map","/**\n * @packageDocumentation\n *\n * Race an event against an AbortSignal, taking care to remove any event\n * listeners that were added.\n *\n * @example Getting started\n *\n * ```TypeScript\n * import { raceEvent } from 'race-event'\n *\n * const controller = new AbortController()\n * const emitter = new EventTarget()\n *\n * setTimeout(() => {\n * controller.abort()\n * }, 500)\n *\n * setTimeout(() => {\n * // too late\n * emitter.dispatchEvent(new CustomEvent('event'))\n * }, 1000)\n *\n * // throws an AbortError\n * const resolve = await raceEvent(emitter, 'event', controller.signal)\n * ```\n *\n * @example Aborting the promise with an error event\n *\n * ```TypeScript\n * import { raceEvent } from 'race-event'\n *\n * const emitter = new EventTarget()\n *\n * setTimeout(() => {\n * emitter.dispatchEvent(new CustomEvent('failure', {\n * detail: new Error('Oh no!')\n * }))\n * }, 1000)\n *\n * // throws 'Oh no!' error\n * const resolve = await raceEvent(emitter, 'success', AbortSignal.timeout(5000), {\n * errorEvent: 'failure'\n * })\n * ```\n *\n * @example Customising the thrown AbortError\n *\n * The error message and `.code` property of the thrown `AbortError` can be\n * specified by passing options:\n *\n * ```TypeScript\n * import { raceEvent } from 'race-event'\n *\n * const controller = new AbortController()\n * const emitter = new EventTarget()\n *\n * setTimeout(() => {\n * controller.abort()\n * }, 500)\n *\n * // throws a Error: Oh no!\n * const resolve = await raceEvent(emitter, 'event', controller.signal, {\n * errorMessage: 'Oh no!',\n * errorCode: 'ERR_OH_NO'\n * })\n * ```\n *\n * @example Only resolving on specific events\n *\n * Where multiple events with the same type are emitted, a `filter` function can\n * be passed to only resolve on one of them:\n *\n * ```TypeScript\n * import { raceEvent } from 'race-event'\n *\n * const controller = new AbortController()\n * const emitter = new EventTarget()\n *\n * // throws a Error: Oh no!\n * const resolve = await raceEvent(emitter, 'event', controller.signal, {\n * filter: (evt: Event) => {\n * return evt.detail.foo === 'bar'\n * }\n * })\n * ```\n *\n * @example Terminating early by throwing from the filter\n *\n * You can cause listening for the event to cease and all event listeners to be\n * removed by throwing from the filter:\n *\n * ```TypeScript\n * import { raceEvent } from 'race-event'\n *\n * const controller = new AbortController()\n * const emitter = new EventTarget()\n *\n * // throws Error: Cannot continue\n * const resolve = await raceEvent(emitter, 'event', controller.signal, {\n * filter: (evt) => {\n * if (...reasons) {\n * throw new Error('Cannot continue')\n * }\n *\n * return true\n * }\n * })\n * ```\n */\n/**\n * An abort error class that extends error\n */\nexport class AbortError extends Error {\n type;\n code;\n constructor(message, code) {\n super(message ?? 'The operation was aborted');\n this.type = 'aborted';\n this.name = 'AbortError';\n this.code = code ?? 'ABORT_ERR';\n }\n}\n/**\n * Race a promise against an abort signal\n */\nexport async function raceEvent(emitter, eventName, signal, opts) {\n // create the error here so we have more context in the stack trace\n const error = new AbortError(opts?.errorMessage, opts?.errorCode);\n if (signal?.aborted === true) {\n return Promise.reject(error);\n }\n return new Promise((resolve, reject) => {\n function removeListeners() {\n signal?.removeEventListener('abort', abortListener);\n emitter.removeEventListener(eventName, eventListener);\n if (opts?.errorEvent != null) {\n emitter.removeEventListener(opts.errorEvent, errorEventListener);\n }\n }\n const eventListener = (evt) => {\n try {\n if (opts?.filter?.(evt) === false) {\n return;\n }\n }\n catch (err) {\n removeListeners();\n reject(err);\n return;\n }\n removeListeners();\n resolve(evt);\n };\n const errorEventListener = (evt) => {\n removeListeners();\n reject(evt.detail);\n };\n const abortListener = () => {\n removeListeners();\n reject(error);\n };\n signal?.addEventListener('abort', abortListener);\n emitter.addEventListener(eventName, eventListener);\n if (opts?.errorEvent != null) {\n emitter.addEventListener(opts.errorEvent, errorEventListener);\n }\n });\n}\n//# sourceMappingURL=index.js.map","import { AbortError } from '@libp2p/interface';\nimport pDefer from 'p-defer';\nexport class JobRecipient {\n deferred;\n signal;\n constructor(signal) {\n this.signal = signal;\n this.deferred = pDefer();\n this.onAbort = this.onAbort.bind(this);\n this.signal?.addEventListener('abort', this.onAbort);\n }\n onAbort() {\n this.deferred.reject(this.signal?.reason ?? new AbortError());\n }\n cleanup() {\n this.signal?.removeEventListener('abort', this.onAbort);\n }\n}\n//# sourceMappingURL=recipient.js.map","import { AbortError, setMaxListeners } from '@libp2p/interface';\nimport { raceSignal } from 'race-signal';\nimport { JobRecipient } from './recipient.js';\n/**\n * Returns a random string\n */\nfunction randomId() {\n return `${(parseInt(String(Math.random() * 1e9), 10)).toString()}${Date.now()}`;\n}\nexport class Job {\n id;\n fn;\n options;\n recipients;\n status;\n timeline;\n controller;\n constructor(fn, options) {\n this.id = randomId();\n this.status = 'queued';\n this.fn = fn;\n this.options = options;\n this.recipients = [];\n this.timeline = {\n created: Date.now()\n };\n this.controller = new AbortController();\n setMaxListeners(Infinity, this.controller.signal);\n this.onAbort = this.onAbort.bind(this);\n }\n abort(err) {\n this.controller.abort(err);\n }\n onAbort() {\n const allAborted = this.recipients.reduce((acc, curr) => {\n return acc && (curr.signal?.aborted === true);\n }, true);\n // if all recipients have aborted the job, actually abort the job\n if (allAborted) {\n this.controller.abort(new AbortError());\n this.cleanup();\n }\n }\n async join(options = {}) {\n const recipient = new JobRecipient(options.signal);\n this.recipients.push(recipient);\n options.signal?.addEventListener('abort', this.onAbort);\n return recipient.deferred.promise;\n }\n async run() {\n this.status = 'running';\n this.timeline.started = Date.now();\n try {\n this.controller.signal.throwIfAborted();\n const result = await raceSignal(this.fn({\n ...(this.options ?? {}),\n signal: this.controller.signal\n }), this.controller.signal);\n this.recipients.forEach(recipient => {\n recipient.deferred.resolve(result);\n });\n this.status = 'complete';\n }\n catch (err) {\n this.recipients.forEach(recipient => {\n recipient.deferred.reject(err);\n });\n this.status = 'errored';\n }\n finally {\n this.timeline.finished = Date.now();\n this.cleanup();\n }\n }\n cleanup() {\n this.recipients.forEach(recipient => {\n recipient.cleanup();\n recipient.signal?.removeEventListener('abort', this.onAbort);\n });\n }\n}\n//# sourceMappingURL=job.js.map","import { AbortError, CodeError, TypedEventEmitter } from '@libp2p/interface';\nimport { pushable } from 'it-pushable';\nimport { raceEvent } from 'race-event';\nimport { Job } from './job.js';\n/**\n * Heavily influence by `p-queue` with the following differences:\n *\n * 1. Items remain at the head of the queue while they are running so `queue.size` includes `queue.pending` items - this is so interested parties can join the results of a queue item while it is running\n * 2. The options for a job are stored separately to the job in order for them to be modified while they are still in the queue\n */\nexport class Queue extends TypedEventEmitter {\n concurrency;\n queue;\n pending;\n sort;\n constructor(init = {}) {\n super();\n this.concurrency = init.concurrency ?? Number.POSITIVE_INFINITY;\n this.pending = 0;\n if (init.metricName != null) {\n init.metrics?.registerMetricGroup(init.metricName, {\n calculate: () => {\n return {\n size: this.queue.length,\n running: this.pending,\n queued: this.queue.length - this.pending\n };\n }\n });\n }\n this.sort = init.sort;\n this.queue = [];\n }\n tryToStartAnother() {\n if (this.size === 0) {\n // do this in the microtask queue so all job recipients receive the\n // result before the \"empty\" event fires\n queueMicrotask(() => {\n this.safeDispatchEvent('empty');\n });\n if (this.running === 0) {\n // do this in the microtask queue so all job recipients receive the\n // result before the \"idle\" event fires\n queueMicrotask(() => {\n this.safeDispatchEvent('idle');\n });\n }\n return false;\n }\n if (this.pending < this.concurrency) {\n let job;\n for (const j of this.queue) {\n if (j.status === 'queued') {\n job = j;\n break;\n }\n }\n if (job == null) {\n return false;\n }\n this.safeDispatchEvent('active');\n this.pending++;\n void job.run()\n .finally(() => {\n // remove the job from the queue\n for (let i = 0; i < this.queue.length; i++) {\n if (this.queue[i] === job) {\n this.queue.splice(i, 1);\n break;\n }\n }\n this.pending--;\n this.tryToStartAnother();\n this.safeDispatchEvent('next');\n });\n return true;\n }\n return false;\n }\n enqueue(job) {\n this.queue.push(job);\n if (this.sort != null) {\n this.queue.sort(this.sort);\n }\n }\n /**\n * Adds a sync or async task to the queue. Always returns a promise.\n */\n async add(fn, options) {\n options?.signal?.throwIfAborted();\n const job = new Job(fn, options);\n this.enqueue(job);\n this.safeDispatchEvent('add');\n this.tryToStartAnother();\n return job.join(options)\n .then(result => {\n this.safeDispatchEvent('completed', { detail: result });\n this.safeDispatchEvent('success', { detail: { job, result } });\n return result;\n })\n .catch(err => {\n if (job.status === 'queued') {\n // job was aborted before it started - remove the job from the queue\n for (let i = 0; i < this.queue.length; i++) {\n if (this.queue[i] === job) {\n this.queue.splice(i, 1);\n break;\n }\n }\n }\n this.safeDispatchEvent('error', { detail: err });\n this.safeDispatchEvent('failure', { detail: { job, error: err } });\n throw err;\n });\n }\n /**\n * Clear the queue\n */\n clear() {\n this.queue.splice(0, this.queue.length);\n }\n /**\n * Abort all jobs in the queue and clear it\n */\n abort() {\n this.queue.forEach(job => {\n job.abort(new AbortError());\n });\n this.clear();\n }\n /**\n * Can be called multiple times. Useful if you for example add additional items at a later time.\n *\n * @returns A promise that settles when the queue becomes empty.\n */\n async onEmpty(options) {\n // Instantly resolve if the queue is empty\n if (this.size === 0) {\n return;\n }\n await raceEvent(this, 'empty', options?.signal);\n }\n /**\n * @returns A promise that settles when the queue size is less than the given\n * limit: `queue.size < limit`.\n *\n * If you want to avoid having the queue grow beyond a certain size you can\n * `await queue.onSizeLessThan()` before adding a new item.\n *\n * Note that this only limits the number of items waiting to start. There\n * could still be up to `concurrency` jobs already running that this call does\n * not include in its calculation.\n */\n async onSizeLessThan(limit, options) {\n // Instantly resolve if the queue is empty.\n if (this.size < limit) {\n return;\n }\n await raceEvent(this, 'next', options?.signal, {\n filter: () => this.size < limit\n });\n }\n /**\n * The difference with `.onEmpty` is that `.onIdle` guarantees that all work\n * from the queue has finished. `.onEmpty` merely signals that the queue is\n * empty, but it could mean that some promises haven't completed yet.\n *\n * @returns A promise that settles when the queue becomes empty, and all\n * promises have completed; `queue.size === 0 && queue.pending === 0`.\n */\n async onIdle(options) {\n // Instantly resolve if none pending and if nothing else is queued\n if (this.pending === 0 && this.size === 0) {\n return;\n }\n await raceEvent(this, 'idle', options?.signal);\n }\n /**\n * Size of the queue including running items\n */\n get size() {\n return this.queue.length;\n }\n /**\n * The number of queued items waiting to run.\n */\n get queued() {\n return this.queue.length - this.pending;\n }\n /**\n * The number of items currently running.\n */\n get running() {\n return this.pending;\n }\n /**\n * Returns an async generator that makes it easy to iterate over the results\n * of jobs added to the queue.\n *\n * The generator will end when the queue becomes idle, that is there are no\n * jobs running and no jobs that have yet to run.\n *\n * If you need to keep the queue open indefinitely, consider using it-pushable\n * instead.\n */\n async *toGenerator(options) {\n options?.signal?.throwIfAborted();\n const stream = pushable({\n objectMode: true\n });\n const cleanup = (err) => {\n if (err != null) {\n this.abort();\n }\n else {\n this.clear();\n }\n stream.end(err);\n };\n const onQueueJobComplete = (evt) => {\n if (evt.detail != null) {\n stream.push(evt.detail);\n }\n };\n const onQueueError = (evt) => {\n cleanup(evt.detail);\n };\n const onQueueIdle = () => {\n cleanup();\n };\n // clear the queue and throw if the query is aborted\n const onSignalAbort = () => {\n cleanup(new CodeError('Queue aborted', 'ERR_QUEUE_ABORTED'));\n };\n // add listeners\n this.addEventListener('completed', onQueueJobComplete);\n this.addEventListener('error', onQueueError);\n this.addEventListener('idle', onQueueIdle);\n options?.signal?.addEventListener('abort', onSignalAbort);\n try {\n yield* stream;\n }\n finally {\n // remove listeners\n this.removeEventListener('completed', onQueueJobComplete);\n this.removeEventListener('error', onQueueError);\n this.removeEventListener('idle', onQueueIdle);\n options?.signal?.removeEventListener('abort', onSignalAbort);\n // empty the queue for when the user has broken out of a loop early\n cleanup();\n }\n }\n}\n//# sourceMappingURL=index.js.map","import { Queue } from './queue/index.js';\n/**\n * Extends Queue to add support for querying queued jobs by peer id\n */\nexport class PeerQueue extends Queue {\n has(peerId) {\n return this.find(peerId) != null;\n }\n find(peerId) {\n return this.queue.find(job => {\n return peerId.equals(job.options.peerId);\n });\n }\n}\n//# sourceMappingURL=peer-queue.js.map","export * from './constants.defaults.js';\n/**\n * @see https://libp2p.github.io/js-libp2p/interfaces/index._internal_.ConnectionManagerConfig.html#minConnections\n */\nexport const MIN_CONNECTIONS = 5;\n/**\n * @see https://libp2p.github.io/js-libp2p/interfaces/index._internal_.ConnectionManagerConfig.html#maxConnections\n */\nexport const MAX_CONNECTIONS = 100;\n/**\n * @see https://libp2p.github.io/js-libp2p/interfaces/index._internal_.ConnectionManagerConfig.html#maxParallelDials\n */\nexport const MAX_PARALLEL_DIALS = 50;\n/**\n * @see https://libp2p.github.io/js-libp2p/interfaces/libp2p.index.unknown.ConnectionManagerInit.html#autoDialPeerRetryThreshold\n */\nexport const AUTO_DIAL_PEER_RETRY_THRESHOLD = 1000 * 60 * 7;\n//# sourceMappingURL=constants.browser.js.map","/**\n * @see https://libp2p.github.io/js-libp2p/interfaces/index._internal_.ConnectionManagerConfig.html#dialTimeout\n */\nexport const DIAL_TIMEOUT = 5e3;\n/**\n * @see https://libp2p.github.io/js-libp2p/interfaces/index._internal_.ConnectionManagerConfig.html#inboundUpgradeTimeout\n */\nexport const INBOUND_UPGRADE_TIMEOUT = 2e3;\n/**\n * @see https://libp2p.github.io/js-libp2p/interfaces/index._internal_.ConnectionManagerConfig.html#maxPeerAddrsToDial\n */\nexport const MAX_PEER_ADDRS_TO_DIAL = 25;\n/**\n * @see https://libp2p.github.io/js-libp2p/interfaces/index._internal_.ConnectionManagerConfig.html#autoDialInterval\n */\nexport const AUTO_DIAL_INTERVAL = 5000;\n/**\n * @see https://libp2p.github.io/js-libp2p/interfaces/index._internal_.ConnectionManagerConfig.html#autoDialConcurrency\n */\nexport const AUTO_DIAL_CONCURRENCY = 25;\n/**\n * @see https://libp2p.github.io/js-libp2p/interfaces/index._internal_.ConnectionManagerConfig.html#autoDialPriority\n */\nexport const AUTO_DIAL_PRIORITY = 0;\n/**\n * @see https://libp2p.github.io/js-libp2p/interfaces/index._internal_.ConnectionManagerConfig.html#autoDialMaxQueueLength\n */\nexport const AUTO_DIAL_MAX_QUEUE_LENGTH = 100;\n/**\n * @see https://libp2p.github.io/js-libp2p/interfaces/libp2p.index.unknown.ConnectionManagerInit.html#autoDialDiscoveredPeersDebounce\n */\nexport const AUTO_DIAL_DISCOVERED_PEERS_DEBOUNCE = 10;\n/**\n * @see https://libp2p.github.io/js-libp2p/interfaces/index._internal_.ConnectionManagerConfig.html#inboundConnectionThreshold\n */\nexport const INBOUND_CONNECTION_THRESHOLD = 5;\n/**\n * @see https://libp2p.github.io/js-libp2p/interfaces/index._internal_.ConnectionManagerConfig.html#maxIncomingPendingConnections\n */\nexport const MAX_INCOMING_PENDING_CONNECTIONS = 10;\n/**\n * Store as part of the peer store metadata for a given peer, the value for this\n * key is a timestamp of the last time a dial attempted failed with the relevant\n * peer stored as a string.\n *\n * Used to insure we do not endlessly try to auto dial peers we have recently\n * failed to dial.\n */\nexport const LAST_DIAL_FAILURE_KEY = 'last-dial-failure';\n/**\n * @see https://libp2p.github.io/js-libp2p/interfaces/index._internal_.ConnectionManagerConfig.html#maxDialQueueLength\n */\nexport const MAX_DIAL_QUEUE_LENGTH = 500;\n//# sourceMappingURL=constants.defaults.js.map","import { PeerMap, PeerSet } from '@libp2p/peer-collections';\nimport { PeerQueue } from '@libp2p/utils/peer-queue';\nimport { toString as uint8ArrayToString } from 'uint8arrays/to-string';\nimport { AUTO_DIAL_CONCURRENCY, AUTO_DIAL_DISCOVERED_PEERS_DEBOUNCE, AUTO_DIAL_INTERVAL, AUTO_DIAL_MAX_QUEUE_LENGTH, AUTO_DIAL_PEER_RETRY_THRESHOLD, AUTO_DIAL_PRIORITY, LAST_DIAL_FAILURE_KEY, MIN_CONNECTIONS } from './constants.js';\nconst defaultOptions = {\n minConnections: MIN_CONNECTIONS,\n maxQueueLength: AUTO_DIAL_MAX_QUEUE_LENGTH,\n autoDialConcurrency: AUTO_DIAL_CONCURRENCY,\n autoDialPriority: AUTO_DIAL_PRIORITY,\n autoDialInterval: AUTO_DIAL_INTERVAL,\n autoDialPeerRetryThreshold: AUTO_DIAL_PEER_RETRY_THRESHOLD,\n autoDialDiscoveredPeersDebounce: AUTO_DIAL_DISCOVERED_PEERS_DEBOUNCE\n};\nexport class AutoDial {\n connectionManager;\n peerStore;\n queue;\n minConnections;\n autoDialPriority;\n autoDialIntervalMs;\n autoDialMaxQueueLength;\n autoDialPeerRetryThresholdMs;\n autoDialDiscoveredPeersDebounce;\n autoDialInterval;\n started;\n running;\n log;\n /**\n * Proactively tries to connect to known peers stored in the PeerStore.\n * It will keep the number of connections below the upper limit and sort\n * the peers to connect based on whether we know their keys and protocols.\n */\n constructor(components, init) {\n this.connectionManager = components.connectionManager;\n this.peerStore = components.peerStore;\n this.minConnections = init.minConnections ?? defaultOptions.minConnections;\n this.autoDialPriority = init.autoDialPriority ?? defaultOptions.autoDialPriority;\n this.autoDialIntervalMs = init.autoDialInterval ?? defaultOptions.autoDialInterval;\n this.autoDialMaxQueueLength = init.maxQueueLength ?? defaultOptions.maxQueueLength;\n this.autoDialPeerRetryThresholdMs = init.autoDialPeerRetryThreshold ?? defaultOptions.autoDialPeerRetryThreshold;\n this.autoDialDiscoveredPeersDebounce = init.autoDialDiscoveredPeersDebounce ?? defaultOptions.autoDialDiscoveredPeersDebounce;\n this.log = components.logger.forComponent('libp2p:connection-manager:auto-dial');\n this.started = false;\n this.running = false;\n this.queue = new PeerQueue({\n concurrency: init.autoDialConcurrency ?? defaultOptions.autoDialConcurrency,\n metricName: 'libp2p_autodial_queue',\n metrics: components.metrics\n });\n this.queue.addEventListener('error', (evt) => {\n this.log.error('error during auto-dial', evt.detail);\n });\n // check the min connection limit whenever a peer disconnects\n components.events.addEventListener('connection:close', () => {\n this.autoDial()\n .catch(err => {\n this.log.error(err);\n });\n });\n // sometimes peers are discovered in quick succession so add a small\n // debounce to ensure all eligible peers are autodialed\n let debounce;\n // when new peers are discovered, dial them if we don't have\n // enough connections\n components.events.addEventListener('peer:discovery', () => {\n clearTimeout(debounce);\n debounce = setTimeout(() => {\n this.autoDial()\n .catch(err => {\n this.log.error(err);\n });\n }, this.autoDialDiscoveredPeersDebounce);\n });\n }\n isStarted() {\n return this.started;\n }\n start() {\n this.started = true;\n }\n afterStart() {\n this.autoDial()\n .catch(err => {\n this.log.error('error while autodialing', err);\n });\n }\n stop() {\n // clear the queue\n this.queue.clear();\n clearTimeout(this.autoDialInterval);\n this.started = false;\n this.running = false;\n }\n async autoDial() {\n if (!this.started || this.running) {\n return;\n }\n const connections = this.connectionManager.getConnectionsMap();\n const numConnections = connections.size;\n // already have enough connections\n if (numConnections >= this.minConnections) {\n if (this.minConnections > 0) {\n this.log.trace('have enough connections %d/%d', numConnections, this.minConnections);\n }\n // no need to schedule next autodial as it will be run when on\n // connection:close event\n return;\n }\n if (this.queue.size > this.autoDialMaxQueueLength) {\n this.log('not enough connections %d/%d but auto dial queue is full', numConnections, this.minConnections);\n this.sheduleNextAutodial();\n return;\n }\n this.running = true;\n this.log('not enough connections %d/%d - will dial peers to increase the number of connections', numConnections, this.minConnections);\n const dialQueue = new PeerSet(\n // @ts-expect-error boolean filter removes falsy peer IDs\n this.connectionManager.getDialQueue()\n .map(queue => queue.peerId)\n .filter(Boolean));\n // sort peers on whether we know protocols or public keys for them\n const peers = await this.peerStore.all({\n filters: [\n // remove some peers\n (peer) => {\n // remove peers without addresses\n if (peer.addresses.length === 0) {\n this.log.trace('not autodialing %p because they have no addresses', peer.id);\n return false;\n }\n // remove peers we are already connected to\n if (connections.has(peer.id)) {\n this.log.trace('not autodialing %p because they are already connected', peer.id);\n return false;\n }\n // remove peers we are already dialling\n if (dialQueue.has(peer.id)) {\n this.log.trace('not autodialing %p because they are already being dialed', peer.id);\n return false;\n }\n // remove peers already in the autodial queue\n if (this.queue.has(peer.id)) {\n this.log.trace('not autodialing %p because they are already being autodialed', peer.id);\n return false;\n }\n return true;\n }\n ]\n });\n // shuffle the peers - this is so peers with the same tag values will be\n // dialled in a different order each time\n const shuffledPeers = peers.sort(() => Math.random() > 0.5 ? 1 : -1);\n // sort shuffled peers by tag value\n const peerValues = new PeerMap();\n for (const peer of shuffledPeers) {\n if (peerValues.has(peer.id)) {\n continue;\n }\n // sum all tag values\n peerValues.set(peer.id, [...peer.tags.values()].reduce((acc, curr) => {\n return acc + curr.value;\n }, 0));\n }\n // sort by value, highest to lowest\n const sortedPeers = shuffledPeers.sort((a, b) => {\n const peerAValue = peerValues.get(a.id) ?? 0;\n const peerBValue = peerValues.get(b.id) ?? 0;\n if (peerAValue > peerBValue) {\n return -1;\n }\n if (peerAValue < peerBValue) {\n return 1;\n }\n return 0;\n });\n const peersThatHaveNotFailed = sortedPeers.filter(peer => {\n const lastDialFailure = peer.metadata.get(LAST_DIAL_FAILURE_KEY);\n if (lastDialFailure == null) {\n return true;\n }\n const lastDialFailureTimestamp = parseInt(uint8ArrayToString(lastDialFailure));\n if (isNaN(lastDialFailureTimestamp)) {\n return true;\n }\n // only dial if the time since the last failure is above the retry threshold\n return Date.now() - lastDialFailureTimestamp > this.autoDialPeerRetryThresholdMs;\n });\n this.log('selected %d/%d peers to dial', peersThatHaveNotFailed.length, peers.length);\n for (const peer of peersThatHaveNotFailed) {\n this.queue.add(async () => {\n const numConnections = this.connectionManager.getConnectionsMap().size;\n // Check to see if we still need to auto dial\n if (numConnections >= this.minConnections) {\n this.log('got enough connections now %d/%d', numConnections, this.minConnections);\n this.queue.clear();\n return;\n }\n this.log('connecting to a peerStore stored peer %p', peer.id);\n await this.connectionManager.openConnection(peer.id, {\n priority: this.autoDialPriority\n });\n }, {\n peerId: peer.id\n }).catch(err => {\n this.log.error('could not connect to peerStore stored peer', err);\n });\n }\n this.running = false;\n this.sheduleNextAutodial();\n }\n sheduleNextAutodial() {\n if (!this.started) {\n return;\n }\n this.autoDialInterval = setTimeout(() => {\n this.autoDial()\n .catch(err => {\n this.log.error('error while autodialing', err);\n });\n }, this.autoDialIntervalMs);\n }\n}\n//# sourceMappingURL=auto-dial.js.map","/**\n * Close the passed stream, falling back to aborting the stream if closing\n * cleanly fails.\n */\nexport async function safelyCloseStream(stream, options) {\n try {\n await stream?.close(options);\n }\n catch (err) {\n stream?.abort(err);\n }\n}\n/**\n * These are speculative protocols that are run automatically on connection open\n * so are usually not the reason the connection was opened.\n *\n * Consequently when requested it should be safe to close connections that only\n * have these protocol streams open.\n */\nconst DEFAULT_CLOSABLE_PROTOCOLS = [\n // identify\n '/ipfs/id/1.0.0',\n // identify-push\n '/ipfs/id/push/1.0.0',\n // autonat\n '/libp2p/autonat/1.0.0',\n // dcutr\n '/libp2p/dcutr'\n];\n/**\n * Close the passed connection if it has no streams, or only closable protocol\n * streams, falling back to aborting the connection if closing it cleanly fails.\n */\nexport async function safelyCloseConnectionIfUnused(connection, options) {\n const streamProtocols = connection?.streams?.map(stream => stream.protocol) ?? [];\n const closableProtocols = options?.closableProtocols ?? DEFAULT_CLOSABLE_PROTOCOLS;\n // if the connection has protocols not in the closable protocols list, do not\n // close the connection\n if (streamProtocols.filter(proto => proto != null && !closableProtocols.includes(proto)).length > 0) {\n return;\n }\n try {\n await connection?.close(options);\n }\n catch (err) {\n connection?.abort(err);\n }\n}\n//# sourceMappingURL=close.js.map","import { PeerMap } from '@libp2p/peer-collections';\nimport { safelyCloseConnectionIfUnused } from '@libp2p/utils/close';\nimport { MAX_CONNECTIONS } from './constants.js';\nconst defaultOptions = {\n maxConnections: MAX_CONNECTIONS,\n allow: []\n};\n/**\n * If we go over the max connections limit, choose some connections to close\n */\nexport class ConnectionPruner {\n maxConnections;\n connectionManager;\n peerStore;\n allow;\n events;\n log;\n constructor(components, init = {}) {\n this.maxConnections = init.maxConnections ?? defaultOptions.maxConnections;\n this.allow = init.allow ?? defaultOptions.allow;\n this.connectionManager = components.connectionManager;\n this.peerStore = components.peerStore;\n this.events = components.events;\n this.log = components.logger.forComponent('libp2p:connection-manager:connection-pruner');\n // check the max connection limit whenever a peer connects\n components.events.addEventListener('connection:open', () => {\n this.maybePruneConnections()\n .catch(err => {\n this.log.error(err);\n });\n });\n }\n /**\n * If we have more connections than our maximum, select some excess connections\n * to prune based on peer value\n */\n async maybePruneConnections() {\n const connections = this.connectionManager.getConnections();\n const numConnections = connections.length;\n this.log('checking max connections limit %d/%d', numConnections, this.maxConnections);\n if (numConnections <= this.maxConnections) {\n return;\n }\n const peerValues = new PeerMap();\n // work out peer values\n for (const connection of connections) {\n const remotePeer = connection.remotePeer;\n if (peerValues.has(remotePeer)) {\n continue;\n }\n peerValues.set(remotePeer, 0);\n try {\n const peer = await this.peerStore.get(remotePeer);\n // sum all tag values\n peerValues.set(remotePeer, [...peer.tags.values()].reduce((acc, curr) => {\n return acc + curr.value;\n }, 0));\n }\n catch (err) {\n if (err.code !== 'ERR_NOT_FOUND') {\n this.log.error('error loading peer tags', err);\n }\n }\n }\n const sortedConnections = this.sortConnections(connections, peerValues);\n // close some connections\n const toPrune = Math.max(numConnections - this.maxConnections, 0);\n const toClose = [];\n for (const connection of sortedConnections) {\n this.log('too many connections open - closing a connection to %p', connection.remotePeer);\n // check allow list\n const connectionInAllowList = this.allow.some((ma) => {\n return connection.remoteAddr.toString().startsWith(ma.toString());\n });\n // Connections in the allow list should be excluded from pruning\n if (!connectionInAllowList) {\n toClose.push(connection);\n }\n if (toClose.length === toPrune) {\n break;\n }\n }\n // close connections\n await Promise.all(toClose.map(async (connection) => {\n await safelyCloseConnectionIfUnused(connection, {\n signal: AbortSignal.timeout(1000)\n });\n }));\n // despatch prune event\n this.events.safeDispatchEvent('connection:prune', { detail: toClose });\n }\n sortConnections(connections, peerValues) {\n return connections\n // sort by connection age, newest to oldest\n .sort((a, b) => {\n const connectionALifespan = a.timeline.open;\n const connectionBLifespan = b.timeline.open;\n if (connectionALifespan < connectionBLifespan) {\n return 1;\n }\n if (connectionALifespan > connectionBLifespan) {\n return -1;\n }\n return 0;\n })\n // sort by direction, incoming first then outgoing\n .sort((a, b) => {\n if (a.direction === 'outbound' && b.direction === 'inbound') {\n return 1;\n }\n if (a.direction === 'inbound' && b.direction === 'outbound') {\n return -1;\n }\n return 0;\n })\n // sort by number of streams, lowest to highest\n .sort((a, b) => {\n if (a.streams.length > b.streams.length) {\n return 1;\n }\n if (a.streams.length < b.streams.length) {\n return -1;\n }\n return 0;\n })\n // sort by tag value, lowest to highest\n .sort((a, b) => {\n const peerAValue = peerValues.get(a.remotePeer) ?? 0;\n const peerBValue = peerValues.get(b.remotePeer) ?? 0;\n if (peerAValue > peerBValue) {\n return 1;\n }\n if (peerAValue < peerBValue) {\n return -1;\n }\n return 0;\n });\n }\n}\n//# sourceMappingURL=connection-pruner.js.map","import { Queue } from './queue/index.js';\nexport class PriorityQueue extends Queue {\n constructor(init = {}) {\n super({\n ...init,\n sort: (a, b) => {\n if (a.options.priority > b.options.priority) {\n return -1;\n }\n if (a.options.priority < b.options.priority) {\n return 1;\n }\n return 0;\n }\n });\n }\n}\n//# sourceMappingURL=priority-queue.js.map","/**\n * Takes an array of AbortSignals and returns a single signal.\n * If any signals are aborted, the returned signal will be aborted.\n */\nexport function anySignal(signals) {\n const controller = new globalThis.AbortController();\n function onAbort() {\n controller.abort();\n for (const signal of signals) {\n if (signal?.removeEventListener != null) {\n signal.removeEventListener('abort', onAbort);\n }\n }\n }\n for (const signal of signals) {\n if (signal?.aborted === true) {\n onAbort();\n break;\n }\n if (signal?.addEventListener != null) {\n signal.addEventListener('abort', onAbort);\n }\n }\n function clear() {\n for (const signal of signals) {\n if (signal?.removeEventListener != null) {\n signal.removeEventListener('abort', onAbort);\n }\n }\n }\n const signal = controller.signal;\n signal.clear = clear;\n return signal;\n}\n//# sourceMappingURL=index.js.map","/* eslint-disable max-depth */\nimport { CodeError, AggregateCodeError, ERR_TIMEOUT, setMaxListeners } from '@libp2p/interface';\nimport { PeerMap } from '@libp2p/peer-collections';\nimport { defaultAddressSort } from '@libp2p/utils/address-sort';\nimport { PriorityQueue } from '@libp2p/utils/priority-queue';\nimport { resolvers, multiaddr } from '@multiformats/multiaddr';\nimport { dnsaddrResolver } from '@multiformats/multiaddr/resolvers';\nimport { Circuit } from '@multiformats/multiaddr-matcher';\nimport { anySignal } from 'any-signal';\nimport { CustomProgressEvent } from 'progress-events';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport { codes } from '../errors.js';\nimport { getPeerAddress } from '../get-peer.js';\nimport { DIAL_TIMEOUT, MAX_PARALLEL_DIALS, MAX_PEER_ADDRS_TO_DIAL, LAST_DIAL_FAILURE_KEY, MAX_DIAL_QUEUE_LENGTH } from './constants.js';\nimport { resolveMultiaddrs } from './utils.js';\nimport { DEFAULT_DIAL_PRIORITY } from './index.js';\nconst defaultOptions = {\n addressSorter: defaultAddressSort,\n maxParallelDials: MAX_PARALLEL_DIALS,\n maxDialQueueLength: MAX_DIAL_QUEUE_LENGTH,\n maxPeerAddrsToDial: MAX_PEER_ADDRS_TO_DIAL,\n dialTimeout: DIAL_TIMEOUT,\n resolvers: {\n dnsaddr: dnsaddrResolver\n }\n};\nexport class DialQueue {\n queue;\n components;\n addressSorter;\n maxPeerAddrsToDial;\n maxDialQueueLength;\n dialTimeout;\n shutDownController;\n connections;\n log;\n constructor(components, init = {}) {\n this.addressSorter = init.addressSorter ?? defaultOptions.addressSorter;\n this.maxPeerAddrsToDial = init.maxPeerAddrsToDial ?? defaultOptions.maxPeerAddrsToDial;\n this.maxDialQueueLength = init.maxDialQueueLength ?? defaultOptions.maxDialQueueLength;\n this.dialTimeout = init.dialTimeout ?? defaultOptions.dialTimeout;\n this.connections = init.connections ?? new PeerMap();\n this.log = components.logger.forComponent('libp2p:connection-manager:dial-queue');\n this.components = components;\n this.shutDownController = new AbortController();\n setMaxListeners(Infinity, this.shutDownController.signal);\n for (const [key, value] of Object.entries(init.resolvers ?? {})) {\n resolvers.set(key, value);\n }\n // controls dial concurrency\n this.queue = new PriorityQueue({\n concurrency: init.maxParallelDials ?? defaultOptions.maxParallelDials,\n metricName: 'libp2p_dial_queue',\n metrics: components.metrics\n });\n // a started job errored\n this.queue.addEventListener('error', (event) => {\n this.log.error('error in dial queue', event.detail);\n });\n }\n start() {\n this.shutDownController = new AbortController();\n setMaxListeners(Infinity, this.shutDownController.signal);\n }\n /**\n * Clears any pending dials\n */\n stop() {\n this.shutDownController.abort();\n this.queue.abort();\n }\n /**\n * Connects to a given peer, multiaddr or list of multiaddrs.\n *\n * If a peer is passed, all known multiaddrs will be tried. If a multiaddr or\n * multiaddrs are passed only those will be dialled.\n *\n * Where a list of multiaddrs is passed, if any contain a peer id then all\n * multiaddrs in the list must contain the same peer id.\n *\n * The dial to the first address that is successfully able to upgrade a\n * connection will be used, all other dials will be aborted when that happens.\n */\n async dial(peerIdOrMultiaddr, options = {}) {\n const { peerId, multiaddrs } = getPeerAddress(peerIdOrMultiaddr);\n // make sure we don't have an existing connection to any of the addresses we\n // are about to dial\n const existingConnection = Array.from(this.connections.values()).flat().find(conn => {\n if (options.force === true) {\n return false;\n }\n if (conn.remotePeer.equals(peerId)) {\n return true;\n }\n return multiaddrs.find(addr => {\n return addr.equals(conn.remoteAddr);\n });\n });\n if (existingConnection != null) {\n this.log('already connected to %a', existingConnection.remoteAddr);\n options.onProgress?.(new CustomProgressEvent('dial-queue:already-connected'));\n return existingConnection;\n }\n // ready to dial, all async work finished - make sure we don't have any\n // pending dials in progress for this peer or set of multiaddrs\n const existingDial = this.queue.queue.find(job => {\n if (peerId?.equals(job.options.peerId) === true) {\n return true;\n }\n // does the dial contain any of the target multiaddrs?\n const addresses = job.options.multiaddrs;\n if (addresses == null) {\n return false;\n }\n for (const multiaddr of multiaddrs) {\n if (addresses.has(multiaddr.toString())) {\n return true;\n }\n }\n return false;\n });\n if (existingDial != null) {\n this.log('joining existing dial target for %p', peerId);\n // add all multiaddrs to the dial target\n for (const multiaddr of multiaddrs) {\n existingDial.options.multiaddrs.add(multiaddr.toString());\n }\n options.onProgress?.(new CustomProgressEvent('dial-queue:already-in-dial-queue'));\n return existingDial.join(options);\n }\n if (this.queue.size >= this.maxDialQueueLength) {\n throw new CodeError('Dial queue is full', 'ERR_DIAL_QUEUE_FULL');\n }\n this.log('creating dial target for %p', peerId, multiaddrs.map(ma => ma.toString()));\n options.onProgress?.(new CustomProgressEvent('dial-queue:add-to-dial-queue'));\n return this.queue.add(async (options) => {\n options?.onProgress?.(new CustomProgressEvent('dial-queue:start-dial'));\n // create abort conditions - need to do this before `calculateMultiaddrs` as\n // we may be about to resolve a dns addr which can time out\n const signal = this.createDialAbortController(options?.signal);\n let addrsToDial;\n try {\n // load addresses from address book, resolve and dnsaddrs, filter\n // undiallables, add peer IDs, etc\n addrsToDial = await this.calculateMultiaddrs(peerId, options?.multiaddrs, {\n ...options,\n signal\n });\n options?.onProgress?.(new CustomProgressEvent('dial-queue:calculated-addresses', addrsToDial));\n addrsToDial.map(({ multiaddr }) => multiaddr.toString()).forEach(addr => {\n options?.multiaddrs.add(addr);\n });\n }\n catch (err) {\n signal.clear();\n throw err;\n }\n try {\n let dialed = 0;\n const errors = [];\n for (const address of addrsToDial) {\n if (dialed === this.maxPeerAddrsToDial) {\n this.log('dialed maxPeerAddrsToDial (%d) addresses for %p, not trying any others', dialed, peerId);\n throw new CodeError('Peer had more than maxPeerAddrsToDial', codes.ERR_TOO_MANY_ADDRESSES);\n }\n dialed++;\n try {\n const conn = await this.components.transportManager.dial(address.multiaddr, {\n ...options,\n signal\n });\n this.log('dial to %a succeeded', address.multiaddr);\n return conn;\n }\n catch (err) {\n this.log.error('dial failed to %a', address.multiaddr, err);\n if (peerId != null) {\n // record the failed dial\n try {\n await this.components.peerStore.patch(peerId, {\n metadata: {\n [LAST_DIAL_FAILURE_KEY]: uint8ArrayFromString(Date.now().toString())\n }\n });\n }\n catch (err) {\n this.log.error('could not update last dial failure key for %p', peerId, err);\n }\n }\n // the user/dial timeout/shutdown controller signal aborted\n if (signal.aborted) {\n throw new CodeError(err.message, ERR_TIMEOUT);\n }\n errors.push(err);\n }\n }\n if (errors.length === 1) {\n throw errors[0];\n }\n throw new AggregateCodeError(errors, 'All multiaddr dials failed', codes.ERR_TRANSPORT_DIAL_FAILED);\n }\n finally {\n // clean up abort signals/controllers\n signal.clear();\n }\n }, {\n peerId,\n priority: options.priority ?? DEFAULT_DIAL_PRIORITY,\n multiaddrs: new Set(multiaddrs.map(ma => ma.toString())),\n signal: options.signal,\n onProgress: options.onProgress\n });\n }\n createDialAbortController(userSignal) {\n // let any signal abort the dial\n const signal = anySignal([\n AbortSignal.timeout(this.dialTimeout),\n this.shutDownController.signal,\n userSignal\n ]);\n // This emitter gets listened to a lot\n setMaxListeners(Infinity, signal);\n return signal;\n }\n // eslint-disable-next-line complexity\n async calculateMultiaddrs(peerId, multiaddrs = new Set(), options = {}) {\n const addrs = [...multiaddrs].map(ma => ({\n multiaddr: multiaddr(ma),\n isCertified: false\n }));\n // if a peer id or multiaddr(s) with a peer id, make sure it isn't our peer id and that we are allowed to dial it\n if (peerId != null) {\n if (this.components.peerId.equals(peerId)) {\n throw new CodeError('Tried to dial self', codes.ERR_DIALED_SELF);\n }\n if ((await this.components.connectionGater.denyDialPeer?.(peerId)) === true) {\n throw new CodeError('The dial request is blocked by gater.allowDialPeer', codes.ERR_PEER_DIAL_INTERCEPTED);\n }\n // if just a peer id was passed, load available multiaddrs for this peer\n // from the peer store\n if (addrs.length === 0) {\n this.log('loading multiaddrs for %p', peerId);\n try {\n const peer = await this.components.peerStore.get(peerId);\n addrs.push(...peer.addresses);\n this.log('loaded multiaddrs for %p', peerId, addrs.map(({ multiaddr }) => multiaddr.toString()));\n }\n catch (err) {\n if (err.code !== codes.ERR_NOT_FOUND) {\n throw err;\n }\n }\n }\n // if we still don't have any addresses for this peer, try a lookup\n // using the peer routing\n if (addrs.length === 0) {\n this.log('looking up multiaddrs for %p in the peer routing', peerId);\n try {\n const peerInfo = await this.components.peerRouting.findPeer(peerId);\n this.log('found multiaddrs for %p in the peer routing', peerId, addrs.map(({ multiaddr }) => multiaddr.toString()));\n addrs.push(...peerInfo.multiaddrs.map(multiaddr => ({\n multiaddr,\n isCertified: false\n })));\n }\n catch (err) {\n if (err.code !== codes.ERR_NO_ROUTERS_AVAILABLE) {\n this.log.error('looking up multiaddrs for %p in the peer routing failed', peerId, err);\n }\n }\n }\n }\n // resolve addresses - this can result in a one-to-many translation when\n // dnsaddrs are resolved\n let resolvedAddresses = (await Promise.all(addrs.map(async (addr) => {\n const result = await resolveMultiaddrs(addr.multiaddr, {\n dns: this.components.dns,\n ...options,\n log: this.log\n });\n if (result.length === 1 && result[0].equals(addr.multiaddr)) {\n return addr;\n }\n return result.map(multiaddr => ({\n multiaddr,\n isCertified: false\n }));\n })))\n .flat();\n // ensure the peer id is appended to the multiaddr\n if (peerId != null) {\n const peerIdMultiaddr = `/p2p/${peerId.toString()}`;\n resolvedAddresses = resolvedAddresses.map(addr => {\n const lastProto = addr.multiaddr.protos().pop();\n // do not append peer id to path multiaddrs\n if (lastProto?.path === true) {\n return addr;\n }\n // append peer id to multiaddr if it is not already present\n if (addr.multiaddr.getPeerId() == null) {\n return {\n multiaddr: addr.multiaddr.encapsulate(peerIdMultiaddr),\n isCertified: addr.isCertified\n };\n }\n return addr;\n });\n }\n const filteredAddrs = resolvedAddresses.filter(addr => {\n // filter out any multiaddrs that we do not have transports for\n if (this.components.transportManager.dialTransportForMultiaddr(addr.multiaddr) == null) {\n return false;\n }\n // if the resolved multiaddr has a PeerID but it's the wrong one, ignore it\n // - this can happen with addresses like bootstrap.libp2p.io that resolve\n // to multiple different peers\n const addrPeerId = addr.multiaddr.getPeerId();\n if (peerId != null && addrPeerId != null) {\n return peerId.equals(addrPeerId);\n }\n return true;\n });\n // deduplicate addresses\n const dedupedAddrs = new Map();\n for (const addr of filteredAddrs) {\n const maStr = addr.multiaddr.toString();\n const existing = dedupedAddrs.get(maStr);\n if (existing != null) {\n existing.isCertified = existing.isCertified || addr.isCertified || false;\n continue;\n }\n dedupedAddrs.set(maStr, addr);\n }\n const dedupedMultiaddrs = [...dedupedAddrs.values()];\n // make sure we actually have some addresses to dial\n if (dedupedMultiaddrs.length === 0) {\n throw new CodeError('The dial request has no valid addresses', codes.ERR_NO_VALID_ADDRESSES);\n }\n const gatedAdrs = [];\n for (const addr of dedupedMultiaddrs) {\n if (this.components.connectionGater.denyDialMultiaddr != null && await this.components.connectionGater.denyDialMultiaddr(addr.multiaddr)) {\n continue;\n }\n gatedAdrs.push(addr);\n }\n const sortedGatedAddrs = gatedAdrs.sort(this.addressSorter);\n // make sure we actually have some addresses to dial\n if (sortedGatedAddrs.length === 0) {\n throw new CodeError('The connection gater denied all addresses in the dial request', codes.ERR_NO_VALID_ADDRESSES);\n }\n this.log.trace('addresses for %p before filtering', peerId ?? 'unknown peer', resolvedAddresses.map(({ multiaddr }) => multiaddr.toString()));\n this.log.trace('addresses for %p after filtering', peerId ?? 'unknown peer', sortedGatedAddrs.map(({ multiaddr }) => multiaddr.toString()));\n return sortedGatedAddrs;\n }\n async isDialable(multiaddr, options = {}) {\n if (!Array.isArray(multiaddr)) {\n multiaddr = [multiaddr];\n }\n try {\n const addresses = await this.calculateMultiaddrs(undefined, new Set(multiaddr.map(ma => ma.toString())), options);\n if (options.runOnTransientConnection === false) {\n // return true if any resolved multiaddrs are not relay addresses\n return addresses.find(addr => {\n return !Circuit.matches(addr.multiaddr);\n }) != null;\n }\n return true;\n }\n catch (err) {\n this.log.trace('error calculating if multiaddr(s) were dialable', err);\n }\n return false;\n }\n}\n//# sourceMappingURL=dial-queue.js.map","import { resolvers } from '@multiformats/multiaddr';\n/**\n * Recursively resolve DNSADDR multiaddrs\n */\nexport async function resolveMultiaddrs(ma, options) {\n // check multiaddr resolvers\n let resolvable = false;\n for (const key of resolvers.keys()) {\n resolvable = ma.protoNames().includes(key);\n if (resolvable) {\n break;\n }\n }\n // return multiaddr if it is not resolvable\n if (!resolvable) {\n return [ma];\n }\n const output = await ma.resolve(options);\n options.log('resolved %s to', ma, output.map(ma => ma.toString()));\n return output;\n}\n//# sourceMappingURL=utils.js.map","import { CodeError, KEEP_ALIVE } from '@libp2p/interface';\nimport { PeerMap } from '@libp2p/peer-collections';\nimport { defaultAddressSort } from '@libp2p/utils/address-sort';\nimport { RateLimiter } from '@libp2p/utils/rate-limiter';\nimport { multiaddr } from '@multiformats/multiaddr';\nimport { dnsaddrResolver } from '@multiformats/multiaddr/resolvers';\nimport { CustomProgressEvent } from 'progress-events';\nimport { codes } from '../errors.js';\nimport { getPeerAddress } from '../get-peer.js';\nimport { AutoDial } from './auto-dial.js';\nimport { ConnectionPruner } from './connection-pruner.js';\nimport { AUTO_DIAL_CONCURRENCY, AUTO_DIAL_DISCOVERED_PEERS_DEBOUNCE, AUTO_DIAL_MAX_QUEUE_LENGTH, AUTO_DIAL_PEER_RETRY_THRESHOLD, AUTO_DIAL_PRIORITY, DIAL_TIMEOUT, INBOUND_CONNECTION_THRESHOLD, MAX_CONNECTIONS, MAX_DIAL_QUEUE_LENGTH, MAX_INCOMING_PENDING_CONNECTIONS, MAX_PARALLEL_DIALS, MAX_PEER_ADDRS_TO_DIAL, MIN_CONNECTIONS } from './constants.js';\nimport { DialQueue } from './dial-queue.js';\nexport const DEFAULT_DIAL_PRIORITY = 50;\nconst defaultOptions = {\n minConnections: MIN_CONNECTIONS,\n maxConnections: MAX_CONNECTIONS,\n inboundConnectionThreshold: INBOUND_CONNECTION_THRESHOLD,\n maxIncomingPendingConnections: MAX_INCOMING_PENDING_CONNECTIONS,\n autoDialConcurrency: AUTO_DIAL_CONCURRENCY,\n autoDialPriority: AUTO_DIAL_PRIORITY,\n autoDialMaxQueueLength: AUTO_DIAL_MAX_QUEUE_LENGTH,\n autoDialPeerRetryThreshold: AUTO_DIAL_PEER_RETRY_THRESHOLD,\n autoDialDiscoveredPeersDebounce: AUTO_DIAL_DISCOVERED_PEERS_DEBOUNCE\n};\n/**\n * Responsible for managing known connections.\n */\nexport class DefaultConnectionManager {\n started;\n connections;\n allow;\n deny;\n maxIncomingPendingConnections;\n incomingPendingConnections;\n maxConnections;\n dialQueue;\n autoDial;\n connectionPruner;\n inboundConnectionRateLimiter;\n peerStore;\n metrics;\n events;\n log;\n constructor(components, init = {}) {\n this.maxConnections = init.maxConnections ?? defaultOptions.maxConnections;\n const minConnections = init.minConnections ?? defaultOptions.minConnections;\n if (this.maxConnections < minConnections) {\n throw new CodeError('Connection Manager maxConnections must be greater than minConnections', codes.ERR_INVALID_PARAMETERS);\n }\n /**\n * Map of connections per peer\n */\n this.connections = new PeerMap();\n this.started = false;\n this.peerStore = components.peerStore;\n this.metrics = components.metrics;\n this.events = components.events;\n this.log = components.logger.forComponent('libp2p:connection-manager');\n this.onConnect = this.onConnect.bind(this);\n this.onDisconnect = this.onDisconnect.bind(this);\n this.events.addEventListener('connection:open', this.onConnect);\n this.events.addEventListener('connection:close', this.onDisconnect);\n // allow/deny lists\n this.allow = (init.allow ?? []).map(ma => multiaddr(ma));\n this.deny = (init.deny ?? []).map(ma => multiaddr(ma));\n this.incomingPendingConnections = 0;\n this.maxIncomingPendingConnections = init.maxIncomingPendingConnections ?? defaultOptions.maxIncomingPendingConnections;\n // controls individual peers trying to dial us too quickly\n this.inboundConnectionRateLimiter = new RateLimiter({\n points: init.inboundConnectionThreshold ?? defaultOptions.inboundConnectionThreshold,\n duration: 1\n });\n // controls what happens when we don't have enough connections\n this.autoDial = new AutoDial({\n connectionManager: this,\n peerStore: components.peerStore,\n events: components.events,\n logger: components.logger\n }, {\n minConnections,\n autoDialConcurrency: init.autoDialConcurrency ?? defaultOptions.autoDialConcurrency,\n autoDialPriority: init.autoDialPriority ?? defaultOptions.autoDialPriority,\n autoDialPeerRetryThreshold: init.autoDialPeerRetryThreshold ?? defaultOptions.autoDialPeerRetryThreshold,\n autoDialDiscoveredPeersDebounce: init.autoDialDiscoveredPeersDebounce ?? defaultOptions.autoDialDiscoveredPeersDebounce,\n maxQueueLength: init.autoDialMaxQueueLength ?? defaultOptions.autoDialMaxQueueLength\n });\n // controls what happens when we have too many connections\n this.connectionPruner = new ConnectionPruner({\n connectionManager: this,\n peerStore: components.peerStore,\n events: components.events,\n logger: components.logger\n }, {\n maxConnections: this.maxConnections,\n allow: this.allow\n });\n this.dialQueue = new DialQueue(components, {\n addressSorter: init.addressSorter ?? defaultAddressSort,\n maxParallelDials: init.maxParallelDials ?? MAX_PARALLEL_DIALS,\n maxDialQueueLength: init.maxDialQueueLength ?? MAX_DIAL_QUEUE_LENGTH,\n maxPeerAddrsToDial: init.maxPeerAddrsToDial ?? MAX_PEER_ADDRS_TO_DIAL,\n dialTimeout: init.dialTimeout ?? DIAL_TIMEOUT,\n resolvers: init.resolvers ?? {\n dnsaddr: dnsaddrResolver\n },\n connections: this.connections\n });\n }\n [Symbol.toStringTag] = '@libp2p/connection-manager';\n isStarted() {\n return this.started;\n }\n /**\n * Starts the Connection Manager. If Metrics are not enabled on libp2p\n * only event loop and connection limits will be monitored.\n */\n async start() {\n // track inbound/outbound connections\n this.metrics?.registerMetricGroup('libp2p_connection_manager_connections', {\n calculate: () => {\n const metric = {\n inbound: 0,\n outbound: 0\n };\n for (const conns of this.connections.values()) {\n for (const conn of conns) {\n if (conn.direction === 'inbound') {\n metric.inbound++;\n }\n else {\n metric.outbound++;\n }\n }\n }\n return metric;\n }\n });\n // track total number of streams per protocol\n this.metrics?.registerMetricGroup('libp2p_protocol_streams_total', {\n label: 'protocol',\n calculate: () => {\n const metric = {};\n for (const conns of this.connections.values()) {\n for (const conn of conns) {\n for (const stream of conn.streams) {\n const key = `${stream.direction} ${stream.protocol ?? 'unnegotiated'}`;\n metric[key] = (metric[key] ?? 0) + 1;\n }\n }\n }\n return metric;\n }\n });\n // track 90th percentile of streams per protocol\n this.metrics?.registerMetricGroup('libp2p_connection_manager_protocol_streams_per_connection_90th_percentile', {\n label: 'protocol',\n calculate: () => {\n const allStreams = {};\n for (const conns of this.connections.values()) {\n for (const conn of conns) {\n const streams = {};\n for (const stream of conn.streams) {\n const key = `${stream.direction} ${stream.protocol ?? 'unnegotiated'}`;\n streams[key] = (streams[key] ?? 0) + 1;\n }\n for (const [protocol, count] of Object.entries(streams)) {\n allStreams[protocol] = allStreams[protocol] ?? [];\n allStreams[protocol].push(count);\n }\n }\n }\n const metric = {};\n for (let [protocol, counts] of Object.entries(allStreams)) {\n counts = counts.sort((a, b) => a - b);\n const index = Math.floor(counts.length * 0.9);\n metric[protocol] = counts[index];\n }\n return metric;\n }\n });\n this.dialQueue.start();\n this.autoDial.start();\n this.started = true;\n this.log('started');\n }\n async afterStart() {\n // re-connect to any peers with the KEEP_ALIVE tag\n void Promise.resolve()\n .then(async () => {\n const keepAlivePeers = await this.peerStore.all({\n filters: [(peer) => {\n return peer.tags.has(KEEP_ALIVE);\n }]\n });\n await Promise.all(keepAlivePeers.map(async (peer) => {\n await this.openConnection(peer.id)\n .catch(err => {\n this.log.error(err);\n });\n }));\n })\n .catch(err => {\n this.log.error(err);\n });\n this.autoDial.afterStart();\n }\n /**\n * Stops the Connection Manager\n */\n async stop() {\n this.dialQueue.stop();\n this.autoDial.stop();\n // Close all connections we're tracking\n const tasks = [];\n for (const connectionList of this.connections.values()) {\n for (const connection of connectionList) {\n tasks.push((async () => {\n try {\n await connection.close();\n }\n catch (err) {\n this.log.error(err);\n }\n })());\n }\n }\n this.log('closing %d connections', tasks.length);\n await Promise.all(tasks);\n this.connections.clear();\n this.log('stopped');\n }\n onConnect(evt) {\n void this._onConnect(evt).catch(err => {\n this.log.error(err);\n });\n }\n /**\n * Tracks the incoming connection and check the connection limit\n */\n async _onConnect(evt) {\n const { detail: connection } = evt;\n if (!this.started) {\n // This can happen when we are in the process of shutting down the node\n await connection.close();\n return;\n }\n const peerId = connection.remotePeer;\n const storedConns = this.connections.get(peerId);\n let isNewPeer = false;\n if (storedConns != null) {\n storedConns.push(connection);\n }\n else {\n isNewPeer = true;\n this.connections.set(peerId, [connection]);\n }\n // only need to store RSA public keys, all other types are embedded in the peer id\n if (peerId.publicKey != null && peerId.type === 'RSA') {\n await this.peerStore.patch(peerId, {\n publicKey: peerId.publicKey\n });\n }\n if (isNewPeer) {\n this.events.safeDispatchEvent('peer:connect', { detail: connection.remotePeer });\n }\n }\n /**\n * Removes the connection from tracking\n */\n onDisconnect(evt) {\n const { detail: connection } = evt;\n if (!this.started) {\n // This can happen when we are in the process of shutting down the node\n return;\n }\n const peerId = connection.remotePeer;\n let storedConn = this.connections.get(peerId);\n if (storedConn != null && storedConn.length > 1) {\n storedConn = storedConn.filter((conn) => conn.id !== connection.id);\n this.connections.set(peerId, storedConn);\n }\n else if (storedConn != null) {\n this.connections.delete(peerId);\n this.events.safeDispatchEvent('peer:disconnect', { detail: connection.remotePeer });\n }\n }\n getConnections(peerId) {\n if (peerId != null) {\n return this.connections.get(peerId) ?? [];\n }\n let conns = [];\n for (const c of this.connections.values()) {\n conns = conns.concat(c);\n }\n return conns;\n }\n getConnectionsMap() {\n return this.connections;\n }\n async openConnection(peerIdOrMultiaddr, options = {}) {\n if (!this.isStarted()) {\n throw new CodeError('Not started', codes.ERR_NODE_NOT_STARTED);\n }\n options.signal?.throwIfAborted();\n const { peerId } = getPeerAddress(peerIdOrMultiaddr);\n if (peerId != null && options.force !== true) {\n this.log('dial %p', peerId);\n const existingConnection = this.getConnections(peerId)\n .find(conn => !conn.transient);\n if (existingConnection != null) {\n this.log('had an existing non-transient connection to %p', peerId);\n options.onProgress?.(new CustomProgressEvent('dial-queue:already-connected'));\n return existingConnection;\n }\n }\n const connection = await this.dialQueue.dial(peerIdOrMultiaddr, {\n ...options,\n priority: options.priority ?? DEFAULT_DIAL_PRIORITY\n });\n let peerConnections = this.connections.get(connection.remotePeer);\n if (peerConnections == null) {\n peerConnections = [];\n this.connections.set(connection.remotePeer, peerConnections);\n }\n // we get notified of connections via the Upgrader emitting \"connection\"\n // events, double check we aren't already tracking this connection before\n // storing it\n let trackedConnection = false;\n for (const conn of peerConnections) {\n if (conn.id === connection.id) {\n trackedConnection = true;\n }\n }\n if (!trackedConnection) {\n peerConnections.push(connection);\n }\n return connection;\n }\n async closeConnections(peerId, options = {}) {\n const connections = this.connections.get(peerId) ?? [];\n await Promise.all(connections.map(async (connection) => {\n try {\n await connection.close(options);\n }\n catch (err) {\n connection.abort(err);\n }\n }));\n }\n async acceptIncomingConnection(maConn) {\n // check deny list\n const denyConnection = this.deny.some(ma => {\n return maConn.remoteAddr.toString().startsWith(ma.toString());\n });\n if (denyConnection) {\n this.log('connection from %a refused - connection remote address was in deny list', maConn.remoteAddr);\n return false;\n }\n // check allow list\n const allowConnection = this.allow.some(ma => {\n return maConn.remoteAddr.toString().startsWith(ma.toString());\n });\n if (allowConnection) {\n this.incomingPendingConnections++;\n return true;\n }\n // check pending connections\n if (this.incomingPendingConnections === this.maxIncomingPendingConnections) {\n this.log('connection from %a refused - incomingPendingConnections exceeded by host', maConn.remoteAddr);\n return false;\n }\n if (maConn.remoteAddr.isThinWaistAddress()) {\n const host = maConn.remoteAddr.nodeAddress().address;\n try {\n await this.inboundConnectionRateLimiter.consume(host, 1);\n }\n catch {\n this.log('connection from %a refused - inboundConnectionThreshold exceeded by host %s', maConn.remoteAddr, host);\n return false;\n }\n }\n if (this.getConnections().length < this.maxConnections) {\n this.incomingPendingConnections++;\n return true;\n }\n this.log('connection from %a refused - maxConnections exceeded', maConn.remoteAddr);\n return false;\n }\n afterUpgradeInbound() {\n this.incomingPendingConnections--;\n }\n getDialQueue() {\n const statusMap = {\n queued: 'queued',\n running: 'active',\n errored: 'error',\n complete: 'success'\n };\n return this.dialQueue.queue.queue.map(job => {\n return {\n id: job.id,\n status: statusMap[job.status],\n peerId: job.options.peerId,\n multiaddrs: [...job.options.multiaddrs].map(ma => multiaddr(ma))\n };\n });\n }\n async isDialable(multiaddr, options = {}) {\n return this.dialQueue.isDialable(multiaddr, options);\n }\n}\n//# sourceMappingURL=index.js.map","export const KEEP_ALIVE = 'keep-alive';\n//# sourceMappingURL=tags.js.map","/**\n * Implements exponential moving average. Ported from `moving-average`.\n *\n * @see https://en.wikipedia.org/wiki/Moving_average#Exponential_moving_average\n * @see https://www.npmjs.com/package/moving-average\n */\nexport class MovingAverage {\n movingAverage;\n variance;\n deviation;\n forecast;\n timespan;\n previousTime;\n constructor(timespan) {\n this.timespan = timespan;\n this.movingAverage = 0;\n this.variance = 0;\n this.deviation = 0;\n this.forecast = 0;\n }\n alpha(t, pt) {\n return 1 - (Math.exp(-(t - pt) / this.timespan));\n }\n push(value, time = Date.now()) {\n if (this.previousTime != null) {\n // calculate moving average\n const a = this.alpha(time, this.previousTime);\n const diff = value - this.movingAverage;\n const incr = a * diff;\n this.movingAverage = a * value + (1 - a) * this.movingAverage;\n // calculate variance & deviation\n this.variance = (1 - a) * (this.variance + diff * incr);\n this.deviation = Math.sqrt(this.variance);\n // calculate forecast\n this.forecast = this.movingAverage + a * diff;\n }\n else {\n this.movingAverage = value;\n }\n this.previousTime = time;\n }\n}\n//# sourceMappingURL=moving-average.js.map","import { setMaxListeners } from '@libp2p/interface';\nimport { anySignal } from 'any-signal';\nimport { MovingAverage } from './moving-average.js';\nexport const DEFAULT_TIMEOUT_MULTIPLIER = 1.2;\nexport const DEFAULT_FAILURE_MULTIPLIER = 2;\nexport const DEFAULT_MIN_TIMEOUT = 2000;\nexport class AdaptiveTimeout {\n success;\n failure;\n next;\n metric;\n timeoutMultiplier;\n failureMultiplier;\n minTimeout;\n constructor(init = {}) {\n this.success = new MovingAverage(init.interval ?? 5000);\n this.failure = new MovingAverage(init.interval ?? 5000);\n this.next = new MovingAverage(init.interval ?? 5000);\n this.failureMultiplier = init.failureMultiplier ?? DEFAULT_FAILURE_MULTIPLIER;\n this.timeoutMultiplier = init.timeoutMultiplier ?? DEFAULT_TIMEOUT_MULTIPLIER;\n this.minTimeout = init.minTimeout ?? DEFAULT_MIN_TIMEOUT;\n if (init.metricName != null) {\n this.metric = init.metrics?.registerMetricGroup(init.metricName);\n }\n }\n getTimeoutSignal(options = {}) {\n // calculate timeout for individual peers based on moving average of\n // previous successful requests\n const timeout = Math.max(Math.round(this.next.movingAverage * (options.timeoutFactor ?? this.timeoutMultiplier)), this.minTimeout);\n const sendTimeout = AbortSignal.timeout(timeout);\n const timeoutSignal = anySignal([options.signal, sendTimeout]);\n setMaxListeners(Infinity, timeoutSignal, sendTimeout);\n timeoutSignal.start = Date.now();\n timeoutSignal.timeout = timeout;\n return timeoutSignal;\n }\n cleanUp(signal) {\n const time = Date.now() - signal.start;\n if (signal.aborted) {\n this.failure.push(time);\n this.next.push(time * this.failureMultiplier);\n this.metric?.update({\n failureMovingAverage: this.failure.movingAverage,\n failureDeviation: this.failure.deviation,\n failureForecast: this.failure.forecast,\n failureVariance: this.failure.variance,\n failure: time\n });\n }\n else {\n this.success.push(time);\n this.next.push(time);\n this.metric?.update({\n successMovingAverage: this.success.movingAverage,\n successDeviation: this.success.deviation,\n successForecast: this.success.forecast,\n successVariance: this.success.variance,\n success: time\n });\n }\n }\n}\n//# sourceMappingURL=adaptive-timeout.js.map","import { randomBytes } from '@libp2p/crypto';\nimport { serviceCapabilities } from '@libp2p/interface';\nimport { AdaptiveTimeout } from '@libp2p/utils/adaptive-timeout';\nimport { byteStream } from 'it-byte-stream';\nconst DEFAULT_PING_INTERVAL_MS = 10000;\nconst PROTOCOL_VERSION = '1.0.0';\nconst PROTOCOL_NAME = 'ping';\nconst PROTOCOL_PREFIX = 'ipfs';\nconst PING_LENGTH = 32;\nexport class ConnectionMonitor {\n protocol;\n components;\n log;\n heartbeatInterval;\n pingIntervalMs;\n abortController;\n timeout;\n constructor(components, init = {}) {\n this.components = components;\n this.protocol = `/${init.protocolPrefix ?? PROTOCOL_PREFIX}/${PROTOCOL_NAME}/${PROTOCOL_VERSION}`;\n this.log = components.logger.forComponent('libp2p:connection-monitor');\n this.pingIntervalMs = init.pingInterval ?? DEFAULT_PING_INTERVAL_MS;\n this.timeout = new AdaptiveTimeout({\n ...(init.pingTimeout ?? {}),\n metrics: components.metrics,\n metricName: 'libp2p_connection_monitor_ping_time_milliseconds'\n });\n }\n [Symbol.toStringTag] = '@libp2p/connection-monitor';\n [serviceCapabilities] = [\n '@libp2p/connection-monitor'\n ];\n start() {\n this.abortController = new AbortController();\n this.heartbeatInterval = setInterval(() => {\n this.components.connectionManager.getConnections().forEach(conn => {\n Promise.resolve().then(async () => {\n let start = Date.now();\n try {\n const signal = this.timeout.getTimeoutSignal({\n signal: this.abortController?.signal\n });\n const stream = await conn.newStream(this.protocol, {\n signal,\n runOnTransientConnection: true\n });\n const bs = byteStream(stream);\n start = Date.now();\n await Promise.all([\n bs.write(randomBytes(PING_LENGTH), {\n signal\n }),\n bs.read(PING_LENGTH, {\n signal\n })\n ]);\n conn.rtt = Date.now() - start;\n await bs.unwrap().close({\n signal\n });\n }\n catch (err) {\n if (err.code !== 'ERR_UNSUPPORTED_PROTOCOL') {\n throw err;\n }\n // protocol was unsupported, but that's ok as it means the remote\n // peer was still alive. We ran multistream-select which means two\n // round trips (e.g. 1x for the mss header, then another for the\n // protocol) so divide the time it took by two\n conn.rtt = (Date.now() - start) / 2;\n }\n })\n .catch(err => {\n this.log.error('error during heartbeat, aborting connection', err);\n conn.abort(err);\n });\n });\n }, this.pingIntervalMs);\n }\n stop() {\n this.abortController?.abort();\n if (this.heartbeatInterval != null) {\n clearInterval(this.heartbeatInterval);\n }\n }\n}\n//# sourceMappingURL=connection-monitor.js.map","import { CodeError } from '@libp2p/interface';\nimport { PeerSet } from '@libp2p/peer-collections';\nimport merge from 'it-merge';\nimport { codes, messages } from './errors.js';\nexport class CompoundContentRouting {\n routers;\n started;\n components;\n constructor(components, init) {\n this.routers = init.routers ?? [];\n this.started = false;\n this.components = components;\n }\n [Symbol.toStringTag] = '@libp2p/content-routing';\n isStarted() {\n return this.started;\n }\n async start() {\n this.started = true;\n }\n async stop() {\n this.started = false;\n }\n /**\n * Iterates over all content routers in parallel to find providers of the given key\n */\n async *findProviders(key, options = {}) {\n if (this.routers.length === 0) {\n throw new CodeError('No content routers available', codes.ERR_NO_ROUTERS_AVAILABLE);\n }\n const self = this;\n const seen = new PeerSet();\n for await (const peer of merge(...self.routers.map(router => router.findProviders(key, options)))) {\n // the peer was yielded by a content router without multiaddrs and we\n // failed to load them\n if (peer == null) {\n continue;\n }\n // store the addresses for the peer if found\n if (peer.multiaddrs.length > 0) {\n await this.components.peerStore.merge(peer.id, {\n multiaddrs: peer.multiaddrs\n });\n }\n // deduplicate peers\n if (seen.has(peer.id)) {\n continue;\n }\n seen.add(peer.id);\n yield peer;\n }\n }\n /**\n * Iterates over all content routers in parallel to notify it is\n * a provider of the given key\n */\n async provide(key, options = {}) {\n if (this.routers.length === 0) {\n throw new CodeError('No content routers available', codes.ERR_NO_ROUTERS_AVAILABLE);\n }\n await Promise.all(this.routers.map(async (router) => {\n await router.provide(key, options);\n }));\n }\n /**\n * Store the given key/value pair in the available content routings\n */\n async put(key, value, options) {\n if (!this.isStarted()) {\n throw new CodeError(messages.NOT_STARTED_YET, codes.ERR_NODE_NOT_STARTED);\n }\n await Promise.all(this.routers.map(async (router) => {\n await router.put(key, value, options);\n }));\n }\n /**\n * Get the value to the given key.\n * Times out after 1 minute by default.\n */\n async get(key, options) {\n if (!this.isStarted()) {\n throw new CodeError(messages.NOT_STARTED_YET, codes.ERR_NODE_NOT_STARTED);\n }\n return Promise.any(this.routers.map(async (router) => {\n return router.get(key, options);\n }));\n }\n}\n//# sourceMappingURL=content-routing.js.map","import { alloc as uint8ArrayAlloc } from 'uint8arrays/alloc';\nimport { equals as uint8ArrayEquals } from 'uint8arrays/equals';\nexport const MAX_FINGERPRINT_SIZE = 64;\nexport class Fingerprint {\n fp;\n h;\n seed;\n constructor(buf, hash, seed, fingerprintSize = 2) {\n if (fingerprintSize > MAX_FINGERPRINT_SIZE) {\n throw new TypeError('Invalid Fingerprint Size');\n }\n const fnv = hash.hashV(buf, seed);\n const fp = uint8ArrayAlloc(fingerprintSize);\n for (let i = 0; i < fp.length; i++) {\n fp[i] = fnv[i];\n }\n if (fp.length === 0) {\n fp[0] = 7;\n }\n this.fp = fp;\n this.h = hash;\n this.seed = seed;\n }\n hash() {\n return this.h.hash(this.fp, this.seed);\n }\n equals(other) {\n if (!(other?.fp instanceof Uint8Array)) {\n return false;\n }\n return uint8ArrayEquals(this.fp, other.fp);\n }\n}\n//# sourceMappingURL=fingerprint.js.map","export function getRandomInt(min, max) {\n return Math.floor(Math.random() * (max - min)) + min;\n}\n//# sourceMappingURL=utils.js.map","import { Fingerprint } from './fingerprint.js';\nimport { getRandomInt } from './utils.js';\nexport class Bucket {\n contents;\n constructor(size) {\n this.contents = new Array(size).fill(null);\n }\n has(fingerprint) {\n if (!(fingerprint instanceof Fingerprint)) {\n throw new TypeError('Invalid Fingerprint');\n }\n return this.contents.some((fp) => {\n return fingerprint.equals(fp);\n });\n }\n add(fingerprint) {\n if (!(fingerprint instanceof Fingerprint)) {\n throw new TypeError('Invalid Fingerprint');\n }\n for (let i = 0; i < this.contents.length; i++) {\n if (this.contents[i] == null) {\n this.contents[i] = fingerprint;\n return true;\n }\n }\n return true;\n }\n swap(fingerprint) {\n if (!(fingerprint instanceof Fingerprint)) {\n throw new TypeError('Invalid Fingerprint');\n }\n const i = getRandomInt(0, this.contents.length - 1);\n const current = this.contents[i];\n this.contents[i] = fingerprint;\n return current;\n }\n remove(fingerprint) {\n if (!(fingerprint instanceof Fingerprint)) {\n throw new TypeError('Invalid Fingerprint');\n }\n const found = this.contents.findIndex((fp) => {\n return fingerprint.equals(fp);\n });\n if (found > -1) {\n this.contents[found] = null;\n return true;\n }\n else {\n return false;\n }\n }\n}\n//# sourceMappingURL=bucket.js.map","// FNV_PRIMES and FNV_OFFSETS from\n// http://www.isthe.com/chongo/tech/comp/fnv/index.html#FNV-param\n\nconst FNV_PRIMES = {\n\t32: 16_777_619n,\n\t64: 1_099_511_628_211n,\n\t128: 309_485_009_821_345_068_724_781_371n,\n\t256: 374_144_419_156_711_147_060_143_317_175_368_453_031_918_731_002_211n,\n\t512: 35_835_915_874_844_867_368_919_076_489_095_108_449_946_327_955_754_392_558_399_825_615_420_669_938_882_575_126_094_039_892_345_713_852_759n,\n\t1024: 5_016_456_510_113_118_655_434_598_811_035_278_955_030_765_345_404_790_744_303_017_523_831_112_055_108_147_451_509_157_692_220_295_382_716_162_651_878_526_895_249_385_292_291_816_524_375_083_746_691_371_804_094_271_873_160_484_737_966_720_260_389_217_684_476_157_468_082_573n,\n};\n\nconst FNV_OFFSETS = {\n\t32: 2_166_136_261n,\n\t64: 14_695_981_039_346_656_037n,\n\t128: 144_066_263_297_769_815_596_495_629_667_062_367_629n,\n\t256: 100_029_257_958_052_580_907_070_968_620_625_704_837_092_796_014_241_193_945_225_284_501_741_471_925_557n,\n\t512: 9_659_303_129_496_669_498_009_435_400_716_310_466_090_418_745_672_637_896_108_374_329_434_462_657_994_582_932_197_716_438_449_813_051_892_206_539_805_784_495_328_239_340_083_876_191_928_701_583_869_517_785n,\n\t1024: 14_197_795_064_947_621_068_722_070_641_403_218_320_880_622_795_441_933_960_878_474_914_617_582_723_252_296_732_303_717_722_150_864_096_521_202_355_549_365_628_174_669_108_571_814_760_471_015_076_148_029_755_969_804_077_320_157_692_458_563_003_215_304_957_150_157_403_644_460_363_550_505_412_711_285_966_361_610_267_868_082_893_823_963_790_439_336_411_086_884_584_107_735_010_676_915n,\n};\n\nconst cachedEncoder = new globalThis.TextEncoder();\n\nfunction fnv1aUint8Array(uint8Array, size) {\n\tconst fnvPrime = FNV_PRIMES[size];\n\tlet hash = FNV_OFFSETS[size];\n\n\t// eslint-disable-next-line unicorn/no-for-loop -- This is a performance-sensitive loop\n\tfor (let index = 0; index < uint8Array.length; index++) {\n\t\thash ^= BigInt(uint8Array[index]);\n\t\thash = BigInt.asUintN(size, hash * fnvPrime);\n\t}\n\n\treturn hash;\n}\n\nfunction fnv1aEncodeInto(string, size, utf8Buffer) {\n\tif (utf8Buffer.length === 0) {\n\t\tthrow new Error('The `utf8Buffer` option must have a length greater than zero');\n\t}\n\n\tconst fnvPrime = FNV_PRIMES[size];\n\tlet hash = FNV_OFFSETS[size];\n\tlet remaining = string;\n\n\twhile (remaining.length > 0) {\n\t\tconst result = cachedEncoder.encodeInto(remaining, utf8Buffer);\n\t\tremaining = remaining.slice(result.read);\n\t\tfor (let index = 0; index < result.written; index++) {\n\t\t\thash ^= BigInt(utf8Buffer[index]);\n\t\t\thash = BigInt.asUintN(size, hash * fnvPrime);\n\t\t}\n\t}\n\n\treturn hash;\n}\n\nexport default function fnv1a(value, {size = 32, utf8Buffer} = {}) {\n\tif (!FNV_PRIMES[size]) {\n\t\tthrow new Error('The `size` option must be one of 32, 64, 128, 256, 512, or 1024');\n\t}\n\n\tif (typeof value === 'string') {\n\t\tif (utf8Buffer) {\n\t\t\treturn fnv1aEncodeInto(value, size, utf8Buffer);\n\t\t}\n\n\t\tvalue = cachedEncoder.encode(value);\n\t}\n\n\treturn fnv1aUint8Array(value, size);\n}\n","import fnv1aHash from '@sindresorhus/fnv1a';\nimport mur from 'murmurhash3js-revisited';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nexport const murmur3 = {\n hash: (input, seed) => {\n return mur.x86.hash32(input, seed);\n },\n hashV: (input, seed) => {\n return numberToBuffer(murmur3.hash(input, seed));\n }\n};\nexport const fnv1a = {\n hash: (input) => {\n return Number(fnv1aHash(input, {\n size: 32\n }));\n },\n hashV: (input, seed) => {\n return numberToBuffer(fnv1a.hash(input, seed));\n }\n};\nexport function numberToBuffer(num) {\n let hex = num.toString(16);\n if (hex.length % 2 === 1) {\n hex = `0${hex}`;\n }\n return uint8ArrayFromString(hex, 'base16');\n}\n//# sourceMappingURL=hashes.js.map","import { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport { Bucket } from './bucket.js';\nimport { Fingerprint, MAX_FINGERPRINT_SIZE } from './fingerprint.js';\nimport { fnv1a } from './hashes.js';\nimport { getRandomInt } from './utils.js';\nconst maxCuckooCount = 500;\nexport class CuckooFilter {\n bucketSize;\n filterSize;\n fingerprintSize;\n buckets;\n count;\n hash;\n seed;\n constructor(init) {\n this.filterSize = init.filterSize;\n this.bucketSize = init.bucketSize ?? 4;\n this.fingerprintSize = init.fingerprintSize ?? 2;\n this.count = 0;\n this.buckets = [];\n this.hash = init.hash ?? fnv1a;\n this.seed = init.seed ?? getRandomInt(0, Math.pow(2, 10));\n }\n add(item) {\n if (typeof item === 'string') {\n item = uint8ArrayFromString(item);\n }\n const fingerprint = new Fingerprint(item, this.hash, this.seed, this.fingerprintSize);\n const j = this.hash.hash(item, this.seed) % this.filterSize;\n const k = (j ^ fingerprint.hash()) % this.filterSize;\n if (this.buckets[j] == null) {\n this.buckets[j] = new Bucket(this.bucketSize);\n }\n if (this.buckets[k] == null) {\n this.buckets[k] = new Bucket(this.bucketSize);\n }\n if (this.buckets[j].add(fingerprint) || this.buckets[k].add(fingerprint)) {\n this.count++;\n return true;\n }\n const rand = [j, k];\n let i = rand[getRandomInt(0, rand.length - 1)];\n if (this.buckets[i] == null) {\n this.buckets[i] = new Bucket(this.bucketSize);\n }\n for (let n = 0; n < maxCuckooCount; n++) {\n const swapped = this.buckets[i].swap(fingerprint);\n if (swapped == null) {\n continue;\n }\n i = (i ^ swapped.hash()) % this.filterSize;\n if (this.buckets[i] == null) {\n this.buckets[i] = new Bucket(this.bucketSize);\n }\n if (this.buckets[i].add(swapped)) {\n this.count++;\n return true;\n }\n else {\n continue;\n }\n }\n return false;\n }\n has(item) {\n if (typeof item === 'string') {\n item = uint8ArrayFromString(item);\n }\n const fingerprint = new Fingerprint(item, this.hash, this.seed, this.fingerprintSize);\n const j = this.hash.hash(item, this.seed) % this.filterSize;\n const inJ = this.buckets[j]?.has(fingerprint) ?? false;\n if (inJ) {\n return inJ;\n }\n const k = (j ^ fingerprint.hash()) % this.filterSize;\n return this.buckets[k]?.has(fingerprint) ?? false;\n }\n remove(item) {\n if (typeof item === 'string') {\n item = uint8ArrayFromString(item);\n }\n const fingerprint = new Fingerprint(item, this.hash, this.seed, this.fingerprintSize);\n const j = this.hash.hash(item, this.seed) % this.filterSize;\n const inJ = this.buckets[j]?.remove(fingerprint) ?? false;\n if (inJ) {\n this.count--;\n return inJ;\n }\n const k = (j ^ fingerprint.hash()) % this.filterSize;\n const inK = this.buckets[k]?.remove(fingerprint) ?? false;\n if (inK) {\n this.count--;\n }\n return inK;\n }\n get reliable() {\n return Math.floor(100 * (this.count / this.filterSize)) <= 90;\n }\n}\n// max load constants, defined in the cuckoo paper\nconst MAX_LOAD = {\n 1: 0.5,\n 2: 0.84,\n 4: 0.95,\n 8: 0.98\n};\nfunction calculateBucketSize(errorRate = 0.001) {\n if (errorRate > 0.002) {\n return 2;\n }\n if (errorRate > 0.00001) {\n return 4;\n }\n return 8;\n}\nexport function optimize(maxItems, errorRate = 0.001) {\n // https://www.eecs.harvard.edu/~michaelm/postscripts/cuckoo-conext2014.pdf\n // Section 5.1 Optimal Bucket Size\n const bucketSize = calculateBucketSize(errorRate);\n const load = MAX_LOAD[bucketSize];\n // https://stackoverflow.com/questions/57555236/how-to-size-a-cuckoo-filter/57617208#57617208\n const filterSize = Math.round(maxItems / load);\n const fingerprintSize = Math.min(Math.ceil(Math.log2(1 / errorRate) + Math.log2(2 * bucketSize)), MAX_FINGERPRINT_SIZE);\n return {\n filterSize,\n bucketSize,\n fingerprintSize\n };\n}\nexport function createCuckooFilter(maxItems, errorRate = 0.005) {\n const opts = optimize(maxItems, errorRate);\n return new CuckooFilter(opts);\n}\n//# sourceMappingURL=cuckoo-filter.js.map","import { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport { CuckooFilter, optimize } from './cuckoo-filter.js';\nimport { fnv1a } from './hashes.js';\nimport { getRandomInt } from './utils.js';\nexport class ScalableCuckooFilter {\n filterSize;\n bucketSize;\n fingerprintSize;\n scale;\n filterSeries;\n hash;\n seed;\n constructor(init) {\n this.bucketSize = init.bucketSize ?? 4;\n this.filterSize = init.filterSize ?? (1 << 18) / this.bucketSize;\n this.fingerprintSize = init.fingerprintSize ?? 2;\n this.scale = init.scale ?? 2;\n this.hash = init.hash ?? fnv1a;\n this.seed = init.seed ?? getRandomInt(0, Math.pow(2, 10));\n this.filterSeries = [\n new CuckooFilter({\n filterSize: this.filterSize,\n bucketSize: this.bucketSize,\n fingerprintSize: this.fingerprintSize,\n hash: this.hash,\n seed: this.seed\n })\n ];\n }\n add(item) {\n if (typeof item === 'string') {\n item = uint8ArrayFromString(item);\n }\n if (this.has(item)) {\n return true;\n }\n let current = this.filterSeries.find((cuckoo) => {\n return cuckoo.reliable;\n });\n if (current == null) {\n const curSize = this.filterSize * Math.pow(this.scale, this.filterSeries.length);\n current = new CuckooFilter({\n filterSize: curSize,\n bucketSize: this.bucketSize,\n fingerprintSize: this.fingerprintSize,\n hash: this.hash,\n seed: this.seed\n });\n this.filterSeries.push(current);\n }\n return current.add(item);\n }\n has(item) {\n if (typeof item === 'string') {\n item = uint8ArrayFromString(item);\n }\n for (let i = 0; i < this.filterSeries.length; i++) {\n if (this.filterSeries[i].has(item)) {\n return true;\n }\n }\n return false;\n }\n remove(item) {\n if (typeof item === 'string') {\n item = uint8ArrayFromString(item);\n }\n for (let i = 0; i < this.filterSeries.length; i++) {\n if (this.filterSeries[i].remove(item)) {\n return true;\n }\n }\n return false;\n }\n get count() {\n return this.filterSeries.reduce((acc, curr) => {\n return acc + curr.count;\n }, 0);\n }\n}\nexport function createScalableCuckooFilter(maxItems, errorRate = 0.001, options) {\n return new ScalableCuckooFilter({\n ...optimize(maxItems, errorRate),\n ...(options ?? {})\n });\n}\n//# sourceMappingURL=scalable-cuckoo-filter.js.map","/**\n * @packageDocumentation\n *\n * Takes an (async) iterable that emits promise-returning functions, invokes them in parallel up to the concurrency limit and emits the results as they become available, optionally in the same order as the input\n *\n * @example\n *\n * ```javascript\n * import parallel from 'it-parallel'\n * import all from 'it-all'\n * import delay from 'delay'\n *\n * // This can also be an iterator, async iterator, generator, etc\n * const input = [\n * async () => {\n * console.info('start 1')\n * await delay(500)\n *\n * console.info('end 1')\n * return 1\n * },\n * async () => {\n * console.info('start 2')\n * await delay(200)\n *\n * console.info('end 2')\n * return 2\n * },\n * async () => {\n * console.info('start 3')\n * await delay(100)\n *\n * console.info('end 3')\n * return 3\n * }\n * ]\n *\n * const result = await all(parallel(input, {\n * concurrency: 2\n * }))\n *\n * // output:\n * // start 1\n * // start 2\n * // end 2\n * // start 3\n * // end 3\n * // end 1\n *\n * console.info(result) // [2, 3, 1]\n * ```\n *\n * If order is important, pass `ordered: true` as an option:\n *\n * ```javascript\n * const result = await all(parallel(input, {\n * concurrency: 2,\n * ordered: true\n * }))\n *\n * // output:\n * // start 1\n * // start 2\n * // end 2\n * // start 3\n * // end 3\n * // end 1\n *\n * console.info(result) // [1, 2, 3]\n * ```\n */\nimport defer from 'p-defer';\nconst CustomEvent = globalThis.CustomEvent ?? Event;\n/**\n * Takes an (async) iterator that emits promise-returning functions,\n * invokes them in parallel and emits the results as they become available but\n * in the same order as the input\n */\nexport default async function* parallel(source, options = {}) {\n let concurrency = options.concurrency ?? Infinity;\n if (concurrency < 1) {\n concurrency = Infinity;\n }\n const ordered = options.ordered == null ? false : options.ordered;\n const emitter = new EventTarget();\n const ops = [];\n let slotAvailable = defer();\n let resultAvailable = defer();\n let sourceFinished = false;\n let sourceErr;\n let opErred = false;\n emitter.addEventListener('task-complete', () => {\n resultAvailable.resolve();\n });\n void Promise.resolve().then(async () => {\n try {\n for await (const task of source) {\n if (ops.length === concurrency) {\n slotAvailable = defer();\n await slotAvailable.promise;\n }\n if (opErred) {\n break;\n }\n const op = {\n done: false\n };\n ops.push(op);\n task()\n .then(result => {\n op.done = true;\n op.ok = true;\n op.value = result;\n emitter.dispatchEvent(new CustomEvent('task-complete'));\n }, err => {\n op.done = true;\n op.err = err;\n emitter.dispatchEvent(new CustomEvent('task-complete'));\n });\n }\n sourceFinished = true;\n emitter.dispatchEvent(new CustomEvent('task-complete'));\n }\n catch (err) {\n sourceErr = err;\n emitter.dispatchEvent(new CustomEvent('task-complete'));\n }\n });\n function valuesAvailable() {\n if (ordered) {\n return ops[0]?.done;\n }\n return Boolean(ops.find(op => op.done));\n }\n function* yieldOrderedValues() {\n while ((ops.length > 0) && ops[0].done) {\n const op = ops[0];\n ops.shift();\n if (op.ok) {\n yield op.value;\n }\n else {\n // allow the source to exit\n opErred = true;\n slotAvailable.resolve();\n throw op.err;\n }\n slotAvailable.resolve();\n }\n }\n function* yieldUnOrderedValues() {\n // more values can become available while we wait for `yield`\n // to return control to this function\n while (valuesAvailable()) {\n for (let i = 0; i < ops.length; i++) {\n if (ops[i].done) {\n const op = ops[i];\n ops.splice(i, 1);\n i--;\n if (op.ok) {\n yield op.value;\n }\n else {\n opErred = true;\n slotAvailable.resolve();\n throw op.err;\n }\n slotAvailable.resolve();\n }\n }\n }\n }\n while (true) {\n if (!valuesAvailable()) {\n resultAvailable = defer();\n await resultAvailable.promise;\n }\n if (sourceErr != null) {\n // the source threw an error, propagate it\n throw sourceErr;\n }\n if (ordered) {\n yield* yieldOrderedValues();\n }\n else {\n yield* yieldUnOrderedValues();\n }\n if (sourceFinished && ops.length === 0) {\n // not waiting for any results and no more tasks so we are done\n break;\n }\n }\n}\n//# sourceMappingURL=index.js.map","import { CodeError } from '@libp2p/interface';\nimport { createScalableCuckooFilter } from '@libp2p/utils/filters';\nimport merge from 'it-merge';\nimport parallel from 'it-parallel';\nimport { codes, messages } from './errors.js';\nexport class DefaultPeerRouting {\n log;\n peerId;\n peerStore;\n routers;\n constructor(components, init = {}) {\n this.log = components.logger.forComponent('libp2p:peer-routing');\n this.peerId = components.peerId;\n this.peerStore = components.peerStore;\n this.routers = init.routers ?? [];\n }\n [Symbol.toStringTag] = '@libp2p/peer-routing';\n /**\n * Iterates over all peer routers in parallel to find the given peer\n */\n async findPeer(id, options) {\n if (this.routers.length === 0) {\n throw new CodeError('No peer routers available', codes.ERR_NO_ROUTERS_AVAILABLE);\n }\n if (id.toString() === this.peerId.toString()) {\n throw new CodeError('Should not try to find self', codes.ERR_FIND_SELF);\n }\n const self = this;\n const source = merge(...this.routers.map(router => (async function* () {\n try {\n yield await router.findPeer(id, options);\n }\n catch (err) {\n self.log.error(err);\n }\n })()));\n for await (const peer of source) {\n if (peer == null) {\n continue;\n }\n // store the addresses for the peer if found\n if (peer.multiaddrs.length > 0) {\n await this.peerStore.merge(peer.id, {\n multiaddrs: peer.multiaddrs\n });\n }\n return peer;\n }\n throw new CodeError(messages.NOT_FOUND, codes.ERR_NOT_FOUND);\n }\n /**\n * Attempt to find the closest peers on the network to the given key\n */\n async *getClosestPeers(key, options = {}) {\n if (this.routers.length === 0) {\n throw new CodeError('No peer routers available', codes.ERR_NO_ROUTERS_AVAILABLE);\n }\n const self = this;\n const seen = createScalableCuckooFilter(1024);\n for await (const peer of parallel(async function* () {\n const source = merge(...self.routers.map(router => router.getClosestPeers(key, options)));\n for await (let peer of source) {\n yield async () => {\n // find multiaddrs if they are missing\n if (peer.multiaddrs.length === 0) {\n try {\n peer = await self.findPeer(peer.id, {\n ...options,\n useCache: false\n });\n }\n catch (err) {\n self.log.error('could not find peer multiaddrs', err);\n return;\n }\n }\n return peer;\n };\n }\n }())) {\n if (peer == null) {\n continue;\n }\n // store the addresses for the peer if found\n if (peer.multiaddrs.length > 0) {\n await this.peerStore.merge(peer.id, {\n multiaddrs: peer.multiaddrs\n });\n }\n // deduplicate peers\n if (seen.has(peer.id.toBytes())) {\n continue;\n }\n seen.add(peer.id.toBytes());\n yield peer;\n }\n }\n}\n//# sourceMappingURL=peer-routing.js.map","import { randomBytes } from '@libp2p/crypto';\nimport { TypedEventEmitter, setMaxListeners } from '@libp2p/interface';\nimport { anySignal } from 'any-signal';\nimport pDefer, {} from 'p-defer';\nimport { raceEvent } from 'race-event';\nimport { raceSignal } from 'race-signal';\nexport class RandomWalk extends TypedEventEmitter {\n peerRouting;\n log;\n walking;\n walkers;\n shutdownController;\n walkController;\n needNext;\n constructor(components) {\n super();\n this.log = components.logger.forComponent('libp2p:random-walk');\n this.peerRouting = components.peerRouting;\n this.walkers = 0;\n this.walking = false;\n // stops any in-progress walks when the node is shut down\n this.shutdownController = new AbortController();\n setMaxListeners(Infinity, this.shutdownController.signal);\n }\n [Symbol.toStringTag] = '@libp2p/random-walk';\n start() {\n this.shutdownController = new AbortController();\n setMaxListeners(Infinity, this.shutdownController.signal);\n }\n stop() {\n this.shutdownController.abort();\n }\n async *walk(options) {\n if (!this.walking) {\n // start the query that causes walk:peer events to be emitted\n this.startWalk();\n }\n this.walkers++;\n const signal = anySignal([this.shutdownController.signal, options?.signal]);\n setMaxListeners(Infinity, signal);\n try {\n while (true) {\n // if another consumer has paused the query, start it again\n this.needNext?.resolve();\n this.needNext = pDefer();\n // wait for a walk:peer or walk:error event\n const event = await raceEvent(this, 'walk:peer', signal, {\n errorEvent: 'walk:error'\n });\n yield event.detail;\n }\n }\n finally {\n signal.clear();\n this.walkers--;\n // stop the walk if no more consumers are interested\n if (this.walkers === 0) {\n this.walkController?.abort();\n this.walkController = undefined;\n }\n }\n }\n startWalk() {\n this.walking = true;\n // the signal for this controller will be aborted if no more random peers\n // are required\n this.walkController = new AbortController();\n setMaxListeners(Infinity, this.walkController.signal);\n const signal = anySignal([this.walkController.signal, this.shutdownController.signal]);\n setMaxListeners(Infinity, signal);\n const start = Date.now();\n let found = 0;\n Promise.resolve().then(async () => {\n this.log('start walk');\n // find peers until no more consumers are interested\n while (this.walkers > 0) {\n try {\n const data = randomBytes(32);\n let s = Date.now();\n for await (const peer of this.peerRouting.getClosestPeers(data, { signal })) {\n if (signal.aborted) {\n this.log('aborting walk');\n }\n signal.throwIfAborted();\n this.log('found peer %p after %dms for %d walkers', peer.id, Date.now() - s, this.walkers);\n found++;\n this.safeDispatchEvent('walk:peer', {\n detail: peer\n });\n // if we only have one consumer, pause the query until they request\n // another random peer or they signal they are no longer interested\n if (this.walkers === 1 && this.needNext != null) {\n this.log('wait for need next');\n await raceSignal(this.needNext.promise, signal);\n }\n s = Date.now();\n }\n this.log('walk iteration for %b and %d walkers finished, found %d peers', data, this.walkers, found);\n }\n catch (err) {\n this.log.error('randomwalk errored', err);\n this.safeDispatchEvent('walk:error', {\n detail: err\n });\n }\n }\n this.log('no walkers left, ended walk');\n })\n .catch(err => {\n this.log.error('randomwalk errored', err);\n })\n .finally(() => {\n this.log('finished walk, found %d peers after %dms', found, Date.now() - start);\n this.walking = false;\n });\n }\n}\n//# sourceMappingURL=random-walk.js.map","import { CodeError } from '@libp2p/interface';\nimport merge from 'merge-options';\nimport { codes } from './errors.js';\nexport const DEFAULT_MAX_INBOUND_STREAMS = 32;\nexport const DEFAULT_MAX_OUTBOUND_STREAMS = 64;\n/**\n * Responsible for notifying registered protocols of events in the network.\n */\nexport class DefaultRegistrar {\n log;\n topologies;\n handlers;\n components;\n constructor(components) {\n this.log = components.logger.forComponent('libp2p:registrar');\n this.topologies = new Map();\n this.handlers = new Map();\n this.components = components;\n this._onDisconnect = this._onDisconnect.bind(this);\n this._onPeerUpdate = this._onPeerUpdate.bind(this);\n this._onPeerIdentify = this._onPeerIdentify.bind(this);\n this.components.events.addEventListener('peer:disconnect', this._onDisconnect);\n this.components.events.addEventListener('peer:update', this._onPeerUpdate);\n this.components.events.addEventListener('peer:identify', this._onPeerIdentify);\n }\n [Symbol.toStringTag] = '@libp2p/registrar';\n getProtocols() {\n return Array.from(new Set([\n ...this.handlers.keys()\n ])).sort();\n }\n getHandler(protocol) {\n const handler = this.handlers.get(protocol);\n if (handler == null) {\n throw new CodeError(`No handler registered for protocol ${protocol}`, codes.ERR_NO_HANDLER_FOR_PROTOCOL);\n }\n return handler;\n }\n getTopologies(protocol) {\n const topologies = this.topologies.get(protocol);\n if (topologies == null) {\n return [];\n }\n return [\n ...topologies.values()\n ];\n }\n /**\n * Registers the `handler` for each protocol\n */\n async handle(protocol, handler, opts) {\n if (this.handlers.has(protocol)) {\n throw new CodeError(`Handler already registered for protocol ${protocol}`, codes.ERR_PROTOCOL_HANDLER_ALREADY_REGISTERED);\n }\n const options = merge.bind({ ignoreUndefined: true })({\n maxInboundStreams: DEFAULT_MAX_INBOUND_STREAMS,\n maxOutboundStreams: DEFAULT_MAX_OUTBOUND_STREAMS\n }, opts);\n this.handlers.set(protocol, {\n handler,\n options\n });\n // Add new protocol to self protocols in the peer store\n await this.components.peerStore.merge(this.components.peerId, {\n protocols: [protocol]\n });\n }\n /**\n * Removes the handler for each protocol. The protocol\n * will no longer be supported on streams.\n */\n async unhandle(protocols) {\n const protocolList = Array.isArray(protocols) ? protocols : [protocols];\n protocolList.forEach(protocol => {\n this.handlers.delete(protocol);\n });\n // Update self protocols in the peer store\n await this.components.peerStore.patch(this.components.peerId, {\n protocols: this.getProtocols()\n });\n }\n /**\n * Register handlers for a set of multicodecs given\n */\n async register(protocol, topology) {\n if (topology == null) {\n throw new CodeError('invalid topology', codes.ERR_INVALID_PARAMETERS);\n }\n // Create topology\n const id = `${(Math.random() * 1e9).toString(36)}${Date.now()}`;\n let topologies = this.topologies.get(protocol);\n if (topologies == null) {\n topologies = new Map();\n this.topologies.set(protocol, topologies);\n }\n topologies.set(id, topology);\n return id;\n }\n /**\n * Unregister topology\n */\n unregister(id) {\n for (const [protocol, topologies] of this.topologies.entries()) {\n if (topologies.has(id)) {\n topologies.delete(id);\n if (topologies.size === 0) {\n this.topologies.delete(protocol);\n }\n }\n }\n }\n /**\n * Remove a disconnected peer from the record\n */\n _onDisconnect(evt) {\n const remotePeer = evt.detail;\n void this.components.peerStore.get(remotePeer)\n .then(peer => {\n for (const protocol of peer.protocols) {\n const topologies = this.topologies.get(protocol);\n if (topologies == null) {\n // no topologies are interested in this protocol\n continue;\n }\n for (const topology of topologies.values()) {\n if (topology.filter?.has(remotePeer) === false) {\n continue;\n }\n topology.filter?.remove(remotePeer);\n topology.onDisconnect?.(remotePeer);\n }\n }\n })\n .catch(err => {\n if (err.code === codes.ERR_NOT_FOUND) {\n // peer has not completed identify so they are not in the peer store\n return;\n }\n this.log.error('could not inform topologies of disconnecting peer %p', remotePeer, err);\n });\n }\n /**\n * When a peer is updated, if they have removed supported protocols notify any\n * topologies interested in the removed protocols.\n */\n _onPeerUpdate(evt) {\n const { peer, previous } = evt.detail;\n const removed = (previous?.protocols ?? []).filter(protocol => !peer.protocols.includes(protocol));\n for (const protocol of removed) {\n const topologies = this.topologies.get(protocol);\n if (topologies == null) {\n // no topologies are interested in this protocol\n continue;\n }\n for (const topology of topologies.values()) {\n if (topology.filter?.has(peer.id) === false) {\n continue;\n }\n topology.filter?.remove(peer.id);\n topology.onDisconnect?.(peer.id);\n }\n }\n }\n /**\n * After identify has completed and we have received the list of supported\n * protocols, notify any topologies interested in those protocols.\n */\n _onPeerIdentify(evt) {\n const protocols = evt.detail.protocols;\n const connection = evt.detail.connection;\n const peerId = evt.detail.peerId;\n for (const protocol of protocols) {\n const topologies = this.topologies.get(protocol);\n if (topologies == null) {\n // no topologies are interested in this protocol\n continue;\n }\n for (const topology of topologies.values()) {\n if (connection.transient && topology.notifyOnTransient !== true) {\n continue;\n }\n if (topology.filter?.has(peerId) === true) {\n continue;\n }\n topology.filter?.add(peerId);\n topology.onConnect?.(peerId, connection);\n }\n }\n }\n}\n//# sourceMappingURL=registrar.js.map","class TrackedMap extends Map {\n metric;\n constructor(init) {\n super();\n const { name, metrics } = init;\n this.metric = metrics.registerMetric(name);\n this.updateComponentMetric();\n }\n set(key, value) {\n super.set(key, value);\n this.updateComponentMetric();\n return this;\n }\n delete(key) {\n const deleted = super.delete(key);\n this.updateComponentMetric();\n return deleted;\n }\n clear() {\n super.clear();\n this.updateComponentMetric();\n }\n updateComponentMetric() {\n this.metric.update(this.size);\n }\n}\nexport function trackedMap(config) {\n const { name, metrics } = config;\n let map;\n if (metrics != null) {\n map = new TrackedMap({ name, metrics });\n }\n else {\n map = new Map();\n }\n return map;\n}\n//# sourceMappingURL=tracked-map.js.map","import { CodeError, FaultTolerance } from '@libp2p/interface';\nimport { trackedMap } from '@libp2p/utils/tracked-map';\nimport { CustomProgressEvent } from 'progress-events';\nimport { codes } from './errors.js';\nexport class DefaultTransportManager {\n log;\n components;\n transports;\n listeners;\n faultTolerance;\n started;\n constructor(components, init = {}) {\n this.log = components.logger.forComponent('libp2p:transports');\n this.components = components;\n this.started = false;\n this.transports = new Map();\n this.listeners = trackedMap({\n name: 'libp2p_transport_manager_listeners',\n metrics: this.components.metrics\n });\n this.faultTolerance = init.faultTolerance ?? FaultTolerance.FATAL_ALL;\n }\n [Symbol.toStringTag] = '@libp2p/transport-manager';\n /**\n * Adds a `Transport` to the manager\n */\n add(transport) {\n const tag = transport[Symbol.toStringTag];\n if (tag == null) {\n throw new CodeError('Transport must have a valid tag', codes.ERR_INVALID_KEY);\n }\n if (this.transports.has(tag)) {\n throw new CodeError(`There is already a transport with the tag ${tag}`, codes.ERR_DUPLICATE_TRANSPORT);\n }\n this.log('adding transport %s', tag);\n this.transports.set(tag, transport);\n if (!this.listeners.has(tag)) {\n this.listeners.set(tag, []);\n }\n }\n isStarted() {\n return this.started;\n }\n start() {\n this.started = true;\n }\n async afterStart() {\n // Listen on the provided transports for the provided addresses\n const addrs = this.components.addressManager.getListenAddrs();\n await this.listen(addrs);\n }\n /**\n * Stops all listeners\n */\n async stop() {\n const tasks = [];\n for (const [key, listeners] of this.listeners) {\n this.log('closing listeners for %s', key);\n while (listeners.length > 0) {\n const listener = listeners.pop();\n if (listener == null) {\n continue;\n }\n tasks.push(listener.close());\n }\n }\n await Promise.all(tasks);\n this.log('all listeners closed');\n for (const key of this.listeners.keys()) {\n this.listeners.set(key, []);\n }\n this.started = false;\n }\n /**\n * Dials the given Multiaddr over it's supported transport\n */\n async dial(ma, options) {\n const transport = this.dialTransportForMultiaddr(ma);\n if (transport == null) {\n throw new CodeError(`No transport available for address ${String(ma)}`, codes.ERR_TRANSPORT_UNAVAILABLE);\n }\n options?.onProgress?.(new CustomProgressEvent('transport-manager:selected-transport', transport[Symbol.toStringTag]));\n try {\n // @ts-expect-error the transport has a typed onProgress option but we\n // can't predict what transport implementation we selected so all we can\n // do is pass the onProgress handler in and hope for the best\n return await transport.dial(ma, {\n ...options,\n upgrader: this.components.upgrader\n });\n }\n catch (err) {\n if (err.code == null) {\n err.code = codes.ERR_TRANSPORT_DIAL_FAILED;\n }\n throw err;\n }\n }\n /**\n * Returns all Multiaddr's the listeners are using\n */\n getAddrs() {\n let addrs = [];\n for (const listeners of this.listeners.values()) {\n for (const listener of listeners) {\n addrs = [...addrs, ...listener.getAddrs()];\n }\n }\n return addrs;\n }\n /**\n * Returns all the transports instances\n */\n getTransports() {\n return Array.of(...this.transports.values());\n }\n /**\n * Returns all the listener instances\n */\n getListeners() {\n return Array.of(...this.listeners.values()).flat();\n }\n /**\n * Finds a transport that matches the given Multiaddr\n */\n dialTransportForMultiaddr(ma) {\n for (const transport of this.transports.values()) {\n const addrs = transport.dialFilter([ma]);\n if (addrs.length > 0) {\n return transport;\n }\n }\n }\n /**\n * Finds a transport that matches the given Multiaddr\n */\n listenTransportForMultiaddr(ma) {\n for (const transport of this.transports.values()) {\n const addrs = transport.listenFilter([ma]);\n if (addrs.length > 0) {\n return transport;\n }\n }\n }\n /**\n * Starts listeners for each listen Multiaddr\n */\n async listen(addrs) {\n if (!this.isStarted()) {\n throw new CodeError('Not started', codes.ERR_NODE_NOT_STARTED);\n }\n if (addrs == null || addrs.length === 0) {\n this.log('no addresses were provided for listening, this node is dial only');\n return;\n }\n const couldNotListen = [];\n for (const [key, transport] of this.transports.entries()) {\n const supportedAddrs = transport.listenFilter(addrs);\n const tasks = [];\n // For each supported multiaddr, create a listener\n for (const addr of supportedAddrs) {\n this.log('creating listener for %s on %a', key, addr);\n const listener = transport.createListener({\n upgrader: this.components.upgrader\n });\n let listeners = this.listeners.get(key) ?? [];\n if (listeners == null) {\n listeners = [];\n this.listeners.set(key, listeners);\n }\n listeners.push(listener);\n // Track listen/close events\n listener.addEventListener('listening', () => {\n this.components.events.safeDispatchEvent('transport:listening', {\n detail: listener\n });\n });\n listener.addEventListener('close', () => {\n const index = listeners.findIndex(l => l === listener);\n // remove the listener\n listeners.splice(index, 1);\n this.components.events.safeDispatchEvent('transport:close', {\n detail: listener\n });\n });\n // We need to attempt to listen on everything\n tasks.push(listener.listen(addr));\n }\n // Keep track of transports we had no addresses for\n if (tasks.length === 0) {\n couldNotListen.push(key);\n continue;\n }\n const results = await Promise.allSettled(tasks);\n // If we are listening on at least 1 address, succeed.\n // TODO: we should look at adding a retry (`p-retry`) here to better support\n // listening on remote addresses as they may be offline. We could then potentially\n // just wait for any (`p-any`) listener to succeed on each transport before returning\n const isListening = results.find(r => r.status === 'fulfilled');\n if ((isListening == null) && this.faultTolerance !== FaultTolerance.NO_FATAL) {\n throw new CodeError(`Transport (${key}) could not listen on any available address`, codes.ERR_NO_VALID_ADDRESSES);\n }\n }\n // If no transports were able to listen, throw an error. This likely\n // means we were given addresses we do not have transports for\n if (couldNotListen.length === this.transports.size) {\n const message = `no valid addresses were provided for transports [${couldNotListen.join(', ')}]`;\n if (this.faultTolerance === FaultTolerance.FATAL_ALL) {\n throw new CodeError(message, codes.ERR_NO_VALID_ADDRESSES);\n }\n this.log(`libp2p in dial mode only: ${message}`);\n }\n }\n /**\n * Removes the given transport from the manager.\n * If a transport has any running listeners, they will be closed.\n */\n async remove(key) {\n const listeners = this.listeners.get(key) ?? [];\n this.log.trace('removing transport %s', key);\n // Close any running listeners\n const tasks = [];\n this.log.trace('closing listeners for %s', key);\n while (listeners.length > 0) {\n const listener = listeners.pop();\n if (listener == null) {\n continue;\n }\n tasks.push(listener.close());\n }\n await Promise.all(tasks);\n this.transports.delete(key);\n this.listeners.delete(key);\n }\n /**\n * Removes all transports from the manager.\n * If any listeners are running, they will be closed.\n *\n * @async\n */\n async removeAll() {\n const tasks = [];\n for (const key of this.transports.keys()) {\n tasks.push(this.remove(key));\n }\n await Promise.all(tasks);\n }\n}\n//# sourceMappingURL=transport-manager.js.map","export const PROTOCOL_ID = '/multistream/1.0.0';\n// Conforming to go-libp2p\n// See https://github.com/multiformats/go-multistream/blob/master/multistream.go#L297\nexport const MAX_PROTOCOL_LENGTH = 1024;\n//# sourceMappingURL=constants.js.map","import { CodeError } from '@libp2p/interface';\nimport {} from 'uint8arraylist';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport { toString as uint8ArrayToString } from 'uint8arrays/to-string';\nconst NewLine = uint8ArrayFromString('\\n');\n/**\n * `write` encodes and writes a single buffer\n */\nexport async function write(writer, buffer, options) {\n await writer.write(buffer, options);\n}\n/**\n * `writeAll` behaves like `write`, except it encodes an array of items as a single write\n */\nexport async function writeAll(writer, buffers, options) {\n await writer.writeV(buffers, options);\n}\n/**\n * Read a length-prefixed buffer from the passed stream, stripping the final newline character\n */\nexport async function read(reader, options) {\n const buf = await reader.read(options);\n if (buf.byteLength === 0 || buf.get(buf.byteLength - 1) !== NewLine[0]) {\n options.log.error('Invalid mss message - missing newline', buf);\n throw new CodeError('missing newline', 'ERR_INVALID_MULTISTREAM_SELECT_MESSAGE');\n }\n return buf.sublist(0, -1); // Remove newline\n}\n/**\n * Read a length-prefixed string from the passed stream, stripping the final newline character\n */\nexport async function readString(reader, options) {\n const buf = await read(reader, options);\n return uint8ArrayToString(buf.subarray());\n}\n//# sourceMappingURL=multistream.js.map","import { encode } from 'it-length-prefixed';\nimport { lpStream } from 'it-length-prefixed-stream';\nimport { Uint8ArrayList } from 'uint8arraylist';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport { MAX_PROTOCOL_LENGTH, PROTOCOL_ID } from './constants.js';\nimport * as multistream from './multistream.js';\n/**\n * Handle multistream protocol selections for the given list of protocols.\n *\n * Note that after a protocol is handled `listener` can no longer be used.\n *\n * @param stream - A duplex iterable stream to listen on\n * @param protocols - A list of protocols (or single protocol) that this listener is able to speak.\n * @param options - an options object containing an AbortSignal and an optional boolean `writeBytes` - if this is true, `Uint8Array`s will be written into `duplex`, otherwise `Uint8ArrayList`s will\n * @returns A stream for the selected protocol and the protocol that was selected from the list of protocols provided to `select`\n * @example\n *\n * ```TypeScript\n * import { pipe } from 'it-pipe'\n * import * as mss from '@libp2p/multistream-select'\n * import { Mplex } from '@libp2p/mplex'\n *\n * const muxer = new Mplex({\n * async onStream (muxedStream) {\n * // mss.handle(handledProtocols)\n * // Returns selected stream and protocol\n * const { stream, protocol } = await mss.handle(muxedStream, [\n * '/ipfs-dht/1.0.0',\n * '/ipfs-bitswap/1.0.0'\n * ])\n *\n * // Typically here we'd call the handler function that was registered in\n * // libp2p for the given protocol:\n * // e.g. handlers[protocol].handler(stream)\n * //\n * // If protocol was /ipfs-dht/1.0.0 it might do something like this:\n * // try {\n * // await pipe(\n * // dhtStream,\n * // source => (async function * () {\n * // for await (const chunk of source)\n * // // Incoming DHT data -> process and yield to respond\n * // })(),\n * // dhtStream\n * // )\n * // } catch (err) {\n * // // Error in stream\n * // }\n * }\n * })\n * ```\n */\nexport async function handle(stream, protocols, options) {\n protocols = Array.isArray(protocols) ? protocols : [protocols];\n options.log.trace('handle: available protocols %s', protocols);\n const lp = lpStream(stream, {\n ...options,\n maxDataLength: MAX_PROTOCOL_LENGTH,\n maxLengthLength: 2 // 2 bytes is enough to length-prefix MAX_PROTOCOL_LENGTH\n });\n while (true) {\n options.log.trace('handle: reading incoming string');\n const protocol = await multistream.readString(lp, options);\n options.log.trace('handle: read \"%s\"', protocol);\n if (protocol === PROTOCOL_ID) {\n options.log.trace('handle: respond with \"%s\" for \"%s\"', PROTOCOL_ID, protocol);\n await multistream.write(lp, uint8ArrayFromString(`${PROTOCOL_ID}\\n`), options);\n options.log.trace('handle: responded with \"%s\" for \"%s\"', PROTOCOL_ID, protocol);\n continue;\n }\n if (protocols.includes(protocol)) {\n options.log.trace('handle: respond with \"%s\" for \"%s\"', protocol, protocol);\n await multistream.write(lp, uint8ArrayFromString(`${protocol}\\n`), options);\n options.log.trace('handle: responded with \"%s\" for \"%s\"', protocol, protocol);\n return { stream: lp.unwrap(), protocol };\n }\n if (protocol === 'ls') {\n // \\n\\n\\n\n const protos = new Uint8ArrayList(...protocols.map(p => encode.single(uint8ArrayFromString(`${p}\\n`))), uint8ArrayFromString('\\n'));\n options.log.trace('handle: respond with \"%s\" for %s', protocols, protocol);\n await multistream.write(lp, protos, options);\n options.log.trace('handle: responded with \"%s\" for %s', protocols, protocol);\n continue;\n }\n options.log('handle: respond with \"na\" for \"%s\"', protocol);\n await multistream.write(lp, uint8ArrayFromString('na\\n'), options);\n options.log('handle: responded with \"na\" for \"%s\"', protocol);\n }\n}\n//# sourceMappingURL=handle.js.map","import { CodeError } from '@libp2p/interface';\nimport { lpStream } from 'it-length-prefixed-stream';\nimport pDefer from 'p-defer';\nimport { raceSignal } from 'race-signal';\nimport * as varint from 'uint8-varint';\nimport { Uint8ArrayList } from 'uint8arraylist';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport { MAX_PROTOCOL_LENGTH } from './constants.js';\nimport * as multistream from './multistream.js';\nimport { PROTOCOL_ID } from './index.js';\n/**\n * Negotiate a protocol to use from a list of protocols.\n *\n * @param stream - A duplex iterable stream to dial on\n * @param protocols - A list of protocols (or single protocol) to negotiate with. Protocols are attempted in order until a match is made.\n * @param options - An options object containing an AbortSignal and an optional boolean `writeBytes` - if this is true, `Uint8Array`s will be written into `duplex`, otherwise `Uint8ArrayList`s will\n * @returns A stream for the selected protocol and the protocol that was selected from the list of protocols provided to `select`.\n * @example\n *\n * ```TypeScript\n * import { pipe } from 'it-pipe'\n * import * as mss from '@libp2p/multistream-select'\n * import { Mplex } from '@libp2p/mplex'\n *\n * const muxer = new Mplex()\n * const muxedStream = muxer.newStream()\n *\n * // mss.select(protocol(s))\n * // Select from one of the passed protocols (in priority order)\n * // Returns selected stream and protocol\n * const { stream: dhtStream, protocol } = await mss.select(muxedStream, [\n * // This might just be different versions of DHT, but could be different impls\n * '/ipfs-dht/2.0.0', // Most of the time this will probably just be one item.\n * '/ipfs-dht/1.0.0'\n * ])\n *\n * // Typically this stream will be passed back to the caller of libp2p.dialProtocol\n * //\n * // ...it might then do something like this:\n * // try {\n * // await pipe(\n * // [uint8ArrayFromString('Some DHT data')]\n * // dhtStream,\n * // async source => {\n * // for await (const chunk of source)\n * // // DHT response data\n * // }\n * // )\n * // } catch (err) {\n * // // Error in stream\n * // }\n * ```\n */\nexport async function select(stream, protocols, options) {\n protocols = Array.isArray(protocols) ? [...protocols] : [protocols];\n if (protocols.length === 1 && options.negotiateFully === false) {\n return optimisticSelect(stream, protocols[0], options);\n }\n const lp = lpStream(stream, {\n ...options,\n maxDataLength: MAX_PROTOCOL_LENGTH\n });\n const protocol = protocols.shift();\n if (protocol == null) {\n throw new Error('At least one protocol must be specified');\n }\n options.log.trace('select: write [\"%s\", \"%s\"]', PROTOCOL_ID, protocol);\n const p1 = uint8ArrayFromString(`${PROTOCOL_ID}\\n`);\n const p2 = uint8ArrayFromString(`${protocol}\\n`);\n await multistream.writeAll(lp, [p1, p2], options);\n options.log.trace('select: reading multistream-select header');\n let response = await multistream.readString(lp, options);\n options.log.trace('select: read \"%s\"', response);\n // Read the protocol response if we got the protocolId in return\n if (response === PROTOCOL_ID) {\n options.log.trace('select: reading protocol response');\n response = await multistream.readString(lp, options);\n options.log.trace('select: read \"%s\"', response);\n }\n // We're done\n if (response === protocol) {\n return { stream: lp.unwrap(), protocol };\n }\n // We haven't gotten a valid ack, try the other protocols\n for (const protocol of protocols) {\n options.log.trace('select: write \"%s\"', protocol);\n await multistream.write(lp, uint8ArrayFromString(`${protocol}\\n`), options);\n options.log.trace('select: reading protocol response');\n const response = await multistream.readString(lp, options);\n options.log.trace('select: read \"%s\" for \"%s\"', response, protocol);\n if (response === protocol) {\n return { stream: lp.unwrap(), protocol };\n }\n }\n throw new CodeError('protocol selection failed', 'ERR_UNSUPPORTED_PROTOCOL');\n}\n/**\n * Optimistically negotiates a protocol.\n *\n * It *does not* block writes waiting for the other end to respond. Instead, it\n * simply assumes the negotiation went successfully and starts writing data.\n *\n * Use when it is known that the receiver supports the desired protocol.\n */\nfunction optimisticSelect(stream, protocol, options) {\n const originalSink = stream.sink.bind(stream);\n const originalSource = stream.source;\n let negotiated = false;\n let negotiating = false;\n const doneNegotiating = pDefer();\n let sentProtocol = false;\n let sendingProtocol = false;\n const doneSendingProtocol = pDefer();\n let readProtocol = false;\n let readingProtocol = false;\n const doneReadingProtocol = pDefer();\n const lp = lpStream({\n sink: originalSink,\n source: originalSource\n }, {\n ...options,\n maxDataLength: MAX_PROTOCOL_LENGTH\n });\n stream.sink = async (source) => {\n const { sink } = lp.unwrap();\n await sink(async function* () {\n let sentData = false;\n for await (const buf of source) {\n // started reading before the source yielded, wait for protocol send\n if (sendingProtocol) {\n await doneSendingProtocol.promise;\n }\n // writing before reading, send the protocol and the first chunk of data\n if (!sentProtocol) {\n sendingProtocol = true;\n options.log.trace('optimistic: write [\"%s\", \"%s\", data(%d)] in sink', PROTOCOL_ID, protocol, buf.byteLength);\n const protocolString = `${protocol}\\n`;\n // send protocols in first chunk of data written to transport\n yield new Uint8ArrayList(Uint8Array.from([19]), // length of PROTOCOL_ID plus newline\n uint8ArrayFromString(`${PROTOCOL_ID}\\n`), varint.encode(protocolString.length), uint8ArrayFromString(protocolString), buf).subarray();\n options.log.trace('optimistic: wrote [\"%s\", \"%s\", data(%d)] in sink', PROTOCOL_ID, protocol, buf.byteLength);\n sentProtocol = true;\n sendingProtocol = false;\n doneSendingProtocol.resolve();\n // read the negotiation response but don't block more sending\n negotiate()\n .catch(err => {\n options.log.error('could not finish optimistic protocol negotiation of %s', protocol, err);\n });\n }\n else {\n yield buf;\n }\n sentData = true;\n }\n // special case - the source passed to the sink has ended but we didn't\n // negotiated the protocol yet so do it now\n if (!sentData) {\n await negotiate();\n }\n }());\n };\n async function negotiate() {\n if (negotiating) {\n options.log.trace('optimistic: already negotiating %s stream', protocol);\n await doneNegotiating.promise;\n return;\n }\n negotiating = true;\n try {\n // we haven't sent the protocol yet, send it now\n if (!sentProtocol) {\n options.log.trace('optimistic: doing send protocol for %s stream', protocol);\n await doSendProtocol();\n }\n // if we haven't read the protocol response yet, do it now\n if (!readProtocol) {\n options.log.trace('optimistic: doing read protocol for %s stream', protocol);\n await doReadProtocol();\n }\n }\n finally {\n negotiating = false;\n negotiated = true;\n doneNegotiating.resolve();\n }\n }\n async function doSendProtocol() {\n if (sendingProtocol) {\n await doneSendingProtocol.promise;\n return;\n }\n sendingProtocol = true;\n try {\n options.log.trace('optimistic: write [\"%s\", \"%s\", data] in source', PROTOCOL_ID, protocol);\n await lp.writeV([\n uint8ArrayFromString(`${PROTOCOL_ID}\\n`),\n uint8ArrayFromString(`${protocol}\\n`)\n ]);\n options.log.trace('optimistic: wrote [\"%s\", \"%s\", data] in source', PROTOCOL_ID, protocol);\n }\n finally {\n sentProtocol = true;\n sendingProtocol = false;\n doneSendingProtocol.resolve();\n }\n }\n async function doReadProtocol() {\n if (readingProtocol) {\n await doneReadingProtocol.promise;\n return;\n }\n readingProtocol = true;\n try {\n options.log.trace('optimistic: reading multistream select header');\n let response = await multistream.readString(lp, options);\n options.log.trace('optimistic: read multistream select header \"%s\"', response);\n if (response === PROTOCOL_ID) {\n response = await multistream.readString(lp, options);\n }\n options.log.trace('optimistic: read protocol \"%s\", expecting \"%s\"', response, protocol);\n if (response !== protocol) {\n throw new CodeError('protocol selection failed', 'ERR_UNSUPPORTED_PROTOCOL');\n }\n }\n finally {\n readProtocol = true;\n readingProtocol = false;\n doneReadingProtocol.resolve();\n }\n }\n stream.source = (async function* () {\n // make sure we've done protocol negotiation before we read stream data\n await negotiate();\n options.log.trace('optimistic: reading data from \"%s\" stream', protocol);\n yield* lp.unwrap().source;\n })();\n if (stream.closeRead != null) {\n const originalCloseRead = stream.closeRead.bind(stream);\n stream.closeRead = async (opts) => {\n // we need to read & write to negotiate the protocol so ensure we've done\n // this before closing the readable end of the stream\n if (!negotiated) {\n await negotiate().catch(err => {\n options.log.error('could not negotiate protocol before close read', err);\n });\n }\n // protocol has been negotiated, ok to close the readable end\n await originalCloseRead(opts);\n };\n }\n if (stream.closeWrite != null) {\n const originalCloseWrite = stream.closeWrite.bind(stream);\n stream.closeWrite = async (opts) => {\n // we need to read & write to negotiate the protocol so ensure we've done\n // this before closing the writable end of the stream\n if (!negotiated) {\n await negotiate().catch(err => {\n options.log.error('could not negotiate protocol before close write', err);\n });\n }\n // protocol has been negotiated, ok to close the writable end\n await originalCloseWrite(opts);\n };\n }\n if (stream.close != null) {\n const originalClose = stream.close.bind(stream);\n stream.close = async (opts) => {\n // if we are in the process of negotiation, let it finish before closing\n // because we may have unsent early data\n const tasks = [];\n if (sendingProtocol) {\n tasks.push(doneSendingProtocol.promise);\n }\n if (readingProtocol) {\n tasks.push(doneReadingProtocol.promise);\n }\n if (tasks.length > 0) {\n // let the in-flight protocol negotiation finish gracefully\n await raceSignal(Promise.all(tasks), opts?.signal);\n }\n else {\n // no protocol negotiation attempt has occurred so don't start one\n negotiated = true;\n negotiating = false;\n doneNegotiating.resolve();\n }\n // protocol has been negotiated, ok to close the writable end\n await originalClose(opts);\n };\n }\n return {\n stream,\n protocol\n };\n}\n//# sourceMappingURL=select.js.map","export const connectionSymbol = Symbol.for('@libp2p/connection');\nexport function isConnection(other) {\n return other != null && Boolean(other[connectionSymbol]);\n}\n//# sourceMappingURL=index.js.map","import { connectionSymbol, CodeError, setMaxListeners } from '@libp2p/interface';\nconst CLOSE_TIMEOUT = 500;\n/**\n * An implementation of the js-libp2p connection.\n * Any libp2p transport should use an upgrader to return this connection.\n */\nexport class ConnectionImpl {\n /**\n * Connection identifier.\n */\n id;\n /**\n * Observed multiaddr of the remote peer\n */\n remoteAddr;\n /**\n * Remote peer id\n */\n remotePeer;\n direction;\n timeline;\n multiplexer;\n encryption;\n status;\n transient;\n log;\n /**\n * User provided tags\n *\n */\n tags;\n /**\n * Reference to the new stream function of the multiplexer\n */\n _newStream;\n /**\n * Reference to the close function of the raw connection\n */\n _close;\n _abort;\n /**\n * Reference to the getStreams function of the muxer\n */\n _getStreams;\n /**\n * An implementation of the js-libp2p connection.\n * Any libp2p transport should use an upgrader to return this connection.\n */\n constructor(init) {\n const { remoteAddr, remotePeer, newStream, close, abort, getStreams } = init;\n this.id = `${(parseInt(String(Math.random() * 1e9))).toString(36)}${Date.now()}`;\n this.remoteAddr = remoteAddr;\n this.remotePeer = remotePeer;\n this.direction = init.direction;\n this.status = 'open';\n this.timeline = init.timeline;\n this.multiplexer = init.multiplexer;\n this.encryption = init.encryption;\n this.transient = init.transient ?? false;\n this.log = init.logger.forComponent(`libp2p:connection:${this.direction}:${this.id}`);\n if (this.remoteAddr.getPeerId() == null) {\n this.remoteAddr = this.remoteAddr.encapsulate(`/p2p/${this.remotePeer}`);\n }\n this._newStream = newStream;\n this._close = close;\n this._abort = abort;\n this._getStreams = getStreams;\n this.tags = [];\n }\n [Symbol.toStringTag] = 'Connection';\n [connectionSymbol] = true;\n /**\n * Get all the streams of the muxer\n */\n get streams() {\n return this._getStreams();\n }\n /**\n * Create a new stream from this connection\n */\n async newStream(protocols, options) {\n if (this.status === 'closing') {\n throw new CodeError('the connection is being closed', 'ERR_CONNECTION_BEING_CLOSED');\n }\n if (this.status === 'closed') {\n throw new CodeError('the connection is closed', 'ERR_CONNECTION_CLOSED');\n }\n if (!Array.isArray(protocols)) {\n protocols = [protocols];\n }\n if (this.transient && options?.runOnTransientConnection !== true) {\n throw new CodeError('Cannot open protocol stream on transient connection', 'ERR_TRANSIENT_CONNECTION');\n }\n const stream = await this._newStream(protocols, options);\n stream.direction = 'outbound';\n return stream;\n }\n /**\n * Close the connection\n */\n async close(options = {}) {\n if (this.status === 'closed' || this.status === 'closing') {\n return;\n }\n this.log('closing connection to %a', this.remoteAddr);\n this.status = 'closing';\n if (options.signal == null) {\n const signal = AbortSignal.timeout(CLOSE_TIMEOUT);\n setMaxListeners(Infinity, signal);\n options = {\n ...options,\n signal\n };\n }\n try {\n this.log.trace('closing all streams');\n // close all streams gracefully - this can throw if we're not multiplexed\n await Promise.all(this.streams.map(async (s) => s.close(options)));\n this.log.trace('closing underlying transport');\n // close raw connection\n await this._close(options);\n this.log.trace('updating timeline with close time');\n this.status = 'closed';\n this.timeline.close = Date.now();\n }\n catch (err) {\n this.log.error('error encountered during graceful close of connection to %a', this.remoteAddr, err);\n this.abort(err);\n }\n }\n abort(err) {\n this.log.error('aborting connection to %a due to error', this.remoteAddr, err);\n this.status = 'closing';\n this.streams.forEach(s => { s.abort(err); });\n this.log.error('all streams aborted', this.streams.length);\n // Abort raw connection\n this._abort(err);\n this.timeline.close = Date.now();\n this.status = 'closed';\n }\n}\nexport function createConnection(init) {\n return new ConnectionImpl(init);\n}\n//# sourceMappingURL=index.js.map","import { CodeError, ERR_TIMEOUT, setMaxListeners } from '@libp2p/interface';\nimport * as mss from '@libp2p/multistream-select';\nimport { peerIdFromString } from '@libp2p/peer-id';\nimport { CustomProgressEvent } from 'progress-events';\nimport { createConnection } from './connection/index.js';\nimport { INBOUND_UPGRADE_TIMEOUT } from './connection-manager/constants.js';\nimport { codes } from './errors.js';\nimport { DEFAULT_MAX_INBOUND_STREAMS, DEFAULT_MAX_OUTBOUND_STREAMS } from './registrar.js';\nconst DEFAULT_PROTOCOL_SELECT_TIMEOUT = 30000;\nfunction findIncomingStreamLimit(protocol, registrar) {\n try {\n const { options } = registrar.getHandler(protocol);\n return options.maxInboundStreams;\n }\n catch (err) {\n if (err.code !== codes.ERR_NO_HANDLER_FOR_PROTOCOL) {\n throw err;\n }\n }\n return DEFAULT_MAX_INBOUND_STREAMS;\n}\nfunction findOutgoingStreamLimit(protocol, registrar, options = {}) {\n try {\n const { options } = registrar.getHandler(protocol);\n if (options.maxOutboundStreams != null) {\n return options.maxOutboundStreams;\n }\n }\n catch (err) {\n if (err.code !== codes.ERR_NO_HANDLER_FOR_PROTOCOL) {\n throw err;\n }\n }\n return options.maxOutboundStreams ?? DEFAULT_MAX_OUTBOUND_STREAMS;\n}\nfunction countStreams(protocol, direction, connection) {\n let streamCount = 0;\n connection.streams.forEach(stream => {\n if (stream.direction === direction && stream.protocol === protocol) {\n streamCount++;\n }\n });\n return streamCount;\n}\nexport class DefaultUpgrader {\n components;\n connectionEncryption;\n muxers;\n inboundUpgradeTimeout;\n events;\n constructor(components, init) {\n this.components = components;\n this.connectionEncryption = new Map();\n init.connectionEncryption.forEach(encrypter => {\n this.connectionEncryption.set(encrypter.protocol, encrypter);\n });\n this.muxers = new Map();\n init.muxers.forEach(muxer => {\n this.muxers.set(muxer.protocol, muxer);\n });\n this.inboundUpgradeTimeout = init.inboundUpgradeTimeout ?? INBOUND_UPGRADE_TIMEOUT;\n this.events = components.events;\n }\n [Symbol.toStringTag] = '@libp2p/upgrader';\n async shouldBlockConnection(remotePeer, maConn, connectionType) {\n const connectionGater = this.components.connectionGater[connectionType];\n if (connectionGater !== undefined) {\n if (await connectionGater(remotePeer, maConn)) {\n throw new CodeError(`The multiaddr connection is blocked by gater.${connectionType}`, codes.ERR_CONNECTION_INTERCEPTED);\n }\n }\n }\n /**\n * Upgrades an inbound connection\n */\n async upgradeInbound(maConn, opts) {\n const accept = await this.components.connectionManager.acceptIncomingConnection(maConn);\n if (!accept) {\n throw new CodeError('connection denied', codes.ERR_CONNECTION_DENIED);\n }\n let encryptedConn;\n let remotePeer;\n let upgradedConn;\n let muxerFactory;\n let cryptoProtocol;\n const signal = AbortSignal.timeout(this.inboundUpgradeTimeout);\n const onAbort = () => {\n maConn.abort(new CodeError('inbound upgrade timeout', ERR_TIMEOUT));\n };\n signal.addEventListener('abort', onAbort, { once: true });\n setMaxListeners(Infinity, signal);\n try {\n if ((await this.components.connectionGater.denyInboundConnection?.(maConn)) === true) {\n throw new CodeError('The multiaddr connection is blocked by gater.acceptConnection', codes.ERR_CONNECTION_INTERCEPTED);\n }\n this.components.metrics?.trackMultiaddrConnection(maConn);\n maConn.log('starting the inbound connection upgrade');\n // Protect\n let protectedConn = maConn;\n if (opts?.skipProtection !== true) {\n const protector = this.components.connectionProtector;\n if (protector != null) {\n maConn.log('protecting the inbound connection');\n protectedConn = await protector.protect(maConn);\n }\n }\n try {\n // Encrypt the connection\n encryptedConn = protectedConn;\n if (opts?.skipEncryption !== true) {\n opts?.onProgress?.(new CustomProgressEvent('upgrader:encrypt-inbound-connection'));\n ({\n conn: encryptedConn,\n remotePeer,\n protocol: cryptoProtocol\n } = await this._encryptInbound(protectedConn));\n const maConn = {\n ...protectedConn,\n ...encryptedConn\n };\n await this.shouldBlockConnection(remotePeer, maConn, 'denyInboundEncryptedConnection');\n }\n else {\n const idStr = maConn.remoteAddr.getPeerId();\n if (idStr == null) {\n throw new CodeError('inbound connection that skipped encryption must have a peer id', codes.ERR_INVALID_MULTIADDR);\n }\n const remotePeerId = peerIdFromString(idStr);\n cryptoProtocol = 'native';\n remotePeer = remotePeerId;\n }\n upgradedConn = encryptedConn;\n if (opts?.muxerFactory != null) {\n muxerFactory = opts.muxerFactory;\n }\n else if (this.muxers.size > 0) {\n opts?.onProgress?.(new CustomProgressEvent('upgrader:multiplex-inbound-connection'));\n // Multiplex the connection\n const multiplexed = await this._multiplexInbound({\n ...protectedConn,\n ...encryptedConn\n }, this.muxers);\n muxerFactory = multiplexed.muxerFactory;\n upgradedConn = multiplexed.stream;\n }\n }\n catch (err) {\n maConn.log.error('failed to upgrade inbound connection', err);\n throw err;\n }\n await this.shouldBlockConnection(remotePeer, maConn, 'denyInboundUpgradedConnection');\n maConn.log('successfully upgraded inbound connection');\n return this._createConnection({\n cryptoProtocol,\n direction: 'inbound',\n maConn,\n upgradedConn,\n muxerFactory,\n remotePeer,\n transient: opts?.transient\n });\n }\n finally {\n signal.removeEventListener('abort', onAbort);\n this.components.connectionManager.afterUpgradeInbound();\n }\n }\n /**\n * Upgrades an outbound connection\n */\n async upgradeOutbound(maConn, opts) {\n const idStr = maConn.remoteAddr.getPeerId();\n let remotePeerId;\n if (idStr != null) {\n remotePeerId = peerIdFromString(idStr);\n await this.shouldBlockConnection(remotePeerId, maConn, 'denyOutboundConnection');\n }\n let encryptedConn;\n let remotePeer;\n let upgradedConn;\n let cryptoProtocol;\n let muxerFactory;\n this.components.metrics?.trackMultiaddrConnection(maConn);\n maConn.log('starting the outbound connection upgrade');\n // If the transport natively supports encryption, skip connection\n // protector and encryption\n // Protect\n let protectedConn = maConn;\n if (opts?.skipProtection !== true) {\n const protector = this.components.connectionProtector;\n if (protector != null) {\n protectedConn = await protector.protect(maConn);\n }\n }\n try {\n // Encrypt the connection\n encryptedConn = protectedConn;\n if (opts?.skipEncryption !== true) {\n ({\n conn: encryptedConn,\n remotePeer,\n protocol: cryptoProtocol\n } = await this._encryptOutbound(protectedConn, remotePeerId));\n const maConn = {\n ...protectedConn,\n ...encryptedConn\n };\n await this.shouldBlockConnection(remotePeer, maConn, 'denyOutboundEncryptedConnection');\n }\n else {\n if (remotePeerId == null) {\n throw new CodeError('Encryption was skipped but no peer id was passed', codes.ERR_INVALID_PEER);\n }\n cryptoProtocol = 'native';\n remotePeer = remotePeerId;\n }\n upgradedConn = encryptedConn;\n if (opts?.muxerFactory != null) {\n muxerFactory = opts.muxerFactory;\n }\n else if (this.muxers.size > 0) {\n // Multiplex the connection\n const multiplexed = await this._multiplexOutbound({\n ...protectedConn,\n ...encryptedConn\n }, this.muxers);\n muxerFactory = multiplexed.muxerFactory;\n upgradedConn = multiplexed.stream;\n }\n }\n catch (err) {\n maConn.log.error('failed to upgrade outbound connection', err);\n await maConn.close(err);\n throw err;\n }\n await this.shouldBlockConnection(remotePeer, maConn, 'denyOutboundUpgradedConnection');\n maConn.log('successfully upgraded outbound connection');\n return this._createConnection({\n cryptoProtocol,\n direction: 'outbound',\n maConn,\n upgradedConn,\n muxerFactory,\n remotePeer,\n transient: opts?.transient\n });\n }\n /**\n * A convenience method for generating a new `Connection`\n */\n _createConnection(opts) {\n const { cryptoProtocol, direction, maConn, upgradedConn, remotePeer, muxerFactory, transient } = opts;\n let muxer;\n let newStream;\n let connection; // eslint-disable-line prefer-const\n if (muxerFactory != null) {\n // Create the muxer\n muxer = muxerFactory.createStreamMuxer({\n direction,\n // Run anytime a remote stream is created\n onIncomingStream: muxedStream => {\n if (connection == null) {\n return;\n }\n void Promise.resolve()\n .then(async () => {\n const protocols = this.components.registrar.getProtocols();\n const { stream, protocol } = await mss.handle(muxedStream, protocols, {\n log: muxedStream.log,\n yieldBytes: false\n });\n if (connection == null) {\n return;\n }\n connection.log('incoming stream opened on %s', protocol);\n const incomingLimit = findIncomingStreamLimit(protocol, this.components.registrar);\n const streamCount = countStreams(protocol, 'inbound', connection);\n if (streamCount === incomingLimit) {\n const err = new CodeError(`Too many inbound protocol streams for protocol \"${protocol}\" - limit ${incomingLimit}`, codes.ERR_TOO_MANY_INBOUND_PROTOCOL_STREAMS);\n muxedStream.abort(err);\n throw err;\n }\n // after the handshake the returned stream can have early data so override\n // the souce/sink\n muxedStream.source = stream.source;\n muxedStream.sink = stream.sink;\n muxedStream.protocol = protocol;\n // allow closing the write end of a not-yet-negotiated stream\n if (stream.closeWrite != null) {\n muxedStream.closeWrite = stream.closeWrite;\n }\n // allow closing the read end of a not-yet-negotiated stream\n if (stream.closeRead != null) {\n muxedStream.closeRead = stream.closeRead;\n }\n // make sure we don't try to negotiate a stream we are closing\n if (stream.close != null) {\n muxedStream.close = stream.close;\n }\n // If a protocol stream has been successfully negotiated and is to be passed to the application,\n // the peerstore should ensure that the peer is registered with that protocol\n await this.components.peerStore.merge(remotePeer, {\n protocols: [protocol]\n });\n this.components.metrics?.trackProtocolStream(muxedStream, connection);\n this._onStream({ connection, stream: muxedStream, protocol });\n })\n .catch(async (err) => {\n connection.log.error('error handling incoming stream id %s', muxedStream.id, err.message, err.code, err.stack);\n if (muxedStream.timeline.close == null) {\n await muxedStream.close();\n }\n });\n }\n });\n newStream = async (protocols, options = {}) => {\n if (muxer == null) {\n throw new CodeError('Stream is not multiplexed', codes.ERR_MUXER_UNAVAILABLE);\n }\n connection.log('starting new stream for protocols %s', protocols);\n const muxedStream = await muxer.newStream();\n connection.log.trace('started new stream %s for protocols %s', muxedStream.id, protocols);\n try {\n if (options.signal == null) {\n muxedStream.log('no abort signal was passed while trying to negotiate protocols %s falling back to default timeout', protocols);\n const signal = AbortSignal.timeout(DEFAULT_PROTOCOL_SELECT_TIMEOUT);\n setMaxListeners(Infinity, signal);\n options = {\n ...options,\n signal\n };\n }\n muxedStream.log.trace('selecting protocol from protocols %s', protocols);\n const { stream, protocol } = await mss.select(muxedStream, protocols, {\n ...options,\n log: muxedStream.log,\n yieldBytes: true\n });\n muxedStream.log('selected protocol %s', protocol);\n const outgoingLimit = findOutgoingStreamLimit(protocol, this.components.registrar, options);\n const streamCount = countStreams(protocol, 'outbound', connection);\n if (streamCount >= outgoingLimit) {\n const err = new CodeError(`Too many outbound protocol streams for protocol \"${protocol}\" - ${streamCount}/${outgoingLimit}`, codes.ERR_TOO_MANY_OUTBOUND_PROTOCOL_STREAMS);\n muxedStream.abort(err);\n throw err;\n }\n // If a protocol stream has been successfully negotiated and is to be passed to the application,\n // the peerstore should ensure that the peer is registered with that protocol\n await this.components.peerStore.merge(remotePeer, {\n protocols: [protocol]\n });\n // after the handshake the returned stream can have early data so override\n // the souce/sink\n muxedStream.source = stream.source;\n muxedStream.sink = stream.sink;\n muxedStream.protocol = protocol;\n // allow closing the write end of a not-yet-negotiated stream\n if (stream.closeWrite != null) {\n muxedStream.closeWrite = stream.closeWrite;\n }\n // allow closing the read end of a not-yet-negotiated stream\n if (stream.closeRead != null) {\n muxedStream.closeRead = stream.closeRead;\n }\n // make sure we don't try to negotiate a stream we are closing\n if (stream.close != null) {\n muxedStream.close = stream.close;\n }\n this.components.metrics?.trackProtocolStream(muxedStream, connection);\n return muxedStream;\n }\n catch (err) {\n connection.log.error('could not create new stream for protocols %s', protocols, err);\n if (muxedStream.timeline.close == null) {\n muxedStream.abort(err);\n }\n if (err.code != null) {\n throw err;\n }\n throw new CodeError(String(err), codes.ERR_UNSUPPORTED_PROTOCOL);\n }\n };\n // Pipe all data through the muxer\n void Promise.all([\n muxer.sink(upgradedConn.source),\n upgradedConn.sink(muxer.source)\n ]).catch(err => {\n connection.log.error('error piping data through muxer', err);\n });\n }\n const _timeline = maConn.timeline;\n maConn.timeline = new Proxy(_timeline, {\n set: (...args) => {\n if (connection != null && args[1] === 'close' && args[2] != null && _timeline.close == null) {\n // Wait for close to finish before notifying of the closure\n (async () => {\n try {\n if (connection.status === 'open') {\n await connection.close();\n }\n }\n catch (err) {\n connection.log.error('error closing connection after timeline close', err);\n }\n finally {\n this.events.safeDispatchEvent('connection:close', {\n detail: connection\n });\n }\n })().catch(err => {\n connection.log.error('error thrown while dispatching connection:close event', err);\n });\n }\n return Reflect.set(...args);\n }\n });\n maConn.timeline.upgraded = Date.now();\n const errConnectionNotMultiplexed = () => {\n throw new CodeError('connection is not multiplexed', codes.ERR_CONNECTION_NOT_MULTIPLEXED);\n };\n // Create the connection\n connection = createConnection({\n remoteAddr: maConn.remoteAddr,\n remotePeer,\n status: 'open',\n direction,\n timeline: maConn.timeline,\n multiplexer: muxer?.protocol,\n encryption: cryptoProtocol,\n transient,\n logger: this.components.logger,\n newStream: newStream ?? errConnectionNotMultiplexed,\n getStreams: () => { if (muxer != null) {\n return muxer.streams;\n }\n else {\n return [];\n } },\n close: async (options) => {\n // Ensure remaining streams are closed gracefully\n if (muxer != null) {\n connection.log.trace('close muxer');\n await muxer.close(options);\n }\n connection.log.trace('close maconn');\n // close the underlying transport\n await maConn.close(options);\n connection.log.trace('closed maconn');\n },\n abort: (err) => {\n maConn.abort(err);\n // Ensure remaining streams are aborted\n if (muxer != null) {\n muxer.abort(err);\n }\n }\n });\n this.events.safeDispatchEvent('connection:open', {\n detail: connection\n });\n return connection;\n }\n /**\n * Routes incoming streams to the correct handler\n */\n _onStream(opts) {\n const { connection, stream, protocol } = opts;\n const { handler, options } = this.components.registrar.getHandler(protocol);\n if (connection.transient && options.runOnTransientConnection !== true) {\n throw new CodeError('Cannot open protocol stream on transient connection', 'ERR_TRANSIENT_CONNECTION');\n }\n handler({ connection, stream });\n }\n /**\n * Attempts to encrypt the incoming `connection` with the provided `cryptos`\n */\n async _encryptInbound(connection) {\n const protocols = Array.from(this.connectionEncryption.keys());\n connection.log('handling inbound crypto protocol selection', protocols);\n try {\n const { stream, protocol } = await mss.handle(connection, protocols, {\n log: connection.log\n });\n const encrypter = this.connectionEncryption.get(protocol);\n if (encrypter == null) {\n throw new Error(`no crypto module found for ${protocol}`);\n }\n connection.log('encrypting inbound connection using', protocol);\n return {\n ...await encrypter.secureInbound(this.components.peerId, stream),\n protocol\n };\n }\n catch (err) {\n connection.log.error('encrypting inbound connection failed', err);\n throw new CodeError(err.message, codes.ERR_ENCRYPTION_FAILED);\n }\n }\n /**\n * Attempts to encrypt the given `connection` with the provided connection encrypters.\n * The first `ConnectionEncrypter` module to succeed will be used\n */\n async _encryptOutbound(connection, remotePeerId) {\n const protocols = Array.from(this.connectionEncryption.keys());\n connection.log('selecting outbound crypto protocol', protocols);\n try {\n connection.log.trace('selecting encrypter from %s', protocols);\n const { stream, protocol } = await mss.select(connection, protocols, {\n log: connection.log,\n yieldBytes: true\n });\n const encrypter = this.connectionEncryption.get(protocol);\n if (encrypter == null) {\n throw new Error(`no crypto module found for ${protocol}`);\n }\n connection.log('encrypting outbound connection to %p using %s', remotePeerId, encrypter);\n return {\n ...await encrypter.secureOutbound(this.components.peerId, stream, remotePeerId),\n protocol\n };\n }\n catch (err) {\n connection.log.error('encrypting outbound connection to %p failed', remotePeerId, err);\n throw new CodeError(err.message, codes.ERR_ENCRYPTION_FAILED);\n }\n }\n /**\n * Selects one of the given muxers via multistream-select. That\n * muxer will be used for all future streams on the connection.\n */\n async _multiplexOutbound(connection, muxers) {\n const protocols = Array.from(muxers.keys());\n connection.log('outbound selecting muxer %s', protocols);\n try {\n connection.log.trace('selecting stream muxer from %s', protocols);\n const { stream, protocol } = await mss.select(connection, protocols, {\n log: connection.log,\n yieldBytes: true\n });\n connection.log('selected %s as muxer protocol', protocol);\n const muxerFactory = muxers.get(protocol);\n return { stream, muxerFactory };\n }\n catch (err) {\n connection.log.error('error multiplexing outbound connection', err);\n throw new CodeError(String(err), codes.ERR_MUXER_UNAVAILABLE);\n }\n }\n /**\n * Registers support for one of the given muxers via multistream-select. The\n * selected muxer will be used for all future streams on the connection.\n */\n async _multiplexInbound(connection, muxers) {\n const protocols = Array.from(muxers.keys());\n connection.log('inbound handling muxers %s', protocols);\n try {\n const { stream, protocol } = await mss.handle(connection, protocols, {\n log: connection.log\n });\n const muxerFactory = muxers.get(protocol);\n return { stream, muxerFactory };\n }\n catch (err) {\n connection.log.error('error multiplexing inbound connection', err);\n throw new CodeError(String(err), codes.ERR_MUXER_UNAVAILABLE);\n }\n }\n}\n//# sourceMappingURL=upgrader.js.map","import { unmarshalPrivateKey, unmarshalPublicKey } from '@libp2p/crypto/keys';\nimport { contentRoutingSymbol, CodeError, TypedEventEmitter, CustomEvent, setMaxListeners, peerDiscoverySymbol, peerRoutingSymbol } from '@libp2p/interface';\nimport { defaultLogger } from '@libp2p/logger';\nimport { PeerSet } from '@libp2p/peer-collections';\nimport { peerIdFromString } from '@libp2p/peer-id';\nimport { createEd25519PeerId } from '@libp2p/peer-id-factory';\nimport { PersistentPeerStore } from '@libp2p/peer-store';\nimport { isMultiaddr } from '@multiformats/multiaddr';\nimport { MemoryDatastore } from 'datastore-core/memory';\nimport { concat as uint8ArrayConcat } from 'uint8arrays/concat';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport { DefaultAddressManager } from './address-manager/index.js';\nimport { checkServiceDependencies, defaultComponents } from './components.js';\nimport { connectionGater } from './config/connection-gater.js';\nimport { validateConfig } from './config.js';\nimport { DefaultConnectionManager } from './connection-manager/index.js';\nimport { ConnectionMonitor } from './connection-monitor.js';\nimport { CompoundContentRouting } from './content-routing.js';\nimport { codes } from './errors.js';\nimport { DefaultPeerRouting } from './peer-routing.js';\nimport { RandomWalk } from './random-walk.js';\nimport { DefaultRegistrar } from './registrar.js';\nimport { DefaultTransportManager } from './transport-manager.js';\nimport { DefaultUpgrader } from './upgrader.js';\nimport * as pkg from './version.js';\nexport class Libp2pNode extends TypedEventEmitter {\n peerId;\n peerStore;\n contentRouting;\n peerRouting;\n metrics;\n services;\n logger;\n status;\n components;\n log;\n constructor(init) {\n super();\n this.status = 'stopped';\n // event bus - components can listen to this emitter to be notified of system events\n // and also cause them to be emitted\n const events = new TypedEventEmitter();\n const originalDispatch = events.dispatchEvent.bind(events);\n events.dispatchEvent = (evt) => {\n const internalResult = originalDispatch(evt);\n const externalResult = this.dispatchEvent(new CustomEvent(evt.type, { detail: evt.detail }));\n return internalResult || externalResult;\n };\n // This emitter gets listened to a lot\n setMaxListeners(Infinity, events);\n this.peerId = init.peerId;\n this.logger = init.logger ?? defaultLogger();\n this.log = this.logger.forComponent('libp2p');\n // @ts-expect-error {} may not be of type T\n this.services = {};\n // @ts-expect-error defaultComponents is missing component types added later\n const components = this.components = defaultComponents({\n peerId: init.peerId,\n privateKey: init.privateKey,\n nodeInfo: init.nodeInfo ?? {\n name: pkg.name,\n version: pkg.version\n },\n logger: this.logger,\n events,\n datastore: init.datastore ?? new MemoryDatastore(),\n connectionGater: connectionGater(init.connectionGater),\n dns: init.dns\n });\n this.peerStore = this.configureComponent('peerStore', new PersistentPeerStore(components, {\n addressFilter: this.components.connectionGater.filterMultiaddrForPeer,\n ...init.peerStore\n }));\n // Create Metrics\n if (init.metrics != null) {\n this.metrics = this.configureComponent('metrics', init.metrics(this.components));\n }\n components.events.addEventListener('peer:update', evt => {\n // if there was no peer previously in the peer store this is a new peer\n if (evt.detail.previous == null) {\n const peerInfo = {\n id: evt.detail.peer.id,\n multiaddrs: evt.detail.peer.addresses.map(a => a.multiaddr)\n };\n components.events.safeDispatchEvent('peer:discovery', { detail: peerInfo });\n }\n });\n // Set up connection protector if configured\n if (init.connectionProtector != null) {\n this.configureComponent('connectionProtector', init.connectionProtector(components));\n }\n // Set up the Upgrader\n this.components.upgrader = new DefaultUpgrader(this.components, {\n connectionEncryption: (init.connectionEncryption ?? []).map((fn, index) => this.configureComponent(`connection-encryption-${index}`, fn(this.components))),\n muxers: (init.streamMuxers ?? []).map((fn, index) => this.configureComponent(`stream-muxers-${index}`, fn(this.components))),\n inboundUpgradeTimeout: init.connectionManager?.inboundUpgradeTimeout\n });\n // Setup the transport manager\n this.configureComponent('transportManager', new DefaultTransportManager(this.components, init.transportManager));\n // Create the Connection Manager\n this.configureComponent('connectionManager', new DefaultConnectionManager(this.components, init.connectionManager));\n if (init.connectionMonitor?.enabled !== false) {\n // Create the Connection Monitor if not disabled\n this.configureComponent('connectionMonitor', new ConnectionMonitor(this.components, init.connectionMonitor));\n }\n // Create the Registrar\n this.configureComponent('registrar', new DefaultRegistrar(this.components));\n // Addresses {listen, announce, noAnnounce}\n this.configureComponent('addressManager', new DefaultAddressManager(this.components, init.addresses));\n // Peer routers\n const peerRouters = (init.peerRouters ?? []).map((fn, index) => this.configureComponent(`peer-router-${index}`, fn(this.components)));\n this.peerRouting = this.components.peerRouting = this.configureComponent('peerRouting', new DefaultPeerRouting(this.components, {\n routers: peerRouters\n }));\n // Content routers\n const contentRouters = (init.contentRouters ?? []).map((fn, index) => this.configureComponent(`content-router-${index}`, fn(this.components)));\n this.contentRouting = this.components.contentRouting = this.configureComponent('contentRouting', new CompoundContentRouting(this.components, {\n routers: contentRouters\n }));\n // Random walk\n this.configureComponent('randomWalk', new RandomWalk(this.components));\n (init.peerDiscovery ?? []).forEach((fn, index) => {\n const service = this.configureComponent(`peer-discovery-${index}`, fn(this.components));\n service.addEventListener('peer', (evt) => {\n this.#onDiscoveryPeer(evt);\n });\n });\n // Transport modules\n init.transports?.forEach((fn, index) => {\n this.components.transportManager.add(this.configureComponent(`transport-${index}`, fn(this.components)));\n });\n // User defined modules\n if (init.services != null) {\n for (const name of Object.keys(init.services)) {\n const createService = init.services[name];\n const service = createService(this.components);\n if (service == null) {\n this.log.error('service factory %s returned null or undefined instance', name);\n continue;\n }\n this.services[name] = service;\n this.configureComponent(name, service);\n if (service[contentRoutingSymbol] != null) {\n this.log('registering service %s for content routing', name);\n contentRouters.push(service[contentRoutingSymbol]);\n }\n if (service[peerRoutingSymbol] != null) {\n this.log('registering service %s for peer routing', name);\n peerRouters.push(service[peerRoutingSymbol]);\n }\n if (service[peerDiscoverySymbol] != null) {\n this.log('registering service %s for peer discovery', name);\n service[peerDiscoverySymbol].addEventListener?.('peer', (evt) => {\n this.#onDiscoveryPeer(evt);\n });\n }\n }\n }\n // Ensure all services have their required dependencies\n checkServiceDependencies(components);\n }\n configureComponent(name, component) {\n if (component == null) {\n this.log.error('component %s was null or undefined', name);\n }\n // @ts-expect-error cannot assign props\n this.components[name] = component;\n return component;\n }\n /**\n * Starts the libp2p node and all its subsystems\n */\n async start() {\n if (this.status !== 'stopped') {\n return;\n }\n this.status = 'starting';\n this.log('libp2p is starting');\n try {\n await this.components.beforeStart?.();\n await this.components.start();\n await this.components.afterStart?.();\n this.status = 'started';\n this.safeDispatchEvent('start', { detail: this });\n this.log('libp2p has started');\n }\n catch (err) {\n this.log.error('An error occurred starting libp2p', err);\n // set status to 'started' so this.stop() will stop any running components\n this.status = 'started';\n await this.stop();\n throw err;\n }\n }\n /**\n * Stop the libp2p node by closing its listeners and open connections\n */\n async stop() {\n if (this.status !== 'started') {\n return;\n }\n this.log('libp2p is stopping');\n this.status = 'stopping';\n await this.components.beforeStop?.();\n await this.components.stop();\n await this.components.afterStop?.();\n this.status = 'stopped';\n this.safeDispatchEvent('stop', { detail: this });\n this.log('libp2p has stopped');\n }\n getConnections(peerId) {\n return this.components.connectionManager.getConnections(peerId);\n }\n getDialQueue() {\n return this.components.connectionManager.getDialQueue();\n }\n getPeers() {\n const peerSet = new PeerSet();\n for (const conn of this.components.connectionManager.getConnections()) {\n peerSet.add(conn.remotePeer);\n }\n return Array.from(peerSet);\n }\n async dial(peer, options = {}) {\n return this.components.connectionManager.openConnection(peer, {\n // ensure any userland dials take top priority in the queue\n priority: 75,\n ...options\n });\n }\n async dialProtocol(peer, protocols, options = {}) {\n if (protocols == null) {\n throw new CodeError('no protocols were provided to open a stream', codes.ERR_INVALID_PROTOCOLS_FOR_STREAM);\n }\n protocols = Array.isArray(protocols) ? protocols : [protocols];\n if (protocols.length === 0) {\n throw new CodeError('no protocols were provided to open a stream', codes.ERR_INVALID_PROTOCOLS_FOR_STREAM);\n }\n const connection = await this.dial(peer, options);\n return connection.newStream(protocols, options);\n }\n getMultiaddrs() {\n return this.components.addressManager.getAddresses();\n }\n getProtocols() {\n return this.components.registrar.getProtocols();\n }\n async hangUp(peer, options = {}) {\n if (isMultiaddr(peer)) {\n peer = peerIdFromString(peer.getPeerId() ?? '');\n }\n await this.components.connectionManager.closeConnections(peer, options);\n }\n /**\n * Get the public key for the given peer id\n */\n async getPublicKey(peer, options = {}) {\n this.log('getPublicKey %p', peer);\n if (peer.publicKey != null) {\n return peer.publicKey;\n }\n try {\n const peerInfo = await this.peerStore.get(peer);\n if (peerInfo.id.publicKey != null) {\n return peerInfo.id.publicKey;\n }\n }\n catch (err) {\n if (err.code !== codes.ERR_NOT_FOUND) {\n throw err;\n }\n }\n const peerKey = uint8ArrayConcat([\n uint8ArrayFromString('/pk/'),\n peer.multihash.digest\n ]);\n // search any available content routing methods\n const bytes = await this.contentRouting.get(peerKey, options);\n // ensure the returned key is valid\n unmarshalPublicKey(bytes);\n await this.peerStore.patch(peer, {\n publicKey: bytes\n });\n return bytes;\n }\n async handle(protocols, handler, options) {\n if (!Array.isArray(protocols)) {\n protocols = [protocols];\n }\n await Promise.all(protocols.map(async (protocol) => {\n await this.components.registrar.handle(protocol, handler, options);\n }));\n }\n async unhandle(protocols) {\n if (!Array.isArray(protocols)) {\n protocols = [protocols];\n }\n await Promise.all(protocols.map(async (protocol) => {\n await this.components.registrar.unhandle(protocol);\n }));\n }\n async register(protocol, topology) {\n return this.components.registrar.register(protocol, topology);\n }\n unregister(id) {\n this.components.registrar.unregister(id);\n }\n async isDialable(multiaddr, options = {}) {\n return this.components.connectionManager.isDialable(multiaddr, options);\n }\n /**\n * Called whenever peer discovery services emit `peer` events and adds peers\n * to the peer store.\n */\n #onDiscoveryPeer(evt) {\n const { detail: peer } = evt;\n if (peer.id.toString() === this.peerId.toString()) {\n this.log.error(new Error(codes.ERR_DISCOVERED_SELF));\n return;\n }\n void this.components.peerStore.merge(peer.id, {\n multiaddrs: peer.multiaddrs\n })\n .catch(err => { this.log.error(err); });\n }\n}\n/**\n * Returns a new Libp2pNode instance - this exposes more of the internals than the\n * libp2p interface and is useful for testing and debugging.\n */\nexport async function createLibp2pNode(options = {}) {\n const peerId = options.peerId ??= await createEd25519PeerId();\n if (peerId.privateKey == null) {\n throw new CodeError('peer id was missing private key', 'ERR_MISSING_PRIVATE_KEY');\n }\n options.privateKey ??= await unmarshalPrivateKey(peerId.privateKey);\n return new Libp2pNode(await validateConfig(options));\n}\n//# sourceMappingURL=libp2p.js.map","export const version = '1.9.4';\nexport const name = 'libp2p';\n//# sourceMappingURL=version.js.map","/**\n * The ENR tree for the different fleets.\n * SANDBOX and TEST fleets are for The Waku Network.\n */\nexport const enrTree = {\n SANDBOX: \"enrtree://AIRVQ5DDA4FFWLRBCHJWUWOO6X6S4ZTZ5B667LQ6AJU6PEYDLRD5O@sandbox.waku.nodes.status.im\",\n TEST: \"enrtree://AOGYWMBYOUIMOENHXCHILPKY3ZRFEULMFI4DOM442QSZ73TT2A7VI@test.waku.nodes.status.im\"\n};\nexport const DEFAULT_BOOTSTRAP_TAG_NAME = \"bootstrap\";\nexport const DEFAULT_BOOTSTRAP_TAG_VALUE = 50;\nexport const DEFAULT_BOOTSTRAP_TAG_TTL = 100_000_000;\nexport const DEFAULT_NODE_REQUIREMENTS = {\n store: 1,\n filter: 2,\n lightPush: 2\n};\n//# sourceMappingURL=constants.js.map","/*! noble-secp256k1 - MIT License (c) 2019 Paul Miller (paulmillr.com) */\nimport * as nodeCrypto from 'crypto';\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\nconst _2n = BigInt(2);\nconst _3n = BigInt(3);\nconst _8n = BigInt(8);\nconst CURVE = Object.freeze({\n a: _0n,\n b: BigInt(7),\n P: BigInt('0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f'),\n n: BigInt('0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141'),\n h: _1n,\n Gx: BigInt('55066263022277343669578718895168534326250603453777594175500187360389116729240'),\n Gy: BigInt('32670510020758816978083085130507043184471273380659243275938904335757337482424'),\n beta: BigInt('0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee'),\n});\nconst divNearest = (a, b) => (a + b / _2n) / b;\nconst endo = {\n beta: BigInt('0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee'),\n splitScalar(k) {\n const { n } = CURVE;\n const a1 = BigInt('0x3086d221a7d46bcde86c90e49284eb15');\n const b1 = -_1n * BigInt('0xe4437ed6010e88286f547fa90abfe4c3');\n const a2 = BigInt('0x114ca50f7a8e2f3f657c1108d9d44cfd8');\n const b2 = a1;\n const POW_2_128 = BigInt('0x100000000000000000000000000000000');\n const c1 = divNearest(b2 * k, n);\n const c2 = divNearest(-b1 * k, n);\n let k1 = mod(k - c1 * a1 - c2 * a2, n);\n let k2 = mod(-c1 * b1 - c2 * b2, n);\n const k1neg = k1 > POW_2_128;\n const k2neg = k2 > POW_2_128;\n if (k1neg)\n k1 = n - k1;\n if (k2neg)\n k2 = n - k2;\n if (k1 > POW_2_128 || k2 > POW_2_128) {\n throw new Error('splitScalarEndo: Endomorphism failed, k=' + k);\n }\n return { k1neg, k1, k2neg, k2 };\n },\n};\nconst fieldLen = 32;\nconst groupLen = 32;\nconst hashLen = 32;\nconst compressedLen = fieldLen + 1;\nconst uncompressedLen = 2 * fieldLen + 1;\nexport { CURVE };\nfunction weierstrass(x) {\n const { a, b } = CURVE;\n const x2 = mod(x * x);\n const x3 = mod(x2 * x);\n return mod(x3 + a * x + b);\n}\nconst USE_ENDOMORPHISM = CURVE.a === _0n;\nclass ShaError extends Error {\n constructor(message) {\n super(message);\n }\n}\nfunction assertJacPoint(other) {\n if (!(other instanceof JacobianPoint))\n throw new TypeError('JacobianPoint expected');\n}\nclass JacobianPoint {\n constructor(x, y, z) {\n this.x = x;\n this.y = y;\n this.z = z;\n }\n static fromAffine(p) {\n if (!(p instanceof Point)) {\n throw new TypeError('JacobianPoint#fromAffine: expected Point');\n }\n if (p.equals(Point.ZERO))\n return JacobianPoint.ZERO;\n return new JacobianPoint(p.x, p.y, _1n);\n }\n static toAffineBatch(points) {\n const toInv = invertBatch(points.map((p) => p.z));\n return points.map((p, i) => p.toAffine(toInv[i]));\n }\n static normalizeZ(points) {\n return JacobianPoint.toAffineBatch(points).map(JacobianPoint.fromAffine);\n }\n equals(other) {\n assertJacPoint(other);\n const { x: X1, y: Y1, z: Z1 } = this;\n const { x: X2, y: Y2, z: Z2 } = other;\n const Z1Z1 = mod(Z1 * Z1);\n const Z2Z2 = mod(Z2 * Z2);\n const U1 = mod(X1 * Z2Z2);\n const U2 = mod(X2 * Z1Z1);\n const S1 = mod(mod(Y1 * Z2) * Z2Z2);\n const S2 = mod(mod(Y2 * Z1) * Z1Z1);\n return U1 === U2 && S1 === S2;\n }\n negate() {\n return new JacobianPoint(this.x, mod(-this.y), this.z);\n }\n double() {\n const { x: X1, y: Y1, z: Z1 } = this;\n const A = mod(X1 * X1);\n const B = mod(Y1 * Y1);\n const C = mod(B * B);\n const x1b = X1 + B;\n const D = mod(_2n * (mod(x1b * x1b) - A - C));\n const E = mod(_3n * A);\n const F = mod(E * E);\n const X3 = mod(F - _2n * D);\n const Y3 = mod(E * (D - X3) - _8n * C);\n const Z3 = mod(_2n * Y1 * Z1);\n return new JacobianPoint(X3, Y3, Z3);\n }\n add(other) {\n assertJacPoint(other);\n const { x: X1, y: Y1, z: Z1 } = this;\n const { x: X2, y: Y2, z: Z2 } = other;\n if (X2 === _0n || Y2 === _0n)\n return this;\n if (X1 === _0n || Y1 === _0n)\n return other;\n const Z1Z1 = mod(Z1 * Z1);\n const Z2Z2 = mod(Z2 * Z2);\n const U1 = mod(X1 * Z2Z2);\n const U2 = mod(X2 * Z1Z1);\n const S1 = mod(mod(Y1 * Z2) * Z2Z2);\n const S2 = mod(mod(Y2 * Z1) * Z1Z1);\n const H = mod(U2 - U1);\n const r = mod(S2 - S1);\n if (H === _0n) {\n if (r === _0n) {\n return this.double();\n }\n else {\n return JacobianPoint.ZERO;\n }\n }\n const HH = mod(H * H);\n const HHH = mod(H * HH);\n const V = mod(U1 * HH);\n const X3 = mod(r * r - HHH - _2n * V);\n const Y3 = mod(r * (V - X3) - S1 * HHH);\n const Z3 = mod(Z1 * Z2 * H);\n return new JacobianPoint(X3, Y3, Z3);\n }\n subtract(other) {\n return this.add(other.negate());\n }\n multiplyUnsafe(scalar) {\n const P0 = JacobianPoint.ZERO;\n if (typeof scalar === 'bigint' && scalar === _0n)\n return P0;\n let n = normalizeScalar(scalar);\n if (n === _1n)\n return this;\n if (!USE_ENDOMORPHISM) {\n let p = P0;\n let d = this;\n while (n > _0n) {\n if (n & _1n)\n p = p.add(d);\n d = d.double();\n n >>= _1n;\n }\n return p;\n }\n let { k1neg, k1, k2neg, k2 } = endo.splitScalar(n);\n let k1p = P0;\n let k2p = P0;\n let d = this;\n while (k1 > _0n || k2 > _0n) {\n if (k1 & _1n)\n k1p = k1p.add(d);\n if (k2 & _1n)\n k2p = k2p.add(d);\n d = d.double();\n k1 >>= _1n;\n k2 >>= _1n;\n }\n if (k1neg)\n k1p = k1p.negate();\n if (k2neg)\n k2p = k2p.negate();\n k2p = new JacobianPoint(mod(k2p.x * endo.beta), k2p.y, k2p.z);\n return k1p.add(k2p);\n }\n precomputeWindow(W) {\n const windows = USE_ENDOMORPHISM ? 128 / W + 1 : 256 / W + 1;\n const points = [];\n let p = this;\n let base = p;\n for (let window = 0; window < windows; window++) {\n base = p;\n points.push(base);\n for (let i = 1; i < 2 ** (W - 1); i++) {\n base = base.add(p);\n points.push(base);\n }\n p = base.double();\n }\n return points;\n }\n wNAF(n, affinePoint) {\n if (!affinePoint && this.equals(JacobianPoint.BASE))\n affinePoint = Point.BASE;\n const W = (affinePoint && affinePoint._WINDOW_SIZE) || 1;\n if (256 % W) {\n throw new Error('Point#wNAF: Invalid precomputation window, must be power of 2');\n }\n let precomputes = affinePoint && pointPrecomputes.get(affinePoint);\n if (!precomputes) {\n precomputes = this.precomputeWindow(W);\n if (affinePoint && W !== 1) {\n precomputes = JacobianPoint.normalizeZ(precomputes);\n pointPrecomputes.set(affinePoint, precomputes);\n }\n }\n let p = JacobianPoint.ZERO;\n let f = JacobianPoint.BASE;\n const windows = 1 + (USE_ENDOMORPHISM ? 128 / W : 256 / W);\n const windowSize = 2 ** (W - 1);\n const mask = BigInt(2 ** W - 1);\n const maxNumber = 2 ** W;\n const shiftBy = BigInt(W);\n for (let window = 0; window < windows; window++) {\n const offset = window * windowSize;\n let wbits = Number(n & mask);\n n >>= shiftBy;\n if (wbits > windowSize) {\n wbits -= maxNumber;\n n += _1n;\n }\n const offset1 = offset;\n const offset2 = offset + Math.abs(wbits) - 1;\n const cond1 = window % 2 !== 0;\n const cond2 = wbits < 0;\n if (wbits === 0) {\n f = f.add(constTimeNegate(cond1, precomputes[offset1]));\n }\n else {\n p = p.add(constTimeNegate(cond2, precomputes[offset2]));\n }\n }\n return { p, f };\n }\n multiply(scalar, affinePoint) {\n let n = normalizeScalar(scalar);\n let point;\n let fake;\n if (USE_ENDOMORPHISM) {\n const { k1neg, k1, k2neg, k2 } = endo.splitScalar(n);\n let { p: k1p, f: f1p } = this.wNAF(k1, affinePoint);\n let { p: k2p, f: f2p } = this.wNAF(k2, affinePoint);\n k1p = constTimeNegate(k1neg, k1p);\n k2p = constTimeNegate(k2neg, k2p);\n k2p = new JacobianPoint(mod(k2p.x * endo.beta), k2p.y, k2p.z);\n point = k1p.add(k2p);\n fake = f1p.add(f2p);\n }\n else {\n const { p, f } = this.wNAF(n, affinePoint);\n point = p;\n fake = f;\n }\n return JacobianPoint.normalizeZ([point, fake])[0];\n }\n toAffine(invZ) {\n const { x, y, z } = this;\n const is0 = this.equals(JacobianPoint.ZERO);\n if (invZ == null)\n invZ = is0 ? _8n : invert(z);\n const iz1 = invZ;\n const iz2 = mod(iz1 * iz1);\n const iz3 = mod(iz2 * iz1);\n const ax = mod(x * iz2);\n const ay = mod(y * iz3);\n const zz = mod(z * iz1);\n if (is0)\n return Point.ZERO;\n if (zz !== _1n)\n throw new Error('invZ was invalid');\n return new Point(ax, ay);\n }\n}\nJacobianPoint.BASE = new JacobianPoint(CURVE.Gx, CURVE.Gy, _1n);\nJacobianPoint.ZERO = new JacobianPoint(_0n, _1n, _0n);\nfunction constTimeNegate(condition, item) {\n const neg = item.negate();\n return condition ? neg : item;\n}\nconst pointPrecomputes = new WeakMap();\nexport class Point {\n constructor(x, y) {\n this.x = x;\n this.y = y;\n }\n _setWindowSize(windowSize) {\n this._WINDOW_SIZE = windowSize;\n pointPrecomputes.delete(this);\n }\n hasEvenY() {\n return this.y % _2n === _0n;\n }\n static fromCompressedHex(bytes) {\n const isShort = bytes.length === 32;\n const x = bytesToNumber(isShort ? bytes : bytes.subarray(1));\n if (!isValidFieldElement(x))\n throw new Error('Point is not on curve');\n const y2 = weierstrass(x);\n let y = sqrtMod(y2);\n const isYOdd = (y & _1n) === _1n;\n if (isShort) {\n if (isYOdd)\n y = mod(-y);\n }\n else {\n const isFirstByteOdd = (bytes[0] & 1) === 1;\n if (isFirstByteOdd !== isYOdd)\n y = mod(-y);\n }\n const point = new Point(x, y);\n point.assertValidity();\n return point;\n }\n static fromUncompressedHex(bytes) {\n const x = bytesToNumber(bytes.subarray(1, fieldLen + 1));\n const y = bytesToNumber(bytes.subarray(fieldLen + 1, fieldLen * 2 + 1));\n const point = new Point(x, y);\n point.assertValidity();\n return point;\n }\n static fromHex(hex) {\n const bytes = ensureBytes(hex);\n const len = bytes.length;\n const header = bytes[0];\n if (len === fieldLen)\n return this.fromCompressedHex(bytes);\n if (len === compressedLen && (header === 0x02 || header === 0x03)) {\n return this.fromCompressedHex(bytes);\n }\n if (len === uncompressedLen && header === 0x04)\n return this.fromUncompressedHex(bytes);\n throw new Error(`Point.fromHex: received invalid point. Expected 32-${compressedLen} compressed bytes or ${uncompressedLen} uncompressed bytes, not ${len}`);\n }\n static fromPrivateKey(privateKey) {\n return Point.BASE.multiply(normalizePrivateKey(privateKey));\n }\n static fromSignature(msgHash, signature, recovery) {\n const { r, s } = normalizeSignature(signature);\n if (![0, 1, 2, 3].includes(recovery))\n throw new Error('Cannot recover: invalid recovery bit');\n const h = truncateHash(ensureBytes(msgHash));\n const { n } = CURVE;\n const radj = recovery === 2 || recovery === 3 ? r + n : r;\n const rinv = invert(radj, n);\n const u1 = mod(-h * rinv, n);\n const u2 = mod(s * rinv, n);\n const prefix = recovery & 1 ? '03' : '02';\n const R = Point.fromHex(prefix + numTo32bStr(radj));\n const Q = Point.BASE.multiplyAndAddUnsafe(R, u1, u2);\n if (!Q)\n throw new Error('Cannot recover signature: point at infinify');\n Q.assertValidity();\n return Q;\n }\n toRawBytes(isCompressed = false) {\n return hexToBytes(this.toHex(isCompressed));\n }\n toHex(isCompressed = false) {\n const x = numTo32bStr(this.x);\n if (isCompressed) {\n const prefix = this.hasEvenY() ? '02' : '03';\n return `${prefix}${x}`;\n }\n else {\n return `04${x}${numTo32bStr(this.y)}`;\n }\n }\n toHexX() {\n return this.toHex(true).slice(2);\n }\n toRawX() {\n return this.toRawBytes(true).slice(1);\n }\n assertValidity() {\n const msg = 'Point is not on elliptic curve';\n const { x, y } = this;\n if (!isValidFieldElement(x) || !isValidFieldElement(y))\n throw new Error(msg);\n const left = mod(y * y);\n const right = weierstrass(x);\n if (mod(left - right) !== _0n)\n throw new Error(msg);\n }\n equals(other) {\n return this.x === other.x && this.y === other.y;\n }\n negate() {\n return new Point(this.x, mod(-this.y));\n }\n double() {\n return JacobianPoint.fromAffine(this).double().toAffine();\n }\n add(other) {\n return JacobianPoint.fromAffine(this).add(JacobianPoint.fromAffine(other)).toAffine();\n }\n subtract(other) {\n return this.add(other.negate());\n }\n multiply(scalar) {\n return JacobianPoint.fromAffine(this).multiply(scalar, this).toAffine();\n }\n multiplyAndAddUnsafe(Q, a, b) {\n const P = JacobianPoint.fromAffine(this);\n const aP = a === _0n || a === _1n || this !== Point.BASE ? P.multiplyUnsafe(a) : P.multiply(a);\n const bQ = JacobianPoint.fromAffine(Q).multiplyUnsafe(b);\n const sum = aP.add(bQ);\n return sum.equals(JacobianPoint.ZERO) ? undefined : sum.toAffine();\n }\n}\nPoint.BASE = new Point(CURVE.Gx, CURVE.Gy);\nPoint.ZERO = new Point(_0n, _0n);\nfunction sliceDER(s) {\n return Number.parseInt(s[0], 16) >= 8 ? '00' + s : s;\n}\nfunction parseDERInt(data) {\n if (data.length < 2 || data[0] !== 0x02) {\n throw new Error(`Invalid signature integer tag: ${bytesToHex(data)}`);\n }\n const len = data[1];\n const res = data.subarray(2, len + 2);\n if (!len || res.length !== len) {\n throw new Error(`Invalid signature integer: wrong length`);\n }\n if (res[0] === 0x00 && res[1] <= 0x7f) {\n throw new Error('Invalid signature integer: trailing length');\n }\n return { data: bytesToNumber(res), left: data.subarray(len + 2) };\n}\nfunction parseDERSignature(data) {\n if (data.length < 2 || data[0] != 0x30) {\n throw new Error(`Invalid signature tag: ${bytesToHex(data)}`);\n }\n if (data[1] !== data.length - 2) {\n throw new Error('Invalid signature: incorrect length');\n }\n const { data: r, left: sBytes } = parseDERInt(data.subarray(2));\n const { data: s, left: rBytesLeft } = parseDERInt(sBytes);\n if (rBytesLeft.length) {\n throw new Error(`Invalid signature: left bytes after parsing: ${bytesToHex(rBytesLeft)}`);\n }\n return { r, s };\n}\nexport class Signature {\n constructor(r, s) {\n this.r = r;\n this.s = s;\n this.assertValidity();\n }\n static fromCompact(hex) {\n const arr = hex instanceof Uint8Array;\n const name = 'Signature.fromCompact';\n if (typeof hex !== 'string' && !arr)\n throw new TypeError(`${name}: Expected string or Uint8Array`);\n const str = arr ? bytesToHex(hex) : hex;\n if (str.length !== 128)\n throw new Error(`${name}: Expected 64-byte hex`);\n return new Signature(hexToNumber(str.slice(0, 64)), hexToNumber(str.slice(64, 128)));\n }\n static fromDER(hex) {\n const arr = hex instanceof Uint8Array;\n if (typeof hex !== 'string' && !arr)\n throw new TypeError(`Signature.fromDER: Expected string or Uint8Array`);\n const { r, s } = parseDERSignature(arr ? hex : hexToBytes(hex));\n return new Signature(r, s);\n }\n static fromHex(hex) {\n return this.fromDER(hex);\n }\n assertValidity() {\n const { r, s } = this;\n if (!isWithinCurveOrder(r))\n throw new Error('Invalid Signature: r must be 0 < r < n');\n if (!isWithinCurveOrder(s))\n throw new Error('Invalid Signature: s must be 0 < s < n');\n }\n hasHighS() {\n const HALF = CURVE.n >> _1n;\n return this.s > HALF;\n }\n normalizeS() {\n return this.hasHighS() ? new Signature(this.r, mod(-this.s, CURVE.n)) : this;\n }\n toDERRawBytes() {\n return hexToBytes(this.toDERHex());\n }\n toDERHex() {\n const sHex = sliceDER(numberToHexUnpadded(this.s));\n const rHex = sliceDER(numberToHexUnpadded(this.r));\n const sHexL = sHex.length / 2;\n const rHexL = rHex.length / 2;\n const sLen = numberToHexUnpadded(sHexL);\n const rLen = numberToHexUnpadded(rHexL);\n const length = numberToHexUnpadded(rHexL + sHexL + 4);\n return `30${length}02${rLen}${rHex}02${sLen}${sHex}`;\n }\n toRawBytes() {\n return this.toDERRawBytes();\n }\n toHex() {\n return this.toDERHex();\n }\n toCompactRawBytes() {\n return hexToBytes(this.toCompactHex());\n }\n toCompactHex() {\n return numTo32bStr(this.r) + numTo32bStr(this.s);\n }\n}\nfunction concatBytes(...arrays) {\n if (!arrays.every((b) => b instanceof Uint8Array))\n throw new Error('Uint8Array list expected');\n if (arrays.length === 1)\n return arrays[0];\n const length = arrays.reduce((a, arr) => a + arr.length, 0);\n const result = new Uint8Array(length);\n for (let i = 0, pad = 0; i < arrays.length; i++) {\n const arr = arrays[i];\n result.set(arr, pad);\n pad += arr.length;\n }\n return result;\n}\nconst hexes = Array.from({ length: 256 }, (v, i) => i.toString(16).padStart(2, '0'));\nfunction bytesToHex(uint8a) {\n if (!(uint8a instanceof Uint8Array))\n throw new Error('Expected Uint8Array');\n let hex = '';\n for (let i = 0; i < uint8a.length; i++) {\n hex += hexes[uint8a[i]];\n }\n return hex;\n}\nconst POW_2_256 = BigInt('0x10000000000000000000000000000000000000000000000000000000000000000');\nfunction numTo32bStr(num) {\n if (typeof num !== 'bigint')\n throw new Error('Expected bigint');\n if (!(_0n <= num && num < POW_2_256))\n throw new Error('Expected number 0 <= n < 2^256');\n return num.toString(16).padStart(64, '0');\n}\nfunction numTo32b(num) {\n const b = hexToBytes(numTo32bStr(num));\n if (b.length !== 32)\n throw new Error('Error: expected 32 bytes');\n return b;\n}\nfunction numberToHexUnpadded(num) {\n const hex = num.toString(16);\n return hex.length & 1 ? `0${hex}` : hex;\n}\nfunction hexToNumber(hex) {\n if (typeof hex !== 'string') {\n throw new TypeError('hexToNumber: expected string, got ' + typeof hex);\n }\n return BigInt(`0x${hex}`);\n}\nfunction hexToBytes(hex) {\n if (typeof hex !== 'string') {\n throw new TypeError('hexToBytes: expected string, got ' + typeof hex);\n }\n if (hex.length % 2)\n throw new Error('hexToBytes: received invalid unpadded hex' + hex.length);\n const array = new Uint8Array(hex.length / 2);\n for (let i = 0; i < array.length; i++) {\n const j = i * 2;\n const hexByte = hex.slice(j, j + 2);\n const byte = Number.parseInt(hexByte, 16);\n if (Number.isNaN(byte) || byte < 0)\n throw new Error('Invalid byte sequence');\n array[i] = byte;\n }\n return array;\n}\nfunction bytesToNumber(bytes) {\n return hexToNumber(bytesToHex(bytes));\n}\nfunction ensureBytes(hex) {\n return hex instanceof Uint8Array ? Uint8Array.from(hex) : hexToBytes(hex);\n}\nfunction normalizeScalar(num) {\n if (typeof num === 'number' && Number.isSafeInteger(num) && num > 0)\n return BigInt(num);\n if (typeof num === 'bigint' && isWithinCurveOrder(num))\n return num;\n throw new TypeError('Expected valid private scalar: 0 < scalar < curve.n');\n}\nfunction mod(a, b = CURVE.P) {\n const result = a % b;\n return result >= _0n ? result : b + result;\n}\nfunction pow2(x, power) {\n const { P } = CURVE;\n let res = x;\n while (power-- > _0n) {\n res *= res;\n res %= P;\n }\n return res;\n}\nfunction sqrtMod(x) {\n const { P } = CURVE;\n const _6n = BigInt(6);\n const _11n = BigInt(11);\n const _22n = BigInt(22);\n const _23n = BigInt(23);\n const _44n = BigInt(44);\n const _88n = BigInt(88);\n const b2 = (x * x * x) % P;\n const b3 = (b2 * b2 * x) % P;\n const b6 = (pow2(b3, _3n) * b3) % P;\n const b9 = (pow2(b6, _3n) * b3) % P;\n const b11 = (pow2(b9, _2n) * b2) % P;\n const b22 = (pow2(b11, _11n) * b11) % P;\n const b44 = (pow2(b22, _22n) * b22) % P;\n const b88 = (pow2(b44, _44n) * b44) % P;\n const b176 = (pow2(b88, _88n) * b88) % P;\n const b220 = (pow2(b176, _44n) * b44) % P;\n const b223 = (pow2(b220, _3n) * b3) % P;\n const t1 = (pow2(b223, _23n) * b22) % P;\n const t2 = (pow2(t1, _6n) * b2) % P;\n const rt = pow2(t2, _2n);\n const xc = (rt * rt) % P;\n if (xc !== x)\n throw new Error('Cannot find square root');\n return rt;\n}\nfunction invert(number, modulo = CURVE.P) {\n if (number === _0n || modulo <= _0n) {\n throw new Error(`invert: expected positive integers, got n=${number} mod=${modulo}`);\n }\n let a = mod(number, modulo);\n let b = modulo;\n let x = _0n, y = _1n, u = _1n, v = _0n;\n while (a !== _0n) {\n const q = b / a;\n const r = b % a;\n const m = x - u * q;\n const n = y - v * q;\n b = a, a = r, x = u, y = v, u = m, v = n;\n }\n const gcd = b;\n if (gcd !== _1n)\n throw new Error('invert: does not exist');\n return mod(x, modulo);\n}\nfunction invertBatch(nums, p = CURVE.P) {\n const scratch = new Array(nums.length);\n const lastMultiplied = nums.reduce((acc, num, i) => {\n if (num === _0n)\n return acc;\n scratch[i] = acc;\n return mod(acc * num, p);\n }, _1n);\n const inverted = invert(lastMultiplied, p);\n nums.reduceRight((acc, num, i) => {\n if (num === _0n)\n return acc;\n scratch[i] = mod(acc * scratch[i], p);\n return mod(acc * num, p);\n }, inverted);\n return scratch;\n}\nfunction bits2int_2(bytes) {\n const delta = bytes.length * 8 - groupLen * 8;\n const num = bytesToNumber(bytes);\n return delta > 0 ? num >> BigInt(delta) : num;\n}\nfunction truncateHash(hash, truncateOnly = false) {\n const h = bits2int_2(hash);\n if (truncateOnly)\n return h;\n const { n } = CURVE;\n return h >= n ? h - n : h;\n}\nlet _sha256Sync;\nlet _hmacSha256Sync;\nclass HmacDrbg {\n constructor(hashLen, qByteLen) {\n this.hashLen = hashLen;\n this.qByteLen = qByteLen;\n if (typeof hashLen !== 'number' || hashLen < 2)\n throw new Error('hashLen must be a number');\n if (typeof qByteLen !== 'number' || qByteLen < 2)\n throw new Error('qByteLen must be a number');\n this.v = new Uint8Array(hashLen).fill(1);\n this.k = new Uint8Array(hashLen).fill(0);\n this.counter = 0;\n }\n hmac(...values) {\n return utils.hmacSha256(this.k, ...values);\n }\n hmacSync(...values) {\n return _hmacSha256Sync(this.k, ...values);\n }\n checkSync() {\n if (typeof _hmacSha256Sync !== 'function')\n throw new ShaError('hmacSha256Sync needs to be set');\n }\n incr() {\n if (this.counter >= 1000)\n throw new Error('Tried 1,000 k values for sign(), all were invalid');\n this.counter += 1;\n }\n async reseed(seed = new Uint8Array()) {\n this.k = await this.hmac(this.v, Uint8Array.from([0x00]), seed);\n this.v = await this.hmac(this.v);\n if (seed.length === 0)\n return;\n this.k = await this.hmac(this.v, Uint8Array.from([0x01]), seed);\n this.v = await this.hmac(this.v);\n }\n reseedSync(seed = new Uint8Array()) {\n this.checkSync();\n this.k = this.hmacSync(this.v, Uint8Array.from([0x00]), seed);\n this.v = this.hmacSync(this.v);\n if (seed.length === 0)\n return;\n this.k = this.hmacSync(this.v, Uint8Array.from([0x01]), seed);\n this.v = this.hmacSync(this.v);\n }\n async generate() {\n this.incr();\n let len = 0;\n const out = [];\n while (len < this.qByteLen) {\n this.v = await this.hmac(this.v);\n const sl = this.v.slice();\n out.push(sl);\n len += this.v.length;\n }\n return concatBytes(...out);\n }\n generateSync() {\n this.checkSync();\n this.incr();\n let len = 0;\n const out = [];\n while (len < this.qByteLen) {\n this.v = this.hmacSync(this.v);\n const sl = this.v.slice();\n out.push(sl);\n len += this.v.length;\n }\n return concatBytes(...out);\n }\n}\nfunction isWithinCurveOrder(num) {\n return _0n < num && num < CURVE.n;\n}\nfunction isValidFieldElement(num) {\n return _0n < num && num < CURVE.P;\n}\nfunction kmdToSig(kBytes, m, d, lowS = true) {\n const { n } = CURVE;\n const k = truncateHash(kBytes, true);\n if (!isWithinCurveOrder(k))\n return;\n const kinv = invert(k, n);\n const q = Point.BASE.multiply(k);\n const r = mod(q.x, n);\n if (r === _0n)\n return;\n const s = mod(kinv * mod(m + d * r, n), n);\n if (s === _0n)\n return;\n let sig = new Signature(r, s);\n let recovery = (q.x === sig.r ? 0 : 2) | Number(q.y & _1n);\n if (lowS && sig.hasHighS()) {\n sig = sig.normalizeS();\n recovery ^= 1;\n }\n return { sig, recovery };\n}\nfunction normalizePrivateKey(key) {\n let num;\n if (typeof key === 'bigint') {\n num = key;\n }\n else if (typeof key === 'number' && Number.isSafeInteger(key) && key > 0) {\n num = BigInt(key);\n }\n else if (typeof key === 'string') {\n if (key.length !== 2 * groupLen)\n throw new Error('Expected 32 bytes of private key');\n num = hexToNumber(key);\n }\n else if (key instanceof Uint8Array) {\n if (key.length !== groupLen)\n throw new Error('Expected 32 bytes of private key');\n num = bytesToNumber(key);\n }\n else {\n throw new TypeError('Expected valid private key');\n }\n if (!isWithinCurveOrder(num))\n throw new Error('Expected private key: 0 < key < n');\n return num;\n}\nfunction normalizePublicKey(publicKey) {\n if (publicKey instanceof Point) {\n publicKey.assertValidity();\n return publicKey;\n }\n else {\n return Point.fromHex(publicKey);\n }\n}\nfunction normalizeSignature(signature) {\n if (signature instanceof Signature) {\n signature.assertValidity();\n return signature;\n }\n try {\n return Signature.fromDER(signature);\n }\n catch (error) {\n return Signature.fromCompact(signature);\n }\n}\nexport function getPublicKey(privateKey, isCompressed = false) {\n return Point.fromPrivateKey(privateKey).toRawBytes(isCompressed);\n}\nexport function recoverPublicKey(msgHash, signature, recovery, isCompressed = false) {\n return Point.fromSignature(msgHash, signature, recovery).toRawBytes(isCompressed);\n}\nfunction isProbPub(item) {\n const arr = item instanceof Uint8Array;\n const str = typeof item === 'string';\n const len = (arr || str) && item.length;\n if (arr)\n return len === compressedLen || len === uncompressedLen;\n if (str)\n return len === compressedLen * 2 || len === uncompressedLen * 2;\n if (item instanceof Point)\n return true;\n return false;\n}\nexport function getSharedSecret(privateA, publicB, isCompressed = false) {\n if (isProbPub(privateA))\n throw new TypeError('getSharedSecret: first arg must be private key');\n if (!isProbPub(publicB))\n throw new TypeError('getSharedSecret: second arg must be public key');\n const b = normalizePublicKey(publicB);\n b.assertValidity();\n return b.multiply(normalizePrivateKey(privateA)).toRawBytes(isCompressed);\n}\nfunction bits2int(bytes) {\n const slice = bytes.length > fieldLen ? bytes.slice(0, fieldLen) : bytes;\n return bytesToNumber(slice);\n}\nfunction bits2octets(bytes) {\n const z1 = bits2int(bytes);\n const z2 = mod(z1, CURVE.n);\n return int2octets(z2 < _0n ? z1 : z2);\n}\nfunction int2octets(num) {\n return numTo32b(num);\n}\nfunction initSigArgs(msgHash, privateKey, extraEntropy) {\n if (msgHash == null)\n throw new Error(`sign: expected valid message hash, not \"${msgHash}\"`);\n const h1 = ensureBytes(msgHash);\n const d = normalizePrivateKey(privateKey);\n const seedArgs = [int2octets(d), bits2octets(h1)];\n if (extraEntropy != null) {\n if (extraEntropy === true)\n extraEntropy = utils.randomBytes(fieldLen);\n const e = ensureBytes(extraEntropy);\n if (e.length !== fieldLen)\n throw new Error(`sign: Expected ${fieldLen} bytes of extra data`);\n seedArgs.push(e);\n }\n const seed = concatBytes(...seedArgs);\n const m = bits2int(h1);\n return { seed, m, d };\n}\nfunction finalizeSig(recSig, opts) {\n const { sig, recovery } = recSig;\n const { der, recovered } = Object.assign({ canonical: true, der: true }, opts);\n const hashed = der ? sig.toDERRawBytes() : sig.toCompactRawBytes();\n return recovered ? [hashed, recovery] : hashed;\n}\nasync function sign(msgHash, privKey, opts = {}) {\n const { seed, m, d } = initSigArgs(msgHash, privKey, opts.extraEntropy);\n const drbg = new HmacDrbg(hashLen, groupLen);\n await drbg.reseed(seed);\n let sig;\n while (!(sig = kmdToSig(await drbg.generate(), m, d, opts.canonical)))\n await drbg.reseed();\n return finalizeSig(sig, opts);\n}\nfunction signSync(msgHash, privKey, opts = {}) {\n const { seed, m, d } = initSigArgs(msgHash, privKey, opts.extraEntropy);\n const drbg = new HmacDrbg(hashLen, groupLen);\n drbg.reseedSync(seed);\n let sig;\n while (!(sig = kmdToSig(drbg.generateSync(), m, d, opts.canonical)))\n drbg.reseedSync();\n return finalizeSig(sig, opts);\n}\nexport { sign, signSync };\nconst vopts = { strict: true };\nexport function verify(signature, msgHash, publicKey, opts = vopts) {\n let sig;\n try {\n sig = normalizeSignature(signature);\n msgHash = ensureBytes(msgHash);\n }\n catch (error) {\n return false;\n }\n const { r, s } = sig;\n if (opts.strict && sig.hasHighS())\n return false;\n const h = truncateHash(msgHash);\n let P;\n try {\n P = normalizePublicKey(publicKey);\n }\n catch (error) {\n return false;\n }\n const { n } = CURVE;\n const sinv = invert(s, n);\n const u1 = mod(h * sinv, n);\n const u2 = mod(r * sinv, n);\n const R = Point.BASE.multiplyAndAddUnsafe(P, u1, u2);\n if (!R)\n return false;\n const v = mod(R.x, n);\n return v === r;\n}\nfunction schnorrChallengeFinalize(ch) {\n return mod(bytesToNumber(ch), CURVE.n);\n}\nclass SchnorrSignature {\n constructor(r, s) {\n this.r = r;\n this.s = s;\n this.assertValidity();\n }\n static fromHex(hex) {\n const bytes = ensureBytes(hex);\n if (bytes.length !== 64)\n throw new TypeError(`SchnorrSignature.fromHex: expected 64 bytes, not ${bytes.length}`);\n const r = bytesToNumber(bytes.subarray(0, 32));\n const s = bytesToNumber(bytes.subarray(32, 64));\n return new SchnorrSignature(r, s);\n }\n assertValidity() {\n const { r, s } = this;\n if (!isValidFieldElement(r) || !isWithinCurveOrder(s))\n throw new Error('Invalid signature');\n }\n toHex() {\n return numTo32bStr(this.r) + numTo32bStr(this.s);\n }\n toRawBytes() {\n return hexToBytes(this.toHex());\n }\n}\nfunction schnorrGetPublicKey(privateKey) {\n return Point.fromPrivateKey(privateKey).toRawX();\n}\nclass InternalSchnorrSignature {\n constructor(message, privateKey, auxRand = utils.randomBytes()) {\n if (message == null)\n throw new TypeError(`sign: Expected valid message, not \"${message}\"`);\n this.m = ensureBytes(message);\n const { x, scalar } = this.getScalar(normalizePrivateKey(privateKey));\n this.px = x;\n this.d = scalar;\n this.rand = ensureBytes(auxRand);\n if (this.rand.length !== 32)\n throw new TypeError('sign: Expected 32 bytes of aux randomness');\n }\n getScalar(priv) {\n const point = Point.fromPrivateKey(priv);\n const scalar = point.hasEvenY() ? priv : CURVE.n - priv;\n return { point, scalar, x: point.toRawX() };\n }\n initNonce(d, t0h) {\n return numTo32b(d ^ bytesToNumber(t0h));\n }\n finalizeNonce(k0h) {\n const k0 = mod(bytesToNumber(k0h), CURVE.n);\n if (k0 === _0n)\n throw new Error('sign: Creation of signature failed. k is zero');\n const { point: R, x: rx, scalar: k } = this.getScalar(k0);\n return { R, rx, k };\n }\n finalizeSig(R, k, e, d) {\n return new SchnorrSignature(R.x, mod(k + e * d, CURVE.n)).toRawBytes();\n }\n error() {\n throw new Error('sign: Invalid signature produced');\n }\n async calc() {\n const { m, d, px, rand } = this;\n const tag = utils.taggedHash;\n const t = this.initNonce(d, await tag(TAGS.aux, rand));\n const { R, rx, k } = this.finalizeNonce(await tag(TAGS.nonce, t, px, m));\n const e = schnorrChallengeFinalize(await tag(TAGS.challenge, rx, px, m));\n const sig = this.finalizeSig(R, k, e, d);\n if (!(await schnorrVerify(sig, m, px)))\n this.error();\n return sig;\n }\n calcSync() {\n const { m, d, px, rand } = this;\n const tag = utils.taggedHashSync;\n const t = this.initNonce(d, tag(TAGS.aux, rand));\n const { R, rx, k } = this.finalizeNonce(tag(TAGS.nonce, t, px, m));\n const e = schnorrChallengeFinalize(tag(TAGS.challenge, rx, px, m));\n const sig = this.finalizeSig(R, k, e, d);\n if (!schnorrVerifySync(sig, m, px))\n this.error();\n return sig;\n }\n}\nasync function schnorrSign(msg, privKey, auxRand) {\n return new InternalSchnorrSignature(msg, privKey, auxRand).calc();\n}\nfunction schnorrSignSync(msg, privKey, auxRand) {\n return new InternalSchnorrSignature(msg, privKey, auxRand).calcSync();\n}\nfunction initSchnorrVerify(signature, message, publicKey) {\n const raw = signature instanceof SchnorrSignature;\n const sig = raw ? signature : SchnorrSignature.fromHex(signature);\n if (raw)\n sig.assertValidity();\n return {\n ...sig,\n m: ensureBytes(message),\n P: normalizePublicKey(publicKey),\n };\n}\nfunction finalizeSchnorrVerify(r, P, s, e) {\n const R = Point.BASE.multiplyAndAddUnsafe(P, normalizePrivateKey(s), mod(-e, CURVE.n));\n if (!R || !R.hasEvenY() || R.x !== r)\n return false;\n return true;\n}\nasync function schnorrVerify(signature, message, publicKey) {\n try {\n const { r, s, m, P } = initSchnorrVerify(signature, message, publicKey);\n const e = schnorrChallengeFinalize(await utils.taggedHash(TAGS.challenge, numTo32b(r), P.toRawX(), m));\n return finalizeSchnorrVerify(r, P, s, e);\n }\n catch (error) {\n return false;\n }\n}\nfunction schnorrVerifySync(signature, message, publicKey) {\n try {\n const { r, s, m, P } = initSchnorrVerify(signature, message, publicKey);\n const e = schnorrChallengeFinalize(utils.taggedHashSync(TAGS.challenge, numTo32b(r), P.toRawX(), m));\n return finalizeSchnorrVerify(r, P, s, e);\n }\n catch (error) {\n if (error instanceof ShaError)\n throw error;\n return false;\n }\n}\nexport const schnorr = {\n Signature: SchnorrSignature,\n getPublicKey: schnorrGetPublicKey,\n sign: schnorrSign,\n verify: schnorrVerify,\n signSync: schnorrSignSync,\n verifySync: schnorrVerifySync,\n};\nPoint.BASE._setWindowSize(8);\nconst crypto = {\n node: nodeCrypto,\n web: typeof self === 'object' && 'crypto' in self ? self.crypto : undefined,\n};\nconst TAGS = {\n challenge: 'BIP0340/challenge',\n aux: 'BIP0340/aux',\n nonce: 'BIP0340/nonce',\n};\nconst TAGGED_HASH_PREFIXES = {};\nexport const utils = {\n bytesToHex,\n hexToBytes,\n concatBytes,\n mod,\n invert,\n isValidPrivateKey(privateKey) {\n try {\n normalizePrivateKey(privateKey);\n return true;\n }\n catch (error) {\n return false;\n }\n },\n _bigintTo32Bytes: numTo32b,\n _normalizePrivateKey: normalizePrivateKey,\n hashToPrivateKey: (hash) => {\n hash = ensureBytes(hash);\n const minLen = groupLen + 8;\n if (hash.length < minLen || hash.length > 1024) {\n throw new Error(`Expected valid bytes of private key as per FIPS 186`);\n }\n const num = mod(bytesToNumber(hash), CURVE.n - _1n) + _1n;\n return numTo32b(num);\n },\n randomBytes: (bytesLength = 32) => {\n if (crypto.web) {\n return crypto.web.getRandomValues(new Uint8Array(bytesLength));\n }\n else if (crypto.node) {\n const { randomBytes } = crypto.node;\n return Uint8Array.from(randomBytes(bytesLength));\n }\n else {\n throw new Error(\"The environment doesn't have randomBytes function\");\n }\n },\n randomPrivateKey: () => utils.hashToPrivateKey(utils.randomBytes(groupLen + 8)),\n precompute(windowSize = 8, point = Point.BASE) {\n const cached = point === Point.BASE ? point : new Point(point.x, point.y);\n cached._setWindowSize(windowSize);\n cached.multiply(_3n);\n return cached;\n },\n sha256: async (...messages) => {\n if (crypto.web) {\n const buffer = await crypto.web.subtle.digest('SHA-256', concatBytes(...messages));\n return new Uint8Array(buffer);\n }\n else if (crypto.node) {\n const { createHash } = crypto.node;\n const hash = createHash('sha256');\n messages.forEach((m) => hash.update(m));\n return Uint8Array.from(hash.digest());\n }\n else {\n throw new Error(\"The environment doesn't have sha256 function\");\n }\n },\n hmacSha256: async (key, ...messages) => {\n if (crypto.web) {\n const ckey = await crypto.web.subtle.importKey('raw', key, { name: 'HMAC', hash: { name: 'SHA-256' } }, false, ['sign']);\n const message = concatBytes(...messages);\n const buffer = await crypto.web.subtle.sign('HMAC', ckey, message);\n return new Uint8Array(buffer);\n }\n else if (crypto.node) {\n const { createHmac } = crypto.node;\n const hash = createHmac('sha256', key);\n messages.forEach((m) => hash.update(m));\n return Uint8Array.from(hash.digest());\n }\n else {\n throw new Error(\"The environment doesn't have hmac-sha256 function\");\n }\n },\n sha256Sync: undefined,\n hmacSha256Sync: undefined,\n taggedHash: async (tag, ...messages) => {\n let tagP = TAGGED_HASH_PREFIXES[tag];\n if (tagP === undefined) {\n const tagH = await utils.sha256(Uint8Array.from(tag, (c) => c.charCodeAt(0)));\n tagP = concatBytes(tagH, tagH);\n TAGGED_HASH_PREFIXES[tag] = tagP;\n }\n return utils.sha256(tagP, ...messages);\n },\n taggedHashSync: (tag, ...messages) => {\n if (typeof _sha256Sync !== 'function')\n throw new ShaError('sha256Sync is undefined, you need to set it');\n let tagP = TAGGED_HASH_PREFIXES[tag];\n if (tagP === undefined) {\n const tagH = _sha256Sync(Uint8Array.from(tag, (c) => c.charCodeAt(0)));\n tagP = concatBytes(tagH, tagH);\n TAGGED_HASH_PREFIXES[tag] = tagP;\n }\n return _sha256Sync(tagP, ...messages);\n },\n _JacobianPoint: JacobianPoint,\n};\nObject.defineProperties(utils, {\n sha256Sync: {\n configurable: false,\n get() {\n return _sha256Sync;\n },\n set(val) {\n if (!_sha256Sync)\n _sha256Sync = val;\n },\n },\n hmacSha256Sync: {\n configurable: false,\n get() {\n return _hmacSha256Sync;\n },\n set(val) {\n if (!_hmacSha256Sync)\n _hmacSha256Sync = val;\n },\n },\n});\n","import * as secp from \"@noble/secp256k1\";\nimport { concat } from \"@waku/utils/bytes\";\nimport sha3 from \"js-sha3\";\n/**\n * ECDSA Sign a message with the given private key.\n *\n * @param message The message to sign, usually a hash.\n * @param privateKey The ECDSA private key to use to sign the message.\n *\n * @returns The signature and the recovery id concatenated.\n */\nexport async function sign(message, privateKey) {\n const [signature, recoveryId] = await secp.sign(message, privateKey, {\n recovered: true,\n der: false\n });\n return concat([signature, new Uint8Array([recoveryId])], signature.length + 1);\n}\nexport function keccak256(input) {\n return new Uint8Array(sha3.keccak256.arrayBuffer(input));\n}\nexport function compressPublicKey(publicKey) {\n if (publicKey.length === 64) {\n publicKey = concat([new Uint8Array([4]), publicKey], 65);\n }\n const point = secp.Point.fromHex(publicKey);\n return point.toRawBytes(true);\n}\n/**\n * Verify an ECDSA signature.\n */\nexport function verifySignature(signature, message, publicKey) {\n try {\n const _signature = secp.Signature.fromCompact(signature.slice(0, 64));\n return secp.verify(_signature, message, publicKey);\n }\n catch {\n return false;\n }\n}\n//# sourceMappingURL=crypto.js.map","// Maximum encoded size of an ENR\nexport const MAX_RECORD_SIZE = 300;\nexport const ERR_INVALID_ID = \"Invalid record id\";\nexport const ERR_NO_SIGNATURE = \"No valid signature found\";\n// The maximum length of byte size of a multiaddr to encode in the `multiaddr` field\n// The size is a big endian 16-bit unsigned integer\nexport const MULTIADDR_LENGTH_SIZE = 2;\n//# sourceMappingURL=constants.js.map","import { multiaddrFromFields } from \"./multiaddr_from_fields.js\";\nexport function locationMultiaddrFromEnrFields(enr, protocol) {\n switch (protocol) {\n case \"udp\":\n return (locationMultiaddrFromEnrFields(enr, \"udp4\") ||\n locationMultiaddrFromEnrFields(enr, \"udp6\"));\n case \"tcp\":\n return (locationMultiaddrFromEnrFields(enr, \"tcp4\") ||\n locationMultiaddrFromEnrFields(enr, \"tcp6\"));\n }\n const isIpv6 = protocol.endsWith(\"6\");\n const ipVal = enr.get(isIpv6 ? \"ip6\" : \"ip\");\n if (!ipVal)\n return;\n const protoName = protocol.slice(0, 3);\n let protoVal;\n switch (protoName) {\n case \"udp\":\n protoVal = isIpv6 ? enr.get(\"udp6\") : enr.get(\"udp\");\n break;\n case \"tcp\":\n protoVal = isIpv6 ? enr.get(\"tcp6\") : enr.get(\"tcp\");\n break;\n default:\n return;\n }\n if (!protoVal)\n return;\n return multiaddrFromFields(isIpv6 ? \"ip6\" : \"ip4\", protoName, ipVal, protoVal);\n}\n//# sourceMappingURL=get_multiaddr.js.map","import { multiaddr } from \"@multiformats/multiaddr\";\nimport { convertToString } from \"@multiformats/multiaddr/convert\";\nexport function multiaddrFromFields(ipFamily, protocol, ipBytes, protocolBytes) {\n let ma = multiaddr(\"/\" + ipFamily + \"/\" + convertToString(ipFamily, ipBytes));\n ma = ma.encapsulate(multiaddr(\"/\" + protocol + \"/\" + convertToString(protocol, protocolBytes)));\n return ma;\n}\n//# sourceMappingURL=multiaddr_from_fields.js.map","import { multiaddr } from \"@multiformats/multiaddr\";\nimport { MULTIADDR_LENGTH_SIZE } from \"./constants.js\";\nexport function decodeMultiaddrs(bytes) {\n const multiaddrs = [];\n let index = 0;\n while (index < bytes.length) {\n const sizeDataView = new DataView(bytes.buffer, index, MULTIADDR_LENGTH_SIZE);\n const size = sizeDataView.getUint16(0);\n index += MULTIADDR_LENGTH_SIZE;\n const multiaddrBytes = bytes.slice(index, index + size);\n index += size;\n multiaddrs.push(multiaddr(multiaddrBytes));\n }\n return multiaddrs;\n}\nexport function encodeMultiaddrs(multiaddrs) {\n const totalLength = multiaddrs.reduce((acc, ma) => acc + MULTIADDR_LENGTH_SIZE + ma.bytes.length, 0);\n const bytes = new Uint8Array(totalLength);\n const dataView = new DataView(bytes.buffer);\n let index = 0;\n multiaddrs.forEach((multiaddr) => {\n if (multiaddr.getPeerId())\n throw new Error(\"`multiaddr` field MUST not contain peer id\");\n // Prepend the size of the next entry\n dataView.setUint16(index, multiaddr.bytes.length);\n index += MULTIADDR_LENGTH_SIZE;\n bytes.set(multiaddr.bytes, index);\n index += multiaddr.bytes.length;\n });\n return bytes;\n}\n//# sourceMappingURL=multiaddrs_codec.js.map","export function encodeWaku2(protocols) {\n let byte = 0;\n if (protocols.lightPush)\n byte += 1;\n byte = byte << 1;\n if (protocols.filter)\n byte += 1;\n byte = byte << 1;\n if (protocols.store)\n byte += 1;\n byte = byte << 1;\n if (protocols.relay)\n byte += 1;\n return byte;\n}\nexport function decodeWaku2(byte) {\n const waku2 = {\n relay: false,\n store: false,\n filter: false,\n lightPush: false\n };\n if (byte % 2)\n waku2.relay = true;\n byte = byte >> 1;\n if (byte % 2)\n waku2.store = true;\n byte = byte >> 1;\n if (byte % 2)\n waku2.filter = true;\n byte = byte >> 1;\n if (byte % 2)\n waku2.lightPush = true;\n return waku2;\n}\n//# sourceMappingURL=waku2_codec.js.map","import { convertToBytes, convertToString } from \"@multiformats/multiaddr/convert\";\nimport { decodeRelayShard } from \"@waku/utils\";\nimport { bytesToUtf8 } from \"@waku/utils/bytes\";\nimport { ERR_INVALID_ID } from \"./constants.js\";\nimport { decodeMultiaddrs, encodeMultiaddrs } from \"./multiaddrs_codec.js\";\nimport { decodeWaku2, encodeWaku2 } from \"./waku2_codec.js\";\nexport class RawEnr extends Map {\n seq;\n signature;\n constructor(kvs = {}, seq = BigInt(1), signature) {\n super(Object.entries(kvs));\n this.seq = seq;\n this.signature = signature;\n }\n set(k, v) {\n this.signature = undefined;\n this.seq++;\n return super.set(k, v);\n }\n get id() {\n const id = this.get(\"id\");\n if (!id)\n throw new Error(\"id not found.\");\n return bytesToUtf8(id);\n }\n get publicKey() {\n switch (this.id) {\n case \"v4\":\n return this.get(\"secp256k1\");\n default:\n throw new Error(ERR_INVALID_ID);\n }\n }\n get rs() {\n const rs = this.get(\"rs\");\n if (!rs)\n return undefined;\n return decodeRelayShard(rs);\n }\n get rsv() {\n const rsv = this.get(\"rsv\");\n if (!rsv)\n return undefined;\n return decodeRelayShard(rsv);\n }\n get ip() {\n return getStringValue(this, \"ip\", \"ip4\");\n }\n set ip(ip) {\n setStringValue(this, \"ip\", \"ip4\", ip);\n }\n get tcp() {\n return getNumberAsStringValue(this, \"tcp\", \"tcp\");\n }\n set tcp(port) {\n setNumberAsStringValue(this, \"tcp\", \"tcp\", port);\n }\n get udp() {\n return getNumberAsStringValue(this, \"udp\", \"udp\");\n }\n set udp(port) {\n setNumberAsStringValue(this, \"udp\", \"udp\", port);\n }\n get ip6() {\n return getStringValue(this, \"ip6\", \"ip6\");\n }\n set ip6(ip) {\n setStringValue(this, \"ip6\", \"ip6\", ip);\n }\n get tcp6() {\n return getNumberAsStringValue(this, \"tcp6\", \"tcp\");\n }\n set tcp6(port) {\n setNumberAsStringValue(this, \"tcp6\", \"tcp\", port);\n }\n get udp6() {\n return getNumberAsStringValue(this, \"udp6\", \"udp\");\n }\n set udp6(port) {\n setNumberAsStringValue(this, \"udp6\", \"udp\", port);\n }\n /**\n * Get the `multiaddrs` field from ENR.\n *\n * This field is used to store multiaddresses that cannot be stored with the current ENR pre-defined keys.\n * These can be a multiaddresses that include encapsulation (e.g. wss) or do not use `ip4` nor `ip6` for the host\n * address (e.g. `dns4`, `dnsaddr`, etc)..\n *\n * If the peer information only contains information that can be represented with the ENR pre-defined keys\n * (ip, tcp, etc) then the usage of { @link ENR.getLocationMultiaddr } should be preferred.\n *\n * The multiaddresses stored in this field are expected to be location multiaddresses, ie, peer id less.\n */\n get multiaddrs() {\n const raw = this.get(\"multiaddrs\");\n if (raw)\n return decodeMultiaddrs(raw);\n return;\n }\n /**\n * Set the `multiaddrs` field on the ENR.\n *\n * This field is used to store multiaddresses that cannot be stored with the current ENR pre-defined keys.\n * These can be a multiaddresses that include encapsulation (e.g. wss) or do not use `ip4` nor `ip6` for the host\n * address (e.g. `dns4`, `dnsaddr`, etc)..\n *\n * If the peer information only contains information that can be represented with the ENR pre-defined keys\n * (ip, tcp, etc) then the usage of { @link ENR.setLocationMultiaddr } should be preferred.\n * The multiaddresses stored in this field must be location multiaddresses,\n * ie, without a peer id.\n */\n set multiaddrs(multiaddrs) {\n deleteUndefined(this, \"multiaddrs\", multiaddrs, encodeMultiaddrs);\n }\n /**\n * Get the `waku2` field from ENR.\n */\n get waku2() {\n const raw = this.get(\"waku2\");\n if (raw)\n return decodeWaku2(raw[0]);\n return;\n }\n /**\n * Set the `waku2` field on the ENR.\n */\n set waku2(waku2) {\n deleteUndefined(this, \"waku2\", waku2, (w) => new Uint8Array([encodeWaku2(w)]));\n }\n}\nfunction getStringValue(map, key, proto) {\n const raw = map.get(key);\n if (!raw)\n return;\n return convertToString(proto, raw);\n}\nfunction getNumberAsStringValue(map, key, proto) {\n const raw = map.get(key);\n if (!raw)\n return;\n return Number(convertToString(proto, raw));\n}\nfunction setStringValue(map, key, proto, value) {\n deleteUndefined(map, key, value, convertToBytes.bind({}, proto));\n}\nfunction setNumberAsStringValue(map, key, proto, value) {\n setStringValue(map, key, proto, value?.toString(10));\n}\nfunction deleteUndefined(map, key, value, transform) {\n if (value !== undefined) {\n map.set(key, transform(value));\n }\n else {\n map.delete(key);\n }\n}\n//# sourceMappingURL=raw_enr.js.map","import * as secp from \"@noble/secp256k1\";\nimport { bytesToHex } from \"@waku/utils/bytes\";\nimport { keccak256 } from \"./crypto.js\";\nexport async function sign(privKey, msg) {\n return secp.sign(keccak256(msg), privKey, {\n der: false\n });\n}\nexport function nodeId(pubKey) {\n const publicKey = secp.Point.fromHex(pubKey);\n const uncompressedPubkey = publicKey.toRawBytes(false);\n return bytesToHex(keccak256(uncompressedPubkey.slice(1)));\n}\n//# sourceMappingURL=v4.js.map","import { Logger } from \"@waku/utils\";\nimport { ERR_INVALID_ID } from \"./constants.js\";\nimport { keccak256, verifySignature } from \"./crypto.js\";\nimport { locationMultiaddrFromEnrFields } from \"./get_multiaddr.js\";\nimport { createPeerIdFromPublicKey } from \"./peer_id.js\";\nimport { RawEnr } from \"./raw_enr.js\";\nimport * as v4 from \"./v4.js\";\nconst log = new Logger(\"enr\");\nexport var TransportProtocol;\n(function (TransportProtocol) {\n TransportProtocol[\"TCP\"] = \"tcp\";\n TransportProtocol[\"UDP\"] = \"udp\";\n})(TransportProtocol || (TransportProtocol = {}));\nexport var TransportProtocolPerIpVersion;\n(function (TransportProtocolPerIpVersion) {\n TransportProtocolPerIpVersion[\"TCP4\"] = \"tcp4\";\n TransportProtocolPerIpVersion[\"UDP4\"] = \"udp4\";\n TransportProtocolPerIpVersion[\"TCP6\"] = \"tcp6\";\n TransportProtocolPerIpVersion[\"UDP6\"] = \"udp6\";\n})(TransportProtocolPerIpVersion || (TransportProtocolPerIpVersion = {}));\nexport class ENR extends RawEnr {\n static RECORD_PREFIX = \"enr:\";\n peerId;\n static async create(kvs = {}, seq = BigInt(1), signature) {\n const enr = new ENR(kvs, seq, signature);\n try {\n const publicKey = enr.publicKey;\n if (publicKey) {\n enr.peerId = await createPeerIdFromPublicKey(publicKey);\n }\n }\n catch (e) {\n log.error(\"Could not calculate peer id for ENR\", e);\n }\n return enr;\n }\n get nodeId() {\n switch (this.id) {\n case \"v4\":\n return this.publicKey ? v4.nodeId(this.publicKey) : undefined;\n default:\n throw new Error(ERR_INVALID_ID);\n }\n }\n getLocationMultiaddr = locationMultiaddrFromEnrFields.bind({}, this);\n get shardInfo() {\n if (this.rs && this.rsv) {\n log.warn(\"ENR contains both `rs` and `rsv` fields.\");\n }\n return this.rs || this.rsv;\n }\n setLocationMultiaddr(multiaddr) {\n const protoNames = multiaddr.protoNames();\n if (protoNames.length !== 2 &&\n protoNames[1] !== \"udp\" &&\n protoNames[1] !== \"tcp\") {\n throw new Error(\"Invalid multiaddr\");\n }\n const tuples = multiaddr.tuples();\n if (!tuples[0][1] || !tuples[1][1]) {\n throw new Error(\"Invalid multiaddr\");\n }\n // IPv4\n if (tuples[0][0] === 4) {\n this.set(\"ip\", tuples[0][1]);\n this.set(protoNames[1], tuples[1][1]);\n }\n else {\n this.set(\"ip6\", tuples[0][1]);\n this.set(protoNames[1] + \"6\", tuples[1][1]);\n }\n }\n getAllLocationMultiaddrs() {\n const multiaddrs = [];\n for (const protocol of Object.values(TransportProtocolPerIpVersion)) {\n const ma = this.getLocationMultiaddr(protocol);\n if (ma)\n multiaddrs.push(ma);\n }\n const _multiaddrs = this.multiaddrs ?? [];\n return multiaddrs.concat(_multiaddrs).map((ma) => {\n if (this.peerId) {\n return ma.encapsulate(`/p2p/${this.peerId.toString()}`);\n }\n return ma;\n });\n }\n get peerInfo() {\n const id = this.peerId;\n if (!id)\n return;\n return {\n id,\n multiaddrs: this.getAllLocationMultiaddrs()\n };\n }\n /**\n * Returns the full multiaddr from the ENR fields matching the provided\n * `protocol` parameter.\n * To return full multiaddrs from the `multiaddrs` ENR field,\n * use { @link ENR.getFullMultiaddrs }.\n *\n * @param protocol\n */\n getFullMultiaddr(protocol) {\n if (this.peerId) {\n const locationMultiaddr = this.getLocationMultiaddr(protocol);\n if (locationMultiaddr) {\n return locationMultiaddr.encapsulate(`/p2p/${this.peerId.toString()}`);\n }\n }\n return;\n }\n /**\n * Returns the full multiaddrs from the `multiaddrs` ENR field.\n */\n getFullMultiaddrs() {\n if (this.peerId && this.multiaddrs) {\n const peerId = this.peerId;\n return this.multiaddrs.map((ma) => {\n return ma.encapsulate(`/p2p/${peerId.toString()}`);\n });\n }\n return [];\n }\n verify(data, signature) {\n if (!this.get(\"id\") || this.id !== \"v4\") {\n throw new Error(ERR_INVALID_ID);\n }\n if (!this.publicKey) {\n throw new Error(\"Failed to verify ENR: No public key\");\n }\n return verifySignature(signature, keccak256(data), this.publicKey);\n }\n async sign(data, privateKey) {\n switch (this.id) {\n case \"v4\":\n this.signature = await v4.sign(privateKey, data);\n break;\n default:\n throw new Error(ERR_INVALID_ID);\n }\n return this.signature;\n }\n}\n//# sourceMappingURL=enr.js.map","import { unmarshalPrivateKey, unmarshalPublicKey } from \"@libp2p/crypto/keys\";\nimport { supportedKeys } from \"@libp2p/crypto/keys\";\nimport { peerIdFromKeys } from \"@libp2p/peer-id\";\nexport function createPeerIdFromPublicKey(publicKey) {\n const _publicKey = new supportedKeys.secp256k1.Secp256k1PublicKey(publicKey);\n return peerIdFromKeys(_publicKey.bytes, undefined);\n}\nexport function getPublicKeyFromPeerId(peerId) {\n if (peerId.type !== \"secp256k1\") {\n throw new Error(\"Unsupported peer id type\");\n }\n if (!peerId.publicKey) {\n throw new Error(\"Public key not present on peer id\");\n }\n return unmarshalPublicKey(peerId.publicKey).marshal();\n}\n// Only used in tests\nexport async function getPrivateKeyFromPeerId(peerId) {\n if (peerId.type !== \"secp256k1\") {\n throw new Error(\"Unsupported peer id type\");\n }\n if (!peerId.privateKey) {\n throw new Error(\"Private key not present on peer id\");\n }\n const privateKey = await unmarshalPrivateKey(peerId.privateKey);\n return privateKey.marshal();\n}\n//# sourceMappingURL=peer_id.js.map","\"use strict\";\nlet _permanentCensorErrors = false;\nlet _censorErrors = false;\nconst LogLevels = { debug: 1, \"default\": 2, info: 2, warning: 3, error: 4, off: 5 };\nlet _logLevel = LogLevels[\"default\"];\nimport { version } from \"./_version\";\nlet _globalLogger = null;\nfunction _checkNormalize() {\n try {\n const missing = [];\n // Make sure all forms of normalization are supported\n [\"NFD\", \"NFC\", \"NFKD\", \"NFKC\"].forEach((form) => {\n try {\n if (\"test\".normalize(form) !== \"test\") {\n throw new Error(\"bad normalize\");\n }\n ;\n }\n catch (error) {\n missing.push(form);\n }\n });\n if (missing.length) {\n throw new Error(\"missing \" + missing.join(\", \"));\n }\n if (String.fromCharCode(0xe9).normalize(\"NFD\") !== String.fromCharCode(0x65, 0x0301)) {\n throw new Error(\"broken implementation\");\n }\n }\n catch (error) {\n return error.message;\n }\n return null;\n}\nconst _normalizeError = _checkNormalize();\nexport var LogLevel;\n(function (LogLevel) {\n LogLevel[\"DEBUG\"] = \"DEBUG\";\n LogLevel[\"INFO\"] = \"INFO\";\n LogLevel[\"WARNING\"] = \"WARNING\";\n LogLevel[\"ERROR\"] = \"ERROR\";\n LogLevel[\"OFF\"] = \"OFF\";\n})(LogLevel || (LogLevel = {}));\nexport var ErrorCode;\n(function (ErrorCode) {\n ///////////////////\n // Generic Errors\n // Unknown Error\n ErrorCode[\"UNKNOWN_ERROR\"] = \"UNKNOWN_ERROR\";\n // Not Implemented\n ErrorCode[\"NOT_IMPLEMENTED\"] = \"NOT_IMPLEMENTED\";\n // Unsupported Operation\n // - operation\n ErrorCode[\"UNSUPPORTED_OPERATION\"] = \"UNSUPPORTED_OPERATION\";\n // Network Error (i.e. Ethereum Network, such as an invalid chain ID)\n // - event (\"noNetwork\" is not re-thrown in provider.ready; otherwise thrown)\n ErrorCode[\"NETWORK_ERROR\"] = \"NETWORK_ERROR\";\n // Some sort of bad response from the server\n ErrorCode[\"SERVER_ERROR\"] = \"SERVER_ERROR\";\n // Timeout\n ErrorCode[\"TIMEOUT\"] = \"TIMEOUT\";\n ///////////////////\n // Operational Errors\n // Buffer Overrun\n ErrorCode[\"BUFFER_OVERRUN\"] = \"BUFFER_OVERRUN\";\n // Numeric Fault\n // - operation: the operation being executed\n // - fault: the reason this faulted\n ErrorCode[\"NUMERIC_FAULT\"] = \"NUMERIC_FAULT\";\n ///////////////////\n // Argument Errors\n // Missing new operator to an object\n // - name: The name of the class\n ErrorCode[\"MISSING_NEW\"] = \"MISSING_NEW\";\n // Invalid argument (e.g. value is incompatible with type) to a function:\n // - argument: The argument name that was invalid\n // - value: The value of the argument\n ErrorCode[\"INVALID_ARGUMENT\"] = \"INVALID_ARGUMENT\";\n // Missing argument to a function:\n // - count: The number of arguments received\n // - expectedCount: The number of arguments expected\n ErrorCode[\"MISSING_ARGUMENT\"] = \"MISSING_ARGUMENT\";\n // Too many arguments\n // - count: The number of arguments received\n // - expectedCount: The number of arguments expected\n ErrorCode[\"UNEXPECTED_ARGUMENT\"] = \"UNEXPECTED_ARGUMENT\";\n ///////////////////\n // Blockchain Errors\n // Call exception\n // - transaction: the transaction\n // - address?: the contract address\n // - args?: The arguments passed into the function\n // - method?: The Solidity method signature\n // - errorSignature?: The EIP848 error signature\n // - errorArgs?: The EIP848 error parameters\n // - reason: The reason (only for EIP848 \"Error(string)\")\n ErrorCode[\"CALL_EXCEPTION\"] = \"CALL_EXCEPTION\";\n // Insufficient funds (< value + gasLimit * gasPrice)\n // - transaction: the transaction attempted\n ErrorCode[\"INSUFFICIENT_FUNDS\"] = \"INSUFFICIENT_FUNDS\";\n // Nonce has already been used\n // - transaction: the transaction attempted\n ErrorCode[\"NONCE_EXPIRED\"] = \"NONCE_EXPIRED\";\n // The replacement fee for the transaction is too low\n // - transaction: the transaction attempted\n ErrorCode[\"REPLACEMENT_UNDERPRICED\"] = \"REPLACEMENT_UNDERPRICED\";\n // The gas limit could not be estimated\n // - transaction: the transaction passed to estimateGas\n ErrorCode[\"UNPREDICTABLE_GAS_LIMIT\"] = \"UNPREDICTABLE_GAS_LIMIT\";\n // The transaction was replaced by one with a higher gas price\n // - reason: \"cancelled\", \"replaced\" or \"repriced\"\n // - cancelled: true if reason == \"cancelled\" or reason == \"replaced\")\n // - hash: original transaction hash\n // - replacement: the full TransactionsResponse for the replacement\n // - receipt: the receipt of the replacement\n ErrorCode[\"TRANSACTION_REPLACED\"] = \"TRANSACTION_REPLACED\";\n ///////////////////\n // Interaction Errors\n // The user rejected the action, such as signing a message or sending\n // a transaction\n ErrorCode[\"ACTION_REJECTED\"] = \"ACTION_REJECTED\";\n})(ErrorCode || (ErrorCode = {}));\n;\nconst HEX = \"0123456789abcdef\";\nexport class Logger {\n constructor(version) {\n Object.defineProperty(this, \"version\", {\n enumerable: true,\n value: version,\n writable: false\n });\n }\n _log(logLevel, args) {\n const level = logLevel.toLowerCase();\n if (LogLevels[level] == null) {\n this.throwArgumentError(\"invalid log level name\", \"logLevel\", logLevel);\n }\n if (_logLevel > LogLevels[level]) {\n return;\n }\n console.log.apply(console, args);\n }\n debug(...args) {\n this._log(Logger.levels.DEBUG, args);\n }\n info(...args) {\n this._log(Logger.levels.INFO, args);\n }\n warn(...args) {\n this._log(Logger.levels.WARNING, args);\n }\n makeError(message, code, params) {\n // Errors are being censored\n if (_censorErrors) {\n return this.makeError(\"censored error\", code, {});\n }\n if (!code) {\n code = Logger.errors.UNKNOWN_ERROR;\n }\n if (!params) {\n params = {};\n }\n const messageDetails = [];\n Object.keys(params).forEach((key) => {\n const value = params[key];\n try {\n if (value instanceof Uint8Array) {\n let hex = \"\";\n for (let i = 0; i < value.length; i++) {\n hex += HEX[value[i] >> 4];\n hex += HEX[value[i] & 0x0f];\n }\n messageDetails.push(key + \"=Uint8Array(0x\" + hex + \")\");\n }\n else {\n messageDetails.push(key + \"=\" + JSON.stringify(value));\n }\n }\n catch (error) {\n messageDetails.push(key + \"=\" + JSON.stringify(params[key].toString()));\n }\n });\n messageDetails.push(`code=${code}`);\n messageDetails.push(`version=${this.version}`);\n const reason = message;\n let url = \"\";\n switch (code) {\n case ErrorCode.NUMERIC_FAULT: {\n url = \"NUMERIC_FAULT\";\n const fault = message;\n switch (fault) {\n case \"overflow\":\n case \"underflow\":\n case \"division-by-zero\":\n url += \"-\" + fault;\n break;\n case \"negative-power\":\n case \"negative-width\":\n url += \"-unsupported\";\n break;\n case \"unbound-bitwise-result\":\n url += \"-unbound-result\";\n break;\n }\n break;\n }\n case ErrorCode.CALL_EXCEPTION:\n case ErrorCode.INSUFFICIENT_FUNDS:\n case ErrorCode.MISSING_NEW:\n case ErrorCode.NONCE_EXPIRED:\n case ErrorCode.REPLACEMENT_UNDERPRICED:\n case ErrorCode.TRANSACTION_REPLACED:\n case ErrorCode.UNPREDICTABLE_GAS_LIMIT:\n url = code;\n break;\n }\n if (url) {\n message += \" [ See: https:/\\/links.ethers.org/v5-errors-\" + url + \" ]\";\n }\n if (messageDetails.length) {\n message += \" (\" + messageDetails.join(\", \") + \")\";\n }\n // @TODO: Any??\n const error = new Error(message);\n error.reason = reason;\n error.code = code;\n Object.keys(params).forEach(function (key) {\n error[key] = params[key];\n });\n return error;\n }\n throwError(message, code, params) {\n throw this.makeError(message, code, params);\n }\n throwArgumentError(message, name, value) {\n return this.throwError(message, Logger.errors.INVALID_ARGUMENT, {\n argument: name,\n value: value\n });\n }\n assert(condition, message, code, params) {\n if (!!condition) {\n return;\n }\n this.throwError(message, code, params);\n }\n assertArgument(condition, message, name, value) {\n if (!!condition) {\n return;\n }\n this.throwArgumentError(message, name, value);\n }\n checkNormalize(message) {\n if (message == null) {\n message = \"platform missing String.prototype.normalize\";\n }\n if (_normalizeError) {\n this.throwError(\"platform missing String.prototype.normalize\", Logger.errors.UNSUPPORTED_OPERATION, {\n operation: \"String.prototype.normalize\", form: _normalizeError\n });\n }\n }\n checkSafeUint53(value, message) {\n if (typeof (value) !== \"number\") {\n return;\n }\n if (message == null) {\n message = \"value not safe\";\n }\n if (value < 0 || value >= 0x1fffffffffffff) {\n this.throwError(message, Logger.errors.NUMERIC_FAULT, {\n operation: \"checkSafeInteger\",\n fault: \"out-of-safe-range\",\n value: value\n });\n }\n if (value % 1) {\n this.throwError(message, Logger.errors.NUMERIC_FAULT, {\n operation: \"checkSafeInteger\",\n fault: \"non-integer\",\n value: value\n });\n }\n }\n checkArgumentCount(count, expectedCount, message) {\n if (message) {\n message = \": \" + message;\n }\n else {\n message = \"\";\n }\n if (count < expectedCount) {\n this.throwError(\"missing argument\" + message, Logger.errors.MISSING_ARGUMENT, {\n count: count,\n expectedCount: expectedCount\n });\n }\n if (count > expectedCount) {\n this.throwError(\"too many arguments\" + message, Logger.errors.UNEXPECTED_ARGUMENT, {\n count: count,\n expectedCount: expectedCount\n });\n }\n }\n checkNew(target, kind) {\n if (target === Object || target == null) {\n this.throwError(\"missing new\", Logger.errors.MISSING_NEW, { name: kind.name });\n }\n }\n checkAbstract(target, kind) {\n if (target === kind) {\n this.throwError(\"cannot instantiate abstract class \" + JSON.stringify(kind.name) + \" directly; use a sub-class\", Logger.errors.UNSUPPORTED_OPERATION, { name: target.name, operation: \"new\" });\n }\n else if (target === Object || target == null) {\n this.throwError(\"missing new\", Logger.errors.MISSING_NEW, { name: kind.name });\n }\n }\n static globalLogger() {\n if (!_globalLogger) {\n _globalLogger = new Logger(version);\n }\n return _globalLogger;\n }\n static setCensorship(censorship, permanent) {\n if (!censorship && permanent) {\n this.globalLogger().throwError(\"cannot permanently disable censorship\", Logger.errors.UNSUPPORTED_OPERATION, {\n operation: \"setCensorship\"\n });\n }\n if (_permanentCensorErrors) {\n if (!censorship) {\n return;\n }\n this.globalLogger().throwError(\"error censorship permanent\", Logger.errors.UNSUPPORTED_OPERATION, {\n operation: \"setCensorship\"\n });\n }\n _censorErrors = !!censorship;\n _permanentCensorErrors = !!permanent;\n }\n static setLogLevel(logLevel) {\n const level = LogLevels[logLevel.toLowerCase()];\n if (level == null) {\n Logger.globalLogger().warn(\"invalid log level - \" + logLevel);\n return;\n }\n _logLevel = level;\n }\n static from(version) {\n return new Logger(version);\n }\n}\nLogger.errors = ErrorCode;\nLogger.levels = LogLevel;\n//# sourceMappingURL=index.js.map","export const version = \"logger/5.7.0\";\n//# sourceMappingURL=_version.js.map","export const version = \"bytes/5.7.0\";\n//# sourceMappingURL=_version.js.map","\"use strict\";\nimport { Logger } from \"@ethersproject/logger\";\nimport { version } from \"./_version\";\nconst logger = new Logger(version);\n///////////////////////////////\nfunction isHexable(value) {\n return !!(value.toHexString);\n}\nfunction addSlice(array) {\n if (array.slice) {\n return array;\n }\n array.slice = function () {\n const args = Array.prototype.slice.call(arguments);\n return addSlice(new Uint8Array(Array.prototype.slice.apply(array, args)));\n };\n return array;\n}\nexport function isBytesLike(value) {\n return ((isHexString(value) && !(value.length % 2)) || isBytes(value));\n}\nfunction isInteger(value) {\n return (typeof (value) === \"number\" && value == value && (value % 1) === 0);\n}\nexport function isBytes(value) {\n if (value == null) {\n return false;\n }\n if (value.constructor === Uint8Array) {\n return true;\n }\n if (typeof (value) === \"string\") {\n return false;\n }\n if (!isInteger(value.length) || value.length < 0) {\n return false;\n }\n for (let i = 0; i < value.length; i++) {\n const v = value[i];\n if (!isInteger(v) || v < 0 || v >= 256) {\n return false;\n }\n }\n return true;\n}\nexport function arrayify(value, options) {\n if (!options) {\n options = {};\n }\n if (typeof (value) === \"number\") {\n logger.checkSafeUint53(value, \"invalid arrayify value\");\n const result = [];\n while (value) {\n result.unshift(value & 0xff);\n value = parseInt(String(value / 256));\n }\n if (result.length === 0) {\n result.push(0);\n }\n return addSlice(new Uint8Array(result));\n }\n if (options.allowMissingPrefix && typeof (value) === \"string\" && value.substring(0, 2) !== \"0x\") {\n value = \"0x\" + value;\n }\n if (isHexable(value)) {\n value = value.toHexString();\n }\n if (isHexString(value)) {\n let hex = value.substring(2);\n if (hex.length % 2) {\n if (options.hexPad === \"left\") {\n hex = \"0\" + hex;\n }\n else if (options.hexPad === \"right\") {\n hex += \"0\";\n }\n else {\n logger.throwArgumentError(\"hex data is odd-length\", \"value\", value);\n }\n }\n const result = [];\n for (let i = 0; i < hex.length; i += 2) {\n result.push(parseInt(hex.substring(i, i + 2), 16));\n }\n return addSlice(new Uint8Array(result));\n }\n if (isBytes(value)) {\n return addSlice(new Uint8Array(value));\n }\n return logger.throwArgumentError(\"invalid arrayify value\", \"value\", value);\n}\nexport function concat(items) {\n const objects = items.map(item => arrayify(item));\n const length = objects.reduce((accum, item) => (accum + item.length), 0);\n const result = new Uint8Array(length);\n objects.reduce((offset, object) => {\n result.set(object, offset);\n return offset + object.length;\n }, 0);\n return addSlice(result);\n}\nexport function stripZeros(value) {\n let result = arrayify(value);\n if (result.length === 0) {\n return result;\n }\n // Find the first non-zero entry\n let start = 0;\n while (start < result.length && result[start] === 0) {\n start++;\n }\n // If we started with zeros, strip them\n if (start) {\n result = result.slice(start);\n }\n return result;\n}\nexport function zeroPad(value, length) {\n value = arrayify(value);\n if (value.length > length) {\n logger.throwArgumentError(\"value out of range\", \"value\", arguments[0]);\n }\n const result = new Uint8Array(length);\n result.set(value, length - value.length);\n return addSlice(result);\n}\nexport function isHexString(value, length) {\n if (typeof (value) !== \"string\" || !value.match(/^0x[0-9A-Fa-f]*$/)) {\n return false;\n }\n if (length && value.length !== 2 + 2 * length) {\n return false;\n }\n return true;\n}\nconst HexCharacters = \"0123456789abcdef\";\nexport function hexlify(value, options) {\n if (!options) {\n options = {};\n }\n if (typeof (value) === \"number\") {\n logger.checkSafeUint53(value, \"invalid hexlify value\");\n let hex = \"\";\n while (value) {\n hex = HexCharacters[value & 0xf] + hex;\n value = Math.floor(value / 16);\n }\n if (hex.length) {\n if (hex.length % 2) {\n hex = \"0\" + hex;\n }\n return \"0x\" + hex;\n }\n return \"0x00\";\n }\n if (typeof (value) === \"bigint\") {\n value = value.toString(16);\n if (value.length % 2) {\n return (\"0x0\" + value);\n }\n return \"0x\" + value;\n }\n if (options.allowMissingPrefix && typeof (value) === \"string\" && value.substring(0, 2) !== \"0x\") {\n value = \"0x\" + value;\n }\n if (isHexable(value)) {\n return value.toHexString();\n }\n if (isHexString(value)) {\n if (value.length % 2) {\n if (options.hexPad === \"left\") {\n value = \"0x0\" + value.substring(2);\n }\n else if (options.hexPad === \"right\") {\n value += \"0\";\n }\n else {\n logger.throwArgumentError(\"hex data is odd-length\", \"value\", value);\n }\n }\n return value.toLowerCase();\n }\n if (isBytes(value)) {\n let result = \"0x\";\n for (let i = 0; i < value.length; i++) {\n let v = value[i];\n result += HexCharacters[(v & 0xf0) >> 4] + HexCharacters[v & 0x0f];\n }\n return result;\n }\n return logger.throwArgumentError(\"invalid hexlify value\", \"value\", value);\n}\n/*\nfunction unoddify(value: BytesLike | Hexable | number): BytesLike | Hexable | number {\n if (typeof(value) === \"string\" && value.length % 2 && value.substring(0, 2) === \"0x\") {\n return \"0x0\" + value.substring(2);\n }\n return value;\n}\n*/\nexport function hexDataLength(data) {\n if (typeof (data) !== \"string\") {\n data = hexlify(data);\n }\n else if (!isHexString(data) || (data.length % 2)) {\n return null;\n }\n return (data.length - 2) / 2;\n}\nexport function hexDataSlice(data, offset, endOffset) {\n if (typeof (data) !== \"string\") {\n data = hexlify(data);\n }\n else if (!isHexString(data) || (data.length % 2)) {\n logger.throwArgumentError(\"invalid hexData\", \"value\", data);\n }\n offset = 2 + 2 * offset;\n if (endOffset != null) {\n return \"0x\" + data.substring(offset, 2 + 2 * endOffset);\n }\n return \"0x\" + data.substring(offset);\n}\nexport function hexConcat(items) {\n let result = \"0x\";\n items.forEach((item) => {\n result += hexlify(item).substring(2);\n });\n return result;\n}\nexport function hexValue(value) {\n const trimmed = hexStripZeros(hexlify(value, { hexPad: \"left\" }));\n if (trimmed === \"0x\") {\n return \"0x0\";\n }\n return trimmed;\n}\nexport function hexStripZeros(value) {\n if (typeof (value) !== \"string\") {\n value = hexlify(value);\n }\n if (!isHexString(value)) {\n logger.throwArgumentError(\"invalid hex string\", \"value\", value);\n }\n value = value.substring(2);\n let offset = 0;\n while (offset < value.length && value[offset] === \"0\") {\n offset++;\n }\n return \"0x\" + value.substring(offset);\n}\nexport function hexZeroPad(value, length) {\n if (typeof (value) !== \"string\") {\n value = hexlify(value);\n }\n else if (!isHexString(value)) {\n logger.throwArgumentError(\"invalid hex string\", \"value\", value);\n }\n if (value.length > 2 * length + 2) {\n logger.throwArgumentError(\"value out of range\", \"value\", arguments[1]);\n }\n while (value.length < 2 * length + 2) {\n value = \"0x0\" + value.substring(2);\n }\n return value;\n}\nexport function splitSignature(signature) {\n const result = {\n r: \"0x\",\n s: \"0x\",\n _vs: \"0x\",\n recoveryParam: 0,\n v: 0,\n yParityAndS: \"0x\",\n compact: \"0x\"\n };\n if (isBytesLike(signature)) {\n let bytes = arrayify(signature);\n // Get the r, s and v\n if (bytes.length === 64) {\n // EIP-2098; pull the v from the top bit of s and clear it\n result.v = 27 + (bytes[32] >> 7);\n bytes[32] &= 0x7f;\n result.r = hexlify(bytes.slice(0, 32));\n result.s = hexlify(bytes.slice(32, 64));\n }\n else if (bytes.length === 65) {\n result.r = hexlify(bytes.slice(0, 32));\n result.s = hexlify(bytes.slice(32, 64));\n result.v = bytes[64];\n }\n else {\n logger.throwArgumentError(\"invalid signature string\", \"signature\", signature);\n }\n // Allow a recid to be used as the v\n if (result.v < 27) {\n if (result.v === 0 || result.v === 1) {\n result.v += 27;\n }\n else {\n logger.throwArgumentError(\"signature invalid v byte\", \"signature\", signature);\n }\n }\n // Compute recoveryParam from v\n result.recoveryParam = 1 - (result.v % 2);\n // Compute _vs from recoveryParam and s\n if (result.recoveryParam) {\n bytes[32] |= 0x80;\n }\n result._vs = hexlify(bytes.slice(32, 64));\n }\n else {\n result.r = signature.r;\n result.s = signature.s;\n result.v = signature.v;\n result.recoveryParam = signature.recoveryParam;\n result._vs = signature._vs;\n // If the _vs is available, use it to populate missing s, v and recoveryParam\n // and verify non-missing s, v and recoveryParam\n if (result._vs != null) {\n const vs = zeroPad(arrayify(result._vs), 32);\n result._vs = hexlify(vs);\n // Set or check the recid\n const recoveryParam = ((vs[0] >= 128) ? 1 : 0);\n if (result.recoveryParam == null) {\n result.recoveryParam = recoveryParam;\n }\n else if (result.recoveryParam !== recoveryParam) {\n logger.throwArgumentError(\"signature recoveryParam mismatch _vs\", \"signature\", signature);\n }\n // Set or check the s\n vs[0] &= 0x7f;\n const s = hexlify(vs);\n if (result.s == null) {\n result.s = s;\n }\n else if (result.s !== s) {\n logger.throwArgumentError(\"signature v mismatch _vs\", \"signature\", signature);\n }\n }\n // Use recid and v to populate each other\n if (result.recoveryParam == null) {\n if (result.v == null) {\n logger.throwArgumentError(\"signature missing v and recoveryParam\", \"signature\", signature);\n }\n else if (result.v === 0 || result.v === 1) {\n result.recoveryParam = result.v;\n }\n else {\n result.recoveryParam = 1 - (result.v % 2);\n }\n }\n else {\n if (result.v == null) {\n result.v = 27 + result.recoveryParam;\n }\n else {\n const recId = (result.v === 0 || result.v === 1) ? result.v : (1 - (result.v % 2));\n if (result.recoveryParam !== recId) {\n logger.throwArgumentError(\"signature recoveryParam mismatch v\", \"signature\", signature);\n }\n }\n }\n if (result.r == null || !isHexString(result.r)) {\n logger.throwArgumentError(\"signature missing or invalid r\", \"signature\", signature);\n }\n else {\n result.r = hexZeroPad(result.r, 32);\n }\n if (result.s == null || !isHexString(result.s)) {\n logger.throwArgumentError(\"signature missing or invalid s\", \"signature\", signature);\n }\n else {\n result.s = hexZeroPad(result.s, 32);\n }\n const vs = arrayify(result.s);\n if (vs[0] >= 128) {\n logger.throwArgumentError(\"signature s out of range\", \"signature\", signature);\n }\n if (result.recoveryParam) {\n vs[0] |= 0x80;\n }\n const _vs = hexlify(vs);\n if (result._vs) {\n if (!isHexString(result._vs)) {\n logger.throwArgumentError(\"signature invalid _vs\", \"signature\", signature);\n }\n result._vs = hexZeroPad(result._vs, 32);\n }\n // Set or check the _vs\n if (result._vs == null) {\n result._vs = _vs;\n }\n else if (result._vs !== _vs) {\n logger.throwArgumentError(\"signature _vs mismatch v and s\", \"signature\", signature);\n }\n }\n result.yParityAndS = result._vs;\n result.compact = result.r + result.yParityAndS.substring(2);\n return result;\n}\nexport function joinSignature(signature) {\n signature = splitSignature(signature);\n return hexlify(concat([\n signature.r,\n signature.s,\n (signature.recoveryParam ? \"0x1c\" : \"0x1b\")\n ]));\n}\n//# sourceMappingURL=index.js.map","export const version = \"rlp/5.7.0\";\n//# sourceMappingURL=_version.js.map","\"use strict\";\n//See: https://github.com/ethereum/wiki/wiki/RLP\nimport { arrayify, hexlify, isBytesLike } from \"@ethersproject/bytes\";\nimport { Logger } from \"@ethersproject/logger\";\nimport { version } from \"./_version\";\nconst logger = new Logger(version);\nfunction arrayifyInteger(value) {\n const result = [];\n while (value) {\n result.unshift(value & 0xff);\n value >>= 8;\n }\n return result;\n}\nfunction unarrayifyInteger(data, offset, length) {\n let result = 0;\n for (let i = 0; i < length; i++) {\n result = (result * 256) + data[offset + i];\n }\n return result;\n}\nfunction _encode(object) {\n if (Array.isArray(object)) {\n let payload = [];\n object.forEach(function (child) {\n payload = payload.concat(_encode(child));\n });\n if (payload.length <= 55) {\n payload.unshift(0xc0 + payload.length);\n return payload;\n }\n const length = arrayifyInteger(payload.length);\n length.unshift(0xf7 + length.length);\n return length.concat(payload);\n }\n if (!isBytesLike(object)) {\n logger.throwArgumentError(\"RLP object must be BytesLike\", \"object\", object);\n }\n const data = Array.prototype.slice.call(arrayify(object));\n if (data.length === 1 && data[0] <= 0x7f) {\n return data;\n }\n else if (data.length <= 55) {\n data.unshift(0x80 + data.length);\n return data;\n }\n const length = arrayifyInteger(data.length);\n length.unshift(0xb7 + length.length);\n return length.concat(data);\n}\nexport function encode(object) {\n return hexlify(_encode(object));\n}\nfunction _decodeChildren(data, offset, childOffset, length) {\n const result = [];\n while (childOffset < offset + 1 + length) {\n const decoded = _decode(data, childOffset);\n result.push(decoded.result);\n childOffset += decoded.consumed;\n if (childOffset > offset + 1 + length) {\n logger.throwError(\"child data too short\", Logger.errors.BUFFER_OVERRUN, {});\n }\n }\n return { consumed: (1 + length), result: result };\n}\n// returns { consumed: number, result: Object }\nfunction _decode(data, offset) {\n if (data.length === 0) {\n logger.throwError(\"data too short\", Logger.errors.BUFFER_OVERRUN, {});\n }\n // Array with extra length prefix\n if (data[offset] >= 0xf8) {\n const lengthLength = data[offset] - 0xf7;\n if (offset + 1 + lengthLength > data.length) {\n logger.throwError(\"data short segment too short\", Logger.errors.BUFFER_OVERRUN, {});\n }\n const length = unarrayifyInteger(data, offset + 1, lengthLength);\n if (offset + 1 + lengthLength + length > data.length) {\n logger.throwError(\"data long segment too short\", Logger.errors.BUFFER_OVERRUN, {});\n }\n return _decodeChildren(data, offset, offset + 1 + lengthLength, lengthLength + length);\n }\n else if (data[offset] >= 0xc0) {\n const length = data[offset] - 0xc0;\n if (offset + 1 + length > data.length) {\n logger.throwError(\"data array too short\", Logger.errors.BUFFER_OVERRUN, {});\n }\n return _decodeChildren(data, offset, offset + 1, length);\n }\n else if (data[offset] >= 0xb8) {\n const lengthLength = data[offset] - 0xb7;\n if (offset + 1 + lengthLength > data.length) {\n logger.throwError(\"data array too short\", Logger.errors.BUFFER_OVERRUN, {});\n }\n const length = unarrayifyInteger(data, offset + 1, lengthLength);\n if (offset + 1 + lengthLength + length > data.length) {\n logger.throwError(\"data array too short\", Logger.errors.BUFFER_OVERRUN, {});\n }\n const result = hexlify(data.slice(offset + 1 + lengthLength, offset + 1 + lengthLength + length));\n return { consumed: (1 + lengthLength + length), result: result };\n }\n else if (data[offset] >= 0x80) {\n const length = data[offset] - 0x80;\n if (offset + 1 + length > data.length) {\n logger.throwError(\"data too short\", Logger.errors.BUFFER_OVERRUN, {});\n }\n const result = hexlify(data.slice(offset + 1, offset + 1 + length));\n return { consumed: (1 + length), result: result };\n }\n return { consumed: 1, result: hexlify(data[offset]) };\n}\nexport function decode(data) {\n const bytes = arrayify(data);\n const decoded = _decode(bytes, 0);\n if (decoded.consumed !== bytes.length) {\n logger.throwArgumentError(\"invalid rlp data\", \"data\", data);\n }\n return decoded.result;\n}\n//# sourceMappingURL=index.js.map","import * as RLP from \"@ethersproject/rlp\";\nimport { Logger } from \"@waku/utils\";\nimport { bytesToHex, bytesToUtf8, hexToBytes } from \"@waku/utils/bytes\";\nimport { fromString } from \"uint8arrays/from-string\";\nimport { ENR } from \"./enr.js\";\nconst log = new Logger(\"enr:decoder\");\nexport class EnrDecoder {\n static fromString(encoded) {\n if (!encoded.startsWith(ENR.RECORD_PREFIX)) {\n throw new Error(`\"string encoded ENR must start with '${ENR.RECORD_PREFIX}'`);\n }\n return EnrDecoder.fromRLP(fromString(encoded.slice(4), \"base64url\"));\n }\n static fromRLP(encoded) {\n const decoded = RLP.decode(encoded).map(hexToBytes);\n return fromValues(decoded);\n }\n}\nasync function fromValues(values) {\n const { signature, seq, kvs } = checkValues(values);\n const obj = {};\n for (let i = 0; i < kvs.length; i += 2) {\n try {\n obj[bytesToUtf8(kvs[i])] = kvs[i + 1];\n }\n catch (e) {\n log.error(\"Failed to decode ENR key to UTF-8, skipping it\", kvs[i], e);\n }\n }\n const _seq = decodeSeq(seq);\n const enr = await ENR.create(obj, _seq, signature);\n checkSignature(seq, kvs, enr, signature);\n return enr;\n}\nfunction decodeSeq(seq) {\n // If seq is an empty array, translate as value 0\n if (!seq.length)\n return BigInt(0);\n return BigInt(\"0x\" + bytesToHex(seq));\n}\nfunction checkValues(values) {\n if (!Array.isArray(values)) {\n throw new Error(\"Decoded ENR must be an array\");\n }\n if (values.length % 2 !== 0) {\n throw new Error(\"Decoded ENR must have an even number of elements\");\n }\n const [signature, seq, ...kvs] = values;\n if (!signature || Array.isArray(signature)) {\n throw new Error(\"Decoded ENR invalid signature: must be a byte array\");\n }\n if (!seq || Array.isArray(seq)) {\n throw new Error(\"Decoded ENR invalid sequence number: must be a byte array\");\n }\n return { signature, seq, kvs };\n}\nfunction checkSignature(seq, kvs, enr, signature) {\n const rlpEncodedBytes = hexToBytes(RLP.encode([seq, ...kvs]));\n if (!enr.verify(rlpEncodedBytes, signature)) {\n throw new Error(\"Unable to verify ENR signature\");\n }\n}\n//# sourceMappingURL=decoder.js.map","const v4Regex = /^(\\d{1,3}\\.){3,3}\\d{1,3}$/\nconst v4Size = 4\nconst v6Regex = /^(::)?(((\\d{1,3}\\.){3}(\\d{1,3}){1})?([0-9a-f]){0,4}:{0,2}){1,8}(::)?$/i\nconst v6Size = 16\n\nexport const v4 = {\n name: 'v4',\n size: v4Size,\n isFormat: ip => v4Regex.test(ip),\n encode (ip, buff, offset) {\n offset = ~~offset\n buff = buff || new Uint8Array(offset + v4Size)\n const max = ip.length\n let n = 0\n for (let i = 0; i < max;) {\n const c = ip.charCodeAt(i++)\n if (c === 46) { // \".\"\n buff[offset++] = n\n n = 0\n } else {\n n = n * 10 + (c - 48)\n }\n }\n buff[offset] = n\n return buff\n },\n decode (buff, offset) {\n offset = ~~offset\n return `${buff[offset++]}.${buff[offset++]}.${buff[offset++]}.${buff[offset]}`\n }\n}\n\nexport const v6 = {\n name: 'v6',\n size: v6Size,\n isFormat: ip => ip.length > 0 && v6Regex.test(ip),\n encode (ip, buff, offset) {\n offset = ~~offset\n let end = offset + v6Size\n let fill = -1\n let hexN = 0\n let decN = 0\n let prevColon = true\n let useDec = false\n buff = buff || new Uint8Array(offset + v6Size)\n // Note: This algorithm needs to check if the offset\n // could exceed the buffer boundaries as it supports\n // non-standard compliant encodings that may go beyond\n // the boundary limits. if (offset < end) checks should\n // not be necessary...\n for (let i = 0; i < ip.length; i++) {\n let c = ip.charCodeAt(i)\n if (c === 58) { // :\n if (prevColon) {\n if (fill !== -1) {\n // Not Standard! (standard doesn't allow multiple ::)\n // We need to treat\n if (offset < end) buff[offset] = 0\n if (offset < end - 1) buff[offset + 1] = 0\n offset += 2\n } else if (offset < end) {\n // :: in the middle\n fill = offset\n }\n } else {\n // : ends the previous number\n if (useDec === true) {\n // Non-standard! (ipv4 should be at end only)\n // A ipv4 address should not be found anywhere else but at\n // the end. This codec also support putting characters\n // after the ipv4 address..\n if (offset < end) buff[offset] = decN\n offset++\n } else {\n if (offset < end) buff[offset] = hexN >> 8\n if (offset < end - 1) buff[offset + 1] = hexN & 0xff\n offset += 2\n }\n hexN = 0\n decN = 0\n }\n prevColon = true\n useDec = false\n } else if (c === 46) { // . indicates IPV4 notation\n if (offset < end) buff[offset] = decN\n offset++\n decN = 0\n hexN = 0\n prevColon = false\n useDec = true\n } else {\n prevColon = false\n if (c >= 97) {\n c -= 87 // a-f ... 97~102 -87 => 10~15\n } else if (c >= 65) {\n c -= 55 // A-F ... 65~70 -55 => 10~15\n } else {\n c -= 48 // 0-9 ... starting from charCode 48\n decN = decN * 10 + c\n }\n // We don't know yet if its a dec or hex number\n hexN = (hexN << 4) + c\n }\n }\n if (prevColon === false) {\n // Commiting last number\n if (useDec === true) {\n if (offset < end) buff[offset] = decN\n offset++\n } else {\n if (offset < end) buff[offset] = hexN >> 8\n if (offset < end - 1) buff[offset + 1] = hexN & 0xff\n offset += 2\n }\n } else if (fill === 0) {\n // Not Standard! (standard doesn't allow multiple ::)\n // This means that a : was found at the start AND end which means the\n // end needs to be treated as 0 entry...\n if (offset < end) buff[offset] = 0\n if (offset < end - 1) buff[offset + 1] = 0\n offset += 2\n } else if (fill !== -1) {\n // Non-standard! (standard doens't allow multiple ::)\n // Here we find that there has been a :: somewhere in the middle\n // and the end. To treat the end with priority we need to move all\n // written data two bytes to the right.\n offset += 2\n for (let i = Math.min(offset - 1, end - 1); i >= fill + 2; i--) {\n buff[i] = buff[i - 2]\n }\n buff[fill] = 0\n buff[fill + 1] = 0\n fill = offset\n }\n if (fill !== offset && fill !== -1) {\n // Move the written numbers to the end while filling the everything\n // \"fill\" to the bytes with zeros.\n if (offset > end - 2) {\n // Non Standard support, when the cursor exceeds bounds.\n offset = end - 2\n }\n while (end > fill) {\n buff[--end] = offset < end && offset > fill ? buff[--offset] : 0\n }\n } else {\n // Fill the rest with zeros\n while (offset < end) {\n buff[offset++] = 0\n }\n }\n return buff\n },\n decode (buff, offset) {\n offset = ~~offset\n let result = ''\n for (let i = 0; i < v6Size; i += 2) {\n if (i !== 0) {\n result += ':'\n }\n result += (buff[offset + i] << 8 | buff[offset + i + 1]).toString(16)\n }\n return result\n .replace(/(^|:)0(:0)*:0(:|$)/, '$1::$3')\n .replace(/:{3,4}/, '::')\n }\n}\n\nexport const name = 'ip'\nexport function sizeOf (ip) {\n if (v4.isFormat(ip)) return v4.size\n if (v6.isFormat(ip)) return v6.size\n throw Error(`Invalid ip address: ${ip}`)\n}\n\nexport function familyOf (string) {\n return sizeOf(string) === v4.size ? 1 : 2\n}\n\nexport function encode (ip, buff, offset) {\n offset = ~~offset\n const size = sizeOf(ip)\n if (typeof buff === 'function') {\n buff = buff(offset + size)\n }\n if (size === v4.size) {\n return v4.encode(ip, buff, offset)\n }\n return v6.encode(ip, buff, offset)\n}\n\nexport function decode (buff, offset, length) {\n offset = ~~offset\n length = length || (buff.length - offset)\n if (length === v4.size) {\n return v4.decode(buff, offset, length)\n }\n if (length === v6.size) {\n return v6.decode(buff, offset, length)\n }\n throw Error(`Invalid buffer size needs to be ${v4.size} for v4 or ${v6.size} for v6.`)\n}\n","export function toString (type) {\n switch (type) {\n case 1: return 'A'\n case 10: return 'NULL'\n case 28: return 'AAAA'\n case 18: return 'AFSDB'\n case 42: return 'APL'\n case 257: return 'CAA'\n case 60: return 'CDNSKEY'\n case 59: return 'CDS'\n case 37: return 'CERT'\n case 5: return 'CNAME'\n case 49: return 'DHCID'\n case 32769: return 'DLV'\n case 39: return 'DNAME'\n case 48: return 'DNSKEY'\n case 43: return 'DS'\n case 55: return 'HIP'\n case 13: return 'HINFO'\n case 45: return 'IPSECKEY'\n case 25: return 'KEY'\n case 36: return 'KX'\n case 29: return 'LOC'\n case 15: return 'MX'\n case 35: return 'NAPTR'\n case 2: return 'NS'\n case 47: return 'NSEC'\n case 50: return 'NSEC3'\n case 51: return 'NSEC3PARAM'\n case 12: return 'PTR'\n case 46: return 'RRSIG'\n case 17: return 'RP'\n case 24: return 'SIG'\n case 6: return 'SOA'\n case 99: return 'SPF'\n case 33: return 'SRV'\n case 44: return 'SSHFP'\n case 32768: return 'TA'\n case 249: return 'TKEY'\n case 52: return 'TLSA'\n case 250: return 'TSIG'\n case 16: return 'TXT'\n case 252: return 'AXFR'\n case 251: return 'IXFR'\n case 41: return 'OPT'\n case 255: return 'ANY'\n }\n return 'UNKNOWN_' + type\n}\n\nexport function toType (name) {\n switch (name.toUpperCase()) {\n case 'A': return 1\n case 'NULL': return 10\n case 'AAAA': return 28\n case 'AFSDB': return 18\n case 'APL': return 42\n case 'CAA': return 257\n case 'CDNSKEY': return 60\n case 'CDS': return 59\n case 'CERT': return 37\n case 'CNAME': return 5\n case 'DHCID': return 49\n case 'DLV': return 32769\n case 'DNAME': return 39\n case 'DNSKEY': return 48\n case 'DS': return 43\n case 'HIP': return 55\n case 'HINFO': return 13\n case 'IPSECKEY': return 45\n case 'KEY': return 25\n case 'KX': return 36\n case 'LOC': return 29\n case 'MX': return 15\n case 'NAPTR': return 35\n case 'NS': return 2\n case 'NSEC': return 47\n case 'NSEC3': return 50\n case 'NSEC3PARAM': return 51\n case 'PTR': return 12\n case 'RRSIG': return 46\n case 'RP': return 17\n case 'SIG': return 24\n case 'SOA': return 6\n case 'SPF': return 99\n case 'SRV': return 33\n case 'SSHFP': return 44\n case 'TA': return 32768\n case 'TKEY': return 249\n case 'TLSA': return 52\n case 'TSIG': return 250\n case 'TXT': return 16\n case 'AXFR': return 252\n case 'IXFR': return 251\n case 'OPT': return 41\n case 'ANY': return 255\n case '*': return 255\n }\n if (name.toUpperCase().startsWith('UNKNOWN_')) return parseInt(name.slice(8))\n return 0\n}\n","/*\n * Traditional DNS header RCODEs (4-bits) defined by IANA in\n * https://www.iana.org/assignments/dns-parameters/dns-parameters.xhtml\n */\n\nexport function toString (rcode) {\n switch (rcode) {\n case 0: return 'NOERROR'\n case 1: return 'FORMERR'\n case 2: return 'SERVFAIL'\n case 3: return 'NXDOMAIN'\n case 4: return 'NOTIMP'\n case 5: return 'REFUSED'\n case 6: return 'YXDOMAIN'\n case 7: return 'YXRRSET'\n case 8: return 'NXRRSET'\n case 9: return 'NOTAUTH'\n case 10: return 'NOTZONE'\n case 11: return 'RCODE_11'\n case 12: return 'RCODE_12'\n case 13: return 'RCODE_13'\n case 14: return 'RCODE_14'\n case 15: return 'RCODE_15'\n }\n return 'RCODE_' + rcode\n}\n\nexport function toRcode (code) {\n switch (code.toUpperCase()) {\n case 'NOERROR': return 0\n case 'FORMERR': return 1\n case 'SERVFAIL': return 2\n case 'NXDOMAIN': return 3\n case 'NOTIMP': return 4\n case 'REFUSED': return 5\n case 'YXDOMAIN': return 6\n case 'YXRRSET': return 7\n case 'NXRRSET': return 8\n case 'NOTAUTH': return 9\n case 'NOTZONE': return 10\n case 'RCODE_11': return 11\n case 'RCODE_12': return 12\n case 'RCODE_13': return 13\n case 'RCODE_14': return 14\n case 'RCODE_15': return 15\n }\n return 0\n}\n","/*\n * Traditional DNS header OPCODEs (4-bits) defined by IANA in\n * https://www.iana.org/assignments/dns-parameters/dns-parameters.xhtml#dns-parameters-5\n */\n\nexport function toString (opcode) {\n switch (opcode) {\n case 0: return 'QUERY'\n case 1: return 'IQUERY'\n case 2: return 'STATUS'\n case 3: return 'OPCODE_3'\n case 4: return 'NOTIFY'\n case 5: return 'UPDATE'\n case 6: return 'OPCODE_6'\n case 7: return 'OPCODE_7'\n case 8: return 'OPCODE_8'\n case 9: return 'OPCODE_9'\n case 10: return 'OPCODE_10'\n case 11: return 'OPCODE_11'\n case 12: return 'OPCODE_12'\n case 13: return 'OPCODE_13'\n case 14: return 'OPCODE_14'\n case 15: return 'OPCODE_15'\n }\n return 'OPCODE_' + opcode\n}\n\nexport function toOpcode (code) {\n switch (code.toUpperCase()) {\n case 'QUERY': return 0\n case 'IQUERY': return 1\n case 'STATUS': return 2\n case 'OPCODE_3': return 3\n case 'NOTIFY': return 4\n case 'UPDATE': return 5\n case 'OPCODE_6': return 6\n case 'OPCODE_7': return 7\n case 'OPCODE_8': return 8\n case 'OPCODE_9': return 9\n case 'OPCODE_10': return 10\n case 'OPCODE_11': return 11\n case 'OPCODE_12': return 12\n case 'OPCODE_13': return 13\n case 'OPCODE_14': return 14\n case 'OPCODE_15': return 15\n }\n return 0\n}\n","export function toString (klass) {\n switch (klass) {\n case 1: return 'IN'\n case 2: return 'CS'\n case 3: return 'CH'\n case 4: return 'HS'\n case 255: return 'ANY'\n }\n return 'UNKNOWN_' + klass\n}\n\nexport function toClass (name) {\n switch (name.toUpperCase()) {\n case 'IN': return 1\n case 'CS': return 2\n case 'CH': return 3\n case 'HS': return 4\n case 'ANY': return 255\n }\n return 0\n}\n","export function toString (type) {\n switch (type) {\n // list at\n // https://www.iana.org/assignments/dns-parameters/dns-parameters.xhtml#dns-parameters-11\n case 1: return 'LLQ'\n case 2: return 'UL'\n case 3: return 'NSID'\n case 5: return 'DAU'\n case 6: return 'DHU'\n case 7: return 'N3U'\n case 8: return 'CLIENT_SUBNET'\n case 9: return 'EXPIRE'\n case 10: return 'COOKIE'\n case 11: return 'TCP_KEEPALIVE'\n case 12: return 'PADDING'\n case 13: return 'CHAIN'\n case 14: return 'KEY_TAG'\n case 26946: return 'DEVICEID'\n }\n if (type < 0) {\n return null\n }\n return `OPTION_${type}`\n}\n\nexport function toCode (name) {\n if (typeof name === 'number') {\n return name\n }\n if (!name) {\n return -1\n }\n switch (name.toUpperCase()) {\n case 'OPTION_0': return 0\n case 'LLQ': return 1\n case 'UL': return 2\n case 'NSID': return 3\n case 'OPTION_4': return 4\n case 'DAU': return 5\n case 'DHU': return 6\n case 'N3U': return 7\n case 'CLIENT_SUBNET': return 8\n case 'EXPIRE': return 9\n case 'COOKIE': return 10\n case 'TCP_KEEPALIVE': return 11\n case 'PADDING': return 12\n case 'CHAIN': return 13\n case 'KEY_TAG': return 14\n case 'DEVICEID': return 26946\n case 'OPTION_65535': return 65535\n }\n const m = name.match(/_(\\d+)$/)\n if (m) {\n return parseInt(m[1], 10)\n }\n return -1\n}\n","const SURROGATE_A = 0b1101100000000000\nconst SURROGATE_B = 0b1101110000000000\n\nexport const name = 'utf8'\n\nexport function encodingLength (str) {\n let len = 0\n const strLen = str.length\n for (let i = 0; i < strLen; i += 1) {\n const code = str.charCodeAt(i)\n if (code <= 0x7F) {\n len += 1\n } else if (code <= 0x07FF) {\n len += 2\n } else if ((code & 0xF800) !== SURROGATE_A) {\n len += 3\n } else {\n const next = i + 1\n if (next === strLen || code >= SURROGATE_B) {\n len += 3\n } else {\n const nextCode = str.charCodeAt(next)\n if ((nextCode & 0xFC00) !== SURROGATE_B) {\n len += 3\n } else {\n i = next\n len += 4\n }\n }\n }\n }\n return len\n}\n\nexport function encode (str, buf, offset) {\n const strLen = str.length\n if (offset === undefined || offset === null) {\n offset = 0\n }\n if (buf === undefined) {\n buf = new Uint8Array(encodingLength(str) + offset)\n }\n let off = offset\n for (let i = 0; i < strLen; i += 1) {\n let code = str.charCodeAt(i)\n if (code <= 0x7F) {\n buf[off++] = code\n } else if (code <= 0x07FF) {\n buf[off++] = 0b11000000 | ((code & 0b11111000000) >> 6)\n buf[off++] = 0b10000000 | (code & 0b00000111111)\n } else if ((code & 0xF800) !== SURROGATE_A) {\n buf[off++] = 0b11100000 | ((code & 0b1111000000000000) >> 12)\n buf[off++] = 0b10000000 | ((code & 0b0000111111000000) >> 6)\n buf[off++] = 0b10000000 | (code & 0b0000000000111111)\n } else {\n const next = i + 1\n if (next === strLen || code >= SURROGATE_B) {\n // Incorrectly started surrogate pair\n buf[off++] = 0xef\n buf[off++] = 0xbf\n buf[off++] = 0xbd\n } else {\n const nextCode = str.charCodeAt(next)\n if ((nextCode & 0xFC00) !== SURROGATE_B) {\n // Incorrect surrogate pair\n buf[off++] = 0xef\n buf[off++] = 0xbf\n buf[off++] = 0xbd\n } else {\n i = next\n code = 0b000010000000000000000 |\n ((code & 0b1111111111) << 10) |\n (nextCode & 0b1111111111)\n buf[off++] = 0b11110000 | ((code & 0b111000000000000000000) >> 18)\n buf[off++] = 0b10000000 | ((code & 0b000111111000000000000) >> 12)\n buf[off++] = 0b10000000 | ((code & 0b000000000111111000000) >> 6)\n buf[off++] = 0b10000000 | (code & 0b000000000000000111111)\n }\n }\n }\n }\n encode.bytes = off - offset\n return buf\n}\nencode.bytes = 0\n\nexport function decode (buf, start, end) {\n let result = ''\n if (start === undefined || start === null) {\n start = 0\n }\n if (end === undefined || end === null) {\n end = buf.length\n }\n for (let offset = start; offset < end;) {\n const code = buf[offset++]\n let num\n if (code <= 128) {\n num = code\n } else if (code > 191 && code < 224) {\n num = ((code & 0b11111) << 6) | (buf[offset++] & 0b111111)\n } else if (code > 239 && code < 365) {\n num = (\n ((code & 0b111) << 18) |\n ((buf[offset++] & 0b111111) << 12) |\n ((buf[offset++] & 0b111111) << 6) |\n (buf[offset++] & 0b111111)\n ) - 0x10000\n const numA = SURROGATE_A | ((num >> 10) & 0b1111111111)\n result += String.fromCharCode(numA)\n num = SURROGATE_B | (num & 0b1111111111)\n } else {\n num = ((code & 0b1111) << 12) |\n ((buf[offset++] & 0b111111) << 6) |\n (buf[offset++] & 0b111111)\n }\n result += String.fromCharCode(num)\n }\n decode.bytes = end - start\n return result\n}\ndecode.bytes = 0\n","import * as utf8 from 'utf8-codec'\n\nexport const isU8Arr = input => input instanceof Uint8Array\n\nexport function bytelength (input) {\n return typeof input === 'string' ? utf8.encodingLength(input) : input.byteLength\n}\n\nexport function from (input) {\n if (input instanceof Uint8Array) {\n return input\n }\n if (Array.isArray(input)) {\n return new Uint8Array(input)\n }\n return utf8.encode(input)\n}\n\nexport function write (arr, str, start) {\n if (typeof str !== 'string') {\n throw new Error('unknown input type')\n }\n utf8.encode(str, arr, start)\n return utf8.encode.bytes\n}\n\nexport function toHex (buf, start, end) {\n let result = ''\n for (let offset = start; offset < end;) {\n const num = buf[offset++]\n const str = num.toString(16)\n result += (str.length === 1) ? '0' + str : str\n }\n return result\n}\n\nconst P_24 = Math.pow(2, 24)\nconst P_16 = Math.pow(2, 16)\nconst P_8 = Math.pow(2, 8)\nexport const readUInt32BE = (buf, offset) => buf[offset] * P_24 +\n buf[offset + 1] * P_16 +\n buf[offset + 2] * P_8 +\n buf[offset + 3]\n\nexport const readUInt16BE = (buf, offset) => (buf[offset] << 8) | buf[offset + 1]\nexport const writeUInt32BE = (buf, value, offset) => {\n value = +value\n buf[offset + 3] = value\n value = value >>> 8\n buf[offset + 2] = value\n value = value >>> 8\n buf[offset + 1] = value\n value = value >>> 8\n buf[offset] = value\n return offset + 4\n}\nexport const writeUInt16BE = (buf, value, offset) => {\n buf[offset] = value >> 8\n buf[offset + 1] = value & 0xFF\n return offset + 2\n}\n\nexport function copy (source, target, targetStart, sourceStart, sourceEnd) {\n if (targetStart < 0) {\n sourceStart -= targetStart\n targetStart = 0\n }\n\n if (sourceStart < 0) {\n sourceStart = 0\n }\n\n if (sourceEnd < 0) {\n return new Uint8Array(0)\n }\n\n if (targetStart >= target.length || sourceStart >= sourceEnd) {\n return 0\n }\n\n return _copyActual(source, target, targetStart, sourceStart, sourceEnd)\n}\n\nfunction _copyActual (source, target, targetStart, sourceStart, sourceEnd) {\n if (sourceEnd - sourceStart > target.length - targetStart) {\n sourceEnd = sourceStart + target.length - targetStart\n }\n\n let nb = sourceEnd - sourceStart\n const sourceLen = source.length - sourceStart\n if (nb > sourceLen) {\n nb = sourceLen\n }\n\n if (sourceStart !== 0 || sourceEnd < source.length) {\n source = new Uint8Array(source.buffer, source.byteOffset + sourceStart, nb)\n }\n\n target.set(source, targetStart)\n\n return nb\n}\n","import * as ip from '@leichtgewicht/ip-codec'\nimport * as types from './types.mjs'\nimport * as rcodes from './rcodes.mjs'\nimport * as opcodes from './opcodes.mjs'\nimport * as classes from './classes.mjs'\nimport * as optioncodes from './optioncodes.mjs'\nimport * as b from './buffer_utils.mjs'\nimport { decode as toUtf8 } from 'utf8-codec'\n\nconst QUERY_FLAG = 0\nconst RESPONSE_FLAG = 1 << 15\nconst FLUSH_MASK = 1 << 15\nconst NOT_FLUSH_MASK = ~FLUSH_MASK\nconst QU_MASK = 1 << 15\nconst NOT_QU_MASK = ~QU_MASK\n\nfunction codec ({ bytes = 0, encode, decode, encodingLength }) {\n encode.bytes = bytes\n decode.bytes = bytes\n return {\n encode,\n decode,\n encodingLength: encodingLength || (() => bytes)\n }\n}\n\nexport const name = codec({\n encode (str, buf, offset) {\n if (!buf) buf = new Uint8Array(name.encodingLength(str))\n if (!offset) offset = 0\n const oldOffset = offset\n\n // strip leading and trailing .\n const n = str.replace(/^\\.|\\.$/gm, '')\n if (n.length) {\n const list = n.split('.')\n\n for (let i = 0; i < list.length; i++) {\n const len = b.write(buf, list[i], offset + 1)\n buf[offset] = len\n offset += len + 1\n }\n }\n\n buf[offset++] = 0\n\n name.encode.bytes = offset - oldOffset\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n\n const list = []\n let oldOffset = offset\n let totalLength = 0\n let consumedBytes = 0\n let jumped = false\n\n while (true) {\n if (offset >= buf.length) {\n throw new Error('Cannot decode name (buffer overflow)')\n }\n const len = buf[offset++]\n consumedBytes += jumped ? 0 : 1\n\n if (len === 0) {\n break\n } else if ((len & 0xc0) === 0) {\n if (offset + len > buf.length) {\n throw new Error('Cannot decode name (buffer overflow)')\n }\n totalLength += len + 1\n if (totalLength > 254) {\n throw new Error('Cannot decode name (name too long)')\n }\n list.push(toUtf8(buf, offset, offset + len))\n offset += len\n consumedBytes += jumped ? 0 : len\n } else if ((len & 0xc0) === 0xc0) {\n if (offset + 1 > buf.length) {\n throw new Error('Cannot decode name (buffer overflow)')\n }\n const jumpOffset = b.readUInt16BE(buf, offset - 1) - 0xc000\n if (jumpOffset >= oldOffset) {\n // Allow only pointers to prior data. RFC 1035, section 4.1.4 states:\n // \"[...] an entire domain name or a list of labels at the end of a domain name\n // is replaced with a pointer to a prior occurance (sic) of the same name.\"\n throw new Error('Cannot decode name (bad pointer)')\n }\n offset = jumpOffset\n oldOffset = jumpOffset\n consumedBytes += jumped ? 0 : 1\n jumped = true\n } else {\n throw new Error('Cannot decode name (bad label)')\n }\n }\n\n name.decode.bytes = consumedBytes\n return list.length === 0 ? '.' : list.join('.')\n },\n encodingLength (n) {\n if (n === '.' || n === '..') return 1\n return b.bytelength(n.replace(/^\\.|\\.$/gm, '')) + 2\n }\n})\n\nconst string = codec({\n encode (s, buf, offset) {\n if (!buf) buf = new Uint8Array(string.encodingLength(s))\n if (!offset) offset = 0\n\n const len = b.write(buf, s, offset + 1)\n buf[offset] = len\n string.encode.bytes = len + 1\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n\n const len = buf[offset]\n const s = toUtf8(buf, offset + 1, offset + 1 + len)\n string.decode.bytes = len + 1\n return s\n },\n encodingLength (s) {\n return b.bytelength(s) + 1\n }\n})\n\nconst header = codec({\n bytes: 12,\n encode (h, buf, offset) {\n if (!buf) buf = new Uint8Array(header.encodingLength(h))\n if (!offset) offset = 0\n\n const flags = (h.flags || 0) & 32767\n const type = h.type === 'response' ? RESPONSE_FLAG : QUERY_FLAG\n\n b.writeUInt16BE(buf, h.id || 0, offset)\n b.writeUInt16BE(buf, flags | type, offset + 2)\n b.writeUInt16BE(buf, h.questions.length, offset + 4)\n b.writeUInt16BE(buf, h.answers.length, offset + 6)\n b.writeUInt16BE(buf, h.authorities.length, offset + 8)\n b.writeUInt16BE(buf, h.additionals.length, offset + 10)\n\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n if (buf.length < 12) throw new Error('Header must be 12 bytes')\n const flags = b.readUInt16BE(buf, offset + 2)\n\n return {\n id: b.readUInt16BE(buf, offset),\n type: flags & RESPONSE_FLAG ? 'response' : 'query',\n flags: flags & 32767,\n flag_qr: ((flags >> 15) & 0x1) === 1,\n opcode: opcodes.toString((flags >> 11) & 0xf),\n flag_aa: ((flags >> 10) & 0x1) === 1,\n flag_tc: ((flags >> 9) & 0x1) === 1,\n flag_rd: ((flags >> 8) & 0x1) === 1,\n flag_ra: ((flags >> 7) & 0x1) === 1,\n flag_z: ((flags >> 6) & 0x1) === 1,\n flag_ad: ((flags >> 5) & 0x1) === 1,\n flag_cd: ((flags >> 4) & 0x1) === 1,\n rcode: rcodes.toString(flags & 0xf),\n questions: new Array(b.readUInt16BE(buf, offset + 4)),\n answers: new Array(b.readUInt16BE(buf, offset + 6)),\n authorities: new Array(b.readUInt16BE(buf, offset + 8)),\n additionals: new Array(b.readUInt16BE(buf, offset + 10))\n }\n },\n encodingLength () {\n return 12\n }\n})\n\nconst runknown = codec({\n encode (data, buf, offset) {\n if (!buf) buf = new Uint8Array(runknown.encodingLength(data))\n if (!offset) offset = 0\n\n const dLen = data.length\n b.writeUInt16BE(buf, dLen, offset)\n b.copy(data, buf, offset + 2, 0, dLen)\n\n runknown.encode.bytes = dLen + 2\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n\n const len = b.readUInt16BE(buf, offset)\n const data = buf.slice(offset + 2, offset + 2 + len)\n runknown.decode.bytes = len + 2\n return data\n },\n encodingLength (data) {\n return data.length + 2\n }\n})\n\nconst rns = codec({\n encode (data, buf, offset) {\n if (!buf) buf = new Uint8Array(rns.encodingLength(data))\n if (!offset) offset = 0\n\n name.encode(data, buf, offset + 2)\n b.writeUInt16BE(buf, name.encode.bytes, offset)\n rns.encode.bytes = name.encode.bytes + 2\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n\n const len = b.readUInt16BE(buf, offset)\n const dd = name.decode(buf, offset + 2)\n\n rns.decode.bytes = len + 2\n return dd\n },\n encodingLength (data) {\n return name.encodingLength(data) + 2\n }\n})\n\nconst rsoa = codec({\n encode (data, buf, offset) {\n if (!buf) buf = new Uint8Array(rsoa.encodingLength(data))\n if (!offset) offset = 0\n\n const oldOffset = offset\n offset += 2\n name.encode(data.mname, buf, offset)\n offset += name.encode.bytes\n name.encode(data.rname, buf, offset)\n offset += name.encode.bytes\n b.writeUInt32BE(buf, data.serial || 0, offset)\n offset += 4\n b.writeUInt32BE(buf, data.refresh || 0, offset)\n offset += 4\n b.writeUInt32BE(buf, data.retry || 0, offset)\n offset += 4\n b.writeUInt32BE(buf, data.expire || 0, offset)\n offset += 4\n b.writeUInt32BE(buf, data.minimum || 0, offset)\n offset += 4\n\n b.writeUInt16BE(buf, offset - oldOffset - 2, oldOffset)\n rsoa.encode.bytes = offset - oldOffset\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n\n const oldOffset = offset\n\n const data = {}\n offset += 2\n data.mname = name.decode(buf, offset)\n offset += name.decode.bytes\n data.rname = name.decode(buf, offset)\n offset += name.decode.bytes\n data.serial = b.readUInt32BE(buf, offset)\n offset += 4\n data.refresh = b.readUInt32BE(buf, offset)\n offset += 4\n data.retry = b.readUInt32BE(buf, offset)\n offset += 4\n data.expire = b.readUInt32BE(buf, offset)\n offset += 4\n data.minimum = b.readUInt32BE(buf, offset)\n offset += 4\n\n rsoa.decode.bytes = offset - oldOffset\n return data\n },\n encodingLength (data) {\n return 22 + name.encodingLength(data.mname) + name.encodingLength(data.rname)\n }\n})\n\nconst rtxt = codec({\n encode (data, buf, offset) {\n if (!Array.isArray(data)) data = [data]\n for (let i = 0; i < data.length; i++) {\n if (typeof data[i] === 'string') {\n data[i] = b.from(data[i])\n }\n if (!b.isU8Arr(data[i])) {\n throw new Error('Must be a Buffer')\n }\n }\n\n if (!buf) buf = new Uint8Array(rtxt.encodingLength(data))\n if (!offset) offset = 0\n\n const oldOffset = offset\n offset += 2\n\n data.forEach(function (d) {\n buf[offset++] = d.length\n b.copy(d, buf, offset, 0, d.length)\n offset += d.length\n })\n\n b.writeUInt16BE(buf, offset - oldOffset - 2, oldOffset)\n rtxt.encode.bytes = offset - oldOffset\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n const oldOffset = offset\n let remaining = b.readUInt16BE(buf, offset)\n offset += 2\n\n const data = []\n while (remaining > 0) {\n const len = buf[offset++]\n --remaining\n if (remaining < len) {\n throw new Error('Buffer overflow')\n }\n data.push(buf.slice(offset, offset + len))\n offset += len\n remaining -= len\n }\n\n rtxt.decode.bytes = offset - oldOffset\n return data\n },\n encodingLength (data) {\n if (!Array.isArray(data)) data = [data]\n let length = 2\n data.forEach(function (buf) {\n if (typeof buf === 'string') {\n length += b.bytelength(buf) + 1\n } else {\n length += buf.length + 1\n }\n })\n return length\n }\n})\n\nconst rnull = codec({\n encode (data, buf, offset) {\n if (!buf) buf = new Uint8Array(rnull.encodingLength(data))\n if (!offset) offset = 0\n\n if (typeof data === 'string') data = b.from(data)\n if (!data) data = new Uint8Array(0)\n\n const oldOffset = offset\n offset += 2\n\n const len = data.length\n b.copy(data, buf, offset, 0, len)\n offset += len\n\n b.writeUInt16BE(buf, offset - oldOffset - 2, oldOffset)\n rnull.encode.bytes = offset - oldOffset\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n const oldOffset = offset\n const len = b.readUInt16BE(buf, offset)\n\n offset += 2\n\n const data = buf.slice(offset, offset + len)\n offset += len\n\n rnull.decode.bytes = offset - oldOffset\n return data\n },\n encodingLength (data) {\n if (!data) return 2\n return (b.isU8Arr(data) ? data.length : b.bytelength(data)) + 2\n }\n})\n\nconst rhinfo = codec({\n encode (data, buf, offset) {\n if (!buf) buf = new Uint8Array(rhinfo.encodingLength(data))\n if (!offset) offset = 0\n\n const oldOffset = offset\n offset += 2\n string.encode(data.cpu, buf, offset)\n offset += string.encode.bytes\n string.encode(data.os, buf, offset)\n offset += string.encode.bytes\n b.writeUInt16BE(buf, offset - oldOffset - 2, oldOffset)\n rhinfo.encode.bytes = offset - oldOffset\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n\n const oldOffset = offset\n\n const data = {}\n offset += 2\n data.cpu = string.decode(buf, offset)\n offset += string.decode.bytes\n data.os = string.decode(buf, offset)\n offset += string.decode.bytes\n rhinfo.decode.bytes = offset - oldOffset\n return data\n },\n encodingLength (data) {\n return string.encodingLength(data.cpu) + string.encodingLength(data.os) + 2\n }\n})\n\nconst rptr = codec({\n encode (data, buf, offset) {\n if (!buf) buf = new Uint8Array(rptr.encodingLength(data))\n if (!offset) offset = 0\n\n name.encode(data, buf, offset + 2)\n b.writeUInt16BE(buf, name.encode.bytes, offset)\n rptr.encode.bytes = name.encode.bytes + 2\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n\n const data = name.decode(buf, offset + 2)\n rptr.decode.bytes = name.decode.bytes + 2\n return data\n },\n encodingLength (data) {\n return name.encodingLength(data) + 2\n }\n})\n\nconst rsrv = codec({\n encode (data, buf, offset) {\n if (!buf) buf = new Uint8Array(rsrv.encodingLength(data))\n if (!offset) offset = 0\n\n b.writeUInt16BE(buf, data.priority || 0, offset + 2)\n b.writeUInt16BE(buf, data.weight || 0, offset + 4)\n b.writeUInt16BE(buf, data.port || 0, offset + 6)\n name.encode(data.target, buf, offset + 8)\n\n const len = name.encode.bytes + 6\n b.writeUInt16BE(buf, len, offset)\n\n rsrv.encode.bytes = len + 2\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n\n const len = b.readUInt16BE(buf, offset)\n\n const data = {}\n data.priority = b.readUInt16BE(buf, offset + 2)\n data.weight = b.readUInt16BE(buf, offset + 4)\n data.port = b.readUInt16BE(buf, offset + 6)\n data.target = name.decode(buf, offset + 8)\n\n rsrv.decode.bytes = len + 2\n return data\n },\n encodingLength (data) {\n return 8 + name.encodingLength(data.target)\n }\n})\n\nconst rcaa = codec({\n encode (data, buf, offset) {\n const len = rcaa.encodingLength(data)\n\n if (!buf) buf = new Uint8Array(rcaa.encodingLength(data))\n if (!offset) offset = 0\n\n if (data.issuerCritical) {\n data.flags = rcaa.ISSUER_CRITICAL\n }\n\n b.writeUInt16BE(buf, len - 2, offset)\n offset += 2\n buf[offset] = data.flags || 0\n offset += 1\n string.encode(data.tag, buf, offset)\n offset += string.encode.bytes\n b.write(buf, data.value, offset)\n offset += b.bytelength(data.value)\n\n rcaa.encode.bytes = len\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n\n const len = b.readUInt16BE(buf, offset)\n offset += 2\n\n const oldOffset = offset\n const data = {}\n data.flags = buf[offset]\n offset += 1\n data.tag = string.decode(buf, offset)\n offset += string.decode.bytes\n data.value = toUtf8(buf, offset, oldOffset + len)\n\n data.issuerCritical = !!(data.flags & rcaa.ISSUER_CRITICAL)\n\n rcaa.decode.bytes = len + 2\n\n return data\n },\n encodingLength (data) {\n return string.encodingLength(data.tag) + string.encodingLength(data.value) + 2\n }\n})\n\nrcaa.ISSUER_CRITICAL = 1 << 7\n\nconst rmx = codec({\n encode (data, buf, offset) {\n if (!buf) buf = new Uint8Array(rmx.encodingLength(data))\n if (!offset) offset = 0\n\n const oldOffset = offset\n offset += 2\n b.writeUInt16BE(buf, data.preference || 0, offset)\n offset += 2\n name.encode(data.exchange, buf, offset)\n offset += name.encode.bytes\n\n b.writeUInt16BE(buf, offset - oldOffset - 2, oldOffset)\n rmx.encode.bytes = offset - oldOffset\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n\n const oldOffset = offset\n\n const data = {}\n offset += 2\n data.preference = b.readUInt16BE(buf, offset)\n offset += 2\n data.exchange = name.decode(buf, offset)\n offset += name.decode.bytes\n\n rmx.decode.bytes = offset - oldOffset\n return data\n },\n encodingLength (data) {\n return 4 + name.encodingLength(data.exchange)\n }\n})\n\nconst ra = codec({\n encode (host, buf, offset) {\n if (!buf) buf = new Uint8Array(ra.encodingLength(host))\n if (!offset) offset = 0\n\n b.writeUInt16BE(buf, 4, offset)\n offset += 2\n ip.v4.encode(host, buf, offset)\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n\n offset += 2\n const host = ip.v4.decode(buf, offset)\n return host\n },\n bytes: 6\n})\n\nconst raaaa = codec({\n encode (host, buf, offset) {\n if (!buf) buf = new Uint8Array(raaaa.encodingLength(host))\n if (!offset) offset = 0\n\n b.writeUInt16BE(buf, 16, offset)\n offset += 2\n ip.v6.encode(host, buf, offset)\n raaaa.encode.bytes = 18\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n\n offset += 2\n const host = ip.v6.decode(buf, offset)\n raaaa.decode.bytes = 18\n return host\n },\n bytes: 18\n})\n\nconst alloc = size => new Uint8Array(size)\n\nconst roption = codec({\n encode (option, buf, offset) {\n if (!buf) buf = new Uint8Array(roption.encodingLength(option))\n if (!offset) offset = 0\n const oldOffset = offset\n\n const code = optioncodes.toCode(option.code)\n b.writeUInt16BE(buf, code, offset)\n offset += 2\n if (option.data) {\n b.writeUInt16BE(buf, option.data.length, offset)\n offset += 2\n b.copy(option.data, buf, offset)\n offset += option.data.length\n } else {\n switch (code) {\n // case 3: NSID. No encode makes sense.\n // case 5,6,7: Not implementable\n case 8: // ECS\n {\n // note: do IP math before calling\n const spl = option.sourcePrefixLength || 0\n const fam = option.family || ip.familyOf(option.ip, alloc)\n const ipBuf = ip.encode(option.ip, alloc)\n const ipLen = Math.ceil(spl / 8)\n b.writeUInt16BE(buf, ipLen + 4, offset)\n offset += 2\n b.writeUInt16BE(buf, fam, offset)\n offset += 2\n buf[offset++] = spl\n buf[offset++] = option.scopePrefixLength || 0\n\n b.copy(ipBuf, buf, offset, 0, ipLen)\n offset += ipLen\n }\n break\n // case 9: EXPIRE (experimental)\n // case 10: COOKIE. No encode makes sense.\n case 11: // KEEP-ALIVE\n if (option.timeout) {\n b.writeUInt16BE(buf, 2, offset)\n offset += 2\n b.writeUInt16BE(buf, option.timeout, offset)\n offset += 2\n } else {\n b.writeUInt16BE(buf, 0, offset)\n offset += 2\n }\n break\n case 12: // PADDING\n {\n const len = option.length || 0\n b.writeUInt16BE(buf, len, offset)\n offset += 2\n buf.fill(0, offset, offset + len)\n offset += len\n }\n break\n // case 13: CHAIN. Experimental.\n case 14: // KEY-TAG\n {\n const tagsLen = option.tags.length * 2\n b.writeUInt16BE(buf, tagsLen, offset)\n offset += 2\n for (const tag of option.tags) {\n b.writeUInt16BE(buf, tag, offset)\n offset += 2\n }\n }\n break\n default:\n throw new Error(`Unknown roption code: ${option.code}`)\n }\n }\n\n roption.encode.bytes = offset - oldOffset\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n const option = {}\n option.code = b.readUInt16BE(buf, offset)\n option.type = optioncodes.toString(option.code)\n offset += 2\n const len = b.readUInt16BE(buf, offset)\n offset += 2\n option.data = buf.slice(offset, offset + len)\n switch (option.code) {\n // case 3: NSID. No decode makes sense.\n case 8: // ECS\n option.family = b.readUInt16BE(buf, offset)\n offset += 2\n option.sourcePrefixLength = buf[offset++]\n option.scopePrefixLength = buf[offset++]\n {\n const padded = new Uint8Array((option.family === 1) ? 4 : 16)\n b.copy(buf, padded, 0, offset, offset + len - 4)\n option.ip = ip.decode(padded)\n }\n break\n // case 12: Padding. No decode makes sense.\n case 11: // KEEP-ALIVE\n if (len > 0) {\n option.timeout = b.readUInt16BE(buf, offset)\n offset += 2\n }\n break\n case 14:\n option.tags = []\n for (let i = 0; i < len; i += 2) {\n option.tags.push(b.readUInt16BE(buf, offset))\n offset += 2\n }\n // don't worry about default. caller will use data if desired\n }\n\n roption.decode.bytes = len + 4\n return option\n },\n encodingLength (option) {\n if (option.data) {\n return option.data.length + 4\n }\n const code = optioncodes.toCode(option.code)\n switch (code) {\n case 8: // ECS\n {\n const spl = option.sourcePrefixLength || 0\n return Math.ceil(spl / 8) + 8\n }\n case 11: // KEEP-ALIVE\n return (typeof option.timeout === 'number') ? 6 : 4\n case 12: // PADDING\n return option.length + 4\n case 14: // KEY-TAG\n return 4 + (option.tags.length * 2)\n }\n throw new Error(`Unknown roption code: ${option.code}`)\n }\n})\n\nconst ropt = codec({\n encode (options, buf, offset) {\n if (!buf) buf = new Uint8Array(ropt.encodingLength(options))\n if (!offset) offset = 0\n const oldOffset = offset\n\n const rdlen = encodingLengthList(options, roption)\n b.writeUInt16BE(buf, rdlen, offset)\n offset = encodeList(options, roption, buf, offset + 2)\n\n ropt.encode.bytes = offset - oldOffset\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n const oldOffset = offset\n\n const options = []\n let rdlen = b.readUInt16BE(buf, offset)\n offset += 2\n let o = 0\n while (rdlen > 0) {\n options[o++] = roption.decode(buf, offset)\n offset += roption.decode.bytes\n rdlen -= roption.decode.bytes\n }\n ropt.decode.bytes = offset - oldOffset\n return options\n },\n encodingLength (options) {\n return 2 + encodingLengthList(options || [], roption)\n }\n})\n\nconst rdnskey = codec({\n encode (key, buf, offset) {\n if (!buf) buf = new Uint8Array(rdnskey.encodingLength(key))\n if (!offset) offset = 0\n const oldOffset = offset\n\n const keydata = key.key\n if (!b.isU8Arr(keydata)) {\n throw new Error('Key must be a Buffer')\n }\n\n offset += 2 // Leave space for length\n b.writeUInt16BE(buf, key.flags, offset)\n offset += 2\n buf[offset] = rdnskey.PROTOCOL_DNSSEC\n offset += 1\n buf[offset] = key.algorithm\n offset += 1\n b.copy(keydata, buf, offset, 0, keydata.length)\n offset += keydata.length\n\n rdnskey.encode.bytes = offset - oldOffset\n b.writeUInt16BE(buf, rdnskey.encode.bytes - 2, oldOffset)\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n const oldOffset = offset\n\n const key = {}\n const length = b.readUInt16BE(buf, offset)\n offset += 2\n key.flags = b.readUInt16BE(buf, offset)\n offset += 2\n if (buf[offset] !== rdnskey.PROTOCOL_DNSSEC) {\n throw new Error('Protocol must be 3')\n }\n offset += 1\n key.algorithm = buf[offset]\n offset += 1\n key.key = buf.slice(offset, oldOffset + length + 2)\n offset += key.key.length\n rdnskey.decode.bytes = offset - oldOffset\n return key\n },\n encodingLength (key) {\n return 6 + b.bytelength(key.key)\n }\n})\n\nrdnskey.PROTOCOL_DNSSEC = 3\nrdnskey.ZONE_KEY = 0x80\nrdnskey.SECURE_ENTRYPOINT = 0x8000\n\nconst rrrsig = codec({\n encode (sig, buf, offset) {\n if (!buf) buf = new Uint8Array(rrrsig.encodingLength(sig))\n if (!offset) offset = 0\n const oldOffset = offset\n\n const signature = sig.signature\n if (!b.isU8Arr(signature)) {\n throw new Error('Signature must be a Buffer')\n }\n\n offset += 2 // Leave space for length\n b.writeUInt16BE(buf, types.toType(sig.typeCovered), offset)\n offset += 2\n buf[offset] = sig.algorithm\n offset += 1\n buf[offset] = sig.labels\n offset += 1\n b.writeUInt32BE(buf, sig.originalTTL, offset)\n offset += 4\n b.writeUInt32BE(buf, sig.expiration, offset)\n offset += 4\n b.writeUInt32BE(buf, sig.inception, offset)\n offset += 4\n b.writeUInt16BE(buf, sig.keyTag, offset)\n offset += 2\n name.encode(sig.signersName, buf, offset)\n offset += name.encode.bytes\n b.copy(signature, buf, offset, 0, signature.length)\n offset += signature.length\n\n rrrsig.encode.bytes = offset - oldOffset\n b.writeUInt16BE(buf, rrrsig.encode.bytes - 2, oldOffset)\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n const oldOffset = offset\n\n const sig = {}\n const length = b.readUInt16BE(buf, offset)\n offset += 2\n sig.typeCovered = types.toString(b.readUInt16BE(buf, offset))\n offset += 2\n sig.algorithm = buf[offset]\n offset += 1\n sig.labels = buf[offset]\n offset += 1\n sig.originalTTL = b.readUInt32BE(buf, offset)\n offset += 4\n sig.expiration = b.readUInt32BE(buf, offset)\n offset += 4\n sig.inception = b.readUInt32BE(buf, offset)\n offset += 4\n sig.keyTag = b.readUInt16BE(buf, offset)\n offset += 2\n sig.signersName = name.decode(buf, offset)\n offset += name.decode.bytes\n sig.signature = buf.slice(offset, oldOffset + length + 2)\n offset += sig.signature.length\n rrrsig.decode.bytes = offset - oldOffset\n return sig\n },\n encodingLength (sig) {\n return 20 +\n name.encodingLength(sig.signersName) +\n b.bytelength(sig.signature)\n }\n})\nconst rrp = codec({\n encode (data, buf, offset) {\n if (!buf) buf = new Uint8Array(rrp.encodingLength(data))\n if (!offset) offset = 0\n const oldOffset = offset\n\n offset += 2 // Leave space for length\n name.encode(data.mbox || '.', buf, offset)\n offset += name.encode.bytes\n name.encode(data.txt || '.', buf, offset)\n offset += name.encode.bytes\n rrp.encode.bytes = offset - oldOffset\n b.writeUInt16BE(buf, rrp.encode.bytes - 2, oldOffset)\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n const oldOffset = offset\n\n const data = {}\n offset += 2\n data.mbox = name.decode(buf, offset) || '.'\n offset += name.decode.bytes\n data.txt = name.decode(buf, offset) || '.'\n offset += name.decode.bytes\n rrp.decode.bytes = offset - oldOffset\n return data\n },\n encodingLength (data) {\n return 2 + name.encodingLength(data.mbox || '.') + name.encodingLength(data.txt || '.')\n }\n})\n\nconst typebitmap = codec({\n encode (typelist, buf, offset) {\n if (!buf) buf = new Uint8Array(typebitmap.encodingLength(typelist))\n if (!offset) offset = 0\n const oldOffset = offset\n\n const typesByWindow = []\n for (let i = 0; i < typelist.length; i++) {\n const typeid = types.toType(typelist[i])\n if (typesByWindow[typeid >> 8] === undefined) {\n typesByWindow[typeid >> 8] = []\n }\n typesByWindow[typeid >> 8][(typeid >> 3) & 0x1F] |= 1 << (7 - (typeid & 0x7))\n }\n\n for (let i = 0; i < typesByWindow.length; i++) {\n if (typesByWindow[i] !== undefined) {\n const windowBuf = b.from(typesByWindow[i])\n buf[offset] = i\n offset += 1\n buf[offset] = windowBuf.length\n offset += 1\n b.copy(windowBuf, buf, offset, 0, windowBuf.length)\n offset += windowBuf.length\n }\n }\n\n typebitmap.encode.bytes = offset - oldOffset\n return buf\n },\n decode (buf, offset, length) {\n if (!offset) offset = 0\n const oldOffset = offset\n\n const typelist = []\n while (offset - oldOffset < length) {\n const window = buf[offset]\n offset += 1\n const windowLength = buf[offset]\n offset += 1\n for (let i = 0; i < windowLength; i++) {\n const b = buf[offset + i]\n for (let j = 0; j < 8; j++) {\n if (b & (1 << (7 - j))) {\n const typeid = types.toString((window << 8) | (i << 3) | j)\n typelist.push(typeid)\n }\n }\n }\n offset += windowLength\n }\n\n typebitmap.decode.bytes = offset - oldOffset\n return typelist\n },\n encodingLength (typelist) {\n const extents = []\n for (let i = 0; i < typelist.length; i++) {\n const typeid = types.toType(typelist[i])\n extents[typeid >> 8] = Math.max(extents[typeid >> 8] || 0, typeid & 0xFF)\n }\n\n let len = 0\n for (let i = 0; i < extents.length; i++) {\n if (extents[i] !== undefined) {\n len += 2 + Math.ceil((extents[i] + 1) / 8)\n }\n }\n\n return len\n }\n})\n\nconst rnsec = codec({\n encode (record, buf, offset) {\n if (!buf) buf = new Uint8Array(rnsec.encodingLength(record))\n if (!offset) offset = 0\n const oldOffset = offset\n\n offset += 2 // Leave space for length\n name.encode(record.nextDomain, buf, offset)\n offset += name.encode.bytes\n typebitmap.encode(record.rrtypes, buf, offset)\n offset += typebitmap.encode.bytes\n\n rnsec.encode.bytes = offset - oldOffset\n b.writeUInt16BE(buf, rnsec.encode.bytes - 2, oldOffset)\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n const oldOffset = offset\n\n const record = {}\n const length = b.readUInt16BE(buf, offset)\n offset += 2\n record.nextDomain = name.decode(buf, offset)\n offset += name.decode.bytes\n record.rrtypes = typebitmap.decode(buf, offset, length - (offset - oldOffset))\n offset += typebitmap.decode.bytes\n\n rnsec.decode.bytes = offset - oldOffset\n return record\n },\n encodingLength (record) {\n return 2 +\n name.encodingLength(record.nextDomain) +\n typebitmap.encodingLength(record.rrtypes)\n }\n})\n\nconst rnsec3 = codec({\n encode (record, buf, offset) {\n if (!buf) buf = new Uint8Array(rnsec3.encodingLength(record))\n if (!offset) offset = 0\n const oldOffset = offset\n\n const salt = record.salt\n if (!b.isU8Arr(salt)) {\n throw new Error('salt must be a Buffer')\n }\n\n const nextDomain = record.nextDomain\n if (!b.isU8Arr(nextDomain)) {\n throw new Error('nextDomain must be a Buffer')\n }\n\n offset += 2 // Leave space for length\n buf[offset] = record.algorithm\n offset += 1\n buf[offset] = record.flags\n offset += 1\n b.writeUInt16BE(buf, record.iterations, offset)\n offset += 2\n buf[offset] = salt.length\n offset += 1\n b.copy(salt, buf, offset, 0, salt.length)\n offset += salt.length\n buf[offset] = nextDomain.length\n offset += 1\n b.copy(nextDomain, buf, offset, 0, nextDomain.length)\n offset += nextDomain.length\n typebitmap.encode(record.rrtypes, buf, offset)\n offset += typebitmap.encode.bytes\n\n rnsec3.encode.bytes = offset - oldOffset\n b.writeUInt16BE(buf, rnsec3.encode.bytes - 2, oldOffset)\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n const oldOffset = offset\n\n const record = {}\n const length = b.readUInt16BE(buf, offset)\n offset += 2\n record.algorithm = buf[offset]\n offset += 1\n record.flags = buf[offset]\n offset += 1\n record.iterations = b.readUInt16BE(buf, offset)\n offset += 2\n const saltLength = buf[offset]\n offset += 1\n record.salt = buf.slice(offset, offset + saltLength)\n offset += saltLength\n const hashLength = buf[offset]\n offset += 1\n record.nextDomain = buf.slice(offset, offset + hashLength)\n offset += hashLength\n record.rrtypes = typebitmap.decode(buf, offset, length - (offset - oldOffset))\n offset += typebitmap.decode.bytes\n\n rnsec3.decode.bytes = offset - oldOffset\n return record\n },\n encodingLength (record) {\n return 8 +\n record.salt.length +\n record.nextDomain.length +\n typebitmap.encodingLength(record.rrtypes)\n }\n})\n\nconst rds = codec({\n encode (digest, buf, offset) {\n if (!buf) buf = new Uint8Array(rds.encodingLength(digest))\n if (!offset) offset = 0\n const oldOffset = offset\n\n const digestdata = digest.digest\n if (!b.isU8Arr(digestdata)) {\n throw new Error('Digest must be a Buffer')\n }\n\n offset += 2 // Leave space for length\n b.writeUInt16BE(buf, digest.keyTag, offset)\n offset += 2\n buf[offset] = digest.algorithm\n offset += 1\n buf[offset] = digest.digestType\n offset += 1\n b.copy(digestdata, buf, offset, 0, digestdata.length)\n offset += digestdata.length\n\n rds.encode.bytes = offset - oldOffset\n b.writeUInt16BE(buf, rds.encode.bytes - 2, oldOffset)\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n const oldOffset = offset\n\n const digest = {}\n const length = b.readUInt16BE(buf, offset)\n offset += 2\n digest.keyTag = b.readUInt16BE(buf, offset)\n offset += 2\n digest.algorithm = buf[offset]\n offset += 1\n digest.digestType = buf[offset]\n offset += 1\n digest.digest = buf.slice(offset, oldOffset + length + 2)\n offset += digest.digest.length\n rds.decode.bytes = offset - oldOffset\n return digest\n },\n encodingLength (digest) {\n return 6 + b.bytelength(digest.digest)\n }\n})\n\nfunction renc (type) {\n switch (type.toUpperCase()) {\n case 'A': return ra\n case 'PTR': return rptr\n case 'CNAME': return rptr\n case 'DNAME': return rptr\n case 'TXT': return rtxt\n case 'NULL': return rnull\n case 'AAAA': return raaaa\n case 'SRV': return rsrv\n case 'HINFO': return rhinfo\n case 'CAA': return rcaa\n case 'NS': return rns\n case 'SOA': return rsoa\n case 'MX': return rmx\n case 'OPT': return ropt\n case 'DNSKEY': return rdnskey\n case 'RRSIG': return rrrsig\n case 'RP': return rrp\n case 'NSEC': return rnsec\n case 'NSEC3': return rnsec3\n case 'DS': return rds\n }\n return runknown\n}\n\nexport const answer = codec({\n encode (a, buf, offset) {\n if (!buf) buf = new Uint8Array(answer.encodingLength(a))\n if (!offset) offset = 0\n\n const oldOffset = offset\n\n name.encode(a.name, buf, offset)\n offset += name.encode.bytes\n\n b.writeUInt16BE(buf, types.toType(a.type), offset)\n\n if (a.type.toUpperCase() === 'OPT') {\n if (a.name !== '.') {\n throw new Error('OPT name must be root.')\n }\n b.writeUInt16BE(buf, a.udpPayloadSize || 4096, offset + 2)\n buf[offset + 4] = a.extendedRcode || 0\n buf[offset + 5] = a.ednsVersion || 0\n b.writeUInt16BE(buf, a.flags || 0, offset + 6)\n\n offset += 8\n ropt.encode(a.options || [], buf, offset)\n offset += ropt.encode.bytes\n } else {\n let klass = classes.toClass(a.class === undefined ? 'IN' : a.class)\n if (a.flush) klass |= FLUSH_MASK // the 1st bit of the class is the flush bit\n b.writeUInt16BE(buf, klass, offset + 2)\n b.writeUInt32BE(buf, a.ttl || 0, offset + 4)\n\n offset += 8\n const enc = renc(a.type)\n enc.encode(a.data, buf, offset)\n offset += enc.encode.bytes\n }\n\n answer.encode.bytes = offset - oldOffset\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n\n const a = {}\n const oldOffset = offset\n\n a.name = name.decode(buf, offset)\n offset += name.decode.bytes\n a.type = types.toString(b.readUInt16BE(buf, offset))\n if (a.type === 'OPT') {\n a.udpPayloadSize = b.readUInt16BE(buf, offset + 2)\n a.extendedRcode = buf[offset + 4]\n a.ednsVersion = buf[offset + 5]\n a.flags = b.readUInt16BE(buf, offset + 6)\n a.flag_do = ((a.flags >> 15) & 0x1) === 1\n a.options = ropt.decode(buf, offset + 8)\n offset += 8 + ropt.decode.bytes\n } else {\n const klass = b.readUInt16BE(buf, offset + 2)\n a.ttl = b.readUInt32BE(buf, offset + 4)\n\n a.class = classes.toString(klass & NOT_FLUSH_MASK)\n a.flush = !!(klass & FLUSH_MASK)\n\n const enc = renc(a.type)\n a.data = enc.decode(buf, offset + 8)\n offset += 8 + enc.decode.bytes\n }\n\n answer.decode.bytes = offset - oldOffset\n return a\n },\n encodingLength (a) {\n const data = (a.data !== null && a.data !== undefined) ? a.data : a.options\n return name.encodingLength(a.name) + 8 + renc(a.type).encodingLength(data)\n }\n})\n\nexport const question = codec({\n encode (q, buf, offset) {\n if (!buf) buf = new Uint8Array(question.encodingLength(q))\n if (!offset) offset = 0\n\n const oldOffset = offset\n\n name.encode(q.name, buf, offset)\n offset += name.encode.bytes\n\n b.writeUInt16BE(buf, types.toType(q.type), offset)\n offset += 2\n\n b.writeUInt16BE(buf, classes.toClass(q.class === undefined ? 'IN' : q.class), offset)\n offset += 2\n\n question.encode.bytes = offset - oldOffset\n return q\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n\n const oldOffset = offset\n const q = {}\n\n q.name = name.decode(buf, offset)\n offset += name.decode.bytes\n\n q.type = types.toString(b.readUInt16BE(buf, offset))\n offset += 2\n\n q.class = classes.toString(b.readUInt16BE(buf, offset))\n offset += 2\n\n const qu = !!(q.class & QU_MASK)\n if (qu) q.class &= NOT_QU_MASK\n\n question.decode.bytes = offset - oldOffset\n return q\n },\n encodingLength (q) {\n return name.encodingLength(q.name) + 4\n }\n})\n\nexport {\n rsoa as soa,\n rtxt as txt,\n rnull as null,\n runknown as unknown,\n rns as ns,\n rhinfo as hinfo,\n rptr as ptr,\n rptr as cname,\n rptr as dname,\n rsrv as srv,\n rcaa as caa,\n rmx as mx,\n ra as a,\n raaaa as aaaa,\n roption as option,\n ropt as opt,\n rdnskey as dnskey,\n rrrsig as rrsig,\n rrp as rp,\n rnsec as nsec,\n rnsec3 as nsec3,\n rds as ds,\n renc as enc\n}\n\nexport const AUTHORITATIVE_ANSWER = 1 << 10\nexport const TRUNCATED_RESPONSE = 1 << 9\nexport const RECURSION_DESIRED = 1 << 8\nexport const RECURSION_AVAILABLE = 1 << 7\nexport const AUTHENTIC_DATA = 1 << 5\nexport const CHECKING_DISABLED = 1 << 4\nexport const DNSSEC_OK = 1 << 15\n\nexport const packet = {\n encode: function (result, buf, offset) {\n const allocing = !buf\n\n if (allocing) buf = new Uint8Array(encodingLength(result))\n if (!offset) offset = 0\n\n const oldOffset = offset\n\n if (!result.questions) result.questions = []\n if (!result.answers) result.answers = []\n if (!result.authorities) result.authorities = []\n if (!result.additionals) result.additionals = []\n\n header.encode(result, buf, offset)\n offset += header.encode.bytes\n\n offset = encodeList(result.questions, question, buf, offset)\n offset = encodeList(result.answers, answer, buf, offset)\n offset = encodeList(result.authorities, answer, buf, offset)\n offset = encodeList(result.additionals, answer, buf, offset)\n\n packet.encode.bytes = offset - oldOffset\n\n // just a quick sanity check\n if (allocing && encode.bytes !== buf.length) {\n return buf.slice(0, encode.bytes)\n }\n\n return buf\n },\n decode: function (buf, offset) {\n if (!offset) offset = 0\n\n const oldOffset = offset\n const result = header.decode(buf, offset)\n offset += header.decode.bytes\n\n offset = decodeList(result.questions, question, buf, offset)\n offset = decodeList(result.answers, answer, buf, offset)\n offset = decodeList(result.authorities, answer, buf, offset)\n offset = decodeList(result.additionals, answer, buf, offset)\n\n packet.decode.bytes = offset - oldOffset\n\n return result\n },\n encodingLength: function (result) {\n return header.encodingLength(result) +\n encodingLengthList(result.questions || [], question) +\n encodingLengthList(result.answers || [], answer) +\n encodingLengthList(result.authorities || [], answer) +\n encodingLengthList(result.additionals || [], answer)\n }\n}\npacket.encode.bytes = 0\npacket.decode.bytes = 0\n\nfunction sanitizeSingle (input, type) {\n if (input.questions) {\n throw new Error('Only one .question object expected instead of a .questions array!')\n }\n const sanitized = Object.assign({\n type\n }, input)\n if (sanitized.question) {\n sanitized.questions = [sanitized.question]\n delete sanitized.question\n }\n return sanitized\n}\n\nexport const query = {\n encode: function (result, buf, offset) {\n buf = packet.encode(sanitizeSingle(result, 'query'), buf, offset)\n query.encode.bytes = packet.encode.bytes\n return buf\n },\n decode: function (buf, offset) {\n const res = packet.decode(buf, offset)\n query.decode.bytes = packet.decode.bytes\n if (res.questions) {\n res.question = res.questions[0]\n delete res.questions\n }\n return res\n },\n encodingLength: function (result) {\n return packet.encodingLength(sanitizeSingle(result, 'query'))\n }\n}\nquery.encode.bytes = 0\nquery.decode.bytes = 0\n\nexport const response = {\n encode: function (result, buf, offset) {\n buf = packet.encode(sanitizeSingle(result, 'response'), buf, offset)\n response.encode.bytes = packet.encode.bytes\n return buf\n },\n decode: function (buf, offset) {\n const res = packet.decode(buf, offset)\n response.decode.bytes = packet.decode.bytes\n if (res.questions) {\n res.question = res.questions[0]\n delete res.questions\n }\n return res\n },\n encodingLength: function (result) {\n return packet.encodingLength(sanitizeSingle(result, 'response'))\n }\n}\nresponse.encode.bytes = 0\nresponse.decode.bytes = 0\n\nexport const encode = packet.encode\nexport const decode = packet.decode\nexport const encodingLength = packet.encodingLength\n\nexport function streamEncode (result) {\n const buf = encode(result)\n const combine = new Uint8Array(2 + buf.byteLength)\n b.writeUInt16BE(combine, buf.byteLength)\n b.copy(buf, combine, 2, 0, buf.length)\n streamEncode.bytes = combine.byteLength\n return combine\n}\nstreamEncode.bytes = 0\n\nexport function streamDecode (sbuf) {\n const len = b.readUInt16BE(sbuf, 0)\n if (sbuf.byteLength < len + 2) {\n // not enough data\n return null\n }\n const result = decode(sbuf.slice(2))\n streamDecode.bytes = decode.bytes\n return result\n}\nstreamDecode.bytes = 0\n\nexport function encodingLengthList (list, enc) {\n let len = 0\n for (let i = 0; i < list.length; i++) len += enc.encodingLength(list[i])\n return len\n}\n\nexport function encodeList (list, enc, buf, offset) {\n for (let i = 0; i < list.length; i++) {\n enc.encode(list[i], buf, offset)\n offset += enc.encode.bytes\n }\n return offset\n}\n\nexport function decodeList (list, enc, buf, offset) {\n for (let i = 0; i < list.length; i++) {\n list[i] = enc.decode(buf, offset)\n offset += enc.decode.bytes\n }\n return offset\n}\n","export const PREFERS_PADDING = 1\nexport const PREFERS_NO_PADDING = 2\n\nexport function make (name, charset, padding, paddingMode) {\n if (charset.length !== 64) {\n throw new Error(`Charset needs to be 64 characters long! (${charset.length})`)\n }\n const byCharCode = new Uint8Array(256)\n const byNum = new Uint8Array(64)\n for (let i = 0; i < 64; i += 1) {\n const code = charset.charCodeAt(i)\n if (code > 255) {\n throw new Error(`Character #${i} in charset [code=${code}, char=${charset.charAt(i)}] is too high! (max=255)`)\n }\n if (byCharCode[code] !== 0) {\n throw new Error(`Character [code=${code}, char=${charset.charAt(i)}] is more than once in the charset!`)\n }\n byCharCode[code] = i\n byNum[i] = code\n }\n const padCode = padding.charCodeAt(0)\n const codec = {\n name,\n encodingLength (str) {\n const strLen = str.length\n const len = strLen * 0.75 | 0\n if (str.charCodeAt(strLen - 1) === padCode) {\n if (str.charCodeAt(strLen - 2) === padCode) {\n return len - 2\n }\n return len - 1\n }\n return len\n },\n encode (str, buffer, offset) {\n if (buffer === null || buffer === undefined) {\n buffer = new Uint8Array(codec.encodingLength(str))\n }\n if (offset === null || offset === undefined) {\n offset = 0\n }\n\n let strLen = str.length\n if (str.charCodeAt(strLen - 1) === padCode) {\n if (str.charCodeAt(strLen - 2) === padCode) {\n strLen -= 2\n } else {\n strLen -= 1\n }\n }\n\n const padding = strLen % 4\n const safeLen = strLen - padding\n\n let off = offset\n let i = 0\n while (i < safeLen) {\n const code =\n (byCharCode[str.charCodeAt(i)] << 18) |\n (byCharCode[str.charCodeAt(i + 1)] << 12) |\n (byCharCode[str.charCodeAt(i + 2)] << 6) |\n byCharCode[str.charCodeAt(i + 3)]\n buffer[off++] = code >> 16\n buffer[off++] = code >> 8\n buffer[off++] = code\n i += 4\n }\n\n if (padding === 3) {\n const code =\n (byCharCode[str.charCodeAt(i)] << 10) |\n (byCharCode[str.charCodeAt(i + 1)] << 4) |\n (byCharCode[str.charCodeAt(i + 2)] >> 2)\n buffer[off++] = code >> 8\n buffer[off++] = code\n } else if (padding === 2) {\n buffer[off++] = (byCharCode[str.charCodeAt(i)] << 2) |\n (byCharCode[str.charCodeAt(i + 1)] >> 4)\n }\n\n codec.encode.bytes = off - offset\n return buffer\n },\n decode (buffer, start, end) {\n if (start === null || start === undefined) {\n start = 0\n }\n if (end === null || end === undefined) {\n end = buffer.length\n }\n\n const length = end - start\n const pad = length % 3\n const safeEnd = start + length - pad\n const codes = []\n for (let off = start; off < safeEnd; off += 3) {\n const num = (buffer[off] << 16) | ((buffer[off + 1] << 8)) | buffer[off + 2]\n codes.push(\n byNum[num >> 18 & 0x3F],\n byNum[num >> 12 & 0x3F],\n byNum[num >> 6 & 0x3F],\n byNum[num & 0x3F]\n )\n }\n\n if (pad === 2) {\n const num = (buffer[end - 2] << 8) + buffer[end - 1]\n codes.push(\n byNum[num >> 10],\n byNum[(num >> 4) & 0x3F],\n byNum[(num << 2) & 0x3F]\n )\n if (paddingMode === PREFERS_PADDING) {\n codes.push(padCode)\n }\n } else if (pad === 1) {\n const num = buffer[end - 1]\n codes.push(\n byNum[num >> 2],\n byNum[(num << 4) & 0x3F]\n )\n if (paddingMode === PREFERS_PADDING) {\n codes.push(padCode, padCode)\n }\n }\n\n codec.decode.bytes = length\n return String.fromCharCode.apply(String, codes)\n }\n }\n return codec\n}\n\nexport const base64 = make('base64', 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/', '=', PREFERS_PADDING)\n// https://datatracker.ietf.org/doc/html/rfc4648#section-5\nexport const base64URL = make('base64-url', 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_', '=', PREFERS_NO_PADDING)\n","let AbortError = typeof global !== 'undefined' ? global.AbortError : typeof window !== 'undefined' ? window.AbortError : null\nif (!AbortError) {\n AbortError = class AbortError extends Error {\n constructor (message = 'Request aborted.') {\n super(message)\n }\n }\n}\nAbortError.prototype.name = 'AbortError'\nAbortError.prototype.code = 'ABORT_ERR'\n\nconst URL = (typeof globalThis !== 'undefined' && globalThis.URL) || require('url').URL\n\nexport { AbortError, URL }\n\nexport class HTTPStatusError extends Error {\n constructor (uri, code, method) {\n super('status=' + code + ' while requesting ' + uri + ' [' + method + ']')\n this.uri = uri\n this.status = code\n this.method = method\n }\n\n toJSON () {\n return {\n code: this.code,\n uri: this.uri,\n status: this.status,\n method: this.method,\n endpoint: this.endpoint\n }\n }\n}\nHTTPStatusError.prototype.name = 'HTTPStatusError'\nHTTPStatusError.prototype.code = 'HTTP_STATUS'\n\nexport class ResponseError extends Error {\n constructor (message, cause) {\n super(message)\n this.cause = cause\n }\n\n toJSON () {\n return {\n message: this.message,\n endpoint: this.endpoint,\n code: this.code,\n cause: reduceError(this.cause)\n }\n }\n}\nResponseError.prototype.name = 'ResponseError'\nResponseError.prototype.code = 'RESPONSE_ERR'\n\nexport class TimeoutError extends Error {\n constructor (timeout) {\n super('Timeout (t=' + timeout + ').')\n this.timeout = timeout\n }\n\n toJSON () {\n return {\n code: this.code,\n endpoint: this.endpoint,\n timeout: this.timeout\n }\n }\n}\nTimeoutError.prototype.name = 'TimeoutError'\nTimeoutError.prototype.code = 'ETIMEOUT'\n\nconst v4Regex = /^((\\d{1,3}\\.){3,3}\\d{1,3})(:(\\d{2,5}))?$/\nconst v6Regex = /^((::)?(((\\d{1,3}\\.){3}(\\d{1,3}){1})?([0-9a-f]){0,4}:{0,2}){1,8}(::)?)(:(\\d{2,5}))?$/i\n\nexport function reduceError (err) {\n if (typeof err === 'string') {\n return {\n message: err\n }\n }\n try {\n const json = JSON.stringify(err)\n if (json !== '{}') {\n return JSON.parse(json)\n }\n } catch (e) {}\n const error = {\n message: String(err.message || err)\n }\n if (err.code !== undefined) {\n error.code = String(err.code)\n }\n return error\n}\n\nconst baseParts = /^(([a-z0-9]+:)\\/\\/)?([^/[\\s:]+|\\[[^\\]]+\\])?(:([^/\\s]+))?(\\/[^\\s]*)?(.*)$/\nconst httpFlags = /\\[(post|get|((ipv4|ipv6|name)=([^\\]]+)))\\]/ig\nconst updFlags = /\\[(((pk|name)=([^\\]]+)))\\]/ig\n\nexport function parseEndpoint (endpoint) {\n const parts = baseParts.exec(endpoint)\n const protocol = parts[2] || 'https:'\n const host = parts[3]\n const port = parts[5]\n const path = parts[6]\n const rest = parts[7]\n if (protocol === 'https:' || protocol === 'http:') {\n const flags = parseFlags(rest, httpFlags)\n return {\n name: flags.name,\n protocol,\n ipv4: flags.ipv4,\n ipv6: flags.ipv6,\n host,\n port,\n path,\n method: flags.post ? 'POST' : 'GET'\n }\n }\n if (protocol === 'udp:' || protocol === 'udp4:' || protocol === 'udp6:') {\n const flags = parseFlags(rest, updFlags)\n const v6Parts = /^\\[(.*)\\]$/.exec(host)\n if (v6Parts && protocol === 'udp4:') {\n throw new Error(`Endpoint parsing error: Cannot use ipv6 host with udp4: (endpoint=${endpoint})`)\n }\n if (!v6Parts && protocol === 'udp6:') {\n throw new Error(`Endpoint parsing error: Incorrectly formatted host for udp6: (endpoint=${endpoint})`)\n }\n if (v6Parts) {\n return new UDP6Endpoint({ protocol: 'udp6:', ipv6: v6Parts[1], port, pk: flags.pk, name: flags.name })\n }\n return new UDP4Endpoint({ protocol: 'udp4:', ipv4: host, port, pk: flags.pk, name: flags.name })\n }\n throw new InvalidProtocolError(protocol, endpoint)\n}\n\nfunction parseFlags (rest, regex) {\n regex.lastIndex = 0\n const result = {}\n while (true) {\n const match = regex.exec(rest)\n if (!match) break\n if (match[2]) {\n result[match[3].toLowerCase()] = match[4]\n } else {\n result[match[1].toLowerCase()] = true\n }\n }\n return result\n}\n\nexport class InvalidProtocolError extends Error {\n constructor (protocol, endpoint) {\n super(`Invalid Endpoint: unsupported protocol \"${protocol}\" for endpoint: ${endpoint}, supported protocols: ${supportedProtocols.join(', ')}`)\n this.protocol = protocol\n this.endpoint = endpoint\n }\n\n toJSON () {\n return {\n code: this.code,\n endpoint: this.endpoint,\n timeout: this.timeout\n }\n }\n}\nInvalidProtocolError.prototype.name = 'InvalidProtocolError'\nInvalidProtocolError.prototype.code = 'EPROTOCOL'\n\nexport const supportedProtocols = ['http:', 'https:', 'udp4:', 'udp6:']\n\nexport class BaseEndpoint {\n constructor (opts, isHTTP) {\n this.name = opts.name || null\n this.protocol = opts.protocol\n const port = typeof opts.port === 'string' ? opts.port = parseInt(opts.port, 10) : opts.port\n if (port === undefined || port === null) {\n this.port = isHTTP\n ? (this.protocol === 'https:' ? 443 : 80)\n : (opts.pk ? 443 : 53)\n } else if (typeof port !== 'number' && !isNaN(port)) {\n throw new Error(`Invalid Endpoint: port \"${opts.port}\" needs to be a number: ${JSON.stringify(opts)}`)\n } else {\n this.port = port\n }\n }\n\n toJSON () {\n return this.toString()\n }\n}\n\nexport class UDPEndpoint extends BaseEndpoint {\n constructor (opts) {\n super(opts, false)\n this.pk = opts.pk || null\n }\n\n toString () {\n const port = this.port !== (this.pk ? 443 : 53) ? `:${this.port}` : ''\n const pk = this.pk ? ` [pk=${this.pk}]` : ''\n const name = this.name ? ` [name=${this.name}]` : ''\n return `udp://${this.ipv4 || `[${this.ipv6}]`}${port}${pk}${name}`\n }\n}\n\nexport class UDP4Endpoint extends UDPEndpoint {\n constructor (opts) {\n super(Object.assign({ protocol: 'udp4:' }, opts))\n if (!opts.ipv4 || typeof opts.ipv4 !== 'string') {\n throw new Error(`Invalid Endpoint: .ipv4 \"${opts.ipv4}\" needs to be set: ${JSON.stringify(opts)}`)\n }\n this.ipv4 = opts.ipv4\n }\n}\n\nexport class UDP6Endpoint extends UDPEndpoint {\n constructor (opts) {\n super(Object.assign({ protocol: 'udp6:' }, opts))\n if (!opts.ipv6 || typeof opts.ipv6 !== 'string') {\n throw new Error(`Invalid Endpoint: .ipv6 \"${opts.ipv6}\" needs to be set: ${JSON.stringify(opts)}`)\n }\n this.ipv6 = opts.ipv6\n }\n}\n\nfunction safeHost (host) {\n return v6Regex.test(host) && !v4Regex.test(host) ? `[${host}]` : host\n}\n\nexport class HTTPEndpoint extends BaseEndpoint {\n constructor (opts) {\n super(Object.assign({ protocol: 'https:' }, opts), true)\n if (!opts.host) {\n if (opts.ipv4) {\n opts.host = opts.ipv4\n }\n if (opts.ipv6) {\n opts.host = `[${opts.ipv6}]`\n }\n }\n if (!opts.host || typeof opts.host !== 'string') {\n throw new Error(`Invalid Endpoint: host \"${opts.path}\" needs to be set: ${JSON.stringify(opts)}`)\n }\n this.host = opts.host\n this.path = opts.path || '/dns-query'\n this.method = /^post$/i.test(opts.method) ? 'POST' : 'GET'\n this.ipv4 = opts.ipv4\n this.ipv6 = opts.ipv6\n if (!this.ipv6) {\n const v6Parts = v6Regex.exec(this.host)\n if (v6Parts) {\n this.ipv6 = v6Parts[1]\n }\n }\n if (!this.ipv4) {\n if (v4Regex.test(this.host)) {\n this.ipv4 = this.host\n }\n }\n const url = `${this.protocol}//${safeHost(this.host)}:${this.port}${this.path}`\n try {\n this.url = new URL(url)\n } catch (err) {\n throw new Error(err.message + ` [${url}]`)\n }\n }\n\n toString () {\n const protocol = this.protocol === 'https:' ? '' : 'http://'\n const port = this.port !== (this.protocol === 'https:' ? 443 : 80) ? `:${this.port}` : ''\n const method = this.method !== 'GET' ? ' [post]' : ''\n const path = this.path === '/dns-query' ? '' : this.path\n const name = this.name ? ` [name=${this.name}]` : ''\n const ipv4 = this.ipv4 && this.ipv4 !== this.host ? ` [ipv4=${this.ipv4}]` : ''\n const ipv6 = this.ipv6 && this.ipv6 !== this.host ? ` [ipv6=${this.ipv6}]` : ''\n return `${protocol}${safeHost(this.host)}${port}${path}${method}${ipv4}${ipv6}${name}`\n }\n}\n\nexport function toEndpoint (input) {\n let opts\n if (typeof input === 'string') {\n opts = parseEndpoint(input)\n } else {\n if (typeof input !== 'object' || input === null || Array.isArray(input)) {\n throw new Error(`Can not convert ${input} to an endpoint`)\n } else if (input instanceof BaseEndpoint) {\n return input\n }\n opts = input\n }\n if (opts.protocol === null || opts.protocol === undefined) {\n opts.protocol = 'https:'\n }\n const protocol = opts.protocol\n if (protocol === 'udp4:') {\n return new UDP4Endpoint(opts)\n }\n if (protocol === 'udp6:') {\n return new UDP6Endpoint(opts)\n }\n if (protocol === 'https:' || protocol === 'http:') {\n return new HTTPEndpoint(opts)\n }\n throw new InvalidProtocolError(protocol, JSON.stringify(opts))\n}\n","/* global XMLHttpRequest, localStorage */\nimport * as utf8Codec from 'utf8-codec'\nimport { base64URL } from '@leichtgewicht/base64-codec'\nimport {\n AbortError,\n HTTPStatusError,\n TimeoutError,\n URL\n} from './common.mjs'\nconst contentType = 'application/dns-message'\n\nfunction noop () { }\n\nexport function queryDns () {\n throw new Error('Only \"doh\" endpoints are supported in the browser')\n}\n\nexport async function loadJSON (url, cache, timeout, abortSignal) {\n const cacheKey = cache ? cache.localStoragePrefix + cache.name : null\n if (cacheKey) {\n try {\n const cached = JSON.parse(localStorage.getItem(cacheKey))\n if (cached && cached.time > cache.maxTime) {\n return cached\n }\n } catch (err) {}\n }\n const { data } = await requestRaw(url, 'GET', null, timeout, abortSignal)\n const result = {\n time: Date.now(),\n data: JSON.parse(utf8Codec.decode(data))\n }\n if (cacheKey) {\n try {\n localStorage.setItem(cacheKey, JSON.stringify(result))\n } catch (err) {\n result.time = null\n }\n }\n return result\n}\n\nfunction requestRaw (url, method, data, timeout, abortSignal) {\n return new Promise((resolve, reject) => {\n const target = new URL(url)\n if (method === 'GET' && data) {\n target.search = '?dns=' + base64URL.decode(data)\n }\n const uri = target.toString()\n const xhr = new XMLHttpRequest()\n xhr.open(method, uri, true)\n xhr.setRequestHeader('Accept', contentType)\n if (method === 'POST') {\n xhr.setRequestHeader('Content-Type', contentType)\n }\n xhr.responseType = 'arraybuffer'\n xhr.timeout = timeout\n xhr.ontimeout = ontimeout\n xhr.onreadystatechange = onreadystatechange\n xhr.onerror = onerror\n xhr.onload = onload\n if (method === 'POST') {\n xhr.send(data)\n } else {\n xhr.send()\n }\n\n if (abortSignal) {\n abortSignal.addEventListener('abort', onabort)\n }\n\n function ontimeout () {\n finish(new TimeoutError(timeout))\n try {\n xhr.abort()\n } catch (e) { }\n }\n\n function onload () {\n if (xhr.status !== 200) {\n finish(new HTTPStatusError(uri, xhr.status, method))\n } else {\n let buf\n if (typeof xhr.response === 'string') {\n buf = utf8Codec.encode(xhr.response)\n } else if (xhr.response instanceof Uint8Array) {\n buf = xhr.response\n } else if (Array.isArray(xhr.response) || xhr.response instanceof ArrayBuffer) {\n buf = new Uint8Array(xhr.response)\n } else {\n throw new Error('Unprocessable response ' + xhr.response)\n }\n finish(null, buf)\n }\n }\n\n function onreadystatechange () {\n if (xhr.readyState > 1 && xhr.status !== 200 && xhr.status !== 0) {\n finish(new HTTPStatusError(uri, xhr.status, method))\n try {\n xhr.abort()\n } catch (e) { }\n }\n }\n\n let finish = function (error, data) {\n finish = noop\n if (abortSignal) {\n abortSignal.removeEventListener('abort', onabort)\n }\n if (error) {\n resolve({\n error,\n response: xhr\n })\n } else {\n resolve({\n data,\n response: xhr\n })\n }\n }\n\n function onerror () {\n finish(xhr.status === 200 ? new Error('Inexplicable XHR Error') : new HTTPStatusError(uri, xhr.status, method))\n }\n\n function onabort () {\n finish(new AbortError())\n try {\n xhr.abort()\n } catch (e) { }\n }\n })\n}\n\nexport function request (url, method, packet, timeout, abortSignal) {\n return requestRaw(url, method, packet, timeout, abortSignal)\n}\n\nexport function processResolvers (resolvers) {\n return resolvers.filter(resolver => resolver.cors || resolver.endpoint.cors)\n}\n","import * as packet from '@leichtgewicht/dns-packet'\nimport { toRcode } from '@leichtgewicht/dns-packet/rcodes.js'\nimport { decode } from 'utf8-codec'\nimport * as lib from './lib.mjs'\nimport { resolvers as backupResolvers } from './resolvers.mjs'\nimport {\n AbortError,\n ResponseError,\n URL,\n toEndpoint\n} from './common.mjs'\n\nexport {\n TimeoutError,\n HTTPStatusError,\n AbortError,\n ResponseError,\n BaseEndpoint,\n HTTPEndpoint,\n UDP4Endpoint,\n UDP6Endpoint,\n parseEndpoint,\n toEndpoint\n} from './common.mjs'\n\nexport const DNS_RCODE_ERROR = {\n 1: 'FormErr',\n 2: 'ServFail',\n 3: 'NXDomain',\n 4: 'NotImp',\n 5: 'Refused',\n 6: 'YXDomain',\n 7: 'YXRRSet',\n 8: 'NXRRSet',\n 9: 'NotAuth',\n 10: 'NotZone',\n 11: 'DSOTYPENI'\n}\n\nexport const DNS_RCODE_MESSAGE = {\n // https://www.iana.org/assignments/dns-parameters/dns-parameters.xhtml#dns-parameters-6\n 1: 'The name server was unable to interpret the query.',\n 2: 'The name server was unable to process this query due to a problem with the name server.',\n 3: 'Non-Existent Domain.',\n 4: 'The name server does not support the requested kind of query.',\n 5: 'The name server refuses to perform the specified operation for policy reasons.',\n 6: 'Name Exists when it should not.',\n 7: 'RR Set Exists when it should not.',\n 8: 'RR Set that should exist does not.',\n 9: 'Server Not Authoritative for zone / Not Authorized.',\n 10: 'Name not contained in zone.',\n 11: 'DSO-TYPE Not Implemented.'\n}\n\nexport class DNSRcodeError extends Error {\n constructor (rcode, question) {\n super(`${(DNS_RCODE_MESSAGE[rcode] || 'Undefined error.')} (rcode=${rcode}${DNS_RCODE_ERROR[rcode] ? `, error=${DNS_RCODE_ERROR[rcode]}` : ''}, question=${JSON.stringify(question)})`)\n this.rcode = rcode\n this.code = `DNS_RCODE_${rcode}`\n this.error = DNS_RCODE_ERROR[rcode]\n this.question = question\n }\n\n toJSON () {\n return {\n code: this.code,\n error: this.error,\n question: this.question,\n endpoint: this.endpoint\n }\n }\n}\n\nexport function validateResponse (data, question) {\n const rcode = toRcode(data.rcode)\n if (rcode !== 0) {\n const err = new DNSRcodeError(rcode, question)\n err.endpoint = data.endpoint\n throw err\n }\n return data\n}\n\nfunction processResolvers (res) {\n const time = (res.time === null || res.time === undefined) ? Date.now() : res.time\n const resolvers = lib.processResolvers(res.data.map(resolver => {\n resolver.endpoint = toEndpoint(Object.assign({ name: resolver.name }, resolver.endpoint))\n return resolver\n }))\n const endpoints = resolvers.map(resolver => resolver.endpoint)\n return {\n data: {\n resolvers,\n resolverByName: resolvers.reduce((byName, resolver) => {\n byName[resolver.name] = resolver\n return byName\n }, {}),\n endpoints,\n endpointByName: endpoints.reduce((byName, endpoint) => {\n byName[endpoint.name] = endpoint\n return byName\n }, {})\n },\n time\n }\n}\n\nexport const backup = processResolvers(backupResolvers)\n\nfunction toMultiQuery (singleQuery) {\n const query = Object.assign({\n type: 'query'\n }, singleQuery)\n delete query.question\n query.questions = []\n if (singleQuery.question) {\n query.questions.push(singleQuery.question)\n }\n return query\n}\n\nfunction queryOne (endpoint, query, timeout, abortSignal) {\n if (abortSignal && abortSignal.aborted) {\n return Promise.reject(new AbortError())\n }\n if (endpoint.protocol === 'udp4:' || endpoint.protocol === 'udp6:') {\n return lib.queryDns(endpoint, query, timeout, abortSignal)\n }\n return queryDoh(endpoint, query, timeout, abortSignal)\n}\n\nfunction queryDoh (endpoint, query, timeout, abortSignal) {\n return lib.request(\n endpoint.url,\n endpoint.method,\n packet.encode(Object.assign({\n flags: packet.RECURSION_DESIRED\n }, query)),\n timeout,\n abortSignal\n ).then(\n function (res) {\n const data = res.data\n const response = res.response\n let error = res.error\n if (error === undefined) {\n if (data.length === 0) {\n error = new ResponseError('Empty.')\n } else {\n try {\n const decoded = packet.decode(data)\n decoded.response = response\n return decoded\n } catch (err) {\n error = new ResponseError('Invalid packet (cause=' + err.message + ')', err)\n }\n }\n }\n throw Object.assign(error, { response })\n }\n )\n}\n\nconst UPDATE_URL = new URL('https://martinheidegger.github.io/dns-query/resolvers.json')\n\nfunction concatUint8 (arrs) {\n const res = new Uint8Array(\n arrs.reduce((len, arr) => len + arr.length, 0)\n )\n let pos = 0\n for (const arr of arrs) {\n res.set(arr, pos)\n pos += arr.length\n }\n return res\n}\n\nexport function combineTXT (inputs) {\n return decode(concatUint8(inputs))\n}\n\nfunction isNameString (entry) {\n return /^@/.test(entry)\n}\n\nexport class Wellknown {\n constructor (opts) {\n this.opts = Object.assign({\n timeout: 5000,\n update: true,\n updateURL: UPDATE_URL,\n persist: false,\n localStoragePrefix: 'dnsquery_',\n maxAge: 300000 // 5 minutes\n }, opts)\n this._dataP = null\n }\n\n _data (force, outdated) {\n if (!force && this._dataP !== null) {\n return this._dataP.then(res => {\n if (res.time < Date.now() - this.opts.maxAge) {\n return this._data(true, res)\n }\n return res\n })\n }\n this._dataP = (!this.opts.update\n ? Promise.resolve(backup)\n : lib.loadJSON(\n this.opts.updateURL,\n this.opts.persist\n ? {\n name: 'resolvers.json',\n localStoragePrefix: this.opts.localStoragePrefix,\n maxTime: Date.now() - this.opts.maxAge\n }\n : null,\n this.opts.timeout\n )\n .then(res => processResolvers({\n data: res.data.resolvers,\n time: res.time\n }))\n .catch(() => outdated || backup)\n )\n return this._dataP\n }\n\n data () {\n return this._data(false).then(data => data.data)\n }\n\n endpoints (input) {\n if (input === null || input === undefined) {\n return this.data().then(data => data.endpoints)\n }\n if (input === 'doh') {\n input = filterDoh\n }\n if (input === 'dns') {\n input = filterDns\n }\n if (typeof input === 'function') {\n return this.data().then(data => data.endpoints.filter(input))\n }\n if (typeof input === 'string' || typeof input[Symbol.iterator] !== 'function') {\n return Promise.reject(new Error(`Endpoints (${input}) needs to be iterable (array).`))\n }\n input = Array.from(input).filter(Boolean)\n if (input.findIndex(isNameString) === -1) {\n try {\n return Promise.resolve(input.map(toEndpoint))\n } catch (err) {\n return Promise.reject(err)\n }\n }\n return this.data().then(data =>\n input.map(entry => {\n if (isNameString(entry)) {\n const found = data.endpointByName[entry.substring(1)]\n if (!found) {\n throw new Error(`Endpoint ${entry} is not known.`)\n }\n return found\n }\n return toEndpoint(entry)\n })\n )\n }\n}\n\nexport const wellknown = new Wellknown()\n\nfunction isPromise (input) {\n if (input === null) {\n return false\n }\n if (typeof input !== 'object') {\n return false\n }\n return typeof input.then === 'function'\n}\n\nfunction toPromise (input) {\n return isPromise(input) ? input : Promise.resolve(input)\n}\n\nexport function query (q, opts) {\n opts = Object.assign({\n retries: 5,\n timeout: 30000 // 30 seconds\n }, opts)\n if (!q.question) return Promise.reject(new Error('To request data you need to specify a .question!'))\n return toPromise(opts.endpoints)\n .then(endpoints => {\n if (!Array.isArray(endpoints) || endpoints.length === 0) {\n throw new Error('No endpoints defined to lookup dns records.')\n }\n return queryN(endpoints.map(toEndpoint), toMultiQuery(q), opts)\n })\n .then(data => {\n data.question = data.questions[0]\n delete data.questions\n return data\n })\n}\n\nexport function lookupTxt (domain, opts) {\n const q = Object.assign({\n question: {\n type: 'TXT',\n name: domain\n }\n }, opts.query)\n return query(q, opts)\n .then(data => {\n validateResponse(data, q)\n return {\n entries: (data.answers || [])\n .filter(answer => answer.type === 'TXT' && answer.data)\n .map(answer => {\n return ({\n data: combineTXT(answer.data),\n ttl: answer.ttl\n })\n })\n .sort((a, b) => {\n if (a.data > b.data) return 1\n if (a.data < b.data) return -1\n return 0\n }),\n endpoint: data.endpoint\n }\n })\n}\n\nfunction queryN (endpoints, q, opts) {\n const endpoint = endpoints.length === 1\n ? endpoints[0]\n : endpoints[Math.floor(Math.random() * endpoints.length) % endpoints.length]\n return queryOne(endpoint, q, opts.timeout, opts.signal)\n .then(\n data => {\n // Add the endpoint to give a chance to identify which endpoint returned the result\n data.endpoint = endpoint.toString()\n return data\n },\n err => {\n if (err.name === 'AbortError' || opts.retries === 0) {\n err.endpoint = endpoint.toString()\n throw err\n }\n if (opts.retries > 0) {\n opts.retries -= 1\n }\n return queryN(endpoints, q, opts)\n }\n )\n}\n\nfunction filterDoh (endpoint) {\n return endpoint.protocol === 'https:' || endpoint.protocol === 'http:'\n}\n\nfunction filterDns (endpoint) {\n return endpoint.protocol === 'udp4:' || endpoint.protocol === 'udp6:'\n}\n","export const resolvers = {\n data: [\n {\n name: 'adfree.usableprivacy.net',\n endpoint: {\n protocol: 'https:',\n host: 'adfree.usableprivacy.net'\n },\n description: 'Public updns DoH service with advertising, tracker and malware filters.\\nHosted in Europe by @usableprivacy, details see: https://docs.usableprivacy.com',\n country: 'Germany',\n location: {\n lat: 51.2993,\n long: 9.491\n },\n filter: true\n },\n {\n name: 'adguard-dns-doh',\n endpoint: {\n protocol: 'https:',\n host: 'dns.adguard.com',\n ipv4: '94.140.15.15'\n },\n description: 'Remove ads and protect your computer from malware (over DoH)',\n country: 'France',\n location: {\n lat: 48.8582,\n long: 2.3387\n },\n filter: true\n },\n {\n name: 'adguard-dns-family-doh',\n endpoint: {\n protocol: 'https:',\n host: 'dns-family.adguard.com',\n ipv4: '94.140.15.16'\n },\n description: 'Adguard DNS with safesearch and adult content blocking (over DoH)',\n country: 'France',\n location: {\n lat: 48.8582,\n long: 2.3387\n },\n filter: true\n },\n {\n name: 'adguard-dns-unfiltered-doh',\n endpoint: {\n protocol: 'https:',\n host: 'dns-unfiltered.adguard.com',\n ipv4: '94.140.14.140'\n },\n description: 'AdGuard public DNS servers without filters (over DoH)',\n country: 'France',\n location: {\n lat: 48.8582,\n long: 2.3387\n }\n },\n {\n name: 'ahadns-doh-chi',\n endpoint: {\n protocol: 'https:',\n host: 'doh.chi.ahadns.net',\n cors: true\n },\n description: 'A zero logging DNS with support for DNS-over-HTTPS (DoH) & DNS-over-TLS (DoT). Blocks ads, malware, trackers, viruses, ransomware, telemetry and more. No persistent logs. DNSSEC. Hosted in Chicago, USA. By https://ahadns.com/\\nServer statistics can be seen at: https://statistics.ahadns.com/?server=chi',\n country: 'United States',\n location: {\n lat: 41.8483,\n long: -87.6517\n },\n filter: true,\n cors: true\n },\n {\n name: 'ahadns-doh-in',\n endpoint: {\n protocol: 'https:',\n host: 'doh.in.ahadns.net',\n cors: true\n },\n description: 'A zero logging DNS with support for DNS-over-HTTPS (DoH) & DNS-over-TLS (DoT). Blocks ads, malware, trackers, viruses, ransomware, telemetry and more. No persistent logs. DNSSEC. Hosted in Mumbai, India. By https://ahadns.com/\\nServer statistics can be seen at: https://statistics.ahadns.com/?server=in',\n country: 'India',\n location: {\n lat: 19.0748,\n long: 72.8856\n },\n filter: true,\n cors: true\n },\n {\n name: 'ahadns-doh-la',\n endpoint: {\n protocol: 'https:',\n host: 'doh.la.ahadns.net',\n cors: true\n },\n description: 'A zero logging DNS with support for DNS-over-HTTPS (DoH) & DNS-over-TLS (DoT). Blocks ads, malware, trackers, viruses, ransomware, telemetry and more. No persistent logs. DNSSEC. Hosted in Los Angeles, USA. By https://ahadns.com/\\nServer statistics can be seen at: https://statistics.ahadns.com/?server=la',\n country: 'United States',\n location: {\n lat: 34.0549,\n long: -118.2578\n },\n filter: true,\n cors: true\n },\n {\n name: 'ahadns-doh-nl',\n endpoint: {\n protocol: 'https:',\n host: 'doh.nl.ahadns.net',\n cors: true\n },\n description: 'A zero logging DNS with support for DNS-over-HTTPS (DoH) & DNS-over-TLS (DoT). Blocks ads, malware, trackers, viruses, ransomware, telemetry and more. No persistent logs. DNSSEC. Hosted in Amsterdam, Netherlands. By https://ahadns.com/\\nServer statistics can be seen at: https://statistics.ahadns.com/?server=nl',\n country: 'Netherlands',\n location: {\n lat: 52.3824,\n long: 4.8995\n },\n filter: true,\n cors: true\n },\n {\n name: 'ahadns-doh-ny',\n endpoint: {\n protocol: 'https:',\n host: 'doh.ny.ahadns.net',\n cors: true\n },\n description: 'A zero logging DNS with support for DNS-over-HTTPS (DoH) & DNS-over-TLS (DoT). Blocks ads, malware, trackers, viruses, ransomware, telemetry and more. No persistent logs. DNSSEC. Hosted in New York. By https://ahadns.com/\\nServer statistics can be seen at: https://statistics.ahadns.com/?server=ny',\n country: 'United States',\n location: {\n lat: 40.7308,\n long: -73.9975\n },\n filter: true,\n cors: true\n },\n {\n name: 'ahadns-doh-pl',\n endpoint: {\n protocol: 'https:',\n host: 'doh.pl.ahadns.net',\n cors: true\n },\n description: 'A zero logging DNS with support for DNS-over-HTTPS (DoH) & DNS-over-TLS (DoT). Blocks ads, malware, trackers, viruses, ransomware, telemetry and more. No persistent logs. DNSSEC. Hosted in Poland. By https://ahadns.com/\\nServer statistics can be seen at: https://statistics.ahadns.com/?server=pl',\n country: 'Netherlands',\n location: {\n lat: 52.3824,\n long: 4.8995\n },\n filter: true,\n cors: true\n },\n {\n name: 'alidns-doh',\n endpoint: {\n protocol: 'https:',\n host: 'dns.alidns.com',\n ipv4: '223.5.5.5',\n cors: true\n },\n description: 'A public DNS resolver that supports DoH/DoT in mainland China, provided by Alibaba-Cloud.\\nWarning: GFW filtering rules are applied by that resolver.\\nHomepage: https://alidns.com/',\n country: 'China',\n location: {\n lat: 34.7725,\n long: 113.7266\n },\n filter: true,\n log: true,\n cors: true\n },\n {\n name: 'ams-ads-doh-nl',\n endpoint: {\n protocol: 'https:',\n host: 'dnsnl-noads.alekberg.net'\n },\n description: 'Resolver in Amsterdam. DoH protocol. Non-logging. Blocks ads, malware and trackers. DNSSEC enabled.',\n country: 'Romania',\n location: {\n lat: 45.9968,\n long: 24.997\n },\n filter: true\n },\n {\n name: 'ams-doh-nl',\n endpoint: {\n protocol: 'https:',\n host: 'dnsnl.alekberg.net'\n },\n description: 'Resolver in Amsterdam. DoH protocol. Non-logging, non-filtering, DNSSEC.',\n country: 'Romania',\n location: {\n lat: 45.9968,\n long: 24.997\n }\n },\n {\n name: 'att',\n endpoint: {\n protocol: 'https:',\n host: 'dohtrial.att.net'\n },\n description: 'AT&T test DoH server.',\n log: true\n },\n {\n name: 'bcn-ads-doh',\n endpoint: {\n protocol: 'https:',\n host: 'dnses-noads.alekberg.net'\n },\n description: 'Resolver in Spain. DoH protocol. Non-logging, remove ads and malware, DNSSEC.',\n country: 'Spain',\n location: {\n lat: 41.3891,\n long: 2.1611\n },\n filter: true\n },\n {\n name: 'bcn-doh',\n endpoint: {\n protocol: 'https:',\n host: 'dnses.alekberg.net'\n },\n description: 'Resolver in Spain. DoH protocol. Non-logging, non-filtering, DNSSEC.',\n country: 'Spain',\n location: {\n lat: 41.3891,\n long: 2.1611\n }\n },\n {\n name: 'brahma-world',\n endpoint: {\n protocol: 'https:',\n host: 'dns.brahma.world'\n },\n description: 'DNS-over-HTTPS server. Non Logging, filters ads, trackers and malware. DNSSEC ready, QNAME Minimization, No EDNS Client-Subnet.\\nHosted in Stockholm, Sweden. (https://dns.brahma.world)',\n country: 'United States',\n location: {\n lat: 37.751,\n long: -97.822\n },\n filter: true\n },\n {\n name: 'cisco-doh',\n endpoint: {\n protocol: 'https:',\n host: 'doh.opendns.com',\n ipv4: '146.112.41.2'\n },\n description: 'Remove your DNS blind spot (DoH protocol)\\nWarning: modifies your queries to include a copy of your network\\naddress when forwarding them to a selection of companies and organizations.',\n country: 'United States',\n location: {\n lat: 37.751,\n long: -97.822\n },\n filter: true,\n log: true\n },\n {\n name: 'cloudflare',\n endpoint: {\n protocol: 'https:',\n host: 'dns.cloudflare.com',\n ipv4: '1.0.0.1',\n cors: true\n },\n description: 'Cloudflare DNS (anycast) - aka 1.1.1.1 / 1.0.0.1',\n country: 'Australia',\n location: {\n lat: -33.494,\n long: 143.2104\n },\n cors: true\n },\n {\n name: 'cloudflare-family',\n endpoint: {\n protocol: 'https:',\n host: 'family.cloudflare-dns.com',\n ipv4: '1.0.0.3',\n cors: true\n },\n description: 'Cloudflare DNS (anycast) with malware protection and parental control - aka 1.1.1.3 / 1.0.0.3',\n country: 'Australia',\n location: {\n lat: -33.494,\n long: 143.2104\n },\n filter: true,\n cors: true\n },\n {\n name: 'cloudflare-ipv6',\n endpoint: {\n protocol: 'https:',\n host: '1dot1dot1dot1.cloudflare-dns.com',\n cors: true\n },\n description: 'Cloudflare DNS over IPv6 (anycast)',\n country: 'United States',\n location: {\n lat: 37.751,\n long: -97.822\n },\n cors: true\n },\n {\n name: 'cloudflare-security',\n endpoint: {\n protocol: 'https:',\n host: 'security.cloudflare-dns.com',\n ipv4: '1.0.0.2',\n cors: true\n },\n description: 'Cloudflare DNS (anycast) with malware blocking - aka 1.1.1.2 / 1.0.0.2',\n country: 'Australia',\n location: {\n lat: -33.494,\n long: 143.2104\n },\n filter: true,\n cors: true\n },\n {\n name: 'controld-block-malware',\n endpoint: {\n protocol: 'https:',\n host: 'freedns.controld.com',\n path: '/p1'\n },\n description: 'ControlD Free DNS. Take CONTROL of your Internet. Block unwanted content, bypass geo-restrictions and be more productive. DoH protocol and No logging. - https://controld.com/free-dns\\nThis DNS blocks Malware domains.',\n country: 'Canada',\n location: {\n lat: 43.6319,\n long: -79.3716\n },\n filter: true\n },\n {\n name: 'controld-block-malware-ad',\n endpoint: {\n protocol: 'https:',\n host: 'freedns.controld.com',\n path: '/p2'\n },\n description: 'ControlD Free DNS. Take CONTROL of your Internet. Block unwanted content, bypass geo-restrictions and be more productive. DoH protocol and No logging. - https://controld.com/free-dns\\nThis DNS blocks Malware, Ads & Tracking domains.',\n country: 'Canada',\n location: {\n lat: 43.6319,\n long: -79.3716\n },\n filter: true\n },\n {\n name: 'controld-block-malware-ad-social',\n endpoint: {\n protocol: 'https:',\n host: 'freedns.controld.com',\n path: '/p3'\n },\n description: 'ControlD Free DNS. Take CONTROL of your Internet. Block unwanted content, bypass geo-restrictions and be more productive. DoH protocol and No logging. - https://controld.com/free-dns\\nThis DNS blocks Malware, Ads & Tracking and Social Networks domains.',\n country: 'Canada',\n location: {\n lat: 43.6319,\n long: -79.3716\n },\n filter: true\n },\n {\n name: 'controld-family-friendly',\n endpoint: {\n protocol: 'https:',\n host: 'freedns.controld.com',\n path: '/family'\n },\n description: 'ControlD Free DNS. Take CONTROL of your Internet. Block unwanted content, bypass geo-restrictions and be more productive. DoH protocol and No logging. - https://controld.com/free-dns\\nThis DNS blocks Malware, Ads & Tracking, Adult Content and Drugs domains.',\n country: 'Canada',\n location: {\n lat: 43.6319,\n long: -79.3716\n },\n filter: true\n },\n {\n name: 'controld-uncensored',\n endpoint: {\n protocol: 'https:',\n host: 'freedns.controld.com',\n path: '/uncensored'\n },\n description: 'ControlD Free DNS. Take CONTROL of your Internet. Block unwanted content, bypass geo-restrictions and be more productive. DoH protocol and No logging. - https://controld.com/free-dns\\nThis DNS unblocks censored domains from various countries.',\n country: 'Canada',\n location: {\n lat: 43.6319,\n long: -79.3716\n }\n },\n {\n name: 'controld-unfiltered',\n endpoint: {\n protocol: 'https:',\n host: 'freedns.controld.com',\n path: '/p0'\n },\n description: 'ControlD Free DNS. Take CONTROL of your Internet. Block unwanted content, bypass geo-restrictions and be more productive. DoH protocol and No logging. - https://controld.com/free-dns\\nThis is a Unfiltered DNS, no DNS record blocking or manipulation here, if you want to block Malware, Ads & Tracking or Social Network domains, use the other ControlD DNS configs.',\n country: 'Canada',\n location: {\n lat: 43.6319,\n long: -79.3716\n }\n },\n {\n name: 'dns.digitale-gesellschaft.ch',\n endpoint: {\n protocol: 'https:',\n host: 'dns.digitale-gesellschaft.ch'\n },\n description: 'Public DoH resolver operated by the Digital Society (https://www.digitale-gesellschaft.ch).\\nHosted in Zurich, Switzerland.\\nNon-logging, non-filtering, supports DNSSEC.',\n country: 'Switzerland',\n location: {\n lat: 47.1449,\n long: 8.1551\n }\n },\n {\n name: 'dns.ryan-palmer',\n endpoint: {\n protocol: 'https:',\n host: 'dns1.ryan-palmer.com'\n },\n description: 'Non-logging, non-filtering, DNSSEC DoH Server. Hosted in the UK.',\n country: 'United Kingdom',\n location: {\n lat: 51.5164,\n long: -0.093\n }\n },\n {\n name: 'dns.sb',\n endpoint: {\n protocol: 'https:',\n host: 'doh.sb',\n ipv4: '185.222.222.222',\n cors: true\n },\n description: 'DNSSEC-enabled DoH server by https://xtom.com/\\nhttps://dns.sb/doh/',\n country: 'Unknown',\n location: {\n lat: 47,\n long: 8\n },\n cors: true\n },\n {\n name: 'dns.therifleman.name',\n endpoint: {\n protocol: 'https:',\n host: 'dns.therifleman.name'\n },\n description: 'DNS-over-HTTPS DNS forwarder from Mumbai, India. Blocks web and Android trackers and ads.\\nIP addresses are not logged, but queries are logged for 24 hours for debugging.\\nReport issues, send suggestions @ joker349 at protonmail.com.\\nAlso supports DoT (for android) @ dns.therifleman.name and plain DNS @ 172.104.206.174',\n country: 'United States',\n location: {\n lat: 37.751,\n long: -97.822\n },\n filter: true\n },\n {\n name: 'dnsforfamily-doh',\n endpoint: {\n protocol: 'https:',\n host: 'dns-doh.dnsforfamily.com'\n },\n description: '(DoH Protocol) (Now supports DNSSEC). Block adult websites, gambling websites, malwares and advertisements.\\nIt also enforces safe search in: Google, YouTube, Bing, DuckDuckGo and Yandex.\\nSocial websites like Facebook and Instagram are not blocked. No DNS queries are logged.\\nAs of 26-May-2022 5.9 million websites are blocked and new websites are added to blacklist daily.\\nCompletely free, no ads or any commercial motive. Operating for 4 years now.\\nProvided by: https://dnsforfamily.com',\n country: 'Finland',\n location: {\n lat: 60.1758,\n long: 24.9349\n },\n filter: true\n },\n {\n name: 'dnsforfamily-doh-no-safe-search',\n endpoint: {\n protocol: 'https:',\n host: 'dns-doh-no-safe-search.dnsforfamily.com'\n },\n description: '(DoH Protocol) (Now supports DNSSEC) Block adult websites, gambling websites, malwares and advertisements.\\nUnlike other dnsforfamily servers, this one does not enforces safe search. So Google, YouTube, Bing, DuckDuckGo and Yandex are completely accessible without any restriction.\\nSocial websites like Facebook and Instagram are not blocked. No DNS queries are logged.\\nAs of 26-May-2022 5.9 million websites are blocked and new websites are added to blacklist daily.\\nCompletely free, no ads or any commercial motive. Operating for 4 years now.\\nWarning: This server is incompatible with anonymization.\\nProvided by: https://dnsforfamily.com',\n country: 'Finland',\n location: {\n lat: 60.1758,\n long: 24.9349\n },\n filter: true\n },\n {\n name: 'dnsforge.de',\n endpoint: {\n protocol: 'https:',\n host: 'dnsforge.de',\n cors: true\n },\n description: 'Public DoH resolver running with Pihole for Adblocking (https://dnsforge.de).\\nNon-logging, AD-filtering, supports DNSSEC. Hosted in Germany.',\n country: 'Germany',\n location: {\n lat: 52.2998,\n long: 9.447\n },\n filter: true,\n cors: true\n },\n {\n name: 'dnshome-doh',\n endpoint: {\n protocol: 'https:',\n host: 'dns.dnshome.de'\n },\n description: 'https://www.dnshome.de/ public resolver in Germany'\n },\n {\n name: 'dnspod-doh',\n endpoint: {\n protocol: 'https:',\n host: 'doh.pub',\n cors: true\n },\n description: 'A public DNS resolver in mainland China provided by DNSPod (Tencent Cloud).\\nhttps://www.dnspod.cn/Products/Public.DNS?lang=en',\n filter: true,\n log: true,\n cors: true\n },\n {\n name: 'dnswarden-asia-adblock-dohv4',\n endpoint: {\n protocol: 'https:',\n host: 'doh.asia.dnswarden.com',\n path: '/adblock'\n },\n description: 'Hosted in Singapore. For more information look [here](https://github.com/bhanupratapys/dnswarden) or [here](https://dnswarden.com).',\n country: 'Singapore',\n location: {\n lat: 1.2929,\n long: 103.8547\n },\n filter: true\n },\n {\n name: 'dnswarden-asia-adultfilter-dohv4',\n endpoint: {\n protocol: 'https:',\n host: 'doh.asia.dnswarden.com',\n path: '/adultfilter'\n },\n description: 'Hosted in Singapore. For more information look [here](https://github.com/bhanupratapys/dnswarden) or [here](https://dnswarden.com).',\n country: 'Singapore',\n location: {\n lat: 1.2929,\n long: 103.8547\n },\n filter: true\n },\n {\n name: 'dnswarden-asia-uncensor-dohv4',\n endpoint: {\n protocol: 'https:',\n host: 'doh.asia.dnswarden.com',\n path: '/uncensored'\n },\n description: 'Hosted in Singapore. For more information look [here](https://github.com/bhanupratapys/dnswarden) or [here](https://dnswarden.com).',\n country: 'Singapore',\n location: {\n lat: 1.2929,\n long: 103.8547\n }\n },\n {\n name: 'dnswarden-eu-adblock-dohv4',\n endpoint: {\n protocol: 'https:',\n host: 'doh.eu.dnswarden.com'\n },\n description: 'Hosted in Germany. For more information look [here](https://github.com/bhanupratapys/dnswarden) or [here](https://dnswarden.com).',\n country: 'Germany',\n location: {\n lat: 50.1103,\n long: 8.7147\n },\n filter: true\n },\n {\n name: 'dnswarden-us-adblock-dohv4',\n endpoint: {\n protocol: 'https:',\n host: 'doh.us.dnswarden.com'\n },\n description: 'Hosted in USA (Dallas) . For more information look [here](https://github.com/bhanupratapys/dnswarden) or [here](https://dnswarden.com).',\n country: 'United States',\n location: {\n lat: 32.7889,\n long: -96.8021\n },\n filter: true\n },\n {\n name: 'doh-ch-blahdns',\n endpoint: {\n protocol: 'https:',\n host: 'doh-ch.blahdns.com',\n cors: true\n },\n description: 'Blocks ad and Tracking, no Logging, DNSSEC, Hosted in Switzerland. By https://blahdns.com/',\n country: 'Netherlands',\n location: {\n lat: 52.3824,\n long: 4.8995\n },\n filter: true,\n cors: true\n },\n {\n name: 'doh-cleanbrowsing-adult',\n endpoint: {\n protocol: 'https:',\n host: 'doh.cleanbrowsing.org',\n path: '/doh/adult-filter/',\n cors: true\n },\n description: 'Blocks access to all adult, pornographic and explicit sites. It does\\nnot block proxy or VPNs, nor mixed-content sites. Sites like Reddit\\nare allowed. Google and Bing are set to the Safe Mode.\\nBy https://cleanbrowsing.org/',\n filter: true,\n cors: true\n },\n {\n name: 'doh-cleanbrowsing-family',\n endpoint: {\n protocol: 'https:',\n host: 'doh.cleanbrowsing.org',\n path: '/doh/family-filter/',\n cors: true\n },\n description: 'Blocks access to all adult, pornographic and explicit sites. It also\\nblocks proxy and VPN domains that are used to bypass the filters.\\nMixed content sites (like Reddit) are also blocked. Google, Bing and\\nYoutube are set to the Safe Mode.\\nBy https://cleanbrowsing.org/',\n filter: true,\n cors: true\n },\n {\n name: 'doh-cleanbrowsing-security',\n endpoint: {\n protocol: 'https:',\n host: 'doh.cleanbrowsing.org',\n path: '/doh/security-filter/',\n cors: true\n },\n description: 'Block access to phishing, malware and malicious domains. It does not block adult content.\\nBy https://cleanbrowsing.org/',\n filter: true,\n cors: true\n },\n {\n name: 'doh-crypto-sx',\n endpoint: {\n protocol: 'https:',\n host: 'doh.crypto.sx',\n cors: true\n },\n description: 'DNS-over-HTTPS server. Anycast, no logs, no censorship, DNSSEC.\\nBackend hosted by Scaleway, globally cached via Cloudflare.\\nMaintained by Frank Denis.',\n country: 'United States',\n location: {\n lat: 37.751,\n long: -97.822\n },\n cors: true\n },\n {\n name: 'doh-crypto-sx-ipv6',\n endpoint: {\n protocol: 'https:',\n host: 'doh-ipv6.crypto.sx',\n cors: true\n },\n description: 'DNS-over-HTTPS server accessible over IPv6. Anycast, no logs, no censorship, DNSSEC.\\nBackend hosted by Scaleway, globally cached via Cloudflare.\\nMaintained by Frank Denis.',\n country: 'United States',\n location: {\n lat: 37.751,\n long: -97.822\n },\n cors: true\n },\n {\n name: 'doh-de-blahdns',\n endpoint: {\n protocol: 'https:',\n host: 'doh-de.blahdns.com',\n cors: true\n },\n description: 'Blocks ad and Tracking, no Logging, DNSSEC, Hosted in Germany. By https://blahdns.com/',\n country: 'Germany',\n location: {\n lat: 51.2993,\n long: 9.491\n },\n filter: true,\n cors: true\n },\n {\n name: 'doh-fi-blahdns',\n endpoint: {\n protocol: 'https:',\n host: 'doh-fi.blahdns.com',\n cors: true\n },\n description: 'Blocks ad and Tracking, no Logging, DNSSEC, Hosted in Finland. By https://blahdns.com/',\n country: 'Finland',\n location: {\n lat: 60.1758,\n long: 24.9349\n },\n filter: true,\n cors: true\n },\n {\n name: 'doh-ibksturm',\n endpoint: {\n protocol: 'https:',\n host: 'ibksturm.synology.me'\n },\n description: 'DoH & DoT Server, No Logging, No Filters, DNSSEC\\nRunning privately by ibksturm in Thurgau, Switzerland'\n },\n {\n name: 'doh-jp-blahdns',\n endpoint: {\n protocol: 'https:',\n host: 'doh-jp.blahdns.com',\n cors: true\n },\n description: 'Blocks ad and Tracking, no Logging, DNSSEC, Hosted in Japan. By https://blahdns.com/',\n country: 'Japan',\n location: {\n lat: 35.6882,\n long: 139.7532\n },\n filter: true,\n cors: true\n },\n {\n name: 'doh.ffmuc.net',\n endpoint: {\n protocol: 'https:',\n host: 'doh.ffmuc.net'\n },\n description: 'An open (non-logging, non-filtering, non-censoring) DoH resolver operated by Freifunk Munich with nodes in DE.\\nhttps://ffmuc.net/',\n country: 'Germany',\n location: {\n lat: 51.2993,\n long: 9.491\n }\n },\n {\n name: 'doh.tiarap.org',\n endpoint: {\n protocol: 'https:',\n host: 'doh.tiarap.org'\n },\n description: 'Non-Logging DNS-over-HTTPS server, cached via Cloudflare.\\nFilters out ads, trackers and malware, NO ECS, supports DNSSEC.',\n country: 'United States',\n location: {\n lat: 37.751,\n long: -97.822\n },\n filter: true\n },\n {\n name: 'google',\n endpoint: {\n protocol: 'https:',\n host: 'dns.google',\n ipv4: '8.8.8.8',\n cors: true\n },\n description: 'Google DNS (anycast)',\n country: 'United States',\n location: {\n lat: 37.751,\n long: -97.822\n },\n log: true,\n cors: true\n },\n {\n name: 'hdns',\n endpoint: {\n protocol: 'https:',\n host: 'query.hdns.io',\n cors: true\n },\n description: 'HDNS is a public DNS resolver that supports Handshake domains.\\nhttps://www.hdns.io',\n country: 'United States',\n location: {\n lat: 37.7771,\n long: -122.406\n },\n cors: true\n },\n {\n name: 'he',\n endpoint: {\n protocol: 'https:',\n host: 'ordns.he.net'\n },\n description: 'Hurricane Electric DoH server (anycast)\\nUnknown logging policy.',\n country: 'United States',\n location: {\n lat: 37.751,\n long: -97.822\n },\n log: true\n },\n {\n name: 'id-gmail-doh',\n endpoint: {\n protocol: 'https:',\n host: 'doh.tiar.app'\n },\n description: 'Non-Logging DNS-over-HTTPS server located in Singapore.\\nFilters out ads, trackers and malware, supports DNSSEC, provided by id-gmail.',\n country: 'Singapore',\n location: {\n lat: 1.2929,\n long: 103.8547\n },\n filter: true\n },\n {\n name: 'iij',\n endpoint: {\n protocol: 'https:',\n host: 'public.dns.iij.jp'\n },\n description: 'DoH server operated by Internet Initiative Japan in Tokyo.\\nhttps://www.iij.ad.jp/',\n country: 'Japan',\n location: {\n lat: 35.69,\n long: 139.69\n },\n log: true\n },\n {\n name: 'iqdns-doh',\n endpoint: {\n protocol: 'https:',\n host: 'a.passcloud.xyz'\n },\n description: 'Non-logging DoH service runned by V2EX.com user johnsonwil.\\nReturns \"no such domain\" for anti-Chinese government websites. Supports DNSSEC.\\nFor more information: https://www.v2ex.com/t/785666',\n filter: true\n },\n {\n name: 'jp.tiar.app-doh',\n endpoint: {\n protocol: 'https:',\n host: 'jp.tiar.app'\n },\n description: 'Non-Logging, Non-Filtering DNS-over-HTTPS server in Japan.\\nNo ECS, Support DNSSEC',\n country: 'Japan',\n location: {\n lat: 35.6882,\n long: 139.7532\n }\n },\n {\n name: 'jp.tiarap.org',\n endpoint: {\n protocol: 'https:',\n host: 'jp.tiarap.org'\n },\n description: 'DNS-over-HTTPS Server. Non-Logging, Non-Filtering, No ECS, Support DNSSEC.\\nCached via Cloudflare.'\n },\n {\n name: 'libredns',\n endpoint: {\n protocol: 'https:',\n host: 'doh.libredns.gr'\n },\n description: 'DoH server in Germany. No logging, but no DNS padding and no DNSSEC support.\\nhttps://libredns.gr/',\n country: 'Germany',\n location: {\n lat: 51.2993,\n long: 9.491\n }\n },\n {\n name: 'nextdns',\n endpoint: {\n protocol: 'https:',\n host: 'anycsast.dns.nextdns.io'\n },\n description: 'NextDNS is a cloud-based private DNS service that gives you full control\\nover what is allowed and what is blocked on the Internet.\\nDNSSEC, Anycast, Non-logging, NoFilters\\nhttps://www.nextdns.io/',\n country: 'Netherlands',\n location: {\n lat: 52.3891,\n long: 4.6563\n }\n },\n {\n name: 'nextdns-ultralow',\n endpoint: {\n protocol: 'https:',\n host: 'dns.nextdns.io',\n path: '/dnscrypt-proxy'\n },\n description: 'NextDNS is a cloud-based private DNS service that gives you full control\\nover what is allowed and what is blocked on the Internet.\\nhttps://www.nextdns.io/\\nTo select the server location, the \"-ultralow\" variant relies on bootstrap servers\\ninstead of anycast.'\n },\n {\n name: 'njalla-doh',\n endpoint: {\n protocol: 'https:',\n host: 'dns.njal.la',\n cors: true\n },\n description: 'Non-logging DoH server in Sweden operated by Njalla.\\nhttps://dns.njal.la/',\n country: 'Sweden',\n location: {\n lat: 59.3247,\n long: 18.056\n },\n cors: true\n },\n {\n name: 'odoh-cloudflare',\n endpoint: {\n protocol: 'https:',\n host: 'odoh.cloudflare-dns.com',\n cors: true\n },\n description: 'Cloudflare ODoH server.\\nhttps://cloudflare.com',\n cors: true\n },\n {\n name: 'odoh-crypto-sx',\n endpoint: {\n protocol: 'https:',\n host: 'odoh.crypto.sx',\n cors: true\n },\n description: 'ODoH target server. Anycast, no logs.\\nBackend hosted by Scaleway. Maintained by Frank Denis.',\n cors: true\n },\n {\n name: 'odoh-id-gmail',\n endpoint: {\n protocol: 'https:',\n host: 'doh.tiar.app',\n path: '/odoh'\n },\n description: 'ODoH target server. Based in Singapore, no logs.\\nFilter ads, trackers and malware.',\n filter: true\n },\n {\n name: 'odoh-jp.tiar.app',\n endpoint: {\n protocol: 'https:',\n host: 'jp.tiar.app',\n path: '/odoh'\n },\n description: 'ODoH target server. no logs.'\n },\n {\n name: 'odoh-jp.tiarap.org',\n endpoint: {\n protocol: 'https:',\n host: 'jp.tiarap.org',\n path: '/odoh'\n },\n description: 'ODoH target server via Cloudflare, no logs.'\n },\n {\n name: 'odoh-resolver4.dns.openinternet.io',\n endpoint: {\n protocol: 'https:',\n host: 'resolver4.dns.openinternet.io'\n },\n description: \"ODoH target server. no logs, no filter, DNSSEC.\\nRunning on dedicated hardware colocated at Sonic.net in Santa Rosa, CA in the United States.\\nUses Sonic's recusrive DNS servers as upstream resolvers (but is not affiliated with Sonic\\nin any way). Provided by https://openinternet.io\"\n },\n {\n name: 'odoh-tiarap.org',\n endpoint: {\n protocol: 'https:',\n host: 'doh.tiarap.org',\n path: '/odoh'\n },\n description: 'ODoH target server via Cloudflare, no logs.\\nFilter ads, trackers and malware.',\n filter: true\n },\n {\n name: 'publicarray-au2-doh',\n endpoint: {\n protocol: 'https:',\n host: 'doh-2.seby.io',\n cors: true\n },\n description: 'DNSSEC • OpenNIC • Non-logging • Uncensored - hosted on ovh.com.au\\nMaintained by publicarray - https://dns.seby.io',\n country: 'Australia',\n location: {\n lat: -33.8591,\n long: 151.2002\n },\n cors: true\n },\n {\n name: 'puredns-doh',\n endpoint: {\n protocol: 'https:',\n host: 'puredns.org',\n ipv4: '146.190.6.13',\n cors: true\n },\n description: 'Public uncensored DNS resolver in Singapore - https://puredns.org\\n** Only available in Indonesia and Singapore **',\n country: 'United States',\n location: {\n lat: 37.751,\n long: -97.822\n },\n cors: true\n },\n {\n name: 'quad101',\n endpoint: {\n protocol: 'https:',\n host: 'dns.twnic.tw',\n cors: true\n },\n description: 'DNSSEC-aware public resolver by the Taiwan Network Information Center (TWNIC)\\nhttps://101.101.101.101/index_en.html',\n cors: true\n },\n {\n name: 'quad9-doh-ip4-port443-filter-ecs-pri',\n endpoint: {\n protocol: 'https:',\n host: 'dns11.quad9.net',\n ipv4: '149.112.112.11'\n },\n description: 'Quad9 (anycast) dnssec/no-log/filter/ecs 9.9.9.11 - 149.112.112.11',\n country: 'United States',\n location: {\n lat: 37.751,\n long: -97.822\n },\n filter: true\n },\n {\n name: 'quad9-doh-ip4-port443-filter-pri',\n endpoint: {\n protocol: 'https:',\n host: 'dns.quad9.net',\n ipv4: '149.112.112.112'\n },\n description: 'Quad9 (anycast) dnssec/no-log/filter 9.9.9.9 - 149.112.112.9 - 149.112.112.112',\n country: 'United States',\n location: {\n lat: 37.751,\n long: -97.822\n },\n filter: true\n },\n {\n name: 'quad9-doh-ip4-port443-nofilter-ecs-pri',\n endpoint: {\n protocol: 'https:',\n host: 'dns12.quad9.net',\n ipv4: '9.9.9.12'\n },\n description: 'Quad9 (anycast) no-dnssec/no-log/no-filter/ecs 9.9.9.12 - 149.112.112.12',\n country: 'United States',\n location: {\n lat: 37.751,\n long: -97.822\n }\n },\n {\n name: 'quad9-doh-ip4-port443-nofilter-pri',\n endpoint: {\n protocol: 'https:',\n host: 'dns10.quad9.net',\n ipv4: '149.112.112.10'\n },\n description: 'Quad9 (anycast) no-dnssec/no-log/no-filter 9.9.9.10 - 149.112.112.10',\n country: 'United States',\n location: {\n lat: 37.751,\n long: -97.822\n }\n },\n {\n name: 'quad9-doh-ip6-port5053-filter-pri',\n endpoint: {\n protocol: 'https:',\n host: 'dns9.quad9.net'\n },\n description: 'Quad9 (anycast) dnssec/no-log/filter 2620:fe::fe - 2620:fe::9 - 2620:fe::fe:9',\n country: 'United States',\n location: {\n lat: 37.751,\n long: -97.822\n },\n filter: true\n },\n {\n name: 'safesurfer-doh',\n endpoint: {\n protocol: 'https:',\n host: 'doh.safesurfer.io'\n },\n description: 'Family safety focused blocklist for over 2 million adult sites, as well as phishing and malware and more.\\nFree to use, paid for customizing blocking for more categories+sites and viewing usage at my.safesurfer.io. Logs taken for viewing\\nusage, data never sold - https://safesurfer.io',\n filter: true,\n log: true\n },\n {\n name: 'sth-ads-doh-se',\n endpoint: {\n protocol: 'https:',\n host: 'dnsse-noads.alekberg.net'\n },\n description: 'Resolver in Stockholm, Sweden. DoH server. Non-logging, remove ads and malware, DNSSEC.',\n country: 'Bulgaria',\n location: {\n lat: 42.696,\n long: 23.332\n },\n filter: true\n },\n {\n name: 'sth-doh-se',\n endpoint: {\n protocol: 'https:',\n host: 'dnsse.alekberg.net'\n },\n description: 'Resolver in Stockholm, Sweden. DoH server. Non-logging, non-filtering, DNSSEC.',\n country: 'Bulgaria',\n location: {\n lat: 42.696,\n long: 23.332\n }\n },\n {\n name: 'switch',\n endpoint: {\n protocol: 'https:',\n host: 'dns.switch.ch'\n },\n description: 'Public DoH service provided by SWITCH in Switzerland\\nhttps://www.switch.ch\\nProvides protection against malware, but does not block ads.',\n filter: true\n },\n {\n name: 'uncensoreddns-dk-ipv4',\n endpoint: {\n protocol: 'https:',\n host: 'unicast.uncensoreddns.org'\n },\n description: 'Also known as censurfridns.\\nDoH, no logs, no filter, DNSSEC, unicast hosted in Denmark - https://blog.uncensoreddns.org',\n country: 'Denmark',\n location: {\n lat: 55.7123,\n long: 12.0564\n }\n },\n {\n name: 'uncensoreddns-ipv4',\n endpoint: {\n protocol: 'https:',\n host: 'anycast.uncensoreddns.org'\n },\n description: 'Also known as censurfridns.\\nDoH, no logs, no filter, DNSSEC, anycast - https://blog.uncensoreddns.org',\n country: 'Denmark',\n location: {\n lat: 55.7123,\n long: 12.0564\n }\n },\n {\n name: 'v.dnscrypt.uk-doh-ipv4',\n endpoint: {\n protocol: 'https:',\n host: 'v.dnscrypt.uk'\n },\n description: 'DoH, no logs, uncensored, DNSSEC. Hosted in London UK on Digital Ocean\\nhttps://www.dnscrypt.uk',\n country: 'United Kingdom',\n location: {\n lat: 51.4964,\n long: -0.1224\n }\n }\n ],\n time: 1654187067783\n}\n","import { Logger } from \"@waku/utils\";\nimport { bytesToUtf8 } from \"@waku/utils/bytes\";\nimport { query, wellknown } from \"dns-query\";\nconst log = new Logger(\"dns-over-https\");\nexport class DnsOverHttps {\n endpoints;\n retries;\n /**\n * Create new Dns-Over-Http DNS client.\n *\n * @param endpoints The endpoints for Dns-Over-Https queries;\n * Defaults to using dns-query's API..\n * @param retries Retries if a given endpoint fails.\n *\n * @throws {code: string} If DNS query fails.\n */\n static async create(endpoints, retries) {\n const _endpoints = endpoints ?? (await wellknown.endpoints(\"doh\"));\n return new DnsOverHttps(_endpoints, retries);\n }\n constructor(endpoints, retries = 3) {\n this.endpoints = endpoints;\n this.retries = retries;\n }\n /**\n * Resolves a TXT record\n *\n * @param domain The domain name\n *\n * @throws if the query fails\n */\n async resolveTXT(domain) {\n let answers;\n try {\n const res = await query({\n question: { type: \"TXT\", name: domain }\n }, {\n endpoints: this.endpoints,\n retries: this.retries\n });\n answers = res.answers;\n }\n catch (error) {\n log.error(\"query failed: \", error);\n throw new Error(\"DNS query failed\");\n }\n if (!answers)\n throw new Error(`Could not resolve ${domain}`);\n const data = answers.map((a) => a.data);\n const result = [];\n data.forEach((d) => {\n if (typeof d === \"string\") {\n result.push(d);\n }\n else if (Array.isArray(d)) {\n d.forEach((sd) => {\n if (typeof sd === \"string\") {\n result.push(sd);\n }\n else {\n result.push(bytesToUtf8(sd));\n }\n });\n }\n else {\n result.push(bytesToUtf8(d));\n }\n });\n return result;\n }\n}\n//# sourceMappingURL=dns_over_https.js.map","import { ENR } from \"@waku/enr\";\nimport { keccak256, verifySignature } from \"@waku/enr\";\nimport { utf8ToBytes } from \"@waku/utils/bytes\";\nimport base32 from \"hi-base32\";\nimport { fromString } from \"uint8arrays/from-string\";\nexport class ENRTree {\n static RECORD_PREFIX = ENR.RECORD_PREFIX;\n static TREE_PREFIX = \"enrtree:\";\n static BRANCH_PREFIX = \"enrtree-branch:\";\n static ROOT_PREFIX = \"enrtree-root:\";\n /**\n * Extracts the branch subdomain referenced by a DNS tree root string after verifying\n * the root record signature with its base32 compressed public key.\n */\n static parseAndVerifyRoot(root, publicKey) {\n if (!root.startsWith(this.ROOT_PREFIX))\n throw new Error(`ENRTree root entry must start with '${this.ROOT_PREFIX}'`);\n const rootValues = ENRTree.parseRootValues(root);\n const decodedPublicKey = base32.decode.asBytes(publicKey);\n // The signature is a 65-byte secp256k1 over the keccak256 hash\n // of the record content, excluding the `sig=` part, encoded as URL-safe base64 string\n // (Trailing recovery bit must be trimmed to pass `ecdsaVerify` method)\n const signedComponent = root.split(\" sig\")[0];\n const signedComponentBuffer = utf8ToBytes(signedComponent);\n const signatureBuffer = fromString(rootValues.signature, \"base64url\").slice(0, 64);\n const isVerified = verifySignature(signatureBuffer, keccak256(signedComponentBuffer), new Uint8Array(decodedPublicKey));\n if (!isVerified)\n throw new Error(\"Unable to verify ENRTree root signature\");\n return rootValues.eRoot;\n }\n static parseRootValues(txt) {\n const matches = txt.match(/^enrtree-root:v1 e=([^ ]+) l=([^ ]+) seq=(\\d+) sig=([^ ]+)$/);\n if (!Array.isArray(matches))\n throw new Error(\"Could not parse ENRTree root entry\");\n matches.shift(); // The first entry is the full match\n const [eRoot, lRoot, seq, signature] = matches;\n if (!eRoot)\n throw new Error(\"Could not parse 'e' value from ENRTree root entry\");\n if (!lRoot)\n throw new Error(\"Could not parse 'l' value from ENRTree root entry\");\n if (!seq)\n throw new Error(\"Could not parse 'seq' value from ENRTree root entry\");\n if (!signature)\n throw new Error(\"Could not parse 'sig' value from ENRTree root entry\");\n return { eRoot, lRoot, seq: Number(seq), signature };\n }\n /**\n * Returns the public key and top level domain of an ENR tree entry.\n * The domain is the starting point for traversing a set of linked DNS TXT records\n * and the public key is used to verify the root entry record\n */\n static parseTree(tree) {\n if (!tree.startsWith(this.TREE_PREFIX))\n throw new Error(`ENRTree tree entry must start with '${this.TREE_PREFIX}'`);\n const matches = tree.match(/^enrtree:\\/\\/([^@]+)@(.+)$/);\n if (!Array.isArray(matches))\n throw new Error(\"Could not parse ENRTree tree entry\");\n matches.shift(); // The first entry is the full match\n const [publicKey, domain] = matches;\n if (!publicKey)\n throw new Error(\"Could not parse public key from ENRTree tree entry\");\n if (!domain)\n throw new Error(\"Could not parse domain from ENRTree tree entry\");\n return { publicKey, domain };\n }\n /**\n * Returns subdomains listed in an ENR branch entry. These in turn lead to\n * either further branch entries or ENR records.\n */\n static parseBranch(branch) {\n if (!branch.startsWith(this.BRANCH_PREFIX))\n throw new Error(`ENRTree branch entry must start with '${this.BRANCH_PREFIX}'`);\n return branch.split(this.BRANCH_PREFIX)[1].split(\",\");\n }\n}\n//# sourceMappingURL=enrtree.js.map","import { Logger } from \"@waku/utils\";\nconst log = new Logger(\"discovery:fetch_nodes\");\n/**\n * Fetch nodes using passed [[getNode]] until all wanted capabilities are\n * fulfilled or the number of [[getNode]] call exceeds the sum of\n * [[wantedNodeCapabilityCount]] plus [[errorTolerance]].\n */\nexport async function fetchNodesUntilCapabilitiesFulfilled(wantedNodeCapabilityCount, errorTolerance, getNode) {\n const wanted = {\n relay: wantedNodeCapabilityCount.relay ?? 0,\n store: wantedNodeCapabilityCount.store ?? 0,\n filter: wantedNodeCapabilityCount.filter ?? 0,\n lightPush: wantedNodeCapabilityCount.lightPush ?? 0\n };\n const maxSearches = wanted.relay + wanted.store + wanted.filter + wanted.lightPush;\n const actual = {\n relay: 0,\n store: 0,\n filter: 0,\n lightPush: 0\n };\n let totalSearches = 0;\n const peers = [];\n while (!isSatisfied(wanted, actual) &&\n totalSearches < maxSearches + errorTolerance) {\n const peer = await getNode();\n if (peer && isNewPeer(peer, peers)) {\n // ENRs without a waku2 key are ignored.\n if (peer.waku2) {\n if (helpsSatisfyCapabilities(peer.waku2, wanted, actual)) {\n addCapabilities(peer.waku2, actual);\n peers.push(peer);\n }\n }\n log.info(`got new peer candidate from DNS address=${peer.nodeId}@${peer.ip}`);\n }\n totalSearches++;\n }\n return peers;\n}\n/**\n * Fetch nodes using passed [[getNode]] until all wanted capabilities are\n * fulfilled or the number of [[getNode]] call exceeds the sum of\n * [[wantedNodeCapabilityCount]] plus [[errorTolerance]].\n */\nexport async function* yieldNodesUntilCapabilitiesFulfilled(wantedNodeCapabilityCount, errorTolerance, getNode) {\n const wanted = {\n relay: wantedNodeCapabilityCount.relay ?? 0,\n store: wantedNodeCapabilityCount.store ?? 0,\n filter: wantedNodeCapabilityCount.filter ?? 0,\n lightPush: wantedNodeCapabilityCount.lightPush ?? 0\n };\n const maxSearches = wanted.relay + wanted.store + wanted.filter + wanted.lightPush;\n const actual = {\n relay: 0,\n store: 0,\n filter: 0,\n lightPush: 0\n };\n let totalSearches = 0;\n const peerNodeIds = new Set();\n while (!isSatisfied(wanted, actual) &&\n totalSearches < maxSearches + errorTolerance) {\n const peer = await getNode();\n if (peer && peer.nodeId && !peerNodeIds.has(peer.nodeId)) {\n peerNodeIds.add(peer.nodeId);\n // ENRs without a waku2 key are ignored.\n if (peer.waku2) {\n if (helpsSatisfyCapabilities(peer.waku2, wanted, actual)) {\n addCapabilities(peer.waku2, actual);\n yield peer;\n }\n }\n log.info(`got new peer candidate from DNS address=${peer.nodeId}@${peer.ip}`);\n }\n totalSearches++;\n }\n}\nfunction isSatisfied(wanted, actual) {\n return (actual.relay >= wanted.relay &&\n actual.store >= wanted.store &&\n actual.filter >= wanted.filter &&\n actual.lightPush >= wanted.lightPush);\n}\nfunction isNewPeer(peer, peers) {\n if (!peer.nodeId)\n return false;\n for (const existingPeer of peers) {\n if (peer.nodeId === existingPeer.nodeId) {\n return false;\n }\n }\n return true;\n}\nfunction addCapabilities(node, total) {\n if (node.relay)\n total.relay += 1;\n if (node.store)\n total.store += 1;\n if (node.filter)\n total.filter += 1;\n if (node.lightPush)\n total.lightPush += 1;\n}\n/**\n * Checks if the proposed ENR [[node]] helps satisfy the [[wanted]] capabilities,\n * considering the [[actual]] capabilities of nodes retrieved so far..\n *\n * @throws If the function is called when the wanted capabilities are already fulfilled.\n */\nfunction helpsSatisfyCapabilities(node, wanted, actual) {\n if (isSatisfied(wanted, actual)) {\n throw \"Internal Error: Waku2 wanted capabilities are already fulfilled\";\n }\n const missing = missingCapabilities(wanted, actual);\n return ((missing.relay && node.relay) ||\n (missing.store && node.store) ||\n (missing.filter && node.filter) ||\n (missing.lightPush && node.lightPush));\n}\n/**\n * Return a [[Waku2]] Object for which capabilities are set to true if they are\n * [[wanted]] yet missing from [[actual]].\n */\nfunction missingCapabilities(wanted, actual) {\n return {\n relay: actual.relay < wanted.relay,\n store: actual.store < wanted.store,\n filter: actual.filter < wanted.filter,\n lightPush: actual.lightPush < wanted.lightPush\n };\n}\n//# sourceMappingURL=fetch_nodes.js.map","import { EnrDecoder } from \"@waku/enr\";\nimport { Logger } from \"@waku/utils\";\nimport { DnsOverHttps } from \"./dns_over_https.js\";\nimport { ENRTree } from \"./enrtree.js\";\nimport { fetchNodesUntilCapabilitiesFulfilled, yieldNodesUntilCapabilitiesFulfilled } from \"./fetch_nodes.js\";\nconst log = new Logger(\"discovery:dns\");\nexport class DnsNodeDiscovery {\n dns;\n _DNSTreeCache;\n _errorTolerance = 10;\n static async dnsOverHttp(dnsClient) {\n if (!dnsClient) {\n dnsClient = await DnsOverHttps.create();\n }\n return new DnsNodeDiscovery(dnsClient);\n }\n /**\n * Returns a list of verified peers listed in an EIP-1459 DNS tree. Method may\n * return fewer peers than requested if @link wantedNodeCapabilityCount requires\n * larger quantity of peers than available or the number of errors/duplicate\n * peers encountered by randomized search exceeds the sum of the fields of\n * @link wantedNodeCapabilityCount plus the @link _errorTolerance factor.\n */\n async getPeers(enrTreeUrls, wantedNodeCapabilityCount) {\n const networkIndex = Math.floor(Math.random() * enrTreeUrls.length);\n const { publicKey, domain } = ENRTree.parseTree(enrTreeUrls[networkIndex]);\n const context = {\n domain,\n publicKey,\n visits: {}\n };\n const peers = await fetchNodesUntilCapabilitiesFulfilled(wantedNodeCapabilityCount, this._errorTolerance, () => this._search(domain, context));\n log.info(\"retrieved peers: \", peers.map((peer) => {\n return {\n id: peer.peerId?.toString(),\n multiaddrs: peer.multiaddrs?.map((ma) => ma.toString())\n };\n }));\n return peers;\n }\n constructor(dns) {\n this._DNSTreeCache = {};\n this.dns = dns;\n }\n /**\n * {@inheritDoc getPeers}\n */\n async *getNextPeer(enrTreeUrls, wantedNodeCapabilityCount) {\n const networkIndex = Math.floor(Math.random() * enrTreeUrls.length);\n const { publicKey, domain } = ENRTree.parseTree(enrTreeUrls[networkIndex]);\n const context = {\n domain,\n publicKey,\n visits: {}\n };\n for await (const peer of yieldNodesUntilCapabilitiesFulfilled(wantedNodeCapabilityCount, this._errorTolerance, () => this._search(domain, context))) {\n yield peer;\n }\n }\n /**\n * Runs a recursive, randomized descent of the DNS tree to retrieve a single\n * ENR record as an ENR. Returns null if parsing or DNS resolution fails.\n */\n async _search(subdomain, context) {\n try {\n const entry = await this._getTXTRecord(subdomain, context);\n context.visits[subdomain] = true;\n let next;\n let branches;\n const entryType = getEntryType(entry);\n try {\n switch (entryType) {\n case ENRTree.ROOT_PREFIX:\n next = ENRTree.parseAndVerifyRoot(entry, context.publicKey);\n return await this._search(next, context);\n case ENRTree.BRANCH_PREFIX:\n branches = ENRTree.parseBranch(entry);\n next = selectRandomPath(branches, context);\n return await this._search(next, context);\n case ENRTree.RECORD_PREFIX:\n return EnrDecoder.fromString(entry);\n default:\n return null;\n }\n }\n catch (error) {\n log.error(`Failed to search DNS tree ${entryType} at subdomain ${subdomain}: ${error}`);\n return null;\n }\n }\n catch (error) {\n log.error(`Failed to retrieve TXT record at subdomain ${subdomain}: ${error}`);\n return null;\n }\n }\n /**\n * Retrieves the TXT record stored at a location from either\n * this DNS tree cache or via DNS query.\n *\n * @throws if the TXT Record contains non-UTF-8 values.\n */\n async _getTXTRecord(subdomain, context) {\n if (this._DNSTreeCache[subdomain]) {\n return this._DNSTreeCache[subdomain];\n }\n // Location is either the top level tree entry host or a subdomain of it.\n const location = subdomain !== context.domain\n ? `${subdomain}.${context.domain}`\n : context.domain;\n const response = await this.dns.resolveTXT(location);\n if (!response.length)\n throw new Error(\"Received empty result array while fetching TXT record\");\n if (!response[0].length)\n throw new Error(\"Received empty TXT record\");\n // Branch entries can be an array of strings of comma delimited subdomains, with\n // some subdomain strings split across the array elements\n const result = response.join(\"\");\n this._DNSTreeCache[subdomain] = result;\n return result;\n }\n}\nfunction getEntryType(entry) {\n if (entry.startsWith(ENRTree.ROOT_PREFIX))\n return ENRTree.ROOT_PREFIX;\n if (entry.startsWith(ENRTree.BRANCH_PREFIX))\n return ENRTree.BRANCH_PREFIX;\n if (entry.startsWith(ENRTree.RECORD_PREFIX))\n return ENRTree.RECORD_PREFIX;\n return \"\";\n}\n/**\n * Returns a randomly selected subdomain string from the list provided by a branch\n * entry record.\n *\n * The client must track subdomains which are already resolved to avoid\n * going into an infinite loop b/c branch entries can contain\n * circular references. It’s in the client’s best interest to traverse the\n * tree in random order.\n */\nfunction selectRandomPath(branches, context) {\n // Identify domains already visited in this traversal of the DNS tree.\n // Then filter against them to prevent cycles.\n const circularRefs = {};\n for (const [idx, subdomain] of branches.entries()) {\n if (context.visits[subdomain]) {\n circularRefs[idx] = true;\n }\n }\n // If all possible paths are circular...\n if (Object.keys(circularRefs).length === branches.length) {\n throw new Error(\"Unresolvable circular path detected\");\n }\n // Randomly select a viable path\n let index;\n do {\n index = Math.floor(Math.random() * branches.length);\n } while (circularRefs[index]);\n return branches[index];\n}\n//# sourceMappingURL=dns.js.map","import { CustomEvent, TypedEventEmitter } from \"@libp2p/interface\";\nimport { peerDiscoverySymbol as symbol } from \"@libp2p/interface\";\nimport { DNS_DISCOVERY_TAG } from \"@waku/interfaces\";\nimport { encodeRelayShard, Logger } from \"@waku/utils\";\nimport { DEFAULT_BOOTSTRAP_TAG_NAME, DEFAULT_BOOTSTRAP_TAG_TTL, DEFAULT_BOOTSTRAP_TAG_VALUE, DEFAULT_NODE_REQUIREMENTS } from \"./constants.js\";\nimport { DnsNodeDiscovery } from \"./dns.js\";\nconst log = new Logger(\"peer-discovery-dns\");\n/**\n * Parse options and expose function to return bootstrap peer addresses.\n */\nexport class PeerDiscoveryDns extends TypedEventEmitter {\n nextPeer;\n _started;\n _components;\n _options;\n constructor(components, options) {\n super();\n this._started = false;\n this._components = components;\n this._options = options;\n const { enrUrls } = options;\n log.info(\"Use following EIP-1459 ENR Tree URLs: \", enrUrls);\n }\n /**\n * Start discovery process\n */\n async start() {\n log.info(\"Starting peer discovery via dns\");\n this._started = true;\n await this.findPeers();\n }\n async findPeers() {\n if (!this.nextPeer) {\n let { enrUrls } = this._options;\n if (!Array.isArray(enrUrls))\n enrUrls = [enrUrls];\n const { wantedNodeCapabilityCount } = this._options;\n const dns = await DnsNodeDiscovery.dnsOverHttp();\n this.nextPeer = dns.getNextPeer.bind(dns, enrUrls, wantedNodeCapabilityCount);\n }\n for await (const peerEnr of this.nextPeer()) {\n if (!this._started) {\n return;\n }\n const { peerInfo, shardInfo } = peerEnr;\n if (!peerInfo) {\n continue;\n }\n const tagsToUpdate = {\n [DEFAULT_BOOTSTRAP_TAG_NAME]: {\n value: this._options.tagValue ?? DEFAULT_BOOTSTRAP_TAG_VALUE,\n ttl: this._options.tagTTL ?? DEFAULT_BOOTSTRAP_TAG_TTL\n }\n };\n let isPeerChanged = false;\n const isPeerExists = await this._components.peerStore.has(peerInfo.id);\n if (isPeerExists) {\n const peer = await this._components.peerStore.get(peerInfo.id);\n const hasBootstrapTag = peer.tags.has(DEFAULT_BOOTSTRAP_TAG_NAME);\n if (!hasBootstrapTag) {\n isPeerChanged = true;\n await this._components.peerStore.merge(peerInfo.id, {\n tags: tagsToUpdate\n });\n }\n }\n else {\n isPeerChanged = true;\n await this._components.peerStore.save(peerInfo.id, {\n tags: tagsToUpdate,\n ...(shardInfo && {\n metadata: {\n shardInfo: encodeRelayShard(shardInfo)\n }\n })\n });\n }\n if (isPeerChanged) {\n this.dispatchEvent(new CustomEvent(\"peer\", { detail: peerInfo }));\n }\n }\n }\n /**\n * Stop emitting events\n */\n stop() {\n this._started = false;\n }\n get [symbol]() {\n return true;\n }\n get [Symbol.toStringTag]() {\n return DNS_DISCOVERY_TAG;\n }\n}\nexport function wakuDnsDiscovery(enrUrls, wantedNodeCapabilityCount = DEFAULT_NODE_REQUIREMENTS) {\n return (components) => new PeerDiscoveryDns(components, { enrUrls, wantedNodeCapabilityCount });\n}\n//# sourceMappingURL=dns_discovery.js.map","import { proto_peer_exchange as proto } from \"@waku/proto\";\n/**\n * PeerExchangeRPC represents a message conforming to the Waku Peer Exchange protocol\n */\nexport class PeerExchangeRPC {\n proto;\n constructor(proto) {\n this.proto = proto;\n }\n static createRequest(params) {\n const { numPeers } = params;\n return new PeerExchangeRPC({\n query: {\n numPeers: numPeers\n },\n response: undefined\n });\n }\n /**\n * Encode the current PeerExchangeRPC request to bytes\n * @returns Uint8Array\n */\n encode() {\n return proto.PeerExchangeRPC.encode(this.proto);\n }\n /**\n * Decode the current PeerExchangeRPC request to bytes\n * @returns Uint8Array\n */\n static decode(bytes) {\n const res = proto.PeerExchangeRPC.decode(bytes);\n return new PeerExchangeRPC(res);\n }\n get query() {\n return this.proto.query;\n }\n get response() {\n return this.proto.response;\n }\n}\n//# sourceMappingURL=rpc.js.map","import { BaseProtocol } from \"@waku/core/lib/base_protocol\";\nimport { EnrDecoder } from \"@waku/enr\";\nimport { ProtocolError } from \"@waku/interfaces\";\nimport { isDefined } from \"@waku/utils\";\nimport { Logger } from \"@waku/utils\";\nimport all from \"it-all\";\nimport * as lp from \"it-length-prefixed\";\nimport { pipe } from \"it-pipe\";\nimport { Uint8ArrayList } from \"uint8arraylist\";\nimport { PeerExchangeRPC } from \"./rpc.js\";\nexport const PeerExchangeCodec = \"/vac/waku/peer-exchange/2.0.0-alpha1\";\nconst log = new Logger(\"peer-exchange\");\n/**\n * Implementation of the Peer Exchange protocol (https://rfc.vac.dev/spec/34/)\n */\nexport class WakuPeerExchange extends BaseProtocol {\n /**\n * @param components - libp2p components\n */\n constructor(components, pubsubTopics) {\n super(PeerExchangeCodec, components, log, pubsubTopics);\n }\n /**\n * Make a peer exchange query to a peer\n */\n async query(params) {\n const { numPeers, peerId } = params;\n const rpcQuery = PeerExchangeRPC.createRequest({\n numPeers: BigInt(numPeers)\n });\n const peer = await this.peerStore.get(peerId);\n if (!peer) {\n return {\n peerInfos: null,\n error: ProtocolError.NO_PEER_AVAILABLE\n };\n }\n let stream;\n try {\n stream = await this.getStream(peer);\n }\n catch (err) {\n log.error(\"Failed to get stream\", err);\n return {\n peerInfos: null,\n error: ProtocolError.NO_STREAM_AVAILABLE\n };\n }\n const res = await pipe([rpcQuery.encode()], lp.encode, stream, lp.decode, async (source) => await all(source));\n try {\n const bytes = new Uint8ArrayList();\n res.forEach((chunk) => {\n bytes.append(chunk);\n });\n const { response } = PeerExchangeRPC.decode(bytes);\n if (!response) {\n log.error(\"PeerExchangeRPC message did not contains a `response` field\");\n return {\n peerInfos: null,\n error: ProtocolError.EMPTY_PAYLOAD\n };\n }\n const peerInfos = await Promise.all(response.peerInfos\n .map((peerInfo) => peerInfo.enr)\n .filter(isDefined)\n .map(async (enr) => {\n return { ENR: await EnrDecoder.fromRLP(enr) };\n }));\n return {\n peerInfos,\n error: null\n };\n }\n catch (err) {\n log.error(\"Failed to decode push reply\", err);\n return {\n peerInfos: null,\n error: ProtocolError.DECODE_FAILED\n };\n }\n }\n}\n/**\n *\n * @returns A function that creates a new peer exchange protocol\n */\nexport function wakuPeerExchange(pubsubTopics) {\n return (components) => new WakuPeerExchange(components, pubsubTopics);\n}\n//# sourceMappingURL=waku_peer_exchange.js.map","import { CustomEvent, TypedEventEmitter } from \"@libp2p/interface\";\nimport { peerDiscoverySymbol as symbol } from \"@libp2p/interface\";\nimport { Tags } from \"@waku/interfaces\";\nimport { decodeRelayShard, encodeRelayShard, Logger } from \"@waku/utils\";\nimport { PeerExchangeCodec, WakuPeerExchange } from \"./waku_peer_exchange.js\";\nconst log = new Logger(\"peer-exchange-discovery\");\nconst DEFAULT_PEER_EXCHANGE_REQUEST_NODES = 10;\nconst DEFAULT_PEER_EXCHANGE_QUERY_INTERVAL_MS = 10 * 1000;\nconst DEFAULT_MAX_RETRIES = 3;\nexport const DEFAULT_PEER_EXCHANGE_TAG_NAME = Tags.PEER_EXCHANGE;\nconst DEFAULT_PEER_EXCHANGE_TAG_VALUE = 50;\nconst DEFAULT_PEER_EXCHANGE_TAG_TTL = 100_000_000;\nexport class PeerExchangeDiscovery extends TypedEventEmitter {\n components;\n peerExchange;\n options;\n isStarted;\n queryingPeers = new Set();\n queryAttempts = new Map();\n handleDiscoveredPeer = (event) => {\n const { protocols, peerId } = event.detail;\n if (!protocols.includes(PeerExchangeCodec) ||\n this.queryingPeers.has(peerId.toString()))\n return;\n this.queryingPeers.add(peerId.toString());\n this.startRecurringQueries(peerId).catch((error) => log.error(`Error querying peer ${error}`));\n };\n constructor(components, pubsubTopics, options = {}) {\n super();\n this.components = components;\n this.peerExchange = new WakuPeerExchange(components, pubsubTopics);\n this.options = options;\n this.isStarted = false;\n }\n /**\n * Start emitting events\n */\n start() {\n if (this.isStarted) {\n return;\n }\n this.dispatchEvent(new CustomEvent(\"waku:peer-exchange:started\", { detail: true }));\n log.info(\"Starting peer exchange node discovery, discovering peers\");\n // might be better to use \"peer:identify\" or \"peer:update\"\n this.components.events.addEventListener(\"peer:identify\", this.handleDiscoveredPeer);\n }\n /**\n * Remove event listener\n */\n stop() {\n if (!this.isStarted)\n return;\n log.info(\"Stopping peer exchange node discovery\");\n this.isStarted = false;\n this.queryingPeers.clear();\n this.components.events.removeEventListener(\"peer:identify\", this.handleDiscoveredPeer);\n }\n get [symbol]() {\n return true;\n }\n get [Symbol.toStringTag]() {\n return \"@waku/peer-exchange\";\n }\n startRecurringQueries = async (peerId) => {\n const peerIdStr = peerId.toString();\n const { queryInterval = DEFAULT_PEER_EXCHANGE_QUERY_INTERVAL_MS, maxRetries = DEFAULT_MAX_RETRIES } = this.options;\n log.info(`Querying peer: ${peerIdStr} (attempt ${this.queryAttempts.get(peerIdStr) ?? 1})`);\n await this.query(peerId);\n const currentAttempt = this.queryAttempts.get(peerIdStr) ?? 1;\n if (currentAttempt > maxRetries) {\n this.abortQueriesForPeer(peerIdStr);\n return;\n }\n setTimeout(() => {\n this.queryAttempts.set(peerIdStr, currentAttempt + 1);\n this.startRecurringQueries(peerId).catch((error) => {\n log.error(`Error in startRecurringQueries: ${error}`);\n });\n }, queryInterval * currentAttempt);\n };\n async query(peerId) {\n const { error, peerInfos } = await this.peerExchange.query({\n numPeers: DEFAULT_PEER_EXCHANGE_REQUEST_NODES,\n peerId\n });\n if (error) {\n log.error(\"Peer exchange query failed\", error);\n return { error, peerInfos: null };\n }\n for (const _peerInfo of peerInfos) {\n const { ENR } = _peerInfo;\n if (!ENR) {\n log.warn(\"No ENR in peerInfo object, skipping\");\n continue;\n }\n const { peerId, peerInfo, shardInfo } = ENR;\n if (!peerId || !peerInfo) {\n continue;\n }\n const hasPeer = await this.components.peerStore.has(peerId);\n if (hasPeer) {\n const { hasMultiaddrDiff, hasShardDiff } = await this.checkPeerInfoDiff(peerInfo, shardInfo);\n if (hasMultiaddrDiff || hasShardDiff) {\n log.info(`Peer ${peerId.toString()} has updated multiaddrs or shardInfo, updating`);\n if (hasMultiaddrDiff) {\n log.info(`Peer ${peerId.toString()} has updated multiaddrs, updating`);\n await this.components.peerStore.patch(peerId, {\n multiaddrs: peerInfo.multiaddrs\n });\n }\n if (hasShardDiff && shardInfo) {\n log.info(`Peer ${peerId.toString()} has updated shardInfo, updating`);\n await this.components.peerStore.merge(peerId, {\n metadata: {\n shardInfo: encodeRelayShard(shardInfo)\n }\n });\n this.dispatchEvent(new CustomEvent(\"peer\", {\n detail: {\n id: peerId,\n multiaddrs: peerInfo.multiaddrs\n }\n }));\n }\n continue;\n }\n }\n // update the tags for the peer\n await this.components.peerStore.save(peerId, {\n tags: {\n [DEFAULT_PEER_EXCHANGE_TAG_NAME]: {\n value: this.options.tagValue ?? DEFAULT_PEER_EXCHANGE_TAG_VALUE,\n ttl: this.options.tagTTL ?? DEFAULT_PEER_EXCHANGE_TAG_TTL\n }\n },\n ...(shardInfo && {\n metadata: {\n shardInfo: encodeRelayShard(shardInfo)\n }\n }),\n ...(peerInfo.multiaddrs && {\n multiaddrs: peerInfo.multiaddrs\n })\n });\n log.info(`Discovered peer: ${peerId.toString()}`);\n this.dispatchEvent(new CustomEvent(\"peer\", {\n detail: {\n id: peerId,\n multiaddrs: peerInfo.multiaddrs\n }\n }));\n }\n return { error: null, peerInfos };\n }\n abortQueriesForPeer(peerIdStr) {\n log.info(`Aborting queries for peer: ${peerIdStr}`);\n this.queryingPeers.delete(peerIdStr);\n this.queryAttempts.delete(peerIdStr);\n }\n async checkPeerInfoDiff(peerInfo, shardInfo) {\n const { id: peerId } = peerInfo;\n const peer = await this.components.peerStore.get(peerId);\n const existingMultiaddrs = peer.addresses.map((a) => a.multiaddr.toString());\n const newMultiaddrs = peerInfo.multiaddrs.map((ma) => ma.toString());\n const hasMultiaddrDiff = existingMultiaddrs.some((ma) => !newMultiaddrs.includes(ma));\n let hasShardDiff = false;\n const existingShardInfoBytes = peer.metadata.get(\"shardInfo\");\n if (existingShardInfoBytes) {\n const existingShardInfo = decodeRelayShard(existingShardInfoBytes);\n if (existingShardInfo || shardInfo) {\n hasShardDiff =\n existingShardInfo.clusterId !== shardInfo?.clusterId ||\n existingShardInfo.shards.some((shard) => !shardInfo?.shards.includes(shard));\n }\n }\n return { hasMultiaddrDiff, hasShardDiff };\n }\n}\nexport function wakuPeerExchangeDiscovery(pubsubTopics) {\n return (components) => new PeerExchangeDiscovery(components, pubsubTopics);\n}\n//# sourceMappingURL=waku_peer_exchange_discovery.js.map","import { TypedEventEmitter } from \"@libp2p/interface\";\nimport { CustomEvent } from \"@libp2p/interface\";\nimport { createFromJSON } from \"@libp2p/peer-id-factory\";\nimport { multiaddr } from \"@multiformats/multiaddr\";\nimport { Tags } from \"@waku/interfaces\";\nimport { getWsMultiaddrFromMultiaddrs, Logger } from \"@waku/utils\";\nconst log = new Logger(\"peer-exchange-discovery\");\nexport const DEFAULT_LOCAL_TAG_NAME = Tags.LOCAL;\nconst DEFAULT_LOCAL_TAG_VALUE = 50;\nconst DEFAULT_LOCAL_TAG_TTL = 100_000_000;\nexport class LocalPeerCacheDiscovery extends TypedEventEmitter {\n components;\n options;\n isStarted;\n peers = [];\n constructor(components, options) {\n super();\n this.components = components;\n this.options = options;\n this.isStarted = false;\n this.peers = this.getPeersFromLocalStorage();\n }\n get [Symbol.toStringTag]() {\n return \"@waku/local-peer-cache-discovery\";\n }\n async start() {\n if (this.isStarted)\n return;\n log.info(\"Starting Local Storage Discovery\");\n this.components.events.addEventListener(\"peer:identify\", this.handleNewPeers);\n for (const { id: idStr, address } of this.peers) {\n const peerId = await createFromJSON({ id: idStr });\n if (await this.components.peerStore.has(peerId))\n continue;\n await this.components.peerStore.save(peerId, {\n multiaddrs: [multiaddr(address)],\n tags: {\n [this.options?.tagName ?? DEFAULT_LOCAL_TAG_NAME]: {\n value: this.options?.tagValue ?? DEFAULT_LOCAL_TAG_VALUE,\n ttl: this.options?.tagTTL ?? DEFAULT_LOCAL_TAG_TTL\n }\n }\n });\n this.dispatchEvent(new CustomEvent(\"peer\", {\n detail: {\n id: peerId,\n multiaddrs: [multiaddr(address)]\n }\n }));\n }\n log.info(`Discovered ${this.peers.length} peers`);\n this.isStarted = true;\n }\n stop() {\n if (!this.isStarted)\n return;\n log.info(\"Stopping Local Storage Discovery\");\n this.components.events.removeEventListener(\"peer:identify\", this.handleNewPeers);\n this.isStarted = false;\n this.savePeersToLocalStorage();\n }\n handleNewPeers = (event) => {\n const { peerId, listenAddrs } = event.detail;\n const websocketMultiaddr = getWsMultiaddrFromMultiaddrs(listenAddrs);\n const localStoragePeers = this.getPeersFromLocalStorage();\n const existingPeerIndex = localStoragePeers.findIndex((_peer) => _peer.id === peerId.toString());\n if (existingPeerIndex >= 0) {\n localStoragePeers[existingPeerIndex].address =\n websocketMultiaddr.toString();\n }\n else {\n localStoragePeers.push({\n id: peerId.toString(),\n address: websocketMultiaddr.toString()\n });\n }\n this.peers = localStoragePeers;\n this.savePeersToLocalStorage();\n };\n getPeersFromLocalStorage() {\n try {\n const storedPeersData = localStorage.getItem(\"waku:peers\");\n if (!storedPeersData)\n return [];\n const peers = JSON.parse(storedPeersData);\n return peers.filter(isValidStoredPeer);\n }\n catch (error) {\n log.error(\"Error parsing peers from local storage:\", error);\n return [];\n }\n }\n savePeersToLocalStorage() {\n try {\n localStorage.setItem(\"waku:peers\", JSON.stringify(this.peers));\n }\n catch (error) {\n log.error(\"Error saving peers to local storage:\", error);\n }\n }\n}\nfunction isValidStoredPeer(peer) {\n return (peer &&\n typeof peer === \"object\" &&\n typeof peer.id === \"string\" &&\n typeof peer.address === \"string\");\n}\nexport function wakuLocalPeerCacheDiscovery() {\n return (components, options) => new LocalPeerCacheDiscovery(components, options);\n}\n//# sourceMappingURL=index.js.map","export * from \"./is_defined.js\";\nexport * from \"./random_subset.js\";\nexport * from \"./group_by.js\";\nexport * from \"./to_async_iterator.js\";\nexport * from \"./is_size_valid.js\";\nexport * from \"./sharding/index.js\";\nexport * from \"./push_or_init_map.js\";\nexport * from \"./relay_shard_codec.js\";\nexport * from \"./delay.js\";\nexport function removeItemFromArray(arr, value) {\n const index = arr.indexOf(value);\n if (index > -1) {\n arr.splice(index, 1);\n }\n return arr;\n}\nexport function getWsMultiaddrFromMultiaddrs(addresses) {\n const wsMultiaddr = addresses.find((addr) => addr.toString().includes(\"ws\") || addr.toString().includes(\"wss\"));\n if (!wsMultiaddr) {\n throw new Error(\"No ws multiaddr found in the given addresses\");\n }\n return wsMultiaddr;\n}\n//# sourceMappingURL=index.js.map","import { noise } from \"@chainsafe/libp2p-noise\";\nimport { bootstrap } from \"@libp2p/bootstrap\";\nimport { identify } from \"@libp2p/identify\";\nimport { mplex } from \"@libp2p/mplex\";\nimport { ping } from \"@libp2p/ping\";\nimport { webSockets } from \"@libp2p/websockets\";\nimport { all as filterAll, wss } from \"@libp2p/websockets/filters\";\nimport { wakuMetadata } from \"@waku/core\";\nimport { DefaultNetworkConfig } from \"@waku/interfaces\";\nimport { derivePubsubTopicsFromNetworkConfig, Logger } from \"@waku/utils\";\nimport { createLibp2p } from \"libp2p\";\nimport { DefaultPingMaxInboundStreams, DefaultUserAgent } from \"../waku.js\";\nimport { defaultPeerDiscoveries } from \"./discovery.js\";\nconst log = new Logger(\"sdk:create\");\nexport async function defaultLibp2p(pubsubTopics, options, userAgent) {\n if (!options?.hideWebSocketInfo && process?.env?.NODE_ENV !== \"test\") {\n /* eslint-disable no-console */\n console.info(\"%cIgnore WebSocket connection failures\", \"background: gray; color: white; font-size: x-large\");\n console.info(\"%cWaku tries to discover peers and some of them are expected to fail\", \"background: gray; color: white; font-size: x-large\");\n /* eslint-enable no-console */\n }\n const metadataService = pubsubTopics\n ? { metadata: wakuMetadata(pubsubTopics) }\n : {};\n const filter = options?.filterMultiaddrs === false || process?.env?.NODE_ENV === \"test\"\n ? filterAll\n : wss;\n return createLibp2p({\n connectionManager: {\n minConnections: 1\n },\n transports: [webSockets({ filter: filter })],\n streamMuxers: [mplex()],\n connectionEncryption: [noise()],\n ...options,\n services: {\n identify: identify({\n agentVersion: userAgent ?? DefaultUserAgent\n }),\n ping: ping({\n maxInboundStreams: options?.pingMaxInboundStreams ?? DefaultPingMaxInboundStreams\n }),\n ...metadataService,\n ...options?.services\n }\n }); // TODO: make libp2p include it;\n}\nexport async function createLibp2pAndUpdateOptions(options) {\n const { networkConfig } = options;\n const pubsubTopics = derivePubsubTopicsFromNetworkConfig(networkConfig ?? DefaultNetworkConfig);\n log.info(\"Creating Waku node with pubsub topics\", pubsubTopics);\n const libp2pOptions = options?.libp2p ?? {};\n const peerDiscovery = libp2pOptions.peerDiscovery ?? [];\n if (options?.defaultBootstrap) {\n peerDiscovery.push(...defaultPeerDiscoveries(pubsubTopics));\n }\n if (options?.bootstrapPeers) {\n peerDiscovery.push(bootstrap({ list: options.bootstrapPeers }));\n }\n libp2pOptions.peerDiscovery = peerDiscovery;\n const libp2p = await defaultLibp2p(pubsubTopics, libp2pOptions, options?.userAgent);\n return { libp2p, pubsubTopics };\n}\n//# sourceMappingURL=libp2p.js.map","/**\n * @packageDocumentation\n *\n * Use the `createLibp2p` function to create a libp2p node.\n *\n * @example\n *\n * ```typescript\n * import { createLibp2p } from 'libp2p'\n *\n * const node = await createLibp2p({\n * // ...other options\n * })\n * ```\n */\nimport { createLibp2pNode } from './libp2p.js';\n/**\n * Returns a new instance of the Libp2p interface, generating a new PeerId\n * if one is not passed as part of the options.\n *\n * The node will be started unless `start: false` is passed as an option.\n *\n * @example\n *\n * ```TypeScript\n * import { createLibp2p } from 'libp2p'\n * import { tcp } from '@libp2p/tcp'\n * import { mplex } from '@libp2p/mplex'\n * import { noise } from '@chainsafe/libp2p-noise'\n * import { yamux } from '@chainsafe/libp2p-yamux'\n *\n * // specify options\n * const options = {\n * transports: [tcp()],\n * streamMuxers: [yamux(), mplex()],\n * connectionEncryption: [noise()]\n * }\n *\n * // create libp2p\n * const libp2p = await createLibp2p(options)\n * ```\n */\nexport async function createLibp2p(options = {}) {\n const node = await createLibp2pNode(options);\n if (options.start !== false) {\n await node.start();\n }\n return node;\n}\n//# sourceMappingURL=index.js.map","import { WakuNode } from \"../waku.js\";\nimport { createLibp2pAndUpdateOptions } from \"./libp2p.js\";\n/**\n * Create a Waku node that uses Waku Light Push, Filter and Store to send and\n * receive messages, enabling low resource consumption.\n * Uses Waku Filter V2 by default.\n */\nexport async function createLightNode(options = {}) {\n const { libp2p, pubsubTopics } = await createLibp2pAndUpdateOptions(options);\n return new WakuNode(pubsubTopics, options, libp2p, {\n store: true,\n lightpush: true,\n filter: true\n });\n}\n//# sourceMappingURL=create.js.map","export function isStaticSharding(config) {\n return (\"clusterId\" in config && \"shards\" in config && !(\"contentTopics\" in config));\n}\nexport function isAutoSharding(config) {\n return \"contentTopics\" in config;\n}\n//# sourceMappingURL=type_guards.js.map","import { enrTree, wakuDnsDiscovery, wakuLocalPeerCacheDiscovery, wakuPeerExchangeDiscovery } from \"@waku/discovery\";\nexport function defaultPeerDiscoveries(pubsubTopics) {\n const dnsEnrTrees = [enrTree[\"SANDBOX\"], enrTree[\"TEST\"]];\n const discoveries = [\n wakuDnsDiscovery(dnsEnrTrees),\n wakuLocalPeerCacheDiscovery(),\n wakuPeerExchangeDiscovery(pubsubTopics)\n ];\n return discoveries;\n}\n//# sourceMappingURL=discovery.js.map","var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n return new (P || (P = Promise))(function (resolve, reject) {\n function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n step((generator = generator.apply(thisArg, _arguments || [])).next());\n });\n};\nvar __generator = (this && this.__generator) || function (thisArg, body) {\n var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\n return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\n function verb(n) { return function (v) { return step([n, v]); }; }\n function step(op) {\n if (f) throw new TypeError(\"Generator is already executing.\");\n while (g && (g = 0, op[0] && (_ = 0)), _) try {\n if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\n if (y = 0, t) op = [op[0] & 2, t.value];\n switch (op[0]) {\n case 0: case 1: t = op; break;\n case 4: _.label++; return { value: op[1], done: false };\n case 5: _.label++; y = op[1]; op = [0]; continue;\n case 7: op = _.ops.pop(); _.trys.pop(); continue;\n default:\n if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\n if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\n if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\n if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\n if (t[2]) _.ops.pop();\n _.trys.pop(); continue;\n }\n op = body.call(thisArg, _);\n } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\n if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\n }\n};\nexport var TelemetryType;\n(function (TelemetryType) {\n TelemetryType[\"LIGHT_PUSH_FILTER\"] = \"LightPushFilter\";\n TelemetryType[\"LIGHT_PUSH_ERROR\"] = \"LightPushError\";\n TelemetryType[\"GENERIC\"] = \"Generic\";\n})(TelemetryType || (TelemetryType = {}));\nvar TelemetryClient = /** @class */ (function () {\n function TelemetryClient(url, intervalPeriod) {\n if (intervalPeriod === void 0) { intervalPeriod = 5000; }\n this.url = url;\n this.intervalPeriod = intervalPeriod;\n this.queue = [];\n this.intervalId = null;\n this.requestId = 0;\n }\n TelemetryClient.prototype.push = function (messages) {\n var _a;\n (_a = this.queue).push.apply(_a, messages);\n };\n TelemetryClient.prototype.start = function () {\n return __awaiter(this, void 0, void 0, function () {\n var _this = this;\n return __generator(this, function (_a) {\n if (!this.intervalId) {\n this.intervalId = setInterval(function () { return __awaiter(_this, void 0, void 0, function () {\n var success;\n return __generator(this, function (_a) {\n switch (_a.label) {\n case 0:\n if (!(this.queue.length > 0)) return [3 /*break*/, 2];\n return [4 /*yield*/, this.send(this.queue)];\n case 1:\n success = _a.sent();\n if (success) {\n console.log(\"Sent \", this.queue.length, \" telemetry logs\");\n this.queue = [];\n }\n _a.label = 2;\n case 2: return [2 /*return*/];\n }\n });\n }); }, this.intervalPeriod);\n }\n return [2 /*return*/];\n });\n });\n };\n TelemetryClient.prototype.stop = function () {\n if (this.intervalId) {\n clearInterval(this.intervalId);\n this.intervalId = null;\n }\n };\n TelemetryClient.prototype.send = function (messages) {\n return __awaiter(this, void 0, void 0, function () {\n var telemetryRequests, res, e_1;\n var _this = this;\n return __generator(this, function (_a) {\n switch (_a.label) {\n case 0:\n telemetryRequests = messages.map(function (message) { return ({\n id: ++_this.requestId,\n telemetryType: message.messageType.toString(),\n telemetryData: message\n }); });\n _a.label = 1;\n case 1:\n _a.trys.push([1, 3, , 4]);\n return [4 /*yield*/, fetch(this.url, {\n method: \"POST\",\n body: JSON.stringify(telemetryRequests),\n })];\n case 2:\n res = _a.sent();\n if (res.status !== 201) {\n console.error(\"Error sending messages to telemetry service: \", res.status, res.statusText, res.json);\n return [2 /*return*/, false];\n }\n return [2 /*return*/, true];\n case 3:\n e_1 = _a.sent();\n console.error(\"Error sending messages to telemetry service: \", e_1);\n console.error(\"Failed trying to send the following messages: \", telemetryRequests);\n return [2 /*return*/, false];\n case 4: return [2 /*return*/];\n }\n });\n });\n };\n return TelemetryClient;\n}());\nexport { TelemetryClient };\n","var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n return new (P || (P = Promise))(function (resolve, reject) {\n function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n step((generator = generator.apply(thisArg, _arguments || [])).next());\n });\n};\nvar __generator = (this && this.__generator) || function (thisArg, body) {\n var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\n return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\n function verb(n) { return function (v) { return step([n, v]); }; }\n function step(op) {\n if (f) throw new TypeError(\"Generator is already executing.\");\n while (g && (g = 0, op[0] && (_ = 0)), _) try {\n if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\n if (y = 0, t) op = [op[0] & 2, t.value];\n switch (op[0]) {\n case 0: case 1: t = op; break;\n case 4: _.label++; return { value: op[1], done: false };\n case 5: _.label++; y = op[1]; op = [0]; continue;\n case 7: op = _.ops.pop(); _.trys.pop(); continue;\n default:\n if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\n if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\n if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\n if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\n if (t[2]) _.ops.pop();\n _.trys.pop(); continue;\n }\n op = body.call(thisArg, _);\n } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\n if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\n }\n};\nexport var generateRandomNumber = function () {\n return Math.floor(Math.random() * 1000000);\n};\nexport var hashNumber = function (number) { return __awaiter(void 0, void 0, void 0, function () {\n var encoder, data, buffer;\n return __generator(this, function (_a) {\n switch (_a.label) {\n case 0:\n encoder = new TextEncoder();\n data = encoder.encode(number.toString());\n return [4 /*yield*/, crypto.subtle.digest(\"SHA-256\", data)];\n case 1:\n buffer = _a.sent();\n return [2 /*return*/, Array.from(new Uint8Array(buffer))\n .map(function (b) { return b.toString(16).padStart(2, \"0\"); })\n .join(\"\")];\n }\n });\n}); };\n","var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n return new (P || (P = Promise))(function (resolve, reject) {\n function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n step((generator = generator.apply(thisArg, _arguments || [])).next());\n });\n};\nvar __generator = (this && this.__generator) || function (thisArg, body) {\n var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\n return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\n function verb(n) { return function (v) { return step([n, v]); }; }\n function step(op) {\n if (f) throw new TypeError(\"Generator is already executing.\");\n while (g && (g = 0, op[0] && (_ = 0)), _) try {\n if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\n if (y = 0, t) op = [op[0] & 2, t.value];\n switch (op[0]) {\n case 0: case 1: t = op; break;\n case 4: _.label++; return { value: op[1], done: false };\n case 5: _.label++; y = op[1]; op = [0]; continue;\n case 7: op = _.ops.pop(); _.trys.pop(); continue;\n default:\n if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\n if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\n if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\n if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\n if (t[2]) _.ops.pop();\n _.trys.pop(); continue;\n }\n op = body.call(thisArg, _);\n } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\n if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\n }\n};\nvar __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {\n if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\n if (ar || !(i in from)) {\n if (!ar) ar = Array.prototype.slice.call(from, 0, i);\n ar[i] = from[i];\n }\n }\n return to.concat(ar || Array.prototype.slice.call(from));\n};\nimport { createLightNode, createEncoder, createDecoder, waitForRemotePeer, utils } from \"@waku/sdk\";\nimport { Type, Field } from \"protobufjs\";\nimport { TelemetryClient, TelemetryType, } from \"./telemetry_client\";\nimport { generateRandomNumber, hashNumber } from \"./util\";\nvar DEFAULT_CONTENT_TOPIC = \"/js-waku-examples/1/message-ratio/utf8\";\nvar TELEMETRY_URL = process.env.TELEMETRY_URL || \"http://localhost:8080/waku-metrics\";\nvar ProtoSequencedMessage = new Type(\"SequencedMessage\")\n .add(new Field(\"hash\", 1, \"string\"))\n .add(new Field(\"total\", 2, \"uint64\"))\n .add(new Field(\"index\", 3, \"uint64\"))\n .add(new Field(\"sender\", 4, \"string\"));\nvar sequenceCompletedEvent = new CustomEvent(\"sequenceCompleted\");\nvar messageSentEvent = new CustomEvent(\"messageSent\");\nvar wakuNode = function () { return __awaiter(void 0, void 0, void 0, function () {\n return __generator(this, function (_a) {\n switch (_a.label) {\n case 0: return [4 /*yield*/, createLightNode({\n networkConfig: {\n contentTopics: [DEFAULT_CONTENT_TOPIC],\n },\n defaultBootstrap: true,\n })];\n case 1: return [2 /*return*/, _a.sent()];\n }\n });\n}); };\nexport function app(telemetryClient) {\n return __awaiter(this, void 0, void 0, function () {\n var node, peerId, encoder, startLightPushSequence, startFilterSubscription;\n var _this = this;\n return __generator(this, function (_a) {\n switch (_a.label) {\n case 0: return [4 /*yield*/, wakuNode()];\n case 1:\n node = _a.sent();\n return [4 /*yield*/, node.start()];\n case 2:\n _a.sent();\n return [4 /*yield*/, waitForRemotePeer(node)];\n case 3:\n _a.sent();\n peerId = node.libp2p.peerId.toString();\n encoder = createEncoder({\n contentTopic: DEFAULT_CONTENT_TOPIC,\n });\n startLightPushSequence = function (numMessages_1) {\n var args_1 = [];\n for (var _i = 1; _i < arguments.length; _i++) {\n args_1[_i - 1] = arguments[_i];\n }\n return __awaiter(_this, __spreadArray([numMessages_1], args_1, true), void 0, function (numMessages, period) {\n var sequenceHash, sequenceTotal, sequenceIndex, sendMessage;\n var _this = this;\n if (period === void 0) { period = 3000; }\n return __generator(this, function (_a) {\n switch (_a.label) {\n case 0: return [4 /*yield*/, hashNumber(generateRandomNumber())];\n case 1:\n sequenceHash = _a.sent();\n sequenceTotal = numMessages;\n sequenceIndex = 0;\n sendMessage = function () { return __awaiter(_this, void 0, void 0, function () {\n var message, payload, result, messageElement, messagesSent, error_1;\n return __generator(this, function (_a) {\n switch (_a.label) {\n case 0:\n _a.trys.push([0, 2, , 3]);\n message = ProtoSequencedMessage.create({\n hash: sequenceHash,\n total: sequenceTotal,\n index: sequenceIndex,\n sender: peerId,\n });\n payload = ProtoSequencedMessage.encode(message).finish();\n return [4 /*yield*/, node.lightPush.send(encoder, {\n payload: payload,\n timestamp: new Date(),\n })];\n case 1:\n result = _a.sent();\n console.log(\"===\");\n console.log(\"light push successes: \", result.successes.length);\n console.log(result.successes);\n console.log(\"light push failures: \", result.failures.length);\n console.log(result.failures);\n if (result.successes.length > 0) {\n // Push to telemetry client\n telemetryClient.push([\n {\n messageType: TelemetryType.LIGHT_PUSH_FILTER,\n timestamp: Math.floor(new Date().getTime() / 1000),\n peerIdSender: peerId,\n peerIdReporter: peerId,\n sequenceHash: sequenceHash,\n sequenceTotal: sequenceTotal,\n sequenceIndex: sequenceIndex,\n contentTopic: DEFAULT_CONTENT_TOPIC,\n pubsubTopic: utils.contentTopicToPubsubTopic(DEFAULT_CONTENT_TOPIC),\n },\n ]);\n messageElement = document.createElement(\"div\");\n messagesSent = document.getElementById(\"messagesSent\");\n messageElement.textContent = \"Message: \".concat(sequenceHash, \" \").concat(sequenceIndex, \" of \").concat(sequenceTotal);\n messagesSent.insertBefore(messageElement, messagesSent.firstChild);\n messagesSent.insertBefore(document.createElement(\"br\"), messagesSent.firstChild);\n document.dispatchEvent(messageSentEvent);\n // Increment sequence\n sequenceIndex++;\n }\n if (result.failures.length > 0) {\n telemetryClient.push(result.failures.map(function (failure) {\n var _a;\n return ({\n messageType: TelemetryType.LIGHT_PUSH_ERROR,\n timestamp: Math.floor(new Date().getTime() / 1000),\n peerId: peerId,\n peerIdRemote: (_a = failure.peerId) === null || _a === void 0 ? void 0 : _a.toString(),\n errorMessage: failure.error.toString(),\n contentTopic: DEFAULT_CONTENT_TOPIC,\n });\n }));\n }\n if (sequenceIndex < sequenceTotal) {\n setTimeout(sendMessage, period); // Schedule the next send\n }\n else {\n document.dispatchEvent(sequenceCompletedEvent);\n }\n return [3 /*break*/, 3];\n case 2:\n error_1 = _a.sent();\n console.error(\"Error sending message\", error_1);\n return [3 /*break*/, 3];\n case 3: return [2 /*return*/];\n }\n });\n }); };\n sendMessage(); // Start the recursive sending\n return [2 /*return*/];\n }\n });\n });\n };\n startFilterSubscription = function () { return __awaiter(_this, void 0, void 0, function () {\n var decoder, messagesReceived, subscriptionCallback;\n return __generator(this, function (_a) {\n switch (_a.label) {\n case 0:\n decoder = createDecoder(DEFAULT_CONTENT_TOPIC);\n messagesReceived = document.getElementById(\"messagesReceived\");\n subscriptionCallback = function (message) {\n var sequencedMessage = ProtoSequencedMessage.decode(message.payload);\n // Don't bother reporting messages sent by this same node\n if (sequencedMessage.sender === peerId) {\n return;\n }\n telemetryClient.push([\n {\n messageType: TelemetryType.LIGHT_PUSH_FILTER,\n timestamp: Math.floor(new Date().getTime() / 1000),\n peerIdSender: sequencedMessage.sender,\n peerIdReporter: peerId,\n sequenceHash: sequencedMessage.hash,\n sequenceTotal: sequencedMessage.total,\n sequenceIndex: sequencedMessage.index,\n contentTopic: DEFAULT_CONTENT_TOPIC,\n pubsubTopic: utils.contentTopicToPubsubTopic(DEFAULT_CONTENT_TOPIC),\n },\n ]);\n var messageElement = document.createElement(\"div\");\n messageElement.textContent = \"Message: \".concat(sequencedMessage.hash, \" \").concat(sequencedMessage.index, \" of \").concat(sequencedMessage.total);\n messagesReceived.appendChild(messageElement);\n messagesReceived.appendChild(document.createElement(\"br\"));\n };\n return [4 /*yield*/, node.filter.subscribe(decoder, subscriptionCallback)];\n case 1:\n _a.sent();\n return [2 /*return*/];\n }\n });\n }); };\n return [2 /*return*/, {\n node: node,\n startLightPushSequence: startLightPushSequence,\n startFilterSubscription: startFilterSubscription,\n }];\n }\n });\n });\n}\n(function () { return __awaiter(void 0, void 0, void 0, function () {\n function startSequence() {\n var numMessages = Math.floor(Math.random() * 16) + 5;\n var messagePeriod = Math.floor(Math.random() * 2001) + 5000;\n startLightPushSequence(numMessages, messagePeriod);\n }\n var telemetryClient, _a, node, startLightPushSequence, startFilterSubscription, runningScreen, sentMessagesCount, sentMessagesCounter;\n return __generator(this, function (_b) {\n switch (_b.label) {\n case 0:\n telemetryClient = new TelemetryClient(TELEMETRY_URL, 5000);\n return [4 /*yield*/, app(telemetryClient)];\n case 1:\n _a = _b.sent(), node = _a.node, startLightPushSequence = _a.startLightPushSequence, startFilterSubscription = _a.startFilterSubscription;\n window.waku = node;\n runningScreen = document.getElementById(\"runningScreen\");\n runningScreen.style.display = \"block\";\n return [4 /*yield*/, telemetryClient.start()];\n case 2:\n _b.sent();\n startFilterSubscription();\n sentMessagesCount = 0;\n sentMessagesCounter = document.getElementById(\"numSent\");\n document.addEventListener(\"messageSent\", function () {\n sentMessagesCount++;\n sentMessagesCounter.textContent = sentMessagesCount.toString();\n });\n document.addEventListener(sequenceCompletedEvent.type, function () { return startSequence(); });\n startSequence();\n return [2 /*return*/];\n }\n });\n}); })();\n"],"names":["module","exports","fn","ctx","params","Array","arguments","length","offset","index","pending","Promise","resolve","reject","err","apply","base64","string","p","n","charAt","Math","ceil","b64","s64","i","encode","buffer","start","end","t","parts","chunk","j","b","push","String","fromCharCode","slice","join","invalidEncoding","decode","c","charCodeAt","undefined","Error","test","codegen","functionParams","functionName","body","Codegen","formatStringOrScope","source","toString","verbose","console","log","scopeKeys","Object","keys","scopeParams","scopeValues","scopeOffset","Function","formatParams","formatOffset","replace","$0","$1","value","Number","floor","JSON","stringify","functionNameOverride","EventEmitter","this","_listeners","prototype","on","evt","off","listeners","splice","emit","args","fetch","asPromise","fs","inquire","filename","options","callback","xhr","readFile","contents","XMLHttpRequest","binary","onreadystatechange","readyState","status","response","responseText","Uint8Array","overrideMimeType","responseType","open","send","factory","Float32Array","f32","f8b","le","writeFloat_f32_cpy","val","buf","pos","writeFloat_f32_rev","readFloat_f32_cpy","readFloat_f32_rev","writeFloatLE","writeFloatBE","readFloatLE","readFloatBE","writeFloat_ieee754","writeUint","sign","isNaN","round","exponent","LN2","pow","readFloat_ieee754","readUint","uint","mantissa","NaN","Infinity","bind","writeUintLE","writeUintBE","readUintLE","readUintBE","Float64Array","f64","writeDouble_f64_cpy","writeDouble_f64_rev","readDouble_f64_cpy","readDouble_f64_rev","writeDoubleLE","writeDoubleBE","readDoubleLE","readDoubleBE","writeDouble_ieee754","off0","off1","readDouble_ieee754","lo","hi","moduleName","mod","eval","e","path","isAbsolute","normalize","split","absolute","prefix","shift","originPath","includePath","alreadyNormalized","alloc","size","SIZE","MAX","slab","call","utf8","len","read","write","c1","c2","formatArgs","useColors","namespace","humanize","diff","color","lastC","match","save","namespaces","storage","setItem","removeItem","error","load","r","getItem","process","env","DEBUG","window","type","__nwjs","navigator","userAgent","toLowerCase","document","documentElement","style","WebkitAppearance","firebug","exception","table","parseInt","RegExp","localStorage","localstorage","destroy","warned","warn","colors","debug","formatters","v","message","createDebug","prevTime","namespacesCache","enabledCache","enableOverride","enabled","self","curr","Date","ms","prev","coerce","unshift","format","formatter","selectColor","extend","defineProperty","enumerable","configurable","get","set","init","delimiter","newDebug","toNamespace","regexp","substring","default","stack","disable","names","map","skips","enable","name","forEach","key","hash","abs","assign","obj","props","code","TypeError","_","ErrClass","create","getPrototypeOf","event_iterator_1","EventIterator","EventQueue","constructor","pullQueue","pushQueue","eventHandlers","isPaused","isStopped","resolution","done","placeholder","highWaterMark","highWater","stop","remove","fail","rejection","catch","then","removeCallback","Symbol","asyncIterator","next","result","lowWaterMark","lowWater","return","listen","queue","event","freeze","has","hasOwnProperty","Events","EE","context","once","addListener","emitter","listener","_events","_eventsCount","clearEvent","__proto__","eventNames","events","getOwnPropertySymbols","concat","handlers","l","ee","listenerCount","a1","a2","a3","a4","a5","removeListener","removeAllListeners","prefixed","max","cache","_cache","update","clear","root","HI_BASE32_NO_NODE_JS","versions","node","global","COMMON_JS","HI_BASE32_NO_COMMON_JS","AMD","BASE32_ENCODE_CHAR","BASE32_DECODE_CHAR","blocks","throwInvalidUtf8","position","partial","substr","decodeAsBytes","base32Str","v1","v2","v3","v4","v5","v6","v7","v8","bytes","count","remain","asciiOnly","str","followingChars","toUtf8String","indexOf","input","notString","ArrayBuffer","encodeBytes","encodeAscii","encodeUtf8","asBytes","base32","electron","INPUT_ERROR","WINDOW","JS_SHA3_NO_WINDOW","WEB_WORKER","JS_SHA3_NO_NODE_JS","JS_SHA3_NO_COMMON_JS","ARRAY_BUFFER","JS_SHA3_NO_ARRAY_BUFFER","HEX_CHARS","CSHAKE_PADDING","SHIFT","RC","BITS","SHAKE_BITS","OUTPUT_TYPES","CSHAKE_BYTEPAD","isArray","isView","JS_SHA3_NO_ARRAY_BUFFER_IS_VIEW","formatMessage","empty","cloneArray","array","newArray","createOutputMethod","bits","padding","outputType","Keccak","createShakeOutputMethod","outputBits","createCshakeOutputMethod","s","methods","createKmacOutputMethod","createOutputMethods","method","createMethod","algorithms","w","bytepad","Kmac","methodNames","algorithm","methodName","newMethodName","reset","finalized","block","blockCount","byteCount","outputBlocks","extraBytes","isString","lastByteIndex","f","x","right","o","encodeString","strs","paddingBytes","zeros","finalize","hex","arrayBuffer","Uint32Array","digest","h","c0","c3","c4","c5","c6","c7","c8","c9","b0","b1","b2","b3","b4","b5","b6","b7","b8","b9","b10","b11","b12","b13","b14","b15","b16","b17","b18","b19","b20","b21","b22","b23","b24","b25","b26","b27","b28","b29","b30","b31","b32","b33","b34","b35","b36","b37","b38","b39","b40","b41","b42","b43","b44","b45","b46","b47","b48","b49","isOptionObject","propertyIsEnumerable","object","writable","globalThis","defaultMergeOptions","concatArrays","ignoreUndefined","getEnumerableOwnPropertyKeys","symbols","symbol","clone","cloneOptionObject","mergeKeys","merged","config","merge","resultIndex","indices","k","filter","includes","option","m","d","plural","msAbs","isPlural","exec","parseFloat","parse","isFinite","long","fmtShort","library","_validBytes","isInteger","_x86Multiply","_x86Rotl","_x86Fmix","_x64Add","_x64Multiply","_x64Rotl","_x64LeftShift","_x64Xor","_x64Fmix","x86","hash32","seed","inputValidation","remainder","h1","k1","hash128","h2","h3","h4","k2","k3","k4","x64","murmurHash3","Netmask","atob","chr","chr0","chrA","chra","ip2long","long2ip","ip","ref","base","dmax","net","mask","maskLong","error1","bitmask","netLong","hostmask","first","last","broadcast","contains","lastLong","common","timeType","commonRe","json","nested","google","protobuf","Any","fields","type_url","id","Duration","seconds","nanos","Timestamp","Empty","Struct","keyType","Value","oneofs","kind","oneof","nullValue","numberValue","stringValue","boolValue","structValue","listValue","NullValue","values","NULL_VALUE","ListValue","rule","DoubleValue","FloatValue","Int64Value","UInt64Value","Int32Value","UInt32Value","BoolValue","StringValue","BytesValue","FieldMask","paths","file","converter","Enum","util","genValuePartial_fromObject","gen","field","fieldIndex","prop","defaultAlreadyEmitted","resolvedType","typeDefault","repeated","fullName","isUnsigned","genValuePartial_toObject","fromObject","mtype","fieldsArray","safeProp","toObject","sort","compareFieldsById","repeatedFields","mapFields","normalFields","partOf","valuesById","low","high","unsigned","toNumber","arrayDefault","hasKs2","_fieldsArray","group","types","defaults","basic","packed","rfield","required","missing","wireType","mapKey","genTypePartial","optional","ReflectionObject","className","Namespace","comment","comments","valuesOptions","reserved","fromJSON","enm","toJSON","toJSONOptions","keepComments","Boolean","add","isReservedId","isReservedName","allow_alias","Field","Type","ruleRe","isObject","defaultValue","Long","extensionField","declaringField","_packed","getOption","setOption","ifNotSet","resolved","parent","lookupTypeOrEnum","proto3_optional","fromNumber","newBuffer","emptyObject","emptyArray","ctor","fieldId","fieldType","fieldRule","decorateType","decorateEnum","fieldName","_configure","Type_","build","Root","loadSync","encoder","decoder","verifier","OneOf","MapField","Service","Method","Message","wrappers","configure","Writer","BufferWriter","Reader","BufferReader","rpc","roots","tokenize","resolvedKeyType","fieldKeyType","fieldValueType","properties","$type","writer","encodeDelimited","reader","decodeDelimited","verify","requestType","requestStream","responseStream","parsedOptions","resolvedRequestType","resolvedResponseType","lookupType","arrayToJSON","_nestedArray","clearCache","addJSON","toArray","nestedArray","nestedJson","getEnum","setOptions","onAdd","onRemove","define","ptr","part","resolveAll","lookup","filterTypes","parentAlreadyChecked","found","lookupEnum","lookupService","Service_","Enum_","defineProperties","_handleAdd","_handleRemove","setParsedOption","propName","opt","find","newValue","setProperty","newOpt","Root_","fieldNames","addFieldsToParent","oneofName","oneOfGetter","oneOfSetter","keepCase","base10Re","base10NegRe","base16Re","base16NegRe","base8Re","base8NegRe","numberRe","nameRe","typeRefRe","fqTypeRefRe","pkg","imports","weakImports","syntax","token","preferTrailingComment","tn","alternateCommentMode","peek","skip","cmnt","head","isProto3","applyCase","camelCase","illegal","insideTryCatch","line","readString","readValue","acceptTypeRef","parseNumber","readRanges","target","acceptStrings","parseId","dummy","ifBlock","parseOption","parseInlineOptions","acceptNegative","parsePackage","parseImport","whichImports","parseSyntax","parseCommon","parseType","parseEnum","service","commentText","parseMethod","parseService","reference","parseField","parseExtension","fnIf","fnElse","trailingLine","valueType","parseMapField","parseOneOf","extensions","endsWith","startsWith","lcFirst","ucFirst","parseGroup","parseEnumValue","isCustom","parseOptionValue","objectResult","lastValue","prevValue","simpleValue","LongBits","indexOutOfRange","writeLength","RangeError","create_array","Buffer","isBuffer","readLongVarint","readFixed32_end","readFixed64","_slice","subarray","uint32","int32","sint32","bool","fixed32","sfixed32","float","double","nativeBuffer","skipType","BufferReader_","int64","uint64","sint64","zzDecode","fixed64","sfixed64","utf8Slice","min","deferred","files","SYNC","resolvePath","sync","finish","cb","getBundledFileName","idx","lastIndexOf","altname","parsed","queued","weak","setTimeout","readFileSync","isNode","exposeRe","tryHandleExtension","extendedType","sisterField","parse_","common_","rpcImpl","requestDelimited","responseDelimited","rpcCall","requestCtor","responseCtor","request","endedByRPC","_methodsArray","inherited","methodsArray","rpcService","isReserved","q","delimRe","stringDoubleRe","stringSingleRe","setCommentRe","setCommentAltRe","setCommentSplitRe","whitespaceRe","unescapeRe","unescapeMap","unescape","lastCommentLine","stringDelim","subject","setComment","isLeading","lineEmpty","leading","commentOffset","lines","trim","text","isDoubleSlashCommentLine","startOffset","endOffset","findEndOfLine","lineText","cursor","re","lastIndex","repeat","isDoc","isLeadingComment","expected","actual","ret","_fieldsById","_oneofsArray","_ctor","fieldsById","oneofsArray","generateConstructor","ctorProperties","setup","wrapper","originalThis","fork","ldelim","typeName","bake","safePropBackslashRe","safePropQuoteRe","toUpperCase","camelCaseRe","a","decorateRoot","decorateEnumIndex","dst","setProp","zero","zzEncode","zeroHash","from","fromString","toLong","fromHash","toHash","part0","part1","part2","src","newError","CustomError","captureStackTrace","pool","isset","isSet","utf8Write","_Buffer_from","_Buffer_allocUnsafe","sizeOrArray","dcodeIO","key2Re","key32Re","key64Re","longToHash","longFromHash","fromBits","ProtocolError","fieldMap","longs","enums","encoding","allocUnsafe","seenFirstField","invalid","genVerifyKey","genVerifyValue","oneofProp","Op","noop","State","tail","states","writeByte","VarintOp","writeVarint64","writeFixed32","_push","writeBytes","BufferWriter_","writeStringBuffer","writeBytesBuffer","copy","byteLength","BufferSourceConverter","isArrayBuffer","data","toArrayBuffer","byteOffset","toUint8Array","toView","isArrayBufferView","isBufferSource","isEqual","aView","bView","buffers","res","view","STRING_TYPE","HEX_REGEX","BASE64_REGEX","BASE64URL_REGEX","Utf8Converter","encodeURIComponent","uintArray","encodedString","decodeURIComponent","escape","Utf16Converter","littleEndian","dataView","DataView","getUint16","setUint16","Convert","isHex","isBase64","isBase64Url","ToString","enc","ToUtf8String","ToBinary","ToHex","ToBase64","ToBase64Url","FromString","FromUtf8String","FromBinary","FromHex","FromBase64","FromBase64Url","btoa","formatted","formatString","base64url","Base64Padding","DEFAULT_UTF8_ENCODING","stringLength","resultView","byte","hexString","ToUtf16String","FromUtf16String","padCount","__webpack_module_cache__","leafPrototypes","getProto","__webpack_require__","moduleId","cachedModule","__webpack_modules__","amdO","mode","__esModule","ns","def","current","getOwnPropertyNames","definition","toStringTag","N1","N2","N3","N4","N5","N6","N7","MSB","REST","encodingLength","MAX_SAFE_INTEGER","encodeUint8Array","decodeUint8Array","encodeUint8ArrayList","decodeUint8ArrayList","d8b","MAX_SAFE_NUMBER_INTEGER","BigInt","MIN_SAFE_NUMBER_INTEGER","MIN_SAFE_INTEGER","toBigInt","fromBigInt","negative","TWO_32","readFixed32End","Uint8ArrayReader","int64Number","int64String","uint64Number","uint64String","sint64Number","sint64String","fixed64Number","fixed64String","sfixed64Number","sfixed64String","decodeMessage","codec","opts","createReader","ALPHABET","BASE_MAP","xc","BASE","LEADER","FACTOR","iFACTOR","decodeUnsafe","psz","zeroes","b256","carry","it3","it4","vch","pbegin","pend","b58","it1","it2","Encoder","baseEncode","Decoder","baseDecode","prefixCodePoint","codePointAt","or","ComposedDecoder","decoders","left","Codec","baseX","alphabet","rfc4648","bitsPerChar","pad","out","codes","written","SyntaxError","base10","base16","base16upper","base2","alphabetBytesToChars","reduce","alphabetCharsToBytes","base256emoji","byts","char","byt","base32upper","base32pad","base32padupper","base32hex","base32hexupper","base32hexpad","base32hexpadupper","base32z","base36","base36upper","base58btc","base58flickr","base64pad","base64urlpad","base8","identity","TextDecoder","TextEncoder","textEncoder","textDecoder","MSBALL","INT","MSB$1","REST$1","N8","N9","num","oldOffset","counter","encodeTo","int","sizeOffset","digestOffset","Digest","multihash","Hasher","sha","async","crypto","subtle","link","version","cid","toStringV0","baseCache","toStringV1","WeakMap","Map","CID","asCID","toV0","DAG_PB_CODE","SHA_256_CODE","createV0","toV1","createV1","equals","other","unknown","aa","bb","ii","for","encodeCID","cidSymbol","decodeFirst","specs","inspectBytes","prefixSize","multihashSize","multihashBytes","digestBytes","digestSize","multihashCode","initialBytes","parseCIDtoBytes","codeOffset","hashOffset","bases","createCodec","ascii","latin1","bufferPool","Uint8ArrayWriter","writeVarint32","super","encodeMessage","lengthDelimited","CODEC_TYPES","RateLimitProof","WakuMessage","FilterRequest","MessagePush","FilterRpc","TopicOnlyMessage","FilterSubscribeRequest","PushRequest","PushResponse","WakuMessageKeyValue","PeerInfo","PeerExchangeQuery","PeerExchangeResponse","WakuMetadataRequest","WakuMetadataResponse","enumeration","findValue","VARINT","enumValue","LENGTH_DELIMITED","MaxLengthError","isDefined","groupByContentTopic","groupedDecoders","decs","contentTopic","wait","_codec","proof","merkleRoot","epoch","shareX","shareY","nullifier","rlnIdentifier","tag","payload","timestamp","meta","rateLimitProof","ephemeral","limits","ContentFilter","subscribe","topic","contentFilters","contentFilters$","messages","messages$","requestId","FilterSubscribeType","__FilterSubscribeTypeValues","filterSubscribeType","pubsubTopic","contentTopics","SUBSCRIBER_PING","FilterSubscribeResponse","statusCode","statusDesc","wakuMessage","isSuccess","info","PushRpc","messageHash","StoreQueryRequest","includeData","timeStart","timeEnd","messageHashes","paginationCursor","paginationForward","paginationLimit","StoreQueryResponse","enr","numPeers","peerInfos","peerInfos$","PeerExchangeRPC","query","clusterId","shards","number","isSafeInteger","lengths","outputLen","blockLen","exists","instance","checkFinished","destroyed","finished","arr","rotr","word","nextTick","asyncLoop","iters","tick","ts","now","toBytes","Hash","_cloneInto","toStr","hashCons","hashC","msg","tmp","bytesLength","getRandomValues","Maj","HashMD","padOffset","isLE","take","roundClean","digestInto","output","fill","setBigUint64","_32n","_u32_max","wh","wl","setUint32","oview","outLen","state","to","SHA256_K","SHA256_IV","SHA256_W","SHA256","A","B","C","D","E","F","G","H","getUint32","W15","W2","s0","s1","T1","T2","Protocols","Tags","EPeersByDiscoveryEvents","EConnectionStateEvents","DNS_DISCOVERY_TAG","DEFAULT_CLUSTER_ID","DefaultNetworkConfig","HealthStatus","bytesToUtf8","byteArrays","totalLength","acc","singleShardInfoToPubsubTopic","shardInfo","shard","shardInfoToPubsubTopics","Set","contentTopicToPubsubTopic","application","pubsubTopicToSingleShardInfo","pubsubTopics","pubsubTopicsToShardInfo","shardInfoSet","clusterIds","ensurePubsubTopicIsConfigured","configuredTopics","networkShards","generation","topicName","ensureValidContentTopic","dataview","getBigUint64","contentTopicToShardIndex","determinePubsubTopic","pubsubTopicShardInfo","decodeRelayShard","byteIndex","bitIndex","getUint8","numIndices","encodeRelayShard","setUint8","delay","APP_NAME","Logger","_info","_warn","_error","createDebugNamespace","level","logger","OneMillion","DecodedMessage","proto","_rawTimestamp","metaSetter","toWire","toProtoObj","protoMessage","valueOf","createEncoder","fromWireToProtoObj","fromProtoObj","entry","arrays","findBufAndOffset","bufs","bufEnd","isUint8ArrayList","Uint8ArrayList","appendAll","iterator","append","prepend","prependAll","reverse","consume","trunc","beginInclusive","endExclusive","_subList","sublist","list","bufStart","sliceStartInBuf","sliceEndsInBuf","search","needle","M","rightmostPositions","Int32Array","lastPatIndex","getInt8","setInt8","getInt16","setInt16","getInt32","setInt32","getBigInt64","setBigInt64","getFloat32","setFloat32","getFloat64","setFloat64","fromUint8Arrays","thing","defaultEncoder","lengthLength","lengthBuf","encodeLength","lengthEncoder","maybeYield","single","InvalidMessageLengthError","InvalidDataLengthError","InvalidDataLengthLengthError","UnexpectedEOFError","ReadMode","defaultDecoder","LENGTH","dataLength","lengthDecoder","maxLengthLength","maxDataLength","dataLengthLength","onLength","DATA","onData","pDefer","promise","fromReader","FixedFIFO","top","btm","hwm","isEmpty","FIFO","splitLimit","calculateSize","AbortError","pushable","getNext","onNext","ended","onEnd","drain","bufferNext","objectMode","bufferError","queueMicrotask","throw","readableLength","onEmpty","signal","throwIfAborted","cancel","addEventListener","race","removeEventListener","_pushable","sources","syncSources","all","item","pipe","rest","isDuplex","duplex","isIterable","fns","sink","duplexPipelineFn","rawPipe","stream","sourceWrap","StreamManager","multicodec","getConnections","streamPool","handlePeerUpdateStreamPool","getStream","peer","peerIdStr","streamPromise","createStream","delete","prepareStream","retries","connection","connections","latestConnection","timeline","selectConnection","newStream","backoff","timeoutPromise","detail","protocols","isConnectedTo","peerId","some","BaseProtocol","components","addLibp2pEventListener","removeLibp2pEventListener","streamManager","connectionManager","peerStore","allPeers","peers","getPeersForProtocol","connectedPeers","getPeers","maxBootstrapPeers","filteredPeers","bootstrapPeers","tags","BOOTSTRAP","nonBootstrapPeers","selectedPeers","randomIndex","random","randomPeer","filterPeersByDiscovery","peerPromises","remotePeer","protocol","encodedPeerShardInfo","metadata","peerShardInfo","getConnectedPeersForProtocolAndShard","sortedFilteredPeers","pingBytes","ping","sortPeersByLatency","randomUUID","rnds8","rng","byteToHex","rnds","unsafeStringify","FilterPushRpc","FilterSubscribeRpc","createSubscribeRequest","SUBSCRIBE","createUnsubscribeRequest","UNSUBSCRIBE","createUnsubscribeAllRequest","UNSUBSCRIBE_ALL","createSubscriberPingRequest","FilterCodecs","FilterCore","handleIncomingMessage","libp2p","handle","onRequest","maxInboundStreams","success","failure","GENERIC_FAIL","REMOTE_PEER_REJECTED","unsubscribe","NO_STREAM_AVAILABLE","unsubscribeRequest","unsubscribeAll","NO_RESPONSE","streamData","createRequest","LightPushCore","preparePushMessage","EMPTY_PAYLOAD","isWireSizeUnderCap","isMessageSizeUnderCap","SIZE_TOO_BIG","ENCODE_FAILED","preparationError","DECODE_FAILED","rlnErrorCase","rlnErrorMap","RLN_IDENTITY_MISSING","RLN_MEMBERSHIP_INDEX","RLN_LIMIT_MISSING","infoLowerCase","errorKey","RLN_PROOF_GENERATION","matchRLNErrorMessage","EmptyMessage","ONE_MILLION","getTime","StoreCore","queryPerPage","queryOpts","currentCursor","storeQueryRequest","storeQueryResponse","errorMessage","decodedMessages","protoMsg","wire","TimeoutError","getDOMException","DOMException","getAbortedReason","reason","pTimeout","milliseconds","fallback","customTimers","clearTimeout","timer","cancelablePromise","aborted","POSITIVE_INFINITY","timeoutError","finally","normalizeEmitter","pEvent","arrayPromise","returnValue","rejectionEvents","multiArgs","resolveImmediately","flat","items","onItem","arguments_","rejectHandler","rejectionEvent","timeout","pEventMultiple","waitForRemotePeer","waku","timeoutMs","relay","Relay","Filter","store","Store","lightPush","LightPush","getEnabledProtocols","isStarted","promises","getMeshPeers","gossipSub","waitForGossipSubPeerInMesh","waitForConnectedPeer","services","rejectReason","awaitTimeout","rejectOnTimeout","metadataService","any","confirmOrAttemptHandshake","_resolve","TypedEventEmitter","EventTarget","dispatchEvent","safeDispatchEvent","CustomEvent","KeepAliveManager","pingKeepAliveTimers","relayKeepAliveTimers","pingKeepAlive","pingPeriodSecs","relayKeepAlive","relayPeriodSecs","interval","setInterval","intervals","scheduleRelayPings","clearInterval","stopAll","connectionsExist","ConnectionManager","configuredPubsubTopics","static","keepAliveManager","dialAttemptsForPeer","dialErrorsForPeer","currentActiveParallelDialCount","pendingPeerDialQueue","isP2PNetworkConnected","isConnected","onLine","keepAliveOptions","instances","onEventHandlers","stopNetworkStatusListener","dropConnection","hangUp","getPeersByDiscovery","peersDiscovered","peersConnected","conn","peersDiscoveredByBootstrap","peersDiscoveredByPeerExchange","peersDiscoveredByLocal","peersConnectedByBootstrap","peersConnectedByPeerExchange","peersConnectedByLocal","getTagNamesForPeer","PEER_EXCHANGE","LOCAL","DISCOVERED","CONNECTED","maxDialAttemptsForPeer","maxBootstrapPeersAllowed","maxParallelDials","startEventListeners","dialPeerStorePeers","dialPromises","peerInfo","attemptDial","startPeerDiscoveryListener","startPeerConnectionListener","startPeerDisconnectionListener","startNetworkStatusListener","dialPeer","dialAttempt","dial","AggregateError","errors","processDialQueue","attemptDnsDiscovery","dnsDiscovery","findPeers","shouldDialPeer","dispatchDiscoveryEvent","PEER_CONNECT_BOOTSTRAP","PEER_CONNECT_PEER_EXCHANGE","setP2PNetworkConnected","setP2PNetworkDisconnected","dispatchWakuConnectionEvent","isPeerTopicConfigured","getPeerShardInfo","isPeerDialableBasedOnBootstrapStatus","tagName","isBootstrap","PEER_DISCOVERY_BOOTSTRAP","PEER_DISCOVERY_PEER_EXCHANGE","shardInfoBytes","CONNECTION_STATUS","HealthManager","health","overallStatus","Unhealthy","protocolStatuses","getInstance","getHealthStatus","getProtocolStatus","updateProtocolHealth","getNameFromMulticodec","MinimallyHealthy","SufficientlyHealthy","lastUpdate","updateOverallHealth","statuses","getHealthManager","MetadataCodec","Metadata","libp2pComponents","handshakesConfirmed","registrar","NO_PEER_AVAILABLE","encodedResponse","decodeMetadataResponse","savePeerShardInfo","encodedShardInfo","wakuMetadata","peerIdSymbol","isPeerId","AggregateCodeError","ERR_TIMEOUT","MAX_IPV6_LENGTH","MAX_IPV4_LENGTH","parser","readAtomically","parseWith","peekChar","readChar","readGivenChar","readSeparator","sep","inner","readNumber","radix","maxDigits","allowZeroPrefix","maxBytes","digitCount","leadingChar","hasLeadingZero","maxValue","digit","readIPv4Addr","ix","readIPv6Addr","readGroups","groups","ipv4","headSize","headIp4","limit","tailSize","readIPAddr","isIPv4","new","isIPv6","isIP","isV4","isV6","sections","v4Buffer","argv","V","convertToString","ipBuff","ipString","bytes2ip","bytes2str","bytes2port","address","bytes2mh","addrBytes","portBytes","bytes2onion","bytes2mb","convertToBytes","ip2bytes","str2bytes","port2bytes","mh","mh2bytes","addr","port","portBuf","onion2bytes","onion32bytes","mbstr","mb","anybaseDecoder","mb2bytes","row","resolvable","createProtocol","bytesToMultiaddrParts","tuples","stringTuples","sizeForAddr","stringAddr","stringTuplesToString","tup","cleanPath","tuplesToBytes","inspect","DNS_CODES","Multiaddr","stringToMultiaddrParts","isMultiaddr","toOptions","family","transport","host","zone","tcp","udp","ip4","ip6","dns6","ip6zone","protos","protoCodes","protoNames","encapsulate","decapsulate","addrString","decapsulateCode","getPeerId","p2p","tuple","pop","getPath","resolvableProto","resolver","resolvers","nodeAddress","isThinWaistAddress","pubsubTopicBytes","contentTopicBytes","timestampBytes","bigIntTimestamp","numberToBytes","tryConvertTimestampToBytes","BaseProtocolSDK","core","healthManager","numPeersToUse","maintainPeersIntervalId","maintainPeersLock","renewPeersLocker","RenewPeerLocker","maintainPeersInterval","startMaintainPeersInterval","renewPeer","peerToDisconnect","findAndAddPeers","updatedPeers","updatePeers","lock","stopMaintainPeersInterval","hasPeers","autoRetry","forceUseAllPeers","initialDelay","maxAttempts","maxDelay","attempts","maintainPeers","delayMs","numPeersToAdd","cleanUnlocked","additionalPeers","findAdditionalPeers","dials","newPeers","isLocked","lockDuration","time","isTimeUnlocked","entries","SubscriptionManager","subscriptionCallbacks","receivedMessagesHashStr","peerFailures","receivedMessagesHashes","missedMessagesByPeer","keepAliveInterval","maxPingFailures","maxMissedMessagesThreshold","keepAliveTimer","allPeerIdStr","nodes","fromEntries","addHash","keepAlive","pingsBeforePeerRenewed","decodersArray","failures","TOPIC_DECODER_MISMATCH","successes","decodersGroupedByCT","results","allSettled","finalResult","handleResult","subscriptionCallback","startSubscriptionsMaintenance","stopSubscriptionsMaintenance","pingSpecificPeer","validateMessage","hashes","incrementMissedMessageCount","shouldRenewPeer","renewAndSubscribePeer","processIncomingMessage","hashedMessageStr","messageHashStr","decodePromises","dec","decoded","decodedMessage","pushMessage","promiseResult","coreResult","handlePeerFailure","newPeer","startKeepAlivePings","startConnectionListener","stopKeepAlivePings","stopConnectionListener","connectionListener","renewPeerPromises","currentCount","FilterSDK","_connectionManager","activeSubscriptions","subscription","getActiveSubscription","protocolUseOptions","subscribeOptions","uniquePubsubTopics","getUniquePubsubTopics","INVALID_DECODER_TOPICS","createSubscription","setActiveSubscription","subscribeWithUnsubscribe","toSubscriptionIterator","receiver","iteratorOptions","isWithTimeout","startTime","toAsyncIterator","LightPushSDK","_options","TOPIC_NOT_CONFIGURED","sendPromises","StoreSDK","queryGenerator","decodersAsMap","validateDecodersAndPubsubTopic","responseGenerator","queryWithOrderedCallback","processMessages","queryWithPromiseCallback","abort","page","_promises","msgPromise","processedMessages","createCursor","uniquePubsubTopicsInQuery","pubsubTopicForQuery","DefaultUserAgent","DefaultPingMaxInboundStreams","WakuNode","protocolsEnabled","lightpush","wakuLightPush","wakuFilter","_protocols","mapToPeerIdOrMultiaddr","codecs","multicodecs","dialProtocol","getLocalMultiaddrWithID","localMultiaddr","getMultiaddrs","isPromise","U32_MASK64","fromBig","u64","lst","Ah","Al","toBig","shrSH","_l","shrSL","rotrSH","rotrSL","rotrBH","rotrBL","rotr32H","_h","rotr32L","rotlSH","rotlSL","rotlBH","rotlBL","Bh","Bl","add3L","Cl","add3H","Ch","add4L","Dl","add4H","Dh","add5H","Eh","add5L","El","SHA512_Kh","SHA512_Kl","SHA512_W_H","SHA512_W_L","SHA512","Fh","Fl","Gh","Gl","Hh","Hl","W15h","W15l","s0h","s0l","W2h","W2l","s1h","s1l","SUMl","SUMh","sigma1h","sigma1l","CHIh","CHIl","T1ll","T1h","T1l","sigma0h","sigma0l","MAJh","MAJl","All","_0n","_1n","_2n","abool","title","padStart","hexToNumber","_0","_9","_A","_F","_a","_f","hl","al","ai","n1","n2","expectedLength","sum","isPosBig","bitMask","u8n","u8fr","createHmacDrbg","hashLen","qByteLen","hmacFn","reseed","sl","pred","validatorFns","bigint","function","boolean","stringOrUint8Array","Fp","isValid","validateObject","validators","optValidators","checkField","isOptional","checkVal","memoized","arg","computed","_3n","_4n","_5n","_8n","power","modulo","pow2","invert","y","u","FIELD_FIELDS","nLength","nBitLength","_nBitLength","nByteLength","ORDER","bitLen","redef","BYTES","sqrtP","P","p1div4","eql","sqr","mul","nv","sub","ONE","legendreC","Q","S","Z","Q1div2","neg","g","ZERO","t2","ge","tonelliShanks","FpSqrt","MASK","is0","isOdd","lhs","rhs","FpPow","div","sqrN","addN","subN","mulN","inv","sqrt","invertBatch","nums","lastMultiplied","inverted","reduceRight","FpInvertBatch","cmov","fromBytes","getFieldBytesLength","fieldOrder","bitLength","getMinHashLength","pointPrecomputes","pointWindowSizes","wNAF","constTimeNegate","condition","negate","validateW","W","windows","windowSize","unsafeLadder","elm","precomputeWindow","points","precomputes","maxNumber","shiftBy","wbits","offset1","offset2","cond1","cond2","wNAFCached","transform","comp","setWindowSize","validateBasic","curve","validateField","Gx","Gy","VERIFY_DEFAULT","zip215","ED25519_P","ED25519_SQRT_M1","ed25519_pow_2_252_3","_10n","_20n","_40n","_80n","b80","b160","b240","b250","pow_p_5_8","adjustScalarBytes","uvRatio","vx2","root1","root2","useRoot1","useRoot2","noRoot","ed25519Defaults","randomBytes","ed25519","curveDef","CURVE","domain","mapToCurve","validateOpts","prehash","cHash","cofactor","modP","phflag","aCoordinate","assertPoint","Point","toAffineMemo","iz","ex","ey","ez","z","ax","ay","zz","assertValidMemo","X","Y","et","T","X2","Y2","Z2","Z4","aX2","toAffine","fromAffine","normalizeZ","toInv","_setWindowSize","wnaf","assertValidity","X1","Y1","Z1","X1Z2","X2Z1","Y1Z2","Y2Z1","x1y1","X3","Y3","T3","Z3","subtract","multiply","scalar","CURVE_ORDER","multiplyUnsafe","I","isSmallOrder","isTorsionFree","clearCofactor","fromHex","normed","lastByte","y2","isXOdd","isLastByteOdd","fromPrivateKey","privKey","getExtendedPublicKey","point","toRawBytes","toHex","modN","modN_LE","hashed","pointBytes","hashDomainToScalar","msgs","verifyOpts","getPublicKey","R","sig","publicKey","SB","ExtendedPoint","utils","randomPrivateKey","precompute","x25519","montgomeryBits","powPminus2","Gu","montgomeryBytes","fieldLen","cswap","swap","x_2","x_3","a24","encodeUCoordinate","scalarMult","pointU","uEnc","decodeUCoordinate","_scalar","decodeScalar","pu","x_1","sw","z_2","z_3","k_t","AA","BB","DA","CB","dacb","da_cb","z2","montgomeryLadder","GuBytes","scalarMultBase","getSharedSecret","privateKey","montgomery","PUBLIC_KEY_BYTE_LENGTH","PRIVATE_KEY_BYTE_LENGTH","KEYS_BYTE_LENGTH","concatKeys","privateKeyRaw","win","nativeCrypto","derivedEmptyPasswordKey","alg","ext","key_ops","kty","exporter","password","cipher","keyLength","iterations","encrypt","salt","nonce","aesGcm","iv","cryptoKey","importKey","deriveParams","runtimeDerivedEmptyPassword","deriveKey","rawKey","ciphertext","decrypt","saltLength","plaintext","encryptedKey","KeyType","__KeyTypeValues","PublicKey","PrivateKey","Data","Ed25519PublicKey","_key","ensureKey","marshal","Ed25519","Ed25519PrivateKey","_publicKey","public","unmarshalEd25519PrivateKey","privateKeyBytes","publicKeyBytes","unmarshalEd25519PublicKey","generateKeyPairFromSeed","pair","derivePublicFromPrivate","exportKey","jwKey","keySize","jwk","HMAC","iHash","oHash","hmac","utilFromBase","inputBuffer","inputBase","utilToBase","internalReserved","internalValue","biggest","retBuf","retView","basis","utilConcatView","views","outputLength","prevLength","utilDecodeTC","valueHex","condition1","condition2","warnings","bigIntBuffer","bigIntView","bigInt","smallIntBuffer","smallIntView","padNumber","inputNumber","fullLength","dif","assertBigInt","baseBlock","inputOffset","inputLength","ViewWriter","final","powers2","digitsString","EMPTY_STRING","EMPTY_BUFFER","EMPTY_VIEW","END_OF_CONTENT_NAME","OCTET_STRING_NAME","BIT_STRING_NAME","HexBlock","BaseClass","isHexOnly","valueHexView","fromBER","endLength","blockLength","toBER","sizeOnly","NAME","LocalBaseBlock","valueBeforeDecode","valueBeforeDecodeView","blockName","ValueBlock","LocalIdentificationBlock","idBlock","_b","_c","_d","tagClass","tagNumber","isConstructed","firstOctet","encodedBuf","encodedView","curView","inputView","intBuffer","tagNumberMask","intTagNumberBuffer","tagNumberBufferMaxLength","tempBufferView","LocalLengthBlock","lenBlock","isIndefiniteForm","longFormUsed","lenOffset","lengthBufferView","typeStore","BaseBlock","primitiveSchema","parameters","valueBlockType","valueBlock","resultOffset","_writer","prepareIndefiniteForm","idBlockBuf","valueBlockBuf","lenBlockBuf","onAsciiEncoding","inputBuffer1","inputBuffer2","view1","view2","Constructed","BaseStringBlock","stringValueBlockType","getValue","setValue","fromBuffer","LocalPrimitiveValueBlock","_a$w","_a$v","_a$u","_a$t","_a$s","_a$r","_a$q","_a$p","_a$o","_a$n","_a$m","_a$l","_a$k","_a$j","_a$i","_a$h","_a$g","_a$f","_a$e","_a$d","_a$c","_a$b","_a$a","_a$9","_a$8","_a$7","_a$6","_a$5","_a$4","_a$3","_a$2","_a$1","Primitive","localFromBER","incomingOffset","returnObject","newASN1Type","EndOfContent","Integer","BitString","OctetString","Null","ObjectIdentifier","Enumerated","Utf8String","RelativeObjectIdentifier","TIME","Sequence","NumericString","PrintableString","TeletexString","VideotexString","IA5String","UTCTime","GeneralizedTime","GraphicString","VisibleString","GeneralString","UniversalString","CharacterString","BmpString","DATE","TimeOfDay","DateTime","newObject","inputObject","newType","localChangeType","LocalConstructedValueBlock","currentOffset","LocalEndOfContentValueBlock","override","LocalBooleanValueBlock","octet","LocalOctetStringValueBlock","currentBlockName","asn","content","LocalBitStringValueBlock","unusedBits","bitsStr","viewAdd","second","firstView","secondView","firstViewCopy","firstViewCopyLength","secondViewCopy","secondViewCopyLength","power2","digits","viewSub","LocalIntegerValueBlock","_valueDec","setValueHex","valueDec","modValue","tempBuf","tempView","fromDER","toDER","updatedView","firstBit","currentByte","bitNumber","asn1View","flag","byteNumber","bigIntValue","secondInt","convertToDER","integer","convertFromDER","LocalSidValueBlock","isFirstSid","valueBigInt","sidValue","LocalObjectIdentifierValueBlock","sidBlock","retBuffers","valueBuf","pos1","pos2","sid","plus","parsedSID","sidStr","sidArray","LocalRelativeSidValueBlock","LocalRelativeObjectIdentifierValueBlock","LocalStringValueBlock","LocalSimpleStringValueBlock","LocalSimpleStringBlock","inputString","strLen","LocalUtf8StringValueBlock","LocalBmpStringValueBlock","LocalUniversalStringValueBlock","copyBuffer","valueView","strLength","codeBuf","codeView","valueDate","year","month","day","hour","minute","fromDate","toBuffer","inputDate","getUTCFullYear","getUTCMonth","getUTCDate","getUTCHours","getUTCMinutes","getUTCSeconds","toDate","UTC","parserArray","outputArray","toISOString","millisecond","getUTCMilliseconds","isUTC","timeString","dateTimeString","fractionPart","hourDifference","minuteDifference","multiplier","differencePosition","differenceString","fractionPointPosition","fractionPartCheck","fractionResult","tempDate","getUTCDay","bnToBuf","bn","u8","bufToBn","exportToPem","keyBuf","keyArr","encryptionKey","dkLen","asyncTick","DK","PRF","PRFSalt","_password","_salt","_opts","checkOpts","pbkdf2Init","prfW","ti","Ti","pbkdf2Output","encrypted","pbkdf2Params","encryptionAlgorithm","finalWrapperBuf","MAX_RSA_KEY_SIZE","RsaPublicKey","der","RSA","RsaPrivateKey","genSecret","dp","dq","qi","unmarshalRsaPublicKey","fromJwk","generateKey","modulusLength","publicExponent","validateSigVerOpts","lowS","b2n","h2b","DER","Err","_parseInt","toSig","sBytes","rBytesLeft","hexFromSig","shl","rhl","rl","weierstrass","bits2int","bits2int_modN","compressedLen","uncompressedLen","invN","ProjectivePoint","normPrivateKeyToScalar","weierstrassEquation","isWithinCurveOrder","allowedPrivateKeyLengths","wrapPrivateKey","allowInfinityPoint","endo","beta","splitScalar","validatePointOpts","_isCompressed","x2","x3","N","assertPrjPoint","px","py","pz","hasEvenY","U1","U2","t0","t1","t3","t4","t5","sc","k1neg","k2neg","k1p","k2p","fake","f1p","f2p","multiplyAndAddUnsafe","isCompressed","_bits","weierstrassPoints","cat","sqrtError","suffix","numToNByteStr","isBiggerThanHalfOrder","slcNum","Signature","recovery","fromCompact","addRecoveryBit","recoverPublicKey","msgHash","rec","radj","ir","u1","u2","hasHighS","normalizeS","toDERRawBytes","toDERHex","toCompactRawBytes","toCompactHex","isValidPrivateKey","minLen","reduced","isProbPub","delta","ORDER_MASK","int2octets","defaultSigOpts","defaultVerOpts","privateA","publicB","k2sig","extraEntropy","ent","h1int","seedArgs","kBytes","ik","normS","prepSig","drbg","signature","sg","_sig","derError","is","getHash","secp256k1P","secp256k1N","divNearest","_6n","_11n","_22n","_23n","_44n","_88n","b88","b176","b220","b223","secp256k1","defHash","createCurve","POW_2_128","validatePublicKey","Secp256k1PublicKey","Secp256k1","Secp256k1PrivateKey","unmarshalSecp256k1PrivateKey","unmarshalSecp256k1PublicKey","supportedKeys","rsa","unsupportedKey","supported","typeToKey","marshalPublicKey","unmarshalRsaPrivateKey","serviceCapabilities","serviceDependencies","baseDecoder","LIBP2P_KEY_CODE","MARSHALLED_ED225519_PUBLIC_KEY_LENGTH","MARSHALLED_SECP256K1_PUBLIC_KEY_LENGTH","PeerIdImpl","toCID","peerIdFromString","RSAPeerIdImpl","Ed25519PeerIdImpl","Secp256k1PeerIdImpl","TRANSPORT_IPFS_GATEWAY_HTTP_CODE","URLPeerIdImpl","url","peerIdFromBytes","URL","peerIdFromCID","peerIdFromKeys","raceSignal","errorCode","errorName","QueuelessPushable","readNext","haveNext","nextResult","byteStream","readBuffer","abortPromise","unwrap","originalStream","yieldBytes","lpStream","decodeLength","lengthBuffer","writeV","flatMap","piped","NOISE_MSG_MAX_LENGTH_BYTES","DUMP_SESSION_KEYS","copyBytes","wrapCipher","clean","_utf8ToBytes","sigma16","sigma32","sigma16_32","sigma32_32","MAX_COUNTER","U32_EMPTY","createCipher","allowShortKeys","extendNonceFn","counterLength","counterRight","rounds","toClean","sigma","k32","nonceNcLen","nc","n32","isAligned","d32","o32","pos32","posj","runCipher","u8to16","Poly1305","Uint16Array","t6","t7","isLast","hibit","r0","r1","r2","r3","r4","r5","r6","r7","r8","r9","h0","h5","h6","h7","h8","h9","d0","d1","d2","d3","d4","d5","d6","d7","d8","d9","opos","poly1305","wrapConstructorWithKey","chachaCore","cnt","y00","y01","y02","y03","y04","y05","y06","y07","y08","y09","y10","y11","y12","y13","y14","y15","x00","x01","x02","x03","x04","x05","x06","x07","x08","x09","x10","x11","x12","x13","x14","x15","oi","chacha20","xchacha20","ZEROS16","updatePadded","ZEROS32","computeTag","AAD","authKey","_poly1305_aead","xorStream","plength","clength","passedTag","chacha20poly1305","blockSize","nonceLength","tagLength","HKDF_COUNTER","defaultCrypto","hashSHA256","getHKDF","ck","ikm","prk","extract","okm","HMACTmp","expand","generateX25519KeyPair","secretKey","generateX25519KeyPairFromSeed","generateX25519SharedKey","chaCha20Poly1305Encrypt","ad","chaCha20Poly1305Decrypt","uint16BEEncode","uint16BEDecode","logLocalStaticKeys","keyLogger","logLocalEphemeralKeys","logRemoteEphemeralKey","logCipherState","cs1","cs2","getUint64","Nonce","increment","getBytes","assertValue","ZEROLEN","CipherState","hasKey","encryptWithAd","decryptWithAd","SymmetricState","cs","protocolName","protocolNameBytes","hashProtocolName","mixKey","tempK","hkdf","mixHash","encryptAndHash","decryptAndHash","tempK1","tempK2","AbstractHandshakeState","ss","rs","initiator","prologue","writeE","generateKeypair","writeS","writeEE","dh","writeES","writeSE","readE","readS","cipherLength","temp","readEE","readES","readSE","XXHandshakeState","writeMessageA","writeMessageB","encS","writeMessageC","readMessageA","readMessageB","consumed","readMessageC","NoiseExtensions","NoiseHandshakePayload","createHandshakePayload","staticPublicKey","identitySig","getSignaturePayload","identityKey","decodeHandshakePayload","payloadBytes","remoteStaticKey","remoteIdentityKey","remoteIdentityKeyBytes","signaturePayload","webtransportCerthashes","Noise","staticKey","metrics","staticNoiseKey","prologueBytes","_crypto","keypair","wrapCrypto","xxHandshakeSuccesses","registerCounter","help","xxHandshakeErrors","encryptedPackets","decryptedPackets","decryptErrors","registerMetrics","secureOutbound","localPeer","parseArgs","wrappedConnection","handshake","performHandshakeInitiator","createSecureConnection","remoteExtensions","secureInbound","performHandshakeResponder","xx","trace","receivedPayload","forComponent","secure","user","duplexPair","network","encryptStream","decryptStream","noise","peerDiscoverySymbol","DNS4","DNS6","DNSADDR","DNS","IP","TCP","and","UDP","UTP","QUIC","QUICV1","_WebSockets","WebSockets","_WebSocketsSecure","WebSocketsSecure","HTTP","HTTPS","_WebRTCDirect","WebRTCDirect","_WebTransport","WebTransport","P2PWebRTCStar","P2PWebRTCDirect","Reliable","_P2P","_Circuit","CircuitRecursive","Circuit","P2P","makeMatchesFunction","partialMatch","ma","matches","pnames","Bootstrap","_init","candidate","peerData","multiaddrs","_discoverBootstrapPeers","tagValue","ttl","tagTTL","ENVELOPE_PAYLOAD_TYPE_PEER_RECORD","PeerRecord","AddressInfo","multiaddr","seq","addresses","peerRecord","seqNumber","DOMAIN","CODEC","marshaled","localeCompare","every","arrayEquals","Envelope","payloadType","RecordEnvelope","envelopeData","record","signData","formatSignaturePayload","envelope","createFromProtobuf","validate","domainUint8Array","domainLength","payloadTypeLength","payloadLength","func","vals","pattern","literal","certhash","matcher","matchers","fmt","toParts","exactMatch","_DNS4","_DNS6","_DNSADDR","_DNS","_IP4","_IP6","_IP","_IP_OR_DOMAIN","IP_OR_DOMAIN","_TCP","_UDP","_QUIC","_QUICV1","QUIC_V0_OR_V1","_WEB","pbStream","lp","pb","Identify","protocolVersion","agentVersion","listenAddrs","observedAddr","signedPeerRecord","isEnvWithDom","nodeType","isElectron","isBrowser","isElectronMain","isElectronRenderer","release","isWebWorker","importScripts","WorkerGlobalScope","isReactNative","product","defaultValues","AbstractIdentify","started","addressManager","maxOutboundStreams","maxMessageSize","maxObservedAddresses","runOnTransientConnection","nodeInfo","protocolPrefix","AgentVersion","ProtocolVersion","handleProtocol","unhandle","runOnConnectionOpen","identify","_identify","AbortSignal","close","cleanObservedAddr","getCleanMultiaddr","getObservedAddrs","addObservedAddr","isCertified","peerRecordEnvelope","openAndCertify","existingPeer","storedEnvelope","storedRecord","patch","consumeIdentifyMessage","getAddresses","seal","remoteAddr","closeSource","getIterator","createAbortError","clearMethods","defaultClear","defaultSet","timeoutId","settle","rejectFunction","signalListener","delayPromise","createDelay","RateLimiter","memoryStorage","duration","blockDuration","execEvenly","execEvenlyMinDelayMs","keyPrefix","MemoryStorage","pointsToConsume","rlKey","getKey","secDuration","_getKeySecDuration","incrby","remainingPoints","consumedPoints","msBeforeNext","isFirstInDuration","penalty","reward","msDuration","initPoints","customDuration","parseKey","durationSec","existing","msBeforeExpires","expiresAt","durationMs","unref","MessageTypes","MessageTypeNames","InitiatorMessageTypes","NEW_STREAM","MESSAGE","MESSAGE_INITIATOR","CLOSE","CLOSE_INITIATOR","RESET","RESET_INITIATOR","ReceiverMessageTypes","MESSAGE_RECEIVER","CLOSE_RECEIVER","RESET_RECEIVER","MAX_MSG_SIZE","_buffer","_headerInfo","_maxMessageSize","_maxUnprocessedMessageQueueSize","maxUnprocessedMessageQueueSize","_decodeHeader","readVarInt","POOL_SIZE","_pool","_poolOffset","header","AbstractStream","direction","readStatus","writeStatus","sinkController","sinkEnd","closed","endErr","streamSource","onCloseRead","onCloseWrite","onReset","onAbort","sendCloseWriteTimeout","sendingData","AbortController","onSourceEnd","sendNewStream","abortListener","sendData","sendCloseWrite","onSinkEnd","closeRead","closeWrite","sendCloseRead","sendReset","_closeSinkAndSource","_closeSink","_closeSource","remoteCloseWrite","remoteCloseRead","sourcePush","sourceReadableLength","MplexStream","streamId","maxDataSize","toSend","printMessage","MplexStreamMuxer","_streamId","_streams","_source","closeController","rateLimiter","closeTimeout","initiators","receivers","_createSink","disconnectThreshold","streams","registry","_newStream","_newReceiverStream","maxMsgSize","onStreamEnd","_handleIncoming","onIncomingStream","maxBufferSize","maxStreamBufferSize","Mplex","createStreamMuxer","mplex","ERR_WRONG_PING_ACK","PingService","handleMessage","received","openConnection","transportSymbol","FaultTolerance","ASSUME_HTTP_CODES","extractSNI","sniProtoCode","hasTLS","interpretNext","headProtoCode","headProtoVal","restMa","interpreter","interpreters","restVal","tailProto","dnsaddr","dns4","dns","ipfs","http","maHasTLS","sni","baseVal","tls","https","ws","wss","socket","cleanup","handleOpen","handleErr","closeOnEnd","ready","CLOSING","CLOSED","wasClean","connect","location","wsUrl","httpProto","wsProto","connectedSource","binaryType","connected","connError","cleanUp","cont","onOpen","onError","onMessage","remoteAddress","remotePort","hostname","CONNECTING","OPEN","terminate","websocket","CustomProgressEvent","Event","testMa","dialerEvents","registerCounterGroup","label","maConn","metricPrefix","socketToMaConn","_connect","upgrader","upgradeOutbound","cOpts","errorPromise","rawSocket","uri","onProgress","createListener","listenFilter","dialFilter","webSockets","contentRoutingSymbol","peerRoutingSymbol","fmtLong","isError","setupFormatters","defaultLogger","createDisabledLogger","mapIterable","iter","PeerSet","predicate","intersection","difference","union","createEd25519PeerId","generateKeyPair","createFromPrivKey","createFromJSON","pubKey","createFromPubKey","createFromParts","PeerMap","PriorityQueue","enqueue","run","element","priority","comparator","step","it","lowerBound","dequeue","PQueue","carryoverConcurrencyCount","intervalCap","concurrency","autoStart","queueClass","throwOnTimeout","canInitializeInterval","job","newConcurrency","function_","operation","addAll","functions","pause","onSizeLessThan","onIdle","sizeBy","observable","worker","WORKER_REQUEST_READ_LOCK","WORKER_RELEASE_READ_LOCK","MASTER_GRANT_READ_LOCK","WORKER_REQUEST_WRITE_LOCK","WORKER_RELEASE_WRITE_LOCK","MASTER_GRANT_WRITE_LOCK","handleWorkerLockRequest","masterEvent","releaseType","grantType","requestEvent","identifier","MessageEvent","handler","postMessage","releaseEventListener","releaseEvent","makeWorkerLockRequest","responseEvent","defaultOptions","singleProcess","mutexes","implementation","createReleaseable","ERR_INVALID_PARAMETERS","Peer","Address","Tag","bytesToPeer","peerIdFromPeerId","expiry","Peer$metadataEntry","Peer$tagsEntry","pathSepS","pathSepB","pathSep","Key","_buf","uint8Array","withNamespaces","asKey","less","list1","list2","baseNamespace","namespaceType","namespaceValue","child","isAncestorOf","isDecendantOf","isTopLevel","NAMESPACE_COMMON","peerIdToDatastoreKey","b32key","dedupeFilterAndSortAddresses","addressMap","maStr","existingAddr","toPeerPB","strategy","createSortedMap","validateMetadata","validateTag","mapTag","metadataEntries","tagsEntries","mergedTags","addressFilter","decodePeer","cached","PersistentStore","datastore","isWorker","readLock","writeLock","masterQueue","readQueue","localReadQueue","readPromise","createMutex","existingBuf","peerPb","peerCache","filters","orders","mapQuery","previous","updated","put","PersistentPeerStore","consumePeerRecord","expectedPeer","peekable","iterable","sorter","BaseDatastore","putMany","getMany","deleteMany","batch","puts","dels","commit","_all","_allKeys","queryKeys","MemoryDatastore","defaultAddressFilter","addrs","stripPeerId","observedPeerIdStr","DefaultAddressManager","announce","observed","announceFilter","_updatePeerStoreAddresses","debounce","getAnnounceAddrs","transportManager","getAddrs","confident","getListenAddrs","confirmObservedAddr","startingConfidence","removeObservedAddr","addrSet","DefaultComponents","_started","_invokeStartableMethod","isStartable","startable","beforeStart","afterStart","beforeStop","afterStop","OPTIONAL_SERVICES","NON_SERVICE_PROPERTIES","getServiceCapabilities","getServiceDependencies","getServiceName","NETMASK_RANGES","ipRange","ipv4Check","ipAddr","isPrivateIp","octet34","octet12","ipv4MappedIpv6Check","ipv4EmbeddedIpv6Check","ipv6Check","connectionGater","gater","denyDialPeer","denyDialMultiaddr","denyInboundConnection","denyOutboundConnection","denyInboundEncryptedConnection","denyOutboundEncryptedConnection","denyInboundUpgradedConnection","denyOutboundUpgradedConnection","filterMultiaddrForPeer","isPrivate","defaultAddressSort","publicResult","isAPrivate","isBPrivate","publicAddressesFirst","relayResult","isACircuit","isBCircuit","circuitRelayAddressesLast","certifiedResult","certifiedAddressesFirst","getTypes","DEFAULT_TYPES","RecordType","DEFAULT_TTL","toDNSResponse","Status","TC","flag_tc","RD","flag_rd","RA","flag_ra","AD","flag_ad","CD","flag_cd","Question","questions","question","Answer","answers","answer","TTL","dnsJsonOverHttps","httpQueue","queryConcurrency","fqdn","searchParams","URLSearchParams","headers","accept","statusText","CachedAnswers","lru","maxSize","hashlru","foundAllAnswers","getAnswers","cachedAnswers","expires","cacheSize","tld","dnsaddrCode","dnsaddrResolver","recursionLimit","maxRecursiveDepth","TXT","DefaultConfig","noAnnounce","addressSorter","faultTolerance","FATAL_ALL","getPeerAddress","ERR_INVALID_MULTIADDR","maPeerIdStr","maPeerId","raceEvent","eventName","removeListeners","eventListener","errorEvent","errorEventListener","JobRecipient","Job","recipients","controller","created","recipient","Queue","metricName","registerMetricGroup","calculate","running","tryToStartAnother","toGenerator","onQueueJobComplete","onQueueError","onQueueIdle","onSignalAbort","PeerQueue","AUTO_DIAL_PEER_RETRY_THRESHOLD","LAST_DIAL_FAILURE_KEY","AutoDial","minConnections","autoDialPriority","autoDialIntervalMs","autoDialMaxQueueLength","autoDialPeerRetryThresholdMs","autoDialDiscoveredPeersDebounce","autoDialInterval","maxQueueLength","autoDialPeerRetryThreshold","autoDialConcurrency","autoDial","getConnectionsMap","numConnections","sheduleNextAutodial","dialQueue","getDialQueue","shuffledPeers","peerValues","peersThatHaveNotFailed","peerAValue","peerBValue","lastDialFailure","lastDialFailureTimestamp","DEFAULT_CLOSABLE_PROTOCOLS","maxConnections","allow","ConnectionPruner","maybePruneConnections","sortedConnections","sortConnections","toPrune","toClose","streamProtocols","closableProtocols","safelyCloseConnectionIfUnused","connectionALifespan","connectionBLifespan","anySignal","signals","maxDialQueueLength","maxPeerAddrsToDial","dialTimeout","DialQueue","shutDownController","peerIdOrMultiaddr","existingConnection","force","existingDial","createDialAbortController","addrsToDial","calculateMultiaddrs","dialed","ERR_TOO_MANY_ADDRESSES","ERR_TRANSPORT_DIAL_FAILED","DEFAULT_DIAL_PRIORITY","userSignal","ERR_DIALED_SELF","ERR_PEER_DIAL_INTERCEPTED","ERR_NOT_FOUND","peerRouting","findPeer","ERR_NO_ROUTERS_AVAILABLE","resolvedAddresses","resolveMultiaddrs","peerIdMultiaddr","lastProto","filteredAddrs","dialTransportForMultiaddr","addrPeerId","dedupedAddrs","dedupedMultiaddrs","ERR_NO_VALID_ADDRESSES","gatedAdrs","sortedGatedAddrs","isDialable","DefaultConnectionManager","deny","maxIncomingPendingConnections","incomingPendingConnections","connectionPruner","inboundConnectionRateLimiter","onConnect","onDisconnect","inboundConnectionThreshold","metric","inbound","outbound","conns","allStreams","counts","keepAlivePeers","tasks","connectionList","_onConnect","storedConns","isNewPeer","storedConn","ERR_NODE_NOT_STARTED","transient","peerConnections","trackedConnection","closeConnections","acceptIncomingConnection","afterUpgradeInbound","statusMap","errored","complete","MovingAverage","movingAverage","variance","deviation","forecast","timespan","previousTime","alpha","pt","exp","incr","AdaptiveTimeout","timeoutMultiplier","failureMultiplier","minTimeout","getTimeoutSignal","timeoutFactor","sendTimeout","timeoutSignal","failureMovingAverage","failureDeviation","failureForecast","failureVariance","successMovingAverage","successDeviation","successForecast","successVariance","ConnectionMonitor","heartbeatInterval","pingIntervalMs","abortController","pingInterval","pingTimeout","bs","rtt","CompoundContentRouting","routers","findProviders","seen","router","provide","NOT_STARTED_YET","Fingerprint","fp","fingerprintSize","fnv","hashV","getRandomInt","Bucket","fingerprint","findIndex","FNV_PRIMES","FNV_OFFSETS","cachedEncoder","utf8Buffer","fnvPrime","remaining","encodeInto","asUintN","fnv1aEncodeInto","fnv1aUint8Array","fnv1a","numberToBuffer","CuckooFilter","bucketSize","filterSize","buckets","rand","swapped","inJ","inK","reliable","MAX_LOAD","optimize","maxItems","errorRate","calculateBucketSize","log2","ScalableCuckooFilter","scale","filterSeries","cuckoo","curSize","DefaultPeerRouting","ERR_FIND_SELF","NOT_FOUND","getClosestPeers","createScalableCuckooFilter","ordered","ops","sourceErr","slotAvailable","resultAvailable","sourceFinished","opErred","valuesAvailable","op","yieldOrderedValues","ok","yieldUnOrderedValues","task","parallel","useCache","RandomWalk","walking","walkers","shutdownController","walkController","needNext","walk","startWalk","DefaultRegistrar","topologies","_onDisconnect","_onPeerUpdate","_onPeerIdentify","getProtocols","getHandler","ERR_NO_HANDLER_FOR_PROTOCOL","getTopologies","ERR_PROTOCOL_HANDLER_ALREADY_REGISTERED","register","topology","unregister","removed","notifyOnTransient","TrackedMap","registerMetric","updateComponentMetric","deleted","DefaultTransportManager","transports","trackedMap","ERR_INVALID_KEY","ERR_DUPLICATE_TRANSPORT","ERR_TRANSPORT_UNAVAILABLE","getTransports","of","getListeners","listenTransportForMultiaddr","couldNotListen","supportedAddrs","NO_FATAL","removeAll","PROTOCOL_ID","MAX_PROTOCOL_LENGTH","NewLine","negotiateFully","originalSink","originalSource","negotiated","negotiating","doneNegotiating","sentProtocol","sendingProtocol","doneSendingProtocol","readProtocol","readingProtocol","doneReadingProtocol","negotiate","doSendProtocol","doReadProtocol","sentData","protocolString","originalCloseRead","originalCloseWrite","originalClose","optimisticSelect","p1","p2","connectionSymbol","ConnectionImpl","multiplexer","encryption","_close","_abort","_getStreams","getStreams","countStreams","streamCount","DefaultUpgrader","connectionEncryption","muxers","inboundUpgradeTimeout","encrypter","muxer","shouldBlockConnection","connectionType","ERR_CONNECTION_INTERCEPTED","upgradeInbound","ERR_CONNECTION_DENIED","encryptedConn","upgradedConn","muxerFactory","cryptoProtocol","trackMultiaddrConnection","protectedConn","skipProtection","protector","connectionProtector","protect","skipEncryption","_encryptInbound","idStr","remotePeerId","multiplexed","_multiplexInbound","_createConnection","_encryptOutbound","ERR_INVALID_PEER","_multiplexOutbound","muxedStream","incomingLimit","findIncomingStreamLimit","ERR_TOO_MANY_INBOUND_PROTOCOL_STREAMS","trackProtocolStream","_onStream","ERR_MUXER_UNAVAILABLE","outgoingLimit","findOutgoingStreamLimit","ERR_TOO_MANY_OUTBOUND_PROTOCOL_STREAMS","ERR_UNSUPPORTED_PROTOCOL","_timeline","Proxy","Reflect","upgraded","ERR_CONNECTION_NOT_MULTIPLEXED","ERR_ENCRYPTION_FAILED","Libp2pNode","contentRouting","originalDispatch","internalResult","externalResult","defaultComponents","configureComponent","streamMuxers","connectionMonitor","peerRouters","contentRouters","peerDiscovery","createService","capability","checkServiceDependencies","component","peerSet","ERR_INVALID_PROTOCOLS_FOR_STREAM","peerKey","ERR_DISCOVERED_SELF","enrTree","SANDBOX","TEST","DEFAULT_NODE_REQUIREMENTS","groupLen","USE_ENDOMORPHISM","ShaError","assertJacPoint","JacobianPoint","toAffineBatch","scratch","Z1Z1","Z2Z2","S1","S2","x1b","HH","HHH","P0","normalizeScalar","affinePoint","_WINDOW_SIZE","invZ","iz1","iz2","iz3","fromCompressedHex","isShort","bytesToNumber","isValidFieldElement","rt","isYOdd","fromUncompressedHex","normalizePrivateKey","fromSignature","normalizeSignature","truncateHash","rinv","numTo32bStr","toHexX","toRawX","aP","bQ","sliceDER","parseDERInt","parseDERSignature","HALF","sHex","rHex","sHexL","rHexL","sLen","rLen","uint8a","POW_2_256","hexByte","truncateOnly","bits2int_2","_sha256Sync","_hmacSha256Sync","HmacDrbg","hmacSha256","hmacSync","checkSync","reseedSync","generate","generateSync","kmdToSig","kinv","bits2octets","z1","vopts","strict","web","bytesToHex","hexToBytes","concatBytes","_bigintTo32Bytes","_normalizePrivateKey","hashToPrivateKey","sha256","createHash","ckey","createHmac","sha256Sync","hmacSha256Sync","taggedHash","tagP","tagH","taggedHashSync","_JacobianPoint","keccak256","sha3","verifySignature","normalizePublicKey","sinv","ERR_INVALID_ID","locationMultiaddrFromEnrFields","isIpv6","ipVal","protoName","protoVal","ipFamily","ipBytes","protocolBytes","multiaddrFromFields","encodeMultiaddrs","encodeWaku2","RawEnr","kvs","rsv","getStringValue","setStringValue","getNumberAsStringValue","setNumberAsStringValue","tcp6","udp6","raw","multiaddrBytes","decodeMultiaddrs","deleteUndefined","waku2","decodeWaku2","initSigArgs","canonical","recSig","recovered","finalizeSig","TransportProtocol","TransportProtocolPerIpVersion","createPeerIdFromPublicKey","nodeId","uncompressedPubkey","getLocationMultiaddr","setLocationMultiaddr","getAllLocationMultiaddrs","_multiaddrs","getFullMultiaddr","locationMultiaddr","getFullMultiaddrs","_permanentCensorErrors","_censorErrors","LogLevels","warning","_logLevel","_globalLogger","_normalizeError","form","_checkNormalize","LogLevel","ErrorCode","HEX","_log","logLevel","throwArgumentError","levels","INFO","WARNING","makeError","UNKNOWN_ERROR","messageDetails","NUMERIC_FAULT","fault","CALL_EXCEPTION","INSUFFICIENT_FUNDS","MISSING_NEW","NONCE_EXPIRED","REPLACEMENT_UNDERPRICED","TRANSACTION_REPLACED","UNPREDICTABLE_GAS_LIMIT","throwError","INVALID_ARGUMENT","argument","assert","assertArgument","checkNormalize","UNSUPPORTED_OPERATION","checkSafeUint53","checkArgumentCount","expectedCount","MISSING_ARGUMENT","UNEXPECTED_ARGUMENT","checkNew","checkAbstract","globalLogger","setCensorship","censorship","permanent","setLogLevel","isHexable","addSlice","arrayify","allowMissingPrefix","toHexString","isHexString","hexPad","HexCharacters","hexlify","arrayifyInteger","unarrayifyInteger","_encode","_decodeChildren","childOffset","_decode","BUFFER_OVERRUN","EnrDecoder","encoded","RECORD_PREFIX","fromRLP","checkValues","_seq","decodeSeq","rlpEncodedBytes","checkSignature","fromValues","v4Regex","v6Regex","isFormat","buff","hexN","decN","prevColon","useDec","sizeOf","toType","rcode","opcode","klass","toClass","toCode","SURROGATE_A","SURROGATE_B","nextCode","numA","isU8Arr","bytelength","P_24","P_16","P_8","readUInt32BE","readUInt16BE","writeUInt32BE","writeUInt16BE","targetStart","sourceStart","sourceEnd","nb","sourceLen","_copyActual","consumedBytes","jumped","jumpOffset","flags","authorities","additionals","flag_qr","flag_aa","flag_z","runknown","dLen","rns","dd","rsoa","mname","rname","serial","refresh","retry","expire","minimum","rtxt","rnull","rhinfo","cpu","os","rptr","rsrv","weight","rcaa","issuerCritical","ISSUER_CRITICAL","rmx","preference","exchange","ra","raaaa","roption","spl","sourcePrefixLength","fam","ipBuf","ipLen","scopePrefixLength","tagsLen","padded","ropt","rdlen","encodingLengthList","encodeList","rdnskey","keydata","PROTOCOL_DNSSEC","ZONE_KEY","SECURE_ENTRYPOINT","rrrsig","typeCovered","labels","originalTTL","expiration","inception","keyTag","signersName","rrp","mbox","txt","typebitmap","typelist","typesByWindow","typeid","windowBuf","windowLength","extents","rnsec","nextDomain","rrtypes","rnsec3","hashLength","rds","digestdata","digestType","renc","udpPayloadSize","extendedRcode","ednsVersion","class","flush","flag_do","RECURSION_DESIRED","packet","allocing","decodeList","sanitizeSingle","sanitized","make","charset","paddingMode","byCharCode","byNum","padCode","safeLen","safeEnd","base64URL","require","HTTPStatusError","endpoint","ResponseError","cause","reduceError","baseParts","httpFlags","updFlags","parseFlags","regex","InvalidProtocolError","supportedProtocols","BaseEndpoint","isHTTP","pk","UDPEndpoint","ipv6","UDP4Endpoint","UDP6Endpoint","safeHost","HTTPEndpoint","v6Parts","toEndpoint","post","parseEndpoint","contentType","requestRaw","abortSignal","setRequestHeader","ontimeout","onerror","onload","onabort","cors","endpoints","resolverByName","byName","endpointByName","backup","description","country","lat","UPDATE_URL","isNameString","wellknown","updateURL","persist","localStoragePrefix","maxAge","_dataP","_data","outdated","cacheKey","maxTime","filterDoh","filterDns","queryN","singleQuery","toMultiQuery","queryDoh","queryOne","DnsOverHttps","_endpoints","resolveTXT","sd","ENRTree","parseAndVerifyRoot","ROOT_PREFIX","rootValues","parseRootValues","decodedPublicKey","signedComponent","signedComponentBuffer","eRoot","lRoot","parseTree","tree","TREE_PREFIX","parseBranch","branch","BRANCH_PREFIX","isSatisfied","wanted","addCapabilities","total","helpsSatisfyCapabilities","missingCapabilities","DnsNodeDiscovery","_DNSTreeCache","_errorTolerance","dnsOverHttp","dnsClient","enrTreeUrls","wantedNodeCapabilityCount","networkIndex","visits","errorTolerance","getNode","maxSearches","totalSearches","fetchNodesUntilCapabilitiesFulfilled","_search","getNextPeer","peerNodeIds","yieldNodesUntilCapabilitiesFulfilled","subdomain","_getTXTRecord","branches","entryType","getEntryType","circularRefs","selectRandomPath","PeerDiscoveryDns","nextPeer","_components","enrUrls","peerEnr","tagsToUpdate","isPeerChanged","wakuDnsDiscovery","PeerExchangeCodec","WakuPeerExchange","rpcQuery","ENR","DEFAULT_PEER_EXCHANGE_QUERY_INTERVAL_MS","DEFAULT_MAX_RETRIES","DEFAULT_PEER_EXCHANGE_TAG_NAME","PeerExchangeDiscovery","peerExchange","queryingPeers","queryAttempts","handleDiscoveredPeer","startRecurringQueries","queryInterval","maxRetries","currentAttempt","abortQueriesForPeer","_peerInfo","hasMultiaddrDiff","hasShardDiff","checkPeerInfoDiff","existingMultiaddrs","newMultiaddrs","existingShardInfoBytes","existingShardInfo","wakuPeerExchangeDiscovery","DEFAULT_LOCAL_TAG_NAME","LocalPeerCacheDiscovery","getPeersFromLocalStorage","handleNewPeers","savePeersToLocalStorage","websocketMultiaddr","wsMultiaddr","getWsMultiaddrFromMultiaddrs","localStoragePeers","existingPeerIndex","_peer","storedPeersData","isValidStoredPeer","defaultLibp2p","hideWebSocketInfo","resultingOptions","LIBP2P_FORCE_PNET","ERR_PROTECTOR_REQUIRED","validateConfig","createLibp2pNode","createLibp2p","filterMultiaddrs","pingMaxInboundStreams","createLightNode","networkConfig","isAutoSharding","derivePubsubTopicsFromNetworkConfig","libp2pOptions","defaultBootstrap","defaultPeerDiscoveries","createLibp2pAndUpdateOptions","TelemetryType","__awaiter","thisArg","_arguments","generator","fulfilled","rejected","__generator","sent","trys","verb","TelemetryClient","intervalPeriod","intervalId","_this","telemetryRequests","e_1","telemetryType","messageType","telemetryData","hashNumber","DEFAULT_CONTENT_TOPIC","ProtoSequencedMessage","sequenceCompletedEvent","messageSentEvent","app","telemetryClient","startLightPushSequence","startFilterSubscription","numMessages_1","args_1","_i","pack","ar","__spreadArray","numMessages","period","sequenceHash","sequenceTotal","sequenceIndex","sendMessage","messageElement","messagesSent","error_1","sender","LIGHT_PUSH_FILTER","peerIdSender","peerIdReporter","createElement","getElementById","textContent","insertBefore","firstChild","LIGHT_PUSH_ERROR","peerIdRemote","messagesReceived","sequencedMessage","appendChild","startSequence","messagePeriod","sentMessagesCount","sentMessagesCounter","display"],"sourceRoot":""} \ No newline at end of file +{"version":3,"file":"index.js","mappings":";qDACAA,EAAOC,QAmBP,SAAmBC,EAAIC,GAKnB,IAJA,IAAIC,EAAU,IAAIC,MAAMC,UAAUC,OAAS,GACvCC,EAAU,EACVC,EAAU,EACVC,GAAU,EACPD,EAAQH,UAAUC,QACrBH,EAAOI,KAAYF,UAAUG,KACjC,OAAO,IAAIE,SAAQ,SAAkBC,EAASC,GAC1CT,EAAOI,GAAU,SAAkBM,GAC/B,GAAIJ,EAEA,GADAA,GAAU,EACNI,EACAD,EAAOC,OACN,CAGD,IAFA,IAAIV,EAAS,IAAIC,MAAMC,UAAUC,OAAS,GACtCC,EAAS,EACNA,EAASJ,EAAOG,QACnBH,EAAOI,KAAYF,UAAUE,GACjCI,EAAQG,MAAM,KAAMX,EACxB,CAER,EACA,IACIF,EAAGa,MAAMZ,GAAO,KAAMC,EAC1B,CAAE,MAAOU,GACDJ,IACAA,GAAU,EACVG,EAAOC,GAEf,CACJ,GACJ,6BC5CA,IAAIE,EAASf,EAObe,EAAOT,OAAS,SAAgBU,GAC5B,IAAIC,EAAID,EAAOV,OACf,IAAKW,EACD,OAAO,EAEX,IADA,IAAIC,EAAI,IACCD,EAAI,EAAI,GAA0B,MAArBD,EAAOG,OAAOF,MAC9BC,EACN,OAAOE,KAAKC,KAAqB,EAAhBL,EAAOV,QAAc,EAAIY,CAC9C,EASA,IANA,IAAII,EAAM,IAAIlB,MAAM,IAGhBmB,EAAM,IAAInB,MAAM,KAGXoB,EAAI,EAAGA,EAAI,IAChBD,EAAID,EAAIE,GAAKA,EAAI,GAAKA,EAAI,GAAKA,EAAI,GAAKA,EAAI,GAAKA,EAAI,GAAKA,EAAI,EAAIA,EAAI,GAAK,IAAMA,IASrFT,EAAOU,OAAS,SAAgBC,EAAQC,EAAOC,GAM3C,IALA,IAIIC,EAJAC,EAAQ,KACRC,EAAQ,GACRP,EAAI,EACJQ,EAAI,EAEDL,EAAQC,GAAK,CAChB,IAAIK,EAAIP,EAAOC,KACf,OAAQK,GACJ,KAAK,EACDD,EAAMP,KAAOF,EAAIW,GAAK,GACtBJ,GAAS,EAAJI,IAAU,EACfD,EAAI,EACJ,MACJ,KAAK,EACDD,EAAMP,KAAOF,EAAIO,EAAII,GAAK,GAC1BJ,GAAS,GAAJI,IAAW,EAChBD,EAAI,EACJ,MACJ,KAAK,EACDD,EAAMP,KAAOF,EAAIO,EAAII,GAAK,GAC1BF,EAAMP,KAAOF,EAAQ,GAAJW,GACjBD,EAAI,EAGRR,EAAI,QACHM,IAAUA,EAAQ,KAAKI,KAAKC,OAAOC,aAAatB,MAAMqB,OAAQJ,IAC/DP,EAAI,EAEZ,CAOA,OANIQ,IACAD,EAAMP,KAAOF,EAAIO,GACjBE,EAAMP,KAAO,GACH,IAANQ,IACAD,EAAMP,KAAO,KAEjBM,GACIN,GACAM,EAAMI,KAAKC,OAAOC,aAAatB,MAAMqB,OAAQJ,EAAMM,MAAM,EAAGb,KACzDM,EAAMQ,KAAK,KAEfH,OAAOC,aAAatB,MAAMqB,OAAQJ,EAAMM,MAAM,EAAGb,GAC5D,EAEA,IAAIe,EAAkB,mBAUtBxB,EAAOyB,OAAS,SAAgBxB,EAAQU,EAAQnB,GAI5C,IAHA,IAEIsB,EAFAF,EAAQpB,EACRyB,EAAI,EAECR,EAAI,EAAGA,EAAIR,EAAOV,QAAS,CAChC,IAAImC,EAAIzB,EAAO0B,WAAWlB,KAC1B,GAAU,KAANiB,GAAYT,EAAI,EAChB,MACJ,QAAqBW,KAAhBF,EAAIlB,EAAIkB,IACT,MAAMG,MAAML,GAChB,OAAQP,GACJ,KAAK,EACDH,EAAIY,EACJT,EAAI,EACJ,MACJ,KAAK,EACDN,EAAOnB,KAAYsB,GAAK,GAAS,GAAJY,IAAW,EACxCZ,EAAIY,EACJT,EAAI,EACJ,MACJ,KAAK,EACDN,EAAOnB,MAAiB,GAAJsB,IAAW,GAAS,GAAJY,IAAW,EAC/CZ,EAAIY,EACJT,EAAI,EACJ,MACJ,KAAK,EACDN,EAAOnB,MAAiB,EAAJsB,IAAU,EAAIY,EAClCT,EAAI,EAGhB,CACA,GAAU,IAANA,EACA,MAAMY,MAAML,GAChB,OAAOhC,EAASoB,CACpB,EAOAZ,EAAO8B,KAAO,SAAc7B,GACxB,MAAO,mEAAmE6B,KAAK7B,EACnF,yBChIA,SAAS8B,EAAQC,EAAgBC,GAGC,iBAAnBD,IACPC,EAAeD,EACfA,OAAiBJ,GAGrB,IAAIM,EAAO,GAYX,SAASC,EAAQC,GAIb,GAAmC,iBAAxBA,EAAkC,CACzC,IAAIC,EAASC,IAIb,GAHIP,EAAQQ,SACRC,QAAQC,IAAI,YAAcJ,GAC9BA,EAAS,UAAYA,EACjBD,EAAqB,CAKrB,IAJA,IAAIM,EAAcC,OAAOC,KAAKR,GAC1BS,EAAc,IAAIxD,MAAMqD,EAAUnD,OAAS,GAC3CuD,EAAc,IAAIzD,MAAMqD,EAAUnD,QAClCwD,EAAc,EACXA,EAAcL,EAAUnD,QAC3BsD,EAAYE,GAAeL,EAAUK,GACrCD,EAAYC,GAAeX,EAAoBM,EAAUK,MAG7D,OADAF,EAAYE,GAAeV,EACpBW,SAASjD,MAAM,KAAM8C,GAAa9C,MAAM,KAAM+C,EACzD,CACA,OAAOE,SAASX,EAATW,EACX,CAKA,IAFA,IAAIC,EAAe,IAAI5D,MAAMC,UAAUC,OAAS,GAC5C2D,EAAe,EACZA,EAAeD,EAAa1D,QAC/B0D,EAAaC,GAAgB5D,YAAY4D,GAY7C,GAXAA,EAAe,EACfd,EAAsBA,EAAoBe,QAAQ,gBAAgB,SAAiBC,EAAIC,GACnF,IAAIC,EAAQL,EAAaC,KACzB,OAAQG,GACJ,IAAK,IAAK,IAAK,IAAK,OAAOjC,OAAOmC,OAAOD,IACzC,IAAK,IAAK,OAAOlC,OAAOf,KAAKmD,MAAMF,IACnC,IAAK,IAAK,OAAOG,KAAKC,UAAUJ,GAChC,IAAK,IAAK,OAAOlC,OAAOkC,GAE5B,MAAO,GACX,IACIJ,IAAiBD,EAAa1D,OAC9B,MAAMsC,MAAM,4BAEhB,OADAK,EAAKf,KAAKiB,GACHD,CACX,CAEA,SAASG,EAASqB,GACd,MAAO,aAAeA,GAAwB1B,GAAgB,IAAM,KAAOD,GAAkBA,EAAeT,KAAK,MAAQ,IAAM,SAAWW,EAAKX,KAAK,QAAU,KAClK,CAGA,OADAY,EAAQG,SAAWA,EACZH,CACX,CAjFAnD,EAAOC,QAAU8C,EAiGjBA,EAAQQ,SAAU,yBCzFlB,SAASqB,IAOLC,KAAKC,WAAa,CAAC,CACvB,CAhBA9E,EAAOC,QAAU2E,EAyBjBA,EAAaG,UAAUC,GAAK,SAAYC,EAAK/E,EAAIC,GAK7C,OAJC0E,KAAKC,WAAWG,KAASJ,KAAKC,WAAWG,GAAO,KAAK9C,KAAK,CACvDjC,GAAMA,EACNC,IAAMA,GAAO0E,OAEVA,IACX,EAQAD,EAAaG,UAAUG,IAAM,SAAaD,EAAK/E,GAC3C,QAAY0C,IAARqC,EACAJ,KAAKC,WAAa,CAAC,OAEnB,QAAWlC,IAAP1C,EACA2E,KAAKC,WAAWG,GAAO,QAGvB,IADA,IAAIE,EAAYN,KAAKC,WAAWG,GACvBxD,EAAI,EAAGA,EAAI0D,EAAU5E,QACtB4E,EAAU1D,GAAGvB,KAAOA,EACpBiF,EAAUC,OAAO3D,EAAG,KAElBA,EAGlB,OAAOoD,IACX,EAQAD,EAAaG,UAAUM,KAAO,SAAcJ,GACxC,IAAIE,EAAYN,KAAKC,WAAWG,GAChC,GAAIE,EAAW,CAGX,IAFA,IAAIG,EAAO,GACP7D,EAAI,EACDA,EAAInB,UAAUC,QACjB+E,EAAKnD,KAAK7B,UAAUmB,MACxB,IAAKA,EAAI,EAAGA,EAAI0D,EAAU5E,QACtB4E,EAAU1D,GAAGvB,GAAGa,MAAMoE,EAAU1D,KAAKtB,IAAKmF,EAClD,CACA,OAAOT,IACX,+BC1EA7E,EAAOC,QAAUsF,EAEjB,IAAIC,EAAY,EAAQ,MAGpBC,EAFY,EAAQ,KAEfC,CAAQ,MA2BjB,SAASH,EAAMI,EAAUC,EAASC,GAO9B,MANuB,mBAAZD,GACPC,EAAWD,EACXA,EAAU,CAAC,GACHA,IACRA,EAAU,CAAC,GAEVC,GAIAD,EAAQE,KAAOL,GAAMA,EAAGM,SAClBN,EAAGM,SAASJ,GAAU,SAA+B7E,EAAKkF,GAC7D,OAAOlF,GAAiC,oBAAnBmF,eACfV,EAAMO,IAAIH,EAAUC,EAASC,GAC7B/E,EACA+E,EAAS/E,GACT+E,EAAS,KAAMD,EAAQM,OAASF,EAAWA,EAAS1C,SAAS,QACvE,IAGGiC,EAAMO,IAAIH,EAAUC,EAASC,GAbzBL,EAAUD,EAAOV,KAAMc,EAAUC,EAchD,CAuBAL,EAAMO,IAAM,SAAmBH,EAAUC,EAASC,GAC9C,IAAIC,EAAM,IAAIG,eACdH,EAAIK,mBAA4C,WAE5C,GAAuB,IAAnBL,EAAIM,WAAR,CAMA,GAAmB,IAAfN,EAAIO,QAA+B,MAAfP,EAAIO,OACxB,OAAOR,EAAShD,MAAM,UAAYiD,EAAIO,SAI1C,GAAIT,EAAQM,OAAQ,CAChB,IAAIvE,EAASmE,EAAIQ,SACjB,IAAK3E,EAAQ,CACTA,EAAS,GACT,IAAK,IAAIF,EAAI,EAAGA,EAAIqE,EAAIS,aAAahG,SAAUkB,EAC3CE,EAAOQ,KAAsC,IAAjC2D,EAAIS,aAAa5D,WAAWlB,GAChD,CACA,OAAOoE,EAAS,KAA4B,oBAAfW,WAA6B,IAAIA,WAAW7E,GAAUA,EACvF,CACA,OAAOkE,EAAS,KAAMC,EAAIS,aAnBN,CAoBxB,EAEIX,EAAQM,SAEJ,qBAAsBJ,GACtBA,EAAIW,iBAAiB,sCACzBX,EAAIY,aAAe,eAGvBZ,EAAIa,KAAK,MAAOhB,GAChBG,EAAIc,MACR,yBC3BA,SAASC,EAAQ5G,GAwNb,MArN4B,oBAAjB6G,aAA8B,WAErC,IAAIC,EAAM,IAAID,aAAa,EAAG,IAC1BE,EAAM,IAAIR,WAAWO,EAAIpF,QACzBsF,EAAiB,MAAXD,EAAI,GAEd,SAASE,EAAmBC,EAAKC,EAAKC,GAClCN,EAAI,GAAKI,EACTC,EAAIC,GAAWL,EAAI,GACnBI,EAAIC,EAAM,GAAKL,EAAI,GACnBI,EAAIC,EAAM,GAAKL,EAAI,GACnBI,EAAIC,EAAM,GAAKL,EAAI,EACvB,CAEA,SAASM,EAAmBH,EAAKC,EAAKC,GAClCN,EAAI,GAAKI,EACTC,EAAIC,GAAWL,EAAI,GACnBI,EAAIC,EAAM,GAAKL,EAAI,GACnBI,EAAIC,EAAM,GAAKL,EAAI,GACnBI,EAAIC,EAAM,GAAKL,EAAI,EACvB,CAOA,SAASO,EAAkBH,EAAKC,GAK5B,OAJAL,EAAI,GAAKI,EAAIC,GACbL,EAAI,GAAKI,EAAIC,EAAM,GACnBL,EAAI,GAAKI,EAAIC,EAAM,GACnBL,EAAI,GAAKI,EAAIC,EAAM,GACZN,EAAI,EACf,CAEA,SAASS,EAAkBJ,EAAKC,GAK5B,OAJAL,EAAI,GAAKI,EAAIC,GACbL,EAAI,GAAKI,EAAIC,EAAM,GACnBL,EAAI,GAAKI,EAAIC,EAAM,GACnBL,EAAI,GAAKI,EAAIC,EAAM,GACZN,EAAI,EACf,CAlBA9G,EAAQwH,aAAeR,EAAKC,EAAqBI,EAEjDrH,EAAQyH,aAAeT,EAAKK,EAAqBJ,EAmBjDjH,EAAQ0H,YAAcV,EAAKM,EAAoBC,EAE/CvH,EAAQ2H,YAAcX,EAAKO,EAAoBD,CAGlD,CAjDwC,GAiD9B,WAEP,SAASM,EAAmBC,EAAWX,EAAKC,EAAKC,GAC7C,IAAIU,EAAOZ,EAAM,EAAI,EAAI,EAGzB,GAFIY,IACAZ,GAAOA,GACC,IAARA,EACAW,EAAU,EAAIX,EAAM,EAAmB,EAAqB,WAAYC,EAAKC,QAC5E,GAAIW,MAAMb,GACXW,EAAU,WAAYV,EAAKC,QAC1B,GAAIF,EAAM,qBACXW,GAAWC,GAAQ,GAAK,cAAgB,EAAGX,EAAKC,QAC/C,GAAIF,EAAM,sBACXW,GAAWC,GAAQ,GAAK1G,KAAK4G,MAAMd,EAAM,yBAA4B,EAAGC,EAAKC,OAC5E,CACD,IAAIa,EAAW7G,KAAKmD,MAAMnD,KAAKoC,IAAI0D,GAAO9F,KAAK8G,KAE/CL,GAAWC,GAAQ,GAAKG,EAAW,KAAO,GAD0B,QAArD7G,KAAK4G,MAAMd,EAAM9F,KAAK+G,IAAI,GAAIF,GAAY,YACI,EAAGd,EAAKC,EACzE,CACJ,CAKA,SAASgB,EAAkBC,EAAUlB,EAAKC,GACtC,IAAIkB,EAAOD,EAASlB,EAAKC,GACrBU,EAAsB,GAAdQ,GAAQ,IAAU,EAC1BL,EAAWK,IAAS,GAAK,IACzBC,EAAkB,QAAPD,EACf,OAAoB,MAAbL,EACDM,EACAC,IACAV,GAAOW,KACM,IAAbR,EACO,qBAAPH,EAA+BS,EAC/BT,EAAO1G,KAAK+G,IAAI,EAAGF,EAAW,MAAQM,EAAW,QAC3D,CAfAvI,EAAQwH,aAAeI,EAAmBc,KAAK,KAAMC,GACrD3I,EAAQyH,aAAeG,EAAmBc,KAAK,KAAME,GAgBrD5I,EAAQ0H,YAAcU,EAAkBM,KAAK,KAAMG,GACnD7I,EAAQ2H,YAAcS,EAAkBM,KAAK,KAAMI,EAEtD,CAzCU,GA4CiB,oBAAjBC,aAA8B,WAErC,IAAIC,EAAM,IAAID,aAAa,EAAE,IACzBhC,EAAM,IAAIR,WAAWyC,EAAItH,QACzBsF,EAAiB,MAAXD,EAAI,GAEd,SAASkC,EAAoB/B,EAAKC,EAAKC,GACnC4B,EAAI,GAAK9B,EACTC,EAAIC,GAAWL,EAAI,GACnBI,EAAIC,EAAM,GAAKL,EAAI,GACnBI,EAAIC,EAAM,GAAKL,EAAI,GACnBI,EAAIC,EAAM,GAAKL,EAAI,GACnBI,EAAIC,EAAM,GAAKL,EAAI,GACnBI,EAAIC,EAAM,GAAKL,EAAI,GACnBI,EAAIC,EAAM,GAAKL,EAAI,GACnBI,EAAIC,EAAM,GAAKL,EAAI,EACvB,CAEA,SAASmC,EAAoBhC,EAAKC,EAAKC,GACnC4B,EAAI,GAAK9B,EACTC,EAAIC,GAAWL,EAAI,GACnBI,EAAIC,EAAM,GAAKL,EAAI,GACnBI,EAAIC,EAAM,GAAKL,EAAI,GACnBI,EAAIC,EAAM,GAAKL,EAAI,GACnBI,EAAIC,EAAM,GAAKL,EAAI,GACnBI,EAAIC,EAAM,GAAKL,EAAI,GACnBI,EAAIC,EAAM,GAAKL,EAAI,GACnBI,EAAIC,EAAM,GAAKL,EAAI,EACvB,CAOA,SAASoC,EAAmBhC,EAAKC,GAS7B,OARAL,EAAI,GAAKI,EAAIC,GACbL,EAAI,GAAKI,EAAIC,EAAM,GACnBL,EAAI,GAAKI,EAAIC,EAAM,GACnBL,EAAI,GAAKI,EAAIC,EAAM,GACnBL,EAAI,GAAKI,EAAIC,EAAM,GACnBL,EAAI,GAAKI,EAAIC,EAAM,GACnBL,EAAI,GAAKI,EAAIC,EAAM,GACnBL,EAAI,GAAKI,EAAIC,EAAM,GACZ4B,EAAI,EACf,CAEA,SAASI,EAAmBjC,EAAKC,GAS7B,OARAL,EAAI,GAAKI,EAAIC,GACbL,EAAI,GAAKI,EAAIC,EAAM,GACnBL,EAAI,GAAKI,EAAIC,EAAM,GACnBL,EAAI,GAAKI,EAAIC,EAAM,GACnBL,EAAI,GAAKI,EAAIC,EAAM,GACnBL,EAAI,GAAKI,EAAIC,EAAM,GACnBL,EAAI,GAAKI,EAAIC,EAAM,GACnBL,EAAI,GAAKI,EAAIC,EAAM,GACZ4B,EAAI,EACf,CA1BAhJ,EAAQqJ,cAAgBrC,EAAKiC,EAAsBC,EAEnDlJ,EAAQsJ,cAAgBtC,EAAKkC,EAAsBD,EA2BnDjJ,EAAQuJ,aAAevC,EAAKmC,EAAqBC,EAEjDpJ,EAAQwJ,aAAexC,EAAKoC,EAAqBD,CAGpD,CAjEwC,GAiE9B,WAEP,SAASM,EAAoB5B,EAAW6B,EAAMC,EAAMzC,EAAKC,EAAKC,GAC1D,IAAIU,EAAOZ,EAAM,EAAI,EAAI,EAGzB,GAFIY,IACAZ,GAAOA,GACC,IAARA,EACAW,EAAU,EAAGV,EAAKC,EAAMsC,GACxB7B,EAAU,EAAIX,EAAM,EAAmB,EAAqB,WAAYC,EAAKC,EAAMuC,QAChF,GAAI5B,MAAMb,GACbW,EAAU,EAAGV,EAAKC,EAAMsC,GACxB7B,EAAU,WAAYV,EAAKC,EAAMuC,QAC9B,GAAIzC,EAAM,sBACbW,EAAU,EAAGV,EAAKC,EAAMsC,GACxB7B,GAAWC,GAAQ,GAAK,cAAgB,EAAGX,EAAKC,EAAMuC,OACnD,CACH,IAAIpB,EACJ,GAAIrB,EAAM,uBAENW,GADAU,EAAWrB,EAAM,UACM,EAAGC,EAAKC,EAAMsC,GACrC7B,GAAWC,GAAQ,GAAKS,EAAW,cAAgB,EAAGpB,EAAKC,EAAMuC,OAC9D,CACH,IAAI1B,EAAW7G,KAAKmD,MAAMnD,KAAKoC,IAAI0D,GAAO9F,KAAK8G,KAC9B,OAAbD,IACAA,EAAW,MAEfJ,EAAqB,kBADrBU,EAAWrB,EAAM9F,KAAK+G,IAAI,GAAIF,MACY,EAAGd,EAAKC,EAAMsC,GACxD7B,GAAWC,GAAQ,GAAKG,EAAW,MAAQ,GAAgB,QAAXM,EAAqB,WAAa,EAAGpB,EAAKC,EAAMuC,EACpG,CACJ,CACJ,CAKA,SAASC,EAAmBvB,EAAUqB,EAAMC,EAAMxC,EAAKC,GACnD,IAAIyC,EAAKxB,EAASlB,EAAKC,EAAMsC,GACzBI,EAAKzB,EAASlB,EAAKC,EAAMuC,GACzB7B,EAAoB,GAAZgC,GAAM,IAAU,EACxB7B,EAAW6B,IAAO,GAAK,KACvBvB,EAAW,YAAmB,QAALuB,GAAgBD,EAC7C,OAAoB,OAAb5B,EACDM,EACAC,IACAV,GAAOW,KACM,IAAbR,EACO,OAAPH,EAAgBS,EAChBT,EAAO1G,KAAK+G,IAAI,EAAGF,EAAW,OAASM,EAAW,iBAC5D,CAhBAvI,EAAQqJ,cAAgBI,EAAoBf,KAAK,KAAMC,EAAa,EAAG,GACvE3I,EAAQsJ,cAAgBG,EAAoBf,KAAK,KAAME,EAAa,EAAG,GAiBvE5I,EAAQuJ,aAAeK,EAAmBlB,KAAK,KAAMG,EAAY,EAAG,GACpE7I,EAAQwJ,aAAeI,EAAmBlB,KAAK,KAAMI,EAAY,EAAG,EAEvE,CArDU,GAuDJ9I,CACX,CAIA,SAAS2I,EAAYzB,EAAKC,EAAKC,GAC3BD,EAAIC,GAAyB,IAAbF,EAChBC,EAAIC,EAAM,GAAMF,IAAQ,EAAK,IAC7BC,EAAIC,EAAM,GAAMF,IAAQ,GAAK,IAC7BC,EAAIC,EAAM,GAAMF,IAAQ,EAC5B,CAEA,SAAS0B,EAAY1B,EAAKC,EAAKC,GAC3BD,EAAIC,GAAYF,IAAQ,GACxBC,EAAIC,EAAM,GAAMF,IAAQ,GAAK,IAC7BC,EAAIC,EAAM,GAAMF,IAAQ,EAAK,IAC7BC,EAAIC,EAAM,GAAmB,IAAbF,CACpB,CAEA,SAAS2B,EAAW1B,EAAKC,GACrB,OAAQD,EAAIC,GACJD,EAAIC,EAAM,IAAM,EAChBD,EAAIC,EAAM,IAAM,GAChBD,EAAIC,EAAM,IAAM,MAAQ,CACpC,CAEA,SAAS0B,EAAW3B,EAAKC,GACrB,OAAQD,EAAIC,IAAY,GAChBD,EAAIC,EAAM,IAAM,GAChBD,EAAIC,EAAM,IAAM,EAChBD,EAAIC,EAAM,MAAQ,CAC9B,CA5UArH,EAAOC,QAAU4G,EAAQA,+BCOzB,SAASnB,QAAQsE,YACb,IACI,IAAIC,IAAMC,KAAK,QAAQ/F,QAAQ,IAAI,MAAzB+F,CAAgCF,YAC1C,GAAIC,MAAQA,IAAI1J,QAAUoD,OAAOC,KAAKqG,KAAK1J,QACvC,OAAO0J,GACf,CAAE,MAAOE,GAAI,CACb,OAAO,IACX,CAfAnK,OAAOC,QAAUyF,mCCMjB,IAAI0E,EAAOnK,EAEPoK,EAMJD,EAAKC,WAAa,SAAoBD,GAClC,MAAO,eAAetH,KAAKsH,EAC/B,EAEIE,EAMJF,EAAKE,UAAY,SAAmBF,GAGhC,IAAIrI,GAFJqI,EAAOA,EAAKjG,QAAQ,MAAO,KACfA,QAAQ,UAAW,MACXoG,MAAM,KACtBC,EAAWH,EAAWD,GACtBK,EAAW,GACXD,IACAC,EAAS1I,EAAM2I,QAAU,KAC7B,IAAK,IAAIjJ,EAAI,EAAGA,EAAIM,EAAMxB,QACL,OAAbwB,EAAMN,GACFA,EAAI,GAAsB,OAAjBM,EAAMN,EAAI,GACnBM,EAAMqD,SAAS3D,EAAG,GACb+I,EACLzI,EAAMqD,OAAO3D,EAAG,KAEdA,EACc,MAAbM,EAAMN,GACbM,EAAMqD,OAAO3D,EAAG,KAEdA,EAEV,OAAOgJ,EAAS1I,EAAMQ,KAAK,IAC/B,EASA6H,EAAKxJ,QAAU,SAAiB+J,EAAYC,EAAaC,GAGrD,OAFKA,IACDD,EAAcN,EAAUM,IACxBP,EAAWO,GACJA,GACNC,IACDF,EAAaL,EAAUK,KACnBA,EAAaA,EAAWxG,QAAQ,iBAAkB,KAAK5D,OAAS+J,EAAUK,EAAa,IAAMC,GAAeA,EACxH,yBC/DA5K,EAAOC,QA6BP,SAAc6K,EAAOxI,EAAOyI,GACxB,IAAIC,EAASD,GAAQ,KACjBE,EAASD,IAAS,EAClBE,EAAS,KACT1K,EAASwK,EACb,OAAO,SAAoBD,GACvB,GAAIA,EAAO,GAAKA,EAAOE,EACnB,OAAOH,EAAMC,GACbvK,EAASuK,EAAOC,IAChBE,EAAOJ,EAAME,GACbxK,EAAS,GAEb,IAAI4G,EAAM9E,EAAM6I,KAAKD,EAAM1K,EAAQA,GAAUuK,GAG7C,OAFa,EAATvK,IACAA,EAAwB,GAAL,EAATA,IACP4G,CACX,CACJ,6BCxCA,IAAIgE,EAAOnL,EAOXmL,EAAK7K,OAAS,SAAqBU,GAG/B,IAFA,IAAIoK,EAAM,EACN3I,EAAI,EACCjB,EAAI,EAAGA,EAAIR,EAAOV,SAAUkB,GACjCiB,EAAIzB,EAAO0B,WAAWlB,IACd,IACJ4J,GAAO,EACF3I,EAAI,KACT2I,GAAO,EACe,QAAZ,MAAJ3I,IAAkE,QAAZ,MAA3BzB,EAAO0B,WAAWlB,EAAI,OACrDA,EACF4J,GAAO,GAEPA,GAAO,EAEf,OAAOA,CACX,EASAD,EAAKE,KAAO,SAAmB3J,EAAQC,EAAOC,GAE1C,GADUA,EAAMD,EACN,EACN,MAAO,GAKX,IAJA,IAGIE,EAHAC,EAAQ,KACRC,EAAQ,GACRP,EAAI,EAEDG,EAAQC,IACXC,EAAIH,EAAOC,MACH,IACJI,EAAMP,KAAOK,EACRA,EAAI,KAAOA,EAAI,IACpBE,EAAMP,MAAY,GAAJK,IAAW,EAAsB,GAAlBH,EAAOC,KAC/BE,EAAI,KAAOA,EAAI,KACpBA,IAAU,EAAJA,IAAU,IAAwB,GAAlBH,EAAOC,OAAkB,IAAwB,GAAlBD,EAAOC,OAAkB,EAAsB,GAAlBD,EAAOC,MAAiB,MAC1GI,EAAMP,KAAO,OAAUK,GAAK,IAC5BE,EAAMP,KAAO,OAAc,KAAJK,IAEvBE,EAAMP,MAAY,GAAJK,IAAW,IAAwB,GAAlBH,EAAOC,OAAkB,EAAsB,GAAlBD,EAAOC,KACnEH,EAAI,QACHM,IAAUA,EAAQ,KAAKI,KAAKC,OAAOC,aAAatB,MAAMqB,OAAQJ,IAC/DP,EAAI,GAGZ,OAAIM,GACIN,GACAM,EAAMI,KAAKC,OAAOC,aAAatB,MAAMqB,OAAQJ,EAAMM,MAAM,EAAGb,KACzDM,EAAMQ,KAAK,KAEfH,OAAOC,aAAatB,MAAMqB,OAAQJ,EAAMM,MAAM,EAAGb,GAC5D,EASA2J,EAAKG,MAAQ,SAAoBtK,EAAQU,EAAQnB,GAI7C,IAHA,IACIgL,EACAC,EAFA7J,EAAQpB,EAGHiB,EAAI,EAAGA,EAAIR,EAAOV,SAAUkB,GACjC+J,EAAKvK,EAAO0B,WAAWlB,IACd,IACLE,EAAOnB,KAAYgL,EACZA,EAAK,MACZ7J,EAAOnB,KAAYgL,GAAM,EAAU,IACnC7J,EAAOnB,KAAuB,GAAXgL,EAAgB,KACV,QAAZ,MAALA,IAA0E,QAAZ,OAAjCC,EAAKxK,EAAO0B,WAAWlB,EAAI,MAChE+J,EAAK,QAAiB,KAALA,IAAgB,KAAY,KAALC,KACtChK,EACFE,EAAOnB,KAAYgL,GAAM,GAAU,IACnC7J,EAAOnB,KAAYgL,GAAM,GAAK,GAAK,IACnC7J,EAAOnB,KAAYgL,GAAM,EAAK,GAAK,IACnC7J,EAAOnB,KAAuB,GAAXgL,EAAgB,MAEnC7J,EAAOnB,KAAYgL,GAAM,GAAU,IACnC7J,EAAOnB,KAAYgL,GAAM,EAAK,GAAK,IACnC7J,EAAOnB,KAAuB,GAAXgL,EAAgB,KAG3C,OAAOhL,EAASoB,CACpB,kBClGA3B,EAAQyL,WA2IR,SAAoBpG,GAQnB,GAPAA,EAAK,IAAMT,KAAK8G,UAAY,KAAO,IAClC9G,KAAK+G,WACJ/G,KAAK8G,UAAY,MAAQ,KAC1BrG,EAAK,IACJT,KAAK8G,UAAY,MAAQ,KAC1B,IAAM3L,EAAOC,QAAQ4L,SAAShH,KAAKiH,OAE/BjH,KAAK8G,UACT,OAGD,MAAMjJ,EAAI,UAAYmC,KAAKkH,MAC3BzG,EAAKF,OAAO,EAAG,EAAG1C,EAAG,kBAKrB,IAAIjC,EAAQ,EACRuL,EAAQ,EACZ1G,EAAK,GAAGnB,QAAQ,eAAe8H,IAChB,OAAVA,IAGJxL,IACc,OAAVwL,IAGHD,EAAQvL,GACT,IAGD6E,EAAKF,OAAO4G,EAAO,EAAGtJ,EACvB,EA3KAzC,EAAQiM,KA6LR,SAAcC,GACb,IACKA,EACHlM,EAAQmM,QAAQC,QAAQ,QAASF,GAEjClM,EAAQmM,QAAQE,WAAW,QAE7B,CAAE,MAAOC,GAGT,CACD,EAvMAtM,EAAQuM,KA+MR,WACC,IAAIC,EACJ,IACCA,EAAIxM,EAAQmM,QAAQM,QAAQ,QAC7B,CAAE,MAAOH,GAGT,CAOA,OAJKE,GAAwB,oBAAZE,SAA2B,QAASA,UACpDF,EAAIE,QAAQC,IAAIC,OAGVJ,CACR,EA7NAxM,EAAQ0L,UAyGR,WAIC,QAAsB,oBAAXmB,SAA0BA,OAAOH,SAAoC,aAAxBG,OAAOH,QAAQI,OAAuBD,OAAOH,QAAQK,UAKpF,oBAAdC,YAA6BA,UAAUC,YAAaD,UAAUC,UAAUC,cAAclB,MAAM,4BAM3E,oBAAbmB,UAA4BA,SAASC,iBAAmBD,SAASC,gBAAgBC,OAASF,SAASC,gBAAgBC,MAAMC,kBAEpH,oBAAXT,QAA0BA,OAAOtJ,UAAYsJ,OAAOtJ,QAAQgK,SAAYV,OAAOtJ,QAAQiK,WAAaX,OAAOtJ,QAAQkK,QAGrG,oBAAdT,WAA6BA,UAAUC,WAAaD,UAAUC,UAAUC,cAAclB,MAAM,mBAAqB0B,SAASC,OAAOvJ,GAAI,KAAO,IAE9H,oBAAd4I,WAA6BA,UAAUC,WAAaD,UAAUC,UAAUC,cAAclB,MAAM,sBACtG,EA/HAhM,EAAQmM,QAyOR,WACC,IAGC,OAAOyB,YACR,CAAE,MAAOtB,GAGT,CACD,CAlPkBuB,GAClB7N,EAAQ8N,QAAU,MACjB,IAAIC,GAAS,EAEb,MAAO,KACDA,IACJA,GAAS,EACTxK,QAAQyK,KAAK,yIACd,CAED,EATiB,GAelBhO,EAAQiO,OAAS,CAChB,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,WAsFDjO,EAAQwD,IAAMD,QAAQ2K,OAAS3K,QAAQC,KAAO,MAAS,GAkEvDzD,EAAOC,QAAU,EAAQ,IAAR,CAAoBA,GAErC,MAAM,WAACmO,GAAcpO,EAAOC,QAM5BmO,EAAWnM,EAAI,SAAUoM,GACxB,IACC,OAAO5J,KAAKC,UAAU2J,EACvB,CAAE,MAAO9B,GACR,MAAO,+BAAiCA,EAAM+B,OAC/C,CACD,iBCKAtO,EAAOC,QA3QP,SAAe2M,GAqDd,SAAS2B,EAAY3C,GACpB,IAAI4C,EAEAC,EACAC,EAFAC,EAAiB,KAIrB,SAASR,KAAS7I,GAEjB,IAAK6I,EAAMS,QACV,OAGD,MAAMC,EAAOV,EAGPW,EAAOvK,OAAO,IAAIwK,MAClBC,EAAKF,GAAQN,GAAYM,GAC/BD,EAAK/C,KAAOkD,EACZH,EAAKI,KAAOT,EACZK,EAAKC,KAAOA,EACZN,EAAWM,EAEXxJ,EAAK,GAAKiJ,EAAYW,OAAO5J,EAAK,IAEX,iBAAZA,EAAK,IAEfA,EAAK6J,QAAQ,MAId,IAAI1O,EAAQ,EACZ6E,EAAK,GAAKA,EAAK,GAAGnB,QAAQ,iBAAiB,CAAC8H,EAAOmD,KAElD,GAAc,OAAVnD,EACH,MAAO,IAERxL,IACA,MAAM4O,EAAYd,EAAYH,WAAWgB,GACzC,GAAyB,mBAAdC,EAA0B,CACpC,MAAMlI,EAAM7B,EAAK7E,GACjBwL,EAAQoD,EAAUlE,KAAK0D,EAAM1H,GAG7B7B,EAAKF,OAAO3E,EAAO,GACnBA,GACD,CACA,OAAOwL,CAAK,IAIbsC,EAAY7C,WAAWP,KAAK0D,EAAMvJ,IAEpBuJ,EAAKpL,KAAO8K,EAAY9K,KAChC1C,MAAM8N,EAAMvJ,EACnB,CAgCA,OA9BA6I,EAAMvC,UAAYA,EAClBuC,EAAMxC,UAAY4C,EAAY5C,YAC9BwC,EAAMpC,MAAQwC,EAAYe,YAAY1D,GACtCuC,EAAMoB,OAASA,EACfpB,EAAMJ,QAAUQ,EAAYR,QAE5BpK,OAAO6L,eAAerB,EAAO,UAAW,CACvCsB,YAAY,EACZC,cAAc,EACdC,IAAK,IACmB,OAAnBhB,EACIA,GAEJF,IAAoBF,EAAYpC,aACnCsC,EAAkBF,EAAYpC,WAC9BuC,EAAeH,EAAYK,QAAQhD,IAG7B8C,GAERkB,IAAKvB,IACJM,EAAiBN,CAAC,IAKY,mBAArBE,EAAYsB,MACtBtB,EAAYsB,KAAK1B,GAGXA,CACR,CAEA,SAASoB,EAAO3D,EAAWkE,GAC1B,MAAMC,EAAWxB,EAAY1J,KAAK+G,gBAAkC,IAAdkE,EAA4B,IAAMA,GAAalE,GAErG,OADAmE,EAAStM,IAAMoB,KAAKpB,IACbsM,CACR,CAwFA,SAASC,EAAYC,GACpB,OAAOA,EAAO3M,WACZ4M,UAAU,EAAGD,EAAO3M,WAAW/C,OAAS,GACxC4D,QAAQ,UAAW,IACtB,CA0BA,OAvQAoK,EAAYJ,MAAQI,EACpBA,EAAY4B,QAAU5B,EACtBA,EAAYW,OAoPZ,SAAgB/H,GACf,OAAIA,aAAetE,MACXsE,EAAIiJ,OAASjJ,EAAImH,QAElBnH,CACR,EAxPAoH,EAAY8B,QAwLZ,WACC,MAAMlE,EAAa,IACfoC,EAAY+B,MAAMC,IAAIP,MACtBzB,EAAYiC,MAAMD,IAAIP,GAAaO,KAAI3E,GAAa,IAAMA,KAC5DrJ,KAAK,KAEP,OADAgM,EAAYkC,OAAO,IACZtE,CACR,EA9LAoC,EAAYkC,OAsJZ,SAAgBtE,GAOf,IAAI1K,EANJ8M,EAAYrC,KAAKC,GACjBoC,EAAYpC,WAAaA,EAEzBoC,EAAY+B,MAAQ,GACpB/B,EAAYiC,MAAQ,GAGpB,MAAMjG,GAA+B,iBAAf4B,EAA0BA,EAAa,IAAI5B,MAAM,UACjEc,EAAMd,EAAMhK,OAElB,IAAKkB,EAAI,EAAGA,EAAI4J,EAAK5J,IACf8I,EAAM9I,KAOW,OAFtB0K,EAAa5B,EAAM9I,GAAG0C,QAAQ,MAAO,QAEtB,GACdoK,EAAYiC,MAAMrO,KAAK,IAAIyL,OAAO,IAAMzB,EAAW7J,MAAM,GAAK,MAE9DiM,EAAY+B,MAAMnO,KAAK,IAAIyL,OAAO,IAAMzB,EAAa,MAGxD,EA9KAoC,EAAYK,QAsMZ,SAAiB8B,GAChB,GAA8B,MAA1BA,EAAKA,EAAKnQ,OAAS,GACtB,OAAO,EAGR,IAAIkB,EACA4J,EAEJ,IAAK5J,EAAI,EAAG4J,EAAMkD,EAAYiC,MAAMjQ,OAAQkB,EAAI4J,EAAK5J,IACpD,GAAI8M,EAAYiC,MAAM/O,GAAGqB,KAAK4N,GAC7B,OAAO,EAIT,IAAKjP,EAAI,EAAG4J,EAAMkD,EAAY+B,MAAM/P,OAAQkB,EAAI4J,EAAK5J,IACpD,GAAI8M,EAAY+B,MAAM7O,GAAGqB,KAAK4N,GAC7B,OAAO,EAIT,OAAO,CACR,EA1NAnC,EAAY1C,SAAW,EAAQ,MAC/B0C,EAAYR,QA0PZ,WACCvK,QAAQyK,KAAK,wIACd,EA1PAtK,OAAOC,KAAKgJ,GAAK+D,SAAQC,IACxBrC,EAAYqC,GAAOhE,EAAIgE,EAAI,IAO5BrC,EAAY+B,MAAQ,GACpB/B,EAAYiC,MAAQ,GAOpBjC,EAAYH,WAAa,CAAC,EAkB1BG,EAAYe,YAVZ,SAAqB1D,GACpB,IAAIiF,EAAO,EAEX,IAAK,IAAIpP,EAAI,EAAGA,EAAImK,EAAUrL,OAAQkB,IACrCoP,GAASA,GAAQ,GAAKA,EAAQjF,EAAUjJ,WAAWlB,GACnDoP,GAAQ,EAGT,OAAOtC,EAAYL,OAAO7M,KAAKyP,IAAID,GAAQtC,EAAYL,OAAO3N,OAC/D,EA2NAgO,EAAYkC,OAAOlC,EAAY/B,QAExB+B,CACR,yBCjQA,SAASwC,EAAOC,EAAKC,GACjB,IAAK,MAAML,KAAOK,EACdtN,OAAO6L,eAAewB,EAAKJ,EAAK,CAC5BtM,MAAO2M,EAAML,GACbnB,YAAY,EACZC,cAAc,IAItB,OAAOsB,CACX,CA4CAhR,EAAOC,QAnCP,SAAqBa,EAAKoQ,EAAMD,GAC5B,IAAKnQ,GAAsB,iBAARA,EACf,MAAM,IAAIqQ,UAAU,oCAGnBF,IACDA,EAAQ,CAAC,GAGO,iBAATC,IACPD,EAAQC,EACRA,EAAO,IAGPA,IACAD,EAAMC,KAAOA,GAGjB,IACI,OAAOH,EAAOjQ,EAAKmQ,EACvB,CAAE,MAAOG,GACLH,EAAM3C,QAAUxN,EAAIwN,QACpB2C,EAAMb,MAAQtP,EAAIsP,MAElB,MAAMiB,EAAW,WAAa,EAO9B,OALAA,EAAStM,UAAYpB,OAAO2N,OAAO3N,OAAO4N,eAAezQ,IAG1CiQ,EAAO,IAAIM,EAAYJ,EAG1C,CACJ,8BChEA,MAAMO,EAAmB,EAAQ,MACjCvR,EAAQ,GAAgBuR,EAAiBC,cAQvBD,EAAiBC,yCCVnC9N,OAAO6L,eAAevP,EAAS,aAAc,CAAEqE,OAAO,IACtD,MAAMoN,EACF,WAAAC,GACI9M,KAAK+M,UAAY,GACjB/M,KAAKgN,UAAY,GACjBhN,KAAKiN,cAAgB,CAAC,EACtBjN,KAAKkN,UAAW,EAChBlN,KAAKmN,WAAY,CACrB,CACA,IAAA7P,CAAKmC,GACD,GAAIO,KAAKmN,UACL,OACJ,MAAMC,EAAa,CAAE3N,QAAO4N,MAAM,GAClC,GAAIrN,KAAK+M,UAAUrR,OAAQ,CACvB,MAAM4R,EAActN,KAAK+M,UAAUlH,QAC/ByH,GACAA,EAAYvR,QAAQqR,EAC5B,MAEIpN,KAAKgN,UAAU1P,KAAKxB,QAAQC,QAAQqR,SACTrP,IAAvBiC,KAAKuN,eACLvN,KAAKgN,UAAUtR,QAAUsE,KAAKuN,gBAC7BvN,KAAKkN,WACNlN,KAAKkN,UAAW,EACZlN,KAAKiN,cAAcO,UACnBxN,KAAKiN,cAAcO,YAEd7O,SACLA,QAAQyK,KAAK,+BAA+BpJ,KAAKgN,UAAUtR,gBAI3E,CACA,IAAA+R,GACI,IAAIzN,KAAKmN,UAAT,CAEAnN,KAAKmN,WAAY,EACjBnN,KAAK0N,SACL,IAAK,MAAMJ,KAAetN,KAAK+M,UAC3BO,EAAYvR,QAAQ,CAAE0D,WAAO1B,EAAWsP,MAAM,IAElDrN,KAAK+M,UAAUrR,OAAS,CANd,CAOd,CACA,IAAAiS,CAAKjG,GACD,IAAI1H,KAAKmN,UAIT,GAFAnN,KAAKmN,WAAY,EACjBnN,KAAK0N,SACD1N,KAAK+M,UAAUrR,OAAQ,CACvB,IAAK,MAAM4R,KAAetN,KAAK+M,UAC3BO,EAAYtR,OAAO0L,GAEvB1H,KAAK+M,UAAUrR,OAAS,CAC5B,KACK,CACD,MAAMkS,EAAY9R,QAAQE,OAAO0L,GAEjCkG,EAAUC,OAAM,SAChB7N,KAAKgN,UAAU1P,KAAKsQ,EACxB,CACJ,CACA,MAAAF,GACI5R,QAAQC,UAAU+R,MAAK,KACf9N,KAAK+N,gBACL/N,KAAK+N,gBAAgB,GAEjC,CACA,CAACC,OAAOC,iBACJ,MAAO,CACHC,KAAOzO,IACH,MAAM0O,EAASnO,KAAKgN,UAAUnH,QAC9B,OAAIsI,QAC0BpQ,IAAtBiC,KAAKoO,cACLpO,KAAKgN,UAAUtR,QAAUsE,KAAKoO,cAC9BpO,KAAKkN,WACLlN,KAAKkN,UAAW,EACZlN,KAAKiN,cAAcoB,UACnBrO,KAAKiN,cAAcoB,YAGpBF,GAEFnO,KAAKmN,UACHrR,QAAQC,QAAQ,CAAE0D,WAAO1B,EAAWsP,MAAM,IAG1C,IAAIvR,SAAQ,CAACC,EAASC,KACzBgE,KAAK+M,UAAUzP,KAAK,CAAEvB,UAASC,UAAS,GAEhD,EAEJsS,OAAQ,KACJtO,KAAKmN,WAAY,EACjBnN,KAAKgN,UAAUtR,OAAS,EACxBsE,KAAK0N,SACE5R,QAAQC,QAAQ,CAAE0D,WAAO1B,EAAWsP,MAAM,KAG7D,EAEJ,MAAMT,EACF,WAAAE,CAAYyB,GAAQ,cAAEhB,EAAgB,IAAG,aAAEa,EAAe,GAAM,CAAC,GAC7D,MAAMI,EAAQ,IAAI3B,EAClB2B,EAAMjB,cAAgBA,EACtBiB,EAAMJ,aAAeA,EACrBI,EAAMT,eACFQ,EAAO,CACHjR,KAAMmC,GAAS+O,EAAMlR,KAAKmC,GAC1BgO,KAAM,IAAMe,EAAMf,OAClBE,KAAMjG,GAAS8G,EAAMb,KAAKjG,GAC1BvH,GAAI,CAACsO,EAAOpT,KACRmT,EAAMvB,cAAcwB,GAASpT,CAAE,KAEjC,MAAU,GACpB2E,KAAKgO,OAAOC,eAAiB,IAAMO,EAAMR,OAAOC,iBAChDnP,OAAO4P,OAAO1O,KAClB,EAEJ5E,EAAQwR,cAAgBA,EACxBxR,EAAA,QAAkBwR,wBCtHlB,IAAI+B,EAAM7P,OAAOoB,UAAU0O,eACvBhJ,EAAS,IASb,SAASiJ,IAAU,CA4BnB,SAASC,EAAGzT,EAAI0T,EAASC,GACvBhP,KAAK3E,GAAKA,EACV2E,KAAK+O,QAAUA,EACf/O,KAAKgP,KAAOA,IAAQ,CACtB,CAaA,SAASC,EAAYC,EAAST,EAAOpT,EAAI0T,EAASC,GAChD,GAAkB,mBAAP3T,EACT,MAAM,IAAIiR,UAAU,mCAGtB,IAAI6C,EAAW,IAAIL,EAAGzT,EAAI0T,GAAWG,EAASF,GAC1C5O,EAAMwF,EAASA,EAAS6I,EAAQA,EAMpC,OAJKS,EAAQE,QAAQhP,GACX8O,EAAQE,QAAQhP,GAAK/E,GAC1B6T,EAAQE,QAAQhP,GAAO,CAAC8O,EAAQE,QAAQhP,GAAM+O,GADhBD,EAAQE,QAAQhP,GAAK9C,KAAK6R,IADlCD,EAAQE,QAAQhP,GAAO+O,EAAUD,EAAQG,gBAI7DH,CACT,CASA,SAASI,EAAWJ,EAAS9O,GACI,KAAzB8O,EAAQG,aAAoBH,EAAQE,QAAU,IAAIP,SAC5CK,EAAQE,QAAQhP,EAC9B,CASA,SAASL,IACPC,KAAKoP,QAAU,IAAIP,EACnB7O,KAAKqP,aAAe,CACtB,CAzEIvQ,OAAO2N,SACToC,EAAO3O,UAAYpB,OAAO2N,OAAO,OAM5B,IAAIoC,GAASU,YAAW3J,GAAS,IA2ExC7F,EAAaG,UAAUsP,WAAa,WAClC,IACIC,EACA5D,EAFAJ,EAAQ,GAIZ,GAA0B,IAAtBzL,KAAKqP,aAAoB,OAAO5D,EAEpC,IAAKI,KAAS4D,EAASzP,KAAKoP,QACtBT,EAAIrI,KAAKmJ,EAAQ5D,IAAOJ,EAAMnO,KAAKsI,EAASiG,EAAKpO,MAAM,GAAKoO,GAGlE,OAAI/M,OAAO4Q,sBACFjE,EAAMkE,OAAO7Q,OAAO4Q,sBAAsBD,IAG5ChE,CACT,EASA1L,EAAaG,UAAUI,UAAY,SAAmBmO,GACpD,IAAIrO,EAAMwF,EAASA,EAAS6I,EAAQA,EAChCmB,EAAW5P,KAAKoP,QAAQhP,GAE5B,IAAKwP,EAAU,MAAO,GACtB,GAAIA,EAASvU,GAAI,MAAO,CAACuU,EAASvU,IAElC,IAAK,IAAIuB,EAAI,EAAGiT,EAAID,EAASlU,OAAQoU,EAAK,IAAItU,MAAMqU,GAAIjT,EAAIiT,EAAGjT,IAC7DkT,EAAGlT,GAAKgT,EAAShT,GAAGvB,GAGtB,OAAOyU,CACT,EASA/P,EAAaG,UAAU6P,cAAgB,SAAuBtB,GAC5D,IAAIrO,EAAMwF,EAASA,EAAS6I,EAAQA,EAChCnO,EAAYN,KAAKoP,QAAQhP,GAE7B,OAAKE,EACDA,EAAUjF,GAAW,EAClBiF,EAAU5E,OAFM,CAGzB,EASAqE,EAAaG,UAAUM,KAAO,SAAciO,EAAOuB,EAAIC,EAAIC,EAAIC,EAAIC,GACjE,IAAIhQ,EAAMwF,EAASA,EAAS6I,EAAQA,EAEpC,IAAKzO,KAAKoP,QAAQhP,GAAM,OAAO,EAE/B,IAEIK,EACA7D,EAHA0D,EAAYN,KAAKoP,QAAQhP,GACzBoG,EAAM/K,UAAUC,OAIpB,GAAI4E,EAAUjF,GAAI,CAGhB,OAFIiF,EAAU0O,MAAMhP,KAAKqQ,eAAe5B,EAAOnO,EAAUjF,QAAI0C,GAAW,GAEhEyI,GACN,KAAK,EAAG,OAAOlG,EAAUjF,GAAGiL,KAAKhG,EAAUyO,UAAU,EACrD,KAAK,EAAG,OAAOzO,EAAUjF,GAAGiL,KAAKhG,EAAUyO,QAASiB,IAAK,EACzD,KAAK,EAAG,OAAO1P,EAAUjF,GAAGiL,KAAKhG,EAAUyO,QAASiB,EAAIC,IAAK,EAC7D,KAAK,EAAG,OAAO3P,EAAUjF,GAAGiL,KAAKhG,EAAUyO,QAASiB,EAAIC,EAAIC,IAAK,EACjE,KAAK,EAAG,OAAO5P,EAAUjF,GAAGiL,KAAKhG,EAAUyO,QAASiB,EAAIC,EAAIC,EAAIC,IAAK,EACrE,KAAK,EAAG,OAAO7P,EAAUjF,GAAGiL,KAAKhG,EAAUyO,QAASiB,EAAIC,EAAIC,EAAIC,EAAIC,IAAK,EAG3E,IAAKxT,EAAI,EAAG6D,EAAO,IAAIjF,MAAMgL,EAAK,GAAI5J,EAAI4J,EAAK5J,IAC7C6D,EAAK7D,EAAI,GAAKnB,UAAUmB,GAG1B0D,EAAUjF,GAAGa,MAAMoE,EAAUyO,QAAStO,EACxC,KAAO,CACL,IACIrD,EADA1B,EAAS4E,EAAU5E,OAGvB,IAAKkB,EAAI,EAAGA,EAAIlB,EAAQkB,IAGtB,OAFI0D,EAAU1D,GAAGoS,MAAMhP,KAAKqQ,eAAe5B,EAAOnO,EAAU1D,GAAGvB,QAAI0C,GAAW,GAEtEyI,GACN,KAAK,EAAGlG,EAAU1D,GAAGvB,GAAGiL,KAAKhG,EAAU1D,GAAGmS,SAAU,MACpD,KAAK,EAAGzO,EAAU1D,GAAGvB,GAAGiL,KAAKhG,EAAU1D,GAAGmS,QAASiB,GAAK,MACxD,KAAK,EAAG1P,EAAU1D,GAAGvB,GAAGiL,KAAKhG,EAAU1D,GAAGmS,QAASiB,EAAIC,GAAK,MAC5D,KAAK,EAAG3P,EAAU1D,GAAGvB,GAAGiL,KAAKhG,EAAU1D,GAAGmS,QAASiB,EAAIC,EAAIC,GAAK,MAChE,QACE,IAAKzP,EAAM,IAAKrD,EAAI,EAAGqD,EAAO,IAAIjF,MAAMgL,EAAK,GAAIpJ,EAAIoJ,EAAKpJ,IACxDqD,EAAKrD,EAAI,GAAK3B,UAAU2B,GAG1BkD,EAAU1D,GAAGvB,GAAGa,MAAMoE,EAAU1D,GAAGmS,QAAStO,GAGpD,CAEA,OAAO,CACT,EAWAV,EAAaG,UAAUC,GAAK,SAAYsO,EAAOpT,EAAI0T,GACjD,OAAOE,EAAYjP,KAAMyO,EAAOpT,EAAI0T,GAAS,EAC/C,EAWAhP,EAAaG,UAAU8O,KAAO,SAAcP,EAAOpT,EAAI0T,GACrD,OAAOE,EAAYjP,KAAMyO,EAAOpT,EAAI0T,GAAS,EAC/C,EAYAhP,EAAaG,UAAUmQ,eAAiB,SAAwB5B,EAAOpT,EAAI0T,EAASC,GAClF,IAAI5O,EAAMwF,EAASA,EAAS6I,EAAQA,EAEpC,IAAKzO,KAAKoP,QAAQhP,GAAM,OAAOJ,KAC/B,IAAK3E,EAEH,OADAiU,EAAWtP,KAAMI,GACVJ,KAGT,IAAIM,EAAYN,KAAKoP,QAAQhP,GAE7B,GAAIE,EAAUjF,GAEViF,EAAUjF,KAAOA,GACf2T,IAAQ1O,EAAU0O,MAClBD,GAAWzO,EAAUyO,UAAYA,GAEnCO,EAAWtP,KAAMI,OAEd,CACL,IAAK,IAAIxD,EAAI,EAAG6S,EAAS,GAAI/T,EAAS4E,EAAU5E,OAAQkB,EAAIlB,EAAQkB,KAEhE0D,EAAU1D,GAAGvB,KAAOA,GACnB2T,IAAS1O,EAAU1D,GAAGoS,MACtBD,GAAWzO,EAAU1D,GAAGmS,UAAYA,IAErCU,EAAOnS,KAAKgD,EAAU1D,IAOtB6S,EAAO/T,OAAQsE,KAAKoP,QAAQhP,GAAyB,IAAlBqP,EAAO/T,OAAe+T,EAAO,GAAKA,EACpEH,EAAWtP,KAAMI,EACxB,CAEA,OAAOJ,IACT,EASAD,EAAaG,UAAUoQ,mBAAqB,SAA4B7B,GACtE,IAAIrO,EAUJ,OARIqO,GACFrO,EAAMwF,EAASA,EAAS6I,EAAQA,EAC5BzO,KAAKoP,QAAQhP,IAAMkP,EAAWtP,KAAMI,KAExCJ,KAAKoP,QAAU,IAAIP,EACnB7O,KAAKqP,aAAe,GAGfrP,IACT,EAKAD,EAAaG,UAAUG,IAAMN,EAAaG,UAAUmQ,eACpDtQ,EAAaG,UAAU+O,YAAclP,EAAaG,UAAUC,GAK5DJ,EAAawQ,SAAW3K,EAKxB7F,EAAaA,aAAeA,EAM1B5E,EAAOC,QAAU2E,WC9UnB5E,EAAOC,QAAU,SAAUoV,GAEzB,IAAKA,EAAK,MAAMxS,MAAM,iEAEtB,IAAIkI,EAAO,EAAGuK,EAAQ3R,OAAO2N,OAAO,MAAOiE,EAAS5R,OAAO2N,OAAO,MAElE,SAASkE,EAAQ5E,EAAKtM,GACpBgR,EAAM1E,GAAOtM,IACbyG,GACWsK,IACTtK,EAAO,EACPwK,EAASD,EACTA,EAAQ3R,OAAO2N,OAAO,MAE1B,CAEA,MAAO,CACLkC,IAAK,SAAU5C,GACb,YAAsBhO,IAAf0S,EAAM1E,SAAsChO,IAAhB2S,EAAO3E,EAC5C,EACA2B,OAAQ,SAAU3B,QACEhO,IAAf0S,EAAM1E,KACP0E,EAAM1E,QAAOhO,QACIA,IAAhB2S,EAAO3E,KACR2E,EAAO3E,QAAOhO,EAClB,EACA+M,IAAK,SAAUiB,GACb,IAAIvC,EAAIiH,EAAM1E,GACd,YAAShO,IAANyL,EAAwBA,OACFzL,KAArByL,EAAIkH,EAAO3E,KACb4E,EAAO5E,EAAKvC,GACLA,QAFT,CAIF,EACAuB,IAAK,SAAUgB,EAAKtM,QACA1B,IAAf0S,EAAM1E,GAAoB0E,EAAM1E,GAAOtM,EACrCkR,EAAO5E,EAAKtM,EACnB,EACAmR,MAAO,WACLH,EAAQ3R,OAAO2N,OAAO,MACtBiE,EAAS5R,OAAO2N,OAAO,KACzB,EAEJ,kBC3CA,OASA,WACE,aAEA,IAAIoE,EAAyB,iBAAX5I,OAAsBA,OAAS,CAAC,GACnC4I,EAAKC,sBAA2C,iBAAZhJ,SAAwBA,QAAQiJ,UAAYjJ,QAAQiJ,SAASC,OAE9GH,EAAOI,QAET,IAAIC,GAAaL,EAAKM,wBAAwDhW,EAAOC,QACjFgW,EAAsC,OACtCC,EAAqB,mCAAmC3L,MAAM,IAC9D4L,EAAqB,CACvB,EAAK,EAAG,EAAK,EAAG,EAAK,EAAG,EAAK,EAAG,EAAK,EAAG,EAAK,EAAG,EAAK,EAAG,EAAK,EAAG,EAAK,EACrE,EAAK,EAAG,EAAK,GAAI,EAAK,GAAI,EAAK,GAAI,EAAK,GAAI,EAAK,GAAI,EAAK,GAAI,EAAK,GACnE,EAAK,GAAI,EAAK,GAAI,EAAK,GAAI,EAAK,GAAI,EAAK,GAAI,EAAK,GAAI,EAAK,GAAI,EAAK,GACpE,EAAK,GAAI,EAAK,GAAI,EAAK,GAAI,EAAK,GAAI,EAAK,GAAI,EAAK,GAAI,EAAK,IAGzDC,EAAS,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAE/BC,EAAmB,SAAUC,EAAUC,GACrCA,EAAQhW,OAAS,KACnBgW,EAAU,MAAQA,EAAQC,QAAQ,KAEpC,IAAI1V,EAAM,IAAI+B,MAAM,kGAEiByT,EAAW,WAAaC,EAAU,OAEvE,MADAzV,EAAIwV,SAAWA,EACTxV,CACR,EAgDI2V,EAAgB,SAAUC,GAC5B,GAAkB,KAAdA,EACF,MAAO,GACF,IAAK,eAAe5T,KAAK4T,GAC9B,MAAM,IAAI7T,MAAM,6BAMlB,IAHA,IAAI8T,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAQ,GAAI1W,EAAQ,EAAGF,GAD3DmW,EAAYA,EAAUvS,QAAQ,KAAM,KAC0C5D,OAGrEkB,EAAI,EAAG2V,EAAQ7W,GAAU,GAAK,EAAGkB,EAAI2V,GAC5CT,EAAKR,EAAmBO,EAAUtV,OAAOK,MACzCmV,EAAKT,EAAmBO,EAAUtV,OAAOK,MACzCoV,EAAKV,EAAmBO,EAAUtV,OAAOK,MACzCqV,EAAKX,EAAmBO,EAAUtV,OAAOK,MACzCsV,EAAKZ,EAAmBO,EAAUtV,OAAOK,MACzCuV,EAAKb,EAAmBO,EAAUtV,OAAOK,MACzCwV,EAAKd,EAAmBO,EAAUtV,OAAOK,MACzCyV,EAAKf,EAAmBO,EAAUtV,OAAOK,MACzC0V,EAAM1W,KAAkC,KAAtBkW,GAAM,EAAIC,IAAO,GACnCO,EAAM1W,KAA4C,KAAhCmW,GAAM,EAAIC,GAAM,EAAIC,IAAO,GAC7CK,EAAM1W,KAAkC,KAAtBqW,GAAM,EAAIC,IAAO,GACnCI,EAAM1W,KAA4C,KAAhCsW,GAAM,EAAIC,GAAM,EAAIC,IAAO,GAC7CE,EAAM1W,KAA4B,KAAhBwW,GAAM,EAAIC,GAI9B,IAAIG,EAAS9W,EAAS6W,EAkCtB,OAjCe,IAAXC,GACFV,EAAKR,EAAmBO,EAAUtV,OAAOK,MACzCmV,EAAKT,EAAmBO,EAAUtV,OAAOK,MACzC0V,EAAM1W,KAAkC,KAAtBkW,GAAM,EAAIC,IAAO,IACf,IAAXS,GACTV,EAAKR,EAAmBO,EAAUtV,OAAOK,MACzCmV,EAAKT,EAAmBO,EAAUtV,OAAOK,MACzCoV,EAAKV,EAAmBO,EAAUtV,OAAOK,MACzCqV,EAAKX,EAAmBO,EAAUtV,OAAOK,MACzC0V,EAAM1W,KAAkC,KAAtBkW,GAAM,EAAIC,IAAO,GACnCO,EAAM1W,KAA4C,KAAhCmW,GAAM,EAAIC,GAAM,EAAIC,IAAO,IACzB,IAAXO,GACTV,EAAKR,EAAmBO,EAAUtV,OAAOK,MACzCmV,EAAKT,EAAmBO,EAAUtV,OAAOK,MACzCoV,EAAKV,EAAmBO,EAAUtV,OAAOK,MACzCqV,EAAKX,EAAmBO,EAAUtV,OAAOK,MACzCsV,EAAKZ,EAAmBO,EAAUtV,OAAOK,MACzC0V,EAAM1W,KAAkC,KAAtBkW,GAAM,EAAIC,IAAO,GACnCO,EAAM1W,KAA4C,KAAhCmW,GAAM,EAAIC,GAAM,EAAIC,IAAO,GAC7CK,EAAM1W,KAAkC,KAAtBqW,GAAM,EAAIC,IAAO,IACf,IAAXM,IACTV,EAAKR,EAAmBO,EAAUtV,OAAOK,MACzCmV,EAAKT,EAAmBO,EAAUtV,OAAOK,MACzCoV,EAAKV,EAAmBO,EAAUtV,OAAOK,MACzCqV,EAAKX,EAAmBO,EAAUtV,OAAOK,MACzCsV,EAAKZ,EAAmBO,EAAUtV,OAAOK,MACzCuV,EAAKb,EAAmBO,EAAUtV,OAAOK,MACzCwV,EAAKd,EAAmBO,EAAUtV,OAAOK,MACzC0V,EAAM1W,KAAkC,KAAtBkW,GAAM,EAAIC,IAAO,GACnCO,EAAM1W,KAA4C,KAAhCmW,GAAM,EAAIC,GAAM,EAAIC,IAAO,GAC7CK,EAAM1W,KAAkC,KAAtBqW,GAAM,EAAIC,IAAO,GACnCI,EAAM1W,KAA4C,KAAhCsW,GAAM,EAAIC,GAAM,EAAIC,IAAO,IAExCE,CACT,EAgOI1U,EAAS,SAAUiU,EAAWY,GAChC,IAAKA,EACH,OA9Ue,SAAUH,GAE3B,IADA,IAAgEjV,EAAGQ,EAA/D6U,EAAM,GAAIhX,EAAS4W,EAAM5W,OAAQkB,EAAI,EAAG+V,EAAiB,EACtD/V,EAAIlB,GAET,IADA2B,EAAIiV,EAAM1V,OACD,IACP8V,GAAOnV,OAAOC,aAAaH,OAD7B,CAGWA,EAAI,KAAQA,GAAK,KAC1BQ,EAAQ,GAAJR,EACJsV,EAAiB,GACRtV,GAAK,KACdQ,EAAQ,GAAJR,EACJsV,EAAiB,GACRtV,GAAK,KACdQ,EAAQ,EAAJR,EACJsV,EAAiB,GAEjBnB,EAAiB5U,EAAG8V,GAGtB,IAAK,IAAItV,EAAI,EAAGA,EAAIuV,IAAkBvV,IACpCC,EAAIiV,EAAM1V,MACF,KAAQS,EAAI,MAClBmU,EAAiB5U,EAAG8V,GAEtB7U,IAAM,EACNA,GAAS,GAAJR,EAEHQ,GAAK,OAAUA,GAAK,OACtB2T,EAAiB5U,EAAG8V,GAElB7U,EAAI,SACN2T,EAAiB5U,EAAG8V,GAGlB7U,GAAK,MACP6U,GAAOnV,OAAOC,aAAaK,IAE3BA,GAAK,MACL6U,GAAOnV,OAAOC,aAAyB,OAAXK,GAAK,KACjC6U,GAAOnV,OAAOC,aAA2B,OAAT,KAAJK,IAtB9B,CAyBF,OAAO6U,CACT,CAkSWE,CAAahB,EAAcC,IAEpC,GAAkB,KAAdA,EACF,MAAO,GACF,IAAK,eAAe5T,KAAK4T,GAC9B,MAAM,IAAI7T,MAAM,6BAElB,IAAI8T,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIK,EAAM,GAAIhX,EAASmW,EAAUgB,QAAQ,MACzD,IAAZnX,IACFA,EAASmW,EAAUnW,QAIrB,IAAK,IAAIkB,EAAI,EAAG2V,EAAQ7W,GAAU,GAAK,EAAGkB,EAAI2V,GAC5CT,EAAKR,EAAmBO,EAAUtV,OAAOK,MACzCmV,EAAKT,EAAmBO,EAAUtV,OAAOK,MACzCoV,EAAKV,EAAmBO,EAAUtV,OAAOK,MACzCqV,EAAKX,EAAmBO,EAAUtV,OAAOK,MACzCsV,EAAKZ,EAAmBO,EAAUtV,OAAOK,MACzCuV,EAAKb,EAAmBO,EAAUtV,OAAOK,MACzCwV,EAAKd,EAAmBO,EAAUtV,OAAOK,MACzCyV,EAAKf,EAAmBO,EAAUtV,OAAOK,MACzC8V,GAAOnV,OAAOC,aAAoC,KAAtBsU,GAAM,EAAIC,IAAO,IAC3CxU,OAAOC,aAA8C,KAAhCuU,GAAM,EAAIC,GAAM,EAAIC,IAAO,IAChD1U,OAAOC,aAAoC,KAAtByU,GAAM,EAAIC,IAAO,IACtC3U,OAAOC,aAA8C,KAAhC0U,GAAM,EAAIC,GAAM,EAAIC,IAAO,IAChD7U,OAAOC,aAA8B,KAAhB4U,GAAM,EAAIC,IAInC,IAAIG,EAAS9W,EAAS6W,EAkCtB,OAjCe,IAAXC,GACFV,EAAKR,EAAmBO,EAAUtV,OAAOK,MACzCmV,EAAKT,EAAmBO,EAAUtV,OAAOK,MACzC8V,GAAOnV,OAAOC,aAAoC,KAAtBsU,GAAM,EAAIC,IAAO,KACzB,IAAXS,GACTV,EAAKR,EAAmBO,EAAUtV,OAAOK,MACzCmV,EAAKT,EAAmBO,EAAUtV,OAAOK,MACzCoV,EAAKV,EAAmBO,EAAUtV,OAAOK,MACzCqV,EAAKX,EAAmBO,EAAUtV,OAAOK,MACzC8V,GAAOnV,OAAOC,aAAoC,KAAtBsU,GAAM,EAAIC,IAAO,IAC3CxU,OAAOC,aAA8C,KAAhCuU,GAAM,EAAIC,GAAM,EAAIC,IAAO,KAC9B,IAAXO,GACTV,EAAKR,EAAmBO,EAAUtV,OAAOK,MACzCmV,EAAKT,EAAmBO,EAAUtV,OAAOK,MACzCoV,EAAKV,EAAmBO,EAAUtV,OAAOK,MACzCqV,EAAKX,EAAmBO,EAAUtV,OAAOK,MACzCsV,EAAKZ,EAAmBO,EAAUtV,OAAOK,MACzC8V,GAAOnV,OAAOC,aAAoC,KAAtBsU,GAAM,EAAIC,IAAO,IAC3CxU,OAAOC,aAA8C,KAAhCuU,GAAM,EAAIC,GAAM,EAAIC,IAAO,IAChD1U,OAAOC,aAAoC,KAAtByU,GAAM,EAAIC,IAAO,KACpB,IAAXM,IACTV,EAAKR,EAAmBO,EAAUtV,OAAOK,MACzCmV,EAAKT,EAAmBO,EAAUtV,OAAOK,MACzCoV,EAAKV,EAAmBO,EAAUtV,OAAOK,MACzCqV,EAAKX,EAAmBO,EAAUtV,OAAOK,MACzCsV,EAAKZ,EAAmBO,EAAUtV,OAAOK,MACzCuV,EAAKb,EAAmBO,EAAUtV,OAAOK,MACzCwV,EAAKd,EAAmBO,EAAUtV,OAAOK,MACzC8V,GAAOnV,OAAOC,aAAoC,KAAtBsU,GAAM,EAAIC,IAAO,IAC3CxU,OAAOC,aAA8C,KAAhCuU,GAAM,EAAIC,GAAM,EAAIC,IAAO,IAChD1U,OAAOC,aAAoC,KAAtByU,GAAM,EAAIC,IAAO,IACtC3U,OAAOC,aAA8C,KAAhC0U,GAAM,EAAIC,GAAM,EAAIC,IAAO,KAE7CM,CACT,EAEItX,EAAU,CACZyB,OApFW,SAAUiW,EAAOL,GAC5B,IAAIM,EAA8B,iBAAZ,EAItB,OAHIA,GAAaD,EAAMhG,cAAgBkG,cACrCF,EAAQ,IAAInR,WAAWmR,IAErBC,EAjEY,SAAUT,GAE1B,IADA,IAAIR,EAAIC,EAAIC,EAAIC,EAAIC,EAAIL,EAAY,GAAInW,EAAS4W,EAAM5W,OAC9CkB,EAAI,EAAG2V,EAA+B,EAAvBzJ,SAASpN,EAAS,GAAQkB,EAAI2V,GACpDT,EAAKQ,EAAM1V,KACXmV,EAAKO,EAAM1V,KACXoV,EAAKM,EAAM1V,KACXqV,EAAKK,EAAM1V,KACXsV,EAAKI,EAAM1V,KACXiV,GAAaR,EAAmBS,IAAO,GACrCT,EAA0C,IAAtBS,GAAM,EAAIC,IAAO,IACrCV,EAAoBU,IAAO,EAAK,IAChCV,EAA0C,IAAtBU,GAAM,EAAIC,IAAO,IACrCX,EAA0C,IAAtBW,GAAM,EAAIC,IAAO,IACrCZ,EAAoBY,IAAO,EAAK,IAChCZ,EAA0C,IAAtBY,GAAM,EAAIC,IAAO,IACrCb,EAAwB,GAALa,GAIvB,IAAIM,EAAS9W,EAAS6W,EAsCtB,OArCe,IAAXC,GACFV,EAAKQ,EAAM1V,GACXiV,GAAaR,EAAmBS,IAAO,GACrCT,EAAoBS,GAAM,EAAK,IAC/B,UACkB,IAAXU,GACTV,EAAKQ,EAAM1V,KACXmV,EAAKO,EAAM1V,GACXiV,GAAaR,EAAmBS,IAAO,GACrCT,EAA0C,IAAtBS,GAAM,EAAIC,IAAO,IACrCV,EAAoBU,IAAO,EAAK,IAChCV,EAAoBU,GAAM,EAAK,IAC/B,QACkB,IAAXS,GACTV,EAAKQ,EAAM1V,KACXmV,EAAKO,EAAM1V,KACXoV,EAAKM,EAAM1V,GACXiV,GAAaR,EAAmBS,IAAO,GACrCT,EAA0C,IAAtBS,GAAM,EAAIC,IAAO,IACrCV,EAAoBU,IAAO,EAAK,IAChCV,EAA0C,IAAtBU,GAAM,EAAIC,IAAO,IACrCX,EAAoBW,GAAM,EAAK,IAC/B,OACkB,IAAXQ,IACTV,EAAKQ,EAAM1V,KACXmV,EAAKO,EAAM1V,KACXoV,EAAKM,EAAM1V,KACXqV,EAAKK,EAAM1V,GACXiV,GAAaR,EAAmBS,IAAO,GACrCT,EAA0C,IAAtBS,GAAM,EAAIC,IAAO,IACrCV,EAAoBU,IAAO,EAAK,IAChCV,EAA0C,IAAtBU,GAAM,EAAIC,IAAO,IACrCX,EAA0C,IAAtBW,GAAM,EAAIC,IAAO,IACrCZ,EAAoBY,IAAO,EAAK,IAChCZ,EAAoBY,GAAM,EAAK,IAC/B,KAEGJ,CACT,CAQWoB,CAAYH,GACVL,EAvNK,SAAUC,GAE1B,IADA,IAAIZ,EAAIC,EAAIC,EAAIC,EAAIC,EAAIL,EAAY,GAAInW,EAASgX,EAAIhX,OAC5CkB,EAAI,EAAG2V,EAA+B,EAAvBzJ,SAASpN,EAAS,GAAQkB,EAAI2V,GACpDT,EAAKY,EAAI5U,WAAWlB,KACpBmV,EAAKW,EAAI5U,WAAWlB,KACpBoV,EAAKU,EAAI5U,WAAWlB,KACpBqV,EAAKS,EAAI5U,WAAWlB,KACpBsV,EAAKQ,EAAI5U,WAAWlB,KACpBiV,GAAaR,EAAmBS,IAAO,GACrCT,EAA0C,IAAtBS,GAAM,EAAIC,IAAO,IACrCV,EAAoBU,IAAO,EAAK,IAChCV,EAA0C,IAAtBU,GAAM,EAAIC,IAAO,IACrCX,EAA0C,IAAtBW,GAAM,EAAIC,IAAO,IACrCZ,EAAoBY,IAAO,EAAK,IAChCZ,EAA0C,IAAtBY,GAAM,EAAIC,IAAO,IACrCb,EAAwB,GAALa,GAIvB,IAAIM,EAAS9W,EAAS6W,EAsCtB,OArCe,IAAXC,GACFV,EAAKY,EAAI5U,WAAWlB,GACpBiV,GAAaR,EAAmBS,IAAO,GACrCT,EAAoBS,GAAM,EAAK,IAC/B,UACkB,IAAXU,GACTV,EAAKY,EAAI5U,WAAWlB,KACpBmV,EAAKW,EAAI5U,WAAWlB,GACpBiV,GAAaR,EAAmBS,IAAO,GACrCT,EAA0C,IAAtBS,GAAM,EAAIC,IAAO,IACrCV,EAAoBU,IAAO,EAAK,IAChCV,EAAoBU,GAAM,EAAK,IAC/B,QACkB,IAAXS,GACTV,EAAKY,EAAI5U,WAAWlB,KACpBmV,EAAKW,EAAI5U,WAAWlB,KACpBoV,EAAKU,EAAI5U,WAAWlB,GACpBiV,GAAaR,EAAmBS,IAAO,GACrCT,EAA0C,IAAtBS,GAAM,EAAIC,IAAO,IACrCV,EAAoBU,IAAO,EAAK,IAChCV,EAA0C,IAAtBU,GAAM,EAAIC,IAAO,IACrCX,EAAoBW,GAAM,EAAK,IAC/B,OACkB,IAAXQ,IACTV,EAAKY,EAAI5U,WAAWlB,KACpBmV,EAAKW,EAAI5U,WAAWlB,KACpBoV,EAAKU,EAAI5U,WAAWlB,KACpBqV,EAAKS,EAAI5U,WAAWlB,GACpBiV,GAAaR,EAAmBS,IAAO,GACrCT,EAA0C,IAAtBS,GAAM,EAAIC,IAAO,IACrCV,EAAoBU,IAAO,EAAK,IAChCV,EAA0C,IAAtBU,GAAM,EAAIC,IAAO,IACrCX,EAA0C,IAAtBW,GAAM,EAAIC,IAAO,IACrCZ,EAAoBY,IAAO,EAAK,IAChCZ,EAAoBY,GAAM,EAAK,IAC/B,KAEGJ,CACT,CA8JWqB,CAAYJ,GA5JN,SAAUJ,GACzB,IAAIZ,EAAIC,EAAIC,EAAIC,EAAIC,EAAI7F,EACXzP,EADiBI,GAAM,EAAO6U,EAAY,GACrDjW,EAAQ,EAAMmB,EAAQ,EAAcrB,EAASgX,EAAIhX,OACjD,GAAY,KAARgX,EACF,OAAOb,EAEX,EAAG,CAID,IAHAN,EAAO,GAAKA,EAAO,GACnBA,EAAO,GAAKA,EAAO,GACnBA,EAAO,GAAKA,EAAO,GACd3U,EAAIG,EAAOnB,EAAQF,GAAUkB,EAAI,IAAKhB,GACzCyQ,EAAOqG,EAAI5U,WAAWlC,IACX,IACT2V,EAAO3U,KAAOyP,EACLA,EAAO,MAChBkF,EAAO3U,KAAO,IAAQyP,GAAQ,EAC9BkF,EAAO3U,KAAO,IAAe,GAAPyP,GACbA,EAAO,OAAUA,GAAQ,OAClCkF,EAAO3U,KAAO,IAAQyP,GAAQ,GAC9BkF,EAAO3U,KAAO,IAASyP,GAAQ,EAAK,GACpCkF,EAAO3U,KAAO,IAAe,GAAPyP,IAEtBA,EAAO,QAAoB,KAAPA,IAAiB,GAAiC,KAA1BqG,EAAI5U,aAAalC,IAC7D2V,EAAO3U,KAAO,IAAQyP,GAAQ,GAC9BkF,EAAO3U,KAAO,IAASyP,GAAQ,GAAM,GACrCkF,EAAO3U,KAAO,IAASyP,GAAQ,EAAK,GACpCkF,EAAO3U,KAAO,IAAe,GAAPyP,GAI1BtP,EAAQH,EAAI,EACRhB,IAAUF,KACVE,EAEAA,EAAQF,GAAUkB,EAAI,IACxBI,GAAM,GAER8U,EAAKP,EAAO,GACR3U,EAAI,GACNmV,EAAKR,EAAO,GACZS,EAAKT,EAAO,GACZU,EAAKV,EAAO,GACZW,EAAKX,EAAO,GACZM,GAAaR,EAAmBS,IAAO,GACrCT,EAA0C,IAAtBS,GAAM,EAAIC,IAAO,IACrCV,EAAoBU,IAAO,EAAK,IAChCV,EAA0C,IAAtBU,GAAM,EAAIC,IAAO,IACrCX,EAA0C,IAAtBW,GAAM,EAAIC,IAAO,IACrCZ,EAAoBY,IAAO,EAAK,IAChCZ,EAA0C,IAAtBY,GAAM,EAAIC,IAAO,IACrCb,EAAwB,GAALa,IACN,IAANtV,EACTiV,GAAaR,EAAmBS,IAAO,GACrCT,EAAoBS,GAAM,EAAK,IAC/B,SACa,IAANlV,GACTmV,EAAKR,EAAO,GACZM,GAAaR,EAAmBS,IAAO,GACrCT,EAA0C,IAAtBS,GAAM,EAAIC,IAAO,IACrCV,EAAoBU,IAAO,EAAK,IAChCV,EAAoBU,GAAM,EAAK,IAC/B,QACa,IAANnV,GACTmV,EAAKR,EAAO,GACZS,EAAKT,EAAO,GACZM,GAAaR,EAAmBS,IAAO,GACrCT,EAA0C,IAAtBS,GAAM,EAAIC,IAAO,IACrCV,EAAoBU,IAAO,EAAK,IAChCV,EAA0C,IAAtBU,GAAM,EAAIC,IAAO,IACrCX,EAAoBW,GAAM,EAAK,IAC/B,QAEFD,EAAKR,EAAO,GACZS,EAAKT,EAAO,GACZU,EAAKV,EAAO,GACZM,GAAaR,EAAmBS,IAAO,GACrCT,EAA0C,IAAtBS,GAAM,EAAIC,IAAO,IACrCV,EAAoBU,IAAO,EAAK,IAChCV,EAA0C,IAAtBU,GAAM,EAAIC,IAAO,IACrCX,EAA0C,IAAtBW,GAAM,EAAIC,IAAO,IACrCZ,EAAoBY,IAAO,EAAK,IAChCZ,EAAoBY,GAAM,EAAK,IAC/B,IAEN,QAAUjV,GACV,OAAO6U,CACT,CAwEWsB,CAAWL,EAEtB,EAyEElV,OAAQA,GAEVA,EAAOwV,QAAUxB,EAEbV,EACF/V,EAAOC,QAAUA,GAEjByV,EAAKwC,OAASjY,EACVgW,SAGD,KAFD,aACE,OAAOhW,CACR,iCAGN,CAhcD,aCWAD,EAAOC,QAnBP,WAEI,MAAsB,oBAAX6M,QAAoD,iBAAnBA,OAAOH,SAAgD,aAAxBG,OAAOH,QAAQI,QAKnE,oBAAZJ,SAAuD,iBAArBA,QAAQiJ,WAA2BjJ,QAAQiJ,SAASuC,WAKxE,iBAAdlL,WAAyD,iBAAxBA,UAAUC,WAA0BD,UAAUC,UAAUwK,QAAQ,aAAe,CAK/H,yBChBA1X,EAAOC,QAAUqE,IAChB,GAA8C,oBAA1CX,OAAOoB,UAAUzB,SAAS6H,KAAK7G,GAClC,OAAO,EAGR,MAAMS,EAAYpB,OAAO4N,eAAejN,GACxC,OAAqB,OAAdS,GAAsBA,IAAcpB,OAAOoB,SAAS,kBCR5D,OASA,WACE,aAEA,IAAIqT,EAAc,wBAEdC,EAA2B,iBAAXvL,OAChB4I,EAAO2C,EAASvL,OAAS,CAAC,EAC1B4I,EAAK4C,oBACPD,GAAS,GAEX,IAAIE,GAAcF,GAA0B,iBAATxJ,MACpB6G,EAAK8C,oBAAyC,iBAAZ7L,SAAwBA,QAAQiJ,UAAYjJ,QAAQiJ,SAASC,KAE5GH,EAAOI,OACEyC,IACT7C,EAAO7G,MA+JT,IA7JA,IAAIkH,GAAaL,EAAK+C,sBAAsDzY,EAAOC,QAC/EgW,EAAsC,OACtCyC,GAAgBhD,EAAKiD,yBAAkD,oBAAhBd,YACvDe,EAAY,mBAAmBrO,MAAM,IAErCsO,EAAiB,CAAC,EAAG,KAAM,OAAQ,UAGnCC,EAAQ,CAAC,EAAG,EAAG,GAAI,IACnBC,EAAK,CAAC,EAAG,EAAG,MAAO,EAAG,MAAO,WAAY,WAAY,WAAY,MAAO,EAAG,WAC7E,EAAG,WAAY,WAAY,MAAO,WAAY,IAAK,EAAG,IAAK,EAAG,WAAY,EAC1E,WAAY,EAAG,WAAY,EAAG,IAAK,WAAY,MAAO,WAAY,MAClE,WAAY,MAAO,WAAY,IAAK,WAAY,MAAO,EAAG,WAAY,WACtE,WAAY,WAAY,MAAO,WAAY,WAAY,EAAG,WAAY,YACpEC,EAAO,CAAC,IAAK,IAAK,IAAK,KACvBC,EAAa,CAAC,IAAK,KACnBC,EAAe,CAAC,MAAO,SAAU,cAAe,QAAS,UACzDC,EAAiB,CACnB,IAAO,IACP,IAAO,KAILC,EAAU1D,EAAK8C,qBAAuBnY,MAAM+Y,QAC5C,SAAUpI,GACR,MAA+C,mBAAxCrN,OAAOoB,UAAUzB,SAAS6H,KAAK6F,EACxC,EACA3Q,MAAM+Y,QAENC,GAAUX,IAAiBhD,EAAK4D,iCAAoCzB,YAAYwB,OAIhFxB,YAAYwB,OAHZ,SAAUrI,GACR,MAAsB,iBAARA,GAAoBA,EAAIrP,QAAUqP,EAAIrP,OAAOgQ,cAAgBkG,WAC7E,EAIA0B,EAAgB,SAAUjL,GAC5B,IAAIvB,SAAcuB,EAClB,GAAa,WAATvB,EACF,MAAO,CAACuB,GAAS,GAEnB,GAAa,WAATvB,GAAiC,OAAZuB,EACvB,MAAM,IAAIzL,MAAMuV,GAElB,GAAIM,GAAgBpK,EAAQqD,cAAgBkG,YAC1C,MAAO,CAAC,IAAIrR,WAAW8H,IAAU,GAEnC,IAAK8K,EAAQ9K,KAAa+K,EAAO/K,GAC/B,MAAM,IAAIzL,MAAMuV,GAElB,MAAO,CAAC9J,GAAS,EACnB,EAEIkL,EAAQ,SAAUlL,GACpB,OAA4C,IAArCiL,EAAcjL,GAAS,GAAG/N,MACnC,EAEIkZ,EAAa,SAAUC,GAEzB,IADA,IAAIC,EAAW,GACNlY,EAAI,EAAGA,EAAIiY,EAAMnZ,SAAUkB,EAClCkY,EAASlY,GAAKiY,EAAMjY,GAEtB,OAAOkY,CACT,EAEIC,EAAqB,SAAUC,EAAMC,EAASC,GAChD,OAAO,SAAUzL,GACf,OAAO,IAAI0L,EAAOH,EAAMC,EAASD,GAAMrE,OAAOlH,GAASyL,IACzD,CACF,EAEIE,EAA0B,SAAUJ,EAAMC,EAASC,GACrD,OAAO,SAAUzL,EAAS4L,GACxB,OAAO,IAAIF,EAAOH,EAAMC,EAASI,GAAY1E,OAAOlH,GAASyL,IAC/D,CACF,EAEII,EAA2B,SAAUN,EAAMC,EAASC,GACtD,OAAO,SAAUzL,EAAS4L,EAAY/Y,EAAGiZ,GACvC,OAAOC,EAAQ,SAAWR,GAAMrE,OAAOlH,EAAS4L,EAAY/Y,EAAGiZ,GAAGL,IACpE,CACF,EAEIO,EAAyB,SAAUT,EAAMC,EAASC,GACpD,OAAO,SAAUnJ,EAAKtC,EAAS4L,EAAYE,GACzC,OAAOC,EAAQ,OAASR,GAAMrE,OAAO5E,EAAKtC,EAAS4L,EAAYE,GAAGL,IACpE,CACF,EAEIQ,EAAsB,SAAUC,EAAQC,EAAcZ,EAAMC,GAC9D,IAAK,IAAIrY,EAAI,EAAGA,EAAIyX,EAAa3Y,SAAUkB,EAAG,CAC5C,IAAIsL,EAAOmM,EAAazX,GACxB+Y,EAAOzN,GAAQ0N,EAAaZ,EAAMC,EAAS/M,EAC7C,CACA,OAAOyN,CACT,EAEIC,EAAe,SAAUZ,EAAMC,GACjC,IAAIU,EAASZ,EAAmBC,EAAMC,EAAS,OAO/C,OANAU,EAAOlJ,OAAS,WACd,OAAO,IAAI0I,EAAOH,EAAMC,EAASD,EACnC,EACAW,EAAOhF,OAAS,SAAUlH,GACxB,OAAOkM,EAAOlJ,SAASkE,OAAOlH,EAChC,EACOiM,EAAoBC,EAAQZ,EAAoBC,EAAMC,EAC/D,EAyCIY,EAAa,CACf,CAAEhK,KAAM,SAAUoJ,QA9IC,CAAC,EAAG,IAAK,MAAO,UA8IQD,KAAMb,EAAMyB,aAAcA,GACrE,CAAE/J,KAAM,OAAQoJ,QA9IJ,CAAC,EAAG,KAAM,OAAQ,WA8IID,KAAMb,EAAMyB,aAAcA,GAC5D,CAAE/J,KAAM,QAASoJ,QAlJC,CAAC,GAAI,KAAM,QAAS,WAkJGD,KAAMZ,EAAYwB,aA1CrC,SAAUZ,EAAMC,GACtC,IAAIU,EAASP,EAAwBJ,EAAMC,EAAS,OAOpD,OANAU,EAAOlJ,OAAS,SAAU4I,GACxB,OAAO,IAAIF,EAAOH,EAAMC,EAASI,EACnC,EACAM,EAAOhF,OAAS,SAAUlH,EAAS4L,GACjC,OAAOM,EAAOlJ,OAAO4I,GAAY1E,OAAOlH,EAC1C,EACOiM,EAAoBC,EAAQP,EAAyBJ,EAAMC,EACpE,GAkCE,CAAEpJ,KAAM,SAAUoJ,QAASjB,EAAgBgB,KAAMZ,EAAYwB,aAhCtC,SAAUZ,EAAMC,GACvC,IAAIa,EAAIxB,EAAeU,GACnBW,EAASL,EAAyBN,EAAMC,EAAS,OAWrD,OAVAU,EAAOlJ,OAAS,SAAU4I,EAAY/Y,EAAGiZ,GACvC,OAAIZ,EAAMrY,IAAMqY,EAAMY,GACbC,EAAQ,QAAUR,GAAMvI,OAAO4I,GAE/B,IAAIF,EAAOH,EAAMC,EAASI,GAAYU,QAAQ,CAACzZ,EAAGiZ,GAAIO,EAEjE,EACAH,EAAOhF,OAAS,SAAUlH,EAAS4L,EAAY/Y,EAAGiZ,GAChD,OAAOI,EAAOlJ,OAAO4I,EAAY/Y,EAAGiZ,GAAG5E,OAAOlH,EAChD,EACOiM,EAAoBC,EAAQL,EAA0BN,EAAMC,EACrE,GAmBE,CAAEpJ,KAAM,OAAQoJ,QAASjB,EAAgBgB,KAAMZ,EAAYwB,aAjBtC,SAAUZ,EAAMC,GACrC,IAAIa,EAAIxB,EAAeU,GACnBW,EAASF,EAAuBT,EAAMC,EAAS,OAOnD,OANAU,EAAOlJ,OAAS,SAAUV,EAAKsJ,EAAYE,GACzC,OAAO,IAAIS,EAAKhB,EAAMC,EAASI,GAAYU,QAAQ,CAAC,OAAQR,GAAIO,GAAGC,QAAQ,CAAChK,GAAM+J,EACpF,EACAH,EAAOhF,OAAS,SAAU5E,EAAKtC,EAAS4L,EAAYE,GAClD,OAAOI,EAAOlJ,OAAOV,EAAKsJ,EAAYE,GAAG5E,OAAOlH,EAClD,EACOiM,EAAoBC,EAAQF,EAAwBT,EAAMC,EACnE,IAUIO,EAAU,CAAC,EAAGS,EAAc,GAEvBrZ,EAAI,EAAGA,EAAIiZ,EAAWna,SAAUkB,EAGvC,IAFA,IAAIsZ,EAAYL,EAAWjZ,GACvBoY,EAAOkB,EAAUlB,KACZ5X,EAAI,EAAGA,EAAI4X,EAAKtZ,SAAU0B,EAAG,CACpC,IAAI+Y,EAAaD,EAAUrK,KAAO,IAAMmJ,EAAK5X,GAG7C,GAFA6Y,EAAY3Y,KAAK6Y,GACjBX,EAAQW,GAAcD,EAAUN,aAAaZ,EAAK5X,GAAI8Y,EAAUjB,SACzC,SAAnBiB,EAAUrK,KAAiB,CAC7B,IAAIuK,EAAgBF,EAAUrK,KAAOmJ,EAAK5X,GAC1C6Y,EAAY3Y,KAAK8Y,GACjBZ,EAAQY,GAAiBZ,EAAQW,EACnC,CACF,CAGF,SAAShB,EAAOH,EAAMC,EAASI,GAC7BrV,KAAKuR,OAAS,GACdvR,KAAKuV,EAAI,GACTvV,KAAKiV,QAAUA,EACfjV,KAAKqV,WAAaA,EAClBrV,KAAKqW,OAAQ,EACbrW,KAAKsW,WAAY,EACjBtW,KAAKuW,MAAQ,EACbvW,KAAKjD,MAAQ,EACbiD,KAAKwW,WAAc,MAAQxB,GAAQ,IAAO,EAC1ChV,KAAKyW,UAAYzW,KAAKwW,YAAc,EACpCxW,KAAK0W,aAAerB,GAAc,EAClCrV,KAAK2W,YAA2B,GAAbtB,IAAoB,EAEvC,IAAK,IAAIzY,EAAI,EAAGA,EAAI,KAAMA,EACxBoD,KAAKuV,EAAE3Y,GAAK,CAEhB,CA8OA,SAASoZ,EAAKhB,EAAMC,EAASI,GAC3BF,EAAO7O,KAAKtG,KAAMgV,EAAMC,EAASI,EACnC,CA9OAF,EAAOjV,UAAUyQ,OAAS,SAAUlH,GAClC,GAAIzJ,KAAKsW,UACP,MAAM,IAAItY,MA9MO,2BAgNnB,IAAImQ,EAASuG,EAAcjL,GAC3BA,EAAU0E,EAAO,GAKjB,IAJA,IAEuDvR,EAAGyP,EAFtDuK,EAAWzI,EAAO,GAClBoD,EAASvR,KAAKuR,OAAQkF,EAAYzW,KAAKyW,UAAW/a,EAAS+N,EAAQ/N,OACrE8a,EAAaxW,KAAKwW,WAAY5a,EAAQ,EAAG2Z,EAAIvV,KAAKuV,EAE7C3Z,EAAQF,GAAQ,CACrB,GAAIsE,KAAKqW,MAGP,IAFArW,KAAKqW,OAAQ,EACb9E,EAAO,GAAKvR,KAAKuW,MACZ3Z,EAAI,EAAGA,EAAI4Z,EAAa,IAAK5Z,EAChC2U,EAAO3U,GAAK,EAGhB,GAAIga,EACF,IAAKha,EAAIoD,KAAKjD,MAAOnB,EAAQF,GAAUkB,EAAI6Z,IAAa7a,GACtDyQ,EAAO5C,EAAQ3L,WAAWlC,IACf,IACT2V,EAAO3U,GAAK,IAAMyP,GAAQ4H,EAAY,EAANrX,KACvByP,EAAO,MAChBkF,EAAO3U,GAAK,KAAO,IAAQyP,GAAQ,IAAO4H,EAAY,EAANrX,KAChD2U,EAAO3U,GAAK,KAAO,IAAe,GAAPyP,IAAiB4H,EAAY,EAANrX,MACzCyP,EAAO,OAAUA,GAAQ,OAClCkF,EAAO3U,GAAK,KAAO,IAAQyP,GAAQ,KAAQ4H,EAAY,EAANrX,KACjD2U,EAAO3U,GAAK,KAAO,IAASyP,GAAQ,EAAK,KAAU4H,EAAY,EAANrX,KACzD2U,EAAO3U,GAAK,KAAO,IAAe,GAAPyP,IAAiB4H,EAAY,EAANrX,OAElDyP,EAAO,QAAoB,KAAPA,IAAiB,GAAqC,KAA9B5C,EAAQ3L,aAAalC,IACjE2V,EAAO3U,GAAK,KAAO,IAAQyP,GAAQ,KAAQ4H,EAAY,EAANrX,KACjD2U,EAAO3U,GAAK,KAAO,IAASyP,GAAQ,GAAM,KAAU4H,EAAY,EAANrX,KAC1D2U,EAAO3U,GAAK,KAAO,IAASyP,GAAQ,EAAK,KAAU4H,EAAY,EAANrX,KACzD2U,EAAO3U,GAAK,KAAO,IAAe,GAAPyP,IAAiB4H,EAAY,EAANrX,WAItD,IAAKA,EAAIoD,KAAKjD,MAAOnB,EAAQF,GAAUkB,EAAI6Z,IAAa7a,EACtD2V,EAAO3U,GAAK,IAAM6M,EAAQ7N,IAAUqY,EAAY,EAANrX,KAI9C,GADAoD,KAAK6W,cAAgBja,EACjBA,GAAK6Z,EAAW,CAGlB,IAFAzW,KAAKjD,MAAQH,EAAI6Z,EACjBzW,KAAKuW,MAAQhF,EAAOiF,GACf5Z,EAAI,EAAGA,EAAI4Z,IAAc5Z,EAC5B2Y,EAAE3Y,IAAM2U,EAAO3U,GAEjBka,EAAEvB,GACFvV,KAAKqW,OAAQ,CACf,MACErW,KAAKjD,MAAQH,CAEjB,CACA,OAAOoD,IACT,EAEAmV,EAAOjV,UAAUrD,OAAS,SAAUka,EAAGC,GACrC,IAAIC,EAAQ,IAAJF,EAASza,EAAI,EACjBgW,EAAQ,CAAC2E,GAGb,IADAA,EAAQ,KADRF,IAAS,GAEFE,EAAI,GACT3E,EAAMhI,QAAQ2M,GAEdA,EAAQ,KADRF,IAAS,KAEPza,EAQJ,OANI0a,EACF1E,EAAMhV,KAAKhB,GAEXgW,EAAMhI,QAAQhO,GAEhB0D,KAAK2Q,OAAO2B,GACLA,EAAM5W,MACf,EAEAyZ,EAAOjV,UAAUgX,aAAe,SAAUxE,GACxC,IAAIvE,EAASuG,EAAchC,GAC3BA,EAAMvE,EAAO,GACb,IAAIyI,EAAWzI,EAAO,GAClBmE,EAAQ,EAAG5W,EAASgX,EAAIhX,OAC5B,GAAIkb,EACF,IAAK,IAAIha,EAAI,EAAGA,EAAI8V,EAAIhX,SAAUkB,EAAG,CACnC,IAAIyP,EAAOqG,EAAI5U,WAAWlB,GACtByP,EAAO,IACTiG,GAAS,EACAjG,EAAO,KAChBiG,GAAS,EACAjG,EAAO,OAAUA,GAAQ,MAClCiG,GAAS,GAETjG,EAAO,QAAoB,KAAPA,IAAiB,GAA6B,KAAtBqG,EAAI5U,aAAalB,IAC7D0V,GAAS,EAEb,MAEAA,EAAQ5W,EAIV,OAFA4W,GAAStS,KAAKnD,OAAe,EAARyV,GACrBtS,KAAK2Q,OAAO+B,GACLJ,CACT,EAEA6C,EAAOjV,UAAU6V,QAAU,SAAUoB,EAAMrB,GAEzC,IADA,IAAIxD,EAAQtS,KAAKnD,OAAOiZ,GACflZ,EAAI,EAAGA,EAAIua,EAAKzb,SAAUkB,EACjC0V,GAAStS,KAAKkX,aAAaC,EAAKva,IAElC,IAAIwa,GAAgBtB,EAAIxD,EAAQwD,GAAKA,EACjCuB,EAAQ,GAGZ,OAFAA,EAAM3b,OAAS0b,EACfpX,KAAK2Q,OAAO0G,GACLrX,IACT,EAEAmV,EAAOjV,UAAUoX,SAAW,WAC1B,IAAItX,KAAKsW,UAAT,CAGAtW,KAAKsW,WAAY,EACjB,IAAI/E,EAASvR,KAAKuR,OAAQ3U,EAAIoD,KAAK6W,cAAeL,EAAaxW,KAAKwW,WAAYjB,EAAIvV,KAAKuV,EAEzF,GADAhE,EAAO3U,GAAK,IAAMoD,KAAKiV,QAAY,EAAJrY,GAC3BoD,KAAK6W,gBAAkB7W,KAAKyW,UAE9B,IADAlF,EAAO,GAAKA,EAAOiF,GACd5Z,EAAI,EAAGA,EAAI4Z,EAAa,IAAK5Z,EAChC2U,EAAO3U,GAAK,EAIhB,IADA2U,EAAOiF,EAAa,IAAM,WACrB5Z,EAAI,EAAGA,EAAI4Z,IAAc5Z,EAC5B2Y,EAAE3Y,IAAM2U,EAAO3U,GAEjBka,EAAEvB,EAdF,CAeF,EAEAJ,EAAOjV,UAAUzB,SAAW0W,EAAOjV,UAAUqX,IAAM,WACjDvX,KAAKsX,WAKL,IAHA,IAEcf,EAFVC,EAAaxW,KAAKwW,WAAYjB,EAAIvV,KAAKuV,EAAGmB,EAAe1W,KAAK0W,aAChEC,EAAa3W,KAAK2W,WAAY/Z,EAAI,EAAGQ,EAAI,EACvCma,EAAM,GACHna,EAAIsZ,GAAc,CACvB,IAAK9Z,EAAI,EAAGA,EAAI4Z,GAAcpZ,EAAIsZ,IAAgB9Z,IAAKQ,EACrDmZ,EAAQhB,EAAE3Y,GACV2a,GAAOxD,EAAWwC,GAAS,EAAK,IAAQxC,EAAkB,GAARwC,GAChDxC,EAAWwC,GAAS,GAAM,IAAQxC,EAAWwC,GAAS,EAAK,IAC3DxC,EAAWwC,GAAS,GAAM,IAAQxC,EAAWwC,GAAS,GAAM,IAC5DxC,EAAWwC,GAAS,GAAM,IAAQxC,EAAWwC,GAAS,GAAM,IAE5DnZ,EAAIoZ,GAAe,IACrBjB,EAAIX,EAAWW,GACfuB,EAAEvB,GACF3Y,EAAI,EAER,CAWA,OAVI+Z,IACFJ,EAAQhB,EAAE3Y,GACV2a,GAAOxD,EAAWwC,GAAS,EAAK,IAAQxC,EAAkB,GAARwC,GAC9CI,EAAa,IACfY,GAAOxD,EAAWwC,GAAS,GAAM,IAAQxC,EAAWwC,GAAS,EAAK,KAEhEI,EAAa,IACfY,GAAOxD,EAAWwC,GAAS,GAAM,IAAQxC,EAAWwC,GAAS,GAAM,MAGhEgB,CACT,EAEApC,EAAOjV,UAAUsX,YAAc,WAC7BxX,KAAKsX,WAEL,IAGIxa,EAHA0Z,EAAaxW,KAAKwW,WAAYjB,EAAIvV,KAAKuV,EAAGmB,EAAe1W,KAAK0W,aAChEC,EAAa3W,KAAK2W,WAAY/Z,EAAI,EAAGQ,EAAI,EACvCkV,EAAQtS,KAAKqV,YAAc,EAG7BvY,EADE6Z,EACO,IAAI3D,YAAa0D,EAAe,GAAM,GAEtC,IAAI1D,YAAYV,GAG3B,IADA,IAAIuC,EAAQ,IAAI4C,YAAY3a,GACrBM,EAAIsZ,GAAc,CACvB,IAAK9Z,EAAI,EAAGA,EAAI4Z,GAAcpZ,EAAIsZ,IAAgB9Z,IAAKQ,EACrDyX,EAAMzX,GAAKmY,EAAE3Y,GAEXQ,EAAIoZ,GAAe,IACrBjB,EAAIX,EAAWW,GACfuB,EAAEvB,GAEN,CAKA,OAJIoB,IACF9B,EAAMzX,GAAKmY,EAAE3Y,GACbE,EAASA,EAAOW,MAAM,EAAG6U,IAEpBxV,CACT,EAEAqY,EAAOjV,UAAUpD,OAASqY,EAAOjV,UAAUsX,YAE3CrC,EAAOjV,UAAUwX,OAASvC,EAAOjV,UAAU2U,MAAQ,WACjD7U,KAAKsX,WAKL,IAHA,IAEgB3b,EAAQ4a,EAFpBC,EAAaxW,KAAKwW,WAAYjB,EAAIvV,KAAKuV,EAAGmB,EAAe1W,KAAK0W,aAChEC,EAAa3W,KAAK2W,WAAY/Z,EAAI,EAAGQ,EAAI,EACvCyX,EAAQ,GACLzX,EAAIsZ,GAAc,CACvB,IAAK9Z,EAAI,EAAGA,EAAI4Z,GAAcpZ,EAAIsZ,IAAgB9Z,IAAKQ,EACrDzB,EAASyB,GAAK,EACdmZ,EAAQhB,EAAE3Y,GACViY,EAAMlZ,GAAkB,IAAR4a,EAChB1B,EAAMlZ,EAAS,GAAM4a,GAAS,EAAK,IACnC1B,EAAMlZ,EAAS,GAAM4a,GAAS,GAAM,IACpC1B,EAAMlZ,EAAS,GAAM4a,GAAS,GAAM,IAElCnZ,EAAIoZ,GAAe,IACrBjB,EAAIX,EAAWW,GACfuB,EAAEvB,GAEN,CAYA,OAXIoB,IACFhb,EAASyB,GAAK,EACdmZ,EAAQhB,EAAE3Y,GACViY,EAAMlZ,GAAkB,IAAR4a,EACZI,EAAa,IACf9B,EAAMlZ,EAAS,GAAM4a,GAAS,EAAK,KAEjCI,EAAa,IACf9B,EAAMlZ,EAAS,GAAM4a,GAAS,GAAM,MAGjC1B,CACT,EAMAmB,EAAK9V,UAAY,IAAIiV,EAErBa,EAAK9V,UAAUoX,SAAW,WAExB,OADAtX,KAAKnD,OAAOmD,KAAKqV,YAAY,GACtBF,EAAOjV,UAAUoX,SAAShR,KAAKtG,KACxC,EAEA,IAAI8W,EAAI,SAAUvB,GAChB,IAAIoC,EAAG9H,EAAGvT,EAAGsb,EAAIjR,EAAIC,EAAIiR,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAC/CC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,EAC3EC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,EAC3EC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,GAAKC,GAAKC,GAAKC,GAAKC,GAAKC,GAAKC,GAAKC,GAAKC,GAAKC,GAAKC,GAC7E,IAAK/e,EAAI,EAAGA,EAAI,GAAIA,GAAK,EACvBsb,EAAKrC,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACtC5O,EAAK4O,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACtC3O,EAAK2O,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACtCsC,EAAKtC,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACtCuC,EAAKvC,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACtCwC,EAAKxC,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACtCyC,EAAKzC,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACtC0C,EAAK1C,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAItCoC,GAHAO,EAAK3C,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,MAG3B3O,GAAM,EAAMiR,IAAO,IAC9BhI,GAHAsI,EAAK5C,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,MAG3BsC,GAAM,EAAMjR,IAAO,IAC9B2O,EAAE,IAAMoC,EACRpC,EAAE,IAAM1F,EACR0F,EAAE,KAAOoC,EACTpC,EAAE,KAAO1F,EACT0F,EAAE,KAAOoC,EACTpC,EAAE,KAAO1F,EACT0F,EAAE,KAAOoC,EACTpC,EAAE,KAAO1F,EACT0F,EAAE,KAAOoC,EACTpC,EAAE,KAAO1F,EACT8H,EAAIC,GAAOE,GAAM,EAAMC,IAAO,IAC9BlI,EAAIlJ,GAAOoR,GAAM,EAAMD,IAAO,IAC9BvC,EAAE,IAAMoC,EACRpC,EAAE,IAAM1F,EACR0F,EAAE,KAAOoC,EACTpC,EAAE,KAAO1F,EACT0F,EAAE,KAAOoC,EACTpC,EAAE,KAAO1F,EACT0F,EAAE,KAAOoC,EACTpC,EAAE,KAAO1F,EACT0F,EAAE,KAAOoC,EACTpC,EAAE,KAAO1F,EACT8H,EAAI/Q,GAAOoR,GAAM,EAAMC,IAAO,IAC9BpI,EAAIgI,GAAOI,GAAM,EAAMD,IAAO,IAC9BzC,EAAE,IAAMoC,EACRpC,EAAE,IAAM1F,EACR0F,EAAE,KAAOoC,EACTpC,EAAE,KAAO1F,EACT0F,EAAE,KAAOoC,EACTpC,EAAE,KAAO1F,EACT0F,EAAE,KAAOoC,EACTpC,EAAE,KAAO1F,EACT0F,EAAE,KAAOoC,EACTpC,EAAE,KAAO1F,EACT8H,EAAIG,GAAOI,GAAM,EAAMC,IAAO,IAC9BtI,EAAIkI,GAAOI,GAAM,EAAMD,IAAO,IAC9B3C,EAAE,IAAMoC,EACRpC,EAAE,IAAM1F,EACR0F,EAAE,KAAOoC,EACTpC,EAAE,KAAO1F,EACT0F,EAAE,KAAOoC,EACTpC,EAAE,KAAO1F,EACT0F,EAAE,KAAOoC,EACTpC,EAAE,KAAO1F,EACT0F,EAAE,KAAOoC,EACTpC,EAAE,KAAO1F,EACT8H,EAAIK,GAAOJ,GAAM,EAAMjR,IAAO,IAC9BkJ,EAAIoI,GAAOtR,GAAM,EAAMiR,IAAO,IAC9BrC,EAAE,IAAMoC,EACRpC,EAAE,IAAM1F,EACR0F,EAAE,KAAOoC,EACTpC,EAAE,KAAO1F,EACT0F,EAAE,KAAOoC,EACTpC,EAAE,KAAO1F,EACT0F,EAAE,KAAOoC,EACTpC,EAAE,KAAO1F,EACT0F,EAAE,KAAOoC,EACTpC,EAAE,KAAO1F,EAETuI,EAAK7C,EAAE,GACP8C,EAAK9C,EAAE,GACP6E,EAAO7E,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChC8E,EAAO9E,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChC2D,EAAO3D,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChC4D,EAAO5D,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChC2F,GAAO3F,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChC4F,GAAO5F,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCyE,EAAOzE,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjC0E,EAAO1E,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjCiE,EAAOjE,EAAE,IAAM,EAAMA,EAAE,KAAO,GAC9BkE,EAAOlE,EAAE,IAAM,EAAMA,EAAE,KAAO,GAC9B+C,EAAM/C,EAAE,KAAO,GAAOA,EAAE,MAAQ,GAChCgD,EAAMhD,EAAE,KAAO,GAAOA,EAAE,MAAQ,GAChC+E,EAAO/E,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjCgF,EAAOhF,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjC6D,EAAO7D,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjC8D,EAAO9D,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjC6F,GAAO7F,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChC8F,GAAO9F,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCqF,GAAOrF,EAAE,IAAM,GAAOA,EAAE,KAAO,EAC/BsF,GAAOtF,EAAE,IAAM,GAAOA,EAAE,KAAO,EAC/BmE,EAAOnE,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCoE,EAAOpE,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCiD,EAAMjD,EAAE,KAAO,GAAOA,EAAE,MAAQ,GAChCkD,EAAMlD,EAAE,KAAO,GAAOA,EAAE,MAAQ,GAChCiF,EAAOjF,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjCkF,EAAOlF,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjC+D,EAAO/D,EAAE,KAAO,GAAOA,EAAE,MAAQ,EACjCgE,EAAOhE,EAAE,KAAO,GAAOA,EAAE,MAAQ,EACjCuD,EAAOvD,EAAE,IAAM,GAAOA,EAAE,KAAO,EAC/BwD,EAAOxD,EAAE,IAAM,GAAOA,EAAE,KAAO,EAC/BuF,GAAOvF,EAAE,KAAO,GAAOA,EAAE,MAAQ,EACjCwF,GAAOxF,EAAE,KAAO,GAAOA,EAAE,MAAQ,EACjCqE,EAAOrE,EAAE,KAAO,GAAOA,EAAE,MAAQ,EACjCsE,EAAOtE,EAAE,KAAO,GAAOA,EAAE,MAAQ,EACjCmD,EAAMnD,EAAE,KAAO,GAAOA,EAAE,MAAQ,GAChCoD,EAAMpD,EAAE,KAAO,GAAOA,EAAE,MAAQ,GAChCmF,EAAOnF,EAAE,KAAO,GAAOA,EAAE,MAAQ,EACjCoF,GAAOpF,EAAE,KAAO,GAAOA,EAAE,MAAQ,EACjC2E,EAAO3E,EAAE,IAAM,GAAOA,EAAE,KAAO,EAC/B4E,EAAO5E,EAAE,IAAM,GAAOA,EAAE,KAAO,EAC/ByD,EAAOzD,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjC0D,EAAO1D,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjCyF,GAAOzF,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChC0F,GAAO1F,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCuE,EAAOvE,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCwE,EAAOxE,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCqD,EAAMrD,EAAE,KAAO,GAAOA,EAAE,MAAQ,GAChCsD,EAAMtD,EAAE,KAAO,GAAOA,EAAE,MAAQ,GAEhCA,EAAE,GAAK6C,GAAOE,EAAKE,EACnBjD,EAAE,GAAK8C,GAAOE,EAAKE,EACnBlD,EAAE,IAAMuD,GAAQE,EAAME,EACtB3D,EAAE,IAAMwD,GAAQE,EAAME,EACtB5D,EAAE,IAAMiE,GAAQE,EAAME,EACtBrE,EAAE,IAAMkE,GAAQE,EAAME,EACtBtE,EAAE,IAAM2E,GAAQE,EAAME,EACtB/E,EAAE,IAAM4E,GAAQE,EAAME,EACtBhF,EAAE,IAAMqF,IAAQE,GAAME,GACtBzF,EAAE,IAAMsF,IAAQE,GAAME,GACtB1F,EAAE,GAAK+C,GAAOE,EAAKE,EACnBnD,EAAE,GAAKgD,GAAOE,EAAKE,EACnBpD,EAAE,IAAMyD,GAAQE,EAAME,EACtB7D,EAAE,IAAM0D,GAAQE,EAAME,EACtB9D,EAAE,IAAMmE,GAAQE,EAAME,EACtBvE,EAAE,IAAMoE,GAAQE,EAAME,EACtBxE,EAAE,IAAM6E,GAAQE,EAAME,EACtBjF,EAAE,IAAM8E,GAAQE,EAAME,EACtBlF,EAAE,IAAMuF,IAAQE,GAAME,GACtB3F,EAAE,IAAMwF,IAAQE,GAAME,GACtB5F,EAAE,GAAKiD,GAAOE,EAAKE,EACnBrD,EAAE,GAAKkD,GAAOE,EAAKE,EACnBtD,EAAE,IAAM2D,GAAQE,EAAME,EACtB/D,EAAE,IAAM4D,GAAQE,EAAME,EACtBhE,EAAE,IAAMqE,GAAQE,EAAME,EACtBzE,EAAE,IAAMsE,GAAQE,EAAME,EACtB1E,EAAE,IAAM+E,GAAQE,EAAME,EACtBnF,EAAE,IAAMgF,GAAQE,EAAME,GACtBpF,EAAE,IAAMyF,IAAQE,GAAME,GACtB7F,EAAE,IAAM0F,IAAQE,GAAME,GACtB9F,EAAE,GAAKmD,GAAOE,EAAKR,EACnB7C,EAAE,GAAKoD,GAAOE,EAAKR,EACnB9C,EAAE,IAAM6D,GAAQE,EAAMR,EACtBvD,EAAE,IAAM8D,GAAQE,EAAMR,EACtBxD,EAAE,IAAMuE,GAAQE,EAAMR,EACtBjE,EAAE,IAAMwE,GAAQE,EAAMR,EACtBlE,EAAE,IAAMiF,GAAQE,EAAMR,EACtB3E,EAAE,IAAMkF,GAAQE,GAAMR,EACtB5E,EAAE,IAAM2F,IAAQE,GAAMR,GACtBrF,EAAE,IAAM4F,IAAQE,GAAMR,GACtBtF,EAAE,GAAKqD,GAAOR,EAAKE,EACnB/C,EAAE,GAAKsD,GAAOR,EAAKE,EACnBhD,EAAE,IAAM+D,GAAQR,EAAME,EACtBzD,EAAE,IAAMgE,GAAQR,EAAME,EACtB1D,EAAE,IAAMyE,GAAQR,EAAME,EACtBnE,EAAE,IAAM0E,GAAQR,EAAME,EACtBpE,EAAE,IAAMmF,GAAQR,EAAME,EACtB7E,EAAE,IAAMoF,IAAQR,EAAME,EACtB9E,EAAE,IAAM6F,IAAQR,GAAME,GACtBvF,EAAE,IAAM8F,IAAQR,GAAME,GAEtBxF,EAAE,IAAMrB,EAAG5X,GACXiZ,EAAE,IAAMrB,EAAG5X,EAAI,EAEnB,EAEA,GAAI4U,EACF/V,EAAOC,QAAUoa,MACZ,CACL,IAAK5Y,EAAI,EAAGA,EAAIqZ,EAAYva,SAAUkB,EACpCiU,EAAKoF,EAAYrZ,IAAM4Y,EAAQS,EAAYrZ,IAEzCwU,SAGD,KAFD,aACE,OAAOoE,CACR,gCAEL,CACD,CA5oBD,sCCRA,MAAM8F,EAAiB,EAAQ,OAEzB,eAAC1M,GAAkB9P,OAAOoB,WAC1B,qBAACqb,GAAwBzc,OACzB6L,EAAiB,CAAC6Q,EAAQ3P,EAAMpM,IAAUX,OAAO6L,eAAe6Q,EAAQ3P,EAAM,CACnFpM,QACAgc,UAAU,EACV7Q,YAAY,EACZC,cAAc,IAGT6Q,EAAa1b,KACb2b,EAAsB,CAC3BC,cAAc,EACdC,iBAAiB,GAGZC,EAA+Brc,IACpC,MAAMV,EAAO,GAEb,IAAK,MAAMgN,KAAOtM,EACbmP,EAAetI,KAAK7G,EAAOsM,IAC9BhN,EAAKzB,KAAKyO,GAKZ,GAAIjN,OAAO4Q,sBAAuB,CACjC,MAAMqM,EAAUjd,OAAO4Q,sBAAsBjQ,GAE7C,IAAK,MAAMuc,KAAUD,EAChBR,EAAqBjV,KAAK7G,EAAOuc,IACpCjd,EAAKzB,KAAK0e,EAGb,CAEA,OAAOjd,CAAI,EAGZ,SAASkd,EAAMxc,GACd,OAAIjE,MAAM+Y,QAAQ9U,GAWnB,SAAoBoV,GACnB,MAAM1G,EAAS0G,EAAMpX,MAAM,EAAG,GAM9B,OAJAqe,EAA6BjH,GAAO/I,SAAQC,IAC3CpB,EAAewD,EAAQpC,EAAKkQ,EAAMpH,EAAM9I,IAAM,IAGxCoC,CACR,CAlBSyG,CAAWnV,GAGf6b,EAAe7b,GAiBpB,SAA2B+b,GAC1B,MAAMrN,EAA2C,OAAlCrP,OAAO4N,eAAe8O,GAAmB1c,OAAO2N,OAAO,MAAQ,CAAC,EAM/E,OAJAqP,EAA6BN,GAAQ1P,SAAQC,IAC5CpB,EAAewD,EAAQpC,EAAKkQ,EAAMT,EAAOzP,IAAM,IAGzCoC,CACR,CAxBS+N,CAAkBzc,GAGnBA,CACR,CA6BA,MAAM0c,EAAY,CAACC,EAAQ5d,EAAQO,EAAMsd,KACxCtd,EAAK+M,SAAQC,SACe,IAAhBvN,EAAOuN,IAAwBsQ,EAAOR,kBAK7C9P,KAAOqQ,GAAUA,EAAOrQ,KAASjN,OAAO4N,eAAe0P,GAC1DzR,EAAeyR,EAAQrQ,EAAKuQ,EAAMF,EAAOrQ,GAAMvN,EAAOuN,GAAMsQ,IAE5D1R,EAAeyR,EAAQrQ,EAAKkQ,EAAMzd,EAAOuN,KAC1C,IAGMqQ,GAWFR,EAAe,CAACQ,EAAQ5d,EAAQ6d,KACrC,IAAIlO,EAASiO,EAAO3e,MAAM,EAAG,GACzB8e,EAAc,EAyBlB,MAvBA,CAACH,EAAQ5d,GAAQsN,SAAQ+I,IACxB,MAAM2H,EAAU,GAGhB,IAAK,IAAIC,EAAI,EAAGA,EAAI5H,EAAMnZ,OAAQ+gB,IAC5B7N,EAAetI,KAAKuO,EAAO4H,KAIhCD,EAAQlf,KAAKC,OAAOkf,IAInB9R,EAAewD,EAAQoO,IAFpB1H,IAAUuH,EAEyBvH,EAAM4H,GAENR,EAAMpH,EAAM4H,MAKpDtO,EAASgO,EAAUhO,EAAQ0G,EAAOiH,EAA6BjH,GAAO6H,QAAO3Q,IAAQyQ,EAAQG,SAAS5Q,KAAOsQ,EAAO,IAG9GlO,CAAM,EASd,SAASmO,EAAMF,EAAQ5d,EAAQ6d,GAC9B,OAAIA,EAAOT,cAAgBpgB,MAAM+Y,QAAQ6H,IAAW5gB,MAAM+Y,QAAQ/V,GAC1Dod,EAAaQ,EAAQ5d,EAAQ6d,GAGhCf,EAAe9c,IAAY8c,EAAec,GAIxCD,EAAUC,EAAQ5d,EAAQsd,EAA6Btd,GAAS6d,GAH/DJ,EAAMzd,EAIf,CAEArD,EAAOC,QAAU,YAAa2F,GAC7B,MAAMsb,EAASC,EAAML,EAAMN,GAAuB3b,OAAS0b,GAAc1b,MAAS,CAAC,EAAG2b,GACtF,IAAIS,EAAS,CAAC7P,EAAG,CAAC,GAElB,IAAK,MAAMqQ,KAAU7b,EACpB,QAAehD,IAAX6e,EAAJ,CAIA,IAAKtB,EAAesB,GACnB,MAAM,IAAItQ,UAAU,IAAMsQ,EAAS,6BAGpCR,EAASE,EAAMF,EAAQ,CAAC7P,EAAGqQ,GAASP,EANpC,CASD,OAAOD,EAAO7P,CACf,YCtKA,IAAIgJ,EAAI,IACJsH,EAAQ,GAAJtH,EACJoC,EAAQ,GAAJkF,EACJC,EAAQ,GAAJnF,EACJ7B,EAAQ,EAAJgH,EAsJR,SAASC,EAAO5S,EAAI6S,EAAO1gB,EAAGuP,GAC5B,IAAIoR,EAAWD,GAAa,IAAJ1gB,EACxB,OAAOE,KAAK4G,MAAM+G,EAAK7N,GAAK,IAAMuP,GAAQoR,EAAW,IAAM,GAC7D,CAxIA9hB,EAAOC,QAAU,SAASkH,EAAKvB,GAC7BA,EAAUA,GAAW,CAAC,EACtB,IA8GeoJ,EACX6S,EA/GA9U,SAAc5F,EAClB,GAAa,WAAT4F,GAAqB5F,EAAI5G,OAAS,EACpC,OAkBJ,SAAegX,GAEb,MADAA,EAAMnV,OAAOmV,IACLhX,OAAS,KAAjB,CAGA,IAAI0L,EAAQ,mIAAmI8V,KAC7IxK,GAEF,GAAKtL,EAAL,CAGA,IAAI9K,EAAI6gB,WAAW/V,EAAM,IAEzB,QADYA,EAAM,IAAM,MAAMkB,eAE5B,IAAK,QACL,IAAK,OACL,IAAK,MACL,IAAK,KACL,IAAK,IACH,OAzDEwU,SAyDKxgB,EACT,IAAK,QACL,IAAK,OACL,IAAK,IACH,OAAOA,EAAIwZ,EACb,IAAK,OACL,IAAK,MACL,IAAK,IACH,OAAOxZ,EAAIwgB,EACb,IAAK,QACL,IAAK,OACL,IAAK,MACL,IAAK,KACL,IAAK,IACH,OAAOxgB,EAAIqb,EACb,IAAK,UACL,IAAK,SACL,IAAK,OACL,IAAK,MACL,IAAK,IACH,OAAOrb,EAAIugB,EACb,IAAK,UACL,IAAK,SACL,IAAK,OACL,IAAK,MACL,IAAK,IACH,OAAOvgB,EAAIiZ,EACb,IAAK,eACL,IAAK,cACL,IAAK,QACL,IAAK,OACL,IAAK,KACH,OAAOjZ,EACT,QACE,OA3CJ,CANA,CAmDF,CAzEW8gB,CAAM9a,GACR,GAAa,WAAT4F,GAAqBmV,SAAS/a,GACvC,OAAOvB,EAAQuc,MA0GFnT,EA1GiB7H,GA2G5B0a,EAAQxgB,KAAKyP,IAAI9B,KACR2S,EACJC,EAAO5S,EAAI6S,EAAOF,EAAG,OAE1BE,GAASrF,EACJoF,EAAO5S,EAAI6S,EAAOrF,EAAG,QAE1BqF,GAASH,EACJE,EAAO5S,EAAI6S,EAAOH,EAAG,UAE1BG,GAASzH,EACJwH,EAAO5S,EAAI6S,EAAOzH,EAAG,UAEvBpL,EAAK,OAvCd,SAAkBA,GAChB,IAAI6S,EAAQxgB,KAAKyP,IAAI9B,GACrB,OAAI6S,GAASF,EACJtgB,KAAK4G,MAAM+G,EAAK2S,GAAK,IAE1BE,GAASrF,EACJnb,KAAK4G,MAAM+G,EAAKwN,GAAK,IAE1BqF,GAASH,EACJrgB,KAAK4G,MAAM+G,EAAK0S,GAAK,IAE1BG,GAASzH,EACJ/Y,KAAK4G,MAAM+G,EAAKoL,GAAK,IAEvBpL,EAAK,IACd,CAhGyCoT,CAASjb,GAEhD,MAAM,IAAItE,MACR,wDACE4B,KAAKC,UAAUyC,GAErB,kBCrCAnH,EAAOC,QAAU,EAAjB,2BCUC,SAAWyV,EAAM9S,GACd,aAGA,IAAIyf,EAAU,CACV,QAAW,QACX,IAAO,CAAC,EACR,IAAO,CAAC,EACR,iBAAmB,GAMvB,SAASC,EAAYnL,GAEjB,IAAK9W,MAAM+Y,QAAQjC,KAAWU,YAAYwB,OAAOlC,GAC7C,OAAO,EAIX,IAAK,IAAI1V,EAAI,EAAGA,EAAI0V,EAAM5W,OAAQkB,IAC9B,IAAK8C,OAAOge,UAAUpL,EAAM1V,KAAO0V,EAAM1V,GAAK,GAAK0V,EAAM1V,GAAK,IAC1D,OAAO,EAGf,OAAO,CACX,CAEA,SAAS+gB,EAAad,EAAGvgB,GAMrB,OAAa,MAAJugB,GAAcvgB,KAASugB,IAAM,IAAMvgB,EAAK,QAAW,GAChE,CAEA,SAASshB,EAASf,EAAGvgB,GAMjB,OAAQugB,GAAKvgB,EAAMugB,IAAO,GAAKvgB,CACnC,CAEA,SAASuhB,EAASlG,GAWd,OALAA,EAAIgG,EADJhG,GAAKA,IAAM,GACS,aAEpBA,EAAIgG,EADJhG,GAAKA,IAAM,GACS,aACfA,IAAM,EAGf,CAEA,SAASmG,EAAQjB,EAAGvgB,GAMhBugB,EAAI,CAACA,EAAE,KAAO,GAAW,MAAPA,EAAE,GAAaA,EAAE,KAAO,GAAW,MAAPA,EAAE,IAChDvgB,EAAI,CAACA,EAAE,KAAO,GAAW,MAAPA,EAAE,GAAaA,EAAE,KAAO,GAAW,MAAPA,EAAE,IAChD,IAAI2a,EAAI,CAAC,EAAG,EAAG,EAAG,GAiBlB,OAfAA,EAAE,IAAM4F,EAAE,GAAKvgB,EAAE,GACjB2a,EAAE,IAAMA,EAAE,KAAO,GACjBA,EAAE,IAAM,MAERA,EAAE,IAAM4F,EAAE,GAAKvgB,EAAE,GACjB2a,EAAE,IAAMA,EAAE,KAAO,GACjBA,EAAE,IAAM,MAERA,EAAE,IAAM4F,EAAE,GAAKvgB,EAAE,GACjB2a,EAAE,IAAMA,EAAE,KAAO,GACjBA,EAAE,IAAM,MAERA,EAAE,IAAM4F,EAAE,GAAKvgB,EAAE,GACjB2a,EAAE,IAAM,MAED,CAAEA,EAAE,IAAM,GAAMA,EAAE,GAAKA,EAAE,IAAM,GAAMA,EAAE,GAClD,CAEA,SAAS8G,EAAalB,EAAGvgB,GAMrBugB,EAAI,CAACA,EAAE,KAAO,GAAW,MAAPA,EAAE,GAAaA,EAAE,KAAO,GAAW,MAAPA,EAAE,IAChDvgB,EAAI,CAACA,EAAE,KAAO,GAAW,MAAPA,EAAE,GAAaA,EAAE,KAAO,GAAW,MAAPA,EAAE,IAChD,IAAI2a,EAAI,CAAC,EAAG,EAAG,EAAG,GA6BlB,OA3BAA,EAAE,IAAM4F,EAAE,GAAKvgB,EAAE,GACjB2a,EAAE,IAAMA,EAAE,KAAO,GACjBA,EAAE,IAAM,MAERA,EAAE,IAAM4F,EAAE,GAAKvgB,EAAE,GACjB2a,EAAE,IAAMA,EAAE,KAAO,GACjBA,EAAE,IAAM,MAERA,EAAE,IAAM4F,EAAE,GAAKvgB,EAAE,GACjB2a,EAAE,IAAMA,EAAE,KAAO,GACjBA,EAAE,IAAM,MAERA,EAAE,IAAM4F,EAAE,GAAKvgB,EAAE,GACjB2a,EAAE,IAAMA,EAAE,KAAO,GACjBA,EAAE,IAAM,MAERA,EAAE,IAAM4F,EAAE,GAAKvgB,EAAE,GACjB2a,EAAE,IAAMA,EAAE,KAAO,GACjBA,EAAE,IAAM,MAERA,EAAE,IAAM4F,EAAE,GAAKvgB,EAAE,GACjB2a,EAAE,IAAMA,EAAE,KAAO,GACjBA,EAAE,IAAM,MAERA,EAAE,IAAO4F,EAAE,GAAKvgB,EAAE,GAAOugB,EAAE,GAAKvgB,EAAE,GAAOugB,EAAE,GAAKvgB,EAAE,GAAOugB,EAAE,GAAKvgB,EAAE,GAClE2a,EAAE,IAAM,MAED,CAAEA,EAAE,IAAM,GAAMA,EAAE,GAAKA,EAAE,IAAM,GAAMA,EAAE,GAClD,CAEA,SAAS+G,EAASnB,EAAGvgB,GASjB,OAAU,KAFVA,GAAK,IAGM,CAACugB,EAAE,GAAIA,EAAE,IACTvgB,EAAI,GACJ,CAAEugB,EAAE,IAAMvgB,EAAMugB,EAAE,KAAQ,GAAKvgB,EAAMugB,EAAE,IAAMvgB,EAAMugB,EAAE,KAAQ,GAAKvgB,IAEzEA,GAAK,GACE,CAAEugB,EAAE,IAAMvgB,EAAMugB,EAAE,KAAQ,GAAKvgB,EAAMugB,EAAE,IAAMvgB,EAAMugB,EAAE,KAAQ,GAAKvgB,GAEjF,CAEA,SAAS2hB,EAAcpB,EAAGvgB,GAStB,OAAU,IAFVA,GAAK,IAGMugB,EACAvgB,EAAI,GACJ,CAAEugB,EAAE,IAAMvgB,EAAMugB,EAAE,KAAQ,GAAKvgB,EAAKugB,EAAE,IAAMvgB,GAE5C,CAACugB,EAAE,IAAOvgB,EAAI,GAAK,EAElC,CAEA,SAAS4hB,EAAQrB,EAAGvgB,GAMhB,MAAO,CAACugB,EAAE,GAAKvgB,EAAE,GAAIugB,EAAE,GAAKvgB,EAAE,GAClC,CAEA,SAAS6hB,EAASxG,GAad,OANAA,EAAIuG,EAAQvG,EAAG,CAAC,EAAGA,EAAE,KAAO,IAE5BA,EAAIuG,EADJvG,EAAIoG,EAAapG,EAAG,CAAC,WAAY,aAClB,CAAC,EAAGA,EAAE,KAAO,IAExBuG,EADJvG,EAAIoG,EAAapG,EAAG,CAAC,WAAY,YAClB,CAAC,EAAGA,EAAE,KAAO,GAGhC,CAKA6F,EAAQY,IAAIC,OAAS,SAAU/L,EAAOgM,GAKlC,GAAId,EAAQe,kBAAoBd,EAAYnL,GACxC,OAAOvU,EAEXugB,EAAOA,GAAQ,EAYf,IAVA,IAAIE,EAAYlM,EAAM5W,OAAS,EAC3B6V,EAASe,EAAM5W,OAAS8iB,EAExBC,EAAKH,EAELI,EAAK,EAEL/X,EAAK,WACLC,EAAK,UAEAhK,EAAI,EAAGA,EAAI2U,EAAQ3U,GAAQ,EAGhC8hB,EAAKf,EAFLe,EAAMpM,EAAM1V,GAAO0V,EAAM1V,EAAI,IAAM,EAAM0V,EAAM1V,EAAI,IAAM,GAAO0V,EAAM1V,EAAI,IAAM,GAE1D+J,GAEtB+X,EAAKf,EADLe,EAAKd,EAASc,EAAI,IACI9X,GAItB6X,EAAKd,EADLc,EAAKb,EADLa,GAAMC,EACY,IACI,GAAK,WAK/B,OAFAA,EAAK,EAEGF,GACJ,KAAK,EACDE,GAAMpM,EAAM1V,EAAI,IAAM,GAE1B,KAAK,EACD8hB,GAAMpM,EAAM1V,EAAI,IAAM,EAE1B,KAAK,EAED8hB,EAAKf,EADLe,GAAMpM,EAAM1V,GACU+J,GAGtB8X,GADAC,EAAKf,EADLe,EAAKd,EAASc,EAAI,IACI9X,GAO9B,OAFA6X,EAAKZ,EADLY,GAAMnM,EAAM5W,WAGE,CAClB,EAEA8hB,EAAQY,IAAIO,QAAU,SAAUrM,EAAOgM,GAKnC,GAAId,EAAQe,kBAAoBd,EAAYnL,GACxC,OAAOvU,EAGXugB,EAAOA,GAAQ,EAmBf,IAlBA,IAAIE,EAAYlM,EAAM5W,OAAS,GAC3B6V,EAASe,EAAM5W,OAAS8iB,EAExBC,EAAKH,EACLM,EAAKN,EACLO,EAAKP,EACLQ,EAAKR,EAELI,EAAK,EACLK,EAAK,EACLC,EAAK,EACLC,EAAK,EAELtY,EAAK,UACLC,EAAK,WACLiR,EAAK,UACLC,EAAK,WAEAlb,EAAI,EAAGA,EAAI2U,EAAQ3U,GAAQ,GAChC8hB,EAAMpM,EAAM1V,GAAO0V,EAAM1V,EAAI,IAAM,EAAM0V,EAAM1V,EAAI,IAAM,GAAO0V,EAAM1V,EAAI,IAAM,GAChFmiB,EAAMzM,EAAM1V,EAAI,GAAO0V,EAAM1V,EAAI,IAAM,EAAM0V,EAAM1V,EAAI,IAAM,GAAO0V,EAAM1V,EAAI,IAAM,GACpFoiB,EAAM1M,EAAM1V,EAAI,GAAO0V,EAAM1V,EAAI,IAAM,EAAM0V,EAAM1V,EAAI,KAAO,GAAO0V,EAAM1V,EAAI,KAAO,GACtFqiB,EAAM3M,EAAM1V,EAAI,IAAQ0V,EAAM1V,EAAI,KAAO,EAAM0V,EAAM1V,EAAI,KAAO,GAAO0V,EAAM1V,EAAI,KAAO,GAGxF8hB,EAAKd,EADLc,EAAKf,EAAae,EAAI/X,GACJ,IAIlB8X,EAAKb,EAFLa,GADAC,EAAKf,EAAae,EAAI9X,GAGJ,IAElB6X,EAAKd,EADLc,GAAMG,EACgB,GAAK,WAG3BG,EAAKnB,EADLmB,EAAKpB,EAAaoB,EAAInY,GACJ,IAIlBgY,EAAKhB,EAFLgB,GADAG,EAAKpB,EAAaoB,EAAIlH,GAGJ,IAElB+G,EAAKjB,EADLiB,GAAMC,EACgB,GAAK,UAG3BG,EAAKpB,EADLoB,EAAKrB,EAAaqB,EAAInH,GACJ,IAIlBgH,EAAKjB,EAFLiB,GADAG,EAAKrB,EAAaqB,EAAIlH,GAGJ,IAElB+G,EAAKlB,EADLkB,GAAMC,EACgB,GAAK,WAG3BG,EAAKrB,EADLqB,EAAKtB,EAAasB,EAAInH,GACJ,IAIlBgH,EAAKlB,EAFLkB,GADAG,EAAKtB,EAAasB,EAAItY,GAGJ,IAElBmY,EAAKnB,EADLmB,GAAML,EACgB,GAAK,UAQ/B,OALAC,EAAK,EACLK,EAAK,EACLC,EAAK,EACLC,EAAK,EAEGT,GACJ,KAAK,GACDS,GAAM3M,EAAM1V,EAAI,KAAO,GAE3B,KAAK,GACDqiB,GAAM3M,EAAM1V,EAAI,KAAO,EAE3B,KAAK,GAEDqiB,EAAKtB,EADLsB,GAAM3M,EAAM1V,EAAI,IACMkb,GAGtBgH,GADAG,EAAKtB,EADLsB,EAAKrB,EAASqB,EAAI,IACItY,GAG1B,KAAK,GACDqY,GAAM1M,EAAM1V,EAAI,KAAO,GAE3B,KAAK,GACDoiB,GAAM1M,EAAM1V,EAAI,KAAO,GAE3B,KAAK,GACDoiB,GAAM1M,EAAM1V,EAAI,IAAM,EAE1B,KAAK,EAEDoiB,EAAKrB,EADLqB,GAAM1M,EAAM1V,EAAI,GACMib,GAGtBgH,GADAG,EAAKrB,EADLqB,EAAKpB,EAASoB,EAAI,IACIlH,GAG1B,KAAK,EACDiH,GAAMzM,EAAM1V,EAAI,IAAM,GAE1B,KAAK,EACDmiB,GAAMzM,EAAM1V,EAAI,IAAM,GAE1B,KAAK,EACDmiB,GAAMzM,EAAM1V,EAAI,IAAM,EAE1B,KAAK,EAEDmiB,EAAKpB,EADLoB,GAAMzM,EAAM1V,EAAI,GACMgK,GAGtBgY,GADAG,EAAKpB,EADLoB,EAAKnB,EAASmB,EAAI,IACIlH,GAG1B,KAAK,EACD6G,GAAMpM,EAAM1V,EAAI,IAAM,GAE1B,KAAK,EACD8hB,GAAMpM,EAAM1V,EAAI,IAAM,GAE1B,KAAK,EACD8hB,GAAMpM,EAAM1V,EAAI,IAAM,EAE1B,KAAK,EAED8hB,EAAKf,EADLe,GAAMpM,EAAM1V,GACU+J,GAGtB8X,GADAC,EAAKf,EADLe,EAAKd,EAASc,EAAI,IACI9X,GA4B9B,OAxBA6X,GAAMnM,EAAM5W,OAKZ+iB,GAJAG,GAAMtM,EAAM5W,OAKZ+iB,GAJAI,GAAMvM,EAAM5W,OAMZkjB,GADAH,GAJAK,GAAMxM,EAAM5W,OAMZmjB,GAAMJ,EACNK,GAAML,EAENA,EAAKZ,EAASY,GAKdA,GAJAG,EAAKf,EAASe,GAKdH,GAJAI,EAAKhB,EAASgB,GAMdD,GADAH,GAJAK,EAAKjB,EAASiB,GAMdD,GAAMJ,EACNK,GAAML,GAEE,YAAcA,IAAO,GAAGhgB,SAAS,KAAKhB,OAAO,IAAM,YAAcmhB,IAAO,GAAGngB,SAAS,KAAKhB,OAAO,IAAM,YAAcohB,IAAO,GAAGpgB,SAAS,KAAKhB,OAAO,IAAM,YAAcqhB,IAAO,GAAGrgB,SAAS,KAAKhB,OAAO,EAClN,EAEA+f,EAAQ0B,IAAIP,QAAU,SAAUrM,EAAOgM,GAKnC,GAAId,EAAQe,kBAAoBd,EAAYnL,GACxC,OAAOvU,EAEXugB,EAAOA,GAAQ,EAcf,IAZA,IAAIE,EAAYlM,EAAM5W,OAAS,GAC3B6V,EAASe,EAAM5W,OAAS8iB,EAExBC,EAAK,CAAC,EAAGH,GACTM,EAAK,CAAC,EAAGN,GAETI,EAAK,CAAC,EAAG,GACTK,EAAK,CAAC,EAAG,GAETpY,EAAK,CAAC,WAAY,WAClBC,EAAK,CAAC,WAAY,WAEbhK,EAAI,EAAGA,EAAI2U,EAAQ3U,GAAQ,GAChC8hB,EAAK,CAAEpM,EAAM1V,EAAI,GAAO0V,EAAM1V,EAAI,IAAM,EAAM0V,EAAM1V,EAAI,IAAM,GAAO0V,EAAM1V,EAAI,IAAM,GAAM0V,EAAM1V,GAC5F0V,EAAM1V,EAAI,IAAM,EAAM0V,EAAM1V,EAAI,IAAM,GAAO0V,EAAM1V,EAAI,IAAM,IAClEmiB,EAAK,CAAEzM,EAAM1V,EAAI,IAAQ0V,EAAM1V,EAAI,KAAO,EAAM0V,EAAM1V,EAAI,KAAO,GAAO0V,EAAM1V,EAAI,KAAO,GAAM0V,EAAM1V,EAAI,GACpG0V,EAAM1V,EAAI,IAAM,EAAM0V,EAAM1V,EAAI,KAAO,GAAO0V,EAAM1V,EAAI,KAAO,IAGpE8hB,EAAKV,EADLU,EAAKX,EAAaW,EAAI/X,GACJ,IAKlB8X,EAAKX,EADLW,EAAKT,EAFLS,EAAKP,EAAQO,EADbC,EAAKX,EAAaW,EAAI9X,IAGJ,IACDgY,GACjBH,EAAKX,EAAQC,EAAaU,EAAI,CAAC,EAAG,IAAK,CAAC,EAAG,aAG3CM,EAAKf,EADLe,EAAKhB,EAAagB,EAAInY,GACJ,IAKlBgY,EAAKd,EADLc,EAAKZ,EAFLY,EAAKV,EAAQU,EADbG,EAAKhB,EAAagB,EAAIpY,IAGJ,IACD8X,GACjBG,EAAKd,EAAQC,EAAaa,EAAI,CAAC,EAAG,IAAK,CAAC,EAAG,YAM/C,OAHAF,EAAK,CAAC,EAAG,GACTK,EAAK,CAAC,EAAG,GAEDP,GACJ,KAAK,GACDO,EAAKb,EAAQa,EAAId,EAAc,CAAC,EAAG3L,EAAM1V,EAAI,KAAM,KAEvD,KAAK,GACDmiB,EAAKb,EAAQa,EAAId,EAAc,CAAC,EAAG3L,EAAM1V,EAAI,KAAM,KAEvD,KAAK,GACDmiB,EAAKb,EAAQa,EAAId,EAAc,CAAC,EAAG3L,EAAM1V,EAAI,KAAM,KAEvD,KAAK,GACDmiB,EAAKb,EAAQa,EAAId,EAAc,CAAC,EAAG3L,EAAM1V,EAAI,KAAM,KAEvD,KAAK,GACDmiB,EAAKb,EAAQa,EAAId,EAAc,CAAC,EAAG3L,EAAM1V,EAAI,KAAM,KAEvD,KAAK,GACDmiB,EAAKb,EAAQa,EAAId,EAAc,CAAC,EAAG3L,EAAM1V,EAAI,IAAK,IAEtD,KAAK,EAEDmiB,EAAKhB,EADLgB,EAAKb,EAAQa,EAAI,CAAC,EAAGzM,EAAM1V,EAAI,KACTgK,GAGtBgY,EAAKV,EAAQU,EADbG,EAAKhB,EADLgB,EAAKf,EAASe,EAAI,IACIpY,IAG1B,KAAK,EACD+X,EAAKR,EAAQQ,EAAIT,EAAc,CAAC,EAAG3L,EAAM1V,EAAI,IAAK,KAEtD,KAAK,EACD8hB,EAAKR,EAAQQ,EAAIT,EAAc,CAAC,EAAG3L,EAAM1V,EAAI,IAAK,KAEtD,KAAK,EACD8hB,EAAKR,EAAQQ,EAAIT,EAAc,CAAC,EAAG3L,EAAM1V,EAAI,IAAK,KAEtD,KAAK,EACD8hB,EAAKR,EAAQQ,EAAIT,EAAc,CAAC,EAAG3L,EAAM1V,EAAI,IAAK,KAEtD,KAAK,EACD8hB,EAAKR,EAAQQ,EAAIT,EAAc,CAAC,EAAG3L,EAAM1V,EAAI,IAAK,KAEtD,KAAK,EACD8hB,EAAKR,EAAQQ,EAAIT,EAAc,CAAC,EAAG3L,EAAM1V,EAAI,IAAK,KAEtD,KAAK,EACD8hB,EAAKR,EAAQQ,EAAIT,EAAc,CAAC,EAAG3L,EAAM1V,EAAI,IAAK,IAEtD,KAAK,EAED8hB,EAAKX,EADLW,EAAKR,EAAQQ,EAAI,CAAC,EAAGpM,EAAM1V,KACL+J,GAGtB8X,EAAKP,EAAQO,EADbC,EAAKX,EADLW,EAAKV,EAASU,EAAI,IACI9X,IAgB9B,OATA6X,EAAKX,EAHLW,EAAKP,EAAQO,EAAI,CAAC,EAAGnM,EAAM5W,SAC3BkjB,EAAKV,EAAQU,EAAI,CAAC,EAAGtM,EAAM5W,UAG3BkjB,EAAKd,EAAQc,EAAIH,GAKjBA,EAAKX,EAHLW,EAAKN,EAASM,GACdG,EAAKT,EAASS,IAGdA,EAAKd,EAAQc,EAAIH,IAET,YAAcA,EAAG,KAAO,GAAGhgB,SAAS,KAAKhB,OAAO,IAAM,YAAcghB,EAAG,KAAO,GAAGhgB,SAAS,KAAKhB,OAAO,IAAM,YAAcmhB,EAAG,KAAO,GAAGngB,SAAS,KAAKhB,OAAO,IAAM,YAAcmhB,EAAG,KAAO,GAAGngB,SAAS,KAAKhB,OAAO,EAC9N,EASyCtC,EAAOC,UACxCA,EAAUD,EAAOC,QAAUoiB,GAG/BpiB,EAAQ+jB,YAAc3B,CAwB7B,CA1jBA,wBCTD,WACE,IAAI4B,EAASC,EAAMC,EAAKC,EAAMC,EAAMC,EAAMC,EAASC,EAEnDA,EAAU,SAASrC,GAMjB,MAAO,EAJFA,EAAQ,KAAQ,MAAS,IACzBA,EAAQ,KAAQ,MAAS,IAClB,MAAPA,KAAwB,EAClB,IAAPA,GACgB5f,KAAK,IAC3B,EAEAgiB,EAAU,SAASE,GACjB,IAAIviB,EAAGQ,EAAGjB,EAAGQ,EAAGd,EAAGujB,EAEnB,IADAxiB,EAAI,GACCT,EAAIQ,EAAI,EAAGA,GAAK,GACD,IAAdwiB,EAAGlkB,OADekB,IAAMQ,EAAG,CAI/B,GAAIR,EAAI,EAAG,CACT,GAAc,MAAVgjB,EAAG,GACL,MAAM,IAAI5hB,MAAM,cAElB4hB,EAAKA,EAAGvU,UAAU,EACpB,CACgB/O,GAAhBujB,EAAMR,EAAKO,IAAa,GAAI/hB,EAAIgiB,EAAI,GACpCD,EAAKA,EAAGvU,UAAUxN,GAClBR,EAAEC,KAAKhB,EACT,CACA,GAAkB,IAAdsjB,EAAGlkB,OACL,MAAM,IAAIsC,MAAM,cAElB,OAAQX,EAAE3B,QACR,KAAK,EACH,GAAI2B,EAAE,GAAK,WACT,MAAM,IAAIW,MAAM,cAElB,OAAOX,EAAE,KAAO,EAClB,KAAK,EACH,GAAIA,EAAE,GAAK,KAAQA,EAAE,GAAK,SACxB,MAAM,IAAIW,MAAM,cAElB,OAAQX,EAAE,IAAM,GAAKA,EAAE,MAAQ,EACjC,KAAK,EACH,GAAIA,EAAE,GAAK,KAAQA,EAAE,GAAK,KAAQA,EAAE,GAAK,MACvC,MAAM,IAAIW,MAAM,cAElB,OAAQX,EAAE,IAAM,GAAKA,EAAE,IAAM,GAAKA,EAAE,MAAQ,EAC9C,KAAK,EACH,GAAIA,EAAE,GAAK,KAAQA,EAAE,GAAK,KAAQA,EAAE,GAAK,KAAQA,EAAE,GAAK,IACtD,MAAM,IAAIW,MAAM,cAElB,OAAQX,EAAE,IAAM,GAAKA,EAAE,IAAM,GAAKA,EAAE,IAAM,EAAIA,EAAE,MAAQ,EAC1D,QACE,MAAM,IAAIW,MAAM,cAEtB,EAMAuhB,GAJAD,EAAM,SAASjiB,GACb,OAAOA,EAAES,WAAW,EACtB,GAEW,KAEX2hB,EAAOH,EAAI,KAEXE,EAAOF,EAAI,KAEXD,EAAO,SAAS9J,GACd,IAAIuK,EAAMC,EAAMnjB,EAAGN,EAAGS,EAgBtB,IAfAT,EAAI,EACJwjB,EAAO,GACPC,EAAO,IACPnjB,EAAI,EACA2Y,EAAE7Z,OAAS,GAAc,MAAT6Z,EAAE3Y,KACH,MAAb2Y,EAAE3Y,EAAI,IAA2B,MAAb2Y,EAAE3Y,EAAI,IAC5BA,GAAK,EACLkjB,EAAO,IACE,KAAOvK,EAAE3Y,EAAI,IAAM2Y,EAAE3Y,EAAI,IAAM,MACxCA,IACAkjB,EAAO,EACPC,EAAO,MAGXhjB,EAAQH,EACDA,EAAI2Y,EAAE7Z,QAAQ,CACnB,GAAI,KAAO6Z,EAAE3Y,IAAM2Y,EAAE3Y,IAAMmjB,EACzBzjB,EAAKA,EAAIwjB,GAAQR,EAAI/J,EAAE3Y,IAAM2iB,KAAW,MACnC,IAAa,KAATO,EAST,MARA,GAAI,KAAOvK,EAAE3Y,IAAM2Y,EAAE3Y,IAAM,IACzBN,EAAKA,EAAIwjB,GAAQ,GAAKR,EAAI/J,EAAE3Y,IAAM6iB,KAAW,MACxC,MAAI,KAAOlK,EAAE3Y,IAAM2Y,EAAE3Y,IAAM,KAGhC,MAFAN,EAAKA,EAAIwjB,GAAQ,GAAKR,EAAI/J,EAAE3Y,IAAM4iB,KAAW,CAG/C,CAGF,CACA,GAAIljB,EAAI,WACN,MAAM,IAAI0B,MAAM,aAElBpB,GACF,CACA,GAAIA,IAAMG,EACR,MAAM,IAAIiB,MAAM,eAElB,MAAO,CAAC1B,EAAGM,EACb,EAEAwiB,EAAU,WACR,SAASA,EAAQY,EAAKC,GACpB,IAAWrjB,EAAGQ,EAAGyiB,EACjB,GAAmB,iBAARG,EACT,MAAM,IAAIhiB,MAAM,2BAQlB,GANKiiB,IACHJ,EAAMG,EAAIta,MAAM,IAAK,GAAIsa,EAAMH,EAAI,GAAII,EAAOJ,EAAI,IAE/CI,IACHA,EAAO,IAEW,iBAATA,GAAqBA,EAAKpN,QAAQ,MAAQ,EAAG,CACtD,IACE7S,KAAKkgB,SAAWR,EAAQO,EAC1B,CAAE,MAAOE,GAEP,MAAM,IAAIniB,MAAM,iBAAmBiiB,EACrC,CACA,IAAKrjB,EAAIQ,EAAI,GAAIA,GAAK,EAAGR,IAAMQ,EAC7B,GAAI4C,KAAKkgB,WAAc,YAAe,GAAKtjB,IAAQ,EAAG,CACpDoD,KAAKogB,QAAUxjB,EACf,KACF,CAEJ,KAAO,KAAIqjB,GAAiB,IAATA,EAOjB,MAAM,IAAIjiB,MAAM,uBANhBgC,KAAKogB,QAAUtX,SAASmX,EAAM,IAC9BjgB,KAAKkgB,SAAW,EACZlgB,KAAKogB,QAAU,IACjBpgB,KAAKkgB,SAAY,YAAe,GAAKlgB,KAAKogB,UAAc,EAI5D,CACA,IACEpgB,KAAKqgB,SAAWX,EAAQM,GAAOhgB,KAAKkgB,YAAc,CACpD,CAAE,MAAOC,GAEP,MAAM,IAAIniB,MAAM,wBAA0BgiB,EAC5C,CACA,KAAMhgB,KAAKogB,SAAW,IACpB,MAAM,IAAIpiB,MAAM,yBAA2BiiB,GAE7CjgB,KAAKkG,KAAO1J,KAAK+G,IAAI,EAAG,GAAKvD,KAAKogB,SAClCpgB,KAAK8f,KAAOH,EAAQ3f,KAAKqgB,SACzBrgB,KAAKigB,KAAON,EAAQ3f,KAAKkgB,UACzBlgB,KAAKsgB,SAAWX,GAAS3f,KAAKkgB,UAC9BlgB,KAAKugB,MAAQvgB,KAAKogB,SAAW,GAAKT,EAAQ3f,KAAKqgB,QAAU,GAAKrgB,KAAK8f,KACnE9f,KAAKwgB,KAAOxgB,KAAKogB,SAAW,GAAKT,EAAQ3f,KAAKqgB,QAAUrgB,KAAKkG,KAAO,GAAKyZ,EAAQ3f,KAAKqgB,QAAUrgB,KAAKkG,KAAO,GAC5GlG,KAAKygB,UAAYzgB,KAAKogB,SAAW,GAAKT,EAAQ3f,KAAKqgB,QAAUrgB,KAAKkG,KAAO,QAAK,CAChF,CAoCA,OAlCAkZ,EAAQlf,UAAUwgB,SAAW,SAASd,GAIpC,MAHkB,iBAAPA,IAAoBA,EAAG/M,QAAQ,KAAO,GAA8B,IAAzB+M,EAAGla,MAAM,KAAKhK,UAClEkkB,EAAK,IAAIR,EAAQQ,IAEfA,aAAcR,EACTpf,KAAK0gB,SAASd,EAAGE,OAAS9f,KAAK0gB,SAASd,EAAGa,WAAab,EAAGY,OAE1Dd,EAAQE,GAAM5f,KAAKkgB,YAAc,IAAOlgB,KAAKqgB,QAAUrgB,KAAKkgB,YAAc,CAEtF,EAEAd,EAAQlf,UAAUgO,KAAO,SAASqE,GAIhC,OAHa,MAATA,IACFA,EAAQ,GAEH,IAAI6M,EAAQO,EAAQ3f,KAAKqgB,QAAWrgB,KAAKkG,KAAOqM,GAASvS,KAAKigB,KACvE,EAEAb,EAAQlf,UAAU4L,QAAU,SAASzQ,GACnC,IAAIO,EAAO+kB,EAAUrD,EAIrB,IAHAA,EAAOoC,EAAQ1f,KAAKugB,OACpBI,EAAWjB,EAAQ1f,KAAKwgB,MACxB5kB,EAAQ,EACD0hB,GAAQqD,GACbtlB,EAAGskB,EAAQrC,GAAOA,EAAM1hB,GACxBA,IACA0hB,GAEJ,EAEA8B,EAAQlf,UAAUzB,SAAW,WAC3B,OAAOuB,KAAK8f,KAAO,IAAM9f,KAAKogB,OAChC,EAEOhB,CAER,CAxFS,GA0FVhkB,EAAQskB,QAAUA,EAElBtkB,EAAQukB,QAAUA,EAElBvkB,EAAQgkB,QAAUA,CAEnB,GAAE9Y,KAAKtG,mCC5MR7E,EAAOC,QAAU,EAAjB,6BCFAD,EAAOC,QAAUwlB,EAEjB,IA+DIC,EA/DAC,EAAW,QAsBf,SAASF,EAAO/U,EAAMkV,GACbD,EAAS7iB,KAAK4N,KACfA,EAAO,mBAAqBA,EAAO,SACnCkV,EAAO,CAAEC,OAAQ,CAAEC,OAAQ,CAAED,OAAQ,CAAEE,SAAU,CAAEF,OAAQD,QAE/DH,EAAO/U,GAAQkV,CACnB,CAWAH,EAAO,MAAO,CAUVO,IAAK,CACDC,OAAQ,CACJC,SAAU,CACNnZ,KAAM,SACNoZ,GAAI,GAER7hB,MAAO,CACHyI,KAAM,QACNoZ,GAAI,OAQpBV,EAAO,WAAY,CAUfW,SAAUV,EAAW,CACjBO,OAAQ,CACJI,QAAS,CACLtZ,KAAM,QACNoZ,GAAI,GAERG,MAAO,CACHvZ,KAAM,QACNoZ,GAAI,OAMpBV,EAAO,YAAa,CAUhBc,UAAWb,IAGfD,EAAO,QAAS,CAOZe,MAAO,CACHP,OAAQ,CAAC,KAIjBR,EAAO,SAAU,CASbgB,OAAQ,CACJR,OAAQ,CACJA,OAAQ,CACJS,QAAS,SACT3Z,KAAM,QACNoZ,GAAI,KAkBhBQ,MAAO,CACHC,OAAQ,CACJC,KAAM,CACFC,MAAO,CACH,YACA,cACA,cACA,YACA,cACA,eAIZb,OAAQ,CACJc,UAAW,CACPha,KAAM,YACNoZ,GAAI,GAERa,YAAa,CACTja,KAAM,SACNoZ,GAAI,GAERc,YAAa,CACTla,KAAM,SACNoZ,GAAI,GAERe,UAAW,CACPna,KAAM,OACNoZ,GAAI,GAERgB,YAAa,CACTpa,KAAM,SACNoZ,GAAI,GAERiB,UAAW,CACPra,KAAM,YACNoZ,GAAI,KAKhBkB,UAAW,CACPC,OAAQ,CACJC,WAAY,IAWpBC,UAAW,CACPvB,OAAQ,CACJqB,OAAQ,CACJG,KAAM,WACN1a,KAAM,QACNoZ,GAAI,OAMpBV,EAAO,WAAY,CASfiC,YAAa,CACTzB,OAAQ,CACJ3hB,MAAO,CACHyI,KAAM,SACNoZ,GAAI,KAYhBwB,WAAY,CACR1B,OAAQ,CACJ3hB,MAAO,CACHyI,KAAM,QACNoZ,GAAI,KAYhByB,WAAY,CACR3B,OAAQ,CACJ3hB,MAAO,CACHyI,KAAM,QACNoZ,GAAI,KAYhB0B,YAAa,CACT5B,OAAQ,CACJ3hB,MAAO,CACHyI,KAAM,SACNoZ,GAAI,KAYhB2B,WAAY,CACR7B,OAAQ,CACJ3hB,MAAO,CACHyI,KAAM,QACNoZ,GAAI,KAYhB4B,YAAa,CACT9B,OAAQ,CACJ3hB,MAAO,CACHyI,KAAM,SACNoZ,GAAI,KAYhB6B,UAAW,CACP/B,OAAQ,CACJ3hB,MAAO,CACHyI,KAAM,OACNoZ,GAAI,KAYhB8B,YAAa,CACThC,OAAQ,CACJ3hB,MAAO,CACHyI,KAAM,SACNoZ,GAAI,KAYhB+B,WAAY,CACRjC,OAAQ,CACJ3hB,MAAO,CACHyI,KAAM,QACNoZ,GAAI,OAMpBV,EAAO,aAAc,CASjB0C,UAAW,CACPlC,OAAQ,CACJmC,MAAO,CACHX,KAAM,WACN1a,KAAM,SACNoZ,GAAI,OAqBpBV,EAAO9V,IAAM,SAAa0Y,GACtB,OAAO5C,EAAO4C,IAAS,IAC3B,8BCzYA,IAAIC,EAAYroB,EAEZsoB,EAAO,EAAQ,MACfC,EAAO,EAAQ,MAWnB,SAASC,EAA2BC,EAAKC,EAAOC,EAAYC,GACxD,IAAIC,GAAwB,EAE5B,GAAIH,EAAMI,aACN,GAAIJ,EAAMI,wBAAwBR,EAAM,CAAEG,EACrC,eAAgBG,GACjB,IAAK,IAAIvB,EAASqB,EAAMI,aAAazB,OAAQ1jB,EAAOD,OAAOC,KAAK0jB,GAAS7lB,EAAI,EAAGA,EAAImC,EAAKrD,SAAUkB,EAE3F6lB,EAAO1jB,EAAKnC,MAAQknB,EAAMK,aAAgBF,IAAyBJ,EAClE,WADkEA,CAE9D,4CAA+CG,EAAMA,EAAMA,GAC3DF,EAAMM,UAAUP,EAEhB,SACLI,GAAwB,GAE5BJ,EACC,UAAW9kB,EAAKnC,GADjBinB,CAEC,WAAYpB,EAAO1jB,EAAKnC,IAFzBinB,CAGK,SAAUG,EAAMvB,EAAO1jB,EAAKnC,IAHjCinB,CAIK,SACPA,EACD,IACL,MAAOA,EACF,4BAA+BG,EAD7BH,CAEE,sBAAuBC,EAAMO,SAAW,oBAF1CR,CAGF,gCAAiCG,EAAMD,EAAYC,OACrD,CACH,IAAIM,GAAa,EACjB,OAAQR,EAAM5b,MACV,IAAK,SACL,IAAK,QAAS2b,EACT,kBAAmBG,EAAMA,GAC1B,MACJ,IAAK,SACL,IAAK,UAAWH,EACX,cAAeG,EAAMA,GACtB,MACJ,IAAK,QACL,IAAK,SACL,IAAK,WAAYH,EACZ,YAAaG,EAAMA,GACpB,MACJ,IAAK,SACDM,GAAa,EAEjB,IAAK,QACL,IAAK,SACL,IAAK,UACL,IAAK,WAAYT,EACZ,gBADYA,CAER,6CAA8CG,EAAMA,EAAMM,EAFlDT,CAGZ,iCAAoCG,EAHxBH,CAIR,uBAAwBG,EAAMA,EAJtBH,CAKZ,iCAAoCG,EALxBH,CAMR,UAAWG,EAAMA,EANTH,CAOZ,iCAAoCG,EAPxBH,CAQR,+DAAgEG,EAAMA,EAAMA,EAAMM,EAAa,OAAS,IAC7G,MACJ,IAAK,QAAST,EACT,4BAA+BG,EADtBH,CAEL,wEAAyEG,EAAMA,EAAMA,EAFhFH,CAGT,2BAA4BG,EAHnBH,CAIL,UAAWG,EAAMA,GACtB,MACJ,IAAK,SAAUH,EACV,kBAAmBG,EAAMA,GAC1B,MACJ,IAAK,OAAQH,EACR,mBAAoBG,EAAMA,GAMvC,CACA,OAAOH,CAEX,CAiEA,SAASU,EAAyBV,EAAKC,EAAOC,EAAYC,GAEtD,GAAIF,EAAMI,aACFJ,EAAMI,wBAAwBR,EAAMG,EACnC,yFAA0FG,EAAMD,EAAYC,EAAMA,EAAMD,EAAYC,EAAMA,GAC1IH,EACA,gCAAiCG,EAAMD,EAAYC,OACrD,CACH,IAAIM,GAAa,EACjB,OAAQR,EAAM5b,MACV,IAAK,SACL,IAAK,QAAS2b,EACb,6CAA8CG,EAAMA,EAAMA,EAAMA,GAC7D,MACJ,IAAK,SACDM,GAAa,EAEjB,IAAK,QACL,IAAK,SACL,IAAK,UACL,IAAK,WAAYT,EAChB,4BAA+BG,EADfH,CAEZ,uCAAwCG,EAAMA,EAAMA,EAFxCH,CAGhB,OAHgBA,CAIZ,4IAA6IG,EAAMA,EAAMA,EAAMA,EAAMM,EAAa,OAAQ,GAAIN,GAC/L,MACJ,IAAK,QAASH,EACb,gHAAiHG,EAAMA,EAAMA,EAAMA,EAAMA,GACtI,MACJ,QAASH,EACR,UAAWG,EAAMA,GAG1B,CACA,OAAOH,CAEX,CA9FAJ,EAAUe,WAAa,SAAoBC,GAEvC,IAAIrD,EAASqD,EAAMC,YACfb,EAAMF,EAAKzlB,QAAQ,CAAC,KAAMumB,EAAM5Y,KAAO,cAAjC8X,CACT,6BADSA,CAEL,YACL,IAAKvC,EAAO1lB,OAAQ,OAAOmoB,EAC1B,wBACDA,EACC,uBACD,IAAK,IAAIjnB,EAAI,EAAGA,EAAIwkB,EAAO1lB,SAAUkB,EAAG,CACpC,IAAIknB,EAAS1C,EAAOxkB,GAAGb,UACnBioB,EAASL,EAAKgB,SAASb,EAAMjY,MAG7BiY,EAAMpY,KAAOmY,EACpB,WAAYG,EADQH,CAEhB,4BAA+BG,EAFfH,CAGZ,sBAAuBC,EAAMO,SAAW,oBAH5BR,CAIhB,SAAUG,EAJMH,CAKhB,oDAAqDG,GAClDJ,EAA2BC,EAAKC,EAAwBlnB,EAAGonB,EAAO,UAAlEJ,CACH,IADGA,CAEP,MAGcE,EAAMM,UAAYP,EAChC,WAAYG,EADoBH,CAE5B,0BAA2BG,EAFCH,CAGxB,sBAAuBC,EAAMO,SAAW,mBAHhBR,CAI5B,SAAUG,EAJkBH,CAK5B,iCAAkCG,GAC/BJ,EAA2BC,EAAKC,EAAwBlnB,EAAGonB,EAAO,MAAlEJ,CACH,IADGA,CAEP,OAIaE,EAAMI,wBAAwBR,GAAOG,EAClD,iBAAkBG,GACfJ,EAA2BC,EAAKC,EAAwBlnB,EAAGonB,GACjDF,EAAMI,wBAAwBR,GAAOG,EAClD,KAED,CAAE,OAAOA,EACR,WAEL,EAsDAJ,EAAUmB,SAAW,SAAkBH,GAEnC,IAAIrD,EAASqD,EAAMC,YAAYjnB,QAAQonB,KAAKlB,EAAKmB,mBACjD,IAAK1D,EAAO1lB,OACR,OAAOioB,EAAKzlB,SAALylB,CAAe,aAU1B,IATA,IAAIE,EAAMF,EAAKzlB,QAAQ,CAAC,IAAK,KAAMumB,EAAM5Y,KAAO,YAAtC8X,CACT,SADSA,CAEL,OAFKA,CAGT,YAEGoB,EAAiB,GACjBC,EAAY,GACZC,EAAe,GACfroB,EAAI,EACDA,EAAIwkB,EAAO1lB,SAAUkB,EACnBwkB,EAAOxkB,GAAGsoB,SACT9D,EAAOxkB,GAAGb,UAAUqoB,SAAWW,EAC/B3D,EAAOxkB,GAAG8O,IAAMsZ,EAChBC,GAAc3nB,KAAK8jB,EAAOxkB,IAEpC,GAAImoB,EAAerpB,OAAQ,CAEvB,IAFyBmoB,EAC5B,6BACQjnB,EAAI,EAAGA,EAAImoB,EAAerpB,SAAUkB,EAAGinB,EAC3C,SAAUF,EAAKgB,SAASI,EAAenoB,GAAGiP,OAC3CgY,EACH,IACD,CAEA,GAAImB,EAAUtpB,OAAQ,CAElB,IAFoBmoB,EACvB,8BACQjnB,EAAI,EAAGA,EAAIooB,EAAUtpB,SAAUkB,EAAGinB,EACtC,SAAUF,EAAKgB,SAASK,EAAUpoB,GAAGiP,OACtCgY,EACH,IACD,CAEA,GAAIoB,EAAavpB,OAAQ,CAErB,IAFuBmoB,EAC1B,mBACQjnB,EAAI,EAAGA,EAAIqoB,EAAavpB,SAAUkB,EAAG,CACtC,IAAIknB,EAAQmB,EAAaroB,GACrBonB,EAAQL,EAAKgB,SAASb,EAAMjY,MAChC,GAAIiY,EAAMI,wBAAwBR,EAAMG,EAC3C,6BAA8BG,EAAMF,EAAMI,aAAaiB,WAAWrB,EAAMK,aAAcL,EAAMK,kBACpF,GAAIL,EAAMxG,KAAMuG,EACxB,iBADwBA,CAEpB,gCAAiCC,EAAMK,YAAYiB,IAAKtB,EAAMK,YAAYkB,KAAMvB,EAAMK,YAAYmB,SAF9EzB,CAGpB,oEAAqEG,EAHjDH,CAIxB,QAJwBA,CAKpB,6BAA8BG,EAAMF,EAAMK,YAAY1lB,WAAYqlB,EAAMK,YAAYoB,iBAChF,GAAIzB,EAAMxR,MAAO,CAClB,IAAIkT,EAAe,IAAMhqB,MAAM0E,UAAUzC,MAAM6I,KAAKwd,EAAMK,aAAazmB,KAAK,KAAO,IACnFmmB,EACP,6BAA8BG,EAAMzmB,OAAOC,aAAatB,MAAMqB,OAAQumB,EAAMK,aADrEN,CAEP,QAFOA,CAGH,SAAUG,EAAMwB,EAHb3B,CAIH,6CAA8CG,EAAMA,EAJjDH,CAKP,IACG,MAAOA,EACV,SAAUG,EAAMF,EAAMK,YACvB,CAAEN,EACL,IACD,CACA,IAAI4B,GAAS,EACb,IAAK7oB,EAAI,EAAGA,EAAIwkB,EAAO1lB,SAAUkB,EAAG,CAC5BknB,EAAQ1C,EAAOxkB,GAAnB,IACIhB,EAAQ6oB,EAAMiB,aAAa7S,QAAQiR,GACnCE,EAAQL,EAAKgB,SAASb,EAAMjY,MAC5BiY,EAAMpY,KACD+Z,IAAUA,GAAS,EAAM5B,EACrC,YACSA,EACT,0CAA2CG,EAAMA,EADxCH,CAEL,SAAUG,EAFLH,CAGL,kCACGU,EAAyBV,EAAKC,EAAoBloB,EAAOooB,EAAO,WAAhEO,CACH,MACUT,EAAMM,UAAYP,EAChC,uBAAwBG,EAAMA,EADEH,CAE5B,SAAUG,EAFkBH,CAG5B,iCAAkCG,GAC/BO,EAAyBV,EAAKC,EAAoBloB,EAAOooB,EAAO,MAAhEO,CACH,OACQV,EACZ,uCAAwCG,EAAMF,EAAMjY,MACjD0Y,EAAyBV,EAAKC,EAAoBloB,EAAOooB,GACrDF,EAAMoB,QAAQrB,EACjB,eADiBA,CAEb,SAAUF,EAAKgB,SAASb,EAAMoB,OAAOrZ,MAAOiY,EAAMjY,OAEvDgY,EACH,IACD,CACA,OAAOA,EACN,WAEL,+BC3SA1oB,EAAOC,QAeP,SAAiBqpB,GAEb,IAAIZ,EAAMF,EAAKzlB,QAAQ,CAAC,IAAK,KAAMumB,EAAM5Y,KAAO,UAAtC8X,CACT,6BADSA,CAEL,qBAFKA,CAGT,qDAAuDc,EAAMC,YAAYhI,QAAO,SAASoH,GAAS,OAAOA,EAAMpY,GAAK,IAAGhQ,OAAS,WAAa,IAHpIioB,CAIT,kBAJSA,CAKL,oBACDc,EAAMkB,OAAO9B,EACZ,gBADYA,CAER,SACTA,EACK,kBAGL,IADA,IAAIjnB,EAAI,EACDA,EAAsB6nB,EAAMC,YAAYhpB,SAAUkB,EAAG,CACxD,IAAIknB,EAAQW,EAAMiB,aAAa9oB,GAAGb,UAC9BmM,EAAQ4b,EAAMI,wBAAwBR,EAAO,QAAUI,EAAM5b,KAC7D2X,EAAQ,IAAM8D,EAAKgB,SAASb,EAAMjY,MAAOgY,EACxC,aAAcC,EAAMxC,IAGrBwC,EAAMpY,KAAOmY,EACR,4BAA6BhE,EADrBgE,CAEJ,QAAShE,EAFLgE,CAGR,kCAEiC9lB,IAAlC6nB,EAAMC,SAAS/B,EAAMjC,SAAwBgC,EAC5C,OAAQ+B,EAAMC,SAAS/B,EAAMjC,UAC7BgC,EACA,eAEwB9lB,IAAzB6nB,EAAMC,SAAS3d,GAAqB2b,EACnC,WAAY+B,EAAMC,SAAS3d,IAC3B2b,EACA,cAELA,EACK,mBADLA,CAES,sBAFTA,CAGS,oBAHTA,CAIa,0BAA2BC,EAAMjC,QAJ9CgC,CAKa,gBAEa9lB,IAAtB6nB,EAAME,MAAM5d,GAAqB2b,EACpB,uCAAwCjnB,GACpDinB,EACY,eAAgB3b,GAEjC2b,EACiB,QADjBA,CAEa,WAFbA,CAGiB,qBAHjBA,CAIiB,QAJjBA,CAKS,IALTA,CAMK,UAE6B9lB,IAA9B6nB,EAAMtI,KAAKwG,EAAMjC,SAAwBgC,EACxC,qDAAwDhE,GACxDgE,EACA,cAAehE,IAGbiE,EAAMM,UAAYP,EAEpB,uBAAwBhE,EAAKA,EAFTgE,CAGhB,QAAShE,QAGS9hB,IAAvB6nB,EAAMG,OAAO7d,IAAqB2b,EACjC,iBADiCA,CAE7B,0BAF6BA,CAG7B,kBAH6BA,CAIzB,kBAAmBhE,EAAK3X,EAJC2b,CAKjC,cAGqB9lB,IAAtB6nB,EAAME,MAAM5d,GAAqB2b,EAAIC,EAAMI,aAAayB,MAClD,+BACA,0CAA2C9F,EAAKjjB,GACrDinB,EACI,kBAAmBhE,EAAK3X,SAGJnK,IAAtB6nB,EAAME,MAAM5d,GAAqB2b,EAAIC,EAAMI,aAAayB,MACzD,yBACA,oCAAqC9F,EAAKjjB,GAC/CinB,EACI,YAAahE,EAAK3X,GAC3B2b,EACS,QADTA,CAEK,IAET,CASA,IATEA,EACO,WADPA,CAEW,kBAFXA,CAGW,QAHXA,CAKG,IALHA,CAMD,KAGIjnB,EAAI,EAAGA,EAAI6nB,EAAMiB,aAAahqB,SAAUkB,EAAG,CAC5C,IAAIopB,EAASvB,EAAMiB,aAAa9oB,GAC5BopB,EAAOC,UAAUpC,EACxB,4BAA6BmC,EAAOna,KADZgY,CAEpB,4CAA6CqC,EAAQF,GAC1D,CAEA,OAAOnC,EACN,WAEL,EA7HA,IAAIH,EAAU,EAAQ,MAClBkC,EAAU,EAAQ,KAClBjC,EAAU,EAAQ,MAEtB,SAASuC,EAAQpC,GACb,MAAO,qBAAuBA,EAAMjY,KAAO,GAC/C,+BCRA1Q,EAAOC,QA0BP,SAAiBqpB,GAWb,IATA,IAIO5E,EAJHgE,EAAMF,EAAKzlB,QAAQ,CAAC,IAAK,KAAMumB,EAAM5Y,KAAO,UAAtC8X,CACT,SADSA,CAEL,qBAKDvC,EAA2BqD,EAAMC,YAAYjnB,QAAQonB,KAAKlB,EAAKmB,mBAE1DloB,EAAI,EAAGA,EAAIwkB,EAAO1lB,SAAUkB,EAAG,CACpC,IAAIknB,EAAW1C,EAAOxkB,GAAGb,UACrBH,EAAW6oB,EAAMiB,aAAa7S,QAAQiR,GACtC5b,EAAW4b,EAAMI,wBAAwBR,EAAO,QAAUI,EAAM5b,KAChEie,EAAWP,EAAME,MAAM5d,GACvB2X,EAAW,IAAM8D,EAAKgB,SAASb,EAAMjY,MAGrCiY,EAAMpY,KACNmY,EACP,kDAAmDhE,EAAKiE,EAAMjY,KADvDgY,CAEH,mDAAoDhE,EAFjDgE,CAGC,4CAA6CC,EAAMxC,IAAM,EAAI,KAAO,EAAG,EAAIsE,EAAMQ,OAAOtC,EAAMjC,SAAUiC,EAAMjC,cAC9F9jB,IAAbooB,EAAwBtC,EAC3B,oEAAqEjoB,EAAOikB,GACxEgE,EACJ,qCAAsC,GAAKsC,EAAUje,EAAM2X,GAC5DgE,EACH,IADGA,CAEP,MAGcC,EAAMM,UAAYP,EAChC,2BAA4BhE,EAAKA,GAGtBiE,EAAMiC,aAAiChoB,IAAvB6nB,EAAMG,OAAO7d,GAAuB2b,EAE3D,uBAAwBC,EAAMxC,IAAM,EAAI,KAAO,EAFYuC,CAG3D,+BAAgChE,EAH2BgE,CAIvD,cAAe3b,EAAM2X,EAJkCgE,CAK3D,eAGYA,EAEZ,+BAAgChE,QACR9hB,IAAbooB,EACRE,EAAexC,EAAKC,EAAOloB,EAAOikB,EAAM,OAC/BgE,EACR,0BAA2BC,EAAMxC,IAAM,EAAI6E,KAAc,EAAGje,EAAM2X,IAEjEgE,EACT,OAIWC,EAAMwC,UAAUzC,EAC3B,iDAAkDhE,EAAKiE,EAAMjY,WAErC9N,IAAbooB,EACRE,EAAexC,EAAKC,EAAOloB,EAAOikB,GACzBgE,EACR,uBAAwBC,EAAMxC,IAAM,EAAI6E,KAAc,EAAGje,EAAM2X,GAGpE,CAEA,OAAOgE,EACN,WAEL,EAhGA,IAAIH,EAAW,EAAQ,MACnBkC,EAAW,EAAQ,KACnBjC,EAAW,EAAQ,MAWvB,SAAS0C,EAAexC,EAAKC,EAAOC,EAAYlE,GAC5C,OAAOiE,EAAMI,aAAayB,MACpB9B,EAAI,+CAAgDE,EAAYlE,GAAMiE,EAAMxC,IAAM,EAAI,KAAO,GAAIwC,EAAMxC,IAAM,EAAI,KAAO,GACxHuC,EAAI,oDAAqDE,EAAYlE,GAAMiE,EAAMxC,IAAM,EAAI,KAAO,EAC5G,+BCnBAnmB,EAAOC,QAAUsoB,EAGjB,IAAI6C,EAAmB,EAAQ,QAC7B7C,EAAKxjB,UAAYpB,OAAO2N,OAAO8Z,EAAiBrmB,YAAY4M,YAAc4W,GAAM8C,UAAY,OAE9F,IAAIC,EAAY,EAAQ,MACpB9C,EAAO,EAAQ,MAcnB,SAASD,EAAK7X,EAAM4W,EAAQ1hB,EAAS2lB,EAASC,EAAUC,GAGpD,GAFAL,EAAiBjgB,KAAKtG,KAAM6L,EAAM9K,GAE9B0hB,GAA4B,iBAAXA,EACjB,MAAMnW,UAAU,4BA0CpB,GApCAtM,KAAKmlB,WAAa,CAAC,EAMnBnlB,KAAKyiB,OAAS3jB,OAAO2N,OAAOzM,KAAKmlB,YAMjCnlB,KAAK0mB,QAAUA,EAMf1mB,KAAK2mB,SAAWA,GAAY,CAAC,EAM7B3mB,KAAK4mB,cAAgBA,EAMrB5mB,KAAK6mB,cAAW9oB,EAMZ0kB,EACA,IAAK,IAAI1jB,EAAOD,OAAOC,KAAK0jB,GAAS7lB,EAAI,EAAGA,EAAImC,EAAKrD,SAAUkB,EAC5B,iBAApB6lB,EAAO1jB,EAAKnC,MACnBoD,KAAKmlB,WAAYnlB,KAAKyiB,OAAO1jB,EAAKnC,IAAM6lB,EAAO1jB,EAAKnC,KAAQmC,EAAKnC,GACjF,CAgBA8mB,EAAKoD,SAAW,SAAkBjb,EAAMkV,GACpC,IAAIgG,EAAM,IAAIrD,EAAK7X,EAAMkV,EAAK0B,OAAQ1B,EAAKhgB,QAASggB,EAAK2F,QAAS3F,EAAK4F,UAEvE,OADAI,EAAIF,SAAW9F,EAAK8F,SACbE,CACX,EAOArD,EAAKxjB,UAAU8mB,OAAS,SAAgBC,GACpC,IAAIC,IAAeD,GAAgBE,QAAQF,EAAcC,cACzD,OAAOvD,EAAKiB,SAAS,CACjB,UAAkB5kB,KAAKe,QACvB,gBAAkBf,KAAK4mB,cACvB,SAAkB5mB,KAAKyiB,OACvB,WAAkBziB,KAAK6mB,UAAY7mB,KAAK6mB,SAASnrB,OAASsE,KAAK6mB,cAAW9oB,EAC1E,UAAkBmpB,EAAelnB,KAAK0mB,aAAU3oB,EAChD,WAAkBmpB,EAAelnB,KAAK2mB,cAAW5oB,GAEzD,EAYA2lB,EAAKxjB,UAAUknB,IAAM,SAAavb,EAAMyV,EAAIoF,EAAS3lB,GAGjD,IAAK4iB,EAAK/M,SAAS/K,GACf,MAAMS,UAAU,yBAEpB,IAAKqX,EAAKjG,UAAU4D,GAChB,MAAMhV,UAAU,yBAEpB,QAA0BvO,IAAtBiC,KAAKyiB,OAAO5W,GACZ,MAAM7N,MAAM,mBAAqB6N,EAAO,QAAU7L,MAEtD,GAAIA,KAAKqnB,aAAa/F,GAClB,MAAMtjB,MAAM,MAAQsjB,EAAK,mBAAqBthB,MAElD,GAAIA,KAAKsnB,eAAezb,GACpB,MAAM7N,MAAM,SAAW6N,EAAO,oBAAsB7L,MAExD,QAA4BjC,IAAxBiC,KAAKmlB,WAAW7D,GAAmB,CACnC,IAAMthB,KAAKe,UAAWf,KAAKe,QAAQwmB,YAC/B,MAAMvpB,MAAM,gBAAkBsjB,EAAK,OAASthB,MAChDA,KAAKyiB,OAAO5W,GAAQyV,CACxB,MACIthB,KAAKmlB,WAAWnlB,KAAKyiB,OAAO5W,GAAQyV,GAAMzV,EAS9C,OAPI9K,SAC2BhD,IAAvBiC,KAAK4mB,gBACL5mB,KAAK4mB,cAAgB,CAAC,GAC1B5mB,KAAK4mB,cAAc/a,GAAQ9K,GAAW,MAG1Cf,KAAK2mB,SAAS9a,GAAQ6a,GAAW,KAC1B1mB,IACX,EASA0jB,EAAKxjB,UAAUwN,OAAS,SAAgB7B,GAEpC,IAAK8X,EAAK/M,SAAS/K,GACf,MAAMS,UAAU,yBAEpB,IAAIhK,EAAMtC,KAAKyiB,OAAO5W,GACtB,GAAW,MAAPvJ,EACA,MAAMtE,MAAM,SAAW6N,EAAO,uBAAyB7L,MAQ3D,cANOA,KAAKmlB,WAAW7iB,UAChBtC,KAAKyiB,OAAO5W,UACZ7L,KAAK2mB,SAAS9a,GACjB7L,KAAK4mB,sBACE5mB,KAAK4mB,cAAc/a,GAEvB7L,IACX,EAOA0jB,EAAKxjB,UAAUmnB,aAAe,SAAsB/F,GAChD,OAAOmF,EAAUY,aAAarnB,KAAK6mB,SAAUvF,EACjD,EAOAoC,EAAKxjB,UAAUonB,eAAiB,SAAwBzb,GACpD,OAAO4a,EAAUa,eAAetnB,KAAK6mB,SAAUhb,EACnD,+BCpMA1Q,EAAOC,QAAUosB,EAGjB,IAAIjB,EAAmB,EAAQ,QAC7BiB,EAAMtnB,UAAYpB,OAAO2N,OAAO8Z,EAAiBrmB,YAAY4M,YAAc0a,GAAOhB,UAAY,QAEhG,IAIIiB,EAJA/D,EAAQ,EAAQ,MAChBkC,EAAQ,EAAQ,KAChBjC,EAAQ,EAAQ,MAIhB+D,EAAS,+BAyCb,SAASF,EAAM3b,EAAMyV,EAAIpZ,EAAM0a,EAAMlY,EAAQ3J,EAAS2lB,GAclD,GAZI/C,EAAKgE,SAAS/E,IACd8D,EAAUhc,EACV3J,EAAU6hB,EACVA,EAAOlY,OAAS3M,GACT4lB,EAAKgE,SAASjd,KACrBgc,EAAU3lB,EACVA,EAAU2J,EACVA,OAAS3M,GAGbwoB,EAAiBjgB,KAAKtG,KAAM6L,EAAM9K,IAE7B4iB,EAAKjG,UAAU4D,IAAOA,EAAK,EAC5B,MAAMhV,UAAU,qCAEpB,IAAKqX,EAAK/M,SAAS1O,GACf,MAAMoE,UAAU,yBAEpB,QAAavO,IAAT6kB,IAAuB8E,EAAOzpB,KAAK2kB,EAAOA,EAAKnkB,WAAW6J,eAC1D,MAAMgE,UAAU,8BAEpB,QAAevO,IAAX2M,IAAyBiZ,EAAK/M,SAASlM,GACvC,MAAM4B,UAAU,2BAMP,oBAATsW,IACAA,EAAO,YAEX5iB,KAAK4iB,KAAOA,GAAiB,aAATA,EAAsBA,OAAO7kB,EAMjDiC,KAAKkI,KAAOA,EAMZlI,KAAKshB,GAAKA,EAMVthB,KAAK0K,OAASA,QAAU3M,EAMxBiC,KAAKimB,SAAoB,aAATrD,EAMhB5iB,KAAKsmB,UAAYtmB,KAAKimB,SAMtBjmB,KAAKokB,SAAoB,aAATxB,EAMhB5iB,KAAK0L,KAAM,EAMX1L,KAAKyJ,QAAU,KAMfzJ,KAAKklB,OAAS,KAMdllB,KAAKmkB,YAAc,KAMnBnkB,KAAK4nB,aAAe,KAMpB5nB,KAAKsd,OAAOqG,EAAKkE,WAA4B9pB,IAArB6nB,EAAMtI,KAAKpV,GAMnClI,KAAKsS,MAAiB,UAATpK,EAMblI,KAAKkkB,aAAe,KAMpBlkB,KAAK8nB,eAAiB,KAMtB9nB,KAAK+nB,eAAiB,KAOtB/nB,KAAKgoB,QAAU,KAMfhoB,KAAK0mB,QAAUA,CACnB,CAjKAc,EAAMV,SAAW,SAAkBjb,EAAMkV,GACrC,OAAO,IAAIyG,EAAM3b,EAAMkV,EAAKO,GAAIP,EAAK7Y,KAAM6Y,EAAK6B,KAAM7B,EAAKrW,OAAQqW,EAAKhgB,QAASggB,EAAK2F,QAC1F,EAuKA5nB,OAAO6L,eAAe6c,EAAMtnB,UAAW,SAAU,CAC7C4K,IAAK,WAID,OAFqB,OAAjB9K,KAAKgoB,UACLhoB,KAAKgoB,SAAuC,IAA7BhoB,KAAKioB,UAAU,WAC3BjoB,KAAKgoB,OAChB,IAMJR,EAAMtnB,UAAUgoB,UAAY,SAAmBrc,EAAMpM,EAAO0oB,GAGxD,MAFa,WAATtc,IACA7L,KAAKgoB,QAAU,MACZzB,EAAiBrmB,UAAUgoB,UAAU5hB,KAAKtG,KAAM6L,EAAMpM,EAAO0oB,EACxE,EAuBAX,EAAMtnB,UAAU8mB,OAAS,SAAgBC,GACrC,IAAIC,IAAeD,GAAgBE,QAAQF,EAAcC,cACzD,OAAOvD,EAAKiB,SAAS,CACjB,OAA0B,aAAd5kB,KAAK4iB,MAAuB5iB,KAAK4iB,WAAQ7kB,EACrD,OAAYiC,KAAKkI,KACjB,KAAYlI,KAAKshB,GACjB,SAAYthB,KAAK0K,OACjB,UAAY1K,KAAKe,QACjB,UAAYmmB,EAAelnB,KAAK0mB,aAAU3oB,GAElD,EAOAypB,EAAMtnB,UAAUnE,QAAU,WAEtB,GAAIiE,KAAKooB,SACL,OAAOpoB,KA6BX,QA3BuDjC,KAAlDiC,KAAKmkB,YAAcyB,EAAMC,SAAS7lB,KAAKkI,QACxClI,KAAKkkB,cAAgBlkB,KAAK+nB,eAAiB/nB,KAAK+nB,eAAeM,OAASroB,KAAKqoB,QAAQC,iBAAiBtoB,KAAKkI,MACvGlI,KAAKkkB,wBAAwBuD,EAC7BznB,KAAKmkB,YAAc,KAEnBnkB,KAAKmkB,YAAcnkB,KAAKkkB,aAAazB,OAAO3jB,OAAOC,KAAKiB,KAAKkkB,aAAazB,QAAQ,KAC/EziB,KAAKe,SAAWf,KAAKe,QAAQwnB,kBAEpCvoB,KAAKmkB,YAAc,MAInBnkB,KAAKe,SAAsC,MAA3Bf,KAAKe,QAAiB,UACtCf,KAAKmkB,YAAcnkB,KAAKe,QAAiB,QACrCf,KAAKkkB,wBAAwBR,GAAoC,iBAArB1jB,KAAKmkB,cACjDnkB,KAAKmkB,YAAcnkB,KAAKkkB,aAAazB,OAAOziB,KAAKmkB,eAIrDnkB,KAAKe,WACuB,IAAxBf,KAAKe,QAAQglB,cAA2ChoB,IAAxBiC,KAAKe,QAAQglB,SAAwB/lB,KAAKkkB,cAAkBlkB,KAAKkkB,wBAAwBR,WAClH1jB,KAAKe,QAAQglB,OACnBjnB,OAAOC,KAAKiB,KAAKe,SAASrF,SAC3BsE,KAAKe,aAAUhD,IAInBiC,KAAKsd,KACLtd,KAAKmkB,YAAcR,EAAKkE,KAAKW,WAAWxoB,KAAKmkB,YAAqC,MAAxBnkB,KAAKkI,KAAK3L,OAAO,IAGvEuC,OAAO4P,QACP5P,OAAO4P,OAAO1O,KAAKmkB,kBAEpB,GAAInkB,KAAKsS,OAAqC,iBAArBtS,KAAKmkB,YAA0B,CAC3D,IAAI5hB,EACAohB,EAAKxnB,OAAO8B,KAAK+B,KAAKmkB,aACtBR,EAAKxnB,OAAOyB,OAAOoC,KAAKmkB,YAAa5hB,EAAMohB,EAAK8E,UAAU9E,EAAKxnB,OAAOT,OAAOsE,KAAKmkB,cAAe,GAEjGR,EAAKpd,KAAKG,MAAM1G,KAAKmkB,YAAa5hB,EAAMohB,EAAK8E,UAAU9E,EAAKpd,KAAK7K,OAAOsE,KAAKmkB,cAAe,GAChGnkB,KAAKmkB,YAAc5hB,CACvB,CAcA,OAXIvC,KAAK0L,IACL1L,KAAK4nB,aAAejE,EAAK+E,YACpB1oB,KAAKokB,SACVpkB,KAAK4nB,aAAejE,EAAKgF,WAEzB3oB,KAAK4nB,aAAe5nB,KAAKmkB,YAGzBnkB,KAAKqoB,kBAAkBZ,IACvBznB,KAAKqoB,OAAOO,KAAK1oB,UAAUF,KAAK6L,MAAQ7L,KAAK4nB,cAE1CrB,EAAiBrmB,UAAUnE,QAAQuK,KAAKtG,KACnD,EAsBAwnB,EAAM1K,EAAI,SAAuB+L,EAASC,EAAWC,EAAWnB,GAU5D,MAPyB,mBAAdkB,EACPA,EAAYnF,EAAKqF,aAAaF,GAAWjd,KAGpCid,GAAkC,iBAAdA,IACzBA,EAAYnF,EAAKsF,aAAaH,GAAWjd,MAEtC,SAAwB3L,EAAWgpB,GACtCvF,EAAKqF,aAAa9oB,EAAU4M,aACvBsa,IAAI,IAAII,EAAM0B,EAAWL,EAASC,EAAWC,EAAW,CAAE,QAAWnB,IAC9E,CACJ,EAgBAJ,EAAM2B,WAAa,SAAmBC,GAClC3B,EAAO2B,CACX,+BCvXA,IAAIlI,EAAW/lB,EAAOC,QAAU,EAAjB,MAEf8lB,EAASmI,MAAQ,QAoDjBnI,EAASvZ,KAjCT,SAAc7G,EAAU+P,EAAM7P,GAM1B,MALoB,mBAAT6P,GACP7P,EAAW6P,EACXA,EAAO,IAAIqQ,EAASoI,MACZzY,IACRA,EAAO,IAAIqQ,EAASoI,MACjBzY,EAAKlJ,KAAK7G,EAAUE,EAC/B,EA0CAkgB,EAASqI,SANT,SAAkBzoB,EAAU+P,GAGxB,OAFKA,IACDA,EAAO,IAAIqQ,EAASoI,MACjBzY,EAAK0Y,SAASzoB,EACzB,EAKAogB,EAASsI,QAAmB,EAAQ,MACpCtI,EAASuI,QAAmB,EAAQ,MACpCvI,EAASwI,SAAmB,EAAQ,KACpCxI,EAASuC,UAAmB,EAAQ,KAGpCvC,EAASqF,iBAAmB,EAAQ,MACpCrF,EAASuF,UAAmB,EAAQ,MACpCvF,EAASoI,KAAmB,EAAQ,MACpCpI,EAASwC,KAAmB,EAAQ,MACpCxC,EAASuG,KAAmB,EAAQ,MACpCvG,EAASsG,MAAmB,EAAQ,MACpCtG,EAASyI,MAAmB,EAAQ,MACpCzI,EAAS0I,SAAmB,EAAQ,MACpC1I,EAAS2I,QAAmB,EAAQ,MACpC3I,EAAS4I,OAAmB,EAAQ,MAGpC5I,EAAS6I,QAAmB,EAAQ,MACpC7I,EAAS8I,SAAmB,EAAQ,MAGpC9I,EAAS0E,MAAmB,EAAQ,KACpC1E,EAASyC,KAAmB,EAAQ,MAGpCzC,EAASqF,iBAAiB4C,WAAWjI,EAASoI,MAC9CpI,EAASuF,UAAU0C,WAAWjI,EAASuG,KAAMvG,EAAS2I,QAAS3I,EAASwC,MACxExC,EAASoI,KAAKH,WAAWjI,EAASuG,MAClCvG,EAASsG,MAAM2B,WAAWjI,EAASuG,mCCtGnC,IAAIvG,EAAW9lB,EA2Bf,SAAS6uB,IACL/I,EAASyC,KAAKwF,aACdjI,EAASgJ,OAAOf,WAAWjI,EAASiJ,cACpCjJ,EAASkJ,OAAOjB,WAAWjI,EAASmJ,aACxC,CAvBAnJ,EAASmI,MAAQ,UAGjBnI,EAASgJ,OAAe,EAAQ,MAChChJ,EAASiJ,aAAe,EAAQ,KAChCjJ,EAASkJ,OAAe,EAAQ,MAChClJ,EAASmJ,aAAe,EAAQ,MAGhCnJ,EAASyC,KAAe,EAAQ,MAChCzC,EAASoJ,IAAe,EAAQ,MAChCpJ,EAASqJ,MAAe,EAAQ,MAChCrJ,EAAS+I,UAAeA,EAcxBA,iCClCA,IAAI/I,EAAW/lB,EAAOC,QAAU,EAAjB,MAEf8lB,EAASmI,MAAQ,OAGjBnI,EAASsJ,SAAmB,EAAQ,KACpCtJ,EAAS9D,MAAmB,EAAQ,MACpC8D,EAASN,OAAmB,EAAQ,MAGpCM,EAASoI,KAAKH,WAAWjI,EAASuG,KAAMvG,EAAS9D,MAAO8D,EAASN,qCCVjEzlB,EAAOC,QAAUwuB,EAGjB,IAAIpC,EAAQ,EAAQ,QAClBoC,EAAS1pB,UAAYpB,OAAO2N,OAAO+a,EAAMtnB,YAAY4M,YAAc8c,GAAUpD,UAAY,WAE3F,IAAIZ,EAAU,EAAQ,KAClBjC,EAAU,EAAQ,MActB,SAASiG,EAAS/d,EAAMyV,EAAIO,EAAS3Z,EAAMnH,EAAS2lB,GAIhD,GAHAc,EAAMlhB,KAAKtG,KAAM6L,EAAMyV,EAAIpZ,OAAMnK,OAAWA,EAAWgD,EAAS2lB,IAG3D/C,EAAK/M,SAASiL,GACf,MAAMvV,UAAU,4BAMpBtM,KAAK6hB,QAAUA,EAMf7hB,KAAKyqB,gBAAkB,KAGvBzqB,KAAK0L,KAAM,CACf,CAuBAke,EAAS9C,SAAW,SAAkBjb,EAAMkV,GACxC,OAAO,IAAI6I,EAAS/d,EAAMkV,EAAKO,GAAIP,EAAKc,QAASd,EAAK7Y,KAAM6Y,EAAKhgB,QAASggB,EAAK2F,QACnF,EAOAkD,EAAS1pB,UAAU8mB,OAAS,SAAgBC,GACxC,IAAIC,IAAeD,GAAgBE,QAAQF,EAAcC,cACzD,OAAOvD,EAAKiB,SAAS,CACjB,UAAY5kB,KAAK6hB,QACjB,OAAY7hB,KAAKkI,KACjB,KAAYlI,KAAKshB,GACjB,SAAYthB,KAAK0K,OACjB,UAAY1K,KAAKe,QACjB,UAAYmmB,EAAelnB,KAAK0mB,aAAU3oB,GAElD,EAKA6rB,EAAS1pB,UAAUnE,QAAU,WACzB,GAAIiE,KAAKooB,SACL,OAAOpoB,KAGX,QAAmCjC,IAA/B6nB,EAAMQ,OAAOpmB,KAAK6hB,SAClB,MAAM7jB,MAAM,qBAAuBgC,KAAK6hB,SAE5C,OAAO2F,EAAMtnB,UAAUnE,QAAQuK,KAAKtG,KACxC,EAYA4pB,EAAS9M,EAAI,SAA0B+L,EAAS6B,EAAcC,GAU1D,MAP8B,mBAAnBA,EACPA,EAAiBhH,EAAKqF,aAAa2B,GAAgB9e,KAG9C8e,GAA4C,iBAAnBA,IAC9BA,EAAiBhH,EAAKsF,aAAa0B,GAAgB9e,MAEhD,SAA2B3L,EAAWgpB,GACzCvF,EAAKqF,aAAa9oB,EAAU4M,aACvBsa,IAAI,IAAIwC,EAASV,EAAWL,EAAS6B,EAAcC,GAC5D,CACJ,+BC5HAxvB,EAAOC,QAAU2uB,EAEjB,IAAIpG,EAAO,EAAQ,MASnB,SAASoG,EAAQa,GAEb,GAAIA,EACA,IAAK,IAAI7rB,EAAOD,OAAOC,KAAK6rB,GAAahuB,EAAI,EAAGA,EAAImC,EAAKrD,SAAUkB,EAC/DoD,KAAKjB,EAAKnC,IAAMguB,EAAW7rB,EAAKnC,GAC5C,CAyBAmtB,EAAQtd,OAAS,SAAgBme,GAC7B,OAAO5qB,KAAK6qB,MAAMpe,OAAOme,EAC7B,EAUAb,EAAQltB,OAAS,SAAgB4M,EAASqhB,GACtC,OAAO9qB,KAAK6qB,MAAMhuB,OAAO4M,EAASqhB,EACtC,EAUAf,EAAQgB,gBAAkB,SAAyBthB,EAASqhB,GACxD,OAAO9qB,KAAK6qB,MAAME,gBAAgBthB,EAASqhB,EAC/C,EAWAf,EAAQnsB,OAAS,SAAgBotB,GAC7B,OAAOhrB,KAAK6qB,MAAMjtB,OAAOotB,EAC7B,EAWAjB,EAAQkB,gBAAkB,SAAyBD,GAC/C,OAAOhrB,KAAK6qB,MAAMI,gBAAgBD,EACtC,EASAjB,EAAQmB,OAAS,SAAgBzhB,GAC7B,OAAOzJ,KAAK6qB,MAAMK,OAAOzhB,EAC7B,EASAsgB,EAAQvF,WAAa,SAAoBhJ,GACrC,OAAOxb,KAAK6qB,MAAMrG,WAAWhJ,EACjC,EAUAuO,EAAQnF,SAAW,SAAkBnb,EAAS1I,GAC1C,OAAOf,KAAK6qB,MAAMjG,SAASnb,EAAS1I,EACxC,EAMAgpB,EAAQ7pB,UAAU8mB,OAAS,WACvB,OAAOhnB,KAAK6qB,MAAMjG,SAAS5kB,KAAM2jB,EAAKsD,cAC1C,+BCvIA9rB,EAAOC,QAAU0uB,EAGjB,IAAIvD,EAAmB,EAAQ,QAC7BuD,EAAO5pB,UAAYpB,OAAO2N,OAAO8Z,EAAiBrmB,YAAY4M,YAAcgd,GAAQtD,UAAY,SAElG,IAAI7C,EAAO,EAAQ,MAiBnB,SAASmG,EAAOje,EAAM3D,EAAMijB,EAAatpB,EAAcupB,EAAeC,EAAgBtqB,EAAS2lB,EAAS4E,GAYpG,GATI3H,EAAKgE,SAASyD,IACdrqB,EAAUqqB,EACVA,EAAgBC,OAAiBttB,GAC1B4lB,EAAKgE,SAAS0D,KACrBtqB,EAAUsqB,EACVA,OAAiBttB,QAINA,IAATmK,IAAsByb,EAAK/M,SAAS1O,GACtC,MAAMoE,UAAU,yBAGpB,IAAKqX,EAAK/M,SAASuU,GACf,MAAM7e,UAAU,gCAGpB,IAAKqX,EAAK/M,SAAS/U,GACf,MAAMyK,UAAU,iCAEpBia,EAAiBjgB,KAAKtG,KAAM6L,EAAM9K,GAMlCf,KAAKkI,KAAOA,GAAQ,MAMpBlI,KAAKmrB,YAAcA,EAMnBnrB,KAAKorB,gBAAgBA,QAAuBrtB,EAM5CiC,KAAK6B,aAAeA,EAMpB7B,KAAKqrB,iBAAiBA,QAAwBttB,EAM9CiC,KAAKurB,oBAAsB,KAM3BvrB,KAAKwrB,qBAAuB,KAM5BxrB,KAAK0mB,QAAUA,EAKf1mB,KAAKsrB,cAAgBA,CACzB,CAsBAxB,EAAOhD,SAAW,SAAkBjb,EAAMkV,GACtC,OAAO,IAAI+I,EAAOje,EAAMkV,EAAK7Y,KAAM6Y,EAAKoK,YAAapK,EAAKlf,aAAckf,EAAKqK,cAAerK,EAAKsK,eAAgBtK,EAAKhgB,QAASggB,EAAK2F,QAAS3F,EAAKuK,cACtJ,EAOAxB,EAAO5pB,UAAU8mB,OAAS,SAAgBC,GACtC,IAAIC,IAAeD,GAAgBE,QAAQF,EAAcC,cACzD,OAAOvD,EAAKiB,SAAS,CACjB,OAAiC,QAAd5kB,KAAKkI,MAA6ClI,KAAKkI,WAAQnK,EAClF,cAAmBiC,KAAKmrB,YACxB,gBAAmBnrB,KAAKorB,cACxB,eAAmBprB,KAAK6B,aACxB,iBAAmB7B,KAAKqrB,eACxB,UAAmBrrB,KAAKe,QACxB,UAAmBmmB,EAAelnB,KAAK0mB,aAAU3oB,EACjD,gBAAmBiC,KAAKsrB,eAEhC,EAKAxB,EAAO5pB,UAAUnE,QAAU,WAGvB,OAAIiE,KAAKooB,SACEpoB,MAEXA,KAAKurB,oBAAsBvrB,KAAKqoB,OAAOoD,WAAWzrB,KAAKmrB,aACvDnrB,KAAKwrB,qBAAuBxrB,KAAKqoB,OAAOoD,WAAWzrB,KAAK6B,cAEjD0kB,EAAiBrmB,UAAUnE,QAAQuK,KAAKtG,MACnD,+BC9JA7E,EAAOC,QAAUqrB,EAGjB,IAAIF,EAAmB,EAAQ,QAC7BE,EAAUvmB,UAAYpB,OAAO2N,OAAO8Z,EAAiBrmB,YAAY4M,YAAc2Z,GAAWD,UAAY,YAExG,IAIIiB,EACAoC,EACAnG,EANA8D,EAAW,EAAQ,MACnB7D,EAAW,EAAQ,MACnBgG,EAAW,EAAQ,MAoCvB,SAAS+B,EAAY7W,EAAOoS,GACxB,GAAMpS,GAASA,EAAMnZ,OAArB,CAGA,IADA,IAAIyQ,EAAM,CAAC,EACFvP,EAAI,EAAGA,EAAIiY,EAAMnZ,SAAUkB,EAChCuP,EAAI0I,EAAMjY,GAAGiP,MAAQgJ,EAAMjY,GAAGoqB,OAAOC,GACzC,OAAO9a,CAJa,CAKxB,CA2CA,SAASsa,EAAU5a,EAAM9K,GACrBwlB,EAAiBjgB,KAAKtG,KAAM6L,EAAM9K,GAMlCf,KAAKghB,YAASjjB,EAOdiC,KAAK2rB,aAAe,IACxB,CAEA,SAASC,EAAW7kB,GAEhB,OADAA,EAAU4kB,aAAe,KAClB5kB,CACX,CAjFA0f,EAAUK,SAAW,SAAkBjb,EAAMkV,GACzC,OAAO,IAAI0F,EAAU5a,EAAMkV,EAAKhgB,SAAS8qB,QAAQ9K,EAAKC,OAC1D,EAkBAyF,EAAUiF,YAAcA,EAQxBjF,EAAUY,aAAe,SAAsBR,EAAUvF,GACrD,GAAIuF,EACA,IAAK,IAAIjqB,EAAI,EAAGA,EAAIiqB,EAASnrB,SAAUkB,EACnC,GAA2B,iBAAhBiqB,EAASjqB,IAAmBiqB,EAASjqB,GAAG,IAAM0kB,GAAMuF,EAASjqB,GAAG,GAAK0kB,EAC5E,OAAO,EACnB,OAAO,CACX,EAQAmF,EAAUa,eAAiB,SAAwBT,EAAUhb,GACzD,GAAIgb,EACA,IAAK,IAAIjqB,EAAI,EAAGA,EAAIiqB,EAASnrB,SAAUkB,EACnC,GAAIiqB,EAASjqB,KAAOiP,EAChB,OAAO,EACnB,OAAO,CACX,EAyCA/M,OAAO6L,eAAe8b,EAAUvmB,UAAW,cAAe,CACtD4K,IAAK,WACD,OAAO9K,KAAK2rB,eAAiB3rB,KAAK2rB,aAAehI,EAAKmI,QAAQ9rB,KAAKghB,QACvE,IA2BJyF,EAAUvmB,UAAU8mB,OAAS,SAAgBC,GACzC,OAAOtD,EAAKiB,SAAS,CACjB,UAAY5kB,KAAKe,QACjB,SAAY2qB,EAAY1rB,KAAK+rB,YAAa9E,IAElD,EAOAR,EAAUvmB,UAAU2rB,QAAU,SAAiBG,GAG3C,GAAIA,EACA,IAAK,IAA4ChL,EAAxCvV,EAAQ3M,OAAOC,KAAKitB,GAAapvB,EAAI,EAAWA,EAAI6O,EAAM/P,SAAUkB,EACzEokB,EAASgL,EAAWvgB,EAAM7O,IAJzBoD,KAKEonB,UACqBrpB,IAAlBijB,EAAOI,OACPqG,EAAKX,cACa/oB,IAAlBijB,EAAOyB,OACPiB,EAAKoD,cACc/oB,IAAnBijB,EAAOxL,QACPqU,EAAQ/C,cACM/oB,IAAdijB,EAAOM,GACPkG,EAAMV,SACNL,EAAUK,UAAWrb,EAAM7O,GAAIokB,IAI7C,OAAOhhB,IACX,EAOAymB,EAAUvmB,UAAU4K,IAAM,SAAae,GACnC,OAAO7L,KAAKghB,QAAUhhB,KAAKghB,OAAOnV,IAC3B,IACX,EASA4a,EAAUvmB,UAAU+rB,QAAU,SAAiBpgB,GAC3C,GAAI7L,KAAKghB,QAAUhhB,KAAKghB,OAAOnV,aAAiB6X,EAC5C,OAAO1jB,KAAKghB,OAAOnV,GAAM4W,OAC7B,MAAMzkB,MAAM,iBAAmB6N,EACnC,EASA4a,EAAUvmB,UAAUknB,IAAM,SAAa5L,GAEnC,KAAMA,aAAkBgM,QAA2BzpB,IAAlByd,EAAO9Q,QAAwB8Q,aAAkBiM,GAASjM,aAAkBmO,GAASnO,aAAkBkI,GAAQlI,aAAkBqO,GAAWrO,aAAkBiL,GAC3L,MAAMna,UAAU,wCAEpB,GAAKtM,KAAKghB,OAEL,CACD,IAAI5W,EAAOpK,KAAK8K,IAAI0Q,EAAO3P,MAC3B,GAAIzB,EAAM,CACN,KAAIA,aAAgBqc,GAAajL,aAAkBiL,IAAerc,aAAgBqd,GAAQrd,aAAgByf,EAWtG,MAAM7rB,MAAM,mBAAqBwd,EAAO3P,KAAO,QAAU7L,MARzD,IADA,IAAIghB,EAAS5W,EAAK2hB,YACTnvB,EAAI,EAAGA,EAAIokB,EAAOtlB,SAAUkB,EACjC4e,EAAO4L,IAAIpG,EAAOpkB,IACtBoD,KAAK0N,OAAOtD,GACPpK,KAAKghB,SACNhhB,KAAKghB,OAAS,CAAC,GACnBxF,EAAO0Q,WAAW9hB,EAAKrJ,SAAS,EAIxC,CACJ,MAjBIf,KAAKghB,OAAS,CAAC,EAoBnB,OAFAhhB,KAAKghB,OAAOxF,EAAO3P,MAAQ2P,EAC3BA,EAAO2Q,MAAMnsB,MACN4rB,EAAW5rB,KACtB,EASAymB,EAAUvmB,UAAUwN,OAAS,SAAgB8N,GAEzC,KAAMA,aAAkB+K,GACpB,MAAMja,UAAU,qCACpB,GAAIkP,EAAO6M,SAAWroB,KAClB,MAAMhC,MAAMwd,EAAS,uBAAyBxb,MAOlD,cALOA,KAAKghB,OAAOxF,EAAO3P,MACrB/M,OAAOC,KAAKiB,KAAKghB,QAAQtlB,SAC1BsE,KAAKghB,YAASjjB,GAElByd,EAAO4Q,SAASpsB,MACT4rB,EAAW5rB,KACtB,EAQAymB,EAAUvmB,UAAUmsB,OAAS,SAAgB9mB,EAAMwb,GAE/C,GAAI4C,EAAK/M,SAASrR,GACdA,EAAOA,EAAKG,MAAM,UACjB,IAAKlK,MAAM+Y,QAAQhP,GACpB,MAAM+G,UAAU,gBACpB,GAAI/G,GAAQA,EAAK7J,QAAsB,KAAZ6J,EAAK,GAC5B,MAAMvH,MAAM,yBAGhB,IADA,IAAIsuB,EAAMtsB,KACHuF,EAAK7J,OAAS,GAAG,CACpB,IAAI6wB,EAAOhnB,EAAKM,QAChB,GAAIymB,EAAItL,QAAUsL,EAAItL,OAAOuL,IAEzB,MADAD,EAAMA,EAAItL,OAAOuL,cACI9F,GACjB,MAAMzoB,MAAM,kDAEhBsuB,EAAIlF,IAAIkF,EAAM,IAAI7F,EAAU8F,GACpC,CAGA,OAFIxL,GACAuL,EAAIT,QAAQ9K,GACTuL,CACX,EAMA7F,EAAUvmB,UAAUssB,WAAa,WAE7B,IADA,IAAIxL,EAAShhB,KAAK+rB,YAAanvB,EAAI,EAC5BA,EAAIokB,EAAOtlB,QACVslB,EAAOpkB,aAAc6pB,EACrBzF,EAAOpkB,KAAK4vB,aAEZxL,EAAOpkB,KAAKb,UACpB,OAAOiE,KAAKjE,SAChB,EASA0qB,EAAUvmB,UAAUusB,OAAS,SAAgBlnB,EAAMmnB,EAAaC,GAS5D,GAN2B,kBAAhBD,GACPC,EAAuBD,EACvBA,OAAc3uB,GACP2uB,IAAgBlxB,MAAM+Y,QAAQmY,KACrCA,EAAc,CAAEA,IAEhB/I,EAAK/M,SAASrR,IAASA,EAAK7J,OAAQ,CACpC,GAAa,MAAT6J,EACA,OAAOvF,KAAK6Q,KAChBtL,EAAOA,EAAKG,MAAM,IACtB,MAAO,IAAKH,EAAK7J,OACb,OAAOsE,KAGX,GAAgB,KAAZuF,EAAK,GACL,OAAOvF,KAAK6Q,KAAK4b,OAAOlnB,EAAK9H,MAAM,GAAIivB,GAG3C,IAAIE,EAAQ5sB,KAAK8K,IAAIvF,EAAK,IAC1B,GAAIqnB,GACA,GAAoB,IAAhBrnB,EAAK7J,QACL,IAAKgxB,GAAeA,EAAY7Z,QAAQ+Z,EAAM9f,cAAgB,EAC1D,OAAO8f,OACR,GAAIA,aAAiBnG,IAAcmG,EAAQA,EAAMH,OAAOlnB,EAAK9H,MAAM,GAAIivB,GAAa,IACvF,OAAOE,OAIX,IAAK,IAAIhwB,EAAI,EAAGA,EAAIoD,KAAK+rB,YAAYrwB,SAAUkB,EAC3C,GAAIoD,KAAK2rB,aAAa/uB,aAAc6pB,IAAcmG,EAAQ5sB,KAAK2rB,aAAa/uB,GAAG6vB,OAAOlnB,EAAMmnB,GAAa,IACrG,OAAOE,EAGnB,OAAoB,OAAhB5sB,KAAKqoB,QAAmBsE,EACjB,KACJ3sB,KAAKqoB,OAAOoE,OAAOlnB,EAAMmnB,EACpC,EAoBAjG,EAAUvmB,UAAUurB,WAAa,SAAoBlmB,GACjD,IAAIqnB,EAAQ5sB,KAAKysB,OAAOlnB,EAAM,CAAEkiB,IAChC,IAAKmF,EACD,MAAM5uB,MAAM,iBAAmBuH,GACnC,OAAOqnB,CACX,EASAnG,EAAUvmB,UAAU2sB,WAAa,SAAoBtnB,GACjD,IAAIqnB,EAAQ5sB,KAAKysB,OAAOlnB,EAAM,CAAEme,IAChC,IAAKkJ,EACD,MAAM5uB,MAAM,iBAAmBuH,EAAO,QAAUvF,MACpD,OAAO4sB,CACX,EASAnG,EAAUvmB,UAAUooB,iBAAmB,SAA0B/iB,GAC7D,IAAIqnB,EAAQ5sB,KAAKysB,OAAOlnB,EAAM,CAAEkiB,EAAM/D,IACtC,IAAKkJ,EACD,MAAM5uB,MAAM,yBAA2BuH,EAAO,QAAUvF,MAC5D,OAAO4sB,CACX,EASAnG,EAAUvmB,UAAU4sB,cAAgB,SAAuBvnB,GACvD,IAAIqnB,EAAQ5sB,KAAKysB,OAAOlnB,EAAM,CAAEskB,IAChC,IAAK+C,EACD,MAAM5uB,MAAM,oBAAsBuH,EAAO,QAAUvF,MACvD,OAAO4sB,CACX,EAGAnG,EAAU0C,WAAa,SAASC,EAAO2D,EAAUC,GAC7CvF,EAAU2B,EACVS,EAAUkD,EACVrJ,EAAUsJ,CACd,+BC/aA7xB,EAAOC,QAAUmrB,EAEjBA,EAAiBC,UAAY,mBAE7B,IAEI8C,EAFA3F,EAAO,EAAQ,MAYnB,SAAS4C,EAAiB1a,EAAM9K,GAE5B,IAAK4iB,EAAK/M,SAAS/K,GACf,MAAMS,UAAU,yBAEpB,GAAIvL,IAAY4iB,EAAKgE,SAAS5mB,GAC1B,MAAMuL,UAAU,6BAMpBtM,KAAKe,QAAUA,EAMff,KAAKsrB,cAAgB,KAMrBtrB,KAAK6L,KAAOA,EAMZ7L,KAAKqoB,OAAS,KAMdroB,KAAKooB,UAAW,EAMhBpoB,KAAK0mB,QAAU,KAMf1mB,KAAKc,SAAW,IACpB,CAEAhC,OAAOmuB,iBAAiB1G,EAAiBrmB,UAAW,CAQhD2Q,KAAM,CACF/F,IAAK,WAED,IADA,IAAIwhB,EAAMtsB,KACY,OAAfssB,EAAIjE,QACPiE,EAAMA,EAAIjE,OACd,OAAOiE,CACX,GASJjI,SAAU,CACNvZ,IAAK,WAGD,IAFA,IAAIvF,EAAO,CAAEvF,KAAK6L,MACdygB,EAAMtsB,KAAKqoB,OACRiE,GACH/mB,EAAK+E,QAAQgiB,EAAIzgB,MACjBygB,EAAMA,EAAIjE,OAEd,OAAO9iB,EAAK7H,KAAK,IACrB,KASR6oB,EAAiBrmB,UAAU8mB,OAAoC,WAC3D,MAAMhpB,OACV,EAOAuoB,EAAiBrmB,UAAUisB,MAAQ,SAAe9D,GAC1CroB,KAAKqoB,QAAUroB,KAAKqoB,SAAWA,GAC/BroB,KAAKqoB,OAAO3a,OAAO1N,MACvBA,KAAKqoB,OAASA,EACdroB,KAAKooB,UAAW,EAChB,IAAIvX,EAAOwX,EAAOxX,KACdA,aAAgByY,GAChBzY,EAAKqc,WAAWltB,KACxB,EAOAumB,EAAiBrmB,UAAUksB,SAAW,SAAkB/D,GACpD,IAAIxX,EAAOwX,EAAOxX,KACdA,aAAgByY,GAChBzY,EAAKsc,cAAcntB,MACvBA,KAAKqoB,OAAS,KACdroB,KAAKooB,UAAW,CACpB,EAMA7B,EAAiBrmB,UAAUnE,QAAU,WACjC,OAAIiE,KAAKooB,UAELpoB,KAAK6Q,gBAAgByY,IACrBtpB,KAAKooB,UAAW,GAFTpoB,IAIf,EAOAumB,EAAiBrmB,UAAU+nB,UAAY,SAAmBpc,GACtD,GAAI7L,KAAKe,QACL,OAAOf,KAAKe,QAAQ8K,EAE5B,EASA0a,EAAiBrmB,UAAUgoB,UAAY,SAAmBrc,EAAMpM,EAAO0oB,GAGnE,OAFKA,GAAanoB,KAAKe,cAAkChD,IAAvBiC,KAAKe,QAAQ8K,MAC1C7L,KAAKe,UAAYf,KAAKe,QAAU,CAAC,IAAI8K,GAAQpM,GAC3CO,IACX,EASAumB,EAAiBrmB,UAAUktB,gBAAkB,SAAyBvhB,EAAMpM,EAAO4tB,GAC1ErtB,KAAKsrB,gBACNtrB,KAAKsrB,cAAgB,IAEzB,IAAIA,EAAgBtrB,KAAKsrB,cACzB,GAAI+B,EAAU,CAGV,IAAIC,EAAMhC,EAAciC,MAAK,SAAUD,GACnC,OAAOxuB,OAAOoB,UAAU0O,eAAetI,KAAKgnB,EAAKzhB,EACrD,IACA,GAAIyhB,EAAK,CAEL,IAAIE,EAAWF,EAAIzhB,GACnB8X,EAAK8J,YAAYD,EAAUH,EAAU5tB,EACzC,MAEI6tB,EAAM,CAAC,GACHzhB,GAAQ8X,EAAK8J,YAAY,CAAC,EAAGJ,EAAU5tB,GAC3C6rB,EAAchuB,KAAKgwB,EAE3B,KAAO,CAEH,IAAII,EAAS,CAAC,EACdA,EAAO7hB,GAAQpM,EACf6rB,EAAchuB,KAAKowB,EACvB,CACA,OAAO1tB,IACX,EAQAumB,EAAiBrmB,UAAUgsB,WAAa,SAAoBnrB,EAASonB,GACjE,GAAIpnB,EACA,IAAK,IAAIhC,EAAOD,OAAOC,KAAKgC,GAAUnE,EAAI,EAAGA,EAAImC,EAAKrD,SAAUkB,EAC5DoD,KAAKkoB,UAAUnpB,EAAKnC,GAAImE,EAAQhC,EAAKnC,IAAKurB,GAClD,OAAOnoB,IACX,EAMAumB,EAAiBrmB,UAAUzB,SAAW,WAClC,IAAI+nB,EAAYxmB,KAAK8M,YAAY0Z,UAC7BnC,EAAYrkB,KAAKqkB,SACrB,OAAIA,EAAS3oB,OACF8qB,EAAY,IAAMnC,EACtBmC,CACX,EAGAD,EAAiB4C,WAAa,SAASwE,GACnCrE,EAAOqE,CACX,+BCjPAxyB,EAAOC,QAAUuuB,EAGjB,IAAIpD,EAAmB,EAAQ,QAC7BoD,EAAMzpB,UAAYpB,OAAO2N,OAAO8Z,EAAiBrmB,YAAY4M,YAAc6c,GAAOnD,UAAY,QAEhG,IAAIgB,EAAQ,EAAQ,MAChB7D,EAAQ,EAAQ,MAYpB,SAASgG,EAAM9d,EAAM+hB,EAAY7sB,EAAS2lB,GAQtC,GAPKlrB,MAAM+Y,QAAQqZ,KACf7sB,EAAU6sB,EACVA,OAAa7vB,GAEjBwoB,EAAiBjgB,KAAKtG,KAAM6L,EAAM9K,QAGbhD,IAAf6vB,IAA4BpyB,MAAM+Y,QAAQqZ,GAC5C,MAAMthB,UAAU,+BAMpBtM,KAAKiiB,MAAQ2L,GAAc,GAO3B5tB,KAAK0kB,YAAc,GAMnB1kB,KAAK0mB,QAAUA,CACnB,CAyCA,SAASmH,EAAkB5L,GACvB,GAAIA,EAAMoG,OACN,IAAK,IAAIzrB,EAAI,EAAGA,EAAIqlB,EAAMyC,YAAYhpB,SAAUkB,EACvCqlB,EAAMyC,YAAY9nB,GAAGyrB,QACtBpG,EAAMoG,OAAOjB,IAAInF,EAAMyC,YAAY9nB,GACnD,CA9BA+sB,EAAM7C,SAAW,SAAkBjb,EAAMkV,GACrC,OAAO,IAAI4I,EAAM9d,EAAMkV,EAAKkB,MAAOlB,EAAKhgB,QAASggB,EAAK2F,QAC1D,EAOAiD,EAAMzpB,UAAU8mB,OAAS,SAAgBC,GACrC,IAAIC,IAAeD,GAAgBE,QAAQF,EAAcC,cACzD,OAAOvD,EAAKiB,SAAS,CACjB,UAAY5kB,KAAKe,QACjB,QAAYf,KAAKiiB,MACjB,UAAYiF,EAAelnB,KAAK0mB,aAAU3oB,GAElD,EAqBA4rB,EAAMzpB,UAAUknB,IAAM,SAAatD,GAG/B,KAAMA,aAAiB0D,GACnB,MAAMlb,UAAU,yBAQpB,OANIwX,EAAMuE,QAAUvE,EAAMuE,SAAWroB,KAAKqoB,QACtCvE,EAAMuE,OAAO3a,OAAOoW,GACxB9jB,KAAKiiB,MAAM3kB,KAAKwmB,EAAMjY,MACtB7L,KAAK0kB,YAAYpnB,KAAKwmB,GACtBA,EAAMoB,OAASllB,KACf6tB,EAAkB7tB,MACXA,IACX,EAOA2pB,EAAMzpB,UAAUwN,OAAS,SAAgBoW,GAGrC,KAAMA,aAAiB0D,GACnB,MAAMlb,UAAU,yBAEpB,IAAI1Q,EAAQoE,KAAK0kB,YAAY7R,QAAQiR,GAGrC,GAAIloB,EAAQ,EACR,MAAMoC,MAAM8lB,EAAQ,uBAAyB9jB,MAUjD,OARAA,KAAK0kB,YAAYnkB,OAAO3E,EAAO,IAC/BA,EAAQoE,KAAKiiB,MAAMpP,QAAQiR,EAAMjY,QAGpB,GACT7L,KAAKiiB,MAAM1hB,OAAO3E,EAAO,GAE7BkoB,EAAMoB,OAAS,KACRllB,IACX,EAKA2pB,EAAMzpB,UAAUisB,MAAQ,SAAe9D,GACnC9B,EAAiBrmB,UAAUisB,MAAM7lB,KAAKtG,KAAMqoB,GAG5C,IAFA,IAESzrB,EAAI,EAAGA,EAAIoD,KAAKiiB,MAAMvmB,SAAUkB,EAAG,CACxC,IAAIknB,EAAQuE,EAAOvd,IAAI9K,KAAKiiB,MAAMrlB,IAC9BknB,IAAUA,EAAMoB,SAChBpB,EAAMoB,OALHllB,UAME0kB,YAAYpnB,KAAKwmB,GAE9B,CAEA+J,EAAkB7tB,KACtB,EAKA2pB,EAAMzpB,UAAUksB,SAAW,SAAkB/D,GACzC,IAAK,IAAWvE,EAAPlnB,EAAI,EAAUA,EAAIoD,KAAK0kB,YAAYhpB,SAAUkB,GAC7CknB,EAAQ9jB,KAAK0kB,YAAY9nB,IAAIyrB,QAC9BvE,EAAMuE,OAAO3a,OAAOoW,GAC5ByC,EAAiBrmB,UAAUksB,SAAS9lB,KAAKtG,KAAMqoB,EACnD,EAkBAsB,EAAM7M,EAAI,WAGN,IAFA,IAAI8Q,EAAa,IAAIpyB,MAAMC,UAAUC,QACjCE,EAAQ,EACLA,EAAQH,UAAUC,QACrBkyB,EAAWhyB,GAASH,UAAUG,KAClC,OAAO,SAAwBsE,EAAW4tB,GACtCnK,EAAKqF,aAAa9oB,EAAU4M,aACvBsa,IAAI,IAAIuC,EAAMmE,EAAWF,IAC9B9uB,OAAO6L,eAAezK,EAAW4tB,EAAW,CACxChjB,IAAK6Y,EAAKoK,YAAYH,GACtB7iB,IAAK4Y,EAAKqK,YAAYJ,IAE9B,CACJ,+BCzMAzyB,EAAOC,QAAUgiB,EAEjBA,EAAMtc,SAAW,KACjBsc,EAAMyI,SAAW,CAAEoI,UAAU,GAE7B,IAAIzD,EAAY,EAAQ,KACpBlB,EAAY,EAAQ,MACpB7B,EAAY,EAAQ,MACpBD,EAAY,EAAQ,MACpBoC,EAAY,EAAQ,MACpBD,EAAY,EAAQ,MACpBjG,EAAY,EAAQ,MACpBmG,EAAY,EAAQ,MACpBC,EAAY,EAAQ,MACpBlE,EAAY,EAAQ,KACpBjC,EAAY,EAAQ,MAEpBuK,EAAc,gBACdC,EAAc,kBACdC,EAAc,qBACdC,EAAc,uBACdC,EAAc,YACdC,EAAc,cACdC,EAAc,oDACdC,EAAc,2BACdC,EAAc,+DACdC,EAAc,kCAmClB,SAASvR,EAAM5e,EAAQqS,EAAM9P,GAEnB8P,aAAgByY,IAClBvoB,EAAU8P,EACVA,EAAO,IAAIyY,GAEVvoB,IACDA,EAAUqc,EAAMyI,UAEpB,IASI+I,EACAC,EACAC,EACAC,EA+tBAC,EA3uBAC,EAAwBluB,EAAQkuB,wBAAyB,EACzDC,EAAK1E,EAAShsB,EAAQuC,EAAQouB,uBAAwB,GACtDjhB,EAAOghB,EAAGhhB,KACV5Q,EAAO4xB,EAAG5xB,KACV8xB,EAAOF,EAAGE,KACVC,EAAOH,EAAGG,KACVC,EAAOJ,EAAGI,KAEVC,GAAO,EAKPC,GAAW,EAEXlD,EAAMzb,EAEN4e,EAAY1uB,EAAQktB,SAAW,SAASpiB,GAAQ,OAAOA,CAAM,EAAI8X,EAAK+L,UAG1E,SAASC,EAAQX,EAAOnjB,EAAM+jB,GAC1B,IAAI9uB,EAAWsc,EAAMtc,SAGrB,OAFK8uB,IACDxS,EAAMtc,SAAW,MACd9C,MAAM,YAAc6N,GAAQ,SAAW,KAAOmjB,EAAQ,OAASluB,EAAWA,EAAW,KAAO,IAAM,QAAUouB,EAAGW,KAAO,IACjI,CAEA,SAASC,IACL,IACId,EADAvM,EAAS,GAEb,EAAG,CAEC,GAAyB,OAApBuM,EAAQ9gB,MAA8B,MAAV8gB,EAC7B,MAAMW,EAAQX,GAElBvM,EAAOnlB,KAAK4Q,KACZmhB,EAAKL,GACLA,EAAQI,GACZ,OAAmB,MAAVJ,GAA4B,MAAVA,GAC3B,OAAOvM,EAAO/kB,KAAK,GACvB,CAEA,SAASqyB,EAAUC,GACf,IAAIhB,EAAQ9gB,IACZ,OAAQ8gB,GACJ,IAAK,IACL,IAAK,IAED,OADA1xB,EAAK0xB,GACEc,IACX,IAAK,OAAQ,IAAK,OACd,OAAO,EACX,IAAK,QAAS,IAAK,QACf,OAAO,EAEf,IACI,OAwCR,SAAqBd,EAAOY,GACxB,IAAI1sB,EAAO,EAKX,OAJwB,MAApB8rB,EAAMzyB,OAAO,KACb2G,GAAQ,EACR8rB,EAAQA,EAAM3jB,UAAU,IAEpB2jB,GACJ,IAAK,MAAO,IAAK,MAAO,IAAK,MACzB,OAAO9rB,GAAOW,KAClB,IAAK,MAAO,IAAK,MAAO,IAAK,MAAO,IAAK,MACrC,OAAOD,IACX,IAAK,IACD,OAAO,EAEf,GAAIsqB,EAASjwB,KAAK+wB,GACd,OAAO9rB,EAAO4F,SAASkmB,EAAO,IAClC,GAAIZ,EAASnwB,KAAK+wB,GACd,OAAO9rB,EAAO4F,SAASkmB,EAAO,IAClC,GAAIV,EAAQrwB,KAAK+wB,GACb,OAAO9rB,EAAO4F,SAASkmB,EAAO,GAGlC,GAAIR,EAASvwB,KAAK+wB,GACd,OAAO9rB,EAAOia,WAAW6R,GAG7B,MAAMW,EAAQX,EAAO,UAlE8B,EAmEvD,CAnEeiB,CAAYjB,EACvB,CAAE,MAAO1pB,GAGL,GAAI0qB,GAAiBtB,EAAUzwB,KAAK+wB,GAChC,OAAOA,EAGX,MAAMW,EAAQX,EAAO,QACzB,CACJ,CAEA,SAASkB,EAAWC,EAAQC,GACxB,IAAIpB,EAAOjyB,EACX,IACQqzB,GAAuC,OAApBpB,EAAQI,MAA8B,MAAVJ,EAG/CmB,EAAO7yB,KAAK,CAAEP,EAAQszB,EAAQniB,KAASmhB,EAAK,MAAM,GAAQgB,EAAQniB,KAAUnR,IAF5EozB,EAAO7yB,KAAKwyB,WAGXT,EAAK,KAAK,IACnB,IAAIiB,EAAQ,CAACvvB,aAAShD,EACtBuyB,UAAkB,SAASzkB,EAAMpM,QACV1B,IAAjBiC,KAAKe,UAAuBf,KAAKe,QAAU,CAAC,GAChDf,KAAKe,QAAQ8K,GAAQpM,CACvB,GACA8wB,EACID,GACA,SAA0BtB,GAExB,GAAc,WAAVA,EAIF,MAAMW,EAAQX,GAHdwB,GAAYF,EAAOtB,GACnBK,EAAK,IAGT,IACA,WACEoB,GAAmBH,EACrB,GACR,CA+BA,SAASD,EAAQrB,EAAO0B,GACpB,OAAQ1B,GACJ,IAAK,MAAO,IAAK,MAAO,IAAK,MACzB,OAAO,UACX,IAAK,IACD,OAAO,EAIf,IAAK0B,GAAsC,MAApB1B,EAAMzyB,OAAO,GAChC,MAAMozB,EAAQX,EAAO,MAEzB,GAAIb,EAAYlwB,KAAK+wB,GACjB,OAAOlmB,SAASkmB,EAAO,IAC3B,GAAIX,EAAYpwB,KAAK+wB,GACjB,OAAOlmB,SAASkmB,EAAO,IAG3B,GAAIT,EAAWtwB,KAAK+wB,GAChB,OAAOlmB,SAASkmB,EAAO,GAG3B,MAAMW,EAAQX,EAAO,KACzB,CAEA,SAAS2B,IAGL,QAAY5yB,IAAR6wB,EACA,MAAMe,EAAQ,WAKlB,GAHAf,EAAM1gB,KAGDwgB,EAAUzwB,KAAK2wB,GAChB,MAAMe,EAAQf,EAAK,QAEvBtC,EAAMA,EAAID,OAAOuC,GACjBS,EAAK,IACT,CAEA,SAASuB,IACL,IACIC,EADA7B,EAAQI,IAEZ,OAAQJ,GACJ,IAAK,OACD6B,EAAe/B,IAAgBA,EAAc,IAC7C5gB,IACA,MACJ,IAAK,SACDA,IAEJ,QACI2iB,EAAehC,IAAYA,EAAU,IAG7CG,EAAQc,IACRT,EAAK,KACLwB,EAAavzB,KAAK0xB,EACtB,CAEA,SAAS8B,IAML,GALAzB,EAAK,KACLN,EAASe,MACTN,EAAsB,WAAXT,IAGiB,WAAXA,EACb,MAAMY,EAAQZ,EAAQ,UAE1BM,EAAK,IACT,CAEA,SAAS0B,EAAY1I,EAAQ2G,GACzB,OAAQA,GAEJ,IAAK,SAGD,OAFAwB,GAAYnI,EAAQ2G,GACpBK,EAAK,MACE,EAEX,IAAK,UAED,OADA2B,EAAU3I,EAAQ2G,IACX,EAEX,IAAK,OAED,OADAiC,EAAU5I,EAAQ2G,IACX,EAEX,IAAK,UAED,OA2aZ,SAAsB3G,EAAQ2G,GAG1B,IAAKP,EAAOxwB,KAAK+wB,EAAQ9gB,KACrB,MAAMyhB,EAAQX,EAAO,gBAEzB,IAAIkC,EAAU,IAAIrH,EAAQmF,GAC1BuB,EAAQW,GAAS,SAA4BlC,GACzC,IAAI+B,EAAYG,EAASlC,GAAzB,CAIA,GAAc,QAAVA,EAGA,MAAMW,EAAQX,IAK1B,SAAqB3G,EAAQ2G,GAGzB,IAAImC,EAAc7B,IAEdpnB,EAAO8mB,EAGX,IAAKP,EAAOxwB,KAAK+wB,EAAQ9gB,KACrB,MAAMyhB,EAAQX,EAAO,QAEzB,IACI7D,EAAaC,EACbvpB,EAAcwpB,EAFdxf,EAAOmjB,EASX,GALAK,EAAK,KACDA,EAAK,UAAU,KACfjE,GAAgB,IAGfsD,EAAUzwB,KAAK+wB,EAAQ9gB,KACxB,MAAMyhB,EAAQX,GAQlB,GANA7D,EAAc6D,EACdK,EAAK,KAAMA,EAAK,WAAYA,EAAK,KAC7BA,EAAK,UAAU,KACfhE,GAAiB,IAGhBqD,EAAUzwB,KAAK+wB,EAAQ9gB,KACxB,MAAMyhB,EAAQX,GAElBntB,EAAemtB,EACfK,EAAK,KAEL,IAAI1Z,EAAS,IAAImU,EAAOje,EAAM3D,EAAMijB,EAAatpB,EAAcupB,EAAeC,GAC9E1V,EAAO+Q,QAAUyK,EACjBZ,EAAQ5a,GAAQ,SAA2BqZ,GAGvC,GAAc,WAAVA,EAIA,MAAMW,EAAQX,GAHdwB,GAAY7a,EAAQqZ,GACpBK,EAAK,IAIb,IACAhH,EAAOjB,IAAIzR,EACf,CAvDYyb,CAAYF,EAASlC,EAJf,CAOd,IACA3G,EAAOjB,IAAI8J,EACf,CA9bYG,CAAahJ,EAAQ2G,IACd,EAEX,IAAK,SAED,OA6eZ,SAAwB3G,EAAQ2G,GAG5B,IAAKN,EAAUzwB,KAAK+wB,EAAQ9gB,KACxB,MAAMyhB,EAAQX,EAAO,aAEzB,IAAIsC,EAAYtC,EAChBuB,EAAQ,MAAM,SAA8BvB,GACxC,OAAQA,GAEJ,IAAK,WACL,IAAK,WACDuC,EAAWlJ,EAAQ2G,EAAOsC,GAC1B,MAEJ,IAAK,WAGGC,EAAWlJ,EADXmH,EACmB,kBAEA,WAFmB8B,GAI1C,MAEJ,QAEI,IAAK9B,IAAad,EAAUzwB,KAAK+wB,GAC7B,MAAMW,EAAQX,GAClB1xB,EAAK0xB,GACLuC,EAAWlJ,EAAQ,WAAYiJ,GAG3C,GACJ,CA/gBYE,CAAenJ,EAAQ2G,IAChB,EAEf,OAAO,CACX,CAEA,SAASuB,EAAQpkB,EAAKslB,EAAMC,GACxB,IAAIC,EAAezC,EAAGW,KAOtB,GANI1jB,IAC0B,iBAAhBA,EAAIua,UACZva,EAAIua,QAAU4I,KAEhBnjB,EAAIrL,SAAWsc,EAAMtc,UAErBuuB,EAAK,KAAK,GAAO,CAEjB,IADA,IAAIL,EACwB,OAApBA,EAAQ9gB,MACZujB,EAAKzC,GACTK,EAAK,KAAK,EACd,MACQqC,GACAA,IACJrC,EAAK,KACDljB,IAA+B,iBAAhBA,EAAIua,SAAwBuI,KAC3C9iB,EAAIua,QAAU4I,EAAKqC,IAAiBxlB,EAAIua,QAEpD,CAEA,SAASsK,EAAU3I,EAAQ2G,GAGvB,IAAKP,EAAOxwB,KAAK+wB,EAAQ9gB,KACrB,MAAMyhB,EAAQX,EAAO,aAEzB,IAAI9mB,EAAO,IAAIuf,EAAKuH,GACpBuB,EAAQroB,GAAM,SAAyB8mB,GACnC,IAAI+B,EAAY7oB,EAAM8mB,GAGtB,OAAQA,GAEJ,IAAK,OA+JjB,SAAuB3G,GACnBgH,EAAK,KACL,IAAIxN,EAAU3T,IAGd,QAA8BnQ,IAA1B6nB,EAAMQ,OAAOvE,GACb,MAAM8N,EAAQ9N,EAAS,QAE3BwN,EAAK,KACL,IAAIuC,EAAY1jB,IAGhB,IAAKwgB,EAAUzwB,KAAK2zB,GAChB,MAAMjC,EAAQiC,EAAW,QAE7BvC,EAAK,KACL,IAAIxjB,EAAOqC,IAGX,IAAKugB,EAAOxwB,KAAK4N,GACb,MAAM8jB,EAAQ9jB,EAAM,QAExBwjB,EAAK,KACL,IAAIvL,EAAQ,IAAI8F,EAAS6F,EAAU5jB,GAAOwkB,EAAQniB,KAAS2T,EAAS+P,GACpErB,EAAQzM,GAAO,SAA6BkL,GAGxC,GAAc,WAAVA,EAIA,MAAMW,EAAQX,GAHdwB,GAAY1M,EAAOkL,GACnBK,EAAK,IAIb,IAAG,WACCoB,GAAmB3M,EACvB,IACAuE,EAAOjB,IAAItD,EACf,CAnMgB+N,CAAc3pB,GACd,MAEJ,IAAK,WACL,IAAK,WACDqpB,EAAWrpB,EAAM8mB,GACjB,MAEJ,IAAK,WAGGuC,EAAWrpB,EADXsnB,EACiB,kBAEA,YAErB,MAEJ,IAAK,SAoLjB,SAAoBnH,EAAQ2G,GAGxB,IAAKP,EAAOxwB,KAAK+wB,EAAQ9gB,KACrB,MAAMyhB,EAAQX,EAAO,QAEzB,IAAI/M,EAAQ,IAAI0H,EAAM8F,EAAUT,IAChCuB,EAAQtO,GAAO,SAA0B+M,GACvB,WAAVA,GACAwB,GAAYvO,EAAO+M,GACnBK,EAAK,OAEL/xB,EAAK0xB,GACLuC,EAAWtP,EAAO,YAE1B,IACAoG,EAAOjB,IAAInF,EACf,CApMgB6P,CAAW5pB,EAAM8mB,GACjB,MAEJ,IAAK,aACDkB,EAAWhoB,EAAK6pB,aAAe7pB,EAAK6pB,WAAa,KACjD,MAEJ,IAAK,WACD7B,EAAWhoB,EAAK2e,WAAa3e,EAAK2e,SAAW,KAAK,GAClD,MAEJ,QAEI,IAAK2I,IAAad,EAAUzwB,KAAK+wB,GAC7B,MAAMW,EAAQX,GAElB1xB,EAAK0xB,GACLuC,EAAWrpB,EAAM,YAG7B,IACAmgB,EAAOjB,IAAIlf,EACf,CAEA,SAASqpB,EAAWlJ,EAAQzF,EAAMlY,GAC9B,IAAIxC,EAAOgG,IACX,GAAa,UAAThG,EAAJ,CAWA,KAAOA,EAAK8pB,SAAS,MAAQ5C,IAAO6C,WAAW,MAC3C/pB,GAAQgG,IAIZ,IAAKwgB,EAAUzwB,KAAKiK,GAChB,MAAMynB,EAAQznB,EAAM,QAExB,IAAI2D,EAAOqC,IAGX,IAAKugB,EAAOxwB,KAAK4N,GACb,MAAM8jB,EAAQ9jB,EAAM,QAExBA,EAAO4jB,EAAU5jB,GACjBwjB,EAAK,KAEL,IAAIvL,EAAQ,IAAI0D,EAAM3b,EAAMwkB,EAAQniB,KAAShG,EAAM0a,EAAMlY,GAczD,GAbA6lB,EAAQzM,GAAO,SAA0BkL,GAGrC,GAAc,WAAVA,EAIA,MAAMW,EAAQX,GAHdwB,GAAY1M,EAAOkL,GACnBK,EAAK,IAIb,IAAG,WACCoB,GAAmB3M,EACvB,IAEa,oBAATlB,EAA4B,CAE5B,IAAIX,EAAQ,IAAI0H,EAAM,IAAM9d,GAC5BiY,EAAMoE,UAAU,mBAAmB,GACnCjG,EAAMmF,IAAItD,GACVuE,EAAOjB,IAAInF,EACf,MACIoG,EAAOjB,IAAItD,GAMV0L,IAAY1L,EAAMM,eAAoCrmB,IAAvB6nB,EAAMG,OAAO7d,SAA6CnK,IAAtB6nB,EAAME,MAAM5d,IAChF4b,EAAMoE,UAAU,UAAU,GAAsB,EArDpD,MAwDJ,SAAoBG,EAAQzF,GACxB,IAAI/W,EAAOqC,IAGX,IAAKugB,EAAOxwB,KAAK4N,GACb,MAAM8jB,EAAQ9jB,EAAM,QAExB,IAAIqd,EAAYvF,EAAKuO,QAAQrmB,GACzBA,IAASqd,IACTrd,EAAO8X,EAAKwO,QAAQtmB,IACxBwjB,EAAK,KACL,IAAI/N,EAAK+O,EAAQniB,KACbhG,EAAO,IAAIuf,EAAK5b,GACpB3D,EAAKyd,OAAQ,EACb,IAAI7B,EAAQ,IAAI0D,EAAM0B,EAAW5H,EAAIzV,EAAM+W,GAC3CkB,EAAMhjB,SAAWsc,EAAMtc,SACvByvB,EAAQroB,GAAM,SAA0B8mB,GACpC,OAAQA,GAEJ,IAAK,SACDwB,GAAYtoB,EAAM8mB,GAClBK,EAAK,KACL,MAEJ,IAAK,WACL,IAAK,WACDkC,EAAWrpB,EAAM8mB,GACjB,MAEJ,IAAK,WAGGuC,EAAWrpB,EADXsnB,EACiB,kBAEA,YAErB,MAEJ,IAAK,UACDwB,EAAU9oB,EAAM8mB,GAChB,MAEJ,IAAK,OACDiC,EAAU/oB,EAAM8mB,GAChB,MAGJ,QACI,MAAMW,EAAQX,GAE1B,IACA3G,EAAOjB,IAAIlf,GACJkf,IAAItD,EACf,CA/GQsO,CAAW/J,EAAQzF,EAwD3B,CAmHA,SAASqO,EAAU5I,EAAQ2G,GAGvB,IAAKP,EAAOxwB,KAAK+wB,EAAQ9gB,KACrB,MAAMyhB,EAAQX,EAAO,QAEzB,IAAIjI,EAAM,IAAIrD,EAAKsL,GACnBuB,EAAQxJ,GAAK,SAAyBiI,GACpC,OAAOA,GACL,IAAK,SACHwB,GAAYzJ,EAAKiI,GACjBK,EAAK,KACL,MAEF,IAAK,WACHa,EAAWnJ,EAAIF,WAAaE,EAAIF,SAAW,KAAK,GAChD,MAEF,SAOR,SAAwBwB,EAAQ2G,GAG5B,IAAKP,EAAOxwB,KAAK+wB,GACb,MAAMW,EAAQX,EAAO,QAEzBK,EAAK,KACL,IAAI5vB,EAAQ4wB,EAAQniB,KAAQ,GACxBoiB,EAAQ,CACJvvB,aAAShD,EAEjBuyB,UAAkB,SAASzkB,EAAMpM,QACR1B,IAAjBiC,KAAKe,UACLf,KAAKe,QAAU,CAAC,GACpBf,KAAKe,QAAQ8K,GAAQpM,CACzB,GACA8wB,EAAQD,GAAO,SAA8BtB,GAGzC,GAAc,WAAVA,EAIA,MAAMW,EAAQX,GAHdwB,GAAYF,EAAOtB,GACnBK,EAAK,IAIb,IAAG,WACCoB,GAAmBH,EACvB,IACAjI,EAAOjB,IAAI4H,EAAOvvB,EAAO6wB,EAAM5J,QAAS4J,EAAMvvB,QAClD,CAnCUsxB,CAAetL,EAAKiI,GAE1B,IACA3G,EAAOjB,IAAIL,EACf,CAiCA,SAASyJ,GAAYnI,EAAQ2G,GACzB,IAAIsD,EAAWjD,EAAK,KAAK,GAGzB,IAAKX,EAAUzwB,KAAK+wB,EAAQ9gB,KACxB,MAAMyhB,EAAQX,EAAO,QAEzB,IAEI3B,EAFAxhB,EAAOmjB,EACPpS,EAAS/Q,EAGTymB,IACAjD,EAAK,KAELzS,EADA/Q,EAAO,IAAMA,EAAO,IAEpBmjB,EAAQI,IACJT,EAAY1wB,KAAK+wB,KACjB3B,EAAW2B,EAAMvxB,MAAM,GACvBoO,GAAQmjB,EACR9gB,MAGRmhB,EAAK,KAyET,SAAyBhH,EAAQxc,EAAMpM,EAAO4tB,GACtChF,EAAO+E,iBACP/E,EAAO+E,gBAAgBvhB,EAAMpM,EAAO4tB,EAC5C,CA1EID,CAAgB/E,EAAQzL,EADN2V,GAAiBlK,EAAQxc,GACEwhB,EACjD,CAEA,SAASkF,GAAiBlK,EAAQxc,GAE9B,GAAIwjB,EAAK,KAAK,GAAO,CAGjB,IAFA,IAAImD,EAAe,CAAC,GAEZnD,EAAK,KAAK,IAAO,CAErB,IAAKZ,EAAOxwB,KAAK+wB,EAAQ9gB,KACrB,MAAMyhB,EAAQX,EAAO,QAEzB,GAAc,OAAVA,EACF,MAAMW,EAAQX,EAAO,gBAGvB,IAAIvvB,EACA4tB,EAAW2B,EAIf,GAFAK,EAAK,KAAK,GAEK,MAAXD,IACA3vB,EAAQ8yB,GAAiBlK,EAAQxc,EAAO,IAAMmjB,QAC7C,GAAe,MAAXI,IAAgB,CAKrB,IAAIqD,EACJ,GAFAhzB,EAAQ,GAEJ4vB,EAAK,KAAK,GAAO,CACjB,GACIoD,EAAY1C,GAAU,GACtBtwB,EAAMnC,KAAKm1B,SACNpD,EAAK,KAAK,IACnBA,EAAK,UACoB,IAAdoD,GACPvK,GAAUG,EAAQxc,EAAO,IAAMmjB,EAAOyD,EAE9C,CACJ,MACIhzB,EAAQswB,GAAU,GAClB7H,GAAUG,EAAQxc,EAAO,IAAMmjB,EAAOvvB,GAG1C,IAAIizB,EAAYF,EAAanF,GAEzBqF,IACAjzB,EAAQ,GAAGkQ,OAAO+iB,GAAW/iB,OAAOlQ,IAExC+yB,EAAanF,GAAY5tB,EAGzB4vB,EAAK,KAAK,GACVA,EAAK,KAAK,EACd,CAEA,OAAOmD,CACX,CAEA,IAAIG,EAAc5C,GAAU,GAE5B,OADA7H,GAAUG,EAAQxc,EAAM8mB,GACjBA,CAEX,CAEA,SAASzK,GAAUG,EAAQxc,EAAMpM,GACzB4oB,EAAOH,WACPG,EAAOH,UAAUrc,EAAMpM,EAC/B,CAOA,SAASgxB,GAAmBpI,GACxB,GAAIgH,EAAK,KAAK,GAAO,CACjB,GACImB,GAAYnI,EAAQ,gBACfgH,EAAK,KAAK,IACnBA,EAAK,IACT,CACA,OAAOhH,CACX,CA4GA,KAA4B,QAApB2G,EAAQ9gB,MACZ,OAAQ8gB,GAEJ,IAAK,UAGD,IAAKO,EACD,MAAMI,EAAQX,GAElB2B,IACA,MAEJ,IAAK,SAGD,IAAKpB,EACD,MAAMI,EAAQX,GAElB4B,IACA,MAEJ,IAAK,SAGD,IAAKrB,EACD,MAAMI,EAAQX,GAElB8B,IACA,MAEJ,IAAK,SAEDN,GAAYlE,EAAK0C,GACjBK,EAAK,KACL,MAEJ,QAGI,GAAI0B,EAAYzE,EAAK0C,GAAQ,CACzBO,GAAO,EACP,QACJ,CAGA,MAAMI,EAAQX,GAK1B,OADA5R,EAAMtc,SAAW,KACV,CACH,QAAgB8tB,EAChB,QAAgBC,EACfC,YAAeA,EACfC,OAAeA,EACfle,KAAeA,EAExB,+BC32BA1V,EAAOC,QAAUgvB,EAEjB,IAEIC,EAFA1G,EAAY,EAAQ,MAIpBiP,EAAYjP,EAAKiP,SACjBrsB,EAAYod,EAAKpd,KAGrB,SAASssB,EAAgB7H,EAAQ8H,GAC7B,OAAOC,WAAW,uBAAyB/H,EAAOxoB,IAAM,OAASswB,GAAe,GAAK,MAAQ9H,EAAOxkB,IACxG,CAQA,SAAS4jB,EAAOttB,GAMZkD,KAAKuC,IAAMzF,EAMXkD,KAAKwC,IAAM,EAMXxC,KAAKwG,IAAM1J,EAAOpB,MACtB,CAEA,IA4CQ+D,EA5CJuzB,EAAqC,oBAAfrxB,WACpB,SAA4B7E,GAC1B,GAAIA,aAAkB6E,YAAcnG,MAAM+Y,QAAQzX,GAC9C,OAAO,IAAIstB,EAAOttB,GACtB,MAAMkB,MAAM,iBAChB,EAEE,SAAsBlB,GACpB,GAAItB,MAAM+Y,QAAQzX,GACd,OAAO,IAAIstB,EAAOttB,GACtB,MAAMkB,MAAM,iBAChB,EAEAyO,EAAS,WACT,OAAOkX,EAAKsP,OACN,SAA6Bn2B,GAC3B,OAAQstB,EAAO3d,OAAS,SAAuB3P,GAC3C,OAAO6mB,EAAKsP,OAAOC,SAASp2B,GACtB,IAAIutB,EAAavtB,GAEjBk2B,EAAal2B,EACvB,GAAGA,EACP,EAEEk2B,CACV,EAuDA,SAASG,IAEL,IAAIne,EAAO,IAAI4d,EAAS,EAAG,GACvBh2B,EAAI,EACR,KAAIoD,KAAKwG,IAAMxG,KAAKwC,IAAM,GAanB,CACH,KAAO5F,EAAI,IAAKA,EAAG,CAEf,GAAIoD,KAAKwC,KAAOxC,KAAKwG,IACjB,MAAMqsB,EAAgB7yB,MAG1B,GADAgV,EAAK/P,IAAM+P,EAAK/P,IAA2B,IAArBjF,KAAKuC,IAAIvC,KAAKwC,OAAmB,EAAJ5F,KAAW,EAC1DoD,KAAKuC,IAAIvC,KAAKwC,OAAS,IACvB,OAAOwS,CACf,CAGA,OADAA,EAAK/P,IAAM+P,EAAK/P,IAA6B,IAAvBjF,KAAKuC,IAAIvC,KAAKwC,SAAqB,EAAJ5F,KAAW,EACzDoY,CACX,CAzBI,KAAOpY,EAAI,IAAKA,EAGZ,GADAoY,EAAK/P,IAAM+P,EAAK/P,IAA2B,IAArBjF,KAAKuC,IAAIvC,KAAKwC,OAAmB,EAAJ5F,KAAW,EAC1DoD,KAAKuC,IAAIvC,KAAKwC,OAAS,IACvB,OAAOwS,EAKf,GAFAA,EAAK/P,IAAM+P,EAAK/P,IAA2B,IAArBjF,KAAKuC,IAAIvC,KAAKwC,OAAe,MAAQ,EAC3DwS,EAAK9P,IAAM8P,EAAK9P,IAA2B,IAArBlF,KAAKuC,IAAIvC,KAAKwC,OAAgB,KAAO,EACvDxC,KAAKuC,IAAIvC,KAAKwC,OAAS,IACvB,OAAOwS,EAgBf,GAfIpY,EAAI,EAeJoD,KAAKwG,IAAMxG,KAAKwC,IAAM,GACtB,KAAO5F,EAAI,IAAKA,EAGZ,GADAoY,EAAK9P,IAAM8P,EAAK9P,IAA2B,IAArBlF,KAAKuC,IAAIvC,KAAKwC,OAAmB,EAAJ5F,EAAQ,KAAO,EAC9DoD,KAAKuC,IAAIvC,KAAKwC,OAAS,IACvB,OAAOwS,OAGf,KAAOpY,EAAI,IAAKA,EAAG,CAEf,GAAIoD,KAAKwC,KAAOxC,KAAKwG,IACjB,MAAMqsB,EAAgB7yB,MAG1B,GADAgV,EAAK9P,IAAM8P,EAAK9P,IAA2B,IAArBlF,KAAKuC,IAAIvC,KAAKwC,OAAmB,EAAJ5F,EAAQ,KAAO,EAC9DoD,KAAKuC,IAAIvC,KAAKwC,OAAS,IACvB,OAAOwS,CACf,CAGJ,MAAMhX,MAAM,0BAChB,CAiCA,SAASo1B,EAAgB7wB,EAAKvF,GAC1B,OAAQuF,EAAIvF,EAAM,GACVuF,EAAIvF,EAAM,IAAM,EAChBuF,EAAIvF,EAAM,IAAM,GAChBuF,EAAIvF,EAAM,IAAM,MAAQ,CACpC,CA8BA,SAASq2B,IAGL,GAAIrzB,KAAKwC,IAAM,EAAIxC,KAAKwG,IACpB,MAAMqsB,EAAgB7yB,KAAM,GAEhC,OAAO,IAAI4yB,EAASQ,EAAgBpzB,KAAKuC,IAAKvC,KAAKwC,KAAO,GAAI4wB,EAAgBpzB,KAAKuC,IAAKvC,KAAKwC,KAAO,GACxG,CA5KA4nB,EAAO3d,OAASA,IAEhB2d,EAAOlqB,UAAUozB,OAAS3P,EAAKnoB,MAAM0E,UAAUqzB,UAAuC5P,EAAKnoB,MAAM0E,UAAUzC,MAO3G2sB,EAAOlqB,UAAUszB,QACT/zB,EAAQ,WACL,WACuD,GAA1DA,GAAuC,IAArBO,KAAKuC,IAAIvC,KAAKwC,QAAuB,EAAOxC,KAAKuC,IAAIvC,KAAKwC,OAAS,IAAK,OAAO/C,EACvC,GAA1DA,GAASA,GAA8B,IAArBO,KAAKuC,IAAIvC,KAAKwC,OAAgB,KAAO,EAAOxC,KAAKuC,IAAIvC,KAAKwC,OAAS,IAAK,OAAO/C,EACvC,GAA1DA,GAASA,GAA8B,IAArBO,KAAKuC,IAAIvC,KAAKwC,OAAe,MAAQ,EAAOxC,KAAKuC,IAAIvC,KAAKwC,OAAS,IAAK,OAAO/C,EACvC,GAA1DA,GAASA,GAA8B,IAArBO,KAAKuC,IAAIvC,KAAKwC,OAAe,MAAQ,EAAOxC,KAAKuC,IAAIvC,KAAKwC,OAAS,IAAK,OAAO/C,EACvC,GAA1DA,GAASA,GAA+B,GAAtBO,KAAKuC,IAAIvC,KAAKwC,OAAe,MAAQ,EAAOxC,KAAKuC,IAAIvC,KAAKwC,OAAS,IAAK,OAAO/C,EAGjG,IAAKO,KAAKwC,KAAO,GAAKxC,KAAKwG,IAEvB,MADAxG,KAAKwC,IAAMxC,KAAKwG,IACVqsB,EAAgB7yB,KAAM,IAEhC,OAAOP,CACX,GAOJ2qB,EAAOlqB,UAAUuzB,MAAQ,WACrB,OAAuB,EAAhBzzB,KAAKwzB,QAChB,EAMApJ,EAAOlqB,UAAUwzB,OAAS,WACtB,IAAIj0B,EAAQO,KAAKwzB,SACjB,OAAO/zB,IAAU,IAAc,EAARA,EAC3B,EAoFA2qB,EAAOlqB,UAAUyzB,KAAO,WACpB,OAAyB,IAAlB3zB,KAAKwzB,QAChB,EAaApJ,EAAOlqB,UAAU0zB,QAAU,WAGvB,GAAI5zB,KAAKwC,IAAM,EAAIxC,KAAKwG,IACpB,MAAMqsB,EAAgB7yB,KAAM,GAEhC,OAAOozB,EAAgBpzB,KAAKuC,IAAKvC,KAAKwC,KAAO,EACjD,EAMA4nB,EAAOlqB,UAAU2zB,SAAW,WAGxB,GAAI7zB,KAAKwC,IAAM,EAAIxC,KAAKwG,IACpB,MAAMqsB,EAAgB7yB,KAAM,GAEhC,OAAkD,EAA3CozB,EAAgBpzB,KAAKuC,IAAKvC,KAAKwC,KAAO,EACjD,EAkCA4nB,EAAOlqB,UAAU4zB,MAAQ,WAGrB,GAAI9zB,KAAKwC,IAAM,EAAIxC,KAAKwG,IACpB,MAAMqsB,EAAgB7yB,KAAM,GAEhC,IAAIP,EAAQkkB,EAAKmQ,MAAMhxB,YAAY9C,KAAKuC,IAAKvC,KAAKwC,KAElD,OADAxC,KAAKwC,KAAO,EACL/C,CACX,EAOA2qB,EAAOlqB,UAAU6zB,OAAS,WAGtB,GAAI/zB,KAAKwC,IAAM,EAAIxC,KAAKwG,IACpB,MAAMqsB,EAAgB7yB,KAAM,GAEhC,IAAIP,EAAQkkB,EAAKmQ,MAAMnvB,aAAa3E,KAAKuC,IAAKvC,KAAKwC,KAEnD,OADAxC,KAAKwC,KAAO,EACL/C,CACX,EAMA2qB,EAAOlqB,UAAUoS,MAAQ,WACrB,IAAI5W,EAASsE,KAAKwzB,SACdz2B,EAASiD,KAAKwC,IACdxF,EAASgD,KAAKwC,IAAM9G,EAGxB,GAAIsB,EAAMgD,KAAKwG,IACX,MAAMqsB,EAAgB7yB,KAAMtE,GAGhC,GADAsE,KAAKwC,KAAO9G,EACRF,MAAM+Y,QAAQvU,KAAKuC,KACnB,OAAOvC,KAAKuC,IAAI9E,MAAMV,EAAOC,GAEjC,GAAID,IAAUC,EAAK,CACf,IAAIg3B,EAAerQ,EAAKsP,OACxB,OAAOe,EACDA,EAAa/tB,MAAM,GACnB,IAAIjG,KAAKuC,IAAIuK,YAAY,EACnC,CACA,OAAO9M,KAAKszB,OAAOhtB,KAAKtG,KAAKuC,IAAKxF,EAAOC,EAC7C,EAMAotB,EAAOlqB,UAAU9D,OAAS,WACtB,IAAIkW,EAAQtS,KAAKsS,QACjB,OAAO/L,EAAKE,KAAK6L,EAAO,EAAGA,EAAM5W,OACrC,EAOA0uB,EAAOlqB,UAAUmvB,KAAO,SAAc3zB,GAClC,GAAsB,iBAAXA,EAAqB,CAE5B,GAAIsE,KAAKwC,IAAM9G,EAASsE,KAAKwG,IACzB,MAAMqsB,EAAgB7yB,KAAMtE,GAChCsE,KAAKwC,KAAO9G,CAChB,MACI,GAEI,GAAIsE,KAAKwC,KAAOxC,KAAKwG,IACjB,MAAMqsB,EAAgB7yB,YACE,IAAvBA,KAAKuC,IAAIvC,KAAKwC,QAE3B,OAAOxC,IACX,EAOAoqB,EAAOlqB,UAAU+zB,SAAW,SAAS9N,GACjC,OAAQA,GACJ,KAAK,EACDnmB,KAAKqvB,OACL,MACJ,KAAK,EACDrvB,KAAKqvB,KAAK,GACV,MACJ,KAAK,EACDrvB,KAAKqvB,KAAKrvB,KAAKwzB,UACf,MACJ,KAAK,EACD,KAA0C,IAAlCrN,EAA2B,EAAhBnmB,KAAKwzB,WACpBxzB,KAAKi0B,SAAS9N,GAElB,MACJ,KAAK,EACDnmB,KAAKqvB,KAAK,GACV,MAGJ,QACI,MAAMrxB,MAAM,qBAAuBmoB,EAAW,cAAgBnmB,KAAKwC,KAE3E,OAAOxC,IACX,EAEAoqB,EAAOjB,WAAa,SAAS+K,GACzB7J,EAAe6J,EACf9J,EAAO3d,OAASA,IAChB4d,EAAalB,aAEb,IAAI9tB,EAAKsoB,EAAKkE,KAAO,SAAsC,WAC3DlE,EAAKrH,MAAM8N,EAAOlqB,UAAW,CAEzBi0B,MAAO,WACH,OAAOhB,EAAe7sB,KAAKtG,MAAM3E,IAAI,EACzC,EAEA+4B,OAAQ,WACJ,OAAOjB,EAAe7sB,KAAKtG,MAAM3E,IAAI,EACzC,EAEAg5B,OAAQ,WACJ,OAAOlB,EAAe7sB,KAAKtG,MAAMs0B,WAAWj5B,IAAI,EACpD,EAEAk5B,QAAS,WACL,OAAOlB,EAAY/sB,KAAKtG,MAAM3E,IAAI,EACtC,EAEAm5B,SAAU,WACN,OAAOnB,EAAY/sB,KAAKtG,MAAM3E,IAAI,EACtC,GAGR,+BC9ZAF,EAAOC,QAAUivB,EAGjB,IAAID,EAAS,EAAQ,OACpBC,EAAanqB,UAAYpB,OAAO2N,OAAO2d,EAAOlqB,YAAY4M,YAAcud,EAEzE,IAAI1G,EAAO,EAAQ,MASnB,SAAS0G,EAAavtB,GAClBstB,EAAO9jB,KAAKtG,KAAMlD,EAOtB,CAEAutB,EAAalB,WAAa,WAElBxF,EAAKsP,SACL5I,EAAanqB,UAAUozB,OAAS3P,EAAKsP,OAAO/yB,UAAUzC,MAC9D,EAMA4sB,EAAanqB,UAAU9D,OAAS,WAC5B,IAAIoK,EAAMxG,KAAKwzB,SACf,OAAOxzB,KAAKuC,IAAIkyB,UACVz0B,KAAKuC,IAAIkyB,UAAUz0B,KAAKwC,IAAKxC,KAAKwC,IAAMhG,KAAKk4B,IAAI10B,KAAKwC,IAAMgE,EAAKxG,KAAKwG,MACtExG,KAAKuC,IAAI9D,SAAS,QAASuB,KAAKwC,IAAKxC,KAAKwC,IAAMhG,KAAKk4B,IAAI10B,KAAKwC,IAAMgE,EAAKxG,KAAKwG,KACxF,EASA6jB,EAAalB,0CCjDbhuB,EAAOC,QAAUkuB,EAGjB,IAAI7C,EAAY,EAAQ,QACtB6C,EAAKppB,UAAYpB,OAAO2N,OAAOga,EAAUvmB,YAAY4M,YAAcwc,GAAM9C,UAAY,OAEvF,IAKIiB,EACArK,EACAwD,EAPA4G,EAAU,EAAQ,MAClB9D,EAAU,EAAQ,MAClBiG,EAAU,EAAQ,MAClBhG,EAAU,EAAQ,MAatB,SAAS2F,EAAKvoB,GACV0lB,EAAUngB,KAAKtG,KAAM,GAAIe,GAMzBf,KAAK20B,SAAW,GAMhB30B,KAAK40B,MAAQ,EACjB,CAsCA,SAASC,IAAQ,CA9BjBvL,EAAKxC,SAAW,SAAkB/F,EAAMlQ,GAKpC,OAJKA,IACDA,EAAO,IAAIyY,GACXvI,EAAKhgB,SACL8P,EAAKqb,WAAWnL,EAAKhgB,SAClB8P,EAAKgb,QAAQ9K,EAAKC,OAC7B,EAUAsI,EAAKppB,UAAU40B,YAAcnR,EAAKpe,KAAKxJ,QAUvCutB,EAAKppB,UAAUQ,MAAQijB,EAAKjjB,MAa5B4oB,EAAKppB,UAAUyH,KAAO,SAASA,EAAK7G,EAAUC,EAASC,GAC5B,mBAAZD,IACPC,EAAWD,EACXA,OAAUhD,GAEd,IAAIiM,EAAOhK,KACX,IAAKgB,EACD,OAAO2iB,EAAKhjB,UAAUgH,EAAMqC,EAAMlJ,EAAUC,GAEhD,IAAIg0B,EAAO/zB,IAAa6zB,EAGxB,SAASG,EAAO/4B,EAAK4U,GAEjB,GAAK7P,EAAL,CAEA,GAAI+zB,EACA,MAAM94B,EACV,IAAIg5B,EAAKj0B,EACTA,EAAW,KACXi0B,EAAGh5B,EAAK4U,EALE,CAMd,CAGA,SAASqkB,EAAmBp0B,GACxB,IAAIq0B,EAAMr0B,EAASs0B,YAAY,oBAC/B,GAAID,GAAO,EAAG,CACV,IAAIE,EAAUv0B,EAASuK,UAAU8pB,GACjC,GAAIE,KAAWzU,EAAQ,OAAOyU,CAClC,CACA,OAAO,IACX,CAGA,SAASvtB,EAAQhH,EAAUtC,GACvB,IAGI,GAFImlB,EAAK/M,SAASpY,IAAgC,MAArBA,EAAOjC,OAAO,KACvCiC,EAASoB,KAAKwd,MAAM5e,IACnBmlB,EAAK/M,SAASpY,GAEd,CACD4e,EAAMtc,SAAWA,EACjB,IACIsnB,EADAkN,EAASlY,EAAM5e,EAAQwL,EAAMjJ,GAE7BnE,EAAI,EACR,GAAI04B,EAAOzG,QACP,KAAOjyB,EAAI04B,EAAOzG,QAAQnzB,SAAUkB,GAC5BwrB,EAAW8M,EAAmBI,EAAOzG,QAAQjyB,KAAOoN,EAAK8qB,YAAYh0B,EAAUw0B,EAAOzG,QAAQjyB,MAC9F8D,EAAM0nB,GAClB,GAAIkN,EAAOxG,YACP,IAAKlyB,EAAI,EAAGA,EAAI04B,EAAOxG,YAAYpzB,SAAUkB,GACrCwrB,EAAW8M,EAAmBI,EAAOxG,YAAYlyB,KAAOoN,EAAK8qB,YAAYh0B,EAAUw0B,EAAOxG,YAAYlyB,MACtG8D,EAAM0nB,GAAU,EAChC,MAdIpe,EAAKkiB,WAAW1tB,EAAOuC,SAAS8qB,QAAQrtB,EAAOwiB,OAevD,CAAE,MAAO/kB,GACL+4B,EAAO/4B,EACX,CACK84B,GAASQ,GACVP,EAAO,KAAMhrB,EACrB,CAGA,SAAStJ,EAAMI,EAAU00B,GAIrB,GAHA10B,EAAWo0B,EAAmBp0B,IAAaA,IAGvCkJ,EAAK4qB,MAAM/hB,QAAQ/R,IAAa,GAKpC,GAHAkJ,EAAK4qB,MAAMt3B,KAAKwD,GAGZA,KAAY8f,EACRmU,EACAjtB,EAAQhH,EAAU8f,EAAO9f,OAEvBy0B,EACFE,YAAW,aACLF,EACFztB,EAAQhH,EAAU8f,EAAO9f,GAC7B,UAMR,GAAIi0B,EAAM,CACN,IAAIv2B,EACJ,IACIA,EAASmlB,EAAK/iB,GAAG80B,aAAa50B,GAAUrC,SAAS,OACrD,CAAE,MAAOxC,GAGL,YAFKu5B,GACDR,EAAO/4B,GAEf,CACA6L,EAAQhH,EAAUtC,EACtB,OACM+2B,EACFvrB,EAAKtJ,MAAMI,GAAU,SAAS7E,EAAKuC,KAC7B+2B,EAEGv0B,IAED/E,EAEKu5B,EAEKD,GACNP,EAAO,KAAMhrB,GAFbgrB,EAAO/4B,GAKf6L,EAAQhH,EAAUtC,GACtB,GAER,CACA,IAAI+2B,EAAS,EAIT5R,EAAK/M,SAAS9V,KACdA,EAAW,CAAEA,IACjB,IAAK,IAAWsnB,EAAPxrB,EAAI,EAAaA,EAAIkE,EAASpF,SAAUkB,GACzCwrB,EAAWpe,EAAK8qB,YAAY,GAAIh0B,EAASlE,MACzC8D,EAAM0nB,GAEd,GAAI2M,EACA,OAAO/qB,EACNurB,GACDP,EAAO,KAAMhrB,EAErB,EA+BAsf,EAAKppB,UAAUqpB,SAAW,SAAkBzoB,EAAUC,GAClD,IAAK4iB,EAAKgS,OACN,MAAM33B,MAAM,iBAChB,OAAOgC,KAAK2H,KAAK7G,EAAUC,EAAS8zB,EACxC,EAKAvL,EAAKppB,UAAUssB,WAAa,WACxB,GAAIxsB,KAAK20B,SAASj5B,OACd,MAAMsC,MAAM,4BAA8BgC,KAAK20B,SAASjpB,KAAI,SAASoY,GACjE,MAAO,WAAaA,EAAMpZ,OAAS,QAAUoZ,EAAMuE,OAAOhE,QAC9D,IAAG3mB,KAAK,OACZ,OAAO+oB,EAAUvmB,UAAUssB,WAAWlmB,KAAKtG,KAC/C,EAGA,IAAI41B,EAAW,SAUf,SAASC,EAAmBhlB,EAAMiT,GAC9B,IAAIgS,EAAehS,EAAMuE,OAAOoE,OAAO3I,EAAMpZ,QAC7C,GAAIorB,EAAc,CACd,IAAIC,EAAc,IAAIvO,EAAM1D,EAAMO,SAAUP,EAAMxC,GAAIwC,EAAM5b,KAAM4b,EAAMlB,UAAM7kB,EAAW+lB,EAAM/iB,SAE/F,OAAI+0B,EAAahrB,IAAIirB,EAAYlqB,QAGjCkqB,EAAYhO,eAAiBjE,EAC7BA,EAAMgE,eAAiBiO,EACvBD,EAAa1O,IAAI2O,KAJN,CAMf,CACA,OAAO,CACX,CAQAzM,EAAKppB,UAAUgtB,WAAa,SAAoB1R,GAC5C,GAAIA,aAAkBgM,OAE2DzpB,IAAlByd,EAAO9Q,QAAmD8Q,EAAOsM,gBACnH+N,EAAmB71B,EAAMwb,IAC1Bxb,KAAK20B,SAASr3B,KAAKke,QAExB,GAAIA,aAAkBkI,EAErBkS,EAAS33B,KAAKud,EAAO3P,QACrB2P,EAAO6M,OAAO7M,EAAO3P,MAAQ2P,EAAOiH,aAErC,KAAMjH,aAAkBmO,GAA6C,CAExE,GAAInO,aAAkBiM,EAClB,IAAK,IAAI7qB,EAAI,EAAGA,EAAIoD,KAAK20B,SAASj5B,QAC1Bm6B,EAAmB71B,EAAMA,KAAK20B,SAAS/3B,IACvCoD,KAAK20B,SAASp0B,OAAO3D,EAAG,KAEtBA,EACd,IAAK,IAAIQ,EAAI,EAAGA,EAAsBoe,EAAOuQ,YAAYrwB,SAAU0B,EAC/D4C,KAAKktB,WAAW1R,EAAOmQ,aAAavuB,IACpCw4B,EAAS33B,KAAKud,EAAO3P,QACrB2P,EAAO6M,OAAO7M,EAAO3P,MAAQ2P,EACrC,CAKJ,EAQA8N,EAAKppB,UAAUitB,cAAgB,SAAuB3R,GAClD,GAAIA,aAAkBgM,GAElB,QAA+CzpB,IAAlByd,EAAO9Q,OAChC,GAA0B8Q,EAAOsM,eAC7BtM,EAAOsM,eAAeO,OAAO3a,OAAO8N,EAAOsM,gBAC3CtM,EAAOsM,eAAiB,SACrB,CACH,IAAIlsB,EAAQoE,KAAK20B,SAAS9hB,QAAQ2I,GAE9B5f,GAAS,GACToE,KAAK20B,SAASp0B,OAAO3E,EAAO,EACpC,OAGD,GAAI4f,aAAkBkI,EAErBkS,EAAS33B,KAAKud,EAAO3P,cACd2P,EAAO6M,OAAO7M,EAAO3P,WAE7B,GAAI2P,aAAkBiL,EAAW,CAEpC,IAAK,IAAI7pB,EAAI,EAAGA,EAAsB4e,EAAOuQ,YAAYrwB,SAAUkB,EAC/DoD,KAAKmtB,cAAc3R,EAAOmQ,aAAa/uB,IAEvCg5B,EAAS33B,KAAKud,EAAO3P,cACd2P,EAAO6M,OAAO7M,EAAO3P,KAEpC,CACJ,EAGAyd,EAAKH,WAAa,SAASC,EAAO4M,EAAQC,GACtCxO,EAAS2B,EACThM,EAAS4Y,EACTpV,EAASqV,CACb,yBC9WA96B,EAAOC,QAAU,CAAC,+BCKRA,EA6BNyuB,QAAU,EAAQ,mCClCtB1uB,EAAOC,QAAUyuB,EAEjB,IAAIlG,EAAO,EAAQ,MAsCnB,SAASkG,EAAQqM,EAASC,EAAkBC,GAExC,GAAuB,mBAAZF,EACP,MAAM5pB,UAAU,8BAEpBqX,EAAK5jB,aAAauG,KAAKtG,MAMvBA,KAAKk2B,QAAUA,EAMfl2B,KAAKm2B,iBAAmBhP,QAAQgP,GAMhCn2B,KAAKo2B,kBAAoBjP,QAAQiP,EACrC,EA3DCvM,EAAQ3pB,UAAYpB,OAAO2N,OAAOkX,EAAK5jB,aAAaG,YAAY4M,YAAc+c,EAwE/EA,EAAQ3pB,UAAUm2B,QAAU,SAASA,EAAQ1gB,EAAQ2gB,EAAaC,EAAcC,EAASx1B,GAErF,IAAKw1B,EACD,MAAMlqB,UAAU,6BAEpB,IAAItC,EAAOhK,KACX,IAAKgB,EACD,OAAO2iB,EAAKhjB,UAAU01B,EAASrsB,EAAM2L,EAAQ2gB,EAAaC,EAAcC,GAE5E,GAAKxsB,EAAKksB,QAKV,IACI,OAAOlsB,EAAKksB,QACRvgB,EACA2gB,EAAYtsB,EAAKmsB,iBAAmB,kBAAoB,UAAUK,GAASxB,UAC3E,SAAqB/4B,EAAKwF,GAEtB,GAAIxF,EAEA,OADA+N,EAAKxJ,KAAK,QAASvE,EAAK0Z,GACjB3U,EAAS/E,GAGpB,GAAiB,OAAbwF,EAAJ,CAKA,KAAMA,aAAoB80B,GACtB,IACI90B,EAAW80B,EAAavsB,EAAKosB,kBAAoB,kBAAoB,UAAU30B,EACnF,CAAE,MAAOxF,GAEL,OADA+N,EAAKxJ,KAAK,QAASvE,EAAK0Z,GACjB3U,EAAS/E,EACpB,CAIJ,OADA+N,EAAKxJ,KAAK,OAAQiB,EAAUkU,GACrB3U,EAAS,KAAMS,EAZtB,CAFIuI,EAAKhN,KAAqB,EAelC,GAER,CAAE,MAAOf,GAGL,OAFA+N,EAAKxJ,KAAK,QAASvE,EAAK0Z,QACxB8f,YAAW,WAAaz0B,EAAS/E,EAAM,GAAG,EAE9C,MArCIw5B,YAAW,WAAaz0B,EAAShD,MAAM,iBAAmB,GAAG,EAsCrE,EAOA6rB,EAAQ3pB,UAAUlD,IAAM,SAAay5B,GAOjC,OANIz2B,KAAKk2B,UACAO,GACDz2B,KAAKk2B,QAAQ,KAAM,KAAM,MAC7Bl2B,KAAKk2B,QAAU,KACfl2B,KAAKQ,KAAK,OAAOH,OAEdL,IACX,+BC5IA7E,EAAOC,QAAUyuB,EAGjB,IAAIpD,EAAY,EAAQ,QACtBoD,EAAQ3pB,UAAYpB,OAAO2N,OAAOga,EAAUvmB,YAAY4M,YAAc+c,GAASrD,UAAY,UAE7F,IAAIsD,EAAS,EAAQ,MACjBnG,EAAS,EAAQ,MACjB2G,EAAS,EAAQ,MAWrB,SAAST,EAAQhe,EAAM9K,GACnB0lB,EAAUngB,KAAKtG,KAAM6L,EAAM9K,GAM3Bf,KAAKwV,QAAU,CAAC,EAOhBxV,KAAK02B,cAAgB,IACzB,CAwDA,SAAS9K,EAAWsF,GAEhB,OADAA,EAAQwF,cAAgB,KACjBxF,CACX,CA3CArH,EAAQ/C,SAAW,SAAkBjb,EAAMkV,GACvC,IAAImQ,EAAU,IAAIrH,EAAQhe,EAAMkV,EAAKhgB,SAErC,GAAIggB,EAAKvL,QACL,IAAK,IAAI/J,EAAQ3M,OAAOC,KAAKgiB,EAAKvL,SAAU5Y,EAAI,EAAGA,EAAI6O,EAAM/P,SAAUkB,EACnEs0B,EAAQ9J,IAAI0C,EAAOhD,SAASrb,EAAM7O,GAAImkB,EAAKvL,QAAQ/J,EAAM7O,MAIjE,OAHImkB,EAAKC,QACLkQ,EAAQrF,QAAQ9K,EAAKC,QACzBkQ,EAAQxK,QAAU3F,EAAK2F,QAChBwK,CACX,EAOArH,EAAQ3pB,UAAU8mB,OAAS,SAAgBC,GACvC,IAAI0P,EAAYlQ,EAAUvmB,UAAU8mB,OAAO1gB,KAAKtG,KAAMinB,GAClDC,IAAeD,GAAgBE,QAAQF,EAAcC,cACzD,OAAOvD,EAAKiB,SAAS,CACjB,UAAY+R,GAAaA,EAAU51B,cAAWhD,EAC9C,UAAY0oB,EAAUiF,YAAY1rB,KAAK42B,aAAc3P,IAA6C,CAAC,EACnG,SAAY0P,GAAaA,EAAU3V,aAAUjjB,EAC7C,UAAYmpB,EAAelnB,KAAK0mB,aAAU3oB,GAElD,EAQAe,OAAO6L,eAAekf,EAAQ3pB,UAAW,eAAgB,CACrD4K,IAAK,WACD,OAAO9K,KAAK02B,gBAAkB12B,KAAK02B,cAAgB/S,EAAKmI,QAAQ9rB,KAAKwV,SACzE,IAWJqU,EAAQ3pB,UAAU4K,IAAM,SAAae,GACjC,OAAO7L,KAAKwV,QAAQ3J,IACb4a,EAAUvmB,UAAU4K,IAAIxE,KAAKtG,KAAM6L,EAC9C,EAKAge,EAAQ3pB,UAAUssB,WAAa,WAE3B,IADA,IAAIhX,EAAUxV,KAAK42B,aACVh6B,EAAI,EAAGA,EAAI4Y,EAAQ9Z,SAAUkB,EAClC4Y,EAAQ5Y,GAAGb,UACf,OAAO0qB,EAAUvmB,UAAUnE,QAAQuK,KAAKtG,KAC5C,EAKA6pB,EAAQ3pB,UAAUknB,IAAM,SAAa5L,GAGjC,GAAIxb,KAAK8K,IAAI0Q,EAAO3P,MAChB,MAAM7N,MAAM,mBAAqBwd,EAAO3P,KAAO,QAAU7L,MAE7D,OAAIwb,aAAkBsO,GAClB9pB,KAAKwV,QAAQgG,EAAO3P,MAAQ2P,EAC5BA,EAAO6M,OAASroB,KACT4rB,EAAW5rB,OAEfymB,EAAUvmB,UAAUknB,IAAI9gB,KAAKtG,KAAMwb,EAC9C,EAKAqO,EAAQ3pB,UAAUwN,OAAS,SAAgB8N,GACvC,GAAIA,aAAkBsO,EAAQ,CAG1B,GAAI9pB,KAAKwV,QAAQgG,EAAO3P,QAAU2P,EAC9B,MAAMxd,MAAMwd,EAAS,uBAAyBxb,MAIlD,cAFOA,KAAKwV,QAAQgG,EAAO3P,MAC3B2P,EAAO6M,OAAS,KACTuD,EAAW5rB,KACtB,CACA,OAAOymB,EAAUvmB,UAAUwN,OAAOpH,KAAKtG,KAAMwb,EACjD,EASAqO,EAAQ3pB,UAAUuM,OAAS,SAAgBypB,EAASC,EAAkBC,GAElE,IADA,IACgBzgB,EADZkhB,EAAa,IAAIvM,EAAIT,QAAQqM,EAASC,EAAkBC,GACnDx5B,EAAI,EAAWA,EAAsBoD,KAAK42B,aAAal7B,SAAUkB,EAAG,CACzE,IAAIuZ,EAAawN,EAAKuO,SAASvc,EAAS3V,KAAK02B,cAAc95B,IAAIb,UAAU8P,MAAMvM,QAAQ,WAAY,IACnGu3B,EAAW1gB,GAAcwN,EAAKzlB,QAAQ,CAAC,IAAI,KAAMylB,EAAKmT,WAAW3gB,GAAcA,EAAa,IAAMA,EAAzEwN,CAAqF,iCAArFA,CAAuH,CAC5I9G,EAAGlH,EACHohB,EAAGphB,EAAO4V,oBAAoB3C,KAC9BrT,EAAGI,EAAO6V,qBAAqB5C,MAEvC,CACA,OAAOiO,CACX,wBCrKA17B,EAAOC,QAAUovB,EAEjB,IAAIwM,EAAiB,uBACjBC,EAAiB,kCACjBC,EAAiB,kCAEjBC,EAAe,aACfC,EAAkB,aAClBC,EAAoB,MACpBC,EAAe,KACfC,EAAa,UAEbC,EAAc,CACd,EAAK,KACL,EAAK,KACL,EAAK,KACL,EAAK,MAUT,SAASC,EAAS/kB,GACd,OAAOA,EAAIpT,QAAQi4B,GAAY,SAASh4B,EAAIC,GACxC,OAAQA,GACJ,IAAK,KACL,IAAK,GACD,OAAOA,EACX,QACI,OAAOg4B,EAAYh4B,IAAO,GAEtC,GACJ,CA6DA,SAASgrB,EAAShsB,EAAQ2wB,GAEtB3wB,EAASA,EAAOC,WAEhB,IAAI9C,EAAS,EACTD,EAAS8C,EAAO9C,OAChBm0B,EAAO,EACP6H,EAAkB,EAClB/Q,EAAW,CAAC,EAEZpb,EAAQ,GAERosB,EAAc,KASlB,SAAShI,EAAQiI,GACb,OAAO55B,MAAM,WAAa45B,EAAU,UAAY/H,EAAO,IAC3D,CAyBA,SAAStzB,EAAOiG,GACZ,OAAOhE,EAAOjC,OAAOiG,EACzB,CAUA,SAASq1B,EAAW96B,EAAOC,EAAK86B,GAC5B,IAYIj6B,EAZA6oB,EAAU,CACVxe,KAAM1J,EAAOjC,OAAOQ,KACpBg7B,WAAW,EACXC,QAASF,GAQTG,EAAgBl7B,GALhBoyB,EACW,EAEA,GAIf,GACI,KAAM8I,EAAgB,GACyB,QAAtCp6B,EAAIW,EAAOjC,OAAO07B,IAA0B,CACjDvR,EAAQqR,WAAY,EACpB,KACJ,QACW,MAANl6B,GAAmB,OAANA,GAItB,IAHA,IAAIq6B,EAAQ15B,EACP6M,UAAUtO,EAAOC,GACjB0I,MAAM2xB,GACFz6B,EAAI,EAAGA,EAAIs7B,EAAMx8B,SAAUkB,EAChCs7B,EAAMt7B,GAAKs7B,EAAMt7B,GACZ0C,QAAQ6vB,EAAuBiI,EAAkBD,EAAc,IAC/DgB,OACTzR,EAAQ0R,KAAOF,EACVx6B,KAAK,MACLy6B,OAELxR,EAASkJ,GAAQnJ,EACjBgR,EAAkB7H,CACtB,CAEA,SAASwI,EAAyBC,GAC9B,IAAIC,EAAYC,EAAcF,GAG1BG,EAAWj6B,EAAO6M,UAAUitB,EAAaC,GAE7C,MADgB,WAAWt6B,KAAKw6B,EAEpC,CAEA,SAASD,EAAcE,GAGnB,IADA,IAAIH,EAAYG,EACTH,EAAY78B,GAAgC,OAAtBa,EAAOg8B,IAChCA,IAEJ,OAAOA,CACX,CAOA,SAASrqB,IACL,GAAI3C,EAAM7P,OAAS,EACf,OAAO6P,EAAM1F,QACjB,GAAI8xB,EACA,OA7FR,WACI,IAAIgB,EAAqB,MAAhBhB,EAAsBT,EAAiBD,EAChD0B,EAAGC,UAAYj9B,EAAS,EACxB,IAAIyL,EAAQuxB,EAAGzb,KAAK1e,GACpB,IAAK4I,EACD,MAAMuoB,EAAQ,UAIlB,OAHAh0B,EAASg9B,EAAGC,UACZt7B,EAAKq6B,GACLA,EAAc,KACPF,EAASrwB,EAAM,GAC1B,CAmFe0oB,GACX,IAAI+I,EACAzuB,EACAH,EACAlN,EACA+7B,EACAC,EAA8B,IAAXp9B,EACvB,EAAG,CACC,GAAIA,IAAWD,EACX,OAAO,KAEX,IADAm9B,GAAS,EACFvB,EAAar5B,KAAKgM,EAAO1N,EAAOZ,KAKnC,GAJa,OAATsO,IACA8uB,GAAmB,IACjBlJ,KAEAl0B,IAAWD,EACb,OAAO,KAGf,GAAuB,MAAnBa,EAAOZ,GAAiB,CACxB,KAAMA,IAAWD,EACb,MAAMi0B,EAAQ,WAElB,GAAuB,MAAnBpzB,EAAOZ,GACP,GAAKwzB,EAkBE,CAIH,GAFApyB,EAAQpB,EACRm9B,GAAQ,EACJT,EAAyB18B,EAAS,GAAI,CACtCm9B,GAAQ,EACR,EAAG,CAEC,IADAn9B,EAAS68B,EAAc78B,MACRD,EACX,MAGJ,GADAC,KACKo9B,EAED,KAER,OAASV,EAAyB18B,GACtC,MACIA,EAASa,KAAKk4B,IAAIh5B,EAAQ88B,EAAc78B,GAAU,GAElDm9B,IACAjB,EAAW96B,EAAOpB,EAAQo9B,GAC1BA,GAAmB,GAEvBlJ,IACAgJ,GAAS,CACb,KA5C2B,CAIvB,IAFAC,EAAuC,MAA/Bv8B,EAAOQ,EAAQpB,EAAS,GAEJ,OAArBY,IAASZ,IACZ,GAAIA,IAAWD,EACX,OAAO,OAGbC,EACEm9B,IACAjB,EAAW96B,EAAOpB,EAAS,EAAGo9B,GAG9BA,GAAmB,KAErBlJ,EACFgJ,GAAS,CACb,KA2BG,IAAgC,OAA3B5uB,EAAO1N,EAAOZ,IAqBtB,MAAO,IAnBPoB,EAAQpB,EAAS,EACjBm9B,EAAQ3J,GAA0C,MAAlB5yB,EAAOQ,GACvC,EAAG,CAIC,GAHa,OAATkN,KACE4lB,IAEAl0B,IAAWD,EACb,MAAMi0B,EAAQ,WAElBvlB,EAAOH,EACPA,EAAO1N,EAAOZ,EAClB,OAAkB,MAATyO,GAAyB,MAATH,KACvBtO,EACEm9B,IACAjB,EAAW96B,EAAOpB,EAAS,EAAGo9B,GAC9BA,GAAmB,GAEvBF,GAAS,CAGb,CACJ,CACJ,OAASA,GAIT,IAAI77B,EAAMrB,EAGV,GAFAq7B,EAAQ4B,UAAY,GACR5B,EAAQ/4B,KAAK1B,EAAOS,MAE5B,KAAOA,EAAMtB,IAAWs7B,EAAQ/4B,KAAK1B,EAAOS,OACtCA,EACV,IAAIgyB,EAAQxwB,EAAO6M,UAAU1P,EAAQA,EAASqB,GAG9C,MAFc,MAAVgyB,GAA4B,MAAVA,IAClB2I,EAAc3I,GACXA,CACX,CAQA,SAAS1xB,EAAK0xB,GACVzjB,EAAMjO,KAAK0xB,EACf,CAOA,SAASI,IACL,IAAK7jB,EAAM7P,OAAQ,CACf,IAAIszB,EAAQ9gB,IACZ,GAAc,OAAV8gB,EACA,OAAO,KACX1xB,EAAK0xB,EACT,CACA,OAAOzjB,EAAM,EACjB,CAmDA,OAAOzM,OAAO6L,eAAe,CACzBuD,KAAMA,EACNkhB,KAAMA,EACN9xB,KAAMA,EACN+xB,KA7CJ,SAAc2J,EAAU1S,GACpB,IAAI2S,EAAS7J,IAEb,GADa6J,IAAWD,EAGpB,OADA9qB,KACO,EAEX,IAAKoY,EACD,MAAMqJ,EAAQ,UAAYsJ,EAAS,OAASD,EAAW,cAC3D,OAAO,CACX,EAoCI1J,KA5BJ,SAAcqC,GACV,IACIjL,EADAwS,EAAM,KAmBV,YAjBqBn7B,IAAjB4zB,GACAjL,EAAUC,EAASkJ,EAAO,UACnBlJ,EAASkJ,EAAO,GACnBnJ,IAAYyI,GAAyC,MAAjBzI,EAAQxe,MAAgBwe,EAAQqR,aACpEmB,EAAMxS,EAAQsR,QAAUtR,EAAQ0R,KAAO,QAIvCV,EAAkB/F,GAClBvC,IAEJ1I,EAAUC,EAASgL,UACZhL,EAASgL,IACZjL,GAAYA,EAAQqR,YAAc5I,GAAyC,MAAjBzI,EAAQxe,OAClEgxB,EAAMxS,EAAQsR,QAAU,KAAOtR,EAAQ0R,OAGxCc,CACX,GAQG,OAAQ,CACPpuB,IAAK,WAAa,OAAO+kB,CAAM,GAGvC,CAxXArF,EAASiN,SAAWA,+BCtCpBt8B,EAAOC,QAAUqsB,EAGjB,IAAIhB,EAAY,EAAQ,QACtBgB,EAAKvnB,UAAYpB,OAAO2N,OAAOga,EAAUvmB,YAAY4M,YAAc2a,GAAMjB,UAAY,OAEvF,IAAI9C,EAAY,EAAQ,MACpBiG,EAAY,EAAQ,MACpBnC,EAAY,EAAQ,MACpBoC,EAAY,EAAQ,MACpBC,EAAY,EAAQ,MACpBE,EAAY,EAAQ,MACpBK,EAAY,EAAQ,MACpBF,EAAY,EAAQ,MACpBvG,EAAY,EAAQ,MACpB6F,EAAY,EAAQ,MACpBC,EAAY,EAAQ,MACpBC,EAAY,EAAQ,KACpBjG,EAAY,EAAQ,KACpBuG,EAAY,EAAQ,MAUxB,SAASvC,EAAK5b,EAAM9K,GAChB0lB,EAAUngB,KAAKtG,KAAM6L,EAAM9K,GAM3Bf,KAAKohB,OAAS,CAAC,EAMfphB,KAAK+hB,YAAShkB,EAMdiC,KAAK+xB,gBAAah0B,EAMlBiC,KAAK6mB,cAAW9oB,EAMhBiC,KAAK2lB,WAAQ5nB,EAObiC,KAAKm5B,YAAc,KAOnBn5B,KAAK0lB,aAAe,KAOpB1lB,KAAKo5B,aAAe,KAOpBp5B,KAAKq5B,MAAQ,IACjB,CAyHA,SAASzN,EAAW1jB,GAKhB,OAJAA,EAAKixB,YAAcjxB,EAAKwd,aAAexd,EAAKkxB,aAAe,YACpDlxB,EAAKrL,cACLqL,EAAKtK,cACLsK,EAAKgjB,OACLhjB,CACX,CA7HApJ,OAAOmuB,iBAAiBxF,EAAKvnB,UAAW,CAQpCo5B,WAAY,CACRxuB,IAAK,WAGD,GAAI9K,KAAKm5B,YACL,OAAOn5B,KAAKm5B,YAEhBn5B,KAAKm5B,YAAc,CAAC,EACpB,IAAK,IAAI1tB,EAAQ3M,OAAOC,KAAKiB,KAAKohB,QAASxkB,EAAI,EAAGA,EAAI6O,EAAM/P,SAAUkB,EAAG,CACrE,IAAIknB,EAAQ9jB,KAAKohB,OAAO3V,EAAM7O,IAC1B0kB,EAAKwC,EAAMxC,GAGf,GAAIthB,KAAKm5B,YAAY7X,GACjB,MAAMtjB,MAAM,gBAAkBsjB,EAAK,OAASthB,MAEhDA,KAAKm5B,YAAY7X,GAAMwC,CAC3B,CACA,OAAO9jB,KAAKm5B,WAChB,GASJzU,YAAa,CACT5Z,IAAK,WACD,OAAO9K,KAAK0lB,eAAiB1lB,KAAK0lB,aAAe/B,EAAKmI,QAAQ9rB,KAAKohB,QACvE,GASJmY,YAAa,CACTzuB,IAAK,WACD,OAAO9K,KAAKo5B,eAAiBp5B,KAAKo5B,aAAezV,EAAKmI,QAAQ9rB,KAAK+hB,QACvE,GASJ6G,KAAM,CACF9d,IAAK,WACD,OAAO9K,KAAKq5B,QAAUr5B,KAAK4oB,KAAOnB,EAAK+R,oBAAoBx5B,KAAzBynB,GACtC,EACA1c,IAAK,SAAS6d,GAGV,IAAI1oB,EAAY0oB,EAAK1oB,UACfA,aAAqB6pB,KACtBnB,EAAK1oB,UAAY,IAAI6pB,GAAWjd,YAAc8b,EAC/CjF,EAAKrH,MAAMsM,EAAK1oB,UAAWA,IAI/B0oB,EAAKiC,MAAQjC,EAAK1oB,UAAU2qB,MAAQ7qB,KAGpC2jB,EAAKrH,MAAMsM,EAAMmB,GAAS,GAE1B/pB,KAAKq5B,MAAQzQ,EAIb,IADA,IAAIhsB,EAAI,EACDA,EAAsBoD,KAAK0kB,YAAYhpB,SAAUkB,EACpDoD,KAAK0lB,aAAa9oB,GAAGb,UAGzB,IAAI09B,EAAiB,CAAC,EACtB,IAAK78B,EAAI,EAAGA,EAAsBoD,KAAKu5B,YAAY79B,SAAUkB,EACzD68B,EAAez5B,KAAKo5B,aAAax8B,GAAGb,UAAU8P,MAAQ,CAClDf,IAAK6Y,EAAKoK,YAAY/tB,KAAKo5B,aAAax8B,GAAGqlB,OAC3ClX,IAAK4Y,EAAKqK,YAAYhuB,KAAKo5B,aAAax8B,GAAGqlB,QAE/CrlB,GACAkC,OAAOmuB,iBAAiBrE,EAAK1oB,UAAWu5B,EAChD,KASRhS,EAAK+R,oBAAsB,SAA6B/U,GAIpD,IAFA,IAEgBX,EAFZD,EAAMF,EAAKzlB,QAAQ,CAAC,KAAMumB,EAAM5Y,MAE3BjP,EAAI,EAAUA,EAAI6nB,EAAMC,YAAYhpB,SAAUkB,GAC9CknB,EAAQW,EAAMiB,aAAa9oB,IAAI8O,IAAKmY,EACpC,YAAaF,EAAKgB,SAASb,EAAMjY,OAC7BiY,EAAMM,UAAUP,EACpB,YAAaF,EAAKgB,SAASb,EAAMjY,OAC1C,OAAOgY,EACN,wEADMA,CAEF,uBAET,EA2BA4D,EAAKX,SAAW,SAAkBjb,EAAMkV,GACpC,IAAI7Y,EAAO,IAAIuf,EAAK5b,EAAMkV,EAAKhgB,SAC/BmH,EAAK6pB,WAAahR,EAAKgR,WACvB7pB,EAAK2e,SAAW9F,EAAK8F,SAGrB,IAFA,IAAIpb,EAAQ3M,OAAOC,KAAKgiB,EAAKK,QACzBxkB,EAAI,EACDA,EAAI6O,EAAM/P,SAAUkB,EACvBsL,EAAKkf,UAC0C,IAAlCrG,EAAKK,OAAO3V,EAAM7O,IAAIilB,QAC7B+H,EAAS9C,SACTU,EAAMV,UAAWrb,EAAM7O,GAAImkB,EAAKK,OAAO3V,EAAM7O,MAEvD,GAAImkB,EAAKgB,OACL,IAAKtW,EAAQ3M,OAAOC,KAAKgiB,EAAKgB,QAASnlB,EAAI,EAAGA,EAAI6O,EAAM/P,SAAUkB,EAC9DsL,EAAKkf,IAAIuC,EAAM7C,SAASrb,EAAM7O,GAAImkB,EAAKgB,OAAOtW,EAAM7O,MAC5D,GAAImkB,EAAKC,OACL,IAAKvV,EAAQ3M,OAAOC,KAAKgiB,EAAKC,QAASpkB,EAAI,EAAGA,EAAI6O,EAAM/P,SAAUkB,EAAG,CACjE,IAAIokB,EAASD,EAAKC,OAAOvV,EAAM7O,IAC/BsL,EAAKkf,UACerpB,IAAdijB,EAAOM,GACPkG,EAAMV,cACY/oB,IAAlBijB,EAAOI,OACPqG,EAAKX,cACa/oB,IAAlBijB,EAAOyB,OACPiB,EAAKoD,cACc/oB,IAAnBijB,EAAOxL,QACPqU,EAAQ/C,SACRL,EAAUK,UAAWrb,EAAM7O,GAAIokB,GAEzC,CASJ,OARID,EAAKgR,YAAchR,EAAKgR,WAAWr2B,SACnCwM,EAAK6pB,WAAahR,EAAKgR,YACvBhR,EAAK8F,UAAY9F,EAAK8F,SAASnrB,SAC/BwM,EAAK2e,SAAW9F,EAAK8F,UACrB9F,EAAK4E,QACLzd,EAAKyd,OAAQ,GACb5E,EAAK2F,UACLxe,EAAKwe,QAAU3F,EAAK2F,SACjBxe,CACX,EAOAuf,EAAKvnB,UAAU8mB,OAAS,SAAgBC,GACpC,IAAI0P,EAAYlQ,EAAUvmB,UAAU8mB,OAAO1gB,KAAKtG,KAAMinB,GAClDC,IAAeD,GAAgBE,QAAQF,EAAcC,cACzD,OAAOvD,EAAKiB,SAAS,CACjB,UAAe+R,GAAaA,EAAU51B,cAAWhD,EACjD,SAAe0oB,EAAUiF,YAAY1rB,KAAKu5B,YAAatS,GACvD,SAAeR,EAAUiF,YAAY1rB,KAAK0kB,YAAYhI,QAAO,SAASvQ,GAAO,OAAQA,EAAI4b,cAAgB,IAAId,IAAkB,CAAC,EAChI,aAAejnB,KAAK+xB,YAAc/xB,KAAK+xB,WAAWr2B,OAASsE,KAAK+xB,gBAAah0B,EAC7E,WAAeiC,KAAK6mB,UAAY7mB,KAAK6mB,SAASnrB,OAASsE,KAAK6mB,cAAW9oB,EACvE,QAAeiC,KAAK2lB,YAAS5nB,EAC7B,SAAe44B,GAAaA,EAAU3V,aAAUjjB,EAChD,UAAempB,EAAelnB,KAAK0mB,aAAU3oB,GAErD,EAKA0pB,EAAKvnB,UAAUssB,WAAa,WAExB,IADA,IAAIpL,EAASphB,KAAK0kB,YAAa9nB,EAAI,EAC5BA,EAAIwkB,EAAO1lB,QACd0lB,EAAOxkB,KAAKb,UAChB,IAAIgmB,EAAS/hB,KAAKu5B,YAClB,IAD+B38B,EAAI,EAC5BA,EAAImlB,EAAOrmB,QACdqmB,EAAOnlB,KAAKb,UAChB,OAAO0qB,EAAUvmB,UAAUssB,WAAWlmB,KAAKtG,KAC/C,EAKAynB,EAAKvnB,UAAU4K,IAAM,SAAae,GAC9B,OAAO7L,KAAKohB,OAAOvV,IACZ7L,KAAK+hB,QAAU/hB,KAAK+hB,OAAOlW,IAC3B7L,KAAKghB,QAAUhhB,KAAKghB,OAAOnV,IAC3B,IACX,EASA4b,EAAKvnB,UAAUknB,IAAM,SAAa5L,GAE9B,GAAIxb,KAAK8K,IAAI0Q,EAAO3P,MAChB,MAAM7N,MAAM,mBAAqBwd,EAAO3P,KAAO,QAAU7L,MAE7D,GAAIwb,aAAkBgM,QAA2BzpB,IAAlByd,EAAO9Q,OAAsB,CAMxD,GAAI1K,KAAKm5B,YAAyCn5B,KAAKm5B,YAAY3d,EAAO8F,IAAMthB,KAAKs5B,WAAW9d,EAAO8F,IACnG,MAAMtjB,MAAM,gBAAkBwd,EAAO8F,GAAK,OAASthB,MACvD,GAAIA,KAAKqnB,aAAa7L,EAAO8F,IACzB,MAAMtjB,MAAM,MAAQwd,EAAO8F,GAAK,mBAAqBthB,MACzD,GAAIA,KAAKsnB,eAAe9L,EAAO3P,MAC3B,MAAM7N,MAAM,SAAWwd,EAAO3P,KAAO,oBAAsB7L,MAO/D,OALIwb,EAAO6M,QACP7M,EAAO6M,OAAO3a,OAAO8N,GACzBxb,KAAKohB,OAAO5F,EAAO3P,MAAQ2P,EAC3BA,EAAO/R,QAAUzJ,KACjBwb,EAAO2Q,MAAMnsB,MACN4rB,EAAW5rB,KACtB,CACA,OAAIwb,aAAkBmO,GACb3pB,KAAK+hB,SACN/hB,KAAK+hB,OAAS,CAAC,GACnB/hB,KAAK+hB,OAAOvG,EAAO3P,MAAQ2P,EAC3BA,EAAO2Q,MAAMnsB,MACN4rB,EAAW5rB,OAEfymB,EAAUvmB,UAAUknB,IAAI9gB,KAAKtG,KAAMwb,EAC9C,EASAiM,EAAKvnB,UAAUwN,OAAS,SAAgB8N,GACpC,GAAIA,aAAkBgM,QAA2BzpB,IAAlByd,EAAO9Q,OAAsB,CAIxD,IAAK1K,KAAKohB,QAAUphB,KAAKohB,OAAO5F,EAAO3P,QAAU2P,EAC7C,MAAMxd,MAAMwd,EAAS,uBAAyBxb,MAKlD,cAHOA,KAAKohB,OAAO5F,EAAO3P,MAC1B2P,EAAO6M,OAAS,KAChB7M,EAAO4Q,SAASpsB,MACT4rB,EAAW5rB,KACtB,CACA,GAAIwb,aAAkBmO,EAAO,CAGzB,IAAK3pB,KAAK+hB,QAAU/hB,KAAK+hB,OAAOvG,EAAO3P,QAAU2P,EAC7C,MAAMxd,MAAMwd,EAAS,uBAAyBxb,MAKlD,cAHOA,KAAK+hB,OAAOvG,EAAO3P,MAC1B2P,EAAO6M,OAAS,KAChB7M,EAAO4Q,SAASpsB,MACT4rB,EAAW5rB,KACtB,CACA,OAAOymB,EAAUvmB,UAAUwN,OAAOpH,KAAKtG,KAAMwb,EACjD,EAOAiM,EAAKvnB,UAAUmnB,aAAe,SAAsB/F,GAChD,OAAOmF,EAAUY,aAAarnB,KAAK6mB,SAAUvF,EACjD,EAOAmG,EAAKvnB,UAAUonB,eAAiB,SAAwBzb,GACpD,OAAO4a,EAAUa,eAAetnB,KAAK6mB,SAAUhb,EACnD,EAOA4b,EAAKvnB,UAAUuM,OAAS,SAAgBme,GACpC,OAAO,IAAI5qB,KAAK4oB,KAAKgC,EACzB,EAMAnD,EAAKvnB,UAAUw5B,MAAQ,WAMnB,IAFA,IAAIrV,EAAWrkB,KAAKqkB,SAChBuB,EAAW,GACNhpB,EAAI,EAAGA,EAAsBoD,KAAK0kB,YAAYhpB,SAAUkB,EAC7DgpB,EAAMtoB,KAAK0C,KAAK0lB,aAAa9oB,GAAGb,UAAUmoB,cAG9ClkB,KAAKnD,OAAS2sB,EAAQxpB,KAARwpB,CAAc,CACxBU,OAASA,EACTtE,MAASA,EACTjC,KAASA,IAEb3jB,KAAKpC,OAAS6rB,EAAQzpB,KAARypB,CAAc,CACxBW,OAASA,EACTxE,MAASA,EACTjC,KAASA,IAEb3jB,KAAKkrB,OAASxB,EAAS1pB,KAAT0pB,CAAe,CACzB9D,MAAQA,EACRjC,KAAQA,IAEZ3jB,KAAKwkB,WAAaf,EAAUe,WAAWxkB,KAArByjB,CAA2B,CACzCmC,MAAQA,EACRjC,KAAQA,IAEZ3jB,KAAK4kB,SAAWnB,EAAUmB,SAAS5kB,KAAnByjB,CAAyB,CACrCmC,MAAQA,EACRjC,KAAQA,IAIZ,IAAIgW,EAAU3P,EAAS3F,GACvB,GAAIsV,EAAS,CACT,IAAIC,EAAe96B,OAAO2N,OAAOzM,MAE7B45B,EAAapV,WAAaxkB,KAAKwkB,WAC/BxkB,KAAKwkB,WAAamV,EAAQnV,WAAW1gB,KAAK81B,GAG1CA,EAAahV,SAAW5kB,KAAK4kB,SAC7B5kB,KAAK4kB,SAAW+U,EAAQ/U,SAAS9gB,KAAK81B,EAE9C,CAEA,OAAO55B,IACX,EAQAynB,EAAKvnB,UAAUrD,OAAS,SAAsB4M,EAASqhB,GACnD,OAAO9qB,KAAK05B,QAAQ78B,OAAO4M,EAASqhB,EACxC,EAQArD,EAAKvnB,UAAU6qB,gBAAkB,SAAyBthB,EAASqhB,GAC/D,OAAO9qB,KAAKnD,OAAO4M,EAASqhB,GAAUA,EAAOtkB,IAAMskB,EAAO+O,OAAS/O,GAAQgP,QAC/E,EAUArS,EAAKvnB,UAAUtC,OAAS,SAAsBotB,EAAQtvB,GAClD,OAAOsE,KAAK05B,QAAQ97B,OAAOotB,EAAQtvB,EACvC,EASA+rB,EAAKvnB,UAAU+qB,gBAAkB,SAAyBD,GAGtD,OAFMA,aAAkBZ,IACpBY,EAASZ,EAAO3d,OAAOue,IACpBhrB,KAAKpC,OAAOotB,EAAQA,EAAOwI,SACtC,EAOA/L,EAAKvnB,UAAUgrB,OAAS,SAAsBzhB,GAC1C,OAAOzJ,KAAK05B,QAAQxO,OAAOzhB,EAC/B,EAOAge,EAAKvnB,UAAUskB,WAAa,SAAoBhJ,GAC5C,OAAOxb,KAAK05B,QAAQlV,WAAWhJ,EACnC,EA2BAiM,EAAKvnB,UAAU0kB,SAAW,SAAkBnb,EAAS1I,GACjD,OAAOf,KAAK05B,QAAQ9U,SAASnb,EAAS1I,EAC1C,EAiBA0mB,EAAK3K,EAAI,SAAsBid,GAC3B,OAAO,SAAuB5J,GAC1BxM,EAAKqF,aAAamH,EAAQ4J,EAC9B,CACJ,8BCtkBA,IAAInU,EAAQxqB,EAERuoB,EAAO,EAAQ,MAEfpO,EAAI,CACJ,SACA,QACA,QACA,SACA,SACA,UACA,WACA,QACA,SACA,SACA,UACA,WACA,OACA,SACA,SAGJ,SAASykB,EAAKvX,EAAQ9mB,GAClB,IAAIiB,EAAI,EAAGqa,EAAI,CAAC,EAEhB,IADAtb,GAAU,EACHiB,EAAI6lB,EAAO/mB,QAAQub,EAAE1B,EAAE3Y,EAAIjB,IAAW8mB,EAAO7lB,KACpD,OAAOqa,CACX,CAsBA2O,EAAME,MAAQkU,EAAK,CACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,IAwBnBpU,EAAMC,SAAWmU,EAAK,CACH,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,GACA,EACA,GACArW,EAAKgF,WACL,OAanB/C,EAAMtI,KAAO0c,EAAK,CACC,EACA,EACA,EACA,EACA,GAChB,GAmBHpU,EAAMQ,OAAS4T,EAAK,CACD,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,GAChB,GAoBHpU,EAAMG,OAASiU,EAAK,CACD,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,iCC5LnB,IAIIvS,EACA/D,EALAC,EAAOxoB,EAAOC,QAAU,EAAjB,MAEPmvB,EAAQ,EAAQ,MAKpB5G,EAAKzlB,QAAU,EAAQ,MACvBylB,EAAKjjB,MAAU,EAAQ,MACvBijB,EAAKpe,KAAU,EAAQ,MAMvBoe,EAAK/iB,GAAK+iB,EAAK9iB,QAAQ,MAOvB8iB,EAAKmI,QAAU,SAAiBtQ,GAC5B,GAAIA,EAAQ,CAIR,IAHA,IAAIzc,EAAQD,OAAOC,KAAKyc,GACpB3G,EAAQ,IAAIrZ,MAAMuD,EAAKrD,QACvBE,EAAQ,EACLA,EAAQmD,EAAKrD,QAChBmZ,EAAMjZ,GAAS4f,EAAOzc,EAAKnD,MAC/B,OAAOiZ,CACX,CACA,MAAO,EACX,EAOA8O,EAAKiB,SAAW,SAAkB/P,GAG9B,IAFA,IAAI2G,EAAS,CAAC,EACV5f,EAAS,EACNA,EAAQiZ,EAAMnZ,QAAQ,CACzB,IAAIqQ,EAAM8I,EAAMjZ,KACZ0G,EAAMuS,EAAMjZ,UACJmC,IAARuE,IACAkZ,EAAOzP,GAAOzJ,EACtB,CACA,OAAOkZ,CACX,EAEA,IAAIye,EAAsB,MACtBC,EAAsB,KAO1BvW,EAAKmT,WAAa,SAAoBjrB,GAClC,MAAO,uTAAuT5N,KAAK4N,EACvU,EAOA8X,EAAKgB,SAAW,SAAkBX,GAC9B,OAAK,YAAY/lB,KAAK+lB,IAASL,EAAKmT,WAAW9S,GACpC,KAAQA,EAAK1kB,QAAQ26B,EAAqB,QAAQ36B,QAAQ46B,EAAiB,OAAU,KACzF,IAAMlW,CACjB,EAOAL,EAAKwO,QAAU,SAAiBzf,GAC5B,OAAOA,EAAInW,OAAO,GAAG49B,cAAgBznB,EAAIrH,UAAU,EACvD,EAEA,IAAI+uB,EAAc,YAOlBzW,EAAK+L,UAAY,SAAmBhd,GAChC,OAAOA,EAAIrH,UAAU,EAAG,GACjBqH,EAAIrH,UAAU,GACT/L,QAAQ86B,GAAa,SAAS76B,EAAIC,GAAM,OAAOA,EAAG26B,aAAe,GACjF,EAQAxW,EAAKmB,kBAAoB,SAA2BuV,EAAGh9B,GACnD,OAAOg9B,EAAE/Y,GAAKjkB,EAAEikB,EACpB,EAUAqC,EAAKqF,aAAe,SAAsBJ,EAAMmR,GAG5C,GAAInR,EAAKiC,MAML,OALIkP,GAAYnR,EAAKiC,MAAMhf,OAASkuB,IAChCpW,EAAK2W,aAAa5sB,OAAOkb,EAAKiC,OAC9BjC,EAAKiC,MAAMhf,KAAOkuB,EAClBpW,EAAK2W,aAAalT,IAAIwB,EAAKiC,QAExBjC,EAAKiC,MAIXpD,IACDA,EAAO,EAAQ,OAEnB,IAAIvf,EAAO,IAAIuf,EAAKsS,GAAYnR,EAAK/c,MAKrC,OAJA8X,EAAK2W,aAAalT,IAAIlf,GACtBA,EAAK0gB,KAAOA,EACZ9pB,OAAO6L,eAAeie,EAAM,QAAS,CAAEnpB,MAAOyI,EAAM0C,YAAY,IAChE9L,OAAO6L,eAAeie,EAAK1oB,UAAW,QAAS,CAAET,MAAOyI,EAAM0C,YAAY,IACnE1C,CACX,EAEA,IAAIqyB,EAAoB,EAOxB5W,EAAKsF,aAAe,SAAsBzN,GAGtC,GAAIA,EAAOqP,MACP,OAAOrP,EAAOqP,MAGbnH,IACDA,EAAO,EAAQ,OAEnB,IAAIqD,EAAM,IAAIrD,EAAK,OAAS6W,IAAqB/e,GAGjD,OAFAmI,EAAK2W,aAAalT,IAAIL,GACtBjoB,OAAO6L,eAAe6Q,EAAQ,QAAS,CAAE/b,MAAOsnB,EAAKnc,YAAY,IAC1Dmc,CACX,EAUApD,EAAK8J,YAAc,SAAqB+M,EAAKj1B,EAAM9F,GAiB/C,GAAmB,iBAAR+6B,EACP,MAAMluB,UAAU,yBACpB,IAAK/G,EACD,MAAM+G,UAAU,0BAGpB,OAtBA,SAASmuB,EAAQD,EAAKj1B,EAAM9F,GACxB,IAAI8sB,EAAOhnB,EAAKM,QAChB,GAAa,cAAT0mB,GAAiC,cAATA,EAC1B,OAAOiO,EAET,GAAIj1B,EAAK7J,OAAS,EACd8+B,EAAIjO,GAAQkO,EAAQD,EAAIjO,IAAS,CAAC,EAAGhnB,EAAM9F,OACxC,CACH,IAAIizB,EAAY8H,EAAIjO,GAChBmG,IACAjzB,EAAQ,GAAGkQ,OAAO+iB,GAAW/iB,OAAOlQ,IACxC+6B,EAAIjO,GAAQ9sB,CAChB,CACA,OAAO+6B,CACX,CAQOC,CAAQD,EADfj1B,EAAOA,EAAKG,MAAM,KACQjG,EAC9B,EAQAX,OAAO6L,eAAegZ,EAAM,eAAgB,CACxC7Y,IAAK,WACD,OAAOyf,EAAiB,YAAMA,EAAiB,UAAI,IAAK,EAAQ,OACpE,iCCjNJpvB,EAAOC,QAAUw3B,EAEjB,IAAIjP,EAAO,EAAQ,MAUnB,SAASiP,EAAS3tB,EAAIC,GASlBlF,KAAKiF,GAAKA,IAAO,EAMjBjF,KAAKkF,GAAKA,IAAO,CACrB,CAOA,IAAIw1B,EAAO9H,EAAS8H,KAAO,IAAI9H,EAAS,EAAG,GAE3C8H,EAAKnV,SAAW,WAAa,OAAO,CAAG,EACvCmV,EAAKC,SAAWD,EAAKpG,SAAW,WAAa,OAAOt0B,IAAM,EAC1D06B,EAAKh/B,OAAS,WAAa,OAAO,CAAG,EAOrC,IAAIk/B,EAAWhI,EAASgI,SAAW,mBAOnChI,EAASpK,WAAa,SAAoB/oB,GACtC,GAAc,IAAVA,EACA,OAAOi7B,EACX,IAAIx3B,EAAOzD,EAAQ,EACfyD,IACAzD,GAASA,GACb,IAAIwF,EAAKxF,IAAU,EACfyF,GAAMzF,EAAQwF,GAAM,aAAe,EAUvC,OATI/B,IACAgC,GAAMA,IAAO,EACbD,GAAMA,IAAO,IACPA,EAAK,aACPA,EAAK,IACCC,EAAK,aACPA,EAAK,KAGV,IAAI0tB,EAAS3tB,EAAIC,EAC5B,EAOA0tB,EAASiI,KAAO,SAAcp7B,GAC1B,GAAqB,iBAAVA,EACP,OAAOmzB,EAASpK,WAAW/oB,GAC/B,GAAIkkB,EAAK/M,SAASnX,GAAQ,CAEtB,IAAIkkB,EAAKkE,KAGL,OAAO+K,EAASpK,WAAW1f,SAASrJ,EAAO,KAF3CA,EAAQkkB,EAAKkE,KAAKiT,WAAWr7B,EAGrC,CACA,OAAOA,EAAM2lB,KAAO3lB,EAAM4lB,KAAO,IAAIuN,EAASnzB,EAAM2lB,MAAQ,EAAG3lB,EAAM4lB,OAAS,GAAKqV,CACvF,EAOA9H,EAAS1yB,UAAUqlB,SAAW,SAAkBD,GAC5C,IAAKA,GAAYtlB,KAAKkF,KAAO,GAAI,CAC7B,IAAID,EAAgB,GAAVjF,KAAKiF,KAAW,EACtBC,GAAMlF,KAAKkF,KAAW,EAG1B,OAFKD,IACDC,EAAKA,EAAK,IAAM,KACXD,EAAU,WAALC,EAClB,CACA,OAAOlF,KAAKiF,GAAe,WAAVjF,KAAKkF,EAC1B,EAOA0tB,EAAS1yB,UAAU66B,OAAS,SAAgBzV,GACxC,OAAO3B,EAAKkE,KACN,IAAIlE,EAAKkE,KAAe,EAAV7nB,KAAKiF,GAAkB,EAAVjF,KAAKkF,GAAQiiB,QAAQ7B,IAEhD,CAAEF,IAAe,EAAVplB,KAAKiF,GAAQogB,KAAgB,EAAVrlB,KAAKkF,GAAQogB,SAAU6B,QAAQ7B,GACnE,EAEA,IAAIxnB,EAAaP,OAAO2C,UAAUpC,WAOlC80B,EAASoI,SAAW,SAAkBhvB,GAClC,OAAIA,IAAS4uB,EACFF,EACJ,IAAI9H,GACL90B,EAAWwI,KAAK0F,EAAM,GACtBlO,EAAWwI,KAAK0F,EAAM,IAAM,EAC5BlO,EAAWwI,KAAK0F,EAAM,IAAM,GAC5BlO,EAAWwI,KAAK0F,EAAM,IAAM,MAAQ,GAEpClO,EAAWwI,KAAK0F,EAAM,GACtBlO,EAAWwI,KAAK0F,EAAM,IAAM,EAC5BlO,EAAWwI,KAAK0F,EAAM,IAAM,GAC5BlO,EAAWwI,KAAK0F,EAAM,IAAM,MAAQ,EAE9C,EAMA4mB,EAAS1yB,UAAU+6B,OAAS,WACxB,OAAO19B,OAAOC,aACO,IAAjBwC,KAAKiF,GACLjF,KAAKiF,KAAO,EAAK,IACjBjF,KAAKiF,KAAO,GAAK,IACjBjF,KAAKiF,KAAO,GACK,IAAjBjF,KAAKkF,GACLlF,KAAKkF,KAAO,EAAK,IACjBlF,KAAKkF,KAAO,GAAK,IACjBlF,KAAKkF,KAAO,GAEpB,EAMA0tB,EAAS1yB,UAAUy6B,SAAW,WAC1B,IAAI1a,EAASjgB,KAAKkF,IAAM,GAGxB,OAFAlF,KAAKkF,KAAQlF,KAAKkF,IAAM,EAAIlF,KAAKiF,KAAO,IAAMgb,KAAU,EACxDjgB,KAAKiF,IAAQjF,KAAKiF,IAAM,EAAsBgb,KAAU,EACjDjgB,IACX,EAMA4yB,EAAS1yB,UAAUo0B,SAAW,WAC1B,IAAIrU,IAAmB,EAAVjgB,KAAKiF,IAGlB,OAFAjF,KAAKiF,KAAQjF,KAAKiF,KAAO,EAAIjF,KAAKkF,IAAM,IAAM+a,KAAU,EACxDjgB,KAAKkF,IAAQlF,KAAKkF,KAAO,EAAqB+a,KAAU,EACjDjgB,IACX,EAMA4yB,EAAS1yB,UAAUxE,OAAS,WACxB,IAAIw/B,EAASl7B,KAAKiF,GACdk2B,GAASn7B,KAAKiF,KAAO,GAAKjF,KAAKkF,IAAM,KAAO,EAC5Ck2B,EAASp7B,KAAKkF,KAAO,GACzB,OAAiB,IAAVk2B,EACU,IAAVD,EACED,EAAQ,MACNA,EAAQ,IAAM,EAAI,EAClBA,EAAQ,QAAU,EAAI,EACxBC,EAAQ,MACNA,EAAQ,IAAM,EAAI,EAClBA,EAAQ,QAAU,EAAI,EAC1BC,EAAQ,IAAM,EAAI,EAC7B,qCCtMA,IAAIzX,EAAOvoB,EA2OX,SAASkhB,EAAMke,EAAKa,EAAKlT,GACrB,IAAK,IAAIppB,EAAOD,OAAOC,KAAKs8B,GAAMz+B,EAAI,EAAGA,EAAImC,EAAKrD,SAAUkB,OACnCmB,IAAjBy8B,EAAIz7B,EAAKnC,KAAsBurB,IAC/BqS,EAAIz7B,EAAKnC,IAAMy+B,EAAIt8B,EAAKnC,KAChC,OAAO49B,CACX,CAmBA,SAASc,EAASzvB,GAEd,SAAS0vB,EAAY9xB,EAASmhB,GAE1B,KAAM5qB,gBAAgBu7B,GAClB,OAAO,IAAIA,EAAY9xB,EAASmhB,GAKpC9rB,OAAO6L,eAAe3K,KAAM,UAAW,CAAE8K,IAAK,WAAa,OAAOrB,CAAS,IAGvEzL,MAAMw9B,kBACNx9B,MAAMw9B,kBAAkBx7B,KAAMu7B,GAE9Bz8B,OAAO6L,eAAe3K,KAAM,QAAS,CAAEP,OAAO,IAAIzB,OAAQuN,OAAS,KAEnEqf,GACAtO,EAAMtc,KAAM4qB,EACpB,CA2BA,OAzBA2Q,EAAYr7B,UAAYpB,OAAO2N,OAAOzO,MAAMkC,UAAW,CACnD4M,YAAa,CACTrN,MAAO87B,EACP9f,UAAU,EACV7Q,YAAY,EACZC,cAAc,GAElBgB,KAAM,CACFf,IAAK,WAAiB,OAAOe,CAAM,EACnCd,SAAKhN,EACL6M,YAAY,EAKZC,cAAc,GAElBpM,SAAU,CACNgB,MAAO,WAAmB,OAAOO,KAAK6L,KAAO,KAAO7L,KAAKyJ,OAAS,EAClEgS,UAAU,EACV7Q,YAAY,EACZC,cAAc,KAIf0wB,CACX,CAhTA5X,EAAKhjB,UAAY,EAAQ,MAGzBgjB,EAAKxnB,OAAS,EAAQ,MAGtBwnB,EAAK5jB,aAAe,EAAQ,MAG5B4jB,EAAKmQ,MAAQ,EAAQ,MAGrBnQ,EAAK9iB,QAAU,EAAQ,MAGvB8iB,EAAKpd,KAAO,EAAQ,MAGpBod,EAAK8X,KAAO,EAAQ,MAGpB9X,EAAKiP,SAAW,EAAQ,MAOxBjP,EAAKgS,OAASxO,QAA0B,oBAAXlW,QACPA,QACAA,OAAOnJ,SACPmJ,OAAOnJ,QAAQiJ,UACfE,OAAOnJ,QAAQiJ,SAASC,MAO9C2S,EAAK1S,OAAS0S,EAAKgS,QAAU1kB,QACG,oBAAXhJ,QAA0BA,QACf,oBAAX+B,MAA0BA,MACjChK,KAQd2jB,EAAKgF,WAAa7pB,OAAO4P,OAAS5P,OAAO4P,OAAO,IAAiC,GAOjFiV,EAAK+E,YAAc5pB,OAAO4P,OAAS5P,OAAO4P,OAAO,CAAC,GAAgC,CAAC,EAQnFiV,EAAKjG,UAAYhe,OAAOge,WAAwC,SAAmBje,GAC/E,MAAwB,iBAAVA,GAAsB4d,SAAS5d,IAAUjD,KAAKmD,MAAMF,KAAWA,CACjF,EAOAkkB,EAAK/M,SAAW,SAAkBnX,GAC9B,MAAwB,iBAAVA,GAAsBA,aAAiBlC,MACzD,EAOAomB,EAAKgE,SAAW,SAAkBloB,GAC9B,OAAOA,GAA0B,iBAAVA,CAC3B,EAUAkkB,EAAK+X,MAQL/X,EAAKgY,MAAQ,SAAexvB,EAAK6X,GAC7B,IAAIvkB,EAAQ0M,EAAI6X,GAChB,QAAa,MAATvkB,IAAiB0M,EAAIyC,eAAeoV,MACZ,iBAAVvkB,IAAuBjE,MAAM+Y,QAAQ9U,GAASA,EAAM/D,OAASoD,OAAOC,KAAKU,GAAO/D,QAAU,EAEhH,EAaAioB,EAAKsP,OAAS,WACV,IACI,IAAIA,EAAStP,EAAK9iB,QAAQ,UAAUoyB,OAEpC,OAAOA,EAAO/yB,UAAU07B,UAAY3I,EAAoC,IAC5E,CAAE,MAAO3tB,GAEL,OAAO,IACX,CACH,CATa,GAYdqe,EAAKkY,aAAe,KAGpBlY,EAAKmY,oBAAsB,KAO3BnY,EAAK8E,UAAY,SAAmBsT,GAEhC,MAA8B,iBAAhBA,EACRpY,EAAKsP,OACDtP,EAAKmY,oBAAoBC,GACzB,IAAIpY,EAAKnoB,MAAMugC,GACnBpY,EAAKsP,OACDtP,EAAKkY,aAAaE,GACI,oBAAfp6B,WACHo6B,EACA,IAAIp6B,WAAWo6B,EACjC,EAMApY,EAAKnoB,MAA8B,oBAAfmG,WAA6BA,WAAwCnG,MAezFmoB,EAAKkE,KAAkClE,EAAK1S,OAAO+qB,SAAsCrY,EAAK1S,OAAO+qB,QAAQnU,MACtElE,EAAK1S,OAAO4W,MACvClE,EAAK9iB,QAAQ,QAOzB8iB,EAAKsY,OAAS,mBAOdtY,EAAKuY,QAAU,wBAOfvY,EAAKwY,QAAU,6CAOfxY,EAAKyY,WAAa,SAAoB38B,GAClC,OAAOA,EACDkkB,EAAKiP,SAASiI,KAAKp7B,GAAOw7B,SAC1BtX,EAAKiP,SAASgI,QACxB,EAQAjX,EAAK0Y,aAAe,SAAsBrwB,EAAMsZ,GAC5C,IAAItQ,EAAO2O,EAAKiP,SAASoI,SAAShvB,GAClC,OAAI2X,EAAKkE,KACElE,EAAKkE,KAAKyU,SAAStnB,EAAK/P,GAAI+P,EAAK9P,GAAIogB,GACzCtQ,EAAKuQ,SAAS4B,QAAQ7B,GACjC,EAiBA3B,EAAKrH,MAAQA,EAObqH,EAAKuO,QAAU,SAAiBxf,GAC5B,OAAOA,EAAInW,OAAO,GAAG+L,cAAgBoK,EAAIrH,UAAU,EACvD,EA0DAsY,EAAK2X,SAAWA,EAmBhB3X,EAAK4Y,cAAgBjB,EAAS,iBAoB9B3X,EAAKoK,YAAc,SAAkBH,GAEjC,IADA,IAAI4O,EAAW,CAAC,EACP5/B,EAAI,EAAGA,EAAIgxB,EAAWlyB,SAAUkB,EACrC4/B,EAAS5O,EAAWhxB,IAAM,EAO9B,OAAO,WACH,IAAK,IAAImC,EAAOD,OAAOC,KAAKiB,MAAOpD,EAAImC,EAAKrD,OAAS,EAAGkB,GAAK,IAAKA,EAC9D,GAA0B,IAAtB4/B,EAASz9B,EAAKnC,UAA+BmB,IAAlBiC,KAAKjB,EAAKnC,KAAuC,OAAlBoD,KAAKjB,EAAKnC,IACpE,OAAOmC,EAAKnC,EACxB,CACJ,EAeA+mB,EAAKqK,YAAc,SAAkBJ,GAQjC,OAAO,SAAS/hB,GACZ,IAAK,IAAIjP,EAAI,EAAGA,EAAIgxB,EAAWlyB,SAAUkB,EACjCgxB,EAAWhxB,KAAOiP,UACX7L,KAAK4tB,EAAWhxB,GACnC,CACJ,EAkBA+mB,EAAKsD,cAAgB,CACjBwV,MAAOl/B,OACPm/B,MAAOn/B,OACP+U,MAAO/U,OACPwjB,MAAM,GAIV4C,EAAKwF,WAAa,WACd,IAAI8J,EAAStP,EAAKsP,OAEbA,GAMLtP,EAAKkY,aAAe5I,EAAO4H,OAASl5B,WAAWk5B,MAAQ5H,EAAO4H,MAE1D,SAAqBp7B,EAAOk9B,GACxB,OAAO,IAAI1J,EAAOxzB,EAAOk9B,EAC7B,EACJhZ,EAAKmY,oBAAsB7I,EAAO2J,aAE9B,SAA4B12B,GACxB,OAAO,IAAI+sB,EAAO/sB,EACtB,GAdAyd,EAAKkY,aAAelY,EAAKmY,oBAAsB,IAevD,8BCpbA3gC,EAAOC,QAwHP,SAAkBqpB,GAGd,IAAIZ,EAAMF,EAAKzlB,QAAQ,CAAC,KAAMumB,EAAM5Y,KAAO,UAAjC8X,CACT,oCADSA,CAEL,WAAY,mBAEbkZ,EAAiB,CAAC,EADTpY,EAAM8U,YAER79B,QAAQmoB,EAClB,YAED,IAAK,IAAIjnB,EAAI,EAAGA,EAAsB6nB,EAAMC,YAAYhpB,SAAUkB,EAAG,CACjE,IAAIknB,EAAQW,EAAMiB,aAAa9oB,GAAGb,UAC9B8jB,EAAQ,IAAM8D,EAAKgB,SAASb,EAAMjY,MAMtC,GAJIiY,EAAMwC,UAAUzC,EACnB,sCAAuChE,EAAKiE,EAAMjY,MAG/CiY,EAAMpY,IAAOmY,EACZ,yBAA0BhE,EADdgE,CAER,WAAYiZ,EAAQhZ,EAAO,UAFnBD,CAGZ,wBAAyBhE,EAHbgE,CAIZ,gCACGkZ,EAAalZ,EAAKC,EAAO,QACzBkZ,EAAenZ,EAAKC,EAAOlnB,EAAGijB,EAAM,SAApCmd,CACH,UAGE,GAAIlZ,EAAMM,SAAYP,EACxB,yBAA0BhE,EADFgE,CAEpB,WAAYiZ,EAAQhZ,EAAO,SAFPD,CAGxB,gCAAiChE,GAC9Bmd,EAAenZ,EAAKC,EAAOlnB,EAAGijB,EAAM,MAApCmd,CACH,SAGE,CACH,GAAIlZ,EAAMoB,OAAQ,CACd,IAAI+X,EAAYtZ,EAAKgB,SAASb,EAAMoB,OAAOrZ,MACD,IAAtCgxB,EAAe/Y,EAAMoB,OAAOrZ,OAAagY,EAChD,cAAeoZ,EADiCpZ,CAE5C,WAAYC,EAAMoB,OAAOrZ,KAAO,qBACjCgxB,EAAe/Y,EAAMoB,OAAOrZ,MAAQ,EACpCgY,EACH,QAASoZ,EACV,CACAD,EAAenZ,EAAKC,EAAOlnB,EAAGijB,EAClC,CACIiE,EAAMwC,UAAUzC,EACnB,IACL,CACA,OAAOA,EACN,cAEL,EA7KA,IAAIH,EAAY,EAAQ,MACpBC,EAAY,EAAQ,MAExB,SAASmZ,EAAQhZ,EAAOkV,GACpB,OAAOlV,EAAMjY,KAAO,KAAOmtB,GAAYlV,EAAMM,UAAyB,UAAb4U,EAAuB,KAAOlV,EAAMpY,KAAoB,WAAbstB,EAAwB,MAAMlV,EAAMjC,QAAQ,IAAM,IAAM,WAChK,CAWA,SAASmb,EAAenZ,EAAKC,EAAOC,EAAYlE,GAE5C,GAAIiE,EAAMI,aACN,GAAIJ,EAAMI,wBAAwBR,EAAM,CAAEG,EACrC,cAAehE,EADsBgE,CAEjC,WAFiCA,CAG7B,WAAYiZ,EAAQhZ,EAAO,eACpC,IAAK,IAAI/kB,EAAOD,OAAOC,KAAK+kB,EAAMI,aAAazB,QAASrlB,EAAI,EAAGA,EAAI2B,EAAKrD,SAAU0B,EAAGymB,EAChF,WAAYC,EAAMI,aAAazB,OAAO1jB,EAAK3B,KAChDymB,EACS,QADTA,CAEC,IACL,MACIA,EACC,IADDA,CAEK,8BAA+BE,EAAYlE,EAFhDgE,CAGK,QAHLA,CAIS,aAAcC,EAAMjY,KAAO,IAJpCgY,CAKC,UAGL,OAAQC,EAAM5b,MACV,IAAK,QACL,IAAK,SACL,IAAK,SACL,IAAK,UACL,IAAK,WAAY2b,EACZ,0BAA2BhE,EADfgE,CAER,WAAYiZ,EAAQhZ,EAAO,YAChC,MACJ,IAAK,QACL,IAAK,SACL,IAAK,SACL,IAAK,UACL,IAAK,WAAYD,EACZ,kFAAmFhE,EAAKA,EAAKA,EAAKA,EADtFgE,CAER,WAAYiZ,EAAQhZ,EAAO,iBAChC,MACJ,IAAK,QACL,IAAK,SAAUD,EACV,2BAA8BhE,EADpBgE,CAEN,WAAYiZ,EAAQhZ,EAAO,WAChC,MACJ,IAAK,OAAQD,EACR,4BAA+BhE,EADvBgE,CAEJ,WAAYiZ,EAAQhZ,EAAO,YAChC,MACJ,IAAK,SAAUD,EACV,yBAA0BhE,EADhBgE,CAEN,WAAYiZ,EAAQhZ,EAAO,WAChC,MACJ,IAAK,QAASD,EACT,4DAA+DhE,EAAKA,EAAKA,EADhEgE,CAEL,WAAYiZ,EAAQhZ,EAAO,WAI5C,OAAOD,CAEX,CAUA,SAASkZ,EAAalZ,EAAKC,EAAOjE,GAE9B,OAAQiE,EAAMjC,SACV,IAAK,QACL,IAAK,SACL,IAAK,SACL,IAAK,UACL,IAAK,WAAYgC,EACZ,6BAA8BhE,EADlBgE,CAER,WAAYiZ,EAAQhZ,EAAO,gBAChC,MACJ,IAAK,QACL,IAAK,SACL,IAAK,SACL,IAAK,UACL,IAAK,WAAYD,EACZ,6BAA8BhE,EADlBgE,CAER,WAAYiZ,EAAQhZ,EAAO,qBAChC,MACJ,IAAK,OAAQD,EACR,4BAA6BhE,EADrBgE,CAEJ,WAAYiZ,EAAQhZ,EAAO,gBAGxC,OAAOD,CAEX,+BC3GA,IAAImG,EAAW5uB,EAEX2uB,EAAU,EAAQ,MA6BtBC,EAAS,wBAA0B,CAE/BxF,WAAY,SAAShJ,GAGjB,GAAIA,GAAUA,EAAO,SAAU,CAE3B,IAAI3P,EAAO2P,EAAO,SAASnQ,UAAUmQ,EAAO,SAAS4Z,YAAY,KAAO,GACpEltB,EAAOlI,KAAKysB,OAAO5gB,GAEvB,GAAI3D,EAAM,CAEN,IAAImZ,EAAyC,MAA9B7F,EAAO,SAASjf,OAAO,GAClCif,EAAO,SAAS/d,MAAM,GAAK+d,EAAO,SAKtC,OAH+B,IAA3B6F,EAASxO,QAAQ,OACjBwO,EAAW,IAAMA,GAEdrhB,KAAKyM,OAAO,CACf4U,SAAUA,EACV5hB,MAAOyI,EAAKrL,OAAOqL,EAAKsc,WAAWhJ,IAASwZ,UAEpD,CACJ,CAEA,OAAOh1B,KAAKwkB,WAAWhJ,EAC3B,EAEAoJ,SAAU,SAASnb,EAAS1I,GAGxB,IACI6E,EAAS,GACTiG,EAAO,GAGX,GAAI9K,GAAWA,EAAQggB,MAAQtX,EAAQ4X,UAAY5X,EAAQhK,MAAO,CAE9DoM,EAAOpC,EAAQ4X,SAAShW,UAAU5B,EAAQ4X,SAAS+T,YAAY,KAAO,GAEtExvB,EAAS6D,EAAQ4X,SAAShW,UAAU,EAAG5B,EAAQ4X,SAAS+T,YAAY,KAAO,GAC3E,IAAIltB,EAAOlI,KAAKysB,OAAO5gB,GAEnB3D,IACAuB,EAAUvB,EAAKtK,OAAO6L,EAAQhK,OACtC,CAGA,KAAMgK,aAAmBzJ,KAAK4oB,OAASnf,aAAmBsgB,EAAS,CAC/D,IAAIvO,EAAS/R,EAAQohB,MAAMjG,SAASnb,EAAS1I,GAS7C,MALe,KAAX6E,IACAA,EAvBQ,wBAyBZiG,EAAOjG,GANyC,MAA9B6D,EAAQohB,MAAMxG,SAAS,GACrC5a,EAAQohB,MAAMxG,SAAS5mB,MAAM,GAAKgM,EAAQohB,MAAMxG,UAMpD7I,EAAO,SAAW3P,EACX2P,CACX,CAEA,OAAOxb,KAAK4kB,SAASnb,EAAS1I,EAClC,gCCnGJ5F,EAAOC,QAAU8uB,EAEjB,IAEIC,EAFAxG,EAAY,EAAQ,MAIpBiP,EAAYjP,EAAKiP,SACjBz2B,EAAYwnB,EAAKxnB,OACjBoK,EAAYod,EAAKpd,KAWrB,SAAS22B,EAAG7hC,EAAImL,EAAKlE,GAMjBtC,KAAK3E,GAAKA,EAMV2E,KAAKwG,IAAMA,EAMXxG,KAAKkO,UAAOnQ,EAMZiC,KAAKsC,IAAMA,CACf,CAGA,SAAS66B,IAAQ,CAUjB,SAASC,EAAMtS,GAMX9qB,KAAKuvB,KAAOzE,EAAOyE,KAMnBvvB,KAAKq9B,KAAOvS,EAAOuS,KAMnBr9B,KAAKwG,IAAMskB,EAAOtkB,IAMlBxG,KAAKkO,KAAO4c,EAAOwS,MACvB,CAOA,SAASpT,IAMLlqB,KAAKwG,IAAM,EAMXxG,KAAKuvB,KAAO,IAAI2N,EAAGC,EAAM,EAAG,GAM5Bn9B,KAAKq9B,KAAOr9B,KAAKuvB,KAMjBvvB,KAAKs9B,OAAS,IAOlB,CAEA,IAAI7wB,EAAS,WACT,OAAOkX,EAAKsP,OACN,WACE,OAAQ/I,EAAOzd,OAAS,WACpB,OAAO,IAAI0d,CACf,IACJ,EAEE,WACE,OAAO,IAAID,CACf,CACR,EAqCA,SAASqT,EAAUj7B,EAAKC,EAAKC,GACzBD,EAAIC,GAAa,IAANF,CACf,CAmBA,SAASk7B,EAASh3B,EAAKlE,GACnBtC,KAAKwG,IAAMA,EACXxG,KAAKkO,UAAOnQ,EACZiC,KAAKsC,IAAMA,CACf,CA6CA,SAASm7B,EAAcn7B,EAAKC,EAAKC,GAC7B,KAAOF,EAAI4C,IACP3C,EAAIC,KAAkB,IAATF,EAAI2C,GAAW,IAC5B3C,EAAI2C,IAAM3C,EAAI2C,KAAO,EAAI3C,EAAI4C,IAAM,MAAQ,EAC3C5C,EAAI4C,MAAQ,EAEhB,KAAO5C,EAAI2C,GAAK,KACZ1C,EAAIC,KAAkB,IAATF,EAAI2C,GAAW,IAC5B3C,EAAI2C,GAAK3C,EAAI2C,KAAO,EAExB1C,EAAIC,KAASF,EAAI2C,EACrB,CA0CA,SAASy4B,EAAap7B,EAAKC,EAAKC,GAC5BD,EAAIC,GAA0B,IAAdF,EAChBC,EAAIC,EAAM,GAAMF,IAAQ,EAAM,IAC9BC,EAAIC,EAAM,GAAMF,IAAQ,GAAM,IAC9BC,EAAIC,EAAM,GAAMF,IAAQ,EAC5B,CA9JA4nB,EAAOzd,OAASA,IAOhByd,EAAOjkB,MAAQ,SAAeC,GAC1B,OAAO,IAAIyd,EAAKnoB,MAAM0K,EAC1B,EAIIyd,EAAKnoB,QAAUA,QACf0uB,EAAOjkB,MAAQ0d,EAAK8X,KAAKvR,EAAOjkB,MAAO0d,EAAKnoB,MAAM0E,UAAUqzB,WAUhErJ,EAAOhqB,UAAUy9B,MAAQ,SAActiC,EAAImL,EAAKlE,GAG5C,OAFAtC,KAAKq9B,KAAOr9B,KAAKq9B,KAAKnvB,KAAO,IAAIgvB,EAAG7hC,EAAImL,EAAKlE,GAC7CtC,KAAKwG,KAAOA,EACLxG,IACX,EA6BAw9B,EAASt9B,UAAYpB,OAAO2N,OAAOywB,EAAGh9B,WACtCs9B,EAASt9B,UAAU7E,GAxBnB,SAAuBiH,EAAKC,EAAKC,GAC7B,KAAOF,EAAM,KACTC,EAAIC,KAAe,IAANF,EAAY,IACzBA,KAAS,EAEbC,EAAIC,GAAOF,CACf,EAyBA4nB,EAAOhqB,UAAUszB,OAAS,SAAsB/zB,GAW5C,OARAO,KAAKwG,MAAQxG,KAAKq9B,KAAOr9B,KAAKq9B,KAAKnvB,KAAO,IAAIsvB,GACzC/9B,KAAkB,GACT,IAAY,EACpBA,EAAQ,MAAY,EACpBA,EAAQ,QAAY,EACpBA,EAAQ,UAAY,EACA,EAC1BA,IAAQ+G,IACDxG,IACX,EAQAkqB,EAAOhqB,UAAUuzB,MAAQ,SAAqBh0B,GAC1C,OAAOA,EAAQ,EACTO,KAAK29B,MAAMF,EAAe,GAAI7K,EAASpK,WAAW/oB,IAClDO,KAAKwzB,OAAO/zB,EACtB,EAOAyqB,EAAOhqB,UAAUwzB,OAAS,SAAsBj0B,GAC5C,OAAOO,KAAKwzB,QAAQ/zB,GAAS,EAAIA,GAAS,MAAQ,EACtD,EAqBAyqB,EAAOhqB,UAAUk0B,OAAS,SAAsB30B,GAC5C,IAAIuV,EAAO4d,EAASiI,KAAKp7B,GACzB,OAAOO,KAAK29B,MAAMF,EAAezoB,EAAKtZ,SAAUsZ,EACpD,EASAkV,EAAOhqB,UAAUi0B,MAAQjK,EAAOhqB,UAAUk0B,OAQ1ClK,EAAOhqB,UAAUm0B,OAAS,SAAsB50B,GAC5C,IAAIuV,EAAO4d,EAASiI,KAAKp7B,GAAOk7B,WAChC,OAAO36B,KAAK29B,MAAMF,EAAezoB,EAAKtZ,SAAUsZ,EACpD,EAOAkV,EAAOhqB,UAAUyzB,KAAO,SAAoBl0B,GACxC,OAAOO,KAAK29B,MAAMJ,EAAW,EAAG99B,EAAQ,EAAI,EAChD,EAcAyqB,EAAOhqB,UAAU0zB,QAAU,SAAuBn0B,GAC9C,OAAOO,KAAK29B,MAAMD,EAAc,EAAGj+B,IAAU,EACjD,EAQAyqB,EAAOhqB,UAAU2zB,SAAW3J,EAAOhqB,UAAU0zB,QAQ7C1J,EAAOhqB,UAAUq0B,QAAU,SAAuB90B,GAC9C,IAAIuV,EAAO4d,EAASiI,KAAKp7B,GACzB,OAAOO,KAAK29B,MAAMD,EAAc,EAAG1oB,EAAK/P,IAAI04B,MAAMD,EAAc,EAAG1oB,EAAK9P,GAC5E,EASAglB,EAAOhqB,UAAUs0B,SAAWtK,EAAOhqB,UAAUq0B,QAQ7CrK,EAAOhqB,UAAU4zB,MAAQ,SAAqBr0B,GAC1C,OAAOO,KAAK29B,MAAMha,EAAKmQ,MAAMlxB,aAAc,EAAGnD,EAClD,EAQAyqB,EAAOhqB,UAAU6zB,OAAS,SAAsBt0B,GAC5C,OAAOO,KAAK29B,MAAMha,EAAKmQ,MAAMrvB,cAAe,EAAGhF,EACnD,EAEA,IAAIm+B,EAAaja,EAAKnoB,MAAM0E,UAAU6K,IAChC,SAAwBzI,EAAKC,EAAKC,GAChCD,EAAIwI,IAAIzI,EAAKE,EACjB,EAEE,SAAwBF,EAAKC,EAAKC,GAChC,IAAK,IAAI5F,EAAI,EAAGA,EAAI0F,EAAI5G,SAAUkB,EAC9B2F,EAAIC,EAAM5F,GAAK0F,EAAI1F,EAC3B,EAOJstB,EAAOhqB,UAAUoS,MAAQ,SAAqB7S,GAC1C,IAAI+G,EAAM/G,EAAM/D,SAAW,EAC3B,IAAK8K,EACD,OAAOxG,KAAK29B,MAAMJ,EAAW,EAAG,GACpC,GAAI5Z,EAAK/M,SAASnX,GAAQ,CACtB,IAAI8C,EAAM2nB,EAAOjkB,MAAMO,EAAMrK,EAAOT,OAAO+D,IAC3CtD,EAAOyB,OAAO6B,EAAO8C,EAAK,GAC1B9C,EAAQ8C,CACZ,CACA,OAAOvC,KAAKwzB,OAAOhtB,GAAKm3B,MAAMC,EAAYp3B,EAAK/G,EACnD,EAOAyqB,EAAOhqB,UAAU9D,OAAS,SAAsBqD,GAC5C,IAAI+G,EAAMD,EAAK7K,OAAO+D,GACtB,OAAO+G,EACDxG,KAAKwzB,OAAOhtB,GAAKm3B,MAAMp3B,EAAKG,MAAOF,EAAK/G,GACxCO,KAAK29B,MAAMJ,EAAW,EAAG,EACnC,EAOArT,EAAOhqB,UAAU25B,KAAO,WAIpB,OAHA75B,KAAKs9B,OAAS,IAAIF,EAAMp9B,MACxBA,KAAKuvB,KAAOvvB,KAAKq9B,KAAO,IAAIH,EAAGC,EAAM,EAAG,GACxCn9B,KAAKwG,IAAM,EACJxG,IACX,EAMAkqB,EAAOhqB,UAAUmW,MAAQ,WAUrB,OATIrW,KAAKs9B,QACLt9B,KAAKuvB,KAASvvB,KAAKs9B,OAAO/N,KAC1BvvB,KAAKq9B,KAASr9B,KAAKs9B,OAAOD,KAC1Br9B,KAAKwG,IAASxG,KAAKs9B,OAAO92B,IAC1BxG,KAAKs9B,OAASt9B,KAAKs9B,OAAOpvB,OAE1BlO,KAAKuvB,KAAOvvB,KAAKq9B,KAAO,IAAIH,EAAGC,EAAM,EAAG,GACxCn9B,KAAKwG,IAAO,GAETxG,IACX,EAMAkqB,EAAOhqB,UAAU45B,OAAS,WACtB,IAAIvK,EAAOvvB,KAAKuvB,KACZ8N,EAAOr9B,KAAKq9B,KACZ72B,EAAOxG,KAAKwG,IAOhB,OANAxG,KAAKqW,QAAQmd,OAAOhtB,GAChBA,IACAxG,KAAKq9B,KAAKnvB,KAAOqhB,EAAKrhB,KACtBlO,KAAKq9B,KAAOA,EACZr9B,KAAKwG,KAAOA,GAETxG,IACX,EAMAkqB,EAAOhqB,UAAU80B,OAAS,WAItB,IAHA,IAAIzF,EAAOvvB,KAAKuvB,KAAKrhB,KACjB3L,EAAOvC,KAAK8M,YAAY7G,MAAMjG,KAAKwG,KACnChE,EAAO,EACJ+sB,GACHA,EAAKl0B,GAAGk0B,EAAKjtB,IAAKC,EAAKC,GACvBA,GAAO+sB,EAAK/oB,IACZ+oB,EAAOA,EAAKrhB,KAGhB,OAAO3L,CACX,EAEA2nB,EAAOf,WAAa,SAAS0U,GACzB1T,EAAe0T,EACf3T,EAAOzd,OAASA,IAChB0d,EAAahB,YACjB,8BC/cAhuB,EAAOC,QAAU+uB,EAGjB,IAAID,EAAS,EAAQ,OACpBC,EAAajqB,UAAYpB,OAAO2N,OAAOyd,EAAOhqB,YAAY4M,YAAcqd,EAEzE,IAAIxG,EAAO,EAAQ,MAQnB,SAASwG,IACLD,EAAO5jB,KAAKtG,KAChB,CAuCA,SAAS89B,EAAkBx7B,EAAKC,EAAKC,GAC7BF,EAAI5G,OAAS,GACbioB,EAAKpd,KAAKG,MAAMpE,EAAKC,EAAKC,GACrBD,EAAIq5B,UACTr5B,EAAIq5B,UAAUt5B,EAAKE,GAEnBD,EAAImE,MAAMpE,EAAKE,EACvB,CA5CA2nB,EAAahB,WAAa,WAOtBgB,EAAalkB,MAAQ0d,EAAKmY,oBAE1B3R,EAAa4T,iBAAmBpa,EAAKsP,QAAUtP,EAAKsP,OAAO/yB,qBAAqByB,YAAiD,QAAnCgiB,EAAKsP,OAAO/yB,UAAU6K,IAAIc,KAClH,SAA8BvJ,EAAKC,EAAKC,GACxCD,EAAIwI,IAAIzI,EAAKE,EAEf,EAEE,SAA+BF,EAAKC,EAAKC,GACzC,GAAIF,EAAI07B,KACN17B,EAAI07B,KAAKz7B,EAAKC,EAAK,EAAGF,EAAI5G,aACvB,IAAK,IAAIkB,EAAI,EAAGA,EAAI0F,EAAI5G,QAC3B6G,EAAIC,KAASF,EAAI1F,IACrB,CACR,EAMAutB,EAAajqB,UAAUoS,MAAQ,SAA4B7S,GACnDkkB,EAAK/M,SAASnX,KACdA,EAAQkkB,EAAKkY,aAAap8B,EAAO,WACrC,IAAI+G,EAAM/G,EAAM/D,SAAW,EAI3B,OAHAsE,KAAKwzB,OAAOhtB,GACRA,GACAxG,KAAK29B,MAAMxT,EAAa4T,iBAAkBv3B,EAAK/G,GAC5CO,IACX,EAcAmqB,EAAajqB,UAAU9D,OAAS,SAA6BqD,GACzD,IAAI+G,EAAMmd,EAAKsP,OAAOgL,WAAWx+B,GAIjC,OAHAO,KAAKwzB,OAAOhtB,GACRA,GACAxG,KAAK29B,MAAMG,EAAmBt3B,EAAK/G,GAChCO,IACX,EAUAmqB,EAAahB,uCCxDb,MAAM+U,EACF,oBAAOC,CAAcC,GACjB,MAHkB,yBAGXt/B,OAAOoB,UAAUzB,SAAS6H,KAAK83B,EAC1C,CACA,oBAAOC,CAAcD,GACjB,OAAIp+B,KAAKm+B,cAAcC,GACZA,EAEPA,EAAKH,aAAeG,EAAKthC,OAAOmhC,YAGZ,IAApBG,EAAKE,YAAoBF,EAAKH,aAAeG,EAAKthC,OAAOmhC,WAFlDG,EAAKthC,OAKTkD,KAAKu+B,aAAaH,EAAKthC,QACzBW,MAAM2gC,EAAKE,WAAYF,EAAKE,WAAaF,EAAKH,YAC9CnhC,MACT,CACA,mBAAOyhC,CAAaH,GAChB,OAAOp+B,KAAKw+B,OAAOJ,EAAMz8B,WAC7B,CACA,aAAO68B,CAAOJ,EAAMl2B,GAChB,GAAIk2B,EAAKtxB,cAAgB5E,EACrB,OAAOk2B,EAEX,GAAIp+B,KAAKm+B,cAAcC,GACnB,OAAO,IAAIl2B,EAAKk2B,GAEpB,GAAIp+B,KAAKy+B,kBAAkBL,GACvB,OAAO,IAAIl2B,EAAKk2B,EAAKthC,OAAQshC,EAAKE,WAAYF,EAAKH,YAEvD,MAAM,IAAI3xB,UAAU,uEACxB,CACA,qBAAOoyB,CAAeN,GAClB,OAAOp+B,KAAKy+B,kBAAkBL,IACvBp+B,KAAKm+B,cAAcC,EAC9B,CACA,wBAAOK,CAAkBL,GACrB,OAAOprB,YAAYwB,OAAO4pB,IAClBA,GAAQp+B,KAAKm+B,cAAcC,EAAKthC,OAC5C,CACA,cAAO6hC,CAAQtE,EAAGh9B,GACd,MAAMuhC,EAAQV,EAAsBK,aAAalE,GAC3CwE,EAAQX,EAAsBK,aAAalhC,GACjD,GAAIuhC,EAAMljC,SAAWmjC,EAAMZ,WACvB,OAAO,EAEX,IAAK,IAAIrhC,EAAI,EAAGA,EAAIgiC,EAAMljC,OAAQkB,IAC9B,GAAIgiC,EAAMhiC,KAAOiiC,EAAMjiC,GACnB,OAAO,EAGf,OAAO,CACX,CACA,aAAO+S,IAAUlP,GACb,IAAIq+B,EAKAA,GAJAtjC,MAAM+Y,QAAQ9T,EAAK,KAASA,EAAK,aAActB,SAG1C3D,MAAM+Y,QAAQ9T,EAAK,KAAOA,EAAK,aAActB,SACxCsB,EAAK,GAGXA,EAAKA,EAAK/E,OAAS,aAAcyD,SACvBsB,EAAKhD,MAAM,EAAGgD,EAAK/E,OAAS,GAG5B+E,EAVJA,EAAK,GAanB,IAAIyF,EAAO,EACX,IAAK,MAAMpJ,KAAUgiC,EACjB54B,GAAQpJ,EAAOmhC,WAEnB,MAAMc,EAAM,IAAIp9B,WAAWuE,GAC3B,IAAIvK,EAAS,EACb,IAAK,MAAMmB,KAAUgiC,EAAS,CAC1B,MAAME,EAAOh/B,KAAKu+B,aAAazhC,GAC/BiiC,EAAIh0B,IAAIi0B,EAAMrjC,GACdA,GAAUqjC,EAAKtjC,MACnB,CACA,OAAI+E,EAAKA,EAAK/E,OAAS,aAAcyD,SAC1Ba,KAAKw+B,OAAOO,EAAKt+B,EAAKA,EAAK/E,OAAS,IAExCqjC,EAAIjiC,MACf,EAGJ,MAAMmiC,EAAc,SACdC,EAAY,eACZC,EAAe,mEACfC,EAAkB,mBACxB,MAAMC,EACF,iBAAOvE,CAAW1C,GACd,MAAM7iB,EAAIkiB,SAAS6H,mBAAmBlH,IAChCmH,EAAY,IAAI59B,WAAW4T,EAAE7Z,QACnC,IAAK,IAAIkB,EAAI,EAAGA,EAAI2Y,EAAE7Z,OAAQkB,IAC1B2iC,EAAU3iC,GAAK2Y,EAAEzX,WAAWlB,GAEhC,OAAO2iC,EAAUziC,MACrB,CACA,eAAO2B,CAAS3B,GACZ,MAAMyF,EAAM27B,EAAsBK,aAAazhC,GAC/C,IAAI0iC,EAAgB,GACpB,IAAK,IAAI5iC,EAAI,EAAGA,EAAI2F,EAAI7G,OAAQkB,IAC5B4iC,GAAiBjiC,OAAOC,aAAa+E,EAAI3F,IAG7C,OADsB6iC,mBAAmBC,OAAOF,GAEpD,EAEJ,MAAMG,EACF,eAAOlhC,CAAS3B,EAAQ8iC,GAAe,GACnC,MAAMpoB,EAAc0mB,EAAsBG,cAAcvhC,GAClD+iC,EAAW,IAAIC,SAAStoB,GAC9B,IAAIunB,EAAM,GACV,IAAK,IAAIniC,EAAI,EAAGA,EAAI4a,EAAYymB,WAAYrhC,GAAK,EAAG,CAChD,MAAMyP,EAAOwzB,EAASE,UAAUnjC,EAAGgjC,GACnCb,GAAOxhC,OAAOC,aAAa6O,EAC/B,CACA,OAAO0yB,CACX,CACA,iBAAOjE,CAAW1C,EAAMwH,GAAe,GACnC,MAAMb,EAAM,IAAI/rB,YAA0B,EAAdolB,EAAK18B,QAC3BmkC,EAAW,IAAIC,SAASf,GAC9B,IAAK,IAAIniC,EAAI,EAAGA,EAAIw7B,EAAK18B,OAAQkB,IAC7BijC,EAASG,UAAc,EAAJpjC,EAAOw7B,EAAKt6B,WAAWlB,GAAIgjC,GAElD,OAAOb,CACX,EAEJ,MAAMkB,EACF,YAAOC,CAAM9B,GACT,cAAcA,IAASa,GAChBC,EAAUjhC,KAAKmgC,EAC1B,CACA,eAAO+B,CAAS/B,GACZ,cAAcA,IAASa,GAChBE,EAAalhC,KAAKmgC,EAC7B,CACA,kBAAOgC,CAAYhC,GACf,cAAcA,IAASa,GAChBG,EAAgBnhC,KAAKmgC,EAChC,CACA,eAAOiC,CAASvjC,EAAQwjC,EAAM,QAC1B,MAAM/9B,EAAM27B,EAAsBK,aAAazhC,GAC/C,OAAQwjC,EAAIh4B,eACR,IAAK,OACD,OAAOtI,KAAKugC,aAAah+B,GAC7B,IAAK,SACD,OAAOvC,KAAKwgC,SAASj+B,GACzB,IAAK,MACD,OAAOvC,KAAKygC,MAAMl+B,GACtB,IAAK,SACD,OAAOvC,KAAK0gC,SAASn+B,GACzB,IAAK,YACD,OAAOvC,KAAK2gC,YAAYp+B,GAC5B,IAAK,UACD,OAAOo9B,EAAelhC,SAAS8D,GAAK,GACxC,IAAK,QACL,IAAK,UACD,OAAOo9B,EAAelhC,SAAS8D,GACnC,QACI,MAAM,IAAIvE,MAAM,6BAA6BsiC,MAEzD,CACA,iBAAOM,CAAWluB,EAAK4tB,EAAM,QACzB,IAAK5tB,EACD,OAAO,IAAIM,YAAY,GAE3B,OAAQstB,EAAIh4B,eACR,IAAK,OACD,OAAOtI,KAAK6gC,eAAenuB,GAC/B,IAAK,SACD,OAAO1S,KAAK8gC,WAAWpuB,GAC3B,IAAK,MACD,OAAO1S,KAAK+gC,QAAQruB,GACxB,IAAK,SACD,OAAO1S,KAAKghC,WAAWtuB,GAC3B,IAAK,YACD,OAAO1S,KAAKihC,cAAcvuB,GAC9B,IAAK,UACD,OAAOitB,EAAe7E,WAAWpoB,GAAK,GAC1C,IAAK,QACL,IAAK,UACD,OAAOitB,EAAe7E,WAAWpoB,GACrC,QACI,MAAM,IAAI1U,MAAM,6BAA6BsiC,MAEzD,CACA,eAAOI,CAAS5jC,GACZ,MAAMyF,EAAM27B,EAAsBK,aAAazhC,GAC/C,GAAoB,oBAATokC,KAAsB,CAC7B,MAAM7/B,EAASrB,KAAKqgC,SAAS99B,EAAK,UAClC,OAAO2+B,KAAK7/B,EAChB,CAEI,OAAO4xB,OAAO4H,KAAKt4B,GAAK9D,SAAS,SAEzC,CACA,iBAAOuiC,CAAW7kC,GACd,MAAMglC,EAAYnhC,KAAKohC,aAAajlC,GACpC,IAAKglC,EACD,OAAO,IAAInuB,YAAY,GAE3B,IAAKitB,EAAQE,SAASgB,GAClB,MAAM,IAAI70B,UAAU,+CAExB,MAAoB,oBAAT+S,KACArf,KAAK8gC,WAAWzhB,KAAK8hB,IAGrB,IAAIx/B,WAAWsxB,OAAO4H,KAAKsG,EAAW,WAAWrkC,MAEhE,CACA,oBAAOmkC,CAAcI,GACjB,MAAMF,EAAYnhC,KAAKohC,aAAaC,GACpC,IAAKF,EACD,OAAO,IAAInuB,YAAY,GAE3B,IAAKitB,EAAQG,YAAYe,GACrB,MAAM,IAAI70B,UAAU,iDAExB,OAAOtM,KAAKghC,WAAWhhC,KAAKshC,cAAcH,EAAU7hC,QAAQ,MAAO,KAAKA,QAAQ,MAAO,MAC3F,CACA,kBAAOqhC,CAAYvC,GACf,OAAOp+B,KAAK0gC,SAAStC,GAAM9+B,QAAQ,MAAO,KAAKA,QAAQ,MAAO,KAAKA,QAAQ,MAAO,GACtF,CACA,qBAAOuhC,CAAezI,EAAMuE,EAAWsD,EAAQsB,uBAC3C,OAAQ5E,GACJ,IAAK,QACD,OAAO38B,KAAK8gC,WAAW1I,GAC3B,IAAK,OACD,OAAOiH,EAAcvE,WAAW1C,GACpC,IAAK,QACL,IAAK,UACD,OAAOuH,EAAe7E,WAAW1C,GACrC,IAAK,UACL,IAAK,OACD,OAAOuH,EAAe7E,WAAW1C,GAAM,GAC3C,QACI,MAAM,IAAIp6B,MAAM,6BAA6B2+B,MAEzD,CACA,mBAAO4D,CAAazjC,EAAQ6/B,EAAWsD,EAAQsB,uBAC3C,OAAQ5E,GACJ,IAAK,QACD,OAAO38B,KAAKwgC,SAAS1jC,GACzB,IAAK,OACD,OAAOuiC,EAAc5gC,SAAS3B,GAClC,IAAK,QACL,IAAK,UACD,OAAO6iC,EAAelhC,SAAS3B,GACnC,IAAK,UACL,IAAK,OACD,OAAO6iC,EAAelhC,SAAS3B,GAAQ,GAC3C,QACI,MAAM,IAAIkB,MAAM,6BAA6B2+B,MAEzD,CACA,iBAAOmE,CAAW1I,GACd,MAAMoJ,EAAepJ,EAAK18B,OACpB+lC,EAAa,IAAI9/B,WAAW6/B,GAClC,IAAK,IAAI5kC,EAAI,EAAGA,EAAI4kC,EAAc5kC,IAC9B6kC,EAAW7kC,GAAKw7B,EAAKt6B,WAAWlB,GAEpC,OAAO6kC,EAAW3kC,MACtB,CACA,eAAO0jC,CAAS1jC,GACZ,MAAMyF,EAAM27B,EAAsBK,aAAazhC,GAC/C,IAAIiiC,EAAM,GACV,IAAK,IAAIniC,EAAI,EAAGA,EAAI2F,EAAI7G,OAAQkB,IAC5BmiC,GAAOxhC,OAAOC,aAAa+E,EAAI3F,IAEnC,OAAOmiC,CACX,CACA,YAAO0B,CAAM3jC,GACT,MAAMyF,EAAM27B,EAAsBK,aAAazhC,GAC/C,IAAIqR,EAAS,GACb,MAAM3H,EAAMjE,EAAI7G,OAChB,IAAK,IAAIkB,EAAI,EAAGA,EAAI4J,EAAK5J,IAAK,CAC1B,MAAM8kC,EAAOn/B,EAAI3F,GACb8kC,EAAO,KACPvzB,GAAU,KAEdA,GAAUuzB,EAAKjjC,SAAS,GAC5B,CACA,OAAO0P,CACX,CACA,cAAO4yB,CAAQY,GACX,IAAIR,EAAYnhC,KAAKohC,aAAaO,GAClC,IAAKR,EACD,OAAO,IAAInuB,YAAY,GAE3B,IAAKitB,EAAQC,MAAMiB,GACf,MAAM,IAAI70B,UAAU,2CAEpB60B,EAAUzlC,OAAS,IACnBylC,EAAY,IAAIA,KAEpB,MAAMpC,EAAM,IAAIp9B,WAAWw/B,EAAUzlC,OAAS,GAC9C,IAAK,IAAIkB,EAAI,EAAGA,EAAIukC,EAAUzlC,OAAQkB,GAAQ,EAAG,CAC7C,MAAMiB,EAAIsjC,EAAU1jC,MAAMb,EAAGA,EAAI,GACjCmiC,EAAIniC,EAAI,GAAKkM,SAASjL,EAAG,GAC7B,CACA,OAAOkhC,EAAIjiC,MACf,CACA,oBAAO8kC,CAAc9kC,EAAQ8iC,GAAe,GACxC,OAAOD,EAAelhC,SAAS3B,EAAQ8iC,EAC3C,CACA,sBAAOiC,CAAgBzJ,EAAMwH,GAAe,GACxC,OAAOD,EAAe7E,WAAW1C,EAAMwH,EAC3C,CACA,oBAAO0B,CAAcnlC,GACjB,MAAM2lC,EAAW,EAAK3lC,EAAOT,OAAS,EACtC,GAAIomC,EAAW,EACX,IAAK,IAAIllC,EAAI,EAAGA,EAAIklC,EAAUllC,IAC1BT,GAAU,IAGlB,OAAOA,CACX,CACA,mBAAOilC,CAAahD,GAChB,OAAQA,aAAmC,EAASA,EAAK9+B,QAAQ,aAAc,MAAQ,EAC3F,EAEJ2gC,EAAQsB,sBAAwB,OAwChCnmC,EAAQ,GAAwB8iC,EAChC9iC,EAAQ,GAAU6kC,eC1Yd8B,yBAA2B,CAAC,ECA5BC,eADAC,SDIJ,SAASC,oBAAoBC,GAE5B,IAAIC,EAAeL,yBAAyBI,GAC5C,QAAqBpkC,IAAjBqkC,EACH,OAAOA,EAAahnC,QAGrB,IAAID,EAAS4mC,yBAAyBI,GAAY,CAGjD/mC,QAAS,CAAC,GAOX,OAHAinC,oBAAoBF,GAAU77B,KAAKnL,EAAOC,QAASD,EAAQA,EAAOC,QAAS8mC,qBAGpE/mC,EAAOC,OACf,CEtBA8mC,oBAAoBI,KAAO,CAAC,EDAxBL,SAAWnjC,OAAO4N,eAAkBP,GAASrN,OAAO4N,eAAeP,GAASA,GAASA,EAAa,UAQtG+1B,oBAAoBjlC,EAAI,SAASwC,EAAO8iC,GAEvC,GADU,EAAPA,IAAU9iC,EAAQO,KAAKP,IAChB,EAAP8iC,EAAU,OAAO9iC,EACpB,GAAoB,iBAAVA,GAAsBA,EAAO,CACtC,GAAW,EAAP8iC,GAAa9iC,EAAM+iC,WAAY,OAAO/iC,EAC1C,GAAW,GAAP8iC,GAAoC,mBAAf9iC,EAAMqO,KAAqB,OAAOrO,CAC5D,CACA,IAAIgjC,EAAK3jC,OAAO2N,OAAO,MACvBy1B,oBAAoBt6B,EAAE66B,GACtB,IAAIC,EAAM,CAAC,EACXV,eAAiBA,gBAAkB,CAAC,KAAMC,SAAS,CAAC,GAAIA,SAAS,IAAKA,SAASA,WAC/E,IAAI,IAAIU,EAAiB,EAAPJ,GAAY9iC,EAAyB,iBAAXkjC,KAAyBX,eAAenvB,QAAQ8vB,GAAUA,EAAUV,SAASU,GACxH7jC,OAAO8jC,oBAAoBD,GAAS72B,SAASC,GAAS22B,EAAI32B,GAAO,IAAOtM,EAAMsM,KAI/E,OAFA22B,EAAa,QAAI,IAAM,EACvBR,oBAAoBplB,EAAE2lB,EAAIC,GACnBD,CACR,EExBAP,oBAAoBplB,EAAI,CAAC1hB,EAASynC,KACjC,IAAI,IAAI92B,KAAO82B,EACXX,oBAAoBjrB,EAAE4rB,EAAY92B,KAASm2B,oBAAoBjrB,EAAE7b,EAAS2Q,IAC5EjN,OAAO6L,eAAevP,EAAS2Q,EAAK,CAAEnB,YAAY,EAAME,IAAK+3B,EAAW92B,IAE1E,ECNDm2B,oBAAoBjrB,EAAI,CAAC9K,EAAK6X,IAAUllB,OAAOoB,UAAU0O,eAAetI,KAAK6F,EAAK6X,GCClFke,oBAAoBt6B,EAAKxM,IACH,oBAAX4S,QAA0BA,OAAO80B,aAC1ChkC,OAAO6L,eAAevP,EAAS4S,OAAO80B,YAAa,CAAErjC,MAAO,WAE7DX,OAAO6L,eAAevP,EAAS,aAAc,CAAEqE,OAAO,GAAO,gnECDvD,SAASwG,EAAMC,EAAO,GACzB,OAAO,IAAIvE,WAAWuE,EAC1B,CAMO,SAAS02B,EAAY12B,EAAO,GAC/B,OAAO,IAAIvE,WAAWuE,EAC1B,wMCZA,MAAM68B,EAAKvmC,KAAK+G,IAAI,EAAG,GACjBy/B,EAAKxmC,KAAK+G,IAAI,EAAG,IACjB0/B,EAAKzmC,KAAK+G,IAAI,EAAG,IACjB2/B,EAAK1mC,KAAK+G,IAAI,EAAG,IACjB4/B,EAAK3mC,KAAK+G,IAAI,EAAG,IACjB6/B,EAAK5mC,KAAK+G,IAAI,EAAG,IACjB8/B,EAAK7mC,KAAK+G,IAAI,EAAG,IAEjB+/B,EAAM,IAENC,EAAO,IACN,SAASC,EAAe/jC,GAC3B,GAAIA,EAAQsjC,EACR,OAAO,EAEX,GAAItjC,EAAQujC,EACR,OAAO,EAEX,GAAIvjC,EAAQwjC,EACR,OAAO,EAEX,GAAIxjC,EAAQyjC,EACR,OAAO,EAEX,GAAIzjC,EAAQ0jC,EACR,OAAO,EAEX,GAAI1jC,EAAQ2jC,EACR,OAAO,EAEX,GAAI3jC,EAAQ4jC,EACR,OAAO,EAEX,GAA+B,MAA3B3jC,OAAO+jC,kBAA4BhkC,EAAQC,OAAO+jC,iBAClD,MAAM,IAAI1Q,WAAW,2BAEzB,OAAO,CACX,CACO,SAAS2Q,EAAiBjkC,EAAO8C,EAAK5G,EAAS,GAClD,OAAQ6nC,EAAe/jC,IACnB,KAAK,EACD8C,EAAI5G,KAAqB,IAAR8D,EAAgB6jC,EACjC7jC,GAAS,IAEb,KAAK,EACD8C,EAAI5G,KAAqB,IAAR8D,EAAgB6jC,EACjC7jC,GAAS,IAEb,KAAK,EACD8C,EAAI5G,KAAqB,IAAR8D,EAAgB6jC,EACjC7jC,GAAS,IAEb,KAAK,EACD8C,EAAI5G,KAAqB,IAAR8D,EAAgB6jC,EACjC7jC,GAAS,IAEb,KAAK,EACD8C,EAAI5G,KAAqB,IAAR8D,EAAgB6jC,EACjC7jC,KAAW,EAEf,KAAK,EACD8C,EAAI5G,KAAqB,IAAR8D,EAAgB6jC,EACjC7jC,KAAW,EAEf,KAAK,EACD8C,EAAI5G,KAAqB,IAAR8D,EAAgB6jC,EACjC7jC,KAAW,EAEf,KAAK,EACD8C,EAAI5G,KAAqB,IAAR8D,EACjBA,KAAW,EACX,MAEJ,QAAS,MAAM,IAAIzB,MAAM,eAE7B,OAAOuE,CACX,CAwCO,SAASohC,EAAiBphC,EAAK5G,GAClC,IAAI0B,EAAIkF,EAAI5G,GACRojC,EAAM,EAEV,GADAA,GAAO1hC,EAAIkmC,EACPlmC,EAAIimC,EACJ,OAAOvE,EAIX,GAFA1hC,EAAIkF,EAAI5G,EAAS,GACjBojC,IAAQ1hC,EAAIkmC,IAAS,EACjBlmC,EAAIimC,EACJ,OAAOvE,EAIX,GAFA1hC,EAAIkF,EAAI5G,EAAS,GACjBojC,IAAQ1hC,EAAIkmC,IAAS,GACjBlmC,EAAIimC,EACJ,OAAOvE,EAIX,GAFA1hC,EAAIkF,EAAI5G,EAAS,GACjBojC,IAAQ1hC,EAAIkmC,IAAS,GACjBlmC,EAAIimC,EACJ,OAAOvE,EAIX,GAFA1hC,EAAIkF,EAAI5G,EAAS,GACjBojC,IAAQ1hC,EAAIkmC,GAAQL,EAChB7lC,EAAIimC,EACJ,OAAOvE,EAIX,GAFA1hC,EAAIkF,EAAI5G,EAAS,GACjBojC,IAAQ1hC,EAAIkmC,GAAQJ,EAChB9lC,EAAIimC,EACJ,OAAOvE,EAIX,GAFA1hC,EAAIkF,EAAI5G,EAAS,GACjBojC,IAAQ1hC,EAAIkmC,GAAQH,EAChB/lC,EAAIimC,EACJ,OAAOvE,EAIX,GAFA1hC,EAAIkF,EAAI5G,EAAS,GACjBojC,IAAQ1hC,EAAIkmC,GAAQF,EAChBhmC,EAAIimC,EACJ,OAAOvE,EAEX,MAAM,IAAIhM,WAAW,0BACzB,CA6CO,SAASl2B,EAAO4C,EAAO8C,EAAK5G,EAAS,GAIxC,OAHW,MAAP4G,IACAA,EAAMq6B,EAAY4G,EAAe/jC,KAEjC8C,aAAeZ,WACR+hC,EAAiBjkC,EAAO8C,EAAK5G,GApIrC,SAA8B8D,EAAO8C,EAAK5G,EAAS,GACtD,OAAQ6nC,EAAe/jC,IACnB,KAAK,EACD8C,EAAIwI,IAAIpP,IAAmB,IAAR8D,EAAgB6jC,GACnC7jC,GAAS,IAEb,KAAK,EACD8C,EAAIwI,IAAIpP,IAAmB,IAAR8D,EAAgB6jC,GACnC7jC,GAAS,IAEb,KAAK,EACD8C,EAAIwI,IAAIpP,IAAmB,IAAR8D,EAAgB6jC,GACnC7jC,GAAS,IAEb,KAAK,EACD8C,EAAIwI,IAAIpP,IAAmB,IAAR8D,EAAgB6jC,GACnC7jC,GAAS,IAEb,KAAK,EACD8C,EAAIwI,IAAIpP,IAAmB,IAAR8D,EAAgB6jC,GACnC7jC,KAAW,EAEf,KAAK,EACD8C,EAAIwI,IAAIpP,IAAmB,IAAR8D,EAAgB6jC,GACnC7jC,KAAW,EAEf,KAAK,EACD8C,EAAIwI,IAAIpP,IAAmB,IAAR8D,EAAgB6jC,GACnC7jC,KAAW,EAEf,KAAK,EACD8C,EAAIwI,IAAIpP,IAAmB,IAAR8D,GACnBA,KAAW,EACX,MAEJ,QAAS,MAAM,IAAIzB,MAAM,eAE7B,OAAOuE,CACX,CAiGeqhC,CAAqBnkC,EAAO8C,EAAK5G,EAEhD,CACO,SAAS,EAAO4G,EAAK5G,EAAS,GACjC,OAAI4G,aAAeZ,WACRgiC,EAAiBphC,EAAK5G,GAzD9B,SAA8B4G,EAAK5G,GACtC,IAAI0B,EAAIkF,EAAIuI,IAAInP,GACZojC,EAAM,EAEV,GADAA,GAAO1hC,EAAIkmC,EACPlmC,EAAIimC,EACJ,OAAOvE,EAIX,GAFA1hC,EAAIkF,EAAIuI,IAAInP,EAAS,GACrBojC,IAAQ1hC,EAAIkmC,IAAS,EACjBlmC,EAAIimC,EACJ,OAAOvE,EAIX,GAFA1hC,EAAIkF,EAAIuI,IAAInP,EAAS,GACrBojC,IAAQ1hC,EAAIkmC,IAAS,GACjBlmC,EAAIimC,EACJ,OAAOvE,EAIX,GAFA1hC,EAAIkF,EAAIuI,IAAInP,EAAS,GACrBojC,IAAQ1hC,EAAIkmC,IAAS,GACjBlmC,EAAIimC,EACJ,OAAOvE,EAIX,GAFA1hC,EAAIkF,EAAIuI,IAAInP,EAAS,GACrBojC,IAAQ1hC,EAAIkmC,GAAQL,EAChB7lC,EAAIimC,EACJ,OAAOvE,EAIX,GAFA1hC,EAAIkF,EAAIuI,IAAInP,EAAS,GACrBojC,IAAQ1hC,EAAIkmC,GAAQJ,EAChB9lC,EAAIimC,EACJ,OAAOvE,EAIX,GAFA1hC,EAAIkF,EAAIuI,IAAInP,EAAS,GACrBojC,IAAQ1hC,EAAIkmC,GAAQH,EAChB/lC,EAAIimC,EACJ,OAAOvE,EAIX,GAFA1hC,EAAIkF,EAAIuI,IAAInP,EAAS,GACrBojC,IAAQ1hC,EAAIkmC,GAAQF,EAChBhmC,EAAIimC,EACJ,OAAOvE,EAEX,MAAM,IAAIhM,WAAW,0BACzB,CAiBe8Q,CAAqBthC,EAAK5G,EAEzC,CChOA,MAAMuG,EAAM,IAAID,aAAa,EAAE,IACzBE,EAAM,IAAIR,WAAWO,EAAIpF,QAIxB,SAAS8F,EAAaN,EAAKC,EAAKC,GACnCN,EAAI,GAAKI,EACTC,EAAIC,GAAOL,EAAI,GACfI,EAAIC,EAAM,GAAKL,EAAI,GACnBI,EAAIC,EAAM,GAAKL,EAAI,GACnBI,EAAIC,EAAM,GAAKL,EAAI,EACvB,CA+BA,MAAMiC,EAAM,IAAID,aAAa,EAAE,IACzB2/B,EAAM,IAAIniC,WAAWyC,EAAItH,QAIxB,SAAS2H,EAAcnC,EAAKC,EAAKC,GACpC4B,EAAI,GAAK9B,EACTC,EAAIC,GAAOshC,EAAI,GACfvhC,EAAIC,EAAM,GAAKshC,EAAI,GACnBvhC,EAAIC,EAAM,GAAKshC,EAAI,GACnBvhC,EAAIC,EAAM,GAAKshC,EAAI,GACnBvhC,EAAIC,EAAM,GAAKshC,EAAI,GACnBvhC,EAAIC,EAAM,GAAKshC,EAAI,GACnBvhC,EAAIC,EAAM,GAAKshC,EAAI,GACnBvhC,EAAIC,EAAM,GAAKshC,EAAI,EACvB,CCxDA,MAAMC,EAA0BC,OAAOtkC,OAAO+jC,kBACxCQ,EAA0BD,OAAOtkC,OAAOwkC,kBAUvC,MAAMtR,EACT3tB,GACAC,GACA,WAAA4H,CAAY7H,EAAIC,GAMZlF,KAAKiF,GAAU,EAALA,EAIVjF,KAAKkF,GAAU,EAALA,CACd,CAIA,QAAAqgB,CAASD,GAAW,GAChB,IAAKA,GAAatlB,KAAKkF,KAAO,GAAM,EAAG,CACnC,MAAMD,EAAgB,GAAVjF,KAAKiF,KAAW,EAC5B,IAAIC,GAAMlF,KAAKkF,KAAO,EAItB,OAHW,IAAPD,IACAC,EAAKA,EAAK,IAAM,KAEXD,EAAU,WAALC,EAClB,CACA,OAAOlF,KAAKiF,GAAe,WAAVjF,KAAKkF,EAC1B,CAIA,QAAAi/B,CAAS7e,GAAW,GAChB,GAAIA,EACA,OAAO0e,OAAOhkC,KAAKiF,KAAO,IAAM++B,OAAOhkC,KAAKkF,KAAO,IAAM,KAE7D,GAAKlF,KAAKkF,KAAO,IAAQ,EAAG,CACxB,MAAMD,EAAgB,GAAVjF,KAAKiF,KAAW,EAC5B,IAAIC,GAAMlF,KAAKkF,KAAO,EAItB,OAHW,IAAPD,IACAC,EAAKA,EAAK,IAAM,KAEX8+B,OAAO/+B,IAAO++B,OAAO9+B,IAAO,KACzC,CACA,OAAO8+B,OAAOhkC,KAAKiF,KAAO,IAAM++B,OAAOhkC,KAAKkF,KAAO,IAAM,IAC7D,CAIA,QAAAzG,CAAS6mB,GAAW,GAChB,OAAOtlB,KAAKmkC,SAAS7e,GAAU7mB,UACnC,CAIA,QAAAk8B,GACI,MAAM1a,EAAOjgB,KAAKkF,IAAM,GAGxB,OAFAlF,KAAKkF,KAAOlF,KAAKkF,IAAM,EAAIlF,KAAKiF,KAAO,IAAMgb,KAAU,EACvDjgB,KAAKiF,IAAMjF,KAAKiF,IAAM,EAAIgb,KAAU,EAC7BjgB,IACX,CAIA,QAAAs0B,GACI,MAAMrU,IAAmB,EAAVjgB,KAAKiF,IAGpB,OAFAjF,KAAKiF,KAAOjF,KAAKiF,KAAO,EAAIjF,KAAKkF,IAAM,IAAM+a,KAAU,EACvDjgB,KAAKkF,IAAMlF,KAAKkF,KAAO,EAAI+a,KAAU,EAC9BjgB,IACX,CAIA,MAAAtE,GACI,MAAMw/B,EAAQl7B,KAAKiF,GACbk2B,GAASn7B,KAAKiF,KAAO,GAAKjF,KAAKkF,IAAM,KAAO,EAC5Ck2B,EAAQp7B,KAAKkF,KAAO,GAC1B,OAAiB,IAAVk2B,EACS,IAAVD,EACID,EAAQ,MACJA,EAAQ,IAAM,EAAI,EAClBA,EAAQ,QAAU,EAAI,EAC1BC,EAAQ,MACJA,EAAQ,IAAM,EAAI,EAClBA,EAAQ,QAAU,EAAI,EAC9BC,EAAQ,IAAM,EAAI,EAC5B,CAIA,iBAAOgJ,CAAW3kC,GACd,GAAc,KAAVA,EACA,OAAOi7B,EAEX,GAAIj7B,EAAQskC,GAA2BtkC,EAAQwkC,EAC3C,OAAOjkC,KAAKwoB,WAAW9oB,OAAOD,IAElC,MAAM4kC,EAAW5kC,EAAQ,GACrB4kC,IACA5kC,GAASA,GAEb,IAAIyF,EAAKzF,GAAS,IACdwF,EAAKxF,GAASyF,GAAM,KAWxB,OAVIm/B,IACAn/B,EAAW,IAALA,EACND,EAAW,IAALA,IACAA,EAAKq/B,IACPr/B,EAAK,KACCC,EAAKo/B,IACPp/B,EAAK,MAIV,IAAI0tB,EAASlzB,OAAOuF,GAAKvF,OAAOwF,GAC3C,CAIA,iBAAOsjB,CAAW/oB,GACd,GAAc,IAAVA,EACA,OAAOi7B,EAEX,MAAMx3B,EAAOzD,EAAQ,EACjByD,IACAzD,GAASA,GAEb,IAAIwF,EAAKxF,IAAU,EACfyF,GAAMzF,EAAQwF,GAAM,aAAe,EAWvC,OAVI/B,IACAgC,GAAMA,IAAO,EACbD,GAAMA,IAAO,IACPA,EAAK,aACPA,EAAK,IACCC,EAAK,aACPA,EAAK,KAIV,IAAI0tB,EAAS3tB,EAAIC,EAC5B,CAIA,WAAO21B,CAAKp7B,GACR,MAAqB,iBAAVA,EACAmzB,EAASpK,WAAW/oB,GAEV,iBAAVA,EACAmzB,EAASwR,WAAW3kC,GAEV,iBAAVA,EACAmzB,EAASwR,WAAWJ,OAAOvkC,IAElB,MAAbA,EAAM2lB,KAA6B,MAAd3lB,EAAM4lB,KAAe,IAAIuN,EAASnzB,EAAM2lB,MAAQ,EAAG3lB,EAAM4lB,OAAS,GAAKqV,CACvG,EAEJ,MAAMA,EAAO,IAAI9H,EAAS,EAAG,GAC7B8H,EAAKyJ,SAAW,WAAc,OAAO,EAAI,EACzCzJ,EAAKC,SAAWD,EAAKpG,SAAW,WAAc,OAAOt0B,IAAM,EAC3D06B,EAAKh/B,OAAS,WAAc,OAAO,CAAG,EACtC,MAAM4oC,EAAS,YCxGR,SAAS59B,EAAMtK,EAAQU,EAAQnB,GAClC,MAAMoB,EAAQpB,EACd,IAAIgL,EACAC,EACJ,IAAK,IAAIhK,EAAI,EAAGA,EAAIR,EAAOV,SAAUkB,EACjC+J,EAAKvK,EAAO0B,WAAWlB,GACnB+J,EAAK,IACL7J,EAAOnB,KAAYgL,EAEdA,EAAK,MACV7J,EAAOnB,KAAYgL,GAAM,EAAI,IAC7B7J,EAAOnB,KAAiB,GAALgL,EAAU,KAEN,QAAZ,MAALA,IAA0E,QAAZ,OAAjCC,EAAKxK,EAAO0B,WAAWlB,EAAI,MAC9D+J,EAAK,QAAiB,KAALA,IAAgB,KAAY,KAALC,KACtChK,EACFE,EAAOnB,KAAYgL,GAAM,GAAK,IAC9B7J,EAAOnB,KAAYgL,GAAM,GAAK,GAAK,IACnC7J,EAAOnB,KAAYgL,GAAM,EAAI,GAAK,IAClC7J,EAAOnB,KAAiB,GAALgL,EAAU,MAG7B7J,EAAOnB,KAAYgL,GAAM,GAAK,IAC9B7J,EAAOnB,KAAYgL,GAAM,EAAI,GAAK,IAClC7J,EAAOnB,KAAiB,GAALgL,EAAU,KAGrC,OAAOhL,EAASoB,CACpB,CC3FA,SAAS81B,EAAgB7H,EAAQ8H,GAC7B,OAAOC,WAAW,uBAAuB/H,EAAOxoB,SAASswB,GAAe,OAAO9H,EAAOxkB,MAC1F,CACA,SAAS+9B,EAAehiC,EAAKvF,GACzB,OAAQuF,EAAIvF,EAAM,GACduF,EAAIvF,EAAM,IAAM,EAChBuF,EAAIvF,EAAM,IAAM,GAChBuF,EAAIvF,EAAM,IAAM,MAAQ,CAChC,CAIO,MAAMwnC,EACTjiC,IACAC,IACAgE,IACA8sB,OAAS3xB,WAAWzB,UAAUqzB,SAC9B,WAAAzmB,CAAYhQ,GAIRkD,KAAKuC,IAAMzF,EAIXkD,KAAKwC,IAAM,EAIXxC,KAAKwG,IAAM1J,EAAOpB,MACtB,CAIA,MAAA83B,GACI,IAAI/zB,EAAQ,WAEZ,GADAA,GAA8B,IAArBO,KAAKuC,IAAIvC,KAAKwC,QAAgB,EACnCxC,KAAKuC,IAAIvC,KAAKwC,OAAS,IACvB,OAAO/C,EAEX,GADAA,GAASA,GAA8B,IAArBO,KAAKuC,IAAIvC,KAAKwC,OAAe,KAAO,EAClDxC,KAAKuC,IAAIvC,KAAKwC,OAAS,IACvB,OAAO/C,EAEX,GADAA,GAASA,GAA8B,IAArBO,KAAKuC,IAAIvC,KAAKwC,OAAe,MAAQ,EACnDxC,KAAKuC,IAAIvC,KAAKwC,OAAS,IACvB,OAAO/C,EAEX,GADAA,GAASA,GAA8B,IAArBO,KAAKuC,IAAIvC,KAAKwC,OAAe,MAAQ,EACnDxC,KAAKuC,IAAIvC,KAAKwC,OAAS,IACvB,OAAO/C,EAEX,GADAA,GAASA,GAA8B,GAArBO,KAAKuC,IAAIvC,KAAKwC,OAAc,MAAQ,EAClDxC,KAAKuC,IAAIvC,KAAKwC,OAAS,IACvB,OAAO/C,EACX,IAAKO,KAAKwC,KAAO,GAAKxC,KAAKwG,IAEvB,MADAxG,KAAKwC,IAAMxC,KAAKwG,IACVqsB,EAAgB7yB,KAAM,IAEhC,OAAOP,CACX,CAIA,KAAAg0B,GACI,OAAuB,EAAhBzzB,KAAKwzB,QAChB,CAIA,MAAAE,GACI,MAAMj0B,EAAQO,KAAKwzB,SACnB,OAAO/zB,IAAU,IAAc,EAARA,EAC3B,CAIA,IAAAk0B,GACI,OAAyB,IAAlB3zB,KAAKwzB,QAChB,CAIA,OAAAI,GACI,GAAI5zB,KAAKwC,IAAM,EAAIxC,KAAKwG,IACpB,MAAMqsB,EAAgB7yB,KAAM,GAGhC,OADYukC,EAAevkC,KAAKuC,IAAKvC,KAAKwC,KAAO,EAErD,CAIA,QAAAqxB,GACI,GAAI7zB,KAAKwC,IAAM,EAAIxC,KAAKwG,IACpB,MAAMqsB,EAAgB7yB,KAAM,GAGhC,OADsD,EAA1CukC,EAAevkC,KAAKuC,IAAKvC,KAAKwC,KAAO,EAErD,CAIA,KAAAsxB,GACI,GAAI9zB,KAAKwC,IAAM,EAAIxC,KAAKwG,IACpB,MAAMqsB,EAAgB7yB,KAAM,GAEhC,MAAMP,GHnFc8C,EGmFMvC,KAAKuC,IHnFNC,EGmFWxC,KAAKwC,IHlF7CL,EAAI,GAAKI,EAAIC,GACbL,EAAI,GAAKI,EAAIC,EAAM,GACnBL,EAAI,GAAKI,EAAIC,EAAM,GACnBL,EAAI,GAAKI,EAAIC,EAAM,GACZN,EAAI,IALR,IAAqBK,EAAKC,EGqFzB,OADAxC,KAAKwC,KAAO,EACL/C,CACX,CAIA,MAAAs0B,GAEI,GAAI/zB,KAAKwC,IAAM,EAAIxC,KAAKwG,IACpB,MAAMqsB,EAAgB7yB,KAAM,GAEhC,MAAMP,GH7Ce8C,EG6CMvC,KAAKuC,IH7CNC,EG6CWxC,KAAKwC,IH5C9CshC,EAAI,GAAKvhC,EAAIC,GACbshC,EAAI,GAAKvhC,EAAIC,EAAM,GACnBshC,EAAI,GAAKvhC,EAAIC,EAAM,GACnBshC,EAAI,GAAKvhC,EAAIC,EAAM,GACnBshC,EAAI,GAAKvhC,EAAIC,EAAM,GACnBshC,EAAI,GAAKvhC,EAAIC,EAAM,GACnBshC,EAAI,GAAKvhC,EAAIC,EAAM,GACnBshC,EAAI,GAAKvhC,EAAIC,EAAM,GACZ4B,EAAI,IATR,IAAsB7B,EAAKC,EG+C1B,OADAxC,KAAKwC,KAAO,EACL/C,CACX,CAIA,KAAA6S,GACI,MAAM5W,EAASsE,KAAKwzB,SACdz2B,EAAQiD,KAAKwC,IACbxF,EAAMgD,KAAKwC,IAAM9G,EAEvB,GAAIsB,EAAMgD,KAAKwG,IACX,MAAMqsB,EAAgB7yB,KAAMtE,GAGhC,OADAsE,KAAKwC,KAAO9G,EACLqB,IAAUC,EACX,IAAI2E,WAAW,GACf3B,KAAKuC,IAAIgxB,SAASx2B,EAAOC,EACnC,CAIA,MAAAZ,GACI,MAAMkW,EAAQtS,KAAKsS,QACnB,ODtHD,SAAcxV,EAAQC,EAAOC,GAEhC,GADYA,EAAMD,EACR,EACN,MAAO,GAEX,IAAIG,EACJ,MAAMC,EAAQ,GACd,IACIF,EADAL,EAAI,EAER,KAAOG,EAAQC,GACXC,EAAIH,EAAOC,KACPE,EAAI,IACJE,EAAMP,KAAOK,EAERA,EAAI,KAAOA,EAAI,IACpBE,EAAMP,MAAY,GAAJK,IAAW,EAAsB,GAAlBH,EAAOC,KAE/BE,EAAI,KAAOA,EAAI,KACpBA,IAAU,EAAJA,IAAU,IAAwB,GAAlBH,EAAOC,OAAkB,IAAwB,GAAlBD,EAAOC,OAAkB,EAAsB,GAAlBD,EAAOC,MAAiB,MAC1GI,EAAMP,KAAO,OAAUK,GAAK,IAC5BE,EAAMP,KAAO,OAAc,KAAJK,IAGvBE,EAAMP,MAAY,GAAJK,IAAW,IAAwB,GAAlBH,EAAOC,OAAkB,EAAsB,GAAlBD,EAAOC,KAEnEH,EAAI,QACHM,IAAUA,EAAQ,KAAKI,KAAKC,OAAOC,aAAatB,MAAMqB,OAAQJ,IAC/DP,EAAI,GAGZ,OAAa,MAATM,GACIN,EAAI,GACJM,EAAMI,KAAKC,OAAOC,aAAatB,MAAMqB,OAAQJ,EAAMM,MAAM,EAAGb,KAEzDM,EAAMQ,KAAK,KAEfH,OAAOC,aAAatB,MAAMqB,OAAQJ,EAAMM,MAAM,EAAGb,GAC5D,CCiFe,CAAU0V,EAAO,EAAGA,EAAM5W,OACrC,CAIA,IAAA2zB,CAAK3zB,GACD,GAAsB,iBAAXA,EAAqB,CAE5B,GAAIsE,KAAKwC,IAAM9G,EAASsE,KAAKwG,IACzB,MAAMqsB,EAAgB7yB,KAAMtE,GAEhCsE,KAAKwC,KAAO9G,CAChB,MAEI,GAEI,GAAIsE,KAAKwC,KAAOxC,KAAKwG,IACjB,MAAMqsB,EAAgB7yB,YAEG,IAAvBA,KAAKuC,IAAIvC,KAAKwC,QAE5B,OAAOxC,IACX,CAIA,QAAAi0B,CAAS9N,GACL,OAAQA,GACJ,KAAK,EACDnmB,KAAKqvB,OACL,MACJ,KAAK,EACDrvB,KAAKqvB,KAAK,GACV,MACJ,KAAK,EACDrvB,KAAKqvB,KAAKrvB,KAAKwzB,UACf,MACJ,KAAK,EACD,KAA0C,IAAlCrN,EAA2B,EAAhBnmB,KAAKwzB,WACpBxzB,KAAKi0B,SAAS9N,GAElB,MACJ,KAAK,EACDnmB,KAAKqvB,KAAK,GACV,MAEJ,QACI,MAAMrxB,MAAM,qBAAqBmoB,eAAsBnmB,KAAKwC,OAEpE,OAAOxC,IACX,CACA,cAAAmzB,GAEI,MAAMne,EAAO,IAAI4d,EAAS,EAAG,GAC7B,IAAIh2B,EAAI,EACR,KAAIoD,KAAKwG,IAAMxG,KAAKwC,IAAM,GAgBrB,CACD,KAAO5F,EAAI,IAAKA,EAAG,CAEf,GAAIoD,KAAKwC,KAAOxC,KAAKwG,IACjB,MAAMqsB,EAAgB7yB,MAI1B,GADAgV,EAAK/P,IAAM+P,EAAK/P,IAA2B,IAArBjF,KAAKuC,IAAIvC,KAAKwC,OAAmB,EAAJ5F,KAAW,EAC1DoD,KAAKuC,IAAIvC,KAAKwC,OAAS,IACvB,OAAOwS,CAEf,CAGA,OADAA,EAAK/P,IAAM+P,EAAK/P,IAA6B,IAAvBjF,KAAKuC,IAAIvC,KAAKwC,SAAqB,EAAJ5F,KAAW,EACzDoY,CACX,CA9BI,KAAOpY,EAAI,IAAKA,EAGZ,GADAoY,EAAK/P,IAAM+P,EAAK/P,IAA2B,IAArBjF,KAAKuC,IAAIvC,KAAKwC,OAAmB,EAAJ5F,KAAW,EAC1DoD,KAAKuC,IAAIvC,KAAKwC,OAAS,IACvB,OAAOwS,EAMf,GAFAA,EAAK/P,IAAM+P,EAAK/P,IAA2B,IAArBjF,KAAKuC,IAAIvC,KAAKwC,OAAe,MAAQ,EAC3DwS,EAAK9P,IAAM8P,EAAK9P,IAA2B,IAArBlF,KAAKuC,IAAIvC,KAAKwC,OAAe,KAAO,EACtDxC,KAAKuC,IAAIvC,KAAKwC,OAAS,IACvB,OAAOwS,EAoBf,GAlBIpY,EAAI,EAkBJoD,KAAKwG,IAAMxG,KAAKwC,IAAM,GACtB,KAAO5F,EAAI,IAAKA,EAGZ,GADAoY,EAAK9P,IAAM8P,EAAK9P,IAA2B,IAArBlF,KAAKuC,IAAIvC,KAAKwC,OAAmB,EAAJ5F,EAAQ,KAAO,EAC9DoD,KAAKuC,IAAIvC,KAAKwC,OAAS,IACvB,OAAOwS,OAKf,KAAOpY,EAAI,IAAKA,EAAG,CACf,GAAIoD,KAAKwC,KAAOxC,KAAKwG,IACjB,MAAMqsB,EAAgB7yB,MAI1B,GADAgV,EAAK9P,IAAM8P,EAAK9P,IAA2B,IAArBlF,KAAKuC,IAAIvC,KAAKwC,OAAmB,EAAJ5F,EAAQ,KAAO,EAC9DoD,KAAKuC,IAAIvC,KAAKwC,OAAS,IACvB,OAAOwS,CAEf,CAEJ,MAAMhX,MAAM,0BAChB,CACA,WAAAq1B,GACI,GAAIrzB,KAAKwC,IAAM,EAAIxC,KAAKwG,IACpB,MAAMqsB,EAAgB7yB,KAAM,GAEhC,MAAMiF,EAAKs/B,EAAevkC,KAAKuC,IAAKvC,KAAKwC,KAAO,GAC1C0C,EAAKq/B,EAAevkC,KAAKuC,IAAKvC,KAAKwC,KAAO,GAChD,OAAO,IAAIowB,EAAS3tB,EAAIC,EAC5B,CAIA,KAAAivB,GACI,OAAOn0B,KAAKmzB,iBAAiBgR,UACjC,CAKA,WAAAM,GACI,OAAOzkC,KAAKmzB,iBAAiB5N,UACjC,CAIA,WAAAmf,GACI,OAAO1kC,KAAKmzB,iBAAiB10B,UACjC,CAIA,MAAA21B,GACI,OAAOp0B,KAAKmzB,iBAAiBgR,UAAS,EAC1C,CAKA,YAAAQ,GACI,MAAMllC,EAAQkkC,EAAiB3jC,KAAKuC,IAAKvC,KAAKwC,KAE9C,OADAxC,KAAKwC,KAAOghC,EAAe/jC,GACpBA,CACX,CAIA,YAAAmlC,GACI,OAAO5kC,KAAKmzB,iBAAiB10B,UAAS,EAC1C,CAIA,MAAA41B,GACI,OAAOr0B,KAAKmzB,iBAAiBmB,WAAW6P,UAC5C,CAKA,YAAAU,GACI,OAAO7kC,KAAKmzB,iBAAiBmB,WAAW/O,UAC5C,CAKA,YAAAuf,GACI,OAAO9kC,KAAKmzB,iBAAiBmB,WAAW71B,UAC5C,CAIA,OAAA81B,GACI,OAAOv0B,KAAKqzB,cAAc8Q,UAC9B,CAIA,aAAAY,GACI,OAAO/kC,KAAKqzB,cAAc9N,UAC9B,CAIA,aAAAyf,GACI,OAAOhlC,KAAKqzB,cAAc50B,UAC9B,CAIA,QAAA+1B,GACI,OAAOx0B,KAAKqzB,cAAc8Q,UAC9B,CAKA,cAAAc,GACI,OAAOjlC,KAAKqzB,cAAc9N,UAC9B,CAIA,cAAA2f,GACI,OAAOllC,KAAKqzB,cAAc50B,UAC9B,ECtWG,SAAS0mC,EAAc5iC,EAAK6iC,EAAOC,GACtC,MAAMra,EDuWH,SAAsBzoB,GACzB,OAAO,IAAIiiC,EAAiBjiC,aAAeZ,WAAaY,EAAMA,EAAIgxB,WACtE,CCzWmB+R,CAAa/iC,GAC5B,OAAO6iC,EAAMxnC,OAAOotB,OAAQjtB,EAAWsnC,EAC3C,CCiBO,SAASh7B,EAAO4M,GACnB,GAAIA,aAAatV,YAAqC,eAAvBsV,EAAEnK,YAAYjB,KACzC,OAAOoL,EACX,GAAIA,aAAajE,YACb,OAAO,IAAIrR,WAAWsV,GAC1B,GAAIjE,YAAYwB,OAAOyC,GACnB,OAAO,IAAItV,WAAWsV,EAAEna,OAAQma,EAAEqnB,WAAYrnB,EAAEgnB,YAEpD,MAAM,IAAIjgC,MAAM,oCACpB,CA9BqB,IAAI2D,WAAW,GCwKpC,QA9JA,SAAc4jC,EAAU15B,GACpB,GAAI05B,EAAS7pC,QAAU,IACnB,MAAM,IAAI4Q,UAAU,qBAGxB,IADA,IAAIk5B,EAAW,IAAI7jC,WAAW,KACrBvE,EAAI,EAAGA,EAAIooC,EAAS9pC,OAAQ0B,IACjCooC,EAASpoC,GAAK,IAElB,IAAK,IAAIR,EAAI,EAAGA,EAAI2oC,EAAS7pC,OAAQkB,IAAK,CACtC,IAAIma,EAAIwuB,EAAShpC,OAAOK,GACpB6oC,EAAK1uB,EAAEjZ,WAAW,GACtB,GAAqB,MAAjB0nC,EAASC,GACT,MAAM,IAAIn5B,UAAUyK,EAAI,iBAE5ByuB,EAASC,GAAM7oC,CACnB,CACA,IAAI8oC,EAAOH,EAAS7pC,OAChBiqC,EAASJ,EAAShpC,OAAO,GACzBqpC,EAASppC,KAAKoC,IAAI8mC,GAAQlpC,KAAKoC,IAAI,KACnCinC,EAAUrpC,KAAKoC,IAAI,KAAOpC,KAAKoC,IAAI8mC,GA+DvC,SAASI,EAAatnC,GAClB,GAAsB,iBAAXA,EACP,MAAM,IAAI8N,UAAU,mBAExB,GAAsB,IAAlB9N,EAAO9C,OACP,OAAO,IAAIiG,WAEf,IAAIokC,EAAM,EAEV,GAAoB,MAAhBvnC,EAAOunC,GAAX,CAMA,IAFA,IAAIC,EAAS,EACTtqC,EAAS,EACN8C,EAAOunC,KAASJ,GACnBK,IACAD,IAMJ,IAHA,IAAI7/B,GAAU1H,EAAO9C,OAASqqC,GAAOH,EAAU,IAAO,EAClDK,EAAO,IAAItkC,WAAWuE,GAEnB1H,EAAOunC,IAAM,CAEhB,IAAIG,EAAQV,EAAShnC,EAAOV,WAAWioC,IAEvC,GAAc,MAAVG,EACA,OAGJ,IADA,IAAItpC,EAAI,EACCupC,EAAMjgC,EAAO,GAAc,IAAVggC,GAAetpC,EAAIlB,KAAqB,IAATyqC,EAAaA,IAAOvpC,IACzEspC,GAAUR,EAAOO,EAAKE,KAAU,EAChCF,EAAKE,GAAQD,EAAQ,MAAS,EAC9BA,EAASA,EAAQ,MAAS,EAE9B,GAAc,IAAVA,EACA,MAAM,IAAIloC,MAAM,kBAEpBtC,EAASkB,EACTmpC,GACJ,CAEA,GAAoB,MAAhBvnC,EAAOunC,GAAX,CAKA,IADA,IAAIK,EAAMlgC,EAAOxK,EACV0qC,IAAQlgC,GAAsB,IAAd+/B,EAAKG,IACxBA,IAIJ,IAFA,IAAIC,EAAM,IAAI1kC,WAAWqkC,GAAU9/B,EAAOkgC,IACtChpC,EAAI4oC,EACDI,IAAQlgC,GACXmgC,EAAIjpC,KAAO6oC,EAAKG,KAEpB,OAAOC,CAXP,CAlCA,CA8CJ,CAWA,MAAO,CACHxpC,OAhIJ,SAAgB2B,GAUZ,GARIA,aAAkBmD,aAEbqR,YAAYwB,OAAOhW,GACxBA,EAAS,IAAImD,WAAWnD,EAAO1B,OAAQ0B,EAAO8/B,WAAY9/B,EAAOy/B,YAE5DziC,MAAM+Y,QAAQ/V,KACnBA,EAASmD,WAAWk5B,KAAKr8B,OAEvBA,aAAkBmD,YACpB,MAAM,IAAI2K,UAAU,uBAExB,GAAsB,IAAlB9N,EAAO9C,OACP,MAAO,GAOX,IAJA,IAAIsqC,EAAS,EACTtqC,EAAS,EACT4qC,EAAS,EACTC,EAAO/nC,EAAO9C,OACX4qC,IAAWC,GAA2B,IAAnB/nC,EAAO8nC,IAC7BA,IACAN,IAMJ,IAHA,IAAI9/B,GAASqgC,EAAOD,GAAUT,EAAU,IAAO,EAC3CW,EAAM,IAAI7kC,WAAWuE,GAElBogC,IAAWC,GAAM,CAIpB,IAHA,IAAIL,EAAQ1nC,EAAO8nC,GAEf1pC,EAAI,EACC6pC,EAAMvgC,EAAO,GAAc,IAAVggC,GAAetpC,EAAIlB,KAAqB,IAAT+qC,EAAaA,IAAO7pC,IACzEspC,GAAU,IAAMM,EAAIC,KAAU,EAC9BD,EAAIC,GAAQP,EAAQR,IAAU,EAC9BQ,EAASA,EAAQR,IAAU,EAE/B,GAAc,IAAVQ,EACA,MAAM,IAAIloC,MAAM,kBAEpBtC,EAASkB,EACT0pC,GACJ,CAGA,IADA,IAAII,EAAMxgC,EAAOxK,EACVgrC,IAAQxgC,GAAqB,IAAbsgC,EAAIE,IACvBA,IAIJ,IADA,IAAIh0B,EAAMizB,EAAO9M,OAAOmN,GACjBU,EAAMxgC,IAAQwgC,EACjBh0B,GAAO6yB,EAAShpC,OAAOiqC,EAAIE,IAE/B,OAAOh0B,CACX,EA0EIozB,aAAcA,EACdloC,OAVJ,SAAgBxB,GACZ,IAAIU,EAASgpC,EAAa1pC,GAC1B,GAAIU,EACA,OAAOA,EAEX,MAAM,IAAIkB,MAAM,OAAO6N,cAC3B,EAMJ,EC9JA,MAAM86B,EACF96B,KACAjG,OACAghC,WACA,WAAA95B,CAAYjB,EAAMjG,EAAQghC,GACtB5mC,KAAK6L,KAAOA,EACZ7L,KAAK4F,OAASA,EACd5F,KAAK4mC,WAAaA,CACtB,CACA,MAAA/pC,CAAOyV,GACH,GAAIA,aAAiB3Q,WACjB,MAAO,GAAG3B,KAAK4F,SAAS5F,KAAK4mC,WAAWt0B,KAGxC,MAAMtU,MAAM,oCAEpB,EAOJ,MAAM6oC,EACFh7B,KACAjG,OACAkhC,WACAC,gBACA,WAAAj6B,CAAYjB,EAAMjG,EAAQkhC,GAItB,GAHA9mC,KAAK6L,KAAOA,EACZ7L,KAAK4F,OAASA,OAEgB7H,IAA1B6H,EAAOohC,YAAY,GACnB,MAAM,IAAIhpC,MAAM,4BAEpBgC,KAAK+mC,gBAAkBnhC,EAAOohC,YAAY,GAC1ChnC,KAAK8mC,WAAaA,CACtB,CACA,MAAAlpC,CAAOw6B,GACH,GAAoB,iBAATA,EAAmB,CAC1B,GAAIA,EAAK4O,YAAY,KAAOhnC,KAAK+mC,gBAC7B,MAAM/oC,MAAM,qCAAqC4B,KAAKC,UAAUu4B,OAAUp4B,KAAK6L,mDAAmD7L,KAAK4F,UAE3I,OAAO5F,KAAK8mC,WAAW1O,EAAK36B,MAAMuC,KAAK4F,OAAOlK,QAClD,CAEI,MAAMsC,MAAM,oCAEpB,CACA,EAAAipC,CAAGxd,GACC,OAAOwd,GAAGjnC,KAAMypB,EACpB,EAEJ,MAAMyd,GACFC,SACA,WAAAr6B,CAAYq6B,GACRnnC,KAAKmnC,SAAWA,CACpB,CACA,EAAAF,CAAGxd,GACC,OAAOwd,GAAGjnC,KAAMypB,EACpB,CACA,MAAA7rB,CAAOkV,GACH,MAAMlN,EAASkN,EAAM,GACf2W,EAAUzpB,KAAKmnC,SAASvhC,GAC9B,GAAe,MAAX6jB,EACA,OAAOA,EAAQ7rB,OAAOkV,GAGtB,MAAMigB,WAAW,qCAAqCnzB,KAAKC,UAAUiT,iCAAqChU,OAAOC,KAAKiB,KAAKmnC,0BAEnI,EAEG,SAASF,GAAGG,EAAMpwB,GAErB,OAAO,IAAIkwB,GAAgB,IACnBE,EAAKD,UAAY,CAAE,CAACC,EAAKxhC,QAASwhC,MAClCpwB,EAAMmwB,UAAY,CAAE,CAACnwB,EAAMpR,QAASoR,IAEhD,CACO,MAAMqwB,GACTx7B,KACAjG,OACAghC,WACAE,WACAtd,QACAC,QACA,WAAA3c,CAAYjB,EAAMjG,EAAQghC,EAAYE,GAClC9mC,KAAK6L,KAAOA,EACZ7L,KAAK4F,OAASA,EACd5F,KAAK4mC,WAAaA,EAClB5mC,KAAK8mC,WAAaA,EAClB9mC,KAAKwpB,QAAU,IAAImd,EAAQ96B,EAAMjG,EAAQghC,GACzC5mC,KAAKypB,QAAU,IAAIod,EAAQh7B,EAAMjG,EAAQkhC,EAC7C,CACA,MAAAjqC,CAAOiW,GACH,OAAO9S,KAAKwpB,QAAQ3sB,OAAOiW,EAC/B,CACA,MAAAlV,CAAOkV,GACH,OAAO9S,KAAKypB,QAAQ7rB,OAAOkV,EAC/B,EAEG,SAAS+nB,IAAK,KAAEhvB,EAAI,OAAEjG,EAAM,OAAE/I,EAAM,OAAEe,IACzC,OAAO,IAAIypC,GAAMx7B,EAAMjG,EAAQ/I,EAAQe,EAC3C,CACO,SAAS0pC,IAAM,KAAEz7B,EAAI,OAAEjG,EAAM,SAAE2hC,IAClC,MAAM,OAAE1qC,EAAM,OAAEe,GAAW,EAAM2pC,EAAU17B,GAC3C,OAAOgvB,GAAK,CACRj1B,SACAiG,OACAhP,SACAe,OAASw6B,GAAS/tB,EAAOzM,EAAOw6B,KAExC,CAsEO,SAASoP,IAAQ,KAAE37B,EAAI,OAAEjG,EAAM,YAAE6hC,EAAW,SAAEF,IACjD,OAAO1M,GAAK,CACRj1B,SACAiG,OACAhP,OAAOiW,GAnCf,SAAgBsrB,EAAMmJ,EAAUE,GAC5B,MAAMC,EAAwC,MAAlCH,EAASA,EAAS7rC,OAAS,GACjCukB,GAAQ,GAAKwnB,GAAe,EAClC,IAAIE,EAAM,GACN3yB,EAAO,EACPlY,EAAS,EACb,IAAK,IAAIF,EAAI,EAAGA,EAAIwhC,EAAK1iC,SAAUkB,EAK/B,IAHAE,EAAUA,GAAU,EAAKshC,EAAKxhC,GAC9BoY,GAAQ,EAEDA,EAAOyyB,GACVzyB,GAAQyyB,EACRE,GAAOJ,EAAStnB,EAAQnjB,GAAUkY,GAQ1C,GAJa,IAATA,IACA2yB,GAAOJ,EAAStnB,EAAQnjB,GAAW2qC,EAAczyB,IAGjD0yB,EACA,KAASC,EAAIjsC,OAAS+rC,EAAe,GACjCE,GAAO,IAGf,OAAOA,CACX,CASmB,CAAO70B,EAAOy0B,EAAUE,GAEnC7pC,OAAOkV,GA5Ef,SAAgB1W,EAAQmrC,EAAUE,EAAa57B,GAE3C,MAAM+7B,EAAQ,CAAC,EACf,IAAK,IAAIhrC,EAAI,EAAGA,EAAI2qC,EAAS7rC,SAAUkB,EACnCgrC,EAAML,EAAS3qC,IAAMA,EAGzB,IAAII,EAAMZ,EAAOV,OACjB,KAA2B,MAApBU,EAAOY,EAAM,MACdA,EAGN,MAAM2qC,EAAM,IAAIhmC,WAAY3E,EAAMyqC,EAAc,EAAK,GAErD,IAAIzyB,EAAO,EACPlY,EAAS,EACT+qC,EAAU,EACd,IAAK,IAAIjrC,EAAI,EAAGA,EAAII,IAAOJ,EAAG,CAE1B,MAAM6C,EAAQmoC,EAAMxrC,EAAOQ,IAC3B,QAAcmB,IAAV0B,EACA,MAAM,IAAIqoC,YAAY,OAAOj8B,eAGjC/O,EAAUA,GAAU2qC,EAAehoC,EACnCuV,GAAQyyB,EAEJzyB,GAAQ,IACRA,GAAQ,EACR2yB,EAAIE,KAAa,IAAQ/qC,GAAUkY,EAE3C,CAEA,GAAIA,GAAQyyB,GAAgB,IAAQ3qC,GAAW,EAAIkY,EAC/C,MAAM,IAAI8yB,YAAY,0BAE1B,OAAOH,CACX,CAwCmB,CAAO70B,EAAOy0B,EAAUE,EAAa57B,IAGxD,CCvMO,MAAMk8B,GAAST,GAAM,CACxB1hC,OAAQ,IACRiG,KAAM,SACN07B,SAAU,eCHDS,GAASR,GAAQ,CAC1B5hC,OAAQ,IACRiG,KAAM,SACN07B,SAAU,mBACVE,YAAa,IAEJQ,GAAcT,GAAQ,CAC/B5hC,OAAQ,IACRiG,KAAM,cACN07B,SAAU,mBACVE,YAAa,ICVJS,GAAQV,GAAQ,CACzB5hC,OAAQ,IACRiG,KAAM,QACN07B,SAAU,KACVE,YAAa,ICJXF,GAAW/rC,MAAMq/B,KAAK,0eACtBsN,GAAwBZ,GAASa,QAAO,CAAC/rC,EAAGwB,EAAGjB,KAAQP,EAAEO,GAAKiB,EAAUxB,IAAM,IAC9EgsC,GAAwBd,GAASa,QAAO,CAAC/rC,EAAGwB,EAAGjB,KAAQP,EAAEwB,EAAEmpC,YAAY,IAAMpqC,EAAUP,IAAM,IAkBtFisC,GAAezN,GAAK,CAC7Bj1B,OAAQ,KACRiG,KAAM,eACNhP,OApBJ,SAAgBuhC,GACZ,OAAOA,EAAKgK,QAAO,CAAC/rC,EAAGwB,IACnBxB,EAAK8rC,GAAqBtqC,IAE3B,GACP,EAgBID,OAfJ,SAAgB8U,GACZ,MAAM61B,EAAO,GACb,IAAK,MAAMC,KAAQ91B,EAAK,CACpB,MAAM+1B,EAAMJ,GAAqBG,EAAKxB,YAAY,IAClD,QAAYjpC,IAAR0qC,EACA,MAAM,IAAIzqC,MAAM,+BAA+BwqC,KAEnDD,EAAKjrC,KAAKmrC,EACd,CACA,OAAO,IAAI9mC,WAAW4mC,EAC1B,ICnBal1B,GAASm0B,GAAQ,CAC1B5hC,OAAQ,IACRiG,KAAM,SACN07B,SAAU,mCACVE,YAAa,IAEJiB,GAAclB,GAAQ,CAC/B5hC,OAAQ,IACRiG,KAAM,cACN07B,SAAU,mCACVE,YAAa,IAEJkB,GAAYnB,GAAQ,CAC7B5hC,OAAQ,IACRiG,KAAM,YACN07B,SAAU,oCACVE,YAAa,IAEJmB,GAAiBpB,GAAQ,CAClC5hC,OAAQ,IACRiG,KAAM,iBACN07B,SAAU,oCACVE,YAAa,IAEJoB,GAAYrB,GAAQ,CAC7B5hC,OAAQ,IACRiG,KAAM,YACN07B,SAAU,mCACVE,YAAa,IAEJqB,GAAiBtB,GAAQ,CAClC5hC,OAAQ,IACRiG,KAAM,iBACN07B,SAAU,mCACVE,YAAa,IAEJsB,GAAevB,GAAQ,CAChC5hC,OAAQ,IACRiG,KAAM,eACN07B,SAAU,oCACVE,YAAa,IAEJuB,GAAoBxB,GAAQ,CACrC5hC,OAAQ,IACRiG,KAAM,oBACN07B,SAAU,oCACVE,YAAa,IAEJwB,GAAUzB,GAAQ,CAC3B5hC,OAAQ,IACRiG,KAAM,UACN07B,SAAU,mCACVE,YAAa,ICpDJyB,GAAS5B,GAAM,CACxB1hC,OAAQ,IACRiG,KAAM,SACN07B,SAAU,yCAED4B,GAAc7B,GAAM,CAC7B1hC,OAAQ,IACRiG,KAAM,cACN07B,SAAU,yCCRD6B,GAAY9B,GAAM,CAC3Bz7B,KAAM,YACNjG,OAAQ,IACR2hC,SAAU,+DAED8B,GAAe/B,GAAM,CAC9Bz7B,KAAM,eACNjG,OAAQ,IACR2hC,SAAU,+DCRDprC,GAASqrC,GAAQ,CAC1B5hC,OAAQ,IACRiG,KAAM,SACN07B,SAAU,mEACVE,YAAa,IAEJ6B,GAAY9B,GAAQ,CAC7B5hC,OAAQ,IACRiG,KAAM,YACN07B,SAAU,oEACVE,YAAa,IAEJpG,GAAYmG,GAAQ,CAC7B5hC,OAAQ,IACRiG,KAAM,YACN07B,SAAU,mEACVE,YAAa,IAEJ8B,GAAe/B,GAAQ,CAChC5hC,OAAQ,IACRiG,KAAM,eACN07B,SAAU,oEACVE,YAAa,ICtBJ+B,GAAQhC,GAAQ,CACzB5hC,OAAQ,IACRiG,KAAM,QACN07B,SAAU,WACVE,YAAa,ICHJgC,GAAW5O,GAAK,CACzBj1B,OAAQ,KACRiG,KAAM,WACNhP,OAAS0F,IAAQ,OZgCIlF,EYhCKkF,GZiCnB,IAAImnC,aAAc9rC,OAAOP,GAD7B,IAAkBA,CYhCS,EAC9BO,OAAS8U,GZ4BN,SAAoBA,GACvB,OAAO,IAAIi3B,aAAc9sC,OAAO6V,EACpC,CY9BqBooB,CAAWpoB,KCN1Bk3B,GAAc,IAAID,YAClBE,GAAc,IAAIH,YACX,GAAO,OACPr9B,GAAO,IACb,SAAS,GAAO2E,GACnB,OAAO44B,GAAY/sC,OAAO+C,KAAKC,UAAUmR,GAC7C,CACO,SAAS,GAAOotB,GACnB,OAAOx+B,KAAKwd,MAAMysB,GAAYjsC,OAAOwgC,GACzC,CCRO,MAAM,GAAO,MACP,GAAO,GACb,SAAS,GAAOptB,GACnB,OAAO3G,EAAO2G,EAClB,CACO,SAAS,GAAOotB,GACnB,OAAO/zB,EAAO+zB,EAClB,CCPA,IACI,GAAM,IAAmB0L,IAAS,IAAOC,GAAMvtC,KAAK+G,IAAI,EAAG,IAwB3DymC,GAAQ,IAAMC,GAAS,IAuBvB,GAAKztC,KAAK+G,IAAI,EAAG,GACjB,GAAK/G,KAAK+G,IAAI,EAAG,IACjB,GAAK/G,KAAK+G,IAAI,EAAG,IACjB,GAAK/G,KAAK+G,IAAI,EAAG,IACjB,GAAK/G,KAAK+G,IAAI,EAAG,IACjB,GAAK/G,KAAK+G,IAAI,EAAG,IACjB,GAAK/G,KAAK+G,IAAI,EAAG,IACjB2mC,GAAK1tC,KAAK+G,IAAI,EAAG,IACjB4mC,GAAK3tC,KAAK+G,IAAI,EAAG,IAmBrB,SANa,CACT1G,OA/DJ,SAAS,EAAOutC,EAAKzC,EAAKhsC,GACtBgsC,EAAMA,GAAO,GAGb,IADA,IAAI0C,EADJ1uC,EAASA,GAAU,EAEZyuC,GAAOL,IACVpC,EAAIhsC,KAAmB,IAANyuC,EAAc,GAC/BA,GAAO,IAEX,KAAOA,EAAMN,IACTnC,EAAIhsC,KAAmB,IAANyuC,EAAc,GAC/BA,KAAS,EAKb,OAHAzC,EAAIhsC,GAAgB,EAANyuC,EAEd,EAAO93B,MAAQ3W,EAAS0uC,EAAY,EAC7B1C,CACX,EAgDI/pC,OAzCJ,SAAS,EAAK2E,EAAK5G,GACf,IAAgE0B,EAA5D0hC,EAAM,EAAyBl5B,EAAQ,EAAGykC,EAAjC3uC,EAASA,GAAU,EAAmCkU,EAAItN,EAAI7G,OAC3E,EAAG,CACC,GAAI4uC,GAAWz6B,EAGX,MADA,EAAKyC,MAAQ,EACP,IAAIygB,WAAW,2BAEzB11B,EAAIkF,EAAI+nC,KACRvL,GAAOl5B,EAAQ,IACRxI,EAAI4sC,KAAWpkC,GACfxI,EAAI4sC,IAAUztC,KAAK+G,IAAI,EAAGsC,GACjCA,GAAS,CACb,OAASxI,GAAK2sC,IAGd,OADA,EAAK13B,MAAQg4B,EAAU3uC,EAChBojC,CACX,EAyBIyE,eAfS,SAAgC/jC,GACzC,OAAQA,EAAQ,GAAK,EACfA,EAAQ,GAAK,EACTA,EAAQ,GAAK,EACTA,EAAQ,GAAK,EACTA,EAAQ,GAAK,EACTA,EAAQ,GAAK,EACTA,EAAQ,GAAK,EACTA,EAAQyqC,GAAK,EACTzqC,EAAQ0qC,GAAK,EACT,EAC1C,GCpEO,SAAS,GAAO/L,EAAMziC,EAAS,GAElC,MAAO,CADM,GAAOiC,OAAOwgC,EAAMziC,GACnB,GAAOiC,OAAO0U,MAChC,CACO,SAASi4B,GAASC,EAAKra,EAAQx0B,EAAS,GAE3C,OADA,GAAOkB,OAAO2tC,EAAKra,EAAQx0B,GACpBw0B,CACX,CACO,SAAS,GAAeqa,GAC3B,OAAO,GAAOhH,eAAegH,EACjC,CCNO,SAAS/9B,GAAOJ,EAAMqL,GACzB,MAAMxR,EAAOwR,EAAOumB,WACdwM,EAAa,GAAsBp+B,GACnCq+B,EAAeD,EAAa,GAAsBvkC,GAClDoM,EAAQ,IAAI3Q,WAAW+oC,EAAexkC,GAI5C,OAHA,GAAgBmG,EAAMiG,EAAO,GAC7B,GAAgBpM,EAAMoM,EAAOm4B,GAC7Bn4B,EAAMvH,IAAI2M,EAAQgzB,GACX,IAAIC,GAAOt+B,EAAMnG,EAAMwR,EAAQpF,EAC1C,CAIO,SAAS,GAAOs4B,GACnB,MAAMt4B,EAAQjI,EAAOugC,IACdv+B,EAAMo+B,GAAc,GAAcn4B,IAClCpM,EAAMwkC,GAAgB,GAAcp4B,EAAMihB,SAASkX,IACpD/yB,EAASpF,EAAMihB,SAASkX,EAAaC,GAC3C,GAAIhzB,EAAOumB,aAAe/3B,EACtB,MAAM,IAAIlI,MAAM,oBAEpB,OAAO,IAAI2sC,GAAOt+B,EAAMnG,EAAMwR,EAAQpF,EAC1C,CAiBO,MAAMq4B,GACTt+B,KACAnG,KACAwR,OACApF,MAIA,WAAAxF,CAAYT,EAAMnG,EAAMwR,EAAQpF,GAC5BtS,KAAKqM,KAAOA,EACZrM,KAAKkG,KAAOA,EACZlG,KAAK0X,OAASA,EACd1X,KAAKsS,MAAQA,CACjB,ECvDJ,MAEM,GAASjI,EAIF,GAAW,CAAEgC,KANb,EAMiB,KALjB,WAKuB,OAAQ,UAH5C,SAAgByG,GACZ,OAAO,GAJE,EAIkB,GAAOA,GACtC,GCNO,SAAS,IAAK,KAAEjH,EAAI,KAAEQ,EAAI,OAAExP,IAC/B,OAAO,IAAIguC,GAAOh/B,EAAMQ,EAAMxP,EAClC,CAKO,MAAMguC,GACTh/B,KACAQ,KACAxP,OACA,WAAAiQ,CAAYjB,EAAMQ,EAAMxP,GACpBmD,KAAK6L,KAAOA,EACZ7L,KAAKqM,KAAOA,EACZrM,KAAKnD,OAASA,CAClB,CACA,MAAA6a,CAAO5E,GACH,GAAIA,aAAiBnR,WAAY,CAC7B,MAAMwM,EAASnO,KAAKnD,OAAOiW,GAC3B,OAAO3E,aAAkBxM,WACnB,GAAc3B,KAAKqM,KAAM8B,GAEzBA,EAAOL,MAAK4J,GAAU,GAAc1X,KAAKqM,KAAMqL,IACzD,CAEI,MAAM1Z,MAAM,oCAGpB,EC3BJ,SAAS8sC,GAAIj/B,GACT,OAAOk/B,MAAO3M,GAAS,IAAIz8B,iBAAiBqpC,OAAOC,OAAOvzB,OAAO7L,EAAMuyB,GAC3E,CACO,MAAM,GAAS,GAAK,CACvBvyB,KAAM,WACNQ,KAAM,GACNxP,OAAQiuC,GAAI,aAEH,GAAS,GAAK,CACvBj/B,KAAM,WACNQ,KAAM,GACNxP,OAAQiuC,GAAI,aCNT,SAASvgC,GAAO2gC,EAAMprB,GACzB,MAAM,MAAExN,EAAK,QAAE64B,GAAYD,EAC3B,OACS,IADDC,EAqUZ,SAAoB74B,EAAO7B,EAAOqP,GAC9B,MAAM,OAAEla,GAAWka,EACnB,GAAIla,IAAWwjC,GAAUxjC,OACrB,MAAM5H,MAAM,8BAA8B8hB,EAAKjU,iBAEnD,MAAMu/B,EAAM36B,EAAM3F,IAAIlF,GACtB,GAAW,MAAPwlC,EAAa,CACb,MAAMA,EAAMtrB,EAAKjjB,OAAOyV,GAAO7U,MAAM,GAErC,OADAgT,EAAM1F,IAAInF,EAAQwlC,GACXA,CACX,CAEI,OAAOA,CAEf,CAjVmBC,CAAW/4B,EAAOg5B,GAAUJ,GAAOprB,GAAQspB,GAAU5f,SAkVxE,SAAoBlX,EAAO7B,EAAOqP,GAC9B,MAAM,OAAEla,GAAWka,EACbsrB,EAAM36B,EAAM3F,IAAIlF,GACtB,GAAW,MAAPwlC,EAAa,CACb,MAAMA,EAAMtrB,EAAKjjB,OAAOyV,GAExB,OADA7B,EAAM1F,IAAInF,EAAQwlC,GACXA,CACX,CAEI,OAAOA,CAEf,CA3VmBG,CAAWj5B,EAAOg5B,GAAUJ,GAAQprB,GAAQzM,GAAOmW,QAEtE,CASA,MAAM/Y,GAAQ,IAAI+6B,QAClB,SAASF,GAAUF,GACf,MAAME,EAAY76B,GAAM3F,IAAIsgC,GAC5B,GAAiB,MAAbE,EAAmB,CACnB,MAAMA,EAAY,IAAIG,IAEtB,OADAh7B,GAAM1F,IAAIqgC,EAAKE,GACRA,CACX,CACA,OAAOA,CACX,CACO,MAAMI,GACTr/B,KACA8+B,QACAP,UACAt4B,MACA,IAMA,WAAAxF,CAAYq+B,EAAS9+B,EAAMu+B,EAAWt4B,GAClCtS,KAAKqM,KAAOA,EACZrM,KAAKmrC,QAAUA,EACfnrC,KAAK4qC,UAAYA,EACjB5qC,KAAKsS,MAAQA,EAGbtS,KAAK,KAAOsS,CAChB,CAOA,SAAIq5B,GACA,OAAO3rC,IACX,CAEA,cAAIs+B,GACA,OAAOt+B,KAAKsS,MAAMgsB,UACtB,CAEA,cAAIL,GACA,OAAOj+B,KAAKsS,MAAM2rB,UACtB,CACA,IAAA2N,GACI,OAAQ5rC,KAAKmrC,SACT,KAAK,EACD,OAAOnrC,KAEX,KAAK,EAAG,CACJ,MAAM,KAAEqM,EAAI,UAAEu+B,GAAc5qC,KAC5B,GAAIqM,IAASw/B,GACT,MAAM,IAAI7tC,MAAM,4CAGpB,GAAI4sC,EAAUv+B,OAASy/B,GACnB,MAAM,IAAI9tC,MAAM,sDAEpB,OAAQ0tC,GAAIK,SAASnB,EACzB,CACA,QACI,MAAM5sC,MAAM,+BAA+BgC,KAAKmrC,qDAG5D,CACA,IAAAa,GACI,OAAQhsC,KAAKmrC,SACT,KAAK,EAAG,CACJ,MAAM,KAAE9+B,EAAI,OAAEqL,GAAW1X,KAAK4qC,UACxBA,EAAY,GAAcv+B,EAAMqL,GACtC,OAAQg0B,GAAIO,SAASjsC,KAAKqM,KAAMu+B,EACpC,CACA,KAAK,EACD,OAAO5qC,KAEX,QACI,MAAMhC,MAAM,+BAA+BgC,KAAKmrC,qDAG5D,CACA,MAAAe,CAAOC,GACH,OAAOT,GAAIQ,OAAOlsC,KAAMmsC,EAC5B,CACA,aAAOD,CAAOliC,EAAMmiC,GAChB,MAAMC,EAAUD,EAChB,OAAmB,MAAXC,GACJpiC,EAAKqC,OAAS+/B,EAAQ//B,MACtBrC,EAAKmhC,UAAYiB,EAAQjB,SJtF9B,SAAgB9Q,EAAGh9B,GACtB,GAAIg9B,IAAMh9B,EACN,OAAO,EAEN,CACD,MAAM+gC,EAAO/gC,EACb,OAAQg9B,EAAEhuB,OAAS+xB,EAAK/xB,MACpBguB,EAAEn0B,OAASk4B,EAAKl4B,MAChBk4B,EAAK9rB,iBAAiB3Q,YjB5B3B,SAAgB0qC,EAAIC,GACvB,GAAID,IAAOC,EACP,OAAO,EACX,GAAID,EAAGpO,aAAeqO,EAAGrO,WACrB,OAAO,EAEX,IAAK,IAAIsO,EAAK,EAAGA,EAAKF,EAAGpO,WAAYsO,IACjC,GAAIF,EAAGE,KAAQD,EAAGC,GACd,OAAO,EAGf,OAAO,CACX,CiBiBY,CAAWlS,EAAE/nB,MAAO8rB,EAAK9rB,MACjC,CACJ,CI4EY,CAActI,EAAK4gC,UAAWwB,EAAQxB,UAC9C,CACA,QAAAnsC,CAASqhB,GACL,OAAOvV,GAAOvK,KAAM8f,EACxB,CACA,MAAAkH,GACI,MAAO,CAAE,IAAKzc,GAAOvK,MACzB,CACA,IAAAkrC,GACI,OAAOlrC,IACX,CACA,CAACgO,OAAO80B,aAAe,MAEvB,CAAC90B,OAAOw+B,IAAI,iCACR,MAAO,OAAOxsC,KAAKvB,aACvB,CAWA,YAAOktC,CAAM74B,GACT,GAAa,MAATA,EACA,OAAO,KAEX,MAAMrT,EAAQqT,EACd,GAAIrT,aAAiBisC,GAEjB,OAAOjsC,EAEN,GAAmB,MAAdA,EAAM,MAAgBA,EAAM,OAASA,EAAM6S,OAAU7S,EAAMksC,QAAUlsC,EAAO,CAMlF,MAAM,QAAE0rC,EAAO,KAAE9+B,EAAI,UAAEu+B,EAAS,MAAEt4B,GAAU7S,EAC5C,OAAO,IAAIisC,GAAIP,EAAS9+B,EAAMu+B,EAAWt4B,GAASm6B,GAAUtB,EAAS9+B,EAAMu+B,EAAUt4B,OACzF,CACK,IAAyB,IAArB7S,EAAMitC,IAAqB,CAIhC,MAAM,QAAEvB,EAAO,UAAEP,EAAS,KAAEv+B,GAAS5M,EAC/BiY,EAAS,GAAckzB,GAC7B,OAAOc,GAAIj/B,OAAO0+B,EAAS9+B,EAAMqL,EACrC,CAII,OAAO,IAEf,CAMA,aAAOjL,CAAO0+B,EAAS9+B,EAAMqL,GACzB,GAAoB,iBAATrL,EACP,MAAM,IAAIrO,MAAM,yCAEpB,KAAM0Z,EAAOpF,iBAAiB3Q,YAC1B,MAAM,IAAI3D,MAAM,kBAEpB,OAAQmtC,GACJ,KAAK,EACD,GAAI9+B,IAASw/B,GACT,MAAM,IAAI7tC,MAAM,wCAAwC6tC,sBAGxD,OAAO,IAAIH,GAAIP,EAAS9+B,EAAMqL,EAAQA,EAAOpF,OAGrD,KAAK,EAAG,CACJ,MAAMA,EAAQm6B,GAAUtB,EAAS9+B,EAAMqL,EAAOpF,OAC9C,OAAO,IAAIo5B,GAAIP,EAAS9+B,EAAMqL,EAAQpF,EAC1C,CACA,QACI,MAAM,IAAItU,MAAM,mBAG5B,CAIA,eAAO+tC,CAASr0B,GACZ,OAAOg0B,GAAIj/B,OAAO,EAAGo/B,GAAan0B,EACtC,CAOA,eAAOu0B,CAAS5/B,EAAMqL,GAClB,OAAOg0B,GAAIj/B,OAAO,EAAGJ,EAAMqL,EAC/B,CAQA,aAAO9Z,CAAO0U,GACV,MAAO84B,EAAK5sB,GAAaktB,GAAIiB,YAAYr6B,GACzC,GAAyB,IAArBkM,EAAU9iB,OACV,MAAM,IAAIsC,MAAM,oBAEpB,OAAOotC,CACX,CAUA,kBAAOuB,CAAYr6B,GACf,MAAMs6B,EAAQlB,GAAImB,aAAav6B,GACzBw6B,EAAaF,EAAM1mC,KAAO0mC,EAAMG,cAChCC,EAAiB3iC,EAAOiI,EAAMihB,SAASuZ,EAAYA,EAAaF,EAAMG,gBAC5E,GAAIC,EAAe/O,aAAe2O,EAAMG,cACpC,MAAM,IAAI/uC,MAAM,oBAEpB,MAAMivC,EAAcD,EAAezZ,SAASqZ,EAAMG,cAAgBH,EAAMM,YAClEx1B,EAAS,IAAIizB,GAAciC,EAAMO,cAAeP,EAAMM,WAAYD,EAAaD,GAIrF,MAAO,CAHuB,IAAlBJ,EAAMzB,QACZO,GAAIK,SAASr0B,GACbg0B,GAAIO,SAASW,EAAMxH,MAAO1tB,GACnBpF,EAAMihB,SAASqZ,EAAM1mC,MACtC,CAUA,mBAAO2mC,CAAaO,GAChB,IAAIzxC,EAAS,EACb,MAAMuS,EAAO,KACT,MAAOtR,EAAGlB,GAAU,GAAc0xC,EAAa7Z,SAAS53B,IAExD,OADAA,GAAUD,EACHkB,CAAC,EAEZ,IAAIuuC,EAAUj9B,IACVk3B,EAAQyG,GASZ,GARgB,KAAZV,GAEAA,EAAU,EACVxvC,EAAS,GAGTypC,EAAQl3B,IAEI,IAAZi9B,GAA6B,IAAZA,EACjB,MAAM,IAAIpY,WAAW,uBAAuBoY,KAEhD,MAAM2B,EAAanxC,EACbwxC,EAAgBj/B,IAChBg/B,EAAah/B,IACbhI,EAAOvK,EAASuxC,EAEtB,MAAO,CAAE/B,UAAS/F,QAAO+H,gBAAeD,aAAYH,cAD9B7mC,EAAO4mC,EACsC5mC,OACvE,CAOA,YAAOkX,CAAM5e,EAAQshB,GACjB,MAAOla,EAAQ0M,GAUvB,SAAyB9T,EAAQshB,GAC7B,OAAQthB,EAAO,IAEX,IAAK,IAAK,CACN,MAAMirB,EAAU3J,GAAQspB,GACxB,MAAO,CACHA,GAAUxjC,OACV6jB,EAAQ7rB,OAAO,GAAGwrC,GAAUxjC,SAASpH,KAE7C,CACA,KAAK4qC,GAAUxjC,OAAQ,CACnB,MAAM6jB,EAAU3J,GAAQspB,GACxB,MAAO,CAACA,GAAUxjC,OAAQ6jB,EAAQ7rB,OAAOY,GAC7C,CACA,KAAK6U,GAAOzN,OAAQ,CAChB,MAAM6jB,EAAU3J,GAAQzM,GACxB,MAAO,CAACA,GAAOzN,OAAQ6jB,EAAQ7rB,OAAOY,GAC1C,CACA,QACI,GAAY,MAARshB,EACA,MAAM9hB,MAAM,mFAEhB,MAAO,CAACQ,EAAO,GAAIshB,EAAKliB,OAAOY,IAG3C,CAnCgC6uC,CAAgB7uC,EAAQshB,GAC1CsrB,EAAMM,GAAI9tC,OAAO0U,GACvB,GAAoB,IAAhB84B,EAAID,SAA+B,MAAd3sC,EAAO,GAC5B,MAAMR,MAAM,0DAIhB,OADAstC,GAAUF,GAAKrgC,IAAInF,EAAQpH,GACpB4sC,CACX,EAuDJ,MAAMS,GAAc,IACdC,GAAe,GACrB,SAASW,GAAUtB,EAAS9+B,EAAMu+B,GAC9B,MAAM0C,EAAa,GAAsBnC,GACnCoC,EAAaD,EAAa,GAAsBjhC,GAChDiG,EAAQ,IAAI3Q,WAAW4rC,EAAa3C,EAAU3M,YAIpD,OAHA,GAAgBkN,EAAS74B,EAAO,GAChC,GAAgBjG,EAAMiG,EAAOg7B,GAC7Bh7B,EAAMvH,IAAI6/B,EAAW2C,GACdj7B,CACX,CACA,MAAMo6B,GAAY1+B,OAAOw+B,IAAI,oBCrWhBgB,GAAQ,IAAK,KAAiB,KAAU,KAAU,KAAW,KAAW,KAAW,KAAW,KAAW,KAAW,GCbjI,SAASC,GAAY5hC,EAAMjG,EAAQ/I,EAAQe,GACvC,MAAO,CACHiO,OACAjG,SACA4jB,QAAS,CACL3d,OACAjG,SACA/I,UAEJ4sB,QAAS,CACL7rB,UAGZ,CACA,MAAMxB,GAASqxC,GAAY,OAAQ,KAAMlrC,GAE9B,IADS,IAAImnC,YAAY,QACX9rC,OAAO2E,KAC5BmQ,IACgB,IAAIi3B,aACL9sC,OAAO6V,EAAIrH,UAAU,MAElCqiC,GAAQD,GAAY,QAAS,KAAMlrC,IACrC,IAAInG,EAAS,IACb,IAAK,IAAIQ,EAAI,EAAGA,EAAI2F,EAAI7G,OAAQkB,IAC5BR,GAAUmB,OAAOC,aAAa+E,EAAI3F,IAEtC,OAAOR,CAAM,IACbsW,IAEA,MAAMnQ,EAAMq6B,GADZlqB,EAAMA,EAAIrH,UAAU,IACQ3P,QAC5B,IAAK,IAAIkB,EAAI,EAAGA,EAAI8V,EAAIhX,OAAQkB,IAC5B2F,EAAI3F,GAAK8V,EAAI5U,WAAWlB,GAE5B,OAAO2F,CAAG,IAWd,GATc,CACVgE,KAAMnK,GACN,QAASA,GACTmb,IAAKi2B,GAAMxF,OACX2F,OAAQD,GACRA,SACArsC,OAAQqsC,MACLF,ICpCA,SAAS,GAAWpxC,EAAQugC,EAAW,QAC1C,MAAM7c,EAAO,GAAM6c,GACnB,GAAY,MAAR7c,EACA,MAAM,IAAI9hB,MAAM,yBAAyB2+B,MAG7C,OAAO7c,EAAK2J,QAAQ7rB,OAAO,GAAGkiB,EAAKla,SAASxJ,IAChD,CCHA,MAAM8gC,GAIF7hC,GAIAmL,IAIA0H,KAIA5L,IACA,WAAAwK,CAAYzR,EAAImL,EAAKlE,GACjBtC,KAAK3E,GAAKA,EACV2E,KAAKwG,IAAMA,EACXxG,KAAKkO,UAAOnQ,EACZiC,KAAKsC,IAAMA,CACf,EAGJ,SAAS66B,KAAS,CAIlB,MAAMC,GAIF7N,KAIA8N,KAIA72B,IAIA0H,KACA,WAAApB,CAAYge,GACR9qB,KAAKuvB,KAAOzE,EAAOyE,KACnBvvB,KAAKq9B,KAAOvS,EAAOuS,KACnBr9B,KAAKwG,IAAMskB,EAAOtkB,IAClBxG,KAAKkO,KAAO4c,EAAOwS,MACvB,EAEJ,MAAMsQ,GC7DS,SAAc1nC,GACzB,MAAMC,EAAe,KAErB,IAAIE,EACA1K,EAASwK,EACb,OAAO,SAAmBD,GACtB,GAAIA,EAAO,GAAKA,EAJRC,KAKJ,OAAOy2B,EAAY12B,GAEnBvK,EAASuK,EAAOC,IAChBE,EAAOu2B,EAAYz2B,GACnBxK,EAAS,GAEb,MAAM4G,EAAM8D,EAAKktB,SAAS53B,EAAQA,GAAUuK,GAK5C,OAJc,EAATvK,IAEDA,EAAwB,GAAL,EAATA,IAEP4G,CACX,CACJ,CDyCmBk5B,GAiBnB,MAAMoS,GAIFrnC,IAIA+oB,KAIA8N,KAIAC,OACA,WAAAxwB,GACI9M,KAAKwG,IAAM,EACXxG,KAAKuvB,KAAO,IAAI2N,GAAGC,GAAM,EAAG,GAC5Bn9B,KAAKq9B,KAAOr9B,KAAKuvB,KACjBvvB,KAAKs9B,OAAS,IAClB,CAIA,KAAAK,CAAMtiC,EAAImL,EAAKlE,GAGX,OAFAtC,KAAKq9B,KAAOr9B,KAAKq9B,KAAKnvB,KAAO,IAAIgvB,GAAG7hC,EAAImL,EAAKlE,GAC7CtC,KAAKwG,KAAOA,EACLxG,IACX,CAIA,MAAAwzB,CAAO/zB,GAaH,OAVAO,KAAKwG,MAAQxG,KAAKq9B,KAAOr9B,KAAKq9B,KAAKnvB,KAAO,IAAIsvB,IAAU/9B,KAAkB,GACtE,IACE,EACAA,EAAQ,MACJ,EACAA,EAAQ,QACJ,EACAA,EAAQ,UACJ,EACA,EAAGA,IAAQ+G,IACtBxG,IACX,CAIA,KAAAyzB,CAAMh0B,GACF,OAAOA,EAAQ,EACTO,KAAK29B,MAAMF,GAAe,GAAI7K,EAASpK,WAAW/oB,IAClDO,KAAKwzB,OAAO/zB,EACtB,CAIA,MAAAi0B,CAAOj0B,GACH,OAAOO,KAAKwzB,QAAQ/zB,GAAS,EAAIA,GAAS,MAAQ,EACtD,CAIA,MAAA20B,CAAO30B,GACH,MAAMuV,EAAO4d,EAASwR,WAAW3kC,GACjC,OAAOO,KAAK29B,MAAMF,GAAezoB,EAAKtZ,SAAUsZ,EACpD,CAIA,YAAA2vB,CAAallC,GACT,OAAOO,KAAK29B,MAAM+F,EAAkBF,EAAe/jC,GAAQA,EAC/D,CAIA,YAAAmlC,CAAanlC,GACT,OAAOO,KAAKo0B,OAAO4P,OAAOvkC,GAC9B,CAIA,KAAA00B,CAAM10B,GACF,OAAOO,KAAKo0B,OAAO30B,EACvB,CAIA,WAAAglC,CAAYhlC,GACR,OAAOO,KAAK2kC,aAAallC,EAC7B,CAIA,WAAAilC,CAAYjlC,GACR,OAAOO,KAAK4kC,aAAanlC,EAC7B,CAIA,MAAA40B,CAAO50B,GACH,MAAMuV,EAAO4d,EAASwR,WAAW3kC,GAAOk7B,WACxC,OAAO36B,KAAK29B,MAAMF,GAAezoB,EAAKtZ,SAAUsZ,EACpD,CAIA,YAAA6vB,CAAaplC,GACT,MAAMuV,EAAO4d,EAASpK,WAAW/oB,GAAOk7B,WACxC,OAAO36B,KAAK29B,MAAMF,GAAezoB,EAAKtZ,SAAUsZ,EACpD,CAIA,YAAA8vB,CAAarlC,GACT,OAAOO,KAAKq0B,OAAO2P,OAAOvkC,GAC9B,CAIA,IAAAk0B,CAAKl0B,GACD,OAAOO,KAAK29B,MAAMJ,GAAW,EAAG99B,EAAQ,EAAI,EAChD,CAIA,OAAAm0B,CAAQn0B,GACJ,OAAOO,KAAK29B,MAAMD,GAAc,EAAGj+B,IAAU,EACjD,CAIA,QAAAo0B,CAASp0B,GACL,OAAOO,KAAK4zB,QAAQn0B,EACxB,CAIA,OAAA80B,CAAQ90B,GACJ,MAAMuV,EAAO4d,EAASwR,WAAW3kC,GACjC,OAAOO,KAAK29B,MAAMD,GAAc,EAAG1oB,EAAK/P,IAAI04B,MAAMD,GAAc,EAAG1oB,EAAK9P,GAC5E,CAIA,aAAA6/B,CAActlC,GACV,MAAMuV,EAAO4d,EAASpK,WAAW/oB,GACjC,OAAOO,KAAK29B,MAAMD,GAAc,EAAG1oB,EAAK/P,IAAI04B,MAAMD,GAAc,EAAG1oB,EAAK9P,GAC5E,CAIA,aAAA8/B,CAAcvlC,GACV,OAAOO,KAAKu0B,QAAQyP,OAAOvkC,GAC/B,CAIA,QAAA+0B,CAAS/0B,GACL,OAAOO,KAAKu0B,QAAQ90B,EACxB,CAIA,cAAAwlC,CAAexlC,GACX,OAAOO,KAAK+kC,cAActlC,EAC9B,CAIA,cAAAylC,CAAezlC,GACX,OAAOO,KAAKglC,cAAcvlC,EAC9B,CAIA,KAAAq0B,CAAMr0B,GACF,OAAOO,KAAK29B,MAAM/6B,EAAc,EAAGnD,EACvC,CAQA,MAAAs0B,CAAOt0B,GACH,OAAOO,KAAK29B,MAAMl5B,EAAe,EAAGhF,EACxC,CAIA,KAAA6S,CAAM7S,GACF,MAAM+G,EAAM/G,EAAM/D,SAAW,EAC7B,OAAY,IAAR8K,EACOxG,KAAK29B,MAAMJ,GAAW,EAAG,GAE7Bv9B,KAAKwzB,OAAOhtB,GAAKm3B,MAAMC,GAAYp3B,EAAK/G,EACnD,CAIA,MAAArD,CAAOqD,GACH,MAAM+G,E5B7RP,SAAgBpK,GACnB,IAAIoK,EAAM,EACN3I,EAAI,EACR,IAAK,IAAIjB,EAAI,EAAGA,EAAIR,EAAOV,SAAUkB,EACjCiB,EAAIzB,EAAO0B,WAAWlB,GAClBiB,EAAI,IACJ2I,GAAO,EAEF3I,EAAI,KACT2I,GAAO,EAEe,QAAZ,MAAJ3I,IAAkE,QAAZ,MAA3BzB,EAAO0B,WAAWlB,EAAI,OACrDA,EACF4J,GAAO,GAGPA,GAAO,EAGf,OAAOA,CACX,C4ByQoB,CAAY/G,GACxB,OAAe,IAAR+G,EACDxG,KAAKwzB,OAAOhtB,GAAKm3B,MAAM,EAAYn3B,EAAK/G,GACxCO,KAAK29B,MAAMJ,GAAW,EAAG,EACnC,CAKA,IAAA1D,GAII,OAHA75B,KAAKs9B,OAAS,IAAIF,GAAMp9B,MACxBA,KAAKuvB,KAAOvvB,KAAKq9B,KAAO,IAAIH,GAAGC,GAAM,EAAG,GACxCn9B,KAAKwG,IAAM,EACJxG,IACX,CAIA,KAAAqW,GAWI,OAVmB,MAAfrW,KAAKs9B,QACLt9B,KAAKuvB,KAAOvvB,KAAKs9B,OAAO/N,KACxBvvB,KAAKq9B,KAAOr9B,KAAKs9B,OAAOD,KACxBr9B,KAAKwG,IAAMxG,KAAKs9B,OAAO92B,IACvBxG,KAAKs9B,OAASt9B,KAAKs9B,OAAOpvB,OAG1BlO,KAAKuvB,KAAOvvB,KAAKq9B,KAAO,IAAIH,GAAGC,GAAM,EAAG,GACxCn9B,KAAKwG,IAAM,GAERxG,IACX,CAIA,MAAA85B,GACI,MAAMvK,EAAOvvB,KAAKuvB,KACZ8N,EAAOr9B,KAAKq9B,KACZ72B,EAAMxG,KAAKwG,IAOjB,OANAxG,KAAKqW,QAAQmd,OAAOhtB,GACR,IAARA,IACAxG,KAAKq9B,KAAKnvB,KAAOqhB,EAAKrhB,KACtBlO,KAAKq9B,KAAOA,EACZr9B,KAAKwG,KAAOA,GAETxG,IACX,CAIA,MAAAg1B,GACI,IAAIzF,EAAOvvB,KAAKuvB,KAAKrhB,KACrB,MAAM3L,GA9QC2D,EA8QWlG,KAAKwG,IA7QF,MAArBkV,WAAWuX,OACJ2J,EAAY12B,GAEhB0nC,GAAW1nC,IAJtB,IAAeA,EA+QP,IAAI1D,EAAM,EACV,KAAe,MAAR+sB,GACHA,EAAKl0B,GAAGk0B,EAAKjtB,IAAKC,EAAKC,GACvBA,GAAO+sB,EAAK/oB,IACZ+oB,EAAOA,EAAKrhB,KAGhB,OAAO3L,CACX,EAEJ,SAASg7B,GAAUj7B,EAAKC,EAAKC,GACzBD,EAAIC,GAAa,IAANF,CACf,CACA,SAASwrC,GAAcxrC,EAAKC,EAAKC,GAC7B,KAAOF,EAAM,KACTC,EAAIC,KAAe,IAANF,EAAY,IACzBA,KAAS,EAEbC,EAAIC,GAAOF,CACf,CAMA,MAAMk7B,WAAiBN,GACnBhvB,KACA,WAAApB,CAAYtG,EAAKlE,GACbyrC,MAAMD,GAAetnC,EAAKlE,GAC1BtC,KAAKkO,UAAOnQ,CAChB,EAEJ,SAAS0/B,GAAcn7B,EAAKC,EAAKC,GAC7B,KAAkB,IAAXF,EAAI4C,IACP3C,EAAIC,KAAkB,IAATF,EAAI2C,GAAW,IAC5B3C,EAAI2C,IAAM3C,EAAI2C,KAAO,EAAI3C,EAAI4C,IAAM,MAAQ,EAC3C5C,EAAI4C,MAAQ,EAEhB,KAAO5C,EAAI2C,GAAK,KACZ1C,EAAIC,KAAkB,IAATF,EAAI2C,GAAW,IAC5B3C,EAAI2C,GAAK3C,EAAI2C,KAAO,EAExB1C,EAAIC,KAASF,EAAI2C,EACrB,CACA,SAASy4B,GAAap7B,EAAKC,EAAKC,GAC5BD,EAAIC,GAAa,IAANF,EACXC,EAAIC,EAAM,GAAKF,IAAQ,EAAI,IAC3BC,EAAIC,EAAM,GAAKF,IAAQ,GAAK,IAC5BC,EAAIC,EAAM,GAAKF,IAAQ,EAC3B,CACA,SAASs7B,GAAWt7B,EAAKC,EAAKC,GAC1BD,EAAIwI,IAAIzI,EAAKE,EACjB,CAmBA,SAASu7B,GAAiBz7B,EAAKC,EAAKC,GAChCD,EAAIwI,IAAIzI,EAAKE,EAEjB,CACA,SAASs7B,GAAkBx7B,EAAKC,EAAKC,GAC7BF,EAAI5G,OAAS,GAEb,EAAW4G,EAAKC,EAAKC,GAGC,MAAjBD,EAAIq5B,UAETr5B,EAAIq5B,UAAUt5B,EAAKE,GAGnBD,EAAIwI,IAAI,GAAqBzI,GAAME,EAE3C,CE3aO,SAASwrC,GAAcvkC,EAAS27B,GACnC,MAAMtvB,EF+aC,IAAI+3B,GE3aX,OAHAzI,EAAMvoC,OAAO4M,EAASqM,EAAG,CACrBm4B,iBAAiB,IAEdn4B,EAAEkf,QACb,CCNO,IAAIkZ,GCMAC,GAoGAC,GCpGAC,GAqHAC,GAqDAC,GAkEA,GAoGA,GCjVAC,GCCAC,GAgGA,GA+DA,GAsDA,GAoGA,GCzTAC,GAwDAC,GAsDA,GAkEA,GAoGA,GCpRAC,GA8DA,GAoIA,GAsFA,GAoGA,GC7XAC,GA4CAC,GA4CAC,GAqDA,GC7IAC,GA2DAC,GRvDJ,SAAS,GAAYpjC,EAAM3D,EAAMrL,EAAQe,GAC5C,MAAO,CACHiO,OACA3D,OACArL,SACAe,SAER,CShBO,SAASsxC,GAAY1lC,GACxB,SAAS2lC,EAAU7sC,GAGf,GAAyB,MAArBkH,EAAElH,EAAI7D,YACN,MAAM,IAAIT,MAAM,sBAEpB,OAAOwL,EAAElH,EACb,CAUA,OAAO,GAAY,OAAQ4rC,GAAYkB,QATxB,SAAoB9sC,EAAKwoB,GACpC,MAAMukB,EAAYF,EAAU7sC,GAC5BwoB,EAAO2I,MAAM4b,EACjB,IACe,SAAoBrkB,GAE/B,OAAOmkB,EADKnkB,EAAOyI,QAEvB,GAGJ,CCnBO,SAAShqB,GAAQ5M,EAAQe,GAC5B,OAAO,GAAY,UAAWswC,GAAYoB,iBAAkBzyC,EAAQe,EACxE,CbsYyB,MAArB8d,WAAWuX,SACX4a,GAAiB3tC,UAAUoS,MAAQ,SAAU7S,GACzC,MAAM+G,EAAM/G,EAAM/D,SAAW,EAK7B,OAJAsE,KAAKwzB,OAAOhtB,GACRA,EAAM,GACNxG,KAAK29B,MAAMI,GAAkBv3B,EAAK/G,GAE/BO,IACX,EACA6tC,GAAiB3tC,UAAU9D,OAAS,SAAUqD,GAC1C,MAAM+G,EAAMkV,WAAWuX,OAAOgL,WAAWx+B,GAKzC,OAJAO,KAAKwzB,OAAOhtB,GACRA,EAAM,GACNxG,KAAK29B,MAAMG,GAAmBt3B,EAAK/G,GAEhCO,IACX,GGvZJ,SAAWkuC,GACPA,EAAYA,EAAoB,OAAI,GAAK,SACzCA,EAAYA,EAAmB,MAAI,GAAK,QACxCA,EAAYA,EAA8B,iBAAI,GAAK,mBACnDA,EAAYA,EAAyB,YAAI,GAAK,cAC9CA,EAAYA,EAAuB,UAAI,GAAK,YAC5CA,EAAYA,EAAmB,MAAI,GAAK,OAC3C,CAPD,CAOGA,KAAgBA,GAAc,CAAC,IWaHlwC,MAUxB,MAAMuxC,WAAuBvxC,MAMhCqO,KAAO,iBACPR,KAAO,iBCvCJ,SAAS2jC,GAAU/vC,GACtB,OAAO0nB,QAAQ1nB,EACnB,CCFO,SAASgwC,GAAoBhtB,GAChC,MAAMitB,EAAkB,IAAIjE,IAS5B,OARAhpB,EAAO3W,SAASrM,IACZ,IAAIkwC,EAAOD,EAAgB5kC,IAAIrL,EAAMmwC,cAChCD,IACDD,EAAgB3kC,IAAItL,EAAMmwC,aAAc,IACxCD,EAAOD,EAAgB5kC,IAAIrL,EAAMmwC,eAErCD,EAAKryC,KAAKmC,EAAM,IAEbiwC,CACX,CCkCA,SAASG,GAAK1lC,GACV,OAAO,IAAIrO,SAASC,IAChB05B,WAAW15B,EAASoO,EAAG,GAE/B,EbzCA,SAAWgkC,GACP,IAAI2B,EACJ3B,EAAe/I,MAAQ,KACL,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,MACD,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEY,MAAb1tB,EAAI4jC,OAAiB5jC,EAAI4jC,MAAM9R,WAAa,IAC7CnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAI4jC,QAEO,MAAlB5jC,EAAI6jC,YAAsB7jC,EAAI6jC,WAAW/R,WAAa,IACvDnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAI6jC,aAEE,MAAb7jC,EAAI8jC,OAAiB9jC,EAAI8jC,MAAMhS,WAAa,IAC7CnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAI8jC,QAEG,MAAd9jC,EAAI+jC,QAAkB/jC,EAAI+jC,OAAOjS,WAAa,IAC/CnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAI+jC,SAEG,MAAd/jC,EAAIgkC,QAAkBhkC,EAAIgkC,OAAOlS,WAAa,IAC/CnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIgkC,SAEM,MAAjBhkC,EAAIikC,WAAqBjkC,EAAIikC,UAAUnS,WAAa,IACrDnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIikC,YAEU,MAArBjkC,EAAIkkC,eAAyBlkC,EAAIkkC,cAAcpS,WAAa,IAC7DnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIkkC,iBAEa,IAAzBhL,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,EAAQ2pC,EAAO,CAAC,KACxB,MAAMl5B,EAAM,CACR4jC,MAAO,EAAgB,GACvBC,WAAY,EAAgB,GAC5BC,MAAO,EAAgB,GACvBC,OAAQ,EAAgB,GACxBC,OAAQ,EAAgB,GACxBC,UAAW,EAAgB,GAC3BC,cAAe,EAAgB,IAE7BrzC,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,OAAQ8c,IAAQ,GACZ,KAAK,EACDnkC,EAAI4jC,MAAQ/kB,EAAO1Y,QACnB,MAEJ,KAAK,EACDnG,EAAI6jC,WAAahlB,EAAO1Y,QACxB,MAEJ,KAAK,EACDnG,EAAI8jC,MAAQjlB,EAAO1Y,QACnB,MAEJ,KAAK,EACDnG,EAAI+jC,OAASllB,EAAO1Y,QACpB,MAEJ,KAAK,EACDnG,EAAIgkC,OAASnlB,EAAO1Y,QACpB,MAEJ,KAAK,EACDnG,EAAIikC,UAAYplB,EAAO1Y,QACvB,MAEJ,KAAK,EACDnG,EAAIkkC,cAAgBrlB,EAAO1Y,QAC3B,MAEJ,QACI0Y,EAAOiJ,SAAe,EAANqc,GAI5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEX3B,EAAetxC,OAAUsP,GACd6hC,GAAc7hC,EAAKgiC,EAAe/I,SAE7C+I,EAAevwC,OAAS,CAAC2E,EAAK8iC,IACnBF,EAAc5iC,EAAK4rC,EAAe/I,QAASC,EAEzD,CAlGD,CAkGG8I,KAAmBA,GAAiB,CAAC,IAExC,SAAWC,GACP,IAAI0B,EACJ1B,EAAYhJ,MAAQ,KACF,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,MACD,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEc,MAAf1tB,EAAIokC,SAAmBpkC,EAAIokC,QAAQtS,WAAa,IACjDnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIokC,UAES,MAApBpkC,EAAIyjC,cAA6C,KAArBzjC,EAAIyjC,eACjC95B,EAAE0d,OAAO,IACT1d,EAAE1Z,OAAO+P,EAAIyjC,eAEE,MAAfzjC,EAAIg/B,UACJr1B,EAAE0d,OAAO,IACT1d,EAAE0d,OAAOrnB,EAAIg/B,UAEI,MAAjBh/B,EAAIqkC,YACJ16B,EAAE0d,OAAO,IACT1d,EAAEue,OAAOloB,EAAIqkC,YAED,MAAZrkC,EAAIskC,OACJ36B,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIskC,OAEU,MAAtBtkC,EAAIukC,iBACJ56B,EAAE0d,OAAO,KACT2a,GAAe/I,QAAQvoC,OAAOsP,EAAIukC,eAAgB56B,IAEjC,MAAjB3J,EAAIwkC,YACJ76B,EAAE0d,OAAO,KACT1d,EAAE6d,KAAKxnB,EAAIwkC,aAEc,IAAzBtL,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,EAAQ2pC,EAAO,CAAC,KACxB,MAAMl5B,EAAM,CACRokC,QAAS,EAAgB,GACzBX,aAAc,IAEZ5yC,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,OAAQ8c,IAAQ,GACZ,KAAK,EACDnkC,EAAIokC,QAAUvlB,EAAO1Y,QACrB,MAEJ,KAAK,EACDnG,EAAIyjC,aAAe5kB,EAAO5uB,SAC1B,MAEJ,KAAK,EACD+P,EAAIg/B,QAAUngB,EAAOwI,SACrB,MAEJ,KAAK,GACDrnB,EAAIqkC,UAAYxlB,EAAOqJ,SACvB,MAEJ,KAAK,GACDloB,EAAIskC,KAAOzlB,EAAO1Y,QAClB,MAEJ,KAAK,GACDnG,EAAIukC,eAAiBvC,GAAe/I,QAAQxnC,OAAOotB,EAAQA,EAAOwI,SAAU,CACxEod,OAAQvL,EAAKuL,QAAQF,iBAEzB,MAEJ,KAAK,GACDvkC,EAAIwkC,UAAY3lB,EAAO2I,OACvB,MAEJ,QACI3I,EAAOiJ,SAAe,EAANqc,GAI5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEX1B,EAAYvxC,OAAUsP,GACX6hC,GAAc7hC,EAAKiiC,EAAYhJ,SAE1CgJ,EAAYxwC,OAAS,CAAC2E,EAAK8iC,IAChBF,EAAc5iC,EAAK6rC,EAAYhJ,QAASC,EAEtD,CA/FD,CA+FG+I,KAAgBA,GAAc,CAAC,ICnMlC,SAAWC,GACP,IAAIwC,EA8CAf,GA7CJ,SAAWe,GACP,IAAIf,EACJe,EAAczL,MAAQ,KACJ,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,MACD,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEmB,MAApB1tB,EAAIyjC,cAA6C,KAArBzjC,EAAIyjC,eACjC95B,EAAE0d,OAAO,IACT1d,EAAE1Z,OAAO+P,EAAIyjC,gBAEY,IAAzBvK,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,EAAQ2pC,EAAO,CAAC,KACxB,MAAMl5B,EAAM,CACRyjC,aAAc,IAEZ5yC,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACX8c,IAAQ,GACP,EACDnkC,EAAIyjC,aAAe5kB,EAAO5uB,SAI1B4uB,EAAOiJ,SAAe,EAANqc,EAI5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEXe,EAAch0C,OAAUsP,GACb6hC,GAAc7hC,EAAK0kC,EAAczL,SAE5CyL,EAAcjzC,OAAS,CAAC2E,EAAK8iC,IAClBF,EAAc5iC,EAAKsuC,EAAczL,QAASC,EAExD,CA5CD,CA4CGwL,EAAgBxC,EAAcwC,gBAAkBxC,EAAcwC,cAAgB,CAAC,IAElFxC,EAAcjJ,MAAQ,KACJ,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,KAY9B,IAX6B,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEgB,MAAjB1tB,EAAI2kC,YAAuC,IAAlB3kC,EAAI2kC,YAC9Bh7B,EAAE0d,OAAO,GACT1d,EAAE6d,KAAKxnB,EAAI2kC,YAEG,MAAb3kC,EAAI4kC,OAA+B,KAAd5kC,EAAI4kC,QAC1Bj7B,EAAE0d,OAAO,IACT1d,EAAE1Z,OAAO+P,EAAI4kC,QAES,MAAtB5kC,EAAI6kC,eACJ,IAAK,MAAMvxC,KAAS0M,EAAI6kC,eACpBl7B,EAAE0d,OAAO,IACT6a,EAAcwC,cAAczL,QAAQvoC,OAAO4C,EAAOqW,IAG7B,IAAzBuvB,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,EAAQ2pC,EAAO,CAAC,KACxB,MAAMl5B,EAAM,CACR2kC,WAAW,EACXC,MAAO,GACPC,eAAgB,IAEdh0C,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,OAAQ8c,IAAQ,GACZ,KAAK,EACDnkC,EAAI2kC,UAAY9lB,EAAO2I,OACvB,MAEJ,KAAK,EACDxnB,EAAI4kC,MAAQ/lB,EAAO5uB,SACnB,MAEJ,KAAK,EACD,GAAmC,MAA/BipC,EAAKuL,QAAQI,gBAA0B7kC,EAAI6kC,eAAet1C,SAAW2pC,EAAKuL,OAAOI,eACjF,MAAM,IAAIzB,GAAe,mEAE7BpjC,EAAI6kC,eAAe1zC,KAAK+wC,EAAcwC,cAAczL,QAAQxnC,OAAOotB,EAAQA,EAAOwI,SAAU,CACxFod,OAAQvL,EAAKuL,QAAQK,mBAEzB,MAEJ,QACIjmB,EAAOiJ,SAAe,EAANqc,GAI5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEXzB,EAAcxxC,OAAUsP,GACb6hC,GAAc7hC,EAAKkiC,EAAcjJ,SAE5CiJ,EAAczwC,OAAS,CAAC2E,EAAK8iC,IAClBF,EAAc5iC,EAAK8rC,EAAcjJ,QAASC,EAExD,CAnHD,CAmHGgJ,KAAkBA,GAAgB,CAAC,IAEtC,SAAWC,GACP,IAAIwB,EACJxB,EAAYlJ,MAAQ,KACF,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,KAI9B,IAH6B,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEc,MAAhB1tB,EAAI+kC,SACJ,IAAK,MAAMzxC,KAAS0M,EAAI+kC,SACpBp7B,EAAE0d,OAAO,IACT,GAAY4R,QAAQvoC,OAAO4C,EAAOqW,IAGb,IAAzBuvB,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,EAAQ2pC,EAAO,CAAC,KACxB,MAAMl5B,EAAM,CACR+kC,SAAU,IAERl0C,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,GAAQ8c,IAAQ,GACP,EAAL,CACI,GAA6B,MAAzBjL,EAAKuL,QAAQM,UAAoB/kC,EAAI+kC,SAASx1C,SAAW2pC,EAAKuL,OAAOM,SACrE,MAAM,IAAI3B,GAAe,6DAE7BpjC,EAAI+kC,SAAS5zC,KAAK,GAAY8nC,QAAQxnC,OAAOotB,EAAQA,EAAOwI,SAAU,CAClEod,OAAQvL,EAAKuL,QAAQO,YAG7B,MAEInmB,EAAOiJ,SAAe,EAANqc,EAI5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEXxB,EAAYzxC,OAAUsP,GACX6hC,GAAc7hC,EAAKmiC,EAAYlJ,SAE1CkJ,EAAY1wC,OAAS,CAAC2E,EAAK8iC,IAChBF,EAAc5iC,EAAK+rC,EAAYlJ,QAASC,EAEtD,CAnDD,CAmDGiJ,KAAgBA,GAAc,CAAC,IAElC,SAAWC,GACP,IAAIuB,EACJvB,EAAUnJ,MAAQ,KACA,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,MACD,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEgB,MAAjB1tB,EAAIilC,WAAuC,KAAlBjlC,EAAIilC,YAC9Bt7B,EAAE0d,OAAO,IACT1d,EAAE1Z,OAAO+P,EAAIilC,YAEE,MAAfjlC,EAAIqqB,UACJ1gB,EAAE0d,OAAO,IACT6a,GAAcjJ,QAAQvoC,OAAOsP,EAAIqqB,QAAS1gB,IAE9B,MAAZ3J,EAAI7O,OACJwY,EAAE0d,OAAO,IACT8a,GAAYlJ,QAAQvoC,OAAOsP,EAAI7O,KAAMwY,KAEZ,IAAzBuvB,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,EAAQ2pC,EAAO,CAAC,KACxB,MAAMl5B,EAAM,CACRilC,UAAW,IAETp0C,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,OAAQ8c,IAAQ,GACZ,KAAK,EACDnkC,EAAIilC,UAAYpmB,EAAO5uB,SACvB,MAEJ,KAAK,EACD+P,EAAIqqB,QAAU6X,GAAcjJ,QAAQxnC,OAAOotB,EAAQA,EAAOwI,SAAU,CAChEod,OAAQvL,EAAKuL,QAAQpa,UAEzB,MAEJ,KAAK,EACDrqB,EAAI7O,KAAOgxC,GAAYlJ,QAAQxnC,OAAOotB,EAAQA,EAAOwI,SAAU,CAC3Dod,OAAQvL,EAAKuL,QAAQtzC,OAEzB,MAEJ,QACI0tB,EAAOiJ,SAAe,EAANqc,GAI5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEXvB,EAAU1xC,OAAUsP,GACT6hC,GAAc7hC,EAAKoiC,EAAUnJ,SAExCmJ,EAAU3wC,OAAS,CAAC2E,EAAK8iC,IACdF,EAAc5iC,EAAKgsC,EAAUnJ,QAASC,EAEpD,CAhED,CAgEGkJ,KAAcA,GAAY,CAAC,IAE9B,SAAWJ,GACP,IAAI2B,EACJ3B,EAAe/I,MAAQ,KACL,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,MACD,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEY,MAAb1tB,EAAI4jC,OAAiB5jC,EAAI4jC,MAAM9R,WAAa,IAC7CnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAI4jC,QAEO,MAAlB5jC,EAAI6jC,YAAsB7jC,EAAI6jC,WAAW/R,WAAa,IACvDnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAI6jC,aAEE,MAAb7jC,EAAI8jC,OAAiB9jC,EAAI8jC,MAAMhS,WAAa,IAC7CnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAI8jC,QAEG,MAAd9jC,EAAI+jC,QAAkB/jC,EAAI+jC,OAAOjS,WAAa,IAC/CnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAI+jC,SAEG,MAAd/jC,EAAIgkC,QAAkBhkC,EAAIgkC,OAAOlS,WAAa,IAC/CnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIgkC,SAEM,MAAjBhkC,EAAIikC,WAAqBjkC,EAAIikC,UAAUnS,WAAa,IACrDnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIikC,YAEU,MAArBjkC,EAAIkkC,eAAyBlkC,EAAIkkC,cAAcpS,WAAa,IAC7DnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIkkC,iBAEa,IAAzBhL,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,EAAQ2pC,EAAO,CAAC,KACxB,MAAMl5B,EAAM,CACR4jC,MAAO,EAAgB,GACvBC,WAAY,EAAgB,GAC5BC,MAAO,EAAgB,GACvBC,OAAQ,EAAgB,GACxBC,OAAQ,EAAgB,GACxBC,UAAW,EAAgB,GAC3BC,cAAe,EAAgB,IAE7BrzC,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,OAAQ8c,IAAQ,GACZ,KAAK,EACDnkC,EAAI4jC,MAAQ/kB,EAAO1Y,QACnB,MAEJ,KAAK,EACDnG,EAAI6jC,WAAahlB,EAAO1Y,QACxB,MAEJ,KAAK,EACDnG,EAAI8jC,MAAQjlB,EAAO1Y,QACnB,MAEJ,KAAK,EACDnG,EAAI+jC,OAASllB,EAAO1Y,QACpB,MAEJ,KAAK,EACDnG,EAAIgkC,OAASnlB,EAAO1Y,QACpB,MAEJ,KAAK,EACDnG,EAAIikC,UAAYplB,EAAO1Y,QACvB,MAEJ,KAAK,EACDnG,EAAIkkC,cAAgBrlB,EAAO1Y,QAC3B,MAEJ,QACI0Y,EAAOiJ,SAAe,EAANqc,GAI5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEX3B,EAAetxC,OAAUsP,GACd6hC,GAAc7hC,EAAKgiC,EAAe/I,SAE7C+I,EAAevwC,OAAS,CAAC2E,EAAK8iC,IACnBF,EAAc5iC,EAAK4rC,EAAe/I,QAASC,EAEzD,CAlGD,CAkGG,KAAmB,GAAiB,CAAC,IAExC,SAAW+I,GACP,IAAI0B,EACJ1B,EAAYhJ,MAAQ,KACF,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,MACD,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEc,MAAf1tB,EAAIokC,SAAmBpkC,EAAIokC,QAAQtS,WAAa,IACjDnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIokC,UAES,MAApBpkC,EAAIyjC,cAA6C,KAArBzjC,EAAIyjC,eACjC95B,EAAE0d,OAAO,IACT1d,EAAE1Z,OAAO+P,EAAIyjC,eAEE,MAAfzjC,EAAIg/B,UACJr1B,EAAE0d,OAAO,IACT1d,EAAE0d,OAAOrnB,EAAIg/B,UAEI,MAAjBh/B,EAAIqkC,YACJ16B,EAAE0d,OAAO,IACT1d,EAAEue,OAAOloB,EAAIqkC,YAED,MAAZrkC,EAAIskC,OACJ36B,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIskC,OAEU,MAAtBtkC,EAAIukC,iBACJ56B,EAAE0d,OAAO,KACT,GAAe4R,QAAQvoC,OAAOsP,EAAIukC,eAAgB56B,IAEjC,MAAjB3J,EAAIwkC,YACJ76B,EAAE0d,OAAO,KACT1d,EAAE6d,KAAKxnB,EAAIwkC,aAEc,IAAzBtL,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,EAAQ2pC,EAAO,CAAC,KACxB,MAAMl5B,EAAM,CACRokC,QAAS,EAAgB,GACzBX,aAAc,IAEZ5yC,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,OAAQ8c,IAAQ,GACZ,KAAK,EACDnkC,EAAIokC,QAAUvlB,EAAO1Y,QACrB,MAEJ,KAAK,EACDnG,EAAIyjC,aAAe5kB,EAAO5uB,SAC1B,MAEJ,KAAK,EACD+P,EAAIg/B,QAAUngB,EAAOwI,SACrB,MAEJ,KAAK,GACDrnB,EAAIqkC,UAAYxlB,EAAOqJ,SACvB,MAEJ,KAAK,GACDloB,EAAIskC,KAAOzlB,EAAO1Y,QAClB,MAEJ,KAAK,GACDnG,EAAIukC,eAAiB,GAAetL,QAAQxnC,OAAOotB,EAAQA,EAAOwI,SAAU,CACxEod,OAAQvL,EAAKuL,QAAQF,iBAEzB,MAEJ,KAAK,GACDvkC,EAAIwkC,UAAY3lB,EAAO2I,OACvB,MAEJ,QACI3I,EAAOiJ,SAAe,EAANqc,GAI5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEX1B,EAAYvxC,OAAUsP,GACX6hC,GAAc7hC,EAAKiiC,EAAYhJ,SAE1CgJ,EAAYxwC,OAAS,CAAC2E,EAAK8iC,IAChBF,EAAc5iC,EAAK6rC,EAAYhJ,QAASC,EAEtD,CA/FD,CA+FG,KAAgB,GAAc,CAAC,IChblC,SAAWmJ,GACP,IAAIsB,EACJtB,EAAiBpJ,MAAQ,KACP,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,MACD,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEmB,MAApB1tB,EAAIyjC,cAA6C,KAArBzjC,EAAIyjC,eACjC95B,EAAE0d,OAAO,IACT1d,EAAE1Z,OAAO+P,EAAIyjC,gBAEY,IAAzBvK,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,EAAQ2pC,EAAO,CAAC,KACxB,MAAMl5B,EAAM,CACRyjC,aAAc,IAEZ5yC,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACX8c,IAAQ,GACP,EACDnkC,EAAIyjC,aAAe5kB,EAAO5uB,SAI1B4uB,EAAOiJ,SAAe,EAANqc,EAI5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEXtB,EAAiB3xC,OAAUsP,GAChB6hC,GAAc7hC,EAAKqiC,EAAiBpJ,SAE/CoJ,EAAiB5wC,OAAS,CAAC2E,EAAK8iC,IACrBF,EAAc5iC,EAAKisC,EAAiBpJ,QAASC,EAE3D,CA5CD,CA4CGmJ,KAAqBA,GAAmB,CAAC,IC3C5C,SAAWC,GACP,IAAI4C,EAOAC,EAYAxB,GAlBJ,SAAWuB,GACPA,EAAqC,gBAAI,kBACzCA,EAA+B,UAAI,YACnCA,EAAiC,YAAI,cACrCA,EAAqC,gBAAI,iBAC5C,CALD,CAKGA,EAAsB5C,EAAuB4C,sBAAwB5C,EAAuB4C,oBAAsB,CAAC,IAEtH,SAAWC,GACPA,EAA4BA,EAA6C,gBAAI,GAAK,kBAClFA,EAA4BA,EAAuC,UAAI,GAAK,YAC5EA,EAA4BA,EAAyC,YAAI,GAAK,cAC9EA,EAA4BA,EAA6C,gBAAI,GAAK,iBACrF,CALD,CAKGA,IAAgCA,EAA8B,CAAC,IAClE,SAAWD,GACPA,EAAoBjM,MAAQ,IACjB8J,GAAYoC,EAE1B,CAJD,CAIGD,EAAsB5C,EAAuB4C,sBAAwB5C,EAAuB4C,oBAAsB,CAAC,IAEtH5C,EAAuBrJ,MAAQ,KACb,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,KAgB9B,IAf6B,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEgB,MAAjB1tB,EAAIilC,WAAuC,KAAlBjlC,EAAIilC,YAC9Bt7B,EAAE0d,OAAO,IACT1d,EAAE1Z,OAAO+P,EAAIilC,YAEc,MAA3BjlC,EAAIolC,qBAAwF,IAAzDD,EAA4BnlC,EAAIolC,uBACnEz7B,EAAE0d,OAAO,IACTib,EAAuB4C,oBAAoBjM,QAAQvoC,OAAOsP,EAAIolC,oBAAqBz7B,IAEhE,MAAnB3J,EAAIqlC,cACJ17B,EAAE0d,OAAO,IACT1d,EAAE1Z,OAAO+P,EAAIqlC,cAEQ,MAArBrlC,EAAIslC,cACJ,IAAK,MAAMhyC,KAAS0M,EAAIslC,cACpB37B,EAAE0d,OAAO,IACT1d,EAAE1Z,OAAOqD,IAGY,IAAzB4lC,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,EAAQ2pC,EAAO,CAAC,KACxB,MAAMl5B,EAAM,CACRilC,UAAW,GACXG,oBAAqBF,EAAoBK,gBACzCD,cAAe,IAEbz0C,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,OAAQ8c,IAAQ,GACZ,KAAK,EACDnkC,EAAIilC,UAAYpmB,EAAO5uB,SACvB,MAEJ,KAAK,EACD+P,EAAIolC,oBAAsB9C,EAAuB4C,oBAAoBjM,QAAQxnC,OAAOotB,GACpF,MAEJ,KAAK,GACD7e,EAAIqlC,YAAcxmB,EAAO5uB,SACzB,MAEJ,KAAK,GACD,GAAkC,MAA9BipC,EAAKuL,QAAQa,eAAyBtlC,EAAIslC,cAAc/1C,SAAW2pC,EAAKuL,OAAOa,cAC/E,MAAM,IAAIlC,GAAe,kEAE7BpjC,EAAIslC,cAAcn0C,KAAK0tB,EAAO5uB,UAC9B,MAEJ,QACI4uB,EAAOiJ,SAAe,EAANqc,GAI5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEXrB,EAAuB5xC,OAAUsP,GACtB6hC,GAAc7hC,EAAKsiC,EAAuBrJ,SAErDqJ,EAAuB7wC,OAAS,CAAC2E,EAAK8iC,IAC3BF,EAAc5iC,EAAKksC,EAAuBrJ,QAASC,EAEjE,CA9FD,CA8FGoJ,KAA2BA,GAAyB,CAAC,IAExD,SAAWkD,GACP,IAAI7B,EACJ6B,EAAwBvM,MAAQ,KACd,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,MACD,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEgB,MAAjB1tB,EAAIilC,WAAuC,KAAlBjlC,EAAIilC,YAC9Bt7B,EAAE0d,OAAO,IACT1d,EAAE1Z,OAAO+P,EAAIilC,YAEM,MAAlBjlC,EAAIylC,YAAyC,IAAnBzlC,EAAIylC,aAC/B97B,EAAE0d,OAAO,IACT1d,EAAE0d,OAAOrnB,EAAIylC,aAEK,MAAlBzlC,EAAI0lC,aACJ/7B,EAAE0d,OAAO,IACT1d,EAAE1Z,OAAO+P,EAAI0lC,cAEY,IAAzBxM,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,EAAQ2pC,EAAO,CAAC,KACxB,MAAMl5B,EAAM,CACRilC,UAAW,GACXQ,WAAY,GAEV50C,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,OAAQ8c,IAAQ,GACZ,KAAK,EACDnkC,EAAIilC,UAAYpmB,EAAO5uB,SACvB,MAEJ,KAAK,GACD+P,EAAIylC,WAAa5mB,EAAOwI,SACxB,MAEJ,KAAK,GACDrnB,EAAI0lC,WAAa7mB,EAAO5uB,SACxB,MAEJ,QACI4uB,EAAOiJ,SAAe,EAANqc,GAI5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEX6B,EAAwB90C,OAAUsP,GACvB6hC,GAAc7hC,EAAKwlC,EAAwBvM,SAEtDuM,EAAwB/zC,OAAS,CAAC2E,EAAK8iC,IAC5BF,EAAc5iC,EAAKovC,EAAwBvM,QAASC,EAElE,CA7DD,CA6DG,KAA4B,GAA0B,CAAC,IAE1D,SAAWiJ,GACP,IAAIwB,EACJxB,EAAYlJ,MAAQ,KACF,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,MACD,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEiB,MAAnB1tB,EAAI2lC,cACJh8B,EAAE0d,OAAO,IACT,GAAY4R,QAAQvoC,OAAOsP,EAAI2lC,YAAah8B,IAEzB,MAAnB3J,EAAIqlC,cACJ17B,EAAE0d,OAAO,IACT1d,EAAE1Z,OAAO+P,EAAIqlC,eAEY,IAAzBnM,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,EAAQ2pC,EAAO,CAAC,KACxB,MAAMl5B,EAAM,CAAC,EACPnP,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,OAAQ8c,IAAQ,GACZ,KAAK,EACDnkC,EAAI2lC,YAAc,GAAY1M,QAAQxnC,OAAOotB,EAAQA,EAAOwI,SAAU,CAClEod,OAAQvL,EAAKuL,QAAQkB,cAEzB,MAEJ,KAAK,EACD3lC,EAAIqlC,YAAcxmB,EAAO5uB,SACzB,MAEJ,QACI4uB,EAAOiJ,SAAe,EAANqc,GAI5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEXxB,EAAYzxC,OAAUsP,GACX6hC,GAAc7hC,EAAKmiC,EAAYlJ,SAE1CkJ,EAAY1wC,OAAS,CAAC2E,EAAK8iC,IAChBF,EAAc5iC,EAAK+rC,EAAYlJ,QAASC,EAEtD,CApDD,CAoDG,KAAgB,GAAc,CAAC,IAElC,SAAW8I,GACP,IAAI2B,EACJ3B,EAAe/I,MAAQ,KACL,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,MACD,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEY,MAAb1tB,EAAI4jC,OAAiB5jC,EAAI4jC,MAAM9R,WAAa,IAC7CnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAI4jC,QAEO,MAAlB5jC,EAAI6jC,YAAsB7jC,EAAI6jC,WAAW/R,WAAa,IACvDnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAI6jC,aAEE,MAAb7jC,EAAI8jC,OAAiB9jC,EAAI8jC,MAAMhS,WAAa,IAC7CnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAI8jC,QAEG,MAAd9jC,EAAI+jC,QAAkB/jC,EAAI+jC,OAAOjS,WAAa,IAC/CnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAI+jC,SAEG,MAAd/jC,EAAIgkC,QAAkBhkC,EAAIgkC,OAAOlS,WAAa,IAC/CnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIgkC,SAEM,MAAjBhkC,EAAIikC,WAAqBjkC,EAAIikC,UAAUnS,WAAa,IACrDnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIikC,YAEU,MAArBjkC,EAAIkkC,eAAyBlkC,EAAIkkC,cAAcpS,WAAa,IAC7DnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIkkC,iBAEa,IAAzBhL,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,EAAQ2pC,EAAO,CAAC,KACxB,MAAMl5B,EAAM,CACR4jC,MAAO,EAAgB,GACvBC,WAAY,EAAgB,GAC5BC,MAAO,EAAgB,GACvBC,OAAQ,EAAgB,GACxBC,OAAQ,EAAgB,GACxBC,UAAW,EAAgB,GAC3BC,cAAe,EAAgB,IAE7BrzC,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,OAAQ8c,IAAQ,GACZ,KAAK,EACDnkC,EAAI4jC,MAAQ/kB,EAAO1Y,QACnB,MAEJ,KAAK,EACDnG,EAAI6jC,WAAahlB,EAAO1Y,QACxB,MAEJ,KAAK,EACDnG,EAAI8jC,MAAQjlB,EAAO1Y,QACnB,MAEJ,KAAK,EACDnG,EAAI+jC,OAASllB,EAAO1Y,QACpB,MAEJ,KAAK,EACDnG,EAAIgkC,OAASnlB,EAAO1Y,QACpB,MAEJ,KAAK,EACDnG,EAAIikC,UAAYplB,EAAO1Y,QACvB,MAEJ,KAAK,EACDnG,EAAIkkC,cAAgBrlB,EAAO1Y,QAC3B,MAEJ,QACI0Y,EAAOiJ,SAAe,EAANqc,GAI5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEX3B,EAAetxC,OAAUsP,GACd6hC,GAAc7hC,EAAKgiC,EAAe/I,SAE7C+I,EAAevwC,OAAS,CAAC2E,EAAK8iC,IACnBF,EAAc5iC,EAAK4rC,EAAe/I,QAASC,EAEzD,CAlGD,CAkGG,KAAmB,GAAiB,CAAC,IAExC,SAAW+I,GACP,IAAI0B,EACJ1B,EAAYhJ,MAAQ,KACF,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,MACD,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEc,MAAf1tB,EAAIokC,SAAmBpkC,EAAIokC,QAAQtS,WAAa,IACjDnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIokC,UAES,MAApBpkC,EAAIyjC,cAA6C,KAArBzjC,EAAIyjC,eACjC95B,EAAE0d,OAAO,IACT1d,EAAE1Z,OAAO+P,EAAIyjC,eAEE,MAAfzjC,EAAIg/B,UACJr1B,EAAE0d,OAAO,IACT1d,EAAE0d,OAAOrnB,EAAIg/B,UAEI,MAAjBh/B,EAAIqkC,YACJ16B,EAAE0d,OAAO,IACT1d,EAAEue,OAAOloB,EAAIqkC,YAED,MAAZrkC,EAAIskC,OACJ36B,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIskC,OAEU,MAAtBtkC,EAAIukC,iBACJ56B,EAAE0d,OAAO,KACT,GAAe4R,QAAQvoC,OAAOsP,EAAIukC,eAAgB56B,IAEjC,MAAjB3J,EAAIwkC,YACJ76B,EAAE0d,OAAO,KACT1d,EAAE6d,KAAKxnB,EAAIwkC,aAEc,IAAzBtL,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,EAAQ2pC,EAAO,CAAC,KACxB,MAAMl5B,EAAM,CACRokC,QAAS,EAAgB,GACzBX,aAAc,IAEZ5yC,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,OAAQ8c,IAAQ,GACZ,KAAK,EACDnkC,EAAIokC,QAAUvlB,EAAO1Y,QACrB,MAEJ,KAAK,EACDnG,EAAIyjC,aAAe5kB,EAAO5uB,SAC1B,MAEJ,KAAK,EACD+P,EAAIg/B,QAAUngB,EAAOwI,SACrB,MAEJ,KAAK,GACDrnB,EAAIqkC,UAAYxlB,EAAOqJ,SACvB,MAEJ,KAAK,GACDloB,EAAIskC,KAAOzlB,EAAO1Y,QAClB,MAEJ,KAAK,GACDnG,EAAIukC,eAAiB,GAAetL,QAAQxnC,OAAOotB,EAAQA,EAAOwI,SAAU,CACxEod,OAAQvL,EAAKuL,QAAQF,iBAEzB,MAEJ,KAAK,GACDvkC,EAAIwkC,UAAY3lB,EAAO2I,OACvB,MAEJ,QACI3I,EAAOiJ,SAAe,EAANqc,GAI5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEX1B,EAAYvxC,OAAUsP,GACX6hC,GAAc7hC,EAAKiiC,EAAYhJ,SAE1CgJ,EAAYxwC,OAAS,CAAC2E,EAAK8iC,IAChBF,EAAc5iC,EAAK6rC,EAAYhJ,QAASC,EAEtD,CA/FD,CA+FG,KAAgB,GAAc,CAAC,ICxZlC,SAAWqJ,GACP,IAAIoB,EACJpB,EAAYtJ,MAAQ,KACF,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,MACD,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEkB,MAAnB1tB,EAAIqlC,aAA2C,KAApBrlC,EAAIqlC,cAChC17B,EAAE0d,OAAO,IACT1d,EAAE1Z,OAAO+P,EAAIqlC,cAEE,MAAfrlC,EAAI1C,UACJqM,EAAE0d,OAAO,IACT,GAAY4R,QAAQvoC,OAAOsP,EAAI1C,QAASqM,KAEf,IAAzBuvB,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,EAAQ2pC,EAAO,CAAC,KACxB,MAAMl5B,EAAM,CACRqlC,YAAa,IAEXx0C,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,OAAQ8c,IAAQ,GACZ,KAAK,EACDnkC,EAAIqlC,YAAcxmB,EAAO5uB,SACzB,MAEJ,KAAK,EACD+P,EAAI1C,QAAU,GAAY27B,QAAQxnC,OAAOotB,EAAQA,EAAOwI,SAAU,CAC9Dod,OAAQvL,EAAKuL,QAAQnnC,UAEzB,MAEJ,QACIuhB,EAAOiJ,SAAe,EAANqc,GAI5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEXpB,EAAY7xC,OAAUsP,GACX6hC,GAAc7hC,EAAKuiC,EAAYtJ,SAE1CsJ,EAAY9wC,OAAS,CAAC2E,EAAK8iC,IAChBF,EAAc5iC,EAAKmsC,EAAYtJ,QAASC,EAEtD,CAtDD,CAsDGqJ,KAAgBA,GAAc,CAAC,IAElC,SAAWC,GACP,IAAImB,EACJnB,EAAavJ,MAAQ,KACH,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,MACD,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEgB,MAAjB1tB,EAAI4lC,YAAuC,IAAlB5lC,EAAI4lC,YAC9Bj8B,EAAE0d,OAAO,GACT1d,EAAE6d,KAAKxnB,EAAI4lC,YAEC,MAAZ5lC,EAAI6lC,OACJl8B,EAAE0d,OAAO,IACT1d,EAAE1Z,OAAO+P,EAAI6lC,QAEY,IAAzB3M,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,EAAQ2pC,EAAO,CAAC,KACxB,MAAMl5B,EAAM,CACR4lC,WAAW,GAET/0C,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,OAAQ8c,IAAQ,GACZ,KAAK,EACDnkC,EAAI4lC,UAAY/mB,EAAO2I,OACvB,MAEJ,KAAK,EACDxnB,EAAI6lC,KAAOhnB,EAAO5uB,SAClB,MAEJ,QACI4uB,EAAOiJ,SAAe,EAANqc,GAI5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEXnB,EAAa9xC,OAAUsP,GACZ6hC,GAAc7hC,EAAKwiC,EAAavJ,SAE3CuJ,EAAa/wC,OAAS,CAAC2E,EAAK8iC,IACjBF,EAAc5iC,EAAKosC,EAAavJ,QAASC,EAEvD,CApDD,CAoDGsJ,KAAiBA,GAAe,CAAC,IAEpC,SAAWsD,GACP,IAAInC,EACJmC,EAAQ7M,MAAQ,KACE,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,MACD,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEgB,MAAjB1tB,EAAIilC,WAAuC,KAAlBjlC,EAAIilC,YAC9Bt7B,EAAE0d,OAAO,IACT1d,EAAE1Z,OAAO+P,EAAIilC,YAEE,MAAfjlC,EAAIqqB,UACJ1gB,EAAE0d,OAAO,IACTkb,GAAYtJ,QAAQvoC,OAAOsP,EAAIqqB,QAAS1gB,IAExB,MAAhB3J,EAAI1K,WACJqU,EAAE0d,OAAO,IACTmb,GAAavJ,QAAQvoC,OAAOsP,EAAI1K,SAAUqU,KAEjB,IAAzBuvB,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,EAAQ2pC,EAAO,CAAC,KACxB,MAAMl5B,EAAM,CACRilC,UAAW,IAETp0C,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,OAAQ8c,IAAQ,GACZ,KAAK,EACDnkC,EAAIilC,UAAYpmB,EAAO5uB,SACvB,MAEJ,KAAK,EACD+P,EAAIqqB,QAAUkY,GAAYtJ,QAAQxnC,OAAOotB,EAAQA,EAAOwI,SAAU,CAC9Dod,OAAQvL,EAAKuL,QAAQpa,UAEzB,MAEJ,KAAK,EACDrqB,EAAI1K,SAAWktC,GAAavJ,QAAQxnC,OAAOotB,EAAQA,EAAOwI,SAAU,CAChEod,OAAQvL,EAAKuL,QAAQnvC,WAEzB,MAEJ,QACIupB,EAAOiJ,SAAe,EAANqc,GAI5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEXmC,EAAQp1C,OAAUsP,GACP6hC,GAAc7hC,EAAK8lC,EAAQ7M,SAEtC6M,EAAQr0C,OAAS,CAAC2E,EAAK8iC,IACZF,EAAc5iC,EAAK0vC,EAAQ7M,QAASC,EAElD,CAhED,CAgEG,KAAY,GAAU,CAAC,IAE1B,SAAW8I,GACP,IAAI2B,EACJ3B,EAAe/I,MAAQ,KACL,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,MACD,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEY,MAAb1tB,EAAI4jC,OAAiB5jC,EAAI4jC,MAAM9R,WAAa,IAC7CnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAI4jC,QAEO,MAAlB5jC,EAAI6jC,YAAsB7jC,EAAI6jC,WAAW/R,WAAa,IACvDnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAI6jC,aAEE,MAAb7jC,EAAI8jC,OAAiB9jC,EAAI8jC,MAAMhS,WAAa,IAC7CnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAI8jC,QAEG,MAAd9jC,EAAI+jC,QAAkB/jC,EAAI+jC,OAAOjS,WAAa,IAC/CnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAI+jC,SAEG,MAAd/jC,EAAIgkC,QAAkBhkC,EAAIgkC,OAAOlS,WAAa,IAC/CnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIgkC,SAEM,MAAjBhkC,EAAIikC,WAAqBjkC,EAAIikC,UAAUnS,WAAa,IACrDnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIikC,YAEU,MAArBjkC,EAAIkkC,eAAyBlkC,EAAIkkC,cAAcpS,WAAa,IAC7DnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIkkC,iBAEa,IAAzBhL,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,EAAQ2pC,EAAO,CAAC,KACxB,MAAMl5B,EAAM,CACR4jC,MAAO,EAAgB,GACvBC,WAAY,EAAgB,GAC5BC,MAAO,EAAgB,GACvBC,OAAQ,EAAgB,GACxBC,OAAQ,EAAgB,GACxBC,UAAW,EAAgB,GAC3BC,cAAe,EAAgB,IAE7BrzC,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,OAAQ8c,IAAQ,GACZ,KAAK,EACDnkC,EAAI4jC,MAAQ/kB,EAAO1Y,QACnB,MAEJ,KAAK,EACDnG,EAAI6jC,WAAahlB,EAAO1Y,QACxB,MAEJ,KAAK,EACDnG,EAAI8jC,MAAQjlB,EAAO1Y,QACnB,MAEJ,KAAK,EACDnG,EAAI+jC,OAASllB,EAAO1Y,QACpB,MAEJ,KAAK,EACDnG,EAAIgkC,OAASnlB,EAAO1Y,QACpB,MAEJ,KAAK,EACDnG,EAAIikC,UAAYplB,EAAO1Y,QACvB,MAEJ,KAAK,EACDnG,EAAIkkC,cAAgBrlB,EAAO1Y,QAC3B,MAEJ,QACI0Y,EAAOiJ,SAAe,EAANqc,GAI5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEX3B,EAAetxC,OAAUsP,GACd6hC,GAAc7hC,EAAKgiC,EAAe/I,SAE7C+I,EAAevwC,OAAS,CAAC2E,EAAK8iC,IACnBF,EAAc5iC,EAAK4rC,EAAe/I,QAASC,EAEzD,CAlGD,CAkGG,KAAmB,GAAiB,CAAC,IAExC,SAAW+I,GACP,IAAI0B,EACJ1B,EAAYhJ,MAAQ,KACF,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,MACD,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEc,MAAf1tB,EAAIokC,SAAmBpkC,EAAIokC,QAAQtS,WAAa,IACjDnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIokC,UAES,MAApBpkC,EAAIyjC,cAA6C,KAArBzjC,EAAIyjC,eACjC95B,EAAE0d,OAAO,IACT1d,EAAE1Z,OAAO+P,EAAIyjC,eAEE,MAAfzjC,EAAIg/B,UACJr1B,EAAE0d,OAAO,IACT1d,EAAE0d,OAAOrnB,EAAIg/B,UAEI,MAAjBh/B,EAAIqkC,YACJ16B,EAAE0d,OAAO,IACT1d,EAAEue,OAAOloB,EAAIqkC,YAED,MAAZrkC,EAAIskC,OACJ36B,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIskC,OAEU,MAAtBtkC,EAAIukC,iBACJ56B,EAAE0d,OAAO,KACT,GAAe4R,QAAQvoC,OAAOsP,EAAIukC,eAAgB56B,IAEjC,MAAjB3J,EAAIwkC,YACJ76B,EAAE0d,OAAO,KACT1d,EAAE6d,KAAKxnB,EAAIwkC,aAEc,IAAzBtL,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,EAAQ2pC,EAAO,CAAC,KACxB,MAAMl5B,EAAM,CACRokC,QAAS,EAAgB,GACzBX,aAAc,IAEZ5yC,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,OAAQ8c,IAAQ,GACZ,KAAK,EACDnkC,EAAIokC,QAAUvlB,EAAO1Y,QACrB,MAEJ,KAAK,EACDnG,EAAIyjC,aAAe5kB,EAAO5uB,SAC1B,MAEJ,KAAK,EACD+P,EAAIg/B,QAAUngB,EAAOwI,SACrB,MAEJ,KAAK,GACDrnB,EAAIqkC,UAAYxlB,EAAOqJ,SACvB,MAEJ,KAAK,GACDloB,EAAIskC,KAAOzlB,EAAO1Y,QAClB,MAEJ,KAAK,GACDnG,EAAIukC,eAAiB,GAAetL,QAAQxnC,OAAOotB,EAAQA,EAAOwI,SAAU,CACxEod,OAAQvL,EAAKuL,QAAQF,iBAEzB,MAEJ,KAAK,GACDvkC,EAAIwkC,UAAY3lB,EAAO2I,OACvB,MAEJ,QACI3I,EAAOiJ,SAAe,EAANqc,GAI5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEX1B,EAAYvxC,OAAUsP,GACX6hC,GAAc7hC,EAAKiiC,EAAYhJ,SAE1CgJ,EAAYxwC,OAAS,CAAC2E,EAAK8iC,IAChBF,EAAc5iC,EAAK6rC,EAAYhJ,QAASC,EAEtD,CA/FD,CA+FG,KAAgB,GAAc,CAAC,ICnXlC,SAAWuJ,GACP,IAAIkB,EACJlB,EAAoBxJ,MAAQ,KACV,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,MACD,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEiB,MAAnB1tB,EAAI+lC,cACJp8B,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAI+lC,cAEG,MAAf/lC,EAAI1C,UACJqM,EAAE0d,OAAO,IACT,GAAY4R,QAAQvoC,OAAOsP,EAAI1C,QAASqM,IAErB,MAAnB3J,EAAIqlC,cACJ17B,EAAE0d,OAAO,IACT1d,EAAE1Z,OAAO+P,EAAIqlC,eAEY,IAAzBnM,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,EAAQ2pC,EAAO,CAAC,KACxB,MAAMl5B,EAAM,CAAC,EACPnP,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,OAAQ8c,IAAQ,GACZ,KAAK,EACDnkC,EAAI+lC,YAAclnB,EAAO1Y,QACzB,MAEJ,KAAK,EACDnG,EAAI1C,QAAU,GAAY27B,QAAQxnC,OAAOotB,EAAQA,EAAOwI,SAAU,CAC9Dod,OAAQvL,EAAKuL,QAAQnnC,UAEzB,MAEJ,KAAK,EACD0C,EAAIqlC,YAAcxmB,EAAO5uB,SACzB,MAEJ,QACI4uB,EAAOiJ,SAAe,EAANqc,GAI5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEXlB,EAAoB/xC,OAAUsP,GACnB6hC,GAAc7hC,EAAKyiC,EAAoBxJ,SAElDwJ,EAAoBhxC,OAAS,CAAC2E,EAAK8iC,IACxBF,EAAc5iC,EAAKqsC,EAAoBxJ,QAASC,EAE9D,CA5DD,CA4DGuJ,KAAwBA,GAAsB,CAAC,IAElD,SAAWuD,GACP,IAAIrC,EACJqC,EAAkB/M,MAAQ,KACR,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,KAgB9B,IAf6B,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEgB,MAAjB1tB,EAAIilC,WAAuC,KAAlBjlC,EAAIilC,YAC9Bt7B,EAAE0d,OAAO,IACT1d,EAAE1Z,OAAO+P,EAAIilC,YAEO,MAAnBjlC,EAAIimC,cAA2C,IAApBjmC,EAAIimC,cAChCt8B,EAAE0d,OAAO,IACT1d,EAAE6d,KAAKxnB,EAAIimC,cAEQ,MAAnBjmC,EAAIqlC,cACJ17B,EAAE0d,OAAO,IACT1d,EAAE1Z,OAAO+P,EAAIqlC,cAEQ,MAArBrlC,EAAIslC,cACJ,IAAK,MAAMhyC,KAAS0M,EAAIslC,cACpB37B,EAAE0d,OAAO,IACT1d,EAAE1Z,OAAOqD,GAWjB,GARqB,MAAjB0M,EAAIkmC,YACJv8B,EAAE0d,OAAO,IACT1d,EAAEue,OAAOloB,EAAIkmC,YAEE,MAAflmC,EAAImmC,UACJx8B,EAAE0d,OAAO,KACT1d,EAAEue,OAAOloB,EAAImmC,UAEQ,MAArBnmC,EAAIomC,cACJ,IAAK,MAAM9yC,KAAS0M,EAAIomC,cACpBz8B,EAAE0d,OAAO,KACT1d,EAAExD,MAAM7S,GAGY,MAAxB0M,EAAIqmC,mBACJ18B,EAAE0d,OAAO,KACT1d,EAAExD,MAAMnG,EAAIqmC,mBAEc,MAAzBrmC,EAAIsmC,oBAAuD,IAA1BtmC,EAAIsmC,oBACtC38B,EAAE0d,OAAO,KACT1d,EAAE6d,KAAKxnB,EAAIsmC,oBAEY,MAAvBtmC,EAAIumC,kBACJ58B,EAAE0d,OAAO,KACT1d,EAAEse,OAAOjoB,EAAIumC,mBAEY,IAAzBrN,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,EAAQ2pC,EAAO,CAAC,KACxB,MAAMl5B,EAAM,CACRilC,UAAW,GACXgB,aAAa,EACbX,cAAe,GACfc,cAAe,GACfE,mBAAmB,GAEjBz1C,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,OAAQ8c,IAAQ,GACZ,KAAK,EACDnkC,EAAIilC,UAAYpmB,EAAO5uB,SACvB,MAEJ,KAAK,EACD+P,EAAIimC,YAAcpnB,EAAO2I,OACzB,MAEJ,KAAK,GACDxnB,EAAIqlC,YAAcxmB,EAAO5uB,SACzB,MAEJ,KAAK,GACD,GAAkC,MAA9BipC,EAAKuL,QAAQa,eAAyBtlC,EAAIslC,cAAc/1C,SAAW2pC,EAAKuL,OAAOa,cAC/E,MAAM,IAAIlC,GAAe,kEAE7BpjC,EAAIslC,cAAcn0C,KAAK0tB,EAAO5uB,UAC9B,MAEJ,KAAK,GACD+P,EAAIkmC,UAAYrnB,EAAOqJ,SACvB,MAEJ,KAAK,GACDloB,EAAImmC,QAAUtnB,EAAOqJ,SACrB,MAEJ,KAAK,GACD,GAAkC,MAA9BgR,EAAKuL,QAAQ2B,eAAyBpmC,EAAIomC,cAAc72C,SAAW2pC,EAAKuL,OAAO2B,cAC/E,MAAM,IAAIhD,GAAe,kEAE7BpjC,EAAIomC,cAAcj1C,KAAK0tB,EAAO1Y,SAC9B,MAEJ,KAAK,GACDnG,EAAIqmC,iBAAmBxnB,EAAO1Y,QAC9B,MAEJ,KAAK,GACDnG,EAAIsmC,kBAAoBznB,EAAO2I,OAC/B,MAEJ,KAAK,GACDxnB,EAAIumC,gBAAkB1nB,EAAOoJ,SAC7B,MAEJ,QACIpJ,EAAOiJ,SAAe,EAANqc,GAI5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEXqC,EAAkBt1C,OAAUsP,GACjB6hC,GAAc7hC,EAAKgmC,EAAkB/M,SAEhD+M,EAAkBv0C,OAAS,CAAC2E,EAAK8iC,IACtBF,EAAc5iC,EAAK4vC,EAAkB/M,QAASC,EAE5D,CAlID,CAkIG,KAAsB,GAAoB,CAAC,IAE9C,SAAWsN,GACP,IAAI7C,EACJ6C,EAAmBvN,MAAQ,KACT,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,KAgB9B,IAf6B,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEgB,MAAjB1tB,EAAIilC,WAAuC,KAAlBjlC,EAAIilC,YAC9Bt7B,EAAE0d,OAAO,IACT1d,EAAE1Z,OAAO+P,EAAIilC,YAEK,MAAlBjlC,EAAIylC,aACJ97B,EAAE0d,OAAO,IACT1d,EAAE0d,OAAOrnB,EAAIylC,aAEK,MAAlBzlC,EAAI0lC,aACJ/7B,EAAE0d,OAAO,IACT1d,EAAE1Z,OAAO+P,EAAI0lC,aAEG,MAAhB1lC,EAAI+kC,SACJ,IAAK,MAAMzxC,KAAS0M,EAAI+kC,SACpBp7B,EAAE0d,OAAO,KACTob,GAAoBxJ,QAAQvoC,OAAO4C,EAAOqW,GAGtB,MAAxB3J,EAAIqmC,mBACJ18B,EAAE0d,OAAO,KACT1d,EAAExD,MAAMnG,EAAIqmC,oBAEa,IAAzBnN,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,EAAQ2pC,EAAO,CAAC,KACxB,MAAMl5B,EAAM,CACRilC,UAAW,GACXF,SAAU,IAERl0C,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,OAAQ8c,IAAQ,GACZ,KAAK,EACDnkC,EAAIilC,UAAYpmB,EAAO5uB,SACvB,MAEJ,KAAK,GACD+P,EAAIylC,WAAa5mB,EAAOwI,SACxB,MAEJ,KAAK,GACDrnB,EAAI0lC,WAAa7mB,EAAO5uB,SACxB,MAEJ,KAAK,GACD,GAA6B,MAAzBipC,EAAKuL,QAAQM,UAAoB/kC,EAAI+kC,SAASx1C,SAAW2pC,EAAKuL,OAAOM,SACrE,MAAM,IAAI3B,GAAe,6DAE7BpjC,EAAI+kC,SAAS5zC,KAAKsxC,GAAoBxJ,QAAQxnC,OAAOotB,EAAQA,EAAOwI,SAAU,CAC1Eod,OAAQvL,EAAKuL,QAAQO,aAEzB,MAEJ,KAAK,GACDhlC,EAAIqmC,iBAAmBxnB,EAAO1Y,QAC9B,MAEJ,QACI0Y,EAAOiJ,SAAe,EAANqc,GAI5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEX6C,EAAmB91C,OAAUsP,GAClB6hC,GAAc7hC,EAAKwmC,EAAmBvN,SAEjDuN,EAAmB/0C,OAAS,CAAC2E,EAAK8iC,IACvBF,EAAc5iC,EAAKowC,EAAmBvN,QAASC,EAE7D,CApFD,CAoFG,KAAuB,GAAqB,CAAC,IAEhD,SAAW8I,GACP,IAAI2B,EACJ3B,EAAe/I,MAAQ,KACL,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,MACD,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEY,MAAb1tB,EAAI4jC,OAAiB5jC,EAAI4jC,MAAM9R,WAAa,IAC7CnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAI4jC,QAEO,MAAlB5jC,EAAI6jC,YAAsB7jC,EAAI6jC,WAAW/R,WAAa,IACvDnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAI6jC,aAEE,MAAb7jC,EAAI8jC,OAAiB9jC,EAAI8jC,MAAMhS,WAAa,IAC7CnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAI8jC,QAEG,MAAd9jC,EAAI+jC,QAAkB/jC,EAAI+jC,OAAOjS,WAAa,IAC/CnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAI+jC,SAEG,MAAd/jC,EAAIgkC,QAAkBhkC,EAAIgkC,OAAOlS,WAAa,IAC/CnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIgkC,SAEM,MAAjBhkC,EAAIikC,WAAqBjkC,EAAIikC,UAAUnS,WAAa,IACrDnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIikC,YAEU,MAArBjkC,EAAIkkC,eAAyBlkC,EAAIkkC,cAAcpS,WAAa,IAC7DnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIkkC,iBAEa,IAAzBhL,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,EAAQ2pC,EAAO,CAAC,KACxB,MAAMl5B,EAAM,CACR4jC,MAAO,EAAgB,GACvBC,WAAY,EAAgB,GAC5BC,MAAO,EAAgB,GACvBC,OAAQ,EAAgB,GACxBC,OAAQ,EAAgB,GACxBC,UAAW,EAAgB,GAC3BC,cAAe,EAAgB,IAE7BrzC,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,OAAQ8c,IAAQ,GACZ,KAAK,EACDnkC,EAAI4jC,MAAQ/kB,EAAO1Y,QACnB,MAEJ,KAAK,EACDnG,EAAI6jC,WAAahlB,EAAO1Y,QACxB,MAEJ,KAAK,EACDnG,EAAI8jC,MAAQjlB,EAAO1Y,QACnB,MAEJ,KAAK,EACDnG,EAAI+jC,OAASllB,EAAO1Y,QACpB,MAEJ,KAAK,EACDnG,EAAIgkC,OAASnlB,EAAO1Y,QACpB,MAEJ,KAAK,EACDnG,EAAIikC,UAAYplB,EAAO1Y,QACvB,MAEJ,KAAK,EACDnG,EAAIkkC,cAAgBrlB,EAAO1Y,QAC3B,MAEJ,QACI0Y,EAAOiJ,SAAe,EAANqc,GAI5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEX3B,EAAetxC,OAAUsP,GACd6hC,GAAc7hC,EAAKgiC,EAAe/I,SAE7C+I,EAAevwC,OAAS,CAAC2E,EAAK8iC,IACnBF,EAAc5iC,EAAK4rC,EAAe/I,QAASC,EAEzD,CAlGD,CAkGG,KAAmB,GAAiB,CAAC,IAExC,SAAW+I,GACP,IAAI0B,EACJ1B,EAAYhJ,MAAQ,KACF,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,MACD,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEc,MAAf1tB,EAAIokC,SAAmBpkC,EAAIokC,QAAQtS,WAAa,IACjDnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIokC,UAES,MAApBpkC,EAAIyjC,cAA6C,KAArBzjC,EAAIyjC,eACjC95B,EAAE0d,OAAO,IACT1d,EAAE1Z,OAAO+P,EAAIyjC,eAEE,MAAfzjC,EAAIg/B,UACJr1B,EAAE0d,OAAO,IACT1d,EAAE0d,OAAOrnB,EAAIg/B,UAEI,MAAjBh/B,EAAIqkC,YACJ16B,EAAE0d,OAAO,IACT1d,EAAEue,OAAOloB,EAAIqkC,YAED,MAAZrkC,EAAIskC,OACJ36B,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIskC,OAEU,MAAtBtkC,EAAIukC,iBACJ56B,EAAE0d,OAAO,KACT,GAAe4R,QAAQvoC,OAAOsP,EAAIukC,eAAgB56B,IAEjC,MAAjB3J,EAAIwkC,YACJ76B,EAAE0d,OAAO,KACT1d,EAAE6d,KAAKxnB,EAAIwkC,aAEc,IAAzBtL,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,EAAQ2pC,EAAO,CAAC,KACxB,MAAMl5B,EAAM,CACRokC,QAAS,EAAgB,GACzBX,aAAc,IAEZ5yC,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,OAAQ8c,IAAQ,GACZ,KAAK,EACDnkC,EAAIokC,QAAUvlB,EAAO1Y,QACrB,MAEJ,KAAK,EACDnG,EAAIyjC,aAAe5kB,EAAO5uB,SAC1B,MAEJ,KAAK,EACD+P,EAAIg/B,QAAUngB,EAAOwI,SACrB,MAEJ,KAAK,GACDrnB,EAAIqkC,UAAYxlB,EAAOqJ,SACvB,MAEJ,KAAK,GACDloB,EAAIskC,KAAOzlB,EAAO1Y,QAClB,MAEJ,KAAK,GACDnG,EAAIukC,eAAiB,GAAetL,QAAQxnC,OAAOotB,EAAQA,EAAOwI,SAAU,CACxEod,OAAQvL,EAAKuL,QAAQF,iBAEzB,MAEJ,KAAK,GACDvkC,EAAIwkC,UAAY3lB,EAAO2I,OACvB,MAEJ,QACI3I,EAAOiJ,SAAe,EAANqc,GAI5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEX1B,EAAYvxC,OAAUsP,GACX6hC,GAAc7hC,EAAKiiC,EAAYhJ,SAE1CgJ,EAAYxwC,OAAS,CAAC2E,EAAK8iC,IAChBF,EAAc5iC,EAAK6rC,EAAYhJ,QAASC,EAEtD,CA/FD,CA+FG,KAAgB,GAAc,CAAC,IC5dlC,SAAWwJ,GACP,IAAIiB,EACJjB,EAASzJ,MAAQ,KACC,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,MACD,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAES,MAAX1tB,EAAIymC,MACJ98B,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIymC,OAEa,IAAzBvN,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,EAAQ2pC,EAAO,CAAC,KACxB,MAAMl5B,EAAM,CAAC,EACPnP,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACX8c,IAAQ,GACP,EACDnkC,EAAIymC,IAAM5nB,EAAO1Y,QAIjB0Y,EAAOiJ,SAAe,EAANqc,EAI5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEXjB,EAAShyC,OAAUsP,GACR6hC,GAAc7hC,EAAK0iC,EAASzJ,SAEvCyJ,EAASjxC,OAAS,CAAC2E,EAAK8iC,IACbF,EAAc5iC,EAAKssC,EAASzJ,QAASC,EAEnD,CA1CD,CA0CGwJ,KAAaA,GAAW,CAAC,IAE5B,SAAWC,GACP,IAAIgB,EACJhB,EAAkB1J,MAAQ,KACR,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,MACD,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEc,MAAhB1tB,EAAI0mC,WACJ/8B,EAAE0d,OAAO,GACT1d,EAAEse,OAAOjoB,EAAI0mC,YAEY,IAAzBxN,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,EAAQ2pC,EAAO,CAAC,KACxB,MAAMl5B,EAAM,CAAC,EACPnP,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACX8c,IAAQ,GACP,EACDnkC,EAAI0mC,SAAW7nB,EAAOoJ,SAItBpJ,EAAOiJ,SAAe,EAANqc,EAI5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEXhB,EAAkBjyC,OAAUsP,GACjB6hC,GAAc7hC,EAAK2iC,EAAkB1J,SAEhD0J,EAAkBlxC,OAAS,CAAC2E,EAAK8iC,IACtBF,EAAc5iC,EAAKusC,EAAkB1J,QAASC,EAE5D,CA1CD,CA0CGyJ,KAAsBA,GAAoB,CAAC,IAE9C,SAAWC,GACP,IAAIe,EACJf,EAAqB3J,MAAQ,KACX,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,KAI9B,IAH6B,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEe,MAAjB1tB,EAAI2mC,UACJ,IAAK,MAAMrzC,KAAS0M,EAAI2mC,UACpBh9B,EAAE0d,OAAO,IACTqb,GAASzJ,QAAQvoC,OAAO4C,EAAOqW,IAGV,IAAzBuvB,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,EAAQ2pC,EAAO,CAAC,KACxB,MAAMl5B,EAAM,CACR2mC,UAAW,IAET91C,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,GAAQ8c,IAAQ,GACP,EAAL,CACI,GAA8B,MAA1BjL,EAAKuL,QAAQkC,WAAqB3mC,EAAI2mC,UAAUp3C,SAAW2pC,EAAKuL,OAAOkC,UACvE,MAAM,IAAIvD,GAAe,8DAE7BpjC,EAAI2mC,UAAUx1C,KAAKuxC,GAASzJ,QAAQxnC,OAAOotB,EAAQA,EAAOwI,SAAU,CAChEod,OAAQvL,EAAKuL,QAAQmC,aAG7B,MAEI/nB,EAAOiJ,SAAe,EAANqc,EAI5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEXf,EAAqBlyC,OAAUsP,GACpB6hC,GAAc7hC,EAAK4iC,EAAqB3J,SAEnD2J,EAAqBnxC,OAAS,CAAC2E,EAAK8iC,IACzBF,EAAc5iC,EAAKwsC,EAAqB3J,QAASC,EAE/D,CAnDD,CAmDG0J,KAAyBA,GAAuB,CAAC,IAEpD,SAAWiE,GACP,IAAIlD,EACJkD,EAAgB5N,MAAQ,KACN,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,MACD,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEW,MAAb1tB,EAAI8mC,QACJn9B,EAAE0d,OAAO,IACTsb,GAAkB1J,QAAQvoC,OAAOsP,EAAI8mC,MAAOn9B,IAE5B,MAAhB3J,EAAI1K,WACJqU,EAAE0d,OAAO,IACTub,GAAqB3J,QAAQvoC,OAAOsP,EAAI1K,SAAUqU,KAEzB,IAAzBuvB,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,EAAQ2pC,EAAO,CAAC,KACxB,MAAMl5B,EAAM,CAAC,EACPnP,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,OAAQ8c,IAAQ,GACZ,KAAK,EACDnkC,EAAI8mC,MAAQnE,GAAkB1J,QAAQxnC,OAAOotB,EAAQA,EAAOwI,SAAU,CAClEod,OAAQvL,EAAKuL,QAAQqC,QAEzB,MAEJ,KAAK,EACD9mC,EAAI1K,SAAWstC,GAAqB3J,QAAQxnC,OAAOotB,EAAQA,EAAOwI,SAAU,CACxEod,OAAQvL,EAAKuL,QAAQnvC,WAEzB,MAEJ,QACIupB,EAAOiJ,SAAe,EAANqc,GAI5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEXkD,EAAgBn2C,OAAUsP,GACf6hC,GAAc7hC,EAAK6mC,EAAgB5N,SAE9C4N,EAAgBp1C,OAAS,CAAC2E,EAAK8iC,IACpBF,EAAc5iC,EAAKywC,EAAgB5N,QAASC,EAE1D,CAtDD,CAsDG,KAAoB,GAAkB,CAAC,ICnM1C,SAAW2J,GACP,IAAIc,EACJd,EAAoB5J,MAAQ,KACV,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,KAQ9B,IAP6B,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEe,MAAjB1tB,EAAI+mC,YACJp9B,EAAE0d,OAAO,GACT1d,EAAE0d,OAAOrnB,EAAI+mC,YAEC,MAAd/mC,EAAIgnC,OACJ,IAAK,MAAM1zC,KAAS0M,EAAIgnC,OACpBr9B,EAAE0d,OAAO,IACT1d,EAAE0d,OAAO/zB,IAGY,IAAzB4lC,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,EAAQ2pC,EAAO,CAAC,KACxB,MAAMl5B,EAAM,CACRgnC,OAAQ,IAENn2C,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,OAAQ8c,IAAQ,GACZ,KAAK,EACDnkC,EAAI+mC,UAAYloB,EAAOwI,SACvB,MAEJ,KAAK,EACD,GAA2B,MAAvB6R,EAAKuL,QAAQuC,QAAkBhnC,EAAIgnC,OAAOz3C,SAAW2pC,EAAKuL,OAAOuC,OACjE,MAAM,IAAI5D,GAAe,2DAE7BpjC,EAAIgnC,OAAO71C,KAAK0tB,EAAOwI,UACvB,MAEJ,QACIxI,EAAOiJ,SAAe,EAANqc,GAI5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEXd,EAAoBnyC,OAAUsP,GACnB6hC,GAAc7hC,EAAK6iC,EAAoB5J,SAElD4J,EAAoBpxC,OAAS,CAAC2E,EAAK8iC,IACxBF,EAAc5iC,EAAKysC,EAAoB5J,QAASC,EAE9D,CAzDD,CAyDG2J,KAAwBA,GAAsB,CAAC,IAElD,SAAWC,GACP,IAAIa,EACJb,EAAqB7J,MAAQ,KACX,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,KAQ9B,IAP6B,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEe,MAAjB1tB,EAAI+mC,YACJp9B,EAAE0d,OAAO,GACT1d,EAAE0d,OAAOrnB,EAAI+mC,YAEC,MAAd/mC,EAAIgnC,OACJ,IAAK,MAAM1zC,KAAS0M,EAAIgnC,OACpBr9B,EAAE0d,OAAO,IACT1d,EAAE0d,OAAO/zB,IAGY,IAAzB4lC,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,EAAQ2pC,EAAO,CAAC,KACxB,MAAMl5B,EAAM,CACRgnC,OAAQ,IAENn2C,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,OAAQ8c,IAAQ,GACZ,KAAK,EACDnkC,EAAI+mC,UAAYloB,EAAOwI,SACvB,MAEJ,KAAK,EACD,GAA2B,MAAvB6R,EAAKuL,QAAQuC,QAAkBhnC,EAAIgnC,OAAOz3C,SAAW2pC,EAAKuL,OAAOuC,OACjE,MAAM,IAAI5D,GAAe,2DAE7BpjC,EAAIgnC,OAAO71C,KAAK0tB,EAAOwI,UACvB,MAEJ,QACIxI,EAAOiJ,SAAe,EAANqc,GAI5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEXb,EAAqBpyC,OAAUsP,GACpB6hC,GAAc7hC,EAAK8iC,EAAqB7J,SAEnD6J,EAAqBrxC,OAAS,CAAC2E,EAAK8iC,IACzBF,EAAc5iC,EAAK0sC,EAAqB7J,QAASC,EAE/D,CAzDD,CAyDG4J,KAAyBA,GAAuB,CAAC,IO3HpD,SAASmE,GAAO92C,GACZ,IAAKoD,OAAO2zC,cAAc/2C,IAAMA,EAAI,EAChC,MAAM,IAAI0B,MAAM,kCAAkC1B,IAC1D,CAUA,SAASgW,GAAMjV,KAAMi2C,GACjB,MALoBjZ,EAKPh9B,aAJQsE,YACX,MAAL04B,GAA0B,iBAANA,GAAyC,eAAvBA,EAAEvtB,YAAYjB,MAIrD,MAAM,IAAI7N,MAAM,uBANjB,IAAiBq8B,EAOpB,GAAIiZ,EAAQ53C,OAAS,IAAM43C,EAAQ32B,SAAStf,EAAE3B,QAC1C,MAAM,IAAIsC,MAAM,iCAAiCs1C,oBAA0Bj2C,EAAE3B,SACrF,CACA,SAAS,GAAKic,GACV,GAAiB,mBAANA,GAAwC,mBAAbA,EAAElL,OACpC,MAAM,IAAIzO,MAAM,mDACpBo1C,GAAOz7B,EAAE47B,WACTH,GAAOz7B,EAAE67B,SACb,CACA,SAASC,GAAOC,EAAUC,GAAgB,GACtC,GAAID,EAASE,UACT,MAAM,IAAI51C,MAAM,oCACpB,GAAI21C,GAAiBD,EAASG,SAC1B,MAAM,IAAI71C,MAAM,wCACxB,CASA,MCvCa,GAA+B,iBAAf0d,YAA2B,WAAYA,WAAaA,WAAWsvB,YAASjtC,ECmBxF,GAAc+1C,GAAQ,IAAIhU,SAASgU,EAAIh3C,OAAQg3C,EAAIxV,WAAYwV,EAAI7V,YAEnE8V,GAAO,CAACC,EAAMnuC,IAAWmuC,GAAS,GAAKnuC,EAAWmuC,IAASnuC,EAGpD,IAAIlE,WAAW,IAAI8V,YAAY,CAAC,YAAa3a,QAAQ,GAgElE,MAAMm3C,GAAWlJ,YAEjBA,eAAemJ,GAAUC,EAAOC,EAAMnf,GACzC,IAAIof,EAAKnqC,KAAKoqC,MACd,IAAK,IAAI13C,EAAI,EAAGA,EAAIu3C,EAAOv3C,IAAK,CAC5Bq4B,EAAGr4B,GAEH,MAAMqK,EAAOiD,KAAKoqC,MAAQD,EACtBptC,GAAQ,GAAKA,EAAOmtC,UAElBH,KACNI,GAAMptC,EACV,CACJ,CAcO,SAASstC,GAAQnW,GAIpB,MAHoB,iBAATA,IACPA,EAZD,SAAqB1rB,GACxB,GAAmB,iBAARA,EACP,MAAM,IAAI1U,MAAM,2CAA2C0U,GAC/D,OAAO,IAAI/Q,YAAW,IAAIgoC,aAAc9sC,OAAO6V,GACnD,CAQe,CAAY0rB,IACvB,GAAOA,GACAA,CACX,CAoBO,MAAMoW,GAET,KAAAv4B,GACI,OAAOjc,KAAKy0C,YAChB,EAEJ,MAAMC,GAAQ,CAAC,EAAEj2C,SAOV,SAAS,GAAgBk2C,GAC5B,MAAMC,EAASC,GAAQF,IAAWhkC,OAAO4jC,GAAQM,IAAMn9B,SACjDo9B,EAAMH,IAIZ,OAHAC,EAAMrB,UAAYuB,EAAIvB,UACtBqB,EAAMpB,SAAWsB,EAAItB,SACrBoB,EAAMnoC,OAAS,IAAMkoC,IACdC,CACX,CAoBO,SAAS,GAAYG,EAAc,IACtC,GAAI,IAA4C,mBAA3B,GAAOC,gBACxB,OAAO,GAAOA,gBAAgB,IAAIrzC,WAAWozC,IAEjD,MAAM,IAAI/2C,MAAM,yCACpB,CCzKO,MAEMi3C,GAAM,CAAC5a,EAAGh9B,EAAGQ,IAAOw8B,EAAIh9B,EAAMg9B,EAAIx8B,EAAMR,EAAIQ,EAKlD,MAAMq3C,WAAeV,GACxB,WAAA1nC,CAAY0mC,EAAUD,EAAW4B,EAAWC,GACxCrH,QACA/tC,KAAKwzC,SAAWA,EAChBxzC,KAAKuzC,UAAYA,EACjBvzC,KAAKm1C,UAAYA,EACjBn1C,KAAKo1C,KAAOA,EACZp1C,KAAK6zC,UAAW,EAChB7zC,KAAKtE,OAAS,EACdsE,KAAKwC,IAAM,EACXxC,KAAK4zC,WAAY,EACjB5zC,KAAKlD,OAAS,IAAI6E,WAAW6xC,GAC7BxzC,KAAKg/B,KAAO,GAAWh/B,KAAKlD,OAChC,CACA,MAAA6T,CAAOytB,GACHqV,GAAOzzC,MACP,MAAM,KAAEg/B,EAAI,OAAEliC,EAAM,SAAE02C,GAAaxzC,KAE7BwG,GADN43B,EAAOmW,GAAQnW,IACE1iC,OACjB,IAAK,IAAI8G,EAAM,EAAGA,EAAMgE,GAAM,CAC1B,MAAM6uC,EAAO74C,KAAKk4B,IAAI8e,EAAWxzC,KAAKwC,IAAKgE,EAAMhE,GAEjD,GAAI6yC,IAAS7B,EAMb12C,EAAOiO,IAAIqzB,EAAK7K,SAAS/wB,EAAKA,EAAM6yC,GAAOr1C,KAAKwC,KAChDxC,KAAKwC,KAAO6yC,EACZ7yC,GAAO6yC,EACHr1C,KAAKwC,MAAQgxC,IACbxzC,KAAK8H,QAAQk3B,EAAM,GACnBh/B,KAAKwC,IAAM,OAXf,CACI,MAAMq9B,EAAW,GAAWzB,GAC5B,KAAOoV,GAAYhtC,EAAMhE,EAAKA,GAAOgxC,EACjCxzC,KAAK8H,QAAQ+3B,EAAUr9B,EAE/B,CAQJ,CAGA,OAFAxC,KAAKtE,QAAU0iC,EAAK1iC,OACpBsE,KAAKs1C,aACEt1C,IACX,CACA,UAAAu1C,CAAW5N,GACP8L,GAAOzzC,MHjCf,SAAgB2nC,EAAK+L,GACjBphC,GAAMq1B,GACN,MAAMjT,EAAMgf,EAASH,UACrB,GAAI5L,EAAIjsC,OAASg5B,EACb,MAAM,IAAI12B,MAAM,yDAAyD02B,IAEjF,CG4BQ8gB,CAAO7N,EAAK3nC,MACZA,KAAK6zC,UAAW,EAIhB,MAAM,OAAE/2C,EAAM,KAAEkiC,EAAI,SAAEwU,EAAQ,KAAE4B,GAASp1C,KACzC,IAAI,IAAEwC,GAAQxC,KAEdlD,EAAO0F,KAAS,IAChBxC,KAAKlD,OAAOy2B,SAAS/wB,GAAKizC,KAAK,GAG3Bz1C,KAAKm1C,UAAY3B,EAAWhxC,IAC5BxC,KAAK8H,QAAQk3B,EAAM,GACnBx8B,EAAM,GAGV,IAAK,IAAI5F,EAAI4F,EAAK5F,EAAI42C,EAAU52C,IAC5BE,EAAOF,GAAK,GAhFxB,SAAsBoiC,EAAMV,EAAY7+B,EAAO21C,GAC3C,GAAiC,mBAAtBpW,EAAK0W,aACZ,OAAO1W,EAAK0W,aAAapX,EAAY7+B,EAAO21C,GAChD,MAAMO,EAAO3R,OAAO,IACd4R,EAAW5R,OAAO,YAClB6R,EAAKn2C,OAAQD,GAASk2C,EAAQC,GAC9BE,EAAKp2C,OAAOD,EAAQm2C,GACpBj+B,EAAIy9B,EAAO,EAAI,EACfvlC,EAAIulC,EAAO,EAAI,EACrBpW,EAAK+W,UAAUzX,EAAa3mB,EAAGk+B,EAAIT,GACnCpW,EAAK+W,UAAUzX,EAAazuB,EAAGimC,EAAIV,EACvC,CAyEQM,CAAa1W,EAAMwU,EAAW,EAAGxP,OAAqB,EAAdhkC,KAAKtE,QAAa05C,GAC1Dp1C,KAAK8H,QAAQk3B,EAAM,GACnB,MAAMgX,EAAQ,GAAWrO,GACnBnhC,EAAMxG,KAAKuzC,UAEjB,GAAI/sC,EAAM,EACN,MAAM,IAAIxI,MAAM,+CACpB,MAAMi4C,EAASzvC,EAAM,EACf0vC,EAAQl2C,KAAK8K,MACnB,GAAImrC,EAASC,EAAMx6C,OACf,MAAM,IAAIsC,MAAM,sCACpB,IAAK,IAAIpB,EAAI,EAAGA,EAAIq5C,EAAQr5C,IACxBo5C,EAAMD,UAAU,EAAIn5C,EAAGs5C,EAAMt5C,GAAIw4C,EACzC,CACA,MAAA19B,GACI,MAAM,OAAE5a,EAAM,UAAEy2C,GAAcvzC,KAC9BA,KAAKu1C,WAAWz4C,GAChB,MAAMiiC,EAAMjiC,EAAOW,MAAM,EAAG81C,GAE5B,OADAvzC,KAAKkJ,UACE61B,CACX,CACA,UAAA0V,CAAW0B,GACPA,IAAOA,EAAK,IAAIn2C,KAAK8M,aACrBqpC,EAAGprC,OAAO/K,KAAK8K,OACf,MAAM,SAAE0oC,EAAQ,OAAE12C,EAAM,OAAEpB,EAAM,SAAEm4C,EAAQ,UAAED,EAAS,IAAEpxC,GAAQxC,KAO/D,OANAm2C,EAAGz6C,OAASA,EACZy6C,EAAG3zC,IAAMA,EACT2zC,EAAGtC,SAAWA,EACdsC,EAAGvC,UAAYA,EACXl4C,EAAS83C,GACT2C,EAAGr5C,OAAOiO,IAAIjO,GACXq5C,CACX,EChHJ,MAAMC,GAA2B,IAAI3+B,YAAY,CAC7C,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WACpF,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WACpF,WAAY,WAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UACpF,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UACpF,UAAY,UAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,aAKlF4+B,GAA4B,IAAI5+B,YAAY,CAC9C,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,aAIlF6+B,GAA2B,IAAI7+B,YAAY,IACjD,MAAM8+B,WAAerB,GACjB,WAAApoC,GACIihC,MAAM,GAAI,GAAI,GAAG,GAGjB/tC,KAAKw2C,EAAmB,EAAfH,GAAU,GACnBr2C,KAAKy2C,EAAmB,EAAfJ,GAAU,GACnBr2C,KAAK02C,EAAmB,EAAfL,GAAU,GACnBr2C,KAAK22C,EAAmB,EAAfN,GAAU,GACnBr2C,KAAK42C,EAAmB,EAAfP,GAAU,GACnBr2C,KAAK62C,EAAmB,EAAfR,GAAU,GACnBr2C,KAAK82C,EAAmB,EAAfT,GAAU,GACnBr2C,KAAK+2C,EAAmB,EAAfV,GAAU,EACvB,CACA,GAAAvrC,GACI,MAAM,EAAE0rC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,GAAM/2C,KACnC,MAAO,CAACw2C,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EACjC,CAEA,GAAAhsC,CAAIyrC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,GACrB/2C,KAAKw2C,EAAQ,EAAJA,EACTx2C,KAAKy2C,EAAQ,EAAJA,EACTz2C,KAAK02C,EAAQ,EAAJA,EACT12C,KAAK22C,EAAQ,EAAJA,EACT32C,KAAK42C,EAAQ,EAAJA,EACT52C,KAAK62C,EAAQ,EAAJA,EACT72C,KAAK82C,EAAQ,EAAJA,EACT92C,KAAK+2C,EAAQ,EAAJA,CACb,CACA,OAAAjvC,CAAQk3B,EAAMrjC,GAEV,IAAK,IAAIiB,EAAI,EAAGA,EAAI,GAAIA,IAAKjB,GAAU,EACnC26C,GAAS15C,GAAKoiC,EAAKgY,UAAUr7C,GAAQ,GACzC,IAAK,IAAIiB,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAC1B,MAAMq6C,EAAMX,GAAS15C,EAAI,IACnBs6C,EAAKZ,GAAS15C,EAAI,GAClBu6C,EAAKpD,GAAKkD,EAAK,GAAKlD,GAAKkD,EAAK,IAAOA,IAAQ,EAC7CG,EAAKrD,GAAKmD,EAAI,IAAMnD,GAAKmD,EAAI,IAAOA,IAAO,GACjDZ,GAAS15C,GAAMw6C,EAAKd,GAAS15C,EAAI,GAAKu6C,EAAKb,GAAS15C,EAAI,IAAO,CACnE,CAEA,IAAI,EAAE45C,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,GAAM/2C,KACjC,IAAK,IAAIpD,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MACMy6C,EAAMN,GADGhD,GAAK6C,EAAG,GAAK7C,GAAK6C,EAAG,IAAM7C,GAAK6C,EAAG,ODrD1Cvc,ECsDqBuc,GAAGC,GDtDAxc,ECsDGyc,GAAKV,GAASx5C,GAAK05C,GAAS15C,GAAM,EAE/D06C,GADSvD,GAAKyC,EAAG,GAAKzC,GAAKyC,EAAG,IAAMzC,GAAKyC,EAAG,KAC7BvB,GAAIuB,EAAGC,EAAGC,GAAM,EACrCK,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKD,EAAIU,EAAM,EACfV,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKa,EAAKC,EAAM,CACpB,CDjEW,IAACjd,ECmEZmc,EAAKA,EAAIx2C,KAAKw2C,EAAK,EACnBC,EAAKA,EAAIz2C,KAAKy2C,EAAK,EACnBC,EAAKA,EAAI12C,KAAK02C,EAAK,EACnBC,EAAKA,EAAI32C,KAAK22C,EAAK,EACnBC,EAAKA,EAAI52C,KAAK42C,EAAK,EACnBC,EAAKA,EAAI72C,KAAK62C,EAAK,EACnBC,EAAKA,EAAI92C,KAAK82C,EAAK,EACnBC,EAAKA,EAAI/2C,KAAK+2C,EAAK,EACnB/2C,KAAK+K,IAAIyrC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAClC,CACA,UAAAzB,GACIgB,GAASb,KAAK,EAClB,CACA,OAAAvsC,GACIlJ,KAAK+K,IAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAC9B/K,KAAKlD,OAAO24C,KAAK,EACrB,EAqBG,MAAM,GAAyB,IAAgB,IAAM,IAAIc,KCxHzD,IAAIgB,GAOAhb,GCPAib,GAMAC,GAOAC,IDZX,SAAWH,GACPA,EAAiB,MAAI,QACrBA,EAAiB,MAAI,QACrBA,EAAqB,UAAI,YACzBA,EAAkB,OAAI,QACzB,CALD,CAKGA,KAAcA,GAAY,CAAC,IAE9B,SAAWhb,GAEPA,EAA4B,aAAI,gBAKhCA,EAA6B,cAAI,mBAKjCA,EAA6B,cAAI,mBAKjCA,EAA6B,cAAI,mBAKjCA,EAA4B,aAAI,kBAKhCA,EAAoC,qBAAI,uBAKxCA,EAAsC,uBAAI,yBAK1CA,EAAsC,uBAAI,yBAO1CA,EAAiC,kBAAI,oBAKrCA,EAAmC,oBAAI,sBAKvCA,EAA2B,YAAI,uBAM/BA,EAAoC,qBAAI,uBAKxCA,EAA+B,gBAAI,kBAKnCA,EAAoC,qBAAI,mCAKxCA,EAAoC,qBAAI,8BAKxCA,EAAiC,kBAAI,gCAKrCA,EAAoC,qBAAI,yBAC3C,CAtFD,CAsFGA,KAAkBA,GAAgB,CAAC,IC7FtC,SAAWib,GACPA,EAAgB,UAAI,YACpBA,EAAoB,cAAI,gBACxBA,EAAY,MAAI,kBACnB,CAJD,CAIGA,KAASA,GAAO,CAAC,IAEpB,SAAWC,GACPA,EAAkD,yBAAI,2BACtDA,EAAsD,6BAAI,+BAC1DA,EAAgD,uBAAI,2BACpDA,EAAoD,2BAAI,8BAC3D,CALD,CAKGA,KAA4BA,GAA0B,CAAC,IAE1D,SAAWC,GACPA,EAA0C,kBAAI,iBACjD,CAFD,CAEGA,KAA2BA,GAAyB,CAAC,IChBjD,MAAMC,GAAoB,kBCGpBC,GAAqB,EAQrBC,GAJmB,CAC5B3E,UAAW0E,GACXzE,OAAQ,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,ICT9B,IAAI2E,GCQJ,SAAS,GAASjjC,EAAO8nB,EAAW,QACvC,MAAM7c,EAAO,GAAM6c,GACnB,GAAY,MAAR7c,EACA,MAAM,IAAI9hB,MAAM,yBAAyB2+B,MAG7C,OAAO7c,EAAK0J,QAAQ3sB,OAAOgY,GAAOxJ,UAAU,EAChD,CCRO,SAAS,GAAWkM,GACvB,MAAmB,iBAARA,EAEA,GADMA,EAAIjY,QAAQ,OAAQ,IACVgJ,cAAe,UAEnCiP,CACX,EFZA,SAAWugC,GACPA,EAAwB,UAAI,YAC5BA,EAA+B,iBAAI,mBACnCA,EAAkC,oBAAI,qBACzC,CAJD,CAIGA,KAAiBA,GAAe,CAAC,IEuB7B,MAAM,GAAcxlC,GAAU,GAASA,EAAO,UAIxCylC,GAAe16C,GAAM,GAASA,EAAG,QAIjC,GAAekY,GAAM,GAAWA,EAAG,QAIzC,SAAS,GAAOyiC,EAAYC,GAC/B,MAAMzxC,EAAMyxC,GAAeD,EAAW5P,QAAO,CAAC8P,EAAKjuC,IAASiuC,EAAMjuC,EAAKvO,QAAQ,GACzEqjC,EAAM,IAAIp9B,WAAW6E,GAC3B,IAAI7K,EAAS,EACb,IAAK,MAAM2W,KAAS0lC,EAChBjZ,EAAIh0B,IAAIuH,EAAO3W,GACfA,GAAU2W,EAAM5W,OAEpB,OAAOqjC,CACX,CC3BO,MAAMoZ,GAAgCC,IACzC,QAAwBr6C,IAApBq6C,EAAUC,MACV,MAAM,IAAIr6C,MAAM,iBACpB,MAAO,cAAco6C,EAAUlF,WAAa0E,MAAsBQ,EAAUC,OAAO,EAiB1EC,GAA2BF,IACpC,GAAI,kBAAmBA,GAAaA,EAAU3G,cAE1C,OAAOj2C,MAAMq/B,KAAK,IAAI0d,IAAIH,EAAU3G,cAAc/lC,KAAKkkC,GAAiB4I,GAA0B5I,EAAcwI,EAAUlF,eAEzH,GAAI,WAAYkF,EAAW,CAE5B,QAAyBr6C,IAArBq6C,EAAUjF,OACV,MAAM,IAAIn1C,MAAM,iBACpB,OAAOxC,MAAMq/B,KAAK,IAAI0d,IAAIH,EAAUjF,OAAOznC,KAAK9P,GAAU,cAAcw8C,EAAUlF,WAAa0E,MAAsBh8C,OACzH,CACK,GAAI,gBAAiBw8C,GAAa,YAAaA,EAEhD,MAAO,CACHI,GAA0B,IAAIJ,EAAUK,eAAeL,EAAUjN,0BAA2BiN,EAAUlF,YAI1G,MAAM,IAAIl1C,MAAM,qDACpB,EAES06C,GAAgCC,IACzC,MAAMz7C,EAAQy7C,EAAajzC,MAAM,KACjC,GAAoB,GAAhBxI,EAAMxB,QACO,SAAbwB,EAAM,IACO,MAAbA,EAAM,IACO,OAAbA,EAAM,GACN,MAAM,IAAIc,MAAM,wBACpB,MAAMk1C,EAAYpqC,SAAS5L,EAAM,IAC3Bm7C,EAAQvvC,SAAS5L,EAAM,IAC7B,GAAIiG,MAAM+vC,IAAc/vC,MAAMk1C,GAC1B,MAAM,IAAIr6C,MAAM,8BACpB,MAAO,CACHk1C,YACAmF,QACH,EAEQO,GAA2BD,IACpC,MAAME,EAAe,IAAIN,IACnBO,EAAa,IAAIP,IACvB,IAAK,MAAMxH,KAAS4H,EAAc,CAC9B,MAAM,UAAEzF,EAAS,MAAEmF,GAAUK,GAA6B3H,GAC1D8H,EAAazxB,IAAI,GAAG8rB,KAAamF,KACjCS,EAAW1xB,IAAI8rB,EACnB,CACA,GAA0B,IAAtB2F,EAAa3yC,KACb,MAAM,IAAIlI,MAAM,mCAEpB,GAAI86C,EAAW5yC,KAAO,EAClB,MAAM,IAAIlI,MAAM,6DAIpB,MAAO,CACHk1C,UAHc4F,EAAWr2B,SAASvU,OAAOzO,MAIzC0zC,OAHW33C,MAAMq/B,KAAKge,GAAcntC,KAAKsmC,GAASlpC,SAASkpC,EAAKtsC,MAAM,KAAK,MAI9E,EAIE,SAASqzC,GAA8BvH,EAAawH,GACvD,IAAKA,EAAiBr8B,SAAS60B,GAC3B,MAAM,IAAIxzC,MAAM,gBAAgBwzC,sEAAgFwH,8FAExH,CA0DO,SAASR,GAA0B5I,EAAcsD,EAAY0E,GAAoBqB,EAAgB,GACpG,IAAKrJ,EACD,MAAM5xC,MAAM,mCAGhB,MAAO,cAAck1C,KAXlB,SAAkCtD,EAAcqJ,EAAgB,GACnE,MAAM,YAAER,EAAW,QAAEtN,GA/ClB,SAAiCyE,GACpC,MAAM1yC,EAAQ0yC,EAAalqC,MAAM,KACjC,GAAIxI,EAAMxB,OAAS,GAAKwB,EAAMxB,OAAS,EACnC,MAAMsC,MAAM,mCAGhB,IAAIk7C,EAAa,EACjB,GAAoB,GAAhBh8C,EAAMxB,OAAa,CAEnB,GADAw9C,EAAapwC,SAAS5L,EAAM,IACxBiG,MAAM+1C,GACN,MAAM,IAAIl7C,MAAM,6CAEpB,GAAIk7C,EAAa,EACb,MAAM,IAAIl7C,MAAM,6CAExB,CAEA,MAAMojB,EAASlkB,EAAMqD,QAAQ,GAE7B,GAAwB,GAApB6gB,EAAO,GAAG1lB,OACV,MAAM,IAAIsC,MAAM,qCAGpB,GAAwB,GAApBojB,EAAO,GAAG1lB,OACV,MAAM,IAAIsC,MAAM,iCAGpB,GAAwB,GAApBojB,EAAO,GAAG1lB,OACV,MAAM,IAAIsC,MAAM,oCAGpB,GAAwB,GAApBojB,EAAO,GAAG1lB,OACV,MAAM,IAAIsC,MAAM,kCAEpB,MAAO,CACHk7C,aACAT,YAAar3B,EAAO,GACpB+pB,QAAS/pB,EAAO,GAChB+3B,UAAW/3B,EAAO,GAClBub,SAAUvb,EAAO,GAEzB,CAMqCg4B,CAAwBxJ,GACnDl4B,EAAS,GAAO,GAAO,CAAC,GAAY+gC,GAAc,GAAYtN,MAC9DkO,EAAW,IAAIvZ,SAASpoB,EAAO5a,OAAOW,OAAO,IACnD,OAAOiC,OAAO25C,EAASC,aAAa,GAAG,GAAStV,OAAOiV,GAC3D,CAKuBM,CAAyB3J,EAAcqJ,IAE9D,CAqBO,SAASO,GAAqB5J,EAErC6J,GACI,MAAmC,iBAAxBA,EACAA,OAE4B17C,IAAhC07C,GAAsBpB,MACvBF,GAA6BsB,GAC7BjB,GAA0B5I,EAAc6J,GAAsBvG,WAAa0E,GACrF,CCxMO,MAAM8B,GAAoBpnC,IAI7B,IADAA,EAAQ,IAAI3Q,WAAW2Q,IACb5W,OAAS,EACf,MAAM,IAAIsC,MAAM,qBACpB,MAAMghC,EAAO,IAAIc,SAASxtB,EAAMxV,QAC1Bo2C,EAAYlU,EAAKe,UAAU,GAC3BoT,EAAS,GACf,GAAqB,MAAjB7gC,EAAM5W,OAEN,IAAK,IAAIkB,EAAI,EAAGA,EAAI,KAAMA,IAAK,CAC3B,MAAM+8C,EAAYn9C,KAAKmD,MAAM/C,EAAI,GAAK,EAChCg9C,EAAW,EAAKh9C,EAAI,EACtBoiC,EAAK6a,SAASF,GAAc,GAAKC,GACjCzG,EAAO71C,KAAKV,EAEpB,KAEC,CAED,MAAMk9C,EAAa9a,EAAK6a,SAAS,GACjC,IAAK,IAAIj9C,EAAI,EAAGjB,EAAS,EAAGiB,EAAIk9C,EAAYl9C,IAAKjB,GAAU,EAAG,CAC1D,GAAIA,EAAS,GAAK2W,EAAM5W,OACpB,MAAM,IAAIsC,MAAM,0BACpBm1C,EAAO71C,KAAK0hC,EAAKe,UAAUpkC,GAC/B,CACJ,CACA,MAAO,CAAEu3C,YAAWC,SAAQ,EAEnB4G,GAAoB3B,IAC7B,MAAM,UAAElF,EAAS,OAAEC,GAAWiF,EACxBH,EAAc9E,EAAOz3C,QAAU,GAAK,IAAM,EAAI,EAAIy3C,EAAOz3C,OACzDoB,EAAS,IAAIkW,YAAYilC,GACzBjZ,EAAO,IAAIc,SAAShjC,GAE1B,GADAkiC,EAAKgB,UAAU,EAAGkT,GACdC,EAAOz3C,QAAU,GAEjB,IAAK,MAAME,KAASu3C,EAAQ,CACxB,MAAMwG,EAAYn9C,KAAKmD,MAAM/D,EAAQ,GAAK,EACpCg+C,EAAW,EAAKh+C,EAAQ,EAC9BojC,EAAKgb,SAASL,EAAW3a,EAAK6a,SAASF,GAAc,GAAKC,EAC9D,KAEC,CAED5a,EAAKgb,SAAS,EAAG7G,EAAOz3C,QACxB,IAAK,IAAIkB,EAAI,EAAGjB,EAAS,EAAGiB,EAAIu2C,EAAOz3C,OAAQkB,IAAKjB,GAAU,EAC1DqjC,EAAKgB,UAAUrkC,EAAQw3C,EAAOv2C,GAEtC,CACA,OAAO,IAAI+E,WAAW7E,EAAO,ECnD1BiuC,eAAekP,GAAM9vC,GACxB,OAAO,IAAIrO,SAASC,GAAY05B,WAAW15B,EAASoO,IACxD,kCCDA,MAAM+vC,GAAW,OACV,MAAMC,GACTC,MACAC,MACAC,OACA,2BAAOC,CAAqBC,EAAO50C,GAC/B,OAAOA,EAAS,GAAGs0C,MAAYM,KAAS50C,IAAW,GAAGs0C,MAAYM,GACtE,CACA,WAAA1tC,CAAYlH,GACR5F,KAAKo6C,MAAQ,GAAMD,GAAOI,qBAAqB,OAAQ30C,IACvD5F,KAAKq6C,MAAQ,GAAMF,GAAOI,qBAAqB,OAAQ30C,IACvD5F,KAAKs6C,OAAS,GAAMH,GAAOI,qBAAqB,QAAS30C,GAC7D,CACA,QAAIosC,GACA,OAAOhyC,KAAKo6C,KAChB,CACA,QAAIhxC,GACA,OAAOpJ,KAAKq6C,KAChB,CACA,SAAI3yC,GACA,OAAO1H,KAAKs6C,MAChB,CACA,GAAA17C,CAAI47C,KAAU/5C,IAEVg6C,EADez6C,KAAKw6C,OACV/5C,EACd,ECxBJ,MAAM7B,GAAM,IAAIu7C,GAAO,qBACjBO,GAAa1W,OAAO,KAGnB,MAAM2W,GACTnJ,YACAoJ,MACA,WAAA9tC,CAAY0kC,EAAaoJ,GACrB56C,KAAKwxC,YAAcA,EACnBxxC,KAAK46C,MAAQA,CACjB,CACA,aAAIjK,GACA,OAAOxpB,QAAQnnB,KAAK46C,MAAMjK,UAC9B,CACA,WAAIJ,GACA,OAAOvwC,KAAK46C,MAAMrK,OACtB,CACA,gBAAIX,GACA,OAAO5vC,KAAK46C,MAAMhL,YACtB,CACA,iBAAIiL,GACA,OAAO76C,KAAK46C,MAAMpK,SACtB,CACA,aAAIA,GAGA,IACI,GAAIxwC,KAAK46C,MAAMpK,UAAW,CAEtB,MAAMA,EAAYxwC,KAAK46C,MAAMpK,UAAYkK,GACzC,OAAO,IAAIxwC,KAAKxK,OAAO8wC,GAC3B,CACA,MACJ,CACA,MAAOlrC,GACH,MACJ,CACJ,CACA,QAAImrC,GACA,OAAOzwC,KAAK46C,MAAMnK,IACtB,CACA,WAAItF,GAGA,OAAOnrC,KAAK46C,MAAMzP,SAAW,CACjC,CACA,kBAAIuF,GACA,OAAO1wC,KAAK46C,MAAMlK,cACtB,EAEG,MAAM,GACTd,aACAe,UACAa,YACAsJ,WACA,WAAAhuC,CAAY8iC,EAAce,GAAY,EAAOa,EAAasJ,GAKtD,GAJA96C,KAAK4vC,aAAeA,EACpB5vC,KAAK2wC,UAAYA,EACjB3wC,KAAKwxC,YAAcA,EACnBxxC,KAAK86C,WAAaA,GACblL,GAAiC,KAAjBA,EACjB,MAAM,IAAI5xC,MAAM,kCAExB,CACA,YAAM+8C,CAAOtxC,GACT,OAAO,GAAkB5M,aAAamD,KAAKg7C,WAAWvxC,GAC1D,CACA,gBAAMuxC,CAAWvxC,GACb,MAAM+mC,EAAY/mC,EAAQ+mC,WAAa,IAAItmC,KACrC+wC,EAAe,CACjB1K,QAAS9mC,EAAQ8mC,QACjBpF,QArEW,EAsEXyE,aAAc5vC,KAAK4vC,aACnBY,UAAWxM,OAAOwM,EAAU0K,WAAaR,GACzCjK,UAAM1yC,EACN2yC,eAAgBjnC,EAAQinC,eACxBC,UAAW3wC,KAAK2wC,WAEpB,GAAI3wC,KAAK86C,WAAY,CACjB,MAAMrK,EAAOzwC,KAAK86C,WAAWG,GAC7B,MAAO,IAAKA,EAAcxK,OAC9B,CACA,OAAOwK,CACX,EAUG,SAASE,IAAc,YAAE3J,EAAW,qBAAEiI,EAAoB,aAAE7J,EAAY,UAAEe,EAAS,WAAEmK,IACxF,OAAO,IAAI,GAAQlL,EAAce,EAAW6I,GAAqB5J,EAAc4B,GAAeiI,GAAuBqB,EACzH,CACO,MAAM,GACTtJ,YACA5B,aACA,WAAA9iC,CAAY0kC,EAAa5B,GAGrB,GAFA5vC,KAAKwxC,YAAcA,EACnBxxC,KAAK4vC,aAAeA,GACfA,GAAiC,KAAjBA,EACjB,MAAM,IAAI5xC,MAAM,kCAExB,CACA,kBAAAo9C,CAAmB9oC,GACf,MAAM2oC,EAAe,GAAkBr9C,OAAO0U,GAC9C,OAAOxW,QAAQC,QAAQ,CACnBw0C,QAAS0K,EAAa1K,QACtBX,aAAcqL,EAAarL,aAC3BzE,QAAS8P,EAAa9P,cAAWptC,EACjCyyC,UAAWyK,EAAazK,gBAAazyC,EACrC0yC,KAAMwK,EAAaxK,WAAQ1yC,EAC3B2yC,eAAgBuK,EAAavK,qBAAkB3yC,EAC/C4yC,UAAWsK,EAAatK,YAAa,GAE7C,CACA,kBAAM0K,CAAa7J,EAAaoJ,GAG5B,OAAIA,EAAMzP,SACNvsC,GAAI8I,MAAM,uDAxHC,EAwHgE,YAAakzC,EAAMzP,SACvFrvC,QAAQC,aAAQgC,IAEpB,IAAI48C,GAAenJ,EAAaoJ,EAC3C,EC7EJ,SAhBA,SAAap8C,GACT,GAHsC,MAGlBA,EAHPwP,OAAOC,eAIhB,MAAO,WACH,MAAM6lC,EAAM,GACZ,UAAW,MAAMwH,KAAS98C,EACtBs1C,EAAIx2C,KAAKg+C,GAEb,OAAOxH,CACV,EANM,GAQX,MAAMA,EAAM,GACZ,IAAK,MAAMwH,KAAS98C,EAChBs1C,EAAIx2C,KAAKg+C,GAEb,OAAOxH,CACX,EC7CO,SAAS,GAAOyH,EAAQ7/C,GACb,MAAVA,IACAA,EAAS6/C,EAAOnT,QAAO,CAAC8P,EAAKjuC,IAASiuC,EAAMjuC,EAAKvO,QAAQ,IAE7D,MAAM85C,EAAS5Y,EAAYlhC,GAC3B,IAAIC,EAAS,EACb,IAAK,MAAMm4C,KAAOyH,EACd/F,EAAOzqC,IAAI+oC,EAAKn4C,GAChBA,GAAUm4C,EAAIp4C,OAElB,OAAoB85C,CACxB,CCbO,SAAS,GAAOnb,EAAGh9B,GACtB,GAAIg9B,IAAMh9B,EACN,OAAO,EAEX,GAAIg9B,EAAE4D,aAAe5gC,EAAE4gC,WACnB,OAAO,EAEX,IAAK,IAAIrhC,EAAI,EAAGA,EAAIy9B,EAAE4D,WAAYrhC,IAC9B,GAAIy9B,EAAEz9B,KAAOS,EAAET,GACX,OAAO,EAGf,OAAO,CACX,CCqEA,MAAMof,GAAShO,OAAOw+B,IAAI,+BAC1B,SAASgP,GAAiBC,EAAM7/C,GAC5B,GAAa,MAATA,GAAiBA,EAAQ,EACzB,MAAM,IAAIm3B,WAAW,0BAEzB,IAAIp3B,EAAS,EACb,IAAK,MAAM4G,KAAOk5C,EAAM,CACpB,MAAMC,EAAS//C,EAAS4G,EAAI07B,WAC5B,GAAIriC,EAAQ8/C,EACR,MAAO,CACHn5C,MACA3G,MAAOA,EAAQD,GAGvBA,EAAS+/C,CACb,CACA,MAAM,IAAI3oB,WAAW,yBACzB,CAcO,SAAS4oB,GAAiBl8C,GAC7B,OAAO0nB,QAAQ1nB,IAAQuc,IAC3B,CACO,MAAM4/B,GACTH,KACA//C,OACA,CAACsgB,KAAU,EACX,WAAAlP,IAAesxB,GACXp+B,KAAKy7C,KAAO,GACZz7C,KAAKtE,OAAS,EACV0iC,EAAK1iC,OAAS,GACdsE,KAAK67C,UAAUzd,EAEvB,CACA,EAAEpwB,OAAO8tC,kBACE97C,KAAKy7C,IAChB,CACA,cAAIxd,GACA,OAAOj+B,KAAKtE,MAChB,CAIA,MAAAqgD,IAAUN,GACNz7C,KAAK67C,UAAUJ,EACnB,CAIA,SAAAI,CAAUJ,GACN,IAAI//C,EAAS,EACb,IAAK,MAAM6G,KAAOk5C,EACd,GAAIl5C,aAAeZ,WACfjG,GAAU6G,EAAI07B,WACdj+B,KAAKy7C,KAAKn+C,KAAKiF,OAEd,KAAIo5C,GAAiBp5C,GAKtB,MAAM,IAAIvE,MAAM,qEAJhBtC,GAAU6G,EAAI07B,WACdj+B,KAAKy7C,KAAKn+C,QAAQiF,EAAIk5C,KAI1B,CAEJz7C,KAAKtE,QAAUA,CACnB,CAIA,OAAAsgD,IAAWP,GACPz7C,KAAKi8C,WAAWR,EACpB,CAIA,UAAAQ,CAAWR,GACP,IAAI//C,EAAS,EACb,IAAK,MAAM6G,KAAOk5C,EAAKS,UACnB,GAAI35C,aAAeZ,WACfjG,GAAU6G,EAAI07B,WACdj+B,KAAKy7C,KAAKnxC,QAAQ/H,OAEjB,KAAIo5C,GAAiBp5C,GAKtB,MAAM,IAAIvE,MAAM,sEAJhBtC,GAAU6G,EAAI07B,WACdj+B,KAAKy7C,KAAKnxC,WAAW/H,EAAIk5C,KAI7B,CAEJz7C,KAAKtE,QAAUA,CACnB,CAIA,GAAAoP,CAAIlP,GACA,MAAMmjC,EAAMyc,GAAiBx7C,KAAKy7C,KAAM7/C,GACxC,OAAOmjC,EAAIx8B,IAAIw8B,EAAInjC,MACvB,CAIA,GAAAmP,CAAInP,EAAO6D,GACP,MAAMs/B,EAAMyc,GAAiBx7C,KAAKy7C,KAAM7/C,GACxCmjC,EAAIx8B,IAAIw8B,EAAInjC,OAAS6D,CACzB,CAIA,KAAAiH,CAAMnE,EAAK5G,EAAS,GAChB,GAAI4G,aAAeZ,WACf,IAAK,IAAI/E,EAAI,EAAGA,EAAI2F,EAAI7G,OAAQkB,IAC5BoD,KAAK+K,IAAIpP,EAASiB,EAAG2F,EAAI3F,QAG5B,KAAI++C,GAAiBp5C,GAMtB,MAAM,IAAIvE,MAAM,oEALhB,IAAK,IAAIpB,EAAI,EAAGA,EAAI2F,EAAI7G,OAAQkB,IAC5BoD,KAAK+K,IAAIpP,EAASiB,EAAG2F,EAAIuI,IAAIlO,GAKrC,CACJ,CAIA,OAAAu/C,CAAQ7pC,GAIJ,GAFAA,EAAQ9V,KAAK4/C,MAAM9pC,KAEf5S,OAAOyD,MAAMmP,IAAUA,GAAS,GAApC,CAIA,GAAIA,IAAUtS,KAAKi+B,WAGf,OAFAj+B,KAAKy7C,KAAO,QACZz7C,KAAKtE,OAAS,GAGlB,KAAOsE,KAAKy7C,KAAK//C,OAAS,GAAG,CACzB,KAAI4W,GAAStS,KAAKy7C,KAAK,GAAGxd,YAKrB,CACDj+B,KAAKy7C,KAAK,GAAKz7C,KAAKy7C,KAAK,GAAGloB,SAASjhB,GACrCtS,KAAKtE,QAAU4W,EACf,KACJ,CARIA,GAAStS,KAAKy7C,KAAK,GAAGxd,WACtBj+B,KAAKtE,QAAUsE,KAAKy7C,KAAK,GAAGxd,WAC5Bj+B,KAAKy7C,KAAK51C,OAOlB,CAlBA,CAmBJ,CAOA,KAAApI,CAAM4+C,EAAgBC,GAClB,MAAM,KAAEb,EAAI,OAAE//C,GAAWsE,KAAKu8C,SAASF,EAAgBC,GACvD,OAAO,GAAOb,EAAM//C,EACxB,CAOA,QAAA63B,CAAS8oB,EAAgBC,GACrB,MAAM,KAAEb,EAAI,OAAE//C,GAAWsE,KAAKu8C,SAASF,EAAgBC,GACvD,OAAoB,IAAhBb,EAAK//C,OACE+/C,EAAK,GAET,GAAOA,EAAM//C,EACxB,CAMA,OAAA8gD,CAAQH,EAAgBC,GACpB,MAAM,KAAEb,EAAI,OAAE//C,GAAWsE,KAAKu8C,SAASF,EAAgBC,GACjDG,EAAO,IAAIb,GAIjB,OAHAa,EAAK/gD,OAASA,EAEd+gD,EAAKhB,KAAO,IAAIA,GACTgB,CACX,CACA,QAAAF,CAASF,EAAgBC,GASrB,GARAD,EAAiBA,GAAkB,EACnCC,EAAeA,GAAgBt8C,KAAKtE,OAChC2gD,EAAiB,IACjBA,EAAiBr8C,KAAKtE,OAAS2gD,GAE/BC,EAAe,IACfA,EAAet8C,KAAKtE,OAAS4gD,GAE7BD,EAAiB,GAAKC,EAAet8C,KAAKtE,OAC1C,MAAM,IAAIq3B,WAAW,0BAEzB,GAAIspB,IAAmBC,EACnB,MAAO,CAAEb,KAAM,GAAI//C,OAAQ,GAE/B,GAAuB,IAAnB2gD,GAAwBC,IAAiBt8C,KAAKtE,OAC9C,MAAO,CAAE+/C,KAAMz7C,KAAKy7C,KAAM//C,OAAQsE,KAAKtE,QAE3C,MAAM+/C,EAAO,GACb,IAAI9/C,EAAS,EACb,IAAK,IAAIiB,EAAI,EAAGA,EAAIoD,KAAKy7C,KAAK//C,OAAQkB,IAAK,CACvC,MAAM2F,EAAMvC,KAAKy7C,KAAK7+C,GAChB8/C,EAAW/gD,EACX+/C,EAASgB,EAAWn6C,EAAI07B,WAG9B,GADAtiC,EAAS+/C,EACLW,GAAkBX,EAElB,SAEJ,MAAMiB,EAAkBN,GAAkBK,GAAYL,EAAiBX,EACjEkB,EAAiBN,EAAeI,GAAYJ,GAAgBZ,EAClE,GAAIiB,GAAmBC,EAAgB,CAEnC,GAAIP,IAAmBK,GAAYJ,IAAiBZ,EAAQ,CAExDD,EAAKn+C,KAAKiF,GACV,KACJ,CAEA,MAAMxF,EAAQs/C,EAAiBK,EAC/BjB,EAAKn+C,KAAKiF,EAAIgxB,SAASx2B,EAAOA,GAASu/C,EAAeD,KACtD,KACJ,CACA,GAAIM,EAAJ,CAEI,GAAuB,IAAnBN,EAAsB,CAEtBZ,EAAKn+C,KAAKiF,GACV,QACJ,CAEAk5C,EAAKn+C,KAAKiF,EAAIgxB,SAAS8oB,EAAiBK,GAE5C,KAVA,CAWA,GAAIE,EAAgB,CAChB,GAAIN,IAAiBZ,EAAQ,CAEzBD,EAAKn+C,KAAKiF,GACV,KACJ,CAEAk5C,EAAKn+C,KAAKiF,EAAIgxB,SAAS,EAAG+oB,EAAeI,IACzC,KACJ,CAEAjB,EAAKn+C,KAAKiF,EAZV,CAaJ,CACA,MAAO,CAAEk5C,OAAM//C,OAAQ4gD,EAAeD,EAC1C,CACA,OAAAxpC,CAAQgqC,EAAQlhD,EAAS,GACrB,KAAKggD,GAAiBkB,IAAaA,aAAkBl7C,YACjD,MAAM,IAAI2K,UAAU,+DAExB,MAAMwwC,EAASD,aAAkBl7C,WAAak7C,EAASA,EAAOtpB,WAW9D,GAVA53B,EAAS+D,OAAO/D,GAAU,GACtBwH,MAAMxH,KACNA,EAAS,GAETA,EAAS,IACTA,EAASqE,KAAKtE,OAASC,GAEvBA,EAAS,IACTA,EAAS,GAES,IAAlBkhD,EAAOnhD,OACP,OAAOC,EAASqE,KAAKtE,OAASsE,KAAKtE,OAASC,EAGhD,MAAMohD,EAAID,EAAO7e,WACjB,GAAU,IAAN8e,EACA,MAAM,IAAIzwC,UAAU,uCAGxB,MACM0wC,EAAqB,IAAIC,WADjB,KAGd,IAAK,IAAIp/C,EAAI,EAAGA,EAHF,IAGaA,IAEvBm/C,EAAmBn/C,IAAM,EAE7B,IAAK,IAAIT,EAAI,EAAGA,EAAI2/C,EAAG3/C,IAEnB4/C,EAAmBF,EAAO1/C,IAAMA,EAGpC,MAAM4Z,EAAQgmC,EACRpkB,EAAY54B,KAAKi+B,WAAa6e,EAAO7e,WACrCif,EAAeJ,EAAO7e,WAAa,EACzC,IAAI5O,EACJ,IAAK,IAAIzyB,EAAIjB,EAAQiB,GAAKg8B,EAAWh8B,GAAKyyB,EAAM,CAC5CA,EAAO,EACP,IAAK,IAAIjyB,EAAI8/C,EAAc9/C,GAAK,EAAGA,IAAK,CACpC,MAAMorC,EAAOxoC,KAAK8K,IAAIlO,EAAIQ,GAC1B,GAAI0/C,EAAO1/C,KAAOorC,EAAM,CACpBnZ,EAAO7yB,KAAKgU,IAAI,EAAGpT,EAAI4Z,EAAMwxB,IAC7B,KACJ,CACJ,CACA,GAAa,IAATnZ,EACA,OAAOzyB,CAEf,CACA,OAAQ,CACZ,CACA,OAAAugD,CAAQ7e,GACJ,MAAM/7B,EAAMvC,KAAKuzB,SAAS+K,EAAYA,EAAa,GAEnD,OADa,IAAIwB,SAASv9B,EAAIzF,OAAQyF,EAAI+7B,WAAY/7B,EAAI07B,YAC9Ckf,QAAQ,EACxB,CACA,OAAAC,CAAQ9e,EAAY7+B,GAChB,MAAM8C,EAAMq6B,EAAY,GACX,IAAIkD,SAASv9B,EAAIzF,OAAQyF,EAAI+7B,WAAY/7B,EAAI07B,YACrDmf,QAAQ,EAAG39C,GAChBO,KAAK0G,MAAMnE,EAAK+7B,EACpB,CACA,QAAA+e,CAAS/e,EAAYsB,GACjB,MAAMr9B,EAAMvC,KAAKuzB,SAAS+K,EAAYA,EAAa,GAEnD,OADa,IAAIwB,SAASv9B,EAAIzF,OAAQyF,EAAI+7B,WAAY/7B,EAAI07B,YAC9Cof,SAAS,EAAGzd,EAC5B,CACA,QAAA0d,CAAShf,EAAY7+B,EAAOmgC,GACxB,MAAMr9B,EAAM0D,EAAM,GACL,IAAI65B,SAASv9B,EAAIzF,OAAQyF,EAAI+7B,WAAY/7B,EAAI07B,YACrDqf,SAAS,EAAG79C,EAAOmgC,GACxB5/B,KAAK0G,MAAMnE,EAAK+7B,EACpB,CACA,QAAAif,CAASjf,EAAYsB,GACjB,MAAMr9B,EAAMvC,KAAKuzB,SAAS+K,EAAYA,EAAa,GAEnD,OADa,IAAIwB,SAASv9B,EAAIzF,OAAQyF,EAAI+7B,WAAY/7B,EAAI07B,YAC9Csf,SAAS,EAAG3d,EAC5B,CACA,QAAA4d,CAASlf,EAAY7+B,EAAOmgC,GACxB,MAAMr9B,EAAM0D,EAAM,GACL,IAAI65B,SAASv9B,EAAIzF,OAAQyF,EAAI+7B,WAAY/7B,EAAI07B,YACrDuf,SAAS,EAAG/9C,EAAOmgC,GACxB5/B,KAAK0G,MAAMnE,EAAK+7B,EACpB,CACA,WAAAmf,CAAYnf,EAAYsB,GACpB,MAAMr9B,EAAMvC,KAAKuzB,SAAS+K,EAAYA,EAAa,GAEnD,OADa,IAAIwB,SAASv9B,EAAIzF,OAAQyF,EAAI+7B,WAAY/7B,EAAI07B,YAC9Cwf,YAAY,EAAG7d,EAC/B,CACA,WAAA8d,CAAYpf,EAAY7+B,EAAOmgC,GAC3B,MAAMr9B,EAAM0D,EAAM,GACL,IAAI65B,SAASv9B,EAAIzF,OAAQyF,EAAI+7B,WAAY/7B,EAAI07B,YACrDyf,YAAY,EAAGj+C,EAAOmgC,GAC3B5/B,KAAK0G,MAAMnE,EAAK+7B,EACpB,CACA,QAAAub,CAASvb,GACL,MAAM/7B,EAAMvC,KAAKuzB,SAAS+K,EAAYA,EAAa,GAEnD,OADa,IAAIwB,SAASv9B,EAAIzF,OAAQyF,EAAI+7B,WAAY/7B,EAAI07B,YAC9C4b,SAAS,EACzB,CACA,QAAAG,CAAS1b,EAAY7+B,GACjB,MAAM8C,EAAMq6B,EAAY,GACX,IAAIkD,SAASv9B,EAAIzF,OAAQyF,EAAI+7B,WAAY/7B,EAAI07B,YACrD+b,SAAS,EAAGv6C,GACjBO,KAAK0G,MAAMnE,EAAK+7B,EACpB,CACA,SAAAyB,CAAUzB,EAAYsB,GAClB,MAAMr9B,EAAMvC,KAAKuzB,SAAS+K,EAAYA,EAAa,GAEnD,OADa,IAAIwB,SAASv9B,EAAIzF,OAAQyF,EAAI+7B,WAAY/7B,EAAI07B,YAC9C8B,UAAU,EAAGH,EAC7B,CACA,SAAAI,CAAU1B,EAAY7+B,EAAOmgC,GACzB,MAAMr9B,EAAM0D,EAAM,GACL,IAAI65B,SAASv9B,EAAIzF,OAAQyF,EAAI+7B,WAAY/7B,EAAI07B,YACrD+B,UAAU,EAAGvgC,EAAOmgC,GACzB5/B,KAAK0G,MAAMnE,EAAK+7B,EACpB,CACA,SAAA0Y,CAAU1Y,EAAYsB,GAClB,MAAMr9B,EAAMvC,KAAKuzB,SAAS+K,EAAYA,EAAa,GAEnD,OADa,IAAIwB,SAASv9B,EAAIzF,OAAQyF,EAAI+7B,WAAY/7B,EAAI07B,YAC9C+Y,UAAU,EAAGpX,EAC7B,CACA,SAAAmW,CAAUzX,EAAY7+B,EAAOmgC,GACzB,MAAMr9B,EAAM0D,EAAM,GACL,IAAI65B,SAASv9B,EAAIzF,OAAQyF,EAAI+7B,WAAY/7B,EAAI07B,YACrD8X,UAAU,EAAGt2C,EAAOmgC,GACzB5/B,KAAK0G,MAAMnE,EAAK+7B,EACpB,CACA,YAAAgb,CAAahb,EAAYsB,GACrB,MAAMr9B,EAAMvC,KAAKuzB,SAAS+K,EAAYA,EAAa,GAEnD,OADa,IAAIwB,SAASv9B,EAAIzF,OAAQyF,EAAI+7B,WAAY/7B,EAAI07B,YAC9Cqb,aAAa,EAAG1Z,EAChC,CACA,YAAA8V,CAAapX,EAAY7+B,EAAOmgC,GAC5B,MAAMr9B,EAAM0D,EAAM,GACL,IAAI65B,SAASv9B,EAAIzF,OAAQyF,EAAI+7B,WAAY/7B,EAAI07B,YACrDyX,aAAa,EAAGj2C,EAAOmgC,GAC5B5/B,KAAK0G,MAAMnE,EAAK+7B,EACpB,CACA,UAAAqf,CAAWrf,EAAYsB,GACnB,MAAMr9B,EAAMvC,KAAKuzB,SAAS+K,EAAYA,EAAa,GAEnD,OADa,IAAIwB,SAASv9B,EAAIzF,OAAQyF,EAAI+7B,WAAY/7B,EAAI07B,YAC9C0f,WAAW,EAAG/d,EAC9B,CACA,UAAAge,CAAWtf,EAAY7+B,EAAOmgC,GAC1B,MAAMr9B,EAAM0D,EAAM,GACL,IAAI65B,SAASv9B,EAAIzF,OAAQyF,EAAI+7B,WAAY/7B,EAAI07B,YACrD2f,WAAW,EAAGn+C,EAAOmgC,GAC1B5/B,KAAK0G,MAAMnE,EAAK+7B,EACpB,CACA,UAAAuf,CAAWvf,EAAYsB,GACnB,MAAMr9B,EAAMvC,KAAKuzB,SAAS+K,EAAYA,EAAa,GAEnD,OADa,IAAIwB,SAASv9B,EAAIzF,OAAQyF,EAAI+7B,WAAY/7B,EAAI07B,YAC9C4f,WAAW,EAAGje,EAC9B,CACA,UAAAke,CAAWxf,EAAY7+B,EAAOmgC,GAC1B,MAAMr9B,EAAM0D,EAAM,GACL,IAAI65B,SAASv9B,EAAIzF,OAAQyF,EAAI+7B,WAAY/7B,EAAI07B,YACrD6f,WAAW,EAAGr+C,EAAOmgC,GAC1B5/B,KAAK0G,MAAMnE,EAAK+7B,EACpB,CACA,MAAA4N,CAAOC,GACH,GAAa,MAATA,EACA,OAAO,EAEX,KAAMA,aAAiByP,IACnB,OAAO,EAEX,GAAIzP,EAAMsP,KAAK//C,SAAWsE,KAAKy7C,KAAK//C,OAChC,OAAO,EAEX,IAAK,IAAIkB,EAAI,EAAGA,EAAIoD,KAAKy7C,KAAK//C,OAAQkB,IAClC,IAAK,GAAOoD,KAAKy7C,KAAK7+C,GAAIuvC,EAAMsP,KAAK7+C,IACjC,OAAO,EAGf,OAAO,CACX,CAKA,sBAAOmhD,CAAgBtC,EAAM//C,GACzB,MAAM+gD,EAAO,IAAIb,GAMjB,OALAa,EAAKhB,KAAOA,EACE,MAAV//C,IACAA,EAAS+/C,EAAKrT,QAAO,CAAC8P,EAAKjuC,IAASiuC,EAAMjuC,EAAKg0B,YAAY,IAE/Dwe,EAAK/gD,OAASA,EACP+gD,CACX,ECriBG,SAAS,GAAgBuB,GAC5B,OAAsC,MAA/BA,EAAMhwC,OAAOC,cACxB,CCEA,MAAMgwC,GAAkBviD,IACpB,MAAMwiD,EAAe,EAAsBxiD,GACrCyiD,EAAYvhB,EAAYshB,GAG9B,OAFA,EAAcxiD,EAAQyiD,GACtBF,GAAe3rC,MAAQ4rC,EAChBC,CAAS,EAGb,SAAS,GAAO3/C,EAAQuC,GAE3B,MAAMq9C,GADNr9C,EAAUA,GAAW,CAAC,GACOs9C,eAAiBJ,GAC9C,SAAUK,EAAWnhD,GAEjB,MAAMzB,EAAS0iD,EAAajhD,EAAM8gC,YAE9BviC,aAAkBiG,iBACZjG,QAGCA,EAGPyB,aAAiBwE,iBACXxE,QAGCA,CAEf,CACA,OAAI,GAAgBqB,GACT,kBACH,UAAW,MAAMrB,KAASqB,QACf8/C,EAAWnhD,EAEzB,CAJM,GAMJ,YACH,IAAK,MAAMA,KAASqB,QACT8/C,EAAWnhD,EAEzB,CAJM,EAKX,CAlCA8gD,GAAe3rC,MAAQ,EAmCvB,GAAOisC,OAAS,CAACphD,EAAO4D,KAEpB,MAAMq9C,GADNr9C,EAAUA,GAAW,CAAC,GACOs9C,eAAiBJ,GAC9C,OAAO,IAAIrC,GAAewC,EAAajhD,EAAM8gC,YAAa9gC,EAAM,EC9C7D,MAAMqhD,WAAkCxgD,MAC3C6N,KAAO,4BACPQ,KAAO,yBAMJ,MAAMoyC,WAA+BzgD,MACxC6N,KAAO,yBACPQ,KAAO,wBAMJ,MAAMqyC,WAAqC1gD,MAC9C6N,KAAO,+BACPQ,KAAO,0BAKJ,MAAMsyC,WAA2B3gD,MACpC6N,KAAO,qBACPQ,KAAO,qBCnBX,IAAIuyC,IACJ,SAAWA,GACPA,EAASA,EAAiB,OAAI,GAAK,SACnCA,EAASA,EAAe,KAAI,GAAK,MACpC,CAHD,CAGGA,KAAaA,GAAW,CAAC,IAC5B,MAAMC,GAAkBt8C,IACpB,MAAM7G,EAAS,EAAc6G,GAE7B,OADAs8C,GAAevsC,MAAQ,EAAsB5W,GACtCA,CAAM,EAGV,SAAS,GAAO8C,EAAQuC,GAC3B,MAAMjE,EAAS,IAAI8+C,GACnB,IAAIrZ,EAAOqc,GAASE,OAChBC,GAAc,EAClB,MAAMC,EAAgBj+C,GAASi+C,eAAiBH,GAC1CI,EAAkBl+C,GAASk+C,iBAnBJ,EAoBvBC,EAAgBn+C,GAASm+C,eAlBJ,QAmB3B,SAAUZ,IACN,KAAOxhD,EAAOmhC,WAAa,GAAG,CAC1B,GAAIsE,IAASqc,GAASE,OAElB,IAEI,GADAC,EAAaC,EAAcliD,GACvBiiD,EAAa,EACb,MAAM,IAAIP,GAA0B,0BAExC,GAAIO,EAAaG,EACb,MAAM,IAAIT,GAAuB,2BAErC,MAAMU,EAAmBH,EAAc1sC,MACvCxV,EAAOq/C,QAAQgD,GACU,MAArBp+C,GAASq+C,UACTr+C,EAAQq+C,SAASL,GAErBxc,EAAOqc,GAASS,IACpB,CACA,MAAOpjD,GACH,GAAIA,aAAe82B,WAAY,CAC3B,GAAIj2B,EAAOmhC,WAAaghB,EACpB,MAAM,IAAIP,GAA6B,kCAE3C,KACJ,CACA,MAAMziD,CACV,CAEJ,GAAIsmC,IAASqc,GAASS,KAAM,CACxB,GAAIviD,EAAOmhC,WAAa8gB,EAEpB,MAEJ,MAAM3gB,EAAOthC,EAAO0/C,QAAQ,EAAGuC,GAC/BjiD,EAAOq/C,QAAQ4C,GACQ,MAAnBh+C,GAASu+C,QACTv+C,EAAQu+C,OAAOlhB,SAEbA,EACNmE,EAAOqc,GAASE,MACpB,CACJ,CACJ,CACA,OAAI,GAAgBtgD,GACT,kBACH,UAAW,MAAM+D,KAAO/D,EACpB1B,EAAOi/C,OAAOx5C,SACP+7C,IAEX,GAAIxhD,EAAOmhC,WAAa,EACpB,MAAM,IAAI0gB,GAAmB,0BAEpC,CARM,GAUJ,YACH,IAAK,MAAMp8C,KAAO/D,EACd1B,EAAOi/C,OAAOx5C,SACP+7C,IAEX,GAAIxhD,EAAOmhC,WAAa,EACpB,MAAM,IAAI0gB,GAAmB,0BAEpC,CARM,EASX,CC3Fe,SAASY,KACvB,MAAM5qB,EAAW,CAAC,EAOlB,OALAA,EAAS6qB,QAAU,IAAI1jD,SAAQ,CAACC,EAASC,KACxC24B,EAAS54B,QAAUA,EACnB44B,EAAS34B,OAASA,CAAM,IAGlB24B,CACR,CDUAkqB,GAAevsC,MAAQ,EAyEvB,GAAOmtC,WAAa,CAACz0B,EAAQjqB,KACzB,IAAIk9B,EAAa,EA4BjB,OAAO,GA3BgB8M,kBACnB,OACI,IACI,MAAM,KAAE19B,EAAI,MAAE5N,SAAgBurB,EAAO9c,KAAK+vB,GAC1C,IAAa,IAAT5wB,EACA,OAES,MAAT5N,UACMA,EAEd,CACA,MAAOxD,GACH,GAAiB,mBAAbA,EAAIoQ,KACJ,MAAO,CAAEgB,MAAM,EAAM5N,MAAO,MAEhC,MAAMxD,CACV,CACA,QAEIgiC,EAAa,CACjB,CAER,CAtBsB,GA2BO,IACrBl9B,GAAW,CAAC,EAChBq+C,SAHcvvC,IAAQouB,EAAapuB,CAAC,GAItC,EE3HN,MAAM6vC,GACF5iD,OACAmjB,KACA0/B,IACAC,IACA1xC,KACA,WAAApB,CAAY+yC,GACR,KAAMA,EAAM,IAAQA,EAAM,EAAKA,EAC3B,MAAM,IAAI7hD,MAAM,qDAEpBgC,KAAKlD,OAAS,IAAItB,MAAMqkD,GACxB7/C,KAAKigB,KAAO4/B,EAAM,EAClB7/C,KAAK2/C,IAAM,EACX3/C,KAAK4/C,IAAM,EACX5/C,KAAKkO,KAAO,IAChB,CACA,IAAA5Q,CAAK8gC,GACD,YAA8BrgC,IAA1BiC,KAAKlD,OAAOkD,KAAK2/C,OAGrB3/C,KAAKlD,OAAOkD,KAAK2/C,KAAOvhB,EACxBp+B,KAAK2/C,IAAO3/C,KAAK2/C,IAAM,EAAK3/C,KAAKigB,MAC1B,EACX,CACA,KAAApa,GACI,MAAM2a,EAAOxgB,KAAKlD,OAAOkD,KAAK4/C,KAC9B,QAAa7hD,IAATyiB,EAKJ,OAFAxgB,KAAKlD,OAAOkD,KAAK4/C,UAAO7hD,EACxBiC,KAAK4/C,IAAO5/C,KAAK4/C,IAAM,EAAK5/C,KAAKigB,KAC1BO,CACX,CACA,OAAAs/B,GACI,YAAiC/hD,IAA1BiC,KAAKlD,OAAOkD,KAAK4/C,IAC5B,EAEG,MAAMG,GACT75C,KACA25C,IACAtwB,KACA8N,KACA,WAAAvwB,CAAY/L,EAAU,CAAC,GACnBf,KAAK6/C,IAAM9+C,EAAQi/C,YAAc,GACjChgD,KAAKuvB,KAAO,IAAImwB,GAAU1/C,KAAK6/C,KAC/B7/C,KAAKq9B,KAAOr9B,KAAKuvB,KACjBvvB,KAAKkG,KAAO,CAChB,CACA,aAAA+5C,CAAc9zC,GACV,OAAuB,MAAnBA,GAAK8xB,WACE9xB,EAAI8xB,WAER,CACX,CACA,IAAA3gC,CAAKgF,GAID,GAHkB,MAAdA,GAAK7C,QACLO,KAAKkG,MAAQlG,KAAKigD,cAAc39C,EAAI7C,SAEnCO,KAAKuvB,KAAKjyB,KAAKgF,GAAM,CACtB,MAAM8H,EAAOpK,KAAKuvB,KAClBvvB,KAAKuvB,KAAOnlB,EAAK8D,KAAO,IAAIwxC,GAAU,EAAI1/C,KAAKuvB,KAAKzyB,OAAOpB,QAC3DsE,KAAKuvB,KAAKjyB,KAAKgF,EACnB,CACJ,CACA,KAAAuD,GACI,IAAIvD,EAAMtC,KAAKq9B,KAAKx3B,QACpB,QAAY9H,IAARuE,GAAwC,MAAlBtC,KAAKq9B,KAAKnvB,KAAe,CAC/C,MAAMA,EAAOlO,KAAKq9B,KAAKnvB,KACvBlO,KAAKq9B,KAAKnvB,KAAO,KACjBlO,KAAKq9B,KAAOnvB,EACZ5L,EAAMtC,KAAKq9B,KAAKx3B,OACpB,CAIA,OAHkB,MAAdvD,GAAK7C,QACLO,KAAKkG,MAAQlG,KAAKigD,cAAc39C,EAAI7C,QAEjC6C,CACX,CACA,OAAAw9C,GACI,OAAO9/C,KAAKuvB,KAAKuwB,SACrB,EC9BG,MAAMI,WAAmBliD,MAC5BkK,KACAmE,KACA,WAAAS,CAAYrD,EAAS4C,GACjB0hC,MAAMtkC,GAAW,6BACjBzJ,KAAKkI,KAAO,UACZlI,KAAKqM,KAAOA,GAAQ,WACxB,EAEG,SAAS8zC,GAASp/C,EAAU,CAAC,GAehC,OA6BJ,SAAmBq/C,EAASr/C,GAExB,IAEIo/C,EACAE,EACAC,EAJAC,GADJx/C,EAAUA,GAAW,CAAC,GACFw/C,MAChBzjD,EAAS,IAAIijD,GAIbS,EAAQ,KACZ,MAiCMC,EAAcvyC,GACF,MAAVmyC,EACOA,EAAOnyC,IAElBpR,EAAOQ,KAAK4Q,GACLiyC,GAUL7iD,EAAQmC,IACV,GAAI6gD,EACA,OAAOH,EAGX,IAA4B,IAAxBp/C,GAAS2/C,YAA4C,MAArBjhD,GAAOw+B,WACvC,MAAM,IAAIjgC,MAAM,kEAEpB,OAAOyiD,EAAW,CAAEpzC,MAAM,EAAO5N,SAAQ,EAEvCzC,EAAOf,GACLqkD,EACOH,GACXG,GAAQ,EACO,MAAPrkD,EAtBQ,CAACA,IACjBa,EAAS,IAAIijD,GACC,MAAVM,EACOA,EAAO,CAAE34C,MAAOzL,KAE3Ba,EAAOQ,KAAK,CAAEoK,MAAOzL,IACdkkD,IAgBgBQ,CAAY1kD,GAAOwkD,EAAW,CAAEpzC,MAAM,KAkDjE,GAvCA8yC,EAAW,CACP,CAACnyC,OAAOC,iBAAmB,OAAOjO,IAAM,EACxCkO,KA3Ea68B,UACb,IACI,OAAKjuC,EAAOgjD,UAGRQ,EACO,CAAEjzC,MAAM,SAEN,IAAIvR,SAAQ,CAACC,EAASC,KAC/BqkD,EAAUnyC,IACNmyC,EAAS,KACTvjD,EAAOQ,KAAK4Q,GACZ,IACInS,EAAQqkD,EAAQtjD,GACpB,CACA,MAAOb,GACHD,EAAOC,EACX,CACA,OAAOkkD,CAAQ,CAClB,IAhBMC,EAAQtjD,EAkBvB,CACA,QACQA,EAAOgjD,WAGPc,gBAAe,KACXJ,EAAMzkD,UACNykD,EAAQ,IAAU,GAG9B,GA6CAlyC,OAZY,KACZxR,EAAS,IAAIijD,GACb/iD,IACO,CAAEqQ,MAAM,IAUfwzC,MARY5kD,IACZe,EAAIf,GACG,CAAEoR,MAAM,IAOf/P,OACAN,MACA,kBAAI8jD,GACA,OAAOhkD,EAAOoJ,IAClB,EACA66C,QAAShW,MAAOhqC,IACZ,MAAMigD,EAASjgD,GAASigD,OAExB,GADAA,GAAQC,iBACJnkD,EAAOgjD,UACP,OAEJ,IAAIoB,EACA/xC,EACU,MAAV6xC,IACAE,EAAS,IAAIplD,SAAQ,CAACC,EAASC,KAC3BmT,EAAW,KACPnT,EAAO,IAAIkkD,GAAa,EAE5Bc,EAAOG,iBAAiB,QAAShyC,EAAS,KAGlD,UACUrT,QAAQslD,KAAK,CACfZ,EAAMhB,QACN0B,GAER,CACA,QACoB,MAAZ/xC,GAA8B,MAAV6xC,GACpBA,GAAQK,oBAAoB,QAASlyC,EAE7C,IAGK,MAAToxC,EACA,OAAOJ,EAEX,MAAMmB,EAAYnB,EAsClB,OArCAA,EAAW,CACP,CAACnyC,OAAOC,iBAAmB,OAAOjO,IAAM,EACxCkO,KAAI,IACOozC,EAAUpzC,OAErB2yC,MAAM5kD,IACFqlD,EAAUT,MAAM5kD,GACH,MAATskD,IACAA,EAAMtkD,GACNskD,OAAQxiD,GAEL,CAAEsP,MAAM,IAEnBiB,OAAM,KACFgzC,EAAUhzC,SACG,MAATiyC,IACAA,IACAA,OAAQxiD,GAEL,CAAEsP,MAAM,IAEnB/P,OACAN,IAAIf,IACAqlD,EAAUtkD,IAAIf,GACD,MAATskD,IACAA,EAAMtkD,GACNskD,OAAQxiD,GAELoiD,GAEX,kBAAIW,GACA,OAAOQ,EAAUR,cACrB,EACAC,QAAU1b,GACCic,EAAUP,QAAQ1b,IAG1B8a,CACX,CA/LWmB,EAdUxkD,IACb,MAAMoR,EAAOpR,EAAO+I,QACpB,GAAY,MAARqI,EACA,MAAO,CAAEb,MAAM,GAEnB,GAAkB,MAAda,EAAKxG,MACL,MAAMwG,EAAKxG,MAEf,MAAO,CACH2F,MAAoB,IAAda,EAAKb,KAEX5N,MAAOyO,EAAKzO,MACf,GAEqBsB,EAC9B,CCKA,SAnCA,YAAkBwgD,GACd,MAAMC,EAAc,GACpB,IAAK,MAAMhjD,KAAU+iD,EAJiB,MAKb/iD,EALZwP,OAAOC,gBAMZuzC,EAAYlkD,KAAKkB,GAGzB,OAAIgjD,EAAY9lD,SAAW6lD,EAAQ7lD,OAExB,YACH,IAAK,MAAM8C,KAAUgjD,QACVhjD,CAEd,CAJM,GAMJ,kBACH,MAAMg3C,EAAS2K,GAAS,CACpBO,YAAY,IAEX5kD,QAAQC,UAAU+R,MAAKi9B,UACxB,UACUjvC,QAAQ2lD,IAAIF,EAAQ71C,KAAIq/B,MAAOvsC,IACjC,UAAW,MAAMkjD,KAAQljD,EACrBg3C,EAAOl4C,KAAKokD,EAChB,KAEJlM,EAAOx4C,KACX,CACA,MAAOf,GACHu5C,EAAOx4C,IAAIf,EACf,WAEGu5C,CACV,CAlBM,EAmBX,EC7EO,SAASmM,GAAKphC,KAAUqhC,GAC3B,GAAa,MAATrhC,EACA,MAAM,IAAIviB,MAAM,kBAGpB,GAAI6jD,GAASthC,GAAQ,CACjB,MAAMuhC,EAASvhC,EACfA,EAAQ,IAAMuhC,EAAOtjD,MAEzB,MACK,GAAIujD,GAAWxhC,IAAU,GAAgBA,GAAQ,CAClD,MAAM/hB,EAAS+hB,EACfA,EAAQ,IAAM/hB,CAClB,CACA,MAAMwjD,EAAM,CAACzhC,KAAUqhC,GAOvB,GANII,EAAItmD,OAAS,GAETmmD,GAASG,EAAIA,EAAItmD,OAAS,MAC1BsmD,EAAIA,EAAItmD,OAAS,GAAKsmD,EAAIA,EAAItmD,OAAS,GAAGumD,MAG9CD,EAAItmD,OAAS,EAEb,IAAK,IAAIkB,EAAI,EAAGA,EAAIolD,EAAItmD,OAAS,EAAGkB,IAC5BilD,GAASG,EAAIplD,MACbolD,EAAIplD,GAAKslD,GAAiBF,EAAIplD,KAI1C,OAAOulD,MAAWH,EACtB,CACO,MAAMG,GAAU,IAAIH,KACvB,IAAIjjB,EACJ,KAAOijB,EAAItmD,OAAS,GAChBqjC,EAAMijB,EAAIn8C,OAAJm8C,CAAYjjB,GAEtB,OAAOA,CAAG,EAER,GAAmB5yB,GACiB,MAA/BA,IAAM6B,OAAOC,eAElB8zC,GAAc51C,GACiB,MAA1BA,IAAM6B,OAAO8tC,UAElB+F,GAAY11C,GACH,MAAPA,GAGe,MAAZA,EAAI81C,MAA8B,MAAd91C,EAAI3N,OAE7B0jD,GAAoBJ,GACdtjD,IACJ,MAAMnC,EAAIylD,EAAOG,KAAKzjD,GACtB,GAAe,MAAXnC,GAAGyR,KAAc,CACjB,MAAMs0C,EAASjC,GAAS,CACpBO,YAAY,IAOhB,IAAI2B,EALJhmD,EAAEyR,MAAK,KACHs0C,EAAOplD,KAAK,IACZf,IACAmmD,EAAOplD,IAAIf,EAAI,IAGnB,MAAMuC,EAASsjD,EAAOtjD,OACtB,GAAI,GAAgBA,GAChB6jD,EAAatX,wBACFvsC,EACP4jD,EAAOplD,KACX,MAEC,KAAI+kD,GAAWvjD,GAOhB,MAAM,IAAIR,MAAM,kEANhBqkD,EAAa,kBACF7jD,EACP4jD,EAAOplD,KACX,CAIJ,CACA,OAAO,GAAMolD,EAAQC,IACzB,CACA,OAAOP,EAAOtjD,MAAM,EC9ErB,MAAM8jD,GACTC,WACAC,eACArB,iBACAsB,WACA7jD,IACA,WAAAkO,CAAYy1C,EAAYC,EAAgBrB,GACpCnhD,KAAKuiD,WAAaA,EAClBviD,KAAKwiD,eAAiBA,EACtBxiD,KAAKmhD,iBAAmBA,EACxBnhD,KAAKpB,IAAM,IAAIu7C,GAAO,kBAAkBoI,KACxCviD,KAAKyiD,WAAa,IAAIhX,IACtBzrC,KAAKmhD,iBAAiB,cAAenhD,KAAK0iD,2BAC9C,CACA,eAAMC,CAAUC,GACZ,MAAMC,EAAYD,EAAKthC,GAAG7iB,WACpBqkD,EAAgB9iD,KAAKyiD,WAAW33C,IAAI+3C,GAC1C,IAAKC,EACD,OAAO9iD,KAAK+iD,aAAaH,GAE7B5iD,KAAKyiD,WAAWO,OAAOH,GACvB7iD,KAAKijD,cAAcL,GACnB,IACI,MAAMR,QAAeU,EACrB,GAAIV,GAA4B,WAAlBA,EAAO5gD,OACjB,OAAO4gD,CAEf,CACA,MAAO16C,GACH1H,KAAKpB,IAAIwK,KAAK,4BAA4By5C,QAAiBn7C,GAC3D1H,KAAKpB,IAAIwK,KAAK,iDAClB,CACA,OAAOpJ,KAAK+iD,aAAaH,EAC7B,CACA,kBAAMG,CAAaH,EAAMM,EAAU,GAC/B,MACMC,ECzCP,SAA0BC,GAC7B,IAAKA,EAAY1nD,OACb,OACJ,GAA2B,IAAvB0nD,EAAY1nD,OACZ,OAAO0nD,EAAY,GACvB,IAAIC,EAWJ,OAVAD,EAAYt3C,SAASq3C,IACS,SAAtBA,EAAW3hD,SACN6hD,EAGIF,EAAWG,SAASxhD,KAAOuhD,EAAiBC,SAASxhD,OAC1DuhD,EAAmBF,GAHnBE,EAAmBF,EAK3B,IAEGE,CACX,CDwB2BE,CADCvjD,KAAKwiD,eAAeI,EAAKthC,KAE7C,IAAK6hC,EACD,MAAM,IAAInlD,MAAM,0CAEpB,IACI,aAAamlD,EAAWK,UAAUxjD,KAAKuiD,WAC3C,CACA,MAAO76C,GACH,GAAIw7C,EA7CI,EA6CmB,CACvB,MAAMO,EA/CK,IA+C0BjnD,KAAK+G,IAAI,EAAG2/C,GAEjD,aADM,IAAIpnD,SAASC,GAAY05B,WAAW15B,EAAS0nD,KAC5CzjD,KAAK+iD,aAAaH,EAAMM,EAAU,EAC7C,CACA,MAAM,IAAIllD,MAAM,qCAAqC4kD,EAAKthC,GAAG7iB,iBAAmBiJ,EACpF,CACJ,CACA,aAAAu7C,CAAcL,GACV,MAAMc,EAAiB,IAAI5nD,SAASC,GAAY05B,WAAW15B,EAxDxC,OAyDb+mD,EAAgBhnD,QAAQslD,KAAK,CAC/BphD,KAAK+iD,aAAaH,GAClBc,EAAe51C,MAAK,KAChB,MAAM,IAAI9P,MAAM,qBAAqB,MAE1C6P,OAAOnG,IACN1H,KAAKpB,IAAI8I,MAAM,sCAAsCk7C,EAAKthC,GAAG7iB,iBAAkBiJ,EAAM,IAEzF1H,KAAKyiD,WAAW13C,IAAI63C,EAAKthC,GAAG7iB,WAAYqkD,EAC5C,CACAJ,2BAA8BtiD,IAC1B,MAAM,KAAEwiD,GAASxiD,EAAIujD,OACrB,GAAIf,EAAKgB,UAAUjnC,SAAS3c,KAAKuiD,YAE7B,GADoBviD,KAAK6jD,cAAcjB,EAAKthC,IAExCthB,KAAKpB,IAAIozC,KAAK,oCAAoC4Q,EAAKthC,GAAG7iB,cAC1DuB,KAAKijD,cAAcL,OAElB,CACD,MAAMC,EAAYD,EAAKthC,GAAG7iB,WAC1BuB,KAAKyiD,WAAWO,OAAOH,GACvB7iD,KAAKpB,IAAIozC,KAAK,gDAAgD6Q,IAClE,CACJ,EAEJ,aAAAgB,CAAcC,GAEV,OADoB9jD,KAAKwiD,eAAesB,GACrBC,MAAMZ,GAAqC,SAAtBA,EAAW3hD,QACvD,EE/EG,MAAMwiD,GACTzB,WACA0B,WACArlD,IACA+5C,aACAuL,uBACAC,0BACAC,cACA,WAAAt3C,CAAYy1C,EAAY0B,EAAYrlD,EAAK+5C,GACrC34C,KAAKuiD,WAAaA,EAClBviD,KAAKikD,WAAaA,EAClBjkD,KAAKpB,IAAMA,EACXoB,KAAK24C,aAAeA,EACpB34C,KAAKkkD,uBAAyBD,EAAWx0C,OAAO0xC,iBAAiBr9C,KAAKmgD,EAAWx0C,QACjFzP,KAAKmkD,0BAA4BF,EAAWx0C,OAAO4xC,oBAAoBv9C,KAAKmgD,EAAWx0C,QACvFzP,KAAKokD,cAAgB,IAAI9B,GAAcC,EAAY0B,EAAWI,kBAAkB7B,eAAe1+C,KAAKmgD,EAAWI,mBAAoBrkD,KAAKkkD,uBAC5I,CACA,eAAMvB,CAAUC,GACZ,OAAO5iD,KAAKokD,cAAczB,UAAUC,EACxC,CACA,aAAI0B,GACA,OAAOtkD,KAAKikD,WAAWK,SAC3B,CAMA,cAAMC,GACF,OCKDxZ,eAAmCuZ,EAAWV,GACjD,MAAMY,EAAQ,GASd,aARMF,EAAUx4C,SAAS82C,IACrB,IAAK,IAAIhmD,EAAI,EAAGA,EAAIgnD,EAAUloD,OAAQkB,IAClC,GAAIgmD,EAAKgB,UAAUjnC,SAASinC,EAAUhnD,IAAK,CACvC4nD,EAAMlnD,KAAKslD,GACX,KACJ,CACJ,IAEG4B,CACX,CDhBeC,CAAoBzkD,KAAKskD,UAAW,CAACtkD,KAAKuiD,YACrD,CACA,oBAAMmC,GAEF,aADoB1kD,KAAKukD,YACZ7nC,QAAQkmC,GACT5iD,KAAKikD,WAAWI,kBAAkB7B,eAAeI,EAAKthC,IAAI5lB,OAAS,GAEnF,CASA,cAAMipD,EAAS,SAAE9R,EAAQ,kBAAE+R,GAAsB,CAC7CA,kBAAmB,EACnB/R,SAAU,IAGV,MAEMgS,EEhDP,SAAgCL,EAAO3R,EAAU+R,GAEpD,IAAIE,EAAiBN,EAChB9nC,QAAQkmC,GAASA,EAAKmC,KAAKp2C,IAAI6oC,GAAKwN,aACpCvnD,MAAM,EAAGmnD,GAEV/R,EAAW,GAAKA,EAAWiS,EAAeppD,SAC1CopD,EAAiBA,EAAernD,MAAM,EAAGo1C,IAG7C,MAAMoS,EAAoBT,EAAM9nC,QAAQkmC,IAAUA,EAAKmC,KAAKp2C,IAAI6oC,GAAKwN,aAErE,GAAiB,IAAbnS,EACA,MAAO,IAAIiS,KAAmBG,GAGlC,MAAMC,EAAgB,IAAIJ,GAE1B,KAAOI,EAAcxpD,OAASm3C,GAAYoS,EAAkBvpD,OAAS,GAAG,CACpE,MAAMypD,EAAc3oD,KAAKmD,MAAMnD,KAAK4oD,SAAWH,EAAkBvpD,QAC3D2pD,EAAaJ,EAAkB1kD,OAAO4kD,EAAa,GAAG,GAC5DD,EAAc5nD,KAAK+nD,EACvB,CACA,OAAOH,CACX,CFwB8BI,OCNvBva,eAAoDqY,EAAakB,EAAWV,EAAWxL,GAC1F,MACMmN,EADkBnC,EAAY1mC,QAAQymC,GAAqC,SAAtBA,EAAW3hD,SACjCkK,KAAIq/B,MAAOoY,IAC5C,MAAMP,QAAa0B,EAAUx5C,IAAIq4C,EAAWqC,YAE5C,GADyB5B,EAAUG,MAAM0B,GAAa7C,EAAKgB,UAAUjnC,SAAS8oC,KACxD,CAClB,IAAIrN,EAQA,OAAOwK,EARI,CACX,MAAM8C,EAAuB9C,EAAK+C,SAAS76C,IAAI,aACzC86C,EAAgBF,GAAwBhM,GAAiBgM,GAC/D,GAAIE,GAAiBxN,EAAUlF,YAAc0S,EAAc1S,UACvD,OAAO0P,CAEf,CAIJ,CACA,OAAO,IAAI,IAGf,aAD6B9mD,QAAQ2lD,IAAI8D,IACnB7oC,QAAQkmC,GAAkB,OAATA,GAC3C,CDjBwDiD,CAAqC7lD,KAAKikD,WAAWI,kBAAkB7B,iBAAkBxiD,KAAKskD,UAAW,CAACtkD,KAAKuiD,YAAa3J,GAAwB54C,KAAK24C,eAEzH9F,EAAU+R,GAEpFkB,QC5CP/a,eAAkCuZ,EAAWE,GAChD,OAAqB,IAAjBA,EAAM9oD,OACC,UACWI,QAAQ2lD,IAAI+C,EAAM94C,KAAIq/B,MAAO6X,IAC/C,IACI,MAAMmD,SAAmBzB,EAAUx5C,IAAI83C,EAAKthC,KAAKqkC,SAAS76C,IAAI,QAC9D,OAAKi7C,EAGE,CAAEnD,OAAMoD,KADFtmD,OAAOq4C,GAAYgO,KADrB,CAAEnD,OAAMoD,KAAMniD,IAG7B,CACA,MAAO6D,GACH,MAAO,CAAEk7C,OAAMoD,KAAMniD,IACzB,OAGyB6Y,QAAQvO,GAAsB,OAAXA,IAE3C0W,MAAK,CAACwV,EAAGh9B,IAAMg9B,EAAE2rB,KAAO3oD,EAAE2oD,OAC1Bt6C,KAAKyC,GAAWA,EAAOy0C,MAChC,CDwB0CqD,CAAmBjmD,KAAKskD,UAAWO,GAOrE,OANmC,IAA/BiB,EAAoBpqD,QACpBsE,KAAKpB,IAAIwK,KAAK,gEAEd08C,EAAoBpqD,OAASm3C,GAC7B7yC,KAAKpB,IAAIwK,KAAK,QAAQ08C,EAAoBpqD,iCAAiCm3C,MAExEiT,CACX,EGtEJ,MACA,IACEI,WAFmC,oBAAXlb,QAA0BA,OAAOkb,YAAclb,OAAOkb,WAAWpiD,KAAKknC,SCGhG,IAAIgK,GACJ,MAAMmR,GAAQ,IAAIxkD,WAAW,IACd,SAASykD,KAEtB,IAAKpR,KAEHA,GAAoC,oBAAXhK,QAA0BA,OAAOgK,iBAAmBhK,OAAOgK,gBAAgBlxC,KAAKknC,SAEpGgK,IACH,MAAM,IAAIh3C,MAAM,4GAIpB,OAAOg3C,GAAgBmR,GACzB,CCXA,MAAME,GAAY,GAElB,IAAK,IAAIzpD,EAAI,EAAGA,EAAI,MAAOA,EACzBypD,GAAU/oD,MAAMV,EAAI,KAAO6B,SAAS,IAAIhB,MAAM,ICmBhD,SAxBA,SAAYsD,EAASwB,EAAK5G,GACxB,GAAI,GAAOuqD,aAAe3jD,IAAQxB,EAChC,OAAO,GAAOmlD,aAIhB,MAAMI,GADNvlD,EAAUA,GAAW,CAAC,GACDqkD,SAAWrkD,EAAQqlD,KAAOA,MAK/C,GAHAE,EAAK,GAAe,GAAVA,EAAK,GAAY,GAC3BA,EAAK,GAAe,GAAVA,EAAK,GAAY,IAEvB/jD,EAAK,CACP5G,EAASA,GAAU,EAEnB,IAAK,IAAIiB,EAAI,EAAGA,EAAI,KAAMA,EACxB2F,EAAI5G,EAASiB,GAAK0pD,EAAK1pD,GAGzB,OAAO2F,CACT,CAEA,ODbK,SAAyBuxC,EAAKn4C,EAAS,GAG5C,OAAO0qD,GAAUvS,EAAIn4C,EAAS,IAAM0qD,GAAUvS,EAAIn4C,EAAS,IAAM0qD,GAAUvS,EAAIn4C,EAAS,IAAM0qD,GAAUvS,EAAIn4C,EAAS,IAAM,IAAM0qD,GAAUvS,EAAIn4C,EAAS,IAAM0qD,GAAUvS,EAAIn4C,EAAS,IAAM,IAAM0qD,GAAUvS,EAAIn4C,EAAS,IAAM0qD,GAAUvS,EAAIn4C,EAAS,IAAM,IAAM0qD,GAAUvS,EAAIn4C,EAAS,IAAM0qD,GAAUvS,EAAIn4C,EAAS,IAAM,IAAM0qD,GAAUvS,EAAIn4C,EAAS,KAAO0qD,GAAUvS,EAAIn4C,EAAS,KAAO0qD,GAAUvS,EAAIn4C,EAAS,KAAO0qD,GAAUvS,EAAIn4C,EAAS,KAAO0qD,GAAUvS,EAAIn4C,EAAS,KAAO0qD,GAAUvS,EAAIn4C,EAAS,IAChf,CCSS4qD,CAAgBD,EACzB,ECpBO,MAAME,GACT5L,MACA,WAAA9tC,CAAY8tC,GACR56C,KAAK46C,MAAQA,CACjB,CACA,aAAOh9C,CAAO0U,GACV,MAAMysB,EAAM,GAAkBnhC,OAAO0U,GACrC,OAAO,IAAIk0C,GAAcznB,EAC7B,CACA,MAAAliC,GACI,OAAO,GAAkBA,OAAOmD,KAAK46C,MACzC,CACA,eAAI9I,GACA,OAAO9xC,KAAK46C,MAAM9I,WACtB,CAKA,eAAIN,GACA,OAAOxxC,KAAK46C,MAAMpJ,WACtB,EAEG,MAAMiV,GACT7L,MACA,WAAA9tC,CAAY8tC,GACR56C,KAAK46C,MAAQA,CACjB,CACA,6BAAO8L,CAAuBlV,EAAaC,GACvC,OAAO,IAAIgV,GAAmB,CAC1BrV,UAAW,KACXG,oBAAqB,GAA6BF,oBAAoBsV,UACtEnV,cACAC,iBAER,CACA,+BAAOmV,CAAyBpV,EAAaC,GACzC,OAAO,IAAIgV,GAAmB,CAC1BrV,UAAW,KACXG,oBAAqB,GAA6BF,oBAAoBwV,YACtErV,cACAC,iBAER,CACA,kCAAOqV,CAA4BtV,GAC/B,OAAO,IAAIiV,GAAmB,CAC1BrV,UAAW,KACXG,oBAAqB,GAA6BF,oBAAoB0V,gBACtEvV,cACAC,cAAe,IAEvB,CACA,kCAAOuV,GACH,OAAO,IAAIP,GAAmB,CAC1BrV,UAAW,KACXG,oBAAqB,GAA6BF,oBAAoBK,gBACtEF,YAAa,GACbC,cAAe,IAEvB,CACA,aAAO7zC,CAAO0U,GACV,MAAMysB,EAAM,GAA6BnhC,OAAO0U,GAChD,OAAO,IAAIm0C,GAAmB1nB,EAClC,CACA,MAAAliC,GACI,OAAO,GAA6BA,OAAOmD,KAAK46C,MACpD,CACA,uBAAIrJ,GACA,OAAOvxC,KAAK46C,MAAMrJ,mBACtB,CACA,aAAIH,GACA,OAAOpxC,KAAK46C,MAAMxJ,SACtB,CACA,eAAII,GACA,OAAOxxC,KAAK46C,MAAMpJ,WACtB,CACA,iBAAIC,GACA,OAAOzxC,KAAK46C,MAAMnJ,aACtB,EAEG,MAAME,GACTiJ,MACA,WAAA9tC,CAAY8tC,GACR56C,KAAK46C,MAAQA,CACjB,CACA,aAAOh9C,CAAO0U,GACV,MAAMysB,EAAM,GAA8BnhC,OAAO0U,GACjD,OAAO,IAAIq/B,GAAwB5S,EACvC,CACA,MAAAliC,GACI,OAAO,GAA8BA,OAAOmD,KAAK46C,MACrD,CACA,cAAIhJ,GACA,OAAO5xC,KAAK46C,MAAMhJ,UACtB,CACA,cAAIC,GACA,OAAO7xC,KAAK46C,MAAM/I,UACtB,CACA,aAAIT,GACA,OAAOpxC,KAAK46C,MAAMxJ,SACtB,ECnGJ,MAAM,GAAM,IAAI+I,GAAO,aACV8M,GAEH,oCAEH,MAAMC,WAAmBlD,GAC5BmD,sBACAxO,aACA,WAAA7rC,CAAYq6C,EAAuBxO,EAAcyO,GAC7CrZ,MAPO,yCAOuBqZ,EAAOnD,WAAY,GAAKtL,GACtD34C,KAAKmnD,sBAAwBA,EAC7BnnD,KAAK24C,aAAeA,EACpByO,EACKC,OAAOJ,GAAmBjnD,KAAKsnD,UAAUxjD,KAAK9D,MAAO,CACtDunD,kBAAmB,MAElB15C,OAAOvI,IACR,GAAIoC,MAAM,sBAAuBu/C,GAAmB3hD,EAAE,GAE9D,CACA,eAAMwrC,CAAUU,EAAaoR,EAAMnR,GAC/B,MAAM2Q,QAAepiD,KAAK2iD,UAAUC,GAC9BpsB,EAAUiwB,GAAmBC,uBAAuBlV,EAAaC,GACvE,IAAI1S,EACJ,IACIA,QAAY4iB,GAAK,CAACnrB,EAAQ35B,UAAW,GAAWulD,EAAQ,IAAWrX,MAAOvsC,SAAiB,GAAIA,IACnG,CACA,MAAOkJ,GAEH,OADA,GAAIA,MAAM,mCAAoCA,GACvC,CACH8/C,QAAS,KACTC,QAAS,CACL//C,MAAO60B,GAAcmrB,aACrB5D,OAAQlB,EAAKthC,IAGzB,CACA,MAAM,WAAEswB,EAAU,UAAER,EAAS,WAAES,GAAeF,GAAwB/zC,OAAOmhC,EAAI,GAAGthC,SACpF,OAAIm0C,EAAa,KAAOA,GAAc,KAClC,GAAIlqC,MAAM,4BAA4B0pC,6BAAqCQ,MAAeC,KACnF,CACH4V,QAAS,CACL//C,MAAO60B,GAAcorB,qBACrB7D,OAAQlB,EAAKthC,IAEjBkmC,QAAS,OAGV,CACHC,QAAS,KACTD,QAAS5E,EAAKthC,GAEtB,CACA,iBAAMsmC,CAAYpW,EAAaoR,EAAMnR,GACjC,IAAI2Q,EACJ,IACIA,QAAepiD,KAAK2iD,UAAUC,EAClC,CACA,MAAOl7C,GAEH,OADA,GAAIA,MAAM,yCAAyCk7C,EAAKthC,GAAG7iB,aAAciJ,GAClE,CACH8/C,QAAS,KACTC,QAAS,CACL//C,MAAO60B,GAAcsrB,oBACrB/D,OAAQlB,EAAKthC,IAGzB,CACA,MAAMwmC,EAAqBrB,GAAmBG,yBAAyBpV,EAAaC,GACpF,UACUkQ,GAAK,CAACmG,EAAmBjrD,UAAW,GAAWulD,EAAOH,KAChE,CACA,MAAOv6C,GAEH,OADA,GAAIA,MAAM,qCAAsCA,GACzC,CACH8/C,QAAS,KACTC,QAAS,CACL//C,MAAO60B,GAAcmrB,aACrB5D,OAAQlB,EAAKthC,IAGzB,CACA,MAAO,CACHkmC,QAAS5E,EAAKthC,GACdmmC,QAAS,KAEjB,CACA,oBAAMM,CAAevW,EAAaoR,GAC9B,MAAMR,QAAepiD,KAAK2iD,UAAUC,GAC9BpsB,EAAUiwB,GAAmBK,4BAA4BtV,GACzDzS,QAAY4iB,GAAK,CAACnrB,EAAQ35B,UAAW,GAAWulD,EAAQ,IAAWrX,MAAOvsC,SAAiB,GAAIA,KACrG,IAAKugC,IAAQA,EAAIrjC,OACb,MAAO,CACH+rD,QAAS,CACL//C,MAAO60B,GAAcyrB,YACrBlE,OAAQlB,EAAKthC,IAEjBkmC,QAAS,MAGjB,MAAM,WAAE5V,EAAU,UAAER,EAAS,WAAES,GAAeF,GAAwB/zC,OAAOmhC,EAAI,GAAGthC,SACpF,OAAIm0C,EAAa,KAAOA,GAAc,KAClC,GAAIlqC,MAAM,kCAAkC0pC,6BAAqCQ,MAAeC,KACzF,CACH4V,QAAS,CACL//C,MAAO60B,GAAcorB,qBACrB7D,OAAQlB,EAAKthC,IAEjBkmC,QAAS,OAGV,CACHC,QAAS,KACTD,QAAS5E,EAAKthC,GAEtB,CACA,UAAM0kC,CAAKpD,GACP,IAAIR,EACJ,IACIA,QAAepiD,KAAK2iD,UAAUC,EAClC,CACA,MAAOl7C,GAEH,OADA,GAAIA,MAAM,yCAAyCk7C,EAAKthC,GAAG7iB,aAAciJ,GAClE,CACH8/C,QAAS,KACTC,QAAS,CACL//C,MAAO60B,GAAcsrB,oBACrB/D,OAAQlB,EAAKthC,IAGzB,CACA,MAAMkV,EAAUiwB,GAAmBO,8BACnC,IAAIjoB,EACJ,IACIA,QAAY4iB,GAAK,CAACnrB,EAAQ35B,UAAW,GAAWulD,EAAQ,IAAWrX,MAAOvsC,SAAiB,GAAIA,IACnG,CACA,MAAOkJ,GAEH,OADA,GAAIA,MAAM,8BAA+BA,GAClC,CACH8/C,QAAS,KACTC,QAAS,CACL//C,MAAO60B,GAAcmrB,aACrB5D,OAAQlB,EAAKthC,IAGzB,CACA,IAAKyd,IAAQA,EAAIrjC,OACb,MAAO,CACH8rD,QAAS,KACTC,QAAS,CACL//C,MAAO60B,GAAcyrB,YACrBlE,OAAQlB,EAAKthC,KAIzB,MAAM,WAAEswB,EAAU,UAAER,EAAS,WAAES,GAAeF,GAAwB/zC,OAAOmhC,EAAI,GAAGthC,SACpF,OAAIm0C,EAAa,KAAOA,GAAc,KAClC,GAAIlqC,MAAM,uBAAuB0pC,6BAAqCQ,MAAeC,KAC9E,CACH2V,QAAS,KACTC,QAAS,CACL//C,MAAO60B,GAAcorB,qBACrB7D,OAAQlB,EAAKthC,MAIlB,CACHkmC,QAAS5E,EAAKthC,GACdmmC,QAAS,KAEjB,CACA,SAAAH,CAAUW,GACN,MAAM,WAAE9E,EAAU,OAAEf,GAAW6F,GACzB,WAAEzC,GAAerC,EACvB,GAAInR,KAAK,yBAAyBwT,EAAW/mD,cAC7C,IACIkjD,GAAKS,EAAQ,IAAWrX,MAAOvsC,IAC3B,UAAW,MAAM8T,KAAS9T,EAAQ,CAC9B,MAAMiD,EAAW+kD,GAAc5oD,OAAO0U,EAAM7U,UACtC,YAAE+zC,EAAW,YAAEM,GAAgBrwC,EACrC,IAAKqwC,EAED,YADA,GAAIpqC,MAAM,0BAGd,IAAK8pC,EAED,YADA,GAAI9pC,MAAM,gDAGR1H,KAAKmnD,sBAAsB3V,EAAaM,EAAaqR,EAAWqC,WAAW/mD,WACrF,KACDqP,MAAK,KACJ,GAAIkkC,KAAK,yBAAyB,IAClC1sC,IACA,GAAIoC,MAAM,4BAA6BpC,EAAE,GAEjD,CACA,MAAOA,GACH,GAAIoC,MAAM,yBAA0BpC,EACxC,CACJ,EC5MG,MAAM2sC,GACT2I,MACA,WAAA9tC,CAAY8tC,GACR56C,KAAK46C,MAAQA,CACjB,CACA,oBAAOsN,CAAcz+C,EAAS+nC,GAC1B,OAAO,IAAIS,GAAQ,CACfb,UAAW,KACX5a,QAAS,CACL/sB,QAASA,EACT+nC,YAAaA,GAEjB/vC,cAAU1D,GAElB,CACA,aAAOH,CAAO0U,GACV,MAAMysB,EAAM,GAAcnhC,OAAO0U,GACjC,OAAO,IAAI2/B,GAAQlT,EACvB,CACA,MAAAliC,GACI,OAAO,GAAcA,OAAOmD,KAAK46C,MACrC,CACA,SAAI3H,GACA,OAAOjzC,KAAK46C,MAAMpkB,OACtB,CACA,YAAI/0B,GACA,OAAOzB,KAAK46C,MAAMn5C,QACtB,ECzBJ,MCOM,GAAM,IAAI04C,GAAO,cAMhB,MAAMgO,WAAsBnE,GAC/BrL,aACA,WAAA7rC,CAAY6rC,EAAcyO,GACtBrZ,MARsB,kCAQAqZ,EAAOnD,WAAY,GAAKtL,GAC9C34C,KAAK24C,aAAeA,CACxB,CACA,wBAAMyP,CAAmB5+B,EAAS/f,GAC9B,IACI,IAAKA,EAAQ8mC,SAAsC,IAA3B9mC,EAAQ8mC,QAAQ70C,OAEpC,OADA,GAAIgM,MAAM,oDACH,CAAEurC,MAAO,KAAMvrC,MAAO60B,GAAc8rB,eAE/C,UCpBLtd,eAAqCvhB,EAAS/f,GACjD,MAAMlH,QAAYinB,EAAQuxB,OAAOtxC,GACjC,QAAKlH,GAIyB,CAACA,GAAQA,EAAI7G,OAfpC,SACY,EAYZ4sD,CAAmB/lD,EAC9B,CDewBgmD,CAAsB/+B,EAAS/f,GAEvC,OADA,GAAI/B,MAAM,8DACH,CAAEurC,MAAO,KAAMvrC,MAAO60B,GAAcisB,cAE/C,MAAMvN,QAAqBzxB,EAAQwxB,WAAWvxC,GAC9C,OAAKwxC,EAQE,CAAEhI,MADKhB,GAAQiW,cAAcjN,EAAczxB,EAAQgoB,aAC1C9pC,MAAO,OAPnB,GAAIA,MAAM,mDACH,CACHurC,MAAO,KACPvrC,MAAO60B,GAAcksB,eAKjC,CACA,MAAO/gD,GAEH,OADA,GAAIA,MAAM,iCAAkCA,GACrC,CACHurC,MAAO,KACPvrC,MAAO60B,GAAcmrB,aAE7B,CACJ,CACA,UAAM3lD,CAAKynB,EAAS/f,EAASm5C,GACzB,MAAM,MAAE3P,EAAOvrC,MAAOghD,SAA2B1oD,KAAKooD,mBAAmB5+B,EAAS/f,GAClF,GAAIi/C,IAAqBzV,EACrB,MAAO,CACHuU,QAAS,KACTC,QAAS,CACL//C,MAAOghD,EACP5E,OAAQlB,EAAKthC,KAIzB,IAAI8gC,EAcArjB,EAbJ,IACIqjB,QAAepiD,KAAK2iD,UAAUC,EAClC,CACA,MAAOl7C,GAEH,OADA,GAAIA,MAAM,uBAAwBA,GAC3B,CACH8/C,QAAS,KACTC,QAAS,CACL//C,MAAO60B,GAAcsrB,oBACrB/D,OAAQlB,EAAKthC,IAGzB,CAEA,IACIyd,QAAY4iB,GAAK,CAAC1O,EAAMp2C,UAAW,GAAWulD,EAAQ,IAAWrX,MAAOvsC,SAAiB,GAAIA,IACjG,CACA,MAAOvC,GAEH,OADA,GAAIyL,MAAM,yCAA0CzL,GAC7C,CACHurD,QAAS,KACTC,QAAS,CACL//C,MAAO60B,GAAcmrB,aACrB5D,OAAQlB,EAAKthC,IAGzB,CACA,MAAMhP,EAAQ,IAAIspC,GAIlB,IAAIn6C,EAHJs9B,EAAIjzB,SAAS3O,IACTmV,EAAMypC,OAAO5+C,EAAM,IAGvB,IACIsE,EAAWwwC,GAAQr0C,OAAO0U,GAAO7Q,QACrC,CACA,MAAOxF,GAEH,OADA,GAAIyL,MAAM,8BAA+BzL,GAClC,CACHurD,QAAS,KACTC,QAAS,CACL//C,MAAO60B,GAAcosB,cACrB7E,OAAQlB,EAAKthC,IAGzB,CACA,IAAK7f,EAED,OADA,GAAIiG,MAAM,6CACH,CACH8/C,QAAS,KACTC,QAAS,CACL//C,MAAO60B,GAAcyrB,YACrBlE,OAAQlB,EAAKthC,KAIzB,IDlH2B0wB,ECkHJvwC,EAASuwC,OD9G7BA,EAAKr1B,SALoB,mCCmHW,CACnC,MAAMisC,ED7GkB,CAAC5W,IACjC,MAAM6W,EAAc,CAChB,CAACtsB,GAAcusB,sBAAuBvsB,GAAcusB,qBACpD,CAACvsB,GAAcwsB,sBAAuBxsB,GAAcwsB,qBACpD,CAACxsB,GAAcysB,mBAAoBzsB,GAAcysB,mBAE/CC,EAAgBjX,EAAK1pC,cAC3B,IAAK,MAAM4gD,KAAYL,EACnB,GAAII,EAActsC,SAASusC,EAAS5gD,eAChC,OAAOugD,EAAYK,GAG3B,OAAO3sB,GAAc4sB,oBAAoB,ECiGZC,CAAqB3nD,EAASuwC,MAEnD,OADA,GAAItqC,MAAM,qCAAsCkhD,GACzC,CACHpB,QAAS,KACTC,QAAS,CACL//C,MAAOkhD,EACP9E,OAAQlB,EAAKthC,IAGzB,CD5H0B,IAAC0wB,EC6H3B,OAAKvwC,EAASswC,UAUP,CAAEyV,QAAS5E,EAAKthC,GAAImmC,QAAS,OAThC,GAAI//C,MAAM,qCAAsCjG,EAASuwC,MAClD,CACHwV,QAAS,KACTC,QAAS,CACL//C,MAAO60B,GAAcorB,qBACrB7D,OAAQlB,EAAKthC,KAK7B,EE7IJ,MAAM+nC,GAAe,CACjB9Y,QAAS,IAAI5uC,WACbiuC,aAAc,GACdzE,aAASptC,EACTyyC,eAAWzyC,EACX0yC,UAAM1yC,EACN2yC,oBAAgB3yC,EAChB4yC,eAAW5yC,GCFTurD,GAAc,IACb,MAAMnX,GACTyI,MACA,WAAA9tC,CAAY8tC,GACR56C,KAAK46C,MAAQA,CACjB,CACA,aAAOnuC,CAAOlR,GACV,MAAMi7B,EAAU,IAAI2b,GAAkB,IAC/B52C,EACH61C,UAAW,KACXiB,UAAW92C,EAAO82C,UACZrO,OAAOzoC,EAAO82C,UAAUkX,UAAYD,SACpCvrD,EACNu0C,QAAS/2C,EAAO+2C,QACVtO,OAAOzoC,EAAO+2C,QAAQiX,UAAYD,SAClCvrD,EACNw0C,cAAeh3C,EAAOg3C,eAAiB,GACvCG,gBAAiBn3C,EAAOm3C,gBAClB1O,OAAOzoC,EAAOm3C,sBACd30C,IAGV,GAAKxC,EAAOi2C,cAAgBj2C,EAAOk2C,gBAC7Bl2C,EAAOi2C,aAAej2C,EAAOk2C,cAC/B,MAAM,IAAIzzC,MAAM,2DAEpB,GAAIzC,EAAOg3C,gBACNh3C,EAAOi2C,aACJj2C,EAAOk2C,eACPl2C,EAAO82C,WACP92C,EAAO+2C,SACX,MAAM,IAAIt0C,MAAM,sEAEpB,OAAOw4B,CACX,CACA,aAAO54B,CAAO0U,GACV,MAAMysB,EAAM,GAAwBnhC,OAAO0U,GAC3C,OAAO,IAAI6/B,GAAkBpT,EACjC,CACA,MAAAliC,GACI,OAAO,GAAwBA,OAAOmD,KAAK46C,MAC/C,EAEG,MAAMjI,GACTiI,MACA,WAAA9tC,CAAY8tC,GACR56C,KAAK46C,MAAQA,CACjB,CACA,aAAOh9C,CAAO0U,GACV,MAAMysB,EAAM,GAAyBnhC,OAAO0U,GAC5C,OAAO,IAAIqgC,GAAmB5T,EAClC,CACA,MAAAliC,GACI,OAAO,GAAyBA,OAAOmD,KAAK46C,MAChD,CACA,cAAIhJ,GACA,OAAO5xC,KAAK46C,MAAMhJ,UACtB,CACA,cAAIC,GACA,OAAO7xC,KAAK46C,MAAM/I,UACtB,CACA,YAAIX,GACA,OAAOlxC,KAAK46C,MAAM1J,QACtB,CACA,oBAAIsB,GACA,OAAOxyC,KAAK46C,MAAMpI,gBACtB,EC/DJ,MAAM,GAAM,IAAI2H,GAAO,SAEhB,MAAMqP,WAAkBxF,GAC3BrL,aACA,WAAA7rC,CAAY6rC,EAAcyO,GACtBrZ,MAJkB,8BAIAqZ,EAAOnD,WAAY,GAAKtL,GAC1C34C,KAAK24C,aAAeA,CACxB,CACA,kBAAO8Q,CAAaC,EAAWviB,EAAUyb,GACrC,GAAI8G,EAAUjY,cAAchzC,aACxBjD,MAAMq/B,KAAKsM,EAASpoC,QAAQN,WAC5B,MAAM,IAAIT,MAAM,wEAEpB,IAAI2rD,EAAgBD,EAAUlX,iBAC9B,OAAa,CACT,MAAMoX,EAAoBzX,GAAkB1lC,OAAO,IAC5Ci9C,EACHlX,iBAAkBmX,IAEtB,IAAIvH,EACJ,IACIA,QAAepiD,KAAK2iD,UAAUC,EAClC,CACA,MAAOt9C,GACH,GAAIoC,MAAM,uBAAwBpC,GAClC,KACJ,CACA,MAAMy5B,QAAY4iB,GAAK,CAACiI,EAAkB/sD,UAAW,GAAWulD,EAAQ,IAAWrX,MAAOvsC,SAAiB,GAAIA,KACzG8T,EAAQ,IAAIspC,GAClB7c,EAAIjzB,SAAS3O,IACTmV,EAAMypC,OAAO5+C,EAAM,IAEvB,MAAM0sD,EAAqBlX,GAAmB/0C,OAAO0U,GACrD,IAAKu3C,EAAmBjY,YACpBiY,EAAmBjY,YAAc,IAAK,CACtC,MAAMkY,EAAe,wCAAwCD,EAAmBjY,4BAA4BiY,EAAmBhY,aAE/H,MADA,GAAInqC,MAAMoiD,GACJ,IAAI9rD,MAAM8rD,EACpB,CACA,IAAKD,EAAmB3Y,WAAa2Y,EAAmB3Y,SAASx1C,OAAQ,CACrE,GAAI0N,KAAK,yDACT,KACJ,CACA,GAAI4oC,KAAK,GAAG6X,EAAmB3Y,SAASx1C,wCACxC,MAAMquD,EAAkBF,EAAmB3Y,SAASxlC,KAAKs+C,IACrD,IAAKA,EAASvgD,QACV,OAAO3N,QAAQC,aAAQgC,GAE3B,MAAM6xC,EAAeoa,EAASvgD,QAAQmmC,aACtC,GAAIA,EAAc,CACd,MAAMnmB,EAAU0d,EAASr8B,IAAI8kC,GAC7B,GAAInmB,EACA,OAAOA,EAAQ4xB,aAAa2O,EAASxY,aAAe,IFnD7CyY,EEmDgED,EAASvgD,QFlD7F,IAAK4/C,MAAiBY,IEoDjB,CFrDT,IAAwBA,EEsDf,OAAOnuD,QAAQC,aAAQgC,EAAU,IAWrC,SATMgsD,EAEFJ,EADAD,EAAUjX,kBAENoX,EAAmB3Y,SAAS2Y,EAAmB3Y,SAASx1C,OAAS,GAC5Dw2C,YAGO2X,EAAmB3Y,SAAS,GAAGgB,YAE/C2X,EAAmB3Y,SAASx1C,ODtEf,KCuEbmuD,EAAmB3Y,SAASx1C,QACvBguD,EAAUhX,iBDzEE,IC0EjB,KAER,CACJ,EChFG,MAAMwX,WAAqBlsD,MACjC,WAAA8O,CAAYrD,GACXskC,MAAMtkC,GACNzJ,KAAK6L,KAAO,cACb,EAOM,MAAM,WAAmB7N,MAC/B,WAAA8O,CAAYrD,GACXskC,QACA/tC,KAAK6L,KAAO,aACZ7L,KAAKyJ,QAAUA,CAChB,EAMD,MAAM0gD,GAAkBL,QAA4C/rD,IAA5B2d,WAAW0uC,aAChD,IAAI,GAAWN,GACf,IAAIM,aAAaN,GAKdO,GAAmBrJ,IACxB,MAAMsJ,OAA2BvsD,IAAlBijD,EAAOsJ,OACnBH,GAAgB,+BAChBnJ,EAAOsJ,OAEV,OAAOA,aAAkBtsD,MAAQssD,EAASH,GAAgBG,EAAO,EAGnD,SAASC,GAAS/K,EAASz+C,GACzC,MAAM,aACLypD,EAAY,SACZC,EAAQ,QACRhhD,EAAO,aACPihD,EAAe,CAACj1B,WAAYk1B,eACzB5pD,EAEJ,IAAI6pD,EAEJ,MA0DMC,EA1DiB,IAAI/uD,SAAQ,CAACC,EAASC,KAC5C,GAA4B,iBAAjBwuD,GAAyD,IAA5BhuD,KAAK0G,KAAKsnD,GACjD,MAAM,IAAIl+C,UAAU,4DAA4Dk+C,OAGjF,GAAIzpD,EAAQigD,OAAQ,CACnB,MAAM,OAACA,GAAUjgD,EACbigD,EAAO8J,SACV9uD,EAAOquD,GAAiBrJ,IAGzBA,EAAOG,iBAAiB,SAAS,KAChCnlD,EAAOquD,GAAiBrJ,GAAQ,GAElC,CAEA,GAAIwJ,IAAiB9qD,OAAOqrD,kBAE3B,YADAvL,EAAQ1xC,KAAK/R,EAASC,GAKvB,MAAMgvD,EAAe,IAAId,GAEzBU,EAAQF,EAAaj1B,WAAWnvB,UAAKvI,GAAW,KAC/C,GAAI0sD,EACH,IACC1uD,EAAQ0uD,IACT,CAAE,MAAO/iD,GACR1L,EAAO0L,EACR,KAK6B,mBAAnB83C,EAAQ0B,QAClB1B,EAAQ0B,UAGO,IAAZz3C,EACH1N,IACU0N,aAAmBzL,MAC7BhC,EAAOyN,IAEPuhD,EAAavhD,QAAUA,GAAW,2BAA2B+gD,iBAC7DxuD,EAAOgvD,GACR,GACER,GAEH,WACC,IACCzuD,QAAcyjD,EACf,CAAE,MAAO93C,GACR1L,EAAO0L,EACR,CACA,EAND,EAMI,IAGoCujD,SAAQ,KAChDJ,EAAkBj6C,OAAO,IAQ1B,OALAi6C,EAAkBj6C,MAAQ,KACzB85C,EAAaC,aAAarkD,UAAKvI,EAAW6sD,GAC1CA,OAAQ7sD,CAAS,EAGX8sD,CACR,CCjHA,MAAMK,GAAmBh8C,IACxB,MAAMD,EAAcC,EAAQiyC,kBAAoBjyC,EAAQ/O,IAAM+O,EAAQD,YAChEoB,EAAiBnB,EAAQmyC,qBAAuBnyC,EAAQ7O,KAAO6O,EAAQmB,eAE7E,IAAKpB,IAAgBoB,EACpB,MAAM,IAAI/D,UAAU,6BAGrB,MAAO,CACN2C,YAAaA,EAAYnL,KAAKoL,GAC9BmB,eAAgBA,EAAevM,KAAKoL,GACpC,EAsFK,SAASi8C,GAAOj8C,EAAST,EAAO1N,GACf,mBAAZA,IACVA,EAAU,CAAC2b,OAAQ3b,IASpB,MAAMqqD,EA9FA,SAAwBl8C,EAAST,EAAO1N,GAC9C,IAAImgD,EACJ,MAAMmK,EAAc,IAAIvvD,SAAQ,CAACC,EAASC,KAQzC,MAPA+E,EAAU,CACTuqD,gBAAiB,CAAC,SAClBC,WAAW,EACXC,oBAAoB,KACjBzqD,IAGUwR,OAAS,IAAMxR,EAAQwR,QAAU7S,OAAOqrD,oBAAqBrrD,OAAOge,UAAU3c,EAAQwR,OACnG,MAAM,IAAIjG,UAAU,mDAGrBvL,EAAQigD,QAAQC,iBAGhB,MAAMxxC,EAAS,CAAChB,GAAOg9C,OAEjBC,EAAQ,IACR,YAACz8C,EAAW,eAAEoB,GAAkB66C,GAAiBh8C,GAEjDy8C,EAAS,IAAIC,KAClB,MAAMnsD,EAAQsB,EAAQwqD,UAAYK,EAAaA,EAAW,GAGtD7qD,EAAQ2b,SAAW3b,EAAQ2b,OAAOjd,KAItCisD,EAAMpuD,KAAKmC,GAEPsB,EAAQwR,QAAUm5C,EAAMhwD,SAC3BwlD,IACAnlD,EAAQ2vD,IACT,EAGKG,EAAgBnkD,IACrBw5C,IACAllD,EAAO0L,EAAM,EAGdw5C,EAAS,KACR,IAAK,MAAMzyC,KAASgB,EACnBY,EAAe5B,EAAOk9C,GAGvB,IAAK,MAAMG,KAAkB/qD,EAAQuqD,gBACpCj7C,EAAey7C,EAAgBD,EAChC,EAGD,IAAK,MAAMp9C,KAASgB,EACnBR,EAAYR,EAAOk9C,GAGpB,IAAK,MAAMG,KAAkB/qD,EAAQuqD,gBACpCr8C,EAAY68C,EAAgBD,GAGzB9qD,EAAQigD,QACXjgD,EAAQigD,OAAOG,iBAAiB,SAAS,KACxC0K,EAAc9qD,EAAQigD,OAAOsJ,OAAO,GAClC,CAACt7C,MAAM,IAGPjO,EAAQyqD,oBACXzvD,EAAQ2vD,EACT,IAKD,GAFAL,EAAYnK,OAASA,EAEU,iBAApBngD,EAAQgrD,QAAsB,CACxC,MAAMA,EAAUxB,GAASc,EAAa,CAACb,aAAczpD,EAAQgrD,UAE7D,OADAA,EAAQ7K,OAASA,EACV6K,CACR,CAEA,OAAOV,CACR,CAasBW,CAAe98C,EAAST,EAN7C1N,EAAU,IACNA,EACHwR,MAAO,EACPi5C,oBAAoB,IAIfhM,EAAU4L,EAAat9C,MAAK+G,GAASA,EAAM,KAGjD,OAFA2qC,EAAQ0B,OAASkK,EAAalK,OAEvB1B,CACR,CChHA,MAAM,GAAM,IAAIrF,GAAO,wBAqBhBpP,eAAekhB,GAAkBC,EAAMtI,EAAWuI,GAErD,GADAvI,EAAYA,GAoGhB,SAA6BsI,GACzB,MAAMtI,EAAY,GAalB,OAZIsI,EAAKE,OACLxI,EAAUtmD,KAAKi6C,GAAU8U,OAEzBH,EAAKxvC,QACLknC,EAAUtmD,KAAKi6C,GAAU+U,QAEzBJ,EAAKK,OACL3I,EAAUtmD,KAAKi6C,GAAUiV,OAEzBN,EAAKO,WACL7I,EAAUtmD,KAAKi6C,GAAUmV,WAEtB9I,CACX,CAnH6B+I,CAAoBT,IACxCA,EAAKU,YACN,OAAO9wD,QAAQE,OAAO,4BAC1B,MAAM6wD,EAAW,GACjB,GAAIjJ,EAAUjnC,SAAS46B,GAAU8U,OAAQ,CACrC,IAAKH,EAAKE,MACN,MAAM,IAAIpuD,MAAM,oDACpB6uD,EAASvvD,KA+EjBytC,eAA0CmhB,GACtC,IAAI1H,EAAQ0H,EAAKY,eACjB,MAAMnU,EAAeuT,EAAKvT,aAC1B,IAAK,MAAM5H,KAAS4H,EAChB,KAAuB,GAAhB6L,EAAM9oD,cACHyvD,GAAOe,EAAKa,UAAW,uBAC7BvI,EAAQ0H,EAAKY,aAAa/b,EAGtC,CAxFsBic,CAA2Bd,EAAKE,OAClD,CACA,GAAIxI,EAAUjnC,SAAS46B,GAAUiV,OAAQ,CACrC,IAAKN,EAAKK,MACN,MAAM,IAAIvuD,MAAM,oDACpB6uD,EAASvvD,KAAK2vD,GAAqBf,EAAKK,MAAM9G,SAAUyG,EAAK9E,OAAO8F,SAASvH,UACjF,CACA,GAAI/B,EAAUjnC,SAAS46B,GAAUmV,WAAY,CACzC,IAAKR,EAAKO,UACN,MAAM,IAAIzuD,MAAM,wDACpB6uD,EAASvvD,KAAK2vD,GAAqBf,EAAKO,UAAUhH,SAAUyG,EAAK9E,OAAO8F,SAASvH,UACrF,CACA,GAAI/B,EAAUjnC,SAAS46B,GAAU+U,QAAS,CACtC,IAAKJ,EAAKxvC,OACN,MAAM,IAAI1e,MAAM,qDACpB6uD,EAASvvD,KAAK2vD,GAAqBf,EAAKxvC,OAAO+oC,SAAUyG,EAAK9E,OAAO8F,SAASvH,UAClF,CACIwG,QAyERphB,eAA+ByU,EAAS2M,EAAWgB,SACzCrxD,QAAQslD,KAAK,CAAC5B,EAAS4N,GAAajB,EAzEkB,yCA0EhE,CA1EckB,CAAgBvxD,QAAQ2lD,IAAIoL,GAAWV,SAGvCrwD,QAAQ2lD,IAAIoL,EAE1B,CAMA9hB,eAAekiB,GAAqBxH,EAAU6H,GAC1C,MAAMloB,EAAQqgB,EAASlD,WACjBiC,QAAciB,EAASf,iBAC7B,GAAIF,EAAM9oD,OAAQ,CACd,IAAK4xD,EAED,YADA,GAAItb,KAAK,GAAG5M,iBAAsBof,EAAM,GAAGljC,GAAG7iB,YAIlD,IAEI,kBADM3C,QAAQyxD,IAAI/I,EAAM94C,KAAKk3C,GAAS0K,EAAgBE,0BAA0B5K,EAAKthC,MAEzF,CACA,MAAOhc,GACY,gCAAXA,EAAE+G,MACF,GAAI3E,MAAM,8FAA8FpC,KAC5G,GAAIoC,MAAM,6CAA6CpC,IAC3D,CACJ,CACA,GAAI0sC,KAAK,eAAe5M,gBAElB,IAAItpC,SAASC,IACf,MAAMk5B,EAAM70B,IACJA,EAAIujD,QAAQC,WAAWjnC,SAASyoB,KAC5BkoB,EACAA,EACKE,0BAA0BptD,EAAIujD,OAAOG,QACrCh2C,MAAK,KACN23C,EAAStB,0BAA0B,gBAAiBlvB,GACpDl5B,GAAS,IAER8R,OAAOvI,IACO,gCAAXA,EAAE+G,MACF,GAAI3E,MAAM,8FAA8FpC,KAC5G,GAAIoC,MAAM,6CAA6CpC,IAAI,KAI/DmgD,EAAStB,0BAA0B,gBAAiBlvB,GACpDl5B,KAER,EAEJ0pD,EAASvB,uBAAuB,gBAAiBjvB,EAAG,GAE5D,CAeA,MAAMm4B,GAAe,CAACjjD,EAAIgjD,IAAiB,IAAIrxD,SAAQ,CAAC2xD,EAAUzxD,IAAWy5B,YAAW,IAAMz5B,EAAOmxD,IAAehjD,KCpH7G,MAAMujD,WAA0BC,YACnC,GAAa,IAAIliB,IACjB,WAAA3+B,GACIihC,OAIJ,CACA,aAAAh+B,CAAc7H,GACV,MAAM5H,EAAYN,MAAK,EAAW8K,IAAI5C,GACtC,OAAiB,MAAb5H,EACO,EAEJA,EAAU5E,MACrB,CACA,gBAAAylD,CAAiBj5C,EAAMiH,EAAUpO,GAC7BgtC,MAAMoT,iBAAiBj5C,EAAMiH,EAAUpO,GACvC,IAAI07C,EAAOz8C,MAAK,EAAW8K,IAAI5C,GACnB,MAARu0C,IACAA,EAAO,GACPz8C,MAAK,EAAW+K,IAAI7C,EAAMu0C,IAE9BA,EAAKn/C,KAAK,CACN0D,SAAUmO,EACVH,OAAmB,IAAZjO,IAAgC,IAAZA,GAAqBA,GAASiO,QAAS,GAE1E,CACA,mBAAAqyC,CAAoBn5C,EAAMiH,EAAUpO,GAChCgtC,MAAMsT,oBAAoBn5C,EAAKzJ,WAAY0Q,GAAY,KAAMpO,GAC7D,IAAI07C,EAAOz8C,MAAK,EAAW8K,IAAI5C,GACnB,MAARu0C,IAGJA,EAAOA,EAAK//B,QAAO,EAAG1b,cAAeA,IAAamO,IAClDnP,MAAK,EAAW+K,IAAI7C,EAAMu0C,GAC9B,CACA,aAAAmR,CAAcn/C,GACV,MAAMN,EAAS4/B,MAAM6f,cAAcn/C,GACnC,IAAIguC,EAAOz8C,MAAK,EAAW8K,IAAI2D,EAAMvG,MACrC,OAAY,MAARu0C,IAGJA,EAAOA,EAAK//B,QAAO,EAAG1N,WAAYA,IAClChP,MAAK,EAAW+K,IAAI0D,EAAMvG,KAAMu0C,IAHrBtuC,CAKf,CACA,iBAAA0/C,CAAkB3lD,EAAMy7C,EAAS,CAAC,GAC9B,OAAO3jD,KAAK4tD,cAAc,IAAI,GAAY1lD,EAAMy7C,GACpD,EAEG,MAAM,GAAcjoC,WAAWoyC,YCnDhC,GAAM,IAAI3T,GAAO,cAChB,MAAM4T,GACT3B,MACAhF,OACArmD,QACAitD,oBAAsB,IAAIviB,IAC1BwiB,qBAAuB,IAAIxiB,IAC3B,WAAA3+B,EAAY,QAAE/L,EAAO,MAAEqrD,EAAK,OAAEhF,IAC1BpnD,KAAKe,QAAUA,EACff,KAAKosD,MAAQA,EACbpsD,KAAKonD,OAASA,CAClB,CACA,KAAArqD,CAAM+mD,GAEF9jD,KAAKyN,KAAKq2C,GACV,MAAQoK,cAAeC,EAAgBC,eAAgBC,GAAoBruD,KAAKe,QAC1E8hD,EAAYiB,EAAOrlD,WAGzB,GAAuB,IAAnB0vD,EAAsB,CACtB,MAAMG,EAAWC,aAAY,KACpB,WACD,IAAIvI,EACJ,IAGI,IACIA,QAAahmD,KAAKonD,OAAO8F,SAASlH,KAAKA,KAAKlC,GAC5C,GAAI9R,KAAK,mBAAmB6Q,KAAcmD,EAC9C,CACA,MAAOt+C,GAIH,YAHA,GAAIA,MAAM,yBAAyBm7C,uDACdsL,6BAGzB,CACA,UACUnuD,KAAKonD,OAAO9C,UAAUhoC,MAAMwnC,EAAQ,CACtC6B,SAAU,CACNK,KAAM,GAAYA,EAAKvnD,cAGnC,CACA,MAAO6G,GACH,GAAIoC,MAAM,wBAAyBpC,EACvC,CACJ,CACA,MAAOA,GACH,GAAIoC,MAAM,gBAAgBm7C,KAAcv9C,EAC5C,CACH,EA7BI,EA6BD,GACY,IAAjB6oD,GACHnuD,KAAKguD,oBAAoBjjD,IAAI83C,EAAWyL,EAC5C,CACA,MAAMlC,EAAQpsD,KAAKosD,MACnB,GAAIA,GAA6B,IAApBiC,EAAuB,CAChC,MAAMG,EAAYxuD,KAAKyuD,mBAAmBrC,EAAOiC,EAAiBvK,EAAOrlD,YACzEuB,KAAKiuD,qBAAqBljD,IAAI+4C,EAAQ0K,EAC1C,CACJ,CACA,IAAA/gD,CAAKq2C,GACD,MAAMjB,EAAYiB,EAAOrlD,WACrBuB,KAAKguD,oBAAoBr/C,IAAIk0C,KAC7B6L,cAAc1uD,KAAKguD,oBAAoBljD,IAAI+3C,IAC3C7iD,KAAKguD,oBAAoBhL,OAAOH,IAEhC7iD,KAAKiuD,qBAAqBt/C,IAAIm1C,KAC9B9jD,KAAKiuD,qBAAqBnjD,IAAIg5C,IAASp4C,IAAIgjD,eAC3C1uD,KAAKiuD,qBAAqBjL,OAAOc,GAEzC,CACA,OAAA6K,GACI,IAAK,MAAM/D,IAAS,IACb9rD,OAAO2jB,OAAOziB,KAAKguD,wBACnBlvD,OAAO2jB,OAAOziB,KAAKiuD,uBAEtBS,cAAc9D,GAElB5qD,KAAKguD,oBAAoBp9C,QACzB5Q,KAAKiuD,qBAAqBr9C,OAC9B,CACA,gBAAAg+C,GACI,OAAQ5uD,KAAKguD,oBAAoB9nD,KAAO,GAAKlG,KAAKiuD,qBAAqB/nD,KAAO,CAClF,CACA,kBAAAuoD,CAAmBrC,EAAOiC,EAAiBxL,GAEvC,MAAM2L,EAAY,GAClB,IAAK,MAAMzd,KAASqb,EAAMzT,aAAc,CAEpC,IADkByT,EAAMU,aAAa/b,GACtBp0B,SAASkmC,GACpB,SACJ,MAAMr5B,EAAU2xB,GAAc,CAC1B1B,qBAAsBf,GAA6B3H,GACnDnB,aA9FqB,0BA+FrBe,WAAW,IAET2d,EAAWC,aAAY,KACzB,GAAIvc,KAAK,mCACToa,EACKrqD,KAAKynB,EAAS,CAAE+mB,QAAS,IAAI5uC,WAAW,CAAC,MACzCkM,OAAOvI,GAAM,GAAIoC,MAAM,4BAA6BpC,IAAG,GAC3C,IAAlB+oD,GACHG,EAAUlxD,KAAKgxD,EACnB,CACA,OAAOE,CACX,ECvGJ,MAAM,GAAM,IAAIrU,GAAO,sBAIhB,MAAM0U,WAA0BnB,GACnCoB,uBACAC,iBAAmB,IAAItjB,IACvBujB,iBACAjuD,QACAqmD,OACA6H,oBAAsB,IAAIxjB,IAC1ByjB,kBAAoB,IAAIzjB,IACxB0jB,+BAAiC,EACjCC,qBAAuB,GACvBC,uBAAwB,EACxB,WAAAC,GACI,QAAI5zC,YAAYtT,YAAcsT,YAAYtT,WAAWmnD,SAG9CvvD,KAAKqvD,qBAChB,CACA,aAAO5iD,CAAOq3C,EAAQsD,EAAQoI,EAAkB7W,EAAcyT,EAAOrrD,GACjE,IAAI2yC,EAAWmb,GAAkBY,UAAU3kD,IAAIg5C,GAK/C,OAJKpQ,IACDA,EAAW,IAAImb,GAAkBzH,EAAQoI,EAAkB7W,EAAcyT,EAAOrrD,GAChF8tD,GAAkBY,UAAU1kD,IAAI+4C,EAAQpQ,IAErCA,CACX,CACA,IAAAjmC,GACIzN,KAAKgvD,iBAAiBL,UACtB3uD,KAAKonD,OAAO/F,oBAAoB,eAAgBrhD,KAAK0vD,gBAAgB,iBACrE1vD,KAAKonD,OAAO/F,oBAAoB,kBAAmBrhD,KAAK0vD,gBAAgB,oBACxE1vD,KAAKonD,OAAO/F,oBAAoB,iBAAkBrhD,KAAK0vD,gBAAgB,mBACvE1vD,KAAK2vD,2BACT,CACA,oBAAMC,CAAe9L,GACjB,IACI9jD,KAAKgvD,iBAAiBvhD,KAAKq2C,SACrB9jD,KAAKonD,OAAOyI,OAAO/L,GACzB,GAAI9R,KAAK,gCAAgC8R,EAAOrlD,aACpD,CACA,MAAOiJ,GACH,GAAIA,MAAM,uCAAuCo8C,EAAOrlD,gBAAgBiJ,IAC5E,CACJ,CACA,yBAAMooD,GACF,MAAMC,QAAwB/vD,KAAKonD,OAAO9C,UAAU7C,MAC9CuO,EAAiBhwD,KAAKonD,OACvB5E,iBACA92C,KAAKukD,GAASA,EAAKzK,aAClB0K,EAA6B,GAC7BC,EAAgC,GAChCC,EAAyB,GACzBC,EAA4B,GAC5BC,EAA+B,GAC/BC,EAAwB,GAC9B,IAAK,MAAM3N,KAAQmN,EAAiB,CAChC,MAAMhL,QAAa/kD,KAAKwwD,mBAAmB5N,EAAKthC,IAC5CyjC,EAAKpoC,SAAS66B,GAAKwN,WACnBkL,EAA2B5yD,KAAKslD,GAE3BmC,EAAKpoC,SAAS66B,GAAKiZ,eACxBN,EAA8B7yD,KAAKslD,GAE9BmC,EAAKpoC,SAAS66B,GAAKkZ,QACxBN,EAAuB9yD,KAAKslD,EAEpC,CACA,IAAK,MAAMkB,KAAUkM,EAAgB,CACjC,MAAMpN,QAAa5iD,KAAKonD,OAAO9C,UAAUx5C,IAAIg5C,GACvCiB,QAAa/kD,KAAKwwD,mBAAmB1M,GACvCiB,EAAKpoC,SAAS66B,GAAKwN,WACnBqL,EAA0B/yD,KAAKslD,GAE1BmC,EAAKpoC,SAAS66B,GAAKiZ,eACxBH,EAA6BhzD,KAAKslD,GAE7BmC,EAAKpoC,SAAS66B,GAAKkZ,QACxBH,EAAsBjzD,KAAKslD,EAEnC,CACA,MAAO,CACH+N,WAAY,CACR,CAACnZ,GAAKwN,WAAYkL,EAClB,CAAC1Y,GAAKiZ,eAAgBN,EACtB,CAAC3Y,GAAKkZ,OAAQN,GAElBQ,UAAW,CACP,CAACpZ,GAAKwN,WAAYqL,EAClB,CAAC7Y,GAAKiZ,eAAgBH,EACtB,CAAC9Y,GAAKkZ,OAAQH,GAG1B,CACA,WAAAzjD,CAAYs6C,EAAQoI,EAAkBV,EAAwB1C,EAAOrrD,GACjEgtC,QACA/tC,KAAK8uD,uBAAyBA,EAC9B9uD,KAAKonD,OAASA,EACdpnD,KAAK8uD,uBAAyBA,EAC9B9uD,KAAKe,QAAU,CACX8vD,uBAnGsC,EAoGtCC,yBArGuC,EAsGvCC,iBApG8B,KAqG3BhwD,GAEPf,KAAKgvD,iBAAmB,IAAIjB,GAAiB,CACzC3B,QACAhF,SACArmD,QAASyuD,IAEbxvD,KAAKgxD,sBACAljD,MAAK,IAAM,GAAIkkC,KAAK,uCACpBnkC,OAAOnG,GAAU,GAAIA,MAAM,yCAA0CA,KAI1E1H,KAAKixD,qBAAqBpjD,OAAOnG,GAAU,GAAIA,MAAM,kDAAmDA,IAC5G,CACA,wBAAMupD,GACF,MAAMne,QAAkB9yC,KAAKonD,OAAO9C,UAAU7C,MACxCyP,EAAe,GACrB,IAAK,MAAMC,KAAYre,EACf9yC,KAAKonD,OAAO5E,iBAAiBj1B,MAAM1vB,GAAMA,EAAE2nD,aAAe2L,EAAS7vC,MAEvE4vC,EAAa5zD,KAAK0C,KAAKoxD,YAAYD,EAAS7vC,KAEhD,UACUxlB,QAAQ2lD,IAAIyP,EACtB,CACA,MAAOxpD,GACH,GAAIA,MAAM,kDAAmDA,EACjE,CACJ,CACA,yBAAMspD,GACFhxD,KAAKqxD,6BACLrxD,KAAKsxD,8BACLtxD,KAAKuxD,iCACLvxD,KAAKwxD,4BACT,CACA,cAAMC,CAAS3N,GACX9jD,KAAKmvD,gCAAkC,EACvC,IAAIuC,EAAc,EAClB,KAAOA,EAAc1xD,KAAKe,QAAQ8vD,wBAC9B,IACI,GAAI7e,KAAK,gBAAgB8R,EAAOrlD,yBAAyBizD,EAAc,WACjE1xD,KAAKonD,OAAOuK,KAAK7N,GACvB,MAAMiB,QAAa/kD,KAAKwwD,mBAAmB1M,GAG3C9jD,KAAKonD,OAAO5E,eAAesB,GAAQh4C,SAASmkD,IACxCA,EAAKlL,KAAOvpD,MAAMq/B,KAAK,IAAI0d,IAAI,IAAI0X,EAAKlL,QAASA,IAAO,IAI5D/kD,KAAKivD,oBAAoBlkD,IAAI+4C,EAAOrlD,YAAa,GAEjDuB,KAAKgvD,iBAAiBjyD,MAAM+mD,GAC5B,KACJ,CACA,MAAOp8C,GACCA,aAAiBkqD,eAEjB,GAAIlqD,MAAM,sBAAsBo8C,EAAOrlD,gBAAgBiJ,EAAMmqD,UAI7D,GAAInqD,MAAM,sBAAsBo8C,EAAOrlD,gBAAgBiJ,EAAM+B,WAEjEzJ,KAAKkvD,kBAAkBnkD,IAAI+4C,EAAOrlD,WAAYiJ,GAC9CgqD,IACA1xD,KAAKivD,oBAAoBlkD,IAAI+4C,EAAOrlD,WAAYizD,EACpD,CAMJ,GAHA1xD,KAAKmvD,iCACLnvD,KAAK8xD,mBAEDJ,IAAgB1xD,KAAKe,QAAQ8vD,uBAC7B,IACI,MAAMnpD,EAAQ1H,KAAKkvD,kBAAkBpkD,IAAIg5C,EAAOrlD,YAChD,GAAIiJ,EAAO,CACP,IAAIoiD,EACApiD,aAAiBkqD,eACZlqD,EAAMmqD,OAGsB,IAAxBnqD,EAAMmqD,OAAOn2D,OAClB,GAAI0N,KAAK,4CAGT0gD,EAAelqD,KAAKC,UAAU6H,EAAMmqD,OAAO,IAN3C,GAAIzoD,KAAK,4CAUb0gD,EAAepiD,EAAM+B,QAEzB,GAAIuoC,KAAK,4BAA4B8R,EAAOrlD,uCAAuCqrD,IACvF,CACA9pD,KAAKkvD,kBAAkBlM,OAAOc,EAAOrlD,kBAC/BuB,KAAKonD,OAAO9C,UAAUtB,OAAOc,SAE7B9jD,KAAK+xD,qBACf,CACA,MAAOrqD,GACH,MAAM,IAAI1J,MAAM,kCAAkC8lD,EAAOrlD,gCAAgCiJ,IAC7F,CAER,CACA,yBAAMqqD,GACF,GAAI/xD,KAAKonD,OAAO5E,iBAAiB9mD,OAAS,EACtC,OACJ,UAAWsE,KAAKonD,OAAO9C,UAAU7C,OAAO/lD,OAAS,EAC7C,OACJ,GAAIs2C,KAAK,wCACT,MAAMggB,EAAelzD,OAAO2jB,OAAOziB,KAAKonD,OAAOnD,WAAWA,YAAY12B,MAAM/jB,MACpEA,IAAKA,EAAE/K,WACA+K,EAAE/K,WAAWke,SAASg7B,MAIhCqa,SAECA,EAAaC,WACvB,CACA,gBAAAH,GACI,GAAI9xD,KAAKovD,qBAAqB1zD,OAAS,GACnCsE,KAAKmvD,+BAAiCnvD,KAAKe,QAAQgwD,iBAAkB,CACrE,MAAMjN,EAAS9jD,KAAKovD,qBAAqBvpD,QACzC,IAAKi+C,EACD,OACJ9jD,KAAKoxD,YAAYtN,GAAQj2C,OAAOnG,IAC5B,GAAIA,MAAMA,EAAM,GAExB,CACJ,CACA,0BAAA2pD,GACIrxD,KAAKonD,OAAOjG,iBAAiB,iBAAkBnhD,KAAK0vD,gBAAgB,kBACxE,CACA,2BAAA4B,GACItxD,KAAKonD,OAAOjG,iBAAiB,eAAgBnhD,KAAK0vD,gBAAgB,gBACtE,CACA,8BAAA6B,GAaIvxD,KAAKonD,OAAOjG,iBAAiB,kBAAmBnhD,KAAK0vD,gBAAgB,mBACzE,CACA,iBAAM0B,CAAYtN,SACF9jD,KAAKkyD,eAAepO,KAE5B9jD,KAAKmvD,gCAAkCnvD,KAAKe,QAAQgwD,iBACpD/wD,KAAKovD,qBAAqB9xD,KAAKwmD,SAG7B9jD,KAAKyxD,SAAS3N,GACxB,CACA4L,gBAAkB,CACd,iBAAmBtvD,IACV,WACD,MAAQkhB,GAAIwiC,GAAW1jD,EAAIujD,aACrB3jD,KAAKmyD,uBAAuBrO,GAClC,UACU9jD,KAAKoxD,YAAYtN,EAC3B,CACA,MAAOp8C,GACH,GAAIA,MAAM,sBAAsBo8C,EAAOrlD,gBAAgBiJ,IAC3D,CACH,EATI,EASD,EAER,eAAiBtH,IACR,WACD,GAAI4xC,KAAK,qBAAqB5xC,EAAIujD,OAAOllD,cACzC,MAAMqlD,EAAS1jD,EAAIujD,OACnB3jD,KAAKgvD,iBAAiBjyD,MAAM+mD,UACD9jD,KAAKwwD,mBAAmB1M,IAASnnC,SAAS66B,GAAKwN,WAEzChlD,KAAKonD,OAC7B5E,iBACA9lC,QAAQuzC,GAASA,EAAKlL,KAAKpoC,SAAS66B,GAAKwN,aAErBtpD,OAASsE,KAAKe,QAAQ+vD,+BACrC9wD,KAAK4vD,eAAe9L,GAG1B9jD,KAAK4tD,cAAc,IAAI,GAAYnW,GAAwB2a,uBAAwB,CAC/EzO,OAAQG,KAKhB9jD,KAAK4tD,cAAc,IAAI,GAAYnW,GAAwB4a,2BAA4B,CACnF1O,OAAQG,KAGhB9jD,KAAKsyD,wBACR,EAzBI,EAyBD,EAER,kBAAoBlyD,IACX,WACDJ,KAAKgvD,iBAAiBvhD,KAAKrN,EAAIujD,QAC/B3jD,KAAKuyD,2BACR,EAHI,EAGD,EAER,kBAAmB,KACfvyD,KAAKwyD,6BAA6B,GAW1C,oBAAMN,CAAepO,GAEjB,GADoB9jD,KAAKonD,OAAO5E,eAAesB,GAAQpoD,OAAS,EAG5D,OADA,GAAI0N,KAAK,6BAA6B06C,EAAOrlD,6BACtC,EAGX,UAD0BuB,KAAKyyD,sBAAsB3O,GACnC,CACd,MAAM1L,QAAkBp4C,KAAK0yD,iBAAiB5O,EAAQ9jD,KAAKonD,OAAO9C,WAGlE,OAFA,GAAIl7C,KAAK,mBAAmB06C,EAAOrlD,6BAA6B25C,yDAAiEp4C,KAAK8uD,uDAE/H,CACX,CAEA,aAD0C9uD,KAAK2yD,qCAAqC7O,IAK9D9jD,KAAKivD,oBAAoBtgD,IAAIm1C,EAAOrlD,cAEtD,GAAI2K,KAAK,QAAQ06C,EAAOrlD,gHACjB,IANP,GAAI2K,KAAK,QAAQ06C,EAAOrlD,uEACjB,EAQf,CAMA,0CAAMk0D,CAAqC7O,GAGvC,cAFuB9jD,KAAKwwD,mBAAmB1M,IAClBC,MAAM6O,GAAYA,IAAYpb,GAAKwN,aAI5BhlD,KAAKonD,OACpC5E,iBACA9lC,QAAQuzC,GACFA,EAAKlL,KAAKx3B,MAAM1hB,GAASA,IAAS2rC,GAAKwN,cAC/CtpD,OACkCsE,KAAKe,QAAQ+vD,wBACtD,CACA,4BAAMqB,CAAuBrO,GACzB,MAAM+O,SAAqB7yD,KAAKwwD,mBAAmB1M,IAASnnC,SAAS66B,GAAKwN,WAC1EhlD,KAAK4tD,cAAc,IAAI,GAAYiF,EAC7Bpb,GAAwBqb,yBACxBrb,GAAwBsb,6BAA8B,CACxDpP,OAAQG,IAEhB,CAIA,wBAAM0M,CAAmB1M,GACrB,IACI,MAAMlB,QAAa5iD,KAAKonD,OAAO9C,UAAUx5C,IAAIg5C,GAC7C,OAAOtoD,MAAMq/B,KAAK+nB,EAAKmC,KAAKhmD,OAChC,CACA,MAAO2I,GAEH,OADA,GAAIA,MAAM,sBAAsBo8C,aAAkBp8C,KAC3C,EACX,CACJ,CACA,2BAAM+qD,CAAsB3O,GACxB,MAAM1L,QAAkBp4C,KAAK0yD,iBAAiB5O,EAAQ9jD,KAAKonD,OAAO9C,WAElE,OAAKlM,GAEgBE,GAAwBF,GACN2L,MAAMhT,GAAU/wC,KAAK8uD,uBAAuBnyC,SAASo0B,IAEhG,CACA,sBAAM2hB,CAAiB5O,EAAQQ,GAC3B,MACM0O,SADa1O,EAAUx5C,IAAIg5C,IACL6B,SAAS76C,IAAI,aACzC,GAAKkoD,EAEL,OAAOtZ,GAAiBsZ,EAC5B,CACA,0BAAAxB,GACI,IACI91C,WAAWylC,iBAAiB,SAAUnhD,KAAK0vD,gBAAgB,oBAC3Dh0C,WAAWylC,iBAAiB,UAAWnhD,KAAK0vD,gBAAgB,mBAChE,CACA,MAAOzzD,GACH,GAAIyL,MAAM,qCAAqCzL,IACnD,CACJ,CACA,yBAAA0zD,GACI,IACIj0C,WAAW2lC,oBAAoB,SAAUrhD,KAAK0vD,gBAAgB,oBAC9Dh0C,WAAW2lC,oBAAoB,UAAWrhD,KAAK0vD,gBAAgB,mBACnE,CACA,MAAOzzD,GACH,GAAIyL,MAAM,oCAAoCzL,IAClD,CACJ,CACA,sBAAAq2D,GACStyD,KAAKqvD,wBACNrvD,KAAKqvD,uBAAwB,EAC7BrvD,KAAKwyD,8BAEb,CACA,yBAAAD,GACQvyD,KAAKqvD,uBACmC,IAAxCrvD,KAAKonD,OAAO5E,iBAAiB9mD,SAC7BsE,KAAKqvD,uBAAwB,EAC7BrvD,KAAKwyD,8BAEb,CACA,2BAAAA,GACIxyD,KAAK4tD,cAAc,IAAI,GAAYlW,GAAuBub,kBAAmB,CACzEtP,OAAQ3jD,KAAKsvD,gBAErB,EC7bJ,MAAM4D,GACFnE,gBACAoE,OACA,WAAArmD,GACI9M,KAAKmzD,OAAS,CACVC,cAAetb,GAAaub,UAC5BC,iBAAkB,IAAI7nB,IAE9B,CACA,kBAAO8nB,GAIH,OAHKL,GAAcxf,WACfwf,GAAcxf,SAAW,IAAIwf,IAE1BA,GAAcxf,QACzB,CACA,eAAA8f,GACI,OAAOxzD,KAAKmzD,OAAOC,aACvB,CACA,iBAAAK,CAAkBhO,GACd,OAAOzlD,KAAKmzD,OAAOG,iBAAiBxoD,IAAI26C,EAC5C,CACA,oBAAAiO,CAAqBnR,EAAYmC,GAC7B,MAAMe,EAAWzlD,KAAK2zD,sBAAsBpR,GAC5C,IAAI/gD,EAASs2C,GAAaub,UACJ,GAAlB3O,EACAljD,EAASs2C,GAAa8b,iBAEjBlP,GAAkB,IACvBljD,EAASs2C,GAAa+b,qBAE1B7zD,KAAKmzD,OAAOG,iBAAiBvoD,IAAI06C,EAAU,CACvC55C,KAAM45C,EACNjkD,OAAQA,EACRsyD,WAAY,IAAI5pD,OAEpBlK,KAAK+zD,qBACT,CACA,qBAAAJ,CAAsBpR,GAClB,IAAI12C,EACJ,GAAI02C,EAAW5lC,SAAS,UACpB9Q,EAAO0rC,GAAU+U,YAEhB,GAAI/J,EAAW5lC,SAAS,aACzB9Q,EAAO0rC,GAAUmV,cAEhB,KAAInK,EAAW5lC,SAAS,SAIzB,MAAM,IAAI3e,MAAM,qBAAqBukD,KAHrC12C,EAAO0rC,GAAUiV,KAIrB,CACA,OAAO3gD,CACX,CACA,mBAAAkoD,GACI,MACMC,EADoB,CAACzc,GAAUmV,UAAWnV,GAAU+U,QACvB5gD,KAAKrP,GAAM2D,KAAKyzD,kBAAkBp3D,IAAImF,SACrEwyD,EAASjQ,MAAMviD,GAAWA,IAAWs2C,GAAaub,YAClDrzD,KAAKmzD,OAAOC,cAAgBtb,GAAaub,UAEpCW,EAASjQ,MAAMviD,GAAWA,IAAWs2C,GAAa8b,mBACvD5zD,KAAKmzD,OAAOC,cAAgBtb,GAAa8b,iBAGzC5zD,KAAKmzD,OAAOC,cAAgBtb,GAAa+b,mBAEjD,EAEG,MAAMI,GAAmB,IAAMf,GAAcK,cC5D9C,GAAM,IAAIpZ,GAAO,YACV+Z,GAAgB,2BAC7B,MAAMC,WAAiBnQ,GACnBrL,aACAyb,iBACAC,oBAAsB,IAAI5oB,IAC1B,WAAA3+B,CAAY6rC,EAAcyO,GACtBrZ,MAAMmmB,GAAe9M,EAAOnD,WAAY,GAAKtL,GAC7C34C,KAAK24C,aAAeA,EACpB34C,KAAKo0D,iBAAmBhN,EACnBA,EAAOkN,UAAUjN,OAAO6M,IAAgBjM,IACpCjoD,KAAKsnD,UAAUW,EAAW,GAEvC,CAIA,WAAMhV,CAAM6Q,GACR,MAAMttB,EAAU,GAAmC35B,OAAO+7C,GAAwB54C,KAAK24C,eACjFiK,QAAa5iD,KAAKskD,UAAUx5C,IAAIg5C,GACtC,IAAKlB,EACD,MAAO,CACHxK,UAAW,KACX1wC,MAAO60B,GAAcg4B,mBAG7B,IAAInS,EACJ,IACIA,QAAepiD,KAAK2iD,UAAUC,EAClC,CACA,MAAOl7C,GAEH,OADA,GAAIA,MAAM,uBAAwBA,GAC3B,CACH0wC,UAAW,KACX1wC,MAAO60B,GAAcsrB,oBAE7B,CACA,MAAM2M,QAAwB7S,GAAK,CAACnrB,GAAU,GAAW4rB,EAAQ,IAAWrX,MAAOvsC,SAAiB,GAAIA,MAClG,MAAEkJ,EAAK,UAAE0wC,GAAcp4C,KAAKy0D,uBAAuBD,GACzD,OAAI9sD,EACO,CACH0wC,UAAW,KACX1wC,gBAGF1H,KAAK00D,kBAAkB5Q,EAAQ1L,GAC9B,CACHA,YACA1wC,MAAO,MAEf,CACA,+BAAM8lD,CAA0B1J,GAC5B,MAAM1L,EAAYp4C,KAAKq0D,oBAAoBvpD,IAAIg5C,EAAOrlD,YACtD,OAAI25C,EACO,CACHA,YACA1wC,MAAO,YAGF1H,KAAKizC,MAAM6Q,EAC5B,CAIA,eAAMwD,CAAUW,GACZ,IACI,MAAM,OAAE7F,EAAM,WAAEe,GAAe8E,EACzB0M,EAAmB,GAAoC93D,OAAO+7C,GAAwB54C,KAAK24C,eAC3F6b,QAAwB7S,GAAK,CAACgT,GAAmB,GAAWvS,EAAQ,IAAWrX,MAAOvsC,SAAiB,GAAIA,MAC3G,MAAEkJ,EAAK,UAAE0wC,GAAcp4C,KAAKy0D,uBAAuBD,GACzD,GAAI9sD,EACA,aAEE1H,KAAK00D,kBAAkBvR,EAAWqC,WAAYpN,EACxD,CACA,MAAO1wC,GACH,GAAIA,MAAM,kCAAmCA,EACjD,CACJ,CACA,sBAAA+sD,CAAuBD,GACnB,MAAMliD,EAAQ,IAAIspC,GAClB4Y,EAAgB1oD,SAAS3O,IACrBmV,EAAMypC,OAAO5+C,EAAM,IAEvB,MAAMsE,EAAW,GAAoC7D,OAAO0U,GAC5D,OAAK7Q,EAOE,CACH22C,UAAW32C,EACXiG,MAAO,OARP,GAAIA,MAAM,oCACH,CACH0wC,UAAW,KACX1wC,MAAO60B,GAAcosB,eAOjC,CACA,uBAAM+L,CAAkB5Q,EAAQ1L,SAEtBp4C,KAAKo0D,iBAAiB9P,UAAUhoC,MAAMwnC,EAAQ,CAChD6B,SAAU,CACNvN,UAAW2B,GAAiB3B,MAGpCp4C,KAAKq0D,oBAAoBtpD,IAAI+4C,EAAOrlD,WAAY25C,EACpD,EAEG,SAASwc,GAAajc,GACzB,OAAQsL,GAAe,IAAIkQ,GAASxb,EAAcsL,EACtD,CCrHO,MAAM4Q,GAAe7mD,OAAOw+B,IAAI,mBAChC,SAASsoB,GAAS3oB,GACrB,OAAgB,MAATA,GAAiBhlB,QAAQglB,EAAM0oB,IAC1C,CCEO,MAAM,WAAmB72D,MAC5BqO,KACAnE,KACA,WAAA4E,CAAYrD,EAAU,6BAClBskC,MAAMtkC,GACNzJ,KAAK6L,KAAO,aACZ7L,KAAKqM,KAAO,GAAWA,KACvBrM,KAAKkI,KAAO,GAAWA,IAC3B,CACA6mD,YAAc,YACdA,YAAc,UAEX,MAAM,WAAkB/wD,MAC3BqO,KACAD,MACA,WAAAU,CAAYrD,EAAS4C,EAAMD,GACvB2hC,MAAMtkC,GACNzJ,KAAKqM,KAAOA,EACZrM,KAAK6L,KAAOO,GAAOP,MAAQ,YAC3B7L,KAAKoM,MAAQA,GAAS,CAAC,CAC3B,EAEG,MAAM2oD,WAA2BnD,eACpCvlD,KACAD,MACA,WAAAU,CAAY+kD,EAAQpoD,EAAS4C,EAAMD,GAC/B2hC,MAAM8jB,EAAQpoD,GACdzJ,KAAKqM,KAAOA,EACZrM,KAAK6L,KAAOO,GAAOP,MAAQ,qBAC3B7L,KAAKoM,MAAQA,GAAS,CAAC,CAC3B,EAEqCpO,MASOA,MASIA,MAU7C,MAAMg3D,GAAc,cC/DrBC,GAAkB,GAClBC,GAAkB,GAClBC,GAAS,ICHR,MACHv5D,MAAQ,EACRkX,MAAQ,GACR,IAAIA,GAGA,OAFA9S,KAAKpE,MAAQ,EACboE,KAAK8S,MAAQA,EACN9S,IACX,CAEA,cAAAo1D,CAAe/5D,GACX,MAAMO,EAAQoE,KAAKpE,MACbuS,EAAS9S,IAIf,YAHe0C,IAAXoQ,IACAnO,KAAKpE,MAAQA,GAEVuS,CACX,CAEA,SAAAknD,CAAUh6D,GACN,MAAM8S,EAAS9S,IACf,GAAI2E,KAAKpE,QAAUoE,KAAK8S,MAAMpX,OAG9B,OAAOyS,CACX,CAEA,QAAAmnD,GACI,KAAIt1D,KAAKpE,OAASoE,KAAK8S,MAAMpX,QAG7B,OAAOsE,KAAK8S,MAAM9S,KAAKpE,MAC3B,CAEA,QAAA25D,GACI,KAAIv1D,KAAKpE,OAASoE,KAAK8S,MAAMpX,QAG7B,OAAOsE,KAAK8S,MAAM9S,KAAKpE,QAC3B,CAEA,aAAA45D,CAAcrlC,GACV,OAAOnwB,KAAKo1D,gBAAe,KACvB,MAAM5sB,EAAOxoC,KAAKu1D,WAClB,GAAI/sB,IAASrY,EAGb,OAAOqY,CAAI,GAEnB,CAOA,aAAAitB,CAAcC,EAAK95D,EAAO+5D,GACtB,OAAO31D,KAAKo1D,gBAAe,KACvB,KAAIx5D,EAAQ,QACwBmC,IAA5BiC,KAAKw1D,cAAcE,IAI3B,OAAOC,GAAO,GAEtB,CAMA,UAAAC,CAAWC,EAAOC,EAAWC,EAAiBC,GAC1C,OAAOh2D,KAAKo1D,gBAAe,KACvB,IAAIjnD,EAAS,EACT8nD,EAAa,EACjB,MAAMC,EAAcl2D,KAAKs1D,WACzB,QAAoBv3D,IAAhBm4D,EACA,OAEJ,MAAMC,EAAiC,MAAhBD,EACjBE,EAAW,IAAM,EAAIJ,GAAY,EAEvC,OAAa,CACT,MAAMK,EAAQr2D,KAAKo1D,gBAAe,KAC9B,MAAM5sB,EAAOxoC,KAAKu1D,WAClB,QAAax3D,IAATyqC,EACA,OAEJ,MAAM4B,EAAM1qC,OAAOoJ,SAAS0/B,EAAMqtB,GAClC,OAAIn2D,OAAOyD,MAAMinC,QAAjB,EAGOA,CAAG,IAEd,QAAcrsC,IAAVs4D,EACA,MAIJ,GAFAloD,GAAU0nD,EACV1nD,GAAUkoD,EACNloD,EAASioD,EACT,OAGJ,GADAH,GAAc,OACIl4D,IAAd+3D,GACIG,EAAaH,EACb,MAGZ,CACA,OAAmB,IAAfG,IAGMF,GAAmBI,GAAkBF,EAAa,OAFxD,EAMO9nD,CACX,GAER,CAEA,YAAAmoD,GACI,OAAOt2D,KAAKo1D,gBAAe,KACvB,MAAMztB,EAAM,IAAIhmC,WAAW,GAC3B,IAAK,IAAI/E,EAAI,EAAGA,EAAI+qC,EAAIjsC,OAAQkB,IAAK,CACjC,MAAM25D,EAAKv2D,KAAKy1D,cAAc,IAAK74D,GAAG,IAAMoD,KAAK41D,WAAW,GAAI,GAAG,EAAO,KAC1E,QAAW73D,IAAPw4D,EACA,OAEJ5uB,EAAI/qC,GAAK25D,CACb,CACA,OAAO5uB,CAAG,GAElB,CAEA,YAAA6uB,GAQI,MAAMC,EAAcC,IAChB,IAAK,IAAI95D,EAAI,EAAGA,EAAI85D,EAAOh7D,OAAS,EAAGkB,IAAK,CACxC,MAAM25D,EAAS,EAAJ35D,EAEX,GAAIA,EAAI85D,EAAOh7D,OAAS,EAAG,CACvB,MAAMi7D,EAAO32D,KAAKy1D,cAAc,IAAK74D,GAAG,IAAMoD,KAAKs2D,iBACnD,QAAav4D,IAAT44D,EAKA,OAJAD,EAAOH,GAAMI,EAAK,GAClBD,EAAOH,EAAK,GAAKI,EAAK,GACtBD,EAAOH,EAAK,GAAKI,EAAK,GACtBD,EAAOH,EAAK,GAAKI,EAAK,GACf,CAACJ,EAAK,GAAG,EAExB,CACA,MAAM5wC,EAAQ3lB,KAAKy1D,cAAc,IAAK74D,GAAG,IAAMoD,KAAK41D,WAAW,GAAI,GAAG,EAAM,KAC5E,QAAc73D,IAAV4nB,EACA,MAAO,CAAC4wC,GAAI,GAEhBG,EAAOH,GAAM5wC,GAAS,EACtB+wC,EAAOH,EAAK,GAAa,IAAR5wC,CACrB,CACA,MAAO,CAAC+wC,EAAOh7D,QAAQ,EAAM,EAEjC,OAAOsE,KAAKo1D,gBAAe,KAEvB,MAAM7lC,EAAO,IAAI5tB,WAAW,KACrBi1D,EAAUC,GAAWJ,EAAWlnC,GACvC,GAAiB,KAAbqnC,EACA,OAAOrnC,EAGX,GAAIsnC,EACA,OAIJ,QAAgC94D,IAA5BiC,KAAKw1D,cAAc,KACnB,OAEJ,QAAgCz3D,IAA5BiC,KAAKw1D,cAAc,KACnB,OAIJ,MAAMn4B,EAAO,IAAI17B,WAAW,IACtBm1D,EAAQ,IAAMF,EAAW,IACxBG,GAAYN,EAAWp5B,EAAK9J,SAAS,EAAGujC,IAG/C,OADAvnC,EAAKxkB,IAAIsyB,EAAK9J,SAAS,EAAGwjC,GAAW,GAAKA,GACnCxnC,CAAI,GAEnB,CAEA,UAAAynC,GACI,OAAOh3D,KAAKs2D,gBAAkBt2D,KAAKw2D,cACvC,GCpMG,SAASS,GAAOnkD,GACnB,OAAOqU,QFGJ,SAAmBrU,GACtB,KAAIA,EAAMpX,OAASw5D,IAGnB,OAAOC,GAAO+B,IAAIpkD,GAAOuiD,WAAU,IAAMF,GAAOmB,gBACpD,CERmB,CAAUxjD,GAC7B,CAEO,SAASqkD,GAAOrkD,GACnB,OAAOqU,QFMJ,SAAmBrU,GAKtB,GAHIA,EAAM6J,SAAS,OACf7J,EAAQA,EAAMpN,MAAM,KAAK,MAEzBoN,EAAMpX,OAASu5D,IAGnB,OAAOE,GAAO+B,IAAIpkD,GAAOuiD,WAAU,IAAMF,GAAOqB,gBACpD,CEfmB,CAAU1jD,GAC7B,CAEO,SAASskD,GAAKtkD,GACjB,OAAOqU,QFaJ,SAAiBrU,GAKpB,GAHIA,EAAM6J,SAAS,OACf7J,EAAQA,EAAMpN,MAAM,KAAK,MAEzBoN,EAAMpX,OAASu5D,IAGnB,OAAOE,GAAO+B,IAAIpkD,GAAOuiD,WAAU,IAAMF,GAAO6B,cACpD,CEtBmB,CAAQlkD,GAC3B,CCR4BhK,SAAS,SAAU,IACrB,IAAInH,WAAW,CACrC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,MCHhC,MAAM01D,GAAOJ,GACPK,GAAOH,GAGP,GAAU,SAAUv3C,GAC7B,IAAIjkB,EAAS,EAEb,GADAikB,EAAKA,EAAGnhB,WAAW05B,OACfk/B,GAAKz3C,GAAK,CACV,MAAMtN,EAAQ,IAAI3Q,WAAWhG,EAAS,GAItC,OAHAikB,EAAGla,MAAM,OAAOoG,SAAS41B,IACrBpvB,EAAM3W,KAAiC,IAArBmN,SAAS44B,EAAM,GAAU,IAExCpvB,CACX,CACA,GAAIglD,GAAK13C,GAAK,CACV,MAAM23C,EAAW33C,EAAGla,MAAM,IAAK,GAC/B,IAAI9I,EACJ,IAAKA,EAAI,EAAGA,EAAI26D,EAAS77D,OAAQkB,IAAK,CAElC,IAAI46D,EADSH,GAAKE,EAAS36D,MAGvB46D,EAAW,GAAQD,EAAS36D,IAC5B26D,EAAS36D,GAAK,GAAmB46D,EAAS/5D,MAAM,EAAG,GAAI,WAE3C,MAAZ+5D,KAAsB56D,EAAI,GAC1B26D,EAASh3D,OAAO3D,EAAG,EAAG,GAAmB46D,EAAS/5D,MAAM,EAAG,GAAI,UAEvE,CACA,GAAoB,KAAhB85D,EAAS,GACT,KAAOA,EAAS77D,OAAS,GACrB67D,EAASjtD,QAAQ,UAEpB,GAAsC,KAAlCitD,EAASA,EAAS77D,OAAS,GAChC,KAAO67D,EAAS77D,OAAS,GACrB67D,EAASj6D,KAAK,UAEjB,GAAIi6D,EAAS77D,OAAS,EAAG,CAC1B,IAAKkB,EAAI,EAAGA,EAAI26D,EAAS77D,QAA0B,KAAhB67D,EAAS36D,GAAWA,KAEvD,MAAM66D,EAAO,CAAC76D,EAAG,GACjB,IAAKA,EAAI,EAAI26D,EAAS77D,OAAQkB,EAAI,EAAGA,IACjC66D,EAAKn6D,KAAK,KAEdi6D,EAASh3D,OAAOrE,MAAMq7D,EAAUE,EACpC,CACA,MAAMnlD,EAAQ,IAAI3Q,WAAWhG,EAAS,IACtC,IAAKiB,EAAI,EAAGA,EAAI26D,EAAS77D,OAAQkB,IAAK,CAClC,MAAMo3C,EAAOlrC,SAASyuD,EAAS36D,GAAI,IACnC0V,EAAM3W,KAAaq4C,GAAQ,EAAK,IAChC1hC,EAAM3W,KAAmB,IAAPq4C,CACtB,CACA,OAAO1hC,CACX,CACA,MAAM,IAAItU,MAAM,qBACpB,EAEa,GAAW,SAAUuE,EAAK5G,EAAS,EAAGD,GAC/CC,IAAWA,EACXD,EAASA,GAAW6G,EAAI7G,OAASC,EACjC,MAAMqjC,EAAO,IAAIc,SAASv9B,EAAIzF,QAC9B,GAAe,IAAXpB,EAAc,CACd,MAAMyS,EAAS,GAEf,IAAK,IAAIvR,EAAI,EAAGA,EAAIlB,EAAQkB,IACxBuR,EAAO7Q,KAAKiF,EAAI5G,EAASiB,IAE7B,OAAOuR,EAAOzQ,KAAK,IACvB,CACA,GAAe,KAAXhC,EAAe,CACf,MAAMyS,EAAS,GAEf,IAAK,IAAIvR,EAAI,EAAGA,EAAIlB,EAAQkB,GAAK,EAC7BuR,EAAO7Q,KAAK0hC,EAAKe,UAAUpkC,EAASiB,GAAG6B,SAAS,KAEpD,OAAO0P,EAAOzQ,KAAK,KACd4B,QAAQ,qBAAsB,UAC9BA,QAAQ,SAAU,KAC3B,CACA,MAAO,EACX,EClFMo4D,IAAK,EACEjsD,GAAQ,CAAC,EACTm8B,GAAQ,CAAC,EAyEf,SAAS,GAAYgT,GACxB,GAAqB,iBAAVA,EAAoB,CAC3B,GAAoB,MAAhBhT,GAAMgT,GACN,OAAOhT,GAAMgT,GAEjB,MAAM,IAAI58C,MAAM,0BAA0B48C,IAC9C,CACK,GAAqB,iBAAVA,EAAoB,CAChC,GAAoB,MAAhBnvC,GAAMmvC,GACN,OAAOnvC,GAAMmvC,GAEjB,MAAM,IAAI58C,MAAM,0BAA0B48C,IAC9C,CACA,MAAM,IAAI58C,MAAM,oCAAoC48C,EACxD,CC1DO,SAAS+c,GAAgB/c,EAAOr4C,GAEnC,OADiB,GAAYq4C,GACZvuC,MACb,KAAK,EACL,KAAK,GACD,OA8FZ,SAAkBurD,GACd,MAAMC,EAAW,GAAYD,EAAQ,EAAGA,EAAOl8D,QAC/C,GAAgB,MAAZm8D,EACA,MAAM,IAAI75D,MAAM,sBAEpB,IAAK,GAAQ65D,GACT,MAAM,IAAI75D,MAAM,sBAEpB,OAAO65D,CACX,CAvGmBC,CAASv1D,GACpB,KAAK,GAOL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,IACL,KAAK,IACL,KAAK,IACD,OAAOw1D,GAAUx1D,GAZrB,KAAK,EACL,KAAK,IACL,KAAK,GACL,KAAK,IACD,OAAOy1D,GAAWz1D,GAAK9D,WAS3B,KAAK,IACD,OA0IZ,SAAkB8D,GACd,MAAM2D,EAAO,EAAc3D,GACrB01D,EAAU11D,EAAI9E,MAAM,EAAsByI,IAChD,GAAI+xD,EAAQv8D,SAAWwK,EACnB,MAAM,IAAIlI,MAAM,wBAEpB,OAAO,GAAmBi6D,EAAS,YACvC,CAjJmBC,CAAS31D,GACpB,KAAK,IAEL,KAAK,IACD,OAkLZ,SAAqBA,GACjB,MAAM41D,EAAY51D,EAAI9E,MAAM,EAAG8E,EAAI7G,OAAS,GACtC08D,EAAY71D,EAAI9E,MAAM8E,EAAI7G,OAAS,GAGzC,MAAO,GAFM,GAAmBy8D,EAAW,aAC9BH,GAAWI,IAE5B,CAxLmBC,CAAY91D,GACvB,KAAK,IACD,OAyHZ,SAAkBA,GACd,MAAM2D,EAAO,EAAc3D,GACrByJ,EAAOzJ,EAAI9E,MAAM,EAAsByI,IAC7C,GAAI8F,EAAKtQ,SAAWwK,EAChB,MAAM,IAAIlI,MAAM,wBAEpB,MAAO,IAAM,GAAmBgO,EAAM,YAC1C,CAhImBssD,CAAS/1D,GACpB,KAAK,IACD,OAAOmZ,WAAW4jB,mBAAmBy4B,GAAUx1D,IACnD,QACI,OAAO,GAAmBA,EAAK,UAE3C,CACO,SAASg2D,GAAe3d,EAAOloC,GAElC,OADiB,GAAYkoC,GACZvuC,MACb,KAAK,EAEL,KAAK,GACD,OAoDZ,SAAkBwrD,GACd,IAAK,GAAQA,GACT,MAAM,IAAI75D,MAAM,sBAEpB,OAAO,GAAW65D,EACtB,CAzDmBW,CAAS9lD,GACpB,KAAK,GAOL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,IACL,KAAK,IACL,KAAK,IACD,OAAO+lD,GAAU/lD,GAZrB,KAAK,EACL,KAAK,IACL,KAAK,GACL,KAAK,IACD,OAAOgmD,GAAW5vD,SAAS4J,EAAK,KASpC,KAAK,IACD,OA0EZ,SAAkB1G,GACd,IAAI2sD,EAEAA,EADY,MAAZ3sD,EAAK,IAA0B,MAAZA,EAAK,GACnB,GAAco9B,GAAUxrC,OAAO,IAAIoO,MAASsG,MAG5Co5B,GAAItuB,MAAMpR,GAAM4+B,UAAUt4B,MAGnC,MAAMpM,EAAOvE,WAAWk5B,KAAK,EAAc89B,EAAGj9D,SAC9C,OAAO,GAAiB,CAACwK,EAAMyyD,GAAKzyD,EAAKxK,OAASi9D,EAAGj9D,OACzD,CArFmBk9D,CAASlmD,GACpB,KAAK,IACD,OA4GZ,SAAqBA,GACjB,MAAMmmD,EAAOnmD,EAAIhN,MAAM,KACvB,GAAoB,IAAhBmzD,EAAKn9D,OACL,MAAM,IAAIsC,MAAM,kCAAkC66D,EAAKn7D,KAAK,8CAEhE,GAAuB,KAAnBm7D,EAAK,GAAGn9D,OACR,MAAM,IAAIsC,MAAM,+BAA+B66D,EAAK,+BAGxD,MAAMt2D,EAAM8Q,GAAOzV,OAAO,IAAMi7D,EAAK,IAE/BC,EAAOhwD,SAAS+vD,EAAK,GAAI,IAC/B,GAAIC,EAAO,GAAKA,EAAO,MACnB,MAAM,IAAI96D,MAAM,yCAEpB,MAAM+6D,EAAUL,GAAWI,GAC3B,OAAO,GAAiB,CAACv2D,EAAKw2D,GAAUx2D,EAAI7G,OAASq9D,EAAQr9D,OACjE,CA7HmBs9D,CAAYtmD,GACvB,KAAK,IACD,OA4HZ,SAAsBA,GAClB,MAAMmmD,EAAOnmD,EAAIhN,MAAM,KACvB,GAAoB,IAAhBmzD,EAAKn9D,OACL,MAAM,IAAIsC,MAAM,kCAAkC66D,EAAKn7D,KAAK,8CAEhE,GAAuB,KAAnBm7D,EAAK,GAAGn9D,OACR,MAAM,IAAIsC,MAAM,+BAA+B66D,EAAK,gCAGxD,MAAMt2D,EAAM8Q,GAAOzV,OAAO,IAAIi7D,EAAK,MAE7BC,EAAOhwD,SAAS+vD,EAAK,GAAI,IAC/B,GAAIC,EAAO,GAAKA,EAAO,MACnB,MAAM,IAAI96D,MAAM,yCAEpB,MAAM+6D,EAAUL,GAAWI,GAC3B,OAAO,GAAiB,CAACv2D,EAAKw2D,GAAUx2D,EAAI7G,OAASq9D,EAAQr9D,OACjE,CA7ImBu9D,CAAavmD,GACxB,KAAK,IACD,OAgFZ,SAAkBwmD,GACd,MAAMC,EAAKC,GAAex7D,OAAOs7D,GAC3BhzD,EAAOvE,WAAWk5B,KAAK,EAAcs+B,EAAGz9D,SAC9C,OAAO,GAAiB,CAACwK,EAAMizD,GAAKjzD,EAAKxK,OAASy9D,EAAGz9D,OACzD,CApFmB29D,CAAS3mD,GACpB,KAAK,IACD,OAAO+lD,GAAU/8C,WAAW+jB,mBAAmB/sB,IACnD,QACI,OAAO,GAAqBA,EAAK,UAE7C,CDlGqB,CACjB,CAAC,EAAG,GAAI,OACR,CAAC,EAAG,GAAI,OACR,CAAC,GAAI,GAAI,QACT,CAAC,GAAI,IAAK,OACV,CAAC,GAAIglD,GAAG,WACR,CAAC,GAAI,EAAG,UACR,CAAC,GAAIA,GAAG,OAAO,GACf,CAAC,GAAIA,GAAG,QAAQ,GAChB,CAAC,GAAIA,GAAG,QAAQ,GAChB,CAAC,GAAIA,GAAG,WAAW,GACnB,CAAC,IAAK,GAAI,QACV,CAAC,IAAK,GAAI,OACV,CAAC,IAAK,EAAG,mBACT,CAAC,IAAK,EAAG,qBACT,CAAC,IAAK,EAAG,gBACT,CAAC,IAAK,EAAG,iBACT,CAAC,IAAK,EAAG,UACT,CAAC,IAAK,EAAG,eACT,CAAC,IAAK,EAAG,OACT,CAAC,IAAK,EAAG,OACT,CAAC,IAAKA,GAAG,QAAQ,GAAO,GAIxB,CAAC,IAAKA,GAAG,QAET,CAAC,IAAKA,GAAG,OACT,CAAC,IAAK,EAAG,SACT,CAAC,IAAK,GAAI,SACV,CAAC,IAAK,IAAK,UACX,CAAC,IAAKA,GAAG,YACT,CAAC,IAAK,EAAG,OACT,CAAC,IAAKA,GAAG,OACT,CAAC,IAAK,EAAG,QACT,CAAC,IAAK,EAAG,WACT,CAAC,IAAK,EAAG,gBACT,CAAC,IAAKA,GAAG,YACT,CAAC,IAAK,EAAG,MACT,CAAC,IAAK,EAAG,OACT,CAAC,IAAK,EAAG,sBACT,CAAC,IAAK,EAAG,QACT,CAAC,IAAKA,GAAG,aACT,CAAC,IAAKA,GAAG,WAGP5rD,SAAQwtD,IACV,MAAM1e,EAIH,SAAwBvuC,EAAMnG,EAAM2F,EAAM0tD,EAAYh0D,GACzD,MAAO,CACH8G,OACAnG,OACA2F,OACA0tD,WAAYpyC,QAAQoyC,GACpBh0D,KAAM4hB,QAAQ5hB,GAEtB,CAZkBi0D,IAAkBF,GAChC1xB,GAAMgT,EAAMvuC,MAAQuuC,EACpBnvC,GAAMmvC,EAAM/uC,MAAQ+uC,CAAK,ICnCT,GAAY,OACZ,GAAY,OACT,GAAY,UAmGnC,MAAMzT,GAAWroC,OAAO2jB,OAAO+qB,IAAO9hC,KAAK7N,GAAMA,EAAE4rB,UAC7C2vC,GAAiB,WACnB,IAAIlhB,EAAM/Q,GAAS,GAAGF,GAAGE,GAAS,IAElC,OADAA,GAAS1pC,MAAM,GAAGqO,SAASgR,GAAOo7B,EAAMA,EAAIjR,GAAGnqB,KACxCo7B,CACV,CAJsB,GAqBvB,SAASwgB,GAAWI,GAChB,MAAMv2D,EAAM,IAAIyQ,YAAY,GAG5B,OAFa,IAAI8sB,SAASv9B,GACrBy9B,UAAU,EAAG84B,GACX,IAAIn3D,WAAWY,EAC1B,CACA,SAASy1D,GAAWz1D,GAEhB,OADa,IAAIu9B,SAASv9B,EAAIzF,QAClBijC,UAAUx9B,EAAI+7B,WAC9B,CACA,SAASm6B,GAAU/lD,GACf,MAAMnQ,EAAM,GAAqBmQ,GAC3BxM,EAAOvE,WAAWk5B,KAAK,EAAct4B,EAAI7G,SAC/C,OAAO,GAAiB,CAACwK,EAAM3D,GAAM2D,EAAKxK,OAAS6G,EAAI7G,OAC3D,CACA,SAASq8D,GAAUx1D,GACf,MAAM2D,EAAO,EAAc3D,GAE3B,IADAA,EAAMA,EAAI9E,MAAM,EAAsByI,KAC9BxK,SAAWwK,EACf,MAAM,IAAIlI,MAAM,wBAEpB,OAAO,GAAmBuE,EAC9B,CC3GO,SAASk3D,GAAsBnnD,GAClC,MAAMonD,EAAS,GACTC,EAAe,GACrB,IAAIp0D,EAAO,KACP3I,EAAI,EACR,KAAOA,EAAI0V,EAAM5W,QAAQ,CACrB,MAAM2Q,EAAO,EAAciG,EAAO1V,GAC5BN,EAAI,EAAsB+P,GAC1BhQ,EAAI,GAAYgQ,GAChBnG,EAAO0zD,GAAYv9D,EAAGiW,EAAM7U,MAAMb,EAAIN,IAC5C,GAAa,IAAT4J,EAAY,CACZwzD,EAAOp8D,KAAK,CAAC+O,IACbstD,EAAar8D,KAAK,CAAC+O,IACnBzP,GAAKN,EAEL,QACJ,CACA,MAAMu8D,EAAOvmD,EAAM7U,MAAMb,EAAIN,EAAGM,EAAIN,EAAI4J,GAExC,GADAtJ,GAAMsJ,EAAO5J,EACTM,EAAI0V,EAAM5W,OACV,MAAM,GAAW,+BAAiC,GAAmB4W,EAAO,WAGhFonD,EAAOp8D,KAAK,CAAC+O,EAAMwsD,IACnB,MAAMgB,EAAalC,GAAgBtrD,EAAMwsD,GAEzC,GADAc,EAAar8D,KAAK,CAAC+O,EAAMwtD,KACV,IAAXx9D,EAAEkJ,KAAe,CAIjBA,EAAOs0D,EACP,KACJ,CACJ,CACA,MAAO,CACHvnD,MAAO3Q,WAAWk5B,KAAKvoB,GACvBlW,OAAQ09D,GAAqBH,GAC7BD,SACAC,eACAp0D,OAER,CAIA,SAASu0D,GAAqBJ,GAC1B,MAAMx8D,EAAQ,GASd,OARAw8D,EAAOhuD,KAAKquD,IACR,MAAMnf,EAAQ,GAAYmf,EAAI,IAK9B,OAJA78D,EAAMI,KAAKs9C,EAAM/uC,MACbkuD,EAAIr+D,OAAS,GAAe,MAAVq+D,EAAI,IACtB78D,EAAMI,KAAKy8D,EAAI,IAEZ,IAAI,IAERC,GAAU98D,EAAMQ,KAAK,KAChC,CAIO,SAASu8D,GAAcP,GAC1B,OAAO,GAAiBA,EAAOhuD,KAAKquD,IAChC,MAAMnf,EAAQ,GAAYmf,EAAI,IAC9B,IAAIx3D,EAAMZ,WAAWk5B,KAAK,EAAc+f,EAAMvuC,OAI9C,OAHI0tD,EAAIr+D,OAAS,GAAe,MAAVq+D,EAAI,KACtBx3D,EAAM,GAAiB,CAACA,EAAKw3D,EAAI,MAE9Bx3D,CAAG,IAElB,CAIA,SAASq3D,GAAYv9D,EAAGw8D,GACpB,GAAIx8D,EAAE6J,KAAO,EACT,OAAO7J,EAAE6J,KAAO,EAEf,GAAe,IAAX7J,EAAE6J,KACP,OAAO,EAEN,CACD,MAAMA,EAAO,EAAc2yD,aAAgBl3D,WAAak3D,EAAOl3D,WAAWk5B,KAAKg+B,IAC/E,OAAO3yD,EAAO,EAAsBA,EACxC,CACJ,CAyBO,SAAS8zD,GAAUtnD,GACtB,MAAO,IAAMA,EAAIylB,OAAOzyB,MAAM,KAAKgX,QAAQ2d,GAAMA,IAAG38B,KAAK,IAC7D,CACO,SAAS,GAAWgV,GACvB,OAAO,IAAI1U,MAAM,0BAA4B0U,EACjD,CCpJA,MAAMwnD,GAAUlsD,OAAOw+B,IAAI,8BACd,GAASx+B,OAAOw+B,IAAI,wCAC3B2tB,GAAY,CACd,GAAY,OAAO9tD,KACnB,GAAY,QAAQA,KACpB,GAAY,QAAQA,KACpB,GAAY,WAAWA,MAKpB,MAAM+tD,GACT9nD,MACA,GACA,GACA,GACA,GACA,CAAC,KAAU,EACX,WAAAxF,CAAY+rD,GAKR,IAAI37D,EACJ,GAJY,MAAR27D,IACAA,EAAO,IAGPA,aAAgBl3D,WAChBzE,EAAQu8D,GAAsBZ,QAE7B,GAAoB,iBAATA,EAAmB,CAC/B,GAAIA,EAAKn9D,OAAS,GAAwB,MAAnBm9D,EAAKt8D,OAAO,GAC/B,MAAM,IAAIyB,MAAM,cAAc66D,4BAElC37D,ED/CL,SAAgCwV,GAEnC,MAAMgnD,EAAS,GACTC,EAAe,GACrB,IAAIp0D,EAAO,KACX,MAAMrI,GAJNwV,EAAMsnD,GAAUtnD,IAIEhN,MAAM,KAAKjI,MAAM,GACnC,GAAqB,IAAjBP,EAAMxB,QAA6B,KAAbwB,EAAM,GAC5B,MAAO,CACHoV,MAAO,IAAI3Q,WACXvF,OAAQ,IACRs9D,OAAQ,GACRC,aAAc,GACdp0D,KAAM,MAGd,IAAK,IAAIlJ,EAAI,EAAGA,EAAIa,EAAMxB,OAAQW,IAAK,CACnC,MACMu+C,EAAQ,GADD19C,EAAMb,IAEnB,GAAmB,IAAfu+C,EAAM10C,KAAY,CAClBwzD,EAAOp8D,KAAK,CAACs9C,EAAMvuC,OACnBstD,EAAar8D,KAAK,CAACs9C,EAAMvuC,OAEzB,QACJ,CAEA,GADAhQ,IACIA,GAAKa,EAAMxB,OACX,MAAM,GAAW,oBAAsBgX,GAG3C,IAAmB,IAAfkoC,EAAMr1C,KAAe,CAIrBA,EAAOy0D,GAAU98D,EAAMO,MAAMpB,GAAGqB,KAAK,MACrCg8D,EAAOp8D,KAAK,CAACs9C,EAAMvuC,KAAMksD,GAAe3d,EAAMvuC,KAAM9G,KACpDo0D,EAAar8D,KAAK,CAACs9C,EAAMvuC,KAAM9G,IAC/B,KACJ,CACA,MAAM+M,EAAQimD,GAAe3d,EAAMvuC,KAAMnP,EAAMb,IAC/Cq9D,EAAOp8D,KAAK,CAACs9C,EAAMvuC,KAAMiG,IACzBqnD,EAAar8D,KAAK,CAACs9C,EAAMvuC,KAAMsrD,GAAgB/c,EAAMvuC,KAAMiG,IAC/D,CACA,MAAO,CACHlW,OAAQ09D,GAAqBH,GAC7BrnD,MAAO2nD,GAAcP,GACrBA,SACAC,eACAp0D,OAER,CCFoB80D,CAAuBxB,EACnC,KACK,KAAIyB,GAAYzB,GAIjB,MAAM,IAAI76D,MAAM,uDAHhBd,EAAQu8D,GAAsBZ,EAAKvmD,MAIvC,CACAtS,KAAKsS,MAAQpV,EAAMoV,MACnBtS,MAAK,EAAU9C,EAAMd,OACrB4D,MAAK,EAAU9C,EAAMw8D,OACrB15D,MAAK,EAAgB9C,EAAMy8D,aAC3B35D,MAAK,EAAQ9C,EAAMqI,IACvB,CACA,QAAA9G,GACI,OAAOuB,MAAK,CAChB,CACA,MAAAgnB,GACI,OAAOhnB,KAAKvB,UAChB,CACA,SAAA87D,GACI,IAAIC,EACAC,EACAC,EACA5B,EACA6B,EAAO,GACX,MAAMC,EAAM,GAAY,OAClBC,EAAM,GAAY,OAClBC,EAAM,GAAY,OAClBC,EAAM,GAAY,OAClBC,EAAO,GAAY,QACnBC,EAAU,GAAY,WAC5B,IAAK,MAAO5uD,EAAM5M,KAAUO,KAAK25D,eACzBttD,IAAS4uD,EAAQ5uD,OACjBsuD,EAAO,IAAIl7D,GAAS,MAGpB06D,GAAUx9C,SAAStQ,KACnBouD,EAAYG,EAAI/uD,KAChBitD,EAAO,IACP4B,EAAO,GAAGj7D,GAAS,KAAKk7D,IACxBH,EAASnuD,IAAS2uD,EAAK3uD,KAAO,EAAI,GAElCA,IAASuuD,EAAIvuD,MAAQA,IAASwuD,EAAIxuD,OAClCouD,EAAY,GAAYpuD,GAAMR,KAC9BitD,EAAOhwD,SAASrJ,GAAS,KAEzB4M,IAASyuD,EAAIzuD,MAAQA,IAAS0uD,EAAI1uD,OAClCouD,EAAY,GAAYpuD,GAAMR,KAC9B6uD,EAAO,GAAGj7D,GAAS,KAAKk7D,IACxBH,EAASnuD,IAAS0uD,EAAI1uD,KAAO,EAAI,GAGzC,GAAc,MAAVmuD,GAA+B,MAAbC,GAA6B,MAARC,GAAwB,MAAR5B,EACvD,MAAM,IAAI96D,MAAM,uGAQpB,MANa,CACTw8D,SACAE,OACAD,YACA3B,OAGR,CACA,MAAAoC,GACI,OAAOl7D,MAAK,EAAQ0L,KAAI,EAAEW,KAAUvN,OAAOoN,OAAO,CAAC,EAAG,GAAYG,KACtE,CACA,UAAA8uD,GACI,OAAOn7D,MAAK,EAAQ0L,KAAI,EAAEW,KAAUA,GACxC,CACA,UAAA+uD,GACI,OAAOp7D,MAAK,EAAQ0L,KAAI,EAAEW,KAAU,GAAYA,GAAMR,MAC1D,CACA,MAAA6tD,GACI,OAAO15D,MAAK,CAChB,CACA,YAAA25D,GACI,OAAO35D,MAAK,CAChB,CACA,WAAAq7D,CAAYxC,GAER,OADAA,EAAO,IAAIuB,GAAUvB,GACd,IAAIuB,GAAUp6D,KAAKvB,WAAao6D,EAAKp6D,WAChD,CACA,WAAA68D,CAAYzC,GACR,MAAM0C,EAAa1C,EAAKp6D,WAClB8W,EAAIvV,KAAKvB,WACT7B,EAAI2Y,EAAE6f,YAAYmmC,GACxB,GAAI3+D,EAAI,EACJ,MAAM,IAAIoB,MAAM,WAAWgC,KAAKvB,2CAA2Co6D,EAAKp6D,cAEpF,OAAO,IAAI27D,GAAU7kD,EAAE9X,MAAM,EAAGb,GACpC,CACA,eAAA4+D,CAAgBnvD,GACZ,MAAMqtD,EAAS15D,KAAK05D,SACpB,IAAK,IAAI98D,EAAI88D,EAAOh+D,OAAS,EAAGkB,GAAK,EAAGA,IACpC,GAAI88D,EAAO98D,GAAG,KAAOyP,EACjB,OAAO,IAAI+tD,GAAUH,GAAcP,EAAOj8D,MAAM,EAAGb,KAG3D,OAAOoD,IACX,CACA,SAAAy7D,GACI,IACI,IAAI/B,EAAS,GACb15D,KAAK25D,eAAe7tD,SAAQ,EAAEO,EAAMR,MAC5BQ,IAASZ,GAAMiwD,IAAIrvD,MACnBqtD,EAAOp8D,KAAK,CAAC+O,EAAMR,IAInBQ,IAASZ,GAAM,eAAeY,OAC9BqtD,EAAS,GACb,IAGJ,MAAMiC,EAAQjC,EAAOkC,MACrB,GAAkB,MAAdD,IAAQ,GAAY,CACpB,MAAM9Y,EAAY8Y,EAAM,GAGxB,MAAqB,MAAjB9Y,EAAU,IAA+B,MAAjBA,EAAU,GAC3B,GAAmBzZ,GAAUxrC,OAAO,IAAIilD,KAAc,aAG1D,GAAmBnX,GAAItuB,MAAMylC,GAAWjY,UAAUt4B,MAAO,YACpE,CACA,OAAO,IACX,CACA,MAAOhN,GACH,OAAO,IACX,CACJ,CACA,OAAAu2D,GACI,OAAO77D,MAAK,CAChB,CACA,MAAAksC,CAAO2sB,GACH,OAAO,GAAiB74D,KAAKsS,MAAOumD,EAAKvmD,MAC7C,CACA,aAAMvW,CAAQgF,GACV,MAAM+6D,EAAkB97D,KAAKk7D,SAAS3tC,MAAMlxB,GAAMA,EAAEk9D,aAEpD,GAAuB,MAAnBuC,EACA,MAAO,CAAC97D,MAEZ,MAAM+7D,EAAWC,GAAUlxD,IAAIgxD,EAAgBjwD,MAC/C,GAAgB,MAAZkwD,EACA,MAAM,IAAI,GAAU,6BAA6BD,EAAgBjwD,OAAQ,6BAG7E,aADqBkwD,EAAS/7D,KAAMe,IACtB2K,KAAIgH,GAAO,GAAUA,IACvC,CACA,WAAAupD,GACI,MAAMl7D,EAAUf,KAAKu6D,YACrB,GAA0B,QAAtBx5D,EAAQ05D,WAA6C,QAAtB15D,EAAQ05D,UACvC,MAAM,IAAIz8D,MAAM,gEAAgE+C,EAAQ05D,kEAE5F,MAAO,CACHD,OAAQz5D,EAAQy5D,OAChBvC,QAASl3D,EAAQ25D,KACjB5B,KAAM/3D,EAAQ+3D,KAEtB,CACA,kBAAAoD,CAAmBrD,GACf,MAAMqC,GAAUrC,GAAQ74D,MAAMk7D,SAC9B,QAAsB,IAAlBA,EAAOx/D,QAGY,IAAnBw/D,EAAO,GAAG7uD,MAAiC,KAAnB6uD,EAAO,GAAG7uD,MAGf,IAAnB6uD,EAAO,GAAG7uD,MAAiC,MAAnB6uD,EAAO,GAAG7uD,KAI1C,CAaA,CAAC6tD,MACG,MAAO,aAAal6D,MAAK,IAC7B,EC9IG,MAAMg8D,GAAY,IAAIvwB,IA8EtB,SAAS6uB,GAAY76D,GACxB,OAAO0nB,QAAQ1nB,IAAQ,IAC3B,CAcO,SAAS,GAAUo5D,GACtB,OAAO,IAAIuB,GAAevB,EAC9B,CC5LO,SAAS3mB,GAAYV,EAAa/nC,GACrC,MAAM0yD,EAAmB,GAAY3qB,GAC/B4qB,EAAoB,GAAY3yD,EAAQmmC,cACxCysB,EAUV,SAAoC7rB,GAChC,IAAKA,EACD,OAEJ,IAAI8rB,EAOJ,OALIA,EADqB,iBAAd9rB,EACWA,EAG8B,SAA9BxM,OAAOwM,EAAU0K,WzDfpC,SAAuBz7C,GAC1B,MAAM3C,EAAS,IAAIkW,YAAY,GACzBgsB,EAAO,IAAIc,SAAShjC,GAO1B,MANqB,iBAAV2C,EACPu/B,EAAK8e,WAAW,EAAGr+C,GAAO,GAG1Bu/B,EAAK0e,YAAY,EAAGj+C,GAAO,GAExB,IAAIkC,WAAW7E,EAC1B,CyDOWy/D,CAAcD,EACzB,CAtB2BE,CAA2B/yD,EAAQ+mC,WACpDl+B,EAAQ,GAAO,CACjB6pD,EACA1yD,EAAQ8mC,QACR6rB,EACA3yD,EAAQgnC,KACR4rB,GACF3/C,OAAO8yB,KACT,OAAO,GAAOl9B,EAClB,CCdO,MAAMmqD,GACTC,KACArY,kBACAsY,cACAC,cACApY,MAAQ,GACRqY,wBAA0B,KAC1Bj+D,IACAk+D,mBAAoB,EACpBC,iBAAmB,IAAIC,GAZM,KAa7B,WAAAlwD,CAAY4vD,EAAMrY,EAAmBtjD,GACjCf,KAAK08D,KAAOA,EACZ18D,KAAKqkD,kBAAoBA,EACzBrkD,KAAKpB,IAAM,IAAIu7C,GAAO,OAAOuiB,EAAKna,cAClCviD,KAAK28D,cAAgB1I,KACrBj0D,KAAK48D,cAAgB77D,GAAS67D,eAjBL,EAkBzB,MAAMK,EAAwBl8D,GAASk8D,uBAjBP,IAkB3Bj9D,KAAKk9D,2BAA2BD,EACzC,CACA,kBAAIvY,GACA,OAAO1kD,KAAKwkD,KAChB,CAMA,eAAM2Y,CAAUC,GACZp9D,KAAKpB,IAAIozC,KAAK,iBAAiBorB,WACzBp9D,KAAKqkD,kBAAkBuL,eAAewN,GAC5C,MAAMxa,SAAc5iD,KAAKq9D,gBAAgB,IAAI,GACxCza,GACD5iD,KAAKpB,IAAI8I,MAAM,8DAEnB,MAAM41D,EAAet9D,KAAKwkD,MAAM9nC,QAAQkmC,IAAUA,EAAKthC,GAAG4qB,OAAOkxB,KAIjE,OAHAp9D,KAAKu9D,YAAYD,GACjBt9D,KAAKpB,IAAIozC,KAAK,QAAQorB,iDACtBp9D,KAAK+8D,iBAAiBS,KAAKJ,GACpBxa,CACX,CAIA,yBAAA6a,GACQz9D,KAAK68D,0BACLnO,cAAc1uD,KAAK68D,yBACnB78D,KAAK68D,wBAA0B,KAC/B78D,KAAKpB,IAAIozC,KAAK,mCAEtB,CAeA0rB,SAAW3yB,MAAOhqC,EAAU,CAAC,KACzB,MAAM,UAAE48D,GAAY,EAAK,iBAAEC,GAAmB,EAAK,aAAEC,EAAe,GAAE,YAAEC,EAAc,EAAC,SAAEC,EAAW,KAAQh9D,EAC5G,IAAK68D,GAAoB59D,KAAK0kD,eAAehpD,OAAS,EAClD,OAAO,EACX,IAAIsiE,EAAW,EACf,KAAOA,EAAWF,GAAa,CAE3B,GADAE,UACUh+D,KAAKi+D,gBAIX,OAHIj+D,KAAKwkD,MAAM9oD,OAASsE,KAAK48D,eACzB58D,KAAKpB,IAAIwK,KAAK,cAAcpJ,KAAKwkD,MAAM9oD,0BAA0BsE,KAAK48D,kBAEnE,EAEX,IAAKe,EACD,OAAO,EACX,MAAMO,EAAU1hE,KAAKk4B,IAAImpC,EAAerhE,KAAK+G,IAAI,EAAGy6D,EAAW,GAAID,SAC7D9jB,GAAMikB,EAChB,CAEA,OADAl+D,KAAKpB,IAAI8I,MAAM,4CACR,CAAK,EAMhB,gCAAMw1D,CAA2B5O,GAC7BtuD,KAAKpB,IAAIozC,KAAK,oCACd,UACUhyC,KAAKi+D,gBACXj+D,KAAK68D,wBAA0BtO,aAAY,KACvCvuD,KAAKi+D,gBAAgBpwD,OAAOnG,IACxB1H,KAAKpB,IAAI8I,MAAM,wCAAyCA,EAAM,GAChE,GACH4mD,GACHtuD,KAAKpB,IAAIozC,KAAK,iDAAiDsc,MACnE,CACA,MAAO5mD,GAEH,MADA1H,KAAKpB,IAAI8I,MAAM,0CAA2CA,GACpDA,CACV,CACJ,CAIA,mBAAMu2D,GACF,GAAIj+D,KAAK88D,kBACL,OAAO,EAEX98D,KAAK88D,mBAAoB,EACzB98D,KAAKpB,IAAIozC,KAAK,qCAAqChyC,KAAKwkD,MAAM9oD,UAC9D,IACI,MAAMyiE,EAAgBn+D,KAAK48D,cAAgB58D,KAAKwkD,MAAM9oD,OAClDyiE,EAAgB,SACVn+D,KAAKq9D,gBAAgBc,GAE/Bn+D,KAAKpB,IAAIozC,KAAK,8CAA8ChyC,KAAKwkD,MAAM9oD,UACvEsE,KAAK+8D,iBAAiBqB,eAC1B,CACA,QACIp+D,KAAK88D,mBAAoB,CAC7B,CACA,OAAO,CACX,CAKA,qBAAMO,CAAgBxqB,GAClB7yC,KAAKpB,IAAIozC,KAAK,sBAAsBa,eACpC,IACI,MAAMwrB,QAAwBr+D,KAAKs+D,oBAAoBzrB,GACjD0rB,EAAQF,EAAgB3yD,KAAKk3C,GAAS5iD,KAAKqkD,kBAAkB+M,YAAYxO,EAAKthC,YAC9ExlB,QAAQ2lD,IAAI8c,GAClB,MAAMjB,EAAe,IAAIt9D,KAAKwkD,SAAU6Z,GAGxC,OAFAr+D,KAAKu9D,YAAYD,GACjBt9D,KAAKpB,IAAIozC,KAAK,SAASqsB,EAAgB3iE,kCAAkCsE,KAAKwkD,MAAM9oD,UAC7E2iE,CACX,CACA,MAAO32D,GAEH,MADA1H,KAAKpB,IAAI8I,MAAM,sCAAuCA,GAChDA,CACV,CACJ,CAQA,yBAAM42D,CAAoBzrB,GACtB7yC,KAAKpB,IAAIozC,KAAK,WAAWa,sBACzB,IACI,IAAI2rB,QAAiBx+D,KAAK08D,KAAKnY,WAQ/B,OAPwB,IAApBia,EAAS9iE,QACTsE,KAAKpB,IAAIwK,KAAK,uBAElBo1D,EAAWA,EACN9hD,QAAQkmC,IAA0D,IAAjD5iD,KAAKwkD,MAAMT,MAAM1nD,GAAMA,EAAEilB,GAAG4qB,OAAO0W,EAAKthC,QACzD5E,QAAQkmC,IAAU5iD,KAAK+8D,iBAAiB0B,SAAS7b,EAAKthC,MACtD7jB,MAAM,EAAGo1C,GACP2rB,CACX,CACA,MAAO92D,GAEH,MADA1H,KAAKpB,IAAI8I,MAAM,kCAAmCA,GAC5CA,CACV,CACJ,CACA,WAAA61D,CAAY/Y,GACRxkD,KAAKwkD,MAAQA,EACbxkD,KAAK28D,cAAcjJ,qBAAqB1zD,KAAK08D,KAAKna,WAAYviD,KAAKwkD,MAAM9oD,OAC7E,EAEJ,MAAMshE,GACF0B,aACAla,MAAQ,IAAI/Y,IACZ,WAAA3+B,CAAY4xD,GACR1+D,KAAK0+D,aAAeA,CACxB,CACA,IAAAlB,CAAKl8C,GACDthB,KAAKwkD,MAAMz5C,IAAIuW,EAAG7iB,WAAYyL,KAAKoqC,MACvC,CACA,QAAAmqB,CAASn9C,GACL,MAAMq9C,EAAO3+D,KAAKwkD,MAAM15C,IAAIwW,EAAG7iB,YAC/B,SAAIkgE,GAAS3+D,KAAK4+D,eAAeD,GAIrC,CACA,aAAAP,GACIt/D,OAAO+/D,QAAQ7+D,KAAKwkD,OAAO14C,SAAQ,EAAEwV,EAAIk8C,MACjCx9D,KAAK4+D,eAAepB,IACpBx9D,KAAKwkD,MAAMxB,OAAO1hC,EAAG7iB,WACzB,GAER,CACA,cAAAmgE,CAAeD,GACX,OAAOz0D,KAAKoqC,MAAQqqB,GAAQ3+D,KAAK0+D,YACrC,EC1MJ,MAAM,GAAM,IAAIvkB,GAAO,cAIhB,MAAM2kB,GACTttB,YACAiU,SACApB,kBACAM,SACAwY,UACA4B,sBAAwB,IAAItzB,IAC5BuzB,wBAA0B,GAC1BC,aAAe,IAAIxzB,IACnByzB,uBACAC,qBAAuB,IAAI1zB,IAC3B2zB,kBAZuB,IAavBC,gBAfsB,EAgBtBC,2BAf0C,EAgB1CC,eAAiB,KACjB,WAAAzyD,CAAY0kC,EAAaiU,EAAUpB,EAAmBM,EAAUwY,GAC5Dn9D,KAAKwxC,YAAcA,EACnBxxC,KAAKylD,SAAWA,EAChBzlD,KAAKqkD,kBAAoBA,EACzBrkD,KAAK2kD,SAAWA,EAChB3kD,KAAKm9D,UAAYA,EACjBn9D,KAAKwxC,YAAcA,EACnB,MAAMguB,EAAex/D,KAAK2kD,WAAWj5C,KAAKrP,GAAMA,EAAEilB,GAAG7iB,aACrDuB,KAAKk/D,uBAAyB,CAC1Bzd,IAAK,IAAIlJ,IACTknB,MAAO,IACA3gE,OAAO4gE,YAAYF,EAAa9zD,KAAKo4C,GAAW,CAACA,EAAQ,IAAIvL,UAGxEinB,EAAa1zD,SAASg4C,GAAW9jD,KAAKm/D,qBAAqBp0D,IAAI+4C,EAAQ,IAC3E,CACA,OAAA6b,CAAQ3zD,EAAM62C,GACV7iD,KAAKk/D,uBAAuBzd,IAAIr6B,IAAIpb,GAC/B62C,IAGA7iD,KAAKk/D,uBAAuBO,MAAM5c,KACnC7iD,KAAKk/D,uBAAuBO,MAAM5c,GAAa,IAAItK,KAEvDv4C,KAAKk/D,uBAAuBO,MAAM5c,GAAWz7B,IAAIpb,GACrD,CACA,eAAM8kC,CAAU3J,EAAUnmC,EAAUD,EAAU,CAAC,GAC3Cf,KAAKo/D,kBAAoBr+D,EAAQ6+D,WA3Cd,IA4CnB5/D,KAAKq/D,gBAAkBt+D,EAAQ8+D,wBA9Cb,EA+ClB7/D,KAAKs/D,2BACDv+D,EAAQu+D,4BA/C0B,EAiDtC,MAAMQ,EAAgBtkE,MAAM+Y,QAAQ4yB,GAAYA,EAAW,CAACA,GAE5D,IAAK,MAAM1d,KAAWq2C,EAClB,GAAIr2C,EAAQ+nB,cAAgBxxC,KAAKwxC,YAC7B,MAAO,CACHuuB,SAAU,CACN,CACIr4D,MAAO60B,GAAcyjC,yBAG7BC,UAAW,IAIvB,MAAMC,EAAsBzwB,GAAoBqwB,GAC1CruB,EAAgBj2C,MAAMq/B,KAAKqlC,EAAoBnhE,QAC/C8tD,EAAW7sD,KAAK2kD,WAAWj5C,KAAIq/B,MAAO6X,GAAS5iD,KAAKylD,SAAS3U,UAAU9wC,KAAKwxC,YAAaoR,EAAMnR,KAC/F0uB,QAAgBrkE,QAAQskE,WAAWvT,GACnCwT,EAAcrgE,KAAKsgE,aAAaH,EAAS,aAgB/C,OAZAD,EAAoBp0D,SAAQ,CAACq7B,EAAUyI,KAGnC,MAAM2wB,EAAuB,CACzBp5B,WACAnmC,YAIJhB,KAAK++D,sBAAsBh0D,IAAI6kC,EAAc2wB,EAAqB,IAEtEvgE,KAAKwgE,8BAA8BxgE,KAAKo/D,mBACjCiB,CACX,CACA,iBAAMzY,CAAYnW,GACd,MAAMob,EAAW7sD,KAAK2kD,WAAWj5C,KAAIq/B,MAAO6X,IACxC,MAAMnhD,QAAiBzB,KAAKylD,SAASmC,YAAY5nD,KAAKwxC,YAAaoR,EAAMnR,GAIzE,OAHAA,EAAc3lC,SAAS8jC,IACnB5vC,KAAK++D,sBAAsB/b,OAAOpT,EAAa,IAE5CnuC,CAAQ,IAEb0+D,QAAgBrkE,QAAQskE,WAAWvT,GACnCwT,EAAcrgE,KAAKsgE,aAAaH,EAAS,eAI/C,OAHwC,IAApCngE,KAAK++D,sBAAsB74D,MAC3BlG,KAAKygE,+BAEFJ,CACX,CACA,UAAMra,CAAKlC,GACP,MACM+I,GADQ/I,EAAS,CAACA,GAAU9jD,KAAK2kD,WAAWj5C,KAAKk3C,GAASA,EAAKthC,MAC9C5V,KAAKo4C,GAAW9jD,KAAK0gE,iBAAiB5c,KACvDqc,QAAgBrkE,QAAQskE,WAAWvT,GACzC,OAAO7sD,KAAKsgE,aAAaH,EAAS,OACtC,CACA,oBAAMpY,GACF,MAAM8E,EAAW7sD,KAAK2kD,WAAWj5C,KAAIq/B,MAAO6X,GAAS5iD,KAAKylD,SAASsC,eAAe/nD,KAAKwxC,YAAaoR,KAC9Fud,QAAgBrkE,QAAQskE,WAAWvT,GACzC7sD,KAAK++D,sBAAsBnuD,QAC3B,MAAMyvD,EAAcrgE,KAAKsgE,aAAaH,EAAS,kBAE/C,OADAngE,KAAKygE,+BACEJ,CACX,CACA,qBAAMM,GACF,IAAK,MAAM30D,KAAQhM,KAAKk/D,uBAAuBzd,IAC3C,IAAK,MAAOoB,EAAW+d,KAAW9hE,OAAO+/D,QAAQ7+D,KAAKk/D,uBAAuBO,OACzE,IAAKmB,EAAOjyD,IAAI3C,KACZhM,KAAK6gE,4BAA4Bhe,GAC7B7iD,KAAK8gE,gBAAgBje,IAAY,CACjC,GAAI7Q,KAAK,QAAQ6Q,6CACjB,MAAMiB,EAAS9jD,KAAK2kD,WAAWp3B,MAAMlxB,GAAMA,EAAEilB,GAAG7iB,aAAeokD,KAAYvhC,GAC3E,IAAKwiC,EAAQ,CACT,GAAIp8C,MAAM,0BAA0Bm7C,mCACpC,QACJ,CACA,UACU7iD,KAAK+gE,sBAAsBjd,EACrC,CACA,MAAOp8C,GACH,GAAIA,MAAM,wBAAwBm7C,MAAcn7C,IACpD,CACJ,CAIhB,CACA,4BAAMs5D,CAAuBv3D,EAASo5C,GAClC,MAAMoe,EFhHP,SAAwBzvB,EAAa/nC,GACxC,MAAMuC,EAAOkmC,GAAYV,EAAa/nC,GAEtC,OADgBsuC,GAAY/rC,EAEhC,CE4GiCk1D,CAAelhE,KAAKwxC,YAAa/nC,GAG1D,GAFAzJ,KAAK2/D,QAAQsB,EAAkBpe,GAC1B7iD,KAAK2gE,kBACN3gE,KAAKg/D,wBAAwBriD,SAASskD,GAEtC,YADA,GAAIjvB,KAAK,sCAGbhyC,KAAKg/D,wBAAwB1hE,KAAK2jE,GAClC,MAAM,aAAErxB,GAAiBnmC,EACnB82D,EAAuBvgE,KAAK++D,sBAAsBj0D,IAAI8kC,GACvD2wB,GAIL,GAAIvuB,KAAK,yCAA0CpC,EAAc,oBAAqB5vC,KAAKwxC,mBA8TnGzG,eAA2Bw1B,EAAsB/uB,EAAa/nC,GAC1D,MAAM,SAAE09B,EAAQ,SAAEnmC,GAAau/D,GACzB,aAAE3wB,GAAiBnmC,EACzB,GAAKmmC,EAIL,IACI,MAAMuxB,EAAiBh6B,EAASz7B,KAAK01D,GAAQA,EACxC/lB,aAAa7J,EAAa/nC,GAC1BqE,MAAMuzD,GAAYA,GAAWvlE,QAAQE,OAAO,uBAC3CslE,QAAuBxlE,QAAQyxD,IAAI4T,SACnCngE,EAASsgE,EACnB,CACA,MAAOh8D,GACH,GAAIoC,MAAM,yBAA0BpC,EACxC,MAZI,GAAI8D,KAAK,yCAajB,CA9Ucm4D,CAAYhB,EAAsBvgE,KAAKwxC,YAAa/nC,IAJtD,GAAI/B,MAAM,0CAA2CkoC,EAK7D,CACA,YAAA0wB,CAAaH,EAASj4D,GAClB,MAAMiG,EAAS,CAAE4xD,SAAU,GAAIE,UAAW,IAC1C,IAAK,MAAMuB,KAAiBrB,EACxB,GAA6B,aAAzBqB,EAAchgE,OACd,GAAIkG,MAAM,qBAAqBQ,2BAA+Bs5D,EAAclX,QAC5En8C,EAAO4xD,SAASziE,KAAK,CAAEoK,MAAO60B,GAAcmrB,mBAE3C,CACD,MAAM+Z,EAAaD,EAAc/hE,MAC7BgiE,EAAWha,QACXt5C,EAAO4xD,SAASziE,KAAKmkE,EAAWha,SAGhCt5C,EAAO8xD,UAAU3iE,KAAKmkE,EAAWja,QAEzC,CAEJ,OAAOr5C,CACX,CACA,sBAAMuyD,CAAiB5c,GACnB,MAAMlB,EAAO5iD,KAAK2kD,WAAWp3B,MAAMlxB,GAAMA,EAAEilB,GAAG4qB,OAAO4X,KACrD,IAAKlB,EACD,MAAO,CACH4E,QAAS,KACTC,QAAS,CACL3D,SACAp8C,MAAO60B,GAAcg4B,oBAIjC,IACI,MAAMpmD,QAAenO,KAAKylD,SAASO,KAAKpD,GAOxC,OANIz0C,EAAOs5C,cACDznD,KAAK0hE,kBAAkB5d,GAG7B9jD,KAAKi/D,aAAajc,OAAOc,EAAOrlD,YAE7B0P,CACX,CACA,MAAOzG,GAEH,aADM1H,KAAK0hE,kBAAkB5d,GACtB,CACH0D,QAAS,KACTC,QAAS,CACL3D,SACAp8C,MAAO60B,GAAcmrB,cAGjC,CACJ,CACA,uBAAMga,CAAkB5d,GACpB,MAAMic,GAAY//D,KAAKi/D,aAAan0D,IAAIg5C,EAAOrlD,aAAe,GAAK,EAEnE,GADAuB,KAAKi/D,aAAal0D,IAAI+4C,EAAOrlD,WAAYshE,GACrCA,EAAW//D,KAAKq/D,gBAChB,UACUr/D,KAAK+gE,sBAAsBjd,GACjC9jD,KAAKi/D,aAAajc,OAAOc,EAAOrlD,WACpC,CACA,MAAOiJ,GACH,GAAIA,MAAM,wBAAwBo8C,EAAOrlD,eAAeiJ,KAC5D,CAER,CACA,2BAAMq5D,CAAsBjd,GACxB,IACI,MAAM6d,QAAgB3hE,KAAKm9D,UAAUrZ,GAIrC,aAHM9jD,KAAKylD,SAAS3U,UAAU9wC,KAAKwxC,YAAamwB,EAASnmE,MAAMq/B,KAAK76B,KAAK++D,sBAAsBhgE,SAC/FiB,KAAKk/D,uBAAuBO,MAAMkC,EAAQrgD,GAAG7iB,YAAc,IAAI85C,IAC/Dv4C,KAAKm/D,qBAAqBp0D,IAAI42D,EAAQrgD,GAAG7iB,WAAY,GAC9CkjE,CACX,CACA,MAAOj6D,GAEH,YADA,GAAI0B,KAAK,wBAAwB06C,EAAOrlD,eAAeiJ,KAE3D,CACA,QACI1H,KAAKi/D,aAAajc,OAAOc,EAAOrlD,YAChCuB,KAAKm/D,qBAAqBnc,OAAOc,EAAOrlD,mBACjCuB,KAAKk/D,uBAAuBO,MAAM3b,EAAOrlD,WACpD,CACJ,CACA,6BAAA+hE,CAA8BlS,GAC1BtuD,KAAK4hE,oBAAoBtT,GACzBtuD,KAAK6hE,yBACT,CACA,4BAAApB,GACIzgE,KAAK8hE,qBACL9hE,KAAK+hE,wBACT,CACA,mBAAAH,CAAoBtT,GACZtuD,KAAKu/D,eACL,GAAIvtB,KAAK,mCAGbhyC,KAAKu/D,eAAiBhR,aAAY,KACzBvuD,KAAKgmD,OAAOn4C,OAAOnG,IACpB,GAAIA,MAAM,kCAAmCA,EAAM,GACrD,GACH4mD,EACP,CACA,kBAAAwT,GACS9hE,KAAKu/D,gBAIV,GAAIvtB,KAAK,6BACT0c,cAAc1uD,KAAKu/D,gBACnBv/D,KAAKu/D,eAAiB,MALlB,GAAIvtB,KAAK,mCAMjB,CACA,uBAAA6vB,GACI7hE,KAAKqkD,kBAAkBlD,iBAAiBzJ,GAAuBub,kBAAmBjzD,KAAKgiE,mBAAmBl+D,KAAK9D,MACnH,CACA,sBAAA+hE,GACI/hE,KAAKqkD,kBAAkBhD,oBAAoB3J,GAAuBub,kBAAmBjzD,KAAKgiE,mBAAmBl+D,KAAK9D,MACtH,CACA,wBAAMgiE,EAAqBre,OAAQ2L,IAC/B,GAAKA,EAAL,CAIA,IACI,MACM2S,SADejiE,KAAKgmD,QACO+Z,SAASr0D,KAAIq/B,MAAOvhC,IAC7CA,EAAEs6C,cACI9jD,KAAK+gE,sBAAsBv3D,EAAEs6C,OACvC,UAEEhoD,QAAQ2lD,IAAIwgB,EACtB,CACA,MAAOhmE,GACH,GAAIyL,MAAM,2CAA2CzL,IACzD,CACA+D,KAAK4hE,oBAAoB5hE,KAAKo/D,kBAb9B,MAFIp/D,KAAK8hE,oBAgBb,CACA,2BAAAjB,CAA4Bhe,GACxB,MAAMqf,EAAeliE,KAAKm/D,qBAAqBr0D,IAAI+3C,IAAc,EACjE7iD,KAAKm/D,qBAAqBp0D,IAAI83C,EAAWqf,EAAe,EAC5D,CACA,eAAApB,CAAgBje,GAEZ,OADuB7iD,KAAKm/D,qBAAqBr0D,IAAI+3C,IAAc,GAC3C7iD,KAAKs/D,0BACjC,EAEJ,MAAM6C,WAAkB1F,GACpBhX,SACA2c,mBACAC,oBAAsB,IAAI52B,IAC1B,WAAA3+B,CAAYu3C,EAAmB+C,EAAQrmD,GACnCgtC,MAAM,IAAImZ,IAAWnc,MAAOyG,EAAaM,EAAa+Q,KAClD,MAAMyf,EAAetiE,KAAKuiE,sBAAsB/wB,GAC3C8wB,QAICA,EAAatB,uBAAuBlvB,EAAa+Q,GAHnD,GAAIn7C,MAAM,gDAAgD8pC,IAGG,GAClE6S,EAAkByK,uBAAwB1H,GAAS/C,EAAmB,CAAEuY,cAAe77D,GAAS67D,gBACnG58D,KAAKylD,SAAWzlD,KAAK08D,KACrB18D,KAAKoiE,mBAAqB/d,CAC9B,CAwCA,eAAMvT,CAAU3J,EAAUnmC,EAAUwhE,EAAoBC,GACpD,MAAMC,EAAqB1iE,KAAK2iE,sBAAsBx7B,GACtD,GAAkC,IAA9Bu7B,EAAmBhnE,OACnB,MAAO,CACH4mE,aAAc,KACd56D,MAAO60B,GAAcqmC,uBACrBzC,QAAS,MAGjB,MAAM3uB,EAAckxB,EAAmB,IACjC,aAAEJ,EAAY,MAAE56D,SAAgB1H,KAAK6iE,mBAAmBrxB,EAAagxB,GAC3E,GAAI96D,EACA,MAAO,CACH46D,aAAc,KACd56D,MAAOA,EACPy4D,QAAS,MAGjB,MAAM,SAAEJ,EAAQ,UAAEE,SAAoBqC,EAAaxxB,UAAU3J,EAAUnmC,EAAUyhE,GACjF,MAAO,CACHH,eACA56D,MAAO,KACPy4D,QAAS,CACLJ,SAAUA,EACVE,UAAWA,GAGvB,CAOA,wBAAM4C,CAAmBppB,EAAsB14C,GAC3CA,EAAU,CACN48D,WAAW,KACR58D,GAEP,MAAMywC,EAA6C,iBAAxBiI,EACrBA,EACAnB,GAAwBmB,KAAwB,GAGtD,OAFAV,GAA8BvH,EAAaxxC,KAAKylD,SAAS9M,oBAClC34C,KAAK09D,SAAS38D,IAOrC,GAAIixC,KAAK,qCAAqChyC,KAAK0kD,eAAehpD,iBAAkBsE,KAAK0kD,eAAeh5C,KAAKk3C,GAASA,EAAKthC,GAAG7iB,cAGvH,CACHiJ,MAAO,KACP46D,aAJiBtiE,KAAKuiE,sBAAsB/wB,IAC5CxxC,KAAK8iE,sBAAsBtxB,EAAa,IAAIstB,GAAoBttB,EAAaxxC,KAAKylD,SAAUzlD,KAAKoiE,oBAAoB,IAAMpiE,KAAK0kD,gBAAgB1kD,KAAKm9D,UAAUr5D,KAAK9D,UAP7J,CACH0H,MAAO60B,GAAcg4B,kBACrB+N,aAAc,KAU1B,CAgBA,8BAAMS,CAAyB57B,EAAUnmC,EAAUD,GAC/C,MAAM2hE,EAAqB1iE,KAAK2iE,sBAAsBx7B,GACtD,GAAkC,IAA9Bu7B,EAAmBhnE,OACnB,MAAMsC,MAAM,mEAEhB,GAAI0kE,EAAmBhnE,OAAS,EAC5B,MAAMsC,MAAM,iHAEhB,MAAM,aAAEskE,EAAY,MAAE56D,SAAgB1H,KAAK6iE,mBAAmBH,EAAmB,IACjF,GAAIh7D,EACA,MAAM1J,MAAM,kCAAkC0J,WAE5C46D,EAAaxxB,UAAU3J,EAAUnmC,EAAUD,GACjD,MAAM0wC,EAAgBj2C,MAAMq/B,KAAK4U,GAAoBj0C,MAAM+Y,QAAQ4yB,GAAYA,EAAW,CAACA,IAAWpoC,QACtG,OAAOgsC,gBACGu3B,EAAa1a,YAAYnW,EAAc,CAErD,CACA,sBAAAuxB,CAAuB77B,GACnB,OvE5bD4D,eAA+Bk4B,EAAUx5C,EAASy5C,GACrD,MACMhyB,EAAW,GACjB,IAAI0W,EACJA,QAAoBqb,EAASF,yBAAyBt5C,GAAUhgB,IAC5DynC,EAAS5zC,KAAKmM,EAAQ,IAE1B,MAAM05D,EAAgBzjE,OAAOge,UAAUwlD,GAAiB/W,WAElDiX,EAAYl5D,KAAKoqC,MAiBvB,MAAO,CACHwH,SAjBJ/Q,kBACI,OAAa,CACT,GAAIo4B,GAAiBj5D,KAAKoqC,MAAQ8uB,GAJM,EAKpC,aAEEvzB,GAxBC,IAyBP,MAAMpmC,EAAUynC,EAASrrC,QACzB,IAAK+hD,GAAmC,IAApB1W,EAASx1C,OACzB,OAAO+N,GAENA,GAAWm+C,UAGVn+C,EACV,CACJ,CAEcqyC,GACV,UAAMruC,GACEm6C,UACMA,IACNA,OAAc7pD,EAEtB,EAER,CuEyZeslE,CAAgBrjE,KAAMmnC,EACjC,CAEA,qBAAAo7B,CAAsB/wB,GAClB,OAAOxxC,KAAKqiE,oBAAoBv3D,IAAI0mC,EACxC,CACA,qBAAAsxB,CAAsBtxB,EAAa8wB,GAE/B,OADAtiE,KAAKqiE,oBAAoBt3D,IAAIymC,EAAa8wB,GACnCA,CACX,CACA,qBAAAK,CAAsBx7B,GAClB,IAAK3rC,MAAM+Y,QAAQ4yB,GACf,MAAO,CAACA,EAASqK,aAErB,GAAwB,IAApBrK,EAASzrC,OACT,MAAO,GAEX,MAAMi9C,EAAe,IAAIJ,IAAIpR,EAASz7B,KAAKoR,GAAMA,EAAE00B,eACnD,MAAO,IAAImH,EACf,ECpdJ,MAAM,GAAM,IAAIwB,GAAO,kBACvB,MAAMmpB,WAAqB7G,GACvBhX,SACA,WAAA34C,CAAYu3C,EAAmB+C,EAAQrmD,GACnCgtC,MAAM,IAAIoa,GAAc9D,EAAkByK,uBAAwB1H,GAAS/C,EAAmB,CAC1FuY,cAAe77D,GAAS67D,gBAE5B58D,KAAKylD,SAAWzlD,KAAK08D,IACzB,CACA,UAAM36D,CAAKynB,EAAS/f,EAAS85D,GACzB,MAAMxiE,EAAU,CACZ48D,WAAW,KACR4F,GAEDtD,EAAY,GACZF,EAAW,IACX,YAAEvuB,GAAgBhoB,EACxB,IACIuvB,GAA8BvH,EAAaxxC,KAAKylD,SAAS9M,aAC7D,CACA,MAAOjxC,GAEH,OADA,GAAIA,MAAM,+DACH,CACHq4D,SAAU,CACN,CACIr4D,MAAO60B,GAAcinC,uBAG7BvD,UAAW,GAEnB,CAEA,UADuBjgE,KAAK09D,SAAS38D,GAEjC,MAAO,CACHk/D,YACAF,SAAU,CACN,CACIr4D,MAAO60B,GAAcg4B,qBAKrC,MAAMkP,EAAezjE,KAAK0kD,eAAeh5C,KAAKk3C,GAAS5iD,KAAKylD,SAAS1jD,KAAKynB,EAAS/f,EAASm5C,KACtFud,QAAgBrkE,QAAQskE,WAAWqD,GACzC,IAAK,MAAMt1D,KAAUgyD,EACjB,GAAsB,cAAlBhyD,EAAO3M,OAAwB,CAC/B,MAAM,QAAEimD,EAAO,QAAED,GAAYr5C,EAAO1O,MAIpC,GAHI+nD,GACAyY,EAAU3iE,KAAKkqD,GAEfC,EAAS,CACT,GAAIA,EAAQ3D,OACR,UACU9jD,KAAKm9D,UAAU1V,EAAQ3D,QAC7B,GAAI9R,KAAK,eAAgByV,EAAQ3D,OAAOrlD,WAC5C,CACA,MAAOiJ,GACH,GAAIA,MAAM,uBAAwBA,EACtC,CAEJq4D,EAASziE,KAAKmqD,EAClB,CACJ,MAEI,GAAI//C,MAAM,qCAAsCyG,EAAOm8C,QACvDyV,EAASziE,KAAK,CAAEoK,MAAO60B,GAAcmrB,eAG7C,MAAO,CACHuY,YACAF,WAER,ECxEJ,MACM,GAAM,IAAI5lB,GAAO,kBAKhB,MAAMupB,WAAiBjH,GAC1BhX,SACA,WAAA34C,CAAYu3C,EAAmB+C,GAC3BrZ,MAAM,IAAIyb,GAAUnF,EAAkByK,uBAAwB1H,GAAS/C,EAAmB,CACtFuY,cAVc,IAYlB58D,KAAKylD,SAAWzlD,KAAK08D,IACzB,CAUA,oBAAOiH,CAAex8B,EAAUpmC,GAC5B,MAAM,YAAEywC,EAAW,cAAEC,EAAa,cAAEmyB,GAAkB5jE,KAAK6jE,+BAA+B18B,GACpFuiB,EAAY,CACdlY,cACAC,gBACAW,aAAa,EACbK,mBAAmB,KAChB1xC,GAED6hD,SAAc5iD,KAAKylD,SAASd,SAAS,CACvC9R,SAAU7yC,KAAK48D,cACfhY,kBAAmB,KACnB,GACJ,IAAKhC,EAED,MADA,GAAIl7C,MAAM,+BACJ,IAAI1J,MAAM,+BAEpB,GAAIg0C,KAAK,gCAAgCpyC,KAAKC,UAAUkB,MACxD,MAAM+iE,EAAoB9jE,KAAKylD,SAASgE,aAAaC,EAAWka,EAAehhB,GAC/E,UAAW,MAAM1R,KAAY4yB,QACnB5yB,CAEd,CASA,8BAAM6yB,CAAyB58B,EAAUnmC,EAAUD,GAC/C,GAAIixC,KAAK,wCACT,UAAW,MAAM6a,KAAY7sD,KAAK2jE,eAAex8B,EAAUpmC,GACvD,SAAUf,KAAKgkE,gBAAgBnX,EAAU7rD,GACrC,KAEZ,CASA,8BAAMijE,CAAyB98B,EAAUnmC,EAAUD,GAC/C,GAAIixC,KAAK,wCACT,IAAIkyB,GAAQ,EACZ,UAAW,MAAMC,KAAQnkE,KAAK2jE,eAAex8B,EAAUpmC,GAAU,CAC7D,MAAMqjE,EAAYD,EAAKz4D,KAAIq/B,MAAOs5B,IAC1BH,IAEJA,EAAQ/8C,cAAcnmB,EAASqjE,IAAY,IAG/C,SADMvoE,QAAQ2lD,IAAI2iB,GACdF,EACA,KACR,CACJ,CASA,qBAAMF,CAAgB9yB,EAAUlwC,GAC5B,IAAIkjE,GAAQ,EACZ,MACMI,SADwBxoE,QAAQ2lD,IAAIvQ,IACAx0B,OAAO8yB,IAMjD,aALM1zC,QAAQ2lD,IAAI6iB,EAAkB54D,KAAIq/B,MAAO8J,IACvCA,IAAQqvB,IACRA,EAAQ/8C,cAAcnmB,EAAS6zC,IACnC,KAEGqvB,CACX,CAOA,YAAAK,CAAa96D,GACT,OAAOyoC,GAAYzoC,EAAQ+nC,YAAa/nC,EAC5C,CASA,8BAAAo6D,CAA+B18B,GAC3B,GAAwB,IAApBA,EAASzrC,OAET,MADA,GAAIgM,MAAM,wBACJ,IAAI1J,MAAM,wBAEpB,MAAMwmE,EAA4BhpE,MAAMq/B,KAAK,IAAI0d,IAAIpR,EAASz7B,KAAK+d,GAAYA,EAAQ+nB,gBACvF,GAAIgzB,EAA0B9oE,OAAS,EAEnC,MADA,GAAIgM,MAAM,gEACJ,IAAI1J,MAAM,gEAEpB,MAAMymE,EAAsBD,EAA0B,GACtDzrB,GAA8B0rB,EAAqBzkE,KAAKylD,SAAS9M,cACjE,MAAMirB,EAAgB,IAAIn4B,IAC1BtE,EAASr7B,SAASs1D,IACd,GAAIwC,EAAcj1D,IAAIyyD,EAAIxxB,cAEtB,MADA,GAAIloC,MAAM,4DACJ,IAAI1J,MAAM,4DAEpB4lE,EAAc74D,IAAIq2D,EAAIxxB,aAAcwxB,EAAI,IAE5C,MAAM3vB,EAAgBtK,EACjBzqB,QAAQ+M,GAAYA,EAAQ+nB,cAAgBizB,IAC5C/4D,KAAK01D,GAAQA,EAAIxxB,eACtB,GAA6B,IAAzB6B,EAAc/1C,OAEd,MADA,GAAIgM,MAAM,+BAA+B+8D,KACnC,IAAIzmE,MAAM,+BAAiCymE,GAErD,MAAO,CACHjzB,YAAaizB,EACbhzB,gBACAmyB,gBAER,ECnJG,MAEMc,GAAmB,UACnBC,GAA+B,GACtC,GAAM,IAAIxqB,GAAO,QAChB,MAAMyqB,GACTjsB,aACAyO,OACAgF,MACAG,MACA7vC,OACA+vC,UACApI,kBACA8O,OACA,WAAArmD,CAAY6rC,EAAc53C,EAASqmD,EAAQyd,EAAkBzY,GACzDpsD,KAAK24C,aAAeA,EACpB34C,KAAKosD,MAAQA,EACbpsD,KAAKonD,OAASA,EACdyd,EAAmB,CACfnoD,QAAQ,EACRooD,WAAW,EACXvY,OAAO,KACJsY,GAEP,MAAM3W,EAAgBntD,EAAQmtD,eAxBO,IAyB/BE,EAAiBpuD,KAAKosD,MACtBrrD,EAAQqtD,gBAzBwB,IA0BhC,EACAtK,EAAS9jD,KAAKonD,OAAOtD,OAAOrlD,WAGlC,GAFAuB,KAAKqkD,kBAAoBwK,GAAkBpiD,OAAOq3C,EAAQsD,EAAQ,CAAE8G,gBAAeE,kBAAkBpuD,KAAK24C,aAAc34C,KAAKosD,OAC7HpsD,KAAKmzD,OAASc,KACV4Q,EAAiBtY,MAAO,CACxB,MAAMA,GD2HQlI,EC3HUrkD,KAAKqkD,kBD4H7B+C,GACG,IAAIsc,GAASrf,EAAmB+C,IC5HnCpnD,KAAKusD,MAAQA,EAAMnF,EACvB,CDyHD,IAAmB/C,ECxHlB,GAAIwgB,EAAiBC,UAAW,CAC5B,MAAMrY,EFkCX,SAAuBpI,EAAmBr5C,EAAO,CAAC,GACrD,OAAQo8C,GAAW,IAAIkc,GAAajf,EAAmB+C,EAAQp8C,EACnE,CEpC8B+5D,CAAc/kE,KAAKqkD,mBACrCrkD,KAAKysD,UAAYA,EAAUrF,EAC/B,CACA,GAAIyd,EAAiBnoD,OAAQ,CACzB,MAAMA,EH0aX,SAAoB2nC,EAAmBr5C,GAC1C,OAAQo8C,GAAW,IAAI+a,GAAU9d,EAAmB+C,EG3a7B4d,UH4a3B,CG5a2BA,CAAWhlE,KAAKqkD,mBAC/BrkD,KAAK0c,OAASA,EAAO0qC,EACzB,CACA,GAAIpV,KAAK,oBAAqB8R,EAAQ,YAAY9jD,KAAKosD,mBAAmBpsD,KAAKusD,wBAAwBvsD,KAClGysD,wBAAwBzsD,KAAK0c,SACtC,CAOA,UAAMi1C,CAAK/O,EAAMgB,GACb,MAAMqhB,EAAarhB,GAAa,GAC1BE,EAuEd,SAAgCA,GAC5B,OAAOgR,GAAShR,GAAUA,EAAS,GAAUA,EACjD,CAzEuBohB,CAAuBtiB,QACb,IAAdgB,IACP5jD,KAAKosD,OAAS6Y,EAAW3nE,KAAKi6C,GAAU8U,OACxCrsD,KAAKusD,OAAS0Y,EAAW3nE,KAAKi6C,GAAUiV,OACxCxsD,KAAK0c,QAAUuoD,EAAW3nE,KAAKi6C,GAAU+U,QACzCtsD,KAAKysD,WAAawY,EAAW3nE,KAAKi6C,GAAUmV,YAEhD,MAAMyY,EAAS,GAkCf,OAjCIF,EAAWtoD,SAAS46B,GAAU8U,SAC1BrsD,KAAKosD,MACLpsD,KAAKosD,MAAMW,UAAUqY,YAAYt5D,SAASs5B,GAAU+/B,EAAO7nE,KAAK8nC,KAGhE,GAAI19B,MAAM,yEAGdu9D,EAAWtoD,SAAS46B,GAAUiV,SAC1BxsD,KAAKusD,MACL4Y,EAAO7nE,KAAK0C,KAAKusD,MAAM9G,SAASlD,YAGhC,GAAI76C,MAAM,yEAGdu9D,EAAWtoD,SAAS46B,GAAUmV,aAC1B1sD,KAAKysD,UACL0Y,EAAO7nE,KAAK0C,KAAKysD,UAAUhH,SAASlD,YAGpC,GAAI76C,MAAM,8EAGdu9D,EAAWtoD,SAAS46B,GAAU+U,UAC1BtsD,KAAK0c,OACLyoD,EAAO7nE,KAAK0C,KAAK0c,OAAO+oC,SAASlD,YAGjC,GAAI76C,MAAM,0EAGlB,GAAIsqC,KAAK,cAAc8R,EAAOrlD,6BAA6BwmE,KACpDjlE,KAAKonD,OAAOie,aAAavhB,EAAQqhB,EAC5C,CACA,WAAMpoE,SACIiD,KAAKonD,OAAOrqD,OACtB,CACA,UAAM0Q,GACFzN,KAAKqkD,kBAAkB52C,aACjBzN,KAAKonD,OAAO35C,MACtB,CACA,SAAAm/C,GACI,MAA6B,WAAtB5sD,KAAKonD,OAAO5lD,MACvB,CACA,WAAA8tD,GACI,OAAOtvD,KAAKqkD,kBAAkBiL,aAClC,CAMA,uBAAAgW,GACI,MAAMC,EAAiBvlE,KAAKonD,OACvBoe,gBACAj4C,MAAMsrC,GAASA,EAAKp6D,WAAW2I,MAAM,kBAC1C,IAAKm+D,GAAgD,KAA9BA,EAAe9mE,WAClC,KAAM,6BAEV,OAAO8mE,EAAiB,QAAUvlE,KAAKonD,OAAOtD,OAAOrlD,UACzD,ECxHG,SAASgnE,GAAUznB,GACtB,OAAa,MAATA,GAGyB,mBAAfA,EAAMlwC,MACO,mBAAhBkwC,EAAMnwC,OACY,mBAAlBmwC,EAAMiN,OACrB,CClBA,MAAMya,GAA6B1hC,OAAO,GAAK,GAAK,GAC9C2R,GAAuB3R,OAAO,IAEpC,SAAS2hC,GAAQrpE,EAAG8F,GAAK,GACrB,OAAIA,EACO,CAAEuV,EAAGjY,OAAOpD,EAAIopE,IAAa71D,EAAGnQ,OAAQpD,GAAKq5C,GAAQ+vB,KACzD,CAAE/tD,EAAsC,EAAnCjY,OAAQpD,GAAKq5C,GAAQ+vB,IAAiB71D,EAA4B,EAAzBnQ,OAAOpD,EAAIopE,IACpE,CAoCA,MASME,GAAM,CACRD,WAASjgE,MA7Cb,SAAemgE,EAAKzjE,GAAK,GACrB,IAAI0jE,EAAK,IAAIruD,YAAYouD,EAAInqE,QACzBqqE,EAAK,IAAItuD,YAAYouD,EAAInqE,QAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAIipE,EAAInqE,OAAQkB,IAAK,CACjC,MAAM,EAAE+a,EAAC,EAAE9H,GAAM81D,GAAQE,EAAIjpE,GAAIwF,IAChC0jE,EAAGlpE,GAAImpE,EAAGnpE,IAAM,CAAC+a,EAAG9H,EACzB,CACA,MAAO,CAACi2D,EAAIC,EAChB,EAqCoBC,MApCN,CAACruD,EAAG9H,IAAOm0B,OAAOrsB,IAAM,IAAMg+B,GAAQ3R,OAAOn0B,IAAM,GAqC7Do2D,MAnCU,CAACtuD,EAAGuuD,EAAI3wD,IAAMoC,IAAMpC,EAmCvB4wD,MAlCG,CAACxuD,EAAG9H,EAAG0F,IAAOoC,GAAM,GAAKpC,EAAO1F,IAAM0F,EAmChD6wD,OAjCW,CAACzuD,EAAG9H,EAAG0F,IAAOoC,IAAMpC,EAAM1F,GAAM,GAAK0F,EAiCxC8wD,OAhCG,CAAC1uD,EAAG9H,EAAG0F,IAAOoC,GAAM,GAAKpC,EAAO1F,IAAM0F,EAgCjC+wD,OA9BL,CAAC3uD,EAAG9H,EAAG0F,IAAOoC,GAAM,GAAKpC,EAAO1F,IAAO0F,EAAI,GA8B9BgxD,OA7Bb,CAAC5uD,EAAG9H,EAAG0F,IAAOoC,IAAOpC,EAAI,GAAQ1F,GAAM,GAAK0F,EA8BvDixD,QA5BY,CAACC,EAAI52D,IAAMA,EA4Bd62D,QA3BG,CAAC/uD,EAAGuuD,IAAOvuD,EA4BvBgvD,OA1BW,CAAChvD,EAAG9H,EAAG0F,IAAOoC,GAAKpC,EAAM1F,IAAO,GAAK0F,EA0BxCqxD,OAzBG,CAACjvD,EAAG9H,EAAG0F,IAAO1F,GAAK0F,EAAMoC,IAAO,GAAKpC,EAyBhCsxD,OAvBL,CAAClvD,EAAG9H,EAAG0F,IAAO1F,GAAM0F,EAAI,GAAQoC,IAAO,GAAKpC,EAuB/BuxD,OAtBb,CAACnvD,EAAG9H,EAAG0F,IAAOoC,GAAMpC,EAAI,GAAQ1F,IAAO,GAAK0F,EAuBvD6R,IApBJ,SAAa0+C,EAAIC,EAAIgB,EAAIC,GACrB,MAAMn3D,GAAKk2D,IAAO,IAAMiB,IAAO,GAC/B,MAAO,CAAErvD,EAAImuD,EAAKiB,GAAOl3D,EAAI,GAAK,GAAM,GAAM,EAAGA,EAAO,EAAJA,EACxD,EAiBSo3D,MAfK,CAAClB,EAAIiB,EAAIE,KAAQnB,IAAO,IAAMiB,IAAO,IAAME,IAAO,GAehDC,MAdF,CAAC/hD,EAAK0gD,EAAIiB,EAAIK,IAAQtB,EAAKiB,EAAKK,GAAOhiD,EAAM,GAAK,GAAM,GAAM,EAcrDiiD,MAbT,CAACtB,EAAIiB,EAAIE,EAAII,KAAQvB,IAAO,IAAMiB,IAAO,IAAME,IAAO,IAAMI,IAAO,GAanDC,MAZhB,CAACniD,EAAK0gD,EAAIiB,EAAIK,EAAII,IAAQ1B,EAAKiB,EAAKK,EAAKI,GAAOpiD,EAAM,GAAK,GAAM,GAAM,EAYhDqiD,MAVvB,CAACriD,EAAK0gD,EAAIiB,EAAIK,EAAII,EAAIE,IAAQ5B,EAAKiB,EAAKK,EAAKI,EAAKE,GAAOtiD,EAAM,GAAK,GAAM,GAAM,EAUlDuiD,MAX9B,CAAC5B,EAAIiB,EAAIE,EAAII,EAAIM,KAAQ7B,IAAO,IAAMiB,IAAO,IAAME,IAAO,IAAMI,IAAO,IAAMM,IAAO,IAalG,OCvDOC,GAAWC,IAA6B,KAAO,SAAU,CAC5D,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,sBACpEp8D,KAAIpP,GAAK0nC,OAAO1nC,MArB6B,GAuBzCyrE,GAA6B,IAAItwD,YAAY,IAC7CuwD,GAA6B,IAAIvwD,YAAY,IAC5C,MAAMwwD,WAAe/yB,GACxB,WAAApoC,GACIihC,MAAM,IAAK,GAAI,IAAI,GAKnB/tC,KAAK8lE,GAAK,WACV9lE,KAAK+lE,IAAK,UACV/lE,KAAK+mE,IAAK,WACV/mE,KAAKgnE,IAAK,WACVhnE,KAAKonE,GAAK,WACVpnE,KAAKknE,IAAK,SACVlnE,KAAKwnE,IAAK,WACVxnE,KAAKsnE,GAAK,WACVtnE,KAAK0nE,GAAK,WACV1nE,KAAK4nE,IAAK,WACV5nE,KAAKkoE,IAAK,WACVloE,KAAKmoE,GAAK,UACVnoE,KAAKooE,GAAK,UACVpoE,KAAKqoE,IAAK,SACVroE,KAAKsoE,GAAK,WACVtoE,KAAKuoE,GAAK,SACd,CAEA,GAAAz9D,GACI,MAAM,GAAEg7D,EAAE,GAAEC,EAAE,GAAEgB,EAAE,GAAEC,EAAE,GAAEI,EAAE,GAAEF,EAAE,GAAEM,EAAE,GAAEF,EAAE,GAAEI,EAAE,GAAEE,EAAE,GAAEM,EAAE,GAAEC,EAAE,GAAEC,EAAE,GAAEC,EAAE,GAAEC,EAAE,GAAEC,GAAOvoE,KAC3E,MAAO,CAAC8lE,EAAIC,EAAIgB,EAAIC,EAAII,EAAIF,EAAIM,EAAIF,EAAII,EAAIE,EAAIM,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EACxE,CAEA,GAAAx9D,CAAI+6D,EAAIC,EAAIgB,EAAIC,EAAII,EAAIF,EAAIM,EAAIF,EAAII,EAAIE,EAAIM,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GAC5DvoE,KAAK8lE,GAAU,EAALA,EACV9lE,KAAK+lE,GAAU,EAALA,EACV/lE,KAAK+mE,GAAU,EAALA,EACV/mE,KAAKgnE,GAAU,EAALA,EACVhnE,KAAKonE,GAAU,EAALA,EACVpnE,KAAKknE,GAAU,EAALA,EACVlnE,KAAKwnE,GAAU,EAALA,EACVxnE,KAAKsnE,GAAU,EAALA,EACVtnE,KAAK0nE,GAAU,EAALA,EACV1nE,KAAK4nE,GAAU,EAALA,EACV5nE,KAAKkoE,GAAU,EAALA,EACVloE,KAAKmoE,GAAU,EAALA,EACVnoE,KAAKooE,GAAU,EAALA,EACVpoE,KAAKqoE,GAAU,EAALA,EACVroE,KAAKsoE,GAAU,EAALA,EACVtoE,KAAKuoE,GAAU,EAALA,CACd,CACA,OAAAzgE,CAAQk3B,EAAMrjC,GAEV,IAAK,IAAIiB,EAAI,EAAGA,EAAI,GAAIA,IAAKjB,GAAU,EACnCosE,GAAWnrE,GAAKoiC,EAAKgY,UAAUr7C,GAC/BqsE,GAAWprE,GAAKoiC,EAAKgY,UAAWr7C,GAAU,GAE9C,IAAK,IAAIiB,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAE1B,MAAM4rE,EAA4B,EAArBT,GAAWnrE,EAAI,IACtB6rE,EAA4B,EAArBT,GAAWprE,EAAI,IACtB8rE,EAAM,UAAWF,EAAMC,EAAM,GAAK,UAAWD,EAAMC,EAAM,GAAK,SAAUD,EAAMC,EAAM,GACpFE,EAAM,UAAWH,EAAMC,EAAM,GAAK,UAAWD,EAAMC,EAAM,GAAK,SAAUD,EAAMC,EAAM,GAEpFG,EAA0B,EAApBb,GAAWnrE,EAAI,GACrBisE,EAA0B,EAApBb,GAAWprE,EAAI,GACrBksE,EAAM,UAAWF,EAAKC,EAAK,IAAM,UAAWD,EAAKC,EAAK,IAAM,SAAUD,EAAKC,EAAK,GAChFE,EAAM,UAAWH,EAAKC,EAAK,IAAM,UAAWD,EAAKC,EAAK,IAAM,SAAUD,EAAKC,EAAK,GAEhFG,EAAO,SAAUL,EAAKI,EAAKf,GAAWprE,EAAI,GAAIorE,GAAWprE,EAAI,KAC7DqsE,EAAO,SAAUD,EAAMN,EAAKI,EAAKf,GAAWnrE,EAAI,GAAImrE,GAAWnrE,EAAI,KACzEmrE,GAAWnrE,GAAY,EAAPqsE,EAChBjB,GAAWprE,GAAY,EAAPosE,CACpB,CACA,IAAI,GAAElD,EAAE,GAAEC,EAAE,GAAEgB,EAAE,GAAEC,EAAE,GAAEI,EAAE,GAAEF,EAAE,GAAEM,EAAE,GAAEF,EAAE,GAAEI,EAAE,GAAEE,EAAE,GAAEM,EAAE,GAAEC,EAAE,GAAEC,EAAE,GAAEC,EAAE,GAAEC,EAAE,GAAEC,GAAOvoE,KAEzE,IAAK,IAAIpD,EAAI,EAAGA,EAAI,GAAIA,IAAK,CAEzB,MAAMssE,EAAU,UAAWxB,EAAIE,EAAI,IAAM,UAAWF,EAAIE,EAAI,IAAM,UAAWF,EAAIE,EAAI,IAC/EuB,EAAU,UAAWzB,EAAIE,EAAI,IAAM,UAAWF,EAAIE,EAAI,IAAM,UAAWF,EAAIE,EAAI,IAE/EwB,EAAQ1B,EAAKQ,GAAQR,EAAKU,EAC1BiB,EAAQzB,EAAKO,GAAQP,EAAKS,EAG1BiB,EAAO,SAAUf,EAAIY,EAASE,EAAMvB,GAAUlrE,GAAIorE,GAAWprE,IAC7D2sE,EAAM,SAAUD,EAAMhB,EAAIY,EAASE,EAAMvB,GAAUjrE,GAAImrE,GAAWnrE,IAClE4sE,EAAa,EAAPF,EAENG,EAAU,UAAW3D,EAAIC,EAAI,IAAM,UAAWD,EAAIC,EAAI,IAAM,UAAWD,EAAIC,EAAI,IAC/E2D,EAAU,UAAW5D,EAAIC,EAAI,IAAM,UAAWD,EAAIC,EAAI,IAAM,UAAWD,EAAIC,EAAI,IAC/E4D,EAAQ7D,EAAKiB,EAAOjB,EAAKsB,EAAOL,EAAKK,EACrCwC,EAAQ7D,EAAKiB,EAAOjB,EAAKmB,EAAOF,EAAKE,EAC3CoB,EAAU,EAALF,EACLG,EAAU,EAALF,EACLD,EAAU,EAALF,EACLG,EAAU,EAALF,EACLD,EAAU,EAALR,EACLS,EAAU,EAALP,IACFjwD,EAAG+vD,EAAI73D,EAAG+3D,GAAO,OAAa,EAALJ,EAAa,EAALF,EAAc,EAANiC,EAAe,EAANC,IACrDhC,EAAU,EAALJ,EACLE,EAAU,EAALJ,EACLE,EAAU,EAALL,EACLG,EAAU,EAALF,EACLD,EAAU,EAALjB,EACLkB,EAAU,EAALjB,EACL,MAAM8D,EAAM,SAAUL,EAAKE,EAASE,GACpC9D,EAAK,SAAU+D,EAAKN,EAAKE,EAASE,GAClC5D,EAAW,EAAN8D,CACT,GAEGlyD,EAAGmuD,EAAIj2D,EAAGk2D,GAAO,OAAkB,EAAV/lE,KAAK8lE,GAAkB,EAAV9lE,KAAK+lE,GAAa,EAALD,EAAa,EAALC,MAC3DpuD,EAAGovD,EAAIl3D,EAAGm3D,GAAO,OAAkB,EAAVhnE,KAAK+mE,GAAkB,EAAV/mE,KAAKgnE,GAAa,EAALD,EAAa,EAALC,MAC3DrvD,EAAGyvD,EAAIv3D,EAAGq3D,GAAO,OAAkB,EAAVlnE,KAAKonE,GAAkB,EAAVpnE,KAAKknE,GAAa,EAALE,EAAa,EAALF,MAC3DvvD,EAAG6vD,EAAI33D,GAAU,OAAkB,EAAV7P,KAAKwnE,GAAkB,EAAVxnE,KAAKsnE,GAAa,EAALE,EAAa,EAALF,MAC3D3vD,EAAG+vD,EAAI73D,EAAG+3D,GAAO,OAAkB,EAAV5nE,KAAK0nE,GAAkB,EAAV1nE,KAAK4nE,GAAa,EAALF,EAAa,EAALE,MAC3DjwD,EAAGuwD,EAAIr4D,EAAGs4D,GAAO,OAAkB,EAAVnoE,KAAKkoE,GAAkB,EAAVloE,KAAKmoE,GAAa,EAALD,EAAa,EAALC,MAC3DxwD,EAAGywD,EAAIv4D,EAAGw4D,GAAO,OAAkB,EAAVroE,KAAKooE,GAAkB,EAAVpoE,KAAKqoE,GAAa,EAALD,EAAa,EAALC,MAC3D1wD,EAAG2wD,EAAIz4D,EAAG04D,GAAO,OAAkB,EAAVvoE,KAAKsoE,GAAkB,EAAVtoE,KAAKuoE,GAAa,EAALD,EAAa,EAALC,IAC9DvoE,KAAK+K,IAAI+6D,EAAIC,EAAIgB,EAAIC,EAAII,EAAIF,EAAIM,EAAIF,EAAII,EAAIE,EAAIM,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EACzE,CACA,UAAAjzB,GACIyyB,GAAWtyB,KAAK,GAChBuyB,GAAWvyB,KAAK,EACpB,CACA,OAAAvsC,GACIlJ,KAAKlD,OAAO24C,KAAK,GACjBz1C,KAAK+K,IAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAC1D,EAuEG,MAAM,GAAyB,IAAgB,IAAM,IAAIk9D,KC7N1D6B,GAAsB9lC,OAAO,GAC7B+lC,GAAsB/lC,OAAO,GAC7BgmC,GAAsBhmC,OAAO,GAC5B,SAAS,GAAQ3J,GACpB,OAAQA,aAAa14B,YACX,MAAL04B,GAA0B,iBAANA,GAAyC,eAAvBA,EAAEvtB,YAAYjB,IAC7D,CACO,SAAS,GAAO61C,GACnB,IAAK,GAAQA,GACT,MAAM,IAAI1jD,MAAM,sBACxB,CACO,SAASisE,GAAMC,EAAOzqE,GACzB,GAAqB,kBAAVA,EACP,MAAM,IAAIzB,MAAM,GAAGksE,iCAAqCzqE,MAChE,CAEA,MAAM,GAAwBjE,MAAMq/B,KAAK,CAAEn/B,OAAQ,MAAO,CAAC6Q,EAAG3P,IAAMA,EAAE6B,SAAS,IAAI0rE,SAAS,EAAG,OAIxF,SAAS,GAAW73D,GACvB,GAAOA,GAEP,IAAIiF,EAAM,GACV,IAAK,IAAI3a,EAAI,EAAGA,EAAI0V,EAAM5W,OAAQkB,IAC9B2a,GAAO,GAAMjF,EAAM1V,IAEvB,OAAO2a,CACX,CAKO,SAAS6yD,GAAY7yD,GACxB,GAAmB,iBAARA,EACP,MAAM,IAAIvZ,MAAM,mCAAqCuZ,GAEzD,OAAOysB,OAAe,KAARzsB,EAAa,IAAM,KAAKA,IAC1C,CAEA,MAAM,GAAS,CAAE8yD,GAAI,GAAIC,GAAI,GAAIC,GAAI,GAAIC,GAAI,GAAIC,GAAI,GAAIC,GAAI,KAC7D,SAAS,GAAcliC,GACnB,OAAIA,GAAQ,GAAO6hC,IAAM7hC,GAAQ,GAAO8hC,GAC7B9hC,EAAO,GAAO6hC,GACrB7hC,GAAQ,GAAO+hC,IAAM/hC,GAAQ,GAAOgiC,GAC7BhiC,GAAQ,GAAO+hC,GAAK,IAC3B/hC,GAAQ,GAAOiiC,IAAMjiC,GAAQ,GAAOkiC,GAC7BliC,GAAQ,GAAOiiC,GAAK,SAD/B,CAGJ,CAIO,SAAS,GAAWlzD,GACvB,GAAmB,iBAARA,EACP,MAAM,IAAIvZ,MAAM,mCAAqCuZ,GACzD,MAAMozD,EAAKpzD,EAAI7b,OACTkvE,EAAKD,EAAK,EAChB,GAAIA,EAAK,EACL,MAAM,IAAI3sE,MAAM,0DAA4D2sE,GAChF,MAAM91D,EAAQ,IAAIlT,WAAWipE,GAC7B,IAAK,IAAIC,EAAK,EAAG3lE,EAAK,EAAG2lE,EAAKD,EAAIC,IAAM3lE,GAAM,EAAG,CAC7C,MAAM4lE,EAAK,GAAcvzD,EAAIzZ,WAAWoH,IAClC6lE,EAAK,GAAcxzD,EAAIzZ,WAAWoH,EAAK,IAC7C,QAAWnH,IAAP+sE,QAA2B/sE,IAAPgtE,EAAkB,CACtC,MAAMviC,EAAOjxB,EAAIrS,GAAMqS,EAAIrS,EAAK,GAChC,MAAM,IAAIlH,MAAM,+CAAiDwqC,EAAO,cAAgBtjC,EAC5F,CACA2P,EAAMg2D,GAAW,GAALC,EAAUC,CAC1B,CACA,OAAOl2D,CACX,CAEO,SAAS,GAAgBvC,GAC5B,OAAO83D,GAAY,GAAW93D,GAClC,CACO,SAAS,GAAgBA,GAE5B,OADA,GAAOA,GACA83D,GAAY,GAAWzoE,WAAWk5B,KAAKvoB,GAAO4pC,WACzD,CACO,SAAS,GAAgB5/C,EAAGkK,GAC/B,OAAO,GAAWlK,EAAEmC,SAAS,IAAI0rE,SAAe,EAAN3jE,EAAS,KACvD,CACO,SAAS,GAAgBlK,EAAGkK,GAC/B,OAAO,GAAgBlK,EAAGkK,GAAK01C,SACnC,CAcO,SAAS,GAAYguB,EAAO3yD,EAAKyzD,GACpC,IAAIjsC,EACJ,GAAmB,iBAARxnB,EACP,IACIwnB,EAAM,GAAWxnB,EACrB,CACA,MAAOjS,GACH,MAAM,IAAItH,MAAM,GAAGksE,oCAAwC3yD,cAAgBjS,IAC/E,KAEC,KAAI,GAAQiS,GAMb,MAAM,IAAIvZ,MAAM,GAAGksE,sCAHnBnrC,EAAMp9B,WAAWk5B,KAAKtjB,EAI1B,CACA,MAAM/Q,EAAMu4B,EAAIrjC,OAChB,GAA8B,iBAAnBsvE,GAA+BxkE,IAAQwkE,EAC9C,MAAM,IAAIhtE,MAAM,GAAGksE,cAAkBc,gBAA6BxkE,KACtE,OAAOu4B,CACX,CAIO,SAAS,MAAewc,GAC3B,IAAI0vB,EAAM,EACV,IAAK,IAAIruE,EAAI,EAAGA,EAAI2+C,EAAO7/C,OAAQkB,IAAK,CACpC,MAAMy9B,EAAIkhB,EAAO3+C,GACjB,GAAOy9B,GACP4wC,GAAO5wC,EAAE3+B,MACb,CACA,MAAMqjC,EAAM,IAAIp9B,WAAWspE,GAC3B,IAAK,IAAIruE,EAAI,EAAG8qC,EAAM,EAAG9qC,EAAI2+C,EAAO7/C,OAAQkB,IAAK,CAC7C,MAAMy9B,EAAIkhB,EAAO3+C,GACjBmiC,EAAIh0B,IAAIsvB,EAAGqN,GACXA,GAAOrN,EAAE3+B,MACb,CACA,OAAOqjC,CACX,CAmBA,MAAMmsC,GAAY5uE,GAAmB,iBAANA,GAAkBwtE,IAAOxtE,EACjD,SAAS,GAAQA,EAAGo4B,EAAKlkB,GAC5B,OAAO06D,GAAS5uE,IAAM4uE,GAASx2C,IAAQw2C,GAAS16D,IAAQkkB,GAAOp4B,GAAKA,EAAIkU,CAC5E,CAMO,SAAS,GAAS05D,EAAO5tE,EAAGo4B,EAAKlkB,GAMpC,IAAK,GAAQlU,EAAGo4B,EAAKlkB,GACjB,MAAM,IAAIxS,MAAM,kBAAkBksE,MAAUx1C,YAAclkB,iBAAmBlU,KAAKA,IAC1F,CA8BO,MAAM6uE,GAAW7uE,IAAO0tE,IAAOhmC,OAAO1nC,EAAI,IAAMytE,GAEjDqB,GAAOhtC,GAAS,IAAIz8B,WAAWy8B,GAC/BitC,GAAQv3B,GAAQnyC,WAAWk5B,KAAKiZ,GAQ/B,SAASw3B,GAAeC,EAASC,EAAUC,GAC9C,GAAuB,iBAAZF,GAAwBA,EAAU,EACzC,MAAM,IAAIvtE,MAAM,4BACpB,GAAwB,iBAAbwtE,GAAyBA,EAAW,EAC3C,MAAM,IAAIxtE,MAAM,6BACpB,GAAsB,mBAAXytE,EACP,MAAM,IAAIztE,MAAM,6BAEpB,IAAIwL,EAAI4hE,GAAIG,GACR9uD,EAAI2uD,GAAIG,GACR3uE,EAAI,EACR,MAAMyZ,EAAQ,KACV7M,EAAEisC,KAAK,GACPh5B,EAAEg5B,KAAK,GACP74C,EAAI,CAAC,EAEH+a,EAAI,IAAIta,IAAMouE,EAAOhvD,EAAGjT,KAAMnM,GAC9BquE,EAAS,CAACptD,EAAO8sD,QAEnB3uD,EAAI9E,EAAE0zD,GAAK,CAAC,IAAQ/sD,GACpB9U,EAAImO,IACgB,IAAhB2G,EAAK5iB,SAET+gB,EAAI9E,EAAE0zD,GAAK,CAAC,IAAQ/sD,GACpB9U,EAAImO,IAAG,EAELkM,EAAM,KAER,GAAIjnB,KAAO,IACP,MAAM,IAAIoB,MAAM,2BACpB,IAAIwI,EAAM,EACV,MAAMmhC,EAAM,GACZ,KAAOnhC,EAAMglE,GAAU,CACnBhiE,EAAImO,IACJ,MAAMg0D,EAAKniE,EAAE/L,QACbkqC,EAAIrqC,KAAKquE,GACTnlE,GAAOgD,EAAE9N,MACb,CACA,OAAO,MAAeisC,EAAI,EAW9B,MATiB,CAACrpB,EAAMstD,KAGpB,IAAI7sC,EACJ,IAHA1oB,IACAq1D,EAAOptD,KAEEygB,EAAM6sC,EAAK/nD,OAChB6nD,IAEJ,OADAr1D,IACO0oB,CAAG,CAGlB,CAEA,MAAM8sC,GAAe,CACjBC,OAASxpE,GAAuB,iBAARA,EACxBypE,SAAWzpE,GAAuB,mBAARA,EAC1B0pE,QAAU1pE,GAAuB,kBAARA,EACzBlG,OAASkG,GAAuB,iBAARA,EACxB2pE,mBAAqB3pE,GAAuB,iBAARA,GAAoB,GAAQA,GAChE+wC,cAAgB/wC,GAAQ5C,OAAO2zC,cAAc/wC,GAC7CuS,MAAQvS,GAAQ9G,MAAM+Y,QAAQjS,GAC9BwhB,MAAO,CAACxhB,EAAKkZ,IAAWA,EAAO0wD,GAAGC,QAAQ7pE,GAC1C0J,KAAO1J,GAAuB,mBAARA,GAAsB5C,OAAO2zC,cAAc/wC,EAAIixC,YAGlE,SAAS64B,GAAe5wD,EAAQ6wD,EAAYC,EAAgB,CAAC,GAChE,MAAMC,EAAa,CAACrjD,EAAWhhB,EAAMskE,KACjC,MAAMC,EAAWZ,GAAa3jE,GAC9B,GAAwB,mBAAbukE,EACP,MAAM,IAAIzuE,MAAM,sBAAsBkK,yBAC1C,MAAM5F,EAAMkZ,EAAO0N,GACnB,KAAIsjD,QAAsBzuE,IAARuE,GAEbmqE,EAASnqE,EAAKkZ,IACf,MAAM,IAAIxd,MAAM,iBAAiBT,OAAO2rB,MAAc5mB,aAAeA,gBAAkB4F,IAC3F,EAEJ,IAAK,MAAOghB,EAAWhhB,KAASpJ,OAAO+/D,QAAQwN,GAC3CE,EAAWrjD,EAAWhhB,GAAM,GAChC,IAAK,MAAOghB,EAAWhhB,KAASpJ,OAAO+/D,QAAQyN,GAC3CC,EAAWrjD,EAAWhhB,GAAM,GAChC,OAAOsT,CACX,CAmBO,SAASkxD,GAASrxE,GACrB,MAAMqQ,EAAM,IAAI8/B,QAChB,MAAO,CAACmhC,KAAQlsE,KACZ,MAAM6B,EAAMoJ,EAAIZ,IAAI6hE,GACpB,QAAY5uE,IAARuE,EACA,OAAOA,EACX,MAAMsqE,EAAWvxE,EAAGsxE,KAAQlsE,GAE5B,OADAiL,EAAIX,IAAI4hE,EAAKC,GACNA,CAAQ,CAEvB,CCvUA,MAAM,GAAM5oC,OAAO,GAAI,GAAMA,OAAO,GAAI,GAAMA,OAAO,GAAI6oC,GAAM7oC,OAAO,GAEhE8oC,GAAM9oC,OAAO,GAAI+oC,GAAM/oC,OAAO,GAAIgpC,GAAMhpC,OAAO,GAI9C,SAAS,GAAI3J,EAAGh9B,GACnB,MAAM8Q,EAASksB,EAAIh9B,EACnB,OAAO8Q,GAAU,GAAMA,EAAS9Q,EAAI8Q,CACxC,CAQO,SAAS5K,GAAI6mC,EAAK6iC,EAAOC,GAC5B,GAAIA,GAAU,IAAOD,EAAQ,GACzB,MAAM,IAAIjvE,MAAM,6BACpB,GAAIkvE,IAAW,GACX,OAAO,GACX,IAAInuC,EAAM,GACV,KAAOkuC,EAAQ,IACPA,EAAQ,KACRluC,EAAOA,EAAMqL,EAAO8iC,GACxB9iC,EAAOA,EAAMA,EAAO8iC,EACpBD,IAAU,GAEd,OAAOluC,CACX,CAEO,SAASouC,GAAKp2D,EAAGk2D,EAAOC,GAC3B,IAAInuC,EAAMhoB,EACV,KAAOk2D,KAAU,IACbluC,GAAOA,EACPA,GAAOmuC,EAEX,OAAOnuC,CACX,CAEO,SAASquC,GAAOh6B,EAAQ85B,GAC3B,GAAI95B,IAAW,IAAO85B,GAAU,GAC5B,MAAM,IAAIlvE,MAAM,6CAA6Co1C,SAAc85B,KAI/E,IAAI7yC,EAAI,GAAI+Y,EAAQ85B,GAChB7vE,EAAI6vE,EAEJn2D,EAAI,GAAKs2D,EAAI,GAAKC,EAAI,GAAK9jE,EAAI,GACnC,KAAO6wB,IAAM,IAAK,CAEd,MAAMtD,EAAI15B,EAAIg9B,EACRzyB,EAAIvK,EAAIg9B,EACRxd,EAAI9F,EAAIu2D,EAAIv2C,EACZz6B,EAAI+wE,EAAI7jE,EAAIutB,EAElB15B,EAAIg9B,EAAGA,EAAIzyB,EAAGmP,EAAIu2D,EAAGD,EAAI7jE,EAAG8jE,EAAIzwD,EAAGrT,EAAIlN,CAC3C,CAEA,GADYe,IACA,GACR,MAAM,IAAIW,MAAM,0BACpB,OAAO,GAAI+Y,EAAGm2D,EAClB,CA5DYlpC,OAAO,GAAWA,OAAO,IAwL9B,MAEDupC,GAAe,CACjB,SAAU,UAAW,MAAO,MAAO,MAAO,OAAQ,MAClD,MAAO,MAAO,MAAO,MAAO,MAAO,MACnC,OAAQ,OAAQ,OAAQ,QAkFrB,SAASC,GAAQlxE,EAAGmxE,GAEvB,MAAMC,OAA6B3vE,IAAf0vE,EAA2BA,EAAanxE,EAAEmC,SAAS,GAAG/C,OAE1E,MAAO,CAAE+xE,WAAYC,EAAaC,YADdnxE,KAAKC,KAAKixE,EAAc,GAEhD,CAgBO,SAASlmD,GAAMomD,EAAOC,EAAQz4B,GAAO,EAAO04B,EAAQ,CAAC,GACxD,GAAIF,GAAS,GACT,MAAM,IAAI5vE,MAAM,iCAAiC4vE,KACrD,MAAQH,WAAYt5D,EAAMw5D,YAAaI,GAAUP,GAAQI,EAAOC,GAChE,GAAIE,EAAQ,KACR,MAAM,IAAI/vE,MAAM,mDACpB,MAAMgwE,EA7KH,SAAgBC,GAKnB,GAAIA,EAAInB,KAAQD,GAAK,CAKjB,MAAMqB,GAAUD,EAAI,IAAOnB,GAC3B,OAAO,SAAmBZ,EAAI5vE,GAC1B,MAAMuU,EAAOq7D,EAAG3oE,IAAIjH,EAAG4xE,GAEvB,IAAKhC,EAAGiC,IAAIjC,EAAGkC,IAAIv9D,GAAOvU,GACtB,MAAM,IAAI0B,MAAM,2BACpB,OAAO6S,CACX,CACJ,CAEA,GAAIo9D,EAAIjB,KAAQD,GAAK,CACjB,MAAMpmE,GAAMsnE,EAAIlB,IAAOC,GACvB,OAAO,SAAmBd,EAAI5vE,GAC1B,MAAMyuE,EAAKmB,EAAGmC,IAAI/xE,EAAG,IACfkN,EAAI0iE,EAAG3oE,IAAIwnE,EAAIpkE,GACf2nE,EAAKpC,EAAGmC,IAAI/xE,EAAGkN,GACf5M,EAAIsvE,EAAGmC,IAAInC,EAAGmC,IAAIC,EAAI,IAAM9kE,GAC5BqH,EAAOq7D,EAAGmC,IAAIC,EAAIpC,EAAGqC,IAAI3xE,EAAGsvE,EAAGsC,MACrC,IAAKtC,EAAGiC,IAAIjC,EAAGkC,IAAIv9D,GAAOvU,GACtB,MAAM,IAAI0B,MAAM,2BACpB,OAAO6S,CACX,CACJ,CAwBA,OAhHG,SAAuBo9D,GAM1B,MAAMQ,GAAaR,EAAI,IAAO,GAC9B,IAAIS,EAAGC,EAAGC,EAGV,IAAKF,EAAIT,EAAI,GAAKU,EAAI,EAAGD,EAAI,KAAQ,GAAKA,GAAK,GAAKC,KAGpD,IAAKC,EAAI,GAAKA,EAAIX,GAAK1qE,GAAIqrE,EAAGH,EAAWR,KAAOA,EAAI,GAAKW,KAGzD,GAAU,IAAND,EAAS,CACT,MAAMT,GAAUD,EAAI,IAAOnB,GAC3B,OAAO,SAAqBZ,EAAI5vE,GAC5B,MAAMuU,EAAOq7D,EAAG3oE,IAAIjH,EAAG4xE,GACvB,IAAKhC,EAAGiC,IAAIjC,EAAGkC,IAAIv9D,GAAOvU,GACtB,MAAM,IAAI0B,MAAM,2BACpB,OAAO6S,CACX,CACJ,CAEA,MAAMg+D,GAAUH,EAAI,IAAO,GAC3B,OAAO,SAAqBxC,EAAI5vE,GAE5B,GAAI4vE,EAAG3oE,IAAIjH,EAAGmyE,KAAevC,EAAG4C,IAAI5C,EAAGsC,KACnC,MAAM,IAAIxwE,MAAM,2BACpB,IAAI4J,EAAI+mE,EAEJI,EAAI7C,EAAG3oE,IAAI2oE,EAAGmC,IAAInC,EAAGsC,IAAKI,GAAIF,GAC9B33D,EAAIm1D,EAAG3oE,IAAIjH,EAAGuyE,GACdxxE,EAAI6uE,EAAG3oE,IAAIjH,EAAGoyE,GAClB,MAAQxC,EAAGiC,IAAI9wE,EAAG6uE,EAAGsC,MAAM,CACvB,GAAItC,EAAGiC,IAAI9wE,EAAG6uE,EAAG8C,MACb,OAAO9C,EAAG8C,KAEd,IAAInyD,EAAI,EACR,IAAK,IAAIoyD,EAAK/C,EAAGkC,IAAI/wE,GAAIwf,EAAIjV,IACrBskE,EAAGiC,IAAIc,EAAI/C,EAAGsC,KADU3xD,IAG5BoyD,EAAK/C,EAAGkC,IAAIa,GAGhB,MAAMC,EAAKhD,EAAG3oE,IAAIwrE,EAAG,IAAO/qC,OAAOp8B,EAAIiV,EAAI,IAC3CkyD,EAAI7C,EAAGkC,IAAIc,GACXn4D,EAAIm1D,EAAGmC,IAAIt3D,EAAGm4D,GACd7xE,EAAI6uE,EAAGmC,IAAIhxE,EAAG0xE,GACdnnE,EAAIiV,CACR,CACA,OAAO9F,CACX,CACJ,CAyDWo4D,CAAclB,EACzB,CAoHkBmB,CAAOxB,GACf92D,EAAIhY,OAAO4P,OAAO,CACpBk/D,QACAz5D,OACA45D,QACAsB,KAAMlE,GAAQh3D,GACd66D,KAAM,GACNR,IAAK,GACL/hE,OAAS29B,GAAQ,GAAIA,EAAKwjC,GAC1BzB,QAAU/hC,IACN,GAAmB,iBAARA,EACP,MAAM,IAAIpsC,MAAM,sDAAsDosC,GAC1E,OAAO,IAAOA,GAAOA,EAAMwjC,CAAK,EAEpC0B,IAAMllC,GAAQA,IAAQ,GACtBmlC,MAAQnlC,IAASA,EAAM,MAAS,GAChC0kC,IAAM1kC,GAAQ,IAAKA,EAAKwjC,GACxBO,IAAK,CAACqB,EAAKC,IAAQD,IAAQC,EAC3BrB,IAAMhkC,GAAQ,GAAIA,EAAMA,EAAKwjC,GAC7BxmD,IAAK,CAACooD,EAAKC,IAAQ,GAAID,EAAMC,EAAK7B,GAClCW,IAAK,CAACiB,EAAKC,IAAQ,GAAID,EAAMC,EAAK7B,GAClCS,IAAK,CAACmB,EAAKC,IAAQ,GAAID,EAAMC,EAAK7B,GAClCrqE,IAAK,CAAC6mC,EAAK6iC,IA/GZ,SAAen2D,EAAGszB,EAAK6iC,GAG1B,GAAIA,EAAQ,GACR,MAAM,IAAIjvE,MAAM,sBACpB,GAAIivE,IAAU,GACV,OAAOn2D,EAAE03D,IACb,GAAIvB,IAAU,GACV,OAAO7iC,EACX,IAAI/tC,EAAIya,EAAE03D,IACN1xD,EAAIstB,EACR,KAAO6iC,EAAQ,IACPA,EAAQ,KACR5wE,EAAIya,EAAEu3D,IAAIhyE,EAAGygB,IACjBA,EAAIhG,EAAEs3D,IAAItxD,GACVmwD,IAAU,GAEd,OAAO5wE,CACX,CA6F6BqzE,CAAM54D,EAAGszB,EAAK6iC,GACnC0C,IAAK,CAACH,EAAKC,IAAQ,GAAID,EAAMpC,GAAOqC,EAAK7B,GAAQA,GAEjDgC,KAAOxlC,GAAQA,EAAMA,EACrBylC,KAAM,CAACL,EAAKC,IAAQD,EAAMC,EAC1BK,KAAM,CAACN,EAAKC,IAAQD,EAAMC,EAC1BM,KAAM,CAACP,EAAKC,IAAQD,EAAMC,EAC1BO,IAAM5lC,GAAQgjC,GAAOhjC,EAAKwjC,GAC1BqC,KAAMnC,EAAMmC,MAAQ,CAAE3zE,GAAM0xE,EAAMl3D,EAAGxa,IACrC4zE,YAAcrK,GAjGf,SAAuB/uD,EAAGq5D,GAC7B,MAAMr7B,EAAM,IAAIt5C,MAAM20E,EAAKz0E,QAErB00E,EAAiBD,EAAK/nC,QAAO,CAAC8P,EAAK9N,EAAKxtC,IACtCka,EAAEw4D,IAAIllC,GACC8N,GACXpD,EAAIl4C,GAAKs7C,EACFphC,EAAEu3D,IAAIn2B,EAAK9N,KACnBtzB,EAAE03D,KAEC6B,EAAWv5D,EAAEk5D,IAAII,GAQvB,OANAD,EAAKG,aAAY,CAACp4B,EAAK9N,EAAKxtC,IACpBka,EAAEw4D,IAAIllC,GACC8N,GACXpD,EAAIl4C,GAAKka,EAAEu3D,IAAIn2B,EAAKpD,EAAIl4C,IACjBka,EAAEu3D,IAAIn2B,EAAK9N,KACnBimC,GACIv7B,CACX,CA8E8By7B,CAAcz5D,EAAG+uD,GAGvC2K,KAAM,CAACn2C,EAAGh9B,EAAGQ,IAAOA,EAAIR,EAAIg9B,EAC5Bka,QAAUnK,GAASgL,EAAO,GAAgBhL,EAAK2jC,GAAS,GAAgB3jC,EAAK2jC,GAC7E0C,UAAYn+D,IACR,GAAIA,EAAM5W,SAAWqyE,EACjB,MAAM,IAAI/vE,MAAM,0BAA0B+vE,UAAcz7D,EAAM5W,UAClE,OAAO05C,EAAO,GAAgB9iC,GAAS,GAAgBA,EAAM,IAGrE,OAAOxT,OAAO4P,OAAOoI,EACzB,CAkCO,SAAS45D,GAAoBC,GAChC,GAA0B,iBAAfA,EACP,MAAM,IAAI3yE,MAAM,8BACpB,MAAM4yE,EAAYD,EAAWlyE,SAAS,GAAG/C,OACzC,OAAOc,KAAKC,KAAKm0E,EAAY,EACjC,CAQO,SAASC,GAAiBF,GAC7B,MAAMj1E,EAASg1E,GAAoBC,GACnC,OAAOj1E,EAASc,KAAKC,KAAKf,EAAS,EACvC,CC3YA,MAAM,GAAMsoC,OAAO,GACb,GAAMA,OAAO,GAGb8sC,GAAmB,IAAItlC,QACvBulC,GAAmB,IAAIvlC,QAYtB,SAASwlC,GAAKnzE,EAAGmX,GACpB,MAAMi8D,EAAkB,CAACC,EAAWxvB,KAChC,MAAMotB,EAAMptB,EAAKyvB,SACjB,OAAOD,EAAYpC,EAAMptB,CAAI,EAE3B0vB,EAAaC,IACf,IAAK3xE,OAAO2zC,cAAcg+B,IAAMA,GAAK,GAAKA,EAAIr8D,EAC1C,MAAM,IAAIhX,MAAM,qBAAqBqzE,oBAAoBr8D,KAAQ,EAEnEqwB,EAAQgsC,IACVD,EAAUC,GAGH,CAAEC,QAFO90E,KAAKC,KAAKuY,EAAOq8D,GAAK,EAEpBE,WADC,IAAMF,EAAI,KAGjC,MAAO,CACHJ,kBAEA,YAAAO,CAAaC,EAAKn1E,GACd,IAAID,EAAIwB,EAAEmxE,KACNlyD,EAAI20D,EACR,KAAOn1E,EAAI,IACHA,EAAI,KACJD,EAAIA,EAAE+qB,IAAItK,IACdA,EAAIA,EAAEiX,SACNz3B,IAAM,GAEV,OAAOD,CACX,EAWA,gBAAAq1E,CAAiBD,EAAKJ,GAClB,MAAM,QAAEC,EAAO,WAAEC,GAAelsC,EAAKgsC,GAC/BM,EAAS,GACf,IAAIt1E,EAAIo1E,EACJ3xD,EAAOzjB,EACX,IAAK,IAAI4L,EAAS,EAAGA,EAASqpE,EAASrpE,IAAU,CAC7C6X,EAAOzjB,EACPs1E,EAAOr0E,KAAKwiB,GAEZ,IAAK,IAAIljB,EAAI,EAAGA,EAAI20E,EAAY30E,IAC5BkjB,EAAOA,EAAKsH,IAAI/qB,GAChBs1E,EAAOr0E,KAAKwiB,GAEhBzjB,EAAIyjB,EAAKiU,QACb,CACA,OAAO49C,CACX,EAQA,IAAAX,CAAKK,EAAGO,EAAat1E,GAGjB,MAAM,QAAEg1E,EAAO,WAAEC,GAAelsC,EAAKgsC,GACrC,IAAIh1E,EAAIwB,EAAEmxE,KACNl4D,EAAIjZ,EAAE6nC,KACV,MAAMzlB,EAAO+jB,OAAO,GAAKqtC,EAAI,GACvBQ,EAAY,GAAKR,EACjBS,EAAU9tC,OAAOqtC,GACvB,IAAK,IAAIppE,EAAS,EAAGA,EAASqpE,EAASrpE,IAAU,CAC7C,MAAMtM,EAASsM,EAASspE,EAExB,IAAIQ,EAAQryE,OAAOpD,EAAI2jB,GAEvB3jB,IAAMw1E,EAGFC,EAAQR,IACRQ,GAASF,EACTv1E,GAAK,IAST,MAAM01E,EAAUr2E,EACVs2E,EAAUt2E,EAASa,KAAKyP,IAAI8lE,GAAS,EACrCG,EAAQjqE,EAAS,GAAM,EACvBkqE,EAAQJ,EAAQ,EACR,IAAVA,EAEAj7D,EAAIA,EAAEsQ,IAAI6pD,EAAgBiB,EAAON,EAAYI,KAG7C31E,EAAIA,EAAE+qB,IAAI6pD,EAAgBkB,EAAOP,EAAYK,IAErD,CAMA,MAAO,CAAE51E,IAAGya,IAChB,EACA,UAAAs7D,CAAWnE,EAAG3xE,EAAG+1E,GACb,MAAMhB,EAAIN,GAAiBjmE,IAAImjE,IAAM,EAErC,IAAIqE,EAAOxB,GAAiBhmE,IAAImjE,GAMhC,OALKqE,IACDA,EAAOtyE,KAAK0xE,iBAAiBzD,EAAGoD,GACtB,IAANA,GACAP,GAAiB/lE,IAAIkjE,EAAGoE,EAAUC,KAEnCtyE,KAAKgxE,KAAKK,EAAGiB,EAAMh2E,EAC9B,EAIA,aAAAi2E,CAActE,EAAGoD,GACbD,EAAUC,GACVN,GAAiBhmE,IAAIkjE,EAAGoD,GACxBP,GAAiB9tB,OAAOirB,EAC5B,EAER,CACO,SAASuE,GAAcC,GAY1B,ODmCG,SAAuB3uD,GAC1B,MAMMuhB,EAAOkoC,GAAanlC,QAAO,CAAC18B,EAAKpJ,KACnCoJ,EAAIpJ,GAAO,WACJoJ,IARK,CACZkiE,MAAO,SACPyB,KAAM,SACNtB,MAAO,gBACP55D,KAAM,kBAMHi4D,GAAetoD,EAAOuhB,EACjC,CC1DIqtC,CAAcD,EAAMvG,IACpBE,GAAeqG,EAAO,CAClBn2E,EAAG,SACHqb,EAAG,SACHg7D,GAAI,QACJC,GAAI,SACL,CACCnF,WAAY,gBACZE,YAAa,kBAGV7uE,OAAO4P,OAAO,IACd8+D,GAAQiF,EAAMn2E,EAAGm2E,EAAMhF,eACvBgF,EACEp2E,EAAGo2E,EAAMvG,GAAG0B,OAEzB,CCjKA,MAAM,GAAM5pC,OAAO,GAAI,GAAMA,OAAO,GAAI,GAAMA,OAAO,GAAI,GAAMA,OAAO,GAEhE6uC,GAAiB,CAAEC,QAAQ,GCPjC,MAAM,GAAM9uC,OAAO,GACb,GAAMA,OAAO,GCUnB,MAAM+uC,GAAY/uC,OAAO,iFAEnBgvC,GAAkChvC,OAAO,iFAExB,IAAXA,OAAO,GAAUA,OAAO,IAAI,GAAMA,OAAO,GAAI,GAAMA,OAAO,GAEhE,GAAMA,OAAO,GAAI,GAAMA,OAAO,GACpC,SAASivC,GAAoBl8D,GAEzB,MAAMm8D,EAAOlvC,OAAO,IAAKmvC,EAAOnvC,OAAO,IAAKovC,EAAOpvC,OAAO,IAAKqvC,EAAOrvC,OAAO,IACvEiqC,EAAI8E,GAEJz6D,EADMvB,EAAIA,EAAKk3D,EACJl3D,EAAKk3D,EAChBz1D,EAAM20D,GAAK70D,EAAI,GAAK21D,GAAK31D,EAAM21D,EAC/Bx1D,EAAM00D,GAAK30D,EAAI,GAAKy1D,GAAKl3D,EAAKk3D,EAC9Bn1D,EAAOq0D,GAAK10D,EAAI,GAAKw1D,GAAKx1D,EAAMw1D,EAChCz0D,EAAO2zD,GAAKr0D,EAAKo6D,EAAMjF,GAAKn1D,EAAOm1D,EACnCrzD,EAAOuyD,GAAK3zD,EAAK25D,EAAMlF,GAAKz0D,EAAOy0D,EACnCqF,EAAOnG,GAAKvyD,EAAKw4D,EAAMnF,GAAKrzD,EAAOqzD,EACnCsF,EAAQpG,GAAKmG,EAAKD,EAAMpF,GAAKqF,EAAOrF,EACpCuF,EAAQrG,GAAKoG,EAAMF,EAAMpF,GAAKqF,EAAOrF,EACrCwF,EAAQtG,GAAKqG,EAAMN,EAAMjF,GAAKn1D,EAAOm1D,EAG3C,MAAO,CAAEyF,UAFUvG,GAAKsG,EAAM,GAAKxF,GAAKl3D,EAAKk3D,EAEzB31D,KACxB,CACA,SAASq7D,GAAkBrhE,GAQvB,OALAA,EAAM,IAAM,IAEZA,EAAM,KAAO,IAEbA,EAAM,KAAO,GACNA,CACX,CAEA,SAASshE,GAAQtG,EAAG9jE,GAChB,MAAMykE,EAAI8E,GACJ/gE,EAAK,GAAIxI,EAAIA,EAAIA,EAAGykE,GACpB77D,EAAK,GAAIJ,EAAKA,EAAKxI,EAAGykE,GAG5B,IAAIl3D,EAAI,GAAIu2D,EAAIt7D,EADJihE,GAAoB3F,EAAIl7D,GAAIshE,UACdzF,GAC1B,MAAM4F,EAAM,GAAIrqE,EAAIuN,EAAIA,EAAGk3D,GACrB6F,EAAQ/8D,EACRg9D,EAAQ,GAAIh9D,EAAIi8D,GAAiB/E,GACjC+F,EAAWH,IAAQvG,EACnB2G,EAAWJ,IAAQ,IAAKvG,EAAGW,GAC3BiG,EAASL,IAAQ,IAAKvG,EAAI0F,GAAiB/E,GAOjD,OANI+F,IACAj9D,EAAI+8D,IACJG,GAAYC,KACZn9D,EAAIg9D,IJ6HkC,GI5HzBh9D,EAAGk3D,GJ4HyC,MAAS,KI3HlEl3D,EAAI,IAAKA,EAAGk3D,IACT,CAAE9B,QAAS6H,GAAYC,EAAUx0E,MAAOsX,EACnD,CAEO,MAUDm1D,GAAqB,KAAO1kD,GAAMurD,QAAWh1E,GAAW,GAAnC,GACrBo2E,GAAkC,MAAO,CAE3C95C,EAAG2J,QAAQ,GAGXlnB,EAAGknB,OAAO,iFAEVkoC,MAGA5vE,EAAG0nC,OAAO,gFAEVrsB,EAAG,GAEHg7D,GAAI3uC,OAAO,iFACX4uC,GAAI5uC,OAAO,iFACXh4B,KAAM,GACNooE,YAAW,GACXT,qBAIAC,aAtBoC,GA2B3BS,GAA0B,KF7EhC,SAAwBC,GAC3B,MAAMC,EAxBV,SAAsB9B,GAClB,MAAMptC,EAAOmtC,GAAcC,GAa3B,OAZA,GAAkBA,EAAO,CACrBzmE,KAAM,WACNquB,EAAG,SACHvd,EAAG,SACHs3D,YAAa,YACd,CACCT,kBAAmB,WACnBa,OAAQ,WACRZ,QAAS,WACTa,WAAY,aAGT31E,OAAO4P,OAAO,IAAK22B,GAC9B,CASkBqvC,CAAaJ,IACrB,GAAEpI,EAAI5vE,EAAgBq4E,QAASA,EAAS3oE,KAAM4oE,EAAK,YAAER,EAAW,YAAEzG,EAAah2D,EAAGk9D,GAAcN,EAChGlF,EAAO,IAAQrrC,OAAqB,EAAd2pC,GAAmB,GACzCmH,EAAO5I,EAAGz/D,OAEVmnE,EAAUW,EAAMX,SAClB,EAAEtG,EAAG9jE,KACD,IACI,MAAO,CAAE2iE,SAAS,EAAM1sE,MAAOysE,EAAG+D,KAAK3C,EAAIpB,EAAG8D,IAAIxmE,IACtD,CACA,MAAOlE,GACH,MAAO,CAAE6mE,SAAS,EAAO1sE,MAAO,GACpC,CACH,GACCk0E,EAAoBY,EAAMZ,mBAAqB,CAAErhE,GAAUA,GAC3DkiE,EAASD,EAAMC,QACjB,EAAEp2C,EAAM9iC,EAAKy5E,KAET,GADA9K,GAAM,SAAU8K,GACZz5E,EAAII,QAAUq5E,EACd,MAAM,IAAI/2E,MAAM,uCACpB,OAAOogC,CACV,GAGL,SAAS42C,EAAY9K,EAAO5tE,GACxB,GAAY,cAAgB4tE,EAAO5tE,EAAG,GAAK+yE,EAC/C,CACA,SAAS4F,EAAY9oC,GACjB,KAAMA,aAAiB+oC,GACnB,MAAM,IAAIl3E,MAAM,yBACxB,CAGA,MAAMm3E,EAAezI,IAAS,CAACrwE,EAAG+4E,KAC9B,MAAQC,GAAIt+D,EAAGu+D,GAAIjI,EAAGkI,GAAIC,GAAMn5E,EAC1BizE,EAAMjzE,EAAEizE,MACJ,MAAN8F,IACAA,EAAK9F,EAAM,GAAMpD,EAAG8D,IAAIwF,IAC5B,MAAMC,EAAKX,EAAK/9D,EAAIq+D,GACdM,EAAKZ,EAAKzH,EAAI+H,GACdO,EAAKb,EAAKU,EAAIJ,GACpB,GAAI9F,EACA,MAAO,CAAEv4D,EAAG,GAAKs2D,EAAG,IACxB,GAAIsI,IAAO,GACP,MAAM,IAAI33E,MAAM,oBACpB,MAAO,CAAE+Y,EAAG0+D,EAAIpI,EAAGqI,EAAI,IAErBE,EAAkBlJ,IAAUrwE,IAC9B,MAAM,EAAEg+B,EAAC,EAAEvd,GAAMy3D,EACjB,GAAIl4E,EAAEizE,MACF,MAAM,IAAItxE,MAAM,mBAGpB,MAAQq3E,GAAIQ,EAAGP,GAAIQ,EAAGP,GAAI3G,EAAGmH,GAAIC,GAAM35E,EACjC45E,EAAKnB,EAAKe,EAAIA,GACdK,EAAKpB,EAAKgB,EAAIA,GACdK,EAAKrB,EAAKlG,EAAIA,GACdwH,EAAKtB,EAAKqB,EAAKA,GACfE,EAAMvB,EAAKmB,EAAK57C,GAGtB,GAFay6C,EAAKqB,EAAKrB,EAAKuB,EAAMH,MACpBpB,EAAKsB,EAAKtB,EAAKh4D,EAAIg4D,EAAKmB,EAAKC,KAEvC,MAAM,IAAIl4E,MAAM,yCAIpB,GAFW82E,EAAKe,EAAIC,KACThB,EAAKlG,EAAIoH,GAEhB,MAAM,IAAIh4E,MAAM,yCACpB,OAAO,CAAI,IAIf,MAAMk3E,EACF,WAAApoE,CAAYuoE,EAAIC,EAAIC,EAAIQ,GACpB/1E,KAAKq1E,GAAKA,EACVr1E,KAAKs1E,GAAKA,EACVt1E,KAAKu1E,GAAKA,EACVv1E,KAAK+1E,GAAKA,EACVf,EAAY,IAAKK,GACjBL,EAAY,IAAKM,GACjBN,EAAY,IAAKO,GACjBP,EAAY,IAAKe,GACjBj3E,OAAO4P,OAAO1O,KAClB,CACA,KAAI+W,GACA,OAAO/W,KAAKs2E,WAAWv/D,CAC3B,CACA,KAAIs2D,GACA,OAAOrtE,KAAKs2E,WAAWjJ,CAC3B,CACA,iBAAOkJ,CAAWl6E,GACd,GAAIA,aAAa64E,EACb,MAAM,IAAIl3E,MAAM,8BACpB,MAAM,EAAE+Y,EAAC,EAAEs2D,GAAMhxE,GAAK,CAAC,EAGvB,OAFA24E,EAAY,IAAKj+D,GACjBi+D,EAAY,IAAK3H,GACV,IAAI6H,EAAMn+D,EAAGs2D,EAAG,GAAKyH,EAAK/9D,EAAIs2D,GACzC,CACA,iBAAOmJ,CAAW7E,GACd,MAAM8E,EAAQvK,EAAGgE,YAAYyB,EAAOjmE,KAAKrP,GAAMA,EAAEk5E,MACjD,OAAO5D,EAAOjmE,KAAI,CAACrP,EAAGO,IAAMP,EAAEi6E,SAASG,EAAM75E,MAAK8O,IAAIwpE,EAAMqB,WAChE,CAEA,cAAAG,CAAenF,GACXoF,EAAKpE,cAAcvyE,KAAMuxE,EAC7B,CAGA,cAAAqF,GACIhB,EAAgB51E,KACpB,CAEA,MAAAksC,CAAOC,GACH8oC,EAAY9oC,GACZ,MAAQkpC,GAAIwB,EAAIvB,GAAIwB,EAAIvB,GAAIwB,GAAO/2E,MAC3Bq1E,GAAIY,EAAIX,GAAIY,EAAIX,GAAIY,GAAOhqC,EAC7B6qC,EAAOlC,EAAK+B,EAAKV,GACjBc,EAAOnC,EAAKmB,EAAKc,GACjBG,EAAOpC,EAAKgC,EAAKX,GACjBgB,EAAOrC,EAAKoB,EAAKa,GACvB,OAAOC,IAASC,GAAQC,IAASC,CACrC,CACA,GAAA7H,GACI,OAAOtvE,KAAKksC,OAAOgpC,EAAMlG,KAC7B,CACA,MAAAmC,GAEI,OAAO,IAAI+D,EAAMJ,GAAM90E,KAAKq1E,IAAKr1E,KAAKs1E,GAAIt1E,KAAKu1E,GAAIT,GAAM90E,KAAK+1E,IAClE,CAIA,MAAAhiD,GACI,MAAM,EAAEsG,GAAMk6C,GACNc,GAAIwB,EAAIvB,GAAIwB,EAAIvB,GAAIwB,GAAO/2E,KAC7Bw2C,EAAIs+B,EAAK+B,EAAKA,GACdpgC,EAAIq+B,EAAKgC,EAAKA,GACdpgC,EAAIo+B,EAAK,GAAMA,EAAKiC,EAAKA,IACzBpgC,EAAIm+B,EAAKz6C,EAAImc,GACb4gC,EAAOP,EAAKC,EACZlgC,EAAIk+B,EAAKA,EAAKsC,EAAOA,GAAQ5gC,EAAIC,GACjCK,EAAIH,EAAIF,EACRI,EAAIC,EAAIJ,EACRK,EAAIJ,EAAIF,EACR4gC,EAAKvC,EAAKl+B,EAAIC,GACdygC,EAAKxC,EAAKh+B,EAAIC,GACdwgC,EAAKzC,EAAKl+B,EAAIG,GACdygC,EAAK1C,EAAKj+B,EAAIC,GACpB,OAAO,IAAIo+B,EAAMmC,EAAIC,EAAIE,EAAID,EACjC,CAIA,GAAAnwD,CAAI+kB,GACA8oC,EAAY9oC,GACZ,MAAM,EAAE9R,EAAC,EAAEvd,GAAMy3D,GACTc,GAAIwB,EAAIvB,GAAIwB,EAAIvB,GAAIwB,EAAIhB,GAAI1+B,GAAOr3C,MACnCq1E,GAAIY,EAAIX,GAAIY,EAAIX,GAAIY,EAAIJ,GAAIz+B,GAAOnL,EAK3C,GAAI9R,IAAM2J,QAAQ,GAAI,CAClB,MAAMwS,EAAIs+B,GAAMgC,EAAKD,IAAOX,EAAKD,IAC3Bx/B,EAAIq+B,GAAMgC,EAAKD,IAAOX,EAAKD,IAC3Bp/B,EAAIi+B,EAAKr+B,EAAID,GACnB,GAAIK,IAAM,GACN,OAAO72C,KAAK+zB,SAChB,MAAM2iB,EAAIo+B,EAAKiC,EAAK,GAAMz/B,GACpBX,EAAIm+B,EAAKz9B,EAAK,GAAM8+B,GACpBv/B,EAAID,EAAID,EACRI,EAAIL,EAAID,EACRO,EAAIJ,EAAID,EACR2gC,EAAKvC,EAAKl+B,EAAIC,GACdygC,EAAKxC,EAAKh+B,EAAIC,GACdwgC,EAAKzC,EAAKl+B,EAAIG,GACdygC,EAAK1C,EAAKj+B,EAAIC,GACpB,OAAO,IAAIo+B,EAAMmC,EAAIC,EAAIE,EAAID,EACjC,CACA,MAAM/gC,EAAIs+B,EAAK+B,EAAKZ,GACdx/B,EAAIq+B,EAAKgC,EAAKZ,GACdx/B,EAAIo+B,EAAKz9B,EAAKv6B,EAAIw6B,GAClBX,EAAIm+B,EAAKiC,EAAKZ,GACdv/B,EAAIk+B,GAAM+B,EAAKC,IAAOb,EAAKC,GAAM1/B,EAAIC,GACrCI,EAAIF,EAAID,EACRI,EAAIH,EAAID,EACRK,EAAI+9B,EAAKr+B,EAAIpc,EAAImc,GACjB6gC,EAAKvC,EAAKl+B,EAAIC,GACdygC,EAAKxC,EAAKh+B,EAAIC,GACdwgC,EAAKzC,EAAKl+B,EAAIG,GACdygC,EAAK1C,EAAKj+B,EAAIC,GACpB,OAAO,IAAIo+B,EAAMmC,EAAIC,EAAIE,EAAID,EACjC,CACA,QAAAE,CAAStrC,GACL,OAAOnsC,KAAKonB,IAAI+kB,EAAMglC,SAC1B,CACA,IAAAH,CAAK10E,GACD,OAAOq6E,EAAKvE,WAAWpyE,KAAM1D,EAAG44E,EAAMsB,WAC1C,CAEA,QAAAkB,CAASC,GACL,MAAMr7E,EAAIq7E,EACV,GAAY,SAAUr7E,EAAG,GAAKs7E,GAC9B,MAAM,EAAEv7E,EAAC,EAAEya,GAAM9W,KAAKgxE,KAAK10E,GAC3B,OAAO44E,EAAMsB,WAAW,CAACn6E,EAAGya,IAAI,EACpC,CAKA,cAAA+gE,CAAeF,GACX,MAAMr7E,EAAIq7E,EAEV,OADA,GAAY,SAAUr7E,EAAG,GAAKs7E,GAC1Bt7E,IAAM,GACCw7E,EACP93E,KAAKksC,OAAO4rC,IAAMx7E,IAAM,GACjB0D,KACPA,KAAKksC,OAAO4K,GACL92C,KAAKgxE,KAAK10E,GAAGD,EACjBs6E,EAAKnF,aAAaxxE,KAAM1D,EACnC,CAKA,YAAAy7E,GACI,OAAO/3E,KAAK63E,eAAehD,GAAUvF,KACzC,CAGA,aAAA0I,GACI,OAAOrB,EAAKnF,aAAaxxE,KAAM43E,GAAatI,KAChD,CAGA,QAAAgH,CAASlB,GACL,OAAOD,EAAan1E,KAAMo1E,EAC9B,CACA,aAAA6C,GACI,MAAQtgE,EAAGk9D,GAAaN,EACxB,OAAIM,IAAa,GACN70E,KACJA,KAAK63E,eAAehD,EAC/B,CAGA,cAAOqD,CAAQ3gE,EAAKu7D,GAAS,GACzB,MAAM,EAAEh2D,EAAC,EAAEud,GAAMk6C,EACX/tE,EAAM0lE,EAAG6B,MACfx2D,EAAM,GAAY,WAAYA,EAAK/Q,GACnCyjE,GAAM,SAAU6I,GAChB,MAAMqF,EAAS5gE,EAAI9Z,QACb26E,EAAW7gE,EAAI/Q,EAAM,GAC3B2xE,EAAO3xE,EAAM,IAAgB,IAAX4xE,EAClB,MAAM/K,EAAI,GAAmB8K,GAIvB3nE,EAAMsiE,EAASzD,EAAOnD,EAAG0B,MAC/B,GAAY,aAAcP,EAAG,GAAK78D,GAGlC,MAAM6nE,EAAKvD,EAAKzH,EAAIA,GACdC,EAAIwH,EAAKuD,EAAK,IACd7uE,EAAIsrE,EAAKh4D,EAAIu7D,EAAKh+C,GACxB,IAAI,QAAE8xC,EAAS1sE,MAAOsX,GAAM68D,EAAQtG,EAAG9jE,GACvC,IAAK2iE,EACD,MAAM,IAAInuE,MAAM,uCACpB,MAAMs6E,GAAUvhE,EAAI,MAAS,GACvBwhE,KAA4B,IAAXH,GACvB,IAAKtF,GAAU/7D,IAAM,IAAOwhE,EAExB,MAAM,IAAIv6E,MAAM,gCAGpB,OAFIu6E,IAAkBD,IAClBvhE,EAAI+9D,GAAM/9D,IACPm+D,EAAMqB,WAAW,CAAEx/D,IAAGs2D,KACjC,CACA,qBAAOmL,CAAeC,GAClB,OAAOC,EAAqBD,GAASE,KACzC,CACA,UAAAC,GACI,MAAM,EAAE7hE,EAAC,EAAEs2D,GAAMrtE,KAAKs2E,WAChBhkE,EAAQ,GAAmB+6D,EAAGnB,EAAG6B,OAEvC,OADAz7D,EAAMA,EAAM5W,OAAS,IAAMqb,EAAI,GAAM,IAAO,EACrCzE,CACX,CACA,KAAAumE,GACI,OAAO,GAAc74E,KAAK44E,aAC9B,EAEJ1D,EAAMxvC,KAAO,IAAIwvC,EAAMX,EAAM5B,GAAI4B,EAAM3B,GAAI,GAAKkC,EAAKP,EAAM5B,GAAK4B,EAAM3B,KACtEsC,EAAMlG,KAAO,IAAIkG,EAAM,GAAK,GAAK,GAAK,IACtC,MAAQxvC,KAAMoR,EAAGk4B,KAAM8I,GAAM5C,EACvByB,EAAO3F,GAAKkE,EAAqB,EAAdvH,GACzB,SAASmL,EAAKz+C,GACV,OAAO,GAAIA,EAAGu9C,EAClB,CAEA,SAASmB,EAAQ/sE,GACb,OAAO8sE,EAAK,GAAmB9sE,GACnC,CAEA,SAAS0sE,EAAqB3sE,GAC1B,MAAMvF,EAAMmnE,EACZ5hE,EAAM,GAAY,cAAeA,EAAKvF,GAGtC,MAAMwyE,EAAS,GAAY,qBAAsBpE,EAAM7oE,GAAM,EAAIvF,GAC3D+oB,EAAOokD,EAAkBqF,EAAOv7E,MAAM,EAAG+I,IACzCZ,EAASozE,EAAOv7E,MAAM+I,EAAK,EAAIA,GAC/BmxE,EAASoB,EAAQxpD,GACjBopD,EAAQ7hC,EAAE4gC,SAASC,GACnBsB,EAAaN,EAAMC,aACzB,MAAO,CAAErpD,OAAM3pB,SAAQ+xE,SAAQgB,QAAOM,aAC1C,CAMA,SAASC,EAAmBnqE,EAAU,IAAIpN,cAAiBw3E,GACvD,MAAMtkC,EAAM,MAAkBskC,GAC9B,OAAOJ,EAAQnE,EAAMJ,EAAO3/B,EAAK,GAAY,UAAW9lC,KAAY4lE,IACxE,CAeA,MAAMyE,EAAavG,GA8CnB,OAjBA/7B,EAAE4/B,eAAe,GAiBV,CACHnC,QACA8E,aAtEJ,SAAsBZ,GAClB,OAAOC,EAAqBD,GAASQ,UACzC,EAqEI/1E,KA9DJ,SAAc2xC,EAAK4jC,EAAS13E,EAAU,CAAC,GACnC8zC,EAAM,GAAY,UAAWA,GACzB8/B,IACA9/B,EAAM8/B,EAAQ9/B,IAClB,MAAM,OAAEjvC,EAAM,OAAE+xE,EAAM,WAAEsB,GAAeP,EAAqBD,GACtD7wE,EAAIsxE,EAAmBn4E,EAAQgO,QAASnJ,EAAQivC,GAChDykC,EAAIxiC,EAAE4gC,SAAS9vE,GAAGgxE,aAElBrjE,EAAIujE,EAAKlxE,EADLsxE,EAAmBn4E,EAAQgO,QAASuqE,EAAGL,EAAYpkC,GACtC8iC,GAGvB,OAFA,GAAY,cAAepiE,EAAG,GAAKqiE,GAE5B,GAAY,SADP,GAAe0B,EAAG,GAAmB/jE,EAAG22D,EAAG6B,QACP,EAAdJ,EACtC,EAmDIziD,OAjDJ,SAAgBquD,EAAK1kC,EAAK2kC,EAAWz4E,EAAUq4E,GAC3C,MAAM,QAAErqE,EAAO,OAAE+jE,GAAW/xE,EACtByF,EAAM0lE,EAAG6B,MACfwL,EAAM,GAAY,YAAaA,EAAK,EAAI/yE,GACxCquC,EAAM,GAAY,UAAWA,QACd92C,IAAX+0E,GACA7I,GAAM,SAAU6I,GAChB6B,IACA9/B,EAAM8/B,EAAQ9/B,IAClB,MAAMt/B,EAAI,GAAmBgkE,EAAI97E,MAAM+I,EAAK,EAAIA,IAGhD,IAAIgwC,EAAG8iC,EAAGG,EACV,IACIjjC,EAAI0+B,EAAMgD,QAAQsB,EAAW1G,GAC7BwG,EAAIpE,EAAMgD,QAAQqB,EAAI97E,MAAM,EAAG+I,GAAMssE,GACrC2G,EAAK3iC,EAAE+gC,eAAetiE,EAC1B,CACA,MAAO7N,GACH,OAAO,CACX,CACA,IAAKorE,GAAUt8B,EAAEuhC,eACb,OAAO,EACX,MAAMt7D,EAAIy8D,EAAmBnqE,EAASuqE,EAAEV,aAAcpiC,EAAEoiC,aAAc/jC,GAGtE,OAFYykC,EAAElyD,IAAIovB,EAAEqhC,eAAep7D,IAExBg7D,SAASgC,GAAIxB,gBAAgB/rC,OAAOgpC,EAAMlG,KACzD,EAuBI0K,cAAexE,EACfyE,MAtBU,CACVjB,uBAEAkB,iBAAkB,IAAMxF,EAAYlI,EAAG6B,OAOvC8L,WAAU,CAACtI,EAAa,EAAGoH,EAAQzD,EAAMxvC,QACrCizC,EAAMjC,eAAenF,GACrBoH,EAAMjB,SAAS1zC,OAAO,IACf20C,IAWnB,CE5T8C,CAAexE,IAAtB,GAc1B2F,GAAyB,KDxG/B,SAAoBxF,GACvB,MAAMC,GAhBNnI,GADkBqG,EAiBS6B,EAhBL,CAClBj6C,EAAG,UACJ,CACC0/C,eAAgB,gBAChBpM,YAAa,gBACbgG,kBAAmB,WACnBa,OAAQ,WACRwF,WAAY,WACZC,GAAI,WAGDn7E,OAAO4P,OAAO,IAAK+jE,KAZ9B,IAAsBA,EAkBlB,MAAM,EAAExE,GAAMsG,EACRO,EAAQx4E,GAAM,GAAIA,EAAG2xE,GACrB8L,EAAiBxF,EAAMwF,eACvBG,EAAkB19E,KAAKC,KAAKs9E,EAAiB,GAC7CI,EAAW5F,EAAM5G,YACjBgG,EAAoBY,EAAMZ,mBAAqB,CAAErhE,GAAUA,GAC3D0nE,EAAazF,EAAMyF,YAAc,CAAEjjE,GAAMxT,GAAIwT,EAAGk3D,EAAIjqC,OAAO,GAAIiqC,IAWrE,SAASmM,EAAMC,EAAMC,EAAKC,GACtB,MAAMjqD,EAAQwkD,EAAKuF,GAAQC,EAAMC,IAGjC,MAAO,CAFPD,EAAMxF,EAAKwF,EAAMhqD,GACjBiqD,EAAMzF,EAAKyF,EAAMjqD,GAErB,CAGA,MAAMkqD,GAAOjG,EAAMl6C,EAAI2J,OAAO,IAAMA,OAAO,GA2D3C,SAASy2C,EAAkBnN,GACvB,OAAO,GAAgBwH,EAAKxH,GAAI4M,EACpC,CAgBA,SAASQ,EAAW/C,EAAQrK,GACxB,MAAMqN,EAhBV,SAA2BC,GAGvB,MAAMtN,EAAI,GAAY,eAAgBsN,EAAMV,GAG5C,OAFiB,KAAbC,IACA7M,EAAE,KAAO,KACN,GAAgBA,EAC3B,CASmBuN,CAAkBvN,GAC3BwN,EATV,SAAsBx+E,GAClB,MAAMgW,EAAQ,GAAY,SAAUhW,GAC9BkK,EAAM8L,EAAM5W,OAClB,GAAI8K,IAAQ0zE,GAAmB1zE,IAAQ2zE,EACnC,MAAM,IAAIn8E,MAAM,YAAYk8E,QAAsBC,gBAAuB3zE,KAC7E,OAAO,GAAgBmtE,EAAkBrhE,GAC7C,CAGoByoE,CAAapD,GACvBqD,EAzEV,SAA0B1N,EAAGqK,GACzB,GAAS,IAAKrK,EAAG,GAAKW,GACtB,GAAS,SAAU0J,EAAQ,GAAK1J,GAGhC,MAAMxxD,EAAIk7D,EACJsD,EAAM3N,EACZ,IAKI4N,EALAZ,EAAM,GACNa,EAAM,GACNZ,EAAMjN,EACN8N,EAAM,GACNf,EAAO,GAEX,IAAK,IAAIp9E,EAAI+mC,OAAO+1C,EAAiB,GAAI98E,GAAK,GAAKA,IAAK,CACpD,MAAMo+E,EAAO5+D,GAAKxf,EAAK,GACvBo9E,GAAQgB,EACRH,EAAKd,EAAMC,EAAMC,EAAKC,GACtBD,EAAMY,EAAG,GACTX,EAAMW,EAAG,GACTA,EAAKd,EAAMC,EAAMc,EAAKC,GACtBD,EAAMD,EAAG,GACTE,EAAMF,EAAG,GACTb,EAAOgB,EACP,MAAM7kC,EAAI8jC,EAAMa,EACVG,EAAKxG,EAAKt+B,EAAIA,GACdC,EAAI6jC,EAAMa,EACVI,EAAKzG,EAAKr+B,EAAIA,GACdG,EAAI0kC,EAAKC,EACT7kC,EAAI6jC,EAAMa,EAEVI,EAAK1G,GADDyF,EAAMa,GACI5kC,GACdilC,EAAK3G,EAAKp+B,EAAID,GACdilC,EAAOF,EAAKC,EACZE,EAAQH,EAAKC,EACnBlB,EAAMzF,EAAK4G,EAAOA,GAClBN,EAAMtG,EAAKmG,EAAMnG,EAAK6G,EAAQA,IAC9BrB,EAAMxF,EAAKwG,EAAKC,GAChBJ,EAAMrG,EAAKl+B,GAAK0kC,EAAKxG,EAAK0F,EAAM5jC,IACpC,CAEAskC,EAAKd,EAAMC,EAAMC,EAAKC,GACtBD,EAAMY,EAAG,GACTX,EAAMW,EAAG,GAETA,EAAKd,EAAMC,EAAMc,EAAKC,GACtBD,EAAMD,EAAG,GACTE,EAAMF,EAAG,GAET,MAAMU,EAAK5B,EAAWmB,GAEtB,OAAOrG,EAAKwF,EAAMsB,EACtB,CAsBeC,CAAiBlB,EAAQG,GAGpC,GAAIE,IAAO,GACP,MAAM,IAAIh9E,MAAM,0CACpB,OAAOy8E,EAAkBO,EAC7B,CAEA,MAAMc,EAAUrB,EAAkBlG,EAAM0F,IACxC,SAAS8B,EAAepE,GACpB,OAAO+C,EAAW/C,EAAQmE,EAC9B,CACA,MAAO,CACHpB,aACAqB,iBACAC,gBAAiB,CAACC,EAAYzC,IAAckB,EAAWuB,EAAYzC,GACnEH,aAAe4C,GAAeF,EAAeE,GAC7CtC,MAAO,CAAEC,iBAAkB,IAAMrF,EAAMH,YAAYG,EAAM5G,cACzDmO,QAASA,EAEjB,CCvB6CI,CAAW,CACpDjO,EAAG8E,GACH14C,EAAG2J,OAAO,QACV+1C,eAAgB,IAChBpM,YAAa,GACbsM,GAAIj2C,OAAO,GACXg2C,WAAajjE,IACT,MAAMk3D,EAAI8E,IAEJ,UAAEW,EAAS,GAAEp7D,GAAO26D,GAAoBl8D,GAC9C,OAAO,GAAIo2D,GAAKuG,EAAW,GAAKzF,GAAK31D,EAAI21D,EAAE,EAE/C0F,qBACAS,YAAW,KAbuB,GC5HhC+H,GAAyB,GACzBC,GAA0B,GAC1BC,GAAmB,GAwCzB,SAASC,GAAWC,EAAe/C,GAC/B,MAAMyC,EAAa,IAAIt6E,WAAWy6E,IAClC,IAAK,IAAIx/E,EAAI,EAAGA,EAAIy/E,GAAkBz/E,IAClCq/E,EAAWr/E,GAAK2/E,EAAc3/E,GAC9Bq/E,EAAWI,GAAmBz/E,GAAK48E,EAAU58E,GAEjD,OAAOq/E,CACX,CC/CA,UACI,GAAAnxE,CAAI0xE,EAAM9gE,YACN,MAAM+gE,EAAeD,EAAIxxC,OACzB,GAA4B,MAAxByxC,GAAcxxC,OACd,MAAMnsC,OAAOoN,OAAO,IAAIlO,MAAM,uRAIiE,CAAEqO,KAAM,2BAE3G,OAAOowE,CACX,GCDSC,GAA0B,CAAEC,IAAK,UAAWC,KAAK,EAAMngE,EAAG,yBAA0BogE,QAAS,CAAC,UAAW,WAAYC,IAAK,OCNhI/xC,eAAegyC,GAASd,EAAYe,GACvC,MAAMC,EDOH,SAAgB53C,GACnB,MAAMnvB,EAA+B,UACrC,IAAIgnE,EAA+B,GACnC,MACMxlE,EAAyB,UAEzBylE,EAAiC,MACjCnyC,EAAS,GAAUlgC,MA0EzB,OAzEAoyE,GAAa,EAqEE,CACXE,QAjEJryC,eAAuB3M,EAAM4+C,GACzB,MAAMK,EAAOryC,EAAOgK,gBAAgB,IAAIrzC,WATL,KAU7B27E,EAAQtyC,EAAOgK,gBAAgB,IAAIrzC,WAZJ,KAa/B47E,EAAS,CAAE1xE,KAAMqK,EAAWsnE,GAAIF,GAItC,IAAIG,EACJ,GAJwB,iBAAbT,IACPA,EAAW,GAAWA,IAGF,IAApBA,EAASthF,OAAc,CACvB+hF,QAAkBzyC,EAAOC,OAAOyyC,UAAU,MAAOhB,GAAyB,CAAE7wE,KAAM,YAAa,EAAM,CAAC,YACtG,IACI,MAAM8xE,EAAe,CAAE9xE,KAAM,SAAUwxE,OAAMF,aAAYnxE,KAAM,CAAEH,KAAM6L,IACjEkmE,QAAoC5yC,EAAOC,OAAOyyC,UAAU,MAAOV,EAAU,CAAEnxE,KAAM,WAAY,EAAO,CAAC,cAC/G4xE,QAAkBzyC,EAAOC,OAAO4yC,UAAUF,EAAcC,EAA6B,CAAE/xE,KAAMqK,EAAWxa,OAAQwhF,IAAa,EAAM,CAAC,WACxI,CACA,MACIO,QAAkBzyC,EAAOC,OAAOyyC,UAAU,MAAOhB,GAAyB,CAAE7wE,KAAM,YAAa,EAAM,CAAC,WAC1G,CACJ,KACK,CAED,MAAM8xE,EAAe,CAAE9xE,KAAM,SAAUwxE,OAAMF,aAAYnxE,KAAM,CAAEH,KAAM6L,IACjEomE,QAAe9yC,EAAOC,OAAOyyC,UAAU,MAAOV,EAAU,CAAEnxE,KAAM,WAAY,EAAO,CAAC,cAC1F4xE,QAAkBzyC,EAAOC,OAAO4yC,UAAUF,EAAcG,EAAQ,CAAEjyE,KAAMqK,EAAWxa,OAAQwhF,IAAa,EAAM,CAAC,WACnH,CAEA,MAAMa,QAAmB/yC,EAAOC,OAAOmyC,QAAQG,EAAQE,EAAWr/C,GAClE,OAAO,GAAO,CAACi/C,EAAME,EAAOC,GAAI,IAAI77E,WAAWo8E,IACnD,EAsCIC,QA/BJjzC,eAAuB3M,EAAM4+C,GACzB,MAAMK,EAAOj/C,EAAK7K,SAAS,EA5CQ,IA6C7B+pD,EAAQl/C,EAAK7K,SA7CgB,GA6CK0qD,IAClCF,EAAa3/C,EAAK7K,SAAS0qD,IAC3BV,EAAS,CAAE1xE,KAAMqK,EAAWsnE,GAAIF,GAItC,IAAIG,EACJ,GAJwB,iBAAbT,IACPA,EAAW,GAAWA,IAGF,IAApBA,EAASthF,OACT,IACI,MAAMiiF,EAAe,CAAE9xE,KAAM,SAAUwxE,OAAMF,aAAYnxE,KAAM,CAAEH,KAAM6L,IACjEkmE,QAAoC5yC,EAAOC,OAAOyyC,UAAU,MAAOV,EAAU,CAAEnxE,KAAM,WAAY,EAAO,CAAC,cAC/G4xE,QAAkBzyC,EAAOC,OAAO4yC,UAAUF,EAAcC,EAA6B,CAAE/xE,KAAMqK,EAAWxa,OAAQwhF,IAAa,EAAM,CAAC,WACxI,CACA,MACIO,QAAkBzyC,EAAOC,OAAOyyC,UAAU,MAAOhB,GAAyB,CAAE7wE,KAAM,YAAa,EAAM,CAAC,WAC1G,KAEC,CAED,MAAM8xE,EAAe,CAAE9xE,KAAM,SAAUwxE,OAAMF,aAAYnxE,KAAM,CAAEH,KAAM6L,IACjEomE,QAAe9yC,EAAOC,OAAOyyC,UAAU,MAAOV,EAAU,CAAEnxE,KAAM,WAAY,EAAO,CAAC,cAC1F4xE,QAAkBzyC,EAAOC,OAAO4yC,UAAUF,EAAcG,EAAQ,CAAEjyE,KAAMqK,EAAWxa,OAAQwhF,IAAa,EAAM,CAAC,WACnH,CAEA,MAAMgB,QAAkBlzC,EAAOC,OAAO+yC,QAAQT,EAAQE,EAAWM,GACjE,OAAO,IAAIp8E,WAAWu8E,EAC1B,EAMJ,CCzFmB,GACTC,QAAqBlB,EAAOG,QAAQnB,EAAYe,GACtD,OAAO7gF,GAAOU,OAAOshF,EACzB,CCLO,IAAIC,GAMPC,GAWOC,GAiDAC,IAjEX,SAAWH,GACPA,EAAa,IAAI,MACjBA,EAAiB,QAAI,UACrBA,EAAmB,UAAI,WAC1B,CAJD,CAIGA,KAAYA,GAAU,CAAC,IAE1B,SAAWC,GACPA,EAAgBA,EAAqB,IAAI,GAAK,MAC9CA,EAAgBA,EAAyB,QAAI,GAAK,UAClDA,EAAgBA,EAA2B,UAAI,GAAK,WACvD,CAJD,CAIGA,KAAoBA,GAAkB,CAAC,IAC1C,SAAWD,GACPA,EAAQh5C,MAAQ,IACL8J,GAAYmvC,GAE1B,CAJD,CAIGD,KAAYA,GAAU,CAAC,IAE1B,SAAWE,GACP,IAAIxuC,EACJwuC,EAAUl5C,MAAQ,KACA,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,MACD,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEU,MAAZ1tB,EAAIsb,OACJ3R,EAAE0d,OAAO,GACT4qD,GAAQh5C,QAAQvoC,OAAOsP,EAAIsb,KAAM3R,IAErB,MAAZ3J,EAAIqyE,OACJ1oE,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIqyE,QAEa,IAAzBn5C,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,KACR,MAAMyQ,EAAM,CAAC,EACPnP,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,OAAQ8c,IAAQ,GACZ,KAAK,EACDnkC,EAAIsb,KAAO22D,GAAQh5C,QAAQxnC,OAAOotB,GAClC,MACJ,KAAK,EACD7e,EAAIqyE,KAAOxzD,EAAO1Y,QAClB,MACJ,QACI0Y,EAAOiJ,SAAe,EAANqc,GAG5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEXwuC,EAAUzhF,OAAUsP,GACT6hC,GAAc7hC,EAAKmyE,EAAUl5C,SAExCk5C,EAAU1gF,OAAU2E,GACT4iC,EAAc5iC,EAAK+7E,EAAUl5C,QAE3C,CA/CD,CA+CGk5C,KAAcA,GAAY,CAAC,IAE9B,SAAWC,GACP,IAAIzuC,EACJyuC,EAAWn5C,MAAQ,KACD,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,MACD,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEU,MAAZ1tB,EAAIsb,OACJ3R,EAAE0d,OAAO,GACT4qD,GAAQh5C,QAAQvoC,OAAOsP,EAAIsb,KAAM3R,IAErB,MAAZ3J,EAAIqyE,OACJ1oE,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIqyE,QAEa,IAAzBn5C,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,KACR,MAAMyQ,EAAM,CAAC,EACPnP,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,OAAQ8c,IAAQ,GACZ,KAAK,EACDnkC,EAAIsb,KAAO22D,GAAQh5C,QAAQxnC,OAAOotB,GAClC,MACJ,KAAK,EACD7e,EAAIqyE,KAAOxzD,EAAO1Y,QAClB,MACJ,QACI0Y,EAAOiJ,SAAe,EAANqc,GAG5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEXyuC,EAAW1hF,OAAUsP,GACV6hC,GAAc7hC,EAAKoyE,EAAWn5C,SAEzCm5C,EAAW3gF,OAAU2E,GACV4iC,EAAc5iC,EAAKg8E,EAAWn5C,QAE5C,CA/CD,CA+CGm5C,KAAeA,GAAa,CAAC,IC/GzB,MAAME,GACTC,KACA,WAAA5xE,CAAYf,GACR/L,KAAK0+E,KAAOC,GAAU5yE,EAAK,GAC/B,CACA,MAAAmf,CAAOkT,EAAMm7C,GACT,OLyBD,SAAuBC,EAAWD,EAAK1kC,GAC1C,OAAO,GAAG3pB,OAAOquD,EAAK1kC,aAAelzC,WAAakzC,EAAMA,EAAIthB,WAAYimD,EAC5E,CK3Be,CAAqBx5E,KAAK0+E,KAAMnF,EAAKn7C,EAChD,CACA,OAAAwgD,GACI,OAAO5+E,KAAK0+E,IAChB,CACA,SAAIpsE,GACA,OAAO,GAAczV,OAAO,CACxB4qB,KAAM,GAAYo3D,QAClBL,KAAMx+E,KAAK4+E,YACZrrD,UACP,CACA,MAAA2Y,CAAOngC,GACH,OAAO,GAAiB/L,KAAKsS,MAAOvG,EAAIuG,MAC5C,CACA,IAAAtG,GACI,MAAM3P,EAAI,GAAOqb,OAAO1X,KAAKsS,OAC7B,OAAImzD,GAAUppE,GACHA,EAAEyR,MAAK,EAAGwE,WAAYA,IAE1BjW,EAAEiW,KACb,EAEG,MAAMwsE,GACTJ,KACAK,WAGA,WAAAjyE,CAAYf,EAAKytE,GACbx5E,KAAK0+E,KAAOC,GAAU5yE,EAAK,IAC3B/L,KAAK++E,WAAaJ,GAAUnF,EAAW,GAC3C,CACA,IAAAt2E,CAAKuG,GACD,OLXD,SAAqBwyE,EAAYpnC,GACpC,MAAM0nC,EAAgBN,EAAW1oD,SAAS,EAAG8oD,IAC7C,OAAO,GAAGn5E,KAAK2xC,aAAelzC,WAAakzC,EAAMA,EAAIthB,WAAYgpD,EACrE,CKQe,CAAmBv8E,KAAK0+E,KAAMj1E,EACzC,CACA,UAAIu1E,GACA,OAAO,IAAIP,GAAiBz+E,KAAK++E,WACrC,CACA,OAAAH,GACI,OAAO5+E,KAAK0+E,IAChB,CACA,SAAIpsE,GACA,OAAO,GAAezV,OAAO,CACzB4qB,KAAM,GAAYo3D,QAClBL,KAAMx+E,KAAK4+E,YACZrrD,UACP,CACA,MAAA2Y,CAAOngC,GACH,OAAO,GAAiB/L,KAAKsS,MAAOvG,EAAIuG,MAC5C,CACA,UAAMtG,GACF,MAAM3P,EAAI,GAAOqb,OAAO1X,KAAKsS,OAC7B,IAAIA,EAOJ,OANImzD,GAAUppE,KACPiW,eAAgBjW,GAGnBiW,EAAQjW,EAAEiW,MAEPA,CACX,CAUA,QAAMgP,GACF,MAAMqb,EAAW,GAASjlB,OAAO1X,KAAKg/E,OAAO1sE,OAC7C,OAAO82B,GAAUvsC,OAAO8/B,EAASrqB,OAAOjH,UAAU,EACtD,CAIA,YAAM,CAAO2xE,EAAUzyE,EAAS,cAC5B,GAAe,eAAXA,EACA,OAAOwyE,GAAS/8E,KAAKsS,MAAO0qE,GAG5B,MAAM,IAAI,GAAU,kBAAkBzyE,sBAA4B,4BAE1E,EAEG,SAAS00E,GAA2B3sE,GAEvC,GAAIA,EAAM5W,OAAS,GAAyB,CAExC,MAAMwjF,GADN5sE,EAAQqsE,GAAUrsE,EAAO,GAA0B,KACrBihB,SAAS,EAAG,IACpC4rD,EAAiB7sE,EAAMihB,SAAS,GAAyBjhB,EAAM5W,QACrE,OAAO,IAAIojF,GAAkBI,EAAiBC,EAClD,CAEA,MAAMD,GADN5sE,EAAQqsE,GAAUrsE,EAAO,KACKihB,SAAS,EAAG,IACpC4rD,EAAiB7sE,EAAMihB,SAAS,IACtC,OAAO,IAAIurD,GAAkBI,EAAiBC,EAClD,CACO,SAASC,GAA0B9sE,GAEtC,OADAA,EAAQqsE,GAAUrsE,EAAO,IAClB,IAAImsE,GAAiBnsE,EAChC,CACOy4B,eAAe,KAClB,MAAM,WAAEkxC,EAAU,UAAEzC,GLhHjB,WAEH,MAAM+C,EAAgB,GAAG5C,MAAMC,mBACzBJ,EAAY,GAAGH,aAAakD,GAGlC,MAAO,CACHN,WAFeK,GAAWC,EAAe/C,GAGzCA,YAER,CKsGsC,GAClC,OAAO,IAAIsF,GAAkB7C,EAAYzC,EAC7C,CACOzuC,eAAes0C,GAAwB/gE,GAC1C,MAAM,WAAE29D,EAAU,UAAEzC,GLtGjB,SAA6Bl7D,GAChC,GAAIA,EAAK5iB,SAAW2gF,GAChB,MAAM,IAAI/vE,UAAU,sCAEnB,KAAMgS,aAAgB3c,YACvB,MAAM,IAAI2K,UAAU,mDAGxB,MAAMiwE,EAAgBj+D,EAChBk7D,EAAY,GAAGH,aAAakD,GAElC,MAAO,CACHN,WAFeK,GAAWC,EAAe/C,GAGzCA,YAER,CKuFsC,CAA2Bl7D,GAC7D,OAAO,IAAIwgE,GAAkB7C,EAAYzC,EAC7C,CACA,SAASmF,GAAU5yE,EAAKrQ,GAEpB,IADAqQ,EAAMpK,WAAWk5B,KAAK9uB,GAAO,KACrBrQ,SAAWA,EACf,MAAM,IAAI,GAAU,sCAAsCA,UAAeqQ,EAAIrQ,SAAU,wBAE3F,OAAOqQ,CACX,CC/GOg/B,eAAe,GAAoBh/B,GACtC,MAIMuzE,EAAO,OAJY,GAAUx0E,MAAMmgC,OAAOyyC,UAAU,MAAO3xE,EAAK,CAClEF,KAAM,oBACNG,KAAM,CAAEH,KAAM,aACf,EAAM,CAAC,eAGA0zE,GAAwBxzE,IAE5BhN,QAAaygF,GAAU,CACzBvD,WAAYqD,EAAK,GACjB9F,UAAW8F,EAAK,KAEpB,MAAO,CACHrD,WAAYl9E,EAAK,GACjBy6E,UAAWz6E,EAAK,GAExB,CAiBAgsC,eAAey0C,GAAUF,GACrB,GAAuB,MAAnBA,EAAKrD,YAAwC,MAAlBqD,EAAK9F,UAChC,MAAM,IAAI,GAAU,sCAAuC,0BAE/D,OAAO19E,QAAQ2lD,IAAI,CACf,GAAU32C,MAAMmgC,OAAOu0C,UAAU,MAAOF,EAAKrD,YAC7C,GAAUnxE,MAAMmgC,OAAOu0C,UAAU,MAAOF,EAAK9F,YAErD,CACAzuC,eAAew0C,GAAwBE,GACnC,OAAO,GAAU30E,MAAMmgC,OAAOyyC,UAAU,MAAO,CAC3CZ,IAAK2C,EAAM3C,IACXxgF,EAAGmjF,EAAMnjF,EACTgJ,EAAGm6E,EAAMn6E,GACV,CACCuG,KAAM,oBACNG,KAAM,CAAEH,KAAM,aACf,EAAM,CAAC,UACd,CACO,SAAS6zE,GAAQC,GACpB,GAAgB,QAAZA,EAAI7C,IACJ,MAAM,IAAI,GAAU,mBAAoB,wBAEvC,GAAa,MAAT6C,EAAIrjF,EACT,MAAM,IAAI,GAAU,sBAAuB,2BAG/C,OAAsB,EADR,GAAqBqjF,EAAIrjF,EAAG,aAC7BZ,MACjB,CC/EO,MAAMkkF,WAAaprC,GACtB,WAAA1nC,CAAYd,EAAM0yE,GACd3wC,QACA/tC,KAAK6zC,UAAW,EAChB7zC,KAAK4zC,WAAY,EACjB,GAAW5nC,GACX,MAAMD,EAAMwoC,GAAQmqC,GAEpB,GADA1+E,KAAK6/E,MAAQ7zE,EAAKS,SACe,mBAAtBzM,KAAK6/E,MAAMlvE,OAClB,MAAM,IAAI3S,MAAM,uDACpBgC,KAAKwzC,SAAWxzC,KAAK6/E,MAAMrsC,SAC3BxzC,KAAKuzC,UAAYvzC,KAAK6/E,MAAMtsC,UAC5B,MAAMC,EAAWxzC,KAAKwzC,SAChB9L,EAAM,IAAI/lC,WAAW6xC,GAE3B9L,EAAI38B,IAAIgB,EAAIrQ,OAAS83C,EAAWxnC,EAAKS,SAASkE,OAAO5E,GAAK2L,SAAW3L,GACrE,IAAK,IAAInP,EAAI,EAAGA,EAAI8qC,EAAIhsC,OAAQkB,IAC5B8qC,EAAI9qC,IAAM,GACdoD,KAAK6/E,MAAMlvE,OAAO+2B,GAElB1nC,KAAK8/E,MAAQ9zE,EAAKS,SAElB,IAAK,IAAI7P,EAAI,EAAGA,EAAI8qC,EAAIhsC,OAAQkB,IAC5B8qC,EAAI9qC,IAAM,IACdoD,KAAK8/E,MAAMnvE,OAAO+2B,GAClBA,EAAI+N,KAAK,EACb,CACA,MAAA9kC,CAAOpO,GAGH,OAFA,GAAavC,MACbA,KAAK6/E,MAAMlvE,OAAOpO,GACXvC,IACX,CACA,UAAAu1C,CAAW5N,GACP,GAAa3nC,MACb,GAAY2nC,EAAK3nC,KAAKuzC,WACtBvzC,KAAK6zC,UAAW,EAChB7zC,KAAK6/E,MAAMtqC,WAAW5N,GACtB3nC,KAAK8/E,MAAMnvE,OAAOg3B,GAClB3nC,KAAK8/E,MAAMvqC,WAAW5N,GACtB3nC,KAAKkJ,SACT,CACA,MAAAwO,GACI,MAAMiwB,EAAM,IAAIhmC,WAAW3B,KAAK8/E,MAAMvsC,WAEtC,OADAvzC,KAAKu1C,WAAW5N,GACTA,CACX,CACA,UAAA8M,CAAW0B,GAEPA,IAAOA,EAAKr3C,OAAO2N,OAAO3N,OAAO4N,eAAe1M,MAAO,CAAC,IACxD,MAAM,MAAE8/E,EAAK,MAAED,EAAK,SAAEhsC,EAAQ,UAAED,EAAS,SAAEJ,EAAQ,UAAED,GAAcvzC,KAQnE,OANAm2C,EAAGtC,SAAWA,EACdsC,EAAGvC,UAAYA,EACfuC,EAAG3C,SAAWA,EACd2C,EAAG5C,UAAYA,EACf4C,EAAG2pC,MAAQA,EAAMrrC,WAAW0B,EAAG2pC,OAC/B3pC,EAAG0pC,MAAQA,EAAMprC,WAAW0B,EAAG0pC,OACxB1pC,CACX,CACA,OAAAjtC,GACIlJ,KAAK4zC,WAAY,EACjB5zC,KAAK8/E,MAAM52E,UACXlJ,KAAK6/E,MAAM32E,SACf,EAQG,MAAM62E,GAAO,CAAC/zE,EAAMD,EAAKtC,IAAY,IAAIm2E,GAAK5zE,EAAMD,GAAK4E,OAAOlH,GAASiO,SAChFqoE,GAAKtzE,OAAS,CAACT,EAAMD,IAAQ,IAAI6zE,GAAK5zE,EAAMD,mCCxB5C,SAASi0E,GAAaC,EAAaC,GAC/B,IAAI/xE,EAAS,EACb,GAA2B,IAAvB8xE,EAAYvkF,OACZ,OAAOukF,EAAY,GAEvB,IAAK,IAAIrjF,EAAKqjF,EAAYvkF,OAAS,EAAIkB,GAAK,EAAGA,IAC3CuR,GAAU8xE,EAAaA,EAAYvkF,OAAS,EAAKkB,GAAKJ,KAAK+G,IAAI,EAAG28E,EAAYtjF,GAElF,OAAOuR,CACX,CACA,SAASgyE,GAAW1gF,EAAOqgB,EAAM+G,GAAW,GACxC,MAAMu5D,EAAmBv5D,EACzB,IAAIw5D,EAAgB5gF,EAChB0O,EAAS,EACTmyE,EAAU9jF,KAAK+G,IAAI,EAAGuc,GAC1B,IAAK,IAAIljB,EAAI,EAAGA,EAAI,EAAGA,IAAK,CACxB,GAAI6C,EAAQ6gF,EAAS,CACjB,IAAIC,EACJ,GAAIH,EAAmB,EACnBG,EAAS,IAAIvtE,YAAYpW,GACzBuR,EAASvR,MAER,CACD,GAAIwjF,EAAmBxjF,EACnB,OAAO,IAAKoW,YAAY,GAE5ButE,EAAS,IAAIvtE,YAAYotE,GACzBjyE,EAASiyE,CACb,CACA,MAAMI,EAAU,IAAI7+E,WAAW4+E,GAC/B,IAAK,IAAInjF,EAAKR,EAAI,EAAIQ,GAAK,EAAGA,IAAK,CAC/B,MAAMqjF,EAAQjkF,KAAK+G,IAAI,EAAGnG,EAAI0iB,GAC9B0gE,EAAQryE,EAAS/Q,EAAI,GAAKZ,KAAKmD,MAAM0gF,EAAgBI,GACrDJ,GAAkBG,EAAQryE,EAAS/Q,EAAI,GAAMqjF,CACjD,CACA,OAAOF,CACX,CACAD,GAAW9jF,KAAK+G,IAAI,EAAGuc,EAC3B,CACA,OAAO,IAAI9M,YAAY,EAC3B,CAeA,SAAS0tE,MAAkBC,GACvB,IAAIC,EAAe,EACfC,EAAa,EACjB,IAAK,MAAM7hD,KAAQ2hD,EACfC,GAAgB5hD,EAAKtjC,OAEzB,MAAM6kF,EAAS,IAAIvtE,YAAY4tE,GACzBJ,EAAU,IAAI7+E,WAAW4+E,GAC/B,IAAK,MAAMvhD,KAAQ2hD,EACfH,EAAQz1E,IAAIi0B,EAAM6hD,GAClBA,GAAc7hD,EAAKtjC,OAEvB,OAAO8kF,CACX,CACA,SAASM,KACL,MAAMv+E,EAAM,IAAIZ,WAAW3B,KAAK+gF,UAChC,GAAI/gF,KAAK+gF,SAAS9iD,YAAc,EAAG,CAC/B,MAAM+iD,EAAyB,MAAXz+E,EAAI,IAA0B,IAATA,EAAI,GACvC0+E,EAAyB,IAAX1+E,EAAI,MAA2B,IAATA,EAAI,KAC1Cy+E,GAAcC,IACdjhF,KAAKkhF,SAAS5jF,KAAK,yBAE3B,CACA,MAAM6jF,EAAe,IAAInuE,YAAYhT,KAAK+gF,SAAS9iD,YAC7CmjD,EAAa,IAAIz/E,WAAWw/E,GAClC,IAAK,IAAIvkF,EAAI,EAAGA,EAAIoD,KAAK+gF,SAAS9iD,WAAYrhC,IAC1CwkF,EAAWxkF,GAAK,EAEpBwkF,EAAW,GAAe,IAAT7+E,EAAI,GACrB,MAAM8+E,EAASrB,GAAaoB,EAAY,GAClCE,EAAiB,IAAItuE,YAAYhT,KAAK+gF,SAAS9iD,YAC/CsjD,EAAe,IAAI5/E,WAAW2/E,GACpC,IAAK,IAAIlkF,EAAI,EAAGA,EAAI4C,KAAK+gF,SAAS9iD,WAAY7gC,IAC1CmkF,EAAankF,GAAKmF,EAAInF,GAI1B,OAFAmkF,EAAa,IAAM,IACFvB,GAAauB,EAAc,GACzBF,CACvB,CA4CA,SAASG,GAAUC,EAAaC,GAC5B,MAAMhvE,EAAM+uE,EAAYhjF,SAAS,IACjC,GAAIijF,EAAahvE,EAAIhX,OACjB,MAAO,GAEX,MAAMimF,EAAMD,EAAahvE,EAAIhX,OACvBuZ,EAAU,IAAIzZ,MAAMmmF,GAC1B,IAAK,IAAI/kF,EAAI,EAAGA,EAAI+kF,EAAK/kF,IACrBqY,EAAQrY,GAAK,IAGjB,OADsBqY,EAAQvX,KAAK,IACdiS,OAAO+C,EAChC,CCnKA,SAASkvE,KACL,GAAsB,oBAAX59C,OACP,MAAM,IAAIhmC,MAAM,oEAExB,CACA,SAAS,GAAO8gC,GACZ,IAAI8hD,EAAe,EACfC,EAAa,EACjB,IAAK,IAAIjkF,EAAI,EAAGA,EAAIkiC,EAAQpjC,OAAQkB,IAEhCgkF,GADe9hD,EAAQliC,GACAqhC,WAE3B,MAAMuiD,EAAU,IAAI7+E,WAAWi/E,GAC/B,IAAK,IAAIhkF,EAAI,EAAGA,EAAIkiC,EAAQpjC,OAAQkB,IAAK,CACrC,MAAME,EAASgiC,EAAQliC,GACvB4jF,EAAQz1E,IAAI,IAAIpJ,WAAW7E,GAAS+jF,GACpCA,GAAc/jF,EAAOmhC,UACzB,CACA,OAAOuiD,EAAQ1jF,MACnB,CACA,SAAS,GAAkB+kF,EAAW5B,EAAa6B,EAAaC,GAC5D,OAAM9B,aAAuBt+E,WAIxBs+E,EAAYhiD,WAIb6jD,EAAc,GACdD,EAAUn6E,MAAQ,+CACX,GAEPq6E,EAAc,GACdF,EAAUn6E,MAAQ,+CACX,KAENu4E,EAAYhiD,WAAa6jD,EAAcC,EAAe,IACvDF,EAAUn6E,MAAQ,gGACX,KAbPm6E,EAAUn6E,MAAQ,gDACX,IALPm6E,EAAUn6E,MAAQ,qDACX,EAmBf,CDsPalL,KAAKoC,IAAI,GCpPtB,MAAMojF,GACF,WAAAl1E,GACI9M,KAAK0rD,MAAQ,EACjB,CACA,KAAAhlD,CAAMnE,GACFvC,KAAK0rD,MAAMpuD,KAAKiF,EACpB,CACA,KAAA0/E,GACI,OAAO,GAAOjiF,KAAK0rD,MACvB,EAGJ,MAAMw2B,GAAU,CAAC,IAAIvgF,WAAW,CAAC,KAC3BwgF,GAAe,aAWfC,GAAe,GACfC,GAAe,IAAIrvE,YAAY,GAC/BsvE,GAAa,IAAI3gF,WAAW,GAC5B4gF,GAAsB,eACtBC,GAAoB,eACpBC,GAAkB,aAExB,SAASC,GAASC,GACd,IAAIlY,EACJ,OAAOA,EAAK,cAAmBkY,EACvB,WAAA71E,IAAerM,GACX,IAAIgqE,EACJ18B,SAASttC,GACT,MAAMlF,EAASkF,EAAK,IAAM,CAAC,EAC3BT,KAAK4iF,UAAwC,QAA3BnY,EAAKlvE,EAAOqnF,iBAA8B,IAAPnY,GAAgBA,EACrEzqE,KAAK6iF,aAAetnF,EAAOwlF,SAAW,MAAgCxiD,aAAahjC,EAAOwlF,UAAYuB,EAC1G,CACA,YAAIvB,GACA,OAAO/gF,KAAK6iF,aAAaplF,QAAQX,MACrC,CACA,YAAIikF,CAASthF,GACTO,KAAK6iF,aAAe,IAAIlhF,WAAWlC,EACvC,CACA,OAAAqjF,CAAQ7C,EAAa6B,EAAaC,GAC9B,MAAM/iD,EAAOihD,aAAuBjtE,YAAc,IAAIrR,WAAWs+E,GAAeA,EAChF,IAAK,GAAkBjgF,KAAMg/B,EAAM8iD,EAAaC,GAC5C,OAAQ,EAEZ,MAAMgB,EAAYjB,EAAcC,EAEhC,OADA/hF,KAAK6iF,aAAe7jD,EAAKzL,SAASuuD,EAAaiB,GAC1C/iF,KAAK6iF,aAAannF,QAIvBsE,KAAKgjF,YAAcjB,EACZgB,IAJH/iF,KAAKkhF,SAAS5jF,KAAK,sBACZwkF,EAIf,CACA,KAAAmB,CAAMC,GAAW,GACb,OAAKljF,KAAK4iF,UAINM,EACO,IAAIlwE,YAAYhT,KAAK6iF,aAAa5kD,YAErCj+B,KAAK6iF,aAAa5kD,aAAej+B,KAAK6iF,aAAa/lF,OAAOmhC,WAC5Dj+B,KAAK6iF,aAAa/lF,OAClBkD,KAAK6iF,aAAaplF,QAAQX,QAR5BkD,KAAK0H,MAAQ,qCACN26E,GAQf,CACA,MAAAr7D,GACI,MAAO,IACA+mB,MAAM/mB,SACT47D,UAAW5iF,KAAK4iF,UAChB7B,SAAU,MAAkBtgD,MAAMzgC,KAAK6iF,cAE/C,IAEDM,KAAO,WACV1Y,CACR,CAEA,MAAM2Y,GACF,WAAAt2E,EAAY,YAAEk2E,EAAc,EAAC,MAAEt7E,EAAQ06E,GAAY,SAAElB,EAAW,GAAE,kBAAEmC,EAAoBf,IAAgB,CAAC,GACrGtiF,KAAKgjF,YAAcA,EACnBhjF,KAAK0H,MAAQA,EACb1H,KAAKkhF,SAAWA,EAChBlhF,KAAKsjF,sBAAwB,MAAgC/kD,aAAa8kD,EAC9E,CACA,gBAAOE,GACH,OAAOvjF,KAAKmjF,IAChB,CACA,qBAAIE,GACA,OAAOrjF,KAAKsjF,sBAAsB7lF,QAAQX,MAC9C,CACA,qBAAIumF,CAAkB5jF,GAClBO,KAAKsjF,sBAAwB,IAAI3hF,WAAWlC,EAChD,CACA,MAAAunB,GACI,MAAO,CACHu8D,UAAWvjF,KAAK8M,YAAYq2E,KAC5BH,YAAahjF,KAAKgjF,YAClBt7E,MAAO1H,KAAK0H,MACZw5E,SAAUlhF,KAAKkhF,SACfmC,kBAAmB,MAAkB5iD,MAAMzgC,KAAKsjF,uBAExD,EAEJF,GAAeD,KAAO,YAEtB,MAAMK,WAAmBJ,GACrB,OAAAN,CAAQ7C,EAAa6B,EAAaC,GAC9B,MAAMz1E,UAAU,8EACpB,CACA,KAAA22E,CAAMC,EAAUp4D,GACZ,MAAMxe,UAAU,8EACpB,EAEJk3E,GAAWL,KAAO,aAElB,MAAMM,WAAiCf,GAASU,KAC5C,WAAAt2E,EAAY,QAAE42E,EAAU,CAAC,GAAO,CAAC,GAC7B,IAAIjZ,EAAIkZ,EAAIC,EAAIC,EAChB91C,QACI21C,GACA1jF,KAAK4iF,UAAyC,QAA5BnY,EAAKiZ,EAAQd,iBAA8B,IAAPnY,GAAgBA,EACtEzqE,KAAK6iF,aAAea,EAAQ3C,SAAW,MAAgCxiD,aAAamlD,EAAQ3C,UAAYuB,GACxGtiF,KAAK8jF,SAAuC,QAA3BH,EAAKD,EAAQI,gBAA6B,IAAPH,EAAgBA,GAAM,EAC1E3jF,KAAK+jF,UAAyC,QAA5BH,EAAKF,EAAQK,iBAA8B,IAAPH,EAAgBA,GAAM,EAC5E5jF,KAAKgkF,cAAiD,QAAhCH,EAAKH,EAAQM,qBAAkC,IAAPH,GAAgBA,IAG9E7jF,KAAK8jF,UAAY,EACjB9jF,KAAK+jF,WAAa,EAClB/jF,KAAKgkF,eAAgB,EAE7B,CACA,KAAAf,CAAMC,GAAW,GACb,IAAIe,EAAa,EACjB,OAAQjkF,KAAK8jF,UACT,KAAK,EACDG,GAAc,EACd,MACJ,KAAK,EACDA,GAAc,GACd,MACJ,KAAK,EACDA,GAAc,IACd,MACJ,KAAK,EACDA,GAAc,IACd,MACJ,QAEI,OADAjkF,KAAK0H,MAAQ,oBACN26E,GAIf,GAFIriF,KAAKgkF,gBACLC,GAAc,IACdjkF,KAAK+jF,UAAY,KAAO/jF,KAAK4iF,UAAW,CACxC,MAAMpC,EAAU,IAAI7+E,WAAW,GAC/B,IAAKuhF,EAAU,CACX,IAAI9vC,EAASpzC,KAAK+jF,UAClB3wC,GAAU,GACV6wC,GAAc7wC,EACdotC,EAAQ,GAAKyD,CACjB,CACA,OAAOzD,EAAQ1jF,MACnB,CACA,IAAKkD,KAAK4iF,UAAW,CACjB,MAAMsB,EAAa,GAAmBlkF,KAAK+jF,UAAW,GAChDI,EAAc,IAAIxiF,WAAWuiF,GAC7Bh+E,EAAOg+E,EAAWjmD,WAClBuiD,EAAU,IAAI7+E,WAAWuE,EAAO,GAEtC,GADAs6E,EAAQ,GAAmB,GAAbyD,GACTf,EAAU,CACX,IAAK,IAAItmF,EAAI,EAAGA,EAAKsJ,EAAO,EAAItJ,IAC5B4jF,EAAQ5jF,EAAI,GAAsB,IAAjBunF,EAAYvnF,GACjC4jF,EAAQt6E,GAAQi+E,EAAYj+E,EAAO,EACvC,CACA,OAAOs6E,EAAQ1jF,MACnB,CACA,MAAM0jF,EAAU,IAAI7+E,WAAW3B,KAAK6iF,aAAa5kD,WAAa,GAE9D,GADAuiD,EAAQ,GAAmB,GAAbyD,GACTf,EAAU,CACX,MAAMkB,EAAUpkF,KAAK6iF,aACrB,IAAK,IAAIjmF,EAAI,EAAGA,EAAKwnF,EAAQ1oF,OAAS,EAAIkB,IACtC4jF,EAAQ5jF,EAAI,GAAkB,IAAbwnF,EAAQxnF,GAC7B4jF,EAAQxgF,KAAK6iF,aAAa5kD,YAAcmmD,EAAQA,EAAQ1oF,OAAS,EACrE,CACA,OAAO8kF,EAAQ1jF,MACnB,CACA,OAAAgmF,CAAQ7C,EAAa6B,EAAaC,GAC9B,MAAMsC,EAAY,MAAgC9lD,aAAa0hD,GAC/D,IAAK,GAAkBjgF,KAAMqkF,EAAWvC,EAAaC,GACjD,OAAQ,EAEZ,MAAMuC,EAAYD,EAAU9wD,SAASuuD,EAAaA,EAAcC,GAChE,GAAyB,IAArBuC,EAAU5oF,OAEV,OADAsE,KAAK0H,MAAQ,sBACL,EAGZ,OADoC,IAAf48E,EAAU,IAE3B,KAAK,EACDtkF,KAAK8jF,SAAW,EAChB,MACJ,KAAK,GACD9jF,KAAK8jF,SAAW,EAChB,MACJ,KAAK,IACD9jF,KAAK8jF,SAAW,EAChB,MACJ,KAAK,IACD9jF,KAAK8jF,SAAW,EAChB,MACJ,QAEI,OADA9jF,KAAK0H,MAAQ,qBACL,EAEhB1H,KAAKgkF,gBAA0C,IAAzBM,EAAU,IAChCtkF,KAAK4iF,WAAY,EACjB,MAAM2B,EAA+B,GAAfD,EAAU,GAChC,GAAsB,KAAlBC,EACAvkF,KAAK+jF,UAAY,EACjB/jF,KAAKgjF,YAAc,MAElB,CACD,IAAIzwE,EAAQ,EACRiyE,EAAqBxkF,KAAK6iF,aAAe,IAAIlhF,WAAW,KACxD8iF,EAA2B,IAC/B,KAA0B,IAAnBH,EAAU/xE,IAAe,CAG5B,GAFAiyE,EAAmBjyE,EAAQ,GAAwB,IAAnB+xE,EAAU/xE,GAC1CA,IACIA,GAAS+xE,EAAU5oF,OAEnB,OADAsE,KAAK0H,MAAQ,yDACL,EAEZ,GAAI6K,IAAUkyE,EAA0B,CACpCA,GAA4B,IAC5B,MAAMC,EAAiB,IAAI/iF,WAAW8iF,GACtC,IAAK,IAAI7nF,EAAI,EAAGA,EAAI4nF,EAAmB9oF,OAAQkB,IAC3C8nF,EAAe9nF,GAAK4nF,EAAmB5nF,GAC3C4nF,EAAqBxkF,KAAK6iF,aAAe,IAAIlhF,WAAW8iF,EAC5D,CACJ,CACAzkF,KAAKgjF,YAAezwE,EAAQ,EAC5BiyE,EAAmBjyE,EAAQ,GAAwB,IAAnB+xE,EAAU/xE,GAC1C,MAAMmyE,EAAiB,IAAI/iF,WAAW4Q,GACtC,IAAK,IAAI3V,EAAI,EAAGA,EAAI2V,EAAO3V,IACvB8nF,EAAe9nF,GAAK4nF,EAAmB5nF,GAC3C4nF,EAAqBxkF,KAAK6iF,aAAe,IAAIlhF,WAAW4Q,GACxDiyE,EAAmBz5E,IAAI25E,GACnB1kF,KAAKgjF,aAAe,EACpBhjF,KAAK+jF,UAAY,GAAqBS,EAAoB,IAE1DxkF,KAAK4iF,WAAY,EACjB5iF,KAAKkhF,SAAS5jF,KAAK,0CAE3B,CACA,GAAwB,IAAlB0C,KAAK8jF,UACN9jF,KAAkB,cACnB,OAAQA,KAAK+jF,WACT,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GAED,OADA/jF,KAAK0H,MAAQ,gDACL,EAGpB,OAAQo6E,EAAc9hF,KAAKgjF,WAC/B,CACA,MAAAh8D,GACI,MAAO,IACA+mB,MAAM/mB,SACT88D,SAAU9jF,KAAK8jF,SACfC,UAAW/jF,KAAK+jF,UAChBC,cAAehkF,KAAKgkF,cAE5B,EAEJP,GAAyBN,KAAO,sBAEhC,MAAMwB,WAAyBvB,GAC3B,WAAAt2E,EAAY,SAAE83E,EAAW,CAAC,GAAO,CAAC,GAC9B,IAAIna,EAAIkZ,EAAIC,EACZ71C,QACA/tC,KAAK6kF,iBAAwD,QAApCpa,EAAKma,EAASC,wBAAqC,IAAPpa,GAAgBA,EACrFzqE,KAAK8kF,aAAgD,QAAhCnB,EAAKiB,EAASE,oBAAiC,IAAPnB,GAAgBA,EAC7E3jF,KAAKtE,OAAoC,QAA1BkoF,EAAKgB,EAASlpF,cAA2B,IAAPkoF,EAAgBA,EAAK,CAC1E,CACA,OAAAd,CAAQ7C,EAAa6B,EAAaC,GAC9B,MAAM/iD,EAAO,MAAgCT,aAAa0hD,GAC1D,IAAK,GAAkBjgF,KAAMg/B,EAAM8iD,EAAaC,GAC5C,OAAQ,EAEZ,MAAMuC,EAAYtlD,EAAKzL,SAASuuD,EAAaA,EAAcC,GAC3D,GAAyB,IAArBuC,EAAU5oF,OAEV,OADAsE,KAAK0H,MAAQ,sBACL,EAEZ,GAAqB,MAAjB48E,EAAU,GAEV,OADAtkF,KAAK0H,MAAQ,6CACL,EAGZ,GADA1H,KAAK6kF,iBAAoC,MAAjBP,EAAU,GAC9BtkF,KAAK6kF,iBAEL,OADA7kF,KAAKgjF,YAAc,EACXlB,EAAc9hF,KAAKgjF,YAG/B,GADAhjF,KAAK8kF,gBAAiC,IAAfR,EAAU,KACP,IAAtBtkF,KAAK8kF,aAGL,OAFA9kF,KAAKtE,OAAU4oF,EAAU,GACzBtkF,KAAKgjF,YAAc,EACXlB,EAAc9hF,KAAKgjF,YAE/B,MAAMzwE,EAAuB,IAAf+xE,EAAU,GACxB,GAAI/xE,EAAQ,EAER,OADAvS,KAAK0H,MAAQ,mBACL,EAEZ,GAAK6K,EAAQ,EAAK+xE,EAAU5oF,OAExB,OADAsE,KAAK0H,MAAQ,yDACL,EAEZ,MAAMq9E,EAAYjD,EAAc,EAC1BkD,EAAmBhmD,EAAKzL,SAASwxD,EAAWA,EAAYxyE,GAO9D,OANoC,IAAhCyyE,EAAiBzyE,EAAQ,IACzBvS,KAAKkhF,SAAS5jF,KAAK,kCACvB0C,KAAKtE,OAAS,GAAqBspF,EAAkB,GACjDhlF,KAAK8kF,cAAiB9kF,KAAKtE,QAAU,KACrCsE,KAAKkhF,SAAS5jF,KAAK,yCACvB0C,KAAKgjF,YAAczwE,EAAQ,EACnBuvE,EAAc9hF,KAAKgjF,WAC/B,CACA,KAAAC,CAAMC,GAAW,GACb,IAAI3C,EACAC,EAGJ,GAFIxgF,KAAKtE,OAAS,MACdsE,KAAK8kF,cAAe,GACpB9kF,KAAK6kF,iBAML,OALAtE,EAAS,IAAIvtE,YAAY,IACR,IAAbkwE,IACA1C,EAAU,IAAI7+E,WAAW4+E,GACzBC,EAAQ,GAAK,KAEVD,EAEX,GAAIvgF,KAAK8kF,aAAc,CACnB,MAAMZ,EAAa,GAAmBlkF,KAAKtE,OAAQ,GACnD,GAAIwoF,EAAWjmD,WAAa,IAExB,OADAj+B,KAAK0H,MAAQ,iBACN,GAGX,GADA64E,EAAS,IAAIvtE,YAAYkxE,EAAWjmD,WAAa,GAC7CilD,EACA,OAAO3C,EACX,MAAM4D,EAAc,IAAIxiF,WAAWuiF,GACnC1D,EAAU,IAAI7+E,WAAW4+E,GACzBC,EAAQ,GAA6B,IAAxB0D,EAAWjmD,WACxB,IAAK,IAAIrhC,EAAI,EAAGA,EAAIsnF,EAAWjmD,WAAYrhC,IACvC4jF,EAAQ5jF,EAAI,GAAKunF,EAAYvnF,GACjC,OAAO2jF,CACX,CAMA,OALAA,EAAS,IAAIvtE,YAAY,IACR,IAAbkwE,IACA1C,EAAU,IAAI7+E,WAAW4+E,GACzBC,EAAQ,GAAKxgF,KAAKtE,QAEf6kF,CACX,CACA,MAAAv5D,GACI,MAAO,IACA+mB,MAAM/mB,SACT69D,iBAAkB7kF,KAAK6kF,iBACvBC,aAAc9kF,KAAK8kF,aACnBppF,OAAQsE,KAAKtE,OAErB,EAEJipF,GAAiBxB,KAAO,cAExB,MAAM8B,GAAY,CAAC,EAEnB,MAAMC,WAAkB9B,GACpB,WAAAt2E,EAAY,KAAEjB,EAAOu2E,GAAY,SAAE97D,GAAW,EAAK,gBAAE6+D,KAAoBC,GAAe,CAAC,EAAGC,GACxFt3C,MAAMq3C,GACNplF,KAAK6L,KAAOA,EACZ7L,KAAKsmB,SAAWA,EACZ6+D,IACAnlF,KAAKmlF,gBAAkBA,GAE3BnlF,KAAK0jF,QAAU,IAAID,GAAyB2B,GAC5CplF,KAAK4kF,SAAW,IAAID,GAAiBS,GACrCplF,KAAKslF,WAAaD,EAAiB,IAAIA,EAAeD,GAAc,IAAI5B,GAAW4B,EACvF,CACA,OAAAtC,CAAQ7C,EAAa6B,EAAaC,GAC9B,MAAMwD,EAAevlF,KAAKslF,WAAWxC,QAAQ7C,EAAa6B,EAAc9hF,KAAK4kF,SAAyB,iBAAI7C,EAAc/hF,KAAK4kF,SAASlpF,QACtI,OAAsB,IAAlB6pF,GACAvlF,KAAK0H,MAAQ1H,KAAKslF,WAAW59E,MACtB69E,IAENvlF,KAAK0jF,QAAQh8E,MAAMhM,SACpBsE,KAAKgjF,aAAehjF,KAAK0jF,QAAQV,aAChChjF,KAAK4kF,SAASl9E,MAAMhM,SACrBsE,KAAKgjF,aAAehjF,KAAK4kF,SAAS5B,aACjChjF,KAAKslF,WAAW59E,MAAMhM,SACvBsE,KAAKgjF,aAAehjF,KAAKslF,WAAWtC,aACjCuC,EACX,CACA,KAAAtC,CAAMC,EAAUp4D,GACZ,MAAM06D,EAAU16D,GAAU,IAAIk3D,GACzBl3D,GACD26D,GAAsBzlF,MAE1B,MAAM0lF,EAAa1lF,KAAK0jF,QAAQT,MAAMC,GAEtC,GADAsC,EAAQ9+E,MAAMg/E,GACV1lF,KAAK4kF,SAASC,iBACdW,EAAQ9+E,MAAM,IAAI/E,WAAW,CAAC,MAAO7E,QACrCkD,KAAKslF,WAAWrC,MAAMC,EAAUsC,GAChCA,EAAQ9+E,MAAM,IAAIsM,YAAY,QAE7B,CACD,MAAM2yE,EAAgB3lF,KAAKslF,WAAWrC,MAAMC,GAC5CljF,KAAK4kF,SAASlpF,OAASiqF,EAAc1nD,WACrC,MAAM2nD,EAAc5lF,KAAK4kF,SAAS3B,MAAMC,GACxCsC,EAAQ9+E,MAAMk/E,GACdJ,EAAQ9+E,MAAMi/E,EAClB,CACA,OAAK76D,EAGEu3D,GAFImD,EAAQvD,OAGvB,CACA,MAAAj7D,GACI,MAAMxL,EAAS,IACRuyB,MAAM/mB,SACT08D,QAAS1jF,KAAK0jF,QAAQ18D,SACtB49D,SAAU5kF,KAAK4kF,SAAS59D,SACxBs+D,WAAYtlF,KAAKslF,WAAWt+D,SAC5Bnb,KAAM7L,KAAK6L,KACXya,SAAUtmB,KAAKsmB,UAInB,OAFItmB,KAAKmlF,kBACL3pE,EAAO2pE,gBAAkBnlF,KAAKmlF,gBAAgBn+D,UAC3CxL,CACX,CACA,QAAA/c,CAASk+B,EAAW,SAChB,MAAiB,UAAbA,EACO38B,KAAK6lF,kBAET,MAAkBplD,MAAMzgC,KAAKijF,QACxC,CACA,eAAA4C,GACI,MAAO,GAAG7lF,KAAK8M,YAAYq2E,UAAU,MAAkB1iD,MAAMzgC,KAAKslF,WAAWhC,wBACjF,CACA,OAAA3kD,CAAQwN,GACJ,OAAInsC,OAASmsC,GAGPA,aAAiBnsC,KAAK8M,aD1XpC,SAAuBg5E,EAAcC,GACjC,GAAID,EAAa7nD,aAAe8nD,EAAa9nD,WACzC,OAAO,EAEX,MAAM+nD,EAAQ,IAAIrkF,WAAWmkF,GACvBG,EAAQ,IAAItkF,WAAWokF,GAC7B,IAAK,IAAInpF,EAAI,EAAGA,EAAIopF,EAAMtqF,OAAQkB,IAC9B,GAAIopF,EAAMppF,KAAOqpF,EAAMrpF,GACnB,OAAO,EAGf,OAAO,CACX,CCmXe,CAFSoD,KAAKijF,QACJ92C,EAAM82C,QAE3B,EAGJ,SAASwC,GAAsB5D,GAC3B,GAAIA,aAAqBoD,GAAUiB,YAC/B,IAAK,MAAMzmF,KAASoiF,EAAUyD,WAAW7lF,MACjCgmF,GAAsBhmF,KACtBoiF,EAAU+C,SAASC,kBAAmB,GAIlD,QAAShD,EAAU+C,SAASC,gBAChC,CAVAK,GAAU/B,KAAO,YAYjB,MAAMgD,WAAwBjB,GAC1B,WAAAp4E,EAAY,MAAErN,EAAQ2iF,MAAiBgD,GAAe,CAAC,EAAGgB,GACtDr4C,MAAMq3C,EAAYgB,GACd3mF,GACAO,KAAK86B,WAAWr7B,EAExB,CACA,QAAA4mF,GACI,OAAOrmF,KAAKslF,WAAW7lF,KAC3B,CACA,QAAA6mF,CAAS7mF,GACLO,KAAKslF,WAAW7lF,MAAQA,CAC5B,CACA,OAAAqjF,CAAQ7C,EAAa6B,EAAaC,GAC9B,MAAMwD,EAAevlF,KAAKslF,WAAWxC,QAAQ7C,EAAa6B,EAAc9hF,KAAK4kF,SAAyB,iBAAI7C,EAAc/hF,KAAK4kF,SAASlpF,QACtI,OAAsB,IAAlB6pF,GACAvlF,KAAK0H,MAAQ1H,KAAKslF,WAAW59E,MACtB69E,IAEXvlF,KAAKumF,WAAWvmF,KAAKslF,WAAWzC,cAC3B7iF,KAAK0jF,QAAQh8E,MAAMhM,SACpBsE,KAAKgjF,aAAehjF,KAAK0jF,QAAQV,aAChChjF,KAAK4kF,SAASl9E,MAAMhM,SACrBsE,KAAKgjF,aAAehjF,KAAK4kF,SAAS5B,aACjChjF,KAAKslF,WAAW59E,MAAMhM,SACvBsE,KAAKgjF,aAAehjF,KAAKslF,WAAWtC,aACjCuC,EACX,CACA,eAAAM,GACI,MAAO,GAAG7lF,KAAK8M,YAAYq2E,WAAWnjF,KAAKslF,WAAW7lF,QAC1D,EAEJ0mF,GAAgBhD,KAAO,kBAEvB,MAAMqD,WAAiC9D,GAASc,KAC5C,WAAA12E,EAAY,UAAE81E,GAAY,KAASwC,GAAe,CAAC,GAC/Cr3C,MAAMq3C,GACNplF,KAAK4iF,UAAYA,CACrB,EAIJ,IAAI6D,GAiTAC,GAkDAC,GAcAC,GA4FAC,GA0EAC,GAiKAC,GA6CAC,GAmOAC,GA2DAC,GAgQAC,GAoMAC,GA6BAC,GAcAC,GAoEAC,GA0BAC,GA2CAC,GAcAC,GAcAC,GAcAC,GAcAC,GAcAC,GAcAC,GAcAC,GAcAC,GAcAC,GAcAC,GAkGAC,GAsLAC,GAcAC,GAcAC,GAcAC,GAcA/d,GAzlEJ+b,GAAyBrD,KAAO,sBAGhC,MAAMsF,WAAkBvD,GACpB,WAAAp4E,CAAYs4E,EAAa,CAAC,GACtBr3C,MAAMq3C,EAAYoB,IAClBxmF,KAAK0jF,QAAQM,eAAgB,CACjC,EAmBJ,SAAS0E,GAAazI,EAAa6B,EAAc,EAAGC,EAAc9B,EAAYvkF,QAC1E,MAAMitF,EAAiB7G,EACvB,IAAI8G,EAAe,IAAI1D,GAAU,CAAC,EAAG1B,IACrC,MAAM3B,EAAY,IAAIuB,GACtB,IAAK,GAAkBvB,EAAW5B,EAAa6B,EAAaC,GAExD,OADA6G,EAAalhF,MAAQm6E,EAAUn6E,MACxB,CACH/L,QAAS,EACTwS,OAAQy6E,GAIhB,IADkB3I,EAAY1sD,SAASuuD,EAAaA,EAAcC,GACnDrmF,OAEX,OADAktF,EAAalhF,MAAQ,qBACd,CACH/L,QAAS,EACTwS,OAAQy6E,GAGhB,IAAIrD,EAAeqD,EAAalF,QAAQZ,QAAQ7C,EAAa6B,EAAaC,GAI1E,GAHI6G,EAAalF,QAAQxC,SAASxlF,QAC9BktF,EAAa1H,SAASvxE,OAAOi5E,EAAalF,QAAQxC,WAEhC,IAAlBqE,EAEA,OADAqD,EAAalhF,MAAQkhF,EAAalF,QAAQh8E,MACnC,CACH/L,QAAS,EACTwS,OAAQy6E,GAShB,GANA9G,EAAcyD,EACdxD,GAAe6G,EAAalF,QAAQV,YACpCuC,EAAeqD,EAAahE,SAAS9B,QAAQ7C,EAAa6B,EAAaC,GACnE6G,EAAahE,SAAS1D,SAASxlF,QAC/BktF,EAAa1H,SAASvxE,OAAOi5E,EAAahE,SAAS1D,WAEjC,IAAlBqE,EAEA,OADAqD,EAAalhF,MAAQkhF,EAAahE,SAASl9E,MACpC,CACH/L,QAAS,EACTwS,OAAQy6E,GAKhB,GAFA9G,EAAcyD,EACdxD,GAAe6G,EAAahE,SAAS5B,aAChC4F,EAAalF,QAAQM,eACtB4E,EAAahE,SAASC,iBAEtB,OADA+D,EAAalhF,MAAQ,0DACd,CACH/L,QAAS,EACTwS,OAAQy6E,GAGhB,IAAIC,EAAc3D,GAClB,GACS,IADD0D,EAAalF,QAAQI,SACzB,CACI,GAAK8E,EAAalF,QAAQK,WAAa,KACC,IAAnC6E,EAAalF,QAAQd,UAEtB,OADAgG,EAAalhF,MAAQ,6DACd,CACH/L,QAAS,EACTwS,OAAQy6E,GAGhB,OAAQA,EAAalF,QAAQK,WACzB,KAAK,EACD,GAAK6E,EAAalF,QAAqB,eAClCkF,EAAahE,SAASlpF,OAAS,EAEhC,OADAktF,EAAalhF,MAAQ,iCACd,CACH/L,QAAS,EACTwS,OAAQy6E,GAGhBC,EAAc5D,GAAU6D,aACxB,MACJ,KAAK,EACDD,EAAc5D,GAAU99D,QACxB,MACJ,KAAK,EACD0hE,EAAc5D,GAAU8D,QACxB,MACJ,KAAK,EACDF,EAAc5D,GAAU+D,UACxB,MACJ,KAAK,EACDH,EAAc5D,GAAUgE,YACxB,MACJ,KAAK,EACDJ,EAAc5D,GAAUiE,KACxB,MACJ,KAAK,EACDL,EAAc5D,GAAUkE,iBACxB,MACJ,KAAK,GACDN,EAAc5D,GAAUmE,WACxB,MACJ,KAAK,GACDP,EAAc5D,GAAUoE,WACxB,MACJ,KAAK,GACDR,EAAc5D,GAAUqE,yBACxB,MACJ,KAAK,GACDT,EAAc5D,GAAUsE,KACxB,MACJ,KAAK,GAED,OADAX,EAAalhF,MAAQ,+CACd,CACH/L,QAAS,EACTwS,OAAQy6E,GAEhB,KAAK,GACDC,EAAc5D,GAAUuE,SACxB,MACJ,KAAK,GACDX,EAAc5D,GAAU1sC,IACxB,MACJ,KAAK,GACDswC,EAAc5D,GAAUwE,cACxB,MACJ,KAAK,GACDZ,EAAc5D,GAAUyE,gBACxB,MACJ,KAAK,GACDb,EAAc5D,GAAU0E,cACxB,MACJ,KAAK,GACDd,EAAc5D,GAAU2E,eACxB,MACJ,KAAK,GACDf,EAAc5D,GAAU4E,UACxB,MACJ,KAAK,GACDhB,EAAc5D,GAAU6E,QACxB,MACJ,KAAK,GACDjB,EAAc5D,GAAU8E,gBACxB,MACJ,KAAK,GACDlB,EAAc5D,GAAU+E,cACxB,MACJ,KAAK,GACDnB,EAAc5D,GAAUgF,cACxB,MACJ,KAAK,GACDpB,EAAc5D,GAAUiF,cACxB,MACJ,KAAK,GACDrB,EAAc5D,GAAUkF,gBACxB,MACJ,KAAK,GACDtB,EAAc5D,GAAUmF,gBACxB,MACJ,KAAK,GACDvB,EAAc5D,GAAUoF,UACxB,MACJ,KAAK,GACDxB,EAAc5D,GAAUqF,KACxB,MACJ,KAAK,GACDzB,EAAc5D,GAAUsF,UACxB,MACJ,KAAK,GACD1B,EAAc5D,GAAUuF,SACxB,MACJ,KAAK,GACD3B,EAAc5D,GAAU1jE,SACxB,MACJ,QAAS,CACL,MAAMkpE,EAAY7B,EAAalF,QAAQM,cACjC,IAAIiB,GAAUiB,YACd,IAAIjB,GAAUwD,UACpBgC,EAAU/G,QAAUkF,EAAalF,QACjC+G,EAAU7F,SAAWgE,EAAahE,SAClC6F,EAAUvJ,SAAW0H,EAAa1H,SAClC0H,EAAe6B,CACnB,EAEC,MAKL5B,EAAcD,EAAalF,QAAQM,cAC7BiB,GAAUiB,YACVjB,GAAUwD,UAMxB,OAHAG,EAxMJ,SAAyB8B,EAAaC,GAClC,GAAID,aAAuBC,EACvB,OAAOD,EAEX,MAAMD,EAAY,IAAIE,EAKtB,OAJAF,EAAU/G,QAAUgH,EAAYhH,QAChC+G,EAAU7F,SAAW8F,EAAY9F,SACjC6F,EAAUvJ,SAAWwJ,EAAYxJ,SACjCuJ,EAAUnH,sBAAwBoH,EAAYpH,sBACvCmH,CACX,CA8LmBG,CAAgBhC,EAAcC,GAC7CtD,EAAeqD,EAAa9F,QAAQ7C,EAAa6B,EAAa8G,EAAahE,SAASC,iBAAmB9C,EAAc6G,EAAahE,SAASlpF,QAC3IktF,EAAatF,sBAAwBrD,EAAY1sD,SAASo1D,EAAgBA,EAAiBC,EAAa5F,aACjG,CACHrnF,OAAQ4pF,EACRp3E,OAAQy6E,EAEhB,CACA,SAAS9F,GAAQ7C,GACb,IAAKA,EAAYhiD,WAAY,CACzB,MAAM9vB,EAAS,IAAI+2E,GAAU,CAAC,EAAG1B,IAEjC,OADAr1E,EAAOzG,MAAQ,+BACR,CACH/L,QAAS,EACTwS,SAER,CACA,OAAOu6E,GAAa,MAAgCnqD,aAAa0hD,GAAaxiF,QAAS,EAAGwiF,EAAYhiD,WAC1G,CAhOAwoD,GAAOgC,GAEHxD,GAAUwD,UAAYhC,GAE1BgC,GAAUtF,KAAO,YAoOjB,MAAM0H,WAAmCrH,GACrC,WAAA12E,EAAY,MAAErN,EAAQ,GAAE,iBAAEolF,GAAmB,KAAUO,GAAe,CAAC,GACnEr3C,MAAMq3C,GACNplF,KAAKP,MAAQA,EACbO,KAAK6kF,iBAAmBA,CAC5B,CACA,OAAA/B,CAAQ7C,EAAa6B,EAAaC,GAC9B,MAAM/iD,EAAO,MAAgCT,aAAa0hD,GAC1D,IAAK,GAAkBjgF,KAAMg/B,EAAM8iD,EAAaC,GAC5C,OAAQ,EAGZ,GADA/hF,KAAKsjF,sBAAwBtkD,EAAKzL,SAASuuD,EAAaA,EAAcC,GAC5B,IAAtC/hF,KAAKsjF,sBAAsB5nF,OAE3B,OADAsE,KAAKkhF,SAAS5jF,KAAK,sBACZwkF,EAEX,IAAIgJ,EAAgBhJ,EACpB,MAAgB9hF,KAAK6kF,iBArBd,EAqBgC9C,GAAe,GAAG,CACrD,MAAM6G,EAAeF,GAAa1pD,EAAM8rD,EAAe/I,GACvD,IAA6B,IAAzB6G,EAAajtF,OAGb,OAFAqE,KAAK0H,MAAQkhF,EAAaz6E,OAAOzG,MACjC1H,KAAKkhF,SAASvxE,OAAOi5E,EAAaz6E,OAAO+yE,WACjC,EAMZ,GAJA4J,EAAgBlC,EAAajtF,OAC7BqE,KAAKgjF,aAAe4F,EAAaz6E,OAAO60E,YACxCjB,GAAe6G,EAAaz6E,OAAO60E,YACnChjF,KAAKP,MAAMnC,KAAKsrF,EAAaz6E,QACzBnO,KAAK6kF,kBAAoB+D,EAAaz6E,OAAOrB,YAAYq2E,OAASZ,GAClE,KAER,CASA,OARIviF,KAAK6kF,mBACD7kF,KAAKP,MAAMO,KAAKP,MAAM/D,OAAS,GAAGoR,YAAYq2E,OAASZ,GACvDviF,KAAKP,MAAMm8D,MAGX57D,KAAKkhF,SAAS5jF,KAAK,kCAGpBwtF,CACX,CACA,KAAA7H,CAAMC,EAAUp4D,GACZ,MAAM06D,EAAU16D,GAAU,IAAIk3D,GAC9B,IAAK,IAAIplF,EAAI,EAAGA,EAAIoD,KAAKP,MAAM/D,OAAQkB,IACnCoD,KAAKP,MAAM7C,GAAGqmF,MAAMC,EAAUsC,GAElC,OAAK16D,EAGEu3D,GAFImD,EAAQvD,OAGvB,CACA,MAAAj7D,GACI,MAAMxL,EAAS,IACRuyB,MAAM/mB,SACT69D,iBAAkB7kF,KAAK6kF,iBACvBplF,MAAO,IAEX,IAAK,MAAMA,KAASO,KAAKP,MACrB+b,EAAO/b,MAAMnC,KAAKmC,EAAMunB,UAE5B,OAAOxL,CACX,EAEJqvE,GAA2B1H,KAAO,wBAGlC,MAAM+C,WAAoBhB,GACtB,WAAAp4E,CAAYs4E,EAAa,CAAC,GACtBr3C,MAAMq3C,EAAYyF,IAClB7qF,KAAK0jF,QAAQM,eAAgB,CACjC,CACA,OAAAlB,CAAQ7C,EAAa6B,EAAaC,GAC9B/hF,KAAKslF,WAAWT,iBAAmB7kF,KAAK4kF,SAASC,iBACjD,MAAMU,EAAevlF,KAAKslF,WAAWxC,QAAQ7C,EAAa6B,EAAc9hF,KAAK4kF,SAAyB,iBAAI7C,EAAc/hF,KAAK4kF,SAASlpF,QACtI,OAAsB,IAAlB6pF,GACAvlF,KAAK0H,MAAQ1H,KAAKslF,WAAW59E,MACtB69E,IAENvlF,KAAK0jF,QAAQh8E,MAAMhM,SACpBsE,KAAKgjF,aAAehjF,KAAK0jF,QAAQV,aAChChjF,KAAK4kF,SAASl9E,MAAMhM,SACrBsE,KAAKgjF,aAAehjF,KAAK4kF,SAAS5B,aACjChjF,KAAKslF,WAAW59E,MAAMhM,SACvBsE,KAAKgjF,aAAehjF,KAAKslF,WAAWtC,aACjCuC,EACX,CACA,eAAAM,GACI,MAAMpjE,EAAS,GACf,IAAK,MAAMhjB,KAASO,KAAKslF,WAAW7lF,MAChCgjB,EAAOnlB,KAAKmC,EAAMhB,SAAS,SAASiH,MAAM,MAAMgG,KAAIuL,GAAK,KAAKA,MAAKvZ,KAAK,OAE5E,MAAM6lF,EAAsC,IAA1BvjF,KAAK0jF,QAAQI,SACzB,IAAI9jF,KAAK0jF,QAAQK,aACjB/jF,KAAK8M,YAAYq2E,KACvB,OAAO1gE,EAAO/mB,OACR,GAAG6nF,QAAgB9gE,EAAO/kB,KAAK,QAC/B,GAAG6lF,KACb,EAEJmD,GAAOR,GAEHjB,GAAUiB,YAAcQ,GAE5BR,GAAY/C,KAAO,cAEnB,MAAM4H,WAAoCvH,GACtC,OAAAV,CAAQ7C,EAAa6B,EAAaC,GAC9B,OAAOD,CACX,CACA,KAAAmB,CAAMC,GACF,OAAOb,EACX,EAEJ0I,GAA4BC,SAAW,yBAGvC,MAAMlC,WAAqB5D,GACvB,WAAAp4E,CAAYs4E,EAAa,CAAC,GACtBr3C,MAAMq3C,EAAY2F,IAClB/qF,KAAK0jF,QAAQI,SAAW,EACxB9jF,KAAK0jF,QAAQK,UAAY,CAC7B,EAEJ4C,GAAOmC,GAEH7D,GAAU6D,aAAenC,GAE7BmC,GAAa3F,KAAOZ,GAGpB,MAAM2G,WAAahE,GACf,WAAAp4E,CAAYs4E,EAAa,CAAC,GACtBr3C,MAAMq3C,EAAY5B,IAClBxjF,KAAK0jF,QAAQI,SAAW,EACxB9jF,KAAK0jF,QAAQK,UAAY,CAC7B,CACA,OAAAjB,CAAQ7C,EAAa6B,EAAaC,GAQ9B,OAPI/hF,KAAK4kF,SAASlpF,OAAS,GACvBsE,KAAKkhF,SAAS5jF,KAAK,gDAClB0C,KAAK0jF,QAAQh8E,MAAMhM,SACpBsE,KAAKgjF,aAAehjF,KAAK0jF,QAAQV,aAChChjF,KAAK4kF,SAASl9E,MAAMhM,SACrBsE,KAAKgjF,aAAehjF,KAAK4kF,SAAS5B,aACtChjF,KAAKgjF,aAAejB,EACfD,EAAcC,EAAe9B,EAAYhiD,YAC1Cj+B,KAAK0H,MAAQ,iGACL,GAEJo6E,EAAcC,CAC1B,CACA,KAAAkB,CAAMC,EAAUp4D,GACZ,MAAMy1D,EAAS,IAAIvtE,YAAY,GAC/B,IAAKkwE,EAAU,CACX,MAAM1C,EAAU,IAAI7+E,WAAW4+E,GAC/BC,EAAQ,GAAK,EACbA,EAAQ,GAAK,CACjB,CAIA,OAHI11D,GACAA,EAAOpkB,MAAM65E,GAEVA,CACX,CACA,eAAAsF,GACI,MAAO,GAAG7lF,KAAK8M,YAAYq2E,MAC/B,EAEJyD,GAAOsC,GAEHjE,GAAUiE,KAAOtC,GAErBsC,GAAK/F,KAAO,OAEZ,MAAM8H,WAA+BvI,GAASc,KAC1C,WAAA12E,EAAY,MAAErN,KAAU2lF,GAAe,CAAC,GACpCr3C,MAAMq3C,GACFA,EAAWrE,SACX/gF,KAAK6iF,aAAe,MAAgCtkD,aAAa6mD,EAAWrE,UAG5E/gF,KAAK6iF,aAAe,IAAIlhF,WAAW,GAEnClC,IACAO,KAAKP,MAAQA,EAErB,CACA,SAAIA,GACA,IAAK,MAAMyrF,KAASlrF,KAAK6iF,aACrB,GAAIqI,EAAQ,EACR,OAAO,EAGf,OAAO,CACX,CACA,SAAIzrF,CAAMA,GACNO,KAAK6iF,aAAa,GAAKpjF,EAAQ,IAAO,CAC1C,CACA,OAAAqjF,CAAQ7C,EAAa6B,EAAaC,GAC9B,MAAMsC,EAAY,MAAgC9lD,aAAa0hD,GAC/D,OAAK,GAAkBjgF,KAAMqkF,EAAWvC,EAAaC,IAGrD/hF,KAAK6iF,aAAewB,EAAU9wD,SAASuuD,EAAaA,EAAcC,GAC9DA,EAAc,GACd/hF,KAAKkhF,SAAS5jF,KAAK,8CACvB0C,KAAK4iF,WAAY,EACjB,GAAqBt8E,KAAKtG,MAC1BA,KAAKgjF,YAAcjB,EACXD,EAAcC,IARV,CAShB,CACA,KAAAkB,GACI,OAAOjjF,KAAK6iF,aAAaplF,OAC7B,CACA,MAAAupB,GACI,MAAO,IACA+mB,MAAM/mB,SACTvnB,MAAOO,KAAKP,MAEpB,EAEJwrF,GAAuB9H,KAAO,oBAG9B,MAAM,WAAgB+B,GAClB,WAAAp4E,CAAYs4E,EAAa,CAAC,GACtBr3C,MAAMq3C,EAAY6F,IAClBjrF,KAAK0jF,QAAQI,SAAW,EACxB9jF,KAAK0jF,QAAQK,UAAY,CAC7B,CACA,QAAAsC,GACI,OAAOrmF,KAAKslF,WAAW7lF,KAC3B,CACA,QAAA6mF,CAAS7mF,GACLO,KAAKslF,WAAW7lF,MAAQA,CAC5B,CACA,eAAAomF,GACI,MAAO,GAAG7lF,KAAK8M,YAAYq2E,UAAUnjF,KAAKqmF,UAC9C,EAEJQ,GAAO,GAEH5B,GAAU99D,QAAU0/D,GAExB,GAAQ1D,KAAO,UAEf,MAAMgI,WAAmCzI,GAASmI,KAC9C,WAAA/9E,EAAY,cAAEk3E,GAAgB,KAAUoB,GAAe,CAAC,GACpDr3C,MAAMq3C,GACNplF,KAAKgkF,cAAgBA,CACzB,CACA,OAAAlB,CAAQ7C,EAAa6B,EAAaC,GAC9B,IAAIwD,EAAe,EACnB,GAAIvlF,KAAKgkF,cAAe,CAGpB,GAFAhkF,KAAK4iF,WAAY,EACjB2C,EAAesF,GAA2B3qF,UAAU4iF,QAAQx8E,KAAKtG,KAAMigF,EAAa6B,EAAaC,IAC3E,IAAlBwD,EACA,OAAOA,EACX,IAAK,IAAI3oF,EAAI,EAAGA,EAAIoD,KAAKP,MAAM/D,OAAQkB,IAAK,CACxC,MAAMwuF,EAAmBprF,KAAKP,MAAM7C,GAAGkQ,YAAYq2E,KACnD,GAAIiI,IAAqB7I,GAAqB,CAC1C,GAAIviF,KAAK6kF,iBACL,MAGA,OADA7kF,KAAK0H,MAAQ,+EACL,CAEhB,CACA,GAAI0jF,IAAqB5I,GAErB,OADAxiF,KAAK0H,MAAQ,mDACL,CAEhB,CACJ,MAEI1H,KAAK4iF,WAAY,EACjB2C,EAAex3C,MAAM+0C,QAAQ7C,EAAa6B,EAAaC,GACvD/hF,KAAKgjF,YAAcjB,EAEvB,OAAOwD,CACX,CACA,KAAAtC,CAAMC,EAAUp4D,GACZ,OAAI9qB,KAAKgkF,cACE6G,GAA2B3qF,UAAU+iF,MAAM38E,KAAKtG,KAAMkjF,EAAUp4D,GACpEo4D,EACD,IAAIlwE,YAAYhT,KAAK6iF,aAAa5kD,YAClCj+B,KAAK6iF,aAAaplF,QAAQX,MACpC,CACA,MAAAkqB,GACI,MAAO,IACA+mB,MAAM/mB,SACTg9D,cAAehkF,KAAKgkF,cAE5B,EAEJmH,GAA2BhI,KAAO,wBAGlC,MAAM8F,WAAoB/D,GACtB,WAAAp4E,EAAY,QAAE42E,EAAU,CAAC,EAAC,SAAEkB,EAAW,CAAC,KAAMQ,GAAe,CAAC,GAC1D,IAAIzB,EAAIC,EAC4B,QAAnCD,EAAKyB,EAAWpB,qBAAkC,IAAPL,IAAsByB,EAAWpB,iBAA+C,QAA3BJ,EAAKwB,EAAW3lF,aAA0B,IAAPmkF,OAAgB,EAASA,EAAGloF,SAChKqyC,MAAM,CACF21C,QAAS,CACLM,cAAeoB,EAAWpB,iBACvBN,GAEPkB,SAAU,IACHA,EACHC,mBAAoBO,EAAWP,qBAEhCO,GACJ+F,IACHnrF,KAAK0jF,QAAQI,SAAW,EACxB9jF,KAAK0jF,QAAQK,UAAY,CAC7B,CACA,OAAAjB,CAAQ7C,EAAa6B,EAAaC,GAG9B,GAFA/hF,KAAKslF,WAAWtB,cAAgBhkF,KAAK0jF,QAAQM,cAC7ChkF,KAAKslF,WAAWT,iBAAmB7kF,KAAK4kF,SAASC,iBAC7B,IAAhB9C,EAKA,OAJkC,IAA9B/hF,KAAK0jF,QAAQh8E,MAAMhM,SACnBsE,KAAKgjF,aAAehjF,KAAK0jF,QAAQV,aACF,IAA/BhjF,KAAK4kF,SAASl9E,MAAMhM,SACpBsE,KAAKgjF,aAAehjF,KAAK4kF,SAAS5B,aAC/BlB,EAEX,IAAK9hF,KAAKslF,WAAWtB,cAAe,CAChC,MACMzhF,GADO09E,aAAuBjtE,YAAc,IAAIrR,WAAWs+E,GAAeA,GAC/D1sD,SAASuuD,EAAaA,EAAcC,GACrD,IACI,GAAIx/E,EAAI07B,WAAY,CAChB,MAAMotD,EAAM3C,GAAanmF,EAAK,EAAGA,EAAI07B,aACjB,IAAhBotD,EAAI1vF,QAAiB0vF,EAAI1vF,SAAWomF,IACpC/hF,KAAKslF,WAAW7lF,MAAQ,CAAC4rF,EAAIl9E,QAErC,CACJ,CACA,MAAO7I,GACP,CACJ,CACA,OAAOyoC,MAAM+0C,QAAQ7C,EAAa6B,EAAaC,EACnD,CACA,eAAA8D,GACI,OAAI7lF,KAAKslF,WAAWtB,eAAkBhkF,KAAKslF,WAAW7lF,OAASO,KAAKslF,WAAW7lF,MAAM/D,OAC1EwqF,GAAYhmF,UAAU2lF,gBAAgBv/E,KAAKtG,MAE/C,GAAGA,KAAK8M,YAAYq2E,UAAU,MAAkB1iD,MAAMzgC,KAAKslF,WAAWzC,eACjF,CACA,QAAAwD,GACI,IAAKrmF,KAAK0jF,QAAQM,cACd,OAAOhkF,KAAKslF,WAAWzC,aAAaplF,QAAQX,OAEhD,MAAM+X,EAAQ,GACd,IAAK,MAAMy2E,KAAWtrF,KAAKslF,WAAW7lF,MAC9B6rF,aAAmBrC,IACnBp0E,EAAMvX,KAAKguF,EAAQhG,WAAWzC,cAGtC,OAAO,MAAgClzE,OAAOkF,EAClD,EAEJiyE,GAAOmC,GAEHhE,GAAUgE,YAAcnC,GAE5BmC,GAAY9F,KAAOX,GAEnB,MAAM+I,WAAiC7I,GAASmI,KAC5C,WAAA/9E,EAAY,WAAE0+E,EAAa,EAAC,cAAExH,GAAgB,KAAUoB,GAAe,CAAC,GACpEr3C,MAAMq3C,GACNplF,KAAKwrF,WAAaA,EAClBxrF,KAAKgkF,cAAgBA,EACrBhkF,KAAKgjF,YAAchjF,KAAK6iF,aAAa5kD,UACzC,CACA,OAAA6kD,CAAQ7C,EAAa6B,EAAaC,GAC9B,IAAKA,EACD,OAAOD,EAEX,IAAIyD,GAAgB,EACpB,GAAIvlF,KAAKgkF,cAAe,CAEpB,GADAuB,EAAesF,GAA2B3qF,UAAU4iF,QAAQx8E,KAAKtG,KAAMigF,EAAa6B,EAAaC,IAC3E,IAAlBwD,EACA,OAAOA,EACX,IAAK,MAAM9lF,KAASO,KAAKP,MAAO,CAC5B,MAAM2rF,EAAmB3rF,EAAMqN,YAAYq2E,KAC3C,GAAIiI,IAAqB7I,GAAqB,CAC1C,GAAIviF,KAAK6kF,iBACL,MAGA,OADA7kF,KAAK0H,MAAQ,2EACL,CAEhB,CACA,GAAI0jF,IAAqB3I,GAErB,OADAziF,KAAK0H,MAAQ,+CACL,EAEZ,MAAM49E,EAAa7lF,EAAM6lF,WACzB,GAAKtlF,KAAKwrF,WAAa,GAAOlG,EAAWkG,WAAa,EAElD,OADAxrF,KAAK0H,MAAQ,oFACL,EAEZ1H,KAAKwrF,WAAalG,EAAWkG,UACjC,CACA,OAAOjG,CACX,CACA,MAAMlB,EAAY,MAAgC9lD,aAAa0hD,GAC/D,IAAK,GAAkBjgF,KAAMqkF,EAAWvC,EAAaC,GACjD,OAAQ,EAEZ,MAAMuC,EAAYD,EAAU9wD,SAASuuD,EAAaA,EAAcC,GAEhE,GADA/hF,KAAKwrF,WAAalH,EAAU,GACxBtkF,KAAKwrF,WAAa,EAElB,OADAxrF,KAAK0H,MAAQ,kDACL,EAEZ,IAAK1H,KAAKwrF,WAAY,CAClB,MAAMjpF,EAAM+hF,EAAU/wD,SAAS,GAC/B,IACI,GAAIhxB,EAAI07B,WAAY,CAChB,MAAMotD,EAAM3C,GAAanmF,EAAK,EAAGA,EAAI07B,aACjB,IAAhBotD,EAAI1vF,QAAiB0vF,EAAI1vF,SAAYomF,EAAc,IACnD/hF,KAAKP,MAAQ,CAAC4rF,EAAIl9E,QAE1B,CACJ,CACA,MAAO7I,GACP,CACJ,CAGA,OAFAtF,KAAK6iF,aAAeyB,EAAU/wD,SAAS,GACvCvzB,KAAKgjF,YAAcsB,EAAU5oF,OACrBomF,EAAcC,CAC1B,CACA,KAAAkB,CAAMC,EAAUp4D,GACZ,GAAI9qB,KAAKgkF,cACL,OAAO6G,GAA2B3qF,UAAU+iF,MAAM38E,KAAKtG,KAAMkjF,EAAUp4D,GAE3E,GAAIo4D,EACA,OAAO,IAAIlwE,YAAYhT,KAAK6iF,aAAa5kD,WAAa,GAE1D,IAAKj+B,KAAK6iF,aAAa5kD,WACnB,OAAOokD,GAEX,MAAM7B,EAAU,IAAI7+E,WAAW3B,KAAK6iF,aAAannF,OAAS,GAG1D,OAFA8kF,EAAQ,GAAKxgF,KAAKwrF,WAClBhL,EAAQz1E,IAAI/K,KAAK6iF,aAAc,GACxBrC,EAAQ1jF,MACnB,CACA,MAAAkqB,GACI,MAAO,IACA+mB,MAAM/mB,SACTwkE,WAAYxrF,KAAKwrF,WACjBxH,cAAehkF,KAAKgkF,cAE5B,EAEJuH,GAAyBpI,KAAO,sBAGhC,MAAM6F,WAAkB9D,GACpB,WAAAp4E,EAAY,QAAE42E,EAAU,CAAC,EAAC,SAAEkB,EAAW,CAAC,KAAMQ,GAAe,CAAC,GAC1D,IAAIzB,EAAIC,EAC4B,QAAnCD,EAAKyB,EAAWpB,qBAAkC,IAAPL,IAAsByB,EAAWpB,iBAA+C,QAA3BJ,EAAKwB,EAAW3lF,aAA0B,IAAPmkF,OAAgB,EAASA,EAAGloF,SAChKqyC,MAAM,CACF21C,QAAS,CACLM,cAAeoB,EAAWpB,iBACvBN,GAEPkB,SAAU,IACHA,EACHC,mBAAoBO,EAAWP,qBAEhCO,GACJmG,IACHvrF,KAAK0jF,QAAQI,SAAW,EACxB9jF,KAAK0jF,QAAQK,UAAY,CAC7B,CACA,OAAAjB,CAAQ7C,EAAa6B,EAAaC,GAG9B,OAFA/hF,KAAKslF,WAAWtB,cAAgBhkF,KAAK0jF,QAAQM,cAC7ChkF,KAAKslF,WAAWT,iBAAmB7kF,KAAK4kF,SAASC,iBAC1C92C,MAAM+0C,QAAQ7C,EAAa6B,EAAaC,EACnD,CACA,eAAA8D,GACI,GAAI7lF,KAAKslF,WAAWtB,eAAkBhkF,KAAKslF,WAAW7lF,OAASO,KAAKslF,WAAW7lF,MAAM/D,OACjF,OAAOwqF,GAAYhmF,UAAU2lF,gBAAgBv/E,KAAKtG,MAEjD,CACD,MAAMgV,EAAO,GACP+rE,EAAW/gF,KAAKslF,WAAWzC,aACjC,IAAK,MAAMnhD,KAAQq/C,EACf/rE,EAAK1X,KAAKokC,EAAKjjC,SAAS,GAAG0rE,SAAS,EAAG,MAE3C,MAAMshB,EAAUz2E,EAAKtX,KAAK,IAC1B,MAAO,GAAGsC,KAAK8M,YAAYq2E,UAAUsI,EAAQpgF,UAAU,EAAGogF,EAAQ/vF,OAASsE,KAAKslF,WAAWkG,aAC/F,CACJ,EASJ,SAASE,GAAQnrE,EAAOorE,GACpB,MAAM9tF,EAAI,IAAI8D,WAAW,CAAC,IACpBiqF,EAAY,IAAIjqF,WAAW4e,GAC3BsrE,EAAa,IAAIlqF,WAAWgqF,GAClC,IAAIG,EAAgBF,EAAUnuF,MAAM,GACpC,MAAMsuF,EAAsBD,EAAcpwF,OAAS,EAC7CswF,EAAiBH,EAAWpuF,MAAM,GAClCwuF,EAAuBD,EAAetwF,OAAS,EACrD,IAAI+D,EAAQ,EAER6qC,EAAU,EACd,IAAK,IAAI1tC,EAFIqvF,EAAuBF,EAAuBA,EAAsBE,EAE/DrvF,GAAK,EAAGA,IAAK0tC,IAGnB7qC,EAFA,GACE6qC,EAAU0hD,EAAetwF,OACnBowF,EAAcC,EAAsBzhD,GAAW0hD,EAAeC,EAAuB3hD,GAAWzsC,EAAE,GAGlGiuF,EAAcC,EAAsBzhD,GAAWzsC,EAAE,GAEjEA,EAAE,GAAK4B,EAAQ,GACP,GACE6qC,GAAWwhD,EAAcpwF,OAC3BowF,EAAgB,GAAuB,IAAInqF,WAAW,CAAClC,EAAQ,KAAMqsF,GAGrEA,EAAcC,EAAsBzhD,GAAW7qC,EAAQ,GAKnE,OAFI5B,EAAE,GAAK,IACPiuF,EAAgB,GAAuBjuF,EAAGiuF,IACvCA,CACX,CACA,SAASI,GAAO5vF,GACZ,GAAIA,GAAK4lF,GAAQxmF,OACb,IAAK,IAAIW,EAAI6lF,GAAQxmF,OAAQW,GAAKC,EAAGD,IAAK,CACtC,MAAMwB,EAAI,IAAI8D,WAAW,CAAC,IAC1B,IAAIwqF,EAAUjK,GAAQ7lF,EAAI,GAAIoB,MAAM,GACpC,IAAK,IAAIb,EAAKuvF,EAAOzwF,OAAS,EAAIkB,GAAK,EAAGA,IAAK,CAC3C,MAAM4wB,EAAW,IAAI7rB,WAAW,EAAEwqF,EAAOvvF,IAAM,GAAKiB,EAAE,KACtDA,EAAE,GAAK2vB,EAAS,GAAK,GACrB2+D,EAAOvvF,GAAK4wB,EAAS,GAAK,EAC9B,CACI3vB,EAAE,GAAK,IACPsuF,EAAS,GAAuBtuF,EAAGsuF,IACvCjK,GAAQ5kF,KAAK6uF,EACjB,CAEJ,OAAOjK,GAAQ5lF,EACnB,CACA,SAAS8vF,GAAQ7rE,EAAOorE,GACpB,IAAItuF,EAAI,EACR,MAAMuuF,EAAY,IAAIjqF,WAAW4e,GAC3BsrE,EAAa,IAAIlqF,WAAWgqF,GAC5BG,EAAgBF,EAAUnuF,MAAM,GAChCsuF,EAAsBD,EAAcpwF,OAAS,EAC7CswF,EAAiBH,EAAWpuF,MAAM,GAClCwuF,EAAuBD,EAAetwF,OAAS,EACrD,IAAI+D,EACA6qC,EAAU,EACd,IAAK,IAAI1tC,EAAIqvF,EAAsBrvF,GAAK,EAAGA,IAAK0tC,IAC5C7qC,EAAQqsF,EAAcC,EAAsBzhD,GAAW0hD,EAAeC,EAAuB3hD,GAAWjtC,EAChG,GACEoC,EAAQ,GACVpC,EAAI,EACJyuF,EAAcC,EAAsBzhD,GAAW7qC,EAAQ,KAGvDpC,EAAI,EACJyuF,EAAcC,EAAsBzhD,GAAW7qC,GAG3D,GAAIpC,EAAI,EACJ,IAAK,IAAIT,EAAKmvF,EAAsBE,EAAuB,EAAIrvF,GAAK,EAAGA,IAAK0tC,IAAW,CAEnF,GADA7qC,EAAQqsF,EAAcC,EAAsBzhD,GAAWjtC,IACnDoC,EAAQ,GAIP,CACDpC,EAAI,EACJyuF,EAAcC,EAAsBzhD,GAAW7qC,EAC/C,KACJ,CAPIpC,EAAI,EACJyuF,EAAcC,EAAsBzhD,GAAW7qC,EAAQ,EAO/D,CAEJ,OAAOqsF,EAAcruF,OACzB,CA7FAspF,GAAOiC,GAEH/D,GAAU+D,UAAYjC,GAE1BiC,GAAU7F,KAAOV,GA0FjB,MAAM4J,WAA+B3J,GAASc,KAC1C,WAAA12E,EAAY,MAAErN,KAAU2lF,GAAe,CAAC,GACpCr3C,MAAMq3C,GACNplF,KAAKssF,UAAY,EACblH,EAAWrE,UACX/gF,KAAKusF,mBAEKxuF,IAAV0B,IACAO,KAAKwsF,SAAW/sF,EAExB,CACA,WAAA8sF,GACQvsF,KAAK6iF,aAAannF,QAAU,GAC5BsE,KAAKkhF,SAAS5jF,KAAK,0CACnB0C,KAAK4iF,WAAY,EACjB5iF,KAAKssF,UAAY,IAGjBtsF,KAAK4iF,WAAY,EACb5iF,KAAK6iF,aAAannF,OAAS,IAC3BsE,KAAKssF,UAAY,GAAqBhmF,KAAKtG,OAGvD,CACA,YAAIwsF,CAAShjF,GACTxJ,KAAKssF,UAAY9iF,EACjBxJ,KAAK4iF,WAAY,EACjB5iF,KAAK6iF,aAAe,IAAIlhF,WD9yChC,SAAsBlC,GAClB,MAAMgtF,EAAYhtF,EAAQ,GAAgB,EAAVA,EAAgBA,EAChD,IAAI4hF,EAAS,IACb,IAAK,IAAIzkF,EAAI,EAAGA,EAAI,EAAGA,IAAK,CACxB,GAAI6vF,GAAYpL,EAAQ,CACpB,GAAI5hF,EAAQ,EAAG,CACX,MACM8gF,EAASJ,GADEkB,EAASoL,EACU,EAAG7vF,GAGvC,OAFgB,IAAI+E,WAAW4+E,GACvB,IAAM,IACPA,CACX,CACA,IAAIA,EAASJ,GAAWsM,EAAU,EAAG7vF,GACjC4jF,EAAU,IAAI7+E,WAAW4+E,GAC7B,GAAiB,IAAbC,EAAQ,GAAW,CACnB,MAAMkM,EAAUnM,EAAO9iF,MAAM,GACvBkvF,EAAW,IAAIhrF,WAAW+qF,GAChCnM,EAAS,IAAIvtE,YAAYutE,EAAOtiD,WAAa,GAC7CuiD,EAAU,IAAI7+E,WAAW4+E,GACzB,IAAK,IAAI9jE,EAAI,EAAGA,EAAIiwE,EAAQzuD,WAAYxhB,IACpC+jE,EAAQ/jE,EAAI,GAAKkwE,EAASlwE,GAE9B+jE,EAAQ,GAAK,CACjB,CACA,OAAOD,CACX,CACAc,GAAU7kF,KAAK+G,IAAI,EAAG,EAC1B,CACA,OAAO,IAAKyP,YAAY,EAC5B,CCixC2C,CAAqBxJ,GAC5D,CACA,YAAIgjF,GACA,OAAOxsF,KAAKssF,SAChB,CACA,OAAAM,CAAQ3M,EAAa6B,EAAaC,EAAa/W,EAAiB,GAC5D,MAAMrvE,EAASqE,KAAK8iF,QAAQ7C,EAAa6B,EAAaC,GACtD,IAAgB,IAAZpmF,EACA,OAAOA,EACX,MAAMqjC,EAAOh/B,KAAK6iF,aAalB,OAZiB,IAAZ7jD,EAAK,IAA4B,IAAVA,EAAK,GAC7Bh/B,KAAK6iF,aAAe7jD,EAAKzL,SAAS,GAGX,IAAnBy3C,GACIhsC,EAAKtjC,OAASsvE,IACTA,EAAiBhsC,EAAKtjC,OAAU,IACjCsvE,EAAiBhsC,EAAKtjC,OAAS,GACnCsE,KAAK6iF,aAAe7jD,EAAKzL,SAASy3C,EAAiBhsC,EAAKtjC,SAI7DC,CACX,CACA,KAAAkxF,CAAM3J,GAAW,GACb,MAAMlkD,EAAOh/B,KAAK6iF,aAClB,QAAQ,GACJ,OAAiB,IAAV7jD,EAAK,IACR,CACI,MAAM8tD,EAAc,IAAInrF,WAAW3B,KAAK6iF,aAAannF,OAAS,GAC9DoxF,EAAY,GAAK,EACjBA,EAAY/hF,IAAIi0B,EAAM,GACtBh/B,KAAK6iF,aAAeiK,CACxB,CACA,MACJ,KAAmB,IAAZ9tD,EAAK,MAA4B,IAAVA,EAAK,IAE3Bh/B,KAAK6iF,aAAe7iF,KAAK6iF,aAAatvD,SAAS,GAI3D,OAAOvzB,KAAKijF,MAAMC,EACtB,CACA,OAAAJ,CAAQ7C,EAAa6B,EAAaC,GAC9B,MAAMwD,EAAex3C,MAAM+0C,QAAQ7C,EAAa6B,EAAaC,GAC7D,OAAsB,IAAlBwD,GAGJvlF,KAAKusF,cAFMhH,CAIf,CACA,KAAAtC,CAAMC,GACF,OAAOA,EACD,IAAIlwE,YAAYhT,KAAK6iF,aAAannF,QAClCsE,KAAK6iF,aAAaplF,QAAQX,MACpC,CACA,MAAAkqB,GACI,MAAO,IACA+mB,MAAM/mB,SACTwlE,SAAUxsF,KAAKwsF,SAEvB,CACA,QAAA/tF,GACI,MAAMsuF,EAAuC,EAA3B/sF,KAAK6iF,aAAannF,OAAc,EAClD,IAEIsxF,EAFAb,EAAS,IAAIxqF,WAAuC,EAA3B3B,KAAK6iF,aAAannF,OAAc,GACzDuxF,EAAY,EAEhB,MAAMC,EAAWltF,KAAK6iF,aACtB,IAAI10E,EAAS,GACTg/E,GAAO,EACX,IAAK,IAAIC,EAAcF,EAASjvD,WAAa,EAAImvD,GAAc,EAAGA,IAAc,CAC5EJ,EAAcE,EAASE,GACvB,IAAK,IAAIxwF,EAAI,EAAGA,EAAI,EAAGA,IACO,GAArBowF,IACOC,IACCF,GACDZ,EAASC,GAAQF,GAAOe,GAAYd,GACpCh+E,EAAS,KAGTg+E,EAAST,GAAQS,EAAQD,GAAOe,KAG5CA,IACAD,IAAgB,CAExB,CACA,IAAK,IAAIpwF,EAAI,EAAGA,EAAIuvF,EAAOzwF,OAAQkB,IAC3BuvF,EAAOvvF,KACPuwF,GAAO,GACPA,IACAh/E,GAAUg0E,GAAa5lF,OAAO4vF,EAAOvvF,KAI7C,OAFa,IAATuwF,IACAh/E,GAAUg0E,GAAa5lF,OAAO,IAC3B4R,CACX,EAEJ64E,GAAOqF,GACPA,GAAuBlJ,KAAO,oBAE1BrkF,OAAO6L,eAAeq8E,GAAK9mF,UAAW,WAAY,CAC9C6K,IAAK,SAAUvB,GACXxJ,KAAK6iF,aAAe,IAAIlhF,WAAW6H,GACnCxJ,KAAKusF,aACT,EACAzhF,IAAK,WACD,OAAO9K,KAAK6iF,aAAaplF,QAAQX,MACrC,IAKR,MAAMisF,WAAgB7D,GAClB,WAAAp4E,CAAYs4E,EAAa,CAAC,GACtBr3C,MAAMq3C,EAAYiH,IAClBrsF,KAAK0jF,QAAQI,SAAW,EACxB9jF,KAAK0jF,QAAQK,UAAY,CAC7B,CACA,QAAA5/C,GAEI,OADAy9C,KACO59C,OAAOhkC,KAAKslF,WAAW7mF,WAClC,CACA,iBAAO2lC,CAAW3kC,GACdmiF,KACA,MAAMyL,EAAcrpD,OAAOvkC,GACrBqrB,EAAS,IAAIk3D,GACbzqE,EAAM81E,EAAY5uF,SAAS,IAAIa,QAAQ,KAAM,IAC7C0/B,EAAO,IAAIr9B,WAAW,MAAkBo/B,QAAQxpB,IACtD,GAAI81E,EAAc,EAAG,CACjB,MAAM9sE,EAAQ,IAAI5e,WAAWq9B,EAAKtjC,QAAoB,IAAVsjC,EAAK,GAAY,EAAI,IACjEze,EAAM,IAAM,IACZ,MACM+sE,EADWtpD,OAAO,KAAK,MAAkBvD,MAAMlgB,MACxB8sE,EACvB1B,EAAS,MAAgCptD,aAAa,MAAkBwC,QAAQusD,EAAU7uF,SAAS,MACzGktF,EAAO,IAAM,IACb7gE,EAAOpkB,MAAMilF,EACjB,MAEkB,IAAV3sD,EAAK,IACLlU,EAAOpkB,MAAM,IAAI/E,WAAW,CAAC,KAEjCmpB,EAAOpkB,MAAMs4B,GAKjB,OAHY,IAAI+pD,GAAQ,CACpBhI,SAAUj2D,EAAOm3D,SAGzB,CACA,YAAAsL,GACI,MAAMC,EAAU,IAAIzE,GAAQ,CAAEhI,SAAU/gF,KAAKslF,WAAWzC,eAExD,OADA2K,EAAQlI,WAAWuH,QACZW,CACX,CACA,cAAAC,GACI,OAAO,IAAI1E,GAAQ,CACfhI,SAA8C,IAApC/gF,KAAKslF,WAAWzC,aAAa,GACjC7iF,KAAKslF,WAAWzC,aAAatvD,SAAS,GACtCvzB,KAAKslF,WAAWzC,cAE9B,CACA,eAAAgD,GACI,MAAO,GAAG7lF,KAAK8M,YAAYq2E,UAAUnjF,KAAKslF,WAAW7mF,YACzD,EAEJwoF,GAAO8B,GAEH9D,GAAU8D,QAAU9B,GAExB8B,GAAQ5F,KAAO,UAGf,MAAMiG,WAAmBL,GACrB,WAAAj8E,CAAYs4E,EAAa,CAAC,GACtBr3C,MAAMq3C,GACNplF,KAAK0jF,QAAQI,SAAW,EACxB9jF,KAAK0jF,QAAQK,UAAY,EAC7B,EAEJmD,GAAOkC,GAEHnE,GAAUmE,WAAalC,GAE3BkC,GAAWjG,KAAO,aAElB,MAAMuK,WAA2BhL,GAASc,KACtC,WAAA12E,EAAY,SAAE0/E,GAAW,EAAE,WAAEmB,GAAa,KAAUvI,GAAe,CAAC,GAChEr3C,MAAMq3C,GACNplF,KAAKwsF,SAAWA,EAChBxsF,KAAK2tF,WAAaA,CACtB,CACA,OAAA7K,CAAQ7C,EAAa6B,EAAaC,GAC9B,IAAKA,EACD,OAAOD,EAEX,MAAMuC,EAAY,MAAgC9lD,aAAa0hD,GAC/D,IAAK,GAAkBjgF,KAAMqkF,EAAWvC,EAAaC,GACjD,OAAQ,EAEZ,MAAMuC,EAAYD,EAAU9wD,SAASuuD,EAAaA,EAAcC,GAChE/hF,KAAK6iF,aAAe,IAAIlhF,WAAWogF,GACnC,IAAK,IAAInlF,EAAI,EAAGA,EAAImlF,IAChB/hF,KAAK6iF,aAAajmF,GAAoB,IAAf0nF,EAAU1nF,GACjCoD,KAAKgjF,cACe,IAAfsB,EAAU1nF,IAHcA,KAMjC,MAAM+vF,EAAW,IAAIhrF,WAAW3B,KAAKgjF,aACrC,IAAK,IAAIpmF,EAAI,EAAGA,EAAIoD,KAAKgjF,YAAapmF,IAClC+vF,EAAS/vF,GAAKoD,KAAK6iF,aAAajmF,GAGpC,OADAoD,KAAK6iF,aAAe8J,EACmB,IAAlCrI,EAAUtkF,KAAKgjF,YAAc,IAC9BhjF,KAAK0H,MAAQ,yDACL,IAEiB,IAAzB1H,KAAK6iF,aAAa,IAClB7iF,KAAKkhF,SAAS5jF,KAAK,0CACnB0C,KAAKgjF,aAAe,EACpBhjF,KAAKwsF,SAAW,GAAqBxsF,KAAK6iF,aAAc,IAExD7iF,KAAK4iF,WAAY,EACjB5iF,KAAKkhF,SAAS5jF,KAAK,uCAEfwkF,EAAc9hF,KAAKgjF,YAC/B,CACA,eAAI4K,CAAYnuF,GACZmiF,KACA,IAAI5sE,EAAOgvB,OAAOvkC,GAAOhB,SAAS,GAClC,KAAOuW,EAAKtZ,OAAS,GACjBsZ,EAAO,IAAMA,EAEjB,MAAM1C,EAAQ,IAAI3Q,WAAWqT,EAAKtZ,OAAS,GAC3C,IAAK,IAAIkB,EAAI,EAAGA,EAAI0V,EAAM5W,OAAQkB,IAC9B0V,EAAM1V,GAAKkM,SAASkM,EAAKvX,MAAU,EAAJb,EAAW,EAAJA,EAAQ,GAAI,IAAMA,EAAI,EAAI0V,EAAM5W,OAAS,IAAO,GAE1FsE,KAAK8iF,QAAQxwE,EAAMxV,OAAQ,EAAGwV,EAAM5W,OACxC,CACA,KAAAunF,CAAMC,GACF,GAAIljF,KAAK4iF,UAAW,CAChB,GAAIM,EACA,OAAO,IAAKlwE,YAAYhT,KAAK6iF,aAAa5kD,YAC9C,MAAMmmD,EAAUpkF,KAAK6iF,aACfrC,EAAU,IAAI7+E,WAAW3B,KAAKgjF,aACpC,IAAK,IAAIpmF,EAAI,EAAGA,EAAKoD,KAAKgjF,YAAc,EAAIpmF,IACxC4jF,EAAQ5jF,GAAkB,IAAbwnF,EAAQxnF,GAEzB,OADA4jF,EAAQxgF,KAAKgjF,YAAc,GAAKoB,EAAQpkF,KAAKgjF,YAAc,GACpDxC,EAAQ1jF,MACnB,CACA,MAAMonF,EAAa,GAAmBlkF,KAAKwsF,SAAU,GACrD,GAA8B,IAA1BtI,EAAWjmD,WAEX,OADAj+B,KAAK0H,MAAQ,kCACN26E,GAEX,MAAM7B,EAAU,IAAI7+E,WAAWuiF,EAAWjmD,YAC1C,IAAKilD,EAAU,CACX,MAAMiB,EAAc,IAAIxiF,WAAWuiF,GAC7B19E,EAAM09E,EAAWjmD,WAAa,EACpC,IAAK,IAAIrhC,EAAI,EAAGA,EAAI4J,EAAK5J,IACrB4jF,EAAQ5jF,GAAsB,IAAjBunF,EAAYvnF,GAC7B4jF,EAAQh6E,GAAO29E,EAAY39E,EAC/B,CACA,OAAOg6E,CACX,CACA,QAAA/hF,GACI,IAAI0P,EAAS,GACb,GAAInO,KAAK4iF,UACLz0E,EAAS,MAAkBsyB,MAAMzgC,KAAK6iF,mBAEtC,GAAI7iF,KAAK2tF,WAAY,CACjB,IAAIE,EAAW7tF,KAAKwsF,SAChBxsF,KAAKwsF,UAAY,GACjBr+E,EAAS,KAELnO,KAAKwsF,UAAY,IACjBr+E,EAAS,KACT0/E,GAAY,KAGZ1/E,EAAS,KACT0/E,GAAY,IAGpB1/E,GAAU0/E,EAASpvF,UACvB,MAEI0P,EAASnO,KAAKwsF,SAAS/tF,WAE/B,OAAO0P,CACX,CACA,MAAA6Y,GACI,MAAO,IACA+mB,MAAM/mB,SACTwlE,SAAUxsF,KAAKwsF,SACfmB,WAAY3tF,KAAK2tF,WAEzB,EAEJD,GAAmBvK,KAAO,WAE1B,MAAM2K,WAAwCtK,GAC1C,WAAA12E,EAAY,MAAErN,EAAQ2iF,MAAiBgD,GAAe,CAAC,GACnDr3C,MAAMq3C,GACNplF,KAAKP,MAAQ,GACTA,GACAO,KAAK86B,WAAWr7B,EAExB,CACA,OAAAqjF,CAAQ7C,EAAa6B,EAAaC,GAC9B,IAAIwD,EAAezD,EACnB,KAAOC,EAAc,GAAG,CACpB,MAAMgM,EAAW,IAAIL,GAErB,GADAnI,EAAewI,EAASjL,QAAQ7C,EAAasF,EAAcxD,IACrC,IAAlBwD,EAGA,OAFAvlF,KAAKgjF,YAAc,EACnBhjF,KAAK0H,MAAQqmF,EAASrmF,MACf69E,EAEe,IAAtBvlF,KAAKP,MAAM/D,SACXqyF,EAASJ,YAAa,GAC1B3tF,KAAKgjF,aAAe+K,EAAS/K,YAC7BjB,GAAegM,EAAS/K,YACxBhjF,KAAKP,MAAMnC,KAAKywF,EACpB,CACA,OAAOxI,CACX,CACA,KAAAtC,CAAMC,GACF,MAAM8K,EAAa,GACnB,IAAK,IAAIpxF,EAAI,EAAGA,EAAIoD,KAAKP,MAAM/D,OAAQkB,IAAK,CACxC,MAAMqxF,EAAWjuF,KAAKP,MAAM7C,GAAGqmF,MAAMC,GACrC,GAA4B,IAAxB+K,EAAShwD,WAET,OADAj+B,KAAK0H,MAAQ1H,KAAKP,MAAM7C,GAAG8K,MACpB26E,GAEX2L,EAAW1wF,KAAK2wF,EACpB,CACA,OAAO,GAAOD,EAClB,CACA,UAAAlzD,CAAW1+B,GACP4D,KAAKP,MAAQ,GACb,IAAIyuF,EAAO,EACPC,EAAO,EACPC,EAAM,GACNjB,GAAO,EACX,GAOI,GANAgB,EAAO/xF,EAAOyW,QAAQ,IAAKq7E,GAEvBE,GADU,IAAVD,EACM/xF,EAAOiP,UAAU6iF,GAEjB9xF,EAAOiP,UAAU6iF,EAAMC,GACjCD,EAAOC,EAAO,EACVhB,EAAM,CACN,MAAMY,EAAW/tF,KAAKP,MAAM,GAC5B,IAAI4uF,EAAO,EACX,OAAQN,EAASvB,UACb,KAAK,EACD,MACJ,KAAK,EACD6B,EAAO,GACP,MACJ,KAAK,EACDA,EAAO,GACP,MACJ,QAEI,YADAruF,KAAKP,MAAQ,IAGrB,MAAM6uF,EAAYxlF,SAASslF,EAAK,IAChC,GAAIjrF,MAAMmrF,GACN,OACJP,EAASvB,SAAW8B,EAAYD,EAChClB,GAAO,CACX,KACK,CACD,MAAMY,EAAW,IAAIL,GACrB,GAAIU,EAAM1uF,OAAO+jC,iBAAkB,CAC/Bm+C,KACA,MAAMiM,EAAW7pD,OAAOoqD,GACxBL,EAASH,YAAcC,CAC3B,MAGI,GADAE,EAASvB,SAAW1jF,SAASslF,EAAK,IAC9BjrF,MAAM4qF,EAASvB,UACf,OAEHxsF,KAAKP,MAAM/D,SACZqyF,EAASJ,YAAa,EACtBR,GAAO,GAEXntF,KAAKP,MAAMnC,KAAKywF,EACpB,SACe,IAAVI,EACb,CACA,QAAA1vF,GACI,IAAI0P,EAAS,GACTy0E,GAAY,EAChB,IAAK,IAAIhmF,EAAI,EAAGA,EAAIoD,KAAKP,MAAM/D,OAAQkB,IAAK,CACxCgmF,EAAY5iF,KAAKP,MAAM7C,GAAGgmF,UAC1B,IAAI2L,EAASvuF,KAAKP,MAAM7C,GAAG6B,WACjB,IAAN7B,IACAuR,EAAS,GAAGA,MACZy0E,GACA2L,EAAS,IAAIA,KACTvuF,KAAKP,MAAM7C,GAAG+wF,WACdx/E,EAAS,MAAMogF,UAEfpgF,GAAUogF,GAGdpgF,GAAUogF,CAClB,CACA,OAAOpgF,CACX,CACA,MAAA6Y,GACI,MAAMxL,EAAS,IACRuyB,MAAM/mB,SACTvnB,MAAOO,KAAKvB,WACZ+vF,SAAU,IAEd,IAAK,IAAI5xF,EAAI,EAAGA,EAAIoD,KAAKP,MAAM/D,OAAQkB,IACnC4e,EAAOgzE,SAASlxF,KAAK0C,KAAKP,MAAM7C,GAAGoqB,UAEvC,OAAOxL,CACX,EAEJsyE,GAAgC3K,KAAO,6BAGvC,MAAMgG,WAAyBjE,GAC3B,WAAAp4E,CAAYs4E,EAAa,CAAC,GACtBr3C,MAAMq3C,EAAY0I,IAClB9tF,KAAK0jF,QAAQI,SAAW,EACxB9jF,KAAK0jF,QAAQK,UAAY,CAC7B,CACA,QAAAsC,GACI,OAAOrmF,KAAKslF,WAAW7mF,UAC3B,CACA,QAAA6nF,CAAS7mF,GACLO,KAAKslF,WAAWxqD,WAAWr7B,EAC/B,CACA,eAAAomF,GACI,MAAO,GAAG7lF,KAAK8M,YAAYq2E,UAAUnjF,KAAKslF,WAAW7mF,YAAc,SACvE,CACA,MAAAuoB,GACI,MAAO,IACA+mB,MAAM/mB,SACTvnB,MAAOO,KAAKqmF,WAEpB,EAEJc,GAAOgC,GAEHlE,GAAUkE,iBAAmBhC,GAEjCgC,GAAiBhG,KAAO,oBAExB,MAAMsL,WAAmC/L,GAASU,KAC9C,WAAAt2E,EAAY,SAAE0/E,EAAW,KAAMpH,GAAe,CAAC,GAC3Cr3C,MAAMq3C,GACNplF,KAAKwsF,SAAWA,CACpB,CACA,OAAA1J,CAAQ7C,EAAa6B,EAAaC,GAC9B,GAAoB,IAAhBA,EACA,OAAOD,EACX,MAAMuC,EAAY,MAAgC9lD,aAAa0hD,GAC/D,IAAK,GAAkBjgF,KAAMqkF,EAAWvC,EAAaC,GACjD,OAAQ,EACZ,MAAMuC,EAAYD,EAAU9wD,SAASuuD,EAAaA,EAAcC,GAChE/hF,KAAK6iF,aAAe,IAAIlhF,WAAWogF,GACnC,IAAK,IAAInlF,EAAI,EAAGA,EAAImlF,IAChB/hF,KAAK6iF,aAAajmF,GAAoB,IAAf0nF,EAAU1nF,GACjCoD,KAAKgjF,cACe,IAAfsB,EAAU1nF,IAHcA,KAMjC,MAAM+vF,EAAW,IAAIhrF,WAAW3B,KAAKgjF,aACrC,IAAK,IAAIpmF,EAAI,EAAGA,EAAIoD,KAAKgjF,YAAapmF,IAClC+vF,EAAS/vF,GAAKoD,KAAK6iF,aAAajmF,GAEpC,OADAoD,KAAK6iF,aAAe8J,EACmB,IAAlCrI,EAAUtkF,KAAKgjF,YAAc,IAC9BhjF,KAAK0H,MAAQ,yDACL,IAEiB,IAAzB1H,KAAK6iF,aAAa,IAClB7iF,KAAKkhF,SAAS5jF,KAAK,0CACnB0C,KAAKgjF,aAAe,EACpBhjF,KAAKwsF,SAAW,GAAqBxsF,KAAK6iF,aAAc,IAExD7iF,KAAK4iF,WAAY,EACjB5iF,KAAKkhF,SAAS5jF,KAAK,uCAEfwkF,EAAc9hF,KAAKgjF,YAC/B,CACA,KAAAC,CAAMC,GACF,GAAIljF,KAAK4iF,UAAW,CAChB,GAAIM,EACA,OAAO,IAAKlwE,YAAYhT,KAAK6iF,aAAa5kD,YAC9C,MAAMmmD,EAAUpkF,KAAK6iF,aACfrC,EAAU,IAAI7+E,WAAW3B,KAAKgjF,aACpC,IAAK,IAAIpmF,EAAI,EAAGA,EAAKoD,KAAKgjF,YAAc,EAAIpmF,IACxC4jF,EAAQ5jF,GAAkB,IAAbwnF,EAAQxnF,GAEzB,OADA4jF,EAAQxgF,KAAKgjF,YAAc,GAAKoB,EAAQpkF,KAAKgjF,YAAc,GACpDxC,EAAQ1jF,MACnB,CACA,MAAMonF,EAAa,GAAmBlkF,KAAKwsF,SAAU,GACrD,GAA8B,IAA1BtI,EAAWjmD,WAEX,OADAj+B,KAAK0H,MAAQ,kCACN26E,GAEX,MAAM7B,EAAU,IAAI7+E,WAAWuiF,EAAWjmD,YAC1C,IAAKilD,EAAU,CACX,MAAMiB,EAAc,IAAIxiF,WAAWuiF,GAC7B19E,EAAM09E,EAAWjmD,WAAa,EACpC,IAAK,IAAIrhC,EAAI,EAAGA,EAAI4J,EAAK5J,IACrB4jF,EAAQ5jF,GAAsB,IAAjBunF,EAAYvnF,GAC7B4jF,EAAQh6E,GAAO29E,EAAY39E,EAC/B,CACA,OAAOg6E,EAAQ1jF,MACnB,CACA,QAAA2B,GACI,IAAI0P,EAAS,GAMb,OAJIA,EADAnO,KAAK4iF,UACI,MAAkBniD,MAAMzgC,KAAK6iF,cAE7B7iF,KAAKwsF,SAAS/tF,WAEpB0P,CACX,CACA,MAAA6Y,GACI,MAAO,IACA+mB,MAAM/mB,SACTwlE,SAAUxsF,KAAKwsF,SAEvB,EAEJiC,GAA2BtL,KAAO,mBAElC,MAAMuL,WAAgDlL,GAClD,WAAA12E,EAAY,MAAErN,EAAQ2iF,MAAiBgD,GAAe,CAAC,GACnDr3C,MAAMq3C,GACNplF,KAAKP,MAAQ,GACTA,GACAO,KAAK86B,WAAWr7B,EAExB,CACA,OAAAqjF,CAAQ7C,EAAa6B,EAAaC,GAC9B,IAAIwD,EAAezD,EACnB,KAAOC,EAAc,GAAG,CACpB,MAAMgM,EAAW,IAAIU,GAErB,GADAlJ,EAAewI,EAASjL,QAAQ7C,EAAasF,EAAcxD,IACrC,IAAlBwD,EAGA,OAFAvlF,KAAKgjF,YAAc,EACnBhjF,KAAK0H,MAAQqmF,EAASrmF,MACf69E,EAEXvlF,KAAKgjF,aAAe+K,EAAS/K,YAC7BjB,GAAegM,EAAS/K,YACxBhjF,KAAKP,MAAMnC,KAAKywF,EACpB,CACA,OAAOxI,CACX,CACA,KAAAtC,CAAMC,EAAUp4D,GACZ,MAAMkjE,EAAa,GACnB,IAAK,IAAIpxF,EAAI,EAAGA,EAAIoD,KAAKP,MAAM/D,OAAQkB,IAAK,CACxC,MAAMqxF,EAAWjuF,KAAKP,MAAM7C,GAAGqmF,MAAMC,GACrC,GAA4B,IAAxB+K,EAAShwD,WAET,OADAj+B,KAAK0H,MAAQ1H,KAAKP,MAAM7C,GAAG8K,MACpB26E,GAEX2L,EAAW1wF,KAAK2wF,EACpB,CACA,OAAO,GAAOD,EAClB,CACA,UAAAlzD,CAAW1+B,GACP4D,KAAKP,MAAQ,GACb,IAAIyuF,EAAO,EACPC,EAAO,EACPC,EAAM,GACV,EAAG,CACCD,EAAO/xF,EAAOyW,QAAQ,IAAKq7E,GAEvBE,GADU,IAAVD,EACM/xF,EAAOiP,UAAU6iF,GAEjB9xF,EAAOiP,UAAU6iF,EAAMC,GACjCD,EAAOC,EAAO,EACd,MAAMJ,EAAW,IAAIU,GAErB,GADAV,EAASvB,SAAW1jF,SAASslF,EAAK,IAC9BjrF,MAAM4qF,EAASvB,UACf,OAAO,EACXxsF,KAAKP,MAAMnC,KAAKywF,EACpB,QAAmB,IAAVI,GACT,OAAO,CACX,CACA,QAAA1vF,GACI,IAAI0P,EAAS,GACTy0E,GAAY,EAChB,IAAK,IAAIhmF,EAAI,EAAGA,EAAIoD,KAAKP,MAAM/D,OAAQkB,IAAK,CACxCgmF,EAAY5iF,KAAKP,MAAM7C,GAAGgmF,UAC1B,IAAI2L,EAASvuF,KAAKP,MAAM7C,GAAG6B,WACjB,IAAN7B,IACAuR,EAAS,GAAGA,MACZy0E,GACA2L,EAAS,IAAIA,KACbpgF,GAAUogF,GAGVpgF,GAAUogF,CAClB,CACA,OAAOpgF,CACX,CACA,MAAA6Y,GACI,MAAMxL,EAAS,IACRuyB,MAAM/mB,SACTvnB,MAAOO,KAAKvB,WACZ+vF,SAAU,IAEd,IAAK,IAAI5xF,EAAI,EAAGA,EAAIoD,KAAKP,MAAM/D,OAAQkB,IACnC4e,EAAOgzE,SAASlxF,KAAK0C,KAAKP,MAAM7C,GAAGoqB,UACvC,OAAOxL,CACX,EAEJkzE,GAAwCvL,KAAO,qCAG/C,MAAMmG,WAAiCpE,GACnC,WAAAp4E,CAAYs4E,EAAa,CAAC,GACtBr3C,MAAMq3C,EAAYsJ,IAClB1uF,KAAK0jF,QAAQI,SAAW,EACxB9jF,KAAK0jF,QAAQK,UAAY,EAC7B,CACA,QAAAsC,GACI,OAAOrmF,KAAKslF,WAAW7mF,UAC3B,CACA,QAAA6nF,CAAS7mF,GACLO,KAAKslF,WAAWxqD,WAAWr7B,EAC/B,CACA,eAAAomF,GACI,MAAO,GAAG7lF,KAAK8M,YAAYq2E,UAAUnjF,KAAKslF,WAAW7mF,YAAc,SACvE,CACA,MAAAuoB,GACI,MAAO,IACA+mB,MAAM/mB,SACTvnB,MAAOO,KAAKqmF,WAEpB,EAEJe,GAAOkC,GAEHrE,GAAUqE,yBAA2BlC,GAEzCkC,GAAyBnG,KAAO,2BAGhC,MAAMqG,WAAiBtD,GACnB,WAAAp5E,CAAYs4E,EAAa,CAAC,GACtBr3C,MAAMq3C,GACNplF,KAAK0jF,QAAQI,SAAW,EACxB9jF,KAAK0jF,QAAQK,UAAY,EAC7B,EAEJsD,GAAOmC,GAEHvE,GAAUuE,SAAWnC,GAEzBmC,GAASrG,KAAO,WAGhB,MAAM,WAAY+C,GACd,WAAAp5E,CAAYs4E,EAAa,CAAC,GACtBr3C,MAAMq3C,GACNplF,KAAK0jF,QAAQI,SAAW,EACxB9jF,KAAK0jF,QAAQK,UAAY,EAC7B,EAEJuD,GAAO,GAEHrC,GAAU1sC,IAAM+uC,GAEpB,GAAInE,KAAO,MAEX,MAAMwL,WAA8BjM,GAASc,KACzC,WAAA12E,KAAiBs4E,GAAe,CAAC,GAC7Br3C,MAAMq3C,GACNplF,KAAK4iF,WAAY,EACjB5iF,KAAKP,MAAQ2iF,EACjB,CACA,MAAAp7D,GACI,MAAO,IACA+mB,MAAM/mB,SACTvnB,MAAOO,KAAKP,MAEpB,EAEJkvF,GAAsBxL,KAAO,mBAE7B,MAAMyL,WAAoCD,IAE1CC,GAA4BzL,KAAO,yBAEnC,MAAM0L,WAA+B1I,GACjC,WAAAr5E,KAAiBs4E,GAAe,CAAC,GAC7Br3C,MAAMq3C,EAAYwJ,GACtB,CACA,UAAArI,CAAWtG,GACPjgF,KAAKslF,WAAW7lF,MAAQlC,OAAOC,aAAatB,MAAM,KAAM,MAAgCqiC,aAAa0hD,GACzG,CACA,UAAAnlD,CAAWg0D,GACP,MAAMC,EAASD,EAAYpzF,OACrBsjC,EAAOh/B,KAAKslF,WAAWzC,aAAe,IAAIlhF,WAAWotF,GAC3D,IAAK,IAAInyF,EAAI,EAAGA,EAAImyF,EAAQnyF,IACxBoiC,EAAKpiC,GAAKkyF,EAAYhxF,WAAWlB,GACrCoD,KAAKslF,WAAW7lF,MAAQqvF,CAC5B,EAEJD,GAAuB1L,KAAO,gBAE9B,MAAM6L,WAAkCH,GACpC,UAAAtI,CAAWtG,GACPjgF,KAAKslF,WAAWzC,aAAe,MAAgCtkD,aAAa0hD,GAC5E,IACIjgF,KAAKslF,WAAW7lF,MAAQ,MAAkB8gC,aAAa0/C,EAC3D,CACA,MAAO5K,GACHr1E,KAAKkhF,SAAS5jF,KAAK,sCAAsC+3E,uBACzDr1E,KAAKslF,WAAW7lF,MAAQ,MAAkB+gC,SAASy/C,EACvD,CACJ,CACA,UAAAnlD,CAAWg0D,GACP9uF,KAAKslF,WAAWzC,aAAe,IAAIlhF,WAAW,MAAkBk/B,eAAeiuD,IAC/E9uF,KAAKslF,WAAW7lF,MAAQqvF,CAC5B,EAEJE,GAA0B7L,KAAO,uBAGjC,MAAMkG,WAAmB2F,GACrB,WAAAliF,CAAYs4E,EAAa,CAAC,GACtBr3C,MAAMq3C,GACNplF,KAAK0jF,QAAQI,SAAW,EACxB9jF,KAAK0jF,QAAQK,UAAY,EAC7B,EAEJwD,GAAO8B,GAEHpE,GAAUoE,WAAa9B,GAE3B8B,GAAWlG,KAAO,aAElB,MAAM8L,WAAiCJ,GACnC,UAAAtI,CAAWtG,GACPjgF,KAAKslF,WAAW7lF,MAAQ,MAAkBmiC,cAAcq+C,GACxDjgF,KAAKslF,WAAWzC,aAAe,MAAgCtkD,aAAa0hD,EAChF,CACA,UAAAnlD,CAAWg0D,GACP9uF,KAAKslF,WAAW7lF,MAAQqvF,EACxB9uF,KAAKslF,WAAWzC,aAAe,IAAIlhF,WAAW,MAAkBkgC,gBAAgBitD,GACpF,EAEJG,GAAyB9L,KAAO,sBAGhC,MAAMkH,WAAkB4E,GACpB,WAAAniF,KAAiBs4E,GAAe,CAAC,GAC7Br3C,MAAMq3C,GACNplF,KAAK0jF,QAAQI,SAAW,EACxB9jF,KAAK0jF,QAAQK,UAAY,EAC7B,EAEJyD,GAAO6C,GAEHpF,GAAUoF,UAAY7C,GAE1B6C,GAAUlH,KAAO,YAEjB,MAAM+L,WAAuCL,GACzC,UAAAtI,CAAWtG,GACP,MAAMkP,EAAan8E,YAAYwB,OAAOyrE,GAAeA,EAAYxiF,QAAQX,OAASmjF,EAAYxiF,MAAM,GAC9F2xF,EAAY,IAAIztF,WAAWwtF,GACjC,IAAK,IAAIvyF,EAAI,EAAGA,EAAIwyF,EAAU1zF,OAAQkB,GAAK,EACvCwyF,EAAUxyF,GAAKwyF,EAAUxyF,EAAI,GAC7BwyF,EAAUxyF,EAAI,GAAKwyF,EAAUxyF,EAAI,GACjCwyF,EAAUxyF,EAAI,GAAK,EACnBwyF,EAAUxyF,EAAI,GAAK,EAEvBoD,KAAKslF,WAAW7lF,MAAQlC,OAAOC,aAAatB,MAAM,KAAM,IAAIub,YAAY03E,GAC5E,CACA,UAAAr0D,CAAWg0D,GACP,MAAMO,EAAYP,EAAYpzF,OACxBmnF,EAAe7iF,KAAKslF,WAAWzC,aAAe,IAAIlhF,WAAuB,EAAZ0tF,GACnE,IAAK,IAAIzyF,EAAI,EAAGA,EAAIyyF,EAAWzyF,IAAK,CAChC,MAAM0yF,EAAU,GAAmBR,EAAYhxF,WAAWlB,GAAI,GACxD2yF,EAAW,IAAI5tF,WAAW2tF,GAChC,GAAIC,EAAS7zF,OAAS,EAClB,SACJ,MAAMimF,EAAM,EAAI4N,EAAS7zF,OACzB,IAAK,IAAI0B,EAAKmyF,EAAS7zF,OAAS,EAAI0B,GAAK,EAAGA,IACxCylF,EAAiB,EAAJjmF,EAAQQ,EAAIukF,GAAO4N,EAASnyF,EACjD,CACA4C,KAAKslF,WAAW7lF,MAAQqvF,CAC5B,EAEJI,GAA+B/L,KAAO,4BAGtC,MAAMgH,WAAwB+E,GAC1B,WAAApiF,KAAiBs4E,GAAe,CAAC,GAC7Br3C,MAAMq3C,GACNplF,KAAK0jF,QAAQI,SAAW,EACxB9jF,KAAK0jF,QAAQK,UAAY,EAC7B,EAEJ0D,GAAO0C,GAEHlF,GAAUkF,gBAAkB1C,GAEhC0C,GAAgBhH,KAAO,kBAGvB,MAAMsG,WAAsBoF,GACxB,WAAA/hF,CAAYs4E,EAAa,CAAC,GACtBr3C,MAAMq3C,GACNplF,KAAK0jF,QAAQI,SAAW,EACxB9jF,KAAK0jF,QAAQK,UAAY,EAC7B,EAEJ2D,GAAO+B,GAEHxE,GAAUwE,cAAgB/B,GAE9B+B,GAActG,KAAO,gBAGrB,MAAMuG,WAAwBmF,GAC1B,WAAA/hF,CAAYs4E,EAAa,CAAC,GACtBr3C,MAAMq3C,GACNplF,KAAK0jF,QAAQI,SAAW,EACxB9jF,KAAK0jF,QAAQK,UAAY,EAC7B,EAEJ4D,GAAO+B,GAEHzE,GAAUyE,gBAAkB/B,GAEhC+B,GAAgBvG,KAAO,kBAGvB,MAAMwG,WAAsBkF,GACxB,WAAA/hF,CAAYs4E,EAAa,CAAC,GACtBr3C,MAAMq3C,GACNplF,KAAK0jF,QAAQI,SAAW,EACxB9jF,KAAK0jF,QAAQK,UAAY,EAC7B,EAEJ6D,GAAO+B,GAEH1E,GAAU0E,cAAgB/B,GAE9B+B,GAAcxG,KAAO,gBAGrB,MAAMyG,WAAuBiF,GACzB,WAAA/hF,CAAYs4E,EAAa,CAAC,GACtBr3C,MAAMq3C,GACNplF,KAAK0jF,QAAQI,SAAW,EACxB9jF,KAAK0jF,QAAQK,UAAY,EAC7B,EAEJ8D,GAAO+B,GAEH3E,GAAU2E,eAAiB/B,GAE/B+B,GAAezG,KAAO,iBAGtB,MAAM0G,WAAkBgF,GACpB,WAAA/hF,CAAYs4E,EAAa,CAAC,GACtBr3C,MAAMq3C,GACNplF,KAAK0jF,QAAQI,SAAW,EACxB9jF,KAAK0jF,QAAQK,UAAY,EAC7B,EAEJ+D,GAAO+B,GAEH5E,GAAU4E,UAAY/B,GAE1B+B,GAAU1G,KAAO,YAGjB,MAAM6G,WAAsB6E,GACxB,WAAA/hF,CAAYs4E,EAAa,CAAC,GACtBr3C,MAAMq3C,GACNplF,KAAK0jF,QAAQI,SAAW,EACxB9jF,KAAK0jF,QAAQK,UAAY,EAC7B,EAEJgE,GAAOiC,GAEH/E,GAAU+E,cAAgBjC,GAE9BiC,GAAc7G,KAAO,gBAGrB,MAAM8G,WAAsB4E,GACxB,WAAA/hF,CAAYs4E,EAAa,CAAC,GACtBr3C,MAAMq3C,GACNplF,KAAK0jF,QAAQI,SAAW,EACxB9jF,KAAK0jF,QAAQK,UAAY,EAC7B,EAEJiE,GAAOiC,GAEHhF,GAAUgF,cAAgBjC,GAE9BiC,GAAc9G,KAAO,gBAGrB,MAAM+G,WAAsB2E,GACxB,WAAA/hF,CAAYs4E,EAAa,CAAC,GACtBr3C,MAAMq3C,GACNplF,KAAK0jF,QAAQI,SAAW,EACxB9jF,KAAK0jF,QAAQK,UAAY,EAC7B,EAEJkE,GAAOiC,GAEHjF,GAAUiF,cAAgBjC,GAE9BiC,GAAc/G,KAAO,gBAGrB,MAAMiH,WAAwByE,GAC1B,WAAA/hF,CAAYs4E,EAAa,CAAC,GACtBr3C,MAAMq3C,GACNplF,KAAK0jF,QAAQI,SAAW,EACxB9jF,KAAK0jF,QAAQK,UAAY,EAC7B,EAEJmE,GAAOkC,GAEHnF,GAAUmF,gBAAkBlC,GAEhCkC,GAAgBjH,KAAO,kBAGvB,MAAM2G,WAAgBG,GAClB,WAAAn9E,EAAY,MAAErN,EAAK,UAAE+vF,KAAcpK,GAAe,CAAC,GAQ/C,GAPAr3C,MAAMq3C,GACNplF,KAAKyvF,KAAO,EACZzvF,KAAK0vF,MAAQ,EACb1vF,KAAK2vF,IAAM,EACX3vF,KAAK4vF,KAAO,EACZ5vF,KAAK6vF,OAAS,EACd7vF,KAAK2rF,OAAS,EACVlsF,EAAO,CACPO,KAAK86B,WAAWr7B,GAChBO,KAAKslF,WAAWzC,aAAe,IAAIlhF,WAAWlC,EAAM/D,QACpD,IAAK,IAAIkB,EAAI,EAAGA,EAAI6C,EAAM/D,OAAQkB,IAC9BoD,KAAKslF,WAAWzC,aAAajmF,GAAK6C,EAAM3B,WAAWlB,EAC3D,CACI4yF,IACAxvF,KAAK8vF,SAASN,GACdxvF,KAAKslF,WAAWzC,aAAe,IAAIlhF,WAAW3B,KAAK+vF,aAEvD/vF,KAAK0jF,QAAQI,SAAW,EACxB9jF,KAAK0jF,QAAQK,UAAY,EAC7B,CACA,UAAAwC,CAAWtG,GACPjgF,KAAK86B,WAAWv9B,OAAOC,aAAatB,MAAM,KAAM,MAAgCqiC,aAAa0hD,IACjG,CACA,QAAA8P,GACI,MAAMr9E,EAAM1S,KAAKvB,WACX3B,EAAS,IAAIkW,YAAYN,EAAIhX,QAC7BsjC,EAAO,IAAIr9B,WAAW7E,GAC5B,IAAK,IAAIF,EAAI,EAAGA,EAAI8V,EAAIhX,OAAQkB,IAC5BoiC,EAAKpiC,GAAK8V,EAAI5U,WAAWlB,GAC7B,OAAOE,CACX,CACA,QAAAgzF,CAASE,GACLhwF,KAAKyvF,KAAOO,EAAUC,iBACtBjwF,KAAK0vF,MAAQM,EAAUE,cAAgB,EACvClwF,KAAK2vF,IAAMK,EAAUG,aACrBnwF,KAAK4vF,KAAOI,EAAUI,cACtBpwF,KAAK6vF,OAASG,EAAUK,gBACxBrwF,KAAK2rF,OAASqE,EAAUM,eAC5B,CACA,MAAAC,GACI,OAAO,IAAKrmF,KAAKA,KAAKsmF,IAAIxwF,KAAKyvF,KAAMzvF,KAAK0vF,MAAQ,EAAG1vF,KAAK2vF,IAAK3vF,KAAK4vF,KAAM5vF,KAAK6vF,OAAQ7vF,KAAK2rF,QAChG,CACA,UAAA7wD,CAAWg0D,GACP,MACM2B,EADS,gDACYvzE,KAAK4xE,GAChC,GAAoB,OAAhB2B,EAEA,YADAzwF,KAAK0H,MAAQ,qCAGjB,MAAM+nF,EAAO3mF,SAAS2nF,EAAY,GAAI,IAElCzwF,KAAKyvF,KADLA,GAAQ,GACI,KAAOA,EAEP,IAAOA,EACvBzvF,KAAK0vF,MAAQ5mF,SAAS2nF,EAAY,GAAI,IACtCzwF,KAAK2vF,IAAM7mF,SAAS2nF,EAAY,GAAI,IACpCzwF,KAAK4vF,KAAO9mF,SAAS2nF,EAAY,GAAI,IACrCzwF,KAAK6vF,OAAS/mF,SAAS2nF,EAAY,GAAI,IACvCzwF,KAAK2rF,OAAS7iF,SAAS2nF,EAAY,GAAI,GAC3C,CACA,QAAAhyF,CAASk+B,EAAW,OAChB,GAAiB,QAAbA,EAAoB,CACpB,MAAM+zD,EAAc,IAAIl1F,MAAM,GAQ9B,OAPAk1F,EAAY,GAAK,GAAoB1wF,KAAKyvF,KAAO,IAASzvF,KAAKyvF,KAAO,KAASzvF,KAAKyvF,KAAO,IAAQ,GACnGiB,EAAY,GAAK,GAAkB1wF,KAAK0vF,MAAO,GAC/CgB,EAAY,GAAK,GAAkB1wF,KAAK2vF,IAAK,GAC7Ce,EAAY,GAAK,GAAkB1wF,KAAK4vF,KAAM,GAC9Cc,EAAY,GAAK,GAAkB1wF,KAAK6vF,OAAQ,GAChDa,EAAY,GAAK,GAAkB1wF,KAAK2rF,OAAQ,GAChD+E,EAAY,GAAK,IACVA,EAAYhzF,KAAK,GAC5B,CACA,OAAOqwC,MAAMtvC,SAASk+B,EAC1B,CACA,eAAAkpD,GACI,MAAO,GAAG7lF,KAAK8M,YAAYq2E,UAAUnjF,KAAKuwF,SAASI,eACvD,CACA,MAAA3pE,GACI,MAAO,IACA+mB,MAAM/mB,SACTyoE,KAAMzvF,KAAKyvF,KACXC,MAAO1vF,KAAK0vF,MACZC,IAAK3vF,KAAK2vF,IACVC,KAAM5vF,KAAK4vF,KACXC,OAAQ7vF,KAAK6vF,OACblE,OAAQ3rF,KAAK2rF,OAErB,EAEJxD,GAAO2B,GAEH7E,GAAU6E,QAAU3B,GAExB2B,GAAQ3G,KAAO,UAGf,MAAM4G,WAAwBD,GAC1B,WAAAh9E,CAAYs4E,EAAa,CAAC,GACtB,IAAIzB,EACJ51C,MAAMq3C,GACsB,QAA3BzB,EAAK3jF,KAAK4wF,mBAAgC,IAAPjN,IAAsB3jF,KAAK4wF,YAAc,GAC7E5wF,KAAK0jF,QAAQI,SAAW,EACxB9jF,KAAK0jF,QAAQK,UAAY,EAC7B,CACA,QAAA+L,CAASE,GACLjiD,MAAM+hD,SAASE,GACfhwF,KAAK4wF,YAAcZ,EAAUa,oBACjC,CACA,MAAAN,GACI,OAAO,IAAKrmF,KAAKA,KAAKsmF,IAAIxwF,KAAKyvF,KAAMzvF,KAAK0vF,MAAQ,EAAG1vF,KAAK2vF,IAAK3vF,KAAK4vF,KAAM5vF,KAAK6vF,OAAQ7vF,KAAK2rF,OAAQ3rF,KAAK4wF,aAC7G,CACA,UAAA91D,CAAWg0D,GACP,IAII35B,EAJA27B,GAAQ,EACRC,EAAa,GACbC,EAAiB,GACjBC,EAAe,EAEfC,EAAiB,EACjBC,EAAmB,EACvB,GAA4C,MAAxCrC,EAAYA,EAAYpzF,OAAS,GACjCq1F,EAAajC,EAAYzjF,UAAU,EAAGyjF,EAAYpzF,OAAS,GAC3Do1F,GAAQ,MAEP,CACD,MAAM19C,EAAS,IAAI1zC,OAAOovF,EAAYA,EAAYpzF,OAAS,IAC3D,GAAIyH,MAAMiwC,EAAO8H,WACb,MAAM,IAAIl9C,MAAM,qCACpB+yF,EAAajC,CACjB,CACA,GAAIgC,EAAO,CACP,IAAiC,IAA7BC,EAAWl+E,QAAQ,KACnB,MAAM,IAAI7U,MAAM,qCACpB,IAAiC,IAA7B+yF,EAAWl+E,QAAQ,KACnB,MAAM,IAAI7U,MAAM,oCACxB,KACK,CACD,IAAIozF,EAAa,EACbC,EAAqBN,EAAWl+E,QAAQ,KACxCy+E,EAAmB,GAKvB,IAJ4B,IAAxBD,IACAA,EAAqBN,EAAWl+E,QAAQ,KACxCu+E,GAAc,IAEU,IAAxBC,EAA2B,CAG3B,GAFAC,EAAmBP,EAAW1lF,UAAUgmF,EAAqB,GAC7DN,EAAaA,EAAW1lF,UAAU,EAAGgmF,GACJ,IAA5BC,EAAiB51F,QAA8C,IAA5B41F,EAAiB51F,OACrD,MAAM,IAAIsC,MAAM,qCACpB,IAAIo1C,EAAStqC,SAASwoF,EAAiBjmF,UAAU,EAAG,GAAI,IACxD,GAAIlI,MAAMiwC,EAAO8H,WACb,MAAM,IAAIl9C,MAAM,qCAEpB,GADAkzF,EAAiBE,EAAah+C,EACE,IAA5Bk+C,EAAiB51F,OAAc,CAE/B,GADA03C,EAAStqC,SAASwoF,EAAiBjmF,UAAU,EAAG,GAAI,IAChDlI,MAAMiwC,EAAO8H,WACb,MAAM,IAAIl9C,MAAM,qCACpBmzF,EAAmBC,EAAah+C,CACpC,CACJ,CACJ,CACA,IAAIm+C,EAAwBR,EAAWl+E,QAAQ,KAG/C,IAF+B,IAA3B0+E,IACAA,EAAwBR,EAAWl+E,QAAQ,OAChB,IAA3B0+E,EAA8B,CAC9B,MAAMC,EAAoB,IAAI9xF,OAAO,IAAIqxF,EAAW1lF,UAAUkmF,MAC9D,GAAIpuF,MAAMquF,EAAkBt2C,WACxB,MAAM,IAAIl9C,MAAM,qCACpBizF,EAAeO,EAAkBt2C,UACjC81C,EAAiBD,EAAW1lF,UAAU,EAAGkmF,EAC7C,MAEIP,EAAiBD,EACrB,QAAQ,GACJ,KAAgC,IAA1BC,EAAet1F,OAEjB,GADAy5D,EAAS,2BACsB,IAA3Bo8B,EACA,MAAM,IAAIvzF,MAAM,qCACpB,MACJ,KAAgC,KAA1BgzF,EAAet1F,OAEjB,GADAy5D,EAAS,kCACsB,IAA3Bo8B,EAA8B,CAC9B,IAAIE,EAAiB,GAAKR,EAC1BjxF,KAAK6vF,OAASrzF,KAAKmD,MAAM8xF,GACzBA,EAAiB,IAAMA,EAAiBzxF,KAAK6vF,QAC7C7vF,KAAK2rF,OAASnvF,KAAKmD,MAAM8xF,GACzBA,EAAiB,KAAQA,EAAiBzxF,KAAK2rF,QAC/C3rF,KAAK4wF,YAAcp0F,KAAKmD,MAAM8xF,EAClC,CACA,MACJ,KAAgC,KAA1BT,EAAet1F,OAEjB,GADAy5D,EAAS,yCACsB,IAA3Bo8B,EAA8B,CAC9B,IAAIE,EAAiB,GAAKR,EAC1BjxF,KAAK2rF,OAASnvF,KAAKmD,MAAM8xF,GACzBA,EAAiB,KAAQA,EAAiBzxF,KAAK2rF,QAC/C3rF,KAAK4wF,YAAcp0F,KAAKmD,MAAM8xF,EAClC,CACA,MACJ,KAAgC,KAA1BT,EAAet1F,OAEjB,GADAy5D,EAAS,gDACsB,IAA3Bo8B,EAA8B,CAC9B,MAAME,EAAiB,IAAOR,EAC9BjxF,KAAK4wF,YAAcp0F,KAAKmD,MAAM8xF,EAClC,CACA,MACJ,QACI,MAAM,IAAIzzF,MAAM,qCAExB,MAAMyyF,EAAct7B,EAAOj4C,KAAK8zE,GAChC,GAAoB,OAAhBP,EACA,MAAM,IAAIzyF,MAAM,qCACpB,IAAK,IAAIZ,EAAI,EAAGA,EAAIqzF,EAAY/0F,OAAQ0B,IACpC,OAAQA,GACJ,KAAK,EACD4C,KAAKyvF,KAAO3mF,SAAS2nF,EAAYrzF,GAAI,IACrC,MACJ,KAAK,EACD4C,KAAK0vF,MAAQ5mF,SAAS2nF,EAAYrzF,GAAI,IACtC,MACJ,KAAK,EACD4C,KAAK2vF,IAAM7mF,SAAS2nF,EAAYrzF,GAAI,IACpC,MACJ,KAAK,EACD4C,KAAK4vF,KAAO9mF,SAAS2nF,EAAYrzF,GAAI,IAAM8zF,EAC3C,MACJ,KAAK,EACDlxF,KAAK6vF,OAAS/mF,SAAS2nF,EAAYrzF,GAAI,IAAM+zF,EAC7C,MACJ,KAAK,EACDnxF,KAAK2rF,OAAS7iF,SAAS2nF,EAAYrzF,GAAI,IACvC,MACJ,QACI,MAAM,IAAIY,MAAM,qCAG5B,IAAc,IAAV8yF,EAAiB,CACjB,MAAMY,EAAW,IAAIxnF,KAAKlK,KAAKyvF,KAAMzvF,KAAK0vF,MAAO1vF,KAAK2vF,IAAK3vF,KAAK4vF,KAAM5vF,KAAK6vF,OAAQ7vF,KAAK2rF,OAAQ3rF,KAAK4wF,aACrG5wF,KAAKyvF,KAAOiC,EAASzB,iBACrBjwF,KAAK0vF,MAAQgC,EAASxB,cACtBlwF,KAAK2vF,IAAM+B,EAASC,YACpB3xF,KAAK4vF,KAAO8B,EAAStB,cACrBpwF,KAAK6vF,OAAS6B,EAASrB,gBACvBrwF,KAAK2rF,OAAS+F,EAASpB,gBACvBtwF,KAAK4wF,YAAcc,EAASb,oBAChC,CACJ,CACA,QAAApyF,CAASk+B,EAAW,OAChB,GAAiB,QAAbA,EAAoB,CACpB,MAAM+zD,EAAc,GAYpB,OAXAA,EAAYpzF,KAAK,GAAkB0C,KAAKyvF,KAAM,IAC9CiB,EAAYpzF,KAAK,GAAkB0C,KAAK0vF,MAAO,IAC/CgB,EAAYpzF,KAAK,GAAkB0C,KAAK2vF,IAAK,IAC7Ce,EAAYpzF,KAAK,GAAkB0C,KAAK4vF,KAAM,IAC9Cc,EAAYpzF,KAAK,GAAkB0C,KAAK6vF,OAAQ,IAChDa,EAAYpzF,KAAK,GAAkB0C,KAAK2rF,OAAQ,IACvB,IAArB3rF,KAAK4wF,cACLF,EAAYpzF,KAAK,KACjBozF,EAAYpzF,KAAK,GAAkB0C,KAAK4wF,YAAa,KAEzDF,EAAYpzF,KAAK,KACVozF,EAAYhzF,KAAK,GAC5B,CACA,OAAOqwC,MAAMtvC,SAASk+B,EAC1B,CACA,MAAA3V,GACI,MAAO,IACA+mB,MAAM/mB,SACT4pE,YAAa5wF,KAAK4wF,YAE1B,EAEJxI,GAAO2B,GAEH9E,GAAU8E,gBAAkB3B,GAEhC2B,GAAgB5G,KAAO,kBAGvB,MAAMmH,WAAajB,GACf,WAAAv8E,CAAYs4E,EAAa,CAAC,GACtBr3C,MAAMq3C,GACNplF,KAAK0jF,QAAQI,SAAW,EACxB9jF,KAAK0jF,QAAQK,UAAY,EAC7B,EAEJsE,GAAOiC,GAEHrF,GAAUqF,KAAOjC,GAErBiC,GAAKnH,KAAO,OAGZ,MAAMoH,WAAkBlB,GACpB,WAAAv8E,CAAYs4E,EAAa,CAAC,GACtBr3C,MAAMq3C,GACNplF,KAAK0jF,QAAQI,SAAW,EACxB9jF,KAAK0jF,QAAQK,UAAY,EAC7B,EAEJuE,GAAOiC,GAEHtF,GAAUsF,UAAYjC,GAE1BiC,GAAUpH,KAAO,YAGjB,MAAMqH,WAAiBnB,GACnB,WAAAv8E,CAAYs4E,EAAa,CAAC,GACtBr3C,MAAMq3C,GACNplF,KAAK0jF,QAAQI,SAAW,EACxB9jF,KAAK0jF,QAAQK,UAAY,EAC7B,EAEJwE,GAAOiC,GAEHvF,GAAUuF,SAAWjC,GAEzBiC,GAASrH,KAAO,WAGhB,MAAM5hE,WAAiB8nE,GACnB,WAAAv8E,CAAYs4E,EAAa,CAAC,GACtBr3C,MAAMq3C,GACNplF,KAAK0jF,QAAQI,SAAW,EACxB9jF,KAAK0jF,QAAQK,UAAY,EAC7B,EAEJyE,GAAOjnE,GAEH0jE,GAAU1jE,SAAWinE,GAEzBjnE,GAAS4hE,KAAO,WAGhB,MAAMoG,WAAaF,GACf,WAAAv8E,CAAYs4E,EAAa,CAAC,GACtBr3C,MAAMq3C,GACNplF,KAAK0jF,QAAQI,SAAW,EACxB9jF,KAAK0jF,QAAQK,UAAY,EAC7B,EC/rFW,SAAS,GAAYroF,GAChC,GAAIyH,MAAMzH,IAAWA,GAAU,EAC3B,MAAM,IAAI,GAAU,qDAAsD,sBAE9E,OAAO,GAAMA,EACjB,CC2FA,SAASk2F,GAAQC,GACb,IAAIt6E,EAAMs6E,EAAGpzF,SAAS,IAClB8Y,EAAI7b,OAAS,EAAI,IACjB6b,EAAM,IAAIA,KAEd,MAAM/Q,EAAM+Q,EAAI7b,OAAS,EACnBo2F,EAAK,IAAInwF,WAAW6E,GAC1B,IAAI5J,EAAI,EACJQ,EAAI,EACR,KAAOR,EAAI4J,GACPsrF,EAAGl1F,GAAKkM,SAASyO,EAAI9Z,MAAML,EAAGA,EAAI,GAAI,IACtCR,GAAK,EACLQ,GAAK,EAET,OAAO00F,CACX,CACA,SAASC,GAAQD,GACb,MAAMv6E,EAAM,GAQZ,OAPAu6E,EAAGhmF,SAAQ,SAAUlP,GACjB,IAAI+a,EAAI/a,EAAE6B,SAAS,IACfkZ,EAAEjc,OAAS,EAAI,IACfic,EAAI,IAAIA,KAEZJ,EAAIja,KAAKqa,EACb,IACOqsB,OAAO,KAAOzsB,EAAI7Z,KAAK,IAClC,CFukFA+sE,GAAK8e,GAEDtE,GAAUsE,KAAO9e,GAErB8e,GAAKpG,KAAO,OEvkFLp4C,eAAeinD,GAAY/V,EAAYe,GAC1C,MAAMhyC,EAAS,GAAUlgC,MAsBnBmnF,EApBa,IAAI,GAAgB,CACnCxyF,MAAO,CAEH,IAAI,GAAe,CAAEA,MAAO,IAE5B,IAAI,GAAgB,CAChBA,MAAO,CAEH,IAAI,GAAwB,CACxBA,MAAO,yBAEX,IAAI,MAIZ,IAAI,GAAmB,CACnBshF,SAAU9E,EAAW2C,eAIPqE,QACpBiP,EAAS,IAAIvwF,WAAWswF,EAAQ,EAAGA,EAAOh0D,YAC1Co/C,EAAO,GA5BG,IA6BV8U,QChGHpnD,eAA2B/+B,EAAMgxE,EAAUK,EAAMh4C,GACpD,MAAM,EAAExnC,EAAC,MAAEu0F,EAAK,UAAEC,EAAS,GAAEC,EAAE,IAAEC,EAAG,QAAEC,GA1D1C,SAAoBxmF,EAAMymF,EAAWC,EAAOC,GACxC,GAAW3mF,GACX,MAAMq5B,E7F6IH,SAAmBxf,EAAUwf,GAChC,QAAatnC,IAATsnC,GAA2C,oBAArBqP,GAAMpuC,KAAK++B,GACjC,MAAM,IAAIrnC,MAAM,yCAEpB,OADec,OAAOoN,O6FhJC,CAAEkmF,MAAO,GAAIC,UAAW,I7FgJRhtD,EAE3C,C6FlJiButD,CAAU,EAA8BD,IAC/C,EAAE90F,EAAC,MAAEu0F,EAAK,UAAEC,GAAchtD,EAIhC,GAHA,GAAaxnC,GACb,GAAau0F,GACb,GAAaC,GACTx0F,EAAI,EACJ,MAAM,IAAIG,MAAM,yCACpB,MAAMg/E,EAAWzoC,GAAQk+C,GACnBpV,EAAO9oC,GAAQm+C,GAEfJ,EAAK,IAAI3wF,WAAWywF,GAEpBG,EAAMxS,GAAKtzE,OAAOT,EAAMgxE,GACxBwV,EAAUD,EAAI99C,aAAa9jC,OAAO0sE,GACxC,MAAO,CAAEx/E,IAAGu0F,QAAOC,YAAWC,KAAIC,MAAKC,UAC3C,CAyCsDK,CAAW7mF,EAAMgxE,EAAUK,EAAMh4C,GACnF,IAAIytD,EACJ,MAAMh/C,EAAM,IAAInyC,WAAW,GACrBq9B,EAAO,GAAW8U,GAClBw5B,EAAI,IAAI3rE,WAAW4wF,EAAIh/C,WAE7B,IAAK,IAAIw/C,EAAK,EAAGvwF,EAAM,EAAGA,EAAM4vF,EAAOW,IAAMvwF,GAAO+vF,EAAIh/C,UAAW,CAE/D,MAAMy/C,EAAKV,EAAG/+D,SAAS/wB,EAAKA,EAAM+vF,EAAIh/C,WACtCvU,EAAKwe,SAAS,EAAGu1C,GAAI,IAGpBD,EAAON,EAAQ/9C,WAAWq+C,IAAOniF,OAAOmjC,GAAKyB,WAAW+3B,GACzD0lB,EAAGjoF,IAAIuiE,EAAE/5C,SAAS,EAAGy/D,EAAGt3F,eAClBw4C,GAAUr2C,EAAI,EAAGw0F,GAAW,KAE9BE,EAAI99C,WAAWq+C,GAAMniF,OAAO28D,GAAG/3B,WAAW+3B,GAC1C,IAAK,IAAI1wE,EAAI,EAAGA,EAAIo2F,EAAGt3F,OAAQkB,IAC3Bo2F,EAAGp2F,IAAM0wE,EAAE1wE,EAAE,GAEzB,CACA,OA7DJ,SAAsB21F,EAAKC,EAASF,EAAIQ,EAAMxlB,GAM1C,OALAilB,EAAIrpF,UACJspF,EAAQtpF,UACJ4pF,GACAA,EAAK5pF,UACTokE,EAAE73B,KAAK,GACA68C,CACX,CAsDWW,CAAaV,EAAKC,EAASF,EAAIQ,EAAMxlB,EAChD,CDyEgC,CAAY,GAAQ0P,EAAUK,EAAM,CAC5Dx/E,EA5BW,IA6BXu0F,MA9BS,KAgCP5U,EAAK,GAAY,IACjBC,QAAkBzyC,EAAOC,OAAOyyC,UAAU,MAAOyU,EAAe,WAAW,EAAO,CAAC,YACnFe,QAAkBloD,EAAOC,OAAOmyC,QAAQ,CAC1CvxE,KAAM,UACN2xE,MACDC,EAAWyU,GACRiB,EAAe,IAAI,GAAgB,CACrC1zF,MAAO,CAEH,IAAI,GAAmB,CAAEshF,SAAU1D,IAEnC,IAAI,GAAe,CAAE59E,MA1Cd,MA4CP,IAAI,GAAe,CAAEA,MA7ChB,KA+CL,IAAI,GAAgB,CAChBA,MAAO,CAEH,IAAI,GAAwB,CAAEA,MAAO,wBACrC,IAAI,SAKd2zF,EAAsB,IAAI,GAAgB,CAC5C3zF,MAAO,CAEH,IAAI,GAAwB,CACxBA,MAAO,0BAEX,IAAI,GAAgB,CAChBA,MAAO,CAEH,IAAI,GAAgB,CAChBA,MAAO,CAEH,IAAI,GAAwB,CACxBA,MAAO,0BAGX0zF,KAIR,IAAI,GAAgB,CAChB1zF,MAAO,CAEH,IAAI,GAAwB,CACxBA,MAAO,4BAGX,IAAI,GAAmB,CACnBshF,SAAUvD,aAchC6V,EANe,IAAI,GAAgB,CACrC5zF,MAAO,CACH2zF,EACA,IAAI,GAAmB,CAAErS,SAAUmS,OAGNjQ,QAErC,MAAO,CACH,2CACG,GAHiB,IAAIthF,WAAW0xF,EAAiB,EAAGA,EAAgBp1D,YAGhC,aAAav4B,MAAM,WAAWgX,OAAOyK,SAC5E,uCACFzpB,KAAK,KACX,CElOO,MAAM41F,GAAmB,KACzB,MAAMC,GACT7U,KACA,WAAA5xE,CAAYf,GACR/L,KAAK0+E,KAAO3yE,CAChB,CACA,MAAAmf,CAAOkT,EAAMm7C,GACT,OPgCDxuC,eAA6Bh/B,EAAKwtE,EAAK1kC,GAC1C,MAAM2kC,QAAkB,GAAU1uE,MAAMmgC,OAAOyyC,UAAU,MAAO3xE,EAAK,CACjEF,KAAM,oBACNG,KAAM,CAAEH,KAAM,aACf,EAAO,CAAC,WACX,OAAO,GAAUf,MAAMmgC,OAAO/f,OAAO,CAAErf,KAAM,qBAAuB2tE,EAAWD,EAAK1kC,aAAelzC,WAAakzC,EAAMA,EAAIthB,WAC9H,COtCe,CAAqBvzB,KAAK0+E,KAAMnF,EAAKn7C,EAChD,CACA,OAAAwgD,GACI,OFqDD,SAAmBe,GACtB,GAAa,MAATA,EAAIrjF,GAAsB,MAATqjF,EAAIr6E,EACrB,MAAM,IAAI,GAAU,6BAA8B,0BAEtD,MAuBMkuF,EAvBO,IAAI,GAAgB,CAC7B/zF,MAAO,CACH,IAAI,GAAgB,CAChBA,MAAO,CAEH,IAAI,GAAwB,CACxBA,MAAO,yBAEX,IAAI,MAKZ,IAAI,GAAiB,CACjBshF,SAAU,IAAI,GAAgB,CAC1BthF,MAAO,CACH,GAAe2kC,WAAW2tD,GAAQ,GAAqBpS,EAAIrjF,EAAG,eAC9D,GAAe8nC,WAAW2tD,GAAQ,GAAqBpS,EAAIr6E,EAAG,kBAEnE29E,aAIEA,QACjB,OAAO,IAAIthF,WAAW6xF,EAAK,EAAGA,EAAIv1D,WACtC,CElFe,CAAuBj+B,KAAK0+E,KACvC,CACA,SAAIpsE,GACA,OAAO,GAAczV,OAAO,CACxB4qB,KAAM,GAAYgsE,IAClBjV,KAAMx+E,KAAK4+E,YACZrrD,UACP,CACA,MAAA2Y,CAAOngC,GACH,OAAO,GAAiB/L,KAAKsS,MAAOvG,EAAIuG,MAC5C,CACA,IAAAtG,GACI,MAAM3P,EAAI,GAAOqb,OAAO1X,KAAKsS,OAC7B,OAAImzD,GAAUppE,GACHA,EAAEyR,MAAK,EAAGwE,WAAYA,IAE1BjW,EAAEiW,KACb,EAEG,MAAMohF,GACThV,KACAK,WACA,WAAAjyE,CAAYf,EAAKytE,GACbx5E,KAAK0+E,KAAO3yE,EACZ/L,KAAK++E,WAAavF,CACtB,CACA,SAAAma,GACI,OAAO,GAAuB,GAClC,CACA,IAAAzwF,CAAKuG,GACD,OPTDshC,eAA2Bh/B,EAAK8oC,GACnC,MAAMonC,QAAmB,GAAUnxE,MAAMmgC,OAAOyyC,UAAU,MAAO3xE,EAAK,CAClEF,KAAM,oBACNG,KAAM,CAAEH,KAAM,aACf,EAAO,CAAC,SACL0tE,QAAY,GAAUzuE,MAAMmgC,OAAO/nC,KAAK,CAAE2I,KAAM,qBAAuBowE,EAAYpnC,aAAelzC,WAAakzC,EAAMA,EAAIthB,YAC/H,OAAO,IAAI5xB,WAAW43E,EAAK,EAAGA,EAAIt7C,WACtC,COEe,CAAmBj+B,KAAK0+E,KAAMj1E,EACzC,CACA,UAAIu1E,GACA,GAAuB,MAAnBh/E,KAAK++E,WACL,MAAM,IAAI,GAAU,0BAA2B,2BAEnD,OAAO,IAAIwU,GAAavzF,KAAK++E,WACjC,CACA,OAAAH,GACI,OFvBD,SAAoBe,GACvB,GAAa,MAATA,EAAIrjF,GAAsB,MAATqjF,EAAIr6E,GAAsB,MAATq6E,EAAI7iE,GAAsB,MAAT6iE,EAAItjF,GAAsB,MAATsjF,EAAI5oD,GAAuB,MAAV4oD,EAAIiU,IAAwB,MAAVjU,EAAIkU,IAAwB,MAAVlU,EAAImU,GAC7H,MAAM,IAAI,GAAU,6BAA8B,0BAEtD,MAaMN,EAbO,IAAI,GAAgB,CAC7B/zF,MAAO,CACH,IAAI,GAAe,CAAEA,MAAO,IAC5B,GAAe2kC,WAAW2tD,GAAQ,GAAqBpS,EAAIrjF,EAAG,eAC9D,GAAe8nC,WAAW2tD,GAAQ,GAAqBpS,EAAIr6E,EAAG,eAC9D,GAAe8+B,WAAW2tD,GAAQ,GAAqBpS,EAAI7iE,EAAG,eAC9D,GAAesnB,WAAW2tD,GAAQ,GAAqBpS,EAAItjF,EAAG,eAC9D,GAAe+nC,WAAW2tD,GAAQ,GAAqBpS,EAAI5oD,EAAG,eAC9D,GAAeqN,WAAW2tD,GAAQ,GAAqBpS,EAAIiU,GAAI,eAC/D,GAAexvD,WAAW2tD,GAAQ,GAAqBpS,EAAIkU,GAAI,eAC/D,GAAezvD,WAAW2tD,GAAQ,GAAqBpS,EAAImU,GAAI,kBAGtD7Q,QACjB,OAAO,IAAIthF,WAAW6xF,EAAK,EAAGA,EAAIv1D,WACtC,CEIe,CAAwBj+B,KAAK0+E,KACxC,CACA,SAAIpsE,GACA,OAAO,GAAezV,OAAO,CACzB4qB,KAAM,GAAYgsE,IAClBjV,KAAMx+E,KAAK4+E,YACZrrD,UACP,CACA,MAAA2Y,CAAOngC,GACH,OAAO,GAAiB/L,KAAKsS,MAAOvG,EAAIuG,MAC5C,CACA,IAAAtG,GACI,MAAM3P,EAAI,GAAOqb,OAAO1X,KAAKsS,OAC7B,OAAImzD,GAAUppE,GACHA,EAAEyR,MAAK,EAAGwE,WAAYA,IAE1BjW,EAAEiW,KACb,CAQA,QAAMgP,GAEF,OAAO,SADYthB,KAAKg/E,OAAOhzE,OACC,YACpC,CAQA,YAAM,CAAOgxE,EAAUzyE,EAAS,UAC5B,GAAe,WAAXA,EACA,OAAO,GAAyBvK,KAAMg9E,GAErC,GAAe,eAAXzyE,EACL,OAAOwyE,GAAS/8E,KAAKsS,MAAO0qE,GAG5B,MAAM,IAAI,GAAU,kBAAkBzyE,sBAA4B,4BAE1E,EAEGwgC,eAAe,GAAuBz4B,GACzC,MAAMqtE,EF9FH,SAAoBrtE,GACvB,MAAM,OAAEnE,GAAW,GAAemE,GAG5BmQ,EAAStU,EAAOm3E,WAAW7lF,MAajC,MAZY,CACRnD,EAAG,GAAmBs1F,GAAQnvE,EAAO,GAAG0hB,YAAa,aACrD7+B,EAAG,GAAmBssF,GAAQnvE,EAAO,GAAG0hB,YAAa,aACrDrnB,EAAG,GAAmB80E,GAAQnvE,EAAO,GAAG0hB,YAAa,aACrD9nC,EAAG,GAAmBu1F,GAAQnvE,EAAO,GAAG0hB,YAAa,aACrDpN,EAAG,GAAmB66D,GAAQnvE,EAAO,GAAG0hB,YAAa,aACrDyvD,GAAI,GAAmBhC,GAAQnvE,EAAO,GAAG0hB,YAAa,aACtD0vD,GAAI,GAAmBjC,GAAQnvE,EAAO,GAAG0hB,YAAa,aACtD2vD,GAAI,GAAmBlC,GAAQnvE,EAAO,GAAG0hB,YAAa,aACtD24C,IAAK,MACLH,IAAK,QAGb,CE4EgB,CAAwBrqE,GACpC,GAAI,GAAeqtE,GAAO2T,GACtB,MAAM,IAAI,GAAU,wBAAyB,0BAEjD,MAAMv0F,QAAa,GAA2B4gF,GAC9C,OAAO,IAAI+T,GAAc30F,EAAKk9E,WAAYl9E,EAAKy6E,UACnD,CACO,SAASua,GAAsBzhF,GAClC,MAAMqtE,EFzDH,SAAmBrtE,GACtB,MAAM,OAAEnE,GAAW,GAAemE,GAG5BmQ,EAAStU,EAAOm3E,WAAW7lF,MAAM,GAAG6lF,WAAW7lF,MAAM,GAAG6lF,WAAW7lF,MACzE,MAAO,CACHq9E,IAAK,MACLxgF,EAAG,GAAmBs1F,GAAQnvE,EAAO,GAAG0hB,YAAa,aACrD7+B,EAAG,GAAmBssF,GAAQnvE,EAAO,GAAG0hB,YAAa,aAE7D,CE+CgB,CAAuB7xB,GACnC,GAAI,GAAeqtE,GAAO2T,GACtB,MAAM,IAAI,GAAU,wBAAyB,0BAEjD,OAAO,IAAIC,GAAa5T,EAC5B,CACO50C,eAAeipD,GAAQrU,GAC1B,GAAI,GAAeA,GAAO2T,GACtB,MAAM,IAAI,GAAU,wBAAyB,0BAEjD,MAAMv0F,QAAa,GAA2B4gF,GAC9C,OAAO,IAAI+T,GAAc30F,EAAKk9E,WAAYl9E,EAAKy6E,UACnD,CACOzuC,eAAe,GAAgB/1B,GAClC,GAAIA,EAAOs+E,GACP,MAAM,IAAI,GAAU,wBAAyB,0BAEjD,MAAMv0F,QP7HHgsC,eAA2B/1B,GAC9B,MAAMsqE,QAAa,GAAUx0E,MAAMmgC,OAAOgpD,YAAY,CAClDpoF,KAAM,oBACNqoF,cAAel/E,EACfm/E,eAAgB,IAAIxyF,WAAW,CAAC,EAAM,EAAM,IAC5CqK,KAAM,CAAEH,KAAM,aACf,EAAM,CAAC,OAAQ,WACZ9M,QAAaygF,GAAUF,GAC7B,MAAO,CACHrD,WAAYl9E,EAAK,GACjBy6E,UAAWz6E,EAAK,GAExB,COiHuB,CAAmBiW,GACtC,OAAO,IAAI0+E,GAAc30F,EAAKk9E,WAAYl9E,EAAKy6E,UACnD,CC/HA,SAAS4a,GAAmB/uD,QACNtnC,IAAdsnC,EAAKgvD,MACLpqB,GAAM,OAAQ5kC,EAAKgvD,WACFt2F,IAAjBsnC,EAAKsvC,SACL1K,GAAM,UAAW5kC,EAAKsvC,QAC9B,CA6BA,MAAQ,GAAiB2f,GAAK,GAAYC,IAAQ,EACrCC,GAAM,CAEfC,IAAK,cAAqBz2F,MACtB,WAAA8O,CAAY+P,EAAI,IACZkxB,MAAMlxB,EACV,GAEJ,SAAA63E,CAAUt2D,GACN,MAAQq2D,IAAK79C,GAAM49C,GACnB,GAAIp2D,EAAK1iC,OAAS,GAAiB,IAAZ0iC,EAAK,GACxB,MAAM,IAAIwY,EAAE,iCAChB,MAAMpwC,EAAM43B,EAAK,GACXW,EAAMX,EAAK7K,SAAS,EAAG/sB,EAAM,GACnC,IAAKA,GAAOu4B,EAAIrjC,SAAW8K,EACvB,MAAM,IAAIowC,EAAE,2CAKhB,GAAa,IAAT7X,EAAI,GACJ,MAAM,IAAI6X,EAAE,uCAChB,GAAe,IAAX7X,EAAI,MAA0B,IAATA,EAAI,IACzB,MAAM,IAAI6X,EAAE,uDAChB,MAAO,CAAE95B,EAAGw3E,GAAIv1D,GAAMlvB,EAAGuuB,EAAK7K,SAAS/sB,EAAM,GACjD,EACA,KAAAmuF,CAAMp9E,GAEF,MAAQk9E,IAAK79C,GAAM49C,GACbp2D,EAAsB,iBAAR7mB,EAAmBg9E,GAAIh9E,GAAOA,EAClD,GAAU6mB,GACV,IAAIvuB,EAAIuuB,EAAK1iC,OACb,GAAImU,EAAI,GAAgB,IAAXuuB,EAAK,GACd,MAAM,IAAIwY,EAAE,yBAChB,GAAIxY,EAAK,KAAOvuB,EAAI,EAChB,MAAM,IAAI+mC,EAAE,uCAChB,MAAQ95B,EAAGlV,EAAGiI,EAAG+kF,GAAWJ,GAAIE,UAAUt2D,EAAK7K,SAAS,KAChDzW,EAAGvH,EAAG1F,EAAGglF,GAAeL,GAAIE,UAAUE,GAC9C,GAAIC,EAAWn5F,OACX,MAAM,IAAIk7C,EAAE,+CAChB,MAAO,CAAEhvC,IAAG2N,IAChB,EACA,UAAAu/E,CAAWvb,GAEP,MAAM97E,EAAS8X,GAAmC,EAA5B7V,OAAOoJ,SAASyM,EAAE,GAAI,IAAe,KAAOA,EAAIA,EAChEoC,EAAKyyB,IACP,MAAM7yB,EAAM6yB,EAAI3rC,SAAS,IACzB,OAAoB,EAAb8Y,EAAI7b,OAAa,IAAI6b,IAAQA,CAAG,EAErChC,EAAI9X,EAAMka,EAAE4hE,EAAIhkE,IAChB3N,EAAInK,EAAMka,EAAE4hE,EAAI3xE,IAChBmtF,EAAMx/E,EAAE7Z,OAAS,EACjBs5F,EAAMptF,EAAElM,OAAS,EACjBiwE,EAAKh0D,EAAEo9E,GACPE,EAAKt9E,EAAEq9E,GACb,MAAO,KAAKr9E,EAAEq9E,EAAMD,EAAM,OAAOE,IAAKrtF,MAAM+jE,IAAKp2D,GACrD,GAIE,GAAMyuB,OAAO,GAAI,GAAMA,OAAO,GAAqB,IAAXA,OAAO,GAAUA,OAAO,IAyc/D,SAASkxD,GAAY5gB,GACxB,MAAMC,EArBV,SAAsB9B,GAClB,MAAMptC,EAAOmtC,GAAcC,GAU3B,OATA,GAAkBptC,EAAM,CACpBr5B,KAAM,OACN+zE,KAAM,WACN3L,YAAa,YACd,CACC+gB,SAAU,WACVC,cAAe,WACff,KAAM,YAEHv1F,OAAO4P,OAAO,CAAE2lF,MAAM,KAAShvD,GAC1C,CASkB,CAAaivC,IACrB,GAAEpI,EAAI5vE,GAAmBi4E,EACzB8gB,EAAgBnpB,EAAG6B,MAAQ,EAC3BunB,EAAkB,EAAIppB,EAAG6B,MAAQ,EACvC,SAAS+K,EAAKz+C,GACV,OAAO,GAAQA,EAAGu9C,EACtB,CACA,SAAS2d,EAAKl7D,GACV,OAAO,GAAWA,EAAGu9C,EACzB,CACA,MAAQ4d,gBAAiBtgB,EAAK,uBAAEugB,EAAsB,oBAAEC,EAAmB,mBAAEC,GAnd1E,SAA2BtwD,GAC9B,MAAMkvC,EA1FV,SAA2B9B,GACvB,MAAMptC,EAAOmtC,GAAcC,GAC3B,GAAkBptC,EAAM,CACpBhL,EAAG,QACHh9B,EAAG,SACJ,CACCu4F,yBAA0B,QAC1BC,eAAgB,UAChB7d,cAAe,WACfC,cAAe,WACf6d,mBAAoB,UACpBrlB,UAAW,WACXl8B,QAAS,aAEb,MAAM,KAAEwhD,EAAI,GAAE7pB,EAAE,EAAE7xC,GAAMgL,EACxB,GAAI0wD,EAAM,CACN,IAAK7pB,EAAGiC,IAAI9zC,EAAG6xC,EAAG8C,MACd,MAAM,IAAIhxE,MAAM,qEAEpB,GAAoB,iBAAT+3F,GACc,iBAAdA,EAAKC,MACgB,mBAArBD,EAAKE,YACZ,MAAM,IAAIj4F,MAAM,oEAExB,CACA,OAAOc,OAAO4P,OAAO,IAAK22B,GAC9B,CAgEkB6wD,CAAkB7wD,IAC1B,GAAE6mC,GAAOqI,EACThgC,EAAUggC,EAAMhgC,SAClB,EAAEqvC,EAAIjL,EAAOwd,KACT,MAAM97D,EAAIs+C,EAAMrC,WAChB,OAAO,GAAe30E,WAAWk5B,KAAK,CAAC,IAAQqxC,EAAG33B,QAAQla,EAAEtjB,GAAIm1D,EAAG33B,QAAQla,EAAEgzC,GAChF,GACCoD,EAAY8D,EAAM9D,WACpB,CAAEn+D,IAEE,MAAM+qB,EAAO/qB,EAAMihB,SAAS,GAI5B,MAAO,CAAExc,EAFCm1D,EAAGuE,UAAUpzC,EAAK9J,SAAS,EAAG24C,EAAG6B,QAE/BV,EADFnB,EAAGuE,UAAUpzC,EAAK9J,SAAS24C,EAAG6B,MAAO,EAAI7B,EAAG6B,QAEzD,GAKL,SAAS2nB,EAAoB3+E,GACzB,MAAM,EAAEsjB,EAAC,EAAEh9B,GAAMk3E,EACX6hB,EAAKlqB,EAAGkC,IAAIr3D,GACZs/E,EAAKnqB,EAAGmC,IAAI+nB,EAAIr/E,GACtB,OAAOm1D,EAAG9kD,IAAI8kD,EAAG9kD,IAAIivE,EAAInqB,EAAGmC,IAAIt3D,EAAGsjB,IAAKh9B,EAC5C,CAKA,IAAK6uE,EAAGiC,IAAIjC,EAAGkC,IAAImG,EAAM3B,IAAK8iB,EAAoBnhB,EAAM5B,KACpD,MAAM,IAAI30E,MAAM,+CAOpB,SAASy3F,EAAuB1pF,GAC5B,MAAQ6pF,yBAA0BtiD,EAAO,YAAEq6B,EAAW,eAAEkoB,EAAgBv5F,EAAGg6F,GAAM/hB,EACjF,GAAIjhC,GAA0B,iBAARvnC,EAAkB,CAIpC,GAHI,GAAWA,KACXA,EAAM,GAAcA,IAEL,iBAARA,IAAqBunC,EAAQ32B,SAAS5Q,EAAIrQ,QACjD,MAAM,IAAIsC,MAAM,eACpB+N,EAAMA,EAAIo+D,SAAuB,EAAdwD,EAAiB,IACxC,CACA,IAAIvjC,EACJ,IACIA,EACmB,iBAARr+B,EACDA,EACA,GAAmB,GAAY,cAAeA,EAAK4hE,GACjE,CACA,MAAOjmE,GACH,MAAM,IAAI1J,MAAM,uBAAuB2vE,sCAAgD5hE,IAC3F,CAIA,OAHI8pF,IACAzrD,EAAM,GAAQA,EAAKksD,IACvB,GAAY,cAAelsD,EAAK,GAAKksD,GAC9BlsD,CACX,CACA,SAASmsD,EAAepqD,GACpB,KAAMA,aAAiB+oC,GACnB,MAAM,IAAIl3E,MAAM,2BACxB,CAKA,MAAMm3E,EAAezI,IAAS,CAACrwE,EAAG+4E,KAC9B,MAAQohB,GAAIz/E,EAAG0/E,GAAIppB,EAAGqpB,GAAIlhB,GAAMn5E,EAEhC,GAAI6vE,EAAGiC,IAAIqH,EAAGtJ,EAAGsC,KACb,MAAO,CAAEz3D,IAAGs2D,KAChB,MAAMiC,EAAMjzE,EAAEizE,MAGJ,MAAN8F,IACAA,EAAK9F,EAAMpD,EAAGsC,IAAMtC,EAAG8D,IAAIwF,IAC/B,MAAMC,EAAKvJ,EAAGmC,IAAIt3D,EAAGq+D,GACfM,EAAKxJ,EAAGmC,IAAIhB,EAAG+H,GACfO,EAAKzJ,EAAGmC,IAAImH,EAAGJ,GACrB,GAAI9F,EACA,MAAO,CAAEv4D,EAAGm1D,EAAG8C,KAAM3B,EAAGnB,EAAG8C,MAC/B,IAAK9C,EAAGiC,IAAIwH,EAAIzJ,EAAGsC,KACf,MAAM,IAAIxwE,MAAM,oBACpB,MAAO,CAAE+Y,EAAG0+D,EAAIpI,EAAGqI,EAAI,IAIrBE,EAAkBlJ,IAAUrwE,IAC9B,GAAIA,EAAEizE,MAAO,CAIT,GAAIiF,EAAMuhB,qBAAuB5pB,EAAGoD,IAAIjzE,EAAEo6F,IACtC,OACJ,MAAM,IAAIz4F,MAAM,kBACpB,CAEA,MAAM,EAAE+Y,EAAC,EAAEs2D,GAAMhxE,EAAEi6E,WAEnB,IAAKpK,EAAGC,QAAQp1D,KAAOm1D,EAAGC,QAAQkB,GAC9B,MAAM,IAAIrvE,MAAM,4BACpB,MAAMopC,EAAO8kC,EAAGkC,IAAIf,GACdr2D,EAAQ0+E,EAAoB3+E,GAClC,IAAKm1D,EAAGiC,IAAI/mC,EAAMpwB,GACd,MAAM,IAAIhZ,MAAM,qCACpB,IAAK3B,EAAE27E,gBACH,MAAM,IAAIh6E,MAAM,0CACpB,OAAO,CAAI,IAOf,MAAMk3E,EACF,WAAApoE,CAAY0pF,EAAIC,EAAIC,GAIhB,GAHA12F,KAAKw2F,GAAKA,EACVx2F,KAAKy2F,GAAKA,EACVz2F,KAAK02F,GAAKA,EACA,MAANF,IAAetqB,EAAGC,QAAQqqB,GAC1B,MAAM,IAAIx4F,MAAM,cACpB,GAAU,MAANy4F,IAAevqB,EAAGC,QAAQsqB,GAC1B,MAAM,IAAIz4F,MAAM,cACpB,GAAU,MAAN04F,IAAexqB,EAAGC,QAAQuqB,GAC1B,MAAM,IAAI14F,MAAM,cACpBc,OAAO4P,OAAO1O,KAClB,CAGA,iBAAOu2E,CAAWl6E,GACd,MAAM,EAAE0a,EAAC,EAAEs2D,GAAMhxE,GAAK,CAAC,EACvB,IAAKA,IAAM6vE,EAAGC,QAAQp1D,KAAOm1D,EAAGC,QAAQkB,GACpC,MAAM,IAAIrvE,MAAM,wBACpB,GAAI3B,aAAa64E,EACb,MAAM,IAAIl3E,MAAM,gCACpB,MAAMsxE,EAAO1yE,GAAMsvE,EAAGiC,IAAIvxE,EAAGsvE,EAAG8C,MAEhC,OAAIM,EAAIv4D,IAAMu4D,EAAIjC,GACP6H,EAAMlG,KACV,IAAIkG,EAAMn+D,EAAGs2D,EAAGnB,EAAGsC,IAC9B,CACA,KAAIz3D,GACA,OAAO/W,KAAKs2E,WAAWv/D,CAC3B,CACA,KAAIs2D,GACA,OAAOrtE,KAAKs2E,WAAWjJ,CAC3B,CAOA,iBAAOmJ,CAAW7E,GACd,MAAM8E,EAAQvK,EAAGgE,YAAYyB,EAAOjmE,KAAKrP,GAAMA,EAAEq6F,MACjD,OAAO/kB,EAAOjmE,KAAI,CAACrP,EAAGO,IAAMP,EAAEi6E,SAASG,EAAM75E,MAAK8O,IAAIwpE,EAAMqB,WAChE,CAKA,cAAO2B,CAAQ3gE,GACX,MAAM02D,EAAIiH,EAAMqB,WAAW9F,EAAU,GAAY,WAAYl5D,KAE7D,OADA02D,EAAE2I,iBACK3I,CACX,CAEA,qBAAOuK,CAAeyD,GAClB,OAAO/G,EAAMxvC,KAAKgyC,SAAS+d,EAAuBxZ,GACtD,CAEA,cAAAvF,CAAenF,GACXoF,EAAKpE,cAAcvyE,KAAMuxE,EAC7B,CAEA,cAAAqF,GACIhB,EAAgB51E,KACpB,CACA,QAAA22F,GACI,MAAM,EAAEtpB,GAAMrtE,KAAKs2E,WACnB,GAAIpK,EAAGqD,MACH,OAAQrD,EAAGqD,MAAMlC,GACrB,MAAM,IAAIrvE,MAAM,8BACpB,CAIA,MAAAkuC,CAAOC,GACHoqD,EAAepqD,GACf,MAAQqqD,GAAI3f,EAAI4f,GAAI3f,EAAI4f,GAAI3f,GAAO/2E,MAC3Bw2F,GAAIvgB,EAAIwgB,GAAIvgB,EAAIwgB,GAAIvgB,GAAOhqC,EAC7ByqD,EAAK1qB,EAAGiC,IAAIjC,EAAGmC,IAAIwI,EAAIV,GAAKjK,EAAGmC,IAAI4H,EAAIc,IACvC8f,EAAK3qB,EAAGiC,IAAIjC,EAAGmC,IAAIyI,EAAIX,GAAKjK,EAAGmC,IAAI6H,EAAIa,IAC7C,OAAO6f,GAAMC,CACjB,CAIA,MAAA1lB,GACI,OAAO,IAAI+D,EAAMl1E,KAAKw2F,GAAItqB,EAAG4C,IAAI9uE,KAAKy2F,IAAKz2F,KAAK02F,GACpD,CAKA,MAAA3iE,GACI,MAAM,EAAEsG,EAAC,EAAEh9B,GAAMk3E,EACXh8D,EAAK2zD,EAAGmC,IAAIhxE,EAAG,KACbm5F,GAAI3f,EAAI4f,GAAI3f,EAAI4f,GAAI3f,GAAO/2E,KACnC,IAAIq3E,EAAKnL,EAAG8C,KAAMsI,EAAKpL,EAAG8C,KAAMwI,EAAKtL,EAAG8C,KACpC8nB,EAAK5qB,EAAGmC,IAAIwI,EAAIA,GAChBkgB,EAAK7qB,EAAGmC,IAAIyI,EAAIA,GAChB7H,EAAK/C,EAAGmC,IAAI0I,EAAIA,GAChBigB,EAAK9qB,EAAGmC,IAAIwI,EAAIC,GA4BpB,OA3BAkgB,EAAK9qB,EAAG9kD,IAAI4vE,EAAIA,GAChBxf,EAAKtL,EAAGmC,IAAIwI,EAAIE,GAChBS,EAAKtL,EAAG9kD,IAAIowD,EAAIA,GAChBH,EAAKnL,EAAGmC,IAAIh0C,EAAGm9C,GACfF,EAAKpL,EAAGmC,IAAI91D,EAAI02D,GAChBqI,EAAKpL,EAAG9kD,IAAIiwD,EAAIC,GAChBD,EAAKnL,EAAGqC,IAAIwoB,EAAIzf,GAChBA,EAAKpL,EAAG9kD,IAAI2vE,EAAIzf,GAChBA,EAAKpL,EAAGmC,IAAIgJ,EAAIC,GAChBD,EAAKnL,EAAGmC,IAAI2oB,EAAI3f,GAChBG,EAAKtL,EAAGmC,IAAI91D,EAAIi/D,GAChBvI,EAAK/C,EAAGmC,IAAIh0C,EAAG40C,GACf+nB,EAAK9qB,EAAGqC,IAAIuoB,EAAI7nB,GAChB+nB,EAAK9qB,EAAGmC,IAAIh0C,EAAG28D,GACfA,EAAK9qB,EAAG9kD,IAAI4vE,EAAIxf,GAChBA,EAAKtL,EAAG9kD,IAAI0vE,EAAIA,GAChBA,EAAK5qB,EAAG9kD,IAAIowD,EAAIsf,GAChBA,EAAK5qB,EAAG9kD,IAAI0vE,EAAI7nB,GAChB6nB,EAAK5qB,EAAGmC,IAAIyoB,EAAIE,GAChB1f,EAAKpL,EAAG9kD,IAAIkwD,EAAIwf,GAChB7nB,EAAK/C,EAAGmC,IAAIyI,EAAIC,GAChB9H,EAAK/C,EAAG9kD,IAAI6nD,EAAIA,GAChB6nB,EAAK5qB,EAAGmC,IAAIY,EAAI+nB,GAChB3f,EAAKnL,EAAGqC,IAAI8I,EAAIyf,GAChBtf,EAAKtL,EAAGmC,IAAIY,EAAI8nB,GAChBvf,EAAKtL,EAAG9kD,IAAIowD,EAAIA,GAChBA,EAAKtL,EAAG9kD,IAAIowD,EAAIA,GACT,IAAItC,EAAMmC,EAAIC,EAAIE,EAC7B,CAKA,GAAApwD,CAAI+kB,GACAoqD,EAAepqD,GACf,MAAQqqD,GAAI3f,EAAI4f,GAAI3f,EAAI4f,GAAI3f,GAAO/2E,MAC3Bw2F,GAAIvgB,EAAIwgB,GAAIvgB,EAAIwgB,GAAIvgB,GAAOhqC,EACnC,IAAIkrC,EAAKnL,EAAG8C,KAAMsI,EAAKpL,EAAG8C,KAAMwI,EAAKtL,EAAG8C,KACxC,MAAM30C,EAAIk6C,EAAMl6C,EACV9hB,EAAK2zD,EAAGmC,IAAIkG,EAAMl3E,EAAG,IAC3B,IAAIy5F,EAAK5qB,EAAGmC,IAAIwI,EAAIZ,GAChB8gB,EAAK7qB,EAAGmC,IAAIyI,EAAIZ,GAChBjH,EAAK/C,EAAGmC,IAAI0I,EAAIZ,GAChB6gB,EAAK9qB,EAAG9kD,IAAIyvD,EAAIC,GAChBmgB,EAAK/qB,EAAG9kD,IAAI6uD,EAAIC,GACpB8gB,EAAK9qB,EAAGmC,IAAI2oB,EAAIC,GAChBA,EAAK/qB,EAAG9kD,IAAI0vE,EAAIC,GAChBC,EAAK9qB,EAAGqC,IAAIyoB,EAAIC,GAChBA,EAAK/qB,EAAG9kD,IAAIyvD,EAAIE,GAChB,IAAImgB,EAAKhrB,EAAG9kD,IAAI6uD,EAAIE,GA+BpB,OA9BA8gB,EAAK/qB,EAAGmC,IAAI4oB,EAAIC,GAChBA,EAAKhrB,EAAG9kD,IAAI0vE,EAAI7nB,GAChBgoB,EAAK/qB,EAAGqC,IAAI0oB,EAAIC,GAChBA,EAAKhrB,EAAG9kD,IAAI0vD,EAAIC,GAChBM,EAAKnL,EAAG9kD,IAAI8uD,EAAIC,GAChB+gB,EAAKhrB,EAAGmC,IAAI6oB,EAAI7f,GAChBA,EAAKnL,EAAG9kD,IAAI2vE,EAAI9nB,GAChBioB,EAAKhrB,EAAGqC,IAAI2oB,EAAI7f,GAChBG,EAAKtL,EAAGmC,IAAIh0C,EAAG48D,GACf5f,EAAKnL,EAAGmC,IAAI91D,EAAI02D,GAChBuI,EAAKtL,EAAG9kD,IAAIiwD,EAAIG,GAChBH,EAAKnL,EAAGqC,IAAIwoB,EAAIvf,GAChBA,EAAKtL,EAAG9kD,IAAI2vE,EAAIvf,GAChBF,EAAKpL,EAAGmC,IAAIgJ,EAAIG,GAChBuf,EAAK7qB,EAAG9kD,IAAI0vE,EAAIA,GAChBC,EAAK7qB,EAAG9kD,IAAI2vE,EAAID,GAChB7nB,EAAK/C,EAAGmC,IAAIh0C,EAAG40C,GACfgoB,EAAK/qB,EAAGmC,IAAI91D,EAAI0+E,GAChBF,EAAK7qB,EAAG9kD,IAAI2vE,EAAI9nB,GAChBA,EAAK/C,EAAGqC,IAAIuoB,EAAI7nB,GAChBA,EAAK/C,EAAGmC,IAAIh0C,EAAG40C,GACfgoB,EAAK/qB,EAAG9kD,IAAI6vE,EAAIhoB,GAChB6nB,EAAK5qB,EAAGmC,IAAI0oB,EAAIE,GAChB3f,EAAKpL,EAAG9kD,IAAIkwD,EAAIwf,GAChBA,EAAK5qB,EAAGmC,IAAI6oB,EAAID,GAChB5f,EAAKnL,EAAGmC,IAAI2oB,EAAI3f,GAChBA,EAAKnL,EAAGqC,IAAI8I,EAAIyf,GAChBA,EAAK5qB,EAAGmC,IAAI2oB,EAAID,GAChBvf,EAAKtL,EAAGmC,IAAI6oB,EAAI1f,GAChBA,EAAKtL,EAAG9kD,IAAIowD,EAAIsf,GACT,IAAI5hB,EAAMmC,EAAIC,EAAIE,EAC7B,CACA,QAAAC,CAAStrC,GACL,OAAOnsC,KAAKonB,IAAI+kB,EAAMglC,SAC1B,CACA,GAAA7B,GACI,OAAOtvE,KAAKksC,OAAOgpC,EAAMlG,KAC7B,CACA,IAAAgC,CAAK10E,GACD,OAAOq6E,EAAKvE,WAAWpyE,KAAM1D,EAAG44E,EAAMsB,WAC1C,CAMA,cAAAqB,CAAesf,GACX,GAAY,SAAUA,EAAI,GAAK5iB,EAAMj4E,GACrC,MAAMw7E,EAAI5C,EAAMlG,KAChB,GAAImoB,IAAO,GACP,OAAOrf,EACX,GAAIqf,IAAO,GACP,OAAOn3F,KACX,MAAM,KAAE+1F,GAASxhB,EACjB,IAAKwhB,EACD,OAAOpf,EAAKnF,aAAaxxE,KAAMm3F,GAEnC,IAAI,MAAEC,EAAK,GAAE14E,EAAE,MAAE24E,EAAK,GAAEt4E,GAAOg3E,EAAKE,YAAYkB,GAC5CG,EAAMxf,EACNyf,EAAMzf,EACNh7D,EAAI9c,KACR,KAAO0e,EAAK,IAAOK,EAAK,IAChBL,EAAK,KACL44E,EAAMA,EAAIlwE,IAAItK,IACdiC,EAAK,KACLw4E,EAAMA,EAAInwE,IAAItK,IAClBA,EAAIA,EAAEiX,SACNrV,IAAO,GACPK,IAAO,GAOX,OALIq4E,IACAE,EAAMA,EAAInmB,UACVkmB,IACAE,EAAMA,EAAIpmB,UACdomB,EAAM,IAAIriB,EAAMhJ,EAAGmC,IAAIkpB,EAAIf,GAAIT,EAAKC,MAAOuB,EAAId,GAAIc,EAAIb,IAChDY,EAAIlwE,IAAImwE,EACnB,CAUA,QAAA7f,CAASC,GACL,MAAM,KAAEoe,EAAMz5F,EAAGg6F,GAAM/hB,EAEvB,IAAIoE,EAAO6e,EACX,GAFA,GAAY,SAAU7f,EAAQ,GAAK2e,GAE/BP,EAAM,CACN,MAAM,MAAEqB,EAAK,GAAE14E,EAAE,MAAE24E,EAAK,GAAEt4E,GAAOg3E,EAAKE,YAAYte,GAClD,IAAMt7E,EAAGi7F,EAAKxgF,EAAG2gF,GAAQz3F,KAAKgxE,KAAKtyD,IAC7BriB,EAAQya,GAAW9W,KAAKgxE,KAAKjyD,GACnCu4E,EAAM3gB,EAAK1F,gBAAgBmmB,EAAOE,GAClCC,EAAM5gB,EAAK1F,gBAAgBomB,EAAOE,GAClCA,EAAM,IAAIriB,EAAMhJ,EAAGmC,IAAIkpB,EAAIf,GAAIT,EAAKC,MAAOuB,EAAId,GAAIc,EAAIb,IACvD/d,EAAQ2e,EAAIlwE,IAAImwE,GAChBC,EAAOC,EAAIrwE,IAAIswE,EACnB,KACK,CACD,MAAM,EAAEr7F,EAAC,EAAEya,GAAM9W,KAAKgxE,KAAK2G,GAC3BgB,EAAQt8E,EACRm7F,EAAO1gF,CACX,CAEA,OAAOo+D,EAAMsB,WAAW,CAACmC,EAAO6e,IAAO,EAC3C,CAOA,oBAAAG,CAAqBjpB,EAAGr0C,EAAGh9B,GACvB,MAAMy5C,EAAIo+B,EAAMxvC,KACV2oC,EAAM,CAACJ,EAAG5zC,IACVA,IAAM,IAAOA,IAAM,IAAQ4zC,EAAE/hC,OAAO4K,GAA2Bm3B,EAAEyJ,SAASr9C,GAAjC4zC,EAAE4J,eAAex9C,GAC1D4wC,EAAMoD,EAAIruE,KAAMq6B,GAAGjT,IAAIinD,EAAIK,EAAGrxE,IACpC,OAAO4tE,EAAIqE,WAAQvxE,EAAYktE,CACnC,CAIA,QAAAqL,CAASlB,GACL,OAAOD,EAAan1E,KAAMo1E,EAC9B,CACA,aAAA4C,GACI,MAAQrgE,EAAGk9D,EAAQ,cAAEmD,GAAkBzD,EACvC,GAAIM,IAAa,GACb,OAAO,EACX,GAAImD,EACA,OAAOA,EAAc9C,EAAOl1E,MAChC,MAAM,IAAIhC,MAAM,+DACpB,CACA,aAAAi6E,GACI,MAAQtgE,EAAGk9D,EAAQ,cAAEoD,GAAkB1D,EACvC,OAAIM,IAAa,GACN70E,KACPi4E,EACOA,EAAc/C,EAAOl1E,MACzBA,KAAK63E,eAAetD,EAAM58D,EACrC,CACA,UAAAihE,CAAWgf,GAAe,GAGtB,OAFA3tB,GAAM,eAAgB2tB,GACtB53F,KAAK42E,iBACEriC,EAAQ2gC,EAAOl1E,KAAM43F,EAChC,CACA,KAAA/e,CAAM+e,GAAe,GAEjB,OADA3tB,GAAM,eAAgB2tB,GACf,GAAc53F,KAAK44E,WAAWgf,GACzC,EAEJ1iB,EAAMxvC,KAAO,IAAIwvC,EAAMX,EAAM5B,GAAI4B,EAAM3B,GAAI1G,EAAGsC,KAC9C0G,EAAMlG,KAAO,IAAIkG,EAAMhJ,EAAG8C,KAAM9C,EAAGsC,IAAKtC,EAAG8C,MAC3C,MAAM6oB,EAAQtjB,EAAM9G,WACdkJ,EAAO3F,GAAKkE,EAAOX,EAAMwhB,KAAOv5F,KAAKC,KAAKo7F,EAAQ,GAAKA,GAE7D,MAAO,CACHtjB,QACAihB,gBAAiBtgB,EACjBugB,yBACAC,sBACAC,mBA/YJ,SAA4BvrD,GACxB,OAAO,GAAWA,EAAK,GAAKmqC,EAAMj4E,EACtC,EA+YJ,CAgCyGw7F,CAAkB,IAChHvjB,EACH,OAAAhgC,CAAQqvC,EAAIjL,EAAOif,GACf,MAAMv9D,EAAIs+C,EAAMrC,WACVv/D,EAAIm1D,EAAG33B,QAAQla,EAAEtjB,GACjBghF,EAAM,GAEZ,OADA9tB,GAAM,eAAgB2tB,GAClBA,EACOG,EAAIp2F,WAAWk5B,KAAK,CAAC89C,EAAMge,WAAa,EAAO,IAAQ5/E,GAGvDghF,EAAIp2F,WAAWk5B,KAAK,CAAC,IAAQ9jB,EAAGm1D,EAAG33B,QAAQla,EAAEgzC,GAE5D,EACA,SAAAoD,CAAUn+D,GACN,MAAM9L,EAAM8L,EAAM5W,OACZ6zB,EAAOjd,EAAM,GACb+qB,EAAO/qB,EAAMihB,SAAS,GAE5B,GAAI/sB,IAAQ6uF,GAA2B,IAAT9lE,GAA0B,IAATA,EAoB1C,IAAI/oB,IAAQ8uF,GAA4B,IAAT/lE,EAGhC,MAAO,CAAExY,EAFCm1D,EAAGuE,UAAUpzC,EAAK9J,SAAS,EAAG24C,EAAG6B,QAE/BV,EADFnB,EAAGuE,UAAUpzC,EAAK9J,SAAS24C,EAAG6B,MAAO,EAAI7B,EAAG6B,SAItD,MAAM,IAAI/vE,MAAM,mBAAmBwI,2BAA6B6uF,yBAAqCC,uBACzG,CA3B+D,CAC3D,MAAMv+E,EAAI,GAAmBsmB,GAC7B,IAAK,GAAWtmB,EAAG,GAAKm1D,EAAG0B,OACvB,MAAM,IAAI5vE,MAAM,yBACpB,MAAMq6E,EAAKqd,EAAoB3+E,GAC/B,IAAIs2D,EACJ,IACIA,EAAInB,EAAG+D,KAAKoI,EAChB,CACA,MAAO2f,GACH,MAAMC,EAASD,aAAqBh6F,MAAQ,KAAOg6F,EAAUvuF,QAAU,GACvE,MAAM,IAAIzL,MAAM,wBAA0Bi6F,EAC9C,CAMA,QAHiC,GAAd1oE,MAFH89C,EAAI,MAAS,MAIzBA,EAAInB,EAAG4C,IAAIzB,IACR,CAAEt2D,IAAGs2D,IAChB,CASJ,IAEE6qB,EAAiB9tD,GAAQ,GAAc,GAAmBA,EAAKmqC,EAAM5G,cAC3E,SAASwqB,EAAsB/kD,GAE3B,OAAOA,EADMwkC,GAAe,EAEhC,CAKA,MAAMwgB,EAAS,CAAC/6F,EAAGw9B,EAAMsb,IAAO,GAAmB94C,EAAEI,MAAMo9B,EAAMsb,IAIjE,MAAMkiD,EACF,WAAAvrF,CAAYlF,EAAG2N,EAAG+iF,GACdt4F,KAAK4H,EAAIA,EACT5H,KAAKuV,EAAIA,EACTvV,KAAKs4F,SAAWA,EAChBt4F,KAAK42E,gBACT,CAEA,kBAAO2hB,CAAYhhF,GACf,MAAM1H,EAAI0kE,EAAM5G,YAEhB,OADAp2D,EAAM,GAAY,mBAAoBA,EAAS,EAAJ1H,GACpC,IAAIwoF,EAAUD,EAAO7gF,EAAK,EAAG1H,GAAIuoF,EAAO7gF,EAAK1H,EAAG,EAAIA,GAC/D,CAGA,cAAO+8E,CAAQr1E,GACX,MAAM,EAAE3P,EAAC,EAAE2N,GAAMi/E,GAAIG,MAAM,GAAY,MAAOp9E,IAC9C,OAAO,IAAI8gF,EAAUzwF,EAAG2N,EAC5B,CACA,cAAAqhE,GACI,GAAY,IAAK52E,KAAK4H,EAAG,GAAKgwE,GAC9B,GAAY,IAAK53E,KAAKuV,EAAG,GAAKqiE,EAClC,CACA,cAAA4gB,CAAeF,GACX,OAAO,IAAID,EAAUr4F,KAAK4H,EAAG5H,KAAKuV,EAAG+iF,EACzC,CACA,gBAAAG,CAAiBC,GACb,MAAM,EAAE9wF,EAAC,EAAK0wF,SAAUK,GAAQ34F,KAC1B2X,EAAIy9E,EAAc,GAAY,UAAWsD,IAC/C,GAAW,MAAPC,IAAgB,CAAC,EAAG,EAAG,EAAG,GAAGh8E,SAASg8E,GACtC,MAAM,IAAI36F,MAAM,uBACpB,MAAM46F,EAAe,IAARD,GAAqB,IAARA,EAAY/wF,EAAI2sE,EAAMj4E,EAAIsL,EACpD,GAAIgxF,GAAQ1sB,EAAG0B,MACX,MAAM,IAAI5vE,MAAM,8BACpB,MAAM4H,EAAgB,EAAN+yF,EAAwB,KAAP,KAC3Brf,EAAIpE,EAAMgD,QAAQtyE,EAASsyF,EAAcU,IACzCC,EAAKtD,EAAKqD,GACVE,EAAKhgB,GAAMnhE,EAAIkhF,GACfE,EAAKjgB,EAAKvjE,EAAIsjF,GACdnqB,EAAIwG,EAAMxvC,KAAKiyD,qBAAqBre,EAAGwf,EAAIC,GACjD,IAAKrqB,EACD,MAAM,IAAI1wE,MAAM,qBAEpB,OADA0wE,EAAEkI,iBACKlI,CACX,CAEA,QAAAsqB,GACI,OAAOb,EAAsBn4F,KAAKuV,EACtC,CACA,UAAA0jF,GACI,OAAOj5F,KAAKg5F,WAAa,IAAIX,EAAUr4F,KAAK4H,EAAGkxE,GAAM94E,KAAKuV,GAAIvV,KAAKs4F,UAAYt4F,IACnF,CAEA,aAAAk5F,GACI,OAAO,GAAcl5F,KAAKm5F,WAC9B,CACA,QAAAA,GACI,OAAO3E,GAAIM,WAAW,CAAEltF,EAAG5H,KAAK4H,EAAG2N,EAAGvV,KAAKuV,GAC/C,CAEA,iBAAA6jF,GACI,OAAO,GAAcp5F,KAAKq5F,eAC9B,CACA,YAAAA,GACI,OAAOnB,EAAcl4F,KAAK4H,GAAKswF,EAAcl4F,KAAKuV,EACtD,EAEJ,MAAMokE,EAAQ,CACV,iBAAA2f,CAAkBrd,GACd,IAEI,OADAwZ,EAAuBxZ,IAChB,CACX,CACA,MAAOv0E,GACH,OAAO,CACX,CACJ,EACA+tF,uBAAwBA,EAKxB7b,iBAAkB,KACd,MAAMl+E,EAAS,GAAqB64E,EAAMj4E,GAC1C,OnB7SL,SAAwByP,EAAK4kE,EAAYv7B,GAAO,GACnD,MAAM5uC,EAAMuF,EAAIrQ,OACVy+E,EAAWzJ,GAAoBC,GAC/B4oB,EAAS1oB,GAAiBF,GAEhC,GAAInqE,EAAM,IAAMA,EAAM+yF,GAAU/yF,EAAM,KAClC,MAAM,IAAIxI,MAAM,YAAYu7F,8BAAmC/yF,KACnE,MAEMgzF,EAAU,GAFJpkD,EAAO,GAAgBrpC,GAAO,GAAgBA,GAEjC4kE,EAAa,IAAO,GAC7C,OAAOv7B,EAAO,GAAgBokD,EAASrf,GAAY,GAAgBqf,EAASrf,EAChF,CmBkSmB,CAAmB5F,EAAMH,YAAY14E,GAAS64E,EAAMj4E,EAAE,EAUjEu9E,WAAU,CAACtI,EAAa,EAAGoH,EAAQzD,EAAMxvC,QACrCizC,EAAMjC,eAAenF,GACrBoH,EAAMjB,SAAS1zC,OAAO,IACf20C,IAef,SAAS8gB,EAAU/3C,GACf,MAAM5N,EAAM,GAAW4N,GACjBhvC,EAAsB,iBAATgvC,EACbl7C,GAAOstC,GAAOphC,IAAQgvC,EAAKhmD,OACjC,OAAIo4C,EACOttC,IAAQ6uF,GAAiB7uF,IAAQ8uF,EACxC5iF,EACOlM,IAAQ,EAAI6uF,GAAiB7uF,IAAQ,EAAI8uF,EAChD5zC,aAAgBwzB,CAGxB,CAuBA,MAAMigB,EAAW5gB,EAAM4gB,UACnB,SAAU7iF,GAGN,MAAM83B,EAAM,GAAmB93B,GACzBonF,EAAuB,EAAfpnF,EAAM5W,OAAa64E,EAAM9G,WACvC,OAAOisB,EAAQ,EAAItvD,GAAOpG,OAAO01D,GAAStvD,CAC9C,EACEgrD,EAAgB7gB,EAAM6gB,eACxB,SAAU9iF,GACN,OAAOwmE,EAAKqc,EAAS7iF,GACzB,EAEEqnF,EAAa,GAAWplB,EAAM9G,YAIpC,SAASmsB,EAAWxvD,GAGhB,OAFA,GAAY,WAAWmqC,EAAM9G,aAAcrjC,EAAK,GAAKuvD,GAE9C,GAAmBvvD,EAAKmqC,EAAM5G,YACzC,CA0DA,MAAMksB,EAAiB,CAAExF,KAAM9f,EAAM8f,KAAM1f,SAAS,GAC9CmlB,EAAiB,CAAEzF,KAAM9f,EAAM8f,KAAM1f,SAAS,GAwFpD,OAnEAO,EAAMxvC,KAAKgxC,eAAe,GAmEnB,CACHnC,QACA8E,aAlNJ,SAAsB4C,EAAY2b,GAAe,GAC7C,OAAO1iB,EAAMsD,eAAeyD,GAAYrD,WAAWgf,EACvD,EAiNI5b,gBAvLJ,SAAyB+d,EAAUC,EAASpC,GAAe,GACvD,GAAI6B,EAAUM,GACV,MAAM,IAAI/7F,MAAM,iCACpB,IAAKy7F,EAAUO,GACX,MAAM,IAAIh8F,MAAM,iCAEpB,OADUk3E,EAAMgD,QAAQ8hB,GACftiB,SAAS+d,EAAuBsE,IAAWnhB,WAAWgf,EACnE,EAiLI10F,KA9EJ,SAAcw1F,EAASjgB,EAASpzC,EAAOw0D,GACnC,MAAM,KAAEv7E,EAAI,MAAE27E,GApElB,SAAiBvB,EAASzc,EAAY52C,EAAOw0D,GACzC,GAAI,CAAC,YAAa,aAAa91C,MAAMtnC,GAAMA,KAAK4oB,IAC5C,MAAM,IAAIrnC,MAAM,uCACpB,MAAM,KAAEgO,EAAI,YAAEooE,GAAgBG,EAC9B,IAAI,KAAE8f,EAAI,QAAE1f,EAASulB,aAAcC,GAAQ90D,EAC/B,MAARgvD,IACAA,GAAO,GACXqE,EAAU,GAAY,UAAWA,GACjCtE,GAAmB/uD,GACfsvC,IACA+jB,EAAU,GAAY,oBAAqB1sF,EAAK0sF,KAIpD,MAAM0B,EAAQhF,EAAcsD,GACtB57E,EAAI24E,EAAuBxZ,GAC3Boe,EAAW,CAACT,EAAW98E,GAAI88E,EAAWQ,IAE5C,GAAW,MAAPD,IAAuB,IAARA,EAAe,CAE9B,MAAM70F,GAAY,IAAR60F,EAAe/lB,EAAYlI,EAAG6B,OAASosB,EACjDE,EAAS/8F,KAAK,GAAY,eAAgBgI,GAC9C,CACA,MAAMgZ,EAAO,MAAkB+7E,GACzBx9E,EAAIu9E,EA0BV,MAAO,CAAE97E,OAAM27E,MAxBf,SAAeK,GAEX,MAAM79E,EAAI04E,EAASmF,GACnB,IAAK3E,EAAmBl5E,GACpB,OACJ,MAAM89E,EAAKhF,EAAK94E,GACVsa,EAAIm+C,EAAMxvC,KAAKgyC,SAASj7D,GAAG65D,WAC3B1uE,EAAIkxE,EAAK/hD,EAAEhgB,GACjB,GAAInP,IAAM,GACN,OAIJ,MAAM2N,EAAIujE,EAAKyhB,EAAKzhB,EAAKj8D,EAAIjV,EAAIkV,IACjC,GAAIvH,IAAM,GACN,OACJ,IAAI+iF,GAAYvhE,EAAEhgB,IAAMnP,EAAI,EAAI,GAAKlI,OAAOq3B,EAAEs2C,EAAI,IAC9CmtB,EAAQjlF,EAKZ,OAJI8+E,GAAQ8D,EAAsB5iF,KAC9BilF,EAlOZ,SAAoBjlF,GAChB,OAAO4iF,EAAsB5iF,GAAKujE,GAAMvjE,GAAKA,CACjD,CAgOoB0jF,CAAW1jF,GACnB+iF,GAAY,GAET,IAAID,EAAUzwF,EAAG4yF,EAAOlC,EACnC,EAEJ,CAiB4BmC,CAAQ/B,EAASjgB,EAASpzC,GAC5CqR,EAAI69B,EAEV,OADa,GAAkB79B,EAAE1qC,KAAKunC,UAAWmD,EAAEi3B,YAAaj3B,EAAEqpC,KAC3D2a,CAAKp8E,EAAM27E,EACtB,EA0EI/uE,OAzDJ,SAAgByvE,EAAWjC,EAASlf,EAAWn0C,EAAOy0D,GAClD,MAAMc,EAAKD,EAGX,GAFAjC,EAAU,GAAY,UAAWA,GACjClf,EAAY,GAAY,YAAaA,GACjC,WAAYn0C,EACZ,MAAM,IAAIrnC,MAAM,sCACpBo2F,GAAmB/uD,GACnB,MAAM,KAAEgvD,EAAI,QAAE1f,GAAYtvC,EAC1B,IAAIw1D,EACA5sB,EACJ,IACI,GAAkB,iBAAP2sB,GAAmB,GAAWA,GAGrC,IACIC,EAAOxC,EAAUzL,QAAQgO,EAC7B,CACA,MAAOE,GACH,KAAMA,aAAoBtG,GAAIC,KAC1B,MAAMqG,EACVD,EAAOxC,EAAUE,YAAYqC,EACjC,KAEC,IAAkB,iBAAPA,GAAmC,iBAATA,EAAGhzF,GAAkC,iBAATgzF,EAAGrlF,EAKrE,MAAM,IAAIvX,MAAM,SALqE,CACrF,MAAM,EAAE4J,EAAC,EAAE2N,GAAMqlF,EACjBC,EAAO,IAAIxC,EAAUzwF,EAAG2N,EAC5B,CAGA,CACA04D,EAAIiH,EAAMgD,QAAQsB,EACtB,CACA,MAAO9xE,GACH,GAAsB,UAAlBA,EAAM+B,QACN,MAAM,IAAIzL,MAAM,kEACpB,OAAO,CACX,CACA,GAAIq2F,GAAQwG,EAAK7B,WACb,OAAO,EACPrkB,IACA+jB,EAAUnkB,EAAMvoE,KAAK0sF,IACzB,MAAM,EAAE9wF,EAAC,EAAE2N,GAAMslF,EACXljF,EAAIy9E,EAAcsD,GAClBqC,EAAKxF,EAAKhgF,GACVujF,EAAKhgB,EAAKnhE,EAAIojF,GACdhC,EAAKjgB,EAAKlxE,EAAImzF,GACdzhB,EAAIpE,EAAMxvC,KAAKiyD,qBAAqB1pB,EAAG6qB,EAAIC,IAAKziB,WACtD,QAAKgD,GAEKR,EAAKQ,EAAEviE,KACJnP,CACjB,EAOI4tF,gBAAiBtgB,EACjBmjB,YACA1e,QAER,CCr7BO,SAASqhB,GAAQhvF,GACpB,MAAO,CACHA,OACA+zE,KAAM,CAACh0E,KAAQotE,IAAS4G,GAAK/zE,EAAMD,EhGoHpC,YAAwBwvC,GAC3B,IAAI0vB,EAAM,EACV,IAAK,IAAIruE,EAAI,EAAGA,EAAI2+C,EAAO7/C,OAAQkB,IAAK,CACpC,MAAMy9B,EAAIkhB,EAAO3+C,GACjB,GAAOy9B,GACP4wC,GAAO5wC,EAAE3+B,MACb,CACA,MAAMqjC,EAAM,IAAIp9B,WAAWspE,GAC3B,IAAK,IAAIruE,EAAI,EAAG8qC,EAAM,EAAG9qC,EAAI2+C,EAAO7/C,OAAQkB,IAAK,CAC7C,MAAMy9B,EAAIkhB,EAAO3+C,GACjBmiC,EAAIh0B,IAAIsvB,EAAGqN,GACXA,GAAOrN,EAAE3+B,MACb,CACA,OAAOqjC,CACX,CgGlIgD,IAAeo6C,IACvD/E,YAAW,GAEnB,CDyFgFpwC,OAAO,GE5FvF,MAAMi3D,GAAaj3D,OAAO,sEACpBk3D,GAAal3D,OAAO,sEACpB,GAAMA,OAAO,GACb,GAAMA,OAAO,GACbm3D,GAAa,CAAC9gE,EAAGh9B,KAAOg9B,EAAIh9B,EAAI,IAAOA,EA6B7C,MAAM,GAAKmqB,GAAMyzE,QAAYl9F,OAAWA,EAAW,CAAEkyE,KAxBrD,SAAiB5C,GACb,MAAMY,EAAIgtB,GAEJpuB,EAAM7oC,OAAO,GAAIo3D,EAAMp3D,OAAO,GAAIq3D,EAAOr3D,OAAO,IAAKs3D,EAAOt3D,OAAO,IAEnEu3D,EAAOv3D,OAAO,IAAKw3D,EAAOx3D,OAAO,IAAKy3D,EAAOz3D,OAAO,IACpD1rB,EAAM+0D,EAAIA,EAAIA,EAAKY,EACnB11D,EAAMD,EAAKA,EAAK+0D,EAAKY,EACrBv1D,EAAMy0D,GAAK50D,EAAIs0D,EAAKoB,GAAK11D,EAAM01D,EAC/Bp1D,EAAMs0D,GAAKz0D,EAAIm0D,EAAKoB,GAAK11D,EAAM01D,EAC/Bl1D,EAAOo0D,GAAKt0D,EAAI,GAAKo1D,GAAK31D,EAAM21D,EAChCv0D,EAAOyzD,GAAKp0D,EAAKsiF,EAAMptB,GAAKl1D,EAAOk1D,EACnCjzD,EAAOmyD,GAAKzzD,EAAK4hF,EAAMrtB,GAAKv0D,EAAOu0D,EACnCytB,EAAOvuB,GAAKnyD,EAAKwgF,EAAMvtB,GAAKjzD,EAAOizD,EACnC0tB,EAAQxuB,GAAKuuB,EAAKD,EAAMxtB,GAAKytB,EAAOztB,EACpC2tB,EAAQzuB,GAAKwuB,EAAMH,EAAMvtB,GAAKjzD,EAAOizD,EACrC4tB,EAAQ1uB,GAAKyuB,EAAM/uB,EAAKoB,GAAK11D,EAAM01D,EACnC8oB,EAAM5pB,GAAK0uB,EAAMN,EAAMttB,GAAKv0D,EAAOu0D,EACnCgB,EAAM9B,GAAK4pB,EAAIqE,EAAKntB,GAAK31D,EAAM21D,EAC/Bp9D,EAAOs8D,GAAK8B,EAAI,GAAKhB,GAC3B,IAAK,GAAGE,IAAI,GAAGC,IAAIv9D,GAAOw8D,GACtB,MAAM,IAAIrvE,MAAM,2BACpB,OAAO6S,CACX,IAKairF,GDjCN,SAAqBxnB,EAAUynB,GAClC,MAAMtvF,EAAUT,GAASkpF,GAAY,IAAK5gB,KAAa0mB,GAAQhvF,KAC/D,OAAOlN,OAAO4P,OAAO,IAAKjC,EAAOsvF,GAAUtvF,UAC/C,CC8ByBuvF,CAAY,CACjC3hE,EAAG2J,OAAO,GACV3mC,EAAG2mC,OAAO,GACVkoC,GAAE,GACF5vE,EAAG4+F,GAEHvoB,GAAI3uC,OAAO,iFACX4uC,GAAI5uC,OAAO,iFACXrsB,EAAGqsB,OAAO,GACVqwD,MAAM,EAON0B,KAAM,CACFC,KAAMhyD,OAAO,sEACbiyD,YAAcx5E,IACV,MAAMngB,EAAI4+F,GACJlrF,EAAKg0B,OAAO,sCACZ3rB,GAAM,GAAM2rB,OAAO,sCACnB/zB,EAAK+zB,OAAO,uCACZ1rB,EAAKtI,EACLisF,EAAYj4D,OAAO,uCACnBr9B,EAAKw0F,GAAW7iF,EAAKmE,EAAGngB,GACxBsK,EAAKu0F,IAAY9iF,EAAKoE,EAAGngB,GAC/B,IAAIoiB,EAAK,GAAIjC,EAAI9V,EAAKqJ,EAAKpJ,EAAKqJ,EAAI3T,GAChCyiB,EAAK,IAAKpY,EAAK0R,EAAKzR,EAAK0R,EAAIhc,GACjC,MAAM86F,EAAQ14E,EAAKu9E,EACb5E,EAAQt4E,EAAKk9E,EAKnB,GAJI7E,IACA14E,EAAKpiB,EAAIoiB,GACT24E,IACAt4E,EAAKziB,EAAIyiB,GACTL,EAAKu9E,GAAal9E,EAAKk9E,EACvB,MAAM,IAAIj+F,MAAM,uCAAyCye,GAE7D,MAAO,CAAE26E,QAAO14E,KAAI24E,QAAOt4E,KAAI,IAGxC,ICzBI,SAASm9E,GAAkBnwF,GAC9B,IACI,GAAKypF,gBAAgBtd,QAAQnsE,EACjC,CACA,MAAO9P,GACH,MAAM,IAAI,GAAUsB,OAAOtB,GAAM,yBACrC,CACJ,CDqBY+nC,OAAO,GAiBL83D,GAAUtG,gBElGjB,MAAM2G,GACTzd,KACA,WAAA5xE,CAAYf,GACR,GAAyBA,GACzB/L,KAAK0+E,KAAO3yE,CAChB,CACA,MAAAmf,CAAOkT,EAAMm7C,GACT,ODeD,SAAuBxtE,EAAKwtE,EAAK1kC,GACpC,MAAMx4C,EAAI,GAAOqb,OAAOm9B,aAAelzC,WAAakzC,EAAMA,EAAIthB,YAC9D,GAAIkyC,GAAUppE,GACV,OAAOA,EAAEyR,MAAK,EAAG4J,YAAa,GAAKwT,OAAOquD,EAAK7hE,EAAQ3L,KAClD8B,OAAM5R,IACP,MAAM,IAAI,GAAUsB,OAAOtB,GAAM,oBAAoB,IAG7D,IACI,OAAO,GAAKivB,OAAOquD,EAAKl9E,EAAEqb,OAAQ3L,EACtC,CACA,MAAO9P,GACH,MAAM,IAAI,GAAUsB,OAAOtB,GAAM,oBACrC,CACJ,CC7Be,CAAqB+D,KAAK0+E,KAAMnF,EAAKn7C,EAChD,CACA,OAAAwgD,GACI,OD2B0B7yE,EC3BM/L,KAAK0+E,KD4B3B,GAAK8W,gBAAgBtd,QAAQnsE,GAAK6sE,YAAW,GADxD,IAA2B7sE,CC1B9B,CACA,SAAIuG,GACA,OAAO,GAAuBzV,OAAO,CACjC4qB,KAAM,GAAqB20E,UAC3B5d,KAAMx+E,KAAK4+E,YACZrrD,UACP,CACA,MAAA2Y,CAAOngC,GACH,OAAO,GAAiB/L,KAAKsS,MAAOvG,EAAIuG,MAC5C,CACA,UAAMtG,GACF,MAAM3P,EAAI,GAAOqb,OAAO1X,KAAKsS,OAC7B,IAAIA,EAOJ,OANImzD,GAAUppE,KACPiW,eAAgBjW,GAGnBiW,EAAQjW,EAAEiW,MAEPA,CACX,EAEG,MAAM+pF,GACT3d,KACAK,WACA,WAAAjyE,CAAYf,EAAKytE,GACbx5E,KAAK0+E,KAAO3yE,EACZ/L,KAAK++E,WAAavF,GDuBnB,SAA0ByC,GAC7B,IACI,OAAO,GAAK5C,aAAa4C,GAAY,EACzC,CACA,MAAOhgF,GACH,MAAM,IAAI,GAAUsB,OAAOtB,GAAM,0BACrC,CACJ,CC9BuC,CAAwB8P,GDOxD,SAA4BA,GAC/B,IACI,GAAKstE,aAAattE,GAAK,EAC3B,CACA,MAAO9P,GACH,MAAM,IAAI,GAAUsB,OAAOtB,GAAM,0BACrC,CACJ,CCbQ,CAA0B+D,KAAK0+E,MAC/B,GAAyB1+E,KAAK++E,WAClC,CACA,IAAA77E,CAAKuG,GACD,ODvCD,SAAqBsC,EAAK8oC,GAC7B,MAAMx4C,EAAI,GAAOqb,OAAOm9B,aAAelzC,WAAakzC,EAAMA,EAAIthB,YAC9D,GAAIkyC,GAAUppE,GACV,OAAOA,EAAEyR,MAAK,EAAG4J,YAAa,GAAKxU,KAAKwU,EAAQ3L,GAAKmtF,kBAChDrrF,OAAM5R,IACP,MAAM,IAAI,GAAUsB,OAAOtB,GAAM,oBAAoB,IAG7D,IACI,OAAO,GAAKiH,KAAK7G,EAAEqb,OAAQ3L,GAAKmtF,eACpC,CACA,MAAOj9F,GACH,MAAM,IAAI,GAAUsB,OAAOtB,GAAM,oBACrC,CACJ,CCyBe,CAAmB+D,KAAK0+E,KAAMj1E,EACzC,CACA,UAAIu1E,GACA,OAAO,IAAImd,GAAmBn8F,KAAK++E,WACvC,CACA,OAAAH,GACI,OAAO5+E,KAAK0+E,IAChB,CACA,SAAIpsE,GACA,OAAO,GAAwBzV,OAAO,CAClC4qB,KAAM,GAAqB20E,UAC3B5d,KAAMx+E,KAAK4+E,YACZrrD,UACP,CACA,MAAA2Y,CAAOngC,GACH,OAAO,GAAiB/L,KAAKsS,MAAOvG,EAAIuG,MAC5C,CACA,IAAAtG,GACI,MAAM3P,EAAI,GAAOqb,OAAO1X,KAAKsS,OAC7B,OAAImzD,GAAUppE,GACHA,EAAEyR,MAAK,EAAGwE,WAAYA,IAE1BjW,EAAEiW,KACb,CAQA,QAAMgP,GAEF,OAAO,SADYthB,KAAKg/E,OAAOhzE,OACC,YACpC,CAIA,YAAM,CAAOgxE,EAAUzyE,EAAS,cAC5B,GAAe,eAAXA,EACA,OAAOwyE,GAAS/8E,KAAKsS,MAAO0qE,GAG5B,MAAM,IAAI,GAAU,kBAAkBzyE,sBAA4B,4BAE1E,EAEG,SAAS+xF,GAA6BhqF,GACzC,OAAO,IAAI+pF,GAAoB/pF,EACnC,CACO,SAASiqF,GAA4BjqF,GACxC,OAAO,IAAI6pF,GAAmB7pF,EAClC,CACOy4B,eAAe,KAClB,MAAMm0C,EDlGC,GAAKvF,MAAMC,mBCmGlB,OAAO,IAAIyiB,GAAoBnd,EACnC,CCjFO,MAAMsd,GAAgB,CACzBC,IAAK,EACLpoB,QAAS,EACTynB,UAAW,GAEf,SAASY,GAAex0F,GACpB,MAAMy0F,EAAY79F,OAAOC,KAAKy9F,IAAe9+F,KAAK,OAClD,OAAO,IAAI,GAAU,mCAAmCwK,cAAiBy0F,IAAa,2BAC1F,CACA,SAASC,GAAU10F,GAEf,GAAa,SADbA,EAAOA,EAAKI,gBACmB,YAATJ,GAA+B,cAATA,EACxC,OAAOs0F,GAAct0F,GAEzB,MAAMw0F,GAAex0F,EACzB,CAqBO,SAAS,GAAmB3F,GAC/B,MAAM8+D,EAAU,GAAkBzjE,OAAO2E,GACnC67B,EAAOijC,EAAQmd,MAAQ,IAAI78E,WACjC,OAAQ0/D,EAAQ55C,MACZ,KAAK,GAAgBgsE,IACjB,OAAO+I,GAAcC,IAAI1I,sBAAsB31D,GACnD,KAAK,GAAgBygD,QACjB,OAAO2d,GAAcnoB,QAAQ+K,0BAA0BhhD,GAC3D,KAAK,GAAgBg+D,UACjB,OAAOI,GAAcV,UAAUS,4BAA4Bn+D,GAC/D,QACI,MAAMs+D,GAAer7B,EAAQ55C,MAAQ,WAEjD,CAIO,SAASo1E,GAAiB9wF,EAAK7D,GAGlC,OADA00F,GADA10F,GAAQA,GAAQ,OAAOI,eAEhByD,EAAIuG,KACf,CAIOy4B,eAAe,GAAoBxoC,GACtC,MAAM8+D,EAAU,GAAmBzjE,OAAO2E,GACpC67B,EAAOijC,EAAQmd,MAAQ,IAAI78E,WACjC,OAAQ0/D,EAAQ55C,MACZ,KAAK,GAAgBgsE,IACjB,OAAO+I,GAAcC,IAAIK,uBAAuB1+D,GACpD,KAAK,GAAgBygD,QACjB,OAAO2d,GAAcnoB,QAAQ4K,2BAA2B7gD,GAC5D,KAAK,GAAgBg+D,UACjB,OAAOI,GAAcV,UAAUQ,6BAA6Bl+D,GAChE,QACI,MAAMs+D,GAAer7B,EAAQ55C,MAAQ,OAEjD,CC9EO,MAAMs1E,GAAsB/uF,OAAOw+B,IAAI,gCAQjCwwD,GAAsBhvF,OAAOw+B,IAAI,gCCJxC,GAAUx+B,OAAOw+B,IAAI,8BACrBywD,GAAcn+F,OACf2jB,OAAO+qB,IACP9hC,KAAI05B,GAASA,EAAM3b,UAEnB2e,QAAO,CAAC8P,EAAKjuC,IAASiuC,EAAIjR,GAAGh9B,IAAOujC,GAAM/D,SAAShgB,SAElDyzE,GAAkB,IAClBC,GAAwC,GACxCC,GAAyC,GAC/C,MAAMC,GACFn1F,KACA0iC,UACAqxC,WACAzC,UACAp9E,OACA,WAAA0Q,CAAY9B,GACRhL,KAAKkI,KAAO8C,EAAK9C,KACjBlI,KAAK4qC,UAAY5/B,EAAK4/B,UACtB5qC,KAAKi8E,WAAajxE,EAAKixE,WAEvBn9E,OAAO6L,eAAe3K,KAAM,SAAU,CAClC4K,YAAY,EACZ6Q,UAAU,GAElB,CACA,IAAKzN,OAAO80B,eACR,MAAO,UAAU9iC,KAAKvB,aAC1B,CACA,CAACo2D,KAAgB,EACjB,QAAAp2D,GAII,OAHmB,MAAfuB,KAAK5D,SACL4D,KAAK5D,OAASgtC,GAAUvsC,OAAOmD,KAAK4qC,UAAUt4B,OAAO7U,MAAM,IAExDuC,KAAK5D,MAChB,CAGA,KAAAkhG,GACI,OAAO5xD,GAAIO,SAASixD,GAAiBl9F,KAAK4qC,UAC9C,CACA,OAAA2J,GACI,OAAOv0C,KAAK4qC,UAAUt4B,KAC1B,CAIA,MAAA0U,GACI,OAAOhnB,KAAKvB,UAChB,CAIA,MAAAytC,CAAO5qB,GACH,GAAU,MAANA,EACA,OAAO,EAEX,GAAIA,aAAc3f,WACd,OAAO,GAAiB3B,KAAK4qC,UAAUt4B,MAAOgP,GAE7C,GAAkB,iBAAPA,EACZ,OAAOi8E,GAAiBj8E,GAAI4qB,OAAOlsC,MAElC,GAA4B,MAAxBshB,GAAIspB,WAAWt4B,MACpB,OAAO,GAAiBtS,KAAK4qC,UAAUt4B,MAAOgP,EAAGspB,UAAUt4B,OAG3D,MAAM,IAAItU,MAAM,eAExB,CAaA,CAAC,MACG,MAAO,UAAUgC,KAAKvB,aAC1B,EAEJ,MAAM++F,WAAsBH,GACxBn1F,KAAO,MACPsxE,UACA,WAAA1sE,CAAY9B,GACR+iC,MAAM,IAAK/iC,EAAM9C,KAAM,QACvBlI,KAAKw5E,UAAYxuE,EAAKwuE,SAC1B,EAEJ,MAAMikB,WAA0BJ,GAC5Bn1F,KAAO,UACPsxE,UACA,WAAA1sE,CAAY9B,GACR+iC,MAAM,IAAK/iC,EAAM9C,KAAM,YACvBlI,KAAKw5E,UAAYxuE,EAAK4/B,UAAUlzB,MACpC,EAEJ,MAAMgmF,WAA4BL,GAC9Bn1F,KAAO,YACPsxE,UACA,WAAA1sE,CAAY9B,GACR+iC,MAAM,IAAK/iC,EAAM9C,KAAM,cACvBlI,KAAKw5E,UAAYxuE,EAAK4/B,UAAUlzB,MACpC,EAGJ,MAAMimF,GAAmC,KACzC,MAAMC,GACF11F,KAAO,MACP0iC,UACAqxC,WACAzC,UACAqkB,IACA,WAAA/wF,CAAY+wF,GACR79F,KAAK69F,IAAMA,EAAIp/F,WACfuB,KAAK4qC,UAAY,GAASlzB,OAAO,GAAqB1X,KAAK69F,KAC/D,CACA,CAAC,MACG,MAAO,UAAU79F,KAAK69F,MAC1B,CACA,CAAChpC,KAAgB,EACjB,QAAAp2D,GACI,OAAOuB,KAAKs9F,QAAQ7+F,UACxB,CACA,KAAA6+F,GACI,OAAO5xD,GAAIO,SAAS0xD,GAAkC39F,KAAK4qC,UAC/D,CACA,OAAA2J,GACI,OAAOv0C,KAAKs9F,QAAQhrF,KACxB,CACA,MAAA45B,CAAOC,GACH,OAAa,MAATA,IAGAA,aAAiBxqC,aACjBwqC,EAAQ,GAAmBA,IAExBA,EAAM1tC,aAAeuB,KAAKvB,WACrC,EA0BG,SAAS8+F,GAAiB7qF,EAAK+W,GAElC,GADAA,EAAUA,GAAWwzE,GACC,MAAlBvqF,EAAInW,OAAO,IAAgC,MAAlBmW,EAAInW,OAAO,GAAY,CAGhD,MAAMquC,EAAY,GAAcxB,GAAUxrC,OAAO,IAAI8U,MACrD,OAAIA,EAAIuf,WAAW,OACR,IAAIwrE,GAAkB,CAAE7yD,cAE1Bl4B,EAAIuf,WAAW,OACb,IAAIyrE,GAAoB,CAAE9yD,cAG1B,IAAI4yD,GAAc,CAAE5yD,aAEnC,CACA,OAAOkzD,GAAgBb,GAAYr/F,OAAO8U,GAC9C,CACO,SAASorF,GAAgBv7F,GAC5B,IACI,MAAMqoC,EAAY,GAAcroC,GAChC,GAAIqoC,EAAUv+B,OAAS,GAASA,KAAM,CAClC,GAAIu+B,EAAUlzB,OAAOhc,SAAWyhG,GAC5B,OAAO,IAAIM,GAAkB,CAAE7yD,cAE9B,GAAIA,EAAUlzB,OAAOhc,SAAW0hG,GACjC,OAAO,IAAIM,GAAoB,CAAE9yD,aAEzC,CACA,GAAIA,EAAUv+B,OAAS,GAAOA,KAC1B,OAAO,IAAImxF,GAAc,CAAE5yD,aAEnC,CACA,MACI,OAID,SAAuBQ,GAC1B,GAAsB,MAAlBA,GAAKR,WAAoC,MAAfQ,EAAID,SAAoC,IAAhBC,EAAID,SAAkBC,EAAI/+B,OAAS6wF,IAAoB9xD,EAAI/+B,OAASsxF,GACtH,MAAM,IAAI3/F,MAAM,kCAEpB,GAAIotC,EAAI/+B,OAASsxF,GAAkC,CAC/C,MAAME,EAAM,GAAmBzyD,EAAIR,UAAUlzB,QAC7C,OAAO,IAAIkmF,GAAc,IAAIG,IAAIF,GACrC,CACA,MAAMjzD,EAAYQ,EAAIR,UACtB,GAAIA,EAAUv+B,OAAS,GAAOA,KAC1B,OAAO,IAAImxF,GAAc,CAAE5yD,UAAWQ,EAAIR,YAEzC,GAAIA,EAAUv+B,OAAS,GAASA,KAAM,CACvC,GAAIu+B,EAAUlzB,OAAOhc,SAAWyhG,GAC5B,OAAO,IAAIM,GAAkB,CAAE7yD,UAAWQ,EAAIR,YAE7C,GAAIA,EAAUlzB,OAAOhc,SAAW0hG,GACjC,OAAO,IAAIM,GAAoB,CAAE9yD,UAAWQ,EAAIR,WAExD,CACA,MAAM,IAAI5sC,MAAM,iCACpB,CAzBeggG,CAActyD,GAAI9tC,OAAO2E,GACpC,CACA,MAAM,IAAIvE,MAAM,iCACpB,CA2BO+sC,eAAekzD,GAAezkB,EAAWyC,GAC5C,OAAIzC,EAAU99E,SAAWyhG,GACd,IAAIM,GAAkB,CAAE7yD,UAAW,GAAc,GAASv+B,KAAMmtE,GAAYyC,eAEnFzC,EAAU99E,SAAW0hG,GACd,IAAIM,GAAoB,CAAE9yD,UAAW,GAAc,GAASv+B,KAAMmtE,GAAYyC,eAElF,IAAIuhB,GAAc,CAAE5yD,gBAAiB,GAAOlzB,OAAO8hE,GAAYA,YAAWyC,cACrF,CCxQO,MAAM,WAAmBj+E,MAC5BkK,KACAmE,KACA,WAAAS,CAAYrD,EAAS4C,EAAMR,GACvBkiC,MAAMtkC,GAAW,6BACjBzJ,KAAKkI,KAAO,UACZlI,KAAK6L,KAAOA,GAAQ,aACpB7L,KAAKqM,KAAOA,GAAQ,WACxB,EAKG0+B,eAAemzD,GAAW1+C,EAASwB,EAAQ3b,GAC9C,GAAc,MAAV2b,EACA,OAAOxB,EAEX,GAAIwB,EAAO8J,QACP,OAAOhvD,QAAQE,OAAO,IAAI,GAAWqpC,GAAMykB,aAAczkB,GAAM84D,UAAW94D,GAAM+4D,YAEpF,IAAIjvF,EAEJ,MAAMzH,EAAQ,IAAI,GAAW29B,GAAMykB,aAAczkB,GAAM84D,UAAW94D,GAAM+4D,WACxE,IACI,aAAatiG,QAAQslD,KAAK,CACtB5B,EACA,IAAI1jD,SAAQ,CAACC,EAASC,KAClBmT,EAAW,KACPnT,EAAO0L,EAAM,EAEjBs5C,EAAOG,iBAAiB,QAAShyC,EAAS,KAGtD,CACA,QACoB,MAAZA,GACA6xC,EAAOK,oBAAoB,QAASlyC,EAE5C,CACJ,CCXA,MAAMkvF,GACFC,SACAC,SACAj+C,MACAk+C,WACA,WAAA1xF,GACI9M,KAAKsgD,OAAQ,EACbtgD,KAAKs+F,SAAW,KAChBt+F,KAAKu+F,SAAW,IACpB,CACA,CAACvwF,OAAOC,iBACJ,OAAOjO,IACX,CACA,UAAMkO,GAKF,GAJuB,MAAnBlO,KAAKw+F,kBAECx+F,KAAKu+F,SAAS/+C,QAED,MAAnBx/C,KAAKw+F,WACL,MAAM,IAAIxgG,MAAM,0DAEpB,MAAMwgG,EAAax+F,KAAKw+F,WAKxB,OAJAx+F,KAAKw+F,gBAAazgG,EAElBiC,KAAKs+F,SAASviG,UACdiE,KAAKs+F,SAAW,KACTE,CACX,CACA,WAAM,CAAMviG,GAYR,OAXA+D,KAAKsgD,OAAQ,EACF,MAAPrkD,IAGA+D,KAAKu+F,SAAS/+C,QAAQ3xC,OAAM,SAC5B7N,KAAKu+F,SAASviG,OAAOC,IAEV,CACXoR,MAAM,EACN5N,WAAO1B,EAGf,CACA,YAAM,GAMF,aADMiC,KAAK29B,WAAM5/B,GAJF,CACXsP,MAAM,EACN5N,WAAO1B,EAIf,CACA,UAAMT,CAAKmC,EAAOsB,SACRf,KAAK29B,MAAMl+B,EAAOsB,EAC5B,CACA,SAAM/D,CAAIf,EAAK8E,GACA,MAAP9E,QACM+D,KAAK6gD,MAAM5kD,SAIX+D,KAAK29B,WAAM5/B,EAAWgD,EAEpC,CACA,WAAM48B,CAAMl+B,EAAOsB,GACf,GAAa,MAATtB,GAAiBO,KAAKsgD,MACtB,MAAM,IAAItiD,MAAM,4CAGpB,KAA0B,MAAnBgC,KAAKw+F,kBACFx+F,KAAKs+F,SAAS9+C,QAEX,MAAT//C,EACAO,KAAKw+F,WAAa,CAAEnxF,MAAM,EAAO5N,UAGjCO,KAAKsgD,OAAQ,EACbtgD,KAAKw+F,WAAa,CAAEnxF,MAAM,EAAM5N,WAAO1B,IAG3CiC,KAAKu+F,SAASxiG,UACdiE,KAAKu+F,SAAW,WAGVL,GAAWl+F,KAAKs+F,SAAS9+C,QAASz+C,GAASigD,OAAQjgD,EAC7D,EC/GG,MAAM,WAA2B/C,MACpC6N,KAAO,qBACPQ,KAAO,qBCuBJ,MAAM,WAAkBrO,MAC3BqO,KACA,WAAAS,CAAYrD,EAAS4C,GACjB0hC,MAAMtkC,GACNzJ,KAAKqM,KAAOA,CAChB,EAKG,MAAM,WAAmB,GAC5BnE,KACA,WAAA4E,CAAYrD,GACRskC,MAAMtkC,EAAS,aACfzJ,KAAKkI,KAAO,UACZlI,KAAK6L,KAAO,YAChB,EAEG,SAAS4yF,GAAW38C,EAAQzc,GAC/B,MAAM3+B,EFsEC,IAAI23F,GErEXv8C,EAAOG,KAAKv7C,GAAOmH,OAAMk9B,MAAO9uC,UACtByK,EAAM1J,IAAIf,EAAI,IAExB6lD,EAAOG,KAAOlX,MAAOvsC,IACjB,UAAW,MAAM+D,KAAO/D,QACdkI,EAAMpJ,KAAKiF,SAEfmE,EAAM1J,KAAK,EAErB,IAAIwB,EAASsjD,EAAOtjD,OACkB,MAAlCsjD,EAAOtjD,OAAOwP,OAAO8tC,UACrBt9C,EAASsjD,EAAOtjD,OAAOwP,OAAO8tC,YAEc,MAAvCgG,EAAOtjD,OAAOwP,OAAOC,iBAC1BzP,EAASsjD,EAAOtjD,OAAOwP,OAAOC,kBAElC,MAAMywF,EAAa,IAAI9iD,GACjBy1B,EAAI,CACN5qE,KAAMskC,MAAOz4B,EAAOvR,KAEhB,IAAIoO,EADJpO,GAASigD,QAAQC,iBAEjB,MAAM09C,EAAe,IAAI7iG,SAAQ,CAACC,EAASC,KACvCmT,EAAW,KACPnT,EAAO,IAAI,GAAW,gBAAgB,EAE1C+E,GAASigD,QAAQG,iBAAiB,QAAShyC,EAAS,IAExD,IACI,GAAa,MAATmD,EAAe,CAEf,MAAM,KAAEjF,EAAI,MAAE5N,SAAgB3D,QAAQslD,KAAK,CACvC5iD,EAAO0P,OACPywF,IAEJ,OAAa,IAATtxF,EACO,IAAIuuC,GAERn8C,CACX,CACA,KAAOi/F,EAAWzgE,WAAa3rB,GAAO,CAClC,MAAM,MAAE7S,EAAK,KAAE4N,SAAevR,QAAQslD,KAAK,CACvC5iD,EAAO0P,OACPywF,IAEJ,IAAa,IAATtxF,EACA,MAAM,IAAI,GAAmB,2BAEjCqxF,EAAW3iD,OAAOt8C,EACtB,CACA,MAAM8C,EAAMm8F,EAAWliD,QAAQ,EAAGlqC,GAElC,OADAosF,EAAWviD,QAAQ7pC,GACZ/P,CACX,CACA,QACoB,MAAZ4M,GACApO,GAASigD,QAAQK,oBAAoB,QAASlyC,EAEtD,GAEJzI,MAAOqkC,MAAO3M,EAAMr9B,KAChBA,GAASigD,QAAQC,iBAEb7iB,aAAgBz8B,iBACV+E,EAAMpJ,KAAK8gC,EAAMr9B,SAGjB2F,EAAMpJ,KAAK8gC,EAAK7K,WAAYxyB,EACtC,EAEJ69F,OAAQ,KACJ,GAAIF,EAAWzgE,WAAa,EAAG,CAC3B,MAAM4gE,EAAiB/8C,EAAOtjD,OAC9BsjD,EAAOtjD,OAAUusC,mBACY,IAArB1F,GAAMy5D,iBACAJ,QAGCA,QAEJG,CACX,CARgB,EASpB,CACA,OAAO/8C,CAAM,GAGrB,OAAOuvB,CACX,CCnIO,MAAM,WAAkCrzE,MAC3C6N,KAAO,4BACPQ,KAAO,yBAMJ,MAAM,WAA+BrO,MACxC6N,KAAO,yBACPQ,KAAO,wBAMJ,MAAM,WAAqCrO,MAC9C6N,KAAO,+BACPQ,KAAO,0BCQJ,SAAS0yF,GAASj9C,EAAQzc,EAAO,CAAC,GACrC,MAAM/yB,EAAQmsF,GAAW38C,EAAQzc,GACP,MAAtBA,EAAK6Z,eAAiD,MAAxB7Z,EAAK4Z,kBAGnC5Z,EAAK4Z,gBAAkB,EAAsB5Z,EAAK6Z,gBAEtD,MAAM8/C,EAAe35D,GAAM2Z,eAAiB,EACtCZ,EAAe/Y,GAAMgZ,eAAiB,EA6C5C,MA5CU,CACN53C,KAAMskC,MAAOhqC,IACT,IAAIg+C,GAAc,EAClB,MAAMkgD,EAAe,IAAIrjD,GACzB,OAAa,CAETqjD,EAAaljD,aAAazpC,EAAM7L,KAAK,EAAG1F,IACxC,IACIg+C,EAAaigD,EAAaC,EAC9B,CACA,MAAOhjG,GACH,GAAIA,aAAe82B,WACf,SAEJ,MAAM92B,CACV,CACA,GAAI8iD,EAAa,EACb,MAAM,IAAI,GAA0B,0BAExC,GAA6B,MAAzB1Z,GAAM4Z,iBAA2BggD,EAAahhE,WAAaoH,EAAK4Z,gBAChE,MAAM,IAAI,GAA6B,kCAE3C,GAAIF,GAAc,EACd,KAER,CACA,GAA2B,MAAvB1Z,GAAM6Z,eAAyBH,EAAa1Z,EAAK6Z,cACjD,MAAM,IAAI,GAAuB,2BAErC,OAAO5sC,EAAM7L,KAAKs4C,EAAYh+C,EAAQ,EAE1C2F,MAAOqkC,MAAO3M,EAAMr9B,WAEVuR,EAAM5L,MAAM,IAAIk1C,GAAewC,EAAahgB,EAAKH,YAAaG,GAAOr9B,EAAQ,EAEvFm+F,OAAQn0D,MAAO3M,EAAMr9B,KACjB,MAAM07C,EAAO,IAAIb,MAAkBxd,EAAK+gE,SAAQ58F,GAAO,CAAE67C,EAAa77C,EAAI07B,YAAa17B,YAEjF+P,EAAM5L,MAAM+1C,EAAM17C,EAAQ,EAEpC69F,OAAQ,IACGtsF,EAAMssF,SAIzB,CC/EO,SAAStf,KACZ,MAAM3qD,EAAW,KACjB,IAAIyqE,GAAQ,EACZ,MAAO,CACHn9C,KAAMlX,MAAOvsC,IACT,GAAI4gG,EACA,MAAM,IAAIphG,MAAM,iBAEpBohG,GAAQ,EACRzqE,EAAS54B,QAAQyC,EAAO,EAE5BA,OAASusC,kBACL,MAAMvsC,QAAem2B,EAAS6qB,cACvBhhD,CACX,CAHQ,GAKhB,CCpBO,MAAM6gG,GAA6B,MAE7BC,GAAoBn4E,QAAQzL,WAAW5T,SAASC,KAAKu3F,mBCFlE,SAAS,GAAOhjG,GACZ,IAAKoD,OAAO2zC,cAAc/2C,IAAMA,EAAI,EAChC,MAAM,IAAI0B,MAAM,kCAAkC1B,IAC1D,CACA,SAAS,GAAKe,GACV,GAAiB,kBAANA,EACP,MAAM,IAAIW,MAAM,yBAAyBX,IACjD,CACO,SAAS,GAAQg9B,GACpB,OAAQA,aAAa14B,YACX,MAAL04B,GAA0B,iBAANA,GAAyC,eAAvBA,EAAEvtB,YAAYjB,IAC7D,CACA,SAAS,GAAMxO,KAAMi2C,GACjB,IAAK,GAAQj2C,GACT,MAAM,IAAIW,MAAM,uBACpB,GAAIs1C,EAAQ53C,OAAS,IAAM43C,EAAQ32B,SAAStf,EAAE3B,QAC1C,MAAM,IAAIsC,MAAM,iCAAiCs1C,oBAA0Bj2C,EAAE3B,SACrF,CAOA,SAAS,GAAOg4C,EAAUC,GAAgB,GACtC,GAAID,EAASE,UACT,MAAM,IAAI51C,MAAM,oCACpB,GAAI21C,GAAiBD,EAASG,SAC1B,MAAM,IAAI71C,MAAM,wCACxB,CASA,MCjCa,GAAO81C,GAAQ,IAAIr8B,YAAYq8B,EAAIh3C,OAAQg3C,EAAIxV,WAAY9hC,KAAKmD,MAAMm0C,EAAI7V,WAAa,IAMpG,GADgF,KAA5D,IAAIt8B,WAAW,IAAI8V,YAAY,CAAC,YAAa3a,QAAQ,GAErE,MAAM,IAAIkB,MAAM,+CAiGb,SAAS,GAAQogC,GACpB,GAAoB,iBAATA,EACPA,EAlBD,SAAqB1rB,GACxB,GAAmB,iBAARA,EACP,MAAM,IAAI1U,MAAM,+BAA+B0U,GACnD,OAAO,IAAI/Q,YAAW,IAAIgoC,aAAc9sC,OAAO6V,GACnD,CAce,CAAY0rB,OAClB,KAAI,GAAQA,GAGb,MAAM,IAAIpgC,MAAM,mCAAmCogC,GAFnDA,EAAOmhE,GAAUnhE,EAEyC,CAC9D,OAAOA,CACX,CAwCO,MAAMohE,GAAa,CAACjkG,EAAQsC,KAC/BiB,OAAOoN,OAAOrO,EAAGtC,GACVsC,GAGJ,SAAS,GAAamhC,EAAMV,EAAY7+B,EAAO21C,GAClD,GAAiC,mBAAtBpW,EAAK0W,aACZ,OAAO1W,EAAK0W,aAAapX,EAAY7+B,EAAO21C,GAChD,MAAMO,EAAO3R,OAAO,IACd4R,EAAW5R,OAAO,YAClB6R,EAAKn2C,OAAQD,GAASk2C,EAAQC,GAC9BE,EAAKp2C,OAAOD,EAAQm2C,GACpBj+B,EAAIy9B,EAAO,EAAI,EACfvlC,EAAIulC,EAAO,EAAI,EACrBpW,EAAK+W,UAAUzX,EAAa3mB,EAAGk+B,EAAIT,GACnCpW,EAAK+W,UAAUzX,EAAazuB,EAAGimC,EAAIV,EACvC,CAaO,SAASmqD,GAAUjtF,GACtB,OAAO3Q,WAAWk5B,KAAKvoB,EAC3B,CACO,SAASmtF,MAASlkD,GACrB,IAAK,IAAI3+C,EAAI,EAAGA,EAAI2+C,EAAO7/C,OAAQkB,IAC/B2+C,EAAO3+C,GAAG64C,KAAK,EAEvB,CC1JA,MAAMiqD,GAAgBhtF,GAAQ/Q,WAAWk5B,KAAKnoB,EAAIhN,MAAM,IAAIgG,KAAK7N,GAAMA,EAAEC,WAAW,MAC9E6hG,GAAUD,GAAa,oBACvBE,GAAUF,GAAa,oBACvBG,GAAa,GAAIF,IACjBG,GAAa,GAAIF,IAEhB,SAAS,GAAKvlE,EAAGh9B,GACpB,OAAQg9B,GAAKh9B,EAAMg9B,IAAO,GAAKh9B,CACnC,CAEA,SAAS,GAAYA,GACjB,OAAOA,EAAEihC,WAAa,GAAM,CAChC,CAPqBwhE,GAAWriG,QAShC,MAIMsiG,GAAc,GAAK,GAAK,EACxBC,GAAY,IAAIvoF,YAiCf,SAASwoF,GAAavjC,EAAMr3B,GAC/B,MAAM,eAAE66D,EAAc,cAAEC,EAAa,cAAEC,EAAa,aAAEC,EAAY,OAAEC,GD4CjE,SAAmBz6E,EAAUwf,GAChC,GAAY,MAARA,GAAgC,iBAATA,EACvB,MAAM,IAAIrnC,MAAM,2BAEpB,OADec,OAAOoN,OC/CmE,CAAEg0F,gBAAgB,EAAOE,cAAe,EAAGC,cAAc,EAAOC,OAAQ,ID+C1Hj7D,EAE3C,CCjDmF,CAAU,EAA8EA,GACvK,GAAoB,mBAATq3B,EACP,MAAM,IAAI1+D,MAAM,2BAKpB,OAJA,GAAQoiG,GACR,GAAQE,GACR,GAAMD,GACN,GAAMH,GACC,CAACn0F,EAAKuxE,EAAOl/C,EAAMoX,EAAQlL,EAAU,KACxC,GAAOv+B,GACP,GAAOuxE,GACP,GAAOl/C,GACP,MAAM53B,EAAM43B,EAAK1iC,OAKjB,QAJeqC,IAAXy3C,IACAA,EAAS,IAAI7zC,WAAW6E,IAC5B,GAAOgvC,GACP,GAAQlL,GACJA,EAAU,GAAKA,GAAWy1D,GAC1B,MAAM,IAAI/hG,MAAM,yBACpB,GAAIw3C,EAAO95C,OAAS8K,EAChB,MAAM,IAAIxI,MAAM,gBAAgBw3C,EAAO95C,iCAAiC8K,MAC5E,MAAM+5F,EAAU,GAIhB,IAAoB9jF,EAAG+jF,EAAnB3wF,EAAI9D,EAAIrQ,OACZ,GAAU,KAANmU,EACA0wF,EAAQjjG,KAAMmf,EAAI8iF,GAAUxzF,IAC5By0F,EAAQV,OAEP,IAAU,KAANjwF,IAAYqwF,EAQjB,MAAM,IAAIliG,MAAM,wCAAwC6R,KAPxD4M,EAAI,IAAI9a,WAAW,IACnB8a,EAAE1R,IAAIgB,GACN0Q,EAAE1R,IAAIgB,EAAK,IACXy0F,EAAQX,GACRU,EAAQjjG,KAAKmf,EAIjB,CAQK,GAAY6gE,IACbijB,EAAQjjG,KAAMggF,EAAQiiB,GAAUjiB,IACpC,MAAMmjB,EAAM,GAAIhkF,GAEhB,GAAI0jF,EAAe,CACf,GAAqB,KAAjB7iB,EAAM5hF,OACN,MAAM,IAAIsC,MAAM,wCACpBmiG,EAAcK,EAAOC,EAAK,GAAInjB,EAAM/pD,SAAS,EAAG,KAAMktE,GACtDnjB,EAAQA,EAAM/pD,SAAS,GAC3B,CAEA,MAAMmtE,EAAa,GAAKN,EACxB,GAAIM,IAAepjB,EAAM5hF,OACrB,MAAM,IAAIsC,MAAM,sBAAsB0iG,iBAE1C,GAAmB,KAAfA,EAAmB,CACnB,MAAMC,EAAK,IAAIh/F,WAAW,IAC1Bg/F,EAAG51F,IAAIuyE,EAAO+iB,EAAe,EAAI,GAAK/iB,EAAM5hF,QAC5C4hF,EAAQqjB,EACRJ,EAAQjjG,KAAKggF,EACjB,CACA,MAAMsjB,EAAM,GAAItjB,GAGhB,OAvGR,SAAmB5gB,EAAM8jC,EAAOz0F,EAAKuxE,EAAOl/C,EAAMoX,EAAQlL,EAASg2D,GAC/D,MAAM95F,EAAM43B,EAAK1iC,OACX6a,EAAQ,IAAI5U,WARJ,IASRyY,EAAM,GAAI7D,GAEVsqF,EAAY,GAAYziE,IAAS,GAAYoX,GAC7CsrD,EAAMD,EAAY,GAAIziE,GAAQ4hE,GAC9Be,EAAMF,EAAY,GAAIrrD,GAAUwqD,GACtC,IAAK,IAAIx9F,EAAM,EAAGA,EAAMgE,EAAK8jC,IAAW,CAEpC,GADAoyB,EAAK8jC,EAAOz0F,EAAKuxE,EAAOljE,EAAKkwB,EAASg2D,GAClCh2D,GAAWy1D,GACX,MAAM,IAAI/hG,MAAM,yBACpB,MAAMq3C,EAAO74C,KAAKk4B,IAlBR,GAkBuBluB,EAAMhE,GAEvC,GAAIq+F,GApBM,KAoBOxrD,EAAjB,CACI,MAAM2rD,EAAQx+F,EAAM,EACpB,GAAIA,EAAM,GAAM,EACZ,MAAM,IAAIxE,MAAM,+BACpB,IAAK,IAAWijG,EAAP7jG,EAAI,EAASA,EAvBd,GAuB+BA,IACnC6jG,EAAOD,EAAQ5jG,EACf2jG,EAAIE,GAAQH,EAAIG,GAAQ7mF,EAAIhd,GAEhCoF,GA5BM,EA8BV,KAVA,CAWA,IAAK,IAAWy+F,EAAP7jG,EAAI,EAASA,EAAIi4C,EAAMj4C,IAC5B6jG,EAAOz+F,EAAMpF,EACbo4C,EAAOyrD,GAAQ7iE,EAAK6iE,GAAQ1qF,EAAMnZ,GAEtCoF,GAAO6yC,CALP,CAMJ,CACJ,CAsEQ6rD,CAAUxkC,EAAM8jC,EAAOC,EAAKG,EAAKxiE,EAAMoX,EAAQlL,EAASg2D,GACxDb,MAASc,GACF/qD,CAAM,CAErB,CC9JA,MAAM2rD,GAAS,CAAC9mE,EAAGz9B,IAAgB,IAATy9B,EAAEz9B,MAA0B,IAATy9B,EAAEz9B,OAAgB,EAC/D,MAAMwkG,GACF,WAAAt0F,CAAYf,GACR/L,KAAKwzC,SAAW,GAChBxzC,KAAKuzC,UAAY,GACjBvzC,KAAKlD,OAAS,IAAI6E,WAAW,IAC7B3B,KAAK4H,EAAI,IAAIy5F,YAAY,IACzBrhG,KAAK2X,EAAI,IAAI0pF,YAAY,IACzBrhG,KAAK0nC,IAAM,IAAI25D,YAAY,GAC3BrhG,KAAKwC,IAAM,EACXxC,KAAK6zC,UAAW,EAEhB,GADA9nC,EAAM,GAAQA,GACF,IACZ,MAAM+qF,EAAKqK,GAAOp1F,EAAK,GACjBgrF,EAAKoK,GAAOp1F,EAAK,GACjBkjE,EAAKkyB,GAAOp1F,EAAK,GACjBirF,EAAKmK,GAAOp1F,EAAK,GACjBkrF,EAAKkK,GAAOp1F,EAAK,GACjBmrF,EAAKiK,GAAOp1F,EAAK,IACjBu1F,EAAKH,GAAOp1F,EAAK,IACjBw1F,EAAKJ,GAAOp1F,EAAK,IAEvB/L,KAAK4H,EAAE,GAAU,KAALkvF,EACZ92F,KAAK4H,EAAE,GAAiC,MAA1BkvF,IAAO,GAAOC,GAAM,GAClC/2F,KAAK4H,EAAE,GAAiC,MAA1BmvF,IAAO,GAAO9nB,GAAM,GAClCjvE,KAAK4H,EAAE,GAAgC,MAAzBqnE,IAAO,EAAM+nB,GAAM,GACjCh3F,KAAK4H,EAAE,GAAiC,KAA1BovF,IAAO,EAAMC,GAAM,IACjCj3F,KAAK4H,EAAE,GAAMqvF,IAAO,EAAK,KACzBj3F,KAAK4H,EAAE,GAAiC,MAA1BqvF,IAAO,GAAOC,GAAM,GAClCl3F,KAAK4H,EAAE,GAAiC,MAA1BsvF,IAAO,GAAOoK,GAAM,GAClCthG,KAAK4H,EAAE,GAAgC,MAAzB05F,IAAO,EAAMC,GAAM,GACjCvhG,KAAK4H,EAAE,GAAM25F,IAAO,EAAK,IACzB,IAAK,IAAI3kG,EAAI,EAAGA,EAAI,EAAGA,IACnBoD,KAAK0nC,IAAI9qC,GAAKukG,GAAOp1F,EAAK,GAAK,EAAInP,EAC3C,CACA,OAAAkL,CAAQs2B,EAAMziC,EAAQ6lG,GAAS,GAC3B,MAAMC,EAAQD,EAAS,EAAI,MACrB,EAAE7pF,EAAC,EAAE/P,GAAM5H,KACX0hG,EAAK95F,EAAE,GACP+5F,EAAK/5F,EAAE,GACPg6F,EAAKh6F,EAAE,GACPi6F,EAAKj6F,EAAE,GACPk6F,EAAKl6F,EAAE,GACPm6F,EAAKn6F,EAAE,GACPo6F,EAAKp6F,EAAE,GACPq6F,EAAKr6F,EAAE,GACPs6F,EAAKt6F,EAAE,GACPu6F,EAAKv6F,EAAE,GACPkvF,EAAKqK,GAAO/iE,EAAMziC,EAAS,GAC3Bo7F,EAAKoK,GAAO/iE,EAAMziC,EAAS,GAC3BszE,EAAKkyB,GAAO/iE,EAAMziC,EAAS,GAC3Bq7F,EAAKmK,GAAO/iE,EAAMziC,EAAS,GAC3Bs7F,EAAKkK,GAAO/iE,EAAMziC,EAAS,GAC3Bu7F,EAAKiK,GAAO/iE,EAAMziC,EAAS,IAC3B2lG,EAAKH,GAAO/iE,EAAMziC,EAAS,IAC3B4lG,EAAKJ,GAAO/iE,EAAMziC,EAAS,IACjC,IAAIymG,EAAKzqF,EAAE,IAAW,KAALm/E,GACbr4E,EAAK9G,EAAE,IAAkC,MAA1Bm/E,IAAO,GAAOC,GAAM,IACnCn4E,EAAKjH,EAAE,IAAkC,MAA1Bo/E,IAAO,GAAO9nB,GAAM,IACnCpwD,EAAKlH,EAAE,IAAiC,MAAzBs3D,IAAO,EAAM+nB,GAAM,IAClCl4E,EAAKnH,EAAE,IAAkC,MAA1Bq/E,IAAO,EAAMC,GAAM,KAClCoL,EAAK1qF,EAAE,IAAOs/E,IAAO,EAAK,MAC1BqL,EAAK3qF,EAAE,IAAkC,MAA1Bs/E,IAAO,GAAOC,GAAM,IACnCqL,EAAK5qF,EAAE,IAAkC,MAA1Bu/E,IAAO,GAAOoK,GAAM,IACnCkB,EAAK7qF,EAAE,IAAiC,MAAzB2pF,IAAO,EAAMC,GAAM,IAClCkB,EAAK9qF,EAAE,IAAO4pF,IAAO,EAAKE,GAC1B5jG,EAAI,EACJ6kG,EAAK7kG,EAAIukG,EAAKV,EAAKjjF,GAAM,EAAI0jF,GAAMvjF,GAAM,EAAIsjF,GAAMrjF,GAAM,EAAIojF,GAAMnjF,GAAM,EAAIkjF,GACjFnkG,EAAI6kG,IAAO,GACXA,GAAM,KACNA,GAAML,GAAM,EAAIN,GAAMO,GAAM,EAAIR,GAAMS,GAAM,EAAIV,GAAMW,GAAM,EAAIZ,GAAMa,GAAM,EAAId,GAChF9jG,GAAK6kG,IAAO,GACZA,GAAM,KACN,IAAIC,EAAK9kG,EAAIukG,EAAKT,EAAKljF,EAAKijF,EAAK9iF,GAAM,EAAIujF,GAAMtjF,GAAM,EAAIqjF,GAAMpjF,GAAM,EAAImjF,GAC3EpkG,EAAI8kG,IAAO,GACXA,GAAM,KACNA,GAAMN,GAAM,EAAIL,GAAMM,GAAM,EAAIP,GAAMQ,GAAM,EAAIT,GAAMU,GAAM,EAAIX,GAAMY,GAAM,EAAIb,GAChF/jG,GAAK8kG,IAAO,GACZA,GAAM,KACN,IAAIC,EAAK/kG,EAAIukG,EAAKR,EAAKnjF,EAAKkjF,EAAK/iF,EAAK8iF,EAAK7iF,GAAM,EAAIsjF,GAAMrjF,GAAM,EAAIojF,GACrErkG,EAAI+kG,IAAO,GACXA,GAAM,KACNA,GAAMP,GAAM,EAAIJ,GAAMK,GAAM,EAAIN,GAAMO,GAAM,EAAIR,GAAMS,GAAM,EAAIV,GAAMW,GAAM,EAAIZ,GAChFhkG,GAAK+kG,IAAO,GACZA,GAAM,KACN,IAAIC,EAAKhlG,EAAIukG,EAAKP,EAAKpjF,EAAKmjF,EAAKhjF,EAAK+iF,EAAK9iF,EAAK6iF,EAAK5iF,GAAM,EAAIqjF,GAC/DtkG,EAAIglG,IAAO,GACXA,GAAM,KACNA,GAAMR,GAAM,EAAIH,GAAMI,GAAM,EAAIL,GAAMM,GAAM,EAAIP,GAAMQ,GAAM,EAAIT,GAAMU,GAAM,EAAIX,GAChFjkG,GAAKglG,IAAO,GACZA,GAAM,KACN,IAAIC,EAAKjlG,EAAIukG,EAAKN,EAAKrjF,EAAKojF,EAAKjjF,EAAKgjF,EAAK/iF,EAAK8iF,EAAK7iF,EAAK4iF,EAC1D7jG,EAAIilG,IAAO,GACXA,GAAM,KACNA,GAAMT,GAAM,EAAIF,GAAMG,GAAM,EAAIJ,GAAMK,GAAM,EAAIN,GAAMO,GAAM,EAAIR,GAAMS,GAAM,EAAIV,GAChFlkG,GAAKilG,IAAO,GACZA,GAAM,KACN,IAAIC,EAAKllG,EAAIukG,EAAKL,EAAKtjF,EAAKqjF,EAAKljF,EAAKijF,EAAKhjF,EAAK+iF,EAAK9iF,EAAK6iF,EAC1D9jG,EAAIklG,IAAO,GACXA,GAAM,KACNA,GAAMV,EAAKX,EAAKY,GAAM,EAAIH,GAAMI,GAAM,EAAIL,GAAMM,GAAM,EAAIP,GAAMQ,GAAM,EAAIT,GAC1EnkG,GAAKklG,IAAO,GACZA,GAAM,KACN,IAAIC,EAAKnlG,EAAIukG,EAAKJ,EAAKvjF,EAAKsjF,EAAKnjF,EAAKkjF,EAAKjjF,EAAKgjF,EAAK/iF,EAAK8iF,EAC1D/jG,EAAImlG,IAAO,GACXA,GAAM,KACNA,GAAMX,EAAKV,EAAKW,EAAKZ,EAAKa,GAAM,EAAIJ,GAAMK,GAAM,EAAIN,GAAMO,GAAM,EAAIR,GACpEpkG,GAAKmlG,IAAO,GACZA,GAAM,KACN,IAAIC,EAAKplG,EAAIukG,EAAKH,EAAKxjF,EAAKujF,EAAKpjF,EAAKmjF,EAAKljF,EAAKijF,EAAKhjF,EAAK+iF,EAC1DhkG,EAAIolG,IAAO,GACXA,GAAM,KACNA,GAAMZ,EAAKT,EAAKU,EAAKX,EAAKY,EAAKb,EAAKc,GAAM,EAAIL,GAAMM,GAAM,EAAIP,GAC9DrkG,GAAKolG,IAAO,GACZA,GAAM,KACN,IAAIC,EAAKrlG,EAAIukG,EAAKF,EAAKzjF,EAAKwjF,EAAKrjF,EAAKojF,EAAKnjF,EAAKkjF,EAAKjjF,EAAKgjF,EAC1DjkG,EAAIqlG,IAAO,GACXA,GAAM,KACNA,GAAMb,EAAKR,EAAKS,EAAKV,EAAKW,EAAKZ,EAAKa,EAAKd,EAAKe,GAAM,EAAIN,GACxDtkG,GAAKqlG,IAAO,GACZA,GAAM,KACN,IAAIC,EAAKtlG,EAAIukG,EAAKD,EAAK1jF,EAAKyjF,EAAKtjF,EAAKqjF,EAAKpjF,EAAKmjF,EAAKljF,EAAKijF,EAC1DlkG,EAAIslG,IAAO,GACXA,GAAM,KACNA,GAAMd,EAAKP,EAAKQ,EAAKT,EAAKU,EAAKX,EAAKY,EAAKb,EAAKc,EAAKf,EACnD7jG,GAAKslG,IAAO,GACZA,GAAM,KACNtlG,GAAMA,GAAK,GAAKA,EAAK,EACrBA,EAAKA,EAAI6kG,EAAM,EACfA,EAAS,KAAJ7kG,EACLA,KAAU,GACV8kG,GAAM9kG,EACN8Z,EAAE,GAAK+qF,EACP/qF,EAAE,GAAKgrF,EACPhrF,EAAE,GAAKirF,EACPjrF,EAAE,GAAKkrF,EACPlrF,EAAE,GAAKmrF,EACPnrF,EAAE,GAAKorF,EACPprF,EAAE,GAAKqrF,EACPrrF,EAAE,GAAKsrF,EACPtrF,EAAE,GAAKurF,EACPvrF,EAAE,GAAKwrF,CACX,CACA,QAAA7rF,GACI,MAAM,EAAEK,EAAC,IAAE+vB,GAAQ1nC,KACb+uE,EAAI,IAAIsyB,YAAY,IAC1B,IAAIxjG,EAAI8Z,EAAE,KAAO,GACjBA,EAAE,IAAM,KACR,IAAK,IAAI/a,EAAI,EAAGA,EAAI,GAAIA,IACpB+a,EAAE/a,IAAMiB,EACRA,EAAI8Z,EAAE/a,KAAO,GACb+a,EAAE/a,IAAM,KAEZ+a,EAAE,IAAU,EAAJ9Z,EACRA,EAAI8Z,EAAE,KAAO,GACbA,EAAE,IAAM,KACRA,EAAE,IAAM9Z,EACRA,EAAI8Z,EAAE,KAAO,GACbA,EAAE,IAAM,KACRA,EAAE,IAAM9Z,EACRkxE,EAAE,GAAKp3D,EAAE,GAAK,EACd9Z,EAAIkxE,EAAE,KAAO,GACbA,EAAE,IAAM,KACR,IAAK,IAAInyE,EAAI,EAAGA,EAAI,GAAIA,IACpBmyE,EAAEnyE,GAAK+a,EAAE/a,GAAKiB,EACdA,EAAIkxE,EAAEnyE,KAAO,GACbmyE,EAAEnyE,IAAM,KAEZmyE,EAAE,IAAM,KACR,IAAI9uD,GAAY,EAAJpiB,GAAS,EACrB,IAAK,IAAIjB,EAAI,EAAGA,EAAI,GAAIA,IACpBmyE,EAAEnyE,IAAMqjB,EACZA,GAAQA,EACR,IAAK,IAAIrjB,EAAI,EAAGA,EAAI,GAAIA,IACpB+a,EAAE/a,GAAM+a,EAAE/a,GAAKqjB,EAAQ8uD,EAAEnyE,GAC7B+a,EAAE,GAA6B,OAAvBA,EAAE,GAAMA,EAAE,IAAM,IACxBA,EAAE,GAAqC,OAA9BA,EAAE,KAAO,EAAMA,EAAE,IAAM,IAChCA,EAAE,GAAoC,OAA7BA,EAAE,KAAO,EAAMA,EAAE,IAAM,GAChCA,EAAE,GAAoC,OAA7BA,EAAE,KAAO,EAAMA,EAAE,IAAM,GAChCA,EAAE,GAAoD,OAA7CA,EAAE,KAAO,GAAOA,EAAE,IAAM,EAAMA,EAAE,IAAM,IAC/CA,EAAE,GAAqC,OAA9BA,EAAE,KAAO,EAAMA,EAAE,IAAM,IAChCA,EAAE,GAAoC,OAA7BA,EAAE,KAAO,EAAMA,EAAE,IAAM,GAChCA,EAAE,GAAoC,OAA7BA,EAAE,KAAO,EAAMA,EAAE,IAAM,GAChC,IAAIb,EAAIa,EAAE,GAAK+vB,EAAI,GACnB/vB,EAAE,GAAS,MAAJb,EACP,IAAK,IAAIla,EAAI,EAAGA,EAAI,EAAGA,IACnBka,GAAOa,EAAE/a,GAAK8qC,EAAI9qC,GAAM,IAAMka,IAAM,IAAO,EAC3Ca,EAAE/a,GAAS,MAAJka,EAEX2oF,GAAM1wB,EACV,CACA,MAAAp+D,CAAOytB,GACH,GAAQp+B,MACR,MAAM,OAAElD,EAAM,SAAE02C,GAAaxzC,KAEvBwG,GADN43B,EAAO,GAAQA,IACE1iC,OACjB,IAAK,IAAI8G,EAAM,EAAGA,EAAMgE,GAAM,CAC1B,MAAM6uC,EAAO74C,KAAKk4B,IAAI8e,EAAWxzC,KAAKwC,IAAKgE,EAAMhE,GAEjD,GAAI6yC,IAAS7B,EAKb12C,EAAOiO,IAAIqzB,EAAK7K,SAAS/wB,EAAKA,EAAM6yC,GAAOr1C,KAAKwC,KAChDxC,KAAKwC,KAAO6yC,EACZ7yC,GAAO6yC,EACHr1C,KAAKwC,MAAQgxC,IACbxzC,KAAK8H,QAAQhL,EAAQ,GAAG,GACxBkD,KAAKwC,IAAM,QATX,KAAOgxC,GAAYhtC,EAAMhE,EAAKA,GAAOgxC,EACjCxzC,KAAK8H,QAAQs2B,EAAM57B,EAU/B,CACA,OAAOxC,IACX,CACA,OAAAkJ,GACIu2F,GAAMz/F,KAAK2X,EAAG3X,KAAK4H,EAAG5H,KAAKlD,OAAQkD,KAAK0nC,IAC5C,CACA,UAAA6N,CAAW5N,GACP,GAAQ3nC,MHlMhB,SAAgB2nC,EAAK+L,GACjB,GAAM/L,GACN,MAAMjT,EAAMgf,EAASH,UACrB,GAAI5L,EAAIjsC,OAASg5B,EACb,MAAM,IAAI12B,MAAM,yDAAyD02B,IAEjF,CG6LQ,CAAQiT,EAAK3nC,MACbA,KAAK6zC,UAAW,EAChB,MAAM,OAAE/2C,EAAM,EAAE6a,GAAM3X,KACtB,IAAI,IAAEwC,GAAQxC,KACd,GAAIwC,EAAK,CAEL,IADA1F,EAAO0F,KAAS,EACTA,EAAM,GAAIA,IACb1F,EAAO0F,GAAO,EAClBxC,KAAK8H,QAAQhL,EAAQ,GAAG,EAC5B,CACAkD,KAAKsX,WACL,IAAI8rF,EAAO,EACX,IAAK,IAAIxmG,EAAI,EAAGA,EAAI,EAAGA,IACnB+qC,EAAIy7D,KAAUzrF,EAAE/a,KAAO,EACvB+qC,EAAIy7D,KAAUzrF,EAAE/a,KAAO,EAE3B,OAAO+qC,CACX,CACA,MAAAjwB,GACI,MAAM,OAAE5a,EAAM,UAAEy2C,GAAcvzC,KAC9BA,KAAKu1C,WAAWz4C,GAChB,MAAMiiC,EAAMjiC,EAAOW,MAAM,EAAG81C,GAE5B,OADAvzC,KAAKkJ,UACE61B,CACX,EAUG,MAAMskE,GARN,SAAgC1uD,GACnC,MAAMC,EAAQ,CAACC,EAAK9oC,IAAQ4oC,EAAS5oC,GAAK4E,OAAO,GAAQkkC,IAAMn9B,SACzDo9B,EAAMH,EAAS,IAAIhzC,WAAW,KAIpC,OAHAizC,EAAMrB,UAAYuB,EAAIvB,UACtBqB,EAAMpB,SAAWsB,EAAItB,SACrBoB,EAAMnoC,OAAUV,GAAQ4oC,EAAS5oC,GAC1B6oC,CACX,CACwB0uD,EAAwBv3F,GAAQ,IAAIq1F,GAASr1F,KCvPrE,SAASw3F,GAAWhuF,EAAGkH,EAAGngB,EAAGqrC,EAAK67D,EAAKlD,EAAS,IAC5C,IAAImD,EAAMluF,EAAE,GAAImuF,EAAMnuF,EAAE,GAAIouF,EAAMpuF,EAAE,GAAIquF,EAAMruF,EAAE,GAChDsuF,EAAMpnF,EAAE,GAAIqnF,EAAMrnF,EAAE,GAAIsnF,EAAMtnF,EAAE,GAAIunF,EAAMvnF,EAAE,GAC5CwnF,EAAMxnF,EAAE,GAAIynF,EAAMznF,EAAE,GAAI0nF,EAAM1nF,EAAE,GAAI2nF,EAAM3nF,EAAE,GAC5C4nF,EAAMb,EAAKc,EAAMhoG,EAAE,GAAIioG,EAAMjoG,EAAE,GAAIkoG,EAAMloG,EAAE,GAEvCmoG,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAC/K,IAAK,IAAI58F,EAAI,EAAGA,EAAI04F,EAAQ14F,GAAK,EAC7B68F,EAAOA,EAAMI,EAAO,EACpBQ,EAAM,GAAKA,EAAMZ,EAAK,IACtBQ,EAAOA,EAAMI,EAAO,EACpBR,EAAM,GAAKA,EAAMI,EAAK,IACtBR,EAAOA,EAAMI,EAAO,EACpBQ,EAAM,GAAKA,EAAMZ,EAAK,GACtBQ,EAAOA,EAAMI,EAAO,EACpBR,EAAM,GAAKA,EAAMI,EAAK,GACtBP,EAAOA,EAAMI,EAAO,EACpBQ,EAAM,GAAKA,EAAMZ,EAAK,IACtBQ,EAAOA,EAAMI,EAAO,EACpBR,EAAM,GAAKA,EAAMI,EAAK,IACtBR,EAAOA,EAAMI,EAAO,EACpBQ,EAAM,GAAKA,EAAMZ,EAAK,GACtBQ,EAAOA,EAAMI,EAAO,EACpBR,EAAM,GAAKA,EAAMI,EAAK,GACtBP,EAAOA,EAAMI,EAAO,EACpBQ,EAAM,GAAKA,EAAMZ,EAAK,IACtBQ,EAAOA,EAAMI,EAAO,EACpBR,EAAM,GAAKA,EAAMI,EAAK,IACtBR,EAAOA,EAAMI,EAAO,EACpBQ,EAAM,GAAKA,EAAMZ,EAAK,GACtBQ,EAAOA,EAAMI,EAAO,EACpBR,EAAM,GAAKA,EAAMI,EAAK,GACtBP,EAAOA,EAAMI,EAAO,EACpBQ,EAAM,GAAKA,EAAMZ,EAAK,IACtBQ,EAAOA,EAAMI,EAAO,EACpBR,EAAM,GAAKA,EAAMI,EAAK,IACtBR,EAAOA,EAAMI,EAAO,EACpBQ,EAAM,GAAKA,EAAMZ,EAAK,GACtBQ,EAAOA,EAAMI,EAAO,EACpBR,EAAM,GAAKA,EAAMI,EAAK,GACtBX,EAAOA,EAAMK,EAAO,EACpBU,EAAM,GAAKA,EAAMf,EAAK,IACtBU,EAAOA,EAAMK,EAAO,EACpBV,EAAM,GAAKA,EAAMK,EAAK,IACtBV,EAAOA,EAAMK,EAAO,EACpBU,EAAM,GAAKA,EAAMf,EAAK,GACtBU,EAAOA,EAAMK,EAAO,EACpBV,EAAM,GAAKA,EAAMK,EAAK,GACtBT,EAAOA,EAAMK,EAAO,EACpBM,EAAM,GAAKA,EAAMX,EAAK,IACtBU,EAAOA,EAAMC,EAAO,EACpBN,EAAM,GAAKA,EAAMK,EAAK,IACtBV,EAAOA,EAAMK,EAAO,EACpBM,EAAM,GAAKA,EAAMX,EAAK,GACtBU,EAAOA,EAAMC,EAAO,EACpBN,EAAM,GAAKA,EAAMK,EAAK,GACtBT,EAAOA,EAAMK,EAAO,EACpBM,EAAM,GAAKA,EAAMX,EAAK,IACtBM,EAAOA,EAAMK,EAAO,EACpBN,EAAM,GAAKA,EAAMC,EAAK,IACtBN,EAAOA,EAAMK,EAAO,EACpBM,EAAM,GAAKA,EAAMX,EAAK,GACtBM,EAAOA,EAAMK,EAAO,EACpBN,EAAM,GAAKA,EAAMC,EAAK,GACtBL,EAAOA,EAAMC,EAAO,EACpBU,EAAM,GAAKA,EAAMX,EAAK,IACtBM,EAAOA,EAAMK,EAAO,EACpBV,EAAM,GAAKA,EAAMK,EAAK,IACtBN,EAAOA,EAAMC,EAAO,EACpBU,EAAM,GAAKA,EAAMX,EAAK,GACtBM,EAAOA,EAAMK,EAAO,EACpBV,EAAM,GAAKA,EAAMK,EAAK,GAG1B,IAAIO,EAAK,EACT99D,EAAI89D,KAAShC,EAAMgB,EAAO,EAC1B98D,EAAI89D,KAAS/B,EAAMgB,EAAO,EAC1B/8D,EAAI89D,KAAS9B,EAAMgB,EAAO,EAC1Bh9D,EAAI89D,KAAS7B,EAAMgB,EAAO,EAC1Bj9D,EAAI89D,KAAS5B,EAAMgB,EAAO,EAC1Bl9D,EAAI89D,KAAS3B,EAAMgB,EAAO,EAC1Bn9D,EAAI89D,KAAS1B,EAAMgB,EAAO,EAC1Bp9D,EAAI89D,KAASzB,EAAMgB,EAAO,EAC1Br9D,EAAI89D,KAASxB,EAAMgB,EAAO,EAC1Bt9D,EAAI89D,KAASvB,EAAMgB,EAAO,EAC1Bv9D,EAAI89D,KAAStB,EAAMgB,EAAO,EAC1Bx9D,EAAI89D,KAASrB,EAAMgB,EAAO,EAC1Bz9D,EAAI89D,KAASpB,EAAMgB,EAAO,EAC1B19D,EAAI89D,KAASnB,EAAMgB,EAAO,EAC1B39D,EAAI89D,KAASlB,EAAMgB,EAAO,EAC1B59D,EAAI89D,KAASjB,EAAMgB,EAAO,CAC9B,CAyFO,MASME,GAA2BzF,GAAasD,GAAY,CAC7DlD,cAAc,EACdD,cAAe,EACfF,gBAAgB,IAOPyF,GAA4B1F,GAAasD,GAAY,CAC9DlD,cAAc,EACdD,cAAe,EACfD,cAvGG,SAAiB5qF,EAAGkH,EAAG7f,EAAGmkG,GAC7B,IAAI0D,EAAMlvF,EAAE,GAAImvF,EAAMnvF,EAAE,GAAIovF,EAAMpvF,EAAE,GAAIqvF,EAAMrvF,EAAE,GAAIsvF,EAAMpoF,EAAE,GAAIqoF,EAAMroF,EAAE,GAAIsoF,EAAMtoF,EAAE,GAAIuoF,EAAMvoF,EAAE,GAAIwoF,EAAMxoF,EAAE,GAAIyoF,EAAMzoF,EAAE,GAAI0oF,EAAM1oF,EAAE,GAAI2oF,EAAM3oF,EAAE,GAAI4oF,EAAMzoG,EAAE,GAAI0oG,EAAM1oG,EAAE,GAAI2oG,EAAM3oG,EAAE,GAAI4oG,EAAM5oG,EAAE,GAChM,IAAK,IAAIgL,EAAI,EAAGA,EAAI,GAAIA,GAAK,EACzB68F,EAAOA,EAAMI,EAAO,EACpBQ,EAAM,GAAKA,EAAMZ,EAAK,IACtBQ,EAAOA,EAAMI,EAAO,EACpBR,EAAM,GAAKA,EAAMI,EAAK,IACtBR,EAAOA,EAAMI,EAAO,EACpBQ,EAAM,GAAKA,EAAMZ,EAAK,GACtBQ,EAAOA,EAAMI,EAAO,EACpBR,EAAM,GAAKA,EAAMI,EAAK,GACtBP,EAAOA,EAAMI,EAAO,EACpBQ,EAAM,GAAKA,EAAMZ,EAAK,IACtBQ,EAAOA,EAAMI,EAAO,EACpBR,EAAM,GAAKA,EAAMI,EAAK,IACtBR,EAAOA,EAAMI,EAAO,EACpBQ,EAAM,GAAKA,EAAMZ,EAAK,GACtBQ,EAAOA,EAAMI,EAAO,EACpBR,EAAM,GAAKA,EAAMI,EAAK,GACtBP,EAAOA,EAAMI,EAAO,EACpBQ,EAAM,GAAKA,EAAMZ,EAAK,IACtBQ,EAAOA,EAAMI,EAAO,EACpBR,EAAM,GAAKA,EAAMI,EAAK,IACtBR,EAAOA,EAAMI,EAAO,EACpBQ,EAAM,GAAKA,EAAMZ,EAAK,GACtBQ,EAAOA,EAAMI,EAAO,EACpBR,EAAM,GAAKA,EAAMI,EAAK,GACtBP,EAAOA,EAAMI,EAAO,EACpBQ,EAAM,GAAKA,EAAMZ,EAAK,IACtBQ,EAAOA,EAAMI,EAAO,EACpBR,EAAM,GAAKA,EAAMI,EAAK,IACtBR,EAAOA,EAAMI,EAAO,EACpBQ,EAAM,GAAKA,EAAMZ,EAAK,GACtBQ,EAAOA,EAAMI,EAAO,EACpBR,EAAM,GAAKA,EAAMI,EAAK,GACtBX,EAAOA,EAAMK,EAAO,EACpBU,EAAM,GAAKA,EAAMf,EAAK,IACtBU,EAAOA,EAAMK,EAAO,EACpBV,EAAM,GAAKA,EAAMK,EAAK,IACtBV,EAAOA,EAAMK,EAAO,EACpBU,EAAM,GAAKA,EAAMf,EAAK,GACtBU,EAAOA,EAAMK,EAAO,EACpBV,EAAM,GAAKA,EAAMK,EAAK,GACtBT,EAAOA,EAAMK,EAAO,EACpBM,EAAM,GAAKA,EAAMX,EAAK,IACtBU,EAAOA,EAAMC,EAAO,EACpBN,EAAM,GAAKA,EAAMK,EAAK,IACtBV,EAAOA,EAAMK,EAAO,EACpBM,EAAM,GAAKA,EAAMX,EAAK,GACtBU,EAAOA,EAAMC,EAAO,EACpBN,EAAM,GAAKA,EAAMK,EAAK,GACtBT,EAAOA,EAAMK,EAAO,EACpBM,EAAM,GAAKA,EAAMX,EAAK,IACtBM,EAAOA,EAAMK,EAAO,EACpBN,EAAM,GAAKA,EAAMC,EAAK,IACtBN,EAAOA,EAAMK,EAAO,EACpBM,EAAM,GAAKA,EAAMX,EAAK,GACtBM,EAAOA,EAAMK,EAAO,EACpBN,EAAM,GAAKA,EAAMC,EAAK,GACtBL,EAAOA,EAAMC,EAAO,EACpBU,EAAM,GAAKA,EAAMX,EAAK,IACtBM,EAAOA,EAAMK,EAAO,EACpBV,EAAM,GAAKA,EAAMK,EAAK,IACtBN,EAAOA,EAAMC,EAAO,EACpBU,EAAM,GAAKA,EAAMX,EAAK,GACtBM,EAAOA,EAAMK,EAAO,EACpBV,EAAM,GAAKA,EAAMK,EAAK,GAE1B,IAAIO,EAAK,EACT1E,EAAI0E,KAAQhB,EACZ1D,EAAI0E,KAAQf,EACZ3D,EAAI0E,KAAQd,EACZ5D,EAAI0E,KAAQb,EACZ7D,EAAI0E,KAAQJ,EACZtE,EAAI0E,KAAQH,EACZvE,EAAI0E,KAAQF,EACZxE,EAAI0E,KAAQD,CAChB,EA2BItF,gBAAgB,IAkBd0F,GAA0B,IAAIjkG,WAAW,IAEzCkkG,GAAe,CAACluF,EAAGk9B,KACrBl9B,EAAEhH,OAAOkkC,GACT,MAAMzN,EAAOyN,EAAIn5C,OAAS,GACtB0rC,GACAzvB,EAAEhH,OAAOi1F,GAAQryE,SAAS6T,GAAM,EAElC0+D,GAA0B,IAAInkG,WAAW,IAC/C,SAASokG,GAAW1qG,EAAI0Q,EAAKuxE,EAAOl/C,EAAM4nE,GACtC,MAAMC,EAAU5qG,EAAG0Q,EAAKuxE,EAAOwoB,IACzBnuF,EAAI0rF,GAAS52F,OAAOw5F,GACtBD,GACAH,GAAaluF,EAAGquF,GACpBH,GAAaluF,EAAGymB,GAChB,MAAMgM,EAAM,IAAIzoC,WAAW,IACrBq9B,GHlPiB8U,EGkPC1J,EHlPO,IAAItK,SAASgU,EAAIh3C,OAAQg3C,EAAIxV,WAAYwV,EAAI7V,aAAtD,IAAC6V,EGmPvB,GAAa9U,EAAM,EAAGgF,OAAOgiE,EAAMA,EAAItqG,OAAS,IAAI,GACpD,GAAasjC,EAAM,EAAGgF,OAAO5F,EAAK1iC,SAAS,GAC3Cic,EAAEhH,OAAOy5B,GACT,MAAMrL,EAAMpnB,EAAED,SAEd,OADA+nF,GAAMwG,EAAS77D,GACRrL,CACX,CAUO,MAAMmnE,GAAkBC,GAAc,CAACp6F,EAAKuxE,EAAO0oB,KAEtD,GAAOj6F,EAAK,IACZ,GAAOuxE,GACA,CACH,OAAAF,CAAQc,EAAW1oC,GACf,MAAM4wD,EAAUloB,EAAUxiF,OACpB2qG,EAAUD,EANN,GAON5wD,EACA,GAAOA,EAAQ6wD,GAGf7wD,EAAS,IAAI7zC,WAAW0kG,GAE5BF,EAAUp6F,EAAKuxE,EAAOY,EAAW1oC,EAAQ,GACzC,MAAMlF,EAAMy1D,GAAWI,EAAWp6F,EAAKuxE,EAAO9nC,EAAOjiB,SAAS,GAAG,IAAayyE,GAG9E,OAFAxwD,EAAOzqC,IAAIulC,EAAK81D,GAChB3G,GAAMnvD,GACCkF,CACX,EACA,OAAAwoC,CAAQD,EAAYvoC,GAChB,MAAM6wD,EAAUtoB,EAAWriF,OACrB0qG,EAAUC,EArBN,GAsBV,GAAIA,EAtBM,GAuBN,MAAM,IAAIroG,MAAM,4CAChBw3C,EACA,GAAOA,EAAQ4wD,GAGf5wD,EAAS,IAAI7zC,WAAWykG,GAE5B,MAAMhoE,EAAO2/C,EAAWxqD,SAAS,GAAG,IAC9B+yE,EAAYvoB,EAAWxqD,UAAS,IAChC+c,EAAMy1D,GAAWI,EAAWp6F,EAAKuxE,EAAOl/C,EAAM4nE,GACpD,IH7JL,SAAoB3rE,EAAGh9B,GAC1B,GAAIg9B,EAAE3+B,SAAW2B,EAAE3B,OACf,OAAO,EACX,IAAIuL,EAAO,EACX,IAAK,IAAIrK,EAAI,EAAGA,EAAIy9B,EAAE3+B,OAAQkB,IAC1BqK,GAAQozB,EAAEz9B,GAAKS,EAAET,GACrB,OAAgB,IAATqK,CACX,CGsJiB,CAAWq/F,EAAWh2D,GACvB,MAAM,IAAItyC,MAAM,eAGpB,OAFAmoG,EAAUp6F,EAAKuxE,EAAOl/C,EAAMoX,EAAQ,GACpCiqD,GAAMnvD,GACCkF,CACX,IAOK+wD,GAAmC/G,GAAW,CAAEgH,UAAW,GAAIC,YAAa,GAAIC,UAAW,IAAMR,GAAeR,KAMdQ,GAAeP,ICvS9H,MAAMgB,GAA+B,IAAIhlG,WAAW,CAAC,IAC/C,GAA+B,IAAIA,WA8ClC,MCrEMilG,GCGe,CACxBC,WAAWzoE,GACA,GAAOA,EAAK7K,YAEvB,OAAAuzE,CAAQC,EAAIC,GACR,MAAMC,EFIP,SAAiBj7F,EAAMg7F,EAAK3pB,GAO/B,OANA,GAAWrxE,QAIEjO,IAATs/E,IACAA,EAAO,IAAI17E,WAAWqK,EAAKunC,YACxBwsC,GAAK/zE,EAAMuoC,GAAQ8oC,GAAO9oC,GAAQyyD,GAC7C,CEZoBE,CAAQ,GAAQF,EAAKD,GAE3BI,EFoBP,SAAgBn7F,EAAMi7F,EAAKj1D,EAAMt2C,EAAS,IAG7C,GAFA,GAAWsQ,GACX,GAAatQ,GACTA,EAAS,IAAMsQ,EAAKunC,UACpB,MAAM,IAAIv1C,MAAM,mCACpB,MAAMuT,EAAS/U,KAAKC,KAAKf,EAASsQ,EAAKunC,gBAC1Bx1C,IAATi0C,IACAA,EAAO,IAEX,MAAMm1D,EAAM,IAAIxlG,WAAW4P,EAASvF,EAAKunC,WAEnCqsC,EAAOG,GAAKtzE,OAAOT,EAAMi7F,GACzBG,EAAUxnB,EAAKnrC,aACfuhC,EAAI,IAAIr0E,WAAWi+E,EAAKrsC,WAC9B,IAAK,IAAIjJ,EAAU,EAAGA,EAAU/4B,EAAQ+4B,IACpCq8D,GAAa,GAAKr8D,EAAU,EAG5B88D,EAAQz2F,OAAmB,IAAZ25B,EAAgB,GAAe0rC,GACzCrlE,OAAOqhC,GACPrhC,OAAOg2F,IACPpxD,WAAWygC,GAChBmxB,EAAIp8F,IAAIirE,EAAGhqE,EAAKunC,UAAYjJ,GAC5Bs1C,EAAKnrC,WAAW2yD,GAMpB,OAJAxnB,EAAK12E,UACLk+F,EAAQl+F,UACR8sE,EAAEvgC,KAAK,GACPkxD,GAAalxD,KAAK,GACX0xD,EAAI1pG,MAAM,EAAG/B,EACxB,CEnD2B2rG,CAAO,GAAQJ,OAAKlpG,EAAW,IAKlD,MAAO,CAHIopG,EAAI5zE,SAAS,EAAG,IAChB4zE,EAAI5zE,SAAS,GAAI,IACjB4zE,EAAI5zE,SAAS,GAAI,IAEhC,EACA,qBAAA+zE,GACI,MAAMC,EAAYztB,GAAOH,MAAMC,mBAE/B,MAAO,CACHJ,UAFcM,GAAOT,aAAakuB,GAGlCtrB,WAAYsrB,EAEpB,EACAC,8BAA8BlpF,IAEnB,CACHk7D,UAFcM,GAAOT,aAAa/6D,GAGlC29D,WAAY39D,IAGpBmpF,wBAAuB,CAACxrB,EAAYzC,IACzBM,GAAOkC,gBAAgBC,EAAW1oD,WAAYimD,EAAUjmD,YAEnEm0E,wBAAuB,CAACxpB,EAAWZ,EAAOqqB,EAAIlrF,IACnC8pF,GAAiB9pF,EAAG6gE,EAAOqqB,GAAIvqB,QAAQc,EAAU3qD,YAE5Dq0E,wBAAuB,CAAC7pB,EAAYT,EAAOqqB,EAAIlrF,EAAG+d,IACvC+rE,GAAiB9pF,EAAG6gE,EAAOqqB,GAAI3pB,QAAQD,EAAWxqD,WAAYiH,ICrChEqtE,GAAkBpoG,IAC3B,MAAM0wB,EAAS,EAAsB,GAGrC,OAFAA,EAAO,GAAK1wB,GAAS,EACrB0wB,EAAO,GAAK1wB,EACL0wB,CAAM,EAEjB03E,GAAev1F,MAAQ,EAChB,MAAMw1F,GAAkB1pE,IAC3B,GAAIA,EAAK1iC,OAAS,EACd,MAAMq3B,WAAW,4BACrB,GAAIqL,aAAgBz8B,WAAY,CAC5B,IAAIlC,EAAQ,EAGZ,OAFAA,GAAS2+B,EAAK,IAAM,EACpB3+B,GAAS2+B,EAAK,GACP3+B,CACX,CACA,OAAO2+B,EAAK2B,UAAU,EAAE,EChBrB,SAASgoE,GAAmBxyF,EAAGyyF,GAC7BA,EAAUj+F,SAAYu1F,KAGvB/pF,GACAyyF,EAAU,2BAA2B,GAAmBzyF,EAAEikE,UAAW,UACrEwuB,EAAU,4BAA4B,GAAmBzyF,EAAE0mE,WAAY,WAGvE+rB,EAAU,8BAElB,CACO,SAASC,GAAsB3iG,EAAG0iG,GAChCA,EAAUj+F,SAAYu1F,KAGvBh6F,GACA0iG,EAAU,8BAA8B,GAAmB1iG,EAAEk0E,UAAW,UACxEwuB,EAAU,+BAA+B,GAAmB1iG,EAAE22E,WAAY,WAG1E+rB,EAAU,iCAElB,CAYO,SAASE,GAAsBvvE,EAAIqvE,GACjCA,EAAUj+F,SAAYu1F,IAIvB0I,EADArvE,EACU,+BAA+B,GAAmBA,EAAGpF,WAAY,SAGjE,iCAElB,CACO,SAAS40E,GAAeC,EAAKC,EAAKL,GAChCA,EAAUj+F,SAAYu1F,KAG3B0I,EAAU,kBAAkBI,EAAI9rG,EAAEgsG,eAAeF,EAAI3rF,GAAK,GAAmB2rF,EAAI3rF,EAAG,UACpFurF,EAAU,kBAAkBK,EAAI/rG,EAAEgsG,eAAeD,EAAI5rF,GAAK,GAAmB4rF,EAAI5rF,EAAG,UACxF,CDlCAqrF,GAAex1F,MAAQ,EEpBhB,MAAM,WAA4BtU,MACrCqO,KACA,WAAAS,CAAYrD,EAAU,mBAClBskC,MAAMtkC,GACNzJ,KAAKqM,KAAO,GAAoBA,IACpC,CACA0iD,YAAc,sBAEX,MAAM,WAAmC/wD,MAC5CqO,KACA,WAAAS,CAAYrD,EAAU,2BAClBskC,MAAMtkC,GACNzJ,KAAKqM,KAAO,GAA2BA,IAC3C,CACA0iD,YAAc,8BCAX,MAAMw5C,GACTjsG,EACAgW,MACA0sB,KACA,WAAAlyB,CAAYxQ,EAjBS,GAkBjB0D,KAAK1D,EAAIA,EACT0D,KAAKsS,MAAQ,EAAgB,IAC7BtS,KAAKg/B,KAAO,IAAIc,SAAS9/B,KAAKsS,MAAMxV,OAAQkD,KAAKsS,MAAMgsB,WAAYt+B,KAAKsS,MAAM2rB,YAC9Ej+B,KAAKg/B,KAAK+W,UAAU,EAAGz5C,GAAG,EAC9B,CACA,SAAAksG,GACIxoG,KAAK1D,IAEL0D,KAAKg/B,KAAK+W,UAAU,EAAG/1C,KAAK1D,GAAG,EACnC,CACA,QAAAmsG,GACI,OAAOzoG,KAAKsS,KAChB,CACA,SAAAg2F,GACI,OAAOtoG,KAAK1D,CAChB,CACA,WAAAosG,GACI,GAAI1oG,KAAK1D,EA5BQ,WA6Bb,MAAM,IAAI0B,MA5BA,uEA8BlB,EChCG,MAAM2qG,GAAU,EAAgB,GAChC,MAAMC,GACTnsF,EACAngB,EACA0uC,OACA,WAAAl+B,CAAYk+B,EAAQvuB,OAAI1e,EAAWzB,EAAI,GACnC0D,KAAKgrC,OAASA,EACdhrC,KAAKyc,EAAIA,EACTzc,KAAK1D,EAAI,IAAIisG,GAAMjsG,EACvB,CACA,MAAAusG,GACI,OAAO1hF,QAAQnnB,KAAKyc,EACxB,CACA,aAAAqsF,CAAcnB,EAAIzpB,GACd,IAAKl+E,KAAK6oG,SACN,OAAO3qB,EAEXl+E,KAAK1D,EAAEosG,cACP,MAAMpjG,EAAItF,KAAKgrC,OAAOoyC,QAAQc,EAAWl+E,KAAK1D,EAAEmsG,WAAYd,EAAI3nG,KAAKyc,GAErE,OADAzc,KAAK1D,EAAEksG,YACAljG,CACX,CACA,aAAAyjG,CAAcpB,EAAI5pB,EAAYvjD,GAC1B,IAAKx6B,KAAK6oG,SACN,OAAO9qB,EAEX/9E,KAAK1D,EAAEosG,cACP,MAAMxqB,EAAYl+E,KAAKgrC,OAAOgzC,QAAQD,EAAY/9E,KAAK1D,EAAEmsG,WAAYd,EAAI3nG,KAAKyc,EAAG+d,GAEjF,OADAx6B,KAAK1D,EAAEksG,YACAtqB,CACX,EAEG,MAAM8qB,GACTC,GACAlC,GACApvF,EACAqzB,OACA,WAAAl+B,CAAYk+B,EAAQk+D,GAChBlpG,KAAKgrC,OAASA,EACd,MAAMm+D,EAAoB,GAAqBD,EAAc,SAC7DlpG,KAAK2X,EAuMb,SAA0BqzB,EAAQk+D,GAC9B,GAAIA,EAAaxtG,QAAU,GAAI,CAC3B,MAAMic,EAAI,EAAgB,IAE1B,OADAA,EAAE5M,IAAIm+F,GACCvxF,CACX,CAEI,OAAOqzB,EAAOh/B,KAAKk9F,EAE3B,CAhNiBE,CAAiBp+D,EAAQm+D,GAClCnpG,KAAK+mG,GAAK/mG,KAAK2X,EACf3X,KAAKipG,GAAK,IAAIL,GAAY59D,EAC9B,CACA,MAAAq+D,CAAOrC,GACH,MAAOD,EAAIuC,GAAStpG,KAAKgrC,OAAOu+D,KAAKvpG,KAAK+mG,GAAIC,GAC9ChnG,KAAK+mG,GAAKA,EACV/mG,KAAKipG,GAAK,IAAIL,GAAY5oG,KAAKgrC,OAAQs+D,EAC3C,CACA,OAAAE,CAAQprE,GACJp+B,KAAK2X,EAAI3X,KAAKgrC,OAAOh/B,KAAK,IAAI4vC,GAAe57C,KAAK2X,EAAGymB,GACzD,CACA,cAAAqrE,CAAevrB,GACX,MAAMH,EAAa/9E,KAAKipG,GAAGH,cAAc9oG,KAAK2X,EAAGumE,GAEjD,OADAl+E,KAAKwpG,QAAQzrB,GACNA,CACX,CACA,cAAA2rB,CAAe3rB,GACX,MAAMG,EAAYl+E,KAAKipG,GAAGF,cAAc/oG,KAAK2X,EAAGomE,GAEhD,OADA/9E,KAAKwpG,QAAQzrB,GACNG,CACX,CACA,KAAAx4E,GACI,MAAOikG,EAAQC,GAAU5pG,KAAKgrC,OAAOu+D,KAAKvpG,KAAK+mG,GAAI4B,IACnD,MAAO,CAAC,IAAIC,GAAY5oG,KAAKgrC,OAAQ2+D,GAAS,IAAIf,GAAY5oG,KAAKgrC,OAAQ4+D,GAC/E,EAEG,MAAMC,GACTC,GACAv0F,EACAjQ,EACAykG,GACApxE,GACAqxE,UACAh/D,OACA,WAAAl+B,CAAY9B,GACR,MAAM,OAAEggC,EAAM,aAAEk+D,EAAY,SAAEe,EAAQ,UAAED,EAAS,EAAEz0F,EAAC,EAAEjQ,EAAC,GAAEykG,EAAE,GAAEpxE,GAAO3tB,EACpEhL,KAAKgrC,OAASA,EACdhrC,KAAK8pG,GAAK,IAAId,GAAeh+D,EAAQk+D,GACrClpG,KAAK8pG,GAAGN,QAAQS,GAChBjqG,KAAKgqG,UAAYA,EACjBhqG,KAAKuV,EAAIA,EACTvV,KAAKsF,EAAIA,EACTtF,KAAK+pG,GAAKA,EACV/pG,KAAK24B,GAAKA,CACd,CACA,MAAAuxE,GACI,GAAIlqG,KAAKsF,EACL,MAAM,IAAItH,MAAM,oCAEpB,MAAMsH,EAAItF,KAAKgrC,OAAOm/D,kBAGtB,OAFAnqG,KAAK8pG,GAAGN,QAAQlkG,EAAEk0E,WAClBx5E,KAAKsF,EAAIA,EACFA,EAAEk0E,SACb,CACA,MAAA4wB,GACI,IAAKpqG,KAAKuV,EACN,MAAM,IAAIvX,MAAM,6BAEpB,OAAOgC,KAAK8pG,GAAGL,eAAezpG,KAAKuV,EAAEikE,UACzC,CACA,OAAA6wB,GACI,IAAKrqG,KAAKsF,EACN,MAAM,IAAItH,MAAM,gCAEpB,IAAKgC,KAAK24B,GACN,MAAM,IAAI36B,MAAM,0CAEpBgC,KAAK8pG,GAAGT,OAAOrpG,KAAKgrC,OAAOs/D,GAAGtqG,KAAKsF,EAAGtF,KAAK24B,IAC/C,CACA,OAAA4xE,GACI,GAAIvqG,KAAKgqG,UAAW,CAChB,IAAKhqG,KAAKsF,EACN,MAAM,IAAItH,MAAM,gCAEpB,IAAKgC,KAAK+pG,GACN,MAAM,IAAI/rG,MAAM,uCAEpBgC,KAAK8pG,GAAGT,OAAOrpG,KAAKgrC,OAAOs/D,GAAGtqG,KAAKsF,EAAGtF,KAAK+pG,IAC/C,KACK,CACD,IAAK/pG,KAAKuV,EACN,MAAM,IAAIvX,MAAM,6BAEpB,IAAKgC,KAAK24B,GACN,MAAM,IAAI36B,MAAM,0CAEpBgC,KAAK8pG,GAAGT,OAAOrpG,KAAKgrC,OAAOs/D,GAAGtqG,KAAKuV,EAAGvV,KAAK24B,IAC/C,CACJ,CACA,OAAA6xE,GACI,GAAIxqG,KAAKgqG,UAAW,CAChB,IAAKhqG,KAAKuV,EACN,MAAM,IAAIvX,MAAM,6BAEpB,IAAKgC,KAAK24B,GACN,MAAM,IAAI36B,MAAM,0CAEpBgC,KAAK8pG,GAAGT,OAAOrpG,KAAKgrC,OAAOs/D,GAAGtqG,KAAKuV,EAAGvV,KAAK24B,IAC/C,KACK,CACD,IAAK34B,KAAKsF,EACN,MAAM,IAAItH,MAAM,gCAEpB,IAAKgC,KAAK+pG,GACN,MAAM,IAAI/rG,MAAM,uCAEpBgC,KAAK8pG,GAAGT,OAAOrpG,KAAKgrC,OAAOs/D,GAAGtqG,KAAKsF,EAAGtF,KAAK+pG,IAC/C,CACJ,CACA,KAAAU,CAAMhhG,EAAS9N,EAAS,GACpB,GAAIqE,KAAK24B,GACL,MAAM,IAAI36B,MAAM,8CAEpB,GAAIyL,EAAQw0B,WAAatiC,EAAS,GAC9B,MAAM,IAAIqC,MAAM,8BAEpBgC,KAAK24B,GAAKlvB,EAAQ+yC,QAAQ7gD,EAAQA,EAAS,IAC3CqE,KAAK8pG,GAAGN,QAAQxpG,KAAK24B,GACzB,CACA,KAAA+xE,CAAMjhG,EAAS9N,EAAS,GACpB,GAAIqE,KAAK+pG,GACL,MAAM,IAAI/rG,MAAM,2CAEpB,MAAM2sG,EAAe,IAAM3qG,KAAK8pG,GAAGb,GAAGJ,SAAW,GAAK,GACtD,GAAIp/F,EAAQw0B,WAAatiC,EAASgvG,EAC9B,MAAM,IAAI3sG,MAAM,8BAEpB,MAAM4sG,EAAOnhG,EAAQ+yC,QAAQ7gD,EAAQA,EAASgvG,GAE9C,OADA3qG,KAAK+pG,GAAK/pG,KAAK8pG,GAAGJ,eAAekB,GAC1BD,CACX,CACA,MAAAE,GACI7qG,KAAKqqG,SACT,CACA,MAAAS,GACI9qG,KAAKuqG,SACT,CACA,MAAAQ,GACI/qG,KAAKwqG,SACT,EAKG,MAAMQ,WAAyBnB,GAElC,aAAAoB,CAAc16D,GACV,OAAO,IAAIqL,GAAe57C,KAAKkqG,SAAUlqG,KAAK8pG,GAAGL,eAAel5D,GACpE,CAEA,aAAA26D,CAAc36D,GACV,MAAMjrC,EAAItF,KAAKkqG,SACflqG,KAAKqqG,UACL,MAAMc,EAAOnrG,KAAKoqG,SAElB,OADApqG,KAAKuqG,UACE,IAAI3uD,GAAet2C,EAAG6lG,EAAMnrG,KAAK8pG,GAAGL,eAAel5D,GAC9D,CAEA,aAAA66D,CAAc76D,GACV,MAAM46D,EAAOnrG,KAAKoqG,SAElB,OADApqG,KAAKwqG,UACE,IAAI5uD,GAAeuvD,EAAMnrG,KAAK8pG,GAAGL,eAAel5D,GAC3D,CAEA,YAAA86D,CAAa5hG,GACT,IAEI,OADAzJ,KAAKyqG,MAAMhhG,GACJzJ,KAAK8pG,GAAGJ,eAAejgG,EAAQ+yC,QAAQ,IAClD,CACA,MAAOl3C,GACH,MAAM,IAAI,GAA2B,sCAAsCA,EAAEmE,UACjF,CACJ,CAEA,YAAA6hG,CAAa7hG,GACT,IACIzJ,KAAKyqG,MAAMhhG,GACXzJ,KAAK6qG,SACL,MAAMU,EAAWvrG,KAAK0qG,MAAMjhG,EAAS,IAErC,OADAzJ,KAAK8qG,SACE9qG,KAAK8pG,GAAGJ,eAAejgG,EAAQ+yC,QAAQ,GAAK+uD,GACvD,CACA,MAAOjmG,GACH,MAAM,IAAI,GAA2B,sCAAsCA,EAAEmE,UACjF,CACJ,CAEA,YAAA+hG,CAAa/hG,GACT,IACI,MAAM8hG,EAAWvrG,KAAK0qG,MAAMjhG,GAE5B,OADAzJ,KAAK+qG,SACE/qG,KAAK8pG,GAAGJ,eAAejgG,EAAQ+yC,QAAQ+uD,GAClD,CACA,MAAOjmG,GACH,MAAM,IAAI,GAA2B,sCAAsCA,EAAEmE,UACjF,CACJ,EC7OG,IAAIgiG,GAgDAC,GChDJ3gE,eAAe4gE,GAAuB1vB,EAAY2vB,EAAiB75E,GACtE,MAAM85E,QAAoB5vB,EAAW/4E,KAAK4oG,GAAoBF,IAC9D,OAAOF,GAAsB7uG,OAAO,CAChCkvG,YAAa9vB,EAAW+C,OAAO1sE,MAC/Bu5F,cACA95E,cAER,CACOgZ,eAAeihE,GAAuBC,EAAcC,EAAiBC,GACxE,IACI,MAAM57D,EAAUm7D,GAAsB9tG,OAAOquG,GAC7C,GAAIE,EAAmB,CACnB,MAAMC,EAAyBD,EAAkB54E,WACjD,IAAK,GAAO64E,EAAwB77D,EAAQw7D,aACxC,MAAM,IAAI/tG,MAAM,wBAAwB,GAASuyC,EAAQw7D,YAAa,sDAAsD,GAASK,EAAwB,SAErK,CACA,IAAKF,EACD,MAAM,IAAIluG,MAAM,gCAEpB,MAAMquG,EAAmBP,GAAoBI,GACvC1yB,EAAY,GAAmBjpC,EAAQw7D,aAC7C,UAAYvyB,EAAUtuD,OAAOmhF,EAAkB97D,EAAQs7D,aACnD,MAAM,IAAI7tG,MAAM,6BAEpB,OAAOuyC,CACX,CACA,MAAOjrC,GACH,MAAM,IAAI,GAAoBA,EAAEmE,QACpC,CACJ,CACO,SAASqiG,GAAoBtyB,GAChC,MAAM5zE,EAAS,GAAqB,4BACpC,OAAI4zE,aAAqB73E,WACd,GAAiB,CAACiE,EAAQ4zE,GAAY5zE,EAAOlK,OAAS89E,EAAU99E,SAE3E89E,EAAUx9B,QAAQp2C,GACX4zE,EACX,EDrCA,SAAWiyB,GACP,IAAI37D,EACJ27D,EAAgBrmE,MAAQ,KACN,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,KAI9B,IAH6B,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAE4B,MAA9B1tB,EAAImgG,uBACJ,IAAK,MAAM7sG,KAAS0M,EAAImgG,uBACpBx2F,EAAE0d,OAAO,IACT1d,EAAExD,MAAM7S,IAGa,IAAzB4lC,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,KACR,MAAMyQ,EAAM,CACRmgG,uBAAwB,IAEtBtvG,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACX8c,IAAQ,GACP,EACDnkC,EAAImgG,uBAAuBhvG,KAAK0tB,EAAO1Y,SAIvC0Y,EAAOiJ,SAAe,EAANqc,EAI5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEX27D,EAAgB5uG,OAAUsP,GACf6hC,GAAc7hC,EAAKs/F,EAAgBrmE,SAE9CqmE,EAAgB7tG,OAAU2E,GACf4iC,EAAc5iC,EAAKkpG,EAAgBrmE,QAEjD,CA9CD,CA8CGqmE,KAAoBA,GAAkB,CAAC,IAE1C,SAAWC,GACP,IAAI57D,EACJ47D,EAAsBtmE,MAAQ,KACZ,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,MACD,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEkB,MAAnB1tB,EAAI4/F,aAAuB5/F,EAAI4/F,YAAY9tE,WAAa,IACzDnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAI4/F,cAEQ,MAAnB5/F,EAAI0/F,aAAuB1/F,EAAI0/F,YAAY5tE,WAAa,IACzDnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAI0/F,cAEM,MAAlB1/F,EAAI4lB,aACJjc,EAAE0d,OAAO,IACTi4E,GAAgBrmE,QAAQvoC,OAAOsP,EAAI4lB,WAAYjc,KAEtB,IAAzBuvB,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,KACR,MAAMyQ,EAAM,CACR4/F,YAAa,EAAgB,GAC7BF,YAAa,EAAgB,IAE3B7uG,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,OAAQ8c,IAAQ,GACZ,KAAK,EACDnkC,EAAI4/F,YAAc/gF,EAAO1Y,QACzB,MAEJ,KAAK,EACDnG,EAAI0/F,YAAc7gF,EAAO1Y,QACzB,MAEJ,KAAK,EACDnG,EAAI4lB,WAAa05E,GAAgBrmE,QAAQxnC,OAAOotB,EAAQA,EAAOwI,UAC/D,MAEJ,QACIxI,EAAOiJ,SAAe,EAANqc,GAI5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEX47D,EAAsB7uG,OAAUsP,GACrB6hC,GAAc7hC,EAAKu/F,EAAsBtmE,SAEpDsmE,EAAsB9tG,OAAU2E,GACrB4iC,EAAc5iC,EAAKmpG,EAAsBtmE,QAEvD,CA7DD,CA6DGsmE,KAA0BA,GAAwB,CAAC,IEtG/C,MAAMa,GACT9mD,SAAW,SACXza,OACAi/D,SACAuC,UACAz6E,WACA06E,QACAxoD,WACA,WAAAn3C,CAAYm3C,EAAYj5C,EAAO,CAAC,GAC5B,MAAM,eAAE0hG,EAAc,WAAE36E,EAAU,OAAEiZ,EAAM,cAAE2hE,GAAkB3hG,GACxD,QAAEyhG,GAAYxoD,EACpBjkD,KAAKikD,WAAaA,EAClB,MAAM2oD,EAAU5hE,GAAU47D,GAC1B5mG,KAAKgrC,OC5BN,SAAoBA,GACvB,MAAO,CACHm/D,gBAAiBn/D,EAAOs8D,sBACxBgD,GAAI,CAACuC,EAASrzB,IAAcxuC,EAAOy8D,wBAAwBoF,EAAQ5wB,WAAYzC,GAAWjmD,SAAS,EAAG,IACtG6pD,QAASpyC,EAAO08D,wBAChB1pB,QAAShzC,EAAO48D,wBAChB57F,KAAMg/B,EAAO67D,WACb0C,KAAMv+D,EAAO87D,QAErB,CDmBsBgG,CAAWF,GACzB5sG,KAAK+xB,WAAaA,EAClB/xB,KAAKysG,QAAUA,EE9BhB,SAAyBA,GAC5B,MAAO,CACHM,qBAAsBN,EAAQO,gBAAgB,2CAA4C,CACtFC,KAAM,iDAEVC,kBAAmBT,EAAQO,gBAAgB,uCAAwC,CAC/EC,KAAM,6CAEVE,iBAAkBV,EAAQO,gBAAgB,uCAAwC,CAC9EC,KAAM,wDAEVG,iBAAkBX,EAAQO,gBAAgB,uCAAwC,CAC9EC,KAAM,2CAEVI,cAAeZ,EAAQO,gBAAgB,oCAAqC,CACxEC,KAAM,wCAGlB,CFYiCK,CAAgBb,QAAW1uG,EAGhDiC,KAAKwsG,UAFLE,EAEiBE,EAAQpF,8BAA8BkF,GAGtCE,EAAQtF,wBAE7BtnG,KAAKiqG,SAAW0C,GAAiB,EAAgB,EACrD,CACA,CAAC3+F,OAAO80B,aAAe,0BACvB,CAACi6D,IAAuB,CACpB,gCACA,2BAEJ,oBAAMwQ,IAAkB9sG,GACpB,MAAM,UAAE+sG,EAAS,WAAErqD,EAAU,WAAEqC,GAAexlD,KAAKytG,UAAUhtG,GACvDitG,EAAoB3O,GAAS57C,EAAY,CAC3C9E,cAAewpD,GACf7oD,cAAe8oD,GACf5oD,cAAemgD,KAEnB,IAAKmO,EAAUvxB,WACX,MAAM,IAAI,GAAU,4CAA6C,sBAErE,MAAMA,QAAmB,GAAoBuxB,EAAUvxB,YACjDkwB,EAAoB3mD,GAAYg0B,UAChCm0B,QAAkB3tG,KAAK4tG,0BAA0BF,EAAmBzxB,EAAYkwB,GAChFl8C,QAAajwD,KAAK6tG,uBAAuBH,EAAmBC,GAGlE,OAFAxqD,EAAW3kD,OAASyxD,EAAKzxD,OACzB2kD,EAAWlB,KAAOgO,EAAKhO,KAChB,CACHgO,KAAM9M,EACN2qD,iBAAkBH,EAAUp9D,QAAQxe,WACpCyzB,iBAAkBy4C,GAAe0P,EAAUp9D,QAAQw7D,aAE3D,CACA,mBAAMgC,IAAiBttG,GACnB,MAAM,UAAE+sG,EAAS,WAAErqD,EAAU,WAAEqC,GAAexlD,KAAKytG,UAAUhtG,GACvDitG,EAAoB3O,GAAS57C,EAAY,CAC3C9E,cAAewpD,GACf7oD,cAAe8oD,GACf5oD,cAAemgD,KAEnB,IAAKmO,EAAUvxB,WACX,MAAM,IAAI,GAAU,4CAA6C,sBAErE,MAAMA,QAAmB,GAAoBuxB,EAAUvxB,YACjDkwB,EAAoB3mD,GAAYg0B,UAChCm0B,QAAkB3tG,KAAKguG,0BAA0BN,EAAmBzxB,EAAYkwB,GAChFl8C,QAAajwD,KAAK6tG,uBAAuBH,EAAmBC,GAGlE,OAFAxqD,EAAW3kD,OAASyxD,EAAKzxD,OACzB2kD,EAAWlB,KAAOgO,EAAKhO,KAChB,CACHgO,KAAM9M,EACN2qD,iBAAkBH,EAAUp9D,QAAQxe,WACpCyzB,iBAAkBy4C,GAAe0P,EAAUp9D,QAAQw7D,aAE3D,CAIA,+BAAM6B,CAA0BzqD,EAEhC84B,EAAYkwB,GACR,IAAIh+F,EACJ,IACIA,QG9FL48B,eAAyC//B,GAC5C,MAAM,IAAEpM,EAAG,WAAEukD,EAAU,OAAEnY,EAAM,WAAEixC,EAAU,SAAEguB,EAAQ,EAAE10F,EAAC,kBAAE42F,EAAiB,WAAEp6E,GAAe/mB,EACtFulC,QAAgBo7D,GAAuB1vB,EAAY1mE,EAAEikE,UAAWznD,GAChEk8E,EAAK,IAAIjD,GAAiB,CAC5BhgE,SACAk+D,aAAc,mCACdc,WAAW,EACXC,WACA10F,MAEJwyF,GAAmBkG,EAAG14F,EAAG3W,GACzBA,EAAIsvG,MAAM,6DACJ/qD,EAAWz8C,MAAMunG,EAAGhD,cAActC,KACxC/pG,EAAIsvG,MAAM,uDACVjG,GAAsBgG,EAAG3oG,EAAG1G,GAC5BA,EAAIsvG,MAAM,0EACV,MAAMhwB,EAAY+vB,EAAG3C,mBAAmBnoD,EAAW18C,QTOhD,IAA4BsjG,EAAI/B,ESNnCppG,EAAIsvG,MAAM,6CACVhG,GAAsB+F,EAAGt1E,GAAI/5B,GTKEmrG,ESJZkE,EAAGlE,ITIa/B,ESJTppG,GTKXmL,SAAYu1F,IAIvB0I,EADA+B,EACU,4BAA4B,GAAmBA,EAAGx2E,WAAY,SAG9D,qCSXd30B,EAAIsvG,MAAM,kDACV,MAAMC,QAAwBnC,GAAuB9tB,EAAW+vB,EAAGlE,GAAIoC,GACvEvtG,EAAIsvG,MAAM,gCACVtvG,EAAIsvG,MAAM,8DACJ/qD,EAAWz8C,MAAMunG,EAAG7C,cAAc76D,IACxC3xC,EAAIsvG,MAAM,yDACV,MAAO9F,EAAKC,GAAO4F,EAAGnE,GAAGpkG,QAEzB,OADAyiG,GAAeC,EAAKC,EAAKzpG,GAClB,CACH2xC,QAAS49D,EACT/wB,QAAUc,GAAckqB,EAAIU,cAAcH,GAASzqB,GACnDF,QAAS,CAACD,EAAYvjD,IAAQ6tE,EAAIU,cAAcJ,GAAS5qB,EAAYvjD,GAE7E,CH6D2BozE,CAA0B,CACrCzqD,aACA84B,aACAkwB,oBACAvtG,IAAKoB,KAAKikD,WAAWxJ,OAAO2zD,aAAa,4BACzCpjE,OAAQhrC,KAAKgrC,OACbi/D,SAAUjqG,KAAKiqG,SACf10F,EAAGvV,KAAKwsG,UACRz6E,WAAY/xB,KAAK+xB,aAErB/xB,KAAKysG,SAASM,qBAAqBvE,WACvC,CACA,MAAOljG,GAEH,MADAtF,KAAKysG,SAASS,kBAAkB1E,YAC1BljG,CACV,CACA,OAAO6I,CACX,CAIA,+BAAM6/F,CAA0B7qD,EAEhC84B,EAAYkwB,GACR,IAAIh+F,EACJ,IACIA,QGtFL48B,eAAyC//B,GAC5C,MAAM,IAAEpM,EAAG,WAAEukD,EAAU,OAAEnY,EAAM,WAAEixC,EAAU,SAAEguB,EAAQ,EAAE10F,EAAC,kBAAE42F,EAAiB,WAAEp6E,GAAe/mB,EACtFulC,QAAgBo7D,GAAuB1vB,EAAY1mE,EAAEikE,UAAWznD,GAChEk8E,EAAK,IAAIjD,GAAiB,CAC5BhgE,SACAk+D,aAAc,mCACdc,WAAW,EACXC,WACA10F,MAEJwyF,GAAmBkG,EAAG14F,EAAG3W,GACzBA,EAAIsvG,MAAM,yDACVD,EAAG5C,mBAAmBloD,EAAW18C,QACjC7H,EAAIsvG,MAAM,+CACVhG,GAAsB+F,EAAGt1E,GAAI/5B,GAC7BA,EAAIsvG,MAAM,2FACJ/qD,EAAWz8C,MAAMunG,EAAG/C,cAAc36D,IACxC3xC,EAAIsvG,MAAM,8EACVjG,GAAsBgG,EAAG3oG,EAAG1G,GAC5BA,EAAIsvG,MAAM,8DACV,MAAMhwB,EAAY+vB,EAAGzC,mBAAmBroD,EAAW18C,QACnD7H,EAAIsvG,MAAM,iEACV,MAAMC,QAAwBnC,GAAuB9tB,EAAW+vB,EAAGlE,GAAIoC,IAChE/D,EAAKC,GAAO4F,EAAGnE,GAAGpkG,QAEzB,OADAyiG,GAAeC,EAAKC,EAAKzpG,GAClB,CACH2xC,QAAS49D,EACT/wB,QAAUc,GAAcmqB,EAAIS,cAAcH,GAASzqB,GACnDF,QAAS,CAACD,EAAYvjD,IAAQ4tE,EAAIW,cAAcJ,GAAS5qB,EAAYvjD,GAE7E,CHwD2BwzE,CAA0B,CACrC7qD,aACA84B,aACAkwB,oBACAvtG,IAAKoB,KAAKikD,WAAWxJ,OAAO2zD,aAAa,4BACzCpjE,OAAQhrC,KAAKgrC,OACbi/D,SAAUjqG,KAAKiqG,SACf10F,EAAGvV,KAAKwsG,UACRz6E,WAAY/xB,KAAK+xB,aAErB/xB,KAAKysG,SAASM,qBAAqBvE,WACvC,CACA,MAAOljG,GAEH,MADAtF,KAAKysG,SAASS,kBAAkB1E,YAC1BljG,CACV,CACA,OAAO6I,CACX,CACA,4BAAM0/F,CAAuB1qD,EAAYwqD,GAErC,MAAOU,EAAQC,GI3IhB,WACH,MAAMj0E,EAAIilD,KACJjiF,EAAIiiF,KACV,MAAO,CACH,CACI9gF,OAAQ67B,EAAE77B,OACVyjD,KAAM5kD,EAAE4kD,MAEZ,CACIzjD,OAAQnB,EAAEmB,OACVyjD,KAAM5nB,EAAE4nB,MAGpB,CJ8H+BssD,GACjBC,EAAUrrD,EAAWy7C,SAQ3B,aAPMj9C,GAAK0sD,EK5IZ,SAAuBV,EAAWlB,GACrC,OAAO1hE,gBAAiBvsC,GACpB,UAAW,MAAMrB,KAASqB,EACtB,IAAK,IAAI5B,EAAI,EAAGA,EAAIO,EAAMzB,OAAQkB,GrBPQyiG,MqBOqC,CAC3E,IAIIjhE,EAJAphC,EAAMJ,ErBR4ByiG,MqBSlCriG,EAAMG,EAAMzB,SACZsB,EAAMG,EAAMzB,QAIZ0iC,EADAjhC,aAAiBwE,WACVgsG,EAAUvwB,QAAQjgF,EAAMo2B,SAAS32B,EAAGI,IAGpC2wG,EAAUvwB,QAAQjgF,EAAMq/C,QAAQ5/C,EAAGI,IAE9CyvG,GAASU,iBAAiB3E,kBACpB,IAAI5sD,GAAeisD,GAAezpE,EAAKH,YAAaG,EAC9D,CAER,CACJ,CLyHQqwE,CAAcd,EAAW3tG,KAAKysG,SAC9B+B,GACChwG,GAAW,GAAOA,EAAQ,CAAEwgD,cAAe8oD,MKzH7C,SAAuB6F,EAAWlB,GACrC,OAAO1hE,gBAAiBvsC,GACpB,UAAW,MAAMrB,KAASqB,EACtB,IAAK,IAAI5B,EAAI,EAAGA,EAAIO,EAAMzB,OAAQkB,GAAKyiG,GAA4B,CAC/D,IAAIriG,EAAMJ,EAAIyiG,GAId,GAHIriG,EAAMG,EAAMzB,SACZsB,EAAMG,EAAMzB,QAEZsB,EAhCM,GAgCoBJ,EAC1B,MAAM,IAAIoB,MAAM,iBAEpB,MAAMk1F,EAAY/1F,EAAMq/C,QAAQ5/C,EAAGI,GAK7Bw9B,EAAMr9B,EAAMo2B,SAAS32B,EAAGI,EAxCpB,IAyCV,IACI,MAAMkhF,EAAYyvB,EAAU3vB,QAAQkV,EAAW14D,GAC/CiyE,GAASW,iBAAiB5E,kBACpBtqB,CACV,CACA,MAAO54E,GAEH,MADAmnG,GAASY,cAAc7E,YACjBljG,CACV,CACJ,CAER,CACJ,CL6FQopG,CAAcf,EAAW3tG,KAAKysG,SAC9B4B,GAEOC,CACX,CAOA,SAAAb,CAAUhtG,GAEN,OAAIq0D,GAASr0D,EAAK,IACP,CACH+sG,UAAW/sG,EAAK,GAChB0iD,WAAY1iD,EAAK,GACjB+kD,WAAY/kD,EAAK,IAOd,CACH+sG,UAAWxtG,KAAKikD,WAAWH,OAC3BX,WAAY1iD,EAAK,GACjB+kD,WAAY/kD,EAAK,GAG7B,EMjLG,SAASkuG,GAAM3jG,EAAO,CAAC,GAC1B,OAAQi5C,GAAe,IAAIsoD,GAAMtoD,EAAYj5C,EACjD,CCeO,MAAM4jG,GAAsB5gG,OAAOw+B,IAAI,0BCfjCqiE,GAAO,GAAK,QACZC,GAAO,GAAK,QACZC,GAAU,GAAK,WACfC,GAAM,GAAG,GAAK,OAAQD,GAASF,GAAMC,IACrCG,GAAK,GAAG,GAAK,OAAQ,GAAK,QAC1BC,GAAM,GAAGC,GAAIF,GAAI,GAAK,QAASE,GAAIH,GAAK,GAAK,SAC7CI,GAAMD,GAAIF,GAAI,GAAK,QACnBI,GAAMF,GAAIC,GAAK,GAAK,QACpBE,GAAOH,GAAIC,GAAK,GAAK,SACrBG,GAASJ,GAAIC,GAAK,GAAK,YAC9BI,GAAc,GAAGL,GAAID,GAAK,GAAK,OAAQC,GAAIH,GAAK,GAAK,QAC9CS,GAAa,GAAGN,GAAIK,GAAa,GAAK,QAASA,IACtDE,GAAoB,GAAGP,GAAID,GAAK,GAAK,QAASC,GAAIH,GAAK,GAAK,QAASG,GAAID,GAAK,GAAK,OAAQ,GAAK,OAAQC,GAAIH,GAAK,GAAK,OAAQ,GAAK,QAC5HW,GAAmB,GAAGR,GAAIO,GAAmB,GAAK,QAASA,IAC3DE,GAAO,GAAGT,GAAID,GAAK,GAAK,SAAUC,GAAIF,GAAI,GAAK,SAAUE,GAAIH,GAAK,GAAK,UACvEa,GAAQ,GAAGV,GAAID,GAAK,GAAK,UAAWC,GAAIF,GAAI,GAAK,UAAWE,GAAIH,GAAK,GAAK,WACjFc,GAAgBX,GAAIC,GAAK,GAAK,iBAAkB,GAAK,aAC9CW,GAAe,GAAGZ,GAAIW,GAAe,GAAK,QAASA,IAC1DE,GAAgBb,GAAII,GAAQ,GAAK,gBAAiB,GAAK,YAAa,GAAK,aAClEU,GAAe,GAAGd,GAAIa,GAAe,GAAK,QAASA,IAInDE,GAAgB,GAAGf,GAAIM,GAAY,GAAK,mBAAoB,GAAK,QAASN,GAAIQ,GAAkB,GAAK,mBAAoB,GAAK,QAASR,GAAIM,GAAY,GAAK,oBAAqBN,GAAIQ,GAAkB,GAAK,qBAK5MQ,IAJgB,GAAGhB,GAAIM,GAAY,GAAK,sBAAuB,GAAK,QAASN,GAAIQ,GAAkB,GAAK,sBAAuB,GAAK,QAASR,GAAIM,GAAY,GAAK,uBAAwBN,GAAIQ,GAAkB,GAAK,wBAInM,GAAGR,GAAIS,GAAM,GAAK,qBAAsB,GAAK,QAAST,GAAIU,GAAO,GAAK,qBAAsB,GAAK,QAASV,GAAIS,GAAM,GAAK,sBAAuBT,GAAIU,GAAO,GAAK,wBAClLO,GAAW,GAAGZ,GAAaE,GAAmBE,GAAMC,GAAOK,GAAeC,GAAiBjB,GAAKG,GAAKC,GAAMN,GAAKe,GAAcE,IAGrII,IADkB,GAAGlB,GAAIiB,GAAU,GAAK,gBAAiB,GAAK,QAASjB,GAAIiB,GAAU,GAAK,kBACnF,GAAGjB,GAAIiB,GAAU,GAAK,QAASF,GAAeC,GAAiBJ,GAAcE,GAAc,GAAK,SACvGK,GAAW,GAAGnB,GAAIkB,GAAM,GAAK,eAAgBA,IAAOlB,GAAIkB,GAAM,GAAK,gBAAiBlB,GAAI,GAAK,eAAgBkB,IAAOlB,GAAIiB,GAAU,GAAK,gBAAiBjB,GAAI,GAAK,eAAgBiB,IAAW,GAAK,gBACjMG,GAAmB,IAAM,GAAGpB,GAAImB,GAAUC,IAAmBD,IACtDE,GAAUD,KACVE,GAAM,GAAGtB,GAAIqB,GAASH,GAAMG,IAAUrB,GAAIkB,GAAMG,IAAUrB,GAAIqB,GAASH,IAAOG,GAASH,IAMpG,SAASK,GAAoBC,GAkBzB,OAjBA,SAAiBt2E,GACb,IAAIu2E,EACJ,IACIA,EAAK,GAAUv2E,EACnB,CACA,MAAOp+B,GACH,OAAO,CACX,CACA,MAAM0rC,EAAMgpE,EAAaC,EAAGx1C,cAC5B,OAAY,OAARzzB,KAGQ,IAARA,IAAwB,IAARA,EACTA,EAEW,IAAfA,EAAIjsC,OACf,CAEJ,CACA,SAASyzG,MAAO1uG,GACZ,SAASkwG,EAAat2E,GAClB,GAAIA,EAAE3+B,OAAS+E,EAAK/E,OAChB,OAAO,KAEX,IAAIisC,EAAMtN,EAaV,OAZA55B,EAAKsjD,MAAM4oB,IACPhlC,EAAqB,mBAARglC,EACPA,IAAMgkC,aAAat2E,GACnBsyC,EAAIgkC,aAAat2E,GACnB7+B,MAAM+Y,QAAQozB,KACdtN,EAAIsN,GAEI,OAARA,KAKDA,CACX,CACA,MAAO,CACHlpC,SAAU,WAAc,MAAO,KAAOgC,EAAK/C,KAAK,KAAO,IAAM,EAC7DoV,MAAOrS,EACPowG,QAASH,GAAoBC,GAC7BA,eAER,CACA,SAAS,MAAMlwG,GACX,SAASkwG,EAAat2E,GAClB,IAAIsN,EAAM,KAWV,OAVAlnC,EAAKsjD,MAAM4oB,IACP,MAAM5tC,EAAqB,mBAAR4tC,EACbA,IAAMgkC,aAAat2E,GACnBsyC,EAAIgkC,aAAat2E,GACvB,OAAW,MAAP0E,IACA4I,EAAM5I,GACC,EAEC,IAET4I,CACX,CAOA,MANe,CACXlpC,SAAU,WAAc,MAAO,KAAOgC,EAAK/C,KAAK,KAAO,IAAM,EAC7DoV,MAAOrS,EACPowG,QAASH,GAAoBC,GAC7BA,eAGR,CACA,SAAS,GAAKr0G,GACV,MAAMuP,EAAOvP,EAwBb,MAAO,CACHmC,SAAU,WAAc,OAAOoN,CAAM,EACrCglG,QAzBJ,SAAiBx2E,GACb,IAAIu2E,EACJ,IACIA,EAAK,GAAUv2E,EACnB,CACA,MAAOp+B,GACH,OAAO,CACX,CACA,MAAM60G,EAASF,EAAGx1C,aAClB,OAAsB,IAAlB01C,EAAOp1G,QAAgBo1G,EAAO,KAAOjlG,CAI7C,EAaI8kG,aAZJ,SAAsBz1C,GAClB,OAAsB,IAAlBA,EAAOx/D,OACA,KAEPw/D,EAAO,KAAOrvD,EACPqvD,EAAOz9D,MAAM,GAEjB,IACX,EAMJ,CAxGsB,GAAG0xG,GAAIqB,GAAS,GAAK,UAAW,GAAK,QAASrB,GAAIqB,GAAS,GAAK,WAAYrB,GAAIiB,GAAU,GAAK,UAAW,GAAK,QAASjB,GAAIiB,GAAU,GAAK,WAAY,GAAK,WCElL,MAAMW,WAAkBrjD,GACpBqB,WAAa,YACbnwD,IACAgsD,MACAnO,KACAsP,QACA9H,WACA+sD,MACA,WAAAlkG,CAAYm3C,EAAYljD,EAAU,CAAE07C,KAAM,KACtC,GAAoB,MAAhB17C,EAAQ07C,MAAwC,IAAxB17C,EAAQ07C,KAAK/gD,OACrC,MAAM,IAAIsC,MAAM,+CAEpB+vC,QACA/tC,KAAKikD,WAAaA,EAClBjkD,KAAKpB,IAAMqlD,EAAWxJ,OAAO2zD,aAAa,oBAC1CpuG,KAAK+rD,QAAUhrD,EAAQgrD,SAnBa,IAoBpC/rD,KAAKy8C,KAAO,GACZ,IAAK,MAAMw0D,KAAalwG,EAAQ07C,KAAM,CAClC,IAAKg0D,GAAII,QAAQI,GAAY,CACzBjxG,KAAKpB,IAAI8I,MAAM,qBACf,QACJ,CACA,MAAMkpG,EAAK,GAAUK,GACfpuD,EAAY+tD,EAAGn1C,YACrB,GAAiB,MAAb5Y,EAAmB,CACnB7iD,KAAKpB,IAAI8I,MAAM,+CACf,QACJ,CACA,MAAMwpG,EAAW,CACb5vF,GAAIi8E,GAAiB16C,GACrBsuD,WAAY,CAACP,IAEjB5wG,KAAKy8C,KAAKn/C,KAAK4zG,EACnB,CACAlxG,KAAKgxG,MAAQjwG,CACjB,CACA,CAAC6tG,IAAuB5uG,KACxB,CAACgO,OAAO80B,aAAe,oBACvB,CAACi6D,IAAuB,CACpB,0BAEJ,SAAAnwC,GACI,OAAOzlC,QAAQnnB,KAAK4qD,MACxB,CAIA,KAAA7tD,GACQiD,KAAK4sD,cAGT5sD,KAAKpB,IAAI,mEAAoEoB,KAAK+rD,SAClF/rD,KAAK4qD,MAAQn1B,YAAW,KACfz1B,KAAKoxG,0BACLvjG,OAAM5R,IACP+D,KAAKpB,IAAI8I,MAAMzL,EAAI,GACrB,GACH+D,KAAK+rD,SACZ,CAIA,6BAAMqlD,GACF,GAAkB,MAAdpxG,KAAK4qD,MAGT,IAAK,MAAMsmD,KAAYlxG,KAAKy8C,KAAM,CAU9B,SATMz8C,KAAKikD,WAAWK,UAAUhoC,MAAM40F,EAAS5vF,GAAI,CAC/CyjC,KAAM,CACF,CAAC/kD,KAAKgxG,MAAMp+C,SA5EG,aA4EqC,CAChDnzD,MAAOO,KAAKgxG,MAAMK,UA5EN,GA6EZC,IAAKtxG,KAAKgxG,MAAMO,QA5EN,SAiFJ,MAAdvxG,KAAK4qD,MACL,OAEJ5qD,KAAK6tD,kBAAkB,OAAQ,CAAElK,OAAQutD,GAC7C,CACJ,CAIA,IAAAzjG,GACsB,MAAdzN,KAAK4qD,OACLD,aAAa3qD,KAAK4qD,OAEtB5qD,KAAK4qD,WAAQ7sD,CACjB,ECrIG,MAIMyzG,GAAoC7vG,WAAWk5B,KAAK,CAAC,EAAG,ICC9D,IAAI,IACX,SAAW42E,GACP,IAAIC,EA4CA5hE,GA3CJ,SAAW4hE,GACP,IAAI5hE,EACJ4hE,EAAYtsE,MAAQ,KACF,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,MACD,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEgB,MAAjB1tB,EAAIwlG,WAAqBxlG,EAAIwlG,UAAU1zE,WAAa,IACrDnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIwlG,aAEa,IAAzBtsE,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,KACR,MAAMyQ,EAAM,CACRwlG,UAAW,IAAIhwG,WAAW,IAExB3E,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACX8c,IAAQ,GACP,EACDnkC,EAAIwlG,UAAY3mF,EAAO1Y,QAGvB0Y,EAAOiJ,SAAe,EAANqc,EAG5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEX4hE,EAAY70G,OAAUsP,GACX6hC,GAAc7hC,EAAKulG,EAAYtsE,SAE1CssE,EAAY9zG,OAAU2E,GACX4iC,EAAc5iC,EAAKmvG,EAAYtsE,QAE7C,CA1CD,CA0CGssE,EAAcD,EAAWC,cAAgBD,EAAWC,YAAc,CAAC,IAEtED,EAAWrsE,MAAQ,KACD,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,KAY9B,IAX6B,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEa,MAAd1tB,EAAI23C,QAAkB33C,EAAI23C,OAAO7lB,WAAa,IAC/CnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAI23C,SAEA,MAAX33C,EAAIylG,KAA2B,KAAZzlG,EAAIylG,MACxB97F,EAAE0d,OAAO,IACT1d,EAAEse,OAAOjoB,EAAIylG,MAEI,MAAjBzlG,EAAI0lG,UACJ,IAAK,MAAMpyG,KAAS0M,EAAI0lG,UACpB/7F,EAAE0d,OAAO,IACTi+E,EAAWC,YAAYtsE,QAAQvoC,OAAO4C,EAAOqW,IAGxB,IAAzBuvB,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,KACR,MAAMyQ,EAAM,CACR23C,OAAQ,IAAIniD,WAAW,GACvBiwG,IAAK,GACLC,UAAW,IAET70G,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,OAAQ8c,IAAQ,GACZ,KAAK,EACDnkC,EAAI23C,OAAS94B,EAAO1Y,QACpB,MACJ,KAAK,EACDnG,EAAIylG,IAAM5mF,EAAOoJ,SACjB,MACJ,KAAK,EACDjoB,EAAI0lG,UAAUv0G,KAAKm0G,EAAWC,YAAYtsE,QAAQxnC,OAAOotB,EAAQA,EAAOwI,WACxE,MACJ,QACIxI,EAAOiJ,SAAe,EAANqc,GAG5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEX2hE,EAAW50G,OAAUsP,GACV6hC,GAAc7hC,EAAKslG,EAAWrsE,SAEzCqsE,EAAW7zG,OAAU2E,GACV4iC,EAAc5iC,EAAKkvG,EAAWrsE,QAE5C,CAxGD,CAwGG,KAAe,GAAa,CAAC,ICtGzB,MAAMqsE,GAIT1iD,0BAA6BxsD,IACzB,MAAMuvG,EAAa,GAASl0G,OAAO2E,GAC7BuhD,EAASg6C,GAAgBgU,EAAWhuD,QACpCqtD,GAAcW,EAAWD,WAAa,IAAInmG,KAAK2uB,GAAM,GAAUA,EAAEs3E,aACjEI,EAAYD,EAAWF,IAC7B,OAAO,IAAIH,GAAW,CAAE3tD,SAAQqtD,aAAYY,aAAY,EAE5DhjD,cFnBuC,qBEoBvCA,aAAeyiD,GACf1tD,OACAqtD,WACAY,UACAv9B,OAASi9B,GAAWO,OACpB5sE,MAAQqsE,GAAWQ,MACnBC,UACA,WAAAplG,CAAY9B,GACR,MAAM,OAAE84C,EAAM,WAAEqtD,EAAU,UAAEY,GAAc/mG,EAC1ChL,KAAK8jD,OAASA,EACd9jD,KAAKmxG,WAAaA,GAAc,GAChCnxG,KAAK+xG,UAAYA,GAAa/tE,OAAO95B,KAAKoqC,MAC9C,CAIA,OAAAsqC,GAUI,OATsB,MAAlB5+E,KAAKkyG,YACLlyG,KAAKkyG,UAAY,GAASr1G,OAAO,CAC7BinD,OAAQ9jD,KAAK8jD,OAAOvP,UACpBq9D,IAAK5tE,OAAOhkC,KAAK+xG,WACjBF,UAAW7xG,KAAKmxG,WAAWzlG,KAAKmR,IAAM,CAClC80F,UAAW90F,EAAEvK,aAIlBtS,KAAKkyG,SAChB,CAIA,MAAAhmE,CAAOC,GACH,OAAMA,aAAiBslE,MAIlBzxG,KAAK8jD,OAAO5X,OAAOC,EAAM2X,SAI1B9jD,KAAK+xG,YAAc5lE,EAAM4lE,aCvC9B,SAAqB13E,EAAGh9B,GAC3B,MAAMwnB,EAAO,CAACwV,EAAGh9B,IAAMg9B,EAAE57B,WAAW0zG,cAAc90G,EAAEoB,YACpD,OAAI47B,EAAE3+B,SAAW2B,EAAE3B,SAGnB2B,EAAEwnB,KAAKA,GACAwV,EAAExV,KAAKA,GAAMutF,OAAM,CAAC1wD,EAAM9lD,IAAUyB,EAAEzB,GAAOswC,OAAOwV,KAC/D,CDoCa2wD,CAAYryG,KAAKmxG,WAAYhlE,EAAMglE,WAI5C,EE/DG,IAAImB,IACX,SAAWA,GACP,IAAIxiE,EACJwiE,EAASltE,MAAQ,KACC,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,MACD,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEgB,MAAjB1tB,EAAIqtE,WAAqBrtE,EAAIqtE,UAAUv7C,WAAa,IACrDnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIqtE,YAEQ,MAAnBrtE,EAAIomG,aAAuBpmG,EAAIomG,YAAYt0E,WAAa,IACzDnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIomG,cAEI,MAAfpmG,EAAIokC,SAAmBpkC,EAAIokC,QAAQtS,WAAa,IACjDnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIokC,UAEM,MAAjBpkC,EAAIwuF,WAAqBxuF,EAAIwuF,UAAU18D,WAAa,IACrDnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIwuF,aAEa,IAAzBt1D,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,KACR,MAAMyQ,EAAM,CACRqtE,UAAW,IAAI73E,WAAW,GAC1B4wG,YAAa,IAAI5wG,WAAW,GAC5B4uC,QAAS,IAAI5uC,WAAW,GACxBg5F,UAAW,IAAIh5F,WAAW,IAExB3E,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,OAAQ8c,IAAQ,GACZ,KAAK,EACDnkC,EAAIqtE,UAAYxuD,EAAO1Y,QACvB,MACJ,KAAK,EACDnG,EAAIomG,YAAcvnF,EAAO1Y,QACzB,MACJ,KAAK,EACDnG,EAAIokC,QAAUvlB,EAAO1Y,QACrB,MACJ,KAAK,EACDnG,EAAIwuF,UAAY3vE,EAAO1Y,QACvB,MACJ,QACI0Y,EAAOiJ,SAAe,EAANqc,GAG5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEXwiE,EAASz1G,OAAUsP,GACR6hC,GAAc7hC,EAAKmmG,EAASltE,SAEvCktE,EAAS10G,OAAU2E,GACR4iC,EAAc5iC,EAAK+vG,EAASltE,QAE1C,CAlED,CAkEGktE,KAAaA,GAAW,CAAC,IChErB,MAAME,GAITzjD,0BAA4BhkB,MAAO3M,IAC/B,MAAMq0E,EAAe,GAAS70G,OAAOwgC,GAC/B0lB,QAAem6C,GAAewU,EAAaj5B,WACjD,OAAO,IAAIg5B,GAAe,CACtB1uD,SACAyuD,YAAaE,EAAaF,YAC1BhiE,QAASkiE,EAAaliE,QACtBoqD,UAAW8X,EAAa9X,WAC1B,EAMN5rC,YAAchkB,MAAO2nE,EAAQ5uD,KACzB,GAAyB,MAArBA,EAAOm4B,WACP,MAAM,IAAIj+E,MAAM,uBAEpB,MAAMw2E,EAASk+B,EAAOl+B,OAChB+9B,EAAcG,EAAOttE,MACrBmL,EAAUmiE,EAAO9zB,UACjB+zB,EAAWC,GAAuBp+B,EAAQ+9B,EAAahiE,GACvDxkC,QAAY,GAAoB+3C,EAAOm4B,YACvC0e,QAAkB5uF,EAAI7I,KAAKyvG,EAASp/E,YAC1C,OAAO,IAAIi/E,GAAe,CACtB1uD,SACAyuD,cACAhiE,UACAoqD,aACF,EAMN5rC,sBAAwBhkB,MAAO3M,EAAMo2C,KACjC,MAAMq+B,QAAiBL,GAAeM,mBAAmB10E,GAEzD,UADoBy0E,EAASE,SAASv+B,GAElC,MAAM,IAAI,GAAU,uDCnDH,2BDqDrB,OAAOq+B,CAAQ,EAEnB/uD,OACAyuD,YACAhiE,QACAoqD,UACAuX,UAKA,WAAAplG,CAAY9B,GACR,MAAM,OAAE84C,EAAM,YAAEyuD,EAAW,QAAEhiE,EAAO,UAAEoqD,GAAc3vF,EACpDhL,KAAK8jD,OAASA,EACd9jD,KAAKuyG,YAAcA,EACnBvyG,KAAKuwC,QAAUA,EACfvwC,KAAK26F,UAAYA,CACrB,CAIA,OAAA/b,GACI,GAA6B,MAAzB5+E,KAAK8jD,OAAO01B,UACZ,MAAM,IAAIx7E,MAAM,sBAUpB,OARsB,MAAlBgC,KAAKkyG,YACLlyG,KAAKkyG,UAAY,GAASr1G,OAAO,CAC7B28E,UAAWx5E,KAAK8jD,OAAO01B,UACvB+4B,YAAavyG,KAAKuyG,YAClBhiE,QAASvwC,KAAKuwC,QAAQhd,WACtBonE,UAAW36F,KAAK26F,aAGjB36F,KAAKkyG,SAChB,CAIA,MAAAhmE,CAAOC,GACH,OAAO,GAAiBnsC,KAAK4+E,UAAWzyC,EAAMyyC,UAClD,CAIA,cAAMm0B,CAASv+B,GACX,MAAMm+B,EAAWC,GAAuBp+B,EAAQx0E,KAAKuyG,YAAavyG,KAAKuwC,SACvE,GAA6B,MAAzBvwC,KAAK8jD,OAAO01B,UACZ,MAAM,IAAIx7E,MAAM,sBAGpB,OADY,GAAmBgC,KAAK8jD,OAAO01B,WAChCtuD,OAAOynF,EAASp/E,WAAYvzB,KAAK26F,UAChD,EAKJ,MAAMiY,GAAyB,CAACp+B,EAAQ+9B,EAAahiE,KAQjD,MAAMyiE,EAAmB,GAAsBx+B,GACzCy+B,EAAe,EAAcD,EAAiB/0E,YAC9Ci1E,EAAoB,EAAcX,EAAY72G,QAC9Cy3G,EAAgB,EAAc5iE,EAAQ70C,QAC5C,OAAO,IAAIkgD,GAAeq3D,EAAcD,EAAkBE,EAAmBX,EAAaY,EAAe5iE,EAAQ,EE/E/G6iE,GAAQ/3G,IACH,CACH+L,MAAQisG,KACAA,EAAK33G,OAAS,MAGdL,EAAGg4G,EAAK,KACDA,EAAK51G,MAAM,GAI1B61G,QAAS,OAGXC,GAAW7gG,IACN,CACHtL,MAAQisG,GAASD,IAAM9wG,GAAQA,IAAQoQ,IAAKtL,MAAMisG,GAClDC,QAAS5gG,IAGX,GAAS,KACJ,CACHtL,MAAQisG,GAASD,IAAM9wG,GAAuB,iBAARA,IAAkB8E,MAAMisG,GAC9DC,QAAS,aAGX,GAAS,KACJ,CACHlsG,MAAQisG,GAASD,IAAM9wG,IAASa,MAAM2F,SAASxG,MAAO8E,MAAMisG,GAC5DC,QAAS,aAGXxvD,GAAS,KACJ,CACH18C,MAAQisG,IACJ,GAAIA,EAAK33G,OAAS,EACd,OAAO,EAEX,GAAgB,QAAZ23G,EAAK,IAA4B,SAAZA,EAAK,GAC1B,OAAO,EAGX,IAAIA,EAAK,GAAGphF,WAAW,OAAQohF,EAAK,GAAGphF,WAAW,KAS9C,OAAO,EARP,IACImX,GAAUxrC,OAAO,IAAIy1G,EAAK,KAC9B,CACA,MAAOp3G,GACH,OAAO,CACX,CAKJ,OAAOo3G,EAAK51G,MAAM,EAAE,EAExB61G,QAAS,kBAGXE,GAAW,KACN,CACHpsG,MAAQisG,IACJ,GAAIA,EAAK33G,OAAS,EACd,OAAO,EAEX,GAAgB,aAAZ23G,EAAK,GACL,OAAO,EAEX,IACIhyE,GAAUzjC,OAAOy1G,EAAK,GAC1B,CACA,MACI,OAAO,CACX,CACA,OAAOA,EAAK51G,MAAM,EAAE,EAExB61G,QAAS,yBAGXhtF,GAAYmtF,IACP,CACHrsG,MAAQisG,IACJ,MAAMllG,EAASslG,EAAQrsG,MAAMisG,GAC7B,OAAe,IAAXllG,EACOklG,EAEJllG,CAAM,EAEjBmlG,QAAS,YAAYG,EAAQH,aAG/B,GAAK,IAAII,KACJ,CACHtsG,MAAQisG,IACJ,IAAIxC,EACJ,IAAK,MAAM4C,KAAWC,EAAU,CAC5B,MAAMvlG,EAASslG,EAAQrsG,MAAMisG,IAEd,IAAXllG,IAIW,MAAX0iG,GAAmB1iG,EAAOzS,OAASm1G,EAAQn1G,UAC3Cm1G,EAAU1iG,EAElB,CACA,OAAe,MAAX0iG,GAGGA,CAAO,EAElByC,QAAS,MAAMI,EAAShoG,KAAImR,GAAKA,EAAEy2F,UAAS51G,KAAK,WAGnD,GAAM,IAAIg2G,KACL,CACHtsG,MAAQisG,IACJ,IAAK,MAAMI,KAAWC,EAAU,CAE5B,MAAMvlG,EAASslG,EAAQrsG,MAAMisG,GAE7B,IAAe,IAAXllG,EACA,OAAO,EAEXklG,EAAOllG,CACX,CACA,OAAOklG,CAAI,EAEfC,QAAS,OAAOI,EAAShoG,KAAImR,GAAKA,EAAEy2F,UAAS51G,KAAK,WAG1D,SAASi2G,MAAOD,GACZ,SAAStsG,EAAMwpG,GACX,IAAI1zG,EAvII,CAAC0zG,GACNA,EAAGnyG,WAAWiH,MAAM,KAAKjI,MAAM,GAsItBm2G,CAAQhD,GACpB,IAAK,MAAM6C,KAAWC,EAAU,CAC5B,MAAMvlG,EAASslG,EAAQrsG,MAAMlK,GAC7B,IAAe,IAAXiR,EACA,OAAO,EAEXjR,EAAQiR,CACZ,CACA,OAAOjR,CACX,CAYA,MAAO,CACH2zG,QAZJ,SAAiBD,GAEb,OAAkB,IADHxpG,EAAMwpG,EAEzB,EAUIiD,WATJ,SAAoBjD,GAChB,MAAMziG,EAAS/G,EAAMwpG,GACrB,OAAe,IAAXziG,GAGqB,IAAlBA,EAAOzS,MAClB,EAKJ,CAIA,MAAMo4G,GAAQ,GAAIP,GAAQ,QAAS,MAC7BQ,GAAQ,GAAIR,GAAQ,QAAS,MAC7BS,GAAW,GAAIT,GAAQ,WAAY,MACnCU,GAAO,GAAIV,GAAQ,OAAQ,MA6D3BW,IA9CcP,GAAIG,IAeJH,GAAII,IAeDJ,GAAIK,IAeRL,GAAI,GAAGM,GAAMD,GAAUF,GAAOC,KACpC,GAAIR,GAAQ,OAAQH,GAAKn8C,MAChCk9C,GAAO,GAAIZ,GAAQ,OAAQH,GAAKj8C,KAChCi9C,GAAM,GAAGF,GAAMC,IACfE,GAAgB,GAAGD,GAAKH,GAAMH,GAAOC,GAAOC,IAerCM,GAAeX,GAAIU,IAiD1BE,IAhCaZ,GAAIO,IAiBJP,GAAIQ,IAcLR,GAAIS,IACT,GAAIC,GAAed,GAAQ,OAAQ,OAC1CiB,GAAO,GAAIH,GAAed,GAAQ,OAAQ,MA2B1CkB,IAdad,GAAIY,IAaJZ,GAAIa,IACT,GAAIA,GAAMjB,GAAQ,UAC1BmB,GAAU,GAAIF,GAAMjB,GAAQ,YAC5BoB,GAAgB,GAAGF,GAAOC,IA2B1BE,IAdcjB,GAAIc,IAaFd,GAAIe,IACb,GAAGL,GAAeE,GAAMC,GAAMC,GAAOC,KAC5C,GAAc,GAAG,GAAIE,GAAMrB,GAAQ,MAAOjtF,GAASw9B,QAcnD,IADoB6vD,GAAI,IACJ,GAAG,GAAIiB,GAAMrB,GAAQ,OAAQjtF,GAASw9B,OAAY,GAAI8wD,GAAMrB,GAAQ,OAAQA,GAAQ,MAAOjtF,GAASw9B,SAcxH,IAD0B6vD,GAAI,IACd,GAAIa,GAAMjB,GAAQ,iBAAkBjtF,GAASktF,MAAaltF,GAASktF,MAAaltF,GAASw9B,QAczG,IADsB6vD,GAAI,IACV,GAAIe,GAASnB,GAAQ,gBAAiBjtF,GAASktF,MAAaltF,GAASktF,MAAaltF,GAASw9B,QAc3G,IADsB6vD,GAAI,IACnB,GAAG,GAAa,GAAmB,GAAIY,GAAMjuF,GAASw9B,OAAY,GAAI6wD,GAAeruF,GAASw9B,OAAY,GAAIuwD,GAAe/tF,GAASw9B,OAAY,GAAe,GAAeA,OA2BhL,IAdM6vD,GAAI,IAcAA,GAbN,GAAI,GAAMJ,GAAQ,eAAgBzvD,QCpb5C,SAAS+wD,GAAS/yD,EAAQzc,GAC7B,MAAMyvE,EAAK/V,GAASj9C,EAAQzc,GACtBgsC,EAAI,CACN5qE,KAAMskC,MAAO6P,EAAO75C,KAEhB,MAAMtB,QAAcq1G,EAAGruG,KAAK1F,GAC5B,OAAO65C,EAAMh9C,OAAO6B,EAAM,EAE9BiH,MAAOqkC,MAAOthC,EAASmxC,EAAO75C,WAEpB+zG,EAAGpuG,MAAMk0C,EAAM/9C,OAAO4M,GAAU1I,EAAQ,EAElDm+F,OAAQn0D,MAAOmG,EAAU0J,EAAO75C,WAEtB+zG,EAAG5V,OAAOhuD,EAASxlC,KAAIjC,GAAWmxC,EAAM/9C,OAAO4M,KAAW1I,EAAQ,EAE5Eg0G,GAAKn6D,IACM,CACHn0C,KAAMskC,MAAOhqC,GAAYswE,EAAE5qE,KAAKm0C,EAAO75C,GACvC2F,MAAOqkC,MAAOjuB,EAAG/b,IAAYswE,EAAE3qE,MAAMoW,EAAG89B,EAAO75C,GAC/Cm+F,OAAQn0D,MAAOjuB,EAAG/b,IAAYswE,EAAE6tB,OAAOpiF,EAAG89B,EAAO75C,GACjD69F,OAAQ,IAAMvtB,IAGtButB,OAAQ,IACGkW,EAAGlW,UAGlB,OAAOvtB,CACX,CClDO,IAAI,GFoeWsiC,GAbN,GAAG,GAAI,GAAMJ,GAAQ,eAAgBA,GAAQ,UAAWjtF,GAASw9B,OAAY,GAAI,GAAMyvD,GAAQ,UAAWjtF,GAASw9B,OAAYyvD,GAAQ,YA2BnII,GAbN,GAAG,GAAIU,GAAed,GAAQ,OAAQ,KAAUA,GAAQ,QAASjtF,GAASw9B,OAAY,GAAIuwD,GAAed,GAAQ,QAASjtF,GAASw9B,SA2B5H6vD,GAbN,GAAG,GAAIU,GAAed,GAAQ,OAAQ,GAAG,GAAIA,GAAQ,OAAQA,GAAQ,SAAU,GAAI,KAAUA,GAAQ,WAAYjtF,GAASw9B,OAAY,GAAIuwD,GAAed,GAAQ,OAAQA,GAAQ,QAASjtF,GAASw9B,OAAY,GAAIuwD,GAAed,GAAQ,SAAUjtF,GAASw9B,SElf5Q,SAAWkxD,GACP,IAAIllE,EACJklE,EAAS5vE,MAAQ,KACC,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,KAgB9B,IAf6B,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEqB,MAAvB1tB,EAAI8oG,kBACJn/F,EAAE0d,OAAO,IACT1d,EAAE1Z,OAAO+P,EAAI8oG,kBAEO,MAApB9oG,EAAI+oG,eACJp/F,EAAE0d,OAAO,IACT1d,EAAE1Z,OAAO+P,EAAI+oG,eAEI,MAAjB/oG,EAAIqtE,YACJ1jE,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIqtE,YAEO,MAAnBrtE,EAAIgpG,YACJ,IAAK,MAAM11G,KAAS0M,EAAIgpG,YACpBr/F,EAAE0d,OAAO,IACT1d,EAAExD,MAAM7S,GAOhB,GAJwB,MAApB0M,EAAIipG,eACJt/F,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIipG,eAEK,MAAjBjpG,EAAIy3C,UACJ,IAAK,MAAMnkD,KAAS0M,EAAIy3C,UACpB9tC,EAAE0d,OAAO,IACT1d,EAAE1Z,OAAOqD,GAGW,MAAxB0M,EAAIkpG,mBACJv/F,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIkpG,oBAEa,IAAzBhwE,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,KACR,MAAMyQ,EAAM,CACRgpG,YAAa,GACbvxD,UAAW,IAET5mD,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,OAAQ8c,IAAQ,GACZ,KAAK,EACDnkC,EAAI8oG,gBAAkBjqF,EAAO5uB,SAC7B,MACJ,KAAK,EACD+P,EAAI+oG,aAAelqF,EAAO5uB,SAC1B,MACJ,KAAK,EACD+P,EAAIqtE,UAAYxuD,EAAO1Y,QACvB,MACJ,KAAK,EACDnG,EAAIgpG,YAAY73G,KAAK0tB,EAAO1Y,SAC5B,MACJ,KAAK,EACDnG,EAAIipG,aAAepqF,EAAO1Y,QAC1B,MACJ,KAAK,EACDnG,EAAIy3C,UAAUtmD,KAAK0tB,EAAO5uB,UAC1B,MACJ,KAAK,EACD+P,EAAIkpG,iBAAmBrqF,EAAO1Y,QAC9B,MACJ,QACI0Y,EAAOiJ,SAAe,EAANqc,GAG5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEXklE,EAASn4G,OAAUsP,GACR6hC,GAAc7hC,EAAK6oG,EAAS5vE,SAEvC4vE,EAASp3G,OAAU2E,GACR4iC,EAAc5iC,EAAKyyG,EAAS5vE,QAE1C,CAzFD,CAyFG,KAAa,GAAW,CAAC,qCC9FrB,MAAMkwE,GAAiC,iBAAXrtG,QAA2C,iBAAbM,UAA+C,IAAtBA,SAASgtG,SACtFC,GAAa,KAKbC,GAAYH,KAAiBE,GAC7BE,GAAiBF,KAAeF,GAChCK,GAAqBH,IAAcF,GACnC3/E,QAAuC,IAAvBja,WAAW5T,cAAiE,IAA/B4T,WAAW5T,QAAQ8tG,SAA+D,SAApCl6F,WAAW5T,QAAQ8tG,QAAQ/pG,OAAoB2pG,GAG1JK,GAAuC,mBAAlBC,eAAgD,oBAAT9rG,MAAqD,oBAAtB+rG,mBAAqC/rG,gBAAgB+rG,kBAIhJC,SADuC,IAAvBt6F,WAAW5T,cAA6D,IAA3B4T,WAAW5T,QAAQC,KAAuB2T,WAAW5T,QAAQC,IAAkC,SACvH,oBAAdK,WAAmD,gBAAtBA,UAAU6tG,SCX9DC,GACO,OADPA,GAEA,IAFAA,GAGU,EAHVA,GAIW,EAJXA,GAKa,GALbA,GCE4B,KDF5BA,IAOY,EAPZA,IASiB,EAsIvB,MAAMC,GACTz7C,KACAjV,SACA2wD,QACArqD,QACAjI,OACAQ,UACAgQ,UACA+hD,eACA9uD,kBACA+uD,mBACAC,eACAC,qBACA/mG,OACAgnG,yBACA73G,IACA,WAAAkO,CAAYm3C,EAAYj5C,GAvIrB,IAAyB0rG,EAAUxB,EAwIlCl1G,KAAKylD,SAAWz6C,EAAKy6C,SACrBzlD,KAAKo2G,SAAU,EACfp2G,KAAK8jD,OAASG,EAAWH,OACzB9jD,KAAKskD,UAAYL,EAAWK,UAC5BtkD,KAAKs0D,UAAYrQ,EAAWqQ,UAC5Bt0D,KAAKq2G,eAAiBpyD,EAAWoyD,eACjCr2G,KAAKyP,OAASw0C,EAAWx0C,OACzBzP,KAAKpB,IAAMoM,EAAKpM,IAChBoB,KAAK+rD,QAAU/gD,EAAK+gD,SAAWmqD,GAC/Bl2G,KAAKunD,kBAAoBv8C,EAAKu8C,mBAAqB2uD,GACnDl2G,KAAKs2G,mBAAqBtrG,EAAKsrG,oBAAsBJ,GACrDl2G,KAAKu2G,eAAiBvrG,EAAKurG,gBAAkBL,GAC7Cl2G,KAAKw2G,qBAAuBxrG,EAAKwrG,sBAAwBN,GACzDl2G,KAAKy2G,yBAA2BzrG,EAAKyrG,0BAA4BP,GAEjEl2G,KAAK06D,KAAO,CACRu6C,gBAAiB,GAAGjqG,EAAK2rG,gBAAkBT,WAC3ChB,cAzJoBwB,EAyJUzyD,EAAWyyD,SAzJXxB,EAyJqBlqG,EAAKkqG,aAxJ5C,MAAhBA,IAGJA,EAAe,GAAGwB,EAAS7qG,QAAQ6qG,EAASvrE,UAExCxV,IAAU+/E,GACVR,GAAgB,cAAcx5F,WAAW5T,QAAQqjC,WAE5CsqE,IAAaI,IAAeF,IAAsBK,MACvDd,GAAgB,cAAcx5F,WAAWtT,UAAUC,cAR5C6sG,GAyJX,CACA,SAAAtoD,GACI,OAAO5sD,KAAKo2G,OAChB,CACA,WAAMr5G,GACEiD,KAAKo2G,gBAGHp2G,KAAKskD,UAAUhoC,MAAMtc,KAAK8jD,OAAQ,CACpC6B,SAAU,CACNixD,aAAc,GAAqB52G,KAAK06D,KAAKw6C,cAC7C2B,gBAAiB,GAAqB72G,KAAK06D,KAAKu6C,0BAGlDj1G,KAAKs0D,UAAUjN,OAAOrnD,KAAKylD,UAAWrnB,IACnCp+B,KAAK82G,eAAe14E,GAAMvwB,OAAM5R,IACjC+D,KAAKpB,IAAI8I,MAAMzL,EAAI,GACrB,GACH,CACCsrD,kBAAmBvnD,KAAKunD,kBACxB+uD,mBAAoBt2G,KAAKs2G,mBACzBG,yBAA0Bz2G,KAAKy2G,2BAEnCz2G,KAAKo2G,SAAU,EACnB,CACA,UAAM3oG,SACIzN,KAAKs0D,UAAUyiD,SAAS/2G,KAAKylD,UACnCzlD,KAAKo2G,SAAU,CACnB,EE5MG,MAAMpB,WAAiBmB,GAC1B,WAAArpG,CAAYm3C,EAAYj5C,EAAO,CAAC,GAC5B+iC,MAAMkW,EAAY,IACXj5C,EACHy6C,SAAU,IAAIz6C,EAAK2rG,gBAAkBT,cACrCt3G,IAAKqlD,EAAWxJ,OAAO2zD,aAAa,sBAEpCpjG,EAAKgsG,qBAAuBd,KAE5BjyD,EAAWx0C,OAAO0xC,iBAAiB,mBAAoB/gD,IACnD,MAAM+iD,EAAa/iD,EAAIujD,OACvB3jD,KAAKi3G,SAAS9zD,GAAYt1C,OAAM5R,IAAS+D,KAAKpB,IAAI8I,MAAM,mDAAoDzL,EAAI,GAAI,GAGhI,CACA,CAAC8gG,IAAuB,CACpB,oBAEJ,eAAMma,CAAU/zD,EAAYpiD,EAAU,CAAC,GACnC,IAAIqhD,EACJ,GAAsB,MAAlBrhD,EAAQigD,OAAgB,CACxB,MAAMA,EAASm2D,YAAYprD,QAAQ/rD,KAAK+rD,SAExChrD,EAAU,IACHA,EACHigD,SAER,CACA,IACIoB,QAAee,EAAWK,UAAUxjD,KAAKylD,SAAU,IAC5C1kD,EACH01G,yBAA0Bz2G,KAAKy2G,2BAEnC,MAAM1B,EAAKF,GAASzyD,EAAQ,CACxBlD,cAAel/C,KAAKu2G,iBACrBxB,GAAG,IACAtrG,QAAgBsrG,EAAGtuG,KAAK1F,GAE9B,aADMqhD,EAAOg1D,MAAMr2G,GACZ0I,CACX,CACA,MAAOxN,GAGH,MAFA+D,KAAKpB,IAAI8I,MAAM,uCAAwCzL,GACvDmmD,GAAQ8hB,MAAMjoE,GACRA,CACV,CACJ,CACA,cAAMg7G,CAAS9zD,EAAYpiD,EAAU,CAAC,GAClC,MAAM0I,QAAgBzJ,KAAKk3G,UAAU/zD,EAAYpiD,IAC3C,UAAEy4E,EAAS,UAAE51B,EAAS,aAAEwxD,GAAiB3rG,EAC/C,GAAiB,MAAb+vE,EACA,MAAM,IAAI,GAAU,+CAAgD,0BAExE,MAAMl4D,QAAW28E,GAAezkB,GAChC,IAAKr2B,EAAWqC,WAAWtZ,OAAO5qB,GAC9B,MAAM,IAAI,GAAU,mDAAoD,oBAE5E,GAAIthB,KAAK8jD,OAAO5X,OAAO5qB,GACnB,MAAM,IAAI,GAAU,sCAAuC,oBAG/D,MAAM+1F,EFhDP,SAA2Bx+C,GAC9B,GAAY,MAARA,GAAgBA,EAAKn9D,OAAS,EAC9B,IACI,OAAO,GAAUm9D,EACrB,CACA,MACA,CAER,CEwCkCy+C,CAAkBlC,GAQ5C,OAPAp1G,KAAKpB,IAAI,kDAAmD0iB,EAAIsiC,GAChE5jD,KAAKpB,IAAI,6BAA8By4G,GACd,MAArBA,GACAr3G,KAAKq2G,eAAekB,mBAAmB77G,QAAUsE,KAAKw2G,sBAAwB3yG,OAC9E7D,KAAKpB,IAAI,kCAAmCy4G,GAC5Cr3G,KAAKq2G,eAAemB,gBAAgBH,IF/BzCtsE,eAAsCuZ,EAAW70C,EAAQ7Q,EAAKukD,EAAY15C,GAE7E,GADA7K,EAAI,4BAA6BukD,EAAWqC,YAC7B,MAAX/7C,EACA,MAAM,IAAI,GAAU,gCAAiC,uBAEzD,MAAMm5C,EAAO,CAAC,EAUd,GATIn5C,EAAQ0rG,YAAYz5G,OAAS,IAC7BknD,EAAKivD,UAAYpoG,EAAQ0rG,YAAYzpG,KAAInJ,IAAO,CAC5Ck1G,aAAa,EACb9F,UAAW,GAAUpvG,QAGzBkH,EAAQm6C,UAAUloD,OAAS,IAC3BknD,EAAKgB,UAAYn6C,EAAQm6C,WAEJ,MAArBn6C,EAAQ+vE,YACR52B,EAAK42B,UAAY/vE,EAAQ+vE,kBACJykB,GAAex0F,EAAQ+vE,YAChCttC,OAAOiX,EAAWqC,aAC1B,MAAM,IAAI,GAAU,yCAA0C,0BAGtE,IAAIhQ,EAEJ,GAAgC,MAA5B/rC,EAAQ4rG,iBAA0B,CAClCz2G,EAAI,oCAAqCukD,EAAWqC,YACpD,IAAIkyD,EAAqBjuG,EAAQ4rG,iBACjC,MAAMxC,QAAiBL,GAAemF,eAAeD,EAAoBjG,GAAWO,QACpF,IASI4F,EATA9F,EAAaL,GAAWqB,mBAAmBD,EAAStiE,SAExD,IAAKuhE,EAAWhuD,OAAO5X,OAAO2mE,EAAS/uD,QACnC,MAAM,IAAI,GAAU,sDAAuD,2BAG/E,IAAKX,EAAWqC,WAAWtZ,OAAO4lE,EAAWhuD,QACzC,MAAM,IAAI,GAAU,2CAA4C,+BAGpE,IACI8zD,QAAqBtzD,EAAUx5C,IAAIgnG,EAAWhuD,OAClD,CACA,MAAO7nD,GACH,GAAiB,kBAAbA,EAAIoQ,KACJ,MAAMpQ,CAEd,CACA,GAAoB,MAAhB27G,IAEAh1D,EAAK+C,SAAWiyD,EAAajyD,SAEU,MAAnCiyD,EAAaF,oBAA4B,CACzC,MAAMG,QAAuBrF,GAAeM,mBAAmB8E,EAAaF,oBACtEI,EAAerG,GAAWqB,mBAAmB+E,EAAetnE,SAE9DunE,EAAa/F,WAAaD,EAAWC,YACrCnzG,EAAI,2FAA4Fk5G,EAAa/F,UAAWD,EAAWC,WACnID,EAAagG,EACbJ,EAAqBE,EAAaF,mBAE1C,CAGJ90D,EAAK80D,mBAAqBA,EAE1B90D,EAAKivD,UAAYC,EAAWX,WAAWzlG,KAAIimG,IAAa,CACpD8F,aAAa,EACb9F,gBAEJn8D,EAAS,CACLo8D,IAAKE,EAAWC,UAChBF,UAAWC,EAAWX,WAE9B,MAEIvyG,EAAI,uCAAwCukD,EAAWqC,YAI3D,GAFA5mD,EAAI,mBAAoBukD,EAAWqC,WAAY5C,SACzC0B,EAAUyzD,MAAM50D,EAAWqC,WAAY5C,GACjB,MAAxBn5C,EAAQyrG,cAAmD,MAA3BzrG,EAAQwrG,gBAAyB,CACjE,MAAMtvD,EAAW,CAAC,EACU,MAAxBl8C,EAAQyrG,eACRvvD,EAASixD,aAAe,GAAqBntG,EAAQyrG,eAE1B,MAA3BzrG,EAAQwrG,kBACRtvD,EAASkxD,gBAAkB,GAAqBptG,EAAQwrG,kBAE5Dr2G,EAAI,sBAAuBukD,EAAWqC,WAAYG,SAC5CrB,EAAUhoC,MAAM6mC,EAAWqC,WAAY,CACzCG,YAER,CACA,MAAMx3C,EAAS,CACX21C,OAAQX,EAAWqC,WACnByvD,gBAAiBxrG,EAAQwrG,gBACzBC,aAAczrG,EAAQyrG,aACtB17B,UAAW/vE,EAAQ+vE,UACnB27B,YAAa1rG,EAAQ0rG,YAAYzpG,KAAInJ,GAAO,GAAUA,KACtD6yG,aAAsC,MAAxB3rG,EAAQ2rG,kBAAuBr3G,EAAY,GAAU0L,EAAQ2rG,cAC3ExxD,UAAWn6C,EAAQm6C,UACnByxD,iBAAkB7/D,EAClB2N,cAGJ,OADA1zC,EAAOo+C,kBAAkB,gBAAiB,CAAElK,OAAQx1C,IAC7CA,CACX,CEvEe6pG,CAAuBh4G,KAAKskD,UAAWtkD,KAAKyP,OAAQzP,KAAKpB,IAAKukD,EAAY15C,EACrF,CAKA,oBAAMqtG,CAAe14E,GACjB,MAAM,WAAE+kB,EAAU,OAAEf,GAAWhkB,EACzB4iB,EAASm2D,YAAYprD,QAAQ/rD,KAAK+rD,SAExC,IACI,MAAMytB,EAAYx5E,KAAK8jD,OAAO01B,WAAa,IAAI73E,WAAW,GACpDuvG,QAAiBlxG,KAAKskD,UAAUx5C,IAAI9K,KAAK8jD,QACzCqtD,EAAanxG,KAAKq2G,eAAe4B,eAAevsG,KAAIklG,GAAMA,EAAGp1C,gBAAgB,GAAU,OAAOnvD,QACpG,IAAIgpG,EAAmBnE,EAASwG,mBAChC,GAAIvG,EAAWz1G,OAAS,GAAyB,MAApB25G,EAA0B,CACnD,MAAMvD,EAAa,IAAIL,GAAW,CAC9B3tD,OAAQ9jD,KAAK8jD,OACbqtD,eAGJkE,SADuB7C,GAAe0F,KAAKpG,EAAY9xG,KAAK8jD,SAChC86B,UAAUrrD,UAC1C,CACA,IAAI6hF,EAAejyD,EAAWg1D,WAAW7lG,MACpCgiG,GAAazD,QAAQ1tD,EAAWg1D,cACjC/C,OAAer3G,GAEnB,MAAMg3G,EAAKF,GAASzyD,GAAQ2yD,GAAG,UACzBA,EAAGruG,MAAM,CACXuuG,gBAAiBj1G,KAAK06D,KAAKu6C,gBAC3BC,aAAcl1G,KAAK06D,KAAKw6C,aACxB17B,YACA27B,YAAahE,EAAWzlG,KAAImtD,GAAQA,EAAKvmD,QACzC+iG,mBACAD,eACAxxD,UAAWstD,EAASttD,WACrB,CACC5C,iBAEEoB,EAAOg1D,MAAM,CACfp2D,UAER,CACA,MAAO/kD,GACH+D,KAAKpB,IAAI8I,MAAM,wCAAyCzL,GACxDmmD,EAAO8hB,MAAMjoE,EACjB,CACJ,ECjFG,SAASg7G,GAASjsG,EAAO,CAAC,GAC7B,OAAQi5C,GAAe,IAAI+wD,GAAc/wD,EAAYj5C,EACzD,CC5CO,SAASotG,GAAY55G,EAAQI,GAChC,MAAMmgC,ECHH,SAAqB5yB,GACxB,GAAW,MAAPA,EAAa,CACb,GAAoC,mBAAzBA,EAAI6B,OAAO8tC,UAClB,OAAO3vC,EAAI6B,OAAO8tC,YAEtB,GAAyC,mBAA9B3vC,EAAI6B,OAAOC,eAClB,OAAO9B,EAAI6B,OAAOC,iBAEtB,GAAwB,mBAAb9B,EAAI+B,KACX,OAAO/B,CAEf,CACA,MAAM,IAAInO,MAAM,0CACpB,CDVgBq6G,CAAY75G,GAAQ8P,WEH7B,IAAmB0vC,EACT,OADSA,EFIRjf,IEAe,mBAAfif,EAAMlwC,MACO,mBAAhBkwC,EAAMnwC,OACY,mBAAlBmwC,EAAMiN,SFDblsB,EAAIlxB,OAAM5R,IACN2C,EAAI8I,MAAM,qCAAsCzL,EAAI,GAGhE,CGRA,MAEMq8G,GAAmB,KACxB,MAAM5wG,EAAQ,IAAI1J,MAAM,iBAExB,OADA0J,EAAMmE,KAAO,aACNnE,CAAK,EAGP6wG,GAAe,IAAI/sE,QAoDzB,GAlDO,UAAsBmf,aAAc6tD,EAAc/iF,WAAYgjF,GAAc,CAAC,GAEnF,MAAO,CAACjuD,GAAe/qD,QAAOuhD,UAAU,CAAC,KAExC,GAAIA,GAAQ8J,QACX,OAAOhvD,QAAQE,OAAOs8G,MAGvB,IAAII,EACAC,EACAC,EACJ,MAAMhoG,EAAQ4nG,GAAgB7tD,aAExBkuD,EAAiB,KACtBjoG,EAAM8nG,GACNE,EAAeN,KAAmB,EAS7BQ,EAAe,IAAIh9G,SAAQ,CAACC,EAASC,KAC1C28G,EAAS,KANL33D,GACHA,EAAOK,oBAAoB,QAASw3D,GAOpC98G,EAAQ0D,EAAM,EAGfm5G,EAAiB58G,EACjB08G,GAAaD,GAAchjF,YAAYkjF,EAAQnuD,EAAa,IAa7D,OAVIxJ,GACHA,EAAOG,iBAAiB,QAAS03D,EAAgB,CAAC7pG,MAAM,IAGzDupG,GAAaxtG,IAAI+tG,GAAc,KAC9BloG,EAAM8nG,GACNA,EAAY,KACZC,GAAQ,IAGFG,CAAY,CAErB,CAEcC,GCzDP,MAAMC,GACTC,cACAtnC,OACAunC,SACAC,cACAC,WACAC,qBACAC,UACA,WAAAxsG,CAAYu4B,EAAO,CAAC,GAChBrlC,KAAK2xE,OAAStsC,EAAKssC,QAAU,EAC7B3xE,KAAKk5G,SAAW7zE,EAAK6zE,UAAY,EACjCl5G,KAAKm5G,cAAgB9zE,EAAK8zE,eAAiB,EAC3Cn5G,KAAKo5G,WAAa/zE,EAAK+zE,aAAc,EACrCp5G,KAAKq5G,qBAAuBh0E,EAAKg0E,sBAAyC,IAAhBr5G,KAAKk5G,SAAkBl5G,KAAK2xE,OACtF3xE,KAAKs5G,UAAYj0E,EAAKi0E,WAAa,QACnCt5G,KAAKi5G,cAAgB,IAAIM,EAC7B,CACA,aAAMp9D,CAAQpwC,EAAKytG,EAAkB,EAAGz4G,EAAU,CAAC,GAC/C,MAAM04G,EAAQz5G,KAAK05G,OAAO3tG,GACpB4tG,EAAc35G,KAAK45G,mBAAmB74G,GAC5C,IAAIg+B,EAAM/+B,KAAKi5G,cAAcY,OAAOJ,EAAOD,EAAiBG,GAE5D,GADA56E,EAAI+6E,gBAAkBt9G,KAAKgU,IAAIxQ,KAAK2xE,OAAS5yC,EAAIg7E,eAAgB,GAC7Dh7E,EAAIg7E,eAAiB/5G,KAAK2xE,OAM1B,MAJI3xE,KAAKm5G,cAAgB,GAAKp6E,EAAIg7E,gBAAmB/5G,KAAK2xE,OAAS6nC,IAE/Dz6E,EAAM/+B,KAAKi5G,cAAcluG,IAAI0uG,EAAO16E,EAAIg7E,eAAgB/5G,KAAKm5G,gBAE3D,IAAI,GAAU,sBAAuB,0BAA2Bp6E,GAErE,GAAI/+B,KAAKo5G,YAAcr6E,EAAIi7E,aAAe,IAAMj7E,EAAIk7E,kBAAmB,CAExE,IAAI/7C,EAAU1hE,KAAKC,KAAKsiC,EAAIi7E,cAAgBj7E,EAAI+6E,gBAAkB,IAC9D57C,EAAUl+D,KAAKq5G,uBACfn7C,EAAUn/B,EAAIg7E,eAAiB/5G,KAAKq5G,4BAElC,GAAMn7C,EAChB,CACA,OAAOn/B,CACX,CACA,OAAAm7E,CAAQnuG,EAAK4lE,EAAS,EAAG5wE,EAAU,CAAC,GAChC,MAAM04G,EAAQz5G,KAAK05G,OAAO3tG,GACpB4tG,EAAc35G,KAAK45G,mBAAmB74G,GACtCg+B,EAAM/+B,KAAKi5G,cAAcY,OAAOJ,EAAO9nC,EAAQgoC,GAErD,OADA56E,EAAI+6E,gBAAkBt9G,KAAKgU,IAAIxQ,KAAK2xE,OAAS5yC,EAAIg7E,eAAgB,GAC1Dh7E,CACX,CACA,MAAAo7E,CAAOpuG,EAAK4lE,EAAS,EAAG5wE,EAAU,CAAC,GAC/B,MAAM04G,EAAQz5G,KAAK05G,OAAO3tG,GACpB4tG,EAAc35G,KAAK45G,mBAAmB74G,GACtCg+B,EAAM/+B,KAAKi5G,cAAcY,OAAOJ,GAAQ9nC,EAAQgoC,GAEtD,OADA56E,EAAI+6E,gBAAkBt9G,KAAKgU,IAAIxQ,KAAK2xE,OAAS5yC,EAAIg7E,eAAgB,GAC1Dh7E,CACX,CAOA,KAAAxoB,CAAMxK,EAAK4tG,GACP,MAAMS,EAA2B,IAAdT,EACbU,EAAar6G,KAAK2xE,OAAS,EAEjC,OADA3xE,KAAKi5G,cAAcluG,IAAI/K,KAAK05G,OAAO3tG,GAAMsuG,EAAYV,GAC9C,CACHG,gBAAiB,EACjBE,aAA6B,IAAfI,GAAoB,EAAIA,EACtCL,eAAgBM,EAChBJ,mBAAmB,EAE3B,CACA,GAAAlvG,CAAIgB,EAAK4lE,EAAQgoC,EAAc,GAC3B,MAAMS,EAAgE,KAAlDT,GAAe,EAAIA,EAAc35G,KAAKk5G,UAE1D,OADAl5G,KAAKi5G,cAAcluG,IAAI/K,KAAK05G,OAAO3tG,GAAM4lE,EAAQgoC,GAC1C,CACHG,gBAAiB,EACjBE,aAA6B,IAAfI,GAAoB,EAAIA,EACtCL,eAAgBpoC,EAChBsoC,mBAAmB,EAE3B,CACA,GAAAnvG,CAAIiB,GACA,MAAMgzB,EAAM/+B,KAAKi5G,cAAcnuG,IAAI9K,KAAK05G,OAAO3tG,IAI/C,OAHW,MAAPgzB,IACAA,EAAI+6E,gBAAkBt9G,KAAKgU,IAAIxQ,KAAK2xE,OAAS5yC,EAAIg7E,eAAgB,IAE9Dh7E,CACX,CACA,OAAOhzB,GACH/L,KAAKi5G,cAAcj2D,OAAOhjD,KAAK05G,OAAO3tG,GAC1C,CACA,kBAAA6tG,CAAmB74G,GACf,OAA+B,MAA3BA,GAASu5G,gBAA0Bv5G,EAAQu5G,gBAAkB,EACtDv5G,EAAQu5G,eAEZt6G,KAAKk5G,QAChB,CACA,MAAAQ,CAAO3tG,GACH,OAAO/L,KAAKs5G,UAAU59G,OAAS,EAAI,GAAGsE,KAAKs5G,aAAavtG,IAAQA,CACpE,CACA,QAAAwuG,CAASd,GACL,OAAOA,EAAMpuG,UAAUrL,KAAKs5G,UAAU59G,OAC1C,EAEJ,MAAM69G,GACFhyG,QACA,WAAAuF,GACI9M,KAAKuH,QAAU,IAAIkkC,GACvB,CACA,MAAAouE,CAAO9tG,EAAKtM,EAAO+6G,GACf,MAAMC,EAAWz6G,KAAKuH,QAAQuD,IAAIiB,GAClC,GAAgB,MAAZ0uG,EAAkB,CAClB,MAAMC,EAAwC,MAAtBD,EAASE,UAC3BF,EAASE,UAAUpxD,WAAY,IAAIr/C,MAAOq/C,WACzC,EACP,OAA0B,MAAtBkxD,EAASE,WAAqBD,EAAkB,GAEhDD,EAASh7G,OAASA,EACX,CACHq6G,gBAAiB,EACjBE,aAAcU,EACdX,eAAgBU,EAASh7G,MACzBw6G,mBAAmB,IAGpBj6G,KAAK+K,IAAIgB,EAAKtM,EAAO+6G,EAChC,CACA,OAAOx6G,KAAK+K,IAAIgB,EAAKtM,EAAO+6G,EAChC,CACA,GAAAzvG,CAAIgB,EAAKtM,EAAO+6G,GACZ,MAAMI,EAA2B,IAAdJ,EACbC,EAAWz6G,KAAKuH,QAAQuD,IAAIiB,GAClB,MAAZ0uG,GACA9vD,aAAa8vD,EAAS/B,WAE1B,MAAMhG,EAAS,CACXjzG,QACAk7G,UAAWC,EAAa,EAAI,IAAI1wG,KAAKA,KAAKoqC,MAAQsmE,QAAc78G,GAWpE,OATAiC,KAAKuH,QAAQwD,IAAIgB,EAAK2mG,GAClBkI,EAAa,IACblI,EAAOgG,UAAYjjF,YAAW,KAC1Bz1B,KAAKuH,QAAQy7C,OAAOj3C,EAAI,GACzB6uG,GAC2B,MAA1BlI,EAAOgG,UAAUmC,OACjBnI,EAAOgG,UAAUmC,SAGlB,CACHf,gBAAiB,EACjBE,aAA6B,IAAfY,GAAoB,EAAIA,EACtCb,eAAgBrH,EAAOjzG,MACvBw6G,mBAAmB,EAE3B,CACA,GAAAnvG,CAAIiB,GACA,MAAM0uG,EAAWz6G,KAAKuH,QAAQuD,IAAIiB,GAClC,GAAgB,MAAZ0uG,EAIA,MAAO,CACHX,gBAAiB,EACjBE,aAL0C,MAAtBS,EAASE,UAC3BF,EAASE,UAAUpxD,WAAY,IAAIr/C,MAAOq/C,WACzC,EAIHwwD,eAAgBU,EAASh7G,MACzBw6G,mBAAmB,EAG/B,CACA,OAAOluG,GACH,MAAM2mG,EAAS1yG,KAAKuH,QAAQuD,IAAIiB,GAChC,OAAc,MAAV2mG,IACwB,MAApBA,EAAOgG,WACP/tD,aAAa+nD,EAAOgG,WAExB14G,KAAKuH,QAAQy7C,OAAOj3C,IACb,EAGf,ECrLG,IAAI+uG,IACX,SAAWA,GACPA,EAAaA,EAAyB,WAAI,GAAK,aAC/CA,EAAaA,EAA+B,iBAAI,GAAK,mBACrDA,EAAaA,EAAgC,kBAAI,GAAK,oBACtDA,EAAaA,EAA6B,eAAI,GAAK,iBACnDA,EAAaA,EAA8B,gBAAI,GAAK,kBACpDA,EAAaA,EAA6B,eAAI,GAAK,iBACnDA,EAAaA,EAA8B,gBAAI,GAAK,iBACvD,CARD,CAQGA,KAAiBA,GAAe,CAAC,IAC7B,MAAMC,GAAmBj8G,OAAO4P,OAAO,CAC1C,EAAG,aACH,EAAG,mBACH,EAAG,oBACH,EAAG,iBACH,EAAG,kBACH,EAAG,iBACH,EAAG,oBAEMssG,GAAwBl8G,OAAO4P,OAAO,CAC/CusG,WAAYH,GAAaG,WACzBC,QAASJ,GAAaK,kBACtBC,MAAON,GAAaO,gBACpBC,MAAOR,GAAaS,kBAEXC,GAAuB18G,OAAO4P,OAAO,CAC9CwsG,QAASJ,GAAaW,iBACtBL,MAAON,GAAaY,eACpBJ,MAAOR,GAAaa,iBC1BXC,GAAe,GAAK,GAE1B,MAAM,GACTC,QACAC,YACAC,gBACAC,gCACA,WAAAlvG,CAAYypG,EAAiBqF,GAAcK,EANb,SAO1Bj8G,KAAK67G,QAAU,IAAIjgE,GACnB57C,KAAK87G,YAAc,KACnB97G,KAAK+7G,gBAAkBxF,EACvBv2G,KAAKg8G,gCAAkCC,CAC3C,CACA,KAAAv1G,CAAMvJ,GACF,GAAa,MAATA,GAAkC,IAAjBA,EAAMzB,OACvB,MAAO,GAGX,GADAsE,KAAK67G,QAAQ9/D,OAAO5+C,GAChB6C,KAAK67G,QAAQ59E,WAAaj+B,KAAKg8G,gCAC/B,MAAMl9G,OAAOoN,OAAO,IAAIlO,MAAM,6CAA8C,CAAEqO,KAAM,0BAExF,MAAM8sE,EAAO,GACb,KAA+B,IAAxBn5E,KAAK67G,QAAQngH,QAAc,CAC9B,GAAwB,MAApBsE,KAAK87G,YACL,IACI97G,KAAK87G,YAAc97G,KAAKk8G,cAAcl8G,KAAK67G,QAC/C,CACA,MAAO5/G,GACH,GAAiB,oBAAbA,EAAIoQ,KACJ,MAAMpQ,EAEV,KACJ,CAEJ,MAAM,GAAEqlB,EAAE,KAAEpZ,EAAI,OAAExM,EAAM,OAAEC,GAAWqE,KAAK87G,YAE1C,GAD2B97G,KAAK67G,QAAQngH,OAASC,EACxBD,EACrB,MAEJ,MAAMm5C,EAAM,CACRvzB,KACApZ,QAEAA,IAAS4yG,GAAaG,YAAc/yG,IAAS4yG,GAAaK,mBAAqBjzG,IAAS4yG,GAAaW,mBACrG5mE,EAAIzW,KAAOp+B,KAAK67G,QAAQr/D,QAAQ7gD,EAAQA,EAASD,IAErDy9E,EAAK77E,KAAKu3C,GACV70C,KAAK67G,QAAQ1/D,QAAQxgD,EAASD,GAC9BsE,KAAK87G,YAAc,IACvB,CACA,OAAO3iC,CACX,CAIA,aAAA+iC,CAAc99E,GACV,MAAQ3+B,MAAOkY,EAAC,OAAEhc,GAAWwgH,GAAW/9E,IAChC3+B,MAAO/D,EAAQC,OAAQqB,GAAQm/G,GAAW/9E,EAAMziC,GAClDuM,EAAW,EAAJyP,EAEb,GAA8B,MAA1BojG,GAAiB7yG,GACjB,MAAM,IAAIlK,MAAM,0BAA0BkK,KAG9C,GAAIxM,EAASsE,KAAK+7G,gBACd,MAAMj9G,OAAOoN,OAAO,IAAIlO,MAAM,2BAA4B,CAAEqO,KAAM,oBAGtE,MAAO,CAAEiV,GAAI3J,GAAK,EAAGzP,OAAMvM,OAAQA,EAASqB,EAAKtB,SACrD,EAEJ,MAAM,GAAM,IACN,GAAO,IACb,SAASygH,GAAW55G,EAAK5G,EAAS,GAC9B,IAGI0B,EAHA0hC,EAAM,EACNl5B,EAAQ,EACRykC,EAAU3uC,EAEd,MAAMkU,EAAItN,EAAI7G,OACd,EAAG,CACC,GAAI4uC,GAAWz6B,GAAKhK,EAAQ,GAExB,MADAlK,EAAS,EACH,IAAIo3B,WAAW,2BAEzB11B,EAAIkF,EAAIuI,IAAIw/B,KACZvL,GAAOl5B,EAAQ,IACRxI,EAAI,KAASwI,GACbxI,EAAI,IAAQb,KAAK+G,IAAI,EAAGsC,GAC/BA,GAAS,CACb,OAASxI,GAAK,IAEd,MAAO,CACHoC,MAAOs/B,EACPpjC,OAHJA,EAAS2uC,EAAU3uC,EAKvB,CC7FA,MAAMygH,GAAY,MAsCZ5yF,GAAU,IArChB,MACI6yF,MACAC,YACA,WAAAxvG,GACI9M,KAAKq8G,MAAQz/E,EAAYw/E,IACzBp8G,KAAKs8G,YAAc,CACvB,CAIA,KAAA51G,CAAMmuC,EAAK4H,GACP,MAAMhhB,EAAOz7B,KAAKq8G,MAClB,IAAI1gH,EAASqE,KAAKs8G,YAClB,EAAcznE,EAAIvzB,IAAM,EAAIuzB,EAAI3sC,KAAMuzB,EAAM9/B,GAC5CA,GAAU,EAAsBk5C,EAAIvzB,IAAM,EAAIuzB,EAAI3sC,MAC7C2sC,EAAI3sC,OAAS4yG,GAAaG,YAAcpmE,EAAI3sC,OAAS4yG,GAAaK,mBAAqBtmE,EAAI3sC,OAAS4yG,GAAaW,kBAAiC,MAAZ5mE,EAAIzW,MAK3I,EAAc,EAAG3C,EAAM9/B,GACvBA,GAAU,EAAsB,KALhC,EAAck5C,EAAIzW,KAAK1iC,OAAQ+/B,EAAM9/B,GACrCA,GAAU,EAAsBk5C,EAAIzW,KAAK1iC,SAM7C,MAAM6gH,EAAS9gF,EAAKlI,SAASvzB,KAAKs8G,YAAa3gH,GAC3CygH,GAAYzgH,EAAS,KACrBqE,KAAKq8G,MAAQz/E,EAAYw/E,IACzBp8G,KAAKs8G,YAAc,GAGnBt8G,KAAKs8G,YAAc3gH,EAEvB8gD,EAAKV,OAAOwgE,GACP1nE,EAAI3sC,OAAS4yG,GAAaG,YAAcpmE,EAAI3sC,OAAS4yG,GAAaK,mBAAqBtmE,EAAI3sC,OAAS4yG,GAAaW,kBAAiC,MAAZ5mE,EAAIzW,MAC3Iqe,EAAKV,OAAOlH,EAAIzW,KAExB,GC9BJ,SAAS,GAAU4f,GACf,OAAa,MAATA,GAGyB,mBAAfA,EAAMlwC,MACO,mBAAhBkwC,EAAMnwC,OACY,mBAAlBmwC,EAAMiN,OACrB,CACO,MAAMuxD,GACTl7F,GACAm7F,UACAn5D,SACAmC,SACAE,SACAnnD,OACAgD,OACAk7G,WACAC,YACA/9G,IACAg+G,eACAC,QACAC,OACAC,OACAC,aACAz8D,MACA08D,YACAC,aACAC,QACAC,QACAC,sBACAC,YACA,WAAAxwG,CAAY9B,GACRhL,KAAK48G,eAAiB,IAAIW,gBAC1Bv9G,KAAK68G,QAAU,KACf78G,KAAK88G,OAAS,KACd98G,KAAKpB,IAAMoM,EAAKpM,IAEhBoB,KAAKwB,OAAS,OACdxB,KAAK08G,WAAa,QAClB18G,KAAK28G,YAAc,QACnB38G,KAAKshB,GAAKtW,EAAKsW,GACfthB,KAAK2lD,SAAW36C,EAAK26C,UAAY,CAAC,EAClC3lD,KAAKy8G,UAAYzxG,EAAKyxG,UACtBz8G,KAAKsjD,SAAW,CACZxhD,KAAMoI,KAAKoqC,OAEft0C,KAAKq9G,sBAAwBryG,EAAKqyG,uBA/CD,IAgDjCr9G,KAAKugD,MAAQv1C,EAAKu1C,MAClBvgD,KAAKi9G,YAAcjyG,GAAMiyG,YACzBj9G,KAAKk9G,aAAelyG,GAAMkyG,aAC1Bl9G,KAAKm9G,QAAUnyG,GAAMmyG,QACrBn9G,KAAKo9G,QAAUpyG,GAAMoyG,QACrBp9G,KAAKxB,OAASwB,KAAKg9G,aAAe78D,GAAS,CACvCI,MAAQtkD,IACO,MAAPA,EACA+D,KAAKpB,IAAIsvG,MAAM,0BAA2BjyG,GAG1C+D,KAAKpB,IAAIsvG,MAAM,gBAEnBluG,KAAKw9G,YAAYvhH,EAAI,IAI7B+D,KAAKiiD,KAAOjiD,KAAKiiD,KAAKn+C,KAAK9D,KAC/B,CACA,UAAMiiD,CAAKzjD,GACP,GAAyB,UAArBwB,KAAK28G,YACL,MAAM,IAAI,GAAU,0BAA0B38G,KAAK28G,2BAtEhC,0BAwEvB,IACI38G,KAAK28G,YAAc,UACnB,MAAM57G,EAAU,CACZigD,OAAQhhD,KAAK48G,eAAe57D,QAEhC,GAAuB,aAAnBhhD,KAAKy8G,UAA0B,CAC/B,MAAM19E,EAAM/+B,KAAKy9G,cAAc18G,GAC3B,GAAUg+B,UACJA,CAEd,CACA,MAAM2+E,EAAgB,KAClBtF,GAAY55G,EAAQwB,KAAKpB,IAAI,EAEjC,IACIoB,KAAK48G,eAAe57D,OAAOG,iBAAiB,QAASu8D,GACrD19G,KAAKpB,IAAIsvG,MAAM,4BACf,UAAW,IAAI9vE,KAAQ5/B,EAAQ,CAC3B4/B,EAAOA,aAAgBz8B,WAAa,IAAIi6C,GAAexd,GAAQA,EAC/D,MAAMW,EAAM/+B,KAAK29G,SAASv/E,EAAMr9B,GAC5B,GAAUg+B,KACV/+B,KAAKs9G,YAAc/9D,WACbxgB,EACN/+B,KAAKs9G,YAAYvhH,UACjBiE,KAAKs9G,iBAAcv/G,EAE3B,CACJ,CACA,QACIiC,KAAK48G,eAAe57D,OAAOK,oBAAoB,QAASq8D,EAC5D,CACA19G,KAAKpB,IAAIsvG,MAAM,0DAA2DluG,KAAK28G,aACtD,YAArB38G,KAAK28G,cACL38G,KAAK28G,YAAc,UACnB38G,KAAKpB,IAAIsvG,MAAM,oCACTluG,KAAK49G,eAAe,CACtB58D,OAAQm2D,YAAYprD,QAAQ/rD,KAAKq9G,yBAErCr9G,KAAK28G,YAAc,UAEvB38G,KAAK69G,WACT,CACA,MAAO5hH,GAGH,MAFA+D,KAAKpB,IAAIsvG,MAAM,kDAAmDjyG,GAClE+D,KAAKkkE,MAAMjoE,GACLA,CACV,CACA,QACI+D,KAAKpB,IAAIsvG,MAAM,oBACfluG,KAAK68G,QAAQ9gH,SACjB,CACJ,CACA,WAAAyhH,CAAYvhH,GACuB,MAA3B+D,KAAKsjD,SAASw6D,YAGlB99G,KAAKsjD,SAASw6D,UAAY5zG,KAAKoqC,MAC/Bt0C,KAAK08G,WAAa,SACP,MAAPzgH,GAA8B,MAAf+D,KAAK+8G,SACpB/8G,KAAK+8G,OAAS9gH,GAElB+D,KAAKi9G,gBAC2B,MAA5Bj9G,KAAKsjD,SAASy6D,YACd/9G,KAAKpB,IAAIsvG,MAAM,yBACfluG,KAAKsjD,SAAS8zD,MAAQltG,KAAKoqC,MACP,YAAhBt0C,KAAKwB,QAAwC,UAAhBxB,KAAKwB,SAClCxB,KAAKwB,OAAS,UAEA,MAAdxB,KAAKugD,OACLvgD,KAAKugD,MAAMvgD,KAAK+8G,QAEpB/8G,KAAK88G,OAAO/gH,WAGZiE,KAAKpB,IAAIsvG,MAAM,yCAEvB,CACA,SAAA2P,CAAU5hH,GAC0B,MAA5B+D,KAAKsjD,SAASy6D,aAGlB/9G,KAAKsjD,SAASy6D,WAAa7zG,KAAKoqC,MAChCt0C,KAAK28G,YAAc,SACR,MAAP1gH,GAA8B,MAAf+D,KAAK+8G,SACpB/8G,KAAK+8G,OAAS9gH,GAElB+D,KAAKk9G,iBAC0B,MAA3Bl9G,KAAKsjD,SAASw6D,WACd99G,KAAKpB,IAAIsvG,MAAM,yBACfluG,KAAKsjD,SAAS8zD,MAAQltG,KAAKoqC,MACP,YAAhBt0C,KAAKwB,QAAwC,UAAhBxB,KAAKwB,SAClCxB,KAAKwB,OAAS,UAEA,MAAdxB,KAAKugD,OACLvgD,KAAKugD,MAAMvgD,KAAK+8G,QAEpB/8G,KAAK88G,OAAO/gH,WAGZiE,KAAKpB,IAAIsvG,MAAM,yCAEvB,CAEA,WAAMkJ,CAAMr2G,GACRf,KAAKpB,IAAIsvG,MAAM,sBACfluG,KAAKwB,OAAS,gBAER08F,GAAWpiG,QAAQ2lD,IAAI,CACzBzhD,KAAK+9G,WAAWh9G,GAChBf,KAAK89G,UAAU/8G,GACff,KAAK88G,OAAOt9D,UACZz+C,GAASigD,QACbhhD,KAAKwB,OAAS,SACdxB,KAAKpB,IAAIsvG,MAAM,oBACnB,CACA,eAAM4P,CAAU/8G,EAAU,CAAC,GACvB,GAAwB,YAApBf,KAAK08G,YAAgD,WAApB18G,KAAK08G,WACtC,OAEJ18G,KAAKpB,IAAIsvG,MAAM,gEAAiEluG,KAAK08G,YACrF,MAAMA,EAAa18G,KAAK08G,WACxB18G,KAAK08G,WAAa,UACE,UAAhB18G,KAAKwB,QAAsC,YAAhBxB,KAAKwB,QAAmD,MAA3BxB,KAAKsjD,SAASw6D,YACtE99G,KAAKpB,IAAIsvG,MAAM,mCACTluG,KAAKg+G,cAAcj9G,IAEV,UAAf27G,IACA18G,KAAKpB,IAAIsvG,MAAM,oDAAqDluG,KAAKg9G,aAAal8D,gBACtF9gD,KAAKg9G,aAAahgH,OAEtBgD,KAAKpB,IAAIsvG,MAAM,gCACnB,CACA,gBAAM6P,CAAWh9G,EAAU,CAAC,GACC,YAArBf,KAAK28G,aAAkD,WAArB38G,KAAK28G,cAG3C38G,KAAKpB,IAAIsvG,MAAM,iEAAkEluG,KAAK28G,aAC7D,UAArB38G,KAAK28G,cACL38G,KAAKpB,IAAIsvG,MAAM,kDACThQ,GAAWl+F,KAAKiiD,KAAK,IAAKlhD,EAAQigD,SAEnB,YAArBhhD,KAAK28G,cAEmB,MAApB38G,KAAKs9G,mBACCpf,GAAWl+F,KAAKs9G,YAAY99D,QAASz+C,EAAQigD,QAGvDhhD,KAAKpB,IAAIsvG,MAAM,mCACfluG,KAAK48G,eAAe14C,cACdg6B,GAAWl+F,KAAK68G,QAAQr9D,QAASz+C,EAAQigD,SAEnDhhD,KAAK28G,YAAc,SACnB38G,KAAKpB,IAAIsvG,MAAM,iCACnB,CAKA,KAAAhqC,CAAMjoE,GACF,GAAoB,WAAhB+D,KAAKwB,QAAuC,YAAhBxB,KAAKwB,QAAwC,UAAhBxB,KAAKwB,OAC9D,OAEJxB,KAAKpB,IAAI,mBAAoB3C,GAE7B+D,KAAKpB,IAAI,+BACT,MAAMmgC,EAAM/+B,KAAKi+G,YACb,GAAUl/E,IACVA,EAAIlxB,OAAO5R,IACP+D,KAAKpB,IAAI8I,MAAM,8BAA+BzL,EAAI,IAG1D+D,KAAKwB,OAAS,UACdxB,KAAKsjD,SAAS4gB,MAAQh6D,KAAKoqC,MAC3Bt0C,KAAKk+G,oBAAoBjiH,GACzB+D,KAAKo9G,UAAUnhH,EACnB,CAKA,KAAAoa,GACI,GAAoB,WAAhBrW,KAAKwB,QAAuC,YAAhBxB,KAAKwB,QAAwC,UAAhBxB,KAAKwB,OAC9D,OAEJ,MAAMvF,EAAM,IAAI,GAAU,eAjQT,oBAkQjB+D,KAAKwB,OAAS,QACdxB,KAAKsjD,SAASjtC,MAAQnM,KAAKoqC,MAC3Bt0C,KAAKk+G,oBAAoBjiH,GACzB+D,KAAKm9G,WACT,CACA,mBAAAe,CAAoBjiH,GAChB+D,KAAKm+G,WAAWliH,GAChB+D,KAAKo+G,aAAaniH,EACtB,CACA,UAAAkiH,CAAWliH,GAEkB,YAArB+D,KAAK28G,cACL38G,KAAKpB,IAAIsvG,MAAM,mBACfluG,KAAK48G,eAAe14C,SAExBlkE,KAAK69G,UAAU5hH,EACnB,CACA,YAAAmiH,CAAaniH,GAEe,YAApB+D,KAAK08G,YAAgD,WAApB18G,KAAK08G,aACtC18G,KAAKpB,IAAIsvG,MAAM,qDAAsDluG,KAAKg9G,aAAal8D,gBACvF9gD,KAAK08G,WAAa,UAClB18G,KAAKg9G,aAAahgH,IAAIf,GAE9B,CAKA,gBAAAoiH,GAC4B,YAApBr+G,KAAK08G,YAAgD,WAApB18G,KAAK08G,YAI1C18G,KAAKpB,IAAIsvG,MAAM,sBACfluG,KAAKo+G,gBAJDp+G,KAAKpB,IAAI,iEAKjB,CAKA,eAAA0/G,GAC6B,YAArBt+G,KAAK28G,aAAkD,WAArB38G,KAAK28G,aAI3C38G,KAAKpB,IAAIsvG,MAAM,qBACfluG,KAAKm+G,cAJDn+G,KAAKpB,IAAI,8DAKjB,CAKA,OAAAsK,GACwB,WAAhBlJ,KAAKwB,QAAuC,YAAhBxB,KAAKwB,QAAwC,UAAhBxB,KAAKwB,QAIlExB,KAAKpB,IAAIsvG,MAAM,oBACfluG,KAAKk+G,uBAJDl+G,KAAKpB,IAAI,6CAKjB,CAKA,UAAA2/G,CAAWngF,GACPp+B,KAAKg9G,aAAa1/G,KAAK8gC,EAC3B,CAKA,oBAAAogF,GACI,OAAOx+G,KAAKg9G,aAAal8D,cAC7B,EC9UG,MAAM29D,WAAoBjC,GAC7B3wG,KACA6yG,SACA38G,KACA6jB,MACA+4F,YACA,WAAA7xG,CAAY9B,GACR+iC,MAAM/iC,GACNhL,KAAK4lB,MAA2B,aAAnB5a,EAAKyxG,UAA2BzB,GAAwBQ,GACrEx7G,KAAK+B,KAAOiJ,EAAKjJ,KACjB/B,KAAK6L,KAAOb,EAAKa,KACjB7L,KAAK0+G,SAAW1zG,EAAK0zG,SACrB1+G,KAAK2+G,YAAc3zG,EAAK2zG,WAC5B,CACA,mBAAMlB,SACIz9G,KAAK+B,KAAK,CAAEuf,GAAIthB,KAAK0+G,SAAUx2G,KAAM8yG,GAAsBC,WAAY78E,KAAM,IAAIwd,GAAe,GAAqB57C,KAAK6L,QACpI,CACA,cAAM8xG,CAASv/E,GAEX,IADAA,EAAOA,EAAKoe,UACLpe,EAAKH,WAAa,GAAG,CACxB,MAAM2gF,EAASpiH,KAAKk4B,IAAI0J,EAAKH,WAAYj+B,KAAK2+G,mBACxC3+G,KAAK+B,KAAK,CACZuf,GAAIthB,KAAK0+G,SACTx2G,KAAMlI,KAAK4lB,MAAMs1F,QACjB98E,KAAMA,EAAKoe,QAAQ,EAAGoiE,KAE1BxgF,EAAK+d,QAAQyiE,EACjB,CACJ,CACA,eAAMX,SACIj+G,KAAK+B,KAAK,CAAEuf,GAAIthB,KAAK0+G,SAAUx2G,KAAMlI,KAAK4lB,MAAM01F,OAC1D,CACA,oBAAMsC,SACI59G,KAAK+B,KAAK,CAAEuf,GAAIthB,KAAK0+G,SAAUx2G,KAAMlI,KAAK4lB,MAAMw1F,OAC1D,CACA,mBAAM4C,GAEN,EC3BJ,SAASa,GAAahqE,GAClB,MAAMW,EAAS,IACRX,EACH3sC,KAAM,GAAG6yG,GAAiBlmE,EAAI3sC,UAAU2sC,EAAI3sC,SAQhD,OANI2sC,EAAI3sC,OAAS4yG,GAAaG,aAC1BzlE,EAAOpX,KAAO,GAAmByW,EAAIzW,gBAAgBz8B,WAAakzC,EAAIzW,KAAOyW,EAAIzW,KAAK7K,aAEtFshB,EAAI3sC,OAAS4yG,GAAaK,mBAAqBtmE,EAAI3sC,OAAS4yG,GAAaW,mBACzEjmE,EAAOpX,KAAO,GAAmByW,EAAIzW,gBAAgBz8B,WAAakzC,EAAIzW,KAAOyW,EAAIzW,KAAK7K,WAAY,WAE/FiiB,CACX,CACO,MAAMspE,GACTr5D,SAAW,eACXxD,KACAzjD,OACAI,IACAmgH,UACAC,SACAhO,MACAiO,QACAC,gBACAC,YACAC,aACA3kE,OACA,WAAA3tC,CAAYm3C,EAAYj5C,GACpBA,EAAOA,GAAQ,CAAC,EAChBhL,KAAKpB,IAAMqlD,EAAWxJ,OAAO2zD,aAAa,gBAC1CpuG,KAAKy6C,OAASwJ,EAAWxJ,OACzBz6C,KAAK++G,UAAY,EACjB/+G,KAAKg/G,SAAW,CAIZK,WAAY,IAAI5zE,IAIhB6zE,UAAW,IAAI7zE,KAEnBzrC,KAAKgxG,MAAQhmG,EACbhL,KAAKo/G,aAAep0G,EAAKo0G,cA3CX,IA+Cdp/G,KAAKiiD,KAAOjiD,KAAKu/G,cAIjBv/G,KAAKi/G,QAAU9+D,GAAS,CACpBO,YAAY,EACZH,MAAO,KAGH,IAAK,MAAM6B,KAAUpiD,KAAKg/G,SAASK,WAAW58F,SAC1C2/B,EAAOl5C,UAEX,IAAK,MAAMk5C,KAAUpiD,KAAKg/G,SAASM,UAAU78F,SACzC2/B,EAAOl5C,SACX,IAGRlJ,KAAKxB,OAASmjD,GAAK3hD,KAAKi/G,SAASzgH,GHhClCusC,gBAAuBvsC,GAC1B,UAAW,MAAMiL,KAAWjL,EAAQ,CAChC,MAAMi+C,EAAO,IAAIb,GACjBpyB,GAAQ9iB,MAAM+C,EAASgzC,SACjBA,CACV,CACJ,CG0BmD,CAAOj+C,KAIlDwB,KAAKk/G,gBAAkB,IAAI3B,gBAC3Bv9G,KAAKm/G,YAAc,IAAInG,GAAY,CAC/BrnC,OAAQ3mE,EAAKw0G,qBAvEI,EAwEjBtG,SAAU,GAElB,CAIA,WAAIuG,GAEA,MAAMA,EAAU,GAChB,IAAK,MAAMr9D,KAAUpiD,KAAKg/G,SAASK,WAAW58F,SAC1Cg9F,EAAQniH,KAAK8kD,GAEjB,IAAK,MAAMA,KAAUpiD,KAAKg/G,SAASM,UAAU78F,SACzCg9F,EAAQniH,KAAK8kD,GAEjB,OAAOq9D,CACX,CAKA,SAAAj8D,CAAU33C,GACN,GAAI7L,KAAKk/G,gBAAgBl+D,OAAO8J,QAC5B,MAAM,IAAI9sD,MAAM,wBAEpB,MAAMsjB,EAAKthB,KAAK++G,YAChBlzG,EAAe,MAARA,EAAeyV,EAAG7iB,WAAaoN,EAAKpN,WAC3C,MAAMihH,EAAW1/G,KAAKg/G,SAASK,WAC/B,OAAOr/G,KAAK2/G,WAAW,CAAEr+F,KAAIzV,OAAM3D,KAAM,YAAaw3G,YAC1D,CAIA,WAAMtI,CAAMr2G,GACR,GAAIf,KAAKk/G,gBAAgBl+D,OAAO8J,QAC5B,OAEJ,MAAM9J,EAASjgD,GAASigD,QAAUm2D,YAAYprD,QAAQ/rD,KAAKo/G,cAC3D,UAEUtjH,QAAQ2lD,IAAIzhD,KAAKy/G,QAAQ/zG,KAAIq/B,MAAOx1B,GAAMA,EAAE6hG,MAAM,CACpDp2D,cAEJhhD,KAAKi/G,QAAQjiH,YAEPgD,KAAKi/G,QAAQl+D,QAAQ,CACvBC,WAEJhhD,KAAKk/G,gBAAgBh7C,OACzB,CACA,MAAOjoE,GACH+D,KAAKkkE,MAAMjoE,EACf,CACJ,CACA,KAAAioE,CAAMjoE,GACE+D,KAAKk/G,gBAAgBl+D,OAAO8J,UAGhC9qD,KAAKy/G,QAAQ3zG,SAAQyJ,IAAOA,EAAE2uD,MAAMjoE,EAAI,IACxC+D,KAAKk/G,gBAAgBh7C,MAAMjoE,GAC/B,CAIA,kBAAA2jH,CAAmB7+G,GACf,MAAM,GAAEugB,EAAE,KAAEzV,GAAS9K,EACf2+G,EAAW1/G,KAAKg/G,SAASM,UAC/B,OAAOt/G,KAAK2/G,WAAW,CAAEr+F,KAAIzV,OAAM3D,KAAM,WAAYw3G,YACzD,CACA,UAAAC,CAAW5+G,GACP,MAAM,GAAEugB,EAAE,KAAEzV,EAAI,KAAE3D,EAAI,SAAEw3G,GAAa3+G,EAErC,GADAf,KAAKpB,IAAI,mBAAoBsJ,EAAMoZ,GACtB,cAATpZ,GAAwBlI,KAAKg/G,SAASK,WAAWn5G,QAAUlG,KAAKgxG,MAAMsF,oBAlJ9B,MAmJxC,MAAM,IAAI,GAAU,iCAAkC,iCAE1D,GAAIoJ,EAAS/wG,IAAI2S,GACb,MAAM,IAAItjB,MAAM,GAAGkK,YAAeoZ,qBAEtC,MAaM8gC,EDpIP,SAAsBrhD,GACzB,MAAM,GAAEugB,EAAE,KAAEzV,EAAI,KAAE9J,EAAI,MAAEw+C,EAAK,KAAEr4C,EAAO,YAAW,WAAE23G,EAAajE,IAAiB76G,EACjF,OAAO,IAAI09G,GAAY,CACnBn9F,GAAa,cAATpZ,EAAuB,IAAKoZ,IAAQ,IAAIA,IAC5Co9F,SAAUp9F,EACVzV,KAAM,GAAGA,GAAQyV,IACjBm7F,UAAoB,cAATv0G,EAAuB,WAAa,UAC/Cy2G,YAAakB,EACbt/D,QACAx+C,OACAnD,IAAKmC,EAAQ05C,OAAO2zD,aAAa,uBAAuBlmG,KAAQoZ,MAExE,CCwHuByhC,CAAa,CAAEzhC,KAAIzV,OAAM9J,KAb3BgpC,MAAO8J,IACZ70C,KAAKpB,IAAImL,SACT/J,KAAKpB,IAAIsvG,MAAM,oBAAqBhmG,EAAMoZ,EAAIu9F,GAAahqE,IAE/D70C,KAAKi/G,QAAQ3hH,KAAKu3C,EAAI,EASoB3sC,OAAMq4C,MAPtC,KACVvgD,KAAKpB,IAAI,6CAA8CsJ,EAAMoZ,EAAI8gC,EAAOqD,UACxEi6D,EAAS18D,OAAO1hC,GACc,MAA1BthB,KAAKgxG,MAAM8O,aACX9/G,KAAKgxG,MAAM8O,YAAY19D,EAC3B,EAEuDy9D,WAAY7/G,KAAKgxG,MAAM6O,WAAYplE,OAAQz6C,KAAKy6C,SAE3G,OADAilE,EAAS30G,IAAIuW,EAAI8gC,GACVA,CACX,CAKA,WAAAm9D,GAuBI,OAtBax0E,MAAOvsC,IAChB,MAAMk/G,EAAgB,KAClBtF,GAAY55G,EAAQwB,KAAKpB,IAAI,EAEjCoB,KAAKk/G,gBAAgBl+D,OAAOG,iBAAiB,QAASu8D,GACtD,IACI,MAAMj0F,EAAU,IAAI,GAAQzpB,KAAKgxG,MAAM6O,WAAY7/G,KAAKgxG,MAAMiL,gCAC9D,UAAW,MAAM9+G,KAASqB,EACtB,IAAK,MAAMq2C,KAAOprB,EAAQ/iB,MAAMvJ,SACtB6C,KAAK+/G,gBAAgBlrE,GAGnC70C,KAAKi/G,QAAQjiH,KACjB,CACA,MAAOf,GACH+D,KAAKpB,IAAI,gBAAiB3C,GAC1B+D,KAAKi/G,QAAQjiH,IAAIf,EACrB,CACA,QACI+D,KAAKk/G,gBAAgBl+D,OAAOK,oBAAoB,QAASq8D,EAC7D,EAGR,CACA,qBAAMqC,CAAgBt2G,GAClB,MAAM,GAAE6X,EAAE,KAAEpZ,GAASuB,EAKrB,GAJIzJ,KAAKpB,IAAImL,SACT/J,KAAKpB,IAAIsvG,MAAM,mBAAoB2Q,GAAap1G,IAGhDA,EAAQvB,OAAS4yG,GAAaG,WAAY,CAC1C,GAAIj7G,KAAKg/G,SAASM,UAAUp5G,QAAUlG,KAAKgxG,MAAMzpD,mBA9MV,MA8M4E,CAC/GvnD,KAAKpB,IAAI,iCAGToB,KAAKi/G,QAAQ3hH,KAAK,CACdgkB,KACApZ,KAAM4yG,GAAaa,iBAKvB,UACU37G,KAAKm/G,YAAYhjE,QAAQ,aAAc,EACjD,CACA,MAII,OAHAn8C,KAAKpB,IAAI,mHAEToB,KAAKkkE,MAAM,IAAIlmE,MAAM,yBAEzB,CACA,MACJ,CACA,MAAMokD,EAASpiD,KAAK4/G,mBAAmB,CAAEt+F,KAAIzV,KAAM,GAAmBpC,EAAQ20B,gBAAgBz8B,WAAa8H,EAAQ20B,KAAO30B,EAAQ20B,KAAK7K,cAIvI,YAHmC,MAA/BvzB,KAAKgxG,MAAMgP,kBACXhgH,KAAKgxG,MAAMgP,iBAAiB59D,GAGpC,CACA,MACMA,GADsB,GAAdl6C,EAA6ClI,KAAKg/G,SAASM,UAAzCt/G,KAAKg/G,SAASK,YAC1Bv0G,IAAIwW,GACxB,GAAc,MAAV8gC,EAAgB,CAChBpiD,KAAKpB,IAAI,wCAAyC0iB,EAAIy5F,GAAiB7yG,IAIvE,UACUlI,KAAKm/G,YAAYhjE,QAAQ,iBAAkB,EACrD,CACA,MAII,OAHAn8C,KAAKpB,IAAI,yGAEToB,KAAKkkE,MAAM,IAAIlmE,MAAM,yCAEzB,CACA,MACJ,CACA,MAAMiiH,EAAgBjgH,KAAKgxG,MAAMkP,qBA1PV,QA2PvB,IACI,OAAQh4G,GACJ,KAAK4yG,GAAaK,kBAClB,KAAKL,GAAaW,iBACd,GAAIr5D,EAAOo8D,uBAAyByB,EAOhC,MALAjgH,KAAKi/G,QAAQ3hH,KAAK,CACdgkB,GAAI7X,EAAQ6X,GACZpZ,KAAMA,IAAS4yG,GAAaK,kBAAoBL,GAAaa,eAAiBb,GAAaS,kBAGzF,IAAI,GAAU,iFAAkF,gCAG1Gn5D,EAAOm8D,WAAW90G,EAAQ20B,MAC1B,MACJ,KAAK08E,GAAaO,gBAClB,KAAKP,GAAaY,eAEdt5D,EAAOi8D,mBACP,MACJ,KAAKvD,GAAaS,gBAClB,KAAKT,GAAaa,eAEdv5D,EAAO/rC,QACP,MACJ,QACIrW,KAAKpB,IAAI,0BAA2BsJ,GAEhD,CACA,MAAOjM,GACH+D,KAAKpB,IAAI8I,MAAM,iCAAkCzL,GACjDmmD,EAAO8hB,MAAMjoE,EACjB,CACJ,ECvQJ,MAAMkkH,GACF16D,SAAW,eACXurD,MACA/sD,WACA,WAAAn3C,CAAYm3C,EAAYj5C,EAAO,CAAC,GAC5BhL,KAAKikD,WAAaA,EAClBjkD,KAAKgxG,MAAQhmG,CACjB,CACA,CAACgD,OAAO80B,aAAe,gBACvB,CAACi6D,IAAuB,CACpB,+BAEJ,iBAAAqjB,CAAkBp1G,EAAO,CAAC,GACtB,OAAO,IAAI8zG,GAAiB9+G,KAAKikD,WAAY,IACtCj5C,KACAhL,KAAKgxG,OAEhB,EAEG,SAASqP,GAAMr1G,EAAO,CAAC,GAC1B,OAAQi5C,GAAe,IAAIk8D,GAAMl8D,EAAYj5C,EACjD,CCNA,MCnCas1G,GAAqB,qBCR3B,MAAMC,GACT96D,SACAxB,WACAmyD,QACArqD,QACAxE,kBACA+uD,mBACAG,yBACA73G,IACA,WAAAkO,CAAYm3C,EAAYj5C,EAAO,CAAC,GAC5BhL,KAAKikD,WAAaA,EAClBjkD,KAAKpB,IAAMqlD,EAAWxJ,OAAO2zD,aAAa,eAC1CpuG,KAAKo2G,SAAU,EACfp2G,KAAKylD,SAAW,IAAIz6C,EAAK2rG,gBDfF,oBCgBvB32G,KAAK+rD,QAAU/gD,EAAK+gD,SDfL,ICgBf/rD,KAAKunD,kBAAoBv8C,EAAKu8C,mBDTH,ECU3BvnD,KAAKs2G,mBAAqBtrG,EAAKsrG,oBDTH,ECU5Bt2G,KAAKy2G,yBAA2BzrG,EAAKyrG,2BAA4B,EACjEz2G,KAAKwgH,cAAgBxgH,KAAKwgH,cAAc18G,KAAK9D,KACjD,CACA,CAACgO,OAAO80B,aAAe,eACvB,WAAM/lC,SACIiD,KAAKikD,WAAWqQ,UAAUjN,OAAOrnD,KAAKylD,SAAUzlD,KAAKwgH,cAAe,CACtEj5D,kBAAmBvnD,KAAKunD,kBACxB+uD,mBAAoBt2G,KAAKs2G,mBACzBG,yBAA0Bz2G,KAAKy2G,2BAEnCz2G,KAAKo2G,SAAU,CACnB,CACA,UAAM3oG,SACIzN,KAAKikD,WAAWqQ,UAAUyiD,SAAS/2G,KAAKylD,UAC9CzlD,KAAKo2G,SAAU,CACnB,CACA,SAAAxpD,GACI,OAAO5sD,KAAKo2G,OAChB,CAIA,aAAAoK,CAAcpiF,GACVp+B,KAAKpB,IAAI,wBAAyBw/B,EAAK+kB,WAAWqC,YAClD,MAAM,OAAEpD,GAAWhkB,EACbrhC,EAAQmN,KAAKoqC,MACJ6iE,YAAYprD,QAAQ/rD,KAAK+rD,SACjC5K,iBAAiB,SAAS,KAC7BiB,GAAQ8hB,MAAM,IAAI,GAAU,eAAgBlP,IAAa,IAExDrT,GAAKS,GAAQrX,gBAAiBvsC,GAC/B,IAAIiiH,EAAW,EACf,UAAW,MAAMl+G,KAAO/D,EAAQ,CAE5B,GADAiiH,GAAYl+G,EAAI07B,WACZwiF,EDxDO,GC0DP,YADAr+D,GAAQ8hB,MAAM,IAAI,GAAU,yB9GUb,8B8GPb3hE,CACV,CACJ,GAAG6/C,GACEv0C,OAAM5R,IACP+D,KAAKpB,IAAI8I,MAAM,0CAA2C02B,EAAK+kB,WAAWqC,WAAYvpD,GACtFmmD,GAAQ8hB,MAAMjoE,EAAI,IAEjBgvD,SAAQ,KACT,MAAM9gD,EAAKD,KAAKoqC,MAAQv3C,EACxBiD,KAAKpB,IAAI,yCAA0Cw/B,EAAK+kB,WAAWqC,WAAYr7C,EAAG,GAE1F,CAIA,UAAM67C,CAAKpD,EAAM7hD,EAAU,CAAC,GACxBf,KAAKpB,IAAI,aAAcgkD,GACvB,MAAM7lD,EAAQmN,KAAKoqC,MACblW,EAAO,GD9EM,IC+Eb+kB,QAAmBnjD,KAAKikD,WAAWI,kBAAkBq8D,eAAe99D,EAAM7hD,GAChF,IAAIqhD,EACAg7D,EAAU,OACd,GAAsB,MAAlBr8G,EAAQigD,OAAgB,CACxB,MAAMA,EAASm2D,YAAYprD,QAAQ/rD,KAAK+rD,SACxChrD,EAAU,IACHA,EACHigD,SAER,CACA,IACIoB,QAAee,EAAWK,UAAUxjD,KAAKylD,SAAU,IAC5C1kD,EACH01G,yBAA0Bz2G,KAAKy2G,2BAEnC2G,EAAU,KACNh7D,GAAQ8hB,MAAM,IAAI,GAAU,eAAgBlP,IAAa,EAG7Dj0D,EAAQigD,QAAQG,iBAAiB,QAASi8D,EAAS,CAAEpuG,MAAM,IAC3D,MAAMb,QAAewzC,GAAK,CAACvjB,GAAOgkB,GAAQrX,MAAOvsC,GFjE7D,SAAeA,GACX,GAHsC,MAGlBA,EAHPwP,OAAOC,eAIhB,MAAO,WACH,UAAW,MAAMqtC,KAAS98C,EACtB,OAAO88C,CAGd,EALM,GAOX,IAAK,MAAMA,KAAS98C,EAChB,OAAO88C,CAGf,CEoDwE,CAAM98C,KAC5D2L,EAAKD,KAAKoqC,MAAQv3C,EACxB,GAAc,MAAVoR,EACA,MAAM,IAAI,GAAU,oCAAoChE,MAAQm2G,IAEpE,IAAK,GAAiBliF,EAAMjwB,EAAOolB,YAC/B,MAAM,IAAI,GAAU,iCAAiCppB,MAAQm2G,IAGjE,OADAtgH,KAAKpB,IAAI,2BAA4BukD,EAAWqC,WAAYr7C,GACrDA,CACX,CACA,MAAOlO,GAGH,MAFA+D,KAAKpB,IAAI8I,MAAM,yBAA0By7C,EAAWqC,WAAYvpD,GAChEmmD,GAAQ8hB,MAAMjoE,GACRA,CACV,CACA,QACI8E,EAAQigD,QAAQK,oBAAoB,QAAS+7D,GAC/B,MAAVh7D,SACMA,EAAOg1D,OAErB,CACJ,EClGG,SAASpxD,GAAKh7C,EAAO,CAAC,GACzB,OAAQi5C,GAAe,IAAIs8D,GAAiBt8D,EAAYj5C,EAC5D,CC1BO,MAAM21G,GAAkB3yG,OAAOw+B,IAAI,qBAOnC,IAAIo0E,IACX,SAAWA,GAIPA,EAAeA,EAA0B,UAAI,GAAK,YAIlDA,EAAeA,EAAyB,SAAI,GAAK,UACpD,CATD,CASGA,KAAmBA,GAAiB,CAAC,ICcxC,MAAMC,GAAoB,CACtB,GAAU,OAAOx0G,KACjB,GAAU,OAAOA,KACjB,GAAU,WAAWA,KACrB,GAAU,QAAQA,KAClB,GAAU,QAAQA,MAEtB,SAASy0G,GAAWlQ,GAChB,IAAImQ,EACJ,IACIA,EAAe,GAAU,OAAO10G,IACpC,CACA,MAAO/G,GAEH,OAAO,IACX,CACA,IAAK,MAAOs1C,EAAOn7C,KAAUmxG,EACzB,GAAIh2D,IAAUmmE,QAA0BhjH,IAAV0B,EAC1B,OAAOA,EAGf,OAAO,IACX,CACA,SAASuhH,GAAOpQ,GACZ,OAAOA,EAAG7sD,MAAK,EAAEnJ,EAAOruC,KAAOquC,IAAU,GAAU,OAAOvuC,MAC9D,CACA,SAAS40G,GAAcC,EAAeC,EAAcC,GAChD,MAAMC,EAAcC,GAAa,GAAUJ,GAAer1G,MAC1D,QAAoB9N,IAAhBsjH,EACA,MAAM,IAAIrjH,MAAM,4BAA4B,GAAUkjH,GAAer1G,QAEzE,MAAM01G,EAAUF,EAAYF,EAAcC,GAC1C,OAAIF,IAAkB,GAAU,OAAO70G,KAC5B,IAAIk1G,KAERA,CACX,CACA,MAAMD,GAAe,CACjBxmD,IAAK,CAACr7D,EAAO2hH,IAAW3hH,EACxBs7D,IAAK,CAACt7D,EAAO2hH,IACa,IAAlBA,EAAO1lH,OACA+D,EAEJ,IAAIA,KAEfm7D,IAAK,CAACn7D,EAAO2hH,KACT,MAAMI,EAAYJ,EAAOxlD,MACzB,QAAkB79D,IAAdyjH,EACA,MAAM,IAAIxjH,MAAM,+BAEpB,MAAO,SAASijH,GAAcO,EAAU,GAAIA,EAAU,IAAM,GAAIJ,MAAW3hH,GAAO,EAEtFo7D,IAAK,CAACp7D,EAAO2hH,KACT,MAAMI,EAAYJ,EAAOxlD,MACzB,QAAkB79D,IAAdyjH,EACA,MAAM,IAAIxjH,MAAM,+BAEpB,MAAO,SAASijH,GAAcO,EAAU,GAAIA,EAAU,IAAM,GAAIJ,MAAW3hH,GAAO,EAEtFgiH,QAAS,CAAChiH,EAAO2hH,IAAW3hH,EAC5BiiH,KAAM,CAACjiH,EAAO2hH,IAAW3hH,EACzBu7D,KAAM,CAACv7D,EAAO2hH,IAAW3hH,EACzBkiH,IAAK,CAACliH,EAAO2hH,IAAW3hH,EACxBmiH,KAAM,CAACniH,EAAO2hH,KACV,MAAMI,EAAYJ,EAAOxlD,MACzB,QAAkB79D,IAAdyjH,EACA,MAAM,IAAIxjH,MAAM,+BAEpB,MAAO,GAAGijH,GAAcO,EAAU,GAAIA,EAAU,IAAM,GAAIJ,WAAgB3hH,GAAO,EAErFi8D,IAAK,CAACj8D,EAAO2hH,KACT,MAAMI,EAAYJ,EAAOxlD,MACzB,QAAkB79D,IAAdyjH,EACA,MAAM,IAAIxjH,MAAM,+BAEpB,MAAO,GAAGijH,GAAcO,EAAU,GAAIA,EAAU,IAAM,GAAIJ,UAAe3hH,GAAO,EAEpFoiH,KAAM,CAACpiH,EAAO2hH,KACV,MAAMU,EAAWd,GAAOI,GAClBW,EAAMjB,GAAWM,GACvB,GAAIU,GAAoB,OAARC,EACZ,MAAO,WAAWA,IAEtB,MAAMt8D,EAAWq8D,EAAW,WAAa,UACnCN,EAAYJ,EAAOxlD,MACzB,QAAkB79D,IAAdyjH,EACA,MAAM,IAAIxjH,MAAM,+BAEpB,IAAIgkH,EAAUf,GAAcO,EAAU,GAAIA,EAAU,IAAM,GAAIJ,GAG9D,OADAY,EAAUA,EAAQ1iH,QAAQ,SAAU,IAC7B,GAAGmmD,IAAWu8D,GAAS,EAElC,YAAa,CAACviH,EAAO2hH,KACjB,MAAMI,EAAYJ,EAAOxlD,MACzB,QAAkB79D,IAAdyjH,EACA,MAAM,IAAIxjH,MAAM,+BAIpB,MAAO,GAFSijH,GAAcO,EAAU,GAAIA,EAAU,IAAM,GAAIJ,MAC3C3hF,mBAAmBhgC,IACL,EAEvCwiH,IAAK,CAACxiH,EAAO2hH,KAGT,MAAMI,EAAYJ,EAAOxlD,MACzB,QAAkB79D,IAAdyjH,EACA,MAAM,IAAIxjH,MAAM,+BAEpB,OAAOijH,GAAcO,EAAU,GAAIA,EAAU,IAAM,GAAIJ,EAAO,EAElEW,IAAK,CAACtiH,EAAO2hH,KAGT,MAAMI,EAAYJ,EAAOxlD,MACzB,QAAkB79D,IAAdyjH,EACA,MAAM,IAAIxjH,MAAM,+BAEpB,OAAOijH,GAAcO,EAAU,GAAIA,EAAU,IAAM,GAAIJ,EAAO,EAElEc,MAAO,CAACziH,EAAO2hH,KACX,MAAMI,EAAYJ,EAAOxlD,MACzB,QAAkB79D,IAAdyjH,EACA,MAAM,IAAIxjH,MAAM,+BAEpB,IAAIgkH,EAAUf,GAAcO,EAAU,GAAIA,EAAU,IAAM,GAAIJ,GAG9D,OADAY,EAAUA,EAAQ1iH,QAAQ,SAAU,IAC7B,WAAW0iH,GAAS,EAE/BG,GAAI,CAAC1iH,EAAO2hH,KACR,MAAMU,EAAWd,GAAOI,GAClBW,EAAMjB,GAAWM,GACvB,GAAIU,GAAoB,OAARC,EACZ,MAAO,SAASA,IAEpB,MAAMt8D,EAAWq8D,EAAW,SAAW,QACjCN,EAAYJ,EAAOxlD,MACzB,QAAkB79D,IAAdyjH,EACA,MAAM,IAAIxjH,MAAM,+BAEpB,IAAIgkH,EAAUf,GAAcO,EAAU,GAAIA,EAAU,IAAM,GAAIJ,GAG9D,OADAY,EAAUA,EAAQ1iH,QAAQ,SAAU,IAC7B,GAAGmmD,IAAWu8D,GAAS,EAElCI,IAAK,CAAC3iH,EAAO2hH,KACT,MAAMI,EAAYJ,EAAOxlD,MACzB,QAAkB79D,IAAdyjH,EACA,MAAM,IAAIxjH,MAAM,+BAEpB,IAAIgkH,EAAUf,GAAcO,EAAU,GAAIA,EAAU,IAAM,GAAIJ,GAG9D,OADAY,EAAUA,EAAQ1iH,QAAQ,SAAU,IAC7B,SAAS0iH,GAAS,EAE7B,qBAAsB,CAACviH,EAAO2hH,KAC1B,MAAMI,EAAYJ,EAAOxlD,MACzB,QAAkB79D,IAAdyjH,EACA,MAAM,IAAIxjH,MAAM,+BAEpB,MAAO,GAAGijH,GAAcO,EAAU,GAAIA,EAAU,IAAM,GAAIJ,uBAA4B,EAE1F,kBAAmB,CAAC3hH,EAAO2hH,KACvB,MAAMI,EAAYJ,EAAOxlD,MACzB,QAAkB79D,IAAdyjH,EACA,MAAM,IAAIxjH,MAAM,+BAEpB,MAAO,GAAGijH,GAAcO,EAAU,GAAIA,EAAU,IAAM,GAAIJ,oBAAyB,EAEvF,oBAAqB,CAAC3hH,EAAO2hH,KACzB,MAAMI,EAAYJ,EAAOxlD,MACzB,QAAkB79D,IAAdyjH,EACA,MAAM,IAAIxjH,MAAM,+BAEpB,MAAO,GAAGijH,GAAcO,EAAU,GAAIA,EAAU,IAAM,GAAIJ,sBAA2B,GC9M7F,SAAsBiB,IAElB,GAAIA,EAAO9gH,YAAc,EACrB,MAAM,IAAIvD,MAAM,iBAGM,IAAtBqkH,EAAO9gH,kBAGL,IAAIzF,SAAQ,CAACC,EAASC,KACxB,SAASsmH,IACLD,EAAOhhE,oBAAoB,OAAQkhE,GACnCF,EAAOhhE,oBAAoB,QAASmhE,EACxC,CACA,SAASD,IACLD,IACAvmH,GACJ,CACA,SAASymH,EAAU/zG,GACf6zG,IACAtmH,EAAOyS,EAAM/G,OAAS,IAAI1J,MAAM,wBAAwBqkH,EAAOxkB,OACnE,CACAwkB,EAAOlhE,iBAAiB,OAAQohE,GAChCF,EAAOlhE,iBAAiB,QAASqhE,EAAU,GAElD,ECxBD,IAAgBH,EAAQthH,MACpBA,EAAUA,GAAW,CAAC,GACd0hH,YAAoC,IAAvB1hH,EAAQ0hH,WAChB13E,MAAOvsC,IAChB,UAAW,MAAM4/B,KAAQ5/B,EAAQ,CAC7B,UACUkkH,GAAML,EAChB,CACA,MAAOpmH,GACH,GAAoB,kBAAhBA,EAAIwN,QACJ,MACJ,MAAMxN,CACV,CAGA,GAAIomH,EAAO9gH,aAAe8gH,EAAOM,SAAWN,EAAO9gH,aAAe8gH,EAAOO,OACrE,MAEJP,EAAOtgH,KAAKq8B,EAChB,CAC0B,MAAtBr9B,EAAQ0hH,YAAsBJ,EAAO9gH,YAAc,SAC7C,IAAIzF,SAAQ,CAACC,EAASC,KACxBqmH,EAAOlhE,iBAAiB,SAAS1yC,IAC7B,GAAIA,EAAMo0G,UAA2B,OAAfp0G,EAAMpC,KACxBtQ,QAEC,CACD,MAAME,EAAM6C,OAAOoN,OAAO,IAAIlO,MAAM,YAAa,CAAEyQ,UACnDzS,EAAOC,EACX,KAEJw5B,YAAW,KAAQ4sF,EAAOjL,OAAO,GAAI,GAE7C,mCC9BR,SAASj5E,GAAchyB,GACnB,OAAQA,aAAe6G,aACS,gBAA3B7G,GAAKW,aAAajB,MAAqD,iBAApBM,GAAK8xB,UACjE,CACA,MCPA,aCDMvyB,GAAM,CAAE,QAAS,MAAO,SAAU,QCIjC,SAASo3G,GAAQjqD,EAAMxzB,GAE1BA,EAAOA,GAAQ,CAAC,EAChB,MAAMw4D,EDLV,EAAgBA,EAAKklB,KAIjB,GAHIllB,EAAI5rE,WAAW,QACf4rE,EAAM,GAAGklB,GAAUt9D,UAHH,QAGiCo4C,KAEjDA,EAAI5rE,WAAW,MAAoB,MAAZ8wF,EAAkB,CACzC,MAAMnoE,EAAQmoE,EAASt9D,UANP,MAOViV,EAAOqoD,EAASroD,KAChB5B,EAAwB,MAAjBiqD,EAASjqD,OAAwD,IAAxC4B,GAAM1oC,SAAS,IAAI+wF,EAASjqD,QAAmB,IAAIiqD,EAASjqD,OAAS,GAC3G+kC,EAAM,GAAGjjD,MAAU8f,IAAO5B,IAAO+kC,GACrC,CACA,MAAMmlB,EAAQ,IAAIjlB,IAAIF,GACtB,IAAK,MAAOolB,EAAWC,KAAYpkH,OAAO+/D,QAAQnzD,IAC1Cs3G,EAAMv9D,WAAaw9D,IACnBD,EAAMv9D,SAAWy9D,GAGzB,OAAOF,CACV,ECZe,CAAMnqD,EAFiB,oBAAX5wD,YAAyBlK,EAAYkK,OAAO86G,UAKpE,MCRJ,EAAgBV,EAAQthH,KACpBA,EAAUA,GAAW,CAAC,EACtB,MAAMoiH,EJIV,CAAgBd,IACZA,EAAOe,WAAa,cACpB,MAAMC,EAAYt4E,gBACR,IAAIjvC,SAAQ,CAACC,EAASC,KACxB,GAAIszD,EAEA,YADAvzD,IAGJ,GAAiB,MAAbunH,EAEA,YADAtnH,EAAOsnH,GAGX,MAAMC,EAAWC,IACbnB,EAAOhhE,oBAAoB,OAAQoiE,GACnCpB,EAAOhhE,oBAAoB,QAASqiE,GACpCF,GAAM,EAEJC,EAAS,KAAQF,EAAQxnH,EAAQ,EACjC2nH,EAAWj1G,IACb80G,GAAQ,KAAQvnH,EAAOyS,EAAM/G,OAAS,IAAI1J,MAAM,wBAAwBqkH,EAAOxkB,OAAO,GAAI,EAE9FwkB,EAAOlhE,iBAAiB,OAAQsiE,GAChCpB,EAAOlhE,iBAAiB,QAASuiE,EAAQ,GAC3C,EAEAllH,EAAUusC,kBACZ,MAAMmG,EAAW,IAAI,OAAc,EAAG5zC,OAAMmQ,OAAME,WAC9C,MAAMg2G,EAAal1G,IACf,IAAI2vB,EAAO,KACe,iBAAf3vB,EAAM2vB,OACbA,EAAO,GAAqB3vB,EAAM2vB,OAElCD,GAAc1vB,EAAM2vB,QACpBA,EAAO,IAAIz8B,WAAW8M,EAAM2vB,OAE5B3vB,EAAM2vB,gBAAgBz8B,aACtBy8B,EAAO3vB,EAAM2vB,MAEL,MAARA,GAGJ9gC,EAAK8gC,EAAK,EAERslF,EAAWj1G,IAAYd,EAAKc,EAAM/G,OAAS,IAAI1J,MAAM,gBAAgB,EAI3E,OAHAqkH,EAAOlhE,iBAAiB,UAAWwiE,GACnCtB,EAAOlhE,iBAAiB,QAASuiE,GACjCrB,EAAOlhE,iBAAiB,QAAS1zC,GAC1B,KACH40G,EAAOhhE,oBAAoB,UAAWsiE,GACtCtB,EAAOhhE,oBAAoB,QAASqiE,GACpCrB,EAAOhhE,oBAAoB,QAAS5zC,EAAK,CAC5C,GACF,CAAEF,cAAe1J,YACdw/G,IACN,UAAW,MAAMlmH,KAAS+zC,QAChB/S,GAAchhC,GAAS,IAAIwE,WAAWxE,GAASA,CAE7D,CAhCe,GAiCf,IACImmH,EADAh0D,EAAoC,IAAtB+yD,EAAO9gH,WAezB,OAbA8gH,EAAOlhE,iBAAiB,QAAQ,KAC5BmO,GAAc,EACdg0D,EAAY,IAAI,IAEpBjB,EAAOlhE,iBAAiB,SAAS,KAC7BmO,GAAc,EACdg0D,EAAY,IAAI,IAEpBjB,EAAOlhE,iBAAiB,SAAS1yC,IACxB6gD,IACDg0D,EAAY70G,EAAM/G,OAAS,IAAI1J,MAAM,wBAAwBqkH,EAAOxkB,OACxE,IAEG/+F,OAAOoN,OAAO1N,EAAQ,CACzB6kH,aAEP,EIhF2B7kH,CAAO6jH,GAC/B,IAAIuB,EAAgB7iH,EAAQ6iH,cACxBC,EAAa9iH,EAAQ8iH,WACzB,GAAkB,MAAdxB,EAAOxkB,IAEP,IACI,MAAMA,EAAM,IAAIE,IAAIskB,EAAOxkB,KAC3B+lB,EAAgB/lB,EAAIimB,SACpBD,EAAa/6G,SAAS+0F,EAAI/kC,KAAM,GACpC,CACA,MAAQ,CAEZ,GAAqB,MAAjB8qD,GAAuC,MAAdC,EACzB,MAAM,IAAI7lH,MAAM,sDA4BpB,MA1Be,CACXikD,KAAMA,GAAKogE,EAAQthH,GACnBvC,OAAQ2kH,EACRE,UAAWt4E,gBAAoBo4E,EAAgBE,WAAW,EAC1DjM,MAAOrsE,UACCs3E,EAAO9gH,aAAe8gH,EAAO0B,YAAc1B,EAAO9gH,aAAe8gH,EAAO2B,YAClE,IAAIloH,SAASC,IACfsmH,EAAOlhE,iBAAiB,SAAS,KAC7BplD,GAAS,IAEbsmH,EAAOjL,OAAO,GAEtB,EAEJluG,QAAS,KACmB,MAApBm5G,EAAO4B,UACP5B,EAAO4B,YAGP5B,EAAOjL,OACX,EAEJwM,gBACAC,aACAxB,SAGP,EDpCUvgE,CADQ,IAAI,GAAU+7C,EAAIp/F,WAAY4mC,EAAK6+E,WAC5B7+E,EAC1B,CENO,MAAM8+E,WAA4BC,MACrC,WAAAt3G,CAAY5E,EAAMy7C,GACd5V,MAAM7lC,GACNlI,KAAK2jD,OAASA,CAClB,ECRG,MAAM,GAAW,IACX,GAAe,ICArB,SAAS,GAAIwtD,GAChB,OAAOA,EAAWz0F,QAAQk0F,IACtB,GAAIA,EAAGz1C,aAAax+C,SAAS,IACzB,OAAO,EAEX,MAAM0nG,EAASzT,EAAGp1C,gBAAgB,IAClC,OAAO,GAAiBq1C,QAAQwT,IAC5B,GAAuBxT,QAAQwT,EAAO,GAElD,CACO,SAASjC,GAAIjR,GAChB,OAAOA,EAAWz0F,QAAQk0F,IACtB,GAAIA,EAAGz1C,aAAax+C,SAAS,IACzB,OAAO,EAEX,MAAM0nG,EAASzT,EAAGp1C,gBAAgB,IAClC,OAAO,GAAuBq1C,QAAQwT,EAAO,GAErD,CCgDA,MAAM,GACFzlH,IACAoM,KACAyvC,OACAgyD,QACAxoD,WACA,WAAAn3C,CAAYm3C,EAAYj5C,GACpBhL,KAAKpB,IAAMqlD,EAAWxJ,OAAO2zD,aAAa,qBAC1CpuG,KAAKy6C,OAASwJ,EAAWxJ,OACzBz6C,KAAKikD,WAAaA,EAClBjkD,KAAKgL,KAAOA,EACc,MAAtBi5C,EAAWwoD,UACXzsG,KAAKysG,QAAU,CACX6X,aAAcrgE,EAAWwoD,QAAQ8X,qBAAqB,wCAAyC,CAC3FC,MAAO,QACPvX,KAAM,qDAItB,CACA,CAAC0T,KAAmB,EACpB,CAAC3yG,OAAO80B,aAAe,qBACvB,CAACi6D,IAAuB,CACpB,qBAEJ,UAAMprC,CAAKi/C,EAAI7vG,GACXf,KAAKpB,IAAI,aAAcgyG,GACvB7vG,EAAUA,GAAW,CAAC,EACtB,MACM0jH,EC7FP,SAAwBriE,EAAQ+1D,EAAYp3G,GAC/C,MAAMnC,EAAMmC,EAAQ05C,OAAO2zD,aAAa,4BAClC3B,EAAU1rG,EAAQ0rG,QAClBiY,EAAe3jH,EAAQ2jH,cAAgB,GACvCD,EAAS,CACX7lH,MACA,UAAMqjD,CAAKzjD,GACP,UACU4jD,EAAOH,KAAK,kBACd,UAAW,MAAM1/C,KAAO/D,EAChB+D,aAAeZ,iBACTY,QAGAA,EAAIgxB,UAGrB,CATiB,GAUtB,CACA,MAAOt3B,GACc,YAAbA,EAAIiM,MACJtJ,EAAI8I,MAAMzL,EAElB,CACJ,EACAuC,OAAQ4jD,EAAO5jD,OACf25G,aACA70D,SAAU,CAAExhD,KAAMoI,KAAKoqC,OACvB,WAAM8iE,CAAMr2G,EAAU,CAAC,GACnB,MAAMhE,EAAQmN,KAAKoqC,MACnB,GAAsB,MAAlBvzC,EAAQigD,OAAgB,CACxB,MAAMA,EAASm2D,YAAYprD,QH5Bd,KG6BbhrD,EAAU,IACHA,EACHigD,SAER,CACA,MAAM7xC,EAAW,KACb,MAAM,KAAEurD,EAAI,KAAE5B,GAAS2rD,EAAOtM,WAAW59C,YACzC37D,EAAI,qEAAsE87D,EAAM5B,EAAM5uD,KAAKoqC,MAAQv3C,GACnGiD,KAAKkkE,MAAM,IAAI,GAAU,uBAAwB,4BAA4B,EAEjFnjE,EAAQigD,QAAQG,iBAAiB,QAAShyC,GAC1C,UACUizC,EAAOg1D,OACjB,CACA,MAAOn7G,GACH2C,EAAI8I,MAAM,qCAAsCzL,GAChD+D,KAAKkkE,MAAMjoE,EACf,CACA,QACI8E,EAAQigD,QAAQK,oBAAoB,QAASlyC,GAC7Cs1G,EAAOnhE,SAAS8zD,MAAQltG,KAAKoqC,KACjC,CACJ,EACA,KAAA4vB,CAAMjoE,GACF,MAAM,KAAEy+D,EAAI,KAAE5B,GAAS2rD,EAAOtM,WAAW59C,YACzC37D,EAAI,+CAAgD87D,EAAM5B,EAAM78D,GAChEmmD,EAAOl5C,UACPu7G,EAAOnhE,SAAS8zD,MAAQltG,KAAKoqC,MAK7Bm4D,GAASjE,UAAU,CAAE,CAAC,GAAGkc,WAAsB,GACnD,GAWJ,OATAtiE,EAAOigE,OAAOlhE,iBAAiB,SAAS,KACpCsrD,GAASjE,UAAU,CAAE,CAAC,GAAGkc,WAAsB,IAIlB,MAAzBD,EAAOnhE,SAAS8zD,QAChBqN,EAAOnhE,SAAS8zD,MAAQltG,KAAKoqC,MACjC,GACD,CAAEtlC,MAAM,IACJy1G,CACX,CDgBuBE,OADM3kH,KAAK4kH,SAAShU,EAAI7vG,GACD6vG,EAAI,CACtCn2D,OAAQz6C,KAAKy6C,OACbgyD,QAASzsG,KAAKysG,SAAS6X,eAE3BtkH,KAAKpB,IAAI,6BAA8B6lH,EAAOtM,YAC9C,MAAMloD,QAAalvD,EAAQ8jH,SAASC,gBAAgBL,EAAQ1jH,GAE5D,OADAf,KAAKpB,IAAI,kCAAmC6lH,EAAOtM,YAC5CloD,CACX,CACA,cAAM20D,CAAShU,EAAI7vG,GACfA,GAASigD,QAAQC,iBACjB,MAAM8jE,EAAQnU,EAAGr2C,YACjBv6D,KAAKpB,IAAI,gBAAiBmmH,EAAMrqD,KAAMqqD,EAAMjsD,MAC5C,MAAMksD,EAAezlE,KACf0lE,EAAYnC,GXkGnB,SAAwBhwG,EAAOuyB,GAClC,MACMnoC,EADK,GAAU4V,GACJ6mD,eACXpqC,EAAOryB,EAAM0+D,MACnB,QAAa79D,IAATwxB,EACA,MAAM,IAAIvxB,MAAM,+BAEpB,MAAMynD,EAAW,GAAUl2B,EAAK,IAC1B8xF,EAAcC,GAAa77D,EAAS55C,MAC1C,GAAmB,MAAfw1G,EACA,MAAM,IAAIrjH,MAAM,4BAA4BynD,EAAS55C,QAEzD,IAAIq5G,EAAM7D,EAAY9xF,EAAK,IAAM,GAAIryB,GAmBrC,OAlBkC2jH,GAAkBlkG,SAAS4S,EAAK,MAE9D21F,EAAMA,EAAI5lH,QAAQ,WAAY,IAE1B4lH,EADY,QAAZ31F,EAAK,GACC,WAAW21F,IAGX,UAAUA,MAGpBA,EAAIjzF,WAAW,YAAcizF,EAAIjzF,WAAW,eAE5CizF,EAAM,IAAInnB,IAAImnB,GAAKzmH,WAEfymH,EAAIlzF,SAAS,OACbkzF,EAAMA,EAAI75G,UAAU,EAAG65G,EAAIxpH,OAAS,KAGrCwpH,CACX,CWlIkC,CAAMtU,GAAK5wG,KAAKgL,MAC1Ci6G,EAAU5C,OAAOlhE,iBAAiB,SAAS,KAIvC,MAAMllD,EAAM,IAAI,GAAU,wBAAwB20G,EAAGnyG,aAAc,yBACnEuB,KAAKpB,IAAI8I,MAAM,oBAAqBzL,GACpC+D,KAAKysG,SAAS6X,aAAa9b,UAAU,CAAE9gG,OAAO,IAC9Cs9G,EAAahpH,OAAOC,EAAI,IAE5B,IACI8E,EAAQokH,aAAa,IAAIhB,GAAoB,qCACvCjmB,GAAWpiG,QAAQslD,KAAK,CAAC6jE,EAAU5B,YAAa2B,EAAaxlE,UAAWz+C,EAAQigD,OAC1F,CACA,MAAO/kD,GAQH,MAPgC,IAA5B8E,EAAQigD,QAAQ8J,SAChB9qD,KAAKysG,SAAS6X,aAAa9b,UAAU,CAAEtkC,OAAO,IAElD+gD,EAAU7N,QACLvpG,OAAM5R,IACP+D,KAAKpB,IAAI8I,MAAM,2BAA4BzL,EAAI,IAE7CA,CACV,CAGA,OAFA+D,KAAKpB,IAAI,eAAgBgyG,GACzB5wG,KAAKysG,SAAS6X,aAAa9b,UAAU,CAAEsa,SAAS,IACzCmC,CACX,CAMA,cAAAG,CAAerkH,GACX,OEjJD,WACH,MAAM,IAAI/C,MAAM,uDACpB,CF+IeonH,EACKplH,KAAKy6C,OACJz6C,KAAKikD,WAAWwoD,SAEtBzsG,KAAKgL,KAGhB,CAMA,YAAAq6G,CAAalU,GAET,OADAA,EAAa31G,MAAM+Y,QAAQ48F,GAAcA,EAAa,CAACA,GAC9B,MAArBnxG,KAAKgL,MAAM0R,OACJ1c,KAAKgL,MAAM0R,OAAOy0F,GAGzBsE,IAAaI,GACN,GAAY1E,GAEhB,GAAYA,EACvB,CAIA,UAAAmU,CAAWnU,GACP,OAAOnxG,KAAKqlH,aAAalU,EAC7B,EAEG,SAASoU,GAAWv6G,EAAO,CAAC,GAC/B,OAAQi5C,GACG,IAAI,GAAWA,EAAYj5C,EAE1C,CGjKO,MAAMw6G,GAAuBx3G,OAAOw+B,IAAI,2BCAlCi5E,GAAoBz3G,OAAOw+B,IAAI,wBClBtCj3B,GAAI,IACJsH,GAAQ,GAAJtH,GACJoC,GAAQ,GAAJkF,GACJC,GAAQ,GAAJnF,GACJ7B,GAAQ,EAAJgH,GA6EV,GA3EA,SAAYrd,EAAOsB,GACf,IACI,GAAqB,iBAAVtB,GAAsBA,EAAM/D,OAAS,EAC5C,OAiBZ,SAAegX,GAEX,IADAA,EAAMnV,OAAOmV,IACLhX,OAAS,IACb,MAAM,IAAIsC,MAAM,uDAEpB,MAAMoJ,EAAQ,mIAAmI8V,KAAKxK,GACtJ,IAAKtL,EACD,OAAOxD,IAEX,MAAMtH,EAAI6gB,WAAW/V,EAAM,IACrBc,GAAQd,EAAM,IAAM,MAAMkB,cAChC,OAAQJ,GACJ,IAAK,QACL,IAAK,OACL,IAAK,MACL,IAAK,KACL,IAAK,IACD,OAtCF4U,SAsCSxgB,EACX,IAAK,QACL,IAAK,OACL,IAAK,IACD,OAAOA,EAAIwZ,GACf,IAAK,OACL,IAAK,MACL,IAAK,IACD,OAAOxZ,EAAIwgB,GACf,IAAK,QACL,IAAK,OACL,IAAK,MACL,IAAK,KACL,IAAK,IACD,OAAOxgB,EAAIqb,GACf,IAAK,UACL,IAAK,SACL,IAAK,OACL,IAAK,MACL,IAAK,IACD,OAAOrb,EAAIugB,GACf,IAAK,UACL,IAAK,SACL,IAAK,OACL,IAAK,MACL,IAAK,IACD,OAAOvgB,EAAIiZ,GACf,IAAK,eACL,IAAK,cACL,IAAK,QACL,IAAK,OACL,IAAK,KACD,OAAOjZ,EACX,QAEI,MAAM,IAAI0B,MAAM,YAAYkK,+CAExC,CAvEmBkV,CAAM3d,GAEZ,GAAqB,iBAAVA,GAAsB4d,SAAS5d,GAC3C,OAAOsB,GAASuc,KA4F5B,SAAiBnT,GACb,MAAM6S,EAAQxgB,KAAKyP,IAAI9B,GACvB,OAAI6S,GAASF,GACFC,GAAO5S,EAAI6S,EAAOF,GAAG,OAE5BE,GAASrF,GACFoF,GAAO5S,EAAI6S,EAAOrF,GAAG,QAE5BqF,GAASH,GACFE,GAAO5S,EAAI6S,EAAOH,GAAG,UAE5BG,GAASzH,GACFwH,GAAO5S,EAAI6S,EAAOzH,GAAG,UAEzB,GAAGpL,MACd,CA3GmCu7G,CAAQjmH,GAyE3C,SAAkB0K,GACd,MAAM6S,EAAQxgB,KAAKyP,IAAI9B,GACvB,OAAI6S,GAASF,GACF,GAAGtgB,KAAK4G,MAAM+G,EAAK2S,OAE1BE,GAASrF,GACF,GAAGnb,KAAK4G,MAAM+G,EAAKwN,OAE1BqF,GAASH,GACF,GAAGrgB,KAAK4G,MAAM+G,EAAK0S,OAE1BG,GAASzH,GACF,GAAG/Y,KAAK4G,MAAM+G,EAAKoL,OAEvB,GAAGpL,KACd,CAxFoDoT,CAAS9d,GAErD,MAAM,IAAIzB,MAAM,mCACpB,CACA,MAAO0J,GACH,MAAM+B,EAiHd,SAAiB/B,GACb,MAAwB,iBAAVA,GAAgC,OAAVA,GAAkB,YAAaA,CACvE,CAnHwBi+G,CAAQj+G,GAClB,GAAGA,EAAM+B,kBAAkB7J,KAAKC,UAAUJ,KAC1C,gCACN,MAAM,IAAIzB,MAAMyL,EACpB,CACJ,EAqGA,SAASsT,GAAO5S,EAAI6S,EAAO1gB,EAAGuP,GAC1B,MAAMoR,EAAWD,GAAa,IAAJ1gB,EAC1B,MAAO,GAAGE,KAAK4G,MAAM+G,EAAK7N,MAAMuP,IAAOoR,EAAW,IAAM,IAC5D,CCtHA,MAAM1V,GAyMN,WACI,IAGI,OAAOyB,YACX,CACA,MAAOtB,GAGP,CACJ,CAnNgBuB,GA0JV,GAAMtK,QAAQ2K,OAAS3K,QAAQC,KAAO,MAAU,GAuEtD,GCnOe,SAAemJ,GA8C1B,SAAS2B,EAAY3C,GACjB,IAAI4C,EAEAC,EACAC,EAFAC,EAAiB,KAGrB,SAASR,KAAS7I,GAGd,IAAK6I,EAAMS,QACP,OAEJ,MAAMC,EAAOV,EAEPW,EAAOvK,OAAO,IAAIwK,MAClBC,EAAKF,GAAQN,GAAYM,GAC/BD,EAAK/C,KAAOkD,EACZH,EAAKI,KAAOT,EACZK,EAAKC,KAAOA,EACZN,EAAWM,EACXxJ,EAAK,GAAKiJ,EAAYW,OAAO5J,EAAK,IACX,iBAAZA,EAAK,IAEZA,EAAK6J,QAAQ,MAGjB,IAAI1O,EAAQ,EACZ6E,EAAK,GAAKA,EAAK,GAAGnB,QAAQ,iBAAiB,CAAC8H,EAAOmD,KAE/C,GAAc,OAAVnD,EACA,MAAO,IAEXxL,IAEA,MAAM4O,EAAYd,EAAYH,WAAWgB,GACzC,GAAyB,mBAAdC,EAA0B,CACjC,MAAMlI,EAAM7B,EAAK7E,GACjBwL,EAAQoD,EAAUlE,KAAK0D,EAAM1H,GAE7B7B,EAAKF,OAAO3E,EAAO,GACnBA,GACJ,CACA,OAAOwL,CAAK,IAIhBsC,EAAY7C,WAAWP,KAAK0D,EAAMvJ,IAEpBuJ,EAAKpL,KAAO8K,EAAY9K,KAChC1C,MAAM8N,EAAMvJ,EACtB,CAiCA,OAhCA6I,EAAMvC,UAAYA,EAElBuC,EAAMxC,UAAY4C,EAAY5C,YAC9BwC,EAAMpC,MAAQwC,EAAYe,YAAY1D,GACtCuC,EAAMoB,OAASA,EACfpB,EAAMJ,QAAUQ,EAAYR,QAC5BpK,OAAO6L,eAAerB,EAAO,UAAW,CACpCsB,YAAY,EACZC,cAAc,EACdC,IAAK,IACsB,OAAnBhB,EACOA,GAGPF,IAAoBF,EAAYpC,aAEhCsC,EAAkBF,EAAYpC,WAC9BuC,EAAeH,EAAYK,QAAQhD,IAEhC8C,GAEXkB,IAAKvB,IACDM,EAAiBN,CAAC,IAKM,mBAArBE,EAAYsB,MAEnBtB,EAAYsB,KAAK1B,GAGdA,CACX,CACA,SAASoB,EAAO3D,EAAWkE,GACvB,MAAMC,EAAWxB,EAAY1J,KAAK+G,gBAAkC,IAAdkE,EAA4B,IAAMA,GAAalE,GAErG,OADAmE,EAAStM,IAAMoB,KAAKpB,IACbsM,CACX,CAuEA,SAASC,EAAYC,GACjB,OAAOA,EAAO3M,WACT4M,UAAU,EAAGD,EAAO3M,WAAW/C,OAAS,GACxC4D,QAAQ,UAAW,IAC5B,CAsBA,OAtOAoK,EAAYJ,MAAQI,EACpBA,EAAY4B,QAAU5B,EACtBA,EAAYW,OAkNZ,SAAgB/H,GACZ,OAAIA,aAAetE,MACRsE,EAAIiJ,OAASjJ,EAAImH,QAErBnH,CACX,EAtNAoH,EAAY8B,QAsKZ,WACI,MAAMlE,EAAa,IACZoC,EAAY+B,MAAMC,IAAIP,MACtBzB,EAAYiC,MAAMD,IAAIP,GAAaO,KAAI3E,GAAa,IAAMA,KAC/DrJ,KAAK,KAEP,OADAgM,EAAYkC,OAAO,IACZtE,CACX,EA5KAoC,EAAYkC,OAwIZ,SAAgBtE,GAOZ,IAAI1K,EALJ8M,EAAYrC,KAAKC,GAEjBoC,EAAYpC,WAAaA,EACzBoC,EAAY+B,MAAQ,GACpB/B,EAAYiC,MAAQ,GAEpB,MAAMjG,GAA+B,iBAAf4B,EAA0BA,EAAa,IAAI5B,MAAM,UACjEc,EAAMd,EAAMhK,OAClB,IAAKkB,EAAI,EAAGA,EAAI4J,EAAK5J,IACZ8I,EAAM9I,KAKW,OADtB0K,EAAa5B,EAAM9I,GAAG0C,QAAQ,MAAO,QACtB,GACXoK,EAAYiC,MAAMrO,KAAK,IAAIyL,OAAO,IAAMzB,EAAWqK,OAAO,GAAK,MAG/DjI,EAAY+B,MAAMnO,KAAK,IAAIyL,OAAO,IAAMzB,EAAa,MAGjE,EA9JAoC,EAAYK,QAkLZ,SAAiB8B,GACb,GAA8B,MAA1BA,EAAKA,EAAKnQ,OAAS,GACnB,OAAO,EAEX,IAAIkB,EACA4J,EACJ,IAAK5J,EAAI,EAAG4J,EAAMkD,EAAYiC,MAAMjQ,OAAQkB,EAAI4J,EAAK5J,IACjD,GAAI8M,EAAYiC,MAAM/O,GAAGqB,KAAK4N,GAC1B,OAAO,EAGf,IAAKjP,EAAI,EAAG4J,EAAMkD,EAAY+B,MAAM/P,OAAQkB,EAAI4J,EAAK5J,IACjD,GAAI8M,EAAY+B,MAAM7O,GAAGqB,KAAK4N,GAC1B,OAAO,EAGf,OAAO,CACX,EAlMAnC,EAAY1C,SAAW,GACvB0C,EAAYR,QAuNZ,WACIvK,QAAQyK,KAAK,wIACjB,EAxNAtK,OAAOC,KAAKgJ,GAAK+D,SAAQC,IAErBrC,EAAYqC,GAAOhE,EAAIgE,EAAI,IAK/BrC,EAAY+B,MAAQ,GACpB/B,EAAYiC,MAAQ,GAMpBjC,EAAYH,WAAa,CAAC,EAgB1BG,EAAYe,YATZ,SAAqB1D,GACjB,IAAIiF,EAAO,EACX,IAAK,IAAIpP,EAAI,EAAGA,EAAImK,EAAUrL,OAAQkB,IAClCoP,GAASA,GAAQ,GAAKA,EAAQjF,EAAUjJ,WAAWlB,GACnDoP,GAAQ,EAGZ,OAAOtC,EAAYL,OAAO7M,KAAKyP,IAAID,GAAQtC,EAAYL,OAAO3N,OAClE,EA6LAgO,EAAYk8G,gBAAgBl8G,EAAYH,YAExCG,EAAYkC,OAAOlC,EAAY/B,QAExB+B,CACX,CDLA,CAAqB,CAAE7C,WA3GvB,SAAoBpG,GAOhB,GANAA,EAAK,IAAMT,KAAK8G,UAAY,KAAO,IAC/B9G,KAAK+G,WACJ/G,KAAK8G,UAAY,MAAQ,KAC1BrG,EAAK,IACJT,KAAK8G,UAAY,MAAQ,KAC1B,IAAM,GAAS9G,KAAKiH,OACnBjH,KAAK8G,UACN,OAEJ,MAAMjJ,EAAI,UAAYmC,KAAKkH,MAC3BzG,EAAKF,OAAO,EAAG,EAAG1C,EAAG,kBAIrB,IAAIjC,EAAQ,EACRuL,EAAQ,EACZ1G,EAAK,GAAGnB,QAAQ,eAAgB8H,IACd,OAAVA,IAGJxL,IACc,OAAVwL,IAGAD,EAAQvL,GACZ,IAEJ6E,EAAKF,OAAO4G,EAAO,EAAGtJ,EAC1B,EA8EmCwJ,KAjEnC,SAAcC,GACV,IACQA,EACAC,IAASC,QAAQ,QAASF,GAG1BC,IAASE,WAAW,QAE5B,CACA,MAAOC,GAGP,CACJ,EAoDyCC,KA9CzC,WACI,IAAIC,EACJ,IACIA,EAAIL,IAASM,QAAQ,QACzB,CACA,MAAOH,GAGP,CAKA,OAHKE,GAAwB,oBAAZE,SAA2B,QAASA,UACjDF,EAAIE,QAAQC,IAAIC,OAEbJ,CACX,EAgC+Cd,UAvI/C,WAKI,QAAsB,oBAAXmB,SAA0BA,OAAOH,SAAoC,aAAxBG,OAAOH,QAAQI,OAAuBD,OAAOH,QAAQK,UAIpF,oBAAdC,WAAmG,MAArEA,UAAUC,WAAWC,cAAclB,MAAM,4BAMtD,oBAAbmB,UAA4BA,SAASC,iBAAiBC,OAAOC,kBAGrD,oBAAXT,QAA0BA,OAAOtJ,UAAYsJ,OAAOtJ,QAAQgK,SAAYV,OAAOtJ,QAAQiK,WAAaX,OAAOtJ,QAAQkK,QAGrG,oBAAdT,WAA4F,MAA9DA,UAAUC,WAAWC,cAAclB,MAAM,mBAA8B0B,SAASC,OAAOvJ,GAAI,KAAO,IAElH,oBAAd4I,WAA6BA,UAAUC,WAAWC,cAAclB,MAAM,sBACtF,EA+G0Dw+G,gBAb1D,SAAyBr8G,GAIrBA,EAAWnM,EAAI,SAAUoM,GACrB,IACI,OAAO5J,KAAKC,UAAU2J,EAC1B,CACA,MAAO9B,GACH,MAAO,+BAAiCA,EAAM+B,OAClD,CACJ,CACJ,EAC2EJ,OA7N5D,CACX,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,WAiJ+E9B,WAAS3I,IAAG,KE3N/F,MC0HO,SAASinH,KACZ,MAAO,CACHzX,aAAaviG,GAkBd,SAAgBA,GAEnB,IAAIqiG,EA7FR,SAA8BnnG,GAC1B,MAAM0zC,EAAS,OAQf,OAPAA,EAAO1wC,SAAU,EACjB0wC,EAAOvzC,MAAQ,GACfuzC,EAAOxzC,KAAO,EACdwzC,EAAO77C,IAAM,OACb67C,EAAO1zC,UAAYA,EACnB0zC,EAAOvxC,QAAU,KAAM,EACvBuxC,EAAO/vC,OAAS,IAAM+vC,EACfA,CACX,CAmFgBqrE,CAAqB,GAAGj6G,WAKpC,OAHI,GAAM9B,QAAQ,GAAG8B,YAA2F,MAA1E,GAAMJ,MAAMC,KAAK9D,GAAMA,EAAEnJ,aAAY8uB,MAAMjxB,GAAMA,EAAEqgB,SAAS,cAC9FuxF,EAAQ,GAAM,GAAGriG,YAEd/M,OAAOoN,OAAO,GAAML,GAAO,CAC9BnE,MAAO,GAAM,GAAGmE,WAChBqiG,SAER,CA5BmBzzD,CAAO5uC,GAG1B,CC5IO,SAASk6G,GAAYC,EAAMt6G,GAC9B,MAAMowC,EAAW,CACb,CAAC9tC,OAAO8tC,UAAW,IACRA,EAEX5tC,KAAM,KACF,MAAMA,EAAO83G,EAAK93G,OACZ5L,EAAM4L,EAAKzO,MACjB,OAAkB,IAAdyO,EAAKb,MAAwB,MAAP/K,EACP,CACX+K,MAAM,EACN5N,WAAO1B,GAIR,CACHsP,MAAM,EACN5N,MAAOiM,EAAIpJ,GACd,GAGT,OAAOw5C,CACX,CDcA,GAAMvyC,WAAWlM,EAAKmM,GACN,MAALA,EAAY,YAAc4/B,GAAUxC,WAAWp9B,GAG1D,GAAMD,WAAWtM,EAAKuM,GACN,MAALA,EAAY,YAAc6J,GAAOuzB,WAAWp9B,GAGvD,GAAMD,WAAWsT,EAAKrT,GACN,MAALA,EAAY,YAAcrN,GAAOyqC,WAAWp9B,GAGvD,GAAMD,WAAWlN,EAAKmN,GACN,MAALA,EAAY,YAAcA,EAAE/K,WAGvC,GAAM8K,WAAW1L,EAAK2L,GACN,MAALA,EAAY,YAAcA,EAAE/K,WAGvC,GAAM8K,WAAWkT,EAAKjT,GACN,MAALA,EAAY,YAAcA,EAAE/K,WAGvC,GAAM8K,WAAW8wB,EAAK7wB,GACN,MAALA,EAAY,YAAcA,EAAE/K,WE7ChC,MAAMwnH,GACTl7G,IACA,WAAA+B,CAAY/B,GAER,GADA/K,KAAK+K,IAAM,IAAIwtC,IACJ,MAAPxtC,EACA,IAAK,MAAMgB,KAAOhB,EACd/K,KAAK+K,IAAIqc,IAAIrb,EAAItN,WAG7B,CACA,QAAIyH,GACA,OAAOlG,KAAK+K,IAAI7E,IACpB,CACA,CAAC8H,OAAO8tC,YACJ,OAAO97C,KAAKyiB,QAChB,CACA,GAAA2E,CAAIw7B,GACA5iD,KAAK+K,IAAIqc,IAAIw7B,EAAKnkD,WACtB,CACA,KAAAmS,GACI5Q,KAAK+K,IAAI6F,OACb,CACA,OAAOgyC,GACH5iD,KAAK+K,IAAIi4C,OAAOJ,EAAKnkD,WACzB,CACA,OAAAogE,GACI,OAAOknD,GAAY/lH,KAAK+K,IAAI8zD,WAAYv8D,IACpC,MAAMwhD,EAASy5C,GAAiBj7F,EAAI,IACpC,MAAO,CAACwhD,EAAQA,EAAO,GAE/B,CACA,OAAAh4C,CAAQo6G,GACJlmH,KAAK+K,IAAIe,SAAS4G,IACd,MAAM4O,EAAKi8E,GAAiB7qF,GAC5BwzG,EAAU5kG,EAAIA,EAAIthB,KAAK,GAE/B,CACA,GAAA2O,CAAIi0C,GACA,OAAO5iD,KAAK+K,IAAI4D,IAAIi0C,EAAKnkD,WAC7B,CACA,MAAAgkB,GACI,OAAOsjG,GAAY/lH,KAAK+K,IAAI0X,UAAWngB,GAC5Bi7F,GAAiBj7F,IAEhC,CACA,YAAA6jH,CAAah6E,GACT,MAAMqJ,EAAS,IAAIywE,GACnB,IAAK,MAAMniE,KAAU3X,EACbnsC,KAAK2O,IAAIm1C,IACTtO,EAAOpuB,IAAI08B,GAGnB,OAAOtO,CACX,CACA,UAAA4wE,CAAWj6E,GACP,MAAMqJ,EAAS,IAAIywE,GACnB,IAAK,MAAMniE,KAAU9jD,KACZmsC,EAAMx9B,IAAIm1C,IACXtO,EAAOpuB,IAAI08B,GAGnB,OAAOtO,CACX,CACA,KAAA6wE,CAAMl6E,GACF,MAAMqJ,EAAS,IAAIywE,GACnB,IAAK,MAAMniE,KAAU3X,EACjBqJ,EAAOpuB,IAAI08B,GAEf,IAAK,MAAMA,KAAU9jD,KACjBw1C,EAAOpuB,IAAI08B,GAEf,OAAOtO,CACX,ECjEG,MAAM8wE,GAAsBv7E,UAC/B,MAAMh/B,Q3FkBHg/B,eAA+B7iC,EAAM8M,GACxC,OAAO4nF,G2FnB2B,W3FmBX2pB,gBAAwB,KACnD,C2FpBsB,GACZjlG,QAAWklG,GAAkBz6G,GACnC,GAAgB,YAAZuV,EAAGpZ,KACH,OAAOoZ,EAEX,MAAM,IAAItjB,MAAM,qCAAqCsjB,EAAGpZ,QAAQ,EAqB7D6iC,eAAey7E,GAAkBvqC,GACpC,OAAOgiB,GAAepB,GAAiB5gB,EAAW+C,S3FkDpBjzE,E2FlD+CkwE,E3FoD7E2gB,GADA10F,GAAQA,GAAQ,OAAOI,eAEhByD,EAAIuG,QAHR,IAA2BvG,EAAK7D,C2FjDvC,CAYO6iC,eAAe07E,GAAet6G,GACjC,OAEJ4+B,eAA+BH,EAAW6tC,EAASiuC,GAC/C,GAAe,MAAXjuC,EAEA,OAAO+tC,SADW,GAAoB/tC,IAGrC,GAAc,MAAViuC,EAEL,OA3BD37E,eAAgCyuC,GACnC,OAAOykB,GAAepB,GAAiBrjB,GAC3C,CAyBemtC,CADK,GAAmBD,IAGnC,MAAM5iE,EAASg6C,GAAgBlzD,GAC/B,GAAoB,YAAhBkZ,EAAO57C,MAAsC,cAAhB47C,EAAO57C,MAAwC,QAAhB47C,EAAO57C,KAGnE,MAAM,IAAIlK,MAAM,8BAEpB,OAAO8lD,CACX,CAlBW8iE,CAAgB,GAAqBz6G,EAAImV,GAAI,aAA6B,MAAfnV,EAAIssE,QAAkB,GAAqBtsE,EAAIssE,QAAS,kBAAe16E,EAAyB,MAAdoO,EAAIu6G,OAAiB,GAAqBv6G,EAAIu6G,OAAQ,kBAAe3oH,EAC7N,CClDO,MAAM8oH,GACTn7G,IACA,WAAAoB,CAAYpB,GAER,GADA1L,KAAK0L,IAAM,IAAI+/B,IACJ,MAAP//B,EACA,IAAK,MAAOK,EAAKtM,KAAUiM,EAAImzD,UAC3B7+D,KAAK0L,IAAIX,IAAIgB,EAAItN,WAAYgB,EAGzC,CACA,CAACuO,OAAO8tC,YACJ,OAAO97C,KAAK6+D,SAChB,CACA,KAAAjuD,GACI5Q,KAAK0L,IAAIkF,OACb,CACA,OAAOgyC,GACH,OAAO5iD,KAAK0L,IAAIs3C,OAAOJ,EAAKnkD,WAChC,CACA,OAAAogE,GACI,OAAOknD,GAAY/lH,KAAK0L,IAAImzD,WAAYv8D,GAC7B,CAACi7F,GAAiBj7F,EAAI,IAAKA,EAAI,KAE9C,CACA,OAAAwJ,CAAQzQ,GACJ2E,KAAK0L,IAAII,SAAQ,CAACrM,EAAOsM,KACrB1Q,EAAGoE,EAAO89F,GAAiBxxF,GAAM/L,KAAK,GAE9C,CACA,GAAA8K,CAAI83C,GACA,OAAO5iD,KAAK0L,IAAIZ,IAAI83C,EAAKnkD,WAC7B,CACA,GAAAkQ,CAAIi0C,GACA,OAAO5iD,KAAK0L,IAAIiD,IAAIi0C,EAAKnkD,WAC7B,CACA,GAAAsM,CAAI63C,EAAMnjD,GACNO,KAAK0L,IAAIX,IAAI63C,EAAKnkD,WAAYgB,EAClC,CACA,IAAAV,GACI,OAAOgnH,GAAY/lH,KAAK0L,IAAI3M,QAASuD,GAC1Bi7F,GAAiBj7F,IAEhC,CACA,MAAAmgB,GACI,OAAOziB,KAAK0L,IAAI+W,QACpB,CACA,QAAIvc,GACA,OAAOlG,KAAK0L,IAAIxF,IACpB,kCClEW,MAAM4gH,GACjB,GAAS,GACT,OAAAC,CAAQC,EAAKjmH,GAKT,MAAMkmH,EAAU,CACZC,UALJnmH,EAAU,CACNmmH,SAAU,KACPnmH,IAGemmH,SAClBF,OAEJ,GAAIhnH,KAAKkG,MAAQlG,MAAK,EAAOA,KAAKkG,KAAO,GAAGghH,UAAYnmH,EAAQmmH,SAE5D,YADAlnH,MAAK,EAAO1C,KAAK2pH,GAGrB,MAAMrrH,ECdC,SAAoBiZ,EAAOpV,EAAO0nH,GAC7C,IAAI5mG,EAAQ,EACRhO,EAAQsC,EAAMnZ,OAClB,KAAO6W,EAAQ,GAAG,CACd,MAAM60G,EAAO5qH,KAAK4/C,MAAM7pC,EAAQ,GAChC,IAAI80G,EAAK9mG,EAAQ6mG,EDS+B/sF,ECRjCxlB,EAAMwyG,GAAK5nH,EDQiCynH,SAAW7sF,EAAE6sF,UCRpC,GAChC3mG,IAAU8mG,EACV90G,GAAS60G,EAAO,GAGhB70G,EAAQ60G,CAEhB,CDCmD,IAAC/sF,ECApD,OAAO9Z,CACX,CDDsB+mG,CAAWtnH,MAAK,EAAQinH,GACtCjnH,MAAK,EAAOO,OAAO3E,EAAO,EAAGqrH,EACjC,CACA,OAAAM,GACI,MAAM7lE,EAAO1hD,MAAK,EAAO6F,QACzB,OAAO67C,GAAMslE,GACjB,CACA,MAAAtqG,CAAO3b,GACH,OAAOf,MAAK,EAAO0c,QAAQuqG,GAAYA,EAAQC,WAAanmH,EAAQmmH,WAAUx7G,KAAKu7G,GAAYA,EAAQD,KAC3G,CACA,QAAI9gH,GACA,OAAOlG,MAAK,EAAOtE,MACvB,EEtBW,MAAM8rH,WAAe,GAChC,GACA,GACA,GAAiB,EACjB,GACA,GACA,GAAe,EACf,GACA,GACA,GACA,GACA,GAAW,EAEX,GACA,GACA,GAMAz7D,QAEA,WAAAj/C,CAAY/L,GAYR,GAXAgtC,UAWqC,iBATrChtC,EAAU,CACN0mH,2BAA2B,EAC3BC,YAAahoH,OAAOqrD,kBACpBuD,SAAU,EACVq5D,YAAajoH,OAAOqrD,kBACpB68D,WAAW,EACXC,WAAYf,MACT/lH,IAEc2mH,aAA4B3mH,EAAQ2mH,aAAe,GACpE,MAAM,IAAIp7G,UAAU,gEAAgEvL,EAAQ2mH,aAAajpH,YAAc,gBAAgBsC,EAAQ2mH,gBAEnJ,QAAyB3pH,IAArBgD,EAAQutD,YAA4B5uD,OAAO2d,SAAStc,EAAQutD,WAAavtD,EAAQutD,UAAY,GAC7F,MAAM,IAAIhiD,UAAU,2DAA2DvL,EAAQutD,UAAU7vD,YAAc,gBAAgBsC,EAAQutD,aAE3ItuD,MAAK,EAA6Be,EAAQ0mH,0BAC1CznH,MAAK,EAAqBe,EAAQ2mH,cAAgBhoH,OAAOqrD,mBAA0C,IAArBhqD,EAAQutD,SACtFtuD,MAAK,EAAee,EAAQ2mH,YAC5B1nH,MAAK,EAAYe,EAAQutD,SACzBtuD,MAAK,EAAS,IAAIe,EAAQ8mH,WAC1B7nH,MAAK,EAAce,EAAQ8mH,WAC3B7nH,KAAK2nH,YAAc5mH,EAAQ4mH,YAC3B3nH,KAAK+rD,QAAUhrD,EAAQgrD,QACvB/rD,MAAK,GAA6C,IAA3Be,EAAQ+mH,eAC/B9nH,MAAK,GAAkC,IAAtBe,EAAQ6mH,SAC7B,CACA,KAAI,GACA,OAAO5nH,MAAK,GAAsBA,MAAK,EAAiBA,MAAK,CACjE,CACA,KAAI,GACA,OAAOA,MAAK,EAAWA,MAAK,CAChC,CACA,KACIA,MAAK,IACLA,MAAK,IACLA,KAAKQ,KAAK,OACd,CACA,KACIR,MAAK,IACLA,MAAK,IACLA,MAAK,OAAajC,CACtB,CACA,KAAI,GACA,MAAMu2C,EAAMpqC,KAAKoqC,MACjB,QAAyBv2C,IAArBiC,MAAK,EAA2B,CAChC,MAAMi6C,EAAQj6C,MAAK,EAAes0C,EAClC,KAAI2F,EAAQ,GAYR,YALwBl8C,IAApBiC,MAAK,IACLA,MAAK,EAAay1B,YAAW,KACzBz1B,MAAK,GAAmB,GACzBi6C,KAEA,EATPj6C,MAAK,EAAkBA,MAA+B,EAAIA,MAAK,EAAW,CAWlF,CACA,OAAO,CACX,CACA,KACI,GAAyB,IAArBA,MAAK,EAAOkG,KAWZ,OARIlG,MAAK,GACL0uD,cAAc1uD,MAAK,GAEvBA,MAAK,OAAcjC,EACnBiC,KAAKQ,KAAK,SACY,IAAlBR,MAAK,GACLA,KAAKQ,KAAK,SAEP,EAEX,IAAKR,MAAK,EAAW,CACjB,MAAM+nH,GAAyB/nH,MAAK,EACpC,GAAIA,MAAK,GAA6BA,MAAK,EAA6B,CACpE,MAAMgoH,EAAMhoH,MAAK,EAAOunH,UACxB,QAAKS,IAGLhoH,KAAKQ,KAAK,UACVwnH,IACID,GACA/nH,MAAK,KAEF,EACX,CACJ,CACA,OAAO,CACX,CACA,KACQA,MAAK,QAA2CjC,IAArBiC,MAAK,IAGpCA,MAAK,EAAcuuD,aAAY,KAC3BvuD,MAAK,GAAa,GACnBA,MAAK,GACRA,MAAK,EAAekK,KAAKoqC,MAAQt0C,MAAK,EAC1C,CACA,KACgC,IAAxBA,MAAK,GAA0C,IAAlBA,MAAK,GAAkBA,MAAK,IACzD0uD,cAAc1uD,MAAK,GACnBA,MAAK,OAAcjC,GAEvBiC,MAAK,EAAiBA,MAAK,EAA6BA,MAAK,EAAW,EACxEA,MAAK,GACT,CAIA,KAEI,KAAOA,MAAK,MAChB,CACA,eAAI2nH,GACA,OAAO3nH,MAAK,CAChB,CACA,eAAI2nH,CAAYM,GACZ,KAAgC,iBAAnBA,GAA+BA,GAAkB,GAC1D,MAAM,IAAI37G,UAAU,gEAAgE27G,eAA4BA,MAEpHjoH,MAAK,EAAeioH,EACpBjoH,MAAK,GACT,CACA,OAAM,CAAcghD,GAChB,OAAO,IAAIllD,SAAQ,CAAC2xD,EAAUzxD,KAC1BglD,EAAOG,iBAAiB,SAAS,KAC7BnlD,EAAOglD,EAAOsJ,OAAO,GACtB,CAAEt7C,MAAM,GAAO,GAE1B,CACA,SAAMoY,CAAI8gG,EAAWnnH,EAAU,CAAC,GAM5B,OALAA,EAAU,CACNgrD,QAAS/rD,KAAK+rD,QACd+7D,eAAgB9nH,MAAK,KAClBe,GAEA,IAAIjF,SAAQ,CAACC,EAASC,KACzBgE,MAAK,EAAO+mH,SAAQh8E,UAChB/qC,MAAK,IACLA,MAAK,IACL,IACIe,EAAQigD,QAAQC,iBAChB,IAAIknE,EAAYD,EAAU,CAAElnE,OAAQjgD,EAAQigD,SACxCjgD,EAAQgrD,UACRo8D,EAAY59D,GAASzuD,QAAQC,QAAQosH,GAAY,CAAE39D,aAAczpD,EAAQgrD,WAEzEhrD,EAAQigD,SACRmnE,EAAYrsH,QAAQslD,KAAK,CAAC+mE,EAAWnoH,MAAK,EAAce,EAAQigD,WAEpE,MAAM7yC,QAAeg6G,EACrBpsH,EAAQoS,GACRnO,KAAKQ,KAAK,YAAa2N,EAC3B,CACA,MAAOzG,GACH,GAAIA,aAAiBwiD,KAAiBnpD,EAAQ+mH,eAE1C,YADA/rH,IAGJC,EAAO0L,GACP1H,KAAKQ,KAAK,QAASkH,EACvB,CACA,QACI1H,MAAK,GACT,IACDe,GACHf,KAAKQ,KAAK,OACVR,MAAK,GAAoB,GAEjC,CACA,YAAMooH,CAAOC,EAAWtnH,GACpB,OAAOjF,QAAQ2lD,IAAI4mE,EAAU38G,KAAIq/B,MAAOm9E,GAAcloH,KAAKonB,IAAI8gG,EAAWnnH,KAC9E,CAIA,KAAAhE,GACI,OAAKiD,MAAK,GAGVA,MAAK,GAAY,EACjBA,MAAK,IACEA,MAJIA,IAKf,CAIA,KAAAsoH,GACItoH,MAAK,GAAY,CACrB,CAIA,KAAA4Q,GACI5Q,MAAK,EAAS,IAAIA,MAAK,CAC3B,CAMA,aAAM+gD,GAEuB,IAArB/gD,MAAK,EAAOkG,YAGVlG,MAAK,EAAS,QACxB,CAQA,oBAAMuoH,CAAezxD,GAEb92D,MAAK,EAAOkG,KAAO4wD,SAGjB92D,MAAK,EAAS,QAAQ,IAAMA,MAAK,EAAOkG,KAAO4wD,GACzD,CAMA,YAAM0xD,GAEoB,IAAlBxoH,MAAK,GAAuC,IAArBA,MAAK,EAAOkG,YAGjClG,MAAK,EAAS,OACxB,CACA,OAAM,CAASyO,EAAOiO,GAClB,OAAO,IAAI5gB,SAAQC,IACf,MAAMoT,EAAW,KACTuN,IAAWA,MAGf1c,KAAKK,IAAIoO,EAAOU,GAChBpT,IAAS,EAEbiE,KAAKG,GAAGsO,EAAOU,EAAS,GAEhC,CAIA,QAAIjJ,GACA,OAAOlG,MAAK,EAAOkG,IACvB,CAMA,MAAAuiH,CAAO1nH,GAEH,OAAOf,MAAK,EAAO0c,OAAO3b,GAASrF,MACvC,CAIA,WAAIG,GACA,OAAOmE,MAAK,CAChB,CAIA,YAAIkN,GACA,OAAOlN,MAAK,CAChB,ECpTJ,MAAMyP,GAAS,CAAC,EACVi5G,GAAcC,IAChBA,EAAOxnE,iBAAiB,WAAY1yC,IAChCi6G,GAAW96D,cAAc,UAAW+6D,EAAQl6G,EAAM,IAEnC,MAAfk6G,EAAO7vD,MACP6vD,EAAO7vD,KAAK3X,iBAAiB,WAAY1yC,IACrCi6G,GAAW96D,cAAc,UAAW+6D,EAAQl6G,EAAM,GAE1D,EAEJi6G,GAAWvnE,iBAAmB,CAACj5C,EAAM7M,KACb,MAAhBoU,GAAOvH,KACPuH,GAAOvH,GAAQ,IAEnBuH,GAAOvH,GAAM5K,KAAKjC,EAAG,EAEzBqtH,GAAWrnE,oBAAsB,CAACn5C,EAAM7M,KAChB,MAAhBoU,GAAOvH,KAGXuH,GAAOvH,GAAQuH,GAAOvH,GACjBwU,QAAOvN,GAAYA,IAAa9T,IAAG,EAE5CqtH,GAAW96D,cAAgB,SAAU1lD,EAAMygH,EAAQl6G,GAC3B,MAAhBgB,GAAOvH,IAGXuH,GAAOvH,GAAM4D,SAAQzQ,GAAMA,EAAGstH,EAAQl6G,IAC1C,EACA,YC9Bam6G,GAA2B,2BAC3BC,GAA2B,2BAC3BC,GAAyB,yBACzBC,GAA4B,4BAC5BC,GAA4B,4BAC5BC,GAA0B,0BCFjCC,GAA0B,CAACh6G,EAASi6G,EAAah+F,EAAai+F,EAAaC,IACtE,CAACV,EAAQl6G,KACZ,GAAIA,EAAM2vB,KAAKl2B,OAASijB,EACpB,OAEJ,MAAMm+F,EAAe,CACjBphH,KAAMuG,EAAM2vB,KAAKl2B,KACjB2D,KAAM4C,EAAM2vB,KAAKvyB,KACjB09G,WAAY96G,EAAM2vB,KAAKmrF,YAE3Br6G,EAAQ0+C,cAAc,IAAI47D,aAAaL,EAAa,CAChD/qF,KAAM,CACFvyB,KAAMy9G,EAAaz9G,KACnB49G,QAAS1+E,UAEL49E,EAAOe,YAAY,CACfxhH,KAAMmhH,EACNx9G,KAAMy9G,EAAaz9G,KACnB09G,WAAYD,EAAaC,mBAGvB,IAAIztH,SAASC,IACf,MAAM4tH,EAAwBl7G,IAC1B,GAAa,MAATA,GAA+B,MAAdA,EAAM2vB,KACvB,OAEJ,MAAMwrF,EACIn7G,EAAM2vB,KAAKl2B,KADf0hH,GAEIn7G,EAAM2vB,KAAKvyB,KACL4C,EAAM2vB,KAAKmrF,YAEvBK,IAAsBR,GAAeQ,IAA4BN,EAAaC,aAC9EZ,EAAOtnE,oBAAoB,UAAWsoE,GACtC5tH,IACJ,EAEJ4sH,EAAOxnE,iBAAiB,UAAWwoE,EAAqB,GAC1D,KAGX,EAGLE,GAAwB,CAACh+G,EAAMsf,EAAak+F,EAAWD,IAClDr+E,UACH,MAAMzpB,EC/CH9kB,KAAK4oD,SAAS3mD,WAAW4M,UAAU,GDqDtC,OALAqQ,WAAWguG,YAAY,CACnBxhH,KAAMijB,EACNo+F,WAAYjoG,EACZzV,SAEG,IAAI/P,SAASC,IAChB,MAAMoT,EAAYV,IACd,GAAa,MAATA,GAA+B,MAAdA,EAAM2vB,KACvB,OAEJ,MAAM0rF,EACIr7G,EAAM2vB,KAAKl2B,KADf4hH,EAEUr7G,EAAM2vB,KAAKmrF,WAEvBO,IAAuBT,GAAaS,IAA6BxoG,IACjE5F,WAAW2lC,oBAAoB,UAAWlyC,GAE1CpT,GAAQ,KAEJ2f,WAAWguG,YAAY,CACnBxhH,KAAMkhH,EACNG,WAAYjoG,EACZzV,QACF,IAEV,EAEJ6P,WAAWylC,iBAAiB,UAAWhyC,EAAS,GAClD,EAGJ46G,GAAiB,CACnBC,eAAe,GEgCbC,GAAU,CAAC,EACjB,IAAIC,GACJn/E,eAAeo/E,GAAkB37G,EAAOzN,GACpC,IAAIg+B,EACJ,MAAM1iC,EAAI,IAAIP,SAASC,IACnBgjC,EAAMhjC,CAAO,IAWjB,OATKyS,EAAM4Y,KAAI2jB,SAAYwf,GAAS,iBAC1B,IAAIzuD,SAASC,IACfgjC,GAAI,KACAhjC,GAAS,GACX,GAET,EANmC,GAM9B,CACFyuD,aAAczpD,EAAQgrD,YAEnB1vD,CACX,CACA,MAgDM,GAAiB,CACnBwP,KAAM,OACN87G,YAAa9jH,IACbkoD,QAAS,MACTi+D,eAAe,GCvLZ,MAAM,GAAQ,CACjBI,uBAAwB,0BCKrB,IAAIC,GAqMAC,GAmDAC,GC3PJ,SAASC,GAAY1mE,EAAQvhD,GAChC,MAAMqgD,EAAOynE,GAAOzsH,OAAO2E,GACL,MAAlBqgD,EAAK42B,WAAyC,MAApB11B,EAAO01B,YACjC11B,ErGiLD,SAA0B3X,GAC7B,GAAmB,QAAfA,EAAMjkC,KACN,OAAO,IAAIs1F,GAAcrxD,GAE7B,GAAmB,YAAfA,EAAMjkC,KACN,OAAO,IAAIu1F,GAAkBtxD,GAEjC,GAAmB,cAAfA,EAAMjkC,KACN,OAAO,IAAIw1F,GAAoBvxD,GAEnC,MAAM,IAAI,GAAU,eAAgB,yBACxC,CqG5LiBs+E,CAAiB,IACnB3mE,EACH01B,UAAW11B,EAAO01B,aAG1B,MAAMz0B,EAAO,IAAItZ,IAEX6I,EAAMtQ,OAAO95B,KAAKoqC,OACxB,IAAK,MAAOvoC,EAAKukC,KAAQsS,EAAKmC,KAAK8Z,UACb,MAAdvuB,EAAIo6E,QAAkBp6E,EAAIo6E,OAASp2E,GAGvCyQ,EAAKh6C,IAAIgB,EAAKukC,GAElB,MAAO,IACAsS,EACHthC,GAAIwiC,EACJ+tD,UAAWjvD,EAAKivD,UAAUnmG,KAAI,EAAGimG,UAAWf,EAAI6G,kBACrC,CACH9F,UAAW,GAAUf,GACrB6G,YAAaA,IAAe,MAGpC9xD,SAAU/C,EAAK+C,SACf+xD,mBAAoB90D,EAAK80D,yBAAsB35G,EAC/CgnD,OAER,ED1BA,SAAWslE,GACP,IAAIM,EAoDAC,EAmDA96E,GAtGJ,SAAW66E,GACP,IAAI76E,EACJ66E,EAAmBvlF,MAAQ,KACT,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,MACD,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEU,MAAX1tB,EAAIJ,KAA2B,KAAZI,EAAIJ,MACxB+J,EAAE0d,OAAO,IACT1d,EAAE1Z,OAAO+P,EAAIJ,MAEC,MAAbI,EAAI1M,OAAiB0M,EAAI1M,MAAMw+B,WAAa,IAC7CnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAI1M,SAEa,IAAzB4lC,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,KACR,MAAMyQ,EAAM,CACRJ,IAAK,GACLtM,MAAO,IAAIkC,WAAW,IAEpB3E,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,OAAQ8c,IAAQ,GACZ,KAAK,EACDnkC,EAAIJ,IAAMif,EAAO5uB,SACjB,MACJ,KAAK,EACD+P,EAAI1M,MAAQurB,EAAO1Y,QACnB,MACJ,QACI0Y,EAAOiJ,SAAe,EAANqc,GAG5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEX66E,EAAmB9tH,OAAUsP,GAClB6hC,GAAc7hC,EAAKw+G,EAAmBvlF,SAEjDulF,EAAmB/sH,OAAU2E,GAClB4iC,EAAc5iC,EAAKooH,EAAmBvlF,QAEpD,CAlDD,CAkDGulF,EAAqBN,EAAKM,qBAAuBN,EAAKM,mBAAqB,CAAC,IAE/E,SAAWC,GACP,IAAI96E,EACJ86E,EAAexlF,MAAQ,KACL,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,MACD,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEU,MAAX1tB,EAAIJ,KAA2B,KAAZI,EAAIJ,MACxB+J,EAAE0d,OAAO,IACT1d,EAAE1Z,OAAO+P,EAAIJ,MAEA,MAAbI,EAAI1M,QACJqW,EAAE0d,OAAO,IACT+2F,GAAInlF,QAAQvoC,OAAOsP,EAAI1M,MAAOqW,KAEL,IAAzBuvB,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,KACR,MAAMyQ,EAAM,CACRJ,IAAK,IAEH/O,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,OAAQ8c,IAAQ,GACZ,KAAK,EACDnkC,EAAIJ,IAAMif,EAAO5uB,SACjB,MACJ,KAAK,EACD+P,EAAI1M,MAAQ8qH,GAAInlF,QAAQxnC,OAAOotB,EAAQA,EAAOwI,UAC9C,MACJ,QACIxI,EAAOiJ,SAAe,EAANqc,GAG5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEX86E,EAAe/tH,OAAUsP,GACd6hC,GAAc7hC,EAAKy+G,EAAexlF,SAE7CwlF,EAAehtH,OAAU2E,GACd4iC,EAAc5iC,EAAKqoH,EAAexlF,QAEhD,CAjDD,CAiDGwlF,EAAiBP,EAAKO,iBAAmBP,EAAKO,eAAiB,CAAC,IAEnEP,EAAKjlF,MAAQ,KACK,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,KAI9B,IAH6B,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEe,MAAjB1tB,EAAI0lG,UACJ,IAAK,MAAMpyG,KAAS0M,EAAI0lG,UACpB/7F,EAAE0d,OAAO,IACT82F,GAAQllF,QAAQvoC,OAAO4C,EAAOqW,GAGtC,GAAqB,MAAjB3J,EAAIy3C,UACJ,IAAK,MAAMnkD,KAAS0M,EAAIy3C,UACpB9tC,EAAE0d,OAAO,IACT1d,EAAE1Z,OAAOqD,GAWjB,GARqB,MAAjB0M,EAAIqtE,YACJ1jE,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIqtE,YAEc,MAA1BrtE,EAAIurG,qBACJ5hG,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIurG,qBAEI,MAAhBvrG,EAAIw5C,UAA0C,IAAtBx5C,EAAIw5C,SAASz/C,KACrC,IAAK,MAAO6F,EAAKtM,KAAU0M,EAAIw5C,SAASkZ,UACpC/oD,EAAE0d,OAAO,IACT62F,EAAKM,mBAAmBvlF,QAAQvoC,OAAO,CAAEkP,MAAKtM,SAASqW,GAG/D,GAAgB,MAAZ3J,EAAI44C,MAAkC,IAAlB54C,EAAI44C,KAAK7+C,KAC7B,IAAK,MAAO6F,EAAKtM,KAAU0M,EAAI44C,KAAK8Z,UAChC/oD,EAAE0d,OAAO,IACT62F,EAAKO,eAAexlF,QAAQvoC,OAAO,CAAEkP,MAAKtM,SAASqW,IAG9B,IAAzBuvB,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,KACR,MAAMyQ,EAAM,CACR0lG,UAAW,GACXjuD,UAAW,GACX+B,SAAU,IAAIla,IACdsZ,KAAM,IAAItZ,KAERzuC,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,OAAQ8c,IAAQ,GACZ,KAAK,EACDnkC,EAAI0lG,UAAUv0G,KAAKgtH,GAAQllF,QAAQxnC,OAAOotB,EAAQA,EAAOwI,WACzD,MACJ,KAAK,EACDrnB,EAAIy3C,UAAUtmD,KAAK0tB,EAAO5uB,UAC1B,MACJ,KAAK,EACD+P,EAAIqtE,UAAYxuD,EAAO1Y,QACvB,MACJ,KAAK,EACDnG,EAAIurG,mBAAqB1sF,EAAO1Y,QAChC,MACJ,KAAK,EAAG,CACJ,MAAMgpC,EAAQ+uE,EAAKM,mBAAmBvlF,QAAQxnC,OAAOotB,EAAQA,EAAOwI,UACpErnB,EAAIw5C,SAAS56C,IAAIuwC,EAAMvvC,IAAKuvC,EAAM77C,OAClC,KACJ,CACA,KAAK,EAAG,CACJ,MAAM67C,EAAQ+uE,EAAKO,eAAexlF,QAAQxnC,OAAOotB,EAAQA,EAAOwI,UAChErnB,EAAI44C,KAAKh6C,IAAIuwC,EAAMvvC,IAAKuvC,EAAM77C,OAC9B,KACJ,CACA,QACIurB,EAAOiJ,SAAe,EAANqc,GAG5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEXu6E,EAAKxtH,OAAUsP,GACJ6hC,GAAc7hC,EAAKk+G,EAAKjlF,SAEnCilF,EAAKzsH,OAAU2E,GACJ4iC,EAAc5iC,EAAK8nH,EAAKjlF,QAEtC,CAnMD,CAmMGilF,KAASA,GAAO,CAAC,IAEpB,SAAWC,GACP,IAAIx6E,EACJw6E,EAAQllF,MAAQ,KACE,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,MACD,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEgB,MAAjB1tB,EAAIwlG,WAAqBxlG,EAAIwlG,UAAU1zE,WAAa,IACrDnoB,EAAE0d,OAAO,IACT1d,EAAExD,MAAMnG,EAAIwlG,YAEO,MAAnBxlG,EAAIsrG,cACJ3hG,EAAE0d,OAAO,IACT1d,EAAE6d,KAAKxnB,EAAIsrG,eAEc,IAAzBpyE,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,KACR,MAAMyQ,EAAM,CACRwlG,UAAW,IAAIhwG,WAAW,IAExB3E,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,OAAQ8c,IAAQ,GACZ,KAAK,EACDnkC,EAAIwlG,UAAY3mF,EAAO1Y,QACvB,MACJ,KAAK,EACDnG,EAAIsrG,YAAczsF,EAAO2I,OACzB,MACJ,QACI3I,EAAOiJ,SAAe,EAANqc,GAG5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEXw6E,EAAQztH,OAAUsP,GACP6hC,GAAc7hC,EAAKm+G,EAAQllF,SAEtCklF,EAAQ1sH,OAAU2E,GACP4iC,EAAc5iC,EAAK+nH,EAAQllF,QAEzC,CAjDD,CAiDGklF,KAAYA,GAAU,CAAC,IAE1B,SAAWC,GACP,IAAIz6E,EACJy6E,EAAInlF,MAAQ,KACM,MAAV0K,IACAA,EAASrmC,IAAQ,CAAC0C,EAAK2J,EAAGuvB,EAAO,CAAC,MACD,IAAzBA,EAAK4I,iBACLn4B,EAAE+jB,OAEY,MAAb1tB,EAAI1M,OAA+B,IAAd0M,EAAI1M,QAC1BqW,EAAE0d,OAAO,GACT1d,EAAE0d,OAAOrnB,EAAI1M,QAEC,MAAd0M,EAAIu+G,SACJ50G,EAAE0d,OAAO,IACT1d,EAAEse,OAAOjoB,EAAIu+G,UAEY,IAAzBrlF,EAAK4I,iBACLn4B,EAAEgkB,QACN,IACD,CAAC9O,EAAQtvB,KACR,MAAMyQ,EAAM,CACR1M,MAAO,GAELzC,EAAgB,MAAVtB,EAAiBsvB,EAAOxkB,IAAMwkB,EAAOxoB,IAAM9G,EACvD,KAAOsvB,EAAOxoB,IAAMxF,GAAK,CACrB,MAAMszC,EAAMtlB,EAAOwI,SACnB,OAAQ8c,IAAQ,GACZ,KAAK,EACDnkC,EAAI1M,MAAQurB,EAAOwI,SACnB,MACJ,KAAK,EACDrnB,EAAIu+G,OAAS1/F,EAAOoJ,SACpB,MACJ,QACIpJ,EAAOiJ,SAAe,EAANqc,GAG5B,CACA,OAAOnkC,CAAG,KAGX2jC,GAEXy6E,EAAI1tH,OAAUsP,GACH6hC,GAAc7hC,EAAKo+G,EAAInlF,SAElCmlF,EAAI3sH,OAAU2E,GACH4iC,EAAc5iC,EAAKgoH,EAAInlF,QAErC,CAjDD,CAiDGmlF,KAAQA,GAAM,CAAC,IE9SlB,MAAMM,GAAW,IACXC,IAAW,IAAInhF,aAAc9sC,OAAOguH,IACpCE,GAAUD,GAAS,GAiBlB,MAAME,GACTC,KAKA,WAAAn+G,CAAYyI,EAAGkqF,GACX,GAAiB,iBAANlqF,EACPvV,KAAKirH,KAAO,GAAqB11G,OAEhC,MAAIA,aAAa5T,YAIlB,MAAM,IAAI3D,MAAM,+CAHhBgC,KAAKirH,KAAO11G,CAIhB,CAOA,GANa,MAATkqF,IACAA,GAAQ,GAERA,GACAz/F,KAAKy/F,QAEoB,IAAzBz/F,KAAKirH,KAAKhtF,YAAoBj+B,KAAKirH,KAAK,KAAOF,GAC/C,MAAM,IAAI/sH,MAAM,cAExB,CAOA,QAAAS,CAASk+B,EAAW,QAChB,OAAO,GAAmB38B,KAAKirH,KAAMtuF,EACzC,CAMA,UAAAuuF,GACI,OAAOlrH,KAAKirH,IAChB,CAMA,IAAKj9G,OAAO80B,eACR,MAAO,OAAO9iC,KAAKvB,aACvB,CAaA,qBAAO0sH,CAAe1uE,GAClB,OAAO,IAAIuuE,GAAIvuE,EAAK/+C,KAAKmtH,IAC7B,CAYA,aAAOzlE,GACH,OAAO,IAAI4lE,GAAIxuH,KAAK4oD,SAAS3mD,WAAW4M,UAAU,GACtD,CAIA,YAAO+/G,CAAMj/E,GACT,OAAIA,aAAiBxqC,YAA+B,iBAAVwqC,EAE/B,IAAI6+E,GAAI7+E,GAEa,mBAArBA,EAAM++E,WAEN,IAAIF,GAAI7+E,EAAM++E,cAElB,IACX,CAMA,KAAAzrB,GAII,GAHiB,MAAbz/F,KAAKirH,MAAyC,IAAzBjrH,KAAKirH,KAAKhtF,aAC/Bj+B,KAAKirH,KAAOH,IAEZ9qH,KAAKirH,KAAK,KAAOF,GAAS,CAC1B,MAAMz4G,EAAQ,IAAI3Q,WAAW3B,KAAKirH,KAAKhtF,WAAa,GACpD3rB,EAAMmjC,KAAKs1E,GAAS,EAAG,GACvBz4G,EAAMvH,IAAI/K,KAAKirH,KAAM,GACrBjrH,KAAKirH,KAAO34G,CAChB,CAEA,KAAOtS,KAAKirH,KAAKhtF,WAAa,GAAKj+B,KAAKirH,KAAKjrH,KAAKirH,KAAKhtF,WAAa,KAAO8sF,IACvE/qH,KAAKirH,KAAOjrH,KAAKirH,KAAK13F,SAAS,GAAI,EAE3C,CAOA,IAAA83F,CAAKt/G,GACD,MAAMu/G,EAAQtrH,KAAKy8C,OACb8uE,EAAQx/G,EAAI0wC,OAClB,IAAK,IAAI7/C,EAAI,EAAGA,EAAI0uH,EAAM5vH,OAAQkB,IAAK,CACnC,GAAI2uH,EAAM7vH,OAASkB,EAAI,EACnB,OAAO,EAEX,MAAM+J,EAAK2kH,EAAM1uH,GACXgK,EAAK2kH,EAAM3uH,GACjB,GAAI+J,EAAKC,EACL,OAAO,EAEN,GAAID,EAAKC,EACV,OAAO,CAEf,CACA,OAAO0kH,EAAM5vH,OAAS6vH,EAAM7vH,MAChC,CAYA,OAAAwgD,GACI,OAAO8uE,GAAIG,eAAenrH,KAAKy8C,OAAOh/C,QAAQy+C,UAClD,CAMA,UAAA50C,GACI,OAAOtH,KAAKy8C,MAChB,CAWA,aAAA+uE,GACI,MAAM/oF,EAAKziC,KAAKsH,aAChB,OAAOm7B,EAAGA,EAAG/mC,OAAS,EAC1B,CAYA,IAAA+gD,GACI,OAAOz8C,KAAKvB,WAAWiH,MAAMmlH,IAAUptH,MAAM,EACjD,CAYA,IAAAyK,GACI,OAqJR,SAAuBu6B,GACnB,MAAMvlC,EAAQulC,EAAG/8B,MAAM,KACvB,OAAIxI,EAAMxB,OAAS,EACR,GAEJwB,EAAMO,MAAM,GAAI,GAAGC,KAAK,IACnC,CA3Je+tH,CAAczrH,KAAKwrH,gBAC9B,CAYA,IAAA3/G,GACI,OAoJR,SAAwB42B,GACpB,MAAMvlC,EAAQulC,EAAG/8B,MAAM,KACvB,OAAOxI,EAAMA,EAAMxB,OAAS,EAChC,CAvJegwH,CAAe1rH,KAAKwrH,gBAC/B,CAaA,QAAA93E,CAASn+B,GACL,OAAO,IAAIy1G,GAAIhrH,KAAKvB,WAAa,IAAM8W,EAC3C,CAYA,IAAAhQ,GACI,IAAIlJ,EAAI2D,KAAKqoB,SAAS5pB,WAKtB,OAJKpC,EAAE21B,SAAS64F,MACZxuH,GAAKwuH,IAETxuH,GAAK2D,KAAKkI,OACH,IAAI8iH,GAAI3uH,EACnB,CAYA,MAAAgsB,GACI,MAAMo0B,EAAOz8C,KAAKy8C,OAClB,OAAoB,IAAhBA,EAAK/gD,OACE,IAAIsvH,GAAIH,IAEZ,IAAIG,GAAIvuE,EAAKh/C,MAAM,GAAI,GAAGC,KAAKmtH,IAC1C,CAaA,KAAAc,CAAM5/G,GACF,OAAI/L,KAAKvB,aAAeosH,GACb9+G,EAEFA,EAAItN,aAAeosH,GACjB7qH,KAEJ,IAAIgrH,GAAIhrH,KAAKvB,WAAasN,EAAItN,YAAY,EACrD,CAaA,YAAAmtH,CAAaz/E,GACT,OAAIA,EAAM1tC,aAAeuB,KAAKvB,YAGvB0tC,EAAM1tC,WAAWwzB,WAAWjyB,KAAKvB,WAC5C,CAaA,aAAAotH,CAAc1/E,GACV,OAAIA,EAAM1tC,aAAeuB,KAAKvB,YAGvBuB,KAAKvB,WAAWwzB,WAAWka,EAAM1tC,WAC5C,CAMA,UAAAqtH,GACI,OAA8B,IAAvB9rH,KAAKy8C,OAAO/gD,MACvB,CAOA,MAAAiU,IAAU5Q,GACN,OAAOisH,GAAIG,eAAe,IAAInrH,KAAKsH,iBAiC1BwsC,EAjCmD/0C,EAAK2M,KAAIK,GAAOA,EAAIzE,eAkC7E,GAAKqI,UAAUmkC,MAD1B,IAAiBA,CAhCb,ECtWG,MAAMi4E,GAAmB,UACzB,SAASC,GAAqBloE,GACjC,IAAKgR,GAAShR,IAA0B,MAAfA,EAAO57C,KAC5B,MAAM,IAAI,GAAU,iBAAkB,GAAMkiH,wBAEhD,MAAM6B,EAASnoE,EAAOw5C,QAAQ7+F,WAC9B,OAAO,IAAIusH,GAAI,GAAGe,KAAmBE,IACzC,CCROlhF,eAAemhF,GAA6BpoE,EAAQpnC,EAAQm1F,GAC/D,MAAMsa,EAAa,IAAI1gF,IACvB,IAAK,MAAMotB,KAAQg5C,EAAW,CAC1B,GAAY,MAARh5C,EACA,SAKJ,GAHIA,EAAK84C,qBAAqBhwG,aAC1Bk3D,EAAK84C,UAAY,GAAU94C,EAAK84C,aAE/Br3C,GAAYzB,EAAK84C,WAClB,MAAM,IAAI,GAAU,wBAAyB,GAAMyY,wBAEvD,UAAY1tG,EAAOonC,EAAQ+U,EAAK84C,WAC5B,SAEJ,MAAM8F,EAAc5+C,EAAK4+C,cAAe,EAClC2U,EAAQvzD,EAAK84C,UAAUlzG,WACvB4tH,EAAeF,EAAWrhH,IAAIshH,GAChB,MAAhBC,EACAxzD,EAAK4+C,YAAc4U,EAAa5U,aAAeA,EAG/C0U,EAAWphH,IAAIqhH,EAAO,CAClBza,UAAW94C,EAAK84C,UAChB8F,eAGZ,CACA,MAAO,IAAI0U,EAAW1pG,UACjBoC,MAAK,CAACwV,EAAGh9B,IACHg9B,EAAEs3E,UAAUlzG,WAAW0zG,cAAc90G,EAAEs0G,UAAUlzG,cAEvDiN,KAAI,EAAG+rG,cAAa9F,gBAAgB,CACrC8F,cACA9F,UAAWA,EAAUr/F,SAE7B,CCnCOy4B,eAAeuhF,GAASxoE,EAAQ1lB,EAAMmuF,EAAUxrH,GACnD,GAAY,MAARq9B,EACA,MAAM,IAAI,GAAU,mBAAoB,GAAMgsF,wBAElD,GAAsB,MAAlBhsF,EAAKo7C,WAAyC,MAApB11B,EAAO01B,YAAsB,GAAiBp7C,EAAKo7C,UAAW11B,EAAO01B,WAC/F,MAAM,IAAI,GAAU,uDAAwD,GAAM4wC,wBAEtF,MAAMxS,EAAe72G,EAAQ62G,aAC7B,GAAoB,MAAhBA,IAAyB9zD,EAAO5X,OAAO0rE,EAAat2F,IACpD,MAAM,IAAI,GAAU,yCAA0C,GAAM8oG,wBAExE,IAAIvY,EAAY+F,GAAc/F,WAAa,GACvCjuD,EAAY,IAAIrL,IAAIq/D,GAAch0D,WAAa,IAC/C+B,EAAWiyD,GAAcjyD,UAAY,IAAIla,IACzCsZ,EAAO6yD,GAAc7yD,MAAQ,IAAItZ,IACjCisE,EAAqBE,GAAcF,mBAoCvC,GAlCiB,UAAb6U,IACuB,MAAnBnuF,EAAK+yE,YAAwC,MAAlB/yE,EAAKyzE,YAChCA,EAAY,GACW,MAAnBzzE,EAAK+yE,YACLU,EAAUv0G,QAAQ8gC,EAAK+yE,WAAWzlG,KAAIimG,IAAa,CAC/C8F,aAAa,EACb9F,iBAGc,MAAlBvzE,EAAKyzE,WACLA,EAAUv0G,QAAQ8gC,EAAKyzE,YAGT,MAAlBzzE,EAAKwlB,YACLA,EAAY,IAAIrL,IAAIna,EAAKwlB,YAER,MAAjBxlB,EAAKunB,WAELA,EAAW6mE,GADapuF,EAAKunB,oBAAoBla,IAAM,IAAIrN,EAAKunB,SAASkZ,WAAa//D,OAAO+/D,QAAQzgC,EAAKunB,UAC9D,CACxCotD,SAAU0Z,MAGD,MAAbruF,EAAK2mB,OAELA,EAAOynE,GADapuF,EAAK2mB,gBAAgBtZ,IAAM,IAAIrN,EAAK2mB,KAAK8Z,WAAa//D,OAAO+/D,QAAQzgC,EAAK2mB,MAC1D,CAChCguD,SAAU2Z,GACVhhH,IAAKihH,MAGkB,MAA3BvuF,EAAKs5E,qBACLA,EAAqBt5E,EAAKs5E,qBAIjB,UAAb6U,EAAsB,CAatB,GAZuB,MAAnBnuF,EAAK+yE,YACLU,EAAUv0G,QAAQ8gC,EAAK+yE,WAAWzlG,KAAIimG,IAAa,CAC/C8F,aAAa,EACb9F,iBAGc,MAAlBvzE,EAAKyzE,WACLA,EAAUv0G,QAAQ8gC,EAAKyzE,WAEL,MAAlBzzE,EAAKwlB,YACLA,EAAY,IAAIrL,IAAI,IAAIqL,KAAcxlB,EAAKwlB,aAE1B,MAAjBxlB,EAAKunB,SAAkB,CACvB,MAAMinE,EAAkBxuF,EAAKunB,oBAAoBla,IAAM,IAAIrN,EAAKunB,SAASkZ,WAAa//D,OAAO+/D,QAAQzgC,EAAKunB,UAC1G,IAAK,MAAO55C,EAAKtM,KAAUmtH,EACV,MAATntH,EACAkmD,EAAS3C,OAAOj3C,GAGhB45C,EAAS56C,IAAIgB,EAAKtM,GAG1BkmD,EAAW6mE,GAAgB,IAAI7mE,EAASkZ,WAAY,CAChDk0C,SAAU0Z,IAElB,CACA,GAAiB,MAAbruF,EAAK2mB,KAAc,CACnB,MAAM8nE,EAAczuF,EAAK2mB,gBAAgBtZ,IAAM,IAAIrN,EAAK2mB,KAAK8Z,WAAa//D,OAAO+/D,QAAQzgC,EAAK2mB,MACxF+nE,EAAa,IAAIrhF,IAAIsZ,GAC3B,IAAK,MAAOh5C,EAAKtM,KAAUotH,EACV,MAATptH,EACAqtH,EAAW9pE,OAAOj3C,GAGlB+gH,EAAW/hH,IAAIgB,EAAKtM,GAG5BslD,EAAOynE,GAAgB,IAAIM,EAAWjuD,WAAY,CAC9Ck0C,SAAU2Z,GACVhhH,IAAKihH,IAEb,CAC+B,MAA3BvuF,EAAKs5E,qBACLA,EAAqBt5E,EAAKs5E,mBAElC,CACA,MAAMliE,EAAS,CACXq8D,gBAAiBqa,GAA6BpoE,EAAQ/iD,EAAQgsH,eAAiB,WAAa,GAAOlb,GACnGjuD,UAAW,IAAIA,EAAUnhC,UAAUoC,MAAK,CAACwV,EAAGh9B,IACjCg9B,EAAE83E,cAAc90G,KAE3BsoD,WACAZ,OACAy0B,UAAWo+B,GAAct2F,GAAGk4D,WAAap7C,EAAKo7C,WAAa11B,EAAO01B,UAClEk+B,sBAMJ,MAHoB,QAAhB5zD,EAAO57C,aACAstC,EAAOgkC,UAEXhkC,CACX,CAKA,SAASg3E,GAAgB3tD,EAAS99D,GAC9B,MAAMy0C,EAAS,IAAI/J,IACnB,IAAK,MAAO1/B,EAAKtM,KAAUo/D,EACV,MAATp/D,GAGJsB,EAAQgyG,SAAShnG,EAAKtM,GAE1B,IAAK,MAAOsM,EAAKtM,KAAUo/D,EAAQh6C,MAAK,EAAEwV,IAAKh9B,KACpCg9B,EAAE83E,cAAc90G,KAEV,MAAToC,GACA+1C,EAAOzqC,IAAIgB,EAAKhL,EAAQ2K,MAAMK,EAAKtM,IAAUA,GAGrD,OAAO+1C,CACX,CACA,SAASi3E,GAAiB1gH,EAAKtM,GAC3B,GAAmB,iBAARsM,EACP,MAAM,IAAI,GAAU,gCAAiC,GAAMq+G,wBAE/D,KAAM3qH,aAAiBkC,YACnB,MAAM,IAAI,GAAU,sCAAuC,GAAMyoH,uBAEzE,CACA,SAASsC,GAAY3gH,EAAKukC,GACtB,GAAmB,iBAARvkC,EACP,MAAM,IAAI,GAAU,4BAA6B,GAAMq+G,wBAE3D,GAAiB,MAAb95E,EAAI7wC,MAAe,CACnB,GAAIqJ,SAAS,GAAGwnC,EAAI7wC,QAAS,MAAQ6wC,EAAI7wC,MACrC,MAAM,IAAI,GAAU,+BAAgC,GAAM2qH,wBAE9D,GAAI95E,EAAI7wC,MAAQ,GAAK6wC,EAAI7wC,MAAQ,IAC7B,MAAM,IAAI,GAAU,kCAAmC,GAAM2qH,uBAErE,CACA,GAAe,MAAX95E,EAAIghE,IAAa,CACjB,GAAIxoG,SAAS,GAAGwnC,EAAIghE,MAAO,MAAQhhE,EAAIghE,IACnC,MAAM,IAAI,GAAU,6BAA8B,GAAM8Y,wBAE5D,GAAI95E,EAAIghE,IAAM,EACV,MAAM,IAAI,GAAU,yCAA0C,GAAM8Y,uBAE5E,CACJ,CACA,SAASuC,GAAO5gH,EAAKukC,GACjB,IAAIo6E,EAOJ,OANkB,MAAdp6E,EAAIo6E,SACJA,EAASp6E,EAAIo6E,QAEF,MAAXp6E,EAAIghE,MACJoZ,EAAS1mF,OAAO95B,KAAKoqC,MAAQ50C,OAAO4wC,EAAIghE,OAErC,CACH7xG,MAAO6wC,EAAI7wC,OAAS,EACpBirH,SAER,CCzKA,SAASsC,GAAWjhH,EAAKtM,EAAOgR,GAE5B,MAAMoB,EAAY9F,EAAItN,WAAWiH,MAAM,KAAK,GAEtCo+C,EAASg6C,GADHzqF,GAAOzV,OAAOiU,IAEpBo7G,EAASx8G,EAAM3F,IAAIg5C,GACzB,GAAc,MAAVmpE,EACA,OAAOA,EAEX,MAAMrqE,EAAO4nE,GAAY1mE,EAAQrkD,GAEjC,OADAgR,EAAM1F,IAAI+4C,EAAQlB,GACXA,CACX,CAeO,MAAMsqE,GACTppE,OACAqpE,UACA3vD,KACAuvD,cACA,WAAAjgH,CAAYm3C,EAAYj5C,EAAO,CAAC,GAC5BhL,KAAK8jD,OAASG,EAAWH,OACzB9jD,KAAKmtH,UAAYlpE,EAAWkpE,UAC5BntH,KAAK+sH,cAAgB/hH,EAAK+hH,cAC1B/sH,KAAKw9D,KR0IE,SAAuBz8D,GAClC,MAAMskC,EAAOvmC,OAAOoN,OAAO,CAAC,EAAG,GAAgBnL,GAwB/C,OAvBsB,MAAlBmpH,KACAA,GFzGR,CAAgBnpH,IAGZ,GAFAA,EAAUjC,OAAOoN,OAAO,CAAC,EAAG69G,GAAgBhpH,GAC1BomB,QAAQzL,WAAWnT,WAAaxH,EAAQipH,cAC3C,CACX,MAAM96G,EAAU,IAAIy+C,YAGpB,OAFA,GAASxM,iBAAiB,UAAW+nE,GAAwBh6G,EAAS,kBAAmB05G,GAA0BC,GAA0BC,KAC7I,GAAS3nE,iBAAiB,UAAW+nE,GAAwBh6G,EAAS,mBAAoB65G,GAA2BC,GAA2BC,KACzI/5G,CACX,CACA,MAAO,CACHk+G,UAAU,EACVC,SAAWxhH,GAASg+G,GAAsBh+G,EAAM+8G,GAA0BE,GAAwBD,IAClGyE,UAAYzhH,GAASg+G,GAAsBh+G,EAAMk9G,GAA2BE,GAAyBD,IAE5G,EE2FwB,CAAK3jF,IACU,IAA5B6kF,GAAekD,WAEflD,GAAe/oE,iBAAiB,mBAAoB1yC,IAChB,MAA5Bw7G,GAAQx7G,EAAM2vB,KAAKvyB,OAGlBo+G,GAAQx7G,EAAM2vB,KAAKvyB,MAAMwhH,WACzBv/G,MAAKi9B,MAAO6qE,GAAYnnG,EAAM2vB,KAAKqrF,UAAUx+D,SAAQ,KAAQ2qD,GAAS,KAAK,IAEpFsU,GAAe/oE,iBAAiB,oBAAoBpW,MAAOt8B,IACvB,MAA5Bw7G,GAAQx7G,EAAM2vB,KAAKvyB,OAGlBo+G,GAAQx7G,EAAM2vB,KAAKvyB,MAAMyhH,YACzBx/G,MAAKi9B,MAAO6qE,GAAYnnG,EAAM2vB,KAAKqrF,UAAUx+D,SAAQ,KAAQ2qD,GAAS,KAAK,MAIlE,MAAtBqU,GAAQ5kF,EAAKx5B,QACbo+G,GAAQ5kF,EAAKx5B,MA7ED,EAACA,EAAM9K,KACvB,IAAgC,IAA5BmpH,GAAekD,SACf,MAAO,CACHC,SAAUnD,GAAemD,SAASxhH,EAAM9K,GACxCusH,UAAWpD,GAAeoD,UAAUzhH,EAAM9K,IAGlD,MAAMwsH,EAAc,IAAI/F,GAAO,CAAEG,YAAa,IAC9C,IAAI6F,EACJ,MAAO,CACH,cAAMH,GAEF,GAAiB,MAAbG,EACA,OAAOrD,GAAkBqD,EAAWzsH,GAGxCysH,EAAY,IAAIhG,GAAO,CACnBG,YAAa5mH,EAAQ4mH,YACrBC,WAAW,IAEf,MAAM6F,EAAiBD,EAEjBE,EAAcvD,GAAkBqD,EAAWzsH,GAejD,OAdKwsH,EAAYnmG,KAAI2jB,UAGjB0iF,EAAe1wH,cAIT0wH,EAAejF,SAChB16G,MAAK,KACF0/G,IAAcC,IACdD,EAAY,KAChB,GACF,IAECE,CACX,EACA3iF,UAAe,UAIXyiF,EAAY,KACLrD,GAAkBoD,EAAaxsH,IAE7C,EA+BwB4sH,CAAYtoF,EAAKx5B,KAAMw5B,IAEzC4kF,GAAQ5kF,EAAKx5B,KACxB,CQpKoB,CAAQ,CAChBA,KAAM,aACNm+G,eAAe,GAEvB,CACA,SAAMr7G,CAAIm1C,GACN,OAAO9jD,KAAKmtH,UAAUx+G,IAAIq9G,GAAqBloE,GACnD,CACA,YAAM,CAAOA,GACT,GAAI9jD,KAAK8jD,OAAO5X,OAAO4X,GACnB,MAAM,IAAI,GAAU,0BAA2B,GAAMsmE,8BAEnDpqH,KAAKmtH,UAAUnqE,OAAOgpE,GAAqBloE,GACrD,CACA,UAAMn8C,CAAKm8C,GAEP,OAAO0mE,GAAY1mE,QADD9jD,KAAKmtH,UAAUriH,IAAIkhH,GAAqBloE,IAE9D,CACA,UAAMz8C,CAAKy8C,EAAQ1lB,GACf,MAAM,YAAEwvF,EAAW,aAAEhW,SAAuB53G,MAAK,EAAkB8jD,GAC7D+pE,QAAevB,GAASxoE,EAAQ1lB,EAAM,QAAS,CACjD2uF,cAAe/sH,KAAK+sH,gBAExB,OAAO/sH,MAAK,EAAiB8jD,EAAQ+pE,EAAQD,EAAahW,EAC9D,CACA,WAAMG,CAAMj0D,EAAQ1lB,GAChB,MAAM,YAAEwvF,EAAW,aAAEhW,SAAuB53G,MAAK,EAAkB8jD,GAC7D+pE,QAAevB,GAASxoE,EAAQ1lB,EAAM,QAAS,CACjD2uF,cAAe/sH,KAAK+sH,cACpBnV,iBAEJ,OAAO53G,MAAK,EAAiB8jD,EAAQ+pE,EAAQD,EAAahW,EAC9D,CACA,WAAMt7F,CAAMwnC,EAAQ1lB,GAChB,MAAM,YAAEwvF,EAAW,aAAEhW,SAAuB53G,MAAK,EAAkB8jD,GAC7D+pE,QAAevB,GAASxoE,EAAQ1lB,EAAM,QAAS,CACjD2uF,cAAe/sH,KAAK+sH,cACpBnV,iBAEJ,OAAO53G,MAAK,EAAiB8jD,EAAQ+pE,EAAQD,EAAahW,EAC9D,CACA,SAAOn2D,CAAIxO,GACP,MAAM66E,EAAY,IAAIjH,GACtB,UAAW,MAAM,IAAE96G,EAAG,MAAEtM,KAAWO,KAAKmtH,UAAUl6E,MAlE1D,SAAkBA,EAAOxiC,GACrB,OAAa,MAATwiC,EACO,CAAC,EAEL,CACHrtC,OAAQmmH,GACRgC,SAAU96E,EAAM86E,SAAW,IAAIriH,KAAIrQ,GAAM,EAAG0Q,MAAKtM,WACtCpE,EAAG2xH,GAAWjhH,EAAKtM,EAAOgR,MAErCu9G,QAAS/6E,EAAM+6E,QAAU,IAAItiH,KAAIrQ,GAAM,CAACg/B,EAAGh9B,IAChChC,EAAG2xH,GAAW3yF,EAAEtuB,IAAKsuB,EAAE56B,MAAOgR,GAAQu8G,GAAW3vH,EAAE0O,IAAK1O,EAAEoC,MAAOgR,MAGpF,CAqDgEw9G,CAASh7E,GAAS,CAAC,EAAG66E,IAAa,CACvF,MAAMlrE,EAAOoqE,GAAWjhH,EAAKtM,EAAOquH,GAChClrE,EAAKthC,GAAG4qB,OAAOlsC,KAAK8jD,gBAIlBlB,EACV,CACJ,CACA,OAAM,CAAkBkB,GACpB,IACI,MAAM8pE,QAAoB5tH,KAAKmtH,UAAUriH,IAAIkhH,GAAqBloE,IAElE,MAAO,CACH8pE,cACAhW,aAHiB4S,GAAY1mE,EAAQ8pE,GAK7C,CACA,MAAO3xH,GACH,GAAiB,kBAAbA,EAAIoQ,KACJ,MAAMpQ,CAEd,CACA,MAAO,CAAC,CACZ,CACA,OAAM,CAAiB6nD,EAAQlB,EAAMgrE,EAAahW,GAC9C,MAAMr1G,EAAM8nH,GAAOxtH,OAAO+lD,GAC1B,OAAmB,MAAfgrE,GAAuB,GAAiBrrH,EAAKqrH,GACtC,CACHhrE,KAAM4nE,GAAY1mE,EAAQvhD,GAC1B2rH,SAAUtW,EACVuW,SAAS,UAGXnuH,KAAKmtH,UAAUiB,IAAIpC,GAAqBloE,GAASvhD,GAChD,CACHqgD,KAAM4nE,GAAY1mE,EAAQvhD,GAC1B2rH,SAAUtW,EACVuW,SAAS,GAEjB,ECvHG,MAAME,GACT9hE,MACA98C,OACAq0C,OACAllD,IACA,WAAAkO,CAAYm3C,EAAYj5C,EAAO,CAAC,GAC5BhL,KAAKpB,IAAMqlD,EAAWxJ,OAAO2zD,aAAa,qBAC1CpuG,KAAKyP,OAASw0C,EAAWx0C,OACzBzP,KAAK8jD,OAASG,EAAWH,OACzB9jD,KAAKusD,MAAQ,IAAI2gE,GAAgBjpE,EAAYj5C,EACjD,CACA,CAACgD,OAAO80B,aAAe,qBACvB,aAAMh3B,CAAQzQ,EAAI43C,GACdjzC,KAAKpB,IAAIsvG,MAAM,2BACf,MAAM0H,QAAgB51G,KAAKusD,MAAMiR,KAAK6vD,WACtCrtH,KAAKpB,IAAIsvG,MAAM,yBACf,IACI,UAAW,MAAMtrD,KAAQ5iD,KAAKusD,MAAM9K,IAAIxO,GACpC53C,EAAGunD,EAEX,CACA,QACI5iD,KAAKpB,IAAIsvG,MAAM,6BACf0H,GACJ,CACJ,CACA,SAAMn0D,CAAIxO,GACNjzC,KAAKpB,IAAIsvG,MAAM,uBACf,MAAM0H,QAAgB51G,KAAKusD,MAAMiR,KAAK6vD,WACtCrtH,KAAKpB,IAAIsvG,MAAM,qBACf,IACI,aAAa,GAAIluG,KAAKusD,MAAM9K,IAAIxO,GACpC,CACA,QACIjzC,KAAKpB,IAAIsvG,MAAM,yBACf0H,GACJ,CACJ,CACA,YAAM,CAAO9xD,GACT9jD,KAAKpB,IAAIsvG,MAAM,2BACf,MAAM0H,QAAgB51G,KAAKusD,MAAMiR,KAAK8vD,YACtCttH,KAAKpB,IAAIsvG,MAAM,yBACf,UACUluG,KAAKusD,MAAMvJ,OAAOc,EAC5B,CACA,QACI9jD,KAAKpB,IAAIsvG,MAAM,6BACf0H,GACJ,CACJ,CACA,SAAMjnG,CAAIm1C,GACN9jD,KAAKpB,IAAIsvG,MAAM,uBACf,MAAM0H,QAAgB51G,KAAKusD,MAAMiR,KAAK6vD,WACtCrtH,KAAKpB,IAAIsvG,MAAM,qBACf,IACI,aAAaluG,KAAKusD,MAAM59C,IAAIm1C,EAChC,CACA,QACI9jD,KAAKpB,IAAIsvG,MAAM,yBACf0H,GACJ,CACJ,CACA,SAAM9qG,CAAIg5C,GACN9jD,KAAKpB,IAAIsvG,MAAM,uBACf,MAAM0H,QAAgB51G,KAAKusD,MAAMiR,KAAK6vD,WACtCrtH,KAAKpB,IAAIsvG,MAAM,qBACf,IACI,aAAaluG,KAAKusD,MAAM5kD,KAAKm8C,EACjC,CACA,QACI9jD,KAAKpB,IAAIsvG,MAAM,yBACf0H,GACJ,CACJ,CACA,UAAMvuG,CAAKia,EAAI8c,GACXp+B,KAAKpB,IAAIsvG,MAAM,yBACf,MAAM0H,QAAgB51G,KAAKusD,MAAMiR,KAAK8vD,YACtCttH,KAAKpB,IAAIsvG,MAAM,uBACf,IACI,MAAM//F,QAAenO,KAAKusD,MAAMllD,KAAKia,EAAI8c,GAEzC,OADAp+B,MAAK,EAAeshB,EAAInT,GACjBA,EAAOy0C,IAClB,CACA,QACI5iD,KAAKpB,IAAIsvG,MAAM,2BACf0H,GACJ,CACJ,CACA,WAAMmC,CAAMz2F,EAAI8c,GACZp+B,KAAKpB,IAAIsvG,MAAM,0BACf,MAAM0H,QAAgB51G,KAAKusD,MAAMiR,KAAK8vD,YACtCttH,KAAKpB,IAAIsvG,MAAM,wBACf,IACI,MAAM//F,QAAenO,KAAKusD,MAAMwrD,MAAMz2F,EAAI8c,GAE1C,OADAp+B,MAAK,EAAeshB,EAAInT,GACjBA,EAAOy0C,IAClB,CACA,QACI5iD,KAAKpB,IAAIsvG,MAAM,4BACf0H,GACJ,CACJ,CACA,WAAMt5F,CAAMgF,EAAI8c,GACZp+B,KAAKpB,IAAIsvG,MAAM,0BACf,MAAM0H,QAAgB51G,KAAKusD,MAAMiR,KAAK8vD,YACtCttH,KAAKpB,IAAIsvG,MAAM,wBACf,IACI,MAAM//F,QAAenO,KAAKusD,MAAMjwC,MAAMgF,EAAI8c,GAE1C,OADAp+B,MAAK,EAAeshB,EAAInT,GACjBA,EAAOy0C,IAClB,CACA,QACI5iD,KAAKpB,IAAIsvG,MAAM,4BACf0H,GACJ,CACJ,CACA,uBAAM0Y,CAAkB/rH,EAAKgsH,GACzB,MAAM1b,QAAiBL,GAAemF,eAAep1G,EAAKkvG,GAAWO,QACrE,IAA8C,IAA1Cuc,GAAcriF,OAAO2mE,EAAS/uD,QAE9B,OADA9jD,KAAKpB,IAAI,4EAA6E2vH,EAAc1b,EAAS/uD,SACtG,EAEX,MAAMguD,EAAaL,GAAWqB,mBAAmBD,EAAStiE,SAC1D,IAAIqS,EACJ,IACIA,QAAa5iD,KAAK8K,IAAI+nG,EAAS/uD,OACnC,CACA,MAAO7nD,GACH,GAAiB,kBAAbA,EAAIoQ,KACJ,MAAMpQ,CAEd,CAEA,GAAgC,MAA5B2mD,GAAM80D,mBAA4B,CAClC,MAAMG,QAAuBrF,GAAeM,mBAAmBlwD,EAAK80D,oBAC9DI,EAAerG,GAAWqB,mBAAmB+E,EAAetnE,SAClE,GAAIunE,EAAa/F,WAAaD,EAAWC,UAErC,OADA/xG,KAAKpB,IAAI,2FAA4Fk5G,EAAa/F,UAAWD,EAAWC,YACjI,CAEf,CAQA,aAPM/xG,KAAK+3G,MAAMjG,EAAWhuD,OAAQ,CAChC4zD,mBAAoBn1G,EACpBsvG,UAAWC,EAAWX,WAAWzlG,KAAIimG,IAAa,CAC9C8F,aAAa,EACb9F,mBAGD,CACX,CACA,GAAerwF,EAAInT,GACVA,EAAOggH,UAGRnuH,KAAK8jD,OAAO5X,OAAO5qB,GACnBthB,KAAKyP,OAAOo+C,kBAAkB,mBAAoB,CAAElK,OAAQx1C,IAG5DnO,KAAKyP,OAAOo+C,kBAAkB,cAAe,CAAElK,OAAQx1C,IAE/D,EClIJ,SAVA,SAAe3P,GACX,GAHsC,MAGlBA,EAHPwP,OAAOC,eAIhB,MAAO,WACH,UAAW,MAAM1B,KAAK/N,GACzB,EAFM,GAKP,IAAK,MAAM+N,KAAK/N,GAExB,EC6CA,GA3CA,SAAgBA,EAAQnD,GACpB,IAAIO,EAAQ,EACZ,GAJsC,MAIlB4C,EAJPwP,OAAOC,eAKhB,OAAO,kBACH,UAAW,MAAMqtC,KAAS98C,QACZnD,EAAGigD,EAAO1/C,aACV0/C,EAGjB,CANM,GASX,MAAMkzE,ECRV,SAAkBC,GAEd,MAAO3yE,EAAU9/B,GAA4C,MAAlCyyG,EAASzgH,OAAOC,eAErC,CAACwgH,EAASzgH,OAAOC,iBAAkBD,OAAOC,eAE1C,CAACwgH,EAASzgH,OAAO8tC,YAAa9tC,OAAO8tC,UACrCttC,EAAQ,GAEd,MAAO,CACH4gB,KAAM,IACK0sB,EAAS5tC,OAEpB5Q,KAAOmC,IACH+O,EAAMlR,KAAKmC,EAAM,EAErByO,KAAM,IACEM,EAAM9S,OAAS,EACR,CACH2R,MAAM,EACN5N,MAAO+O,EAAM3I,SAGdi2C,EAAS5tC,OAEpB,CAAC8N,KACG,OAAOhc,IACX,EAER,CDrBqB,CAAKxB,IAChB,MAAEiB,EAAK,KAAE4N,GAASmhH,EAAStgH,OACjC,IAAa,IAATb,EACA,OAAQ,YAAe,CAAhB,GAEX,MAAM0xB,EAAM1jC,EAAGoE,EAAO7D,KAEtB,GAAwB,mBAAbmjC,EAAIjxB,KACX,OAAO,wBACOixB,UACAt/B,GAEV,UAAW,MAAM67C,KAASkzE,QACZnzH,EAAGigD,EAAO1/C,aACV0/C,EAGjB,CATM,GAWX,MAAM83D,EAAO/3G,EACb,OAAO,aACS,IAAR0jC,UACMt/B,GAEV,IAAK,MAAM67C,KAASkzE,EACZpb,EAAK93D,EAAO1/C,aACN0/C,EAGjB,CATM,EAUX,EE1BA,GAZA,SAAc98C,EAAQkwH,GAClB,OAHsC,MAGlBlwH,EAHPwP,OAAOC,eAIT,kBACH,MAAM6lC,QAAY,GAAIt1C,SACfs1C,EAAIjvB,KAAK6pG,EACnB,CAHM,GAKJ,YACH,MAAM56E,EAAM,GAAIt1C,SACTs1C,EAAIjvB,KAAK6pG,EACnB,CAHM,EAIX,ECUA,GA9BA,SAAclwH,EAAQs4D,GAClB,OAHsC,MAGlBt4D,EAHPwP,OAAOC,eAIT,kBACH,IAAIy9C,EAAQ,EACZ,KAAIoL,EAAQ,GAGZ,UAAW,MAAMxb,KAAS98C,EAGtB,SAFM88C,EACNoQ,IACIA,IAAUoL,EACV,MAGX,CAZM,GAcJ,YACH,IAAIpL,EAAQ,EACZ,KAAIoL,EAAQ,GAGZ,IAAK,MAAMxb,KAAS98C,EAGhB,SAFM88C,EACNoQ,IACIA,IAAUoL,EACV,MAGX,CAZM,EAaX,EC9DO,MAAM63D,GACT,GAAAP,CAAIriH,EAAKzJ,EAAKvB,GACV,OAAOjF,QAAQE,OAAO,IAAIgC,MAAM,2BACpC,CACA,GAAA8M,CAAIiB,EAAKhL,GACL,OAAOjF,QAAQE,OAAO,IAAIgC,MAAM,2BACpC,CACA,GAAA2Q,CAAI5C,EAAKhL,GACL,OAAOjF,QAAQE,OAAO,IAAIgC,MAAM,2BACpC,CACA,OAAO+N,EAAKhL,GACR,OAAOjF,QAAQE,OAAO,IAAIgC,MAAM,8BACpC,CACA,aAAO4wH,CAAQpwH,EAAQuC,EAAU,CAAC,GAC9B,UAAW,MAAM,IAAEgL,EAAG,MAAEtM,KAAWjB,QACzBwB,KAAKouH,IAAIriH,EAAKtM,EAAOsB,SACrBgL,CAEd,CACA,aAAO8iH,CAAQrwH,EAAQuC,EAAU,CAAC,GAC9B,UAAW,MAAMgL,KAAOvN,OACd,CACFuN,MACAtM,YAAaO,KAAK8K,IAAIiB,EAAKhL,GAGvC,CACA,gBAAO+tH,CAAWtwH,EAAQuC,EAAU,CAAC,GACjC,UAAW,MAAMgL,KAAOvN,QACdwB,KAAKgjD,OAAOj3C,EAAKhL,SACjBgL,CAEd,CACA,KAAAgjH,GACI,IAAIC,EAAO,GACPC,EAAO,GACX,MAAO,CACH,GAAAb,CAAIriH,EAAKtM,GACLuvH,EAAK1xH,KAAK,CAAEyO,MAAKtM,SACrB,EACA,OAAOsM,GACHkjH,EAAK3xH,KAAKyO,EACd,EACAmjH,OAAQnkF,MAAOhqC,UACL,GAAMf,KAAK4uH,QAAQI,EAAMjuH,IAC/BiuH,EAAO,SACD,GAAMhvH,KAAK8uH,WAAWG,EAAMluH,IAClCkuH,EAAO,EAAE,EAGrB,CAKA,UAAOE,CAAKp4F,EAAGh2B,GACX,MAAM,IAAI/C,MAAM,2BACpB,CAKA,cAAOoxH,CAASr4F,EAAGh2B,GACf,MAAM,IAAI/C,MAAM,+BACpB,CACA,KAAAi1C,CAAMlc,EAAGh2B,GACL,IAAIsmH,EAAKrnH,KAAKmvH,KAAKp4F,EAAGh2B,GACtB,GAAgB,MAAZg2B,EAAEnxB,OAAgB,CAClB,MAAMA,EAASmxB,EAAEnxB,OACjByhH,EAAK,GAAOA,GAAK/hH,GAAMA,EAAEyG,IAAItN,WAAWwzB,WAAWrsB,IACvD,CAOA,GANIpK,MAAM+Y,QAAQwiB,EAAEg3F,WAChB1G,EAAKtwF,EAAEg3F,QAAQ3lF,QAAO,CAACi/E,EAAIvwG,IAAM,GAAOuwG,EAAIvwG,IAAIuwG,IAEhD7rH,MAAM+Y,QAAQwiB,EAAEi3F,UAChB3G,EAAKtwF,EAAEi3F,OAAO5lF,QAAO,CAACi/E,EAAIvwG,IAAM,GAAKuwG,EAAIvwG,IAAIuwG,IAEjC,MAAZtwF,EAAEp7B,OAAgB,CAClB,IAAIiB,EAAI,EACR,MAAMjB,EAASo7B,EAAEp7B,OACjB0rH,EAAK,GAAOA,GAAI,IAAMzqH,KAAOjB,GACjC,CAIA,OAHe,MAAXo7B,EAAE+/B,QACFuwD,EAAK,GAAKA,EAAItwF,EAAE+/B,QAEbuwD,CACX,CACA,SAAAgI,CAAUt4F,EAAGh2B,GACT,IAAIsmH,EAAKrnH,KAAKovH,SAASr4F,EAAGh2B,GAC1B,GAAgB,MAAZg2B,EAAEnxB,OAAgB,CAClB,MAAMA,EAASmxB,EAAEnxB,OACjByhH,EAAK,GAAOA,GAAKt7G,GAAQA,EAAItN,WAAWwzB,WAAWrsB,IACvD,CAOA,GANIpK,MAAM+Y,QAAQwiB,EAAEg3F,WAChB1G,EAAKtwF,EAAEg3F,QAAQ3lF,QAAO,CAACi/E,EAAIvwG,IAAM,GAAOuwG,EAAIvwG,IAAIuwG,IAEhD7rH,MAAM+Y,QAAQwiB,EAAEi3F,UAChB3G,EAAKtwF,EAAEi3F,OAAO5lF,QAAO,CAACi/E,EAAIvwG,IAAM,GAAKuwG,EAAIvwG,IAAIuwG,IAEjC,MAAZtwF,EAAEp7B,OAAgB,CAClB,MAAMA,EAASo7B,EAAEp7B,OACjB,IAAIiB,EAAI,EACRyqH,EAAK,GAAOA,GAAI,IAAMzqH,KAAOjB,GACjC,CAIA,OAHe,MAAXo7B,EAAE+/B,QACFuwD,EAAK,GAAKA,EAAItwF,EAAE+/B,QAEbuwD,CACX,mCC7GG,MAAMiI,WAAwBX,GACjCvwF,KACA,WAAAtxB,GACIihC,QACA/tC,KAAKo+B,KAAO,IAAIqN,GACpB,CACA,GAAA2iF,CAAIriH,EAAKzJ,GAEL,OADAtC,KAAKo+B,KAAKrzB,IAAIgB,EAAItN,WAAY6D,GACvByJ,CACX,CACA,GAAAjB,CAAIiB,GACA,MAAMoC,EAASnO,KAAKo+B,KAAKtzB,IAAIiB,EAAItN,YACjC,GAAc,MAAV0P,EACA,MCERlS,EAAMA,GAAO,IAAI+B,MAAM,aAChB,GAAQ/B,EAAK,iBAFjB,IAAuBA,EDCtB,OAAOkS,CACX,CACA,GAAAQ,CAAI5C,GACA,OAAO/L,KAAKo+B,KAAKzvB,IAAI5C,EAAItN,WAC7B,CACA,OAAOsN,GACH/L,KAAKo+B,KAAK4kB,OAAOj3C,EAAItN,WACzB,CACA,KAAC0wH,GACG,IAAK,MAAOpjH,EAAKtM,KAAUO,KAAKo+B,KAAKygC,eAC3B,CAAE9yD,IAAK,IAAIi/G,GAAIj/G,GAAMtM,QAEnC,CACA,SAAC2vH,GACG,IAAK,MAAMrjH,KAAO/L,KAAKo+B,KAAKr/B,aAClB,IAAIisH,GAAIj/G,EAEtB,EEhCJ,MAAMwjH,GAAwBC,GAAUA,EAIxC,SAASC,GAAY7e,EAAI9sD,GACrB,MAAM4rE,EAAoB9e,EAAGn1C,YAS7B,OAPyB,MAArBi0D,GACuBnyB,GAAiBmyB,GAErBxjF,OAAO4X,KACtB8sD,EAAKA,EAAGt1C,YAAY,GAAU,QAAQxX,EAAOrlD,gBAG9CmyG,CACX,CACO,MAAM+e,GACT/wH,IACAqlD,WAEA11C,OACAqhH,SACAC,SACAC,eAOA,WAAAhjH,CAAYm3C,EAAYj5C,EAAO,CAAC,GAC5B,MAAM,OAAEuD,EAAS,GAAE,SAAEqhH,EAAW,IAAO5kH,EACvChL,KAAKikD,WAAaA,EAClBjkD,KAAKpB,IAAMqlD,EAAWxJ,OAAO2zD,aAAa,0BAC1CpuG,KAAKuO,OAASA,EAAO7C,KAAIklG,GAAMA,EAAGnyG,aAClCuB,KAAK4vH,SAAW,IAAIr3E,IAAIq3E,EAASlkH,KAAIklG,GAAMA,EAAGnyG,cAC9CuB,KAAK6vH,SAAW,IAAIpkF,IACpBzrC,KAAK8vH,eAAiB9kH,EAAK8kH,gBAAkBP,GAG7CvvH,KAAK+vH,0BC3CN,SAAkB3c,EAAMvjE,GAC3B,IAAIkc,EACJ,OAAO,WAKHpB,aAAaoB,GACbA,EAAUt2B,YALI,WACVs2B,OAAUhuD,EACVq1G,GACJ,GDqCqF,IClCzF,CACJ,CDiCyC4c,CAAShwH,KAAK+vH,0BAA0BjsH,KAAK9D,OAE9EikD,EAAWx0C,OAAO0xC,iBAAiB,uBAAuB,KACtDnhD,KAAK+vH,2BAA2B,IAGpC9rE,EAAWx0C,OAAO0xC,iBAAiB,mBAAmB,KAClDnhD,KAAK+vH,2BAA2B,GAExC,CACA,CAAC/hH,OAAO80B,aAAe,0BACvB,yBAAAitF,GAGI,MAAMP,EAAQxvH,KAAKiwH,mBACdtgH,OAAO3P,KAAKikD,WAAWisE,iBAAiBC,YACxCxgH,OAAO,IAAI3P,KAAK6vH,SAAShxD,WACzBniD,QAAO,EAAEnQ,EAAGo5C,KAAcA,EAASyqE,YACnC1kH,KAAI,EAAEgH,KAAS,GAAUA,MAAOhH,KAAIklG,GAEjCA,EAAGn1C,cAAgBz7D,KAAKikD,WAAWH,OAAOrlD,WACnCmyG,EAAGt1C,YAAY,QAAQt7D,KAAKikD,WAAWH,OAAOrlD,cAElDmyG,IAEX5wG,KAAKikD,WAAWK,UAAUyzD,MAAM/3G,KAAKikD,WAAWH,OAAQ,CACpDqtD,WAAYqe,IAEX3hH,OAAM5R,IAAS+D,KAAKpB,IAAI8I,MAAM,2BAA4BzL,EAAI,GACvE,CAIA,cAAAo0H,GACI,OAAO70H,MAAMq/B,KAAK76B,KAAKuO,QAAQ7C,KAAK2uB,GAAM,GAAUA,IACxD,CAIA,gBAAA41F,GACI,OAAOz0H,MAAMq/B,KAAK76B,KAAK4vH,UAAUlkH,KAAK2uB,GAAM,GAAUA,IAC1D,CAIA,gBAAAk9E,GACI,OAAO/7G,MAAMq/B,KAAK76B,KAAK6vH,UAAUnkH,KAAI,EAAE2uB,KAAO,GAAUA,IAC5D,CAIA,eAAAm9E,CAAgB3+C,GAEZ,MAAM0C,GADN1C,EAAO42D,GAAY52D,EAAM74D,KAAKikD,WAAWH,SACjBrlD,WAEpBuB,KAAK6vH,SAASlhH,IAAI4sD,IAGtBv7D,KAAK6vH,SAAS9kH,IAAIwwD,EAAY,CAC1B60D,WAAW,GAEnB,CACA,mBAAAE,CAAoBz3D,GAEhB,MAAM0C,GADN1C,EAAO42D,GAAY52D,EAAM74D,KAAKikD,WAAWH,SACjBrlD,WAIlB8xH,GAHWvwH,KAAK6vH,SAAS/kH,IAAIywD,IAAe,CAC9C60D,WAAW,IAEqBA,UACpCpwH,KAAK6vH,SAAS9kH,IAAIwwD,EAAY,CAC1B60D,WAAW,IAGVG,GACDvwH,KAAK+vH,2BAEb,CACA,kBAAAS,CAAmB33D,GAEf,MAAM0C,GADN1C,EAAO42D,GAAY52D,EAAM74D,KAAKikD,WAAWH,SACjBrlD,WACxBuB,KAAK6vH,SAAS7sE,OAAOuY,EACzB,CACA,YAAA08C,GACI,IAAIuX,EAAQxvH,KAAKiwH,mBAAmBvkH,KAAIklG,GAAMA,EAAGnyG,aAC5B,IAAjB+wH,EAAM9zH,SAEN8zH,EAAQxvH,KAAKikD,WAAWisE,iBAAiBC,WAAWzkH,KAAIklG,GAAMA,EAAGnyG,cAGrE+wH,EAAQA,EAAM7/G,OAAOnU,MAAMq/B,KAAK76B,KAAK6vH,UAChCnzG,QAAO,EAAEk0F,EAAIjrD,KAAcA,EAASyqE,YACpC1kH,KAAI,EAAEklG,KAAQA,KAEnB,MAAM6f,EAAU,IAAIl4E,IAAIi3E,GAExB,OAAOxvH,KAAK8vH,eAAet0H,MAAMq/B,KAAK41F,GACjC/kH,KAAIgH,GAAO,GAAUA,MACrBhH,KAAIklG,IAE2B,IAA5BA,EAAG11C,SAASU,OAAOr2D,MAGnBqrG,EAAGn1C,cAAgBz7D,KAAKikD,WAAWH,OAAOrlD,WAFnCmyG,EAKJA,EAAGv1C,YAAY,QAAQr7D,KAAKikD,WAAWH,OAAOrlD,eAE7D,EEnJJ,MAAMiyH,GACFzsE,WAAa,CAAC,EACd0sE,UAAW,EACX,WAAA7jH,CAAY9B,EAAO,CAAC,GAChBhL,KAAKikD,WAAa,CAAC,EACnB,IAAK,MAAOl4C,EAAKtM,KAAUX,OAAO+/D,QAAQ7zD,GACtChL,KAAKikD,WAAWl4C,GAAOtM,EAEG,MAA1BO,KAAKikD,WAAWxJ,SAChBz6C,KAAKikD,WAAWxJ,OAASorE,KAEjC,CACA,SAAAj5D,GACI,OAAO5sD,KAAK2wH,QAChB,CACA,4BAAMC,CAAuBz6G,SACnBra,QAAQ2lD,IAAI3iD,OAAO2jB,OAAOziB,KAAKikD,YAChCvnC,QAAOvQ,GCpBb,SAAqBA,GACxB,OAAc,MAAPA,GAAoC,mBAAdA,EAAIpP,OAA4C,mBAAboP,EAAIsB,IACxE,CDkB2BojH,CAAY1kH,KAC1BT,KAAIq/B,MAAO+lF,UACNA,EAAU36G,OAAe,IAEvC,CACA,iBAAM46G,SACI/wH,KAAK4wH,uBAAuB,cACtC,CACA,WAAM7zH,SACIiD,KAAK4wH,uBAAuB,SAClC5wH,KAAK2wH,UAAW,CACpB,CACA,gBAAMK,SACIhxH,KAAK4wH,uBAAuB,aACtC,CACA,gBAAMK,SACIjxH,KAAK4wH,uBAAuB,aACtC,CACA,UAAMnjH,SACIzN,KAAK4wH,uBAAuB,QAClC5wH,KAAK2wH,UAAW,CACpB,CACA,eAAMO,SACIlxH,KAAK4wH,uBAAuB,YACtC,EAEJ,MAAMO,GAAoB,CACtB,UACA,sBACA,OAEEC,GAAyB,CAC3B,aACA,YACA,cACA,QACA,aACA,aACA,OACA,YACA,OACA,0BA2CJ,SAASC,GAAuBngG,GAC5B,OAAI11B,MAAM+Y,QAAQ2c,IAAU6rE,KACjB7rE,EAAQ6rE,IAEZ,EACX,CACA,SAASu0B,GAAuBpgG,GAC5B,OAAI11B,MAAM+Y,QAAQ2c,IAAU8rE,KACjB9rE,EAAQ8rE,IAEZ,EACX,CACA,SAASu0B,GAAergG,GACpB,OAAOA,IAAUljB,OAAO80B,cAAgB5R,GAASzyB,YAAc,SACnE,kCEpHA,MA0BM+yH,GA1BoB,CACtB,YACA,aACA,gBACA,cACA,iBACA,gBACA,eACA,eACA,eACA,eACA,gBACA,iBACA,iBACA,eACA,kBACA,kBACA,iBACA,iBACA,kBACA,gBACA,kBACA,iBACA,cACA,sBAEqC9lH,KAAI+lH,GAAW,IAAI,GAAAryG,QAAQqyG,KACpE,SAASC,GAAUC,GACf,IAAK,MAAM/pH,KAAK4pH,GACZ,GAAI5pH,EAAE8Y,SAASixG,GACX,OAAO,EAEf,OAAO,CACX,CAyCO,SAASC,GAAYhyG,GACxB,OAAIq3C,GAAOr3C,GACA8xG,GAAU9xG,GAzCd,iDAAiD3hB,KA0C9B2hB,GArC9B,SAA6B+xG,GACzB,MAAMz0H,EAAQy0H,EAAOjsH,MAAM,KAC3B,GAAIxI,EAAMxB,OAAS,EACf,OAAO,EAEX,MAAMm2H,EAAU30H,EAAMA,EAAMxB,OAAS,GAAGyuE,SAAS,EAAG,KAC9C2nD,EAAU50H,EAAMA,EAAMxB,OAAS,GAAGyuE,SAAS,EAAG,KAEpD,OAAOunD,GADK,GAAG5oH,SAASgpH,EAAQzmH,UAAU,EAAG,GAAI,OAAOvC,SAASgpH,EAAQzmH,UAAU,GAAI,OAAOvC,SAAS+oH,EAAQxmH,UAAU,EAAG,GAAI,OAAOvC,SAAS+oH,EAAQxmH,UAAU,GAAI,MAE1K,CA6Be0mH,CAAoBnyG,GAxBxB,kEAAkE3hB,KAyB7C2hB,GAvBhC,SAA+B+xG,GAC3B,MAAMz0H,EAAQy0H,EAAOjsH,MAAM,KAE3B,OAAOgsH,GADKx0H,EAAMA,EAAMxB,OAAS,GAErC,CAoBes2H,CAAsBpyG,GACxBu3C,GAAOv3C,GApBpB,SAAmB+xG,GACf,MAAO,OAAO1zH,KAAK0zH,IACf,QAAQ1zH,KAAK0zH,IACb,oEAAoE1zH,KAAK0zH,IACzE,wFAAwF1zH,KAAK0zH,IAC7F,iIAAiI1zH,KAAK0zH,IACtI,6IAA6I1zH,KAAK0zH,IAClJ,oIAAoI1zH,KAAK0zH,IACzI,oJAAoJ1zH,KAAK0zH,IACzJ,8BAA8B1zH,KAAK0zH,IACnC,8BAA8B1zH,KAAK0zH,IACnC,0BAA0B1zH,KAAK0zH,EACvC,CASeM,CAAUryG,QAEjB,CACR,CCjFO,SAASsyG,GAAgBC,EAAQ,CAAC,GACrC,MAAO,CACHC,aAAcrnF,UAAY,EAC1BsnF,kBAAmBtnF,MAAO4mE,IACtB,MAAMj4C,EAASi4C,EAAUh4C,eACzB,OAAqB,IAAjBD,EAAO,GAAG,IAA6B,KAAjBA,EAAO,GAAG,KACzBvyC,QAAQyqG,GAAY,GAAGl4D,EAAO,GAAG,MAEhC,EAEhB44D,sBAAuBvnF,UAAY,EACnCwnF,uBAAwBxnF,UAAY,EACpCynF,+BAAgCznF,UAAY,EAC5C0nF,gCAAiC1nF,UAAY,EAC7C2nF,8BAA+B3nF,UAAY,EAC3C4nF,+BAAgC5nF,UAAY,EAC5C6nF,uBAAwB7nF,UAAY,KACjConF,EAEX,CCrBO,SAASU,GAAUjiB,GACtB,IACI,MAAM,QAAE34C,GAAY24C,EAAG30C,cACvB,OAAO90C,QAAQyqG,GAAY35D,GAC/B,CACA,MACI,OAAO,CACX,CACJ,CCsDO,SAAS66D,GAAmBz4F,EAAGh9B,GAClC,MAAM01H,EAxCH,SAA8B14F,EAAGh9B,GACpC,MAAM21H,EAAaH,GAAUx4F,EAAEs3E,WACzBshB,EAAaJ,GAAUx1H,EAAEs0G,WAC/B,OAAIqhB,IAAeC,EACR,GAEDD,GAAcC,GACZ,EAEL,CACX,CA8ByBC,CAAqB74F,EAAGh9B,GAC7C,GAAqB,IAAjB01H,EACA,OAAOA,EAEX,MAAMI,EAhBH,SAAmC94F,EAAGh9B,GACzC,MAAM+1H,EAAa,GAAQvf,WAAWx5E,EAAEs3E,WAClC0hB,EAAa,GAAQxf,WAAWx2G,EAAEs0G,WACxC,OAAIyhB,IAAeC,EACR,GAEDD,GAAcC,GACZ,EAEL,CACX,CAMwBC,CAA0Bj5F,EAAGh9B,GACjD,GAAoB,IAAhB81H,EACA,OAAOA,EAEX,MAAMI,EAjCH,SAAiCl5F,EAAGh9B,GACvC,OAAIg9B,EAAEo9E,cAAgBp6G,EAAEo6G,aACZ,GAEFp9E,EAAEo9E,aAAep6G,EAAEo6G,YAClB,EAEJ,CACX,CAyB4B+b,CAAwBn5F,EAAGh9B,GACnD,OAAOk2H,CACX,CC5EO,SAASE,GAAS7tG,GACrB,MAAM8tG,EAAgB,CAClBC,GAAWn9E,GAEf,OAAa,MAAT5wB,EACO8tG,EAEPl4H,MAAM+Y,QAAQqR,GACO,IAAjBA,EAAMlqB,OACCg4H,EAEJ9tG,EAEJ,CACHA,EAER,CCZO,MAAMguG,GAAc,GACpB,SAASC,GAAc1nH,GAC1B,MAAO,CACH2nH,OAAQ3nH,EAAI2nH,QAAU,EACtBC,GAAI5nH,EAAI4nH,IAAM5nH,EAAI6nH,UAAW,EAC7BC,GAAI9nH,EAAI8nH,IAAM9nH,EAAI+nH,UAAW,EAC7BC,GAAIhoH,EAAIgoH,IAAMhoH,EAAIioH,UAAW,EAC7BC,GAAIloH,EAAIkoH,IAAMloH,EAAImoH,UAAW,EAC7BC,GAAIpoH,EAAIooH,IAAMpoH,EAAIqoH,UAAW,EAC7BC,UAAWtoH,EAAIsoH,UAAYtoH,EAAIuoH,WAAa,IAAIhpH,KAAKipH,IAC1C,CACH9oH,KAAM8oH,EAAS9oH,KACf3D,KAAMyrH,GAAWgB,EAASzsH,UAGlC0sH,QAASzoH,EAAIyoH,QAAUzoH,EAAI0oH,SAAW,IAAInpH,KAAKopH,IACpC,CACHjpH,KAAMipH,EAAOjpH,KACb3D,KAAMyrH,GAAWmB,EAAO5sH,MACxB6sH,IAAMD,EAAOC,KAAOD,EAAOxjB,KAAOsiB,GAClCx1F,KAAM02F,EAAO12F,gBAAgBz8B,WAAa,GAAmBmzH,EAAO12F,MAAQ02F,EAAO12F,SAInG,CCFO,SAAS42F,GAAiBn3B,EAAK7yF,EAAO,CAAC,GAC1C,MAAMiqH,EAAY,IAAIzN,GAAO,CACzBG,YAAa38G,EAAKkqH,kBAlBe,IAoBrC,OAAOnqF,MAAOoqF,EAAMp0H,EAAU,CAAC,KAC3B,MAAMq0H,EAAe,IAAIC,gBACzBD,EAAarqH,IAAI,OAAQoqH,GACzB1B,GAAS1yH,EAAQ6kB,OAAO9Z,SAAQ5D,IAE5BktH,EAAar5E,OAAO,OAAQ43E,GAAWzrH,GAAM,IAEjDnH,EAAQokH,aAAa,IAAIhB,GAAoB,YAAa,CAAExgE,OAAQwxE,KAEpE,MAAM1zH,QAAiBwzH,EAAU7tG,KAAI2jB,UACjC,MAAMhM,QAAYr+B,MAAM,GAAGm9F,KAAOu3B,IAAgB,CAC9CE,QAAS,CACLC,OAAQ,wBAEZv0E,OAAQjgD,GAASigD,SAErB,GAAmB,MAAfjiB,EAAIv9B,OACJ,MAAM,IAAIxD,MAAM,2BAA2B+gC,EAAIv9B,YAAYu9B,EAAIy2F,cAEnE,MAAM/zH,EAAWoyH,SAAoB90F,EAAIhe,QAEzC,OADAhgB,EAAQokH,aAAa,IAAIhB,GAAoB,eAAgB,CAAExgE,OAAQliD,KAChEA,CAAQ,GAChB,CACCu/C,OAAQjgD,EAAQigD,SAEpB,GAAgB,MAAZv/C,EACA,MAAM,IAAIzD,MAAM,4BAEpB,OAAOyD,CAAQ,CAEvB,KC0BWkyH,+BC/EX,MAAM8B,GACFC,IACA,WAAA5oH,CAAY6oH,GACR31H,KAAK01H,IAAME,GAAQD,EACvB,CACA,GAAA7qH,CAAIqqH,EAAMvvG,GACN,IAAIiwG,GAAkB,EACtB,MAAMhB,EAAU,GAChB,IAAK,MAAM3sH,KAAQ0d,EAAO,CACtB,MAAMqnG,EAASjtH,KAAK81H,WAAWX,EAAMjtH,GACrC,GAAsB,IAAlB+kH,EAAOvxH,OAAc,CACrBm6H,GAAkB,EAClB,KACJ,CACAhB,EAAQv3H,QAAQ2vH,EACpB,CACA,GAAI4I,EACA,OAAOhC,GAAc,CAAEgB,WAE/B,CACA,UAAAiB,CAAWthD,EAAQtsE,GACf,MAAM6D,EAAM,GAAGyoE,EAAOlsE,iBAAiBJ,IACjC2sH,EAAU70H,KAAK01H,IAAI5qH,IAAIiB,GAC7B,GAAe,MAAX8oH,EAAiB,CACjB,MAAMkB,EAAgBlB,EACjBn4G,QAAQ4+B,GACFA,EAAM06E,QAAU9rH,KAAKoqC,QAE3B5oC,KAAI,EAAGsqH,UAASv2H,YAAY,IAC1BA,EACHs1H,IAAKv4H,KAAK4G,OAAO4yH,EAAU9rH,KAAKoqC,OAAS,KACzCpsC,KAAMyrH,GAAWl0H,EAAMyI,UAO3B,OAL6B,IAAzB6tH,EAAcr6H,QACdsE,KAAK01H,IAAIhoH,OAAO3B,GAIbgqH,CACX,CACA,MAAO,EACX,CACA,GAAA3uG,CAAIotD,EAAQsgD,GACR,MAAM/oH,EAAM,GAAGyoE,EAAOlsE,iBAAiBwsH,EAAO5sH,OACxC2sH,EAAU70H,KAAK01H,IAAI5qH,IAAIiB,IAAQ,GACrC8oH,EAAQv3H,KAAK,CACT04H,QAAS9rH,KAAKoqC,MAAuC,KAA7BwgF,EAAOC,KAAOnB,IACtCn0H,MAAOq1H,IAEX90H,KAAK01H,IAAI3qH,IAAIgB,EAAK8oH,EACtB,CACA,MAAAnnH,CAAO8mE,EAAQtsE,GACX,MAAM6D,EAAM,GAAGyoE,EAAOlsE,iBAAiBJ,IACvClI,KAAK01H,IAAIhoH,OAAO3B,EACpB,CACA,KAAA6E,GACI5Q,KAAK01H,IAAI9kH,OACb,EC5DG,MAAM,GACTorD,UACAvrD,MACA,WAAA3D,CAAY9B,GD8DT,IAAe9E,EC7DdlG,KAAKg8D,UAAY,CAAC,EAClBh8D,KAAKyQ,OD4DSvK,EC5DK8E,EAAKirH,WANE,IDmEvB,IAAIR,GAAcvvH,IC5DrBpH,OAAO+/D,QAAQ7zD,EAAKgxD,WAAa,CAAC,GAAGlwD,SAAQ,EAAEoqH,EAAKn6D,MAC3CvgE,MAAM+Y,QAAQwnD,KACfA,EAAW,CAACA,IAGXm6D,EAAIlkG,SAAS,OACdkkG,EAAM,GAAGA,MAEbl2H,KAAKg8D,UAAUk6D,GAAOn6D,CAAQ,IAGP,MAAvB/7D,KAAKg8D,UAAU,OACfh8D,KAAKg8D,UAAU,KCrBhB,CACHg5D,GAAiB,wCACjBA,GAAiB,+BDqBrB,CASA,WAAM/hF,CAAMuhC,EAAQzzE,EAAU,CAAC,GAC3B,MAAM6kB,EAAQ6tG,GAAS1yH,EAAQ6kB,OACzBqnG,GAA4B,IAAnBlsH,EAAQksH,OAAmBjtH,KAAKyQ,MAAM3F,IAAI0pE,EAAQ5uD,QAAS7nB,EAC1E,GAAc,MAAVkvH,EAEA,OADAlsH,EAAQokH,aAAa,IAAIhB,GAAoB,YAAa,CAAExgE,OAAQspE,KAC7DA,EAEX,MAAMiJ,EAAM,GAAG1hD,EAAO9uE,MAAM,KAAKk2D,SAC3BI,GAAah8D,KAAKg8D,UAAUk6D,IAAQl2H,KAAKg8D,UAAU,MAAMn3C,MAAK,IACxDroB,KAAK4oD,SAAW,IAAQ,EAAI,IAElCyM,EAAS,GACf,IAAK,MAAMkK,KAAYC,EAAW,CAE9B,IAAgC,IAA5Bj7D,EAAQigD,QAAQ8J,QAChB,MAEJ,IACI,MAAM38C,QAAe4tD,EAASyY,EAAQ,IAC/BzzE,EACH6kB,UAEJ,IAAK,MAAMkvG,KAAU3mH,EAAOymH,OACxB50H,KAAKyQ,MAAM2W,IAAIotD,EAAQsgD,GAE3B,OAAO3mH,CACX,CACA,MAAOlS,GACH41D,EAAOv0D,KAAKrB,GACZ8E,EAAQokH,aAAa,IAAIhB,GAAoB,YAAa,CAAExgE,OAAQ1nD,IACxE,CACJ,CACA,GAAsB,IAAlB41D,EAAOn2D,OACP,MAAMm2D,EAAO,GAEjB,MAAM,IAAID,eAAeC,EAAQ,iBAAiB2iB,KAAU5uD,WAChE,GFkBJ,SAAW+tG,GACPA,EAAWA,EAAc,EAAI,GAAK,IAClCA,EAAWA,EAAkB,MAAI,GAAK,QACtCA,EAAWA,EAAgB,IAAI,IAAM,MACrCA,EAAWA,EAAiB,KAAI,IAAM,MACzC,CALD,CAKGA,KAAeA,GAAa,CAAC,IIzFhC,MACQtnH,KAAM8pH,IAAgB,GAAY,WAC7BC,GAAkBrrF,eAA+B6lE,EAAI7vG,EAAU,CAAC,GACzE,MAAMs1H,EAAiBt1H,EAAQu1H,mBAHP,GAIxB,GAAuB,IAAnBD,EACA,MAAM,IAAI,GAAU,8BAA+B,mCAEvD,MAAO,CAAEvS,GAAYlT,EAAGj3C,eAAepsC,MAAK,EAAEqtB,KAAWA,IAAUu7E,MAAgB,GAC7Ep6D,EAAWh7D,GAAS4gH,KJsFvB,SAAa32G,EAAO,CAAC,GACxB,OAAO,IAAI,GAASA,EACxB,CIxFqC22G,GAC3BxzG,QAAe4tD,EAAS9oB,MAAM,YAAY6wE,IAAY,CACxD9iE,OAAQjgD,GAASigD,OACjBp7B,MAAO,CACH+tG,GAAW4C,OAGbzyE,EAAS8sD,EAAGn1C,YACZjmB,EAAS,GACf,IAAK,MAAMs/E,KAAU3mH,EAAOymH,OAAQ,CAChC,MAAM/7D,EAAOi8D,EAAO12F,KACf9+B,QAAQ,QAAS,IACjB64B,OACAzyB,MAAM,KAAK,GAChB,GAAY,MAARmzD,EACA,SAEJ,GAAc,MAAV/U,IAAmB+U,EAAKl8C,SAASmnC,GACjC,SAEJ,MAAM8sD,EAAK,GAAU/3C,GACrB,GAAIA,EAAK5mC,WAAW,YAAa,CAC7B,MAAM7J,QAAiBwoF,EAAG70G,QAAQ,IAC3BgF,EACHu1H,kBAAmBD,EAAiB,IAExC7gF,EAAOl4C,QAAQ8qB,EAAS1c,KAAIklG,GAAMA,EAAGnyG,aACzC,MAEI+2C,EAAOl4C,KAAKszG,EAAGnyG,WAEvB,CACA,OAAO+2C,CACX,ECtCA,6BCPO,IAAItE,GAMA,IALX,SAAWA,GACPA,EAA0B,gBAAI,qCAC9BA,EAAiC,uBAAI,6DACrCA,EAAoB,UAAI,WAC3B,CAJD,CAIGA,KAAaA,GAAW,CAAC,IAE5B,SAAWtJ,GACPA,EAA8B,uBAAI,yBAClCA,EAAiC,0BAAI,4BACrCA,EAAkC,2BAAI,6BACtCA,EAAwC,iCAAI,mCAC5CA,EAA4B,qBAAI,uBAChCA,EAA6B,sBAAI,wBACjCA,EAA4B,qBAAI,uBAChCA,EAA2B,oBAAI,sBAC/BA,EAA8B,uBAAI,yBAClCA,EAA8B,uBAAI,yBAClCA,EAAwB,iBAAI,mBAC5BA,EAAuB,gBAAI,kBAC3BA,EAA2B,oBAAI,sBAC/BA,EAA+B,wBAAI,0BACnCA,EAA6B,sBAAI,wBACjCA,EAA8B,uBAAI,yBAClCA,EAAuB,gBAAI,kBAC3BA,EAA2B,oBAAI,sBAC/BA,EAA8B,uBAAI,yBAClCA,EAAwB,iBAAI,mBAC5BA,EAA6B,sBAAI,wBACjCA,EAAqB,cAAI,gBACzBA,EAAiC,0BAAI,4BACrCA,EAAiC,0BAAI,4BACrCA,EAAgC,yBAAI,2BACpCA,EAA+C,wCAAI,0CACnDA,EAA6B,sBAAI,wBACjCA,EAA+B,wBAAI,0BACnCA,EAAqB,cAAI,gBACzBA,EAAgC,yBAAI,2BACpCA,EAAsC,+BAAI,iCAC1CA,EAA0B,mBAAI,qBAC9BA,EAAuB,gBAAI,kBAC3BA,EAAwB,iBAAI,mBAC5BA,EAAkB,WAAI,aACtBA,EAA4B,qBAAI,uBAChCA,EAA4B,qBAAI,uBAChCA,EAA8B,uBAAI,yBAClCA,EAA4B,qBAAI,uBAChCA,EAAyB,kBAAI,oBAC7BA,EAAgC,yBAAI,2BACpCA,EAAgC,yBAAI,2BACpCA,EAA6B,sBAAI,wBACjCA,EAAwB,iBAAI,mBAC5BA,EAA2B,oBAAI,sBAC/BA,EAA+B,wBAAI,0BACnCA,EAA8B,uBAAI,yBAClCA,EAAiC,0BAAI,4BACrCA,EAAiC,0BAAI,4BACrCA,EAA+B,wBAAI,0BACnCA,EAA2B,oBAAI,sBAC/BA,EAA0B,mBAAI,qBAC9BA,EAA0B,mBAAI,qBAC9BA,EAA6B,sBAAI,wBACjCA,EAAmC,4BAAI,8BACvCA,EAA8C,uCAAI,yCAClDA,EAA6C,sCAAI,wCACjDA,EAA6B,sBAAI,wBACjCA,EAAmC,4BAAI,6BAC1C,CA5DD,CA4DG,KAAU,GAAQ,CAAC,IC7DtB,MAAM4uF,GAAgB,CAClB3kB,UAAW,CACPtjG,OAAQ,GACRqhH,SAAU,GACV6G,WAAY,GACZ3G,eAAiB3e,GAAeA,GAEpC9sD,kBAAmB,CACf2X,UAAW,CACPylD,QAAS2U,IAEbM,cAAe5D,IAEnB5C,iBAAkB,CACdyG,eAAgB/V,GAAegW,YCbhC,SAASC,GAAej0E,GAC3B,GAAIkS,GAASlS,GACT,MAAO,CAAEkB,OAAQlB,EAAMuuD,WAAY,IAKvC,IAAIrtD,EACJ,GAJKtoD,MAAM+Y,QAAQquC,KACfA,EAAO,CAACA,IAGRA,EAAKlnD,OAAS,EAAG,CACjB,MAAMmnD,EAAYD,EAAK,GAAG6Y,YAC1B3X,EAAsB,MAAbjB,OAAoB9kD,EAAYw/F,GAAiB16C,GAE1DD,EAAK92C,SAAQ8kG,IACT,IAAKt2C,GAAYs2C,GACb,MAAM,IAAI,GAAU,oBAAqB,GAAMkmB,uBAEnD,MAAMC,EAAcnmB,EAAGn1C,YACvB,GAAmB,MAAfs7D,GACA,GAAc,MAAVjzE,EACA,MAAM,IAAI,GAAU,+DAAgE,GAAMsmE,4BAG7F,CACD,MAAM4M,EAAWz5B,GAAiBw5B,GAClC,IAAiC,IAA7BjzE,GAAQ5X,OAAO8qF,GACf,MAAM,IAAI,GAAU,+DAAgE,GAAM5M,uBAElG,IAER,CACA,MAAO,CACHtmE,SACAqtD,WAAYvuD,EAEpB,CCwEO,MAAM,WAAmB5kD,MAC5BkK,KACAmE,KACA,WAAAS,CAAYrD,EAAS4C,GACjB0hC,MAAMtkC,GAAW,6BACjBzJ,KAAKkI,KAAO,UACZlI,KAAK6L,KAAO,aACZ7L,KAAKqM,KAAOA,GAAQ,WACxB,EAKG0+B,eAAeksF,GAAU/nH,EAASgoH,EAAWl2E,EAAQ3b,GAExD,MAAM39B,EAAQ,IAAI,GAAW29B,GAAMykB,aAAczkB,GAAM84D,WACvD,OAAwB,IAApBn9C,GAAQ8J,QACDhvD,QAAQE,OAAO0L,GAEnB,IAAI5L,SAAQ,CAACC,EAASC,KACzB,SAASm7H,IACLn2E,GAAQK,oBAAoB,QAASq8D,GACrCxuG,EAAQmyC,oBAAoB61E,EAAWE,GACf,MAApB/xF,GAAMgyF,YACNnoH,EAAQmyC,oBAAoBhc,EAAKgyF,WAAYC,EAErD,CACA,MAAMF,EAAiBh3H,IACnB,IACI,IAA4B,IAAxBilC,GAAM3oB,SAAStc,GACf,MAER,CACA,MAAOnE,GAGH,OAFAk7H,SACAn7H,EAAOC,EAEX,CACAk7H,IACAp7H,EAAQqE,EAAI,EAEVk3H,EAAsBl3H,IACxB+2H,IACAn7H,EAAOoE,EAAIujD,OAAO,EAEhB+5D,EAAgB,KAClByZ,IACAn7H,EAAO0L,EAAM,EAEjBs5C,GAAQG,iBAAiB,QAASu8D,GAClCxuG,EAAQiyC,iBAAiB+1E,EAAWE,GACZ,MAApB/xF,GAAMgyF,YACNnoH,EAAQiyC,iBAAiB9b,EAAKgyF,WAAYC,EAC9C,GAER,CCtKO,MAAMC,GACT5iG,SACAqsB,OACA,WAAAl0C,CAAYk0C,GACRhhD,KAAKghD,OAASA,EACdhhD,KAAK20B,SAAW4qB,KAChBv/C,KAAKo9G,QAAUp9G,KAAKo9G,QAAQt5G,KAAK9D,MACjCA,KAAKghD,QAAQG,iBAAiB,QAASnhD,KAAKo9G,QAChD,CACA,OAAAA,GACIp9G,KAAK20B,SAAS34B,OAAOgE,KAAKghD,QAAQsJ,QAAU,IAAI,GACpD,CACA,OAAAg4D,GACItiH,KAAKghD,QAAQK,oBAAoB,QAASrhD,KAAKo9G,QACnD,ECPG,MAAMoa,GACTl2G,GACAjmB,GACA0F,QACA02H,WACAj2H,OACA8hD,SACAo0E,WACA,WAAA5qH,CAAYzR,EAAI0F,GACZf,KAAKshB,GAXF,GAAIxY,SAASvL,OAAuB,IAAhBf,KAAK4oD,UAAiB,IAAK3mD,aAAayL,KAAKoqC,QAYpEt0C,KAAKwB,OAAS,SACdxB,KAAK3E,GAAKA,EACV2E,KAAKe,QAAUA,EACff,KAAKy3H,WAAa,GAClBz3H,KAAKsjD,SAAW,CACZq0E,QAASztH,KAAKoqC,OAElBt0C,KAAK03H,WAAa,IAAIna,gBACIv9G,KAAK03H,WAAW12E,OAC1ChhD,KAAKo9G,QAAUp9G,KAAKo9G,QAAQt5G,KAAK9D,KACrC,CACA,KAAAkkE,CAAMjoE,GACF+D,KAAK03H,WAAWxzD,MAAMjoE,EAC1B,CACA,OAAAmhH,GACuBp9G,KAAKy3H,WAAWrvF,QAAO,CAAC8P,EAAKjuC,IACrCiuC,IAAiC,IAAzBjuC,EAAK+2C,QAAQ8J,UAC7B,KAGC9qD,KAAK03H,WAAWxzD,MAAM,IAAI,IAC1BlkE,KAAKsiH,UAEb,CACA,UAAM5kH,CAAKqD,EAAU,CAAC,GAClB,MAAM62H,EAAY,IAAIL,GAAax2H,EAAQigD,QAG3C,OAFAhhD,KAAKy3H,WAAWn6H,KAAKs6H,GACrB72H,EAAQigD,QAAQG,iBAAiB,QAASnhD,KAAKo9G,SACxCwa,EAAUjjG,SAAS6qB,OAC9B,CACA,SAAMwnE,GACFhnH,KAAKwB,OAAS,UACdxB,KAAKsjD,SAAS8yD,QAAUlsG,KAAKoqC,MAC7B,IACIt0C,KAAK03H,WAAW12E,OAAOC,iBACvB,MAAM9yC,QAAe+vF,GAAWl+F,KAAK3E,GAAG,IAChC2E,KAAKe,SAAW,CAAC,EACrBigD,OAAQhhD,KAAK03H,WAAW12E,SACxBhhD,KAAK03H,WAAW12E,QACpBhhD,KAAKy3H,WAAW3rH,SAAQ8rH,IACpBA,EAAUjjG,SAAS54B,QAAQoS,EAAO,IAEtCnO,KAAKwB,OAAS,UAClB,CACA,MAAOvF,GACH+D,KAAKy3H,WAAW3rH,SAAQ8rH,IACpBA,EAAUjjG,SAAS34B,OAAOC,EAAI,IAElC+D,KAAKwB,OAAS,SAClB,CACA,QACIxB,KAAKsjD,SAASzP,SAAW3pC,KAAKoqC,MAC9Bt0C,KAAKsiH,SACT,CACJ,CACA,OAAAA,GACItiH,KAAKy3H,WAAW3rH,SAAQ8rH,IACpBA,EAAUtV,UACVsV,EAAU52E,QAAQK,oBAAoB,QAASrhD,KAAKo9G,QAAQ,GAEpE,ECrEG,MAAMya,WAAcnqE,GACvBi6D,YACAn5G,MACA3S,QACAgpB,KACA,WAAA/X,CAAY9B,EAAO,CAAC,GAChB+iC,QACA/tC,KAAK2nH,YAAc38G,EAAK28G,aAAejoH,OAAOqrD,kBAC9C/qD,KAAKnE,QAAU,EACQ,MAAnBmP,EAAK8sH,YACL9sH,EAAKyhG,SAASsrB,oBAAoB/sH,EAAK8sH,WAAY,CAC/CE,UAAW,KACA,CACH9xH,KAAMlG,KAAKwO,MAAM9S,OACjBu8H,QAASj4H,KAAKnE,QACd05B,OAAQv1B,KAAKwO,MAAM9S,OAASsE,KAAKnE,YAKjDmE,KAAK6kB,KAAO7Z,EAAK6Z,KACjB7kB,KAAKwO,MAAQ,EACjB,CACA,iBAAA0pH,GACI,GAAkB,IAAdl4H,KAAKkG,KAaL,OAVA06C,gBAAe,KACX5gD,KAAK6tD,kBAAkB,QAAQ,IAEd,IAAjB7tD,KAAKi4H,SAGLr3E,gBAAe,KACX5gD,KAAK6tD,kBAAkB,OAAO,KAG/B,EAEX,GAAI7tD,KAAKnE,QAAUmE,KAAK2nH,YAAa,CACjC,IAAIK,EACJ,IAAK,MAAM5qH,KAAK4C,KAAKwO,MACjB,GAAiB,WAAbpR,EAAEoE,OAAqB,CACvBwmH,EAAM5qH,EACN,KACJ,CAEJ,OAAW,MAAP4qH,IAGJhoH,KAAK6tD,kBAAkB,UACvB7tD,KAAKnE,UACAmsH,EAAIhB,MACJ/7D,SAAQ,KAET,IAAK,IAAIruD,EAAI,EAAGA,EAAIoD,KAAKwO,MAAM9S,OAAQkB,IACnC,GAAIoD,KAAKwO,MAAM5R,KAAOorH,EAAK,CACvBhoH,KAAKwO,MAAMjO,OAAO3D,EAAG,GACrB,KACJ,CAEJoD,KAAKnE,UACLmE,KAAKk4H,oBACLl4H,KAAK6tD,kBAAkB,OAAO,KAE3B,EACX,CACA,OAAO,CACX,CACA,OAAAk5D,CAAQiB,GACJhoH,KAAKwO,MAAMlR,KAAK0qH,GACC,MAAbhoH,KAAK6kB,MACL7kB,KAAKwO,MAAMqW,KAAK7kB,KAAK6kB,KAE7B,CAIA,SAAMuC,CAAI/rB,EAAI0F,GACVA,GAASigD,QAAQC,iBACjB,MAAM+mE,EAAM,IAAIwP,GAAIn8H,EAAI0F,GAIxB,OAHAf,KAAK+mH,QAAQiB,GACbhoH,KAAK6tD,kBAAkB,OACvB7tD,KAAKk4H,oBACElQ,EAAItqH,KAAKqD,GACX+M,MAAKK,IACNnO,KAAK6tD,kBAAkB,YAAa,CAAElK,OAAQx1C,IAC9CnO,KAAK6tD,kBAAkB,UAAW,CAAElK,OAAQ,CAAEqkE,MAAK75G,YAC5CA,KAENN,OAAM5R,IACP,GAAmB,WAAf+rH,EAAIxmH,OAEJ,IAAK,IAAI5E,EAAI,EAAGA,EAAIoD,KAAKwO,MAAM9S,OAAQkB,IACnC,GAAIoD,KAAKwO,MAAM5R,KAAOorH,EAAK,CACvBhoH,KAAKwO,MAAMjO,OAAO3D,EAAG,GACrB,KACJ,CAKR,MAFAoD,KAAK6tD,kBAAkB,QAAS,CAAElK,OAAQ1nD,IAC1C+D,KAAK6tD,kBAAkB,UAAW,CAAElK,OAAQ,CAAEqkE,MAAKtgH,MAAOzL,KACpDA,CAAG,GAEjB,CAIA,KAAA2U,GACI5Q,KAAKwO,MAAMjO,OAAO,EAAGP,KAAKwO,MAAM9S,OACpC,CAIA,KAAAwoE,GACIlkE,KAAKwO,MAAM1C,SAAQk8G,IACfA,EAAI9jD,MAAM,IAAI,GAAa,IAE/BlkE,KAAK4Q,OACT,CAMA,aAAMmwC,CAAQhgD,GAEQ,IAAdf,KAAKkG,YAGH+wH,GAAUj3H,KAAM,QAASe,GAASigD,OAC5C,CAYA,oBAAMunE,CAAezxD,EAAO/1D,GAEpBf,KAAKkG,KAAO4wD,SAGVmgE,GAAUj3H,KAAM,OAAQe,GAASigD,OAAQ,CAC3CtkC,OAAQ,IAAM1c,KAAKkG,KAAO4wD,GAElC,CASA,YAAM0xD,CAAOznH,GAEY,IAAjBf,KAAKnE,SAA+B,IAAdmE,KAAKkG,YAGzB+wH,GAAUj3H,KAAM,OAAQe,GAASigD,OAC3C,CAIA,QAAI96C,GACA,OAAOlG,KAAKwO,MAAM9S,MACtB,CAIA,UAAI65B,GACA,OAAOv1B,KAAKwO,MAAM9S,OAASsE,KAAKnE,OACpC,CAIA,WAAIo8H,GACA,OAAOj4H,KAAKnE,OAChB,CAWA,iBAAOs8H,CAAYp3H,GACfA,GAASigD,QAAQC,iBACjB,MAAMmB,EAASjC,GAAS,CACpBO,YAAY,IAEV4hE,EAAWrmH,IACF,MAAPA,EACA+D,KAAKkkE,QAGLlkE,KAAK4Q,QAETwxC,EAAOplD,IAAIf,EAAI,EAEbm8H,EAAsBh4H,IACN,MAAdA,EAAIujD,QACJvB,EAAO9kD,KAAK8C,EAAIujD,OACpB,EAEE00E,EAAgBj4H,IAClBkiH,EAAQliH,EAAIujD,OAAO,EAEjB20E,EAAc,KAChBhW,GAAS,EAGPiW,EAAgB,KAClBjW,EAAQ,IAAI,GAAU,gBAAiB,qBAAqB,EAGhEtiH,KAAKmhD,iBAAiB,YAAai3E,GACnCp4H,KAAKmhD,iBAAiB,QAASk3E,GAC/Br4H,KAAKmhD,iBAAiB,OAAQm3E,GAC9Bv3H,GAASigD,QAAQG,iBAAiB,QAASo3E,GAC3C,UACWn2E,CACX,CACA,QAEIpiD,KAAKqhD,oBAAoB,YAAa+2E,GACtCp4H,KAAKqhD,oBAAoB,QAASg3E,GAClCr4H,KAAKqhD,oBAAoB,OAAQi3E,GACjCv3H,GAASigD,QAAQK,oBAAoB,QAASk3E,GAE9CjW,GACJ,CACJ,ECvPG,MAAMkW,WAAkBX,GAC3B,GAAAlpH,CAAIm1C,GACA,OAA4B,MAArB9jD,KAAKutB,KAAKu2B,EACrB,CACA,IAAAv2B,CAAKu2B,GACD,OAAO9jD,KAAKwO,MAAM+e,MAAKy6F,GACZlkE,EAAO5X,OAAO87E,EAAIjnH,QAAQ+iD,SAEzC,ECRG,MAYM20E,GAAiC,KCgCjCC,GAAwB,oBC5C/B,GFAyB,EEAzB,GDuBoC,ICvBpC,GDe+B,GCf/B,GDmB4B,ECnB5B,GDW4B,ICX5B,GAM0BD,GAN1B,GD2B6C,GClB5C,MAAME,GACTt0E,kBACAC,UACA91C,MACAoqH,eACAC,iBACAC,mBACAC,uBACAC,6BACAC,gCACAC,iBACA9iB,QACA6hB,QACAr5H,IAMA,WAAAkO,CAAYm3C,EAAYj5C,GA6BpB,IAAIglH,EA5BJhwH,KAAKqkD,kBAAoBJ,EAAWI,kBACpCrkD,KAAKskD,UAAYL,EAAWK,UAC5BtkD,KAAK44H,eAAiB5tH,EAAK4tH,gBAAkB,GAC7C54H,KAAK64H,iBAAmB7tH,EAAK6tH,kBAAoB,GACjD74H,KAAK84H,mBAAqB9tH,EAAKkuH,kBAAoB,GACnDl5H,KAAK+4H,uBAAyB/tH,EAAKmuH,gBAAkB,GACrDn5H,KAAKg5H,6BAA+BhuH,EAAKouH,4BAA8B,GACvEp5H,KAAKi5H,gCAAkCjuH,EAAKiuH,iCAAmC,GAC/Ej5H,KAAKpB,IAAMqlD,EAAWxJ,OAAO2zD,aAAa,uCAC1CpuG,KAAKo2G,SAAU,EACfp2G,KAAKi4H,SAAU,EACfj4H,KAAKwO,MAAQ,IAAIgqH,GAAU,CACvB7Q,YAAa38G,EAAKquH,qBAAuB,GACzCvB,WAAY,wBACZrrB,QAASxoD,EAAWwoD,UAExBzsG,KAAKwO,MAAM2yC,iBAAiB,SAAU/gD,IAClCJ,KAAKpB,IAAI8I,MAAM,yBAA0BtH,EAAIujD,OAAO,IAGxDM,EAAWx0C,OAAO0xC,iBAAiB,oBAAoB,KACnDnhD,KAAKs5H,WACAzrH,OAAM5R,IACP+D,KAAKpB,IAAI8I,MAAMzL,EAAI,GACrB,IAONgoD,EAAWx0C,OAAO0xC,iBAAiB,kBAAkB,KACjDwJ,aAAaqlE,GACbA,EAAWv6F,YAAW,KAClBz1B,KAAKs5H,WACAzrH,OAAM5R,IACP+D,KAAKpB,IAAI8I,MAAMzL,EAAI,GACrB,GACH+D,KAAKi5H,gCAAgC,GAEhD,CACA,SAAArsE,GACI,OAAO5sD,KAAKo2G,OAChB,CACA,KAAAr5G,GACIiD,KAAKo2G,SAAU,CACnB,CACA,UAAA4a,GACIhxH,KAAKs5H,WACAzrH,OAAM5R,IACP+D,KAAKpB,IAAI8I,MAAM,0BAA2BzL,EAAI,GAEtD,CACA,IAAAwR,GAEIzN,KAAKwO,MAAMoC,QACX+5C,aAAa3qD,KAAKk5H,kBAClBl5H,KAAKo2G,SAAU,EACfp2G,KAAKi4H,SAAU,CACnB,CACA,cAAMqB,GACF,IAAKt5H,KAAKo2G,SAAWp2G,KAAKi4H,QACtB,OAEJ,MAAM70E,EAAcpjD,KAAKqkD,kBAAkBk1E,oBACrCC,EAAiBp2E,EAAYl9C,KAEnC,GAAIszH,GAAkBx5H,KAAK44H,eAMvB,YALI54H,KAAK44H,eAAiB,GACtB54H,KAAKpB,IAAIsvG,MAAM,gCAAiCsrB,EAAgBx5H,KAAK44H,iBAM7E,GAAI54H,KAAKwO,MAAMtI,KAAOlG,KAAK+4H,uBAGvB,OAFA/4H,KAAKpB,IAAI,2DAA4D46H,EAAgBx5H,KAAK44H,qBAC1F54H,KAAKy5H,sBAGTz5H,KAAKi4H,SAAU,EACfj4H,KAAKpB,IAAI,uFAAwF46H,EAAgBx5H,KAAK44H,gBACtH,MAAMc,EAAY,IAAIzT,GAEtBjmH,KAAKqkD,kBAAkBs1E,eAClBjuH,KAAI8C,GAASA,EAAMs1C,SACnBpnC,OAAOyK,UAENq9B,QAAcxkD,KAAKskD,UAAU7C,IAAI,CACnCssE,QAAS,CAEJnrE,GAEiC,IAA1BA,EAAKivD,UAAUn2G,QACfsE,KAAKpB,IAAIsvG,MAAM,oDAAqDtrD,EAAKthC,KAClE,GAGP8hC,EAAYz0C,IAAIi0C,EAAKthC,KACrBthB,KAAKpB,IAAIsvG,MAAM,wDAAyDtrD,EAAKthC,KACtE,GAGPo4G,EAAU/qH,IAAIi0C,EAAKthC,KACnBthB,KAAKpB,IAAIsvG,MAAM,2DAA4DtrD,EAAKthC,KACzE,IAGPthB,KAAKwO,MAAMG,IAAIi0C,EAAKthC,MACpBthB,KAAKpB,IAAIsvG,MAAM,+DAAgEtrD,EAAKthC,KAC7E,MAQjBs4G,EAAgBp1E,EAAM3/B,MAAK,IAAMroB,KAAK4oD,SAAW,GAAM,GAAK,IAE5Dy0E,EAAa,IAAIhT,GACvB,IAAK,MAAMjkE,KAAQg3E,EACXC,EAAWlrH,IAAIi0C,EAAKthC,KAIxBu4G,EAAW9uH,IAAI63C,EAAKthC,GAAI,IAAIshC,EAAKmC,KAAKtiC,UAAU2lB,QAAO,CAAC8P,EAAKjuC,IAClDiuC,EAAMjuC,EAAKxK,OACnB,IAGP,MAWMq6H,EAXcF,EAAc/0G,MAAK,CAACwV,EAAGh9B,KACvC,MAAM08H,EAAaF,EAAW/uH,IAAIuvB,EAAE/Y,KAAO,EACrC04G,EAAaH,EAAW/uH,IAAIzN,EAAEikB,KAAO,EAC3C,OAAIy4G,EAAaC,GACL,EAERD,EAAaC,EACN,EAEJ,CAAC,IAE+Bt9G,QAAOkmC,IAC9C,MAAMq3E,EAAkBr3E,EAAK+C,SAAS76C,IAAI4tH,IAC1C,GAAuB,MAAnBuB,EACA,OAAO,EAEX,MAAMC,EAA2BpxH,SAAS,GAAmBmxH,IAC7D,QAAI92H,MAAM+2H,IAIHhwH,KAAKoqC,MAAQ4lF,EAA2Bl6H,KAAKg5H,4BAA4B,IAEpFh5H,KAAKpB,IAAI,+BAAgCk7H,EAAuBp+H,OAAQ8oD,EAAM9oD,QAC9E,IAAK,MAAMknD,KAAQk3E,EACf95H,KAAKwO,MAAM4Y,KAAI2jB,UACX,MAAMyuF,EAAiBx5H,KAAKqkD,kBAAkBk1E,oBAAoBrzH,KAElE,GAAIszH,GAAkBx5H,KAAK44H,eAGvB,OAFA54H,KAAKpB,IAAI,mCAAoC46H,EAAgBx5H,KAAK44H,qBAClE54H,KAAKwO,MAAMoC,QAGf5Q,KAAKpB,IAAI,2CAA4CgkD,EAAKthC,UACpDthB,KAAKqkD,kBAAkBq8D,eAAe99D,EAAKthC,GAAI,CACjD4lG,SAAUlnH,KAAK64H,kBACjB,GACH,CACC/0E,OAAQlB,EAAKthC,KACdzT,OAAM5R,IACL+D,KAAKpB,IAAI8I,MAAM,6CAA8CzL,EAAI,IAGzE+D,KAAKi4H,SAAU,EACfj4H,KAAKy5H,qBACT,CACA,mBAAAA,GACSz5H,KAAKo2G,UAGVp2G,KAAKk5H,iBAAmBzjG,YAAW,KAC/Bz1B,KAAKs5H,WACAzrH,OAAM5R,IACP+D,KAAKpB,IAAI8I,MAAM,0BAA2BzL,EAAI,GAChD,GACH+D,KAAK84H,oBACZ,ECzMJ,MAAMqB,GAA6B,CAE/B,iBAEA,sBAEA,wBAEA,iBCxBE,GAAiB,CACnBC,eJI2B,IIH3BC,MAAO,IAKJ,MAAMC,GACTF,eACA/1E,kBACAC,UACA+1E,MACA5qH,OACA7Q,IACA,WAAAkO,CAAYm3C,EAAYj5C,EAAO,CAAC,GAC5BhL,KAAKo6H,eAAiBpvH,EAAKovH,gBAAkB,GAAeA,eAC5Dp6H,KAAKq6H,MAAQrvH,EAAKqvH,OAAS,GAAeA,MAC1Cr6H,KAAKqkD,kBAAoBJ,EAAWI,kBACpCrkD,KAAKskD,UAAYL,EAAWK,UAC5BtkD,KAAKyP,OAASw0C,EAAWx0C,OACzBzP,KAAKpB,IAAMqlD,EAAWxJ,OAAO2zD,aAAa,+CAE1CnqD,EAAWx0C,OAAO0xC,iBAAiB,mBAAmB,KAClDnhD,KAAKu6H,wBACA1sH,OAAM5R,IACP+D,KAAKpB,IAAI8I,MAAMzL,EAAI,GACrB,GAEV,CAKA,2BAAMs+H,GACF,MAAMn3E,EAAcpjD,KAAKqkD,kBAAkB7B,iBACrCg3E,EAAiBp2E,EAAY1nD,OAEnC,GADAsE,KAAKpB,IAAI,uCAAwC46H,EAAgBx5H,KAAKo6H,gBAClEZ,GAAkBx5H,KAAKo6H,eACvB,OAEJ,MAAMP,EAAa,IAAIhT,GAEvB,IAAK,MAAM1jE,KAAcC,EAAa,CAClC,MAAMoC,EAAarC,EAAWqC,WAC9B,IAAIq0E,EAAWlrH,IAAI62C,GAAnB,CAGAq0E,EAAW9uH,IAAIy6C,EAAY,GAC3B,IACI,MAAM5C,QAAa5iD,KAAKskD,UAAUx5C,IAAI06C,GAEtCq0E,EAAW9uH,IAAIy6C,EAAY,IAAI5C,EAAKmC,KAAKtiC,UAAU2lB,QAAO,CAAC8P,EAAKjuC,IACrDiuC,EAAMjuC,EAAKxK,OACnB,GACP,CACA,MAAOxD,GACc,kBAAbA,EAAIoQ,MACJrM,KAAKpB,IAAI8I,MAAM,0BAA2BzL,EAElD,CAbA,CAcJ,CACA,MAAMu+H,EAAoBx6H,KAAKy6H,gBAAgBr3E,EAAay2E,GAEtDa,EAAUl+H,KAAKgU,IAAIgpH,EAAiBx5H,KAAKo6H,eAAgB,GACzDO,EAAU,GAChB,IAAK,MAAMx3E,KAAcq3E,EAUrB,GATAx6H,KAAKpB,IAAI,yDAA0DukD,EAAWqC,YAEhDxlD,KAAKq6H,MAAMt2E,MAAM6sD,GACpCztD,EAAWg1D,WAAW15G,WAAWwzB,WAAW2+E,EAAGnyG,eAItDk8H,EAAQr9H,KAAK6lD,GAEbw3E,EAAQj/H,SAAWg/H,EACnB,YAIF5+H,QAAQ2lD,IAAIk5E,EAAQjvH,KAAIq/B,MAAOoY,UDlDtCpY,eAA6CoY,EAAYpiD,GAC5D,MAAM65H,EAAkBz3E,GAAYs8D,SAAS/zG,KAAI02C,GAAUA,EAAOqD,YAAa,GACzEo1E,EAAoB95H,GAAS85H,mBAAqBV,GAGxD,KAAIS,EAAgBl+G,QAAOk+B,GAAkB,MAATA,IAAkBigF,EAAkBl+G,SAASi+B,KAAQl/C,OAAS,GAGlG,UACUynD,GAAYi0D,MAAMr2G,GAC5B,CACA,MAAO9E,GACHknD,GAAY+gB,MAAMjoE,EACtB,CACJ,CCqCkB6+H,CAA8B33E,EAAY,CAC5CnC,OAAQm2D,YAAYprD,QAAQ,MAC9B,KAGN/rD,KAAKyP,OAAOo+C,kBAAkB,mBAAoB,CAAElK,OAAQg3E,GAChE,CACA,eAAAF,CAAgBr3E,EAAay2E,GACzB,OAAOz2E,EAEFv+B,MAAK,CAACwV,EAAGh9B,KACV,MAAM09H,EAAsB1gG,EAAEipB,SAASxhD,KACjCk5H,EAAsB39H,EAAEimD,SAASxhD,KACvC,OAAIi5H,EAAsBC,EACf,EAEPD,EAAsBC,GACd,EAEL,CAAC,IAGPn2G,MAAK,CAACwV,EAAGh9B,IACU,aAAhBg9B,EAAEoiF,WAA4C,YAAhBp/G,EAAEo/G,UACzB,EAES,YAAhBpiF,EAAEoiF,WAA2C,aAAhBp/G,EAAEo/G,WACvB,EAEL,IAGN53F,MAAK,CAACwV,EAAGh9B,IACNg9B,EAAEolF,QAAQ/jH,OAAS2B,EAAEoiH,QAAQ/jH,OACtB,EAEP2+B,EAAEolF,QAAQ/jH,OAAS2B,EAAEoiH,QAAQ/jH,QACrB,EAEL,IAGNmpB,MAAK,CAACwV,EAAGh9B,KACV,MAAM08H,EAAaF,EAAW/uH,IAAIuvB,EAAEmrB,aAAe,EAC7Cw0E,EAAaH,EAAW/uH,IAAIzN,EAAEmoD,aAAe,EACnD,OAAIu0E,EAAaC,EACN,EAEPD,EAAaC,GACL,EAEL,CAAC,GAEhB,ECxIG,MAAM,WAAsBnC,GAC/B,WAAA/qH,CAAY9B,EAAO,CAAC,GAChB+iC,MAAM,IACC/iC,EACH6Z,KAAM,CAACwV,EAAGh9B,IACFg9B,EAAEt5B,QAAQmmH,SAAW7pH,EAAE0D,QAAQmmH,UACvB,EAER7sF,EAAEt5B,QAAQmmH,SAAW7pH,EAAE0D,QAAQmmH,SACxB,EAEJ,GAGnB,ECXG,SAAS+T,GAAUC,GACtB,MAAMxD,EAAa,IAAIh8G,WAAW6hG,gBAClC,SAASH,IACLsa,EAAWxzD,QACX,IAAK,MAAMljB,KAAUk6E,EACkB,MAA/Bl6E,GAAQK,qBACRL,EAAOK,oBAAoB,QAAS+7D,EAGhD,CACA,IAAK,MAAMp8D,KAAUk6E,EAAS,CAC1B,IAAwB,IAApBl6E,GAAQ8J,QAAkB,CAC1BsyD,IACA,KACJ,CACgC,MAA5Bp8D,GAAQG,kBACRH,EAAOG,iBAAiB,QAASi8D,EAEzC,CAQA,MAAMp8D,EAAS02E,EAAW12E,OAE1B,OADAA,EAAOpwC,MARP,WACI,IAAK,MAAMowC,KAAUk6E,EACkB,MAA/Bl6E,GAAQK,qBACRL,EAAOK,oBAAoB,QAAS+7D,EAGhD,EAGOp8D,CACX,CCjBA,MAAM,GAAiB,CACnB01E,cAAe5D,GACf/hE,iBPN8B,GOO9BoqE,mBNiCiC,IMhCjCC,mBNTkC,GMUlCC,YNlBwB,IMmBxBr/D,UAAW,CACPylD,QAAS2U,KAGV,MAAMkF,GACT9sH,MACAy1C,WACAyyE,cACA0E,mBACAD,mBACAE,YACAE,mBACAn4E,YACAxkD,IACA,WAAAkO,CAAYm3C,EAAYj5C,EAAO,CAAC,GAC5BhL,KAAK02H,cAAgB1rH,EAAK0rH,eAAiB,GAAeA,cAC1D12H,KAAKo7H,mBAAqBpwH,EAAKowH,oBAAsB,GAAeA,mBACpEp7H,KAAKm7H,mBAAqBnwH,EAAKmwH,oBAAsB,GAAeA,mBACpEn7H,KAAKq7H,YAAcrwH,EAAKqwH,aAAe,GAAeA,YACtDr7H,KAAKojD,YAAcp4C,EAAKo4C,aAAe,IAAIyjE,GAC3C7mH,KAAKpB,IAAMqlD,EAAWxJ,OAAO2zD,aAAa,wCAC1CpuG,KAAKikD,WAAaA,EAClBjkD,KAAKu7H,mBAAqB,IAAIhe,gBACJv9G,KAAKu7H,mBAAmBv6E,OAClD,IAAK,MAAOj1C,EAAKtM,KAAUX,OAAO+/D,QAAQ7zD,EAAKgxD,WAAa,CAAC,GACzDA,GAAUjxD,IAAIgB,EAAKtM,GAGvBO,KAAKwO,MAAQ,IAAI,GAAc,CAC3Bm5G,YAAa38G,EAAK+lD,kBAAoB,GAAeA,iBACrD+mE,WAAY,oBACZrrB,QAASxoD,EAAWwoD,UAGxBzsG,KAAKwO,MAAM2yC,iBAAiB,SAAU1yC,IAClCzO,KAAKpB,IAAI8I,MAAM,sBAAuB+G,EAAMk1C,OAAO,GAE3D,CACA,KAAA5mD,GACIiD,KAAKu7H,mBAAqB,IAAIhe,gBACJv9G,KAAKu7H,mBAAmBv6E,MACtD,CAIA,IAAAvzC,GACIzN,KAAKu7H,mBAAmBr3D,QACxBlkE,KAAKwO,MAAM01D,OACf,CAaA,UAAMvS,CAAK6pE,EAAmBz6H,EAAU,CAAC,GACrC,MAAM,OAAE+iD,EAAM,WAAEqtD,GAAe0lB,GAAe2E,GAGxCC,EAAqBjgI,MAAMq/B,KAAK76B,KAAKojD,YAAY3gC,UAAUgpC,OAAOl+B,MAAK0iC,IACnD,IAAlBlvD,EAAQ26H,UAGRzrE,EAAKzK,WAAWtZ,OAAO4X,IAGpBqtD,EAAW5jF,MAAKsrC,GACZA,EAAK3sB,OAAO+jB,EAAKkoD,iBAGhC,GAA0B,MAAtBsjB,EAGA,OAFAz7H,KAAKpB,IAAI,0BAA2B68H,EAAmBtjB,YACvDp3G,EAAQokH,aAAa,IAAIhB,GAAoB,iCACtCsX,EAIX,MAAME,EAAe37H,KAAKwO,MAAMA,MAAM+e,MAAKy6F,IACvC,IAA2C,IAAvClkE,GAAQ5X,OAAO87E,EAAIjnH,QAAQ+iD,QAC3B,OAAO,EAGX,MAAM+tD,EAAYmW,EAAIjnH,QAAQowG,WAC9B,GAAiB,MAAbU,EACA,OAAO,EAEX,IAAK,MAAMF,KAAaR,EACpB,GAAIU,EAAUljG,IAAIgjG,EAAUlzG,YACxB,OAAO,EAGf,OAAO,CAAK,IAEhB,GAAoB,MAAhBk9H,EAAsB,CACtB37H,KAAKpB,IAAI,sCAAuCklD,GAEhD,IAAK,MAAM6tD,KAAaR,EACpBwqB,EAAa56H,QAAQowG,WAAW/pF,IAAIuqF,EAAUlzG,YAGlD,OADAsC,EAAQokH,aAAa,IAAIhB,GAAoB,qCACtCwX,EAAaj+H,KAAKqD,EAC7B,CACA,GAAIf,KAAKwO,MAAMtI,MAAQlG,KAAKm7H,mBACxB,MAAM,IAAI,GAAU,qBAAsB,uBAI9C,OAFAn7H,KAAKpB,IAAI,8BAA+BklD,EAAQqtD,EAAWzlG,KAAIklG,GAAMA,EAAGnyG,cACxEsC,EAAQokH,aAAa,IAAIhB,GAAoB,iCACtCnkH,KAAKwO,MAAM4Y,KAAI2jB,MAAOhqC,IACzBA,GAASokH,aAAa,IAAIhB,GAAoB,0BAG9C,MAAMnjE,EAAShhD,KAAK47H,0BAA0B76H,GAASigD,QACvD,IAAI66E,EACJ,IAGIA,QAAoB77H,KAAK87H,oBAAoBh4E,EAAQ/iD,GAASowG,WAAY,IACnEpwG,EACHigD,WAEJjgD,GAASokH,aAAa,IAAIhB,GAAoB,kCAAmC0X,IACjFA,EAAYnwH,KAAI,EAAGimG,eAAgBA,EAAUlzG,aAAYqN,SAAQ+sD,IAC7D93D,GAASowG,WAAW/pF,IAAIyxC,EAAK,GAErC,CACA,MAAO58D,GAEH,MADA+kD,EAAOpwC,QACD3U,CACV,CACA,IACI,IAAI8/H,EAAS,EACb,MAAMlqE,EAAS,GACf,IAAK,MAAMoG,KAAW4jE,EAAa,CAC/B,GAAIE,IAAW/7H,KAAKo7H,mBAEhB,MADAp7H,KAAKpB,IAAI,yEAA0Em9H,EAAQj4E,GACrF,IAAI,GAAU,wCAAyC,GAAMk4E,wBAEvED,IACA,IACI,MAAM9rE,QAAajwD,KAAKikD,WAAWisE,iBAAiBv+D,KAAKsG,EAAQ05C,UAAW,IACrE5wG,EACHigD,WAGJ,OADAhhD,KAAKpB,IAAI,uBAAwBq5D,EAAQ05C,WAClC1hD,CACX,CACA,MAAOh0D,GAEH,GADA+D,KAAKpB,IAAI8I,MAAM,oBAAqBuwD,EAAQ05C,UAAW11G,GACzC,MAAV6nD,EAEA,UACU9jD,KAAKikD,WAAWK,UAAUyzD,MAAMj0D,EAAQ,CAC1C6B,SAAU,CACN,CAAC+yE,IAAwB,GAAqBxuH,KAAKoqC,MAAM71C,cAGrE,CACA,MAAOxC,GACH+D,KAAKpB,IAAI8I,MAAM,gDAAiDo8C,EAAQ7nD,EAC5E,CAGJ,GAAI+kD,EAAO8J,QACP,MAAM,IAAI,GAAU7uD,EAAIwN,QAASurD,IAErCnD,EAAOv0D,KAAKrB,EAChB,CACJ,CACA,GAAsB,IAAlB41D,EAAOn2D,OACP,MAAMm2D,EAAO,GAEjB,MAAM,IAAIkD,GAAmBlD,EAAQ,6BAA8B,GAAMoqE,0BAC7E,CACA,QAEIj7E,EAAOpwC,OACX,IACD,CACCkzC,SACAojE,SAAUnmH,EAAQmmH,UAAYgV,GAC9B/qB,WAAY,IAAI54D,IAAI44D,EAAWzlG,KAAIklG,GAAMA,EAAGnyG,cAC5CuiD,OAAQjgD,EAAQigD,OAChBmkE,WAAYpkH,EAAQokH,YAE5B,CACA,yBAAAyW,CAA0BO,GAStB,OAPelB,GAAU,CACrB9jB,YAAYprD,QAAQ/rD,KAAKq7H,aACzBr7H,KAAKu7H,mBAAmBv6E,OACxBm7E,GAKR,CAEA,yBAAML,CAAoBh4E,EAAQqtD,EAAa,IAAI54D,IAAOx3C,EAAU,CAAC,GACjE,MAAMyuH,EAAQ,IAAIre,GAAYzlG,KAAIklG,IAAM,CACpCe,UAAW,GAAUf,GACrB6G,aAAa,MAGjB,GAAc,MAAV3zD,EAAgB,CAChB,GAAI9jD,KAAKikD,WAAWH,OAAO5X,OAAO4X,GAC9B,MAAM,IAAI,GAAU,qBAAsB,GAAMs4E,iBAEpD,IAAuE,UAA5Dp8H,KAAKikD,WAAWiuE,gBAAgBE,eAAetuE,IACtD,MAAM,IAAI,GAAU,qDAAsD,GAAMu4E,2BAIpF,GAAqB,IAAjB7M,EAAM9zH,OAAc,CACpBsE,KAAKpB,IAAI,4BAA6BklD,GACtC,IACI,MAAMlB,QAAa5iD,KAAKikD,WAAWK,UAAUx5C,IAAIg5C,GACjD0rE,EAAMlyH,QAAQslD,EAAKivD,WACnB7xG,KAAKpB,IAAI,2BAA4BklD,EAAQ0rE,EAAM9jH,KAAI,EAAGimG,eAAgBA,EAAUlzG,aACxF,CACA,MAAOxC,GACH,GAAIA,EAAIoQ,OAAS,GAAMiwH,cACnB,MAAMrgI,CAEd,CACJ,CAGA,GAAqB,IAAjBuzH,EAAM9zH,OAAc,CACpBsE,KAAKpB,IAAI,mDAAoDklD,GAC7D,IACI,MAAMqN,QAAiBnxD,KAAKikD,WAAWs4E,YAAYC,SAAS14E,GAC5D9jD,KAAKpB,IAAI,8CAA+CklD,EAAQ0rE,EAAM9jH,KAAI,EAAGimG,eAAgBA,EAAUlzG,cACvG+wH,EAAMlyH,QAAQ6zD,EAASggD,WAAWzlG,KAAIimG,IAAa,CAC/CA,YACA8F,aAAa,MAErB,CACA,MAAOx7G,GACCA,EAAIoQ,OAAS,GAAMowH,0BACnBz8H,KAAKpB,IAAI8I,MAAM,0DAA2Do8C,EAAQ7nD,EAE1F,CACJ,CACJ,CAGA,IAAIygI,SAA2B5gI,QAAQ2lD,IAAI+tE,EAAM9jH,KAAIq/B,MAAO8tB,IACxD,MAAM1qD,QC/QX48B,eAAiC6lE,EAAI7vG,GAExC,IAAIw4D,GAAa,EACjB,IAAK,MAAMxtD,KAAOiwD,GAAUj9D,OAExB,GADAw6D,EAAaq3C,EAAGx1C,aAAaz+C,SAAS5Q,GAClCwtD,EACA,MAIR,IAAKA,EACD,MAAO,CAACq3C,GAEZ,MAAMp7D,QAAeo7D,EAAG70G,QAAQgF,GAEhC,OADAA,EAAQnC,IAAI,iBAAkBgyG,EAAIp7D,EAAO9pC,KAAIklG,GAAMA,EAAGnyG,cAC/C+2C,CACX,CD+PiCmnF,CAAkB9jE,EAAK84C,UAAW,CACnDgQ,IAAK3hH,KAAKikD,WAAW09D,OAClB5gH,EACHnC,IAAKoB,KAAKpB,MAEd,OAAsB,IAAlBuP,EAAOzS,QAAgByS,EAAO,GAAG+9B,OAAO2sB,EAAK84C,WACtC94C,EAEJ1qD,EAAOzC,KAAIimG,IAAa,CAC3BA,YACA8F,aAAa,KACd,MAEFhsD,OAEL,GAAc,MAAV3H,EAAgB,CAChB,MAAM84E,EAAkB,QAAQ94E,EAAOrlD,aACvCi+H,EAAoBA,EAAkBhxH,KAAImtD,IACtC,MAAMgkE,EAAYhkE,EAAK84C,UAAUz2C,SAASU,MAE1C,OAAwB,IAApBihE,GAAWt3H,KACJszD,EAGuB,MAA9BA,EAAK84C,UAAUl2C,YACR,CACHk2C,UAAW94C,EAAK84C,UAAUt2C,YAAYuhE,GACtCnlB,YAAa5+C,EAAK4+C,aAGnB5+C,CAAI,GAEnB,CACA,MAAMikE,EAAgBJ,EAAkBhgH,QAAOm8C,IAE3C,GAAkF,MAA9E74D,KAAKikD,WAAWisE,iBAAiB6M,0BAA0BlkE,EAAK84C,WAChE,OAAO,EAKX,MAAMqrB,EAAankE,EAAK84C,UAAUl2C,YAClC,OAAc,MAAV3X,GAAgC,MAAdk5E,GACXl5E,EAAO5X,OAAO8wF,EAEd,IAGTC,EAAe,IAAIxxF,IACzB,IAAK,MAAMotB,KAAQikE,EAAe,CAC9B,MAAM1Q,EAAQvzD,EAAK84C,UAAUlzG,WACvBg8G,EAAWwiB,EAAanyH,IAAIshH,GAClB,MAAZ3R,EAIJwiB,EAAalyH,IAAIqhH,EAAOvzD,GAHpB4hD,EAAShD,YAAcgD,EAAShD,aAAe5+C,EAAK4+C,cAAe,CAI3E,CACA,MAAMylB,EAAoB,IAAID,EAAax6G,UAE3C,GAAiC,IAA7By6G,EAAkBxhI,OAClB,MAAM,IAAI,GAAU,0CAA2C,GAAMyhI,wBAEzE,MAAMC,EAAY,GAClB,IAAK,MAAMvkE,KAAQqkE,EAC0C,MAArDl9H,KAAKikD,WAAWiuE,gBAAgBG,yBAAmCryH,KAAKikD,WAAWiuE,gBAAgBG,kBAAkBx5D,EAAK84C,YAG9HyrB,EAAU9/H,KAAKu7D,GAEnB,MAAMwkE,EAAmBD,EAAUv4G,KAAK7kB,KAAK02H,eAE7C,GAAgC,IAA5B2G,EAAiB3hI,OACjB,MAAM,IAAI,GAAU,gEAAiE,GAAMyhI,wBAI/F,OAFAn9H,KAAKpB,IAAIsvG,MAAM,oCAAqCpqD,GAAU,eAAgB44E,EAAkBhxH,KAAI,EAAGimG,eAAgBA,EAAUlzG,cACjIuB,KAAKpB,IAAIsvG,MAAM,mCAAoCpqD,GAAU,eAAgBu5E,EAAiB3xH,KAAI,EAAGimG,eAAgBA,EAAUlzG,cACxH4+H,CACX,CACA,gBAAMC,CAAW3rB,EAAW5wG,EAAU,CAAC,GAC9BvF,MAAM+Y,QAAQo9F,KACfA,EAAY,CAACA,IAEjB,IACI,MAAME,QAAkB7xG,KAAK87H,yBAAoB/9H,EAAW,IAAIw6C,IAAIo5D,EAAUjmG,KAAIklG,GAAMA,EAAGnyG,cAAcsC,GACzG,OAAyC,IAArCA,EAAQ01G,0BAIF,MAFC5E,EAAUtkF,MAAKsrC,IACV,GAAQg4C,QAAQh4C,EAAK84C,YAIzC,CACA,MAAO11G,GACH+D,KAAKpB,IAAIsvG,MAAM,kDAAmDjyG,EACtE,CACA,OAAO,CACX,EEvWG,MAAMigI,GAAwB,GAC/B,GTVyB,ESUzB,GTNyB,ISMzB,GRqBsC,EQrBtC,GRyB0C,GQzB1C,GRK+B,GQL/B,GRS4B,EQT5B,GRaoC,IQbpC,GAQ0BzD,GAR1B,GRiB6C,GQH5C,MAAM8E,GACTnnB,QACAhzD,YACAi3E,MACAmD,KACAC,8BACAC,2BACAtD,eACAV,UACAJ,SACAqE,iBACAC,6BACAt5E,UACAmoD,QACAh9F,OACA7Q,IACA,WAAAkO,CAAYm3C,EAAYj5C,EAAO,CAAC,GAC5BhL,KAAKo6H,eAAiBpvH,EAAKovH,gBAAkB,GAC7C,MAAMxB,EAAiB5tH,EAAK4tH,gBAAkB,GAC9C,GAAI54H,KAAKo6H,eAAiBxB,EACtB,MAAM,IAAI,GAAU,wEAAyE,GAAMxO,wBAKvGpqH,KAAKojD,YAAc,IAAIyjE,GACvB7mH,KAAKo2G,SAAU,EACfp2G,KAAKskD,UAAYL,EAAWK,UAC5BtkD,KAAKysG,QAAUxoD,EAAWwoD,QAC1BzsG,KAAKyP,OAASw0C,EAAWx0C,OACzBzP,KAAKpB,IAAMqlD,EAAWxJ,OAAO2zD,aAAa,6BAC1CpuG,KAAK69H,UAAY79H,KAAK69H,UAAU/5H,KAAK9D,MACrCA,KAAK89H,aAAe99H,KAAK89H,aAAah6H,KAAK9D,MAC3CA,KAAKyP,OAAO0xC,iBAAiB,kBAAmBnhD,KAAK69H,WACrD79H,KAAKyP,OAAO0xC,iBAAiB,mBAAoBnhD,KAAK89H,cAEtD99H,KAAKq6H,OAASrvH,EAAKqvH,OAAS,IAAI3uH,KAAIklG,GAAM,GAAUA,KACpD5wG,KAAKw9H,MAAQxyH,EAAKwyH,MAAQ,IAAI9xH,KAAIklG,GAAM,GAAUA,KAClD5wG,KAAK09H,2BAA6B,EAClC19H,KAAKy9H,8BAAgCzyH,EAAKyyH,+BAAiC,GAE3Ez9H,KAAK49H,6BAA+B,IAAI5kB,GAAY,CAChDrnC,OAAQ3mE,EAAK+yH,4BAA8B,GAC3C7kB,SAAU,IAGdl5G,KAAKs5H,SAAW,IAAIX,GAAS,CACzBt0E,kBAAmBrkD,KACnBskD,UAAWL,EAAWK,UACtB70C,OAAQw0C,EAAWx0C,OACnBgrC,OAAQwJ,EAAWxJ,QACpB,CACCm+E,iBACAS,oBAAqBruH,EAAKquH,qBAAuB,GACjDR,iBAAkB7tH,EAAK6tH,kBAAoB,GAC3CO,2BAA4BpuH,EAAKouH,4BAA8B,GAC/DH,gCAAiCjuH,EAAKiuH,iCAAmC,GACzEE,eAAgBnuH,EAAK+tH,wBAA0B,KAGnD/4H,KAAK29H,iBAAmB,IAAIrD,GAAiB,CACzCj2E,kBAAmBrkD,KACnBskD,UAAWL,EAAWK,UACtB70C,OAAQw0C,EAAWx0C,OACnBgrC,OAAQwJ,EAAWxJ,QACpB,CACC2/E,eAAgBp6H,KAAKo6H,eACrBC,MAAOr6H,KAAKq6H,QAEhBr6H,KAAK05H,UAAY,IAAI4B,GAAUr3E,EAAY,CACvCyyE,cAAe1rH,EAAK0rH,eAAiB5D,GACrC/hE,iBAAkB/lD,EAAK+lD,kBTvFD,GSwFtBoqE,mBAAoBnwH,EAAKmwH,oBRhDA,IQiDzBC,mBAAoBpwH,EAAKowH,oBR1FC,GQ2F1BC,YAAarwH,EAAKqwH,aRnGF,IQoGhBr/D,UAAWhxD,EAAKgxD,WAAa,CACzBylD,QAAS2U,IAEbhzE,YAAapjD,KAAKojD,aAE1B,CACA,CAACp1C,OAAO80B,aAAe,6BACvB,SAAA8pB,GACI,OAAO5sD,KAAKo2G,OAChB,CAKA,WAAMr5G,GAEFiD,KAAKysG,SAASsrB,oBAAoB,wCAAyC,CACvEC,UAAW,KACP,MAAMgG,EAAS,CACXC,QAAS,EACTC,SAAU,GAEd,IAAK,MAAMC,KAASn+H,KAAKojD,YAAY3gC,SACjC,IAAK,MAAMwtC,KAAQkuE,EACQ,YAAnBluE,EAAKwsD,UACLuhB,EAAOC,UAGPD,EAAOE,WAInB,OAAOF,CAAM,IAIrBh+H,KAAKysG,SAASsrB,oBAAoB,gCAAiC,CAC/DvT,MAAO,WACPwT,UAAW,KACP,MAAMgG,EAAS,CAAC,EAChB,IAAK,MAAMG,KAASn+H,KAAKojD,YAAY3gC,SACjC,IAAK,MAAMwtC,KAAQkuE,EACf,IAAK,MAAM/7E,KAAU6N,EAAKwvD,QAAS,CAC/B,MAAM1zG,EAAM,GAAGq2C,EAAOq6D,aAAar6D,EAAOqD,UAAY,iBACtDu4E,EAAOjyH,IAAQiyH,EAAOjyH,IAAQ,GAAK,CACvC,CAGR,OAAOiyH,CAAM,IAIrBh+H,KAAKysG,SAASsrB,oBAAoB,4EAA6E,CAC3GvT,MAAO,WACPwT,UAAW,KACP,MAAMoG,EAAa,CAAC,EACpB,IAAK,MAAMD,KAASn+H,KAAKojD,YAAY3gC,SACjC,IAAK,MAAMwtC,KAAQkuE,EAAO,CACtB,MAAM1e,EAAU,CAAC,EACjB,IAAK,MAAMr9D,KAAU6N,EAAKwvD,QAAS,CAC/B,MAAM1zG,EAAM,GAAGq2C,EAAOq6D,aAAar6D,EAAOqD,UAAY,iBACtDg6D,EAAQ1zG,IAAQ0zG,EAAQ1zG,IAAQ,GAAK,CACzC,CACA,IAAK,MAAO05C,EAAUlzC,KAAUzT,OAAO+/D,QAAQ4gD,GAC3C2e,EAAW34E,GAAY24E,EAAW34E,IAAa,GAC/C24E,EAAW34E,GAAUnoD,KAAKiV,EAElC,CAEJ,MAAMyrH,EAAS,CAAC,EAChB,IAAK,IAAKv4E,EAAU44E,KAAWv/H,OAAO+/D,QAAQu/D,GAAa,CACvDC,EAASA,EAAOx5G,MAAK,CAACwV,EAAGh9B,IAAMg9B,EAAIh9B,IACnC,MAAMzB,EAAQY,KAAKmD,MAAsB,GAAhB0+H,EAAO3iI,QAChCsiI,EAAOv4E,GAAY44E,EAAOziI,EAC9B,CACA,OAAOoiI,CAAM,IAGrBh+H,KAAK05H,UAAU38H,QACfiD,KAAKs5H,SAASv8H,QACdiD,KAAKo2G,SAAU,EACfp2G,KAAKpB,IAAI,UACb,CACA,gBAAMoyH,GAEGl1H,QAAQC,UACR+R,MAAKi9B,UACN,MAAMuzF,QAAuBt+H,KAAKskD,UAAU7C,IAAI,CAC5CssE,QAAS,CAAEnrE,GACIA,EAAKmC,KAAKp2C,IChMf,uBDmMR7S,QAAQ2lD,IAAI68E,EAAe5yH,KAAIq/B,MAAO6X,UAClC5iD,KAAK0gH,eAAe99D,EAAKthC,IAC1BzT,OAAM5R,IACP+D,KAAKpB,IAAI8I,MAAMzL,EAAI,GACrB,IACH,IAEF4R,OAAM5R,IACP+D,KAAKpB,IAAI8I,MAAMzL,EAAI,IAEvB+D,KAAKs5H,SAAStI,YAClB,CAIA,UAAMvjH,GACFzN,KAAK05H,UAAUjsH,OACfzN,KAAKs5H,SAAS7rH,OAEd,MAAM8wH,EAAQ,GACd,IAAK,MAAMC,KAAkBx+H,KAAKojD,YAAY3gC,SAC1C,IAAK,MAAM0gC,KAAcq7E,EACrBD,EAAMjhI,KAAK,WACP,UACU6lD,EAAWi0D,OACrB,CACA,MAAOn7G,GACH+D,KAAKpB,IAAI8I,MAAMzL,EACnB,CACH,EAPU,IAUnB+D,KAAKpB,IAAI,yBAA0B2/H,EAAM7iI,cACnCI,QAAQ2lD,IAAI88E,GAClBv+H,KAAKojD,YAAYxyC,QACjB5Q,KAAKpB,IAAI,UACb,CACA,SAAAi/H,CAAUz9H,GACDJ,KAAKy+H,WAAWr+H,GAAKyN,OAAM5R,IAC5B+D,KAAKpB,IAAI8I,MAAMzL,EAAI,GAE3B,CAIA,gBAAMwiI,CAAWr+H,GACb,MAAQujD,OAAQR,GAAe/iD,EAC/B,IAAKJ,KAAKo2G,QAGN,kBADMjzD,EAAWi0D,QAGrB,MAAMtzD,EAASX,EAAWqC,WACpBk5E,EAAc1+H,KAAKojD,YAAYt4C,IAAIg5C,GACzC,IAAI66E,GAAY,EACG,MAAfD,EACAA,EAAYphI,KAAK6lD,IAGjBw7E,GAAY,EACZ3+H,KAAKojD,YAAYr4C,IAAI+4C,EAAQ,CAACX,KAGV,MAApBW,EAAO01B,WAAqC,QAAhB11B,EAAO57C,YAC7BlI,KAAKskD,UAAUyzD,MAAMj0D,EAAQ,CAC/B01B,UAAW11B,EAAO01B,YAGtBmlD,GACA3+H,KAAKyP,OAAOo+C,kBAAkB,eAAgB,CAAElK,OAAQR,EAAWqC,YAE3E,CAIA,YAAAs4E,CAAa19H,GACT,MAAQujD,OAAQR,GAAe/iD,EAC/B,IAAKJ,KAAKo2G,QAEN,OAEJ,MAAMtyD,EAASX,EAAWqC,WAC1B,IAAIo5E,EAAa5+H,KAAKojD,YAAYt4C,IAAIg5C,GACpB,MAAd86E,GAAsBA,EAAWljI,OAAS,GAC1CkjI,EAAaA,EAAWliH,QAAQuzC,GAASA,EAAK3uC,KAAO6hC,EAAW7hC,KAChEthB,KAAKojD,YAAYr4C,IAAI+4C,EAAQ86E,IAEV,MAAdA,IACL5+H,KAAKojD,YAAYJ,OAAOc,GACxB9jD,KAAKyP,OAAOo+C,kBAAkB,kBAAmB,CAAElK,OAAQR,EAAWqC,aAE9E,CACA,cAAAhD,CAAesB,GACX,GAAc,MAAVA,EACA,OAAO9jD,KAAKojD,YAAYt4C,IAAIg5C,IAAW,GAE3C,IAAIq6E,EAAQ,GACZ,IAAK,MAAMtgI,KAAKmC,KAAKojD,YAAY3gC,SAC7B07G,EAAQA,EAAMxuH,OAAO9R,GAEzB,OAAOsgI,CACX,CACA,iBAAA5E,GACI,OAAOv5H,KAAKojD,WAChB,CACA,oBAAMs9D,CAAe8a,EAAmBz6H,EAAU,CAAC,GAC/C,IAAKf,KAAK4sD,YACN,MAAM,IAAI,GAAU,cAAe,GAAMiyE,sBAE7C99H,EAAQigD,QAAQC,iBAChB,MAAM,OAAE6C,GAAW+yE,GAAe2E,GAClC,GAAc,MAAV13E,IAAoC,IAAlB/iD,EAAQ26H,MAAgB,CAC1C17H,KAAKpB,IAAI,UAAWklD,GACpB,MAAM23E,EAAqBz7H,KAAKwiD,eAAesB,GAC1Cv2B,MAAK0iC,IAASA,EAAK6uE,YACxB,GAA0B,MAAtBrD,EAGA,OAFAz7H,KAAKpB,IAAI,iDAAkDklD,GAC3D/iD,EAAQokH,aAAa,IAAIhB,GAAoB,iCACtCsX,CAEf,CACA,MAAMt4E,QAAmBnjD,KAAK05H,UAAU/nE,KAAK6pE,EAAmB,IACzDz6H,EACHmmH,SAAUnmH,EAAQmmH,UAAYgV,KAElC,IAAI6C,EAAkB/+H,KAAKojD,YAAYt4C,IAAIq4C,EAAWqC,YAC/B,MAAnBu5E,IACAA,EAAkB,GAClB/+H,KAAKojD,YAAYr4C,IAAIo4C,EAAWqC,WAAYu5E,IAKhD,IAAIC,GAAoB,EACxB,IAAK,MAAM/uE,KAAQ8uE,EACX9uE,EAAK3uC,KAAO6hC,EAAW7hC,KACvB09G,GAAoB,GAM5B,OAHKA,GACDD,EAAgBzhI,KAAK6lD,GAElBA,CACX,CACA,sBAAM87E,CAAiBn7E,EAAQ/iD,EAAU,CAAC,GACtC,MAAMqiD,EAAcpjD,KAAKojD,YAAYt4C,IAAIg5C,IAAW,SAC9ChoD,QAAQ2lD,IAAI2B,EAAY13C,KAAIq/B,MAAOoY,IACrC,UACUA,EAAWi0D,MAAMr2G,EAC3B,CACA,MAAO9E,GACHknD,EAAW+gB,MAAMjoE,EACrB,KAER,CACA,8BAAMijI,CAAyBza,GAK3B,GAHuBzkH,KAAKw9H,KAAKz5E,MAAK6sD,GAC3B6T,EAAOtM,WAAW15G,WAAWwzB,WAAW2+E,EAAGnyG,cAIlD,OADAuB,KAAKpB,IAAI,0EAA2E6lH,EAAOtM,aACpF,EAMX,GAHwBn4G,KAAKq6H,MAAMt2E,MAAK6sD,GAC7B6T,EAAOtM,WAAW15G,WAAWwzB,WAAW2+E,EAAGnyG,cAIlD,OADAuB,KAAK09H,8BACE,EAGX,GAAI19H,KAAK09H,6BAA+B19H,KAAKy9H,8BAEzC,OADAz9H,KAAKpB,IAAI,2EAA4E6lH,EAAOtM,aACrF,EAEX,GAAIsM,EAAOtM,WAAWj8C,qBAAsB,CACxC,MAAMxB,EAAO+pD,EAAOtM,WAAWl8C,cAAchE,QAC7C,UACUj4D,KAAK49H,6BAA6BzhF,QAAQue,EAAM,EAC1D,CACA,MAEI,OADA16D,KAAKpB,IAAI,8EAA+E6lH,EAAOtM,WAAYz9C,IACpG,CACX,CACJ,CACA,OAAI16D,KAAKwiD,iBAAiB9mD,OAASsE,KAAKo6H,gBACpCp6H,KAAK09H,8BACE,IAEX19H,KAAKpB,IAAI,uDAAwD6lH,EAAOtM,aACjE,EACX,CACA,mBAAAgnB,GACIn/H,KAAK09H,4BACT,CACA,YAAA/D,GACI,MAAMyF,EAAY,CACd7pG,OAAQ,SACR0iG,QAAS,SACToH,QAAS,QACTC,SAAU,WAEd,OAAOt/H,KAAK05H,UAAUlrH,MAAMA,MAAM9C,KAAIs8G,IAC3B,CACH1mG,GAAI0mG,EAAI1mG,GACR9f,OAAQ49H,EAAUpX,EAAIxmH,QACtBsiD,OAAQkkE,EAAIjnH,QAAQ+iD,OACpBqtD,WAAY,IAAI6W,EAAIjnH,QAAQowG,YAAYzlG,KAAIklG,GAAM,GAAUA,QAGxE,CACA,gBAAM0sB,CAAW3rB,EAAW5wG,EAAU,CAAC,GACnC,OAAOf,KAAK05H,UAAU4D,WAAW3rB,EAAW5wG,EAChD,EEpZG,MAAMw+H,GACTC,cACAC,SACAC,UACAC,SACAC,SACAC,aACA,WAAA/yH,CAAY8yH,GACR5/H,KAAK4/H,SAAWA,EAChB5/H,KAAKw/H,cAAgB,EACrBx/H,KAAKy/H,SAAW,EAChBz/H,KAAK0/H,UAAY,EACjB1/H,KAAK2/H,SAAW,CACpB,CACA,KAAAG,CAAM7iI,EAAG8iI,GACL,OAAO,EAAKvjI,KAAKwjI,MAAM/iI,EAAI8iI,GAAM//H,KAAK4/H,SAC1C,CACA,IAAAtiI,CAAKmC,EAAOk/D,EAAOz0D,KAAKoqC,OACpB,GAAyB,MAArBt0C,KAAK6/H,aAAsB,CAE3B,MAAMxlG,EAAIr6B,KAAK8/H,MAAMnhE,EAAM3+D,KAAK6/H,cAC1B54H,EAAOxH,EAAQO,KAAKw/H,cACpBS,EAAO5lG,EAAIpzB,EACjBjH,KAAKw/H,cAAgBnlG,EAAI56B,GAAS,EAAI46B,GAAKr6B,KAAKw/H,cAEhDx/H,KAAKy/H,UAAY,EAAIplG,IAAMr6B,KAAKy/H,SAAWx4H,EAAOg5H,GAClDjgI,KAAK0/H,UAAYljI,KAAKyzE,KAAKjwE,KAAKy/H,UAEhCz/H,KAAK2/H,SAAW3/H,KAAKw/H,cAAgBnlG,EAAIpzB,CAC7C,MAEIjH,KAAKw/H,cAAgB//H,EAEzBO,KAAK6/H,aAAelhE,CACxB,EClCG,MAAMuhE,GACT14E,QACAC,QACAv5C,KACA8vH,OACAmC,kBACAC,kBACAC,WACA,WAAAvzH,CAAY9B,EAAO,CAAC,GAChBhL,KAAKwnD,QAAU,IAAI+3E,GAAcv0H,EAAKsjD,UAAY,KAClDtuD,KAAKynD,QAAU,IAAI83E,GAAcv0H,EAAKsjD,UAAY,KAClDtuD,KAAKkO,KAAO,IAAIqxH,GAAcv0H,EAAKsjD,UAAY,KAC/CtuD,KAAKogI,kBAAoBp1H,EAAKo1H,mBAdI,EAelCpgI,KAAKmgI,kBAAoBn1H,EAAKm1H,mBAhBI,IAiBlCngI,KAAKqgI,WAAar1H,EAAKq1H,YAfI,IAgBJ,MAAnBr1H,EAAK8sH,aACL93H,KAAKg+H,OAAShzH,EAAKyhG,SAASsrB,oBAAoB/sH,EAAK8sH,YAE7D,CACA,gBAAAwI,CAAiBv/H,EAAU,CAAC,GAGxB,MAAMgrD,EAAUvvD,KAAKgU,IAAIhU,KAAK4G,MAAMpD,KAAKkO,KAAKsxH,eAAiBz+H,EAAQw/H,eAAiBvgI,KAAKmgI,oBAAqBngI,KAAKqgI,YACjHG,EAAcrpB,YAAYprD,QAAQA,GAClC00E,EAAgBxF,GAAU,CAACl6H,EAAQigD,OAAQw/E,IAIjD,OAFAC,EAAc1jI,MAAQmN,KAAKoqC,MAC3BmsF,EAAc10E,QAAUA,EACjB00E,CACX,CACA,OAAAld,CAAQviE,GACJ,MAAM2d,EAAOz0D,KAAKoqC,MAAQ0M,EAAOjkD,MAC7BikD,EAAO8J,SACP9qD,KAAKynD,QAAQnqD,KAAKqhE,GAClB3+D,KAAKkO,KAAK5Q,KAAKqhE,EAAO3+D,KAAKogI,mBAC3BpgI,KAAKg+H,QAAQrtH,OAAO,CAChB+vH,qBAAsB1gI,KAAKynD,QAAQ+3E,cACnCmB,iBAAkB3gI,KAAKynD,QAAQi4E,UAC/BkB,gBAAiB5gI,KAAKynD,QAAQk4E,SAC9BkB,gBAAiB7gI,KAAKynD,QAAQg4E,SAC9Bh4E,QAASkX,MAIb3+D,KAAKwnD,QAAQlqD,KAAKqhE,GAClB3+D,KAAKkO,KAAK5Q,KAAKqhE,GACf3+D,KAAKg+H,QAAQrtH,OAAO,CAChBmwH,qBAAsB9gI,KAAKwnD,QAAQg4E,cACnCuB,iBAAkB/gI,KAAKwnD,QAAQk4E,UAC/BsB,gBAAiBhhI,KAAKwnD,QAAQm4E,SAC9BsB,gBAAiBjhI,KAAKwnD,QAAQi4E,SAC9Bj4E,QAASmX,IAGrB,ECnDG,MAAMuiE,GACTz7E,SACAxB,WACArlD,IACAuiI,kBACAC,eACAC,gBACAt1E,QACA,WAAAj/C,CAAYm3C,EAAYj5C,EAAO,CAAC,GAC5BhL,KAAKikD,WAAaA,EAClBjkD,KAAKylD,SAAW,IAAIz6C,EAAK2rG,gBAZT,oBAahB32G,KAAKpB,IAAMqlD,EAAWxJ,OAAO2zD,aAAa,6BAC1CpuG,KAAKohI,eAAiBp2H,EAAKs2H,cAjBF,IAkBzBthI,KAAK+rD,QAAU,IAAIm0E,GAAgB,IAC3Bl1H,EAAKu2H,aAAe,CAAC,EACzB90B,QAASxoD,EAAWwoD,QACpBqrB,WAAY,oDAEpB,CACA,CAAC9pH,OAAO80B,aAAe,6BACvB,CAACi6D,IAAuB,CACpB,8BAEJ,KAAAhgG,GACIiD,KAAKqhI,gBAAkB,IAAI9jB,gBAC3Bv9G,KAAKmhI,kBAAoB5yE,aAAY,KACjCvuD,KAAKikD,WAAWI,kBAAkB7B,iBAAiB12C,SAAQmkD,IACvDn0D,QAAQC,UAAU+R,MAAKi9B,UACnB,IAAIhuC,EAAQmN,KAAKoqC,MACjB,IACI,MAAM0M,EAAShhD,KAAK+rD,QAAQu0E,iBAAiB,CACzCt/E,OAAQhhD,KAAKqhI,iBAAiBrgF,SAM5BwgF,EAAK/iC,SAJUxuC,EAAKzM,UAAUxjD,KAAKylD,SAAU,CAC/CzE,SACAy1D,0BAA0B,KAG9B15G,EAAQmN,KAAKoqC,YACPx4C,QAAQ2lD,IAAI,CACd+/E,EAAG96H,MAAM,GAzCjB,IAyC2C,CAC/Bs6C,WAEJwgF,EAAG/6H,KA5CX,GA4C6B,CACjBu6C,aAGRiP,EAAKwxE,IAAMv3H,KAAKoqC,MAAQv3C,QAClBykI,EAAG5iC,SAASwY,MAAM,CACpBp2D,UAER,CACA,MAAO/kD,GACH,GAAiB,6BAAbA,EAAIoQ,KACJ,MAAMpQ,EAMVg0D,EAAKwxE,KAAOv3H,KAAKoqC,MAAQv3C,GAAS,CACtC,KAEC8Q,OAAM5R,IACP+D,KAAKpB,IAAI8I,MAAM,8CAA+CzL,GAC9Dg0D,EAAKiU,MAAMjoE,EAAI,GACjB,GACJ,GACH+D,KAAKohI,eACZ,CACA,IAAA3zH,GACIzN,KAAKqhI,iBAAiBn9D,QACQ,MAA1BlkE,KAAKmhI,mBACLzyE,cAAc1uD,KAAKmhI,kBAE3B,EChFG,MAAMO,GACTC,QACAvrB,QACAnyD,WACA,WAAAn3C,CAAYm3C,EAAYj5C,GACpBhL,KAAK2hI,QAAU32H,EAAK22H,SAAW,GAC/B3hI,KAAKo2G,SAAU,EACfp2G,KAAKikD,WAAaA,CACtB,CACA,CAACj2C,OAAO80B,aAAe,0BACvB,SAAA8pB,GACI,OAAO5sD,KAAKo2G,OAChB,CACA,WAAMr5G,GACFiD,KAAKo2G,SAAU,CACnB,CACA,UAAM3oG,GACFzN,KAAKo2G,SAAU,CACnB,CAIA,mBAAOwrB,CAAc71H,EAAKhL,EAAU,CAAC,GACjC,GAA4B,IAAxBf,KAAK2hI,QAAQjmI,OACb,MAAM,IAAI,GAAU,+BAAgC,GAAM+gI,0BAE9D,MAAMzyH,EAAOhK,KACP6hI,EAAO,IAAI5b,GACjB,UAAW,MAAMrjE,KAAQ,MAAS54C,EAAK23H,QAAQj2H,KAAIo2H,GAAUA,EAAOF,cAAc71H,EAAKhL,MAGvE,MAAR6hD,IAIAA,EAAKuuD,WAAWz1G,OAAS,SACnBsE,KAAKikD,WAAWK,UAAUhoC,MAAMsmC,EAAKthC,GAAI,CAC3C6vF,WAAYvuD,EAAKuuD,aAIrB0wB,EAAKlzH,IAAIi0C,EAAKthC,MAGlBugH,EAAKz6G,IAAIw7B,EAAKthC,UACRshC,GAEd,CAKA,aAAMm/E,CAAQh2H,EAAKhL,EAAU,CAAC,GAC1B,GAA4B,IAAxBf,KAAK2hI,QAAQjmI,OACb,MAAM,IAAI,GAAU,+BAAgC,GAAM+gI,gCAExD3gI,QAAQ2lD,IAAIzhD,KAAK2hI,QAAQj2H,KAAIq/B,MAAO+2F,UAChCA,EAAOC,QAAQh2H,EAAKhL,EAAQ,IAE1C,CAIA,SAAMqtH,CAAIriH,EAAKtM,EAAOsB,GAClB,IAAKf,KAAK4sD,YACN,MAAM,IAAI,GAAU1b,GAAS8wF,gBAAiB,GAAMnD,4BAElD/iI,QAAQ2lD,IAAIzhD,KAAK2hI,QAAQj2H,KAAIq/B,MAAO+2F,UAChCA,EAAO1T,IAAIriH,EAAKtM,EAAOsB,EAAQ,IAE7C,CAKA,SAAM+J,CAAIiB,EAAKhL,GACX,IAAKf,KAAK4sD,YACN,MAAM,IAAI,GAAU1b,GAAS8wF,gBAAiB,GAAMnD,sBAExD,OAAO/iI,QAAQyxD,IAAIvtD,KAAK2hI,QAAQj2H,KAAIq/B,MAAO+2F,GAChCA,EAAOh3H,IAAIiB,EAAKhL,KAE/B,ECnFG,MAAMkhI,GACTC,GACAvqH,EACA2G,KACA,WAAAxR,CAAYvK,EAAKyJ,EAAMsS,EAAM6jH,EAAkB,GAC3C,GAAIA,EANwB,GAOxB,MAAM,IAAI71H,UAAU,4BAExB,MAAM81H,EAAMp2H,EAAKq2H,MAAM9/H,EAAK+b,GACtB4jH,EAAK,EAAgBC,GAC3B,IAAK,IAAIvlI,EAAI,EAAGA,EAAIslI,EAAGxmI,OAAQkB,IAC3BslI,EAAGtlI,GAAKwlI,EAAIxlI,GAEE,IAAdslI,EAAGxmI,SACHwmI,EAAG,GAAK,GAEZliI,KAAKkiI,GAAKA,EACVliI,KAAK2X,EAAI3L,EACThM,KAAKse,KAAOA,CAChB,CACA,IAAAtS,GACI,OAAOhM,KAAK2X,EAAE3L,KAAKhM,KAAKkiI,GAAIliI,KAAKse,KACrC,CACA,MAAA4tB,CAAOC,GACH,OAAMA,GAAO+1F,cAAcvgI,YAGpB,GAAiB3B,KAAKkiI,GAAI/1F,EAAM+1F,GAC3C,EC/BG,SAASI,GAAa5tG,EAAKlkB,GAC9B,OAAOhU,KAAKmD,MAAMnD,KAAK4oD,UAAY50C,EAAMkkB,IAAQA,CACrD,CCAO,MAAM6tG,GACTphI,SACA,WAAA2L,CAAY5G,GACRlG,KAAKmB,SAAW,IAAI3F,MAAM0K,GAAMuvC,KAAK,KACzC,CACA,GAAA9mC,CAAI6zH,GACA,KAAMA,aAAuBP,IACzB,MAAM,IAAI31H,UAAU,uBAExB,OAAOtM,KAAKmB,SAAS4iD,MAAMm+E,GAChBM,EAAYt2F,OAAOg2F,IAElC,CACA,GAAA96G,CAAIo7G,GACA,KAAMA,aAAuBP,IACzB,MAAM,IAAI31H,UAAU,uBAExB,IAAK,IAAI1P,EAAI,EAAGA,EAAIoD,KAAKmB,SAASzF,OAAQkB,IACtC,GAAwB,MAApBoD,KAAKmB,SAASvE,GAEd,OADAoD,KAAKmB,SAASvE,GAAK4lI,GACZ,EAGf,OAAO,CACX,CACA,IAAAnoD,CAAKmoD,GACD,KAAMA,aAAuBP,IACzB,MAAM,IAAI31H,UAAU,uBAExB,MAAM1P,EAAI0lI,GAAa,EAAGtiI,KAAKmB,SAASzF,OAAS,GAC3CinC,EAAU3iC,KAAKmB,SAASvE,GAE9B,OADAoD,KAAKmB,SAASvE,GAAK4lI,EACZ7/F,CACX,CACA,MAAAj1B,CAAO80H,GACH,KAAMA,aAAuBP,IACzB,MAAM,IAAI31H,UAAU,uBAExB,MAAMsgB,EAAQ5sB,KAAKmB,SAASshI,WAAWP,GAC5BM,EAAYt2F,OAAOg2F,KAE9B,OAAIt1G,GAAS,IACT5sB,KAAKmB,SAASyrB,GAAS,MAChB,EAKf,EC/CJ,MAAM81G,GAAa,CAClB,GAAI,UACJ,GAAI,eACJ,IAAK,6BACL,IAAK,qDACL,IAAK,0GACL,KAAM,gNAGDC,GAAc,CACnB,GAAI,YACJ,GAAI,sBACJ,IAAK,yCACL,IAAK,gFACL,IAAK,4JACL,KAAM,kSAGDC,GAAgB,IAAIlnH,WAAWiuB,sCClB9B,MAQM,GAAQ,CACjB39B,KAAO8G,GACIpT,OD4CA,SAAeD,GAAO,KAACyG,EAAO,GAAE,WAAE28H,GAAc,CAAC,GAC/D,IAAKH,GAAWx8H,GACf,MAAM,IAAIlI,MAAM,mEAGjB,GAAqB,iBAAVyB,EAAoB,CAC9B,GAAIojI,EACH,OA5BH,SAAyBzmI,EAAQ8J,EAAM28H,GACtC,GAA0B,IAAtBA,EAAWnnI,OACd,MAAM,IAAIsC,MAAM,gEAGjB,MAAM8kI,EAAWJ,GAAWx8H,GAC5B,IAAI8F,EAAO22H,GAAYz8H,GACnB68H,EAAY3mI,EAEhB,KAAO2mI,EAAUrnI,OAAS,GAAG,CAC5B,MAAMyS,EAASy0H,GAAcI,WAAWD,EAAWF,GACnDE,EAAYA,EAAUtlI,MAAM0Q,EAAO1H,MACnC,IAAK,IAAI7K,EAAQ,EAAGA,EAAQuS,EAAO05B,QAASjsC,IAC3CoQ,GAAQg4B,OAAO6+F,EAAWjnI,IAC1BoQ,EAAOg4B,OAAOi/F,QAAQ/8H,EAAM8F,EAAO82H,EAErC,CAEA,OAAO92H,CACR,CASUk3H,CAAgBzjI,EAAOyG,EAAM28H,GAGrCpjI,EAAQmjI,GAAc/lI,OAAO4C,EAC9B,CAEA,OA/CD,SAAyByrH,EAAYhlH,GACpC,MAAM48H,EAAWJ,GAAWx8H,GAC5B,IAAI8F,EAAO22H,GAAYz8H,GAGvB,IAAK,IAAItK,EAAQ,EAAGA,EAAQsvH,EAAWxvH,OAAQE,IAC9CoQ,GAAQg4B,OAAOknF,EAAWtvH,IAC1BoQ,EAAOg4B,OAAOi/F,QAAQ/8H,EAAM8F,EAAO82H,GAGpC,OAAO92H,CACR,CAoCQm3H,CAAgB1jI,EAAOyG,EAC/B,CC1DsBk9H,CAAUtwH,EAAO,CAC3B5M,KAAM,MAGdm8H,MAAO,CAACvvH,EAAOwL,IAIZ,SAAwB8rB,GAC3B,IAAI7yB,EAAM6yB,EAAI3rC,SAAS,IAIvB,OAHI8Y,EAAI7b,OAAS,GAAM,IACnB6b,EAAM,IAAIA,KAEP,GAAqBA,EAAK,SACrC,CATe8rH,CAAe,GAAMr3H,KAAK8G,EAAOwL,KCZzC,MAAMglH,GACTC,WACAC,WACArB,gBACAsB,QACAlxH,MACAvG,KACAsS,KACA,WAAAxR,CAAY9B,GACRhL,KAAKwjI,WAAax4H,EAAKw4H,WACvBxjI,KAAKujI,WAAav4H,EAAKu4H,YAAc,EACrCvjI,KAAKmiI,gBAAkBn3H,EAAKm3H,iBAAmB,EAC/CniI,KAAKuS,MAAQ,EACbvS,KAAKyjI,QAAU,GACfzjI,KAAKgM,KAAOhB,EAAKgB,MAAQ,GACzBhM,KAAKse,KAAOtT,EAAKsT,MAAQgkH,GAAa,EAAG9lI,KAAK+G,IAAI,EAAG,IACzD,CACA,GAAA6jB,CAAIs6B,GACoB,iBAATA,IACPA,EAAO,GAAqBA,IAEhC,MAAM8gF,EAAc,IAAIP,GAAYvgF,EAAM1hD,KAAKgM,KAAMhM,KAAKse,KAAMte,KAAKmiI,iBAC/D/kI,EAAI4C,KAAKgM,KAAKA,KAAK01C,EAAM1hD,KAAKse,MAAQte,KAAKwjI,WAC3C/mH,GAAKrf,EAAIolI,EAAYx2H,QAAUhM,KAAKwjI,WAO1C,GANuB,MAAnBxjI,KAAKyjI,QAAQrmI,KACb4C,KAAKyjI,QAAQrmI,GAAK,IAAImlI,GAAOviI,KAAKujI,aAEf,MAAnBvjI,KAAKyjI,QAAQhnH,KACbzc,KAAKyjI,QAAQhnH,GAAK,IAAI8lH,GAAOviI,KAAKujI,aAElCvjI,KAAKyjI,QAAQrmI,GAAGgqB,IAAIo7G,IAAgBxiI,KAAKyjI,QAAQhnH,GAAG2K,IAAIo7G,GAExD,OADAxiI,KAAKuS,SACE,EAEX,MAAMmxH,EAAO,CAACtmI,EAAGqf,GACjB,IAAI7f,EAAI8mI,EAAKpB,GAAa,EAAGoB,EAAKhoI,OAAS,IACpB,MAAnBsE,KAAKyjI,QAAQ7mI,KACboD,KAAKyjI,QAAQ7mI,GAAK,IAAI2lI,GAAOviI,KAAKujI,aAEtC,IAAK,IAAIjnI,EAAI,EAAGA,EAxCD,IAwCqBA,IAAK,CACrC,MAAMqnI,EAAU3jI,KAAKyjI,QAAQ7mI,GAAGy9E,KAAKmoD,GACrC,GAAe,MAAXmB,IAGJ/mI,GAAKA,EAAI+mI,EAAQ33H,QAAUhM,KAAKwjI,WACT,MAAnBxjI,KAAKyjI,QAAQ7mI,KACboD,KAAKyjI,QAAQ7mI,GAAK,IAAI2lI,GAAOviI,KAAKujI,aAElCvjI,KAAKyjI,QAAQ7mI,GAAGwqB,IAAIu8G,IAEpB,OADA3jI,KAAKuS,SACE,CAKf,CACA,OAAO,CACX,CACA,GAAA5D,CAAI+yC,GACoB,iBAATA,IACPA,EAAO,GAAqBA,IAEhC,MAAM8gF,EAAc,IAAIP,GAAYvgF,EAAM1hD,KAAKgM,KAAMhM,KAAKse,KAAMte,KAAKmiI,iBAC/D/kI,EAAI4C,KAAKgM,KAAKA,KAAK01C,EAAM1hD,KAAKse,MAAQte,KAAKwjI,WAC3CI,EAAM5jI,KAAKyjI,QAAQrmI,IAAIuR,IAAI6zH,KAAgB,EACjD,GAAIoB,EACA,OAAOA,EAEX,MAAMnnH,GAAKrf,EAAIolI,EAAYx2H,QAAUhM,KAAKwjI,WAC1C,OAAOxjI,KAAKyjI,QAAQhnH,IAAI9N,IAAI6zH,KAAgB,CAChD,CACA,MAAA90H,CAAOg0C,GACiB,iBAATA,IACPA,EAAO,GAAqBA,IAEhC,MAAM8gF,EAAc,IAAIP,GAAYvgF,EAAM1hD,KAAKgM,KAAMhM,KAAKse,KAAMte,KAAKmiI,iBAC/D/kI,EAAI4C,KAAKgM,KAAKA,KAAK01C,EAAM1hD,KAAKse,MAAQte,KAAKwjI,WAC3CI,EAAM5jI,KAAKyjI,QAAQrmI,IAAIsQ,OAAO80H,KAAgB,EACpD,GAAIoB,EAEA,OADA5jI,KAAKuS,QACEqxH,EAEX,MAAMnnH,GAAKrf,EAAIolI,EAAYx2H,QAAUhM,KAAKwjI,WACpCK,EAAM7jI,KAAKyjI,QAAQhnH,IAAI/O,OAAO80H,KAAgB,EAIpD,OAHIqB,GACA7jI,KAAKuS,QAEFsxH,CACX,CACA,YAAIC,GACA,OAAOtnI,KAAKmD,MAAaK,KAAKuS,MAAQvS,KAAKwjI,WAAzB,MAAyC,EAC/D,EAGJ,MAAMO,GAAW,CACb,EAAG,GACH,EAAG,IACH,EAAG,IACH,EAAG,KAWA,SAASC,GAASC,EAAUC,EAAY,MAG3C,MAAMX,EAZV,SAA6BW,EAAY,MACrC,OAAIA,EAAY,KACL,EAEPA,EAAY,KACL,EAEJ,CACX,CAIuBC,CAAoBD,GACjCv8H,EAAOo8H,GAASR,GAItB,MAAO,CACHC,WAHehnI,KAAK4G,MAAM6gI,EAAWt8H,GAIrC47H,aACApB,gBAJoB3lI,KAAKk4B,IAAIl4B,KAAKC,KAAKD,KAAK4nI,KAAK,EAAIF,GAAa1nI,KAAK4nI,KAAK,EAAIb,ILxHpD,IK8HpC,CC5HO,MAAMc,GACTb,WACAD,WACApB,gBACAmC,MACAC,aACAv4H,KACAsS,KACA,WAAAxR,CAAY9B,GACRhL,KAAKujI,WAAav4H,EAAKu4H,YAAc,EACrCvjI,KAAKwjI,WAAax4H,EAAKw4H,aAAe,GAAK,IAAMxjI,KAAKujI,WACtDvjI,KAAKmiI,gBAAkBn3H,EAAKm3H,iBAAmB,EAC/CniI,KAAKskI,MAAQt5H,EAAKs5H,OAAS,EAC3BtkI,KAAKgM,KAAOhB,EAAKgB,MAAQ,GACzBhM,KAAKse,KAAOtT,EAAKsT,MAAQgkH,GAAa,EAAG9lI,KAAK+G,IAAI,EAAG,KACrDvD,KAAKukI,aAAe,CAChB,IAAIjB,GAAa,CACbE,WAAYxjI,KAAKwjI,WACjBD,WAAYvjI,KAAKujI,WACjBpB,gBAAiBniI,KAAKmiI,gBACtBn2H,KAAMhM,KAAKgM,KACXsS,KAAMte,KAAKse,OAGvB,CACA,GAAA8I,CAAIs6B,GAIA,GAHoB,iBAATA,IACPA,EAAO,GAAqBA,IAE5B1hD,KAAK2O,IAAI+yC,GACT,OAAO,EAEX,IAAI/e,EAAU3iC,KAAKukI,aAAah3G,MAAMi3G,GAC3BA,EAAOV,WAElB,GAAe,MAAXnhG,EAAiB,CACjB,MAAM8hG,EAAUzkI,KAAKwjI,WAAahnI,KAAK+G,IAAIvD,KAAKskI,MAAOtkI,KAAKukI,aAAa7oI,QACzEinC,EAAU,IAAI2gG,GAAa,CACvBE,WAAYiB,EACZlB,WAAYvjI,KAAKujI,WACjBpB,gBAAiBniI,KAAKmiI,gBACtBn2H,KAAMhM,KAAKgM,KACXsS,KAAMte,KAAKse,OAEfte,KAAKukI,aAAajnI,KAAKqlC,EAC3B,CACA,OAAOA,EAAQvb,IAAIs6B,EACvB,CACA,GAAA/yC,CAAI+yC,GACoB,iBAATA,IACPA,EAAO,GAAqBA,IAEhC,IAAK,IAAI9kD,EAAI,EAAGA,EAAIoD,KAAKukI,aAAa7oI,OAAQkB,IAC1C,GAAIoD,KAAKukI,aAAa3nI,GAAG+R,IAAI+yC,GACzB,OAAO,EAGf,OAAO,CACX,CACA,MAAAh0C,CAAOg0C,GACiB,iBAATA,IACPA,EAAO,GAAqBA,IAEhC,IAAK,IAAI9kD,EAAI,EAAGA,EAAIoD,KAAKukI,aAAa7oI,OAAQkB,IAC1C,GAAIoD,KAAKukI,aAAa3nI,GAAG8Q,OAAOg0C,GAC5B,OAAO,EAGf,OAAO,CACX,CACA,SAAInvC,GACA,OAAOvS,KAAKukI,aAAan8F,QAAO,CAAC8P,EAAKjuC,IAC3BiuC,EAAMjuC,EAAKsI,OACnB,EACP,ECNJ,MAAM,GAAcmJ,WAAWoyC,aAAes2D,MCnEvC,MAAMsgB,GACT9lI,IACAklD,OACAQ,UACAq9E,QACA,WAAA70H,CAAYm3C,EAAYj5C,EAAO,CAAC,GAC5BhL,KAAKpB,IAAMqlD,EAAWxJ,OAAO2zD,aAAa,uBAC1CpuG,KAAK8jD,OAASG,EAAWH,OACzB9jD,KAAKskD,UAAYL,EAAWK,UAC5BtkD,KAAK2hI,QAAU32H,EAAK22H,SAAW,EACnC,CACA,CAAC3zH,OAAO80B,aAAe,uBAIvB,cAAM05F,CAASl7G,EAAIvgB,GACf,GAA4B,IAAxBf,KAAK2hI,QAAQjmI,OACb,MAAM,IAAI,GAAU,4BAA6B,GAAM+gI,0BAE3D,GAAIn7G,EAAG7iB,aAAeuB,KAAK8jD,OAAOrlD,WAC9B,MAAM,IAAI,GAAU,8BAA+B,GAAMkmI,eAE7D,MAAM36H,EAAOhK,KACPxB,EAAS,MAASwB,KAAK2hI,QAAQj2H,KAAIo2H,GAAU,kBAC/C,gBACgBA,EAAOtF,SAASl7G,EAAIvgB,EACpC,CACA,MAAO9E,GACH+N,EAAKpL,IAAI8I,MAAMzL,EACnB,CACH,CAPkD,MAQnD,UAAW,MAAM2mD,KAAQpkD,EACrB,GAAY,MAARokD,EASJ,OALIA,EAAKuuD,WAAWz1G,OAAS,SACnBsE,KAAKskD,UAAUhoC,MAAMsmC,EAAKthC,GAAI,CAChC6vF,WAAYvuD,EAAKuuD,aAGlBvuD,EAEX,MAAM,IAAI,GAAU1R,GAAS0zF,UAAW,GAAMtI,cAClD,CAIA,qBAAOuI,CAAgB94H,EAAKhL,EAAU,CAAC,GACnC,GAA4B,IAAxBf,KAAK2hI,QAAQjmI,OACb,MAAM,IAAI,GAAU,4BAA6B,GAAM+gI,0BAE3D,MAAMzyH,EAAOhK,KACP6hI,EFsBP,SAAoCoC,EAAUC,EAAY,KAAOnjI,GACpE,OAAO,IAAIsjI,GAAqB,IACzBL,GExBqC,KFwBlBE,MAClBnjI,GAAW,CAAC,GAExB,CE3BqB+jI,GACb,UAAW,MAAMliF,KDmBV7X,gBAAyBvsC,EAAQuC,EAAU,CAAC,GACvD,IAAI4mH,EAAc5mH,EAAQ4mH,aAAe9jH,IACrC8jH,EAAc,IACdA,EAAc9jH,KAElB,MAAMkhI,EAA6B,MAAnBhkI,EAAQgkI,SAA0BhkI,EAAQgkI,QACpD71H,EAAU,IAAIy+C,YACdq3E,EAAM,GACZ,IAGIC,EAHAC,EAAgB,KAChBC,EAAkB,KAClBC,GAAiB,EAEjBC,GAAU,EAsCd,SAASC,IACL,OAAIP,EACOC,EAAI,IAAI33H,KAEZ8Z,QAAQ69G,EAAIz3G,MAAKg4G,GAAMA,EAAGl4H,OACrC,CACA,SAAUm4H,IACN,KAAQR,EAAItpI,OAAS,GAAMspI,EAAI,GAAG33H,MAAM,CACpC,MAAMk4H,EAAKP,EAAI,GAEf,GADAA,EAAIn/H,SACA0/H,EAAGE,GAOH,MAFAJ,GAAU,EACVH,EAAcnpI,UACRwpI,EAAGtpI,UANHspI,EAAG9lI,MAQbylI,EAAcnpI,SAClB,CACJ,CACA,SAAU2pI,IAGN,KAAOJ,KACH,IAAK,IAAI1oI,EAAI,EAAGA,EAAIooI,EAAItpI,OAAQkB,IAC5B,GAAIooI,EAAIpoI,GAAGyQ,KAAM,CACb,MAAMk4H,EAAKP,EAAIpoI,GAGf,GAFAooI,EAAIzkI,OAAO3D,EAAG,GACdA,KACI2oI,EAAGE,GAMH,MAFAJ,GAAU,EACVH,EAAcnpI,UACRwpI,EAAGtpI,UALHspI,EAAG9lI,MAObylI,EAAcnpI,SAClB,CAGZ,CACA,IAjFAmT,EAAQiyC,iBAAiB,iBAAiB,KACtCgkF,EAAgBppI,SAAS,IAExBD,QAAQC,UAAU+R,MAAKi9B,UACxB,IACI,UAAW,MAAM46F,KAAQnnI,EAAQ,CAK7B,GAJIwmI,EAAItpI,SAAWisH,IACfud,EAAgB,WACVA,EAAc1lF,SAEpB6lF,EACA,MAEJ,MAAME,EAAK,CACPl4H,MAAM,GAEV23H,EAAI1nI,KAAKioI,GACTI,IACK73H,MAAKK,IACNo3H,EAAGl4H,MAAO,EACVk4H,EAAGE,IAAK,EACRF,EAAG9lI,MAAQ0O,EACXe,EAAQ0+C,cAAc,IAAI,GAAY,iBAAiB,IACxD3xD,IACCspI,EAAGl4H,MAAO,EACVk4H,EAAGtpI,IAAMA,EACTiT,EAAQ0+C,cAAc,IAAI,GAAY,iBAAiB,GAE/D,CACAw3E,GAAiB,EACjBl2H,EAAQ0+C,cAAc,IAAI,GAAY,iBAC1C,CACA,MAAO3xD,GACHgpI,EAAYhpI,EACZiT,EAAQ0+C,cAAc,IAAI,GAAY,iBAC1C,OA8CS,CAKT,GAJK03E,MACDH,EAAkB,WACZA,EAAgB3lF,SAET,MAAbylF,EAEA,MAAMA,EAQV,GANIF,QACOS,UAGAE,IAEPN,GAAiC,IAAfJ,EAAItpI,OAEtB,KAER,CACJ,CCrIiCkqI,CAAS76F,kBAC9B,MAAMvsC,EAAS,MAASwL,EAAK23H,QAAQj2H,KAAIo2H,GAAUA,EAAO+C,gBAAgB94H,EAAKhL,MAC/E,UAAW,IAAI6hD,KAAQpkD,QACbusC,UAEF,GAA+B,IAA3B6X,EAAKuuD,WAAWz1G,OAChB,IACIknD,QAAa54C,EAAKwyH,SAAS55E,EAAKthC,GAAI,IAC7BvgB,EACH8kI,UAAU,GAElB,CACA,MAAO5pI,GAEH,YADA+N,EAAKpL,IAAI8I,MAAM,iCAAkCzL,EAErD,CAEJ,OAAO2mD,CAAI,CAGvB,CApBkC7X,IAqBlB,MAAR6X,IAIAA,EAAKuuD,WAAWz1G,OAAS,SACnBsE,KAAKskD,UAAUhoC,MAAMsmC,EAAKthC,GAAI,CAChC6vF,WAAYvuD,EAAKuuD,aAIrB0wB,EAAKlzH,IAAIi0C,EAAKthC,GAAGizB,aAGrBstF,EAAKz6G,IAAIw7B,EAAKthC,GAAGizB,iBACXqO,GAEd,EC1FG,MAAMkjF,WAAmBp4E,GAC5B6uE,YACA39H,IACAmnI,QACAC,QACAC,mBACAC,eACAC,SACA,WAAAr5H,CAAYm3C,GACRlW,QACA/tC,KAAKpB,IAAMqlD,EAAWxJ,OAAO2zD,aAAa,sBAC1CpuG,KAAKu8H,YAAct4E,EAAWs4E,YAC9Bv8H,KAAKgmI,QAAU,EACfhmI,KAAK+lI,SAAU,EAEf/lI,KAAKimI,mBAAqB,IAAI1oB,gBACJv9G,KAAKimI,mBAAmBjlF,MACtD,CACA,CAAChzC,OAAO80B,aAAe,sBACvB,KAAA/lC,GACIiD,KAAKimI,mBAAqB,IAAI1oB,gBACJv9G,KAAKimI,mBAAmBjlF,MACtD,CACA,IAAAvzC,GACIzN,KAAKimI,mBAAmB/hE,OAC5B,CACA,UAAOkiE,CAAKrlI,GACHf,KAAK+lI,SAEN/lI,KAAKqmI,YAETrmI,KAAKgmI,UACL,MAAMhlF,EAASi6E,GAAU,CAACj7H,KAAKimI,mBAAmBjlF,OAAQjgD,GAASigD,SAEnE,IACI,OAAa,CAEThhD,KAAKmmI,UAAUpqI,UACfiE,KAAKmmI,SAAW5mF,KAEhB,MAAM9wC,QAAcwoH,GAAUj3H,KAAM,YAAaghD,EAAQ,CACrDq2E,WAAY,qBAEV5oH,EAAMk1C,MAChB,CACJ,CACA,QACI3C,EAAOpwC,QACP5Q,KAAKgmI,UAEgB,IAAjBhmI,KAAKgmI,UACLhmI,KAAKkmI,gBAAgBhiE,QACrBlkE,KAAKkmI,oBAAiBnoI,EAE9B,CACJ,CACA,SAAAsoI,GACIrmI,KAAK+lI,SAAU,EAGf/lI,KAAKkmI,eAAiB,IAAI3oB,gBACAv9G,KAAKkmI,eAAellF,OAC9C,MAAMA,EAASi6E,GAAU,CAACj7H,KAAKkmI,eAAellF,OAAQhhD,KAAKimI,mBAAmBjlF,SAExEjkD,EAAQmN,KAAKoqC,MACnB,IAAI1nB,EAAQ,EACZ9wB,QAAQC,UAAU+R,MAAKi9B,UAGnB,IAFA/qC,KAAKpB,IAAI,cAEFoB,KAAKgmI,QAAU,GAClB,IACI,MAAM5nG,EAAO,GAAY,IACzB,IAAI7oB,EAAIrL,KAAKoqC,MACb,UAAW,MAAMsO,KAAQ5iD,KAAKu8H,YAAYsI,gBAAgBzmG,EAAM,CAAE4iB,WAC1DA,EAAO8J,SACP9qD,KAAKpB,IAAI,iBAEboiD,EAAOC,iBACPjhD,KAAKpB,IAAI,0CAA2CgkD,EAAKthC,GAAIpX,KAAKoqC,MAAQ/+B,EAAGvV,KAAKgmI,SAClFp5G,IACA5sB,KAAK6tD,kBAAkB,YAAa,CAChClK,OAAQf,IAIS,IAAjB5iD,KAAKgmI,SAAkC,MAAjBhmI,KAAKmmI,WAC3BnmI,KAAKpB,IAAI,4BACHs/F,GAAWl+F,KAAKmmI,SAAS3mF,QAASwB,IAE5CzrC,EAAIrL,KAAKoqC,MAEbt0C,KAAKpB,IAAI,gEAAiEw/B,EAAMp+B,KAAKgmI,QAASp5G,EAClG,CACA,MAAO3wB,GACH+D,KAAKpB,IAAI8I,MAAM,qBAAsBzL,GACrC+D,KAAK6tD,kBAAkB,aAAc,CACjClK,OAAQ1nD,GAEhB,CAEJ+D,KAAKpB,IAAI,8BAA8B,IAEtCiP,OAAM5R,IACP+D,KAAKpB,IAAI8I,MAAM,qBAAsBzL,EAAI,IAExCgvD,SAAQ,KACTjrD,KAAKpB,IAAI,2CAA4CguB,EAAO1iB,KAAKoqC,MAAQv3C,GACzEiD,KAAK+lI,SAAU,CAAK,GAE5B,EC3GG,MAAMO,GACT1nI,IACA2nI,WACA32H,SACAq0C,WACA,WAAAn3C,CAAYm3C,GACRjkD,KAAKpB,IAAMqlD,EAAWxJ,OAAO2zD,aAAa,oBAC1CpuG,KAAKumI,WAAa,IAAI96F,IACtBzrC,KAAK4P,SAAW,IAAI67B,IACpBzrC,KAAKikD,WAAaA,EAClBjkD,KAAKwmI,cAAgBxmI,KAAKwmI,cAAc1iI,KAAK9D,MAC7CA,KAAKymI,cAAgBzmI,KAAKymI,cAAc3iI,KAAK9D,MAC7CA,KAAK0mI,gBAAkB1mI,KAAK0mI,gBAAgB5iI,KAAK9D,MACjDA,KAAKikD,WAAWx0C,OAAO0xC,iBAAiB,kBAAmBnhD,KAAKwmI,eAChExmI,KAAKikD,WAAWx0C,OAAO0xC,iBAAiB,cAAenhD,KAAKymI,eAC5DzmI,KAAKikD,WAAWx0C,OAAO0xC,iBAAiB,gBAAiBnhD,KAAK0mI,gBAClE,CACA,CAAC14H,OAAO80B,aAAe,oBACvB,YAAA6jG,GACI,OAAOnrI,MAAMq/B,KAAK,IAAI0d,IAAI,IACnBv4C,KAAK4P,SAAS7Q,UACjB8lB,MACR,CACA,UAAA+hH,CAAWnhF,GACP,MAAMgkE,EAAUzpH,KAAK4P,SAAS9E,IAAI26C,GAClC,GAAe,MAAXgkE,EACA,MAAM,IAAI,GAAU,sCAAsChkE,IAAY,GAAMohF,6BAEhF,OAAOpd,CACX,CACA,aAAAqd,CAAcrhF,GACV,MAAM8gF,EAAavmI,KAAKumI,WAAWz7H,IAAI26C,GACvC,OAAkB,MAAd8gF,EACO,GAEJ,IACAA,EAAW9jH,SAEtB,CAIA,YAAM4kC,CAAO5B,EAAUgkE,EAASpkF,GAC5B,GAAIrlC,KAAK4P,SAASjB,IAAI82C,GAClB,MAAM,IAAI,GAAU,2CAA2CA,IAAY,GAAMshF,yCAErF,MAAMhmI,EAAU,GAAM+C,KAAK,CAAE+X,iBAAiB,GAA9B,CAAsC,CAClD0rC,kBApD+B,GAqD/B+uD,mBApDgC,IAqDjCjxE,GACHrlC,KAAK4P,SAAS7E,IAAI06C,EAAU,CACxBgkE,UACA1oH,kBAGEf,KAAKikD,WAAWK,UAAUhoC,MAAMtc,KAAKikD,WAAWH,OAAQ,CAC1DF,UAAW,CAAC6B,IAEpB,CAKA,cAAMsxD,CAASnzD,IACUpoD,MAAM+Y,QAAQqvC,GAAaA,EAAY,CAACA,IAChD93C,SAAQ25C,IACjBzlD,KAAK4P,SAASozC,OAAOyC,EAAS,UAG5BzlD,KAAKikD,WAAWK,UAAUyzD,MAAM/3G,KAAKikD,WAAWH,OAAQ,CAC1DF,UAAW5jD,KAAK2mI,gBAExB,CAIA,cAAMK,CAASvhF,EAAUwhF,GACrB,GAAgB,MAAZA,EACA,MAAM,IAAI,GAAU,mBAAoB,GAAM7c,wBAGlD,MAAM9oG,EAAK,IAAoB,IAAhB9kB,KAAK4oD,UAAgB3mD,SAAS,MAAMyL,KAAKoqC,QACxD,IAAIiyF,EAAavmI,KAAKumI,WAAWz7H,IAAI26C,GAMrC,OALkB,MAAd8gF,IACAA,EAAa,IAAI96F,IACjBzrC,KAAKumI,WAAWx7H,IAAI06C,EAAU8gF,IAElCA,EAAWx7H,IAAIuW,EAAI2lH,GACZ3lH,CACX,CAIA,UAAA4lH,CAAW5lH,GACP,IAAK,MAAOmkC,EAAU8gF,KAAevmI,KAAKumI,WAAW1nE,UAC7C0nE,EAAW53H,IAAI2S,KACfilH,EAAWvjF,OAAO1hC,GACM,IAApBilH,EAAWrgI,MACXlG,KAAKumI,WAAWvjF,OAAOyC,GAIvC,CAIA,aAAA+gF,CAAcpmI,GACV,MAAMolD,EAAaplD,EAAIujD,OAClB3jD,KAAKikD,WAAWK,UAAUx5C,IAAI06C,GAC9B13C,MAAK80C,IACN,IAAK,MAAM6C,KAAY7C,EAAKgB,UAAW,CACnC,MAAM2iF,EAAavmI,KAAKumI,WAAWz7H,IAAI26C,GACvC,GAAkB,MAAd8gF,EAIJ,IAAK,MAAMU,KAAYV,EAAW9jH,UACW,IAArCwkH,EAASvqH,QAAQ/N,IAAI62C,KAGzByhF,EAASvqH,QAAQhP,OAAO83C,GACxByhF,EAASnJ,eAAet4E,GAEhC,KAEC33C,OAAM5R,IACHA,EAAIoQ,OAAS,GAAMiwH,eAIvBt8H,KAAKpB,IAAI8I,MAAM,uDAAwD89C,EAAYvpD,EAAI,GAE/F,CAKA,aAAAwqI,CAAcrmI,GACV,MAAM,KAAEwiD,EAAI,SAAEsrE,GAAa9tH,EAAIujD,OACzBwjF,GAAWjZ,GAAUtqE,WAAa,IAAIlnC,QAAO+oC,IAAa7C,EAAKgB,UAAUjnC,SAAS8oC,KACxF,IAAK,MAAMA,KAAY0hF,EAAS,CAC5B,MAAMZ,EAAavmI,KAAKumI,WAAWz7H,IAAI26C,GACvC,GAAkB,MAAd8gF,EAIJ,IAAK,MAAMU,KAAYV,EAAW9jH,UACQ,IAAlCwkH,EAASvqH,QAAQ/N,IAAIi0C,EAAKthC,MAG9B2lH,EAASvqH,QAAQhP,OAAOk1C,EAAKthC,IAC7B2lH,EAASnJ,eAAel7E,EAAKthC,IAErC,CACJ,CAKA,eAAAolH,CAAgBtmI,GACZ,MAAMwjD,EAAYxjD,EAAIujD,OAAOC,UACvBT,EAAa/iD,EAAIujD,OAAOR,WACxBW,EAAS1jD,EAAIujD,OAAOG,OAC1B,IAAK,MAAM2B,KAAY7B,EAAW,CAC9B,MAAM2iF,EAAavmI,KAAKumI,WAAWz7H,IAAI26C,GACvC,GAAkB,MAAd8gF,EAIJ,IAAK,MAAMU,KAAYV,EAAW9jH,SAC1B0gC,EAAW27E,YAA4C,IAA/BmI,EAASG,oBAGA,IAAjCH,EAASvqH,QAAQ/N,IAAIm1C,KAGzBmjF,EAASvqH,QAAQ0K,IAAI08B,GACrBmjF,EAASpJ,YAAY/5E,EAAQX,GAErC,CACJ,EC5LJ,MAAMkkF,WAAmB57F,IACrBuyF,OACA,WAAAlxH,CAAY9B,GACR+iC,QACA,MAAM,KAAEliC,EAAI,QAAE4gG,GAAYzhG,EAC1BhL,KAAKg+H,OAASvxB,EAAQ66B,eAAez7H,GACrC7L,KAAKunI,uBACT,CACA,GAAAx8H,CAAIgB,EAAKtM,GAGL,OAFAsuC,MAAMhjC,IAAIgB,EAAKtM,GACfO,KAAKunI,wBACEvnI,IACX,CACA,OAAO+L,GACH,MAAMy7H,EAAUz5F,MAAMiV,OAAOj3C,GAE7B,OADA/L,KAAKunI,wBACEC,CACX,CACA,KAAA52H,GACIm9B,MAAMn9B,QACN5Q,KAAKunI,uBACT,CACA,qBAAAA,GACIvnI,KAAKg+H,OAAOrtH,OAAO3Q,KAAKkG,KAC5B,ECpBG,MAAMuhI,GACT7oI,IACAqlD,WACAyjF,WACApnI,UACAq2H,eACAvgB,QACA,WAAAtpG,CAAYm3C,EAAYj5C,EAAO,CAAC,GAC5BhL,KAAKpB,IAAMqlD,EAAWxJ,OAAO2zD,aAAa,qBAC1CpuG,KAAKikD,WAAaA,EAClBjkD,KAAKo2G,SAAU,EACfp2G,KAAK0nI,WAAa,IAAIj8F,IACtBzrC,KAAKM,UDUN,SAAoB+b,GACvB,MAAM,KAAExQ,EAAI,QAAE4gG,GAAYpwF,EAC1B,IAAI3Q,EAOJ,OALIA,EADW,MAAX+gG,EACM,IAAI46B,GAAW,CAAEx7H,OAAM4gG,YAGvB,IAAIhhE,IAEP//B,CACX,CCpByBi8H,CAAW,CACxB97H,KAAM,qCACN4gG,QAASzsG,KAAKikD,WAAWwoD,UAE7BzsG,KAAK22H,eAAiB3rH,EAAK2rH,gBAAkB/V,GAAegW,SAChE,CACA,CAAC5oH,OAAO80B,aAAe,4BAIvB,GAAA1b,CAAIqzC,GACA,MAAMnqB,EAAMmqB,EAAUzsD,OAAO80B,aAC7B,GAAW,MAAPwN,EACA,MAAM,IAAI,GAAU,kCAAmC,GAAMs3F,iBAEjE,GAAI5nI,KAAK0nI,WAAW/4H,IAAI2hC,GACpB,MAAM,IAAI,GAAU,6CAA6CA,IAAO,GAAMu3F,yBAElF7nI,KAAKpB,IAAI,sBAAuB0xC,GAChCtwC,KAAK0nI,WAAW38H,IAAIulC,EAAKmqB,GACpBz6D,KAAKM,UAAUqO,IAAI2hC,IACpBtwC,KAAKM,UAAUyK,IAAIulC,EAAK,GAEhC,CACA,SAAAsc,GACI,OAAO5sD,KAAKo2G,OAChB,CACA,KAAAr5G,GACIiD,KAAKo2G,SAAU,CACnB,CACA,gBAAM4a,GAEF,MAAMxB,EAAQxvH,KAAKikD,WAAWoyD,eAAega,uBACvCrwH,KAAKuO,OAAOihH,EACtB,CAIA,UAAM/hH,GACF,MAAM8wH,EAAQ,GACd,IAAK,MAAOxyH,EAAKzL,KAAcN,KAAKM,UAEhC,IADAN,KAAKpB,IAAI,2BAA4BmN,GAC9BzL,EAAU5E,OAAS,GAAG,CACzB,MAAMyT,EAAW7O,EAAUs7D,MACX,MAAZzsD,GAGJovH,EAAMjhI,KAAK6R,EAASioG,QACxB,OAEEt7G,QAAQ2lD,IAAI88E,GAClBv+H,KAAKpB,IAAI,wBACT,IAAK,MAAMmN,KAAO/L,KAAKM,UAAUvB,OAC7BiB,KAAKM,UAAUyK,IAAIgB,EAAK,IAE5B/L,KAAKo2G,SAAU,CACnB,CAIA,UAAMzkD,CAAKi/C,EAAI7vG,GACX,MAAM05D,EAAYz6D,KAAK+8H,0BAA0BnsB,GACjD,GAAiB,MAAbn2C,EACA,MAAM,IAAI,GAAU,sCAAsCl9D,OAAOqzG,KAAO,GAAMk3B,2BAElF/mI,GAASokH,aAAa,IAAIhB,GAAoB,uCAAwC1pD,EAAUzsD,OAAO80B,eACvG,IAII,aAAa23B,EAAU9I,KAAKi/C,EAAI,IACzB7vG,EACH8jH,SAAU7kH,KAAKikD,WAAW4gE,UAElC,CACA,MAAO5oH,GAIH,MAHgB,MAAZA,EAAIoQ,OACJpQ,EAAIoQ,KAAO,GAAM4vH,2BAEfhgI,CACV,CACJ,CAIA,QAAAk0H,GACI,IAAIX,EAAQ,GACZ,IAAK,MAAMlvH,KAAaN,KAAKM,UAAUmiB,SACnC,IAAK,MAAMtT,KAAY7O,EACnBkvH,EAAQ,IAAIA,KAAUrgH,EAASghH,YAGvC,OAAOX,CACX,CAIA,aAAAuY,GACI,OAAOvsI,MAAMwsI,MAAMhoI,KAAK0nI,WAAWjlH,SACvC,CAIA,YAAAwlH,GACI,OAAOzsI,MAAMwsI,MAAMhoI,KAAKM,UAAUmiB,UAAUgpC,MAChD,CAIA,yBAAAsxE,CAA0BnsB,GACtB,IAAK,MAAMn2C,KAAaz6D,KAAK0nI,WAAWjlH,SAEpC,GADcg4C,EAAU6qD,WAAW,CAAC1U,IAC1Bl1G,OAAS,EACf,OAAO++D,CAGnB,CAIA,2BAAAytE,CAA4Bt3B,GACxB,IAAK,MAAMn2C,KAAaz6D,KAAK0nI,WAAWjlH,SAEpC,GADcg4C,EAAU4qD,aAAa,CAACzU,IAC5Bl1G,OAAS,EACf,OAAO++D,CAGnB,CAIA,YAAMlsD,CAAOihH,GACT,IAAKxvH,KAAK4sD,YACN,MAAM,IAAI,GAAU,cAAe,GAAMiyE,sBAE7C,GAAa,MAATrP,GAAkC,IAAjBA,EAAM9zH,OAEvB,YADAsE,KAAKpB,IAAI,oEAGb,MAAMupI,EAAiB,GACvB,IAAK,MAAOp8H,EAAK0uD,KAAcz6D,KAAK0nI,WAAW7oE,UAAW,CACtD,MAAMupE,EAAiB3tE,EAAU4qD,aAAamK,GACxC+O,EAAQ,GAEd,IAAK,MAAM1lE,KAAQuvE,EAAgB,CAC/BpoI,KAAKpB,IAAI,iCAAkCmN,EAAK8sD,GAChD,MAAM1pD,EAAWsrD,EAAU2qD,eAAe,CACtCP,SAAU7kH,KAAKikD,WAAW4gE,WAE9B,IAAIvkH,EAAYN,KAAKM,UAAUwK,IAAIiB,IAAQ,GAC1B,MAAbzL,IACAA,EAAY,GACZN,KAAKM,UAAUyK,IAAIgB,EAAKzL,IAE5BA,EAAUhD,KAAK6R,GAEfA,EAASgyC,iBAAiB,aAAa,KACnCnhD,KAAKikD,WAAWx0C,OAAOo+C,kBAAkB,sBAAuB,CAC5DlK,OAAQx0C,GACV,IAENA,EAASgyC,iBAAiB,SAAS,KAC/B,MAAMvlD,EAAQ0E,EAAUmiI,WAAU5yH,GAAKA,IAAMV,IAE7C7O,EAAUC,OAAO3E,EAAO,GACxBoE,KAAKikD,WAAWx0C,OAAOo+C,kBAAkB,kBAAmB,CACxDlK,OAAQx0C,GACV,IAGNovH,EAAMjhI,KAAK6R,EAASZ,OAAOsqD,GAC/B,CAEA,GAAqB,IAAjB0lE,EAAM7iI,QAUV,GAAoB,aANEI,QAAQskE,WAAWm+D,IAKbhxG,MAAK3lB,GAAkB,cAAbA,EAAEpG,UACXxB,KAAK22H,iBAAmB/V,GAAeynB,SAChE,MAAM,IAAI,GAAU,cAAct8H,+CAAkD,GAAMoxH,6BAV1FgL,EAAe7qI,KAAKyO,EAY5B,CAGA,GAAIo8H,EAAezsI,SAAWsE,KAAK0nI,WAAWxhI,KAAM,CAChD,MAAMuD,EAAU,oDAAoD0+H,EAAezqI,KAAK,SACxF,GAAIsC,KAAK22H,iBAAmB/V,GAAegW,UACvC,MAAM,IAAI,GAAUntH,EAAS,GAAM0zH,wBAEvCn9H,KAAKpB,IAAI,6BAA6B6K,IAC1C,CACJ,CAKA,YAAMiE,CAAO3B,GACT,MAAMzL,EAAYN,KAAKM,UAAUwK,IAAIiB,IAAQ,GAC7C/L,KAAKpB,IAAIsvG,MAAM,wBAAyBniG,GAExC,MAAMwyH,EAAQ,GAEd,IADAv+H,KAAKpB,IAAIsvG,MAAM,2BAA4BniG,GACpCzL,EAAU5E,OAAS,GAAG,CACzB,MAAMyT,EAAW7O,EAAUs7D,MACX,MAAZzsD,GAGJovH,EAAMjhI,KAAK6R,EAASioG,QACxB,OACMt7G,QAAQ2lD,IAAI88E,GAClBv+H,KAAK0nI,WAAW1kF,OAAOj3C,GACvB/L,KAAKM,UAAU0iD,OAAOj3C,EAC1B,CAOA,eAAMu8H,GACF,MAAM/J,EAAQ,GACd,IAAK,MAAMxyH,KAAO/L,KAAK0nI,WAAW3oI,OAC9Bw/H,EAAMjhI,KAAK0C,KAAK0N,OAAO3B,UAErBjQ,QAAQ2lD,IAAI88E,EACtB,ECtPG,MAAMgK,GAAc,qBAGdC,GAAsB,KCC7BC,GAAU,GAAqB,MAI9B19F,eAAe,GAAMjgB,EAAQhuB,EAAQiE,SAClC+pB,EAAOpkB,MAAM5J,EAAQiE,EAC/B,CAqBOgqC,eAAejb,GAAW9E,EAAQjqB,GACrC,MAAMwB,QAZHwoC,eAAoB/f,EAAQjqB,GAC/B,MAAMwB,QAAYyoB,EAAOvkB,KAAK1F,GAC9B,GAAuB,IAAnBwB,EAAI07B,YAAoB17B,EAAIuI,IAAIvI,EAAI07B,WAAa,KAAOwqG,GAAQ,GAEhE,MADA1nI,EAAQnC,IAAI8I,MAAM,wCAAyCnF,GACrD,IAAI,GAAU,kBAAmB,0CAE3C,OAAOA,EAAIi6C,QAAQ,GAAI,EAC3B,CAKsB,CAAKxxB,EAAQjqB,GAC/B,OAAO,GAAmBwB,EAAIgxB,WAClC,CCkBOwX,eAAesc,GAAOjF,EAAQwB,EAAW7iD,GAC5C6iD,EAAYpoD,MAAM+Y,QAAQqvC,GAAaA,EAAY,CAACA,GACpD7iD,EAAQnC,IAAIsvG,MAAM,iCAAkCtqD,GACpD,MAAMkxD,EAAK/V,GAAS38C,EAAQ,IACrBrhD,EACHm+C,cAAespF,GACfvpF,gBAAiB,IAErB,OAAa,CACTl+C,EAAQnC,IAAIsvG,MAAM,mCAClB,MAAMzoD,QAAiB,GAAuBqvD,EAAI/zG,GAElD,GADAA,EAAQnC,IAAIsvG,MAAM,oBAAqBzoD,GACnCA,IAAa8iF,GAAjB,CAMA,GAAI3kF,EAAUjnC,SAAS8oC,GAInB,OAHA1kD,EAAQnC,IAAIsvG,MAAM,qCAAsCzoD,EAAUA,SAC5D,GAAkBqvD,EAAI,GAAqB,GAAGrvD,OAAe1kD,GACnEA,EAAQnC,IAAIsvG,MAAM,uCAAwCzoD,EAAUA,GAC7D,CAAErD,OAAQ0yD,EAAGlW,SAAUn5C,YAElC,GAAiB,OAAbA,EAQJ1kD,EAAQnC,IAAI,qCAAsC6mD,SAC5C,GAAkBqvD,EAAI,GAAqB,QAAS/zG,GAC1DA,EAAQnC,IAAI,uCAAwC6mD,OAVpD,CAEI,MAAMyV,EAAS,IAAItf,MAAkBgI,EAAUl4C,KAAIrP,GAAK,GAAOkiD,OAAO,GAAqB,GAAGliD,UAAU,GAAqB,OAC7H0E,EAAQnC,IAAIsvG,MAAM,mCAAoCtqD,EAAW6B,SAC3D,GAAkBqvD,EAAI55C,EAAQn6D,GACpCA,EAAQnC,IAAIsvG,MAAM,qCAAsCtqD,EAAW6B,EAEvE,CAdA,MAJI1kD,EAAQnC,IAAIsvG,MAAM,qCAAsCq6B,GAAa9iF,SAC/D,GAAkBqvD,EAAI,GAAqB,GAAGyzB,QAAkBxnI,GACtEA,EAAQnC,IAAIsvG,MAAM,uCAAwCq6B,GAAa9iF,EAoB/E,CACJ,CCnCO1a,eAAe,GAAOqX,EAAQwB,EAAW7iD,GAE5C,GAAyB,KADzB6iD,EAAYpoD,MAAM+Y,QAAQqvC,GAAa,IAAIA,GAAa,CAACA,IAC3CloD,SAA2C,IAA3BqF,EAAQ2nI,eAClC,OAgDR,SAA0BtmF,EAAQqD,EAAU1kD,GACxC,MAAM4nI,EAAevmF,EAAOH,KAAKn+C,KAAKs+C,GAChCwmF,EAAiBxmF,EAAO5jD,OAC9B,IAAIqqI,GAAa,EACbC,GAAc,EAClB,MAAMC,EAAkBxpF,KACxB,IAAIypF,GAAe,EACfC,GAAkB,EACtB,MAAMC,EAAsB3pF,KAC5B,IAAI4pF,GAAe,EACfC,GAAkB,EACtB,MAAMC,EAAsB9pF,KACtBu1D,EAAK/V,GAAS,CAChB98C,KAAM0mF,EACNnqI,OAAQoqI,GACT,IACI7nI,EACHm+C,cAAespF,KAyCnBz9F,eAAeu+F,IACX,GAAIR,EAGA,OAFA/nI,EAAQnC,IAAIsvG,MAAM,4CAA6CzoD,cACzDsjF,EAAgBvpF,QAG1BspF,GAAc,EACd,IAESE,IACDjoI,EAAQnC,IAAIsvG,MAAM,gDAAiDzoD,SAe/E1a,iBACI,GAAIk+F,QACMC,EAAoB1pF,YAD9B,CAIAypF,GAAkB,EAClB,IACIloI,EAAQnC,IAAIsvG,MAAM,iDAAkDq6B,GAAa9iF,SAC3EqvD,EAAG5V,OAAO,CACZ,GAAqB,GAAGqpC,QACxB,GAAqB,GAAG9iF,SAE5B1kD,EAAQnC,IAAIsvG,MAAM,iDAAkDq6B,GAAa9iF,EACrF,CACA,QACIujF,GAAe,EACfC,GAAkB,EAClBC,EAAoBntI,SACxB,CAdA,CAeJ,CAjCkBwtI,IAGLJ,IACDpoI,EAAQnC,IAAIsvG,MAAM,gDAAiDzoD,SA8B/E1a,iBACI,GAAIq+F,QACMC,EAAoB7pF,YAD9B,CAIA4pF,GAAkB,EAClB,IACIroI,EAAQnC,IAAIsvG,MAAM,iDAClB,IAAIzsG,QAAiB,GAAuBqzG,EAAI/zG,GAMhD,GALAA,EAAQnC,IAAIsvG,MAAM,kDAAmDzsG,GACjEA,IAAa8mI,KACb9mI,QAAiB,GAAuBqzG,EAAI/zG,IAEhDA,EAAQnC,IAAIsvG,MAAM,iDAAkDzsG,EAAUgkD,GAC1EhkD,IAAagkD,EACb,MAAM,IAAI,GAAU,4BAA6B,2BAEzD,CACA,QACI0jF,GAAe,EACfC,GAAkB,EAClBC,EAAoBttI,SACxB,CAlBA,CAmBJ,CApDkBytI,GAEd,CACA,QACIV,GAAc,EACdD,GAAa,EACbE,EAAgBhtI,SACpB,CACJ,CAmDA,GAlHAqmD,EAAOH,KAAOlX,MAAOvsC,IACjB,MAAM,KAAEyjD,GAAS6yD,EAAGlW,eACd38C,EAAKlX,kBACP,IAAI0+F,GAAW,EACf,UAAW,MAAMlnI,KAAO/D,EAAQ,CAM5B,GAJIyqI,SACMC,EAAoB1pF,QAGzBwpF,QAkBKzmI,MAlBS,CACf0mI,GAAkB,EAClBloI,EAAQnC,IAAIsvG,MAAM,mDAAoDq6B,GAAa9iF,EAAUljD,EAAI07B,YACjG,MAAMyrG,EAAiB,GAAGjkF,YAEpB,IAAI7J,GAAej6C,WAAWk5B,KAAK,CAAC,KAC1C,GAAqB,GAAG0tG,QAAkB,EAAcmB,EAAehuI,QAAS,GAAqBguI,GAAiBnnI,GAAKgxB,WAC3HxyB,EAAQnC,IAAIsvG,MAAM,mDAAoDq6B,GAAa9iF,EAAUljD,EAAI07B,YACjG+qG,GAAe,EACfC,GAAkB,EAClBC,EAAoBntI,UAEpButI,IACKz7H,OAAM5R,IACP8E,EAAQnC,IAAI8I,MAAM,yDAA0D+9C,EAAUxpD,EAAI,GAElG,CAIAwtI,GAAW,CACf,CAGKA,SACKH,GAEd,CAnCWv+F,GAmCP,EAuERqX,EAAO5jD,OAAS,wBAEN8qI,IACNvoI,EAAQnC,IAAIsvG,MAAM,4CAA6CzoD,SACxDqvD,EAAGlW,SAASpgG,MACtB,CALe,GAMQ,MAApB4jD,EAAO07D,UAAmB,CAC1B,MAAM6rB,EAAoBvnF,EAAO07D,UAAUh6G,KAAKs+C,GAChDA,EAAO07D,UAAY/yE,MAAO1F,IAGjBwjG,SACKS,IAAYz7H,OAAM5R,IACpB8E,EAAQnC,IAAI8I,MAAM,iDAAkDzL,EAAI,UAI1E0tI,EAAkBtkG,EAAK,CAErC,CACA,GAAyB,MAArB+c,EAAO27D,WAAoB,CAC3B,MAAM6rB,EAAqBxnF,EAAO27D,WAAWj6G,KAAKs+C,GAClDA,EAAO27D,WAAahzE,MAAO1F,IAGlBwjG,SACKS,IAAYz7H,OAAM5R,IACpB8E,EAAQnC,IAAI8I,MAAM,kDAAmDzL,EAAI,UAI3E2tI,EAAmBvkG,EAAK,CAEtC,CACA,GAAoB,MAAhB+c,EAAOg1D,MAAe,CACtB,MAAMyyB,EAAgBznF,EAAOg1D,MAAMtzG,KAAKs+C,GACxCA,EAAOg1D,MAAQrsE,MAAO1F,IAGlB,MAAMk5F,EAAQ,GACV0K,GACA1K,EAAMjhI,KAAK4rI,EAAoB1pF,SAE/B4pF,GACA7K,EAAMjhI,KAAK+rI,EAAoB7pF,SAE/B++E,EAAM7iI,OAAS,QAETwiG,GAAWpiG,QAAQ2lD,IAAI88E,GAAQl5F,GAAM2b,SAI3C6nF,GAAa,EACbC,GAAc,EACdC,EAAgBhtI,iBAGd8tI,EAAcxkG,EAAK,CAEjC,CACA,MAAO,CACH+c,SACAqD,WAER,CA/OeqkF,CAAiB1nF,EAAQwB,EAAU,GAAI7iD,GAElD,MAAM+zG,EAAK/V,GAAS38C,EAAQ,IACrBrhD,EACHm+C,cAAespF,KAEb/iF,EAAW7B,EAAU/9C,QAC3B,GAAgB,MAAZ4/C,EACA,MAAM,IAAIznD,MAAM,2CAEpB+C,EAAQnC,IAAIsvG,MAAM,6BAA8Bq6B,GAAa9iF,GAC7D,MAAMskF,EAAK,GAAqB,GAAGxB,QAC7ByB,EAAK,GAAqB,GAAGvkF,aFtDhC1a,eAAwBjgB,EAAQgU,EAAS/9B,SACtC+pB,EAAOo0E,OAAOpgE,EAAS/9B,EACjC,CEqDU,CAAqB+zG,EAAI,CAACi1B,EAAIC,GAAKjpI,GACzCA,EAAQnC,IAAIsvG,MAAM,6CAClB,IAAIzsG,QAAiB,GAAuBqzG,EAAI/zG,GAShD,GARAA,EAAQnC,IAAIsvG,MAAM,oBAAqBzsG,GAEnCA,IAAa8mI,KACbxnI,EAAQnC,IAAIsvG,MAAM,qCAClBzsG,QAAiB,GAAuBqzG,EAAI/zG,GAC5CA,EAAQnC,IAAIsvG,MAAM,oBAAqBzsG,IAGvCA,IAAagkD,EACb,MAAO,CAAErD,OAAQ0yD,EAAGlW,SAAUn5C,YAGlC,IAAK,MAAMA,KAAY7B,EAAW,CAC9B7iD,EAAQnC,IAAIsvG,MAAM,qBAAsBzoD,SAClC,GAAkBqvD,EAAI,GAAqB,GAAGrvD,OAAe1kD,GACnEA,EAAQnC,IAAIsvG,MAAM,qCAClB,MAAMzsG,QAAiB,GAAuBqzG,EAAI/zG,GAElD,GADAA,EAAQnC,IAAIsvG,MAAM,6BAA8BzsG,EAAUgkD,GACtDhkD,IAAagkD,EACb,MAAO,CAAErD,OAAQ0yD,EAAGlW,SAAUn5C,WAEtC,CACA,MAAM,IAAI,GAAU,4BAA6B,2BACrD,CC/FO,MAAMwkF,GAAmBj8H,OAAOw+B,IAAI,sBCMpC,MAAM09F,GAIT5oH,GAIA62F,WAIA3yD,WACAi3D,UACAn5D,SACA6mF,YACAC,WACA5oI,OACAs9H,UACAlgI,IAKAmmD,KAIA46D,WAIA0qB,OACAC,OAIAC,YAKA,WAAAz9H,CAAY9B,GACR,MAAM,WAAEmtG,EAAU,WAAE3yD,EAAU,UAAEhC,EAAS,MAAE4zD,EAAK,MAAElzC,EAAK,WAAEsmE,GAAex/H,EACxEhL,KAAKshB,GAAK,GAAIxY,SAASvL,OAAuB,IAAhBf,KAAK4oD,WAAkB3mD,SAAS,MAAMyL,KAAKoqC,QACzEt0C,KAAKm4G,WAAaA,EAClBn4G,KAAKwlD,WAAaA,EAClBxlD,KAAKy8G,UAAYzxG,EAAKyxG,UACtBz8G,KAAKwB,OAAS,OACdxB,KAAKsjD,SAAWt4C,EAAKs4C,SACrBtjD,KAAKmqI,YAAcn/H,EAAKm/H,YACxBnqI,KAAKoqI,WAAap/H,EAAKo/H,WACvBpqI,KAAK8+H,UAAY9zH,EAAK8zH,YAAa,EACnC9+H,KAAKpB,IAAMoM,EAAKyvC,OAAO2zD,aAAa,qBAAqBpuG,KAAKy8G,aAAaz8G,KAAKshB,MAC7C,MAA/BthB,KAAKm4G,WAAW18C,cAChBz7D,KAAKm4G,WAAan4G,KAAKm4G,WAAW98C,YAAY,QAAQr7D,KAAKwlD,eAE/DxlD,KAAK2/G,WAAan8D,EAClBxjD,KAAKqqI,OAASjzB,EACdp3G,KAAKsqI,OAASpmE,EACdlkE,KAAKuqI,YAAcC,EACnBxqI,KAAK+kD,KAAO,EAChB,CACA,CAAC/2C,OAAO80B,aAAe,aACvB,CAACmnG,KAAoB,EAIrB,WAAIxqB,GACA,OAAOz/G,KAAKuqI,aAChB,CAIA,eAAM/mF,CAAUI,EAAW7iD,GACvB,GAAoB,YAAhBf,KAAKwB,OACL,MAAM,IAAI,GAAU,iCAAkC,+BAE1D,GAAoB,WAAhBxB,KAAKwB,OACL,MAAM,IAAI,GAAU,2BAA4B,yBAKpD,GAHKhG,MAAM+Y,QAAQqvC,KACfA,EAAY,CAACA,IAEb5jD,KAAK8+H,YAAmD,IAAtC/9H,GAAS01G,yBAC3B,MAAM,IAAI,GAAU,sDAAuD,4BAE/E,MAAMr0D,QAAepiD,KAAK2/G,WAAW/7D,EAAW7iD,GAEhD,OADAqhD,EAAOq6D,UAAY,WACZr6D,CACX,CAIA,WAAMg1D,CAAMr2G,EAAU,CAAC,GACnB,GAAoB,WAAhBf,KAAKwB,QAAuC,YAAhBxB,KAAKwB,OAArC,CAKA,GAFAxB,KAAKpB,IAAI,2BAA4BoB,KAAKm4G,YAC1Cn4G,KAAKwB,OAAS,UACQ,MAAlBT,EAAQigD,OAAgB,CACxB,MAAMA,EAASm2D,YAAYprD,QA1GjB,KA4GVhrD,EAAU,IACHA,EACHigD,SAER,CACA,IACIhhD,KAAKpB,IAAIsvG,MAAM,6BAETpyG,QAAQ2lD,IAAIzhD,KAAKy/G,QAAQ/zG,KAAIq/B,MAAOx1B,GAAMA,EAAE6hG,MAAMr2G,MACxDf,KAAKpB,IAAIsvG,MAAM,sCAETluG,KAAKqqI,OAAOtpI,GAClBf,KAAKpB,IAAIsvG,MAAM,qCACfluG,KAAKwB,OAAS,SACdxB,KAAKsjD,SAAS8zD,MAAQltG,KAAKoqC,KAC/B,CACA,MAAOr4C,GACH+D,KAAKpB,IAAI8I,MAAM,8DAA+D1H,KAAKm4G,WAAYl8G,GAC/F+D,KAAKkkE,MAAMjoE,EACf,CAzBA,CA0BJ,CACA,KAAAioE,CAAMjoE,GACF+D,KAAKpB,IAAI8I,MAAM,yCAA0C1H,KAAKm4G,WAAYl8G,GAC1E+D,KAAKwB,OAAS,UACdxB,KAAKy/G,QAAQ3zG,SAAQyJ,IAAOA,EAAE2uD,MAAMjoE,EAAI,IACxC+D,KAAKpB,IAAI8I,MAAM,sBAAuB1H,KAAKy/G,QAAQ/jH,QAEnDsE,KAAKsqI,OAAOruI,GACZ+D,KAAKsjD,SAAS8zD,MAAQltG,KAAKoqC,MAC3Bt0C,KAAKwB,OAAS,QAClB,ECxGJ,SAASipI,GAAahlF,EAAUg3D,EAAWt5D,GACvC,IAAIunF,EAAc,EAMlB,OALAvnF,EAAWs8D,QAAQ3zG,SAAQs2C,IACnBA,EAAOq6D,YAAcA,GAAar6D,EAAOqD,WAAaA,GACtDilF,GACJ,IAEGA,CACX,CACO,MAAMC,GACT1mF,WACA2mF,qBACAC,OACAC,sBACAr7H,OACA,WAAA3C,CAAYm3C,EAAYj5C,GACpBhL,KAAKikD,WAAaA,EAClBjkD,KAAK4qI,qBAAuB,IAAIn/F,IAChCzgC,EAAK4/H,qBAAqB9+H,SAAQi/H,IAC9B/qI,KAAK4qI,qBAAqB7/H,IAAIggI,EAAUtlF,SAAUslF,EAAU,IAEhE/qI,KAAK6qI,OAAS,IAAIp/F,IAClBzgC,EAAK6/H,OAAO/+H,SAAQk/H,IAChBhrI,KAAK6qI,OAAO9/H,IAAIigI,EAAMvlF,SAAUulF,EAAM,IAE1ChrI,KAAK8qI,sBAAwB9/H,EAAK8/H,uBjCrDH,IiCsD/B9qI,KAAKyP,OAASw0C,EAAWx0C,MAC7B,CACA,CAACzB,OAAO80B,aAAe,mBACvB,2BAAMmoG,CAAsBzlF,EAAYi/D,EAAQymB,GAC5C,MAAMhZ,EAAkBlyH,KAAKikD,WAAWiuE,gBAAgBgZ,GACxD,QAAwBntI,IAApBm0H,SACUA,EAAgB1sE,EAAYi/D,GAClC,MAAM,IAAI,GAAU,gDAAgDymB,IAAkB,GAAMC,2BAGxG,CAIA,oBAAMC,CAAe3mB,EAAQp/E,GAEzB,UADqBrlC,KAAKikD,WAAWI,kBAAkB66E,yBAAyBza,GAE5E,MAAM,IAAI,GAAU,oBAAqB,GAAM4mB,uBAEnD,IAAIC,EACA9lF,EACA+lF,EACAC,EACAC,EACJ,MAAMzqF,EAASm2D,YAAYprD,QAAQ/rD,KAAK8qI,uBAClC1tB,EAAU,KACZqH,EAAOvgD,MAAM,IAAI,GAAU,0BAA2BlP,IAAa,EAEvEhU,EAAOG,iBAAiB,QAASi8D,EAAS,CAAEpuG,MAAM,IAElD,IACI,IAAgF,UAArEhP,KAAKikD,WAAWiuE,gBAAgBI,wBAAwB7N,IAC/D,MAAM,IAAI,GAAU,gEAAiE,GAAM0mB,4BAE/FnrI,KAAKikD,WAAWwoD,SAASi/B,yBAAyBjnB,GAClDA,EAAO7lH,IAAI,2CAEX,IAAI+sI,EAAgBlnB,EACpB,IAA6B,IAAzBp/E,GAAMumG,eAAyB,CAC/B,MAAMC,EAAY7rI,KAAKikD,WAAW6nF,oBACjB,MAAbD,IACApnB,EAAO7lH,IAAI,qCACX+sI,QAAsBE,EAAUE,QAAQtnB,GAEhD,CACA,IAGI,GADA6mB,EAAgBK,GACa,IAAzBtmG,GAAM2mG,eAAyB,CAC/B3mG,GAAM8/E,aAAa,IAAIhB,GAAoB,0CAEvCl0D,KAAMq7E,EACN9lF,aACAC,SAAUgmF,SACJzrI,KAAKisI,gBAAgBN,IAC/B,MAAMlnB,EAAS,IACRknB,KACAL,SAEDtrI,KAAKirI,sBAAsBzlF,EAAYi/D,EAAQ,iCACzD,KACK,CACD,MAAMynB,EAAQznB,EAAOtM,WAAW18C,YAChC,GAAa,MAATywE,EACA,MAAM,IAAI,GAAU,iEAAkE,GAAMpV,uBAEhG,MAAMqV,EAAe5uC,GAAiB2uC,GACtCT,EAAiB,SACjBjmF,EAAa2mF,CACjB,CAEA,GADAZ,EAAeD,EACW,MAAtBjmG,GAAMmmG,aACNA,EAAenmG,EAAKmmG,kBAEnB,GAAIxrI,KAAK6qI,OAAO3kI,KAAO,EAAG,CAC3Bm/B,GAAM8/E,aAAa,IAAIhB,GAAoB,0CAE3C,MAAMioB,QAAoBpsI,KAAKqsI,kBAAkB,IAC1CV,KACAL,GACJtrI,KAAK6qI,QACRW,EAAeY,EAAYZ,aAC3BD,EAAea,EAAYhqF,MAC/B,CACJ,CACA,MAAOnmD,GAEH,MADAwoH,EAAO7lH,IAAI8I,MAAM,uCAAwCzL,GACnDA,CACV,CAGA,aAFM+D,KAAKirI,sBAAsBzlF,EAAYi/D,EAAQ,iCACrDA,EAAO7lH,IAAI,4CACJoB,KAAKssI,kBAAkB,CAC1Bb,iBACAhvB,UAAW,UACXgI,SACA8mB,eACAC,eACAhmF,aACAs5E,UAAWz5F,GAAMy5F,WAEzB,CACA,QACI99E,EAAOK,oBAAoB,QAAS+7D,GACpCp9G,KAAKikD,WAAWI,kBAAkB86E,qBACtC,CACJ,CAIA,qBAAMra,CAAgBL,EAAQp/E,GAC1B,MAAM6mG,EAAQznB,EAAOtM,WAAW18C,YAChC,IAAI0wE,EAKAb,EACA9lF,EACA+lF,EACAE,EACAD,EARS,MAATU,IACAC,EAAe5uC,GAAiB2uC,SAC1BlsI,KAAKirI,sBAAsBkB,EAAc1nB,EAAQ,2BAO3DzkH,KAAKikD,WAAWwoD,SAASi/B,yBAAyBjnB,GAClDA,EAAO7lH,IAAI,4CAIX,IAAI+sI,EAAgBlnB,EACpB,IAA6B,IAAzBp/E,GAAMumG,eAAyB,CAC/B,MAAMC,EAAY7rI,KAAKikD,WAAW6nF,oBACjB,MAAbD,IACAF,QAAsBE,EAAUE,QAAQtnB,GAEhD,CACA,IAGI,GADA6mB,EAAgBK,GACa,IAAzBtmG,GAAM2mG,eAAyB,GAE3B/7E,KAAMq7E,EACN9lF,aACAC,SAAUgmF,SACJzrI,KAAKusI,iBAAiBZ,EAAeQ,IAC/C,MAAM1nB,EAAS,IACRknB,KACAL,SAEDtrI,KAAKirI,sBAAsBzlF,EAAYi/D,EAAQ,kCACzD,KACK,CACD,GAAoB,MAAhB0nB,EACA,MAAM,IAAI,GAAU,mDAAoD,GAAMK,kBAElFf,EAAiB,SACjBjmF,EAAa2mF,CACjB,CAEA,GADAZ,EAAeD,EACW,MAAtBjmG,GAAMmmG,aACNA,EAAenmG,EAAKmmG,kBAEnB,GAAIxrI,KAAK6qI,OAAO3kI,KAAO,EAAG,CAE3B,MAAMkmI,QAAoBpsI,KAAKysI,mBAAmB,IAC3Cd,KACAL,GACJtrI,KAAK6qI,QACRW,EAAeY,EAAYZ,aAC3BD,EAAea,EAAYhqF,MAC/B,CACJ,CACA,MAAOnmD,GAGH,MAFAwoH,EAAO7lH,IAAI8I,MAAM,wCAAyCzL,SACpDwoH,EAAOrN,MAAMn7G,GACbA,CACV,CAGA,aAFM+D,KAAKirI,sBAAsBzlF,EAAYi/D,EAAQ,kCACrDA,EAAO7lH,IAAI,6CACJoB,KAAKssI,kBAAkB,CAC1Bb,iBACAhvB,UAAW,WACXgI,SACA8mB,eACAC,eACAhmF,aACAs5E,UAAWz5F,GAAMy5F,WAEzB,CAIA,iBAAAwN,CAAkBjnG,GACd,MAAM,eAAEomG,EAAc,UAAEhvB,EAAS,OAAEgI,EAAM,aAAE8mB,EAAY,WAAE/lF,EAAU,aAAEgmF,EAAY,UAAE1M,GAAcz5F,EACjG,IAAI2lG,EACAxnF,EACAL,EACgB,MAAhBqoF,IAEAR,EAAQQ,EAAaprB,kBAAkB,CACnC3D,YAEAuD,iBAAkB0sB,IACI,MAAdvpF,GAGCrnD,QAAQC,UACR+R,MAAKi9B,UACN,MAAM6Y,EAAY5jD,KAAKikD,WAAWqQ,UAAUqyE,gBACtC,OAAEvkF,EAAM,SAAEqD,SAAmB,GAAWinF,EAAa9oF,EAAW,CAClEhlD,IAAK8tI,EAAY9tI,IACjBkgG,YAAY,IAEhB,GAAkB,MAAd37C,EACA,OAEJA,EAAWvkD,IAAI,+BAAgC6mD,GAC/C,MAAMknF,EA1Q9B,SAAiClnF,EAAU6O,GACvC,IACI,MAAM,QAAEvzD,GAAYuzD,EAAUsyE,WAAWnhF,GACzC,OAAO1kD,EAAQwmD,iBACnB,CACA,MAAOtrD,GACH,GAAIA,EAAIoQ,OAAS,GAAMw6H,4BACnB,MAAM5qI,CAEd,CACA,OThBuC,ESiB3C,CA+P8C2wI,CAAwBnnF,EAAUzlD,KAAKikD,WAAWqQ,WAExE,GADoBm2E,GAAahlF,EAAU,UAAWtC,KAClCwpF,EAAe,CAC/B,MAAM1wI,EAAM,IAAI,GAAU,mDAAmDwpD,cAAqBknF,IAAiB,GAAME,uCAEzH,MADAH,EAAYxoE,MAAMjoE,GACZA,CACV,CAGAywI,EAAYluI,OAAS4jD,EAAO5jD,OAC5BkuI,EAAYzqF,KAAOG,EAAOH,KAC1ByqF,EAAYjnF,SAAWA,EAEE,MAArBrD,EAAO27D,aACP2uB,EAAY3uB,WAAa37D,EAAO27D,YAGZ,MAApB37D,EAAO07D,YACP4uB,EAAY5uB,UAAY17D,EAAO07D,WAGf,MAAhB17D,EAAOg1D,QACPs1B,EAAYt1B,MAAQh1D,EAAOg1D,aAIzBp3G,KAAKikD,WAAWK,UAAUhoC,MAAMkpC,EAAY,CAC9C5B,UAAW,CAAC6B,KAEhBzlD,KAAKikD,WAAWwoD,SAASqgC,oBAAoBJ,EAAavpF,GAC1DnjD,KAAK+sI,UAAU,CAAE5pF,aAAYf,OAAQsqF,EAAajnF,YAAW,IAE5D53C,OAAMk9B,MAAO9uC,IACdknD,EAAWvkD,IAAI8I,MAAM,uCAAwCglI,EAAYprH,GAAIrlB,EAAIwN,QAASxN,EAAIoQ,KAAMpQ,EAAIsP,OACtE,MAA9BmhI,EAAYppF,SAAS8zD,aACfs1B,EAAYt1B,OACtB,GACF,IAGV5zD,EAAYzY,MAAO6Y,EAAW7iD,EAAU,CAAC,KACrC,GAAa,MAATiqI,EACA,MAAM,IAAI,GAAU,4BAA6B,GAAMgC,uBAE3D7pF,EAAWvkD,IAAI,uCAAwCglD,GACvD,MAAM8oF,QAAoB1B,EAAMxnF,YAChCL,EAAWvkD,IAAIsvG,MAAM,yCAA0Cw+B,EAAYprH,GAAIsiC,GAC/E,IACI,GAAsB,MAAlB7iD,EAAQigD,OAAgB,CACxB0rF,EAAY9tI,IAAI,oGAAqGglD,GACrH,MAAM5C,EAASm2D,YAAYprD,QA7TX,KA+ThBhrD,EAAU,IACHA,EACHigD,SAER,CACA0rF,EAAY9tI,IAAIsvG,MAAM,uCAAwCtqD,GAC9D,MAAM,OAAExB,EAAM,SAAEqD,SAAmB,GAAWinF,EAAa9oF,EAAW,IAC/D7iD,EACHnC,IAAK8tI,EAAY9tI,IACjBkgG,YAAY,IAEhB4tC,EAAY9tI,IAAI,uBAAwB6mD,GACxC,MAAMwnF,EA9T1B,SAAiCxnF,EAAU6O,EAAWvzD,EAAU,CAAC,GAC7D,IACI,MAAM,QAAEA,GAAYuzD,EAAUsyE,WAAWnhF,GACzC,GAAkC,MAA9B1kD,EAAQu1G,mBACR,OAAOv1G,EAAQu1G,kBAEvB,CACA,MAAOr6G,GACH,GAAIA,EAAIoQ,OAAS,GAAMw6H,4BACnB,MAAM5qI,CAEd,CACA,OAAO8E,EAAQu1G,oBT7ByB,ES8B5C,CAiT0C42B,CAAwBznF,EAAUzlD,KAAKikD,WAAWqQ,UAAWvzD,GAC7E2pI,EAAcD,GAAahlF,EAAU,WAAYtC,GACvD,GAAIunF,GAAeuC,EAAe,CAC9B,MAAMhxI,EAAM,IAAI,GAAU,oDAAoDwpD,QAAeilF,KAAeuC,IAAiB,GAAME,wCAEnI,MADAT,EAAYxoE,MAAMjoE,GACZA,CACV,CAwBA,aArBM+D,KAAKikD,WAAWK,UAAUhoC,MAAMkpC,EAAY,CAC9C5B,UAAW,CAAC6B,KAIhBinF,EAAYluI,OAAS4jD,EAAO5jD,OAC5BkuI,EAAYzqF,KAAOG,EAAOH,KAC1ByqF,EAAYjnF,SAAWA,EAEE,MAArBrD,EAAO27D,aACP2uB,EAAY3uB,WAAa37D,EAAO27D,YAGZ,MAApB37D,EAAO07D,YACP4uB,EAAY5uB,UAAY17D,EAAO07D,WAGf,MAAhB17D,EAAOg1D,QACPs1B,EAAYt1B,MAAQh1D,EAAOg1D,OAE/Bp3G,KAAKikD,WAAWwoD,SAASqgC,oBAAoBJ,EAAavpF,GACnDupF,CACX,CACA,MAAOzwI,GAKH,GAJAknD,EAAWvkD,IAAI8I,MAAM,+CAAgDk8C,EAAW3nD,GAC9C,MAA9BywI,EAAYppF,SAAS8zD,OACrBs1B,EAAYxoE,MAAMjoE,GAEN,MAAZA,EAAIoQ,KACJ,MAAMpQ,EAEV,MAAM,IAAI,GAAUsB,OAAOtB,GAAM,GAAMmxI,yBAC3C,GAGCtxI,QAAQ2lD,IAAI,CACbupF,EAAM/oF,KAAKspF,EAAa/sI,QACxB+sI,EAAatpF,KAAK+oF,EAAMxsI,UACzBqP,OAAM5R,IACLknD,EAAWvkD,IAAI8I,MAAM,kCAAmCzL,EAAI,KAGpE,MAAMoxI,EAAY5oB,EAAOnhE,SDzP1B,IAA0Bt4C,EC+TzB,OArEAy5G,EAAOnhE,SAAW,IAAIgqF,MAAMD,EAAW,CACnCtiI,IAAK,IAAItK,KACa,MAAd0iD,GAAkC,UAAZ1iD,EAAK,IAA6B,MAAXA,EAAK,IAAiC,MAAnB4sI,EAAUj2B,OAE1E,WACI,IAC8B,SAAtBj0D,EAAW3hD,cACL2hD,EAAWi0D,OAEzB,CACA,MAAOn7G,GACHknD,EAAWvkD,IAAI8I,MAAM,gDAAiDzL,EAC1E,CACA,QACI+D,KAAKyP,OAAOo+C,kBAAkB,mBAAoB,CAC9ClK,OAAQR,GAEhB,CACH,EAdD,GAcKt1C,OAAM5R,IACPknD,EAAWvkD,IAAI8I,MAAM,wDAAyDzL,EAAI,IAGnFsxI,QAAQxiI,OAAOtK,MAG9BgkH,EAAOnhE,SAASkqF,SAAWtjI,KAAKoqC,MDnRPtpC,ECwRK,CAC1BmtG,WAAYsM,EAAOtM,WACnB3yD,aACAhkD,OAAQ,OACRi7G,YACAn5D,SAAUmhE,EAAOnhE,SACjB6mF,YAAaa,GAAOvlF,SACpB2kF,WAAYqB,EACZ3M,YACArkF,OAAQz6C,KAAKikD,WAAWxJ,OACxB+I,UAAWA,GAdqB,MAChC,MAAM,IAAI,GAAU,gCAAiC,GAAMiqF,+BAA+B,GAc1FjD,WAAY,IAAqB,MAATQ,EACbA,EAAMvrB,QAGN,GAEXrI,MAAOrsE,MAAOhqC,IAEG,MAATiqI,IACA7nF,EAAWvkD,IAAIsvG,MAAM,qBACf88B,EAAM5zB,MAAMr2G,IAEtBoiD,EAAWvkD,IAAIsvG,MAAM,sBAEfuW,EAAOrN,MAAMr2G,GACnBoiD,EAAWvkD,IAAIsvG,MAAM,gBAAgB,EAEzChqC,MAAQjoE,IACJwoH,EAAOvgD,MAAMjoE,GAEA,MAAT+uI,GACAA,EAAM9mE,MAAMjoE,EAChB,GAjCRknD,EDvRG,IAAI+mF,GAAel/H,GC2TtBhL,KAAKyP,OAAOo+C,kBAAkB,kBAAmB,CAC7ClK,OAAQR,IAELA,CACX,CAIA,SAAA4pF,CAAU1nG,GACN,MAAM,WAAE8d,EAAU,OAAEf,EAAM,SAAEqD,GAAapgB,GACnC,QAAEokF,EAAO,QAAE1oH,GAAYf,KAAKikD,WAAWqQ,UAAUsyE,WAAWnhF,GAClE,GAAItC,EAAW27E,YAAkD,IAArC/9H,EAAQ01G,yBAChC,MAAM,IAAI,GAAU,sDAAuD,4BAE/EgT,EAAQ,CAAEtmE,aAAYf,UAC1B,CAIA,qBAAM6pF,CAAgB9oF,GAClB,MAAMS,EAAYpoD,MAAMq/B,KAAK76B,KAAK4qI,qBAAqB7rI,QACvDokD,EAAWvkD,IAAI,6CAA8CglD,GAC7D,IACI,MAAM,OAAExB,EAAM,SAAEqD,SAAmB,GAAWtC,EAAYS,EAAW,CACjEhlD,IAAKukD,EAAWvkD,MAEdmsI,EAAY/qI,KAAK4qI,qBAAqB9/H,IAAI26C,GAChD,GAAiB,MAAbslF,EACA,MAAM,IAAI/sI,MAAM,8BAA8BynD,KAGlD,OADAtC,EAAWvkD,IAAI,sCAAuC6mD,GAC/C,UACMslF,EAAUh9B,cAAc/tG,KAAKikD,WAAWH,OAAQ1B,GACzDqD,WAER,CACA,MAAOxpD,GAEH,MADAknD,EAAWvkD,IAAI8I,MAAM,uCAAwCzL,GACvD,IAAI,GAAUA,EAAIwN,QAAS,GAAMikI,sBAC3C,CACJ,CAKA,sBAAMnB,CAAiBppF,EAAYgpF,GAC/B,MAAMvoF,EAAYpoD,MAAMq/B,KAAK76B,KAAK4qI,qBAAqB7rI,QACvDokD,EAAWvkD,IAAI,qCAAsCglD,GACrD,IACIT,EAAWvkD,IAAIsvG,MAAM,8BAA+BtqD,GACpD,MAAM,OAAExB,EAAM,SAAEqD,SAAmB,GAAWtC,EAAYS,EAAW,CACjEhlD,IAAKukD,EAAWvkD,IAChBkgG,YAAY,IAEVisC,EAAY/qI,KAAK4qI,qBAAqB9/H,IAAI26C,GAChD,GAAiB,MAAbslF,EACA,MAAM,IAAI/sI,MAAM,8BAA8BynD,KAGlD,OADAtC,EAAWvkD,IAAI,gDAAiDutI,EAAcpB,GACvE,UACMA,EAAUx9B,eAAevtG,KAAKikD,WAAWH,OAAQ1B,EAAQ+pF,GAClE1mF,WAER,CACA,MAAOxpD,GAEH,MADAknD,EAAWvkD,IAAI8I,MAAM,8CAA+CykI,EAAclwI,GAC5E,IAAI,GAAUA,EAAIwN,QAAS,GAAMikI,sBAC3C,CACJ,CAKA,wBAAMjB,CAAmBtpF,EAAY0nF,GACjC,MAAMjnF,EAAYpoD,MAAMq/B,KAAKgwG,EAAO9rI,QACpCokD,EAAWvkD,IAAI,8BAA+BglD,GAC9C,IACIT,EAAWvkD,IAAIsvG,MAAM,iCAAkCtqD,GACvD,MAAM,OAAExB,EAAM,SAAEqD,SAAmB,GAAWtC,EAAYS,EAAW,CACjEhlD,IAAKukD,EAAWvkD,IAChBkgG,YAAY,IAIhB,OAFA37C,EAAWvkD,IAAI,gCAAiC6mD,GAEzC,CAAErD,SAAQopF,aADIX,EAAO//H,IAAI26C,GAEpC,CACA,MAAOxpD,GAEH,MADAknD,EAAWvkD,IAAI8I,MAAM,yCAA0CzL,GACzD,IAAI,GAAUsB,OAAOtB,GAAM,GAAM+wI,sBAC3C,CACJ,CAKA,uBAAMX,CAAkBlpF,EAAY0nF,GAChC,MAAMjnF,EAAYpoD,MAAMq/B,KAAKgwG,EAAO9rI,QACpCokD,EAAWvkD,IAAI,6BAA8BglD,GAC7C,IACI,MAAM,OAAExB,EAAM,SAAEqD,SAAmB,GAAWtC,EAAYS,EAAW,CACjEhlD,IAAKukD,EAAWvkD,MAGpB,MAAO,CAAEwjD,SAAQopF,aADIX,EAAO//H,IAAI26C,GAEpC,CACA,MAAOxpD,GAEH,MADAknD,EAAWvkD,IAAI8I,MAAM,wCAAyCzL,GACxD,IAAI,GAAUsB,OAAOtB,GAAM,GAAM+wI,sBAC3C,CACJ,EC7hBG,MAAMW,WAAmBjgF,GAC5B5J,OACAQ,UACAspF,eACArR,YACA9vB,QACAv/C,SACAzS,OACAj5C,OACAyiD,WACArlD,IACA,WAAAkO,CAAY9B,GACR+iC,QACA/tC,KAAKwB,OAAS,UAGd,MAAMiO,EAAS,IAAIi+C,GACbmgF,EAAmBp+H,EAAOm+C,cAAc9pD,KAAK2L,GACnDA,EAAOm+C,cAAiBxtD,IACpB,MAAM0tI,EAAiBD,EAAiBztI,GAClC2tI,EAAiB/tI,KAAK4tD,cAAc,IAAI,GAAYxtD,EAAI8H,KAAM,CAAEy7C,OAAQvjD,EAAIujD,UAClF,OAAOmqF,GAAkBC,CAAc,EAI3C/tI,KAAK8jD,OAAS94C,EAAK84C,OACnB9jD,KAAKy6C,OAASzvC,EAAKyvC,QAAUorE,KAC7B7lH,KAAKpB,IAAMoB,KAAKy6C,OAAO2zD,aAAa,UAEpCpuG,KAAKktD,SAAW,CAAC,EAEjB,MAAMjJ,EAAajkD,KAAKikD,W1DOzB,SAA2Bj5C,EAAO,CAAC,GACtC,MAAMi5C,EAAa,IAAIysE,GAAkB1lH,GAuBzC,OAtBc,IAAIsiI,MAAMrpF,EAAY,CAChC,GAAAn5C,CAAIqlB,EAAQnM,EAAMi/C,GACd,GAAoB,iBAATj/C,IAAsBotG,GAAuBz0G,SAASqH,GAAO,CACpE,MAAMkN,EAAU+yB,EAAWA,WAAWjgC,GACtC,GAAe,MAAXkN,IAAoBigG,GAAkBx0G,SAASqH,GAC/C,MAAM,IAAI,GAAU,GAAGA,YAAgB,uBAE3C,OAAOkN,CACX,CACA,OAAOq8G,QAAQziI,IAAIqlB,EAAQnM,EAAMi/C,EACrC,EACAl4D,IAAG,CAAColB,EAAQnM,EAAMvkB,KACM,iBAATukB,EACPigC,EAAWA,WAAWjgC,GAAQvkB,EAG9B8tI,QAAQxiI,IAAIolB,EAAQnM,EAAMvkB,IAEvB,IAKnB,C0DhC6CuuI,CAAkB,CACnDlqF,OAAQ94C,EAAK84C,OACbm4B,WAAYjxE,EAAKixE,WACjBy6B,SAAU1rG,EAAK0rG,UAAY,CACvB7qG,KC3DI,SD4DJs/B,QC7DO,SD+DXsP,OAAQz6C,KAAKy6C,OACbhrC,SACA09G,UAAWniH,EAAKmiH,WAAa,IAAImC,GACjC4C,gBAAiBA,GAAgBlnH,EAAKknH,iBACtCvQ,IAAK32G,EAAK22G,MAEd3hH,KAAKskD,UAAYtkD,KAAKiuI,mBAAmB,YAAa,IAAI5f,GAAoBpqE,EAAY,CACtF8oE,cAAe/sH,KAAKikD,WAAWiuE,gBAAgBU,0BAC5C5nH,EAAKs5C,aAGQ,MAAhBt5C,EAAKyhG,UACLzsG,KAAKysG,QAAUzsG,KAAKiuI,mBAAmB,UAAWjjI,EAAKyhG,QAAQzsG,KAAKikD,cAExEA,EAAWx0C,OAAO0xC,iBAAiB,eAAe/gD,IAE9C,GAA2B,MAAvBA,EAAIujD,OAAOuqE,SAAkB,CAC7B,MAAM/8D,EAAW,CACb7vC,GAAIlhB,EAAIujD,OAAOf,KAAKthC,GACpB6vF,WAAY/wG,EAAIujD,OAAOf,KAAKivD,UAAUnmG,KAAI2uB,GAAKA,EAAEs3E,aAErD1tD,EAAWx0C,OAAOo+C,kBAAkB,iBAAkB,CAAElK,OAAQwN,GACpE,KAG4B,MAA5BnmD,EAAK8gI,qBACL9rI,KAAKiuI,mBAAmB,sBAAuBjjI,EAAK8gI,oBAAoB7nF,IAG5EjkD,KAAKikD,WAAW4gE,SAAW,IAAI8lB,GAAgB3qI,KAAKikD,WAAY,CAC5D2mF,sBAAuB5/H,EAAK4/H,sBAAwB,IAAIl/H,KAAI,CAACrQ,EAAIO,IAAUoE,KAAKiuI,mBAAmB,yBAAyBryI,IAASP,EAAG2E,KAAKikD,eAC7I4mF,QAAS7/H,EAAKkjI,cAAgB,IAAIxiI,KAAI,CAACrQ,EAAIO,IAAUoE,KAAKiuI,mBAAmB,iBAAiBryI,IAASP,EAAG2E,KAAKikD,eAC/G6mF,sBAAuB9/H,EAAKq5C,mBAAmBymF,wBAGnD9qI,KAAKiuI,mBAAmB,mBAAoB,IAAIxG,GAAwBznI,KAAKikD,WAAYj5C,EAAKklH,mBAE9FlwH,KAAKiuI,mBAAmB,oBAAqB,IAAI1Q,GAAyBv9H,KAAKikD,WAAYj5C,EAAKq5C,qBACxD,IAApCr5C,EAAKmjI,mBAAmBpkI,SAExB/J,KAAKiuI,mBAAmB,oBAAqB,IAAI/M,GAAkBlhI,KAAKikD,WAAYj5C,EAAKmjI,oBAG7FnuI,KAAKiuI,mBAAmB,YAAa,IAAI3H,GAAiBtmI,KAAKikD,aAE/DjkD,KAAKiuI,mBAAmB,iBAAkB,IAAIte,GAAsB3vH,KAAKikD,WAAYj5C,EAAK6mG,YAE1F,MAAMu8B,GAAepjI,EAAKojI,aAAe,IAAI1iI,KAAI,CAACrQ,EAAIO,IAAUoE,KAAKiuI,mBAAmB,eAAeryI,IAASP,EAAG2E,KAAKikD,eACxHjkD,KAAKu8H,YAAcv8H,KAAKikD,WAAWs4E,YAAcv8H,KAAKiuI,mBAAmB,cAAe,IAAIvJ,GAAmB1kI,KAAKikD,WAAY,CAC5H09E,QAASyM,KAGb,MAAMC,GAAkBrjI,EAAKqjI,gBAAkB,IAAI3iI,KAAI,CAACrQ,EAAIO,IAAUoE,KAAKiuI,mBAAmB,kBAAkBryI,IAASP,EAAG2E,KAAKikD,eAiBjI,GAhBAjkD,KAAK4tI,eAAiB5tI,KAAKikD,WAAW2pF,eAAiB5tI,KAAKiuI,mBAAmB,iBAAkB,IAAIvM,GAAuB1hI,KAAKikD,WAAY,CACzI09E,QAAS0M,KAGbruI,KAAKiuI,mBAAmB,aAAc,IAAInI,GAAW9lI,KAAKikD,cACzDj5C,EAAKsjI,eAAiB,IAAIxiI,SAAQ,CAACzQ,EAAIO,KACpBoE,KAAKiuI,mBAAmB,kBAAkBryI,IAASP,EAAG2E,KAAKikD,aACnE9C,iBAAiB,QAAS/gD,IAC9BJ,MAAK,EAAiBI,EAAI,GAC5B,IAGN4K,EAAK08H,YAAY57H,SAAQ,CAACzQ,EAAIO,KAC1BoE,KAAKikD,WAAWisE,iBAAiB9oG,IAAIpnB,KAAKiuI,mBAAmB,aAAaryI,IAASP,EAAG2E,KAAKikD,aAAa,IAGvF,MAAjBj5C,EAAKkiD,SACL,IAAK,MAAMrhD,KAAQ/M,OAAOC,KAAKiM,EAAKkiD,UAAW,CAC3C,MACMh8B,GAAUq9G,EADMvjI,EAAKkiD,SAASrhD,IACN7L,KAAKikD,YACpB,MAAX/yB,GAIJlxB,KAAKktD,SAASrhD,GAAQqlB,EACtBlxB,KAAKiuI,mBAAmBpiI,EAAMqlB,GACO,MAAjCA,EAAQs0F,MACRxlH,KAAKpB,IAAI,6CAA8CiN,GACvDwiI,EAAe/wI,KAAK4zB,EAAQs0F,MAEE,MAA9Bt0F,EAAQu0F,MACRzlH,KAAKpB,IAAI,0CAA2CiN,GACpDuiI,EAAY9wI,KAAK4zB,EAAQu0F,MAEO,MAAhCv0F,EAAQ09E,MACR5uG,KAAKpB,IAAI,4CAA6CiN,GACtDqlB,EAAQ09E,IAAqBztD,mBAAmB,QAAS/gD,IACrDJ,MAAK,EAAiBI,EAAI,MAhB9BJ,KAAKpB,IAAI8I,MAAM,yDAA0DmE,EAmBjF,E1DnEL,SAAkCo4C,GACrC,MAAM84C,EAAsB,CAAC,EAC7B,IAAK,MAAM7rE,KAAWpyB,OAAO2jB,OAAOwhC,EAAWA,YAC3C,IAAK,MAAMuqF,KAAcnd,GAAuBngG,GAC5C6rE,EAAoByxC,IAAc,EAG1C,IAAK,MAAMt9G,KAAWpyB,OAAO2jB,OAAOwhC,EAAWA,YAC3C,IAAK,MAAMuqF,KAAcld,GAAuBpgG,GAC5C,IAAwC,IAApC6rE,EAAoByxC,GACpB,MAAM,IAAI,GAAU,YAAYjd,GAAergG,4BAAkCs9G,qHAA+H,iCAIhO,C0DwDQC,CAAyBxqF,EAC7B,CACA,kBAAAgqF,CAAmBpiI,EAAM6iI,GAMrB,OALiB,MAAbA,GACA1uI,KAAKpB,IAAI8I,MAAM,qCAAsCmE,GAGzD7L,KAAKikD,WAAWp4C,GAAQ6iI,EACjBA,CACX,CAIA,WAAM3xI,GACF,GAAoB,YAAhBiD,KAAKwB,OAAT,CAGAxB,KAAKwB,OAAS,WACdxB,KAAKpB,IAAI,sBACT,UACUoB,KAAKikD,WAAW8sE,uBAChB/wH,KAAKikD,WAAWlnD,cAChBiD,KAAKikD,WAAW+sE,gBACtBhxH,KAAKwB,OAAS,UACdxB,KAAK6tD,kBAAkB,QAAS,CAAElK,OAAQ3jD,OAC1CA,KAAKpB,IAAI,qBACb,CACA,MAAO3C,GAKH,MAJA+D,KAAKpB,IAAI8I,MAAM,oCAAqCzL,GAEpD+D,KAAKwB,OAAS,gBACRxB,KAAKyN,OACLxR,CACV,CAjBA,CAkBJ,CAIA,UAAMwR,GACkB,YAAhBzN,KAAKwB,SAGTxB,KAAKpB,IAAI,sBACToB,KAAKwB,OAAS,iBACRxB,KAAKikD,WAAWgtE,sBAChBjxH,KAAKikD,WAAWx2C,aAChBzN,KAAKikD,WAAWitE,eACtBlxH,KAAKwB,OAAS,UACdxB,KAAK6tD,kBAAkB,OAAQ,CAAElK,OAAQ3jD,OACzCA,KAAKpB,IAAI,sBACb,CACA,cAAA4jD,CAAesB,GACX,OAAO9jD,KAAKikD,WAAWI,kBAAkB7B,eAAesB,EAC5D,CACA,YAAA61E,GACI,OAAO35H,KAAKikD,WAAWI,kBAAkBs1E,cAC7C,CACA,QAAAh1E,GACI,MAAMgqF,EAAU,IAAI1oB,GACpB,IAAK,MAAMh2D,KAAQjwD,KAAKikD,WAAWI,kBAAkB7B,iBACjDmsF,EAAQvnH,IAAI6oC,EAAKzK,YAErB,OAAOhqD,MAAMq/B,KAAK8zG,EACtB,CACA,UAAMh9E,CAAK/O,EAAM7hD,EAAU,CAAC,GACxB,OAAOf,KAAKikD,WAAWI,kBAAkBq8D,eAAe99D,EAAM,CAE1DskE,SAAU,MACPnmH,GAEX,CACA,kBAAMskE,CAAaziB,EAAMgB,EAAW7iD,EAAU,CAAC,GAC3C,GAAiB,MAAb6iD,EACA,MAAM,IAAI,GAAU,8CAA+C,GAAMgrF,kCAG7E,GAAyB,KADzBhrF,EAAYpoD,MAAM+Y,QAAQqvC,GAAaA,EAAY,CAACA,IACtCloD,OACV,MAAM,IAAI,GAAU,8CAA+C,GAAMkzI,kCAG7E,aADyB5uI,KAAK2xD,KAAK/O,EAAM7hD,IACvByiD,UAAUI,EAAW7iD,EAC3C,CACA,aAAAykE,GACI,OAAOxlE,KAAKikD,WAAWoyD,eAAe4B,cAC1C,CACA,YAAA0uB,GACI,OAAO3mI,KAAKikD,WAAWqQ,UAAUqyE,cACrC,CACA,YAAM92E,CAAOjN,EAAM7hD,EAAU,CAAC,GACtBu5D,GAAY1X,KACZA,EAAO26C,GAAiB36C,EAAK6Y,aAAe,WAE1Cz7D,KAAKikD,WAAWI,kBAAkB46E,iBAAiBr8E,EAAM7hD,EACnE,CAIA,kBAAMs4E,CAAaz2B,EAAM7hD,EAAU,CAAC,GAEhC,GADAf,KAAKpB,IAAI,kBAAmBgkD,GACN,MAAlBA,EAAK42B,UACL,OAAO52B,EAAK42B,UAEhB,IACI,MAAMroB,QAAiBnxD,KAAKskD,UAAUx5C,IAAI83C,GAC1C,GAA6B,MAAzBuO,EAAS7vC,GAAGk4D,UACZ,OAAOroB,EAAS7vC,GAAGk4D,SAE3B,CACA,MAAOv9E,GACH,GAAIA,EAAIoQ,OAAS,GAAMiwH,cACnB,MAAMrgI,CAEd,CACA,MAAM4yI,EAAU,GAAiB,CAC7B,GAAqB,QACrBjsF,EAAKhY,UAAUlzB,SAGbpF,QAActS,KAAK4tI,eAAe9iI,IAAI+jI,EAAS9tI,GAMrD,OAJA,GAAmBuR,SACbtS,KAAKskD,UAAUyzD,MAAMn1D,EAAM,CAC7B42B,UAAWlnE,IAERA,CACX,CACA,YAAM+0C,CAAOzD,EAAW6lE,EAAS1oH,GACxBvF,MAAM+Y,QAAQqvC,KACfA,EAAY,CAACA,UAEX9nD,QAAQ2lD,IAAImC,EAAUl4C,KAAIq/B,MAAO0a,UAC7BzlD,KAAKikD,WAAWqQ,UAAUjN,OAAO5B,EAAUgkE,EAAS1oH,EAAQ,IAE1E,CACA,cAAMg2G,CAASnzD,GACNpoD,MAAM+Y,QAAQqvC,KACfA,EAAY,CAACA,UAEX9nD,QAAQ2lD,IAAImC,EAAUl4C,KAAIq/B,MAAO0a,UAC7BzlD,KAAKikD,WAAWqQ,UAAUyiD,SAAStxD,EAAS,IAE1D,CACA,cAAMuhF,CAASvhF,EAAUwhF,GACrB,OAAOjnI,KAAKikD,WAAWqQ,UAAU0yE,SAASvhF,EAAUwhF,EACxD,CACA,UAAAC,CAAW5lH,GACPthB,KAAKikD,WAAWqQ,UAAU4yE,WAAW5lH,EACzC,CACA,gBAAMg8G,CAAW3rB,EAAW5wG,EAAU,CAAC,GACnC,OAAOf,KAAKikD,WAAWI,kBAAkBi5E,WAAW3rB,EAAW5wG,EACnE,CAKA,GAAiBX,GACb,MAAQujD,OAAQf,GAASxiD,EACrBwiD,EAAKthC,GAAG7iB,aAAeuB,KAAK8jD,OAAOrlD,WAIlCuB,KAAKikD,WAAWK,UAAUhoC,MAAMsmC,EAAKthC,GAAI,CAC1C6vF,WAAYvuD,EAAKuuD,aAEhBtjG,OAAM5R,IAAS+D,KAAKpB,IAAI8I,MAAMzL,EAAI,IANnC+D,KAAKpB,IAAI8I,MAAM,IAAI1J,MAAM,GAAM8wI,qBAOvC,EEhUG,MAAMC,GAAU,CACnBC,QAAS,+FACTC,KAAM,6FAEG,GAA6B,YAG7BC,GAA4B,CACrC3iF,MAAO,EACP7vC,OAAQ,EACR+vC,UAAW,kECZf,MAAM,GAAMzoB,OAAO,GACb,GAAMA,OAAO,GACb,GAAMA,OAAO,GACb,GAAMA,OAAO,GACb,GAAMA,OAAO,GACbuwC,GAAQz1E,OAAO4P,OAAO,CACxB2rB,EAAG,GACHh9B,EAAG2mC,OAAO,GACViqC,EAAGjqC,OAAO,sEACV1nC,EAAG0nC,OAAO,sEACVrsB,EAAG,GACHg7D,GAAI3uC,OAAO,iFACX4uC,GAAI5uC,OAAO,iFACXgyD,KAAMhyD,OAAO,wEAEX,GAAa,CAAC3J,EAAGh9B,KAAOg9B,EAAIh9B,EAAI,IAAOA,EACvC04F,GAAO,CACTC,KAAMhyD,OAAO,sEACb,WAAAiyD,CAAYx5E,GACR,MAAM,EAAEngB,GAAMi4E,GACRvkE,EAAKg0B,OAAO,sCACZ3rB,GAAM,GAAM2rB,OAAO,sCACnB/zB,EAAK+zB,OAAO,uCACZ1rB,EAAKtI,EACLisF,EAAYj4D,OAAO,uCACnBr9B,EAAK,GAAW2R,EAAKmE,EAAGngB,GACxBsK,EAAK,IAAYyR,EAAKoE,EAAGngB,GAC/B,IAAIoiB,EAAK,GAAIjC,EAAI9V,EAAKqJ,EAAKpJ,EAAKqJ,EAAI3T,GAChCyiB,EAAK,IAAKpY,EAAK0R,EAAKzR,EAAK0R,EAAIhc,GACjC,MAAM86F,EAAQ14E,EAAKu9E,EACb5E,EAAQt4E,EAAKk9E,EAKnB,GAJI7E,IACA14E,EAAKpiB,EAAIoiB,GACT24E,IACAt4E,EAAKziB,EAAIyiB,GACTL,EAAKu9E,GAAal9E,EAAKk9E,EACvB,MAAM,IAAIj+F,MAAM,2CAA6Cye,GAEjE,MAAO,CAAE26E,QAAO14E,KAAI24E,QAAOt4E,KAC/B,GAEEo7D,GAAW,GACXg1D,GAAW,GAEX95C,GAAgBlb,GAAW,EAC3Bmb,GAAkB,EAAInb,GAAW,EAEvC,SAAS,GAAYpjE,GACjB,MAAM,EAAEsjB,EAAC,EAAEh9B,GAAMk3E,GACX6hB,EAAK,GAAIr/E,EAAIA,GACbs/E,EAAK,GAAID,EAAKr/E,GACpB,OAAO,GAAIs/E,EAAKh8D,EAAItjB,EAAI1Z,EAC5B,CACA,MAAM+xI,GAAmB76D,GAAMl6C,IAAM,GACrC,MAAMg1G,WAAiBrxI,MACnB,WAAA8O,CAAYrD,GACRskC,MAAMtkC,EACV,EAEJ,SAAS6lI,GAAenjG,GACpB,KAAMA,aAAiBojG,IACnB,MAAM,IAAIjjI,UAAU,yBAC5B,CACA,MAAMijI,GACF,WAAAziI,CAAYiK,EAAGs2D,EAAGmI,GACdx1E,KAAK+W,EAAIA,EACT/W,KAAKqtE,EAAIA,EACTrtE,KAAKw1E,EAAIA,CACb,CACA,iBAAOe,CAAWl6E,GACd,KAAMA,aAAa,IACf,MAAM,IAAIiQ,UAAU,4CAExB,OAAIjQ,EAAE6vC,OAAO,GAAM8iC,MACRugE,GAAcvgE,KAClB,IAAIugE,GAAclzI,EAAE0a,EAAG1a,EAAEgxE,EAAG,GACvC,CACA,oBAAOmiE,CAAc79D,GACjB,MAAM8E,EAkkBd,SAAqBtG,EAAM9zE,EAAIk4E,GAAMtG,GACjC,MAAMwhE,EAAU,IAAIj0I,MAAM20E,EAAKz0E,QAOzB20E,EAAW,GANMF,EAAK/nC,QAAO,CAAC8P,EAAK9N,EAAKxtC,IACtCwtC,IAAQ,GACD8N,GACXu3F,EAAQ7yI,GAAKs7C,EACN,GAAIA,EAAM9N,EAAK/tC,KACvB,IACqCA,GAOxC,OANA8zE,EAAKG,aAAY,CAACp4B,EAAK9N,EAAKxtC,IACpBwtC,IAAQ,GACD8N,GACXu3F,EAAQ7yI,GAAK,GAAIs7C,EAAMu3F,EAAQ7yI,GAAIP,GAC5B,GAAI67C,EAAM9N,EAAK/tC,KACvBg0E,GACIo/D,CACX,CAllBsBv/D,CAAYyB,EAAOjmE,KAAKrP,GAAMA,EAAEm5E,KAC9C,OAAO7D,EAAOjmE,KAAI,CAACrP,EAAGO,IAAMP,EAAEi6E,SAASG,EAAM75E,KACjD,CACA,iBAAO45E,CAAW7E,GACd,OAAO49D,GAAcC,cAAc79D,GAAQjmE,IAAI6jI,GAAch5D,WACjE,CACA,MAAArqC,CAAOC,GACHmjG,GAAenjG,GACf,MAAQp1B,EAAG8/D,EAAIxJ,EAAGyJ,EAAItB,EAAGuB,GAAO/2E,MACxB+W,EAAGk/D,EAAI5I,EAAG6I,EAAIV,EAAGW,GAAOhqC,EAC1BujG,EAAO,GAAI34D,EAAKA,GAChB44D,EAAO,GAAIx5D,EAAKA,GAChBygB,EAAK,GAAI/f,EAAK84D,GACd94C,EAAK,GAAI5gB,EAAKy5D,GACdE,EAAK,GAAI,GAAI94D,EAAKX,GAAMw5D,GACxBE,EAAK,GAAI,GAAI35D,EAAKa,GAAM24D,GAC9B,OAAO94C,IAAOC,GAAM+4C,IAAOC,CAC/B,CACA,MAAA1+D,GACI,OAAO,IAAIo+D,GAAcvvI,KAAK+W,EAAG,IAAK/W,KAAKqtE,GAAIrtE,KAAKw1E,EACxD,CACA,MAAAzhD,GACI,MAAQhd,EAAG8/D,EAAIxJ,EAAGyJ,EAAItB,EAAGuB,GAAO/2E,KAC1Bw2C,EAAI,GAAIqgC,EAAKA,GACbpgC,EAAI,GAAIqgC,EAAKA,GACbpgC,EAAI,GAAID,EAAIA,GACZq5F,EAAMj5D,EAAKpgC,EACXE,EAAI,GAAI,IAAO,GAAIm5F,EAAMA,GAAOt5F,EAAIE,IACpCE,EAAI,GAAI,GAAMJ,GACdK,EAAI,GAAID,EAAIA,GACZygC,EAAK,GAAIxgC,EAAI,GAAMF,GACnB2gC,EAAK,GAAI1gC,GAAKD,EAAI0gC,GAAM,GAAM3gC,GAC9B8gC,EAAK,GAAI,GAAMV,EAAKC,GAC1B,OAAO,IAAIw4D,GAAcl4D,EAAIC,EAAIE,EACrC,CACA,GAAApwD,CAAI+kB,GACAmjG,GAAenjG,GACf,MAAQp1B,EAAG8/D,EAAIxJ,EAAGyJ,EAAItB,EAAGuB,GAAO/2E,MACxB+W,EAAGk/D,EAAI5I,EAAG6I,EAAIV,EAAGW,GAAOhqC,EAChC,GAAI8pC,IAAO,IAAOC,IAAO,GACrB,OAAOl2E,KACX,GAAI62E,IAAO,IAAOC,IAAO,GACrB,OAAO3qC,EACX,MAAMujG,EAAO,GAAI34D,EAAKA,GAChB44D,EAAO,GAAIx5D,EAAKA,GAChBygB,EAAK,GAAI/f,EAAK84D,GACd94C,EAAK,GAAI5gB,EAAKy5D,GACdE,EAAK,GAAI,GAAI94D,EAAKX,GAAMw5D,GACxBE,EAAK,GAAI,GAAI35D,EAAKa,GAAM24D,GACxB34F,EAAI,GAAI8/C,EAAKD,GACbhvF,EAAI,GAAIioI,EAAKD,GACnB,GAAI74F,IAAM,GACN,OAAInvC,IAAM,GACC5H,KAAK+zB,SAGLw7G,GAAcvgE,KAG7B,MAAM+gE,EAAK,GAAIh5F,EAAIA,GACbi5F,EAAM,GAAIj5F,EAAIg5F,GACdr4E,EAAI,GAAIk/B,EAAKm5C,GACb14D,EAAK,GAAIzvE,EAAIA,EAAIooI,EAAM,GAAMt4E,GAC7B4f,EAAK,GAAI1vE,GAAK8vD,EAAI2f,GAAMu4D,EAAKI,GAC7Bx4D,EAAK,GAAIT,EAAKZ,EAAKp/B,GACzB,OAAO,IAAIw4F,GAAcl4D,EAAIC,EAAIE,EACrC,CACA,QAAAC,CAAStrC,GACL,OAAOnsC,KAAKonB,IAAI+kB,EAAMglC,SAC1B,CACA,cAAA0G,CAAeF,GACX,MAAMs4D,EAAKV,GAAcvgE,KACzB,GAAsB,iBAAX2I,GAAuBA,IAAW,GACzC,OAAOs4D,EACX,IAAI3zI,EAAI4zI,GAAgBv4D,GACxB,GAAIr7E,IAAM,GACN,OAAO0D,KACX,IAAKovI,GAAkB,CACnB,IAAI/yI,EAAI4zI,EACJnzH,EAAI9c,KACR,KAAO1D,EAAI,IACHA,EAAI,KACJD,EAAIA,EAAE+qB,IAAItK,IACdA,EAAIA,EAAEiX,SACNz3B,IAAM,GAEV,OAAOD,CACX,CACA,IAAI,MAAE+6F,EAAK,GAAE14E,EAAE,MAAE24E,EAAK,GAAEt4E,GAAOg3E,GAAKE,YAAY35F,GAC5Cg7F,EAAM24C,EACN14C,EAAM04C,EACNnzH,EAAI9c,KACR,KAAO0e,EAAK,IAAOK,EAAK,IAChBL,EAAK,KACL44E,EAAMA,EAAIlwE,IAAItK,IACdiC,EAAK,KACLw4E,EAAMA,EAAInwE,IAAItK,IAClBA,EAAIA,EAAEiX,SACNrV,IAAO,GACPK,IAAO,GAOX,OALIq4E,IACAE,EAAMA,EAAInmB,UACVkmB,IACAE,EAAMA,EAAIpmB,UACdomB,EAAM,IAAIg4C,GAAc,GAAIh4C,EAAIxgF,EAAIg/E,GAAKC,MAAOuB,EAAIlqB,EAAGkqB,EAAI/hB,GACpD8hB,EAAIlwE,IAAImwE,EACnB,CACA,gBAAA7lB,CAAiBL,GACb,MAAMC,EAAU89D,GAAmB,IAAM/9D,EAAI,EAAI,IAAMA,EAAI,EACrDM,EAAS,GACf,IAAIt1E,EAAI2D,KACJ8f,EAAOzjB,EACX,IAAK,IAAI4L,EAAS,EAAGA,EAASqpE,EAASrpE,IAAU,CAC7C6X,EAAOzjB,EACPs1E,EAAOr0E,KAAKwiB,GACZ,IAAK,IAAIljB,EAAI,EAAGA,EAAI,IAAMy0E,EAAI,GAAIz0E,IAC9BkjB,EAAOA,EAAKsH,IAAI/qB,GAChBs1E,EAAOr0E,KAAKwiB,GAEhBzjB,EAAIyjB,EAAKiU,QACb,CACA,OAAO49C,CACX,CACA,IAAAX,CAAK10E,EAAG6zI,IACCA,GAAenwI,KAAKksC,OAAOqjG,GAAc7pG,QAC1CyqG,EAAc,GAAMzqG,MACxB,MAAM2rC,EAAK8+D,GAAeA,EAAYC,cAAiB,EACvD,GAAI,IAAM/+D,EACN,MAAM,IAAIrzE,MAAM,iEAEpB,IAAI4zE,EAAcu+D,GAAe,GAAiBrlI,IAAIqlI,GACjDv+D,IACDA,EAAc5xE,KAAK0xE,iBAAiBL,GAChC8+D,GAAqB,IAAN9+D,IACfO,EAAc29D,GAAc/4D,WAAW5E,GACvC,GAAiB7mE,IAAIolI,EAAav+D,KAG1C,IAAIv1E,EAAIkzI,GAAcvgE,KAClBl4D,EAAIy4H,GAAc7pG,KACtB,MAAM4rC,EAAU,GAAK89D,GAAmB,IAAM/9D,EAAI,IAAMA,GAClDE,EAAa,IAAMF,EAAI,GACvBpxD,EAAO+jB,OAAO,GAAKqtC,EAAI,GACvBQ,EAAY,GAAKR,EACjBS,EAAU9tC,OAAOqtC,GACvB,IAAK,IAAIppE,EAAS,EAAGA,EAASqpE,EAASrpE,IAAU,CAC7C,MAAMtM,EAASsM,EAASspE,EACxB,IAAIQ,EAAQryE,OAAOpD,EAAI2jB,GACvB3jB,IAAMw1E,EACFC,EAAQR,IACRQ,GAASF,EACTv1E,GAAK,IAET,MAAM01E,EAAUr2E,EACVs2E,EAAUt2E,EAASa,KAAKyP,IAAI8lE,GAAS,EACrCG,EAAQjqE,EAAS,GAAM,EACvBkqE,EAAQJ,EAAQ,EACR,IAAVA,EACAj7D,EAAIA,EAAEsQ,IAAI6pD,GAAgBiB,EAAON,EAAYI,KAG7C31E,EAAIA,EAAE+qB,IAAI6pD,GAAgBkB,EAAOP,EAAYK,IAErD,CACA,MAAO,CAAE51E,IAAGya,IAChB,CACA,QAAA4gE,CAASC,EAAQw4D,GACb,IACIx3D,EACA6e,EAFAl7F,EAAI4zI,GAAgBv4D,GAGxB,GAAIy3D,GAAkB,CAClB,MAAM,MAAEh4C,EAAK,GAAE14E,EAAE,MAAE24E,EAAK,GAAEt4E,GAAOg3E,GAAKE,YAAY35F,GAClD,IAAMD,EAAGi7F,EAAKxgF,EAAG2gF,GAAQz3F,KAAKgxE,KAAKtyD,EAAIyxH,IACjC9zI,EAAGk7F,EAAKzgF,EAAG4gF,GAAQ13F,KAAKgxE,KAAKjyD,EAAIoxH,GACvC74C,EAAMrmB,GAAgBmmB,EAAOE,GAC7BC,EAAMtmB,GAAgBomB,EAAOE,GAC7BA,EAAM,IAAIg4C,GAAc,GAAIh4C,EAAIxgF,EAAIg/E,GAAKC,MAAOuB,EAAIlqB,EAAGkqB,EAAI/hB,GAC3DmD,EAAQ2e,EAAIlwE,IAAImwE,GAChBC,EAAOC,EAAIrwE,IAAIswE,EACnB,KACK,CACD,MAAM,EAAEr7F,EAAC,EAAEya,GAAM9W,KAAKgxE,KAAK10E,EAAG6zI,GAC9Bx3D,EAAQt8E,EACRm7F,EAAO1gF,CACX,CACA,OAAOy4H,GAAc/4D,WAAW,CAACmC,EAAO6e,IAAO,EACnD,CACA,QAAAlhB,CAAS+5D,GACL,MAAM,EAAEt5H,EAAC,EAAEs2D,EAAC,EAAEmI,GAAMx1E,KACdsvE,EAAMtvE,KAAKksC,OAAOqjG,GAAcvgE,MAC1B,MAARqhE,IACAA,EAAO/gE,EAAM,GAAM,GAAOkG,IAC9B,MAAM86D,EAAMD,EACNE,EAAM,GAAID,EAAMA,GAChBE,EAAM,GAAID,EAAMD,GAChB76D,EAAK,GAAI1+D,EAAIw5H,GACb76D,EAAK,GAAIrI,EAAImjE,GACb76D,EAAK,GAAIH,EAAI86D,GACnB,GAAIhhE,EACA,OAAO,GAAMN,KACjB,GAAI2G,IAAO,GACP,MAAM,IAAI33E,MAAM,oBACpB,OAAO,IAAI,GAAMy3E,EAAIC,EACzB,EAIJ,SAASzE,GAAgBC,EAAWxvB,GAChC,MAAMotB,EAAMptB,EAAKyvB,SACjB,OAAOD,EAAYpC,EAAMptB,CAC7B,CALA6tF,GAAc7pG,KAAO,IAAI6pG,GAAch7D,GAAM5B,GAAI4B,GAAM3B,GAAI,IAC3D28D,GAAcvgE,KAAO,IAAIugE,GAAc,GAAK,GAAK,IAKjD,MAAM,GAAmB,IAAI/jG,QACtB,MAAM,GACT,WAAA1+B,CAAYiK,EAAGs2D,GACXrtE,KAAK+W,EAAIA,EACT/W,KAAKqtE,EAAIA,CACb,CACA,cAAAqJ,CAAenF,GACXvxE,KAAKowI,aAAe7+D,EACpB,GAAiBvuB,OAAOhjD,KAC5B,CACA,QAAA22F,GACI,OAAO32F,KAAKqtE,EAAI,KAAQ,EAC5B,CACA,wBAAOojE,CAAkBn+H,GACrB,MAAMo+H,EAA2B,KAAjBp+H,EAAM5W,OAChBqb,EAAI45H,GAAcD,EAAUp+H,EAAQA,EAAMihB,SAAS,IACzD,IAAKq9G,GAAoB75H,GACrB,MAAM,IAAI/Y,MAAM,yBAEpB,IAAIqvE,EA6SZ,SAAiBt2D,GACb,MAAM,EAAEk3D,GAAMsG,GACR6mB,EAAMp3D,OAAO,GACbq3D,EAAOr3D,OAAO,IACds3D,EAAOt3D,OAAO,IACdu3D,EAAOv3D,OAAO,IACdw3D,EAAOx3D,OAAO,IACdy3D,EAAOz3D,OAAO,IACd1rB,EAAMvB,EAAIA,EAAIA,EAAKk3D,EACnB11D,EAAMD,EAAKA,EAAKvB,EAAKk3D,EACrBv1D,EAAM,GAAKH,EAAI,IAAOA,EAAM01D,EAC5Bp1D,EAAM,GAAKH,EAAI,IAAOH,EAAM01D,EAC5Bl1D,EAAO,GAAKF,EAAI,IAAOP,EAAM21D,EAC7Bv0D,EAAO,GAAKX,EAAKsiF,GAAQtiF,EAAOk1D,EAChCjzD,EAAO,GAAKtB,EAAK4hF,GAAQ5hF,EAAOu0D,EAChCytB,EAAO,GAAK1gF,EAAKwgF,GAAQxgF,EAAOizD,EAChC0tB,EAAQ,GAAKD,EAAKD,GAAQC,EAAOztB,EACjC2tB,EAAQ,GAAKD,EAAMH,GAAQxgF,EAAOizD,EAClC4tB,EAAQ,GAAKD,EAAM,IAAOrjF,EAAM01D,EAChC8oB,EAAM,GAAK8E,EAAMN,GAAQ7hF,EAAOu0D,EAChCgB,EAAM,GAAK8nB,EAAIqE,GAAO9iF,EAAM21D,EAC5B4iE,EAAK,GAAK5hE,EAAI,IAEpB,GADY4hE,EAAKA,EAAM5iE,IACZl3D,EACP,MAAM,IAAI/Y,MAAM,2BACpB,OAAO6yI,CACX,CAvUgB,CADG,GAAY95H,IAEvB,MAAM+5H,GAAUzjE,EAAI,MAAS,GACzBqjE,EACII,IACAzjE,EAAI,IAAKA,MAG6B,GAAlB/6D,EAAM,MACPw+H,IACnBzjE,EAAI,IAAKA,IAEjB,MAAMsL,EAAQ,IAAI,GAAM5hE,EAAGs2D,GAE3B,OADAsL,EAAM/B,iBACC+B,CACX,CACA,0BAAOo4D,CAAoBz+H,GACvB,MAAMyE,EAAI45H,GAAcr+H,EAAMihB,SAAS,EAAG4mD,GAAW,IAC/C9M,EAAIsjE,GAAcr+H,EAAMihB,SAAS4mD,GAAW,EAAc,EAAXA,GAAe,IAC9DxB,EAAQ,IAAI,GAAM5hE,EAAGs2D,GAE3B,OADAsL,EAAM/B,iBACC+B,CACX,CACA,cAAOT,CAAQ3gE,GACX,MAAMjF,EAAQ,GAAYiF,GACpB/Q,EAAM8L,EAAM5W,OACZ6gH,EAASjqG,EAAM,GACrB,GAAI9L,IAAQ2zE,GACR,OAAOn6E,KAAKywI,kBAAkBn+H,GAClC,GAAI9L,IAAQ6uF,KAA6B,IAAXknB,GAA8B,IAAXA,GAC7C,OAAOv8G,KAAKywI,kBAAkBn+H,GAElC,GAAI9L,IAAQ8uF,IAA8B,IAAXinB,EAC3B,OAAOv8G,KAAK+wI,oBAAoBz+H,GACpC,MAAM,IAAItU,MAAM,sDAAsDq3F,0BAAqCC,8BAA2C9uF,IAC1J,CACA,qBAAOgyE,CAAeyD,GAClB,OAAO,GAAMv2C,KAAKgyC,SAASs5D,GAAoB/0D,GACnD,CACA,oBAAOg1D,CAAcv4C,EAASiC,EAAWrC,GACrC,MAAM,EAAE1wF,EAAC,GAAQspI,GAAmBv2C,GACpC,IAAK,CAAC,EAAG,EAAG,EAAG,GAAGh+E,SAAS27E,GACvB,MAAM,IAAIt6F,MAAM,wCACpB,MAAM2Z,EAAIw5H,GAAa,GAAYz4C,KAC7B,EAAEp8F,GAAMi4E,GACRqkB,EAAoB,IAAbN,GAA+B,IAAbA,EAAiB1wF,EAAItL,EAAIsL,EAClDwpI,EAAO,GAAOx4C,EAAMt8F,GACpBw8F,EAAK,IAAKnhF,EAAIy5H,EAAM90I,GACpBy8F,EAAK,GAAIxjF,EAAI67H,EAAM90I,GACnBsJ,EAAoB,EAAX0yF,EAAe,KAAO,KAC/Bhf,EAAI,GAAMpB,QAAQtyE,EAASyrI,GAAYz4C,IACvClqB,EAAI,GAAMhpC,KAAKiyD,qBAAqBre,EAAGwf,EAAIC,GACjD,IAAKrqB,EACD,MAAM,IAAI1wE,MAAM,+CAEpB,OADA0wE,EAAEkI,iBACKlI,CACX,CACA,UAAAkK,CAAWgf,GAAe,GACtB,OAAO,GAAW53F,KAAK64E,MAAM+e,GACjC,CACA,KAAA/e,CAAM+e,GAAe,GACjB,MAAM7gF,EAAIs6H,GAAYrxI,KAAK+W,GAC3B,OAAI6gF,EAEO,GADQ53F,KAAK22F,WAAa,KAAO,OACrB5/E,IAGZ,KAAKA,IAAIs6H,GAAYrxI,KAAKqtE,IAEzC,CACA,MAAAikE,GACI,OAAOtxI,KAAK64E,OAAM,GAAMp7E,MAAM,EAClC,CACA,MAAA8zI,GACI,OAAOvxI,KAAK44E,YAAW,GAAMn7E,MAAM,EACvC,CACA,cAAAm5E,GACI,MAAM/hC,EAAM,kCACN,EAAE99B,EAAC,EAAEs2D,GAAMrtE,KACjB,IAAK4wI,GAAoB75H,KAAO65H,GAAoBvjE,GAChD,MAAM,IAAIrvE,MAAM62C,GACpB,MAAMzN,EAAO,GAAIimC,EAAIA,GAErB,GAAI,GAAIjmC,EADM,GAAYrwB,MACA,GACtB,MAAM,IAAI/Y,MAAM62C,EACxB,CACA,MAAA3I,CAAOC,GACH,OAAOnsC,KAAK+W,IAAMo1B,EAAMp1B,GAAK/W,KAAKqtE,IAAMlhC,EAAMkhC,CAClD,CACA,MAAA8D,GACI,OAAO,IAAI,GAAMnxE,KAAK+W,EAAG,IAAK/W,KAAKqtE,GACvC,CACA,MAAAt5C,GACI,OAAOw7G,GAAch5D,WAAWv2E,MAAM+zB,SAASuiD,UACnD,CACA,GAAAlvD,CAAI+kB,GACA,OAAOojG,GAAch5D,WAAWv2E,MAAMonB,IAAImoH,GAAch5D,WAAWpqC,IAAQmqC,UAC/E,CACA,QAAAmB,CAAStrC,GACL,OAAOnsC,KAAKonB,IAAI+kB,EAAMglC,SAC1B,CACA,QAAAuG,CAASC,GACL,OAAO43D,GAAch5D,WAAWv2E,MAAM03E,SAASC,EAAQ33E,MAAMs2E,UACjE,CACA,oBAAAqhB,CAAqBjpB,EAAGr0C,EAAGh9B,GACvB,MAAM4wE,EAAIshE,GAAch5D,WAAWv2E,MAC7BwxI,EAAKn3G,IAAM,IAAOA,IAAM,IAAOr6B,OAAS,GAAM0lC,KAAOuoC,EAAE4J,eAAex9C,GAAK4zC,EAAEyJ,SAASr9C,GACtFo3G,EAAKlC,GAAch5D,WAAW7H,GAAGmJ,eAAex6E,GAChD4tE,EAAMumE,EAAGpqH,IAAIqqH,GACnB,OAAOxmE,EAAI/+B,OAAOqjG,GAAcvgE,WAAQjxE,EAAYktE,EAAIqL,UAC5D,EAIJ,SAASo7D,GAASn8H,GACd,OAAO7V,OAAOoJ,SAASyM,EAAE,GAAI,KAAO,EAAI,KAAOA,EAAIA,CACvD,CACA,SAASo8H,GAAYvzG,GACjB,GAAIA,EAAK1iC,OAAS,GAAiB,IAAZ0iC,EAAK,GACxB,MAAM,IAAIpgC,MAAM,kCAAkC,GAAWogC,MAEjE,MAAM53B,EAAM43B,EAAK,GACXW,EAAMX,EAAK7K,SAAS,EAAG/sB,EAAM,GACnC,IAAKA,GAAOu4B,EAAIrjC,SAAW8K,EACvB,MAAM,IAAIxI,MAAM,2CAEpB,GAAe,IAAX+gC,EAAI,IAAeA,EAAI,IAAM,IAC7B,MAAM,IAAI/gC,MAAM,8CAEpB,MAAO,CAAEogC,KAAMuyG,GAAc5xG,GAAMqI,KAAMhJ,EAAK7K,SAAS/sB,EAAM,GACjE,CAlBA,GAAMk/B,KAAO,IAAI,GAAM6uC,GAAM5B,GAAI4B,GAAM3B,IACvC,GAAM5D,KAAO,IAAI,GAAM,GAAK,IAgCrB,MAAMqpB,GACT,WAAAvrF,CAAYlF,EAAG2N,GACXvV,KAAK4H,EAAIA,EACT5H,KAAKuV,EAAIA,EACTvV,KAAK42E,gBACT,CACA,kBAAO2hB,CAAYhhF,GACf,MAAMu8B,EAAMv8B,aAAe5V,WACrBkK,EAAO,wBACb,GAAmB,iBAAR0L,IAAqBu8B,EAC5B,MAAM,IAAIxnC,UAAU,GAAGT,oCAC3B,MAAM6G,EAAMohC,EAAM,GAAWv8B,GAAOA,EACpC,GAAmB,MAAf7E,EAAIhX,OACJ,MAAM,IAAIsC,MAAM,GAAG6N,2BACvB,OAAO,IAAIwsF,GAAU,GAAY3lF,EAAIjV,MAAM,EAAG,KAAM,GAAYiV,EAAIjV,MAAM,GAAI,MAClF,CACA,cAAOmvF,CAAQr1E,GACX,MAAMu8B,EAAMv8B,aAAe5V,WAC3B,GAAmB,iBAAR4V,IAAqBu8B,EAC5B,MAAM,IAAIxnC,UAAU,oDACxB,MAAM,EAAG,EAAEiJ,GAlCnB,SAA2B6oB,GACvB,GAAIA,EAAK1iC,OAAS,GAAgB,IAAX0iC,EAAK,GACxB,MAAM,IAAIpgC,MAAM,0BAA0B,GAAWogC,MAEzD,GAAIA,EAAK,KAAOA,EAAK1iC,OAAS,EAC1B,MAAM,IAAIsC,MAAM,uCAEpB,MAAQogC,KAAMx2B,EAAGw/B,KAAMwtD,GAAW+8C,GAAYvzG,EAAK7K,SAAS,KACpD6K,KAAM7oB,EAAG6xB,KAAMytD,GAAe88C,GAAY/8C,GAClD,GAAIC,EAAWn5F,OACX,MAAM,IAAIsC,MAAM,gDAAgD,GAAW62F,MAE/E,MAAO,CAAEjtF,IAAG2N,IAChB,CAqByBq8H,CAAkB99F,EAAMv8B,EAAM,GAAWA,IAC1D,OAAO,IAAI8gF,GAAUzwF,EAAG2N,EAC5B,CACA,cAAO2iE,CAAQ3gE,GACX,OAAOvX,KAAK4sF,QAAQr1E,EACxB,CACA,cAAAq/D,GACI,MAAM,EAAEhvE,EAAC,EAAE2N,GAAMvV,KACjB,IAAK21F,GAAmB/tF,GACpB,MAAM,IAAI5J,MAAM,0CACpB,IAAK23F,GAAmBpgF,GACpB,MAAM,IAAIvX,MAAM,yCACxB,CACA,QAAAg7F,GACI,MAAM64C,EAAOt9D,GAAMj4E,GAAK,GACxB,OAAO0D,KAAKuV,EAAIs8H,CACpB,CACA,UAAA54C,GACI,OAAOj5F,KAAKg5F,WAAa,IAAIX,GAAUr4F,KAAK4H,EAAG,IAAK5H,KAAKuV,EAAGg/D,GAAMj4E,IAAM0D,IAC5E,CACA,aAAAk5F,GACI,OAAO,GAAWl5F,KAAKm5F,WAC3B,CACA,QAAAA,GACI,MAAM24C,EAAOJ,GAAS,GAAoB1xI,KAAKuV,IACzCw8H,EAAOL,GAAS,GAAoB1xI,KAAK4H,IACzCoqI,EAAQF,EAAKp2I,OAAS,EACtBu2I,EAAQF,EAAKr2I,OAAS,EACtBw2I,EAAO,GAAoBF,GAC3BG,EAAO,GAAoBF,GAEjC,MAAO,KADQ,GAAoBA,EAAQD,EAAQ,OAC5BG,IAAOJ,MAASG,IAAOJ,GAClD,CACA,UAAAl5D,GACI,OAAO54E,KAAKk5F,eAChB,CACA,KAAArgB,GACI,OAAO74E,KAAKm5F,UAChB,CACA,iBAAAC,GACI,OAAO,GAAWp5F,KAAKq5F,eAC3B,CACA,YAAAA,GACI,OAAOg4C,GAAYrxI,KAAK4H,GAAKypI,GAAYrxI,KAAKuV,EAClD,EAEJ,SAAS,MAAegmC,GACpB,IAAKA,EAAO62D,OAAO/0G,GAAMA,aAAasE,aAClC,MAAM,IAAI3D,MAAM,4BACpB,GAAsB,IAAlBu9C,EAAO7/C,OACP,OAAO6/C,EAAO,GAClB,MAAM7/C,EAAS6/C,EAAOnT,QAAO,CAAC/N,EAAGyZ,IAAQzZ,EAAIyZ,EAAIp4C,QAAQ,GACnDyS,EAAS,IAAIxM,WAAWjG,GAC9B,IAAK,IAAIkB,EAAI,EAAG8qC,EAAM,EAAG9qC,EAAI2+C,EAAO7/C,OAAQkB,IAAK,CAC7C,MAAMk3C,EAAMyH,EAAO3+C,GACnBuR,EAAOpD,IAAI+oC,EAAKpM,GAChBA,GAAOoM,EAAIp4C,MACf,CACA,OAAOyS,CACX,CACA,MAAM,GAAQ3S,MAAMq/B,KAAK,CAAEn/B,OAAQ,MAAO,CAAC8N,EAAG5M,IAAMA,EAAE6B,SAAS,IAAI0rE,SAAS,EAAG,OAC/E,SAAS,GAAWioE,GAChB,KAAMA,aAAkBzwI,YACpB,MAAM,IAAI3D,MAAM,uBACpB,IAAIuZ,EAAM,GACV,IAAK,IAAI3a,EAAI,EAAGA,EAAIw1I,EAAO12I,OAAQkB,IAC/B2a,GAAO,GAAM66H,EAAOx1I,IAExB,OAAO2a,CACX,CACA,MAAM86H,GAAYruG,OAAO,uEACzB,SAASqtG,GAAYjnG,GACjB,GAAmB,iBAARA,EACP,MAAM,IAAIpsC,MAAM,mBACpB,KAAM,IAAOosC,GAAOA,EAAMioG,IACtB,MAAM,IAAIr0I,MAAM,kCACpB,OAAOosC,EAAI3rC,SAAS,IAAI0rE,SAAS,GAAI,IACzC,CACA,SAAS,GAAS//B,GACd,MAAM/sC,EAAI,GAAWg0I,GAAYjnG,IACjC,GAAiB,KAAb/sC,EAAE3B,OACF,MAAM,IAAIsC,MAAM,4BACpB,OAAOX,CACX,CACA,SAAS,GAAoB+sC,GACzB,MAAM7yB,EAAM6yB,EAAI3rC,SAAS,IACzB,OAAoB,EAAb8Y,EAAI7b,OAAa,IAAI6b,IAAQA,CACxC,CACA,SAAS,GAAYA,GACjB,GAAmB,iBAARA,EACP,MAAM,IAAIjL,UAAU,4CAA8CiL,GAEtE,OAAOysB,OAAO,KAAKzsB,IACvB,CACA,SAAS,GAAWA,GAChB,GAAmB,iBAARA,EACP,MAAM,IAAIjL,UAAU,2CAA6CiL,GAErE,GAAIA,EAAI7b,OAAS,EACb,MAAM,IAAIsC,MAAM,4CAA8CuZ,EAAI7b,QACtE,MAAMmZ,EAAQ,IAAIlT,WAAW4V,EAAI7b,OAAS,GAC1C,IAAK,IAAIkB,EAAI,EAAGA,EAAIiY,EAAMnZ,OAAQkB,IAAK,CACnC,MAAMQ,EAAQ,EAAJR,EACJ01I,EAAU/6H,EAAI9Z,MAAML,EAAGA,EAAI,GAC3BskC,EAAOhiC,OAAOoJ,SAASwpI,EAAS,IACtC,GAAI5yI,OAAOyD,MAAMu+B,IAASA,EAAO,EAC7B,MAAM,IAAI1jC,MAAM,yBACpB6W,EAAMjY,GAAK8kC,CACf,CACA,OAAO7sB,CACX,CACA,SAAS87H,GAAcr+H,GACnB,OAAO,GAAY,GAAWA,GAClC,CACA,SAAS,GAAYiF,GACjB,OAAOA,aAAe5V,WAAaA,WAAWk5B,KAAKtjB,GAAO,GAAWA,EACzE,CACA,SAAS24H,GAAgB9lG,GACrB,GAAmB,iBAARA,GAAoB1qC,OAAO2zC,cAAcjJ,IAAQA,EAAM,EAC9D,OAAOpG,OAAOoG,GAClB,GAAmB,iBAARA,GAAoBurD,GAAmBvrD,GAC9C,OAAOA,EACX,MAAM,IAAI99B,UAAU,sDACxB,CACA,SAAS,GAAI+tB,EAAGh9B,EAAIk3E,GAAMtG,GACtB,MAAM9/D,EAASksB,EAAIh9B,EACnB,OAAO8Q,GAAU,GAAMA,EAAS9Q,EAAI8Q,CACxC,CACA,SAAS,GAAK4I,EAAGk2D,GACb,MAAM,EAAEgB,GAAMsG,GACd,IAAIx1C,EAAMhoB,EACV,KAAOk2D,KAAU,IACbluC,GAAOA,EACPA,GAAOkvC,EAEX,OAAOlvC,CACX,CA4BA,SAAS,GAAOqU,EAAQ85B,EAASqH,GAAMtG,GACnC,GAAI76B,IAAW,IAAO85B,GAAU,GAC5B,MAAM,IAAIlvE,MAAM,6CAA6Co1C,SAAc85B,KAE/E,IAAI7yC,EAAI,GAAI+Y,EAAQ85B,GAChB7vE,EAAI6vE,EACJn2D,EAAI,GAAKs2D,EAAI,GAAKC,EAAI,GAAK9jE,EAAI,GACnC,KAAO6wB,IAAM,IAAK,CACd,MAAMtD,EAAI15B,EAAIg9B,EACRzyB,EAAIvK,EAAIg9B,EACRxd,EAAI9F,EAAIu2D,EAAIv2C,EACZz6B,EAAI+wE,EAAI7jE,EAAIutB,EAClB15B,EAAIg9B,EAAGA,EAAIzyB,EAAGmP,EAAIu2D,EAAGD,EAAI7jE,EAAG8jE,EAAIzwD,EAAGrT,EAAIlN,CAC3C,CAEA,GADYe,IACA,GACR,MAAM,IAAIW,MAAM,0BACpB,OAAO,GAAI+Y,EAAGm2D,EAClB,CAuBA,SAASikE,GAAanlI,EAAMumI,GAAe,GACvC,MAAM56H,EANV,SAAoBrF,GAChB,MAAMonF,EAAuB,EAAfpnF,EAAM5W,OAAwB,EAAXyzI,GAC3B/kG,EAAMumG,GAAcr+H,GAC1B,OAAOonF,EAAQ,EAAItvD,GAAOpG,OAAO01D,GAAStvD,CAC9C,CAEcooG,CAAWxmI,GACrB,GAAIumI,EACA,OAAO56H,EACX,MAAM,GAAQ48D,GACd,OAAO58D,GAAKrb,EAAIqb,EAAIrb,EAAIqb,CAC5B,CACA,IAAI86H,GACAC,GACJ,MAAMC,GACF,WAAA7lI,CAAYy+D,EAASC,GAGjB,GAFAxrE,KAAKurE,QAAUA,EACfvrE,KAAKwrE,SAAWA,EACO,iBAAZD,GAAwBA,EAAU,EACzC,MAAM,IAAIvtE,MAAM,4BACpB,GAAwB,iBAAbwtE,GAAyBA,EAAW,EAC3C,MAAM,IAAIxtE,MAAM,6BACpBgC,KAAKwJ,EAAI,IAAI7H,WAAW4pE,GAAS91B,KAAK,GACtCz1C,KAAKyc,EAAI,IAAI9a,WAAW4pE,GAAS91B,KAAK,GACtCz1C,KAAKsqC,QAAU,CACnB,CACA,IAAAy1C,IAAQt9D,GACJ,OAAOk3D,GAAMi5D,WAAW5yI,KAAKyc,KAAMgG,EACvC,CACA,QAAAowH,IAAYpwH,GACR,OAAOiwH,GAAgB1yI,KAAKyc,KAAMgG,EACtC,CACA,SAAAqwH,GACI,GAA+B,mBAApBJ,GACP,MAAM,IAAIrD,GAAS,iCAC3B,CACA,IAAApP,GACI,GAAIjgI,KAAKsqC,SAAW,IAChB,MAAM,IAAItsC,MAAM,qDACpBgC,KAAKsqC,SAAW,CACpB,CACA,YAAMohC,CAAOptD,EAAO,IAAI3c,YACpB3B,KAAKyc,QAAUzc,KAAK+/E,KAAK//E,KAAKwJ,EAAG7H,WAAWk5B,KAAK,CAAC,IAAQvc,GAC1Dte,KAAKwJ,QAAUxJ,KAAK+/E,KAAK//E,KAAKwJ,GACV,IAAhB8U,EAAK5iB,SAETsE,KAAKyc,QAAUzc,KAAK+/E,KAAK//E,KAAKwJ,EAAG7H,WAAWk5B,KAAK,CAAC,IAAQvc,GAC1Dte,KAAKwJ,QAAUxJ,KAAK+/E,KAAK//E,KAAKwJ,GAClC,CACA,UAAAupI,CAAWz0H,EAAO,IAAI3c,YAClB3B,KAAK8yI,YACL9yI,KAAKyc,EAAIzc,KAAK6yI,SAAS7yI,KAAKwJ,EAAG7H,WAAWk5B,KAAK,CAAC,IAAQvc,GACxDte,KAAKwJ,EAAIxJ,KAAK6yI,SAAS7yI,KAAKwJ,GACR,IAAhB8U,EAAK5iB,SAETsE,KAAKyc,EAAIzc,KAAK6yI,SAAS7yI,KAAKwJ,EAAG7H,WAAWk5B,KAAK,CAAC,IAAQvc,GACxDte,KAAKwJ,EAAIxJ,KAAK6yI,SAAS7yI,KAAKwJ,GAChC,CACA,cAAMwpI,GACFhzI,KAAKigI,OACL,IAAIz5H,EAAM,EACV,MAAMmhC,EAAM,GACZ,KAAOnhC,EAAMxG,KAAKwrE,UAAU,CACxBxrE,KAAKwJ,QAAUxJ,KAAK+/E,KAAK//E,KAAKwJ,GAC9B,MAAMmiE,EAAK3rE,KAAKwJ,EAAE/L,QAClBkqC,EAAIrqC,KAAKquE,GACTnlE,GAAOxG,KAAKwJ,EAAE9N,MAClB,CACA,OAAO,MAAeisC,EAC1B,CACA,YAAAsrG,GACIjzI,KAAK8yI,YACL9yI,KAAKigI,OACL,IAAIz5H,EAAM,EACV,MAAMmhC,EAAM,GACZ,KAAOnhC,EAAMxG,KAAKwrE,UAAU,CACxBxrE,KAAKwJ,EAAIxJ,KAAK6yI,SAAS7yI,KAAKwJ,GAC5B,MAAMmiE,EAAK3rE,KAAKwJ,EAAE/L,QAClBkqC,EAAIrqC,KAAKquE,GACTnlE,GAAOxG,KAAKwJ,EAAE9N,MAClB,CACA,OAAO,MAAeisC,EAC1B,EAEJ,SAASguD,GAAmBvrD,GACxB,OAAO,GAAMA,GAAOA,EAAMmqC,GAAMj4E,CACpC,CACA,SAASs0I,GAAoBxmG,GACzB,OAAO,GAAMA,GAAOA,EAAMmqC,GAAMtG,CACpC,CACA,SAASilE,GAAS54C,EAAQz9E,EAAGC,EAAGu3E,GAAO,GACnC,MAAM,EAAE/3F,GAAMi4E,GACR93D,EAAI00H,GAAa72C,GAAQ,GAC/B,IAAK3E,GAAmBl5E,GACpB,OACJ,MAAM02H,EAAO,GAAO12H,EAAGngB,GACjBy6B,EAAI,GAAM2O,KAAKgyC,SAASj7D,GACxB7U,EAAI,GAAImvB,EAAEhgB,EAAGza,GACnB,GAAIsL,IAAM,GACN,OACJ,MAAM2N,EAAI,GAAI49H,EAAO,GAAIt2H,EAAIC,EAAIlV,EAAGtL,GAAIA,GACxC,GAAIiZ,IAAM,GACN,OACJ,IAAIgkE,EAAM,IAAI8e,GAAUzwF,EAAG2N,GACvB+iF,GAAYvhE,EAAEhgB,IAAMwiE,EAAI3xE,EAAI,EAAI,GAAKlI,OAAOq3B,EAAEs2C,EAAI,IAKtD,OAJIgnB,GAAQ9a,EAAIyf,aACZzf,EAAMA,EAAI0f,aACVX,GAAY,GAET,CAAE/e,MAAK+e,WAClB,CACA,SAAS04C,GAAoBjlI,GACzB,IAAIq+B,EACJ,GAAmB,iBAARr+B,EACPq+B,EAAMr+B,OAEL,GAAmB,iBAARA,GAAoBrM,OAAO2zC,cAActnC,IAAQA,EAAM,EACnEq+B,EAAMpG,OAAOj4B,QAEZ,GAAmB,iBAARA,EAAkB,CAC9B,GAAIA,EAAIrQ,SAAW,EAAIyzI,GACnB,MAAM,IAAInxI,MAAM,oCACpBosC,EAAM,GAAYr+B,EACtB,KACK,MAAIA,aAAepK,YAMpB,MAAM,IAAI2K,UAAU,8BALpB,GAAIP,EAAIrQ,SAAWyzI,GACf,MAAM,IAAInxI,MAAM,oCACpBosC,EAAMumG,GAAc5kI,EAIxB,CACA,IAAK4pF,GAAmBvrD,GACpB,MAAM,IAAIpsC,MAAM,qCACpB,OAAOosC,CACX,CAUA,SAAS8mG,GAAmBv2C,GACxB,GAAIA,aAAqBtC,GAErB,OADAsC,EAAU/jB,iBACH+jB,EAEX,IACI,OAAOtC,GAAUzL,QAAQ+N,EAC7B,CACA,MAAOjzF,GACH,OAAO2wF,GAAUE,YAAYoC,EACjC,CACJ,CA4BA,SAASxF,GAAS7iF,GAEd,OAAOq+H,GADOr+H,EAAM5W,OAASy+E,GAAW7nE,EAAM7U,MAAM,EAAG08E,IAAY7nE,EAEvE,CACA,SAAS8gI,GAAY9gI,GACjB,MAAM+gI,EAAKl+C,GAAS7iF,GACdspE,EAAK,GAAIy3D,EAAI9+D,GAAMj4E,GACzB,OAAOs9F,GAAWhe,EAAK,GAAMy3D,EAAKz3D,EACtC,CACA,SAASge,GAAWxvD,GAChB,OAAO,GAASA,EACpB,CA4CA,MAAMkpG,GAAQ,CAAEC,QAAQ,GA4KxB,GAAM7tG,KAAKgxC,eAAe,GAC1B,MAAM,GAAS,CACX1lE,KAAM,GACNwiI,IAAqB,iBAATxpI,MAAqB,WAAYA,KAAOA,KAAKghC,YAASjtC,GAOhE,GAAuB,CAAC,EACjB47E,GAAQ,CACjB85D,WAAU,GACVC,WAAU,GACVC,YAAW,GACXvuI,IAAG,GACHgoE,OAAM,GACN,iBAAAksB,CAAkBrd,GACd,IAEI,OADA+0D,GAAoB/0D,IACb,CACX,CACA,MAAOv0E,GACH,OAAO,CACX,CACJ,EACAksI,iBAAkB,GAClBC,qBAAsB7C,GACtB8C,iBAAmB9nI,IACfA,EAAO,GAAYA,GACnB,MAAMutF,EAAS41C,GAAW,EAC1B,GAAInjI,EAAKtQ,OAAS69F,GAAUvtF,EAAKtQ,OAAS,KACtC,MAAM,IAAIsC,MAAM,uDAGpB,OAAO,GADK,GAAI2yI,GAAc3kI,GAAOuoE,GAAMj4E,EAAI,IAAO,GAClC,EAExB83E,YAAa,CAACr/B,EAAc,MACxB,GAAI,GAAOy+F,IACP,OAAO,GAAOA,IAAIx+F,gBAAgB,IAAIrzC,WAAWozC,IAEhD,GAAI,GAAO/jC,KAAM,CAClB,MAAM,YAAEojE,GAAgB,GAAOpjE,KAC/B,OAAOrP,WAAWk5B,KAAKu5C,EAAYr/B,GACvC,CAEI,MAAM,IAAI/2C,MAAM,oDACpB,EAEJ47E,iBAAkB,IAAMD,GAAMm6D,iBAAiBn6D,GAAMvF,YAAY+6D,GAAW,IAC5E,UAAAt1D,CAAWtI,EAAa,EAAGoH,EAAQ,GAAMjzC,MACrC,MAAMunF,EAASt0C,IAAU,GAAMjzC,KAAOizC,EAAQ,IAAI,GAAMA,EAAM5hE,EAAG4hE,EAAMtL,GAGvE,OAFA4/C,EAAOv2C,eAAenF,GACtB07C,EAAOv1C,SAAS,IACTu1C,CACX,EACA8mB,OAAQhpG,SAAUmG,KACd,GAAI,GAAOsiG,IAAK,CACZ,MAAM12I,QAAe,GAAO02I,IAAIvoG,OAAOvzB,OAAO,UAAW,MAAew5B,IACxE,OAAO,IAAIvvC,WAAW7E,EAC1B,CACK,GAAI,GAAOkU,KAAM,CAClB,MAAM,WAAEgjI,GAAe,GAAOhjI,KACxBhF,EAAOgoI,EAAW,UAExB,OADA9iG,EAASplC,SAAS+Q,GAAM7Q,EAAK2E,OAAOkM,KAC7Blb,WAAWk5B,KAAK7uB,EAAK0L,SAChC,CAEI,MAAM,IAAI1Z,MAAM,+CACpB,EAEJ40I,WAAY7nG,MAAOh/B,KAAQmlC,KACvB,GAAI,GAAOsiG,IAAK,CACZ,MAAMS,QAAa,GAAOT,IAAIvoG,OAAOyyC,UAAU,MAAO3xE,EAAK,CAAEF,KAAM,OAAQG,KAAM,CAAEH,KAAM,aAAe,EAAO,CAAC,SAC1GpC,EAAU,MAAeynC,GACzBp0C,QAAe,GAAO02I,IAAIvoG,OAAO/nC,KAAK,OAAQ+wI,EAAMxqI,GAC1D,OAAO,IAAI9H,WAAW7E,EAC1B,CACK,GAAI,GAAOkU,KAAM,CAClB,MAAM,WAAEkjI,GAAe,GAAOljI,KACxBhF,EAAOkoI,EAAW,SAAUnoI,GAElC,OADAmlC,EAASplC,SAAS+Q,GAAM7Q,EAAK2E,OAAOkM,KAC7Blb,WAAWk5B,KAAK7uB,EAAK0L,SAChC,CAEI,MAAM,IAAI1Z,MAAM,oDACpB,EAEJm2I,gBAAYp2I,EACZq2I,oBAAgBr2I,EAChBs2I,WAAYtpG,MAAOuF,KAAQY,KACvB,IAAIojG,EAAO,GAAqBhkG,GAChC,QAAavyC,IAATu2I,EAAoB,CACpB,MAAMC,QAAa56D,GAAMo6D,OAAOpyI,WAAWk5B,KAAKyV,GAAMzyC,GAAMA,EAAEC,WAAW,MACzEw2I,EAAO,GAAYC,EAAMA,GACzB,GAAqBjkG,GAAOgkG,CAChC,CACA,OAAO36D,GAAMo6D,OAAOO,KAASpjG,EAAS,EAE1CsjG,eAAgB,CAAClkG,KAAQY,KACrB,GAA2B,mBAAhBuhG,GACP,MAAM,IAAIpD,GAAS,+CACvB,IAAIiF,EAAO,GAAqBhkG,GAChC,QAAavyC,IAATu2I,EAAoB,CACpB,MAAMC,EAAO9B,GAAY9wI,WAAWk5B,KAAKyV,GAAMzyC,GAAMA,EAAEC,WAAW,MAClEw2I,EAAO,GAAYC,EAAMA,GACzB,GAAqBjkG,GAAOgkG,CAChC,CACA,OAAO7B,GAAY6B,KAASpjG,EAAS,EAEzCujG,eAAgBlF,IAEpBzwI,OAAOmuB,iBAAiB0sD,GAAO,CAC3Bw6D,WAAY,CACRtpI,cAAc,EACdC,IAAG,IACQ2nI,GAEX,GAAA1nI,CAAIzI,GACKmwI,KACDA,GAAcnwI,EACtB,GAEJ8xI,eAAgB,CACZvpI,cAAc,EACdC,IAAG,IACQ4nI,GAEX,GAAA3nI,CAAIzI,GACKowI,KACDA,GAAkBpwI,EAC1B,sCC/qCD,SAASoyI,GAAU5hI,GACtB,OAAO,IAAInR,WAAWgzI,GAAKD,UAAUl9H,YAAY1E,GACrD,CAWO,SAAS8hI,GAAgBj6C,EAAWlxF,EAAS+vE,GAChD,IAEI,ODi3BD,SAAgBmhB,EAAWjC,EAASlf,EAAWn0C,EAAOiuG,IACzD,IAAI/5D,EACJ,IACIA,EAAM23D,GAAmBv2C,GACzBjC,EAAU,GAAYA,EAC1B,CACA,MAAOhxF,GACH,OAAO,CACX,CACA,MAAM,EAAEE,EAAC,EAAE2N,GAAMgkE,EACjB,GAAIl0C,EAAKkuG,QAAUh6D,EAAIyf,WACnB,OAAO,EACX,MAAMrhF,EAAIw5H,GAAaz4C,GACvB,IAAIzqB,EACJ,IACIA,EAvHR,SAA4BuL,GACxB,OAAIA,aAAqB,IACrBA,EAAU5C,iBACH4C,GAGA,GAAMtB,QAAQsB,EAE7B,CA+GYq7D,CAAmBr7D,EAC3B,CACA,MAAO9xE,GACH,OAAO,CACX,CACA,MAAM,EAAEpL,GAAMi4E,GACRugE,EAAO,GAAOv/H,EAAGjZ,GACjBw8F,EAAK,GAAInhF,EAAIm9H,EAAMx4I,GACnBy8F,EAAK,GAAInxF,EAAIktI,EAAMx4I,GACnBg9E,EAAI,GAAM5zC,KAAKiyD,qBAAqB1pB,EAAG6qB,EAAIC,GACjD,QAAKzf,GAEK,GAAIA,EAAEviE,EAAGza,KACNsL,CACjB,CC94Be,CADY,GAAe2wF,YAAYoC,EAAUl9F,MAAM,EAAG,KAClCgM,EAAS+vE,EAC5C,CACA,MACI,OAAO,CACX,CACJ,CCtCO,MACMu7D,GAAiB,oBCDvB,SAASC,GAA+BpiG,EAAK6S,GAChD,OAAQA,GACJ,IAAK,MACD,OAAQuvF,GAA+BpiG,EAAK,SACxCoiG,GAA+BpiG,EAAK,QAC5C,IAAK,MACD,OAAQoiG,GAA+BpiG,EAAK,SACxCoiG,GAA+BpiG,EAAK,QAEhD,MAAMqiG,EAASxvF,EAASzzB,SAAS,KAC3BkjH,EAAQtiG,EAAI9nC,IAAImqI,EAAS,MAAQ,MACvC,IAAKC,EACD,OACJ,MAAMC,EAAY1vF,EAAShoD,MAAM,EAAG,GACpC,IAAI23I,EACJ,OAAQD,GACJ,IAAK,MACDC,EAAWH,EAASriG,EAAI9nC,IAAI,QAAU8nC,EAAI9nC,IAAI,OAC9C,MACJ,IAAK,MACDsqI,EAAWH,EAASriG,EAAI9nC,IAAI,QAAU8nC,EAAI9nC,IAAI,OAC9C,MACJ,QACI,OAER,OAAKsqI,ECxBF,SAA6BC,EAAU5vF,EAAU6vF,EAASC,GAC7D,IAAI3kC,EAAK,GAAU,IAAMykC,EAAW,IAAM19E,GAAgB09E,EAAUC,IAEpE,OADA1kC,EAAKA,EAAGv1C,YAAY,GAAU,IAAM5V,EAAW,IAAMkS,GAAgBlS,EAAU8vF,KACxE3kC,CACX,CDsBW4kC,CAAoBP,EAAS,MAAQ,MAAOE,EAAWD,EAAOE,QAFrE,CAGJ,CEdO,SAASK,GAAiBtkC,GAC7B,MAAMl5D,EAAck5D,EAAW/oE,QAAO,CAAC8P,EAAK04D,IAAO14D,EHVlB,EGUgD04D,EAAGt+F,MAAM5W,QAAQ,GAC5F4W,EAAQ,IAAI3Q,WAAWs2C,GACvBpY,EAAW,IAAIC,SAASxtB,EAAMxV,QACpC,IAAIlB,EAAQ,EAUZ,OATAu1G,EAAWrlG,SAAS6lG,IAChB,GAAIA,EAAUl2C,YACV,MAAM,IAAIz9D,MAAM,8CAEpB6hC,EAASG,UAAUpkC,EAAO+1G,EAAUr/F,MAAM5W,QAC1CE,GHnB6B,EGoB7B0W,EAAMvH,IAAI4mG,EAAUr/F,MAAO1W,GAC3BA,GAAS+1G,EAAUr/F,MAAM5W,MAAM,IAE5B4W,CACX,CC9BO,SAASojI,GAAY9xF,GACxB,IAAIliB,EAAO,EAYX,OAXIkiB,EAAU6I,YACV/qB,GAAQ,GACZA,IAAe,EACXkiB,EAAUlnC,SACVglB,GAAQ,GACZA,IAAe,EACXkiB,EAAU2I,QACV7qB,GAAQ,GACZA,IAAe,EACXkiB,EAAUwI,QACV1qB,GAAQ,GACLA,CACX,CCRO,MAAMi0G,WAAelqG,IACxBmmE,IACAjX,UACA,WAAA7tF,CAAY8oI,EAAM,CAAC,EAAGhkC,EAAM5tE,OAAO,GAAI22D,GACnC5sD,MAAMjvC,OAAO+/D,QAAQ+2E,IACrB51I,KAAK4xG,IAAMA,EACX5xG,KAAK26F,UAAYA,CACrB,CACA,GAAA5vF,CAAI0R,EAAGjT,GAGH,OAFAxJ,KAAK26F,eAAY58F,EACjBiC,KAAK4xG,MACE7jE,MAAMhjC,IAAI0R,EAAGjT,EACxB,CACA,MAAI8X,GACA,MAAMA,EAAKthB,KAAK8K,IAAI,MACpB,IAAKwW,EACD,MAAM,IAAItjB,MAAM,iBACpB,OAAO+5C,GAAYz2B,EACvB,CACA,aAAIk4D,GACA,GACS,OADDx5E,KAAKshB,GAEL,OAAOthB,KAAK8K,IAAI,aAEhB,MAAM,IAAI9M,MAAM+2I,GAE5B,CACA,MAAIhrC,GACA,MAAMA,EAAK/pG,KAAK8K,IAAI,MACpB,GAAKi/F,EAEL,OAAOrwD,GAAiBqwD,EAC5B,CACA,OAAI8rC,GACA,MAAMA,EAAM71I,KAAK8K,IAAI,OACrB,GAAK+qI,EAEL,OAAOn8F,GAAiBm8F,EAC5B,CACA,MAAIj2H,GACA,OAAOk2H,GAAe91I,KAAM,KAAM,MACtC,CACA,MAAI4f,CAAGA,GACHm2H,GAAe/1I,KAAM,KAAM,MAAO4f,EACtC,CACA,OAAIg7C,GACA,OAAOo7E,GAAuBh2I,KAAM,MAAO,MAC/C,CACA,OAAI46D,CAAI9B,GACJm9E,GAAuBj2I,KAAM,MAAO,MAAO84D,EAC/C,CACA,OAAI+B,GACA,OAAOm7E,GAAuBh2I,KAAM,MAAO,MAC/C,CACA,OAAI66D,CAAI/B,GACJm9E,GAAuBj2I,KAAM,MAAO,MAAO84D,EAC/C,CACA,OAAIiC,GACA,OAAO+6E,GAAe91I,KAAM,MAAO,MACvC,CACA,OAAI+6D,CAAIn7C,GACJm2H,GAAe/1I,KAAM,MAAO,MAAO4f,EACvC,CACA,QAAIs2H,GACA,OAAOF,GAAuBh2I,KAAM,OAAQ,MAChD,CACA,QAAIk2I,CAAKp9E,GACLm9E,GAAuBj2I,KAAM,OAAQ,MAAO84D,EAChD,CACA,QAAIq9E,GACA,OAAOH,GAAuBh2I,KAAM,OAAQ,MAChD,CACA,QAAIm2I,CAAKr9E,GACLm9E,GAAuBj2I,KAAM,OAAQ,MAAO84D,EAChD,CAaA,cAAIq4C,GACA,MAAMilC,EAAMp2I,KAAK8K,IAAI,cACrB,GAAIsrI,EACA,OF9FL,SAA0B9jI,GAC7B,MAAM6+F,EAAa,GACnB,IAAIv1G,EAAQ,EACZ,KAAOA,EAAQ0W,EAAM5W,QAAQ,CACzB,MACMwK,EADe,IAAI45B,SAASxtB,EAAMxV,OAAQlB,EHAnB,GGCHmkC,UAAU,GACpCnkC,GHF6B,EGG7B,MAAMy6I,EAAiB/jI,EAAM7U,MAAM7B,EAAOA,EAAQsK,GAClDtK,GAASsK,EACTirG,EAAW7zG,KAAK,GAAU+4I,GAC9B,CACA,OAAOllC,CACX,CEkFmBmlC,CAAiBF,EAEhC,CAaA,cAAIjlC,CAAWA,GACXolC,GAAgBv2I,KAAM,aAAcmxG,EAAYskC,GACpD,CAIA,SAAIe,GACA,MAAMJ,EAAMp2I,KAAK8K,IAAI,SACrB,GAAIsrI,EACA,ODzGL,SAAqB10G,GACxB,MAAM80G,EAAQ,CACVpqF,OAAO,EACPG,OAAO,EACP7vC,QAAQ,EACR+vC,WAAW,GAaf,OAXI/qB,EAAO,IACP80G,EAAMpqF,OAAQ,IAClB1qB,IAAe,GACJ,IACP80G,EAAMjqF,OAAQ,IAClB7qB,IAAe,GACJ,IACP80G,EAAM95H,QAAS,IACnBglB,IAAe,GACJ,IACP80G,EAAM/pF,WAAY,GACf+pF,CACX,CCsFmBC,CAAYL,EAAI,GAE/B,CAIA,SAAII,CAAMA,GACND,GAAgBv2I,KAAM,QAASw2I,GAAQ1gI,GAAM,IAAInU,WAAW,CAAC+zI,GAAY5/H,MAC7E,EAEJ,SAASggI,GAAepqI,EAAKK,EAAK6uC,GAC9B,MAAMw7F,EAAM1qI,EAAIZ,IAAIiB,GACpB,GAAKqqI,EAEL,OAAOz+E,GAAgB/c,EAAOw7F,EAClC,CACA,SAASJ,GAAuBtqI,EAAKK,EAAK6uC,GACtC,MAAMw7F,EAAM1qI,EAAIZ,IAAIiB,GACpB,GAAKqqI,EAEL,OAAO12I,OAAOi4D,GAAgB/c,EAAOw7F,GACzC,CACA,SAASL,GAAerqI,EAAKK,EAAK6uC,EAAOn7C,GACrC82I,GAAgB7qI,EAAKK,EAAKtM,EAAO84D,GAAez0D,KAAK,CAAC,EAAG82C,GAC7D,CACA,SAASq7F,GAAuBvqI,EAAKK,EAAK6uC,EAAOn7C,GAC7Cs2I,GAAerqI,EAAKK,EAAK6uC,EAAOn7C,GAAOhB,SAAS,IACpD,CACA,SAAS83I,GAAgB7qI,EAAKK,EAAKtM,EAAO4yE,QACxBt0E,IAAV0B,EACAiM,EAAIX,IAAIgB,EAAKsmE,EAAU5yE,IAGvBiM,EAAIs3C,OAAOj3C,EAEnB,CCxJOg/B,eAAe,GAAK0tC,EAAS5jC,GAChC,OR23BJ9J,eAAoB2tD,EAASjgB,EAASpzC,EAAO,CAAC,GAC1C,MAAM,KAAE/mB,EAAI,EAAEzB,EAAC,EAAEC,GAzBrB,SAAqB47E,EAASzc,EAAYie,GACtC,GAAe,MAAXxB,EACA,MAAM,IAAI16F,MAAM,2CAA2C06F,MAC/D,MAAMj6E,EAAK,GAAYi6E,GACjB57E,EAAIk0H,GAAoB/0D,GACxBoe,EAAW,CAACT,GAAW98E,GAAIs2H,GAAY30H,IAC7C,GAAoB,MAAhBy7E,EAAsB,EACD,IAAjBA,IACAA,EAAevgB,GAAMvF,YAAY+F,KACrC,MAAM70E,EAAI,GAAY40F,GACtB,GAAI50F,EAAE5J,SAAWy+E,GACb,MAAM,IAAIn8E,MAAM,kBAAkBm8E,0BACtCkgB,EAAS/8F,KAAKgI,EAClB,CAGA,MAAO,CAAEgZ,KAFI,MAAe+7E,GAEbx9E,EADLs4E,GAAS12E,GACD3B,IACtB,CAQ2B45H,CAAYh+C,EAASjgB,EAASpzC,EAAK60D,cACpDQ,EAAO,IAAIi4C,GAp1BL,GAo1BuBxD,IAEnC,IAAI51D,EACJ,UAFMmhB,EAAKhvB,OAAOptD,KAETi7D,EAAM25D,SAAex4C,EAAKs4C,WAAYn2H,EAAGC,EAAGuoB,EAAKsxG,mBAChDj8C,EAAKhvB,SACf,OAbJ,SAAqBkrE,EAAQvxG,GACzB,MAAM,IAAEk0C,EAAG,SAAE+e,GAAas+C,GACpB,IAAEpjD,EAAG,UAAEqjD,GAAc/3I,OAAOoN,OAAO,CAAEyqI,WAAW,EAAMnjD,KAAK,GAAQnuD,GACnE2zC,EAASwa,EAAMja,EAAI2f,gBAAkB3f,EAAI6f,oBAC/C,OAAOy9C,EAAY,CAAC79D,EAAQsf,GAAYtf,CAC5C,CAQW89D,CAAYv9D,EAAKl0C,EAC5B,CQn4BW,CAAUqvG,GAAU7/F,GAAM4jC,EAAS,CACtC+a,KAAK,GAEb,CCAA,MAAM,GAAM,IAAIr5C,GAAO,OAChB,IAAI48F,GAKAC,IAJX,SAAWD,GACPA,EAAuB,IAAI,MAC3BA,EAAuB,IAAI,KAC9B,CAHD,CAGGA,KAAsBA,GAAoB,CAAC,IAE9C,SAAWC,GACPA,EAAoC,KAAI,OACxCA,EAAoC,KAAI,OACxCA,EAAoC,KAAI,OACxCA,EAAoC,KAAI,MAC3C,CALD,CAKGA,KAAkCA,GAAgC,CAAC,IAC/D,MAAM,WAAYrB,GACrB5mF,qBAAuB,OACvBjL,OACA,mBAAar3C,CAAOmpI,EAAM,CAAC,EAAGhkC,EAAM5tE,OAAO,GAAI22D,GAC3C,MAAM/nD,EAAM,IAAI,GAAIgjG,EAAKhkC,EAAKjX,GAC9B,IACI,MAAMnhB,EAAY5mC,EAAI4mC,UAClBA,IACA5mC,EAAIkR,aCzBb,SAAmC01B,GAEtC,OAAOykB,GADY,IAAIzB,GAAcV,UAAUK,mBAAmB3iB,GACjClnE,WAAOvU,EAC5C,CDsBmCk5I,CAA0Bz9D,GAErD,CACA,MAAOl0E,GACH,GAAIoC,MAAM,sCAAuCpC,EACrD,CACA,OAAOstC,CACX,CACA,UAAIskG,GACA,GACS,OADDl3I,KAAKshB,GAEL,OAAOthB,KAAKw5E,UD/BrB,SAAgBktC,GACnB,MACMywB,EADY,GAAWj/D,QAAQwuC,GACA9tC,YAAW,GAChD,OAAO,GAAW87D,GAAUyC,EAAmB15I,MAAM,IACzD,CC2BwC,CAAUuC,KAAKw5E,gBAAaz7E,EAEpD,MAAM,IAAIC,MAAM+2I,GAE5B,CACAqC,qBAAuBpC,GAA+BlxI,KAAK,CAAC,EAAG9D,MAC/D,aAAIo4C,GAIA,OAHIp4C,KAAK+pG,IAAM/pG,KAAK61I,KAChB,GAAIzsI,KAAK,4CAENpJ,KAAK+pG,IAAM/pG,KAAK61I,GAC3B,CACA,oBAAAwB,CAAqB1lC,GACjB,MAAMv2C,EAAau2C,EAAUv2C,aAC7B,GAA0B,IAAtBA,EAAW1/D,QACO,QAAlB0/D,EAAW,IACO,QAAlBA,EAAW,GACX,MAAM,IAAIp9D,MAAM,qBAEpB,MAAM07D,EAASi4C,EAAUj4C,SACzB,IAAKA,EAAO,GAAG,KAAOA,EAAO,GAAG,GAC5B,MAAM,IAAI17D,MAAM,qBAGC,IAAjB07D,EAAO,GAAG,IACV15D,KAAK+K,IAAI,KAAM2uD,EAAO,GAAG,IACzB15D,KAAK+K,IAAIqwD,EAAW,GAAI1B,EAAO,GAAG,MAGlC15D,KAAK+K,IAAI,MAAO2uD,EAAO,GAAG,IAC1B15D,KAAK+K,IAAIqwD,EAAW,GAAK,IAAK1B,EAAO,GAAG,IAEhD,CACA,wBAAA49E,GACI,MAAMnmC,EAAa,GACnB,IAAK,MAAM1rD,KAAY3mD,OAAO2jB,OAAOu0H,IAAgC,CACjE,MAAMpmC,EAAK5wG,KAAKo3I,qBAAqB3xF,GACjCmrD,GACAO,EAAW7zG,KAAKszG,EACxB,CACA,MAAM2mC,EAAcv3I,KAAKmxG,YAAc,GACvC,OAAOA,EAAWxhG,OAAO4nI,GAAa7rI,KAAKklG,GACnC5wG,KAAK8jD,OACE8sD,EAAGv1C,YAAY,QAAQr7D,KAAK8jD,OAAOrlD,cAEvCmyG,GAEf,CACA,YAAIz/C,GACA,MAAM7vC,EAAKthB,KAAK8jD,OAChB,GAAKxiC,EAEL,MAAO,CACHA,KACA6vF,WAAYnxG,KAAKs3I,2BAEzB,CASA,gBAAAE,CAAiB/xF,GACb,GAAIzlD,KAAK8jD,OAAQ,CACb,MAAM2zF,EAAoBz3I,KAAKo3I,qBAAqB3xF,GACpD,GAAIgyF,EACA,OAAOA,EAAkBp8E,YAAY,QAAQr7D,KAAK8jD,OAAOrlD,aAEjE,CAEJ,CAIA,iBAAAi5I,GACI,GAAI13I,KAAK8jD,QAAU9jD,KAAKmxG,WAAY,CAChC,MAAMrtD,EAAS9jD,KAAK8jD,OACpB,OAAO9jD,KAAKmxG,WAAWzlG,KAAKklG,GACjBA,EAAGv1C,YAAY,QAAQvX,EAAOrlD,eAE7C,CACA,MAAO,EACX,CACA,MAAAysB,CAAOkT,EAAMu8D,GACT,IAAK36F,KAAK8K,IAAI,OAAqB,OAAZ9K,KAAKshB,GACxB,MAAM,IAAItjB,MAAM+2I,IAEpB,IAAK/0I,KAAKw5E,UACN,MAAM,IAAIx7E,MAAM,uCAEpB,OAAO42I,GAAgBj6C,EAAW+5C,GAAUt2G,GAAOp+B,KAAKw5E,UAC5D,CACA,UAAMt2E,CAAKk7B,EAAM69C,GACb,GACS,OADDj8E,KAAKshB,GAKL,MAAM,IAAItjB,MAAM+2I,IAExB,OALQ/0I,KAAK26F,gBAAkB,GAAQ1e,EAAY79C,GAK5Cp+B,KAAK26F,SAChB,EE9IJ,IAAIg9C,IAAyB,EACzBC,IAAgB,EACpB,MAAMC,GAAY,CAAEvuI,MAAO,EAAG,QAAW,EAAG0oC,KAAM,EAAG8lG,QAAS,EAAGpwI,MAAO,EAAGrH,IAAK,GAChF,IAAI03I,GAAYF,GAAmB,QAE/BG,GAAgB,KA4BpB,MAAMC,GA3BN,WACI,IACI,MAAM/xH,EAAU,GAahB,GAXA,CAAC,MAAO,MAAO,OAAQ,QAAQpa,SAASosI,IACpC,IACI,GAA+B,SAA3B,OAAOzyI,UAAUyyI,GACjB,MAAM,IAAIl6I,MAAM,gBAGxB,CACA,MAAO0J,GACHwe,EAAQ5oB,KAAK46I,EACjB,KAEAhyH,EAAQxqB,OACR,MAAM,IAAIsC,MAAM,WAAakoB,EAAQxoB,KAAK,OAE9C,GAAIH,OAAOC,aAAa,KAAMiI,UAAU,SAAWlI,OAAOC,aAAa,IAAM,KACzE,MAAM,IAAIQ,MAAM,wBAExB,CACA,MAAO0J,GACH,OAAOA,EAAM+B,OACjB,CACA,OAAO,IACX,CACwB0uI,GACjB,IAAIC,GAQAC,IAPX,SAAWD,GACPA,EAAgB,MAAI,QACpBA,EAAe,KAAI,OACnBA,EAAkB,QAAI,UACtBA,EAAgB,MAAI,QACpBA,EAAc,IAAI,KACrB,CAND,CAMGA,KAAaA,GAAW,CAAC,IAE5B,SAAWC,GAIPA,EAAyB,cAAI,gBAE7BA,EAA2B,gBAAI,kBAG/BA,EAAiC,sBAAI,wBAGrCA,EAAyB,cAAI,gBAE7BA,EAAwB,aAAI,eAE5BA,EAAmB,QAAI,UAIvBA,EAA0B,eAAI,iBAI9BA,EAAyB,cAAI,gBAK7BA,EAAuB,YAAI,cAI3BA,EAA4B,iBAAI,mBAIhCA,EAA4B,iBAAI,mBAIhCA,EAA+B,oBAAI,sBAWnCA,EAA0B,eAAI,iBAG9BA,EAA8B,mBAAI,qBAGlCA,EAAyB,cAAI,gBAG7BA,EAAmC,wBAAI,0BAGvCA,EAAmC,wBAAI,0BAOvCA,EAAgC,qBAAI,uBAKpCA,EAA2B,gBAAI,iBAClC,CA7ED,CA6EGA,KAAcA,GAAY,CAAC,IAE9B,MAAMC,GAAM,mBACL,MAAM,GACT,WAAAxrI,CAAYq+B,GACRrsC,OAAO6L,eAAe3K,KAAM,UAAW,CACnC4K,YAAY,EACZnL,MAAO0rC,EACP1vB,UAAU,GAElB,CACA,IAAA88H,CAAKC,EAAU/3I,GACX,MAAM+5C,EAAQg+F,EAASlwI,cACC,MAApBuvI,GAAUr9F,IACVx6C,KAAKy4I,mBAAmB,yBAA0B,WAAYD,GAE9DT,GAAYF,GAAUr9F,IAG1B77C,QAAQC,IAAI1C,MAAMyC,QAAS8B,EAC/B,CACA,KAAA6I,IAAS7I,GACLT,KAAKu4I,KAAK,GAAOG,OAAO1wI,MAAOvH,EACnC,CACA,IAAAuxC,IAAQvxC,GACJT,KAAKu4I,KAAK,GAAOG,OAAOC,KAAMl4I,EAClC,CACA,IAAA2I,IAAQ3I,GACJT,KAAKu4I,KAAK,GAAOG,OAAOE,QAASn4I,EACrC,CACA,SAAAo4I,CAAUpvI,EAAS4C,EAAM9Q,GAErB,GAAIq8I,GACA,OAAO53I,KAAK64I,UAAU,iBAAkBxsI,EAAM,CAAC,GAE9CA,IACDA,EAAO,GAAOwlD,OAAOinF,eAEpBv9I,IACDA,EAAS,CAAC,GAEd,MAAMw9I,EAAiB,GACvBj6I,OAAOC,KAAKxD,GAAQuQ,SAASC,IACzB,MAAMtM,EAAQlE,EAAOwQ,GACrB,IACI,GAAItM,aAAiBkC,WAAY,CAC7B,IAAI4V,EAAM,GACV,IAAK,IAAI3a,EAAI,EAAGA,EAAI6C,EAAM/D,OAAQkB,IAC9B2a,GAAO+gI,GAAI74I,EAAM7C,IAAM,GACvB2a,GAAO+gI,GAAe,GAAX74I,EAAM7C,IAErBm8I,EAAez7I,KAAKyO,EAAM,iBAAmBwL,EAAM,IACvD,MAEIwhI,EAAez7I,KAAKyO,EAAM,IAAMnM,KAAKC,UAAUJ,GAEvD,CACA,MAAOiI,GACHqxI,EAAez7I,KAAKyO,EAAM,IAAMnM,KAAKC,UAAUtE,EAAOwQ,GAAKtN,YAC/D,KAEJs6I,EAAez7I,KAAK,QAAQ+O,KAC5B0sI,EAAez7I,KAAK,WAAW0C,KAAKmrC,WACpC,MAAMmf,EAAS7gD,EACf,IAAIo0F,EAAM,GACV,OAAQxxF,GACJ,KAAKgsI,GAAUW,cAAe,CAC1Bn7C,EAAM,gBACN,MAAMo7C,EAAQxvI,EACd,OAAQwvI,GACJ,IAAK,WACL,IAAK,YACL,IAAK,mBACDp7C,GAAO,IAAMo7C,EACb,MACJ,IAAK,iBACL,IAAK,iBACDp7C,GAAO,eACP,MACJ,IAAK,yBACDA,GAAO,kBAGf,KACJ,CACA,KAAKw6C,GAAUa,eACf,KAAKb,GAAUc,mBACf,KAAKd,GAAUe,YACf,KAAKf,GAAUgB,cACf,KAAKhB,GAAUiB,wBACf,KAAKjB,GAAUkB,qBACf,KAAKlB,GAAUmB,wBACX37C,EAAMxxF,EAGVwxF,IACAp0F,GAAW,8CAAiDo0F,EAAM,MAElEk7C,EAAer9I,SACf+N,GAAW,KAAOsvI,EAAer7I,KAAK,MAAQ,KAGlD,MAAMgK,EAAQ,IAAI1J,MAAMyL,GAMxB,OALA/B,EAAM4iD,OAASA,EACf5iD,EAAM2E,KAAOA,EACbvN,OAAOC,KAAKxD,GAAQuQ,SAAQ,SAAUC,GAClCrE,EAAMqE,GAAOxQ,EAAOwQ,EACxB,IACOrE,CACX,CACA,UAAA+xI,CAAWhwI,EAAS4C,EAAM9Q,GACtB,MAAMyE,KAAK64I,UAAUpvI,EAAS4C,EAAM9Q,EACxC,CACA,kBAAAk9I,CAAmBhvI,EAASoC,EAAMpM,GAC9B,OAAOO,KAAKy5I,WAAWhwI,EAAS,GAAOooD,OAAO6nF,iBAAkB,CAC5DC,SAAU9tI,EACVpM,MAAOA,GAEf,CACA,MAAAm6I,CAAO1oE,EAAWznE,EAAS4C,EAAM9Q,GACvB21E,GAGNlxE,KAAKy5I,WAAWhwI,EAAS4C,EAAM9Q,EACnC,CACA,cAAAs+I,CAAe3oE,EAAWznE,EAASoC,EAAMpM,GAC/ByxE,GAGNlxE,KAAKy4I,mBAAmBhvI,EAASoC,EAAMpM,EAC3C,CACA,cAAAq6I,CAAerwI,GACI,MAAXA,IACAA,EAAU,+CAEVwuI,IACAj4I,KAAKy5I,WAAW,8CAA+C,GAAO5nF,OAAOkoF,sBAAuB,CAChG5xB,UAAW,6BAA8B+vB,KAAMD,IAG3D,CACA,eAAA+B,CAAgBv6I,EAAOgK,GACI,iBAAZ,IAGI,MAAXA,IACAA,EAAU,mBAEVhK,EAAQ,GAAKA,GAAS,mBACtBO,KAAKy5I,WAAWhwI,EAAS,GAAOooD,OAAOmnF,cAAe,CAClD7wB,UAAW,mBACX8wB,MAAO,oBACPx5I,MAAOA,IAGXA,EAAQ,GACRO,KAAKy5I,WAAWhwI,EAAS,GAAOooD,OAAOmnF,cAAe,CAClD7wB,UAAW,mBACX8wB,MAAO,cACPx5I,MAAOA,IAGnB,CACA,kBAAAw6I,CAAmB1nI,EAAO2nI,EAAezwI,GAEjCA,EADAA,EACU,KAAOA,EAGP,GAEV8I,EAAQ2nI,GACRl6I,KAAKy5I,WAAW,mBAAqBhwI,EAAS,GAAOooD,OAAOsoF,iBAAkB,CAC1E5nI,MAAOA,EACP2nI,cAAeA,IAGnB3nI,EAAQ2nI,GACRl6I,KAAKy5I,WAAW,qBAAuBhwI,EAAS,GAAOooD,OAAOuoF,oBAAqB,CAC/E7nI,MAAOA,EACP2nI,cAAeA,GAG3B,CACA,QAAAG,CAASlqH,EAAQnO,GACTmO,IAAWrxB,QAAoB,MAAVqxB,GACrBnwB,KAAKy5I,WAAW,cAAe,GAAO5nF,OAAOunF,YAAa,CAAEvtI,KAAMmW,EAAKnW,MAE/E,CACA,aAAAyuI,CAAcnqH,EAAQnO,GACdmO,IAAWnO,EACXhiB,KAAKy5I,WAAW,qCAAuC75I,KAAKC,UAAUmiB,EAAKnW,MAAQ,6BAA8B,GAAOgmD,OAAOkoF,sBAAuB,CAAEluI,KAAMskB,EAAOtkB,KAAMs8G,UAAW,QAEjLh4F,IAAWrxB,QAAoB,MAAVqxB,GAC1BnwB,KAAKy5I,WAAW,cAAe,GAAO5nF,OAAOunF,YAAa,CAAEvtI,KAAMmW,EAAKnW,MAE/E,CACA,mBAAO0uI,GAIH,OAHKvC,KACDA,GAAgB,IAAI,GC/TT,iBDiURA,EACX,CACA,oBAAOwC,CAAcC,EAAYC,GAM7B,IALKD,GAAcC,GACf16I,KAAKu6I,eAAed,WAAW,wCAAyC,GAAO5nF,OAAOkoF,sBAAuB,CACzG5xB,UAAW,kBAGfwvB,GAAwB,CACxB,IAAK8C,EACD,OAEJz6I,KAAKu6I,eAAed,WAAW,6BAA8B,GAAO5nF,OAAOkoF,sBAAuB,CAC9F5xB,UAAW,iBAEnB,CACAyvB,KAAkB6C,EAClB9C,KAA2B+C,CAC/B,CACA,kBAAOC,CAAYnC,GACf,MAAMh+F,EAAQq9F,GAAUW,EAASlwI,eACpB,MAATkyC,EAIJu9F,GAAYv9F,EAHR,GAAO+/F,eAAenxI,KAAK,uBAAyBovI,EAI5D,CACA,WAAO39G,CAAKsQ,GACR,OAAO,IAAI,GAAOA,EACtB,EAEJ,GAAO0mB,OAASwmF,GAChB,GAAOK,OAASN,GEjWT,MCGD,GAAS,IAAI,GDHI,eCKvB,SAASwC,GAAUn7I,GACf,QAAUA,EAAiB,WAC/B,CACA,SAASo7I,GAAShmI,GACd,OAAIA,EAAMpX,QAGVoX,EAAMpX,MAAQ,WACV,MAAMgD,EAAOjF,MAAM0E,UAAUzC,MAAM6I,KAAK7K,WACxC,OAAOo/I,GAAS,IAAIl5I,WAAWnG,MAAM0E,UAAUzC,MAAMvB,MAAM2Y,EAAOpU,IACtE,GALWoU,CAOf,CAIA,SAAS6I,GAAUje,GACf,MAA2B,iBAAZ,GAAwBA,GAASA,GAAUA,EAAQ,GAAO,CAC7E,CACO,SAAS,GAAQA,GACpB,GAAa,MAATA,EACA,OAAO,EAEX,GAAIA,EAAMqN,cAAgBnL,WACtB,OAAO,EAEX,GAAuB,iBAAZ,EACP,OAAO,EAEX,IAAK+b,GAAUje,EAAM/D,SAAW+D,EAAM/D,OAAS,EAC3C,OAAO,EAEX,IAAK,IAAIkB,EAAI,EAAGA,EAAI6C,EAAM/D,OAAQkB,IAAK,CACnC,MAAM4M,EAAI/J,EAAM7C,GAChB,IAAK8gB,GAAUlU,IAAMA,EAAI,GAAKA,GAAK,IAC/B,OAAO,CAEf,CACA,OAAO,CACX,CACO,SAASsxI,GAASr7I,EAAOsB,GAI5B,GAHKA,IACDA,EAAU,CAAC,GAEQ,iBAAZ,EAAsB,CAC7B,GAAOi5I,gBAAgBv6I,EAAO,0BAC9B,MAAM0O,EAAS,GACf,KAAO1O,GACH0O,EAAO7D,QAAgB,IAAR7K,GACfA,EAAQqJ,SAASvL,OAAOkC,EAAQ,MAKpC,OAHsB,IAAlB0O,EAAOzS,QACPyS,EAAO7Q,KAAK,GAETu9I,GAAS,IAAIl5I,WAAWwM,GACnC,CAOA,GANIpN,EAAQg6I,oBAAyC,iBAAZ,GAAkD,OAA1Bt7I,EAAM4L,UAAU,EAAG,KAChF5L,EAAQ,KAAOA,GAEfm7I,GAAUn7I,KACVA,EAAQA,EAAMu7I,eAEdC,GAAYx7I,GAAQ,CACpB,IAAI8X,EAAM9X,EAAM4L,UAAU,GACtBkM,EAAI7b,OAAS,IACU,SAAnBqF,EAAQm6I,OACR3jI,EAAM,IAAMA,EAEY,UAAnBxW,EAAQm6I,OACb3jI,GAAO,IAGP,GAAOkhI,mBAAmB,yBAA0B,QAASh5I,IAGrE,MAAM0O,EAAS,GACf,IAAK,IAAIvR,EAAI,EAAGA,EAAI2a,EAAI7b,OAAQkB,GAAK,EACjCuR,EAAO7Q,KAAKwL,SAASyO,EAAIlM,UAAUzO,EAAGA,EAAI,GAAI,KAElD,OAAOi+I,GAAS,IAAIl5I,WAAWwM,GACnC,CACA,OAAI,GAAQ1O,GACDo7I,GAAS,IAAIl5I,WAAWlC,IAE5B,GAAOg5I,mBAAmB,yBAA0B,QAASh5I,EACxE,CAoCO,SAASw7I,GAAYx7I,EAAO/D,GAC/B,QAAuB,iBAAZ,IAAyB+D,EAAM2H,MAAM,qBAG5C1L,GAAU+D,EAAM/D,SAAW,EAAI,EAAIA,EAI3C,CACA,MAAMy/I,GAAgB,mBACf,SAASC,GAAQ37I,EAAOsB,GAI3B,GAHKA,IACDA,EAAU,CAAC,GAEQ,iBAAZ,EAAsB,CAC7B,GAAOi5I,gBAAgBv6I,EAAO,yBAC9B,IAAI8X,EAAM,GACV,KAAO9X,GACH8X,EAAM4jI,GAAsB,GAAR17I,GAAe8X,EACnC9X,EAAQjD,KAAKmD,MAAMF,EAAQ,IAE/B,OAAI8X,EAAI7b,QACA6b,EAAI7b,OAAS,IACb6b,EAAM,IAAMA,GAET,KAAOA,GAEX,MACX,CACA,GAAuB,iBAAZ,EAEP,OADA9X,EAAQA,EAAMhB,SAAS,KACb/C,OAAS,EACP,MAAQ+D,EAEb,KAAOA,EAKlB,GAHIsB,EAAQg6I,oBAAyC,iBAAZ,GAAkD,OAA1Bt7I,EAAM4L,UAAU,EAAG,KAChF5L,EAAQ,KAAOA,GAEfm7I,GAAUn7I,GACV,OAAOA,EAAMu7I,cAEjB,GAAIC,GAAYx7I,GAYZ,OAXIA,EAAM/D,OAAS,IACQ,SAAnBqF,EAAQm6I,OACRz7I,EAAQ,MAAQA,EAAM4L,UAAU,GAER,UAAnBtK,EAAQm6I,OACbz7I,GAAS,IAGT,GAAOg5I,mBAAmB,yBAA0B,QAASh5I,IAG9DA,EAAM6I,cAEjB,GAAI,GAAQ7I,GAAQ,CAChB,IAAI0O,EAAS,KACb,IAAK,IAAIvR,EAAI,EAAGA,EAAI6C,EAAM/D,OAAQkB,IAAK,CACnC,IAAI4M,EAAI/J,EAAM7C,GACduR,GAAUgtI,IAAmB,IAAJ3xI,IAAa,GAAK2xI,GAAkB,GAAJ3xI,EAC7D,CACA,OAAO2E,CACX,CACA,OAAO,GAAOsqI,mBAAmB,wBAAyB,QAASh5I,EACvE,CC/LO,MCKD,GAAS,IAAI,GDLI,aCMvB,SAAS47I,GAAgB57I,GACrB,MAAM0O,EAAS,GACf,KAAO1O,GACH0O,EAAO7D,QAAgB,IAAR7K,GACfA,IAAU,EAEd,OAAO0O,CACX,CACA,SAASmtI,GAAkBl9G,EAAMziC,EAAQD,GACrC,IAAIyS,EAAS,EACb,IAAK,IAAIvR,EAAI,EAAGA,EAAIlB,EAAQkB,IACxBuR,EAAmB,IAATA,EAAgBiwB,EAAKziC,EAASiB,GAE5C,OAAOuR,CACX,CACA,SAASotI,GAAQ//H,GACb,GAAIhgB,MAAM+Y,QAAQiH,GAAS,CACvB,IAAI+0B,EAAU,GAId,GAHA/0B,EAAO1P,SAAQ,SAAU6/G,GACrBp7E,EAAUA,EAAQ5gC,OAAO4rI,GAAQ5vB,GACrC,IACIp7E,EAAQ70C,QAAU,GAElB,OADA60C,EAAQjmC,QAAQ,IAAOimC,EAAQ70C,QACxB60C,EAEX,MAAM70C,EAAS2/I,GAAgB9qG,EAAQ70C,QAEvC,OADAA,EAAO4O,QAAQ,IAAO5O,EAAOA,QACtBA,EAAOiU,OAAO4gC,EACzB,CFhBG,IAAqB9wC,EACfw7I,GADex7I,EEiBP+b,MFhBgB/b,EAAM/D,OAAS,IAAO,GAAQ+D,IEiB3D,GAAOg5I,mBAAmB,+BAAgC,SAAUj9H,GAExE,MAAM4iB,EAAO5iC,MAAM0E,UAAUzC,MAAM6I,KAAKw0I,GAASt/H,IACjD,GAAoB,IAAhB4iB,EAAK1iC,QAAgB0iC,EAAK,IAAM,IAChC,OAAOA,EAEN,GAAIA,EAAK1iC,QAAU,GAEpB,OADA0iC,EAAK9zB,QAAQ,IAAO8zB,EAAK1iC,QAClB0iC,EAEX,MAAM1iC,EAAS2/I,GAAgBj9G,EAAK1iC,QAEpC,OADAA,EAAO4O,QAAQ,IAAO5O,EAAOA,QACtBA,EAAOiU,OAAOyuB,EACzB,CAIA,SAASo9G,GAAgBp9G,EAAMziC,EAAQ8/I,EAAa//I,GAChD,MAAMyS,EAAS,GACf,KAAOstI,EAAc9/I,EAAS,EAAID,GAAQ,CACtC,MAAM2lE,EAAUq6E,GAAQt9G,EAAMq9G,GAC9BttI,EAAO7Q,KAAK+jE,EAAQlzD,SACpBstI,GAAep6E,EAAQkqC,UACL5vG,EAAS,EAAID,GAC3B,GAAO+9I,WAAW,uBAAwB,GAAO5nF,OAAO8pF,eAAgB,CAAC,EAEjF,CACA,MAAO,CAAEpwC,SAAW,EAAI7vG,EAASyS,OAAQA,EAC7C,CAEA,SAASutI,GAAQt9G,EAAMziC,GAKnB,GAJoB,IAAhByiC,EAAK1iC,QACL,GAAO+9I,WAAW,iBAAkB,GAAO5nF,OAAO8pF,eAAgB,CAAC,GAGnEv9G,EAAKziC,IAAW,IAAM,CACtB,MAAMuiD,EAAe9f,EAAKziC,GAAU,IAChCA,EAAS,EAAIuiD,EAAe9f,EAAK1iC,QACjC,GAAO+9I,WAAW,+BAAgC,GAAO5nF,OAAO8pF,eAAgB,CAAC,GAErF,MAAMjgJ,EAAS4/I,GAAkBl9G,EAAMziC,EAAS,EAAGuiD,GAInD,OAHIviD,EAAS,EAAIuiD,EAAexiD,EAAS0iC,EAAK1iC,QAC1C,GAAO+9I,WAAW,8BAA+B,GAAO5nF,OAAO8pF,eAAgB,CAAC,GAE7EH,GAAgBp9G,EAAMziC,EAAQA,EAAS,EAAIuiD,EAAcA,EAAexiD,EACnF,CACK,GAAI0iC,EAAKziC,IAAW,IAAM,CAC3B,MAAMD,EAAS0iC,EAAKziC,GAAU,IAI9B,OAHIA,EAAS,EAAID,EAAS0iC,EAAK1iC,QAC3B,GAAO+9I,WAAW,uBAAwB,GAAO5nF,OAAO8pF,eAAgB,CAAC,GAEtEH,GAAgBp9G,EAAMziC,EAAQA,EAAS,EAAGD,EACrD,CACK,GAAI0iC,EAAKziC,IAAW,IAAM,CAC3B,MAAMuiD,EAAe9f,EAAKziC,GAAU,IAChCA,EAAS,EAAIuiD,EAAe9f,EAAK1iC,QACjC,GAAO+9I,WAAW,uBAAwB,GAAO5nF,OAAO8pF,eAAgB,CAAC,GAE7E,MAAMjgJ,EAAS4/I,GAAkBl9G,EAAMziC,EAAS,EAAGuiD,GAKnD,OAJIviD,EAAS,EAAIuiD,EAAexiD,EAAS0iC,EAAK1iC,QAC1C,GAAO+9I,WAAW,uBAAwB,GAAO5nF,OAAO8pF,eAAgB,CAAC,GAGtE,CAAEpwC,SAAW,EAAIrtD,EAAexiD,EAASyS,OADjCitI,GAAQh9G,EAAK3gC,MAAM9B,EAAS,EAAIuiD,EAAcviD,EAAS,EAAIuiD,EAAexiD,IAE7F,CACK,GAAI0iC,EAAKziC,IAAW,IAAM,CAC3B,MAAMD,EAAS0iC,EAAKziC,GAAU,IAK9B,OAJIA,EAAS,EAAID,EAAS0iC,EAAK1iC,QAC3B,GAAO+9I,WAAW,iBAAkB,GAAO5nF,OAAO8pF,eAAgB,CAAC,GAGhE,CAAEpwC,SAAW,EAAI7vG,EAASyS,OADlBitI,GAAQh9G,EAAK3gC,MAAM9B,EAAS,EAAGA,EAAS,EAAID,IAE/D,CACA,MAAO,CAAE6vG,SAAU,EAAGp9F,OAAQitI,GAAQh9G,EAAKziC,IAC/C,CCzGA,MAAM,GAAM,IAAIw+C,GAAO,eAChB,MAAMyhG,GACT,iBAAO9gH,CAAW+gH,GACd,IAAKA,EAAQ5pH,WAAW,GAAI6pH,eACxB,MAAM,IAAI99I,MAAM,wCAAwC,GAAI89I,kBAEhE,OAAOF,GAAWG,QAAQ,GAAWF,EAAQp+I,MAAM,GAAI,aAC3D,CACA,cAAOs+I,CAAQF,GACX,MAAMx6E,EDiGP,SAAgBjjC,GACnB,MAAM9rB,EAAQwoI,GAAS18G,GACjBijC,EAAUq6E,GAAQppI,EAAO,GAI/B,OAHI+uD,EAAQkqC,WAAaj5F,EAAM5W,QAC3B,GAAO+8I,mBAAmB,mBAAoB,OAAQr6G,GAEnDijC,EAAQlzD,MACnB,CCxGwB,CAAW0tI,GAASnwI,IAAI,IACxC,OAGRq/B,eAA0BtoB,GACtB,MAAM,UAAEk4E,EAAS,IAAEiX,EAAG,IAAEgkC,GAqB5B,SAAqBnzH,GACjB,IAAKjnB,MAAM+Y,QAAQkO,GACf,MAAM,IAAIzkB,MAAM,gCAEpB,GAAIykB,EAAO/mB,OAAS,GAAM,EACtB,MAAM,IAAIsC,MAAM,oDAEpB,MAAO28F,EAAWiX,KAAQgkC,GAAOnzH,EACjC,IAAKk4E,GAAan/F,MAAM+Y,QAAQomF,GAC5B,MAAM,IAAI38F,MAAM,uDAEpB,IAAK4zG,GAAOp2G,MAAM+Y,QAAQq9F,GACtB,MAAM,IAAI5zG,MAAM,6DAEpB,MAAO,CAAE28F,YAAWiX,MAAKgkC,MAC7B,CApCoCoG,CAAYv5H,GACtCtW,EAAM,CAAC,EACb,IAAK,IAAIvP,EAAI,EAAGA,EAAIg5I,EAAIl6I,OAAQkB,GAAK,EACjC,IACIuP,EAAI4rC,GAAY69F,EAAIh5I,KAAOg5I,EAAIh5I,EAAI,EACvC,CACA,MAAO0I,GACH,GAAIoC,MAAM,iDAAkDkuI,EAAIh5I,GAAI0I,EACxE,CAEJ,MAAM22I,EAKV,SAAmBrqC,GAEf,OAAKA,EAAIl2G,OAEFsoC,OAAO,KAAO,GAAW4tE,IADrB5tE,OAAO,EAEtB,CAViBk4G,CAAUtqC,GACjBh/D,QAAY,GAAInmC,OAAON,EAAK8vI,EAAMthD,GAExC,OAwBJ,SAAwBiX,EAAKgkC,EAAKhjG,EAAK+nD,GACnC,MAAMwhD,EAAkB,GDNjBf,GAAQG,GCM+B,CAAC3pC,KAAQgkC,MACvD,IAAKhjG,EAAI1nB,OAAOixH,EAAiBxhD,GAC7B,MAAM,IAAI38F,MAAM,iCAExB,CA9BIo+I,CAAexqC,EAAKgkC,EAAKhjG,EAAK+nD,GACvB/nD,CACX,CAlBeypG,CAAWh7E,EACtB,EChBJ,MAAMi7E,GAAU,4BAEVC,GAAU,yEAGH,GAAK,CAChB1wI,KAAM,KACN3F,KANa,EAObs2I,SAAU58H,GAAM08H,GAAQr+I,KAAK2hB,GAC7B,MAAA/iB,CAAQ+iB,EAAI68H,EAAM9gJ,GAChBA,IAAWA,EACX8gJ,EAAOA,GAAQ,IAAI96I,WAAWhG,EAVnB,GAWX,MAAM6U,EAAMoP,EAAGlkB,OACf,IAAIY,EAAI,EACR,IAAK,IAAIM,EAAI,EAAGA,EAAI4T,GAAM,CACxB,MAAM3S,EAAI+hB,EAAG9hB,WAAWlB,KACd,KAANiB,GACF4+I,EAAK9gJ,KAAYW,EACjBA,EAAI,GAEJA,EAAQ,GAAJA,GAAUuB,EAAI,GAEtB,CAEA,OADA4+I,EAAK9gJ,GAAUW,EACRmgJ,CACT,EACA7+I,OAAO,CAAC6+I,EAAM9gJ,KACZA,IAAWA,EACJ,GAAG8gJ,EAAK9gJ,QAAa8gJ,EAAK9gJ,QAAa8gJ,EAAK9gJ,QAAa8gJ,EAAK9gJ,OAI5DwW,GAAK,CAChBtG,KAAM,KACN3F,KA/Ba,GAgCbs2I,SAAU58H,GAAMA,EAAGlkB,OAAS,GAAK6gJ,GAAQt+I,KAAK2hB,GAC9C,MAAA/iB,CAAQ+iB,EAAI68H,EAAM9gJ,GAEhB,IAAIqB,EAnCO,IAkCXrB,IAAWA,GAEP85C,GAAQ,EACRinG,EAAO,EACPC,EAAO,EACPC,GAAY,EACZC,GAAS,EACbJ,EAAOA,GAAQ,IAAI96I,WAAWhG,EAzCnB,IA+CX,IAAK,IAAIiB,EAAI,EAAGA,EAAIgjB,EAAGlkB,OAAQkB,IAAK,CAClC,IAAIiB,EAAI+hB,EAAG9hB,WAAWlB,GACZ,KAANiB,GACE++I,GACY,IAAVnnG,GAGE95C,EAASqB,IAAKy/I,EAAK9gJ,GAAU,GAC7BA,EAASqB,EAAM,IAAGy/I,EAAK9gJ,EAAS,GAAK,GACzCA,GAAU,GACDA,EAASqB,IAElBy4C,EAAO95C,KAIM,IAAXkhJ,GAKElhJ,EAASqB,IAAKy/I,EAAK9gJ,GAAUghJ,GACjChhJ,MAEIA,EAASqB,IAAKy/I,EAAK9gJ,GAAU+gJ,GAAQ,GACrC/gJ,EAASqB,EAAM,IAAGy/I,EAAK9gJ,EAAS,GAAY,IAAP+gJ,GACzC/gJ,GAAU,GAEZ+gJ,EAAO,EACPC,EAAO,GAETC,GAAY,EACZC,GAAS,GACM,KAANh/I,GACLlC,EAASqB,IAAKy/I,EAAK9gJ,GAAUghJ,GACjChhJ,IACAghJ,EAAO,EACPD,EAAO,EACPE,GAAY,EACZC,GAAS,IAETD,GAAY,EACR/+I,GAAK,GACPA,GAAK,GACIA,GAAK,GACdA,GAAK,IAELA,GAAK,GACL8+I,EAAc,GAAPA,EAAY9+I,GAGrB6+I,GAAQA,GAAQ,GAAK7+I,EAEzB,CACA,IAAkB,IAAd++I,GAEa,IAAXC,GACElhJ,EAASqB,IAAKy/I,EAAK9gJ,GAAUghJ,GACjChhJ,MAEIA,EAASqB,IAAKy/I,EAAK9gJ,GAAU+gJ,GAAQ,GACrC/gJ,EAASqB,EAAM,IAAGy/I,EAAK9gJ,EAAS,GAAY,IAAP+gJ,GACzC/gJ,GAAU,QAEP,GAAa,IAAT85C,EAIL95C,EAASqB,IAAKy/I,EAAK9gJ,GAAU,GAC7BA,EAASqB,EAAM,IAAGy/I,EAAK9gJ,EAAS,GAAK,GACzCA,GAAU,OACL,IAAc,IAAV85C,EAAa,CAKtB95C,GAAU,EACV,IAAK,IAAIiB,EAAIJ,KAAKk4B,IAAI/4B,EAAS,EAAGqB,EAAM,GAAIJ,GAAK64C,EAAO,EAAG74C,IACzD6/I,EAAK7/I,GAAK6/I,EAAK7/I,EAAI,GAErB6/I,EAAKhnG,GAAQ,EACbgnG,EAAKhnG,EAAO,GAAK,EACjBA,EAAO95C,CACT,CACA,GAAI85C,IAAS95C,IAAoB,IAAV85C,EAOrB,IAJI95C,EAASqB,EAAM,IAEjBrB,EAASqB,EAAM,GAEVA,EAAMy4C,GACXgnG,IAAOz/I,GAAOrB,EAASqB,GAAOrB,EAAS85C,EAAOgnG,IAAO9gJ,GAAU,OAIjE,KAAOA,EAASqB,GACdy/I,EAAK9gJ,KAAY,EAGrB,OAAO8gJ,CACT,EACA,MAAA7+I,CAAQ6+I,EAAM9gJ,GACZA,IAAWA,EACX,IAAIwS,EAAS,GACb,IAAK,IAAIvR,EAAI,EAAGA,EAxJL,GAwJiBA,GAAK,EACrB,IAANA,IACFuR,GAAU,KAEZA,IAAWsuI,EAAK9gJ,EAASiB,IAAM,EAAI6/I,EAAK9gJ,EAASiB,EAAI,IAAI6B,SAAS,IAEpE,OAAO0P,EACJ7O,QAAQ,qBAAsB,UAC9BA,QAAQ,SAAU,KACvB,GAIK,SAASw9I,GAAQl9H,GACtB,GAAI,GAAG48H,SAAS58H,GAAK,OAAO,GAAG1Z,KAC/B,GAAIiM,GAAGqqI,SAAS58H,GAAK,OAAOzN,GAAGjM,KAC/B,MAAMlI,MAAM,uBAAuB4hB,IACrC,CC5KO,SAAS,GAAU1X,GACxB,OAAQA,GACN,KAAK,EAAG,MAAO,IACf,KAAK,GAAI,MAAO,OAChB,KAAK,GAAI,MAAO,OAChB,KAAK,GAAI,MAAO,QAChB,KAAK,GAAI,MAAO,MAChB,KAAK,IAAK,MAAO,MACjB,KAAK,GAAI,MAAO,UAChB,KAAK,GAAI,MAAO,MAChB,KAAK,GAAI,MAAO,OAChB,KAAK,EAAG,MAAO,QACf,KAAK,GAAI,MAAO,QAChB,KAAK,MAAO,MAAO,MACnB,KAAK,GAAI,MAAO,QAChB,KAAK,GAAI,MAAO,SAChB,KAAK,GAAI,MAAO,KAChB,KAAK,GAAI,MAAO,MAChB,KAAK,GAAI,MAAO,QAChB,KAAK,GAAI,MAAO,WAChB,KAAK,GAAI,MAAO,MAChB,KAAK,GAAI,MAAO,KAChB,KAAK,GAAI,MAAO,MAChB,KAAK,GAAI,MAAO,KAChB,KAAK,GAAI,MAAO,QAChB,KAAK,EAAG,MAAO,KACf,KAAK,GAAI,MAAO,OAChB,KAAK,GAAI,MAAO,QAChB,KAAK,GAAI,MAAO,aAChB,KAAK,GAAI,MAAO,MAChB,KAAK,GAAI,MAAO,QAChB,KAAK,GAAI,MAAO,KAChB,KAAK,GAAI,MAAO,MAChB,KAAK,EAAG,MAAO,MACf,KAAK,GAAI,MAAO,MAChB,KAAK,GAAI,MAAO,MAChB,KAAK,GAAI,MAAO,QAChB,KAAK,MAAO,MAAO,KACnB,KAAK,IAAK,MAAO,OACjB,KAAK,GAAI,MAAO,OAChB,KAAK,IAAK,MAAO,OACjB,KAAK,GAAI,MAAO,MAChB,KAAK,IAAK,MAAO,OACjB,KAAK,IAAK,MAAO,OACjB,KAAK,GAAI,MAAO,MAChB,KAAK,IAAK,MAAO,MAEnB,MAAO,WAAaA,CACtB,CAEO,SAAS60I,GAAQlxI,GACtB,OAAQA,EAAKsuB,eACX,IAAK,IAAK,OAAO,EACjB,IAAK,OAAQ,OAAO,GACpB,IAAK,OAAQ,OAAO,GACpB,IAAK,QAAS,OAAO,GACrB,IAAK,MAAO,OAAO,GACnB,IAAK,MAAO,OAAO,IACnB,IAAK,UAAW,OAAO,GACvB,IAAK,MAAO,OAAO,GACnB,IAAK,OAAQ,OAAO,GACpB,IAAK,QAAS,OAAO,EACrB,IAAK,QAAS,OAAO,GACrB,IAAK,MAAO,OAAO,MACnB,IAAK,QAAS,OAAO,GACrB,IAAK,SAAU,OAAO,GACtB,IAAK,KAAM,OAAO,GAClB,IAAK,MAAO,OAAO,GACnB,IAAK,QAAS,OAAO,GACrB,IAAK,WAAY,OAAO,GACxB,IAAK,MAAO,OAAO,GACnB,IAAK,KAAM,OAAO,GAClB,IAAK,MAAO,OAAO,GACnB,IAAK,KAAM,OAAO,GAClB,IAAK,QAAS,OAAO,GACrB,IAAK,KAAM,OAAO,EAClB,IAAK,OAAQ,OAAO,GACpB,IAAK,QAAS,OAAO,GACrB,IAAK,aAAc,OAAO,GAC1B,IAAK,MAAO,OAAO,GACnB,IAAK,QAAS,OAAO,GACrB,IAAK,KAAM,OAAO,GAClB,IAAK,MAAO,OAAO,GACnB,IAAK,MAAO,OAAO,EACnB,IAAK,MAAO,OAAO,GACnB,IAAK,MAAO,OAAO,GACnB,IAAK,QAAS,OAAO,GACrB,IAAK,KAAM,OAAO,MAClB,IAAK,OAAQ,OAAO,IACpB,IAAK,OAAQ,OAAO,GACpB,IAAK,OAAQ,OAAO,IACpB,IAAK,MAAO,OAAO,GACnB,IAAK,OAAQ,OAAO,IACpB,IAAK,OAAQ,OAAO,IACpB,IAAK,MAAO,OAAO,GACnB,IAAK,MACL,IAAK,IAAK,OAAO,IAEnB,OAAItuB,EAAKsuB,cAAclI,WAAW,YAAoBnpB,SAAS+C,EAAKpO,MAAM,IACnE,CACT,CC/FO,SAAS,GAAUu/I,GACxB,OAAQA,GACN,KAAK,EAAG,MAAO,UACf,KAAK,EAAG,MAAO,UACf,KAAK,EAAG,MAAO,WACf,KAAK,EAAG,MAAO,WACf,KAAK,EAAG,MAAO,SACf,KAAK,EAAG,MAAO,UACf,KAAK,EAAG,MAAO,WACf,KAAK,EAAG,MAAO,UACf,KAAK,EAAG,MAAO,UACf,KAAK,EAAG,MAAO,UACf,KAAK,GAAI,MAAO,UAChB,KAAK,GAAI,MAAO,WAChB,KAAK,GAAI,MAAO,WAChB,KAAK,GAAI,MAAO,WAChB,KAAK,GAAI,MAAO,WAChB,KAAK,GAAI,MAAO,WAElB,MAAO,SAAWA,CACpB,CCpBO,SAAS,GAAUC,GACxB,OAAQA,GACN,KAAK,EAAG,MAAO,QACf,KAAK,EAAG,MAAO,SACf,KAAK,EAAG,MAAO,SACf,KAAK,EAAG,MAAO,WACf,KAAK,EAAG,MAAO,SACf,KAAK,EAAG,MAAO,SACf,KAAK,EAAG,MAAO,WACf,KAAK,EAAG,MAAO,WACf,KAAK,EAAG,MAAO,WACf,KAAK,EAAG,MAAO,WACf,KAAK,GAAI,MAAO,YAChB,KAAK,GAAI,MAAO,YAChB,KAAK,GAAI,MAAO,YAChB,KAAK,GAAI,MAAO,YAChB,KAAK,GAAI,MAAO,YAChB,KAAK,GAAI,MAAO,YAElB,MAAO,UAAYA,CACrB,CCzBO,SAAS,GAAUC,GACxB,OAAQA,GACN,KAAK,EAAG,MAAO,KACf,KAAK,EAAG,MAAO,KACf,KAAK,EAAG,MAAO,KACf,KAAK,EAAG,MAAO,KACf,KAAK,IAAK,MAAO,MAEnB,MAAO,WAAaA,CACtB,CAEO,SAASC,GAAStxI,GACvB,OAAQA,EAAKsuB,eACX,IAAK,KAAM,OAAO,EAClB,IAAK,KAAM,OAAO,EAClB,IAAK,KAAM,OAAO,EAClB,IAAK,KAAM,OAAO,EAClB,IAAK,MAAO,OAAO,IAErB,OAAO,CACT,CCKO,SAASijH,GAAQvxI,GACtB,GAAoB,iBAATA,EACT,OAAOA,EAET,IAAKA,EACH,OAAQ,EAEV,OAAQA,EAAKsuB,eACX,IAAK,WAAY,OAAO,EACxB,IAAK,MAAO,OAAO,EACnB,IAAK,KAAM,OAAO,EAClB,IAAK,OAAQ,OAAO,EACpB,IAAK,WAAY,OAAO,EACxB,IAAK,MAAO,OAAO,EACnB,IAAK,MAAO,OAAO,EACnB,IAAK,MAAO,OAAO,EACnB,IAAK,gBAAiB,OAAO,EAC7B,IAAK,SAAU,OAAO,EACtB,IAAK,SAAU,OAAO,GACtB,IAAK,gBAAiB,OAAO,GAC7B,IAAK,UAAW,OAAO,GACvB,IAAK,QAAS,OAAO,GACrB,IAAK,UAAW,OAAO,GACvB,IAAK,WAAY,OAAO,MACxB,IAAK,eAAgB,OAAO,MAE9B,MAAMtd,EAAIhR,EAAKzE,MAAM,WACrB,OAAIyV,EACK/T,SAAS+T,EAAE,GAAI,KAEhB,CACV,CCxDA,MAAMwgI,GAAc,MACdC,GAAc,MAIb,SAAS,GAAgB5qI,GAC9B,IAAIlM,EAAM,EACV,MAAMuoF,EAASr8E,EAAIhX,OACnB,IAAK,IAAIkB,EAAI,EAAGA,EAAImyF,EAAQnyF,GAAK,EAAG,CAClC,MAAMyP,EAAOqG,EAAI5U,WAAWlB,GAC5B,GAAIyP,GAAQ,IACV7F,GAAO,OACF,GAAI6F,GAAQ,KACjB7F,GAAO,OACF,IAAY,MAAP6F,KAAmBgxI,GAC7B72I,GAAO,MACF,CACL,MAAM0H,EAAOtR,EAAI,EACbsR,IAAS6gF,GAAU1iF,GAAQixI,KAIb,MADC5qI,EAAI5U,WAAWoQ,MACJovI,GAH5B92I,GAAO,GAML5J,EAAIsR,EACJ1H,GAAO,EAGb,CACF,CACA,OAAOA,CACT,CAEO,SAAS,GAAQkM,EAAKnQ,EAAK5G,GAChC,MAAMozF,EAASr8E,EAAIhX,OACfC,UACFA,EAAS,QAECoC,IAARwE,IACFA,EAAM,IAAIZ,WAAW,GAAe+Q,GAAO/W,IAE7C,IAAI0E,EAAM1E,EACV,IAAK,IAAIiB,EAAI,EAAGA,EAAImyF,EAAQnyF,GAAK,EAAG,CAClC,IAAIyP,EAAOqG,EAAI5U,WAAWlB,GAC1B,GAAIyP,GAAQ,IACV9J,EAAIlC,KAASgM,OACR,GAAIA,GAAQ,KACjB9J,EAAIlC,KAAS,KAAsB,KAAPgM,IAAyB,EACrD9J,EAAIlC,KAAS,IAAqB,GAAPgM,OACtB,IAAY,MAAPA,KAAmBgxI,GAC7B96I,EAAIlC,KAAS,KAAsB,MAAPgM,IAA8B,GAC1D9J,EAAIlC,KAAS,KAAsB,KAAPgM,IAA8B,EAC1D9J,EAAIlC,KAAS,IAAqB,GAAPgM,MACtB,CACL,MAAM6B,EAAOtR,EAAI,EACjB,GAAIsR,IAAS6gF,GAAU1iF,GAAQixI,GAE7B/6I,EAAIlC,KAAS,IACbkC,EAAIlC,KAAS,IACbkC,EAAIlC,KAAS,QACR,CACL,MAAMk9I,EAAW7qI,EAAI5U,WAAWoQ,IAChB,MAAXqvI,KAAuBD,IAE1B/6I,EAAIlC,KAAS,IACbkC,EAAIlC,KAAS,IACbkC,EAAIlC,KAAS,MAEbzD,EAAIsR,EACJ7B,EAAO,OACI,KAAPA,IAAwB,GACd,KAAXkxI,EACHh7I,EAAIlC,KAAS,KAAsB,QAAPgM,IAAmC,GAC/D9J,EAAIlC,KAAS,KAAsB,OAAPgM,IAAmC,GAC/D9J,EAAIlC,KAAS,KAAsB,KAAPgM,IAAmC,EAC/D9J,EAAIlC,KAAS,IAAqB,GAAPgM,EAE/B,CACF,CACF,CAEA,OADA,GAAOiG,MAAQjS,EAAM1E,EACd4G,CACT,CAGO,SAAS,GAAQA,EAAKxF,EAAOC,GAClC,IAAImR,EAAS,GACTpR,UACFA,EAAQ,GAENC,UACFA,EAAMuF,EAAI7G,QAEZ,IAAK,IAAIC,EAASoB,EAAOpB,EAASqB,GAAM,CACtC,MAAMqP,EAAO9J,EAAI5G,KACjB,IAAIyuC,EACJ,GAAI/9B,GAAQ,IACV+9B,EAAM/9B,OACD,GAAIA,EAAO,KAAOA,EAAO,IAC9B+9B,GAAe,GAAP/9B,IAAmB,EAAsB,GAAhB9J,EAAI5G,UAChC,GAAI0Q,EAAO,KAAOA,EAAO,IAAK,CACnC+9B,IACW,EAAP/9B,IAAiB,IACD,GAAhB9J,EAAI5G,OAAyB,IACb,GAAhB4G,EAAI5G,OAAyB,EACd,GAAhB4G,EAAI5G,MACH,MACJ,MAAM6hJ,EAAOH,GAAgBjzG,GAAO,GAAM,KAC1Cj8B,GAAU5Q,OAAOC,aAAaggJ,GAC9BpzG,EAAMkzG,GAAqB,KAANlzG,CACvB,MACEA,GAAe,GAAP/9B,IAAkB,IACN,GAAhB9J,EAAI5G,OAAyB,EACd,GAAhB4G,EAAI5G,KAETwS,GAAU5Q,OAAOC,aAAa4sC,EAChC,CAEA,OADA,GAAO93B,MAAQtV,EAAMD,EACdoR,CACT,CApCA,GAAOmE,MAAQ,EAqCf,GAAOA,MAAQ,ECvHR,MAAMmrI,GAAU3qI,GAASA,aAAiBnR,WAE1C,SAAS+7I,GAAY5qI,GAC1B,MAAwB,iBAAVA,EAAqB,GAAoBA,GAASA,EAAMmrB,UACxE,CAEO,SAAS,GAAMnrB,GACpB,OAAIA,aAAiBnR,WACZmR,EAELtX,MAAM+Y,QAAQzB,GACT,IAAInR,WAAWmR,GAEjB,GAAYA,EACrB,CAEO,SAAS,GAAOghC,EAAKphC,EAAK3V,GAC/B,GAAmB,iBAAR2V,EACT,MAAM,IAAI1U,MAAM,sBAGlB,OADA,GAAY0U,EAAKohC,EAAK/2C,GACf,GAAYuV,KACrB,CAYA,MAAMqrI,GAAOnhJ,KAAK+G,IAAI,EAAG,IACnBq6I,GAAOphJ,KAAK+G,IAAI,EAAG,IACnBs6I,GAAMrhJ,KAAK+G,IAAI,EAAG,GACXu6I,GAAe,CAACv7I,EAAK5G,IAAW4G,EAAI5G,GAAUgiJ,GACzDp7I,EAAI5G,EAAS,GAAKiiJ,GAClBr7I,EAAI5G,EAAS,GAAKkiJ,GAClBt7I,EAAI5G,EAAS,GAEFoiJ,GAAe,CAACx7I,EAAK5G,IAAY4G,EAAI5G,IAAW,EAAK4G,EAAI5G,EAAS,GAClEqiJ,GAAgB,CAACz7I,EAAK9C,EAAO9D,KACxC8D,GAASA,EACT8C,EAAI5G,EAAS,GAAK8D,EAClBA,KAAkB,EAClB8C,EAAI5G,EAAS,GAAK8D,EAClBA,KAAkB,EAClB8C,EAAI5G,EAAS,GAAK8D,EAClBA,KAAkB,EAClB8C,EAAI5G,GAAU8D,EACP9D,EAAS,GAELsiJ,GAAgB,CAAC17I,EAAK9C,EAAO9D,KACxC4G,EAAI5G,GAAU8D,GAAS,EACvB8C,EAAI5G,EAAS,GAAa,IAAR8D,EACX9D,EAAS,GAGX,SAASqiC,GAAMx/B,EAAQ2xB,EAAQ+tH,EAAaC,EAAaC,GAU9D,OATIF,EAAc,IAChBC,GAAeD,EACfA,EAAc,GAGZC,EAAc,IAChBA,EAAc,GAGZC,EAAY,EACP,IAAIz8I,WAAW,GAGpBu8I,GAAe/tH,EAAOz0B,QAAUyiJ,GAAeC,EAC1C,EAMX,SAAsB5/I,EAAQ2xB,EAAQ+tH,EAAaC,EAAaC,GAC1DA,EAAYD,EAAchuH,EAAOz0B,OAASwiJ,IAC5CE,EAAYD,EAAchuH,EAAOz0B,OAASwiJ,GAG5C,IAAIG,EAAKD,EAAYD,EACrB,MAAMG,EAAY9/I,EAAO9C,OAASyiJ,EAWlC,OAVIE,EAAKC,IACPD,EAAKC,IAGa,IAAhBH,GAAqBC,EAAY5/I,EAAO9C,UAC1C8C,EAAS,IAAImD,WAAWnD,EAAO1B,OAAQ0B,EAAO8/B,WAAa6/G,EAAaE,IAG1EluH,EAAOplB,IAAIvM,EAAQ0/I,GAEZG,CACT,CArBSE,CAAY//I,EAAQ2xB,EAAQ+tH,EAAaC,EAAaC,EAC/D,CCjEA,SAASh5G,IAAO,MAAE9yB,EAAQ,EAAC,OAAEzV,EAAM,OAAEe,EAAM,eAAE4lC,IAG3C,OAFA3mC,EAAOyV,MAAQA,EACf1U,EAAO0U,MAAQA,EACR,CACLzV,SACAe,SACA4lC,eAAgBA,GAAkB,KAAOlxB,GAE7C,CAEO,MAAM,GAAO8yB,GAAM,CACxB,MAAAvoC,CAAQ6V,EAAKnQ,EAAK5G,GACX4G,IAAKA,EAAM,IAAIZ,WAAW,GAAK6hC,eAAe9wB,KAC9C/W,IAAQA,EAAS,GACtB,MAAM0uC,EAAY1uC,EAGZW,EAAIoW,EAAIpT,QAAQ,YAAa,IACnC,GAAIhD,EAAEZ,OAAQ,CACZ,MAAM+gD,EAAOngD,EAAEoJ,MAAM,KAErB,IAAK,IAAI9I,EAAI,EAAGA,EAAI6/C,EAAK/gD,OAAQkB,IAAK,CACpC,MAAM4J,EAAM,GAAQjE,EAAKk6C,EAAK7/C,GAAIjB,EAAS,GAC3C4G,EAAI5G,GAAU6K,EACd7K,GAAU6K,EAAM,CAClB,CACF,CAKA,OAHAjE,EAAI5G,KAAY,EAEhB,GAAKkB,OAAOyV,MAAQ3W,EAAS0uC,EACtB9nC,CACT,EACA,MAAA3E,CAAQ2E,EAAK5G,GACNA,IAAQA,EAAS,GAEtB,MAAM8gD,EAAO,GACb,IAAIpS,EAAY1uC,EACZs8C,EAAc,EACdumG,EAAgB,EAChBC,GAAS,EAEb,OAAa,CACX,GAAI9iJ,GAAU4G,EAAI7G,OAChB,MAAM,IAAIsC,MAAM,wCAElB,MAAMwI,EAAMjE,EAAI5G,KAGhB,GAFA6iJ,GAAiBC,EAAS,EAAI,EAElB,IAARj4I,EACF,MACK,GAAW,IAANA,EAWL,IAAqB,KAAhBA,EAgBV,MAAM,IAAIxI,MAAM,kCAhBgB,CAChC,GAAIrC,EAAS,EAAI4G,EAAI7G,OACnB,MAAM,IAAIsC,MAAM,wCAElB,MAAM0gJ,EAAa,GAAen8I,EAAK5G,EAAS,GAAK,MACrD,GAAI+iJ,GAAcr0G,EAIhB,MAAM,IAAIrsC,MAAM,oCAElBrC,EAAS+iJ,EACTr0G,EAAYq0G,EACZF,GAAiBC,EAAS,EAAI,EAC9BA,GAAS,CACX,CAEA,KA5B+B,CAC7B,GAAI9iJ,EAAS6K,EAAMjE,EAAI7G,OACrB,MAAM,IAAIsC,MAAM,wCAGlB,GADAi6C,GAAezxC,EAAM,EACjByxC,EAAc,IAChB,MAAM,IAAIj6C,MAAM,sCAElBy+C,EAAKn/C,KAAK,GAAOiF,EAAK5G,EAAQA,EAAS6K,IACvC7K,GAAU6K,EACVg4I,GAAiBC,EAAS,EAAIj4I,CAChC,CAkBF,CAGA,OADA,GAAK5I,OAAO0U,MAAQksI,EACG,IAAhB/hG,EAAK/gD,OAAe,IAAM+gD,EAAK/+C,KAAK,IAC7C,EACA8lC,eAAgBlnC,GACJ,MAANA,GAAmB,OAANA,EAAmB,EAC7B,GAAaA,EAAEgD,QAAQ,YAAa,KAAO,IAIhD,GAAS8lC,GAAM,CACnB,MAAAvoC,CAAQ0Y,EAAGhT,EAAK5G,GACT4G,IAAKA,EAAM,IAAIZ,WAAW,GAAO6hC,eAAejuB,KAChD5Z,IAAQA,EAAS,GAEtB,MAAM6K,EAAM,GAAQjE,EAAKgT,EAAG5Z,EAAS,GAGrC,OAFA4G,EAAI5G,GAAU6K,EACd,GAAO3J,OAAOyV,MAAQ9L,EAAM,EACrBjE,CACT,EACA,MAAA3E,CAAQ2E,EAAK5G,GACNA,IAAQA,EAAS,GAEtB,MAAM6K,EAAMjE,EAAI5G,GACV4Z,EAAI,GAAOhT,EAAK5G,EAAS,EAAGA,EAAS,EAAI6K,GAE/C,OADA,GAAO5I,OAAO0U,MAAQ9L,EAAM,EACrB+O,CACT,EACAiuB,eAAgBjuB,GACP,GAAaA,GAAK,IAIvBgnG,GAASn3E,GAAM,CACnB9yB,MAAO,GACP,MAAAzV,CAAQ8a,EAAGpV,EAAK5G,GACT4G,IAAKA,EAAM,IAAIZ,WAAW46G,GAAO/4E,eAAe7rB,KAChDhc,IAAQA,EAAS,GAEtB,MAAMgjJ,EAAyB,OAAhBhnI,EAAEgnI,OAAS,GACpBz2I,EAAkB,aAAXyP,EAAEzP,KA/HG,MADH,EAyIf,OAPA,GAAgB3F,EAAKoV,EAAE2J,IAAM,EAAG3lB,GAChC,GAAgB4G,EAAKo8I,EAAQz2I,EAAMvM,EAAS,GAC5C,GAAgB4G,EAAKoV,EAAE+8G,UAAUh5H,OAAQC,EAAS,GAClD,GAAgB4G,EAAKoV,EAAEk9G,QAAQn5H,OAAQC,EAAS,GAChD,GAAgB4G,EAAKoV,EAAEinI,YAAYljJ,OAAQC,EAAS,GACpD,GAAgB4G,EAAKoV,EAAEknI,YAAYnjJ,OAAQC,EAAS,IAE7C4G,CACT,EACA,MAAA3E,CAAQ2E,EAAK5G,GAEX,GADKA,IAAQA,EAAS,GAClB4G,EAAI7G,OAAS,GAAI,MAAM,IAAIsC,MAAM,2BACrC,MAAM2gJ,EAAQ,GAAep8I,EAAK5G,EAAS,GAE3C,MAAO,CACL2lB,GAAI,GAAe/e,EAAK5G,GACxBuM,KAjJgB,MAiJVy2I,EAAwB,WAAa,QAC3CA,MAAe,MAARA,EACPG,QAAmC,IAAxBH,GAAS,GAAM,GAC1B1B,OAAQ,GAAkB0B,GAAS,GAAM,IACzCI,QAAmC,IAAxBJ,GAAS,GAAM,GAC1B3qB,QAAkC,IAAvB2qB,GAAS,EAAK,GACzBzqB,QAAkC,IAAvByqB,GAAS,EAAK,GACzBvqB,QAAkC,IAAvBuqB,GAAS,EAAK,GACzBK,OAAiC,IAAvBL,GAAS,EAAK,GACxBrqB,QAAkC,IAAvBqqB,GAAS,EAAK,GACzBnqB,QAAkC,IAAvBmqB,GAAS,EAAK,GACzB3B,MAAO,GAAwB,GAAR2B,GACvBjqB,UAAW,IAAIl5H,MAAM,GAAe+G,EAAK5G,EAAS,IAClDk5H,QAAS,IAAIr5H,MAAM,GAAe+G,EAAK5G,EAAS,IAChDijJ,YAAa,IAAIpjJ,MAAM,GAAe+G,EAAK5G,EAAS,IACpDkjJ,YAAa,IAAIrjJ,MAAM,GAAe+G,EAAK5G,EAAS,KAExD,EACA6nC,eAAe,IACN,KAILy7G,GAAW75G,GAAM,CACrB,MAAAvoC,CAAQuhC,EAAM77B,EAAK5G,GACZ4G,IAAKA,EAAM,IAAIZ,WAAWs9I,GAASz7G,eAAepF,KAClDziC,IAAQA,EAAS,GAEtB,MAAMujJ,EAAO9gH,EAAK1iC,OAKlB,OAJA,GAAgB6G,EAAK28I,EAAMvjJ,GAC3B,GAAOyiC,EAAM77B,EAAK5G,EAAS,EAAG,EAAGujJ,GAEjCD,GAASpiJ,OAAOyV,MAAQ4sI,EAAO,EACxB38I,CACT,EACA,MAAA3E,CAAQ2E,EAAK5G,GACNA,IAAQA,EAAS,GAEtB,MAAM6K,EAAM,GAAejE,EAAK5G,GAC1ByiC,EAAO77B,EAAI9E,MAAM9B,EAAS,EAAGA,EAAS,EAAI6K,GAEhD,OADAy4I,GAASrhJ,OAAO0U,MAAQ9L,EAAM,EACvB43B,CACT,EACAoF,eAAgBpF,GACPA,EAAK1iC,OAAS,IAInByjJ,GAAM/5G,GAAM,CAChBvoC,OAAO,CAACuhC,EAAM77B,EAAK5G,KACZ4G,IAAKA,EAAM,IAAIZ,WAAWw9I,GAAI37G,eAAepF,KAC7CziC,IAAQA,EAAS,GAEtB,GAAKkB,OAAOuhC,EAAM77B,EAAK5G,EAAS,GAChC,GAAgB4G,EAAK,GAAK1F,OAAOyV,MAAO3W,GACxCwjJ,GAAItiJ,OAAOyV,MAAQ,GAAKzV,OAAOyV,MAAQ,EAChC/P,GAET,MAAA3E,CAAQ2E,EAAK5G,GACNA,IAAQA,EAAS,GAEtB,MAAM6K,EAAM,GAAejE,EAAK5G,GAC1ByjJ,EAAK,GAAKxhJ,OAAO2E,EAAK5G,EAAS,GAGrC,OADAwjJ,GAAIvhJ,OAAO0U,MAAQ9L,EAAM,EAClB44I,CACT,EACA57G,eAAgBpF,GACP,GAAKoF,eAAepF,GAAQ,IAIjCihH,GAAOj6G,GAAM,CACjB,MAAAvoC,CAAQuhC,EAAM77B,EAAK5G,GACZ4G,IAAKA,EAAM,IAAIZ,WAAW09I,GAAK77G,eAAepF,KAC9CziC,IAAQA,EAAS,GAEtB,MAAM0uC,EAAY1uC,EAmBlB,OAlBAA,GAAU,EACV,GAAKkB,OAAOuhC,EAAKkhH,MAAO/8I,EAAK5G,GAC7BA,GAAU,GAAKkB,OAAOyV,MACtB,GAAKzV,OAAOuhC,EAAKmhH,MAAOh9I,EAAK5G,GAC7BA,GAAU,GAAKkB,OAAOyV,MACtB,GAAgB/P,EAAK67B,EAAKohH,QAAU,EAAG7jJ,GACvCA,GAAU,EACV,GAAgB4G,EAAK67B,EAAKqhH,SAAW,EAAG9jJ,GACxCA,GAAU,EACV,GAAgB4G,EAAK67B,EAAKshH,OAAS,EAAG/jJ,GACtCA,GAAU,EACV,GAAgB4G,EAAK67B,EAAKuhH,QAAU,EAAGhkJ,GACvCA,GAAU,EACV,GAAgB4G,EAAK67B,EAAKwhH,SAAW,EAAGjkJ,GAGxC,GAAgB4G,GAFhB5G,GAAU,GAEoB0uC,EAAY,EAAGA,GAC7Cg1G,GAAKxiJ,OAAOyV,MAAQ3W,EAAS0uC,EACtB9nC,CACT,EACA,MAAA3E,CAAQ2E,EAAK5G,GACNA,IAAQA,EAAS,GAEtB,MAAM0uC,EAAY1uC,EAEZyiC,EAAO,CAAC,EAkBd,OAjBAziC,GAAU,EACVyiC,EAAKkhH,MAAQ,GAAK1hJ,OAAO2E,EAAK5G,GAC9BA,GAAU,GAAKiC,OAAO0U,MACtB8rB,EAAKmhH,MAAQ,GAAK3hJ,OAAO2E,EAAK5G,GAC9BA,GAAU,GAAKiC,OAAO0U,MACtB8rB,EAAKohH,OAAS,GAAej9I,EAAK5G,GAClCA,GAAU,EACVyiC,EAAKqhH,QAAU,GAAel9I,EAAK5G,GACnCA,GAAU,EACVyiC,EAAKshH,MAAQ,GAAen9I,EAAK5G,GACjCA,GAAU,EACVyiC,EAAKuhH,OAAS,GAAep9I,EAAK5G,GAClCA,GAAU,EACVyiC,EAAKwhH,QAAU,GAAer9I,EAAK5G,GACnCA,GAAU,EAEV0jJ,GAAKzhJ,OAAO0U,MAAQ3W,EAAS0uC,EACtBjM,CACT,EACAoF,eAAgBpF,GACP,GAAK,GAAKoF,eAAepF,EAAKkhH,OAAS,GAAK97G,eAAepF,EAAKmhH,SAIrEM,GAAOz6G,GAAM,CACjB,MAAAvoC,CAAQuhC,EAAM77B,EAAK5G,GACZH,MAAM+Y,QAAQ6pB,KAAOA,EAAO,CAACA,IAClC,IAAK,IAAIxhC,EAAI,EAAGA,EAAIwhC,EAAK1iC,OAAQkB,IAI/B,GAHuB,iBAAZwhC,EAAKxhC,KACdwhC,EAAKxhC,GAAK,GAAOwhC,EAAKxhC,MAEnB,GAAUwhC,EAAKxhC,IAClB,MAAM,IAAIoB,MAAM,oBAIfuE,IAAKA,EAAM,IAAIZ,WAAWk+I,GAAKr8G,eAAepF,KAC9CziC,IAAQA,EAAS,GAEtB,MAAM0uC,EAAY1uC,EAWlB,OAVAA,GAAU,EAEVyiC,EAAKtyB,SAAQ,SAAUgR,GACrBva,EAAI5G,KAAYmhB,EAAEphB,OAClB,GAAOohB,EAAGva,EAAK5G,EAAQ,EAAGmhB,EAAEphB,QAC5BC,GAAUmhB,EAAEphB,MACd,IAEA,GAAgB6G,EAAK5G,EAAS0uC,EAAY,EAAGA,GAC7Cw1G,GAAKhjJ,OAAOyV,MAAQ3W,EAAS0uC,EACtB9nC,CACT,EACA,MAAA3E,CAAQ2E,EAAK5G,GACNA,IAAQA,EAAS,GACtB,MAAM0uC,EAAY1uC,EAClB,IAAIonI,EAAY,GAAexgI,EAAK5G,GACpCA,GAAU,EAEV,MAAMyiC,EAAO,GACb,KAAO2kG,EAAY,GAAG,CACpB,MAAMv8H,EAAMjE,EAAI5G,KAEhB,KADEonI,EACEA,EAAYv8H,EACd,MAAM,IAAIxI,MAAM,mBAElBogC,EAAK9gC,KAAKiF,EAAI9E,MAAM9B,EAAQA,EAAS6K,IACrC7K,GAAU6K,EACVu8H,GAAav8H,CACf,CAGA,OADAq5I,GAAKjiJ,OAAO0U,MAAQ3W,EAAS0uC,EACtBjM,CACT,EACA,cAAAoF,CAAgBpF,GACT5iC,MAAM+Y,QAAQ6pB,KAAOA,EAAO,CAACA,IAClC,IAAI1iC,EAAS,EAQb,OAPA0iC,EAAKtyB,SAAQ,SAAUvJ,GAEnB7G,GADiB,iBAAR6G,EACC,GAAaA,GAAO,EAEpBA,EAAI7G,OAAS,CAE3B,IACOA,CACT,IAGIokJ,GAAQ16G,GAAM,CAClB,MAAAvoC,CAAQuhC,EAAM77B,EAAK5G,GACZ4G,IAAKA,EAAM,IAAIZ,WAAWm+I,GAAMt8G,eAAepF,KAC/CziC,IAAQA,EAAS,GAEF,iBAATyiC,IAAmBA,EAAO,GAAOA,IACvCA,IAAMA,EAAO,IAAIz8B,WAAW,IAEjC,MAAM0oC,EAAY1uC,EAClBA,GAAU,EAEV,MAAM6K,EAAM43B,EAAK1iC,OAMjB,OALA,GAAO0iC,EAAM77B,EAAK5G,EAAQ,EAAG6K,GAG7B,GAAgBjE,GAFhB5G,GAAU6K,GAEoB6jC,EAAY,EAAGA,GAC7Cy1G,GAAMjjJ,OAAOyV,MAAQ3W,EAAS0uC,EACvB9nC,CACT,EACA,MAAA3E,CAAQ2E,EAAK5G,GACNA,IAAQA,EAAS,GACtB,MAAM0uC,EAAY1uC,EACZ6K,EAAM,GAAejE,EAAK5G,GAEhCA,GAAU,EAEV,MAAMyiC,EAAO77B,EAAI9E,MAAM9B,EAAQA,EAAS6K,GAIxC,OAHA7K,GAAU6K,EAEVs5I,GAAMliJ,OAAO0U,MAAQ3W,EAAS0uC,EACvBjM,CACT,EACAoF,eAAgBpF,GACTA,GACG,GAAUA,GAAQA,EAAK1iC,OAAS,GAAa0iC,IAAS,EAD5C,IAKhB2hH,GAAS36G,GAAM,CACnB,MAAAvoC,CAAQuhC,EAAM77B,EAAK5G,GACZ4G,IAAKA,EAAM,IAAIZ,WAAWo+I,GAAOv8G,eAAepF,KAChDziC,IAAQA,EAAS,GAEtB,MAAM0uC,EAAY1uC,EAQlB,OAPAA,GAAU,EACV,GAAOkB,OAAOuhC,EAAK4hH,IAAKz9I,EAAK5G,GAC7BA,GAAU,GAAOkB,OAAOyV,MACxB,GAAOzV,OAAOuhC,EAAK6hH,GAAI19I,EAAK5G,GAC5BA,GAAU,GAAOkB,OAAOyV,MACxB,GAAgB/P,EAAK5G,EAAS0uC,EAAY,EAAGA,GAC7C01G,GAAOljJ,OAAOyV,MAAQ3W,EAAS0uC,EACxB9nC,CACT,EACA,MAAA3E,CAAQ2E,EAAK5G,GACNA,IAAQA,EAAS,GAEtB,MAAM0uC,EAAY1uC,EAEZyiC,EAAO,CAAC,EAOd,OANAziC,GAAU,EACVyiC,EAAK4hH,IAAM,GAAOpiJ,OAAO2E,EAAK5G,GAC9BA,GAAU,GAAOiC,OAAO0U,MACxB8rB,EAAK6hH,GAAK,GAAOriJ,OAAO2E,EAAK5G,GAC7BA,GAAU,GAAOiC,OAAO0U,MACxBytI,GAAOniJ,OAAO0U,MAAQ3W,EAAS0uC,EACxBjM,CACT,EACAoF,eAAgBpF,GACP,GAAOoF,eAAepF,EAAK4hH,KAAO,GAAOx8G,eAAepF,EAAK6hH,IAAM,IAIxEC,GAAO96G,GAAM,CACjBvoC,OAAO,CAACuhC,EAAM77B,EAAK5G,KACZ4G,IAAKA,EAAM,IAAIZ,WAAWu+I,GAAK18G,eAAepF,KAC9CziC,IAAQA,EAAS,GAEtB,GAAKkB,OAAOuhC,EAAM77B,EAAK5G,EAAS,GAChC,GAAgB4G,EAAK,GAAK1F,OAAOyV,MAAO3W,GACxCukJ,GAAKrjJ,OAAOyV,MAAQ,GAAKzV,OAAOyV,MAAQ,EACjC/P,GAET,MAAA3E,CAAQ2E,EAAK5G,GACNA,IAAQA,EAAS,GAEtB,MAAMyiC,EAAO,GAAKxgC,OAAO2E,EAAK5G,EAAS,GAEvC,OADAukJ,GAAKtiJ,OAAO0U,MAAQ,GAAK1U,OAAO0U,MAAQ,EACjC8rB,CACT,EACAoF,eAAgBpF,GACP,GAAKoF,eAAepF,GAAQ,IAIjC+hH,GAAO/6G,GAAM,CACjB,MAAAvoC,CAAQuhC,EAAM77B,EAAK5G,GACZ4G,IAAKA,EAAM,IAAIZ,WAAWw+I,GAAK38G,eAAepF,KAC9CziC,IAAQA,EAAS,GAEtB,GAAgB4G,EAAK67B,EAAK8oF,UAAY,EAAGvrH,EAAS,GAClD,GAAgB4G,EAAK67B,EAAKgiH,QAAU,EAAGzkJ,EAAS,GAChD,GAAgB4G,EAAK67B,EAAK06B,MAAQ,EAAGn9D,EAAS,GAC9C,GAAKkB,OAAOuhC,EAAKjO,OAAQ5tB,EAAK5G,EAAS,GAEvC,MAAM6K,EAAM,GAAK3J,OAAOyV,MAAQ,EAIhC,OAHA,GAAgB/P,EAAKiE,EAAK7K,GAE1BwkJ,GAAKtjJ,OAAOyV,MAAQ9L,EAAM,EACnBjE,CACT,EACA,MAAA3E,CAAQ2E,EAAK5G,GACNA,IAAQA,EAAS,GAEtB,MAAM6K,EAAM,GAAejE,EAAK5G,GAE1ByiC,EAAO,CAAC,EAOd,OANAA,EAAK8oF,SAAW,GAAe3kH,EAAK5G,EAAS,GAC7CyiC,EAAKgiH,OAAS,GAAe79I,EAAK5G,EAAS,GAC3CyiC,EAAK06B,KAAO,GAAev2D,EAAK5G,EAAS,GACzCyiC,EAAKjO,OAAS,GAAKvyB,OAAO2E,EAAK5G,EAAS,GAExCwkJ,GAAKviJ,OAAO0U,MAAQ9L,EAAM,EACnB43B,CACT,EACAoF,eAAgBpF,GACP,EAAI,GAAKoF,eAAepF,EAAKjO,UAIlCkwH,GAAOj7G,GAAM,CACjB,MAAAvoC,CAAQuhC,EAAM77B,EAAK5G,GACjB,MAAM6K,EAAM65I,GAAK78G,eAAepF,GAmBhC,OAjBK77B,IAAKA,EAAM,IAAIZ,WAAW0+I,GAAK78G,eAAepF,KAC9CziC,IAAQA,EAAS,GAElByiC,EAAKkiH,iBACPliH,EAAKugH,MAAQ0B,GAAKE,iBAGpB,GAAgBh+I,EAAKiE,EAAM,EAAG7K,GAE9B4G,EADA5G,GAAU,GACIyiC,EAAKugH,OAAS,EAC5BhjJ,GAAU,EACV,GAAOkB,OAAOuhC,EAAKkS,IAAK/tC,EAAK5G,GAC7BA,GAAU,GAAOkB,OAAOyV,MACxB,GAAQ/P,EAAK67B,EAAK3+B,MAAO9D,GACzBA,GAAU,GAAayiC,EAAK3+B,OAE5B4gJ,GAAKxjJ,OAAOyV,MAAQ9L,EACbjE,CACT,EACA,MAAA3E,CAAQ2E,EAAK5G,GACNA,IAAQA,EAAS,GAEtB,MAAM6K,EAAM,GAAejE,EAAK5G,GAG1B0uC,EAFN1uC,GAAU,EAGJyiC,EAAO,CAAC,EAWd,OAVAA,EAAKugH,MAAQp8I,EAAI5G,GACjBA,GAAU,EACVyiC,EAAKkS,IAAM,GAAO1yC,OAAO2E,EAAK5G,GAC9BA,GAAU,GAAOiC,OAAO0U,MACxB8rB,EAAK3+B,MAAQ,GAAO8C,EAAK5G,EAAQ0uC,EAAY7jC,GAE7C43B,EAAKkiH,kBAAoBliH,EAAKugH,MAAQ0B,GAAKE,iBAE3CF,GAAKziJ,OAAO0U,MAAQ9L,EAAM,EAEnB43B,CACT,EACAoF,eAAgBpF,GACP,GAAOoF,eAAepF,EAAKkS,KAAO,GAAO9M,eAAepF,EAAK3+B,OAAS,IAIjF4gJ,GAAKE,gBAAkB,IAEvB,MAAMC,GAAMp7G,GAAM,CAChB,MAAAvoC,CAAQuhC,EAAM77B,EAAK5G,GACZ4G,IAAKA,EAAM,IAAIZ,WAAW6+I,GAAIh9G,eAAepF,KAC7CziC,IAAQA,EAAS,GAEtB,MAAM0uC,EAAY1uC,EASlB,OARAA,GAAU,EACV,GAAgB4G,EAAK67B,EAAKqiH,YAAc,EAAG9kJ,GAC3CA,GAAU,EACV,GAAKkB,OAAOuhC,EAAKsiH,SAAUn+I,EAAK5G,GAChCA,GAAU,GAAKkB,OAAOyV,MAEtB,GAAgB/P,EAAK5G,EAAS0uC,EAAY,EAAGA,GAC7Cm2G,GAAI3jJ,OAAOyV,MAAQ3W,EAAS0uC,EACrB9nC,CACT,EACA,MAAA3E,CAAQ2E,EAAK5G,GACNA,IAAQA,EAAS,GAEtB,MAAM0uC,EAAY1uC,EAEZyiC,EAAO,CAAC,EAQd,OAPAziC,GAAU,EACVyiC,EAAKqiH,WAAa,GAAel+I,EAAK5G,GACtCA,GAAU,EACVyiC,EAAKsiH,SAAW,GAAK9iJ,OAAO2E,EAAK5G,GACjCA,GAAU,GAAKiC,OAAO0U,MAEtBkuI,GAAI5iJ,OAAO0U,MAAQ3W,EAAS0uC,EACrBjM,CACT,EACAoF,eAAgBpF,GACP,EAAI,GAAKoF,eAAepF,EAAKsiH,YAIlCC,GAAKv7G,GAAM,CACfvoC,OAAO,CAAC69D,EAAMn4D,EAAK5G,KACZ4G,IAAKA,EAAM,IAAIZ,WAAWg/I,GAAGn9G,eAAek3B,KAC5C/+D,IAAQA,EAAS,GAEtB,GAAgB4G,EAAK,EAAG5G,GACxBA,GAAU,EACV,GAAMkB,OAAO69D,EAAMn4D,EAAK5G,GACjB4G,GAET3E,OAAO,CAAC2E,EAAK5G,KACNA,IAAQA,EAAS,GAEtBA,GAAU,EACG,GAAMiC,OAAO2E,EAAK5G,IAGjC2W,MAAO,IAGHsuI,GAAQx7G,GAAM,CAClBvoC,OAAO,CAAC69D,EAAMn4D,EAAK5G,KACZ4G,IAAKA,EAAM,IAAIZ,WAAWi/I,GAAMp9G,eAAek3B,KAC/C/+D,IAAQA,EAAS,GAEtB,GAAgB4G,EAAK,GAAI5G,GACzBA,GAAU,EACV,GAAMkB,OAAO69D,EAAMn4D,EAAK5G,GACxBilJ,GAAM/jJ,OAAOyV,MAAQ,GACd/P,GAET,MAAA3E,CAAQ2E,EAAK5G,GACNA,IAAQA,EAAS,GAEtBA,GAAU,EACV,MAAM++D,EAAO,GAAM98D,OAAO2E,EAAK5G,GAE/B,OADAilJ,GAAMhjJ,OAAO0U,MAAQ,GACdooD,CACT,EACApoD,MAAO,KAGH,GAAQpM,GAAQ,IAAIvE,WAAWuE,GAE/B26I,GAAUz7G,GAAM,CACpB,MAAAvoC,CAAQ+f,EAAQra,EAAK5G,GACd4G,IAAKA,EAAM,IAAIZ,WAAWk/I,GAAQr9G,eAAe5mB,KACjDjhB,IAAQA,EAAS,GACtB,MAAM0uC,EAAY1uC,EAEZ0Q,EAAO,GAAmBuQ,EAAOvQ,MAGvC,GAFA,GAAgB9J,EAAK8J,EAAM1Q,GAC3BA,GAAU,EACNihB,EAAOwhB,KACT,GAAgB77B,EAAKqa,EAAOwhB,KAAK1iC,OAAQC,GACzCA,GAAU,EACV,GAAOihB,EAAOwhB,KAAM77B,EAAK5G,GACzBA,GAAUihB,EAAOwhB,KAAK1iC,YAEtB,OAAQ2Q,GAGN,KAAK,EACH,CAEE,MAAMy0I,EAAMlkI,EAAOmkI,oBAAsB,EACnCC,EAAMpkI,EAAO49C,QRrcxB,SAAmBp+D,GACxB,OAAO0gJ,GAAO1gJ,KAAY,GAAG8J,KAAO,EAAI,CAC1C,CQmcyC,CAAY0W,EAAOgD,IAC1CqhI,ERlcX,SAAiBrhI,EAAI68H,EAAM9gJ,GAChCA,IAAWA,EACX,MAAMuK,EAAO42I,GAAOl9H,GAIpB,MAHoB,mBAAT68H,IACTA,EAAOA,EAAK9gJ,EAASuK,IAEnBA,IAAS,GAAGA,KACP,GAAGrJ,OAAO+iB,EAAI68H,EAAM9gJ,GAEtBwW,GAAGtV,OAAO+iB,EAAI68H,EAAM9gJ,EAC7B,CQwb0B,CAAUihB,EAAOgD,GAAI,IAC7BshI,EAAQ1kJ,KAAKC,KAAKqkJ,EAAM,GAC9B,GAAgBv+I,EAAK2+I,EAAQ,EAAGvlJ,GAEhC,GAAgB4G,EAAKy+I,EADrBrlJ,GAAU,GAEVA,GAAU,EACV4G,EAAI5G,KAAYmlJ,EAChBv+I,EAAI5G,KAAYihB,EAAOukI,mBAAqB,EAE5C,GAAOF,EAAO1+I,EAAK5G,EAAQ,EAAGulJ,GAC9BvlJ,GAAUulJ,CACZ,CACA,MAGF,KAAK,GACCtkI,EAAOmvC,SACT,GAAgBxpD,EAAK,EAAG5G,GACxBA,GAAU,EACV,GAAgB4G,EAAKqa,EAAOmvC,QAASpwD,GACrCA,GAAU,IAEV,GAAgB4G,EAAK,EAAG5G,GACxBA,GAAU,GAEZ,MACF,KAAK,GACH,CACE,MAAM6K,EAAMoW,EAAOlhB,QAAU,EAC7B,GAAgB6G,EAAKiE,EAAK7K,GAC1BA,GAAU,EACV4G,EAAIkzC,KAAK,EAAG95C,EAAQA,EAAS6K,GAC7B7K,GAAU6K,CACZ,CACA,MAEF,KAAK,GACH,CACE,MAAM46I,EAA+B,EAArBxkI,EAAOmoC,KAAKrpD,OAC5B,GAAgB6G,EAAK6+I,EAASzlJ,GAC9BA,GAAU,EACV,IAAK,MAAM20C,KAAO1zB,EAAOmoC,KACvB,GAAgBxiD,EAAK+tC,EAAK30C,GAC1BA,GAAU,CAEd,CACA,MACF,QACE,MAAM,IAAIqC,MAAM,yBAAyB4e,EAAOvQ,QAKtD,OADAw0I,GAAQhkJ,OAAOyV,MAAQ3W,EAAS0uC,EACzB9nC,CACT,EACA,MAAA3E,CAAQ2E,EAAK5G,GACNA,IAAQA,EAAS,GACtB,MAAMihB,EAAS,CAAC,EAChBA,EAAOvQ,KAAO,GAAe9J,EAAK5G,GAClCihB,EAAO1U,KH/qBJ,SAAmBA,GACxB,OAAQA,GAGN,KAAK,EAAG,MAAO,MACf,KAAK,EAAG,MAAO,KACf,KAAK,EAAG,MAAO,OACf,KAAK,EAAG,MAAO,MACf,KAAK,EAAG,MAAO,MACf,KAAK,EAAG,MAAO,MACf,KAAK,EAAG,MAAO,gBACf,KAAK,EAAG,MAAO,SACf,KAAK,GAAI,MAAO,SAChB,KAAK,GAAI,MAAO,gBAChB,KAAK,GAAI,MAAO,UAChB,KAAK,GAAI,MAAO,QAChB,KAAK,GAAI,MAAO,UAChB,KAAK,MAAO,MAAO,WAErB,OAAIA,EAAO,EACF,KAEF,UAAUA,GACnB,CGwpBkB,CAAqB0U,EAAOvQ,MAE1C,MAAM7F,EAAM,GAAejE,EAD3B5G,GAAU,GAIV,OAFAA,GAAU,EACVihB,EAAOwhB,KAAO77B,EAAI9E,MAAM9B,EAAQA,EAAS6K,GACjCoW,EAAOvQ,MAEb,KAAK,EACHuQ,EAAO49C,OAAS,GAAej4D,EAAK5G,GACpCA,GAAU,EACVihB,EAAOmkI,mBAAqBx+I,EAAI5G,KAChCihB,EAAOukI,kBAAoB5+I,EAAI5G,KAC/B,CACE,MAAM0lJ,EAAS,IAAI1/I,WAA8B,IAAlBib,EAAO49C,OAAgB,EAAI,IAC1D,GAAOj4D,EAAK8+I,EAAQ,EAAG1lJ,EAAQA,EAAS6K,EAAM,GAC9CoW,EAAOgD,GRhgBV,SAAiB68H,EAAM9gJ,EAAQD,GAGpC,GAFAC,IAAWA,GACXD,EAASA,GAAW+gJ,EAAK/gJ,OAASC,KACnB,GAAGuK,KAChB,OAAO,GAAGtI,OAAO6+I,EAAM9gJ,EAAQD,GAEjC,GAAIA,IAAWyW,GAAGjM,KAChB,OAAOiM,GAAGvU,OAAO6+I,EAAM9gJ,EAAQD,GAEjC,MAAMsC,MAAM,mCAAmC,GAAGkI,kBAAkBiM,GAAGjM,eACzE,CQsfsB,CAAUm7I,EACxB,CACA,MAEF,KAAK,GACC76I,EAAM,IACRoW,EAAOmvC,QAAU,GAAexpD,EAAK5G,GACrCA,GAAU,GAEZ,MACF,KAAK,GACHihB,EAAOmoC,KAAO,GACd,IAAK,IAAInoD,EAAI,EAAGA,EAAI4J,EAAK5J,GAAK,EAC5BggB,EAAOmoC,KAAKznD,KAAK,GAAeiF,EAAK5G,IACrCA,GAAU,EAMhB,OADAklJ,GAAQjjJ,OAAO0U,MAAQ9L,EAAM,EACtBoW,CACT,EACA,cAAA4mB,CAAgB5mB,GACd,GAAIA,EAAOwhB,KACT,OAAOxhB,EAAOwhB,KAAK1iC,OAAS,EAG9B,OADa,GAAmBkhB,EAAOvQ,OAErC,KAAK,EACL,CACE,MAAMy0I,EAAMlkI,EAAOmkI,oBAAsB,EACzC,OAAOvkJ,KAAKC,KAAKqkJ,EAAM,GAAK,CAC9B,CACA,KAAK,GACH,MAAkC,iBAAnBlkI,EAAOmvC,QAAwB,EAAI,EACpD,KAAK,GACH,OAAOnvC,EAAOlhB,OAAS,EACzB,KAAK,GACH,OAAO,EAA0B,EAArBkhB,EAAOmoC,KAAKrpD,OAE5B,MAAM,IAAIsC,MAAM,yBAAyB4e,EAAOvQ,OAClD,IAGIi1I,GAAOl8G,GAAM,CACjB,MAAAvoC,CAAQkE,EAASwB,EAAK5G,GACf4G,IAAKA,EAAM,IAAIZ,WAAW2/I,GAAK99G,eAAeziC,KAC9CpF,IAAQA,EAAS,GACtB,MAAM0uC,EAAY1uC,EAEZ4lJ,EAAQC,GAAmBzgJ,EAAS8/I,IAK1C,OAJA,GAAgBt+I,EAAKg/I,EAAO5lJ,GAC5BA,EAAS8lJ,GAAW1gJ,EAAS8/I,GAASt+I,EAAK5G,EAAS,GAEpD2lJ,GAAKzkJ,OAAOyV,MAAQ3W,EAAS0uC,EACtB9nC,CACT,EACA,MAAA3E,CAAQ2E,EAAK5G,GACNA,IAAQA,EAAS,GACtB,MAAM0uC,EAAY1uC,EAEZoF,EAAU,GAChB,IAAIwgJ,EAAQ,GAAeh/I,EAAK5G,GAChCA,GAAU,EACV,IAAIsb,EAAI,EACR,KAAOsqI,EAAQ,GACbxgJ,EAAQkW,KAAO4pI,GAAQjjJ,OAAO2E,EAAK5G,GACnCA,GAAUklJ,GAAQjjJ,OAAO0U,MACzBivI,GAASV,GAAQjjJ,OAAO0U,MAG1B,OADAgvI,GAAK1jJ,OAAO0U,MAAQ3W,EAAS0uC,EACtBtpC,CACT,EACAyiC,eAAgBziC,GACP,EAAIygJ,GAAmBzgJ,GAAW,GAAI8/I,MAI3Ca,GAAUt8G,GAAM,CACpB,MAAAvoC,CAAQkP,EAAKxJ,EAAK5G,GACX4G,IAAKA,EAAM,IAAIZ,WAAW+/I,GAAQl+G,eAAez3B,KACjDpQ,IAAQA,EAAS,GACtB,MAAM0uC,EAAY1uC,EAEZgmJ,EAAU51I,EAAIA,IACpB,IAAK,GAAU41I,GACb,MAAM,IAAI3jJ,MAAM,wBAelB,OAZArC,GAAU,EACV,GAAgB4G,EAAKwJ,EAAI4yI,MAAOhjJ,GAEhC4G,EADA5G,GAAU,GACI+lJ,GAAQE,gBAEtBr/I,EADA5G,GAAU,GACIoQ,EAAImK,UAElB,GAAOyrI,EAASp/I,EADhB5G,GAAU,EACmB,EAAGgmJ,EAAQjmJ,QACxCC,GAAUgmJ,EAAQjmJ,OAElBgmJ,GAAQ7kJ,OAAOyV,MAAQ3W,EAAS0uC,EAChC,GAAgB9nC,EAAKm/I,GAAQ7kJ,OAAOyV,MAAQ,EAAG+3B,GACxC9nC,CACT,EACA,MAAA3E,CAAQ2E,EAAK5G,GACNA,IAAQA,EAAS,GACtB,MAAM0uC,EAAY1uC,EAEZoQ,EAAM,CAAC,EACPrQ,EAAS,GAAe6G,EAAK5G,GAInC,GAHAA,GAAU,EACVoQ,EAAI4yI,MAAQ,GAAep8I,EAAK5G,GAE5B4G,EADJ5G,GAAU,KACU+lJ,GAAQE,gBAC1B,MAAM,IAAI5jJ,MAAM,sBAQlB,OANArC,GAAU,EACVoQ,EAAImK,UAAY3T,EAAI5G,GACpBA,GAAU,EACVoQ,EAAIA,IAAMxJ,EAAI9E,MAAM9B,EAAQ0uC,EAAY3uC,EAAS,GACjDC,GAAUoQ,EAAIA,IAAIrQ,OAClBgmJ,GAAQ9jJ,OAAO0U,MAAQ3W,EAAS0uC,EACzBt+B,CACT,EACAy3B,eAAgBz3B,GACP,EAAI,GAAaA,EAAIA,OAIhC21I,GAAQE,gBAAkB,EAC1BF,GAAQG,SAAW,IACnBH,GAAQI,kBAAoB,MAE5B,MAAMC,GAAS38G,GAAM,CACnB,MAAAvoC,CAAQ08E,EAAKh3E,EAAK5G,GACX4G,IAAKA,EAAM,IAAIZ,WAAWogJ,GAAOv+G,eAAe+1C,KAChD59E,IAAQA,EAAS,GACtB,MAAM0uC,EAAY1uC,EAEZg/F,EAAYphB,EAAIohB,UACtB,IAAK,GAAUA,GACb,MAAM,IAAI38F,MAAM,8BAyBlB,OAtBArC,GAAU,EACV,GAAgB4G,EAAK,GAAag3E,EAAIyoE,aAAcrmJ,GAEpD4G,EADA5G,GAAU,GACI49E,EAAIrjE,UAElB3T,EADA5G,GAAU,GACI49E,EAAI0oE,OAClBtmJ,GAAU,EACV,GAAgB4G,EAAKg3E,EAAI2oE,YAAavmJ,GACtCA,GAAU,EACV,GAAgB4G,EAAKg3E,EAAI4oE,WAAYxmJ,GACrCA,GAAU,EACV,GAAgB4G,EAAKg3E,EAAI6oE,UAAWzmJ,GACpCA,GAAU,EACV,GAAgB4G,EAAKg3E,EAAI8oE,OAAQ1mJ,GACjCA,GAAU,EACV,GAAKkB,OAAO08E,EAAI+oE,YAAa//I,EAAK5G,GAElC,GAAOg/F,EAAWp4F,EADlB5G,GAAU,GAAKkB,OAAOyV,MACS,EAAGqoF,EAAUj/F,QAC5CC,GAAUg/F,EAAUj/F,OAEpBqmJ,GAAOllJ,OAAOyV,MAAQ3W,EAAS0uC,EAC/B,GAAgB9nC,EAAKw/I,GAAOllJ,OAAOyV,MAAQ,EAAG+3B,GACvC9nC,CACT,EACA,MAAA3E,CAAQ2E,EAAK5G,GACNA,IAAQA,EAAS,GACtB,MAAM0uC,EAAY1uC,EAEZ49E,EAAM,CAAC,EACP79E,EAAS,GAAe6G,EAAK5G,GAqBnC,OApBAA,GAAU,EACV49E,EAAIyoE,YAAc,GAAe,GAAez/I,EAAK5G,IACrDA,GAAU,EACV49E,EAAIrjE,UAAY3T,EAAI5G,GACpBA,GAAU,EACV49E,EAAI0oE,OAAS1/I,EAAI5G,GACjBA,GAAU,EACV49E,EAAI2oE,YAAc,GAAe3/I,EAAK5G,GACtCA,GAAU,EACV49E,EAAI4oE,WAAa,GAAe5/I,EAAK5G,GACrCA,GAAU,EACV49E,EAAI6oE,UAAY,GAAe7/I,EAAK5G,GACpCA,GAAU,EACV49E,EAAI8oE,OAAS,GAAe9/I,EAAK5G,GACjCA,GAAU,EACV49E,EAAI+oE,YAAc,GAAK1kJ,OAAO2E,EAAK5G,GACnCA,GAAU,GAAKiC,OAAO0U,MACtBinE,EAAIohB,UAAYp4F,EAAI9E,MAAM9B,EAAQ0uC,EAAY3uC,EAAS,GACvDC,GAAU49E,EAAIohB,UAAUj/F,OACxBqmJ,GAAOnkJ,OAAO0U,MAAQ3W,EAAS0uC,EACxBkvC,CACT,EACA/1C,eAAgB+1C,GACP,GACL,GAAK/1C,eAAe+1C,EAAI+oE,aACxB,GAAa/oE,EAAIohB,aAGjB4nD,GAAMn9G,GAAM,CAChB,MAAAvoC,CAAQuhC,EAAM77B,EAAK5G,GACZ4G,IAAKA,EAAM,IAAIZ,WAAW4gJ,GAAI/+G,eAAepF,KAC7CziC,IAAQA,EAAS,GACtB,MAAM0uC,EAAY1uC,EASlB,OAPAA,GAAU,EACV,GAAKkB,OAAOuhC,EAAKokH,MAAQ,IAAKjgJ,EAAK5G,GACnCA,GAAU,GAAKkB,OAAOyV,MACtB,GAAKzV,OAAOuhC,EAAKqkH,KAAO,IAAKlgJ,EAAK5G,GAClCA,GAAU,GAAKkB,OAAOyV,MACtBiwI,GAAI1lJ,OAAOyV,MAAQ3W,EAAS0uC,EAC5B,GAAgB9nC,EAAKggJ,GAAI1lJ,OAAOyV,MAAQ,EAAG+3B,GACpC9nC,CACT,EACA,MAAA3E,CAAQ2E,EAAK5G,GACNA,IAAQA,EAAS,GACtB,MAAM0uC,EAAY1uC,EAEZyiC,EAAO,CAAC,EAOd,OANAziC,GAAU,EACVyiC,EAAKokH,KAAO,GAAK5kJ,OAAO2E,EAAK5G,IAAW,IACxCA,GAAU,GAAKiC,OAAO0U,MACtB8rB,EAAKqkH,IAAM,GAAK7kJ,OAAO2E,EAAK5G,IAAW,IACvCA,GAAU,GAAKiC,OAAO0U,MACtBiwI,GAAI3kJ,OAAO0U,MAAQ3W,EAAS0uC,EACrBjM,CACT,EACAoF,eAAgBpF,GACP,EAAI,GAAKoF,eAAepF,EAAKokH,MAAQ,KAAO,GAAKh/G,eAAepF,EAAKqkH,KAAO,OAIjFC,GAAat9G,GAAM,CACvB,MAAAvoC,CAAQ8lJ,EAAUpgJ,EAAK5G,GAChB4G,IAAKA,EAAM,IAAIZ,WAAW+gJ,GAAWl/G,eAAem/G,KACpDhnJ,IAAQA,EAAS,GACtB,MAAM0uC,EAAY1uC,EAEZinJ,EAAgB,GACtB,IAAK,IAAIhmJ,EAAI,EAAGA,EAAI+lJ,EAASjnJ,OAAQkB,IAAK,CACxC,MAAMimJ,EAAS,GAAaF,EAAS/lJ,SACFmB,IAA/B6kJ,EAAcC,GAAU,KAC1BD,EAAcC,GAAU,GAAK,IAE/BD,EAAcC,GAAU,GAAIA,GAAU,EAAK,KAAS,GAAM,GAAc,EAATA,EACjE,CAEA,IAAK,IAAIjmJ,EAAI,EAAGA,EAAIgmJ,EAAclnJ,OAAQkB,IACxC,QAAyBmB,IAArB6kJ,EAAchmJ,GAAkB,CAClC,MAAMkmJ,EAAY,GAAOF,EAAchmJ,IACvC2F,EAAI5G,GAAUiB,EAEd2F,EADA5G,GAAU,GACImnJ,EAAUpnJ,OAExB,GAAOonJ,EAAWvgJ,EADlB5G,GAAU,EACqB,EAAGmnJ,EAAUpnJ,QAC5CC,GAAUmnJ,EAAUpnJ,MACtB,CAIF,OADAgnJ,GAAW7lJ,OAAOyV,MAAQ3W,EAAS0uC,EAC5B9nC,CACT,EACA,MAAA3E,CAAQ2E,EAAK5G,EAAQD,GACdC,IAAQA,EAAS,GACtB,MAAM0uC,EAAY1uC,EAEZgnJ,EAAW,GACjB,KAAOhnJ,EAAS0uC,EAAY3uC,GAAQ,CAClC,MAAMuM,EAAS1F,EAAI5G,GAEbonJ,EAAexgJ,EADrB5G,GAAU,GAEVA,GAAU,EACV,IAAK,IAAIiB,EAAI,EAAGA,EAAImmJ,EAAcnmJ,IAAK,CACrC,MAAMS,EAAIkF,EAAI5G,EAASiB,GACvB,IAAK,IAAIQ,EAAI,EAAGA,EAAI,EAAGA,IACrB,GAAIC,EAAK,GAAM,EAAID,EAAK,CACtB,MAAMylJ,EAAS,GAAgB56I,GAAU,EAAMrL,GAAK,EAAKQ,GACzDulJ,EAASrlJ,KAAKulJ,EAChB,CAEJ,CACAlnJ,GAAUonJ,CACZ,CAGA,OADAL,GAAW9kJ,OAAO0U,MAAQ3W,EAAS0uC,EAC5Bs4G,CACT,EACA,cAAAn/G,CAAgBm/G,GACd,MAAMK,EAAU,GAChB,IAAK,IAAIpmJ,EAAI,EAAGA,EAAI+lJ,EAASjnJ,OAAQkB,IAAK,CACxC,MAAMimJ,EAAS,GAAaF,EAAS/lJ,IACrComJ,EAAQH,GAAU,GAAKrmJ,KAAKgU,IAAIwyI,EAAQH,GAAU,IAAM,EAAY,IAATA,EAC7D,CAEA,IAAIr8I,EAAM,EACV,IAAK,IAAI5J,EAAI,EAAGA,EAAIomJ,EAAQtnJ,OAAQkB,SACfmB,IAAfilJ,EAAQpmJ,KACV4J,GAAO,EAAIhK,KAAKC,MAAMumJ,EAAQpmJ,GAAK,GAAK,IAI5C,OAAO4J,CACT,IAGIy8I,GAAQ79G,GAAM,CAClB,MAAAvoC,CAAQ61G,EAAQnwG,EAAK5G,GACd4G,IAAKA,EAAM,IAAIZ,WAAWshJ,GAAMz/G,eAAekvE,KAC/C/2G,IAAQA,EAAS,GACtB,MAAM0uC,EAAY1uC,EAUlB,OARAA,GAAU,EACV,GAAKkB,OAAO61G,EAAOwwC,WAAY3gJ,EAAK5G,GACpCA,GAAU,GAAKkB,OAAOyV,MACtBowI,GAAW7lJ,OAAO61G,EAAOywC,QAAS5gJ,EAAK5G,GACvCA,GAAU+mJ,GAAW7lJ,OAAOyV,MAE5B2wI,GAAMpmJ,OAAOyV,MAAQ3W,EAAS0uC,EAC9B,GAAgB9nC,EAAK0gJ,GAAMpmJ,OAAOyV,MAAQ,EAAG+3B,GACtC9nC,CACT,EACA,MAAA3E,CAAQ2E,EAAK5G,GACNA,IAAQA,EAAS,GACtB,MAAM0uC,EAAY1uC,EAEZ+2G,EAAS,CAAC,EACVh3G,EAAS,GAAe6G,EAAK5G,GAQnC,OAPAA,GAAU,EACV+2G,EAAOwwC,WAAa,GAAKtlJ,OAAO2E,EAAK5G,GACrCA,GAAU,GAAKiC,OAAO0U,MACtBogG,EAAOywC,QAAUT,GAAW9kJ,OAAO2E,EAAK5G,EAAQD,GAAUC,EAAS0uC,IACnE1uC,GAAU+mJ,GAAW9kJ,OAAO0U,MAE5B2wI,GAAMrlJ,OAAO0U,MAAQ3W,EAAS0uC,EACvBqoE,CACT,EACAlvE,eAAgBkvE,GACP,EACL,GAAKlvE,eAAekvE,EAAOwwC,YAC3BR,GAAWl/G,eAAekvE,EAAOywC,WAIjCC,GAASh+G,GAAM,CACnB,MAAAvoC,CAAQ61G,EAAQnwG,EAAK5G,GACd4G,IAAKA,EAAM,IAAIZ,WAAWyhJ,GAAO5/G,eAAekvE,KAChD/2G,IAAQA,EAAS,GACtB,MAAM0uC,EAAY1uC,EAEZ0hF,EAAOq1B,EAAOr1B,KACpB,IAAK,GAAUA,GACb,MAAM,IAAIr/E,MAAM,yBAGlB,MAAMklJ,EAAaxwC,EAAOwwC,WAC1B,IAAK,GAAUA,GACb,MAAM,IAAIllJ,MAAM,+BAuBlB,OAnBAuE,EADA5G,GAAU,GACI+2G,EAAOx8F,UAErB3T,EADA5G,GAAU,GACI+2G,EAAOisC,MACrBhjJ,GAAU,EACV,GAAgB4G,EAAKmwG,EAAOv1B,WAAYxhF,GAExC4G,EADA5G,GAAU,GACI0hF,EAAK3hF,OAEnB,GAAO2hF,EAAM96E,EADb5G,GAAU,EACgB,EAAG0hF,EAAK3hF,QAElC6G,EADA5G,GAAU0hF,EAAK3hF,QACDwnJ,EAAWxnJ,OAEzB,GAAOwnJ,EAAY3gJ,EADnB5G,GAAU,EACsB,EAAGunJ,EAAWxnJ,QAC9CC,GAAUunJ,EAAWxnJ,OACrBgnJ,GAAW7lJ,OAAO61G,EAAOywC,QAAS5gJ,EAAK5G,GACvCA,GAAU+mJ,GAAW7lJ,OAAOyV,MAE5B8wI,GAAOvmJ,OAAOyV,MAAQ3W,EAAS0uC,EAC/B,GAAgB9nC,EAAK6gJ,GAAOvmJ,OAAOyV,MAAQ,EAAG+3B,GACvC9nC,CACT,EACA,MAAA3E,CAAQ2E,EAAK5G,GACNA,IAAQA,EAAS,GACtB,MAAM0uC,EAAY1uC,EAEZ+2G,EAAS,CAAC,EACVh3G,EAAS,GAAe6G,EAAK5G,GACnCA,GAAU,EACV+2G,EAAOx8F,UAAY3T,EAAI5G,GACvBA,GAAU,EACV+2G,EAAOisC,MAAQp8I,EAAI5G,GACnBA,GAAU,EACV+2G,EAAOv1B,WAAa,GAAe56E,EAAK5G,GAExC,MAAMsiF,EAAa17E,EADnB5G,GAAU,GAEVA,GAAU,EACV+2G,EAAOr1B,KAAO96E,EAAI9E,MAAM9B,EAAQA,EAASsiF,GAEzC,MAAMolE,EAAa9gJ,EADnB5G,GAAUsiF,GASV,OAPAtiF,GAAU,EACV+2G,EAAOwwC,WAAa3gJ,EAAI9E,MAAM9B,EAAQA,EAAS0nJ,GAC/C1nJ,GAAU0nJ,EACV3wC,EAAOywC,QAAUT,GAAW9kJ,OAAO2E,EAAK5G,EAAQD,GAAUC,EAAS0uC,IACnE1uC,GAAU+mJ,GAAW9kJ,OAAO0U,MAE5B8wI,GAAOxlJ,OAAO0U,MAAQ3W,EAAS0uC,EACxBqoE,CACT,EACAlvE,eAAgBkvE,GACP,EACLA,EAAOr1B,KAAK3hF,OACZg3G,EAAOwwC,WAAWxnJ,OAClBgnJ,GAAWl/G,eAAekvE,EAAOywC,WAIjCG,GAAMl+G,GAAM,CAChB,MAAAvoC,CAAQ6a,EAAQnV,EAAK5G,GACd4G,IAAKA,EAAM,IAAIZ,WAAW2hJ,GAAI9/G,eAAe9rB,KAC7C/b,IAAQA,EAAS,GACtB,MAAM0uC,EAAY1uC,EAEZ4nJ,EAAa7rI,EAAOA,OAC1B,IAAK,GAAU6rI,GACb,MAAM,IAAIvlJ,MAAM,2BAelB,OAZArC,GAAU,EACV,GAAgB4G,EAAKmV,EAAO2qI,OAAQ1mJ,GAEpC4G,EADA5G,GAAU,GACI+b,EAAOxB,UAErB3T,EADA5G,GAAU,GACI+b,EAAO8rI,WAErB,GAAOD,EAAYhhJ,EADnB5G,GAAU,EACsB,EAAG4nJ,EAAW7nJ,QAC9CC,GAAU4nJ,EAAW7nJ,OAErB4nJ,GAAIzmJ,OAAOyV,MAAQ3W,EAAS0uC,EAC5B,GAAgB9nC,EAAK+gJ,GAAIzmJ,OAAOyV,MAAQ,EAAG+3B,GACpC9nC,CACT,EACA,MAAA3E,CAAQ2E,EAAK5G,GACNA,IAAQA,EAAS,GACtB,MAAM0uC,EAAY1uC,EAEZ+b,EAAS,CAAC,EACVhc,EAAS,GAAe6G,EAAK5G,GAWnC,OAVAA,GAAU,EACV+b,EAAO2qI,OAAS,GAAe9/I,EAAK5G,GACpCA,GAAU,EACV+b,EAAOxB,UAAY3T,EAAI5G,GACvBA,GAAU,EACV+b,EAAO8rI,WAAajhJ,EAAI5G,GACxBA,GAAU,EACV+b,EAAOA,OAASnV,EAAI9E,MAAM9B,EAAQ0uC,EAAY3uC,EAAS,GACvDC,GAAU+b,EAAOA,OAAOhc,OACxB4nJ,GAAI1lJ,OAAO0U,MAAQ3W,EAAS0uC,EACrB3yB,CACT,EACA8rB,eAAgB9rB,GACP,EAAI,GAAaA,EAAOA,UAInC,SAAS+rI,GAAMv7I,GACb,OAAQA,EAAKiyB,eACX,IAAK,IAAK,OAAOwmH,GACjB,IAAK,MACL,IAAK,QACL,IAAK,QAAS,OAAOT,GACrB,IAAK,MAAO,OAAOL,GACnB,IAAK,OAAQ,OAAOC,GACpB,IAAK,OAAQ,OAAOc,GACpB,IAAK,MAAO,OAAOT,GACnB,IAAK,QAAS,OAAOJ,GACrB,IAAK,MAAO,OAAOM,GACnB,IAAK,KAAM,OAAOlB,GAClB,IAAK,MAAO,OAAOE,GACnB,IAAK,KAAM,OAAOmB,GAClB,IAAK,MAAO,OAAOc,GACnB,IAAK,SAAU,OAAOI,GACtB,IAAK,QAAS,OAAOK,GACrB,IAAK,KAAM,OAAOQ,GAClB,IAAK,OAAQ,OAAOU,GACpB,IAAK,QAAS,OAAOG,GACrB,IAAK,KAAM,OAAOE,GAEpB,OAAOrE,EACT,CAEO,MAAMnqB,GAAS1vF,GAAM,CAC1B,MAAAvoC,CAAQw9B,EAAG93B,EAAK5G,GACT4G,IAAKA,EAAM,IAAIZ,WAAWmzH,GAAOtxF,eAAenJ,KAChD1+B,IAAQA,EAAS,GAEtB,MAAM0uC,EAAY1uC,EAOlB,GALA,GAAKkB,OAAOw9B,EAAExuB,KAAMtJ,EAAK5G,GACzBA,GAAU,GAAKkB,OAAOyV,MAEtB,GAAgB/P,EAAK,GAAa83B,EAAEnyB,MAAOvM,GAEd,QAAzB0+B,EAAEnyB,KAAKiyB,cAAyB,CAClC,GAAe,MAAXE,EAAExuB,KACJ,MAAM,IAAI7N,MAAM,0BAElB,GAAgBuE,EAAK83B,EAAEqpH,gBAAkB,KAAM/nJ,EAAS,GACxD4G,EAAI5G,EAAS,GAAK0+B,EAAEspH,eAAiB,EACrCphJ,EAAI5G,EAAS,GAAK0+B,EAAEupH,aAAe,EACnC,GAAgBrhJ,EAAK83B,EAAEskH,OAAS,EAAGhjJ,EAAS,GAE5CA,GAAU,EACV2lJ,GAAKzkJ,OAAOw9B,EAAEt5B,SAAW,GAAIwB,EAAK5G,GAClCA,GAAU2lJ,GAAKzkJ,OAAOyV,KACxB,KAAO,CACL,IAAI4qI,EAAQ,QAA4Bn/I,IAAZs8B,EAAEwpH,MAAsB,KAAOxpH,EAAEwpH,OACzDxpH,EAAEypH,QAAO5G,GAzrCA,OA0rCb,GAAgB36I,EAAK26I,EAAOvhJ,EAAS,GACrC,GAAgB4G,EAAK83B,EAAEi3E,KAAO,EAAG31G,EAAS,GAE1CA,GAAU,EACV,MAAM2kC,EAAMmjH,GAAKppH,EAAEnyB,MACnBo4B,EAAIzjC,OAAOw9B,EAAE+D,KAAM77B,EAAK5G,GACxBA,GAAU2kC,EAAIzjC,OAAOyV,KACvB,CAGA,OADAwiH,GAAOj4H,OAAOyV,MAAQ3W,EAAS0uC,EACxB9nC,CACT,EACA,MAAA3E,CAAQ2E,EAAK5G,GACNA,IAAQA,EAAS,GAEtB,MAAM0+B,EAAI,CAAC,EACLgQ,EAAY1uC,EAKlB,GAHA0+B,EAAExuB,KAAO,GAAKjO,OAAO2E,EAAK5G,GAC1BA,GAAU,GAAKiC,OAAO0U,MACtB+nB,EAAEnyB,KAAO,GAAe,GAAe3F,EAAK5G,IAC7B,QAAX0+B,EAAEnyB,KACJmyB,EAAEqpH,eAAiB,GAAenhJ,EAAK5G,EAAS,GAChD0+B,EAAEspH,cAAgBphJ,EAAI5G,EAAS,GAC/B0+B,EAAEupH,YAAcrhJ,EAAI5G,EAAS,GAC7B0+B,EAAEskH,MAAQ,GAAep8I,EAAK5G,EAAS,GACvC0+B,EAAE0pH,QAAsC,IAA1B1pH,EAAEskH,OAAS,GAAM,GAC/BtkH,EAAEt5B,QAAUugJ,GAAK1jJ,OAAO2E,EAAK5G,EAAS,GACtCA,GAAU,EAAI2lJ,GAAK1jJ,OAAO0U,UACrB,CACL,MAAM4qI,EAAQ,GAAe36I,EAAK5G,EAAS,GAC3C0+B,EAAEi3E,IAAM,GAAe/uG,EAAK5G,EAAS,GAErC0+B,EAAEwpH,MAAQ,IA1tCO,MA0tCU3G,GAC3B7iH,EAAEypH,SA5tCW,MA4tCA5G,GAEb,MAAM58G,EAAMmjH,GAAKppH,EAAEnyB,MACnBmyB,EAAE+D,KAAOkC,EAAI1iC,OAAO2E,EAAK5G,EAAS,GAClCA,GAAU,EAAI2kC,EAAI1iC,OAAO0U,KAC3B,CAGA,OADAwiH,GAAOl3H,OAAO0U,MAAQ3W,EAAS0uC,EACxBhQ,CACT,EACA,cAAAmJ,CAAgBnJ,GACd,MAAM+D,EAAmB,OAAX/D,EAAE+D,WAA4BrgC,IAAXs8B,EAAE+D,KAAsB/D,EAAE+D,KAAO/D,EAAEt5B,QACpE,OAAO,GAAKyiC,eAAenJ,EAAExuB,MAAQ,EAAI43I,GAAKppH,EAAEnyB,MAAMs7B,eAAepF,EACvE,IAGWu2F,GAAWvvF,GAAM,CAC5B,MAAAvoC,CAAQk6B,EAAGx0B,EAAK5G,GACT4G,IAAKA,EAAM,IAAIZ,WAAWgzH,GAASnxF,eAAezM,KAClDp7B,IAAQA,EAAS,GAEtB,MAAM0uC,EAAY1uC,EAYlB,OAVA,GAAKkB,OAAOk6B,EAAElrB,KAAMtJ,EAAK5G,GACzBA,GAAU,GAAKkB,OAAOyV,MAEtB,GAAgB/P,EAAK,GAAaw0B,EAAE7uB,MAAOvM,GAC3CA,GAAU,EAEV,GAAgB4G,EAAK,QAA4BxE,IAAZg5B,EAAE8sH,MAAsB,KAAO9sH,EAAE8sH,OAAQloJ,GAC9EA,GAAU,EAEVg5H,GAAS93H,OAAOyV,MAAQ3W,EAAS0uC,EAC1BtT,CACT,EACA,MAAAn5B,CAAQ2E,EAAK5G,GACNA,IAAQA,EAAS,GAEtB,MAAM0uC,EAAY1uC,EACZo7B,EAAI,CAAC,EAeX,OAbAA,EAAElrB,KAAO,GAAKjO,OAAO2E,EAAK5G,GAC1BA,GAAU,GAAKiC,OAAO0U,MAEtBykB,EAAE7uB,KAAO,GAAe,GAAe3F,EAAK5G,IAC5CA,GAAU,EAEVo7B,EAAE8sH,MAAQ,GAAiB,GAAethJ,EAAK5G,IAC/CA,GAAU,KA1wCE,MA4wCEo7B,EAAE8sH,SACR9sH,EAAE8sH,QA5wCM,OA8wChBlvB,GAAS/2H,OAAO0U,MAAQ3W,EAAS0uC,EAC1BtT,CACT,EACAyM,eAAgBzM,GACP,GAAKyM,eAAezM,EAAElrB,MAAQ,IAgC5Bm4I,GAAoB,IAMpBC,GAAS,CACpBpnJ,OAAQ,SAAUsR,EAAQ5L,EAAK5G,GAC7B,MAAMuoJ,GAAY3hJ,EAEd2hJ,IAAU3hJ,EAAM,IAAIZ,WAAW,GAAewM,KAC7CxS,IAAQA,EAAS,GAEtB,MAAM0uC,EAAY1uC,EAkBlB,OAhBKwS,EAAOumH,YAAWvmH,EAAOumH,UAAY,IACrCvmH,EAAO0mH,UAAS1mH,EAAO0mH,QAAU,IACjC1mH,EAAOywI,cAAazwI,EAAOywI,YAAc,IACzCzwI,EAAO0wI,cAAa1wI,EAAO0wI,YAAc,IAE9CtiC,GAAO1/G,OAAOsR,EAAQ5L,EAAK5G,GAC3BA,GAAU4gH,GAAO1/G,OAAOyV,MAExB3W,EAAS8lJ,GAAWtzI,EAAOumH,UAAWC,GAAUpyH,EAAK5G,GACrDA,EAAS8lJ,GAAWtzI,EAAO0mH,QAASC,GAAQvyH,EAAK5G,GACjDA,EAAS8lJ,GAAWtzI,EAAOywI,YAAa9pB,GAAQvyH,EAAK5G,GACrDA,EAAS8lJ,GAAWtzI,EAAO0wI,YAAa/pB,GAAQvyH,EAAK5G,GAErDsoJ,GAAOpnJ,OAAOyV,MAAQ3W,EAAS0uC,EAG3B65G,GAAY,GAAO5xI,QAAU/P,EAAI7G,OAC5B6G,EAAI9E,MAAM,EAAG,GAAO6U,OAGtB/P,CACT,EACA3E,OAAQ,SAAU2E,EAAK5G,GAChBA,IAAQA,EAAS,GAEtB,MAAM0uC,EAAY1uC,EACZwS,EAASouG,GAAO3+G,OAAO2E,EAAK5G,GAUlC,OATAA,GAAU4gH,GAAO3+G,OAAO0U,MAExB3W,EAASwoJ,GAAWh2I,EAAOumH,UAAWC,GAAUpyH,EAAK5G,GACrDA,EAASwoJ,GAAWh2I,EAAO0mH,QAASC,GAAQvyH,EAAK5G,GACjDA,EAASwoJ,GAAWh2I,EAAOywI,YAAa9pB,GAAQvyH,EAAK5G,GACrDA,EAASwoJ,GAAWh2I,EAAO0wI,YAAa/pB,GAAQvyH,EAAK5G,GAErDsoJ,GAAOrmJ,OAAO0U,MAAQ3W,EAAS0uC,EAExBl8B,CACT,EACAq1B,eAAgB,SAAUr1B,GACxB,OAAOouG,GAAO/4E,eAAer1B,GAC3BqzI,GAAmBrzI,EAAOumH,WAAa,GAAIC,IAC3C6sB,GAAmBrzI,EAAO0mH,SAAW,GAAIC,IACzC0sB,GAAmBrzI,EAAOywI,aAAe,GAAI9pB,IAC7C0sB,GAAmBrzI,EAAO0wI,aAAe,GAAI/pB,GACjD,GAKF,SAASsvB,GAAgBtxI,EAAO5K,GAC9B,GAAI4K,EAAM4hH,UACR,MAAM,IAAI12H,MAAM,qEAElB,MAAMqmJ,EAAYvlJ,OAAOoN,OAAO,CAC9BhE,QACC4K,GAKH,OAJIuxI,EAAU1vB,WACZ0vB,EAAU3vB,UAAY,CAAC2vB,EAAU1vB,iBAC1B0vB,EAAU1vB,UAEZ0vB,CACT,CAfAJ,GAAOpnJ,OAAOyV,MAAQ,EACtB2xI,GAAOrmJ,OAAO0U,MAAQ,EAgBf,MAAM2gC,GAAQ,CACnBp2C,OAAQ,SAAUsR,EAAQ5L,EAAK5G,GAG7B,OAFA4G,EAAM0hJ,GAAOpnJ,OAAOunJ,GAAej2I,EAAQ,SAAU5L,EAAK5G,GAC1Ds3C,GAAMp2C,OAAOyV,MAAQ2xI,GAAOpnJ,OAAOyV,MAC5B/P,CACT,EACA3E,OAAQ,SAAU2E,EAAK5G,GACrB,MAAMojC,EAAMklH,GAAOrmJ,OAAO2E,EAAK5G,GAM/B,OALAs3C,GAAMr1C,OAAO0U,MAAQ2xI,GAAOrmJ,OAAO0U,MAC/BysB,EAAI21F,YACN31F,EAAI41F,SAAW51F,EAAI21F,UAAU,UACtB31F,EAAI21F,WAEN31F,CACT,EACAyE,eAAgB,SAAUr1B,GACxB,OAAO81I,GAAOzgH,eAAe4gH,GAAej2I,EAAQ,SACtD,GAEF8kC,GAAMp2C,OAAOyV,MAAQ,EACrB2gC,GAAMr1C,OAAO0U,MAAQ,EAEd,MAAM7Q,GAAW,CACtB5E,OAAQ,SAAUsR,EAAQ5L,EAAK5G,GAG7B,OAFA4G,EAAM0hJ,GAAOpnJ,OAAOunJ,GAAej2I,EAAQ,YAAa5L,EAAK5G,GAC7D8F,GAAS5E,OAAOyV,MAAQ2xI,GAAOpnJ,OAAOyV,MAC/B/P,CACT,EACA3E,OAAQ,SAAU2E,EAAK5G,GACrB,MAAMojC,EAAMklH,GAAOrmJ,OAAO2E,EAAK5G,GAM/B,OALA8F,GAAS7D,OAAO0U,MAAQ2xI,GAAOrmJ,OAAO0U,MAClCysB,EAAI21F,YACN31F,EAAI41F,SAAW51F,EAAI21F,UAAU,UACtB31F,EAAI21F,WAEN31F,CACT,EACAyE,eAAgB,SAAUr1B,GACxB,OAAO81I,GAAOzgH,eAAe4gH,GAAej2I,EAAQ,YACtD,GAEF1M,GAAS5E,OAAOyV,MAAQ,EACxB7Q,GAAS7D,OAAO0U,MAAQ,EAEjB,MAAM,GAAS2xI,GAAOpnJ,OAChB,GAASonJ,GAAOrmJ,OAChB,GAAiBqmJ,GAAOzgH,eAwB9B,SAASg+G,GAAoB/kG,EAAMnc,GACxC,IAAI95B,EAAM,EACV,IAAK,IAAI5J,EAAI,EAAGA,EAAI6/C,EAAK/gD,OAAQkB,IAAK4J,GAAO85B,EAAIkD,eAAeiZ,EAAK7/C,IACrE,OAAO4J,CACT,CAEO,SAASi7I,GAAYhlG,EAAMnc,EAAK/9B,EAAK5G,GAC1C,IAAK,IAAIiB,EAAI,EAAGA,EAAI6/C,EAAK/gD,OAAQkB,IAC/B0jC,EAAIzjC,OAAO4/C,EAAK7/C,GAAI2F,EAAK5G,GACzBA,GAAU2kC,EAAIzjC,OAAOyV,MAEvB,OAAO3W,CACT,CAEO,SAASwoJ,GAAY1nG,EAAMnc,EAAK/9B,EAAK5G,GAC1C,IAAK,IAAIiB,EAAI,EAAGA,EAAI6/C,EAAK/gD,OAAQkB,IAC/B6/C,EAAK7/C,GAAK0jC,EAAI1iC,OAAO2E,EAAK5G,GAC1BA,GAAU2kC,EAAI1iC,OAAO0U,MAEvB,OAAO3W,CACT,CCr+CO,SAAS2oJ,GAAMz4I,EAAM04I,EAAStvI,EAASuvI,GAC5C,GAAuB,KAAnBD,EAAQ7oJ,OACV,MAAM,IAAIsC,MAAM,4CAA4CumJ,EAAQ7oJ,WAEtE,MAAM+oJ,EAAa,IAAI9iJ,WAAW,KAC5B+iJ,EAAQ,IAAI/iJ,WAAW,IAC7B,IAAK,IAAI/E,EAAI,EAAGA,EAAI,GAAIA,GAAK,EAAG,CAC9B,MAAMyP,EAAOk4I,EAAQzmJ,WAAWlB,GAChC,GAAIyP,EAAO,IACT,MAAM,IAAIrO,MAAM,cAAcpB,sBAAsByP,WAAck4I,EAAQhoJ,OAAOK,8BAEnF,GAAyB,IAArB6nJ,EAAWp4I,GACb,MAAM,IAAIrO,MAAM,mBAAmBqO,WAAck4I,EAAQhoJ,OAAOK,yCAElE6nJ,EAAWp4I,GAAQzP,EACnB8nJ,EAAM9nJ,GAAKyP,CACb,CACA,MAAMs4I,EAAU1vI,EAAQnX,WAAW,GAC7BsnC,EAAQ,CACZv5B,OACA,cAAA23B,CAAgB9wB,GACd,MAAMq8E,EAASr8E,EAAIhX,OACb8K,EAAe,IAATuoF,EAAgB,EAC5B,OAAIr8E,EAAI5U,WAAWixF,EAAS,KAAO41D,EAC7BjyI,EAAI5U,WAAWixF,EAAS,KAAO41D,EAC1Bn+I,EAAM,EAERA,EAAM,EAERA,CACT,EACA,MAAA3J,CAAQ6V,EAAK5V,EAAQnB,GACfmB,UACFA,EAAS,IAAI6E,WAAWyjC,EAAM5B,eAAe9wB,KAE3C/W,UACFA,EAAS,GAGX,IAAIozF,EAASr8E,EAAIhX,OACbgX,EAAI5U,WAAWixF,EAAS,KAAO41D,IAC7BjyI,EAAI5U,WAAWixF,EAAS,KAAO41D,EACjC51D,GAAU,EAEVA,GAAU,GAId,MAAM95E,EAAU85E,EAAS,EACnB61D,EAAU71D,EAAS95E,EAEzB,IAAI5U,EAAM1E,EACNiB,EAAI,EACR,KAAOA,EAAIgoJ,GAAS,CAClB,MAAMv4I,EACHo4I,EAAW/xI,EAAI5U,WAAWlB,KAAO,GACjC6nJ,EAAW/xI,EAAI5U,WAAWlB,EAAI,KAAO,GACrC6nJ,EAAW/xI,EAAI5U,WAAWlB,EAAI,KAAO,EACtC6nJ,EAAW/xI,EAAI5U,WAAWlB,EAAI,IAChCE,EAAOuD,KAASgM,GAAQ,GACxBvP,EAAOuD,KAASgM,GAAQ,EACxBvP,EAAOuD,KAASgM,EAChBzP,GAAK,CACP,CAEA,GAAgB,IAAZqY,EAAe,CACjB,MAAM5I,EACHo4I,EAAW/xI,EAAI5U,WAAWlB,KAAO,GACjC6nJ,EAAW/xI,EAAI5U,WAAWlB,EAAI,KAAO,EACrC6nJ,EAAW/xI,EAAI5U,WAAWlB,EAAI,KAAO,EACxCE,EAAOuD,KAASgM,GAAQ,EACxBvP,EAAOuD,KAASgM,CAClB,MAAuB,IAAZ4I,IACTnY,EAAOuD,KAAUokJ,EAAW/xI,EAAI5U,WAAWlB,KAAO,EAC/C6nJ,EAAW/xI,EAAI5U,WAAWlB,EAAI,KAAO,GAI1C,OADAwoC,EAAMvoC,OAAOyV,MAAQjS,EAAM1E,EACpBmB,CACT,EACA,MAAAc,CAAQd,EAAQC,EAAOC,GACjBD,UACFA,EAAQ,GAENC,UACFA,EAAMF,EAAOpB,QAGf,MAAMA,EAASsB,EAAMD,EACf2qC,EAAMhsC,EAAS,EACfmpJ,EAAU9nJ,EAAQrB,EAASgsC,EAC3BE,EAAQ,GACd,IAAK,IAAIvnC,EAAMtD,EAAOsD,EAAMwkJ,EAASxkJ,GAAO,EAAG,CAC7C,MAAM+pC,EAAOttC,EAAOuD,IAAQ,GAAQvD,EAAOuD,EAAM,IAAM,EAAMvD,EAAOuD,EAAM,GAC1EunC,EAAMtqC,KACJonJ,EAAMt6G,GAAO,GAAK,IAClBs6G,EAAMt6G,GAAO,GAAK,IAClBs6G,EAAMt6G,GAAO,EAAI,IACjBs6G,EAAY,GAANt6G,GAEV,CAEA,GAAY,IAAR1C,EAAW,CACb,MAAM0C,GAAOttC,EAAOE,EAAM,IAAM,GAAKF,EAAOE,EAAM,GAClD4qC,EAAMtqC,KACJonJ,EAAMt6G,GAAO,IACbs6G,EAAOt6G,GAAO,EAAK,IACnBs6G,EAAOt6G,GAAO,EAAK,KA9GE,IAgHnBo6G,GACF58G,EAAMtqC,KAAKqnJ,EAEf,MAAO,GAAY,IAARj9G,EAAW,CACpB,MAAM0C,EAAMttC,EAAOE,EAAM,GACzB4qC,EAAMtqC,KACJonJ,EAAMt6G,GAAO,GACbs6G,EAAOt6G,GAAO,EAAK,KAvHE,IAyHnBo6G,GACF58G,EAAMtqC,KAAKqnJ,EAASA,EAExB,CAGA,OADAv/G,EAAMxnC,OAAO0U,MAAQ5W,EACd6B,OAAOC,aAAatB,MAAMqB,OAAQqqC,EAC3C,GAEF,OAAOxC,CACT,CAEsBk/G,GAAK,SAAU,mEAAoE,IArI1E,GAqIxB,MAEMQ,GAAYR,GAAK,aAAc,mEAAoE,IAtI9E,GCDlC,IAAI,GAA+B,oBAAXrzI,OAAyBA,OAAOivC,WAA+B,oBAAXj4C,OAAyBA,OAAOi4C,WAAa,KACpH,KACH,GAAa,cAAyBliD,MACpC,WAAA8O,CAAarD,EAAU,oBACrBskC,MAAMtkC,EACR,IAGJ,GAAWvJ,UAAU2L,KAAO,aAC5B,GAAW3L,UAAUmM,KAAO,YAE5B,MAAM,GAA6B,oBAAfqP,YAA8BA,WAAWqiF,KAAQgnD,QAAQ,OAAOhnD,IAI7E,MAAMinD,WAAwBhnJ,MACnC,WAAA8O,CAAao4G,EAAK74G,EAAMsJ,GACtBo4B,MAAM,UAAY1hC,EAAO,qBAAuB64G,EAAM,KAAOvvG,EAAS,KACtE3V,KAAKklH,IAAMA,EACXllH,KAAKwB,OAAS6K,EACdrM,KAAK2V,OAASA,CAChB,CAEA,MAAAqR,GACE,MAAO,CACL3a,KAAMrM,KAAKqM,KACX64G,IAAKllH,KAAKklH,IACV1jH,OAAQxB,KAAKwB,OACbmU,OAAQ3V,KAAK2V,OACbsvI,SAAUjlJ,KAAKilJ,SAEnB,EAEFD,GAAgB9kJ,UAAU2L,KAAO,kBACjCm5I,GAAgB9kJ,UAAUmM,KAAO,cAE1B,MAAM64I,WAAsBlnJ,MACjC,WAAA8O,CAAarD,EAAS07I,GACpBp3G,MAAMtkC,GACNzJ,KAAKmlJ,MAAQA,CACf,CAEA,MAAAn+H,GACE,MAAO,CACLvd,QAASzJ,KAAKyJ,QACdw7I,SAAUjlJ,KAAKilJ,SACf54I,KAAMrM,KAAKqM,KACX84I,MAAOC,GAAYplJ,KAAKmlJ,OAE5B,EAEFD,GAAchlJ,UAAU2L,KAAO,gBAC/Bq5I,GAAchlJ,UAAUmM,KAAO,eAExB,MAAM,WAAqBrO,MAChC,WAAA8O,CAAai/C,GACXhe,MAAM,cAAgBge,EAAU,MAChC/rD,KAAK+rD,QAAUA,CACjB,CAEA,MAAA/kC,GACE,MAAO,CACL3a,KAAMrM,KAAKqM,KACX44I,SAAUjlJ,KAAKilJ,SACfl5F,QAAS/rD,KAAK+rD,QAElB,EAEF,GAAa7rD,UAAU2L,KAAO,eAC9B,GAAa3L,UAAUmM,KAAO,WAE9B,MAAM,GAAU,2CACV,GAAU,wFAET,SAAS+4I,GAAanpJ,GAC3B,GAAmB,iBAARA,EACT,MAAO,CACLwN,QAASxN,GAGb,IACE,MAAM8kB,EAAOnhB,KAAKC,UAAU5D,GAC5B,GAAa,OAAT8kB,EACF,OAAOnhB,KAAKwd,MAAM2D,EAEtB,CAAE,MAAOzb,GAAI,CACb,MAAMoC,EAAQ,CACZ+B,QAASlM,OAAOtB,EAAIwN,SAAWxN,IAKjC,YAHiB8B,IAAb9B,EAAIoQ,OACN3E,EAAM2E,KAAO9O,OAAOtB,EAAIoQ,OAEnB3E,CACT,CAEA,MAAM29I,GAAY,2EACZC,GAAY,+CACZC,GAAW,+BAuCjB,SAASC,GAAY5jG,EAAM6jG,GACzBA,EAAM7sH,UAAY,EAClB,MAAMzqB,EAAS,CAAC,EAChB,OAAa,CACX,MAAM/G,EAAQq+I,EAAMvoI,KAAK0kC,GACzB,IAAKx6C,EAAO,MACRA,EAAM,GACR+G,EAAO/G,EAAM,GAAGkB,eAAiBlB,EAAM,GAEvC+G,EAAO/G,EAAM,GAAGkB,gBAAiB,CAErC,CACA,OAAO6F,CACT,CAEO,MAAMu3I,WAA6B1nJ,MACxC,WAAA8O,CAAa24C,EAAUw/F,GACrBl3G,MAAM,2CAA2C0X,oBAA2Bw/F,2BAAkCU,GAAmBjoJ,KAAK,SACtIsC,KAAKylD,SAAWA,EAChBzlD,KAAKilJ,SAAWA,CAClB,CAEA,MAAAj+H,GACE,MAAO,CACL3a,KAAMrM,KAAKqM,KACX44I,SAAUjlJ,KAAKilJ,SACfl5F,QAAS/rD,KAAK+rD,QAElB,EAEF25F,GAAqBxlJ,UAAU2L,KAAO,uBACtC65I,GAAqBxlJ,UAAUmM,KAAO,YAE/B,MAAMs5I,GAAqB,CAAC,QAAS,SAAU,QAAS,SAExD,MAAMC,GACX,WAAA94I,CAAau4B,EAAMwgH,GACjB7lJ,KAAK6L,KAAOw5B,EAAKx5B,MAAQ,KACzB7L,KAAKylD,SAAWpgB,EAAKogB,SACrB,MAAMqT,EAA4B,iBAAdzzB,EAAKyzB,KAAoBzzB,EAAKyzB,KAAOhwD,SAASu8B,EAAKyzB,KAAM,IAAMzzB,EAAKyzB,KACxF,GAAIA,QACF94D,KAAK84D,KAAO+sF,EACW,WAAlB7lJ,KAAKylD,SAAwB,IAAM,GACnCpgB,EAAKygH,GAAK,IAAM,OAChB,IAAoB,iBAAThtF,IAAsB31D,MAAM21D,GAC5C,MAAM,IAAI96D,MAAM,2BAA2BqnC,EAAKyzB,+BAA+Bl5D,KAAKC,UAAUwlC,MAE9FrlC,KAAK84D,KAAOA,CACd,CACF,CAEA,MAAA9xC,GACE,OAAOhnB,KAAKvB,UACd,EAGK,MAAMsnJ,WAAoBH,GAC/B,WAAA94I,CAAau4B,GACX0I,MAAM1I,GAAM,GACZrlC,KAAK8lJ,GAAKzgH,EAAKygH,IAAM,IACvB,CAEA,QAAArnJ,GACE,MAAMq6D,EAAO94D,KAAK84D,QAAU94D,KAAK8lJ,GAAK,IAAM,IAAM,IAAI9lJ,KAAK84D,OAAS,GAC9DgtF,EAAK9lJ,KAAK8lJ,GAAK,QAAQ9lJ,KAAK8lJ,MAAQ,GACpCj6I,EAAO7L,KAAK6L,KAAO,UAAU7L,KAAK6L,QAAU,GAClD,MAAO,SAAS7L,KAAK22D,MAAQ,IAAI32D,KAAKgmJ,UAAUltF,IAAOgtF,IAAKj6I,GAC9D,EAGK,MAAMo6I,WAAqBF,GAChC,WAAAj5I,CAAau4B,GAEX,GADA0I,MAAMjvC,OAAOoN,OAAO,CAAEu5C,SAAU,SAAWpgB,KACtCA,EAAKsxB,MAA6B,iBAAdtxB,EAAKsxB,KAC5B,MAAM,IAAI34D,MAAM,4BAA4BqnC,EAAKsxB,0BAA0B/2D,KAAKC,UAAUwlC,MAE5FrlC,KAAK22D,KAAOtxB,EAAKsxB,IACnB,EAGK,MAAMuvF,WAAqBH,GAChC,WAAAj5I,CAAau4B,GAEX,GADA0I,MAAMjvC,OAAOoN,OAAO,CAAEu5C,SAAU,SAAWpgB,KACtCA,EAAK2gH,MAA6B,iBAAd3gH,EAAK2gH,KAC5B,MAAM,IAAIhoJ,MAAM,4BAA4BqnC,EAAK2gH,0BAA0BpmJ,KAAKC,UAAUwlC,MAE5FrlC,KAAKgmJ,KAAO3gH,EAAK2gH,IACnB,EAGF,SAASG,GAAUzrF,GACjB,OAAO,GAAQz8D,KAAKy8D,KAAU,GAAQz8D,KAAKy8D,GAAQ,IAAIA,KAAUA,CACnE,CAEO,MAAM0rF,WAAqBR,GAChC,WAAA94I,CAAau4B,GAUX,GATA0I,MAAMjvC,OAAOoN,OAAO,CAAEu5C,SAAU,UAAYpgB,IAAO,GAC9CA,EAAKq1B,OACJr1B,EAAKsxB,OACPtxB,EAAKq1B,KAAOr1B,EAAKsxB,MAEftxB,EAAK2gH,OACP3gH,EAAKq1B,KAAO,IAAIr1B,EAAK2gH,WAGpB3gH,EAAKq1B,MAA6B,iBAAdr1B,EAAKq1B,KAC5B,MAAM,IAAI18D,MAAM,2BAA2BqnC,EAAK9/B,0BAA0B3F,KAAKC,UAAUwlC,MAO3F,GALArlC,KAAK06D,KAAOr1B,EAAKq1B,KACjB16D,KAAKuF,KAAO8/B,EAAK9/B,MAAQ,aACzBvF,KAAK2V,OAAS,UAAU1X,KAAKonC,EAAK1vB,QAAU,OAAS,MACrD3V,KAAK22D,KAAOtxB,EAAKsxB,KACjB32D,KAAKgmJ,KAAO3gH,EAAK2gH,MACZhmJ,KAAKgmJ,KAAM,CACd,MAAMK,EAAU,GAAQnpI,KAAKld,KAAK06D,MAC9B2rF,IACFrmJ,KAAKgmJ,KAAOK,EAAQ,GAExB,CACKrmJ,KAAK22D,MACJ,GAAQ14D,KAAK+B,KAAK06D,QACpB16D,KAAK22D,KAAO32D,KAAK06D,MAGrB,MAAMmjC,EAAM,GAAG79F,KAAKylD,aAAa0gG,GAASnmJ,KAAK06D,SAAS16D,KAAK84D,OAAO94D,KAAKuF,OACzE,IACEvF,KAAK69F,IAAM,IAAI,GAAIA,EACrB,CAAE,MAAO5hG,GACP,MAAM,IAAI+B,MAAM/B,EAAIwN,QAAU,KAAKo0F,KACrC,CACF,CAEA,QAAAp/F,GACE,MAAMgnD,EAA6B,WAAlBzlD,KAAKylD,SAAwB,GAAK,UAC7CqT,EAAO94D,KAAK84D,QAA4B,WAAlB94D,KAAKylD,SAAwB,IAAM,IAAM,IAAIzlD,KAAK84D,OAAS,GACjFnjD,EAAyB,QAAhB3V,KAAK2V,OAAmB,UAAY,GAC7CpQ,EAAqB,eAAdvF,KAAKuF,KAAwB,GAAKvF,KAAKuF,KAC9CsG,EAAO7L,KAAK6L,KAAO,UAAU7L,KAAK6L,QAAU,GAC5C8qD,EAAO32D,KAAK22D,MAAQ32D,KAAK22D,OAAS32D,KAAK06D,KAAO,UAAU16D,KAAK22D,QAAU,GACvEqvF,EAAOhmJ,KAAKgmJ,MAAQhmJ,KAAKgmJ,OAAShmJ,KAAK06D,KAAO,UAAU16D,KAAKgmJ,QAAU,GAC7E,MAAO,GAAGvgG,IAAW0gG,GAASnmJ,KAAK06D,QAAQ5B,IAAOvzD,IAAOoQ,IAASghD,IAAOqvF,IAAOn6I,GAClF,EAGK,SAASy6I,GAAYxzI,GAC1B,IAAIuyB,EACJ,GAAqB,iBAAVvyB,EACTuyB,EAxLG,SAAwB4/G,GAC7B,MAAM/nJ,EAAQmoJ,GAAUnoI,KAAK+nI,GACvBx/F,EAAWvoD,EAAM,IAAM,SACvBw9D,EAAOx9D,EAAM,GACb47D,EAAO57D,EAAM,GACbqI,EAAOrI,EAAM,GACb0kD,EAAO1kD,EAAM,GACnB,GAAiB,WAAbuoD,GAAsC,UAAbA,EAAsB,CACjD,MAAMk5F,EAAQ6G,GAAW5jG,EAAM0jG,IAC/B,MAAO,CACLz5I,KAAM8yI,EAAM9yI,KACZ45C,WACAkR,KAAMgoF,EAAMhoF,KACZqvF,KAAMrH,EAAMqH,KACZtrF,OACA5B,OACAvzD,OACAoQ,OAAQgpI,EAAM4H,KAAO,OAAS,MAElC,CACA,GAAiB,SAAb9gG,GAAoC,UAAbA,GAAqC,UAAbA,EAAsB,CACvE,MAAMk5F,EAAQ6G,GAAW5jG,EAAM2jG,IACzBc,EAAU,aAAanpI,KAAKw9C,GAClC,GAAI2rF,GAAwB,UAAb5gG,EACb,MAAM,IAAIznD,MAAM,qEAAqEinJ,MAEvF,IAAKoB,GAAwB,UAAb5gG,EACd,MAAM,IAAIznD,MAAM,0EAA0EinJ,MAE5F,OAAIoB,EACK,IAAIH,GAAa,CAAEzgG,SAAU,QAASugG,KAAMK,EAAQ,GAAIvtF,OAAMgtF,GAAInH,EAAMmH,GAAIj6I,KAAM8yI,EAAM9yI,OAE1F,IAAIo6I,GAAa,CAAExgG,SAAU,QAASkR,KAAM+D,EAAM5B,OAAMgtF,GAAInH,EAAMmH,GAAIj6I,KAAM8yI,EAAM9yI,MAC3F,CACA,MAAM,IAAI65I,GAAqBjgG,EAAUw/F,EAC3C,CAqJWuB,CAAc1zI,OAChB,CACL,GAAqB,iBAAVA,GAAgC,OAAVA,GAAkBtX,MAAM+Y,QAAQzB,GAC/D,MAAM,IAAI9U,MAAM,mBAAmB8U,oBAC9B,GAAIA,aAAiB8yI,GAC1B,OAAO9yI,EAETuyB,EAAOvyB,CACT,CACsB,OAAlBuyB,EAAKogB,eAAuC1nD,IAAlBsnC,EAAKogB,WACjCpgB,EAAKogB,SAAW,UAElB,MAAMA,EAAWpgB,EAAKogB,SACtB,GAAiB,UAAbA,EACF,OAAO,IAAIwgG,GAAa5gH,GAE1B,GAAiB,UAAbogB,EACF,OAAO,IAAIygG,GAAa7gH,GAE1B,GAAiB,WAAbogB,GAAsC,UAAbA,EAC3B,OAAO,IAAI2gG,GAAa/gH,GAE1B,MAAM,IAAIqgH,GAAqBjgG,EAAU7lD,KAAKC,UAAUwlC,GAC1D,CCzSA,MAAMohH,GAAc,0BAEpB,SAAS,KAAU,CA+BnB,SAASC,GAAY7oD,EAAKloF,EAAQyoB,EAAM2tB,EAAS46F,GAC/C,OAAO,IAAI7qJ,SAAQ,CAACC,EAASC,KAC3B,MAAMm0B,EAAS,IAAI,GAAI0tE,GACR,QAAXloF,GAAoByoB,IACtBjO,EAAO0sB,OAAS,QAAUioG,GAAUlnJ,OAAOwgC,IAE7C,MAAM8mF,EAAM/0F,EAAO1xB,WACbwC,EAAM,IAAIG,eAChBH,EAAIa,KAAK6T,EAAQuvG,GAAK,GACtBjkH,EAAI2lJ,iBAAiB,SAAUH,IAChB,SAAX9wI,GACF1U,EAAI2lJ,iBAAiB,eAAgBH,IAEvCxlJ,EAAIY,aAAe,cACnBZ,EAAI8qD,QAAUA,EACd9qD,EAAI4lJ,UAcJ,WACE7xH,EAAO,IAAI,GAAa+2B,IACxB,IACE9qD,EAAIijE,OACN,CAAE,MAAO5+D,GAAK,CAChB,EAlBArE,EAAIK,mBAsCJ,WACE,GAAIL,EAAIM,WAAa,GAAoB,MAAfN,EAAIO,QAAiC,IAAfP,EAAIO,OAAc,CAChEwzB,EAAO,IAAIgwH,GAAgB9/B,EAAKjkH,EAAIO,OAAQmU,IAC5C,IACE1U,EAAIijE,OACN,CAAE,MAAO5+D,GAAK,CAChB,CACF,EA5CArE,EAAI6lJ,QAgEJ,WACE9xH,EAAsB,MAAf/zB,EAAIO,OAAiB,IAAIxD,MAAM,0BAA4B,IAAIgnJ,GAAgB9/B,EAAKjkH,EAAIO,OAAQmU,GACzG,EAjEA1U,EAAI8lJ,OAkBJ,WACE,GAAmB,MAAf9lJ,EAAIO,OACNwzB,EAAO,IAAIgwH,GAAgB9/B,EAAKjkH,EAAIO,OAAQmU,QACvC,CACL,IAAIpT,EACJ,GAA4B,iBAAjBtB,EAAIQ,SACbc,EAAM,GAAiBtB,EAAIQ,eACtB,GAAIR,EAAIQ,oBAAoBE,WACjCY,EAAMtB,EAAIQ,aACL,MAAIjG,MAAM+Y,QAAQtT,EAAIQ,WAAaR,EAAIQ,oBAAoBuR,aAGhE,MAAM,IAAIhV,MAAM,0BAA4BiD,EAAIQ,UAFhDc,EAAM,IAAIZ,WAAWV,EAAIQ,SAG3B,CACAuzB,EAAO,KAAMzyB,EACf,CACF,EAjCe,SAAXoT,EACF1U,EAAIc,KAAKq8B,GAETn9B,EAAIc,OAGF4kJ,GACFA,EAAYxlG,iBAAiB,QAAS6lG,GAqCxC,IAAIhyH,EAAS,SAAUttB,EAAO02B,GAC5BpJ,EAAS,GACL2xH,GACFA,EAAYtlG,oBAAoB,QAAS2lG,GAGzCjrJ,EADE2L,EACM,CACNA,QACAjG,SAAUR,GAGJ,CACNm9B,OACA38B,SAAUR,GAGhB,EAMA,SAAS+lJ,IACPhyH,EAAO,IAAI,IACX,IACE/zB,EAAIijE,OACN,CAAE,MAAO5+D,GAAK,CAChB,IAEJ,CCnDA,SAAS,GAAkBy5B,GACzB,MAAM4/B,EAAqB,OAAb5/B,EAAI4/B,WAA8B5gE,IAAbghC,EAAI4/B,KAAsBz0D,KAAKoqC,MAAQvV,EAAI4/B,KACxE3C,EDuDD,SAA2BA,GAChC,OAAOA,EAAUt/C,QAAOq/C,GAAYA,EAASkrF,MAAQlrF,EAASkpF,SAASgC,MACzE,CCzDoB,CAAqBloH,EAAIX,KAAK1yB,KAAIqwD,IAClDA,EAASkpF,SAAWqB,GAAWxnJ,OAAOoN,OAAO,CAAEL,KAAMkwD,EAASlwD,MAAQkwD,EAASkpF,WACxElpF,MAEHmrF,EAAYlrF,EAAUtwD,KAAIqwD,GAAYA,EAASkpF,WACrD,MAAO,CACL7mH,KAAM,CACJ49B,YACAmrF,eAAgBnrF,EAAU5zB,QAAO,CAACg/G,EAAQrrF,KACxCqrF,EAAOrrF,EAASlwD,MAAQkwD,EACjBqrF,IACN,CAAC,GACJF,YACAG,eAAgBH,EAAU9+G,QAAO,CAACg/G,EAAQnC,KACxCmC,EAAOnC,EAASp5I,MAAQo5I,EACjBmC,IACN,CAAC,IAENzoF,OAEJ,CAnDmC3gE,MAqD5B,MAAMspJ,GAAS,GC3GG,CACvBlpH,KAAM,CACJ,CACEvyB,KAAM,2BACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,4BAER6sF,YAAa,2JACbC,QAAS,UACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,KAAM,OAERZ,QAAQ,GAEV,CACE7Q,KAAM,kBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,kBACN/D,KAAM,gBAER4wF,YAAa,+DACbC,QAAS,SACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,KAAM,QAERZ,QAAQ,GAEV,CACE7Q,KAAM,yBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,yBACN/D,KAAM,gBAER4wF,YAAa,oEACbC,QAAS,SACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,KAAM,QAERZ,QAAQ,GAEV,CACE7Q,KAAM,6BACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,6BACN/D,KAAM,iBAER4wF,YAAa,wDACbC,QAAS,SACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,KAAM,SAGV,CACEzR,KAAM,iBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,qBACNusF,MAAM,GAERM,YAAa,iTACbC,QAAS,gBACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,MAAO,SAETZ,QAAQ,EACRuqI,MAAM,GAER,CACEp7I,KAAM,gBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,oBACNusF,MAAM,GAERM,YAAa,iTACbC,QAAS,QACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,KAAM,SAERZ,QAAQ,EACRuqI,MAAM,GAER,CACEp7I,KAAM,gBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,oBACNusF,MAAM,GAERM,YAAa,oTACbC,QAAS,gBACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,MAAO,UAETZ,QAAQ,EACRuqI,MAAM,GAER,CACEp7I,KAAM,gBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,oBACNusF,MAAM,GAERM,YAAa,0TACbC,QAAS,cACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,KAAM,QAERZ,QAAQ,EACRuqI,MAAM,GAER,CACEp7I,KAAM,gBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,oBACNusF,MAAM,GAERM,YAAa,4SACbC,QAAS,gBACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,MAAO,SAETZ,QAAQ,EACRuqI,MAAM,GAER,CACEp7I,KAAM,gBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,oBACNusF,MAAM,GAERM,YAAa,0SACbC,QAAS,cACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,KAAM,QAERZ,QAAQ,EACRuqI,MAAM,GAER,CACEp7I,KAAM,aACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,iBACN/D,KAAM,YACNswF,MAAM,GAERM,YAAa,uLACbC,QAAS,QACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,KAAM,UAERZ,QAAQ,EACR9d,KAAK,EACLqoJ,MAAM,GAER,CACEp7I,KAAM,iBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,4BAER6sF,YAAa,sGACbC,QAAS,UACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,KAAM,QAERZ,QAAQ,GAEV,CACE7Q,KAAM,aACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,sBAER6sF,YAAa,2EACbC,QAAS,UACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,KAAM,SAGV,CACEzR,KAAM,MACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,oBAER6sF,YAAa,wBACb3oJ,KAAK,GAEP,CACEiN,KAAM,cACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,4BAER6sF,YAAa,gFACbC,QAAS,QACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,KAAM,QAERZ,QAAQ,GAEV,CACE7Q,KAAM,UACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,sBAER6sF,YAAa,uEACbC,QAAS,QACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,KAAM,SAGV,CACEzR,KAAM,eACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,oBAER6sF,YAAa,2LACbC,QAAS,gBACTzkC,SAAU,CACR0kC,IAAK,OACLnqI,MAAO,QAETZ,QAAQ,GAEV,CACE7Q,KAAM,YACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,kBACN/D,KAAM,gBAER4wF,YAAa,2LACbC,QAAS,gBACTzkC,SAAU,CACR0kC,IAAK,OACLnqI,MAAO,QAETZ,QAAQ,EACR9d,KAAK,GAEP,CACEiN,KAAM,aACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,qBACN/D,KAAM,UACNswF,MAAM,GAERM,YAAa,mDACbC,QAAS,YACTzkC,SAAU,CACR0kC,KAAM,OACNnqI,KAAM,UAER2pI,MAAM,GAER,CACEp7I,KAAM,oBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,4BACN/D,KAAM,UACNswF,MAAM,GAERM,YAAa,gGACbC,QAAS,YACTzkC,SAAU,CACR0kC,KAAM,OACNnqI,KAAM,UAERZ,QAAQ,EACRuqI,MAAM,GAER,CACEp7I,KAAM,kBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,mCACNusF,MAAM,GAERM,YAAa,qCACbC,QAAS,gBACTzkC,SAAU,CACR0kC,IAAK,OACLnqI,MAAO,QAET2pI,MAAM,GAER,CACEp7I,KAAM,sBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,8BACN/D,KAAM,UACNswF,MAAM,GAERM,YAAa,yEACbC,QAAS,YACTzkC,SAAU,CACR0kC,KAAM,OACNnqI,KAAM,UAERZ,QAAQ,EACRuqI,MAAM,GAER,CACEp7I,KAAM,yBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,uBACNn1D,KAAM,OAERgiJ,YAAa,2NACbC,QAAS,SACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,MAAO,SAETZ,QAAQ,GAEV,CACE7Q,KAAM,4BACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,uBACNn1D,KAAM,OAERgiJ,YAAa,2OACbC,QAAS,SACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,MAAO,SAETZ,QAAQ,GAEV,CACE7Q,KAAM,mCACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,uBACNn1D,KAAM,OAERgiJ,YAAa,+PACbC,QAAS,SACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,MAAO,SAETZ,QAAQ,GAEV,CACE7Q,KAAM,2BACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,uBACNn1D,KAAM,WAERgiJ,YAAa,oQACbC,QAAS,SACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,MAAO,SAETZ,QAAQ,GAEV,CACE7Q,KAAM,sBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,uBACNn1D,KAAM,eAERgiJ,YAAa,qPACbC,QAAS,SACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,MAAO,UAGX,CACEzR,KAAM,sBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,uBACNn1D,KAAM,OAERgiJ,YAAa,6WACbC,QAAS,SACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,MAAO,UAGX,CACEzR,KAAM,+BACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,gCAER6sF,YAAa,4KACbC,QAAS,cACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,KAAM,SAGV,CACEzR,KAAM,kBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,wBAER6sF,YAAa,mEACbC,QAAS,iBACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,MAAO,OAGX,CACEzR,KAAM,SACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,SACN/D,KAAM,kBACNswF,MAAM,GAERM,YAAa,sEACbC,QAAS,UACTzkC,SAAU,CACR0kC,IAAK,GACLnqI,KAAM,GAER2pI,MAAM,GAER,CACEp7I,KAAM,uBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,wBAER6sF,YAAa,oUACbC,QAAS,gBACTzkC,SAAU,CACR0kC,IAAK,OACLnqI,MAAO,QAETZ,QAAQ,GAEV,CACE7Q,KAAM,mBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,4BAER6sF,YAAa,+eACbC,QAAS,UACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,KAAM,SAERZ,QAAQ,GAEV,CACE7Q,KAAM,kCACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,2CAER6sF,YAAa,uoBACbC,QAAS,UACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,KAAM,SAERZ,QAAQ,GAEV,CACE7Q,KAAM,cACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,cACNusF,MAAM,GAERM,YAAa,gJACbC,QAAS,UACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,KAAM,OAERZ,QAAQ,EACRuqI,MAAM,GAER,CACEp7I,KAAM,cACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,kBAER6sF,YAAa,sDAEf,CACE17I,KAAM,aACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,UACNusF,MAAM,GAERM,YAAa,iIACb7qI,QAAQ,EACR9d,KAAK,EACLqoJ,MAAM,GAER,CACEp7I,KAAM,+BACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,yBACNn1D,KAAM,YAERgiJ,YAAa,sIACbC,QAAS,YACTzkC,SAAU,CACR0kC,IAAK,OACLnqI,KAAM,UAERZ,QAAQ,GAEV,CACE7Q,KAAM,mCACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,yBACNn1D,KAAM,gBAERgiJ,YAAa,sIACbC,QAAS,YACTzkC,SAAU,CACR0kC,IAAK,OACLnqI,KAAM,UAERZ,QAAQ,GAEV,CACE7Q,KAAM,gCACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,yBACNn1D,KAAM,eAERgiJ,YAAa,sIACbC,QAAS,YACTzkC,SAAU,CACR0kC,IAAK,OACLnqI,KAAM,WAGV,CACEzR,KAAM,6BACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,wBAER6sF,YAAa,oIACbC,QAAS,UACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,KAAM,QAERZ,QAAQ,GAEV,CACE7Q,KAAM,6BACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,wBAER6sF,YAAa,0IACbC,QAAS,gBACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,MAAO,SAETZ,QAAQ,GAEV,CACE7Q,KAAM,iBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,qBACNusF,MAAM,GAERM,YAAa,6FACbC,QAAS,cACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,KAAM,QAERZ,QAAQ,EACRuqI,MAAM,GAER,CACEp7I,KAAM,0BACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,wBACNn1D,KAAM,qBACN0hJ,MAAM,GAERM,YAAa,mOACb7qI,QAAQ,EACRuqI,MAAM,GAER,CACEp7I,KAAM,2BACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,wBACNn1D,KAAM,sBACN0hJ,MAAM,GAERM,YAAa,kRACb7qI,QAAQ,EACRuqI,MAAM,GAER,CACEp7I,KAAM,6BACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,wBACNn1D,KAAM,wBACN0hJ,MAAM,GAERM,YAAa,2HACb7qI,QAAQ,EACRuqI,MAAM,GAER,CACEp7I,KAAM,gBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,gBACNusF,MAAM,GAERM,YAAa,2JACbC,QAAS,gBACTzkC,SAAU,CACR0kC,IAAK,OACLnqI,MAAO,QAET2pI,MAAM,GAER,CACEp7I,KAAM,qBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,qBACNusF,MAAM,GAERM,YAAa,gLACbC,QAAS,gBACTzkC,SAAU,CACR0kC,IAAK,OACLnqI,MAAO,QAET2pI,MAAM,GAER,CACEp7I,KAAM,iBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,qBACNusF,MAAM,GAERM,YAAa,yFACbC,QAAS,UACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,KAAM,OAERZ,QAAQ,EACRuqI,MAAM,GAER,CACEp7I,KAAM,iBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,qBACNusF,MAAM,GAERM,YAAa,yFACbC,QAAS,UACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,KAAM,SAERZ,QAAQ,EACRuqI,MAAM,GAER,CACEp7I,KAAM,eACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,wBAER6sF,YAAa,2GAEf,CACE17I,KAAM,iBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,qBACNusF,MAAM,GAERM,YAAa,uFACbC,QAAS,QACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,KAAM,UAERZ,QAAQ,EACRuqI,MAAM,GAER,CACEp7I,KAAM,gBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,iBAER6sF,YAAa,qIACbC,QAAS,UACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,KAAM,QAGV,CACEzR,KAAM,iBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,kBAER6sF,YAAa,6HACbC,QAAS,gBACTzkC,SAAU,CACR0kC,IAAK,OACLnqI,MAAO,QAETZ,QAAQ,GAEV,CACE7Q,KAAM,SACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,aACN/D,KAAM,UACNswF,MAAM,GAERM,YAAa,uBACbC,QAAS,gBACTzkC,SAAU,CACR0kC,IAAK,OACLnqI,MAAO,QAET1e,KAAK,EACLqoJ,MAAM,GAER,CACEp7I,KAAM,OACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,gBACNusF,MAAM,GAERM,YAAa,sFACbC,QAAS,gBACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,MAAO,SAET2pI,MAAM,GAER,CACEp7I,KAAM,KACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,gBAER6sF,YAAa,mEACbC,QAAS,gBACTzkC,SAAU,CACR0kC,IAAK,OACLnqI,MAAO,QAET1e,KAAK,GAEP,CACEiN,KAAM,eACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,gBAER6sF,YAAa,yIACbC,QAAS,YACTzkC,SAAU,CACR0kC,IAAK,OACLnqI,KAAM,UAERZ,QAAQ,GAEV,CACE7Q,KAAM,MACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,qBAER6sF,YAAa,qFACbC,QAAS,QACTzkC,SAAU,CACR0kC,IAAK,MACLnqI,KAAM,QAER1e,KAAK,GAEP,CACEiN,KAAM,YACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,mBAER6sF,YAAa,oMACb7qI,QAAQ,GAEV,CACE7Q,KAAM,kBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,eAER6sF,YAAa,qFACbC,QAAS,QACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,KAAM,WAGV,CACEzR,KAAM,gBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,iBAER6sF,YAAa,sGAEf,CACE17I,KAAM,WACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,mBAER6sF,YAAa,qGACbC,QAAS,UACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,KAAM,QAGV,CACEzR,KAAM,UACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,2BAER6sF,YAAa,wMACbC,QAAS,cACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,KAAM,SAGV,CACEzR,KAAM,mBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,iBACNn1D,KAAM,mBAERgiJ,YAAa,yQAEf,CACE17I,KAAM,aACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,cACNusF,MAAM,GAERM,YAAa,6EACbC,QAAS,SACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,KAAM,QAER2pI,MAAM,GAER,CACEp7I,KAAM,kBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,0BACNusF,MAAM,GAERM,YAAa,kDACbN,MAAM,GAER,CACEp7I,KAAM,iBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,iBACNusF,MAAM,GAERM,YAAa,gGACbN,MAAM,GAER,CACEp7I,KAAM,gBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,eACNn1D,KAAM,SAERgiJ,YAAa,sFACb7qI,QAAQ,GAEV,CACE7Q,KAAM,mBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,cACNn1D,KAAM,SAERgiJ,YAAa,gCAEf,CACE17I,KAAM,qBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,gBACNn1D,KAAM,SAERgiJ,YAAa,+CAEf,CACE17I,KAAM,qCACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,iCAER6sF,YAAa,+RAEf,CACE17I,KAAM,kBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,iBACNn1D,KAAM,SAERgiJ,YAAa,iFACb7qI,QAAQ,GAEV,CACE7Q,KAAM,sBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,gBACNusF,MAAM,GAERM,YAAa,sHACbC,QAAS,YACTzkC,SAAU,CACR0kC,KAAM,QACNnqI,KAAM,UAER2pI,MAAM,GAER,CACEp7I,KAAM,cACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,cACN/D,KAAM,eACNswF,MAAM,GAERM,YAAa,qHACbC,QAAS,gBACTzkC,SAAU,CACR0kC,IAAK,OACLnqI,MAAO,QAET2pI,MAAM,GAER,CACEp7I,KAAM,UACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,eACNusF,MAAM,GAERM,YAAa,uHACbN,MAAM,GAER,CACEp7I,KAAM,uCACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,kBACN/D,KAAM,kBAER4wF,YAAa,qEACbC,QAAS,gBACTzkC,SAAU,CACR0kC,IAAK,OACLnqI,MAAO,QAETZ,QAAQ,GAEV,CACE7Q,KAAM,mCACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,gBACN/D,KAAM,mBAER4wF,YAAa,iFACbC,QAAS,gBACTzkC,SAAU,CACR0kC,IAAK,OACLnqI,MAAO,QAETZ,QAAQ,GAEV,CACE7Q,KAAM,yCACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,kBACN/D,KAAM,YAER4wF,YAAa,2EACbC,QAAS,gBACTzkC,SAAU,CACR0kC,IAAK,OACLnqI,MAAO,SAGX,CACEzR,KAAM,qCACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,kBACN/D,KAAM,kBAER4wF,YAAa,uEACbC,QAAS,gBACTzkC,SAAU,CACR0kC,IAAK,OACLnqI,MAAO,SAGX,CACEzR,KAAM,oCACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,kBAER6sF,YAAa,gFACbC,QAAS,gBACTzkC,SAAU,CACR0kC,IAAK,OACLnqI,MAAO,QAETZ,QAAQ,GAEV,CACE7Q,KAAM,iBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,qBAER6sF,YAAa,gSACb7qI,QAAQ,EACR9d,KAAK,GAEP,CACEiN,KAAM,iBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,4BAER6sF,YAAa,0FACbC,QAAS,WACTzkC,SAAU,CACR0kC,IAAK,OACLnqI,KAAM,QAERZ,QAAQ,GAEV,CACE7Q,KAAM,aACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,sBAER6sF,YAAa,iFACbC,QAAS,WACTzkC,SAAU,CACR0kC,IAAK,OACLnqI,KAAM,SAGV,CACEzR,KAAM,SACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,iBAER6sF,YAAa,4IACb7qI,QAAQ,GAEV,CACE7Q,KAAM,wBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,6BAER6sF,YAAa,2HACbC,QAAS,UACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,KAAM,UAGV,CACEzR,KAAM,qBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,6BAER6sF,YAAa,yGACbC,QAAS,UACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,KAAM,UAGV,CACEzR,KAAM,yBACNo5I,SAAU,CACRx/F,SAAU,SACViV,KAAM,iBAER6sF,YAAa,kGACbC,QAAS,iBACTzkC,SAAU,CACR0kC,IAAK,QACLnqI,MAAO,SAIbqhD,KAAM,gBDzgCR,MAAM+oF,GAAa,IAAI,GAAI,8DAkB3B,SAASC,GAAcrsG,GACrB,MAAO,KAAKr9C,KAAKq9C,EACnB,CAyFO,MAAMssG,GAAY,IAvFlB,MACL,WAAA96I,CAAau4B,GACXrlC,KAAKqlC,KAAOvmC,OAAOoN,OAAO,CACxB6/C,QAAS,IACTp7C,QAAQ,EACRk3I,UAAWH,GACXI,SAAS,EACTC,mBAAoB,YACpBC,OAAQ,KACP3iH,GACHrlC,KAAKioJ,OAAS,IAChB,CAEA,KAAAC,CAAOxsB,EAAOysB,GACZ,OAAKzsB,GAAyB,OAAhB17H,KAAKioJ,QAQnBjoJ,KAAKioJ,OAAWjoJ,KAAKqlC,KAAK10B,OD9LvBo6B,eAAyB8yD,EAAKptF,EAAOs7C,EAAS46F,GACnD,MAAMyB,EAAW33I,EAAQA,EAAMs3I,mBAAqBt3I,EAAM5E,KAAO,KACjE,GAAIu8I,EACF,IACE,MAAMn7B,EAASrtH,KAAKwd,MAAMpU,aAAanB,QAAQugJ,IAC/C,GAAIn7B,GAAUA,EAAOtuD,KAAOluD,EAAM43I,QAChC,OAAOp7B,CAEX,CAAE,MAAOhxH,GAAM,CAEjB,MAAM,KAAEmiC,SAAesoH,GAAW7oD,EAAK,MAAO,KAAM9xC,OCsL9C,GDrLA59C,EAAS,CACbwwD,KAAMz0D,KAAKoqC,MACXlW,KAAMx+B,KAAKwd,MAAM,GAAiBghB,KAEpC,GAAIgqH,EACF,IACEp/I,aAAaxB,QAAQ4gJ,EAAUxoJ,KAAKC,UAAUsO,GAChD,CAAE,MAAOlS,GACPkS,EAAOwwD,KAAO,IAChB,CAEF,OAAOxwD,CACT,CCyKQ,CACAnO,KAAKqlC,KAAKwiH,UACV7nJ,KAAKqlC,KAAKyiH,QACN,CACEj8I,KAAM,iBACNk8I,mBAAoB/nJ,KAAKqlC,KAAK0iH,mBAC9BM,QAASn+I,KAAKoqC,MAAQt0C,KAAKqlC,KAAK2iH,QAElC,KACJhoJ,KAAKqlC,KAAK0mB,SAETj+C,MAAKixB,GAAO,GAAiB,CAC5BX,KAAMW,EAAIX,KAAK49B,UACf2C,KAAM5/B,EAAI4/B,SAEX9wD,OAAM,IAAMs6I,GAAYb,KAhBzBxrJ,QAAQC,QAAQurJ,IAkBbtnJ,KAAKioJ,QA1BHjoJ,KAAKioJ,OAAOn6I,MAAKixB,GAClBA,EAAI4/B,KAAOz0D,KAAKoqC,MAAQt0C,KAAKqlC,KAAK2iH,OAC7BhoJ,KAAKkoJ,OAAM,EAAMnpH,GAEnBA,GAuBb,CAEA,IAAAX,GACE,OAAOp+B,KAAKkoJ,OAAM,GAAOp6I,MAAKswB,GAAQA,EAAKA,MAC7C,CAEA,SAAA8oH,CAAWp0I,GACT,GAAIA,QACF,OAAO9S,KAAKo+B,OAAOtwB,MAAKswB,GAAQA,EAAK8oH,YAQvC,GANc,QAAVp0I,IACFA,EAAQw1I,IAEI,QAAVx1I,IACFA,EAAQy1I,IAEW,mBAAVz1I,EACT,OAAO9S,KAAKo+B,OAAOtwB,MAAKswB,GAAQA,EAAK8oH,UAAUxqI,OAAO5J,KAExD,GAAqB,iBAAVA,GAAwD,mBAA3BA,EAAM9E,OAAO8tC,UACnD,OAAOhgD,QAAQE,OAAO,IAAIgC,MAAM,cAAc8U,qCAGhD,IAAuC,KADvCA,EAAQtX,MAAMq/B,KAAK/nB,GAAO4J,OAAOyK,UACvBs7G,UAAUklB,IAClB,IACE,OAAO7rJ,QAAQC,QAAQ+W,EAAMpH,IAAI46I,IACnC,CAAE,MAAOrqJ,GACP,OAAOH,QAAQE,OAAOC,EACxB,CAEF,OAAO+D,KAAKo+B,OAAOtwB,MAAKswB,GACtBtrB,EAAMpH,KAAI4vC,IACR,GAAIqsG,GAAarsG,GAAQ,CACvB,MAAM1uB,EAAQwR,EAAKipH,eAAe/rG,EAAMjwC,UAAU,IAClD,IAAKuhB,EACH,MAAM,IAAI5uB,MAAM,YAAYs9C,mBAE9B,OAAO1uB,CACT,CACA,OAAO05H,GAAWhrG,EAAK,KAG7B,GAmBK,SAAS,GAAOvkB,EAAGsO,GAKxB,OAJAA,EAAOvmC,OAAOoN,OAAO,CACnBg3C,QAAS,EACT6I,QAAS,KACR1mB,GACEtO,EAAE49F,UATW7hH,EAUDuyB,EAAK6hH,UApBxB,SAAoBp0I,GAClB,OAAc,OAAVA,GAGiB,iBAAVA,GAGkB,mBAAfA,EAAMhF,IACtB,CAGS,CAAUgF,GAASA,EAAQhX,QAAQC,QAAQ+W,IAU/ChF,MAAKo5I,IACJ,IAAK1rJ,MAAM+Y,QAAQ2yI,IAAmC,IAArBA,EAAUxrJ,OACzC,MAAM,IAAIsC,MAAM,+CAElB,OAAOwqJ,GAAOtB,EAAUx7I,IAAI46I,IA9LlC,SAAuBmC,GACrB,MAAMx1G,EAAQn0C,OAAOoN,OAAO,CAC1BhE,KAAM,SACLugJ,GAMH,cALOx1G,EAAM0hF,SACb1hF,EAAMyhF,UAAY,GACd+zB,EAAY9zB,UACd1hF,EAAMyhF,UAAUp3H,KAAKmrJ,EAAY9zB,UAE5B1hF,CACT,CAoL+Cy1G,CAAa3xH,GAAIsO,EAAI,IAE/Dv3B,MAAKswB,IACJA,EAAKu2F,SAAWv2F,EAAKs2F,UAAU,UACxBt2F,EAAKs2F,UACLt2F,KAXatiC,QAAQE,OAAO,IAAIgC,MAAM,qDATnD,IAAoB8U,CAsBpB,CA+BA,SAAS01I,GAAQtB,EAAWnwH,EAAGsO,GAC7B,MAAM4/G,EAAgC,IAArBiC,EAAUxrJ,OACvBwrJ,EAAU,GACVA,EAAU1qJ,KAAKmD,MAAMnD,KAAK4oD,SAAW8hG,EAAUxrJ,QAAUwrJ,EAAUxrJ,QACvE,OA5NF,SAAmBupJ,EAAUhyG,EAAO8Y,EAAS46F,GAC3C,OAAIA,GAAeA,EAAY77F,QACtBhvD,QAAQE,OAAO,IAAI,IAEF,UAAtBipJ,EAASx/F,UAA8C,UAAtBw/F,EAASx/F,SDhHzC,WACL,MAAM,IAAIznD,MAAM,oDAClB,CC+GW,GAKX,SAAmBinJ,EAAUhyG,EAAO8Y,EAAS46F,GAC3C,ODIK,SAAkB9oD,EAAKloF,EAAQsuI,EAAQl4F,EAAS46F,GACrD,OAAOD,GAAW7oD,EAAKloF,EAAQsuI,EAAQl4F,EAAS46F,EAClD,CCNS,CACL1B,EAASpnD,IACTonD,EAAStvI,OACT,GAAc7W,OAAOoN,OAAO,CAC1ByyI,MAAO,IACN1rG,IACH8Y,EACA46F,GACA74I,MACA,SAAUixB,GACR,MAAMX,EAAOW,EAAIX,KACX38B,EAAWs9B,EAAIt9B,SACrB,IAAIiG,EAAQq3B,EAAIr3B,MAChB,QAAc3J,IAAV2J,EACF,GAAoB,IAAhB02B,EAAK1iC,OACPgM,EAAQ,IAAIw9I,GAAc,eAE1B,IACE,MAAM7jF,EAAU,GAAcjjC,GAE9B,OADAijC,EAAQ5/D,SAAWA,EACZ4/D,CACT,CAAE,MAAOplE,GACPyL,EAAQ,IAAIw9I,GAAc,yBAA2BjpJ,EAAIwN,QAAU,IAAKxN,EAC1E,CAGJ,MAAM6C,OAAOoN,OAAOxE,EAAO,CAAEjG,YAC/B,GAEJ,CAjCSknJ,CAAS1D,EAAUhyG,EAAO8Y,EAAS46F,EAC5C,CAoNSiC,CAAS3D,EAAUluH,EAAGsO,EAAK0mB,QAAS1mB,EAAK2b,QAC7ClzC,MACCswB,IAEEA,EAAK6mH,SAAWA,EAASxmJ,WAClB2/B,KAETniC,IACE,GAAiB,eAAbA,EAAI4P,MAA0C,IAAjBw5B,EAAK6d,QAEpC,MADAjnD,EAAIgpJ,SAAWA,EAASxmJ,WAClBxC,EAKR,OAHIopC,EAAK6d,QAAU,IACjB7d,EAAK6d,SAAW,GAEXslG,GAAOtB,EAAWnwH,EAAGsO,EAAI,GAGxC,CAEA,SAASijH,GAAWrD,GAClB,MAA6B,WAAtBA,EAASx/F,UAA+C,UAAtBw/F,EAASx/F,QACpD,CAEA,SAAS8iG,GAAWtD,GAClB,MAA6B,UAAtBA,EAASx/F,UAA8C,UAAtBw/F,EAASx/F,QACnD,CE5WA,MAAM,GAAM,IAAItL,GAAO,kBAChB,MAAM0uG,GACT3B,UACAhkG,QAUA,mBAAaz2C,CAAOy6I,EAAWhkG,GAC3B,MAAM4lG,EAAa5B,SAAoBU,GAAUV,UAAU,OAC3D,OAAO,IAAI2B,GAAaC,EAAY5lG,EACxC,CACA,WAAAp2C,CAAYo6I,EAAWhkG,EAAU,GAC7BljD,KAAKknJ,UAAYA,EACjBlnJ,KAAKkjD,QAAUA,CACnB,CAQA,gBAAM6lG,CAAWv0E,GACb,IAAIqgD,EACJ,IAOIA,SANkB,GAAM,CACpBF,SAAU,CAAEzsH,KAAM,MAAO2D,KAAM2oE,IAChC,CACC0yE,UAAWlnJ,KAAKknJ,UAChBhkG,QAASljD,KAAKkjD,WAEJ2xE,OAClB,CACA,MAAOntH,GAEH,MADA,GAAIA,MAAM,iBAAkBA,GACtB,IAAI1J,MAAM,mBACpB,CACA,IAAK62H,EACD,MAAM,IAAI72H,MAAM,qBAAqBw2E,KACzC,MAAMp2C,EAAOy2F,EAAQnpH,KAAK2uB,GAAMA,EAAE+D,OAC5BjwB,EAAS,GAmBf,OAlBAiwB,EAAKtyB,SAASgR,IACO,iBAANA,EACP3O,EAAO7Q,KAAKwf,GAEPthB,MAAM+Y,QAAQuI,GACnBA,EAAEhR,SAASk9I,IACW,iBAAPA,EACP76I,EAAO7Q,KAAK0rJ,GAGZ76I,EAAO7Q,KAAKy6C,GAAYixG,GAC5B,IAIJ76I,EAAO7Q,KAAKy6C,GAAYj7B,GAC5B,IAEG3O,CACX,mCChEG,MAAM86I,GACTl6F,qBAAuB,GAAI+sF,cAC3B/sF,mBAAqB,WACrBA,qBAAuB,kBACvBA,mBAAqB,gBAKrB,yBAAOm6F,CAAmBr4I,EAAM2oE,GAC5B,IAAK3oE,EAAKohB,WAAWjyB,KAAKmpJ,aACtB,MAAM,IAAInrJ,MAAM,uCAAuCgC,KAAKmpJ,gBAChE,MAAMC,EAAaH,GAAQI,gBAAgBx4I,GACrCy4I,EAAmB,UAAcl2I,QAAQomE,GAIzC+vE,EAAkB14I,EAAKnL,MAAM,QAAQ,GACrC8jJ,EAAwB,GAAYD,GAG1C,IADmB3U,GADK,GAAWwU,EAAWzuD,UAAW,aAAal9F,MAAM,EAAG,IAC3Bi3I,GAAU8U,GAAwB,IAAI7nJ,WAAW2nJ,IAEjG,MAAM,IAAItrJ,MAAM,2CACpB,OAAOorJ,EAAWK,KACtB,CACA,sBAAOJ,CAAgB5G,GACnB,MAAM5xC,EAAU4xC,EAAIr7I,MAAM,+DAC1B,IAAK5L,MAAM+Y,QAAQs8F,GACf,MAAM,IAAI7yG,MAAM,sCACpB6yG,EAAQhrG,QACR,MAAO4jJ,EAAOC,EAAO93C,EAAKjX,GAAakW,EACvC,IAAK44C,EACD,MAAM,IAAIzrJ,MAAM,qDACpB,IAAK0rJ,EACD,MAAM,IAAI1rJ,MAAM,qDACpB,IAAK4zG,EACD,MAAM,IAAI5zG,MAAM,uDACpB,IAAK28F,EACD,MAAM,IAAI38F,MAAM,uDACpB,MAAO,CAAEyrJ,QAAOC,QAAO93C,IAAKlyG,OAAOkyG,GAAMjX,YAC7C,CAMA,gBAAOgvD,CAAUC,GACb,IAAKA,EAAK33H,WAAWjyB,KAAK6pJ,aACtB,MAAM,IAAI7rJ,MAAM,uCAAuCgC,KAAK6pJ,gBAChE,MAAMh5C,EAAU+4C,EAAKxiJ,MAAM,8BAC3B,IAAK5L,MAAM+Y,QAAQs8F,GACf,MAAM,IAAI7yG,MAAM,sCACpB6yG,EAAQhrG,QACR,MAAO2zE,EAAWhF,GAAUq8B,EAC5B,IAAKr3B,EACD,MAAM,IAAIx7E,MAAM,sDACpB,IAAKw2E,EACD,MAAM,IAAIx2E,MAAM,kDACpB,MAAO,CAAEw7E,YAAWhF,SACxB,CAKA,kBAAOs1E,CAAYC,GACf,IAAKA,EAAO93H,WAAWjyB,KAAKgqJ,eACxB,MAAM,IAAIhsJ,MAAM,yCAAyCgC,KAAKgqJ,kBAClE,OAAOD,EAAOrkJ,MAAM1F,KAAKgqJ,eAAe,GAAGtkJ,MAAM,IACrD,ECxEJ,MAAM,GAAM,IAAIy0C,GAAO,yBA6EvB,SAAS8vG,GAAYC,EAAQjxH,GACzB,OAAQA,EAAOmzB,OAAS89F,EAAO99F,OAC3BnzB,EAAOszB,OAAS29F,EAAO39F,OACvBtzB,EAAOvc,QAAUwtI,EAAOxtI,QACxBuc,EAAOwzB,WAAay9F,EAAOz9F,SACnC,CACA,SAASkyE,GAAU/7E,EAAM4B,GACrB,IAAK5B,EAAKs0F,OACN,OAAO,EACX,IAAK,MAAMt/B,KAAgBpzD,EACvB,GAAI5B,EAAKs0F,SAAWt/B,EAAas/B,OAC7B,OAAO,EAGf,OAAO,CACX,CACA,SAASiT,GAAgBn5I,EAAMo5I,GACvBp5I,EAAKo7C,QACLg+F,EAAMh+F,OAAS,GACfp7C,EAAKu7C,QACL69F,EAAM79F,OAAS,GACfv7C,EAAK0L,SACL0tI,EAAM1tI,QAAU,GAChB1L,EAAKy7C,YACL29F,EAAM39F,WAAa,EAC3B,CAOA,SAAS49F,GAAyBr5I,EAAMk5I,EAAQjxH,GAC5C,GAAIgxH,GAAYC,EAAQjxH,GACpB,KAAM,kEAEV,MAAM/S,EAUV,SAA6BgkI,EAAQjxH,GACjC,MAAO,CACHmzB,MAAOnzB,EAAOmzB,MAAQ89F,EAAO99F,MAC7BG,MAAOtzB,EAAOszB,MAAQ29F,EAAO39F,MAC7B7vC,OAAQuc,EAAOvc,OAASwtI,EAAOxtI,OAC/B+vC,UAAWxzB,EAAOwzB,UAAYy9F,EAAOz9F,UAE7C,CAjBoB69F,CAAoBJ,EAAQjxH,GAC5C,OAAS/S,EAAQkmC,OAASp7C,EAAKo7C,OAC1BlmC,EAAQqmC,OAASv7C,EAAKu7C,OACtBrmC,EAAQxJ,QAAU1L,EAAK0L,QACvBwJ,EAAQumC,WAAaz7C,EAAKy7C,SACnC,CClHA,MAAM,GAAM,IAAItS,GAAO,iBAChB,MAAMowG,GACT5oC,IACA6oC,cACAC,gBAAkB,GAClB,wBAAaC,CAAYC,GAIrB,OAHKA,IACDA,QAAkB9B,GAAap8I,UAE5B,IAAI89I,GAAiBI,EAChC,CAQA,cAAMhmG,CAASimG,EAAaC,GACxB,MAAMC,EAAetuJ,KAAKmD,MAAMnD,KAAK4oD,SAAWwlG,EAAYlvJ,SACtD,UAAE89E,EAAS,OAAEhF,GAAWy0E,GAAQU,UAAUiB,EAAYE,IACtD/7I,EAAU,CACZylE,SACAgF,YACAuxE,OAAQ,CAAC,GAEPvmG,QDxBPzZ,eAAoD8/G,EAA2BG,EAAgBC,GAClG,MAAMf,EAAS,CACX99F,MAAOy+F,EAA0Bz+F,OAAS,EAC1CG,MAAOs+F,EAA0Bt+F,OAAS,EAC1C7vC,OAAQmuI,EAA0BnuI,QAAU,EAC5C+vC,UAAWo+F,EAA0Bp+F,WAAa,GAEhDy+F,EAAchB,EAAO99F,MAAQ89F,EAAO39F,MAAQ29F,EAAOxtI,OAASwtI,EAAOz9F,UACnExzB,EAAS,CACXmzB,MAAO,EACPG,MAAO,EACP7vC,OAAQ,EACR+vC,UAAW,GAEf,IAAI0+F,EAAgB,EACpB,MAAM3mG,EAAQ,GACd,MAAQylG,GAAYC,EAAQjxH,IACxBkyH,EAAgBD,EAAcF,GAAgB,CAC9C,MAAMpoG,QAAaqoG,IACfroG,GAAQ+7E,GAAU/7E,EAAM4B,KAEpB5B,EAAK4zF,OACD6T,GAAyBznG,EAAK4zF,MAAO0T,EAAQjxH,KAC7CkxH,GAAgBvnG,EAAK4zF,MAAOv9G,GAC5BurB,EAAMlnD,KAAKslD,IAGnB,GAAI5Q,KAAK,2CAA2C4Q,EAAKs0F,UAAUt0F,EAAKhjC,OAE5EurI,GACJ,CACA,OAAO3mG,CACX,CCR4B4mG,CAAqCP,EAA2B7qJ,KAAKyqJ,iBAAiB,IAAMzqJ,KAAKqrJ,QAAQ72E,EAAQzlE,KAOrI,OANA,GAAIijC,KAAK,oBAAqBwS,EAAM94C,KAAKk3C,IAC9B,CACHthC,GAAIshC,EAAKkB,QAAQrlD,WACjB0yG,WAAYvuD,EAAKuuD,YAAYzlG,KAAKklG,GAAOA,EAAGnyG,kBAG7C+lD,CACX,CACA,WAAA13C,CAAY60G,GACR3hH,KAAKwqJ,cAAgB,CAAC,EACtBxqJ,KAAK2hH,IAAMA,CACf,CAIA,iBAAO2pC,CAAYV,EAAaC,GAC5B,MAAMC,EAAetuJ,KAAKmD,MAAMnD,KAAK4oD,SAAWwlG,EAAYlvJ,SACtD,UAAE89E,EAAS,OAAEhF,GAAWy0E,GAAQU,UAAUiB,EAAYE,IACtD/7I,EAAU,CACZylE,SACAgF,YACAuxE,OAAQ,CAAC,GAEb,UAAW,MAAMnoG,KDVlB7X,gBAAqD8/G,EAA2BG,EAAgBC,GACnG,MAAMf,EAAS,CACX99F,MAAOy+F,EAA0Bz+F,OAAS,EAC1CG,MAAOs+F,EAA0Bt+F,OAAS,EAC1C7vC,OAAQmuI,EAA0BnuI,QAAU,EAC5C+vC,UAAWo+F,EAA0Bp+F,WAAa,GAEhDy+F,EAAchB,EAAO99F,MAAQ89F,EAAO39F,MAAQ29F,EAAOxtI,OAASwtI,EAAOz9F,UACnExzB,EAAS,CACXmzB,MAAO,EACPG,MAAO,EACP7vC,OAAQ,EACR+vC,UAAW,GAEf,IAAI0+F,EAAgB,EACpB,MAAMI,EAAc,IAAIhzG,IACxB,MAAQ0xG,GAAYC,EAAQjxH,IACxBkyH,EAAgBD,EAAcF,GAAgB,CAC9C,MAAMpoG,QAAaqoG,IACfroG,GAAQA,EAAKs0F,SAAWqU,EAAY58I,IAAIi0C,EAAKs0F,UAC7CqU,EAAYnkI,IAAIw7B,EAAKs0F,QAEjBt0F,EAAK4zF,OACD6T,GAAyBznG,EAAK4zF,MAAO0T,EAAQjxH,KAC7CkxH,GAAgBvnG,EAAK4zF,MAAOv9G,SACtB2pB,GAGd,GAAI5Q,KAAK,2CAA2C4Q,EAAKs0F,UAAUt0F,EAAKhjC,OAE5EurI,GACJ,CACJ,CCtBiCK,CAAqCX,EAA2B7qJ,KAAKyqJ,iBAAiB,IAAMzqJ,KAAKqrJ,QAAQ72E,EAAQzlE,WAChI6zC,CAEd,CAKA,aAAMyoG,CAAQI,EAAW18I,GACrB,IACI,MAAMusC,QAAct7C,KAAK0rJ,cAAcD,EAAW18I,GAElD,IAAIb,EACAy9I,EAFJ58I,EAAQg8I,OAAOU,IAAa,EAG5B,MAAMG,EAoDlB,SAAsBtwG,GAClB,OAAIA,EAAMrpB,WAAWg3H,GAAQE,aAClBF,GAAQE,YACf7tG,EAAMrpB,WAAWg3H,GAAQe,eAClBf,GAAQe,cACf1uG,EAAMrpB,WAAWg3H,GAAQnN,eAClBmN,GAAQnN,cACZ,EACX,CA5D8B+P,CAAavwG,GAC/B,IACI,OAAQswG,GACJ,KAAK3C,GAAQE,YAET,OADAj7I,EAAO+6I,GAAQC,mBAAmB5tG,EAAOvsC,EAAQyqE,iBACpCx5E,KAAKqrJ,QAAQn9I,EAAMa,GACpC,KAAKk6I,GAAQe,cAGT,OAFA2B,EAAW1C,GAAQa,YAAYxuG,GAC/BptC,EA8DxB,SAA0By9I,EAAU58I,GAGhC,MAAM+8I,EAAe,CAAC,EACtB,IAAK,MAAO32H,EAAKs2H,KAAcE,EAAS9sF,UAChC9vD,EAAQg8I,OAAOU,KACfK,EAAa32H,IAAO,GAI5B,GAAIr2B,OAAOC,KAAK+sJ,GAAcpwJ,SAAWiwJ,EAASjwJ,OAC9C,MAAM,IAAIsC,MAAM,uCAGpB,IAAIpC,EACJ,GACIA,EAAQY,KAAKmD,MAAMnD,KAAK4oD,SAAWumG,EAASjwJ,cACvCowJ,EAAalwJ,IACtB,OAAO+vJ,EAAS/vJ,EACpB,CAjF+BmwJ,CAAiBJ,EAAU58I,SACrB/O,KAAKqrJ,QAAQn9I,EAAMa,GACpC,KAAKk6I,GAAQnN,cACT,OAAOF,GAAW9gH,WAAWwgB,GACjC,QACI,OAAO,KAEnB,CACA,MAAO5zC,GAEH,OADA,GAAIA,MAAM,6BAA6BkkJ,kBAA0BH,MAAc/jJ,KACxE,IACX,CACJ,CACA,MAAOA,GAEH,OADA,GAAIA,MAAM,8CAA8C+jJ,MAAc/jJ,KAC/D,IACX,CACJ,CAOA,mBAAMgkJ,CAAcD,EAAW18I,GAC3B,GAAI/O,KAAKwqJ,cAAciB,GACnB,OAAOzrJ,KAAKwqJ,cAAciB,GAG9B,MAAM1oC,EAAW0oC,IAAc18I,EAAQylE,OACjC,GAAGi3E,KAAa18I,EAAQylE,SACxBzlE,EAAQylE,OACR/yE,QAAiBzB,KAAK2hH,IAAIonC,WAAWhmC,GAC3C,IAAKthH,EAAS/F,OACV,MAAM,IAAIsC,MAAM,yDACpB,IAAKyD,EAAS,GAAG/F,OACb,MAAM,IAAIsC,MAAM,6BAGpB,MAAMmQ,EAAS1M,EAAS/D,KAAK,IAE7B,OADAsC,KAAKwqJ,cAAciB,GAAat9I,EACzBA,CACX,ECjHJ,MAAM,GAAM,IAAIgsC,GAAO,sBAIhB,MAAM6xG,WAAyBt+F,GAClCu+F,SACAt7B,SACAu7B,YACA3oF,SACA,WAAAz2D,CAAYm3C,EAAYljD,GACpBgtC,QACA/tC,KAAK2wH,UAAW,EAChB3wH,KAAKksJ,YAAcjoG,EACnBjkD,KAAKujE,SAAWxiE,EAChB,MAAM,QAAEorJ,GAAYprJ,EACpB,GAAIixC,KAAK,yCAA0Cm6G,EACvD,CAIA,WAAMpvJ,GACF,GAAIi1C,KAAK,mCACThyC,KAAK2wH,UAAW,QACV3wH,KAAKiyD,WACf,CACA,eAAMA,GACF,IAAKjyD,KAAKisJ,SAAU,CAChB,IAAI,QAAEE,GAAYnsJ,KAAKujE,SAClB/nE,MAAM+Y,QAAQ43I,KACfA,EAAU,CAACA,IACf,MAAM,0BAAEtB,GAA8B7qJ,KAAKujE,SACrCo+C,QAAY4oC,GAAiBG,cACnC1qJ,KAAKisJ,SAAWtqC,EAAI2pC,YAAYxnJ,KAAK69G,EAAKwqC,EAAStB,EACvD,CACA,UAAW,MAAMuB,KAAWpsJ,KAAKisJ,WAAY,CACzC,IAAKjsJ,KAAK2wH,SACN,OAEJ,MAAM,SAAEx/D,EAAQ,UAAE/Y,GAAcg0G,EAChC,IAAKj7F,EACD,SAEJ,MAAMk7F,EAAe,CACjB,CAAC,IAA6B,CAC1B5sJ,MAAOO,KAAKujE,SAAS8tC,UrCzCE,GqC0CvBC,IAAKtxG,KAAKujE,SAASguC,QrCzCE,MqC4C7B,IAAI+6C,GAAgB,QACOtsJ,KAAKksJ,YAAY5nG,UAAU31C,IAAIwiD,EAAS7vC,WAE5CthB,KAAKksJ,YAAY5nG,UAAUx5C,IAAIqmD,EAAS7vC,KAC9ByjC,KAAKp2C,IAAI,MAElC29I,GAAgB,QACVtsJ,KAAKksJ,YAAY5nG,UAAUhoC,MAAM60C,EAAS7vC,GAAI,CAChDyjC,KAAMsnG,MAKdC,GAAgB,QACVtsJ,KAAKksJ,YAAY5nG,UAAUj9C,KAAK8pD,EAAS7vC,GAAI,CAC/CyjC,KAAMsnG,KACFj0G,GAAa,CACbuN,SAAU,CACNvN,UAAW2B,GAAiB3B,QAKxCk0G,GACAtsJ,KAAK4tD,cAAc,IAAI,GAAY,OAAQ,CAAEjK,OAAQwN,IAE7D,CACJ,CAIA,IAAA1jD,GACIzN,KAAK2wH,UAAW,CACpB,CACA,IAAK,MACD,OAAO,CACX,CACA,IAAK3iH,OAAO80B,eACR,OAAO6U,EACX,EAEG,SAAS40G,GAAiBJ,EAAStB,EAA4B3b,IAClE,OAAQjrF,GAAe,IAAI+nG,GAAiB/nG,EAAY,CAAEkoG,UAAStB,6BACvE,CC7FO,MAAM73G,GACT4H,MACA,WAAA9tC,CAAY8tC,GACR56C,KAAK46C,MAAQA,CACjB,CACA,oBAAOsN,CAAc3sD,GACjB,MAAM,SAAEs3C,GAAat3C,EACrB,OAAO,IAAIy3C,GAAgB,CACvBC,MAAO,CACHJ,SAAUA,GAEdpxC,cAAU1D,GAElB,CAKA,MAAAlB,GACI,OAAO,GAAsBA,OAAOmD,KAAK46C,MAC7C,CAKA,aAAOh9C,CAAO0U,GACV,MAAMysB,EAAM,GAAsBnhC,OAAO0U,GACzC,OAAO,IAAI0gC,GAAgBjU,EAC/B,CACA,SAAIkU,GACA,OAAOjzC,KAAK46C,MAAM3H,KACtB,CACA,YAAIxxC,GACA,OAAOzB,KAAK46C,MAAMn5C,QACtB,EC5BG,MAAM+qJ,GAAoB,uCAC3B,GAAM,IAAIryG,GAAO,iBAIhB,MAAMsyG,WAAyBzoG,GAIlC,WAAAl3C,CAAYm3C,EAAYtL,GACpB5K,MAAMy+G,GAAmBvoG,EAAY,GAAKtL,EAC9C,CAIA,WAAM1F,CAAM13C,GACR,MAAM,SAAEs3C,EAAQ,OAAEiR,GAAWvoD,EACvBmxJ,EAAW15G,GAAgBkV,cAAc,CAC3CrV,SAAU7O,OAAO6O,KAEf+P,QAAa5iD,KAAKskD,UAAUx5C,IAAIg5C,GACtC,IAAKlB,EACD,MAAO,CACH9P,UAAW,KACXprC,MAAO60B,GAAcg4B,mBAG7B,IAAInS,EACJ,IACIA,QAAepiD,KAAK2iD,UAAUC,EAClC,CACA,MAAO3mD,GAEH,OADA,GAAIyL,MAAM,uBAAwBzL,GAC3B,CACH62C,UAAW,KACXprC,MAAO60B,GAAcsrB,oBAE7B,CACA,MAAM9oB,QAAY4iB,GAAK,CAAC+qG,EAAS7vJ,UAAW,GAAWulD,EAAQ,IAAWrX,MAAOvsC,SAAiB,GAAIA,KACtG,IACI,MAAM8T,EAAQ,IAAIspC,GAClB7c,EAAIjzB,SAAS3O,IACTmV,EAAMypC,OAAO5+C,EAAM,IAEvB,MAAM,SAAEsE,GAAauxC,GAAgBp1C,OAAO0U,GAC5C,OAAK7Q,EAaE,CACHqxC,gBAPoBh3C,QAAQ2lD,IAAIhgD,EAASqxC,UACxCpnC,KAAKylD,GAAaA,EAASve,MAC3Bl2B,OAAO8yB,IACP9jC,KAAIq/B,MAAO6H,IACL,CAAE+5G,UAAW/Q,GAAWG,QAAQnpG,QAIvClrC,MAAO,OAdP,GAAIA,MAAM,+DACH,CACHorC,UAAW,KACXprC,MAAO60B,GAAc8rB,eAajC,CACA,MAAOpsD,GAEH,OADA,GAAIyL,MAAM,8BAA+BzL,GAClC,CACH62C,UAAW,KACXprC,MAAO60B,GAAcosB,cAE7B,CACJ,EC3EJ,MAAM,GAAM,IAAIxO,GAAO,2BAEjByyG,GAA0C,IAC1CC,GAAsB,EACfC,GAAiCt1G,GAAKiZ,cAG5C,MAAMs8F,WAA8Br/F,GACvCzJ,WACA+oG,aACAjsJ,QACA6rD,UACAqgG,cAAgB,IAAI10G,IACpB20G,cAAgB,IAAIzhH,IACpB0hH,qBAAwB1+I,IACpB,MAAM,UAAEm1C,EAAS,OAAEE,GAAWr1C,EAAMk1C,OAC/BC,EAAUjnC,SAAS6vI,MACpBxsJ,KAAKitJ,cAAct+I,IAAIm1C,EAAOrlD,cAElCuB,KAAKitJ,cAAc7lI,IAAI08B,EAAOrlD,YAC9BuB,KAAKotJ,sBAAsBtpG,GAAQj2C,OAAOnG,GAAU,GAAIA,MAAM,uBAAuBA,OAAS,EAElG,WAAAoF,CAAYm3C,EAAYtL,EAAc53C,EAAU,CAAC,GAC7CgtC,QACA/tC,KAAKikD,WAAaA,EAClBjkD,KAAKgtJ,aAAe,IAAIP,GAAiBxoG,EAAYtL,GACrD34C,KAAKe,QAAUA,EACff,KAAK4sD,WAAY,CACrB,CAIA,KAAA7vD,GACQiD,KAAK4sD,YAGT5sD,KAAK4tD,cAAc,IAAI,GAAY,6BAA8B,CAAEjK,QAAQ,KAC3E,GAAI3R,KAAK,4DAEThyC,KAAKikD,WAAWx0C,OAAO0xC,iBAAiB,gBAAiBnhD,KAAKmtJ,sBAClE,CAIA,IAAA1/I,GACSzN,KAAK4sD,YAEV,GAAI5a,KAAK,yCACThyC,KAAK4sD,WAAY,EACjB5sD,KAAKitJ,cAAcr8I,QACnB5Q,KAAKikD,WAAWx0C,OAAO4xC,oBAAoB,gBAAiBrhD,KAAKmtJ,sBACrE,CACA,IAAK,MACD,OAAO,CACX,CACA,IAAKn/I,OAAO80B,eACR,MAAO,qBACX,CACAsqH,sBAAwBriH,MAAO+Y,IAC3B,MAAMjB,EAAYiB,EAAOrlD,YACnB,cAAE4uJ,EAAgBT,GAAuC,WAAEU,EAAaT,IAAwB7sJ,KAAKe,QAC3G,GAAIixC,KAAK,kBAAkB6Q,cAAsB7iD,KAAKktJ,cAAcpiJ,IAAI+3C,IAAc,YAChF7iD,KAAKizC,MAAM6Q,GACjB,MAAMypG,EAAiBvtJ,KAAKktJ,cAAcpiJ,IAAI+3C,IAAc,EACxD0qG,EAAiBD,EACjBttJ,KAAKwtJ,oBAAoB3qG,GAG7BptB,YAAW,KACPz1B,KAAKktJ,cAAcniJ,IAAI83C,EAAW0qG,EAAiB,GACnDvtJ,KAAKotJ,sBAAsBtpG,GAAQj2C,OAAOnG,IACtC,GAAIA,MAAM,mCAAmCA,IAAQ,GACvD,GACH2lJ,EAAgBE,EAAe,EAEtC,WAAMt6G,CAAM6Q,GACR,MAAM,MAAEp8C,EAAK,UAAEorC,SAAoB9yC,KAAKgtJ,aAAa/5G,MAAM,CACvDJ,SA5EgC,GA6EhCiR,WAEJ,GAAIp8C,EAEA,OADA,GAAIA,MAAM,6BAA8BA,GACjC,CAAEA,QAAOorC,UAAW,MAE/B,IAAK,MAAM26G,KAAa36G,EAAW,CAC/B,MAAM,IAAE65G,GAAQc,EAChB,IAAKd,EAAK,CACN,GAAIvjJ,KAAK,uCACT,QACJ,CACA,MAAM,OAAE06C,EAAM,SAAEqN,EAAQ,UAAE/Y,GAAcu0G,EACxC,GAAK7oG,GAAWqN,EAAhB,CAIA,SADsBnxD,KAAKikD,WAAWK,UAAU31C,IAAIm1C,GACvC,CACT,MAAM,iBAAE4pG,EAAgB,aAAEC,SAAuB3tJ,KAAK4tJ,kBAAkBz8F,EAAU/Y,GAClF,GAAIs1G,GAAoBC,EAAc,CAClC,GAAI37G,KAAK,QAAQ8R,EAAOrlD,4DACpBivJ,IACA,GAAI17G,KAAK,QAAQ8R,EAAOrlD,qDAClBuB,KAAKikD,WAAWK,UAAUyzD,MAAMj0D,EAAQ,CAC1CqtD,WAAYhgD,EAASggD,cAGzBw8C,GAAgBv1G,IAChB,GAAIpG,KAAK,QAAQ8R,EAAOrlD,oDAClBuB,KAAKikD,WAAWK,UAAUhoC,MAAMwnC,EAAQ,CAC1C6B,SAAU,CACNvN,UAAW2B,GAAiB3B,MAGpCp4C,KAAK4tD,cAAc,IAAI,GAAY,OAAQ,CACvCjK,OAAQ,CACJriC,GAAIwiC,EACJqtD,WAAYhgD,EAASggD,gBAIjC,QACJ,CACJ,OAEMnxG,KAAKikD,WAAWK,UAAUj9C,KAAKy8C,EAAQ,CACzCiB,KAAM,CACF,CAAC+nG,IAAiC,CAC9BrtJ,MAAOO,KAAKe,QAAQswG,UAzHJ,GA0HhBC,IAAKtxG,KAAKe,QAAQwwG,QAzHJ,SA4HlBn5D,GAAa,CACbuN,SAAU,CACNvN,UAAW2B,GAAiB3B,QAGhC+Y,EAASggD,YAAc,CACvBA,WAAYhgD,EAASggD,cAG7B,GAAIn/D,KAAK,oBAAoB8R,EAAOrlD,cACpCuB,KAAK4tD,cAAc,IAAI,GAAY,OAAQ,CACvCjK,OAAQ,CACJriC,GAAIwiC,EACJqtD,WAAYhgD,EAASggD,cAlD7B,CAqDJ,CACA,MAAO,CAAEzpG,MAAO,KAAMorC,YAC1B,CACA,mBAAA06G,CAAoB3qG,GAChB,GAAI7Q,KAAK,8BAA8B6Q,KACvC7iD,KAAKitJ,cAAcjqG,OAAOH,GAC1B7iD,KAAKktJ,cAAclqG,OAAOH,EAC9B,CACA,uBAAM+qG,CAAkBz8F,EAAU/Y,GAC9B,MAAQ92B,GAAIwiC,GAAWqN,EACjBvO,QAAa5iD,KAAKikD,WAAWK,UAAUx5C,IAAIg5C,GAC3C+pG,EAAqBjrG,EAAKivD,UAAUnmG,KAAK2uB,GAAMA,EAAEs3E,UAAUlzG,aAC3DqvJ,EAAgB38F,EAASggD,WAAWzlG,KAAKklG,GAAOA,EAAGnyG,aACnDivJ,EAAmBG,EAAmB9pG,MAAM6sD,IAAQk9C,EAAcnxI,SAASi0F,KACjF,IAAI+8C,GAAe,EACnB,MAAMI,EAAyBnrG,EAAK+C,SAAS76C,IAAI,aACjD,GAAIijJ,EAAwB,CACxB,MAAMC,EAAoBt0G,GAAiBq0G,IACvCC,GAAqB51G,KACrBu1G,EACIK,EAAkB96G,YAAckF,GAAWlF,WACvC86G,EAAkB76G,OAAO4Q,MAAM1L,IAAWD,GAAWjF,OAAOx2B,SAAS07B,KAErF,CACA,MAAO,CAAEq1G,mBAAkBC,eAC/B,EAEG,SAASM,GAA0Bt1G,GACtC,OAAQsL,GAAe,IAAI8oG,GAAsB9oG,EAAYtL,EACjE,CC9KA,MAAM,GAAM,IAAIwB,GAAO,2BACV+zG,GAAyB12G,GAAKkZ,MAGpC,MAAMy9F,WAAgCzgG,GACzCzJ,WACAljD,QACA6rD,UACApI,MAAQ,GACR,WAAA13C,CAAYm3C,EAAYljD,GACpBgtC,QACA/tC,KAAKikD,WAAaA,EAClBjkD,KAAKe,QAAUA,EACff,KAAK4sD,WAAY,EACjB5sD,KAAKwkD,MAAQxkD,KAAKouJ,0BACtB,CACA,IAAKpgJ,OAAO80B,eACR,MAAO,kCACX,CACA,WAAM/lC,GACF,IAAIiD,KAAK4sD,UAAT,CAEA,GAAI5a,KAAK,oCACThyC,KAAKikD,WAAWx0C,OAAO0xC,iBAAiB,gBAAiBnhD,KAAKquJ,gBAC9D,IAAK,MAAQ/sI,GAAI4qH,EAAK,QAAEj0E,KAAaj4D,KAAKwkD,MAAO,CAC7C,MAAMV,QAAe2iE,GAAe,CAAEnlG,GAAI4qH,UAChClsI,KAAKikD,WAAWK,UAAU31C,IAAIm1C,WAElC9jD,KAAKikD,WAAWK,UAAUj9C,KAAKy8C,EAAQ,CACzCqtD,WAAY,CAAC,GAAUl5C,IACvBlT,KAAM,CACF,CAAC/kD,KAAKe,SAAS6xD,SAAWs7F,IAAyB,CAC/CzuJ,MAAOO,KAAKe,SAASswG,UA9Bb,GA+BRC,IAAKtxG,KAAKe,SAASwwG,QA9Bb,QAkClBvxG,KAAK4tD,cAAc,IAAI,GAAY,OAAQ,CACvCjK,OAAQ,CACJriC,GAAIwiC,EACJqtD,WAAY,CAAC,GAAUl5C,QAGnC,CACA,GAAIjmB,KAAK,cAAchyC,KAAKwkD,MAAM9oD,gBAClCsE,KAAK4sD,WAAY,CAxBP,CAyBd,CACA,IAAAn/C,GACSzN,KAAK4sD,YAEV,GAAI5a,KAAK,oCACThyC,KAAKikD,WAAWx0C,OAAO4xC,oBAAoB,gBAAiBrhD,KAAKquJ,gBACjEruJ,KAAK4sD,WAAY,EACjB5sD,KAAKsuJ,0BACT,CACAD,eAAkB5/I,IACd,MAAM,OAAEq1C,EAAM,YAAEqxD,GAAgB1mG,EAAMk1C,OAChC4qG,EC/CP,SAAsC18C,GACzC,MAAM28C,EAAc38C,EAAUtkF,MAAMsrC,GAASA,EAAKp6D,WAAWke,SAAS,OAASk8C,EAAKp6D,WAAWke,SAAS,SACxG,IAAK6xI,EACD,MAAM,IAAIxwJ,MAAM,gDAEpB,OAAOwwJ,CACX,CDyCmCC,CAA6Bt5C,GAClDu5C,EAAoB1uJ,KAAKouJ,2BACzBO,EAAoBD,EAAkBjsB,WAAWmsB,GAAUA,EAAMttI,KAAOwiC,EAAOrlD,aACjFkwJ,GAAqB,EACrBD,EAAkBC,GAAmB12F,QACjCs2F,EAAmB9vJ,WAGvBiwJ,EAAkBpxJ,KAAK,CACnBgkB,GAAIwiC,EAAOrlD,WACXw5D,QAASs2F,EAAmB9vJ,aAGpCuB,KAAKwkD,MAAQkqG,EACb1uJ,KAAKsuJ,yBAAyB,EAElC,wBAAAF,GACI,IACI,MAAMS,EAAkB7lJ,aAAanB,QAAQ,cAC7C,OAAKgnJ,EAESjvJ,KAAKwd,MAAMyxI,GACZnyI,OAAOoyI,IAFT,EAGf,CACA,MAAOpnJ,GAEH,OADA,GAAIA,MAAM,0CAA2CA,GAC9C,EACX,CACJ,CACA,uBAAA4mJ,GACI,IACItlJ,aAAaxB,QAAQ,aAAc5H,KAAKC,UAAUG,KAAKwkD,OAC3D,CACA,MAAO98C,GACH,GAAIA,MAAM,uCAAwCA,EACtD,CACJ,EAEJ,SAASonJ,GAAkBlsG,GACvB,OAAQA,GACY,iBAATA,GACY,iBAAZA,EAAKthC,IACY,iBAAjBshC,EAAKqV,OACpB,CE7FA,MAAM,GAAM,IAAI9d,GAAO,cAChBpP,eAAegkH,GAAcp2G,EAAc53C,EAASsH,GAClDtH,GAASiuJ,oBAEVrwJ,QAAQqzC,KAAK,yCAA0C,sDACvDrzC,QAAQqzC,KAAK,uEAAwE,uDAGzF,MAAMsb,EAAkB3U,EAClB,CAAEgN,SAAUiP,GAAajc,IACzB,CAAC,EAIP,OCeG5N,eAA4BhqC,EAAU,CAAC,GAC1C,MAAMiQ,Q9C+RH+5B,eAAgChqC,EAAU,CAAC,GAC9C,MAAM+iD,EAAS/iD,EAAQ+iD,eAAiBwiE,KACxC,GAAyB,MAArBxiE,EAAOm4B,WACP,MAAM,IAAI,GAAU,kCAAmC,2BAG3D,OADAl7E,EAAQk7E,mBAAqB,GAAoBn4B,EAAOm4B,YACjD,IAAI0xD,S1CzTR5iG,eAA8B1F,GACjC,MAAM4pH,EAAmB,GAAaz4B,GAAenxF,GACrD,GAA6C,OAAzC4pH,EAAiBnjB,qBAA8E,MAA9CpwH,WAAW5T,SAASC,KAAKmnJ,kBAC1E,MAAM,IAAI,GAAUh+G,GAASi+G,uBAAwB,GAAMA,wBAE/D,GAAmC,MAA/BF,EAAiBhzE,oBAA8BgiB,GAAegxD,EAAiBhzE,WAAW+C,OAAO1sE,MAAO28I,EAAiBhzE,WAAW3pE,QAAQ45B,OAAO+iH,EAAiBnrG,QACpK,MAAM,IAAI,GAAU,oCAAsC,GAAM8jF,iBAEpE,OAAOqnB,CACX,C0CgTgCG,CAAeruJ,GAC/C,C8CtSuBsuJ,CAAiBtuJ,GAIpC,OAHsB,IAAlBA,EAAQhE,aACFiU,EAAKjU,QAERiU,CACX,CDrBWs+I,CAAa,CAChBjrG,kBAAmB,CACfu0E,eAAgB,GAEpB8O,WAAY,CAACniB,GAAW,CAAE7oG,QAPe,IAA9B3b,GAASwuJ,iBAClB,GACAntC,MAMF8rB,aAAc,CAAC7tB,MACfuqB,qBAAsB,CAACj8B,SACpB5tG,EACHmsD,SAAU,CACN+pD,SAAUA,GAAS,CACf/B,aAAc7sG,GAAaq8D,KAE/B1e,KAAMA,GAAK,CACPuB,kBAAmBxmD,GAASyuJ,uBAAyB7qF,QAEtDrX,KACAvsD,GAASmsD,WAGxB,CEvCOniB,eAAe0kH,GAAgB1uJ,EAAU,CAAC,GAC7C,MAAM,OAAEqmD,EAAM,aAAEzO,SFuCb5N,eAA4ChqC,GAC/C,MAAM,cAAE2uJ,GAAkB3uJ,EACpB43C,EzT5CH,SAA6C+2G,GAChD,G4TLQ,cADqBrzI,E5TMRqzI,I4TLY,WAAYrzI,KAAY,kBAAmBA,G5TKvC,CACjC,GAAoC,IAAhCqzI,EAAcv8G,OAAOz3C,OACrB,MAAM,IAAIsC,MAAM,mEAEpB,OAAOs6C,GAAwBo3G,EACnC,CACK,G4TTF,SAAwBrzI,GAC3B,MAAO,kBAAmBA,CAC9B,C5TOaszI,CAAeD,GAAgB,CACpC,GAA2C,IAAvCA,EAAcj+G,cAAc/1C,OAC5B,MAAM,IAAIsC,MAAM,mFAEpB,OAAO0xJ,EAAcj+G,cAAc/lC,KAAKkkC,GAAiB4I,GAA0B5I,EAAc8/G,EAAcx8G,YACnH,CAEI,MAAM,IAAIl1C,MAAM,kE4TnBjB,IAA0Bqe,C5TqBjC,CyT4ByBuzI,CAAoCF,GAAiB73G,IAC1E,GAAI7F,KAAK,wCAAyC2G,GAClD,MAAMk3G,EAAgB9uJ,GAASqmD,QAAU,CAAC,EACpCknF,EAAgBuhB,EAAcvhB,eAAiB,G5LoFlD,IAAmBtjI,E4L3EtB,OARIjK,GAAS+uJ,kBACTxhB,EAAchxI,QIrDf,SAAgCq7C,GAOnC,MALoB,CAChB4zG,GAFgB,CAACxd,GAAiB,QAAGA,GAAc,ON0GhD,CAAC9qF,EAAYljD,IAAY,IAAIotJ,GAAwBlqG,EAAYljD,GMtGpEktJ,GAA0Bt1G,GAGlC,CJ6C8Bo3G,CAAuBp3G,IAE7C53C,GAAS+jD,gBACTwpF,EAAchxI,M5L+EI0N,E4L/EW,CAAEyxC,KAAM17C,EAAQ+jD,gB5LgFzCb,GAAe,IAAI8sD,GAAU9sD,EAAYj5C,K4L9EjD6kJ,EAAcvhB,cAAgBA,EAEvB,CAAElnF,aADY2nG,GAAcp2G,EAAck3G,EAAe9uJ,GAASsH,WACxDswC,eACrB,CEtD2Cq3G,CAA6BjvJ,GACpE,OAAO,IAAI6jE,GAASjsB,EAAc53C,EAASqmD,EAAQ,CAC/CmF,OAAO,EACPuY,WAAW,EACXpoD,QAAQ,GAEhB,KGsBWuzI,gCApCPC,GAAwC,SAAUC,EAASC,EAAYniF,EAAGoiF,GAE1E,OAAO,IAAKpiF,IAAMA,EAAInyE,WAAU,SAAUC,EAASC,GAC/C,SAASs0J,EAAU7wJ,GAAS,IAAM2nH,EAAKipC,EAAUniJ,KAAKzO,GAAS,CAAE,MAAO6F,GAAKtJ,EAAOsJ,EAAI,CAAE,CAC1F,SAASirJ,EAAS9wJ,GAAS,IAAM2nH,EAAKipC,EAAiB,MAAE5wJ,GAAS,CAAE,MAAO6F,GAAKtJ,EAAOsJ,EAAI,CAAE,CAC7F,SAAS8hH,EAAKj5G,GAJlB,IAAe1O,EAIa0O,EAAOd,KAAOtR,EAAQoS,EAAO1O,QAJ1CA,EAIyD0O,EAAO1O,MAJhDA,aAAiBwuE,EAAIxuE,EAAQ,IAAIwuE,GAAE,SAAUlyE,GAAWA,EAAQ0D,EAAQ,KAIjBqO,KAAKwiJ,EAAWC,EAAW,CAC7GnpC,GAAMipC,EAAYA,EAAUn0J,MAAMi0J,EAASC,GAAc,KAAKliJ,OAClE,GACJ,EACIsiJ,GAA4C,SAAUL,EAAS9xJ,GAC/D,IAAsGyY,EAAGu2D,EAAGpwE,EAAG8xE,EAA3GxiE,EAAI,CAAEi4G,MAAO,EAAGisC,KAAM,WAAa,GAAW,EAAPxzJ,EAAE,GAAQ,MAAMA,EAAE,GAAI,OAAOA,EAAE,EAAI,EAAGyzJ,KAAM,GAAI1rB,IAAK,IAChG,OAAOj2D,EAAI,CAAE7gE,KAAMyiJ,EAAK,GAAI,MAASA,EAAK,GAAI,OAAUA,EAAK,IAAwB,mBAAX3iJ,SAA0B+gE,EAAE/gE,OAAO8tC,UAAY,WAAa,OAAO97C,IAAM,GAAI+uE,EACvJ,SAAS4hF,EAAKr0J,GAAK,OAAO,SAAUkN,GAAK,OACzC,SAAc+7H,GACV,GAAIzuH,EAAG,MAAM,IAAIxK,UAAU,mCAC3B,KAAOyiE,IAAMA,EAAI,EAAGw2D,EAAG,KAAOh5H,EAAI,IAAKA,OACnC,GAAIuK,EAAI,EAAGu2D,IAAMpwE,EAAY,EAARsoI,EAAG,GAASl4D,EAAU,OAAIk4D,EAAG,GAAKl4D,EAAS,SAAOpwE,EAAIowE,EAAU,SAAMpwE,EAAEqJ,KAAK+mE,GAAI,GAAKA,EAAEn/D,SAAWjR,EAAIA,EAAEqJ,KAAK+mE,EAAGk4D,EAAG,KAAKl4H,KAAM,OAAOpQ,EAE3J,OADIowE,EAAI,EAAGpwE,IAAGsoI,EAAK,CAAS,EAARA,EAAG,GAAQtoI,EAAEwC,QACzB8lI,EAAG,IACP,KAAK,EAAG,KAAK,EAAGtoI,EAAIsoI,EAAI,MACxB,KAAK,EAAc,OAAXh5H,EAAEi4G,QAAgB,CAAE/kH,MAAO8lI,EAAG,GAAIl4H,MAAM,GAChD,KAAK,EAAGd,EAAEi4G,QAASn3C,EAAIk4D,EAAG,GAAIA,EAAK,CAAC,GAAI,SACxC,KAAK,EAAGA,EAAKh5H,EAAEy4H,IAAIppE,MAAOrvD,EAAEmkJ,KAAK90F,MAAO,SACxC,QACI,MAAkB3+D,GAAZA,EAAIsP,EAAEmkJ,MAAYh1J,OAAS,GAAKuB,EAAEA,EAAEvB,OAAS,KAAkB,IAAV6pI,EAAG,IAAsB,IAAVA,EAAG,IAAW,CAAEh5H,EAAI,EAAG,QAAU,CAC3G,GAAc,IAAVg5H,EAAG,MAActoI,GAAMsoI,EAAG,GAAKtoI,EAAE,IAAMsoI,EAAG,GAAKtoI,EAAE,IAAM,CAAEsP,EAAEi4G,MAAQ+gB,EAAG,GAAI,KAAO,CACrF,GAAc,IAAVA,EAAG,IAAYh5H,EAAEi4G,MAAQvnH,EAAE,GAAI,CAAEsP,EAAEi4G,MAAQvnH,EAAE,GAAIA,EAAIsoI,EAAI,KAAO,CACpE,GAAItoI,GAAKsP,EAAEi4G,MAAQvnH,EAAE,GAAI,CAAEsP,EAAEi4G,MAAQvnH,EAAE,GAAIsP,EAAEy4H,IAAI1nI,KAAKioI,GAAK,KAAO,CAC9DtoI,EAAE,IAAIsP,EAAEy4H,IAAIppE,MAChBrvD,EAAEmkJ,KAAK90F,MAAO,SAEtB2pE,EAAKlnI,EAAKiI,KAAK6pJ,EAAS5jJ,EAC5B,CAAE,MAAOjH,GAAKigI,EAAK,CAAC,EAAGjgI,GAAI+nE,EAAI,CAAG,CAAE,QAAUv2D,EAAI7Z,EAAI,CAAG,CACzD,GAAY,EAARsoI,EAAG,GAAQ,MAAMA,EAAG,GAAI,MAAO,CAAE9lI,MAAO8lI,EAAG,GAAKA,EAAG,QAAK,EAAQl4H,MAAM,EAC9E,CAtBgD+5G,CAAK,CAAC9qH,EAAGkN,GAAK,CAAG,CAuBrE,GAEA,SAAWymJ,GACPA,EAAiC,kBAAI,kBACrCA,EAAgC,iBAAI,iBACpCA,EAAuB,QAAI,SAC9B,CAJD,CAIGA,KAAkBA,GAAgB,CAAC,IACtC,IAAIW,GAAiC,WACjC,SAASA,EAAgB/yD,EAAKgzD,QACH,IAAnBA,IAA6BA,EAAiB,KAClD7wJ,KAAK69F,IAAMA,EACX79F,KAAK6wJ,eAAiBA,EACtB7wJ,KAAKwO,MAAQ,GACbxO,KAAK8wJ,WAAa,KAClB9wJ,KAAKoxC,UAAY,CACrB,CA2EA,OA1EAw/G,EAAgB1wJ,UAAU5C,KAAO,SAAU4zC,GACvC,IAAIu5B,GACHA,EAAKzqE,KAAKwO,OAAOlR,KAAKpB,MAAMuuE,EAAIv5B,EACrC,EACA0/G,EAAgB1wJ,UAAUnD,MAAQ,WAC9B,OAAOmzJ,GAAUlwJ,UAAM,OAAQ,GAAQ,WACnC,IAAI+wJ,EAAQ/wJ,KACZ,OAAOwwJ,GAAYxwJ,MAAM,SAAUyqE,GAqB/B,OApBKzqE,KAAK8wJ,aACN9wJ,KAAK8wJ,WAAaviG,aAAY,WAAc,OAAO2hG,GAAUa,OAAO,OAAQ,GAAQ,WAEhF,OAAOP,GAAYxwJ,MAAM,SAAUyqE,GAC/B,OAAQA,EAAG+5C,OACP,KAAK,EACD,OAAMxkH,KAAKwO,MAAM9S,OAAS,EACnB,CAAC,EAAasE,KAAK+B,KAAK/B,KAAKwO,QADC,CAAC,EAAa,GAEvD,KAAK,EACSi8D,EAAGgmF,SAET9xJ,QAAQC,IAAI,QAASoB,KAAKwO,MAAM9S,OAAQ,mBACxCsE,KAAKwO,MAAQ,IAEjBi8D,EAAG+5C,MAAQ,EACf,KAAK,EAAG,MAAO,CAAC,GAExB,GACJ,GAAI,GAAGxkH,KAAK6wJ,iBAET,CAAC,EACZ,GACJ,GACJ,EACAD,EAAgB1wJ,UAAUuN,KAAO,WACzBzN,KAAK8wJ,aACLpiG,cAAc1uD,KAAK8wJ,YACnB9wJ,KAAK8wJ,WAAa,KAE1B,EACAF,EAAgB1wJ,UAAU6B,KAAO,SAAUmvC,GACvC,OAAOg/G,GAAUlwJ,UAAM,OAAQ,GAAQ,WACnC,IAAIgxJ,EAAmBjyH,EAAKkyH,EACxBF,EAAQ/wJ,KACZ,OAAOwwJ,GAAYxwJ,MAAM,SAAUyqE,GAC/B,OAAQA,EAAG+5C,OACP,KAAK,EACDwsC,EAAoB9/G,EAASxlC,KAAI,SAAUjC,GAAW,MAAO,CACzD6X,KAAMyvI,EAAM3/G,UACZ8/G,cAAeznJ,EAAQ0nJ,YAAY1yJ,WACnC2yJ,cAAe3nJ,EACf,IACJghE,EAAG+5C,MAAQ,EACf,KAAK,EAED,OADA/5C,EAAGimF,KAAKpzJ,KAAK,CAAC,EAAG,EAAG,CAAE,IACf,CAAC,EAAaoD,MAAMV,KAAK69F,IAAK,CAC7BloF,OAAQ,OACRtX,KAAMuB,KAAKC,UAAUmxJ,MAEjC,KAAK,EAED,OAAmB,OADnBjyH,EAAM0rC,EAAGgmF,QACDjvJ,QACJ7C,QAAQ+I,MAAM,gDAAiDq3B,EAAIv9B,OAAQu9B,EAAIy2F,WAAYz2F,EAAIhe,MACxF,CAAC,GAAc,IAEnB,CAAC,GAAc,GAC1B,KAAK,EAID,OAHAkwI,EAAMxmF,EAAGgmF,OACT9xJ,QAAQ+I,MAAM,gDAAiDupJ,GAC/DtyJ,QAAQ+I,MAAM,iDAAkDspJ,GACzD,CAAC,GAAc,GAC1B,KAAK,EAAG,MAAO,CAAC,GAExB,GACJ,GACJ,EACOJ,CACX,CApFoC,GCHzBS,GAAa,SAAUj+G,GAAU,OAvCU+8G,OAuCO,EAvCEC,OAuCM,EAvCSC,EAuCO,WACjF,IAAI7mI,EAAS4U,EAAMthC,EACnB,OAhC4C,SAAUqzJ,EAAS9xJ,GAC/D,IAAsGyY,EAAGu2D,EAAGpwE,EAAG8xE,EAA3GxiE,EAAI,CAAEi4G,MAAO,EAAGisC,KAAM,WAAa,GAAW,EAAPxzJ,EAAE,GAAQ,MAAMA,EAAE,GAAI,OAAOA,EAAE,EAAI,EAAGyzJ,KAAM,GAAI1rB,IAAK,IAChG,OAAOj2D,EAAI,CAAE7gE,KAAMyiJ,EAAK,GAAI,MAASA,EAAK,GAAI,OAAUA,EAAK,IAAwB,mBAAX3iJ,SAA0B+gE,EAAE/gE,OAAO8tC,UAAY,WAAa,OAAO97C,IAAM,GAAI+uE,EACvJ,SAAS4hF,EAAKr0J,GAAK,OAAO,SAAUkN,GAAK,OACzC,SAAc+7H,GACV,GAAIzuH,EAAG,MAAM,IAAIxK,UAAU,mCAC3B,KAAOyiE,IAAMA,EAAI,EAAGw2D,EAAG,KAAOh5H,EAAI,IAAKA,OACnC,GAAIuK,EAAI,EAAGu2D,IAAMpwE,EAAY,EAARsoI,EAAG,GAASl4D,EAAU,OAAIk4D,EAAG,GAAKl4D,EAAS,SAAOpwE,EAAIowE,EAAU,SAAMpwE,EAAEqJ,KAAK+mE,GAAI,GAAKA,EAAEn/D,SAAWjR,EAAIA,EAAEqJ,KAAK+mE,EAAGk4D,EAAG,KAAKl4H,KAAM,OAAOpQ,EAE3J,OADIowE,EAAI,EAAGpwE,IAAGsoI,EAAK,CAAS,EAARA,EAAG,GAAQtoI,EAAEwC,QACzB8lI,EAAG,IACP,KAAK,EAAG,KAAK,EAAGtoI,EAAIsoI,EAAI,MACxB,KAAK,EAAc,OAAXh5H,EAAEi4G,QAAgB,CAAE/kH,MAAO8lI,EAAG,GAAIl4H,MAAM,GAChD,KAAK,EAAGd,EAAEi4G,QAASn3C,EAAIk4D,EAAG,GAAIA,EAAK,CAAC,GAAI,SACxC,KAAK,EAAGA,EAAKh5H,EAAEy4H,IAAIppE,MAAOrvD,EAAEmkJ,KAAK90F,MAAO,SACxC,QACI,MAAkB3+D,GAAZA,EAAIsP,EAAEmkJ,MAAYh1J,OAAS,GAAKuB,EAAEA,EAAEvB,OAAS,KAAkB,IAAV6pI,EAAG,IAAsB,IAAVA,EAAG,IAAW,CAAEh5H,EAAI,EAAG,QAAU,CAC3G,GAAc,IAAVg5H,EAAG,MAActoI,GAAMsoI,EAAG,GAAKtoI,EAAE,IAAMsoI,EAAG,GAAKtoI,EAAE,IAAM,CAAEsP,EAAEi4G,MAAQ+gB,EAAG,GAAI,KAAO,CACrF,GAAc,IAAVA,EAAG,IAAYh5H,EAAEi4G,MAAQvnH,EAAE,GAAI,CAAEsP,EAAEi4G,MAAQvnH,EAAE,GAAIA,EAAIsoI,EAAI,KAAO,CACpE,GAAItoI,GAAKsP,EAAEi4G,MAAQvnH,EAAE,GAAI,CAAEsP,EAAEi4G,MAAQvnH,EAAE,GAAIsP,EAAEy4H,IAAI1nI,KAAKioI,GAAK,KAAO,CAC9DtoI,EAAE,IAAIsP,EAAEy4H,IAAIppE,MAChBrvD,EAAEmkJ,KAAK90F,MAAO,SAEtB2pE,EAAKlnI,EAAKiI,KAAK6pJ,EAAS5jJ,EAC5B,CAAE,MAAOjH,GAAKigI,EAAK,CAAC,EAAGjgI,GAAI+nE,EAAI,CAAG,CAAE,QAAUv2D,EAAI7Z,EAAI,CAAG,CACzD,GAAY,EAARsoI,EAAG,GAAQ,MAAMA,EAAG,GAAI,MAAO,CAAE9lI,MAAO8lI,EAAG,GAAKA,EAAG,QAAK,EAAQl4H,MAAM,EAC9E,CAtBgD+5G,CAAK,CAAC9qH,EAAGkN,GAAK,CAAG,CAuBrE,CAMW,CAAYxJ,MAAM,SAAUyqE,GAC/B,OAAQA,EAAG+5C,OACP,KAAK,EAGD,OAFAh7F,EAAU,IAAImgB,YACdvL,EAAO5U,EAAQ3sB,OAAOu2C,EAAO30C,YACtB,CAAC,EAAausC,OAAOC,OAAOvzB,OAAO,UAAW0mB,IACzD,KAAK,EAED,OADAthC,EAAS2tE,EAAGgmF,OACL,CAAC,EAAcj1J,MAAMq/B,KAAK,IAAIl5B,WAAW7E,IACvC4O,KAAI,SAAUrO,GAAK,OAAOA,EAAEoB,SAAS,IAAI0rE,SAAS,EAAG,IAAM,IAC3DzsE,KAAK,KAE1B,GACJ,EApDW,KAFgEuwE,OAuCE,KArCvDA,EAAInyE,WAAU,SAAUC,EAASC,GAC/C,SAASs0J,EAAU7wJ,GAAS,IAAM2nH,EAAKipC,EAAUniJ,KAAKzO,GAAS,CAAE,MAAO6F,GAAKtJ,EAAOsJ,EAAI,CAAE,CAC1F,SAASirJ,EAAS9wJ,GAAS,IAAM2nH,EAAKipC,EAAiB,MAAE5wJ,GAAS,CAAE,MAAO6F,GAAKtJ,EAAOsJ,EAAI,CAAE,CAC7F,SAAS8hH,EAAKj5G,GAJlB,IAAe1O,EAIa0O,EAAOd,KAAOtR,EAAQoS,EAAO1O,QAJ1CA,EAIyD0O,EAAO1O,MAJhDA,aAAiBwuE,EAAIxuE,EAAQ,IAAIwuE,GAAE,SAAUlyE,GAAWA,EAAQ0D,EAAQ,KAIjBqO,KAAKwiJ,EAAWC,EAAW,CAC7GnpC,GAAMipC,EAAYA,EAAUn0J,MAAMi0J,EAASC,GAAc,KAAKliJ,OAClE,IAPwC,IAAUiiJ,EAASC,EAAYniF,EAAGoiF,CAsD1E,ECtDA,GAAwC,SAAUF,EAASC,EAAYniF,EAAGoiF,GAE1E,OAAO,IAAKpiF,IAAMA,EAAInyE,WAAU,SAAUC,EAASC,GAC/C,SAASs0J,EAAU7wJ,GAAS,IAAM2nH,EAAKipC,EAAUniJ,KAAKzO,GAAS,CAAE,MAAO6F,GAAKtJ,EAAOsJ,EAAI,CAAE,CAC1F,SAASirJ,EAAS9wJ,GAAS,IAAM2nH,EAAKipC,EAAiB,MAAE5wJ,GAAS,CAAE,MAAO6F,GAAKtJ,EAAOsJ,EAAI,CAAE,CAC7F,SAAS8hH,EAAKj5G,GAJlB,IAAe1O,EAIa0O,EAAOd,KAAOtR,EAAQoS,EAAO1O,QAJ1CA,EAIyD0O,EAAO1O,MAJhDA,aAAiBwuE,EAAIxuE,EAAQ,IAAIwuE,GAAE,SAAUlyE,GAAWA,EAAQ0D,EAAQ,KAIjBqO,KAAKwiJ,EAAWC,EAAW,CAC7GnpC,GAAMipC,EAAYA,EAAUn0J,MAAMi0J,EAASC,GAAc,KAAKliJ,OAClE,GACJ,EACI,GAA4C,SAAUiiJ,EAAS9xJ,GAC/D,IAAsGyY,EAAGu2D,EAAGpwE,EAAG8xE,EAA3GxiE,EAAI,CAAEi4G,MAAO,EAAGisC,KAAM,WAAa,GAAW,EAAPxzJ,EAAE,GAAQ,MAAMA,EAAE,GAAI,OAAOA,EAAE,EAAI,EAAGyzJ,KAAM,GAAI1rB,IAAK,IAChG,OAAOj2D,EAAI,CAAE7gE,KAAMyiJ,EAAK,GAAI,MAASA,EAAK,GAAI,OAAUA,EAAK,IAAwB,mBAAX3iJ,SAA0B+gE,EAAE/gE,OAAO8tC,UAAY,WAAa,OAAO97C,IAAM,GAAI+uE,EACvJ,SAAS4hF,EAAKr0J,GAAK,OAAO,SAAUkN,GAAK,OACzC,SAAc+7H,GACV,GAAIzuH,EAAG,MAAM,IAAIxK,UAAU,mCAC3B,KAAOyiE,IAAMA,EAAI,EAAGw2D,EAAG,KAAOh5H,EAAI,IAAKA,OACnC,GAAIuK,EAAI,EAAGu2D,IAAMpwE,EAAY,EAARsoI,EAAG,GAASl4D,EAAU,OAAIk4D,EAAG,GAAKl4D,EAAS,SAAOpwE,EAAIowE,EAAU,SAAMpwE,EAAEqJ,KAAK+mE,GAAI,GAAKA,EAAEn/D,SAAWjR,EAAIA,EAAEqJ,KAAK+mE,EAAGk4D,EAAG,KAAKl4H,KAAM,OAAOpQ,EAE3J,OADIowE,EAAI,EAAGpwE,IAAGsoI,EAAK,CAAS,EAARA,EAAG,GAAQtoI,EAAEwC,QACzB8lI,EAAG,IACP,KAAK,EAAG,KAAK,EAAGtoI,EAAIsoI,EAAI,MACxB,KAAK,EAAc,OAAXh5H,EAAEi4G,QAAgB,CAAE/kH,MAAO8lI,EAAG,GAAIl4H,MAAM,GAChD,KAAK,EAAGd,EAAEi4G,QAASn3C,EAAIk4D,EAAG,GAAIA,EAAK,CAAC,GAAI,SACxC,KAAK,EAAGA,EAAKh5H,EAAEy4H,IAAIppE,MAAOrvD,EAAEmkJ,KAAK90F,MAAO,SACxC,QACI,MAAkB3+D,GAAZA,EAAIsP,EAAEmkJ,MAAYh1J,OAAS,GAAKuB,EAAEA,EAAEvB,OAAS,KAAkB,IAAV6pI,EAAG,IAAsB,IAAVA,EAAG,IAAW,CAAEh5H,EAAI,EAAG,QAAU,CAC3G,GAAc,IAAVg5H,EAAG,MAActoI,GAAMsoI,EAAG,GAAKtoI,EAAE,IAAMsoI,EAAG,GAAKtoI,EAAE,IAAM,CAAEsP,EAAEi4G,MAAQ+gB,EAAG,GAAI,KAAO,CACrF,GAAc,IAAVA,EAAG,IAAYh5H,EAAEi4G,MAAQvnH,EAAE,GAAI,CAAEsP,EAAEi4G,MAAQvnH,EAAE,GAAIA,EAAIsoI,EAAI,KAAO,CACpE,GAAItoI,GAAKsP,EAAEi4G,MAAQvnH,EAAE,GAAI,CAAEsP,EAAEi4G,MAAQvnH,EAAE,GAAIsP,EAAEy4H,IAAI1nI,KAAKioI,GAAK,KAAO,CAC9DtoI,EAAE,IAAIsP,EAAEy4H,IAAIppE,MAChBrvD,EAAEmkJ,KAAK90F,MAAO,SAEtB2pE,EAAKlnI,EAAKiI,KAAK6pJ,EAAS5jJ,EAC5B,CAAE,MAAOjH,GAAKigI,EAAK,CAAC,EAAGjgI,GAAI+nE,EAAI,CAAG,CAAE,QAAUv2D,EAAI7Z,EAAI,CAAG,CACzD,GAAY,EAARsoI,EAAG,GAAQ,MAAMA,EAAG,GAAI,MAAO,CAAE9lI,MAAO8lI,EAAG,GAAKA,EAAG,QAAK,EAAQl4H,MAAM,EAC9E,CAtBgD+5G,CAAK,CAAC9qH,EAAGkN,GAAK,CAAG,CAuBrE,EAcI8nJ,GAAwB,yCAExBC,GAAwB,IAAI,GAAA9pI,KAAK,oBAChCL,IAAI,IAAI,GAAAI,MAAM,OAAQ,EAAG,WACzBJ,IAAI,IAAI,GAAAI,MAAM,QAAS,EAAG,WAC1BJ,IAAI,IAAI,GAAAI,MAAM,QAAS,EAAG,WAC1BJ,IAAI,IAAI,GAAAI,MAAM,SAAU,EAAG,WAC5BgqI,GAAyB,IAAI1jG,YAAY,qBACzC2jG,GAAmB,IAAI3jG,YAAY,eACnC4jG,GAAuB,IAAI5jG,YAAY,mBAcpC,SAAS6jG,GAAIC,GAChB,OAAO,GAAU5xJ,UAAM,OAAQ,GAAQ,WACnC,IAAIgR,EAAM8yC,EAAQt6B,EAASqoI,EAAwBC,EAC/Cf,EAAQ/wJ,KACZ,OAAO,GAAYA,MAAM,SAAUyqE,GAC/B,OAAQA,EAAG+5C,OACP,KAAK,EAAG,MAAO,CAAC,EAnBI,QAAU,OAAQ,OAAQ,GAAQ,WAClE,OAAO,GAAYxkH,MAAM,SAAUyqE,GAC/B,OAAQA,EAAG+5C,OACP,KAAK,EAAG,MAAO,CAAC,EAAairC,GAAgB,CACrCC,cAAe,CACXj+G,cAAe,CAAC6/G,KAEpBxB,kBAAkB,KAE1B,KAAK,EAAG,MAAO,CAAC,EAAcrlF,EAAGgmF,QAEzC,GACJ,KAQgB,KAAK,EAED,MAAO,CAAC,GADRz/I,EAAOy5D,EAAGgmF,QACgB1zJ,SAC9B,KAAK,EAED,OADA0tE,EAAGgmF,OACI,CAAC,EAAaxkG,GAAkBj7C,IAC3C,KAAK,EA+ID,OA9IAy5D,EAAGgmF,OACH3sG,EAAS9yC,EAAKo2C,OAAOtD,OAAOrlD,WAC5B+qB,EAAU2xB,GAAc,CACpBvL,aAAc0hH,KAElBO,EAAyB,SAAUE,GAE/B,IADA,IAAIC,EAAS,GACJC,EAAK,EAAGA,EAAKx2J,UAAUC,OAAQu2J,IACpCD,EAAOC,EAAK,GAAKx2J,UAAUw2J,GAE/B,OAAO,GAAUlB,EA5DW,SAAU56G,EAAItb,EAAMq3H,GACpE,GAAIA,GAA6B,IAArBz2J,UAAUC,OAAc,IAAK,IAA4By2J,EAAxBv1J,EAAI,EAAGiT,EAAIgrB,EAAKn/B,OAAYkB,EAAIiT,EAAGjT,KACxEu1J,GAAQv1J,KAAKi+B,IACRs3H,IAAIA,EAAK32J,MAAM0E,UAAUzC,MAAM6I,KAAKu0B,EAAM,EAAGj+B,IAClDu1J,EAAGv1J,GAAKi+B,EAAKj+B,IAGrB,OAAOu5C,EAAGxmC,OAAOwiJ,GAAM32J,MAAM0E,UAAUzC,MAAM6I,KAAKu0B,GACtD,CAoDgDu3H,CAAc,CAACL,GAAgBC,GAAQ,QAAO,GAAQ,SAAUK,EAAaC,GACjG,IAAIC,EAAcC,EAAeC,EAAeC,EAC5C3B,EAAQ/wJ,KAEZ,YADe,IAAXsyJ,IAAqBA,EAAS,KAC3B,GAAYtyJ,MAAM,SAAUyqE,GAC/B,OAAQA,EAAG+5C,OACP,KAAK,EAAG,MAAO,CAAC,EAAa6sC,GDjEtD70J,KAAKmD,MAAsB,IAAhBnD,KAAK4oD,YCkES,KAAK,EAiFD,OAhFAmtG,EAAe9nF,EAAGgmF,OAClB+B,EAAgBH,EAChBI,EAAgB,EAChBC,EAAc,WAAc,OAAO,GAAU3B,OAAO,OAAQ,GAAQ,WAChE,IAAItnJ,EAAS8mC,EAASpiC,EAAQwkJ,EAAgBC,EAAcC,EAC5D,OAAO,GAAY7yJ,MAAM,SAAUyqE,GAC/B,OAAQA,EAAG+5C,OACP,KAAK,EASD,OARA/5C,EAAGimF,KAAKpzJ,KAAK,CAAC,EAAG,EAAG,CAAE,IACtBmM,EAAU8nJ,GAAsB9kJ,OAAO,CACnCT,KAAMumJ,EACNnI,MAAOoI,EACP52J,MAAO62J,EACPK,OAAQhvG,IAEZvT,EAAUghH,GAAsB10J,OAAO4M,GAASurB,SACzC,CAAC,EAAahkB,EAAKy7C,UAAU1qD,KAAKynB,EAAS,CAC1C+mB,QAASA,EACTC,UAAW,IAAItmC,QAE3B,KAAK,EAkDD,OAjDAiE,EAASs8D,EAAGgmF,OACZ9xJ,QAAQC,IAAI,OACZD,QAAQC,IAAI,yBAA0BuP,EAAO8xD,UAAUvkE,QACvDiD,QAAQC,IAAIuP,EAAO8xD,WACnBthE,QAAQC,IAAI,wBAAyBuP,EAAO4xD,SAASrkE,QACrDiD,QAAQC,IAAIuP,EAAO4xD,UACf5xD,EAAO8xD,UAAUvkE,OAAS,IAE1Bk2J,EAAgBt0J,KAAK,CACjB,CACI6zJ,YAAalB,GAAc8C,kBAC3BviH,UAAWh0C,KAAKmD,OAAM,IAAIuK,MAAOq/C,UAAY,KAC7CypG,aAAclvG,EACdmvG,eAAgBnvG,EAChByuG,aAAcA,EACdC,cAAeA,EACfC,cAAeA,EACf7iH,aAAc0hH,GACd9/G,YAAa,GAAgC8/G,OAGrDqB,EAAiBpqJ,SAAS2qJ,cAAc,OACxCN,EAAerqJ,SAAS4qJ,eAAe,gBACvCR,EAAeS,YAAc,YAAYzjJ,OAAO4iJ,EAAc,KAAK5iJ,OAAO8iJ,EAAe,QAAQ9iJ,OAAO6iJ,GACxGI,EAAaS,aAAaV,EAAgBC,EAAaU,YACvDV,EAAaS,aAAa9qJ,SAAS2qJ,cAAc,MAAON,EAAaU,YACrE/qJ,SAASqlD,cAAc6jG,IAEvBgB,KAEAtkJ,EAAO4xD,SAASrkE,OAAS,GACzBk2J,EAAgBt0J,KAAK6Q,EAAO4xD,SAASr0D,KAAI,SAAU+7C,GAC/C,IAAIgjB,EACJ,MAAO,CACH0mF,YAAalB,GAAcsD,iBAC3B/iH,UAAWh0C,KAAKmD,OAAM,IAAIuK,MAAOq/C,UAAY,KAC7CzF,OAAQA,EACR0vG,aAAwC,QAAzB/oF,EAAKhjB,EAAQ3D,cAA2B,IAAP2mB,OAAgB,EAASA,EAAGhsE,WAC5EqrD,aAAcrC,EAAQ//C,MAAMjJ,WAC5BmxC,aAAc0hH,GAEtB,KAEAmB,EAAgBD,EAChB/8H,WAAWi9H,EAAaJ,GAGxB/pJ,SAASqlD,cAAc4jG,IAEpB,CAAC,EAAa,GACzB,KAAK,EAGD,OAFAqB,EAAUpoF,EAAGgmF,OACb9xJ,QAAQ+I,MAAM,wBAAyBmrJ,GAChC,CAAC,EAAa,GACzB,KAAK,EAAG,MAAO,CAAC,GAExB,GACJ,GAAI,EACJH,IACO,CAAC,GAEpB,GACJ,GACJ,EACAZ,EAA0B,WAAc,OAAO,GAAUf,OAAO,OAAQ,GAAQ,WAC5E,IAAItnI,EAASgqI,EAAkBlzF,EAC/B,OAAO,GAAYvgE,MAAM,SAAUyqE,GAC/B,OAAQA,EAAG+5C,OACP,KAAK,EA4BD,OA3BA/6F,E5TrDzB,IAAI,GAAQ+vB,GADO5J,E4TsD8B0hH,G5TtDhB73G,WACqC7J,G4TsD7C6jH,EAAmBlrJ,SAAS4qJ,eAAe,oBAC3C5yF,EAAuB,SAAU92D,GAC7B,IAAIiqJ,EAAmBnC,GAAsB3zJ,OAAO6L,EAAQ8mC,SAE5D,GAAImjH,EAAiBZ,SAAWhvG,EAAhC,CAGA8tG,EAAgBt0J,KAAK,CACjB,CACI6zJ,YAAalB,GAAc8C,kBAC3BviH,UAAWh0C,KAAKmD,OAAM,IAAIuK,MAAOq/C,UAAY,KAC7CypG,aAAcU,EAAiBZ,OAC/BG,eAAgBnvG,EAChByuG,aAAcmB,EAAiB1nJ,KAC/BwmJ,cAAekB,EAAiBtJ,MAChCqI,cAAeiB,EAAiB93J,MAChCg0C,aAAc0hH,GACd9/G,YAAa,GAAgC8/G,OAGrD,IAAIqB,EAAiBpqJ,SAAS2qJ,cAAc,OAC5CP,EAAeS,YAAc,YAAYzjJ,OAAO+jJ,EAAiB1nJ,KAAM,KAAK2D,OAAO+jJ,EAAiB93J,MAAO,QAAQ+T,OAAO+jJ,EAAiBtJ,OAC3IqJ,EAAiBE,YAAYhB,GAC7Bc,EAAiBE,YAAYprJ,SAAS2qJ,cAAc,OACpD3qJ,SAASqlD,cAAc8jG,GAlBvB,CAmBJ,EACO,CAAC,EAAa1gJ,EAAK0L,OAAOo0B,UAAUrnB,EAAS82C,IACxD,KAAK,EAED,OADAkK,EAAGgmF,OACI,CAAC,G5TpFrC,IAAuB7gH,C4TsFN,GACJ,GAAI,EACG,CAAC,EAAc,CACd5+B,KAAMA,EACN6gJ,uBAAwBA,EACxBC,wBAAyBA,IAG7C,GACJ,GACJ,CACsB,QAAU,OAAQ,OAAQ,GAAQ,WACpD,SAAS8B,IACL,IAAIvB,EAAc71J,KAAKmD,MAAsB,GAAhBnD,KAAK4oD,UAAiB,EAC/CyuG,EAAgBr3J,KAAKmD,MAAsB,KAAhBnD,KAAK4oD,UAAmB,IACvDysG,EAAuBQ,EAAawB,EACxC,CACA,IAAIjC,EAAiBnnF,EAAIz5D,EAAM6gJ,EAAwBC,EAAwCgC,EAAmBC,EAAqBC,EAAuBC,EAC9J,OAAO,GAAYj0J,MAAM,SAAU2jF,GAC/B,OAAQA,EAAG6gC,OACP,KAAK,EAED,MAAO,CAAC,EAAamtC,GADrBC,EAAkB,IAAIhB,GArMlB,2CAqMiD,OAEzD,KAAK,EAKD,OAJAnmF,EAAKkZ,EAAG8sE,OAAQz/I,EAAOy5D,EAAGz5D,KAAM6gJ,EAAyBpnF,EAAGonF,uBAAwBC,EAA0BrnF,EAAGqnF,wBACjH7pJ,OAAOikD,KAAOl7C,EACEzI,SAAS4qJ,eAAe,iBAC1B1qJ,MAAMyrJ,QAAU,QACvB,CAAC,EAAatC,EAAgB70J,SACzC,KAAK,EAiBD,OAhBA4mF,EAAG8sE,OACHqB,IACAgC,EAAoB,EACpBC,EAAsBxrJ,SAAS4qJ,eAAe,WAC9C5qJ,SAAS44C,iBAAiB,eAAe,WACrC2yG,IACAC,EAAoBX,YAAcU,EAAkBr1J,UACxD,IACAu1J,EAAwB,EACxBC,EAA0B1rJ,SAAS4qJ,eAAe,eAClD5qJ,SAAS44C,iBAAiB,mBAAmB,WACzC6yG,IACAC,EAAwBb,YAAcY,EAAsBv1J,UAChE,IACA8J,SAAS44C,iBAAiBqwG,GAAuBtpJ,MAAM,WAAc,OAAO0rJ,GAAiB,IAC7FA,IACO,CAAC,GAEpB,GACJ","sources":["webpack://waku-dogfooding/./node_modules/@protobufjs/aspromise/index.js","webpack://waku-dogfooding/./node_modules/@protobufjs/base64/index.js","webpack://waku-dogfooding/./node_modules/@protobufjs/codegen/index.js","webpack://waku-dogfooding/./node_modules/@protobufjs/eventemitter/index.js","webpack://waku-dogfooding/./node_modules/@protobufjs/fetch/index.js","webpack://waku-dogfooding/./node_modules/@protobufjs/float/index.js","webpack://waku-dogfooding/./node_modules/@protobufjs/inquire/index.js","webpack://waku-dogfooding/./node_modules/@protobufjs/path/index.js","webpack://waku-dogfooding/./node_modules/@protobufjs/pool/index.js","webpack://waku-dogfooding/./node_modules/@protobufjs/utf8/index.js","webpack://waku-dogfooding/./node_modules/debug/src/browser.js","webpack://waku-dogfooding/./node_modules/debug/src/common.js","webpack://waku-dogfooding/./node_modules/err-code/index.js","webpack://waku-dogfooding/./node_modules/event-iterator/lib/dom.js","webpack://waku-dogfooding/./node_modules/event-iterator/lib/event-iterator.js","webpack://waku-dogfooding/./node_modules/eventemitter3/index.js","webpack://waku-dogfooding/./node_modules/hashlru/index.js","webpack://waku-dogfooding/./node_modules/hi-base32/src/base32.js","webpack://waku-dogfooding/./node_modules/is-electron/index.js","webpack://waku-dogfooding/./node_modules/is-plain-obj/index.js","webpack://waku-dogfooding/./node_modules/js-sha3/src/sha3.js","webpack://waku-dogfooding/./node_modules/merge-options/index.js","webpack://waku-dogfooding/./node_modules/ms/index.js","webpack://waku-dogfooding/./node_modules/murmurhash3js-revisited/index.js","webpack://waku-dogfooding/./node_modules/murmurhash3js-revisited/lib/murmurHash3js.js","webpack://waku-dogfooding/./node_modules/netmask/lib/netmask.js","webpack://waku-dogfooding/./node_modules/protobufjs/index.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/common.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/converter.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/decoder.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/encoder.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/enum.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/field.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/index-light.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/index-minimal.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/index.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/mapfield.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/message.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/method.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/namespace.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/object.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/oneof.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/parse.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/reader.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/reader_buffer.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/root.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/roots.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/rpc.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/rpc/service.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/service.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/tokenize.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/type.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/types.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/util.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/util/longbits.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/util/minimal.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/verifier.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/wrappers.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/writer.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/writer_buffer.js","webpack://waku-dogfooding/./node_modules/pvtsutils/build/index.js","webpack://waku-dogfooding/webpack/bootstrap","webpack://waku-dogfooding/webpack/runtime/create fake namespace object","webpack://waku-dogfooding/webpack/runtime/amd options","webpack://waku-dogfooding/webpack/runtime/define property getters","webpack://waku-dogfooding/webpack/runtime/hasOwnProperty shorthand","webpack://waku-dogfooding/webpack/runtime/make namespace object","webpack://waku-dogfooding/./node_modules/uint8arrays/dist/src/alloc.js","webpack://waku-dogfooding/./node_modules/uint8-varint/dist/src/index.js","webpack://waku-dogfooding/./node_modules/protons-runtime/dist/src/utils/float.js","webpack://waku-dogfooding/./node_modules/protons-runtime/dist/src/utils/longbits.js","webpack://waku-dogfooding/./node_modules/protons-runtime/dist/src/utils/utf8.js","webpack://waku-dogfooding/./node_modules/protons-runtime/dist/src/utils/reader.js","webpack://waku-dogfooding/./node_modules/protons-runtime/dist/src/decode.js","webpack://waku-dogfooding/./node_modules/multiformats/dist/src/bytes.js","webpack://waku-dogfooding/./node_modules/multiformats/dist/src/vendor/base-x.js","webpack://waku-dogfooding/./node_modules/multiformats/dist/src/bases/base.js","webpack://waku-dogfooding/./node_modules/multiformats/dist/src/bases/base10.js","webpack://waku-dogfooding/./node_modules/multiformats/dist/src/bases/base16.js","webpack://waku-dogfooding/./node_modules/multiformats/dist/src/bases/base2.js","webpack://waku-dogfooding/./node_modules/multiformats/dist/src/bases/base256emoji.js","webpack://waku-dogfooding/./node_modules/multiformats/dist/src/bases/base32.js","webpack://waku-dogfooding/./node_modules/multiformats/dist/src/bases/base36.js","webpack://waku-dogfooding/./node_modules/multiformats/dist/src/bases/base58.js","webpack://waku-dogfooding/./node_modules/multiformats/dist/src/bases/base64.js","webpack://waku-dogfooding/./node_modules/multiformats/dist/src/bases/base8.js","webpack://waku-dogfooding/./node_modules/multiformats/dist/src/bases/identity.js","webpack://waku-dogfooding/./node_modules/multiformats/dist/src/codecs/json.js","webpack://waku-dogfooding/./node_modules/multiformats/dist/src/codecs/raw.js","webpack://waku-dogfooding/./node_modules/multiformats/dist/src/vendor/varint.js","webpack://waku-dogfooding/./node_modules/multiformats/dist/src/varint.js","webpack://waku-dogfooding/./node_modules/multiformats/dist/src/hashes/digest.js","webpack://waku-dogfooding/./node_modules/multiformats/dist/src/hashes/identity.js","webpack://waku-dogfooding/./node_modules/multiformats/dist/src/hashes/hasher.js","webpack://waku-dogfooding/./node_modules/multiformats/dist/src/hashes/sha2-browser.js","webpack://waku-dogfooding/./node_modules/multiformats/dist/src/cid.js","webpack://waku-dogfooding/./node_modules/multiformats/dist/src/basics.js","webpack://waku-dogfooding/./node_modules/uint8arrays/dist/src/util/bases.js","webpack://waku-dogfooding/./node_modules/uint8arrays/dist/src/from-string.js","webpack://waku-dogfooding/./node_modules/protons-runtime/dist/src/utils/writer.js","webpack://waku-dogfooding/./node_modules/protons-runtime/dist/src/utils/pool.js","webpack://waku-dogfooding/./node_modules/protons-runtime/dist/src/encode.js","webpack://waku-dogfooding/./node_modules/protons-runtime/dist/src/codec.js","webpack://waku-dogfooding/./node_modules/@waku/proto/dist/generated/message.js","webpack://waku-dogfooding/./node_modules/@waku/proto/dist/generated/filter.js","webpack://waku-dogfooding/./node_modules/@waku/proto/dist/generated/topic_only_message.js","webpack://waku-dogfooding/./node_modules/@waku/proto/dist/generated/filter_v2.js","webpack://waku-dogfooding/./node_modules/@waku/proto/dist/generated/light_push.js","webpack://waku-dogfooding/./node_modules/@waku/proto/dist/generated/store_v3.js","webpack://waku-dogfooding/./node_modules/@waku/proto/dist/generated/peer_exchange.js","webpack://waku-dogfooding/./node_modules/@waku/proto/dist/generated/metadata.js","webpack://waku-dogfooding/./node_modules/protons-runtime/dist/src/codecs/enum.js","webpack://waku-dogfooding/./node_modules/protons-runtime/dist/src/codecs/message.js","webpack://waku-dogfooding/./node_modules/protons-runtime/dist/src/index.js","webpack://waku-dogfooding/./node_modules/@waku/utils/dist/common/is_defined.js","webpack://waku-dogfooding/./node_modules/@waku/utils/dist/common/group_by.js","webpack://waku-dogfooding/./node_modules/@waku/utils/dist/common/to_async_iterator.js","webpack://waku-dogfooding/./node_modules/@noble/hashes/esm/_assert.js","webpack://waku-dogfooding/./node_modules/@noble/hashes/esm/crypto.js","webpack://waku-dogfooding/./node_modules/@noble/hashes/esm/utils.js","webpack://waku-dogfooding/./node_modules/@noble/hashes/esm/_md.js","webpack://waku-dogfooding/./node_modules/@noble/hashes/esm/sha256.js","webpack://waku-dogfooding/./node_modules/@waku/interfaces/dist/protocols.js","webpack://waku-dogfooding/./node_modules/@waku/interfaces/dist/connection_manager.js","webpack://waku-dogfooding/./node_modules/@waku/interfaces/dist/dns_discovery.js","webpack://waku-dogfooding/./node_modules/@waku/interfaces/dist/constants.js","webpack://waku-dogfooding/./node_modules/@waku/interfaces/dist/health_manager.js","webpack://waku-dogfooding/./node_modules/uint8arrays/dist/src/to-string.js","webpack://waku-dogfooding/./node_modules/@waku/utils/dist/bytes/index.js","webpack://waku-dogfooding/./node_modules/@waku/utils/dist/common/sharding/index.js","webpack://waku-dogfooding/./node_modules/@waku/utils/dist/common/relay_shard_codec.js","webpack://waku-dogfooding/./node_modules/@waku/utils/dist/common/delay.js","webpack://waku-dogfooding/./node_modules/@waku/utils/dist/logger/index.js","webpack://waku-dogfooding/./node_modules/@waku/core/dist/lib/message/version_0.js","webpack://waku-dogfooding/./node_modules/it-all/dist/src/index.js","webpack://waku-dogfooding/./node_modules/uint8arrays/dist/src/concat.js","webpack://waku-dogfooding/./node_modules/uint8arrays/dist/src/equals.js","webpack://waku-dogfooding/./node_modules/uint8arraylist/dist/src/index.js","webpack://waku-dogfooding/./node_modules/it-length-prefixed/dist/src/utils.js","webpack://waku-dogfooding/./node_modules/it-length-prefixed/dist/src/encode.js","webpack://waku-dogfooding/./node_modules/it-length-prefixed/dist/src/errors.js","webpack://waku-dogfooding/./node_modules/it-length-prefixed/dist/src/decode.js","webpack://waku-dogfooding/./node_modules/p-defer/index.js","webpack://waku-dogfooding/./node_modules/it-pushable/dist/src/fifo.js","webpack://waku-dogfooding/./node_modules/it-pushable/dist/src/index.js","webpack://waku-dogfooding/./node_modules/it-merge/dist/src/index.js","webpack://waku-dogfooding/./node_modules/it-pipe/dist/src/index.js","webpack://waku-dogfooding/./node_modules/@waku/core/dist/lib/stream_manager/stream_manager.js","webpack://waku-dogfooding/./node_modules/@waku/core/dist/lib/stream_manager/utils.js","webpack://waku-dogfooding/./node_modules/@waku/core/dist/lib/base_protocol.js","webpack://waku-dogfooding/./node_modules/@waku/utils/dist/libp2p/index.js","webpack://waku-dogfooding/./node_modules/@waku/core/dist/lib/filterPeers.js","webpack://waku-dogfooding/./node_modules/uuid/dist/esm-browser/native.js","webpack://waku-dogfooding/./node_modules/uuid/dist/esm-browser/rng.js","webpack://waku-dogfooding/./node_modules/uuid/dist/esm-browser/stringify.js","webpack://waku-dogfooding/./node_modules/uuid/dist/esm-browser/v4.js","webpack://waku-dogfooding/./node_modules/@waku/core/dist/lib/filter/filter_rpc.js","webpack://waku-dogfooding/./node_modules/@waku/core/dist/lib/filter/index.js","webpack://waku-dogfooding/./node_modules/@waku/core/dist/lib/light_push/push_rpc.js","webpack://waku-dogfooding/./node_modules/@waku/core/dist/lib/light_push/utils.js","webpack://waku-dogfooding/./node_modules/@waku/core/dist/lib/light_push/index.js","webpack://waku-dogfooding/./node_modules/@waku/utils/dist/common/is_size_valid.js","webpack://waku-dogfooding/./node_modules/@waku/core/dist/lib/to_proto_message.js","webpack://waku-dogfooding/./node_modules/@waku/core/dist/lib/store/rpc.js","webpack://waku-dogfooding/./node_modules/@waku/core/dist/lib/store/index.js","webpack://waku-dogfooding/./node_modules/p-timeout/index.js","webpack://waku-dogfooding/./node_modules/p-event/index.js","webpack://waku-dogfooding/./node_modules/@waku/core/dist/lib/wait_for_remote_peer.js","webpack://waku-dogfooding/./node_modules/@libp2p/interface/dist/src/event-target.js","webpack://waku-dogfooding/./node_modules/@waku/core/dist/lib/keep_alive_manager.js","webpack://waku-dogfooding/./node_modules/@waku/core/dist/lib/connection_manager.js","webpack://waku-dogfooding/./node_modules/@waku/core/dist/lib/health_manager.js","webpack://waku-dogfooding/./node_modules/@waku/core/dist/lib/metadata/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/interface/dist/src/peer-id/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/interface/dist/src/errors.js","webpack://waku-dogfooding/./node_modules/@chainsafe/is-ip/lib/parse.js","webpack://waku-dogfooding/./node_modules/@chainsafe/is-ip/lib/parser.js","webpack://waku-dogfooding/./node_modules/@chainsafe/is-ip/lib/is-ip.js","webpack://waku-dogfooding/./node_modules/@chainsafe/netmask/dist/src/ip.js","webpack://waku-dogfooding/./node_modules/@multiformats/multiaddr/dist/src/ip.js","webpack://waku-dogfooding/./node_modules/@multiformats/multiaddr/dist/src/protocols-table.js","webpack://waku-dogfooding/./node_modules/@multiformats/multiaddr/dist/src/convert.js","webpack://waku-dogfooding/./node_modules/@multiformats/multiaddr/dist/src/codec.js","webpack://waku-dogfooding/./node_modules/@multiformats/multiaddr/dist/src/multiaddr.js","webpack://waku-dogfooding/./node_modules/@multiformats/multiaddr/dist/src/index.js","webpack://waku-dogfooding/./node_modules/@waku/message-hash/dist/index.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/protocols/base_protocol.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/protocols/filter.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/protocols/light_push.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/protocols/store.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/waku.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/util.js","webpack://waku-dogfooding/./node_modules/@noble/hashes/esm/_u64.js","webpack://waku-dogfooding/./node_modules/@noble/hashes/esm/sha512.js","webpack://waku-dogfooding/./node_modules/@noble/curves/esm/abstract/utils.js","webpack://waku-dogfooding/./node_modules/@noble/curves/esm/abstract/modular.js","webpack://waku-dogfooding/./node_modules/@noble/curves/esm/abstract/curve.js","webpack://waku-dogfooding/./node_modules/@noble/curves/esm/abstract/edwards.js","webpack://waku-dogfooding/./node_modules/@noble/curves/esm/abstract/montgomery.js","webpack://waku-dogfooding/./node_modules/@noble/curves/esm/ed25519.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/keys/ed25519-browser.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/webcrypto-browser.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/ciphers/aes-gcm.browser.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/keys/exporter.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/keys/keys.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/keys/ed25519-class.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/keys/rsa-browser.js","webpack://waku-dogfooding/./node_modules/@noble/hashes/esm/hmac.js","webpack://waku-dogfooding/./node_modules/pvutils/build/utils.es.js","webpack://waku-dogfooding/./node_modules/asn1js/build/index.es.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/random-bytes.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/keys/rsa-utils.js","webpack://waku-dogfooding/./node_modules/@noble/hashes/esm/pbkdf2.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/keys/rsa-class.js","webpack://waku-dogfooding/./node_modules/@noble/curves/esm/abstract/weierstrass.js","webpack://waku-dogfooding/./node_modules/@noble/curves/esm/_shortw_utils.js","webpack://waku-dogfooding/./node_modules/@noble/curves/esm/secp256k1.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/keys/secp256k1-browser.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/keys/secp256k1-class.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/keys/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/interface/dist/src/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/peer-id/dist/src/index.js","webpack://waku-dogfooding/./node_modules/race-signal/dist/src/index.js","webpack://waku-dogfooding/./node_modules/it-queueless-pushable/dist/src/index.js","webpack://waku-dogfooding/./node_modules/it-byte-stream/dist/src/errors.js","webpack://waku-dogfooding/./node_modules/it-byte-stream/dist/src/index.js","webpack://waku-dogfooding/./node_modules/it-length-prefixed-stream/dist/src/errors.js","webpack://waku-dogfooding/./node_modules/it-length-prefixed-stream/dist/src/index.js","webpack://waku-dogfooding/./node_modules/it-pair/dist/src/index.js","webpack://waku-dogfooding/./node_modules/@chainsafe/libp2p-noise/dist/src/constants.js","webpack://waku-dogfooding/./node_modules/@noble/ciphers/esm/_assert.js","webpack://waku-dogfooding/./node_modules/@noble/ciphers/esm/utils.js","webpack://waku-dogfooding/./node_modules/@noble/ciphers/esm/_arx.js","webpack://waku-dogfooding/./node_modules/@noble/ciphers/esm/_poly1305.js","webpack://waku-dogfooding/./node_modules/@noble/ciphers/esm/chacha.js","webpack://waku-dogfooding/./node_modules/@noble/hashes/esm/hkdf.js","webpack://waku-dogfooding/./node_modules/@chainsafe/libp2p-noise/dist/src/crypto/index.browser.js","webpack://waku-dogfooding/./node_modules/@chainsafe/libp2p-noise/dist/src/crypto/js.js","webpack://waku-dogfooding/./node_modules/@chainsafe/libp2p-noise/dist/src/encoder.js","webpack://waku-dogfooding/./node_modules/@chainsafe/libp2p-noise/dist/src/logger.js","webpack://waku-dogfooding/./node_modules/@chainsafe/libp2p-noise/dist/src/errors.js","webpack://waku-dogfooding/./node_modules/@chainsafe/libp2p-noise/dist/src/nonce.js","webpack://waku-dogfooding/./node_modules/@chainsafe/libp2p-noise/dist/src/protocol.js","webpack://waku-dogfooding/./node_modules/@chainsafe/libp2p-noise/dist/src/proto/payload.js","webpack://waku-dogfooding/./node_modules/@chainsafe/libp2p-noise/dist/src/utils.js","webpack://waku-dogfooding/./node_modules/@chainsafe/libp2p-noise/dist/src/noise.js","webpack://waku-dogfooding/./node_modules/@chainsafe/libp2p-noise/dist/src/crypto.js","webpack://waku-dogfooding/./node_modules/@chainsafe/libp2p-noise/dist/src/metrics.js","webpack://waku-dogfooding/./node_modules/@chainsafe/libp2p-noise/dist/src/performHandshake.js","webpack://waku-dogfooding/./node_modules/it-pair/dist/src/duplex.js","webpack://waku-dogfooding/./node_modules/@chainsafe/libp2p-noise/dist/src/streaming.js","webpack://waku-dogfooding/./node_modules/@chainsafe/libp2p-noise/dist/src/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/interface/dist/src/peer-discovery/index.js","webpack://waku-dogfooding/./node_modules/@multiformats/mafmt/dist/src/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/bootstrap/dist/src/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/peer-record/dist/src/peer-record/consts.js","webpack://waku-dogfooding/./node_modules/@libp2p/peer-record/dist/src/peer-record/peer-record.js","webpack://waku-dogfooding/./node_modules/@libp2p/peer-record/dist/src/peer-record/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/utils/dist/src/array-equals.js","webpack://waku-dogfooding/./node_modules/@libp2p/peer-record/dist/src/envelope/envelope.js","webpack://waku-dogfooding/./node_modules/@libp2p/peer-record/dist/src/envelope/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/peer-record/dist/src/errors.js","webpack://waku-dogfooding/./node_modules/@multiformats/multiaddr-matcher/dist/src/index.js","webpack://waku-dogfooding/./node_modules/it-protobuf-stream/dist/src/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/identify/dist/src/pb/message.js","webpack://waku-dogfooding/./node_modules/wherearewe/src/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/identify/dist/src/utils.js","webpack://waku-dogfooding/./node_modules/@libp2p/identify/dist/src/consts.js","webpack://waku-dogfooding/./node_modules/@libp2p/identify/dist/src/identify.js","webpack://waku-dogfooding/./node_modules/@libp2p/identify/dist/src/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/utils/dist/src/close-source.js","webpack://waku-dogfooding/./node_modules/get-iterator/dist/src/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/utils/dist/src/is-promise.js","webpack://waku-dogfooding/./node_modules/delay/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/utils/dist/src/rate-limiter.js","webpack://waku-dogfooding/./node_modules/@libp2p/mplex/dist/src/message-types.js","webpack://waku-dogfooding/./node_modules/@libp2p/mplex/dist/src/decode.js","webpack://waku-dogfooding/./node_modules/@libp2p/mplex/dist/src/encode.js","webpack://waku-dogfooding/./node_modules/@libp2p/utils/dist/src/abstract-stream.js","webpack://waku-dogfooding/./node_modules/@libp2p/mplex/dist/src/stream.js","webpack://waku-dogfooding/./node_modules/@libp2p/mplex/dist/src/mplex.js","webpack://waku-dogfooding/./node_modules/@libp2p/mplex/dist/src/index.js","webpack://waku-dogfooding/./node_modules/it-first/dist/src/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/ping/dist/src/constants.js","webpack://waku-dogfooding/./node_modules/@libp2p/ping/dist/src/ping.js","webpack://waku-dogfooding/./node_modules/@libp2p/ping/dist/src/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/interface/dist/src/transport/index.js","webpack://waku-dogfooding/./node_modules/@multiformats/multiaddr-to-uri/dist/src/index.js","webpack://waku-dogfooding/./node_modules/it-ws/dist/src/ready.js","webpack://waku-dogfooding/./node_modules/it-ws/dist/src/sink.js","webpack://waku-dogfooding/./node_modules/it-ws/dist/src/source.js","webpack://waku-dogfooding/./node_modules/it-ws/dist/src/web-socket.browser.js","webpack://waku-dogfooding/./node_modules/it-ws/dist/src/ws-url.js","webpack://waku-dogfooding/./node_modules/it-ws/dist/src/client.js","webpack://waku-dogfooding/./node_modules/it-ws/dist/src/duplex.js","webpack://waku-dogfooding/./node_modules/progress-events/dist/src/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/websockets/dist/src/constants.js","webpack://waku-dogfooding/./node_modules/@libp2p/websockets/dist/src/filters.js","webpack://waku-dogfooding/./node_modules/@libp2p/websockets/dist/src/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/websockets/dist/src/socket-to-conn.js","webpack://waku-dogfooding/./node_modules/@libp2p/websockets/dist/src/listener.browser.js","webpack://waku-dogfooding/./node_modules/@libp2p/interface/dist/src/content-routing/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/interface/dist/src/peer-routing/index.js","webpack://waku-dogfooding/./node_modules/weald/node_modules/ms/dist/index.mjs","webpack://waku-dogfooding/./node_modules/weald/dist/src/browser.js","webpack://waku-dogfooding/./node_modules/weald/dist/src/common.js","webpack://waku-dogfooding/./node_modules/weald/dist/src/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/logger/dist/src/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/peer-collections/dist/src/util.js","webpack://waku-dogfooding/./node_modules/@libp2p/peer-collections/dist/src/set.js","webpack://waku-dogfooding/./node_modules/@libp2p/peer-id-factory/dist/src/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/peer-collections/dist/src/map.js","webpack://waku-dogfooding/./node_modules/p-queue/dist/priority-queue.js","webpack://waku-dogfooding/./node_modules/p-queue/dist/lower-bound.js","webpack://waku-dogfooding/./node_modules/p-queue/dist/index.js","webpack://waku-dogfooding/./node_modules/observable-webworkers/dist/src/index.js","webpack://waku-dogfooding/./node_modules/mortice/dist/src/constants.js","webpack://waku-dogfooding/./node_modules/mortice/dist/src/browser.js","webpack://waku-dogfooding/./node_modules/mortice/dist/src/utils.js","webpack://waku-dogfooding/./node_modules/mortice/dist/src/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/peer-store/dist/src/errors.js","webpack://waku-dogfooding/./node_modules/@libp2p/peer-store/dist/src/pb/peer.js","webpack://waku-dogfooding/./node_modules/@libp2p/peer-store/dist/src/utils/bytes-to-peer.js","webpack://waku-dogfooding/./node_modules/interface-datastore/dist/src/key.js","webpack://waku-dogfooding/./node_modules/@libp2p/peer-store/dist/src/utils/peer-id-to-datastore-key.js","webpack://waku-dogfooding/./node_modules/@libp2p/peer-store/dist/src/utils/dedupe-addresses.js","webpack://waku-dogfooding/./node_modules/@libp2p/peer-store/dist/src/utils/to-peer-pb.js","webpack://waku-dogfooding/./node_modules/@libp2p/peer-store/dist/src/store.js","webpack://waku-dogfooding/./node_modules/@libp2p/peer-store/dist/src/index.js","webpack://waku-dogfooding/./node_modules/it-drain/dist/src/index.js","webpack://waku-dogfooding/./node_modules/it-filter/dist/src/index.js","webpack://waku-dogfooding/./node_modules/it-peekable/dist/src/index.js","webpack://waku-dogfooding/./node_modules/it-sort/dist/src/index.js","webpack://waku-dogfooding/./node_modules/it-take/dist/src/index.js","webpack://waku-dogfooding/./node_modules/datastore-core/dist/src/base.js","webpack://waku-dogfooding/./node_modules/datastore-core/dist/src/memory.js","webpack://waku-dogfooding/./node_modules/datastore-core/dist/src/errors.js","webpack://waku-dogfooding/./node_modules/libp2p/dist/src/address-manager/index.js","webpack://waku-dogfooding/./node_modules/libp2p/dist/src/address-manager/utils.js","webpack://waku-dogfooding/./node_modules/libp2p/dist/src/components.js","webpack://waku-dogfooding/./node_modules/@libp2p/interface/dist/src/startable.js","webpack://waku-dogfooding/./node_modules/@libp2p/utils/dist/src/private-ip.js","webpack://waku-dogfooding/./node_modules/libp2p/dist/src/config/connection-gater.browser.js","webpack://waku-dogfooding/./node_modules/@libp2p/utils/dist/src/multiaddr/is-private.js","webpack://waku-dogfooding/./node_modules/@libp2p/utils/dist/src/address-sort.js","webpack://waku-dogfooding/./node_modules/@multiformats/dns/dist/src/utils/get-types.js","webpack://waku-dogfooding/./node_modules/@multiformats/dns/dist/src/utils/to-dns-response.js","webpack://waku-dogfooding/./node_modules/@multiformats/dns/dist/src/resolvers/dns-json-over-https.js","webpack://waku-dogfooding/./node_modules/@multiformats/dns/dist/src/index.js","webpack://waku-dogfooding/./node_modules/@multiformats/dns/dist/src/utils/cache.js","webpack://waku-dogfooding/./node_modules/@multiformats/dns/dist/src/dns.js","webpack://waku-dogfooding/./node_modules/@multiformats/dns/dist/src/resolvers/default.browser.js","webpack://waku-dogfooding/./node_modules/@multiformats/multiaddr/dist/src/resolvers/dnsaddr.js","webpack://waku-dogfooding/./node_modules/merge-options/index.mjs","webpack://waku-dogfooding/./node_modules/libp2p/dist/src/errors.js","webpack://waku-dogfooding/./node_modules/libp2p/dist/src/config.js","webpack://waku-dogfooding/./node_modules/libp2p/dist/src/get-peer.js","webpack://waku-dogfooding/./node_modules/race-event/dist/src/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/utils/dist/src/queue/recipient.js","webpack://waku-dogfooding/./node_modules/@libp2p/utils/dist/src/queue/job.js","webpack://waku-dogfooding/./node_modules/@libp2p/utils/dist/src/queue/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/utils/dist/src/peer-queue.js","webpack://waku-dogfooding/./node_modules/libp2p/dist/src/connection-manager/constants.browser.js","webpack://waku-dogfooding/./node_modules/libp2p/dist/src/connection-manager/constants.defaults.js","webpack://waku-dogfooding/./node_modules/libp2p/dist/src/connection-manager/auto-dial.js","webpack://waku-dogfooding/./node_modules/@libp2p/utils/dist/src/close.js","webpack://waku-dogfooding/./node_modules/libp2p/dist/src/connection-manager/connection-pruner.js","webpack://waku-dogfooding/./node_modules/@libp2p/utils/dist/src/priority-queue.js","webpack://waku-dogfooding/./node_modules/any-signal/dist/src/index.js","webpack://waku-dogfooding/./node_modules/libp2p/dist/src/connection-manager/dial-queue.js","webpack://waku-dogfooding/./node_modules/libp2p/dist/src/connection-manager/utils.js","webpack://waku-dogfooding/./node_modules/libp2p/dist/src/connection-manager/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/interface/dist/src/peer-store/tags.js","webpack://waku-dogfooding/./node_modules/@libp2p/utils/dist/src/moving-average.js","webpack://waku-dogfooding/./node_modules/@libp2p/utils/dist/src/adaptive-timeout.js","webpack://waku-dogfooding/./node_modules/libp2p/dist/src/connection-monitor.js","webpack://waku-dogfooding/./node_modules/libp2p/dist/src/content-routing.js","webpack://waku-dogfooding/./node_modules/@libp2p/utils/dist/src/filters/fingerprint.js","webpack://waku-dogfooding/./node_modules/@libp2p/utils/dist/src/filters/utils.js","webpack://waku-dogfooding/./node_modules/@libp2p/utils/dist/src/filters/bucket.js","webpack://waku-dogfooding/./node_modules/@sindresorhus/fnv1a/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/utils/dist/src/filters/hashes.js","webpack://waku-dogfooding/./node_modules/@libp2p/utils/dist/src/filters/cuckoo-filter.js","webpack://waku-dogfooding/./node_modules/@libp2p/utils/dist/src/filters/scalable-cuckoo-filter.js","webpack://waku-dogfooding/./node_modules/it-parallel/dist/src/index.js","webpack://waku-dogfooding/./node_modules/libp2p/dist/src/peer-routing.js","webpack://waku-dogfooding/./node_modules/libp2p/dist/src/random-walk.js","webpack://waku-dogfooding/./node_modules/libp2p/dist/src/registrar.js","webpack://waku-dogfooding/./node_modules/@libp2p/utils/dist/src/tracked-map.js","webpack://waku-dogfooding/./node_modules/libp2p/dist/src/transport-manager.js","webpack://waku-dogfooding/./node_modules/@libp2p/multistream-select/dist/src/constants.js","webpack://waku-dogfooding/./node_modules/@libp2p/multistream-select/dist/src/multistream.js","webpack://waku-dogfooding/./node_modules/@libp2p/multistream-select/dist/src/handle.js","webpack://waku-dogfooding/./node_modules/@libp2p/multistream-select/dist/src/select.js","webpack://waku-dogfooding/./node_modules/@libp2p/interface/dist/src/connection/index.js","webpack://waku-dogfooding/./node_modules/libp2p/dist/src/connection/index.js","webpack://waku-dogfooding/./node_modules/libp2p/dist/src/upgrader.js","webpack://waku-dogfooding/./node_modules/libp2p/dist/src/libp2p.js","webpack://waku-dogfooding/./node_modules/libp2p/dist/src/version.js","webpack://waku-dogfooding/./node_modules/@waku/discovery/dist/dns/constants.js","webpack://waku-dogfooding/./node_modules/@noble/secp256k1/lib/esm/index.js","webpack://waku-dogfooding/./node_modules/@waku/enr/dist/crypto.js","webpack://waku-dogfooding/./node_modules/@waku/enr/dist/constants.js","webpack://waku-dogfooding/./node_modules/@waku/enr/dist/get_multiaddr.js","webpack://waku-dogfooding/./node_modules/@waku/enr/dist/multiaddr_from_fields.js","webpack://waku-dogfooding/./node_modules/@waku/enr/dist/multiaddrs_codec.js","webpack://waku-dogfooding/./node_modules/@waku/enr/dist/waku2_codec.js","webpack://waku-dogfooding/./node_modules/@waku/enr/dist/raw_enr.js","webpack://waku-dogfooding/./node_modules/@waku/enr/dist/v4.js","webpack://waku-dogfooding/./node_modules/@waku/enr/dist/enr.js","webpack://waku-dogfooding/./node_modules/@waku/enr/dist/peer_id.js","webpack://waku-dogfooding/./node_modules/@ethersproject/logger/lib.esm/index.js","webpack://waku-dogfooding/./node_modules/@ethersproject/logger/lib.esm/_version.js","webpack://waku-dogfooding/./node_modules/@ethersproject/bytes/lib.esm/_version.js","webpack://waku-dogfooding/./node_modules/@ethersproject/bytes/lib.esm/index.js","webpack://waku-dogfooding/./node_modules/@ethersproject/rlp/lib.esm/_version.js","webpack://waku-dogfooding/./node_modules/@ethersproject/rlp/lib.esm/index.js","webpack://waku-dogfooding/./node_modules/@waku/enr/dist/decoder.js","webpack://waku-dogfooding/./node_modules/@leichtgewicht/ip-codec/index.mjs","webpack://waku-dogfooding/./node_modules/@leichtgewicht/dns-packet/types.mjs","webpack://waku-dogfooding/./node_modules/@leichtgewicht/dns-packet/rcodes.mjs","webpack://waku-dogfooding/./node_modules/@leichtgewicht/dns-packet/opcodes.mjs","webpack://waku-dogfooding/./node_modules/@leichtgewicht/dns-packet/classes.mjs","webpack://waku-dogfooding/./node_modules/@leichtgewicht/dns-packet/optioncodes.mjs","webpack://waku-dogfooding/./node_modules/utf8-codec/index.mjs","webpack://waku-dogfooding/./node_modules/@leichtgewicht/dns-packet/buffer_utils.mjs","webpack://waku-dogfooding/./node_modules/@leichtgewicht/dns-packet/index.mjs","webpack://waku-dogfooding/./node_modules/@leichtgewicht/base64-codec/index.mjs","webpack://waku-dogfooding/./node_modules/dns-query/common.mjs","webpack://waku-dogfooding/./node_modules/dns-query/lib.browser.mjs","webpack://waku-dogfooding/./node_modules/dns-query/index.mjs","webpack://waku-dogfooding/./node_modules/dns-query/resolvers.mjs","webpack://waku-dogfooding/./node_modules/@waku/discovery/dist/dns/dns_over_https.js","webpack://waku-dogfooding/./node_modules/@waku/discovery/dist/dns/enrtree.js","webpack://waku-dogfooding/./node_modules/@waku/discovery/dist/dns/fetch_nodes.js","webpack://waku-dogfooding/./node_modules/@waku/discovery/dist/dns/dns.js","webpack://waku-dogfooding/./node_modules/@waku/discovery/dist/dns/dns_discovery.js","webpack://waku-dogfooding/./node_modules/@waku/discovery/dist/peer-exchange/rpc.js","webpack://waku-dogfooding/./node_modules/@waku/discovery/dist/peer-exchange/waku_peer_exchange.js","webpack://waku-dogfooding/./node_modules/@waku/discovery/dist/peer-exchange/waku_peer_exchange_discovery.js","webpack://waku-dogfooding/./node_modules/@waku/discovery/dist/local-peer-cache/index.js","webpack://waku-dogfooding/./node_modules/@waku/utils/dist/common/index.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/create/libp2p.js","webpack://waku-dogfooding/./node_modules/libp2p/dist/src/index.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/create/create.js","webpack://waku-dogfooding/./node_modules/@waku/utils/dist/common/sharding/type_guards.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/create/discovery.js","webpack://waku-dogfooding/./src/telemetry_client.ts","webpack://waku-dogfooding/./src/util.ts","webpack://waku-dogfooding/./src/index.ts"],"sourcesContent":["\"use strict\";\r\nmodule.exports = asPromise;\r\n\r\n/**\r\n * Callback as used by {@link util.asPromise}.\r\n * @typedef asPromiseCallback\r\n * @type {function}\r\n * @param {Error|null} error Error, if any\r\n * @param {...*} params Additional arguments\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Returns a promise from a node-style callback function.\r\n * @memberof util\r\n * @param {asPromiseCallback} fn Function to call\r\n * @param {*} ctx Function context\r\n * @param {...*} params Function arguments\r\n * @returns {Promise<*>} Promisified function\r\n */\r\nfunction asPromise(fn, ctx/*, varargs */) {\r\n var params = new Array(arguments.length - 1),\r\n offset = 0,\r\n index = 2,\r\n pending = true;\r\n while (index < arguments.length)\r\n params[offset++] = arguments[index++];\r\n return new Promise(function executor(resolve, reject) {\r\n params[offset] = function callback(err/*, varargs */) {\r\n if (pending) {\r\n pending = false;\r\n if (err)\r\n reject(err);\r\n else {\r\n var params = new Array(arguments.length - 1),\r\n offset = 0;\r\n while (offset < params.length)\r\n params[offset++] = arguments[offset];\r\n resolve.apply(null, params);\r\n }\r\n }\r\n };\r\n try {\r\n fn.apply(ctx || null, params);\r\n } catch (err) {\r\n if (pending) {\r\n pending = false;\r\n reject(err);\r\n }\r\n }\r\n });\r\n}\r\n","\"use strict\";\r\n\r\n/**\r\n * A minimal base64 implementation for number arrays.\r\n * @memberof util\r\n * @namespace\r\n */\r\nvar base64 = exports;\r\n\r\n/**\r\n * Calculates the byte length of a base64 encoded string.\r\n * @param {string} string Base64 encoded string\r\n * @returns {number} Byte length\r\n */\r\nbase64.length = function length(string) {\r\n var p = string.length;\r\n if (!p)\r\n return 0;\r\n var n = 0;\r\n while (--p % 4 > 1 && string.charAt(p) === \"=\")\r\n ++n;\r\n return Math.ceil(string.length * 3) / 4 - n;\r\n};\r\n\r\n// Base64 encoding table\r\nvar b64 = new Array(64);\r\n\r\n// Base64 decoding table\r\nvar s64 = new Array(123);\r\n\r\n// 65..90, 97..122, 48..57, 43, 47\r\nfor (var i = 0; i < 64;)\r\n s64[b64[i] = i < 26 ? i + 65 : i < 52 ? i + 71 : i < 62 ? i - 4 : i - 59 | 43] = i++;\r\n\r\n/**\r\n * Encodes a buffer to a base64 encoded string.\r\n * @param {Uint8Array} buffer Source buffer\r\n * @param {number} start Source start\r\n * @param {number} end Source end\r\n * @returns {string} Base64 encoded string\r\n */\r\nbase64.encode = function encode(buffer, start, end) {\r\n var parts = null,\r\n chunk = [];\r\n var i = 0, // output index\r\n j = 0, // goto index\r\n t; // temporary\r\n while (start < end) {\r\n var b = buffer[start++];\r\n switch (j) {\r\n case 0:\r\n chunk[i++] = b64[b >> 2];\r\n t = (b & 3) << 4;\r\n j = 1;\r\n break;\r\n case 1:\r\n chunk[i++] = b64[t | b >> 4];\r\n t = (b & 15) << 2;\r\n j = 2;\r\n break;\r\n case 2:\r\n chunk[i++] = b64[t | b >> 6];\r\n chunk[i++] = b64[b & 63];\r\n j = 0;\r\n break;\r\n }\r\n if (i > 8191) {\r\n (parts || (parts = [])).push(String.fromCharCode.apply(String, chunk));\r\n i = 0;\r\n }\r\n }\r\n if (j) {\r\n chunk[i++] = b64[t];\r\n chunk[i++] = 61;\r\n if (j === 1)\r\n chunk[i++] = 61;\r\n }\r\n if (parts) {\r\n if (i)\r\n parts.push(String.fromCharCode.apply(String, chunk.slice(0, i)));\r\n return parts.join(\"\");\r\n }\r\n return String.fromCharCode.apply(String, chunk.slice(0, i));\r\n};\r\n\r\nvar invalidEncoding = \"invalid encoding\";\r\n\r\n/**\r\n * Decodes a base64 encoded string to a buffer.\r\n * @param {string} string Source string\r\n * @param {Uint8Array} buffer Destination buffer\r\n * @param {number} offset Destination offset\r\n * @returns {number} Number of bytes written\r\n * @throws {Error} If encoding is invalid\r\n */\r\nbase64.decode = function decode(string, buffer, offset) {\r\n var start = offset;\r\n var j = 0, // goto index\r\n t; // temporary\r\n for (var i = 0; i < string.length;) {\r\n var c = string.charCodeAt(i++);\r\n if (c === 61 && j > 1)\r\n break;\r\n if ((c = s64[c]) === undefined)\r\n throw Error(invalidEncoding);\r\n switch (j) {\r\n case 0:\r\n t = c;\r\n j = 1;\r\n break;\r\n case 1:\r\n buffer[offset++] = t << 2 | (c & 48) >> 4;\r\n t = c;\r\n j = 2;\r\n break;\r\n case 2:\r\n buffer[offset++] = (t & 15) << 4 | (c & 60) >> 2;\r\n t = c;\r\n j = 3;\r\n break;\r\n case 3:\r\n buffer[offset++] = (t & 3) << 6 | c;\r\n j = 0;\r\n break;\r\n }\r\n }\r\n if (j === 1)\r\n throw Error(invalidEncoding);\r\n return offset - start;\r\n};\r\n\r\n/**\r\n * Tests if the specified string appears to be base64 encoded.\r\n * @param {string} string String to test\r\n * @returns {boolean} `true` if probably base64 encoded, otherwise false\r\n */\r\nbase64.test = function test(string) {\r\n return /^(?:[A-Za-z0-9+/]{4})*(?:[A-Za-z0-9+/]{2}==|[A-Za-z0-9+/]{3}=)?$/.test(string);\r\n};\r\n","\"use strict\";\r\nmodule.exports = codegen;\r\n\r\n/**\r\n * Begins generating a function.\r\n * @memberof util\r\n * @param {string[]} functionParams Function parameter names\r\n * @param {string} [functionName] Function name if not anonymous\r\n * @returns {Codegen} Appender that appends code to the function's body\r\n */\r\nfunction codegen(functionParams, functionName) {\r\n\r\n /* istanbul ignore if */\r\n if (typeof functionParams === \"string\") {\r\n functionName = functionParams;\r\n functionParams = undefined;\r\n }\r\n\r\n var body = [];\r\n\r\n /**\r\n * Appends code to the function's body or finishes generation.\r\n * @typedef Codegen\r\n * @type {function}\r\n * @param {string|Object.} [formatStringOrScope] Format string or, to finish the function, an object of additional scope variables, if any\r\n * @param {...*} [formatParams] Format parameters\r\n * @returns {Codegen|Function} Itself or the generated function if finished\r\n * @throws {Error} If format parameter counts do not match\r\n */\r\n\r\n function Codegen(formatStringOrScope) {\r\n // note that explicit array handling below makes this ~50% faster\r\n\r\n // finish the function\r\n if (typeof formatStringOrScope !== \"string\") {\r\n var source = toString();\r\n if (codegen.verbose)\r\n console.log(\"codegen: \" + source); // eslint-disable-line no-console\r\n source = \"return \" + source;\r\n if (formatStringOrScope) {\r\n var scopeKeys = Object.keys(formatStringOrScope),\r\n scopeParams = new Array(scopeKeys.length + 1),\r\n scopeValues = new Array(scopeKeys.length),\r\n scopeOffset = 0;\r\n while (scopeOffset < scopeKeys.length) {\r\n scopeParams[scopeOffset] = scopeKeys[scopeOffset];\r\n scopeValues[scopeOffset] = formatStringOrScope[scopeKeys[scopeOffset++]];\r\n }\r\n scopeParams[scopeOffset] = source;\r\n return Function.apply(null, scopeParams).apply(null, scopeValues); // eslint-disable-line no-new-func\r\n }\r\n return Function(source)(); // eslint-disable-line no-new-func\r\n }\r\n\r\n // otherwise append to body\r\n var formatParams = new Array(arguments.length - 1),\r\n formatOffset = 0;\r\n while (formatOffset < formatParams.length)\r\n formatParams[formatOffset] = arguments[++formatOffset];\r\n formatOffset = 0;\r\n formatStringOrScope = formatStringOrScope.replace(/%([%dfijs])/g, function replace($0, $1) {\r\n var value = formatParams[formatOffset++];\r\n switch ($1) {\r\n case \"d\": case \"f\": return String(Number(value));\r\n case \"i\": return String(Math.floor(value));\r\n case \"j\": return JSON.stringify(value);\r\n case \"s\": return String(value);\r\n }\r\n return \"%\";\r\n });\r\n if (formatOffset !== formatParams.length)\r\n throw Error(\"parameter count mismatch\");\r\n body.push(formatStringOrScope);\r\n return Codegen;\r\n }\r\n\r\n function toString(functionNameOverride) {\r\n return \"function \" + (functionNameOverride || functionName || \"\") + \"(\" + (functionParams && functionParams.join(\",\") || \"\") + \"){\\n \" + body.join(\"\\n \") + \"\\n}\";\r\n }\r\n\r\n Codegen.toString = toString;\r\n return Codegen;\r\n}\r\n\r\n/**\r\n * Begins generating a function.\r\n * @memberof util\r\n * @function codegen\r\n * @param {string} [functionName] Function name if not anonymous\r\n * @returns {Codegen} Appender that appends code to the function's body\r\n * @variation 2\r\n */\r\n\r\n/**\r\n * When set to `true`, codegen will log generated code to console. Useful for debugging.\r\n * @name util.codegen.verbose\r\n * @type {boolean}\r\n */\r\ncodegen.verbose = false;\r\n","\"use strict\";\r\nmodule.exports = EventEmitter;\r\n\r\n/**\r\n * Constructs a new event emitter instance.\r\n * @classdesc A minimal event emitter.\r\n * @memberof util\r\n * @constructor\r\n */\r\nfunction EventEmitter() {\r\n\r\n /**\r\n * Registered listeners.\r\n * @type {Object.}\r\n * @private\r\n */\r\n this._listeners = {};\r\n}\r\n\r\n/**\r\n * Registers an event listener.\r\n * @param {string} evt Event name\r\n * @param {function} fn Listener\r\n * @param {*} [ctx] Listener context\r\n * @returns {util.EventEmitter} `this`\r\n */\r\nEventEmitter.prototype.on = function on(evt, fn, ctx) {\r\n (this._listeners[evt] || (this._listeners[evt] = [])).push({\r\n fn : fn,\r\n ctx : ctx || this\r\n });\r\n return this;\r\n};\r\n\r\n/**\r\n * Removes an event listener or any matching listeners if arguments are omitted.\r\n * @param {string} [evt] Event name. Removes all listeners if omitted.\r\n * @param {function} [fn] Listener to remove. Removes all listeners of `evt` if omitted.\r\n * @returns {util.EventEmitter} `this`\r\n */\r\nEventEmitter.prototype.off = function off(evt, fn) {\r\n if (evt === undefined)\r\n this._listeners = {};\r\n else {\r\n if (fn === undefined)\r\n this._listeners[evt] = [];\r\n else {\r\n var listeners = this._listeners[evt];\r\n for (var i = 0; i < listeners.length;)\r\n if (listeners[i].fn === fn)\r\n listeners.splice(i, 1);\r\n else\r\n ++i;\r\n }\r\n }\r\n return this;\r\n};\r\n\r\n/**\r\n * Emits an event by calling its listeners with the specified arguments.\r\n * @param {string} evt Event name\r\n * @param {...*} args Arguments\r\n * @returns {util.EventEmitter} `this`\r\n */\r\nEventEmitter.prototype.emit = function emit(evt) {\r\n var listeners = this._listeners[evt];\r\n if (listeners) {\r\n var args = [],\r\n i = 1;\r\n for (; i < arguments.length;)\r\n args.push(arguments[i++]);\r\n for (i = 0; i < listeners.length;)\r\n listeners[i].fn.apply(listeners[i++].ctx, args);\r\n }\r\n return this;\r\n};\r\n","\"use strict\";\r\nmodule.exports = fetch;\r\n\r\nvar asPromise = require(\"@protobufjs/aspromise\"),\r\n inquire = require(\"@protobufjs/inquire\");\r\n\r\nvar fs = inquire(\"fs\");\r\n\r\n/**\r\n * Node-style callback as used by {@link util.fetch}.\r\n * @typedef FetchCallback\r\n * @type {function}\r\n * @param {?Error} error Error, if any, otherwise `null`\r\n * @param {string} [contents] File contents, if there hasn't been an error\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Options as used by {@link util.fetch}.\r\n * @typedef FetchOptions\r\n * @type {Object}\r\n * @property {boolean} [binary=false] Whether expecting a binary response\r\n * @property {boolean} [xhr=false] If `true`, forces the use of XMLHttpRequest\r\n */\r\n\r\n/**\r\n * Fetches the contents of a file.\r\n * @memberof util\r\n * @param {string} filename File path or url\r\n * @param {FetchOptions} options Fetch options\r\n * @param {FetchCallback} callback Callback function\r\n * @returns {undefined}\r\n */\r\nfunction fetch(filename, options, callback) {\r\n if (typeof options === \"function\") {\r\n callback = options;\r\n options = {};\r\n } else if (!options)\r\n options = {};\r\n\r\n if (!callback)\r\n return asPromise(fetch, this, filename, options); // eslint-disable-line no-invalid-this\r\n\r\n // if a node-like filesystem is present, try it first but fall back to XHR if nothing is found.\r\n if (!options.xhr && fs && fs.readFile)\r\n return fs.readFile(filename, function fetchReadFileCallback(err, contents) {\r\n return err && typeof XMLHttpRequest !== \"undefined\"\r\n ? fetch.xhr(filename, options, callback)\r\n : err\r\n ? callback(err)\r\n : callback(null, options.binary ? contents : contents.toString(\"utf8\"));\r\n });\r\n\r\n // use the XHR version otherwise.\r\n return fetch.xhr(filename, options, callback);\r\n}\r\n\r\n/**\r\n * Fetches the contents of a file.\r\n * @name util.fetch\r\n * @function\r\n * @param {string} path File path or url\r\n * @param {FetchCallback} callback Callback function\r\n * @returns {undefined}\r\n * @variation 2\r\n */\r\n\r\n/**\r\n * Fetches the contents of a file.\r\n * @name util.fetch\r\n * @function\r\n * @param {string} path File path or url\r\n * @param {FetchOptions} [options] Fetch options\r\n * @returns {Promise} Promise\r\n * @variation 3\r\n */\r\n\r\n/**/\r\nfetch.xhr = function fetch_xhr(filename, options, callback) {\r\n var xhr = new XMLHttpRequest();\r\n xhr.onreadystatechange /* works everywhere */ = function fetchOnReadyStateChange() {\r\n\r\n if (xhr.readyState !== 4)\r\n return undefined;\r\n\r\n // local cors security errors return status 0 / empty string, too. afaik this cannot be\r\n // reliably distinguished from an actually empty file for security reasons. feel free\r\n // to send a pull request if you are aware of a solution.\r\n if (xhr.status !== 0 && xhr.status !== 200)\r\n return callback(Error(\"status \" + xhr.status));\r\n\r\n // if binary data is expected, make sure that some sort of array is returned, even if\r\n // ArrayBuffers are not supported. the binary string fallback, however, is unsafe.\r\n if (options.binary) {\r\n var buffer = xhr.response;\r\n if (!buffer) {\r\n buffer = [];\r\n for (var i = 0; i < xhr.responseText.length; ++i)\r\n buffer.push(xhr.responseText.charCodeAt(i) & 255);\r\n }\r\n return callback(null, typeof Uint8Array !== \"undefined\" ? new Uint8Array(buffer) : buffer);\r\n }\r\n return callback(null, xhr.responseText);\r\n };\r\n\r\n if (options.binary) {\r\n // ref: https://developer.mozilla.org/en-US/docs/Web/API/XMLHttpRequest/Sending_and_Receiving_Binary_Data#Receiving_binary_data_in_older_browsers\r\n if (\"overrideMimeType\" in xhr)\r\n xhr.overrideMimeType(\"text/plain; charset=x-user-defined\");\r\n xhr.responseType = \"arraybuffer\";\r\n }\r\n\r\n xhr.open(\"GET\", filename);\r\n xhr.send();\r\n};\r\n","\"use strict\";\r\n\r\nmodule.exports = factory(factory);\r\n\r\n/**\r\n * Reads / writes floats / doubles from / to buffers.\r\n * @name util.float\r\n * @namespace\r\n */\r\n\r\n/**\r\n * Writes a 32 bit float to a buffer using little endian byte order.\r\n * @name util.float.writeFloatLE\r\n * @function\r\n * @param {number} val Value to write\r\n * @param {Uint8Array} buf Target buffer\r\n * @param {number} pos Target buffer offset\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Writes a 32 bit float to a buffer using big endian byte order.\r\n * @name util.float.writeFloatBE\r\n * @function\r\n * @param {number} val Value to write\r\n * @param {Uint8Array} buf Target buffer\r\n * @param {number} pos Target buffer offset\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Reads a 32 bit float from a buffer using little endian byte order.\r\n * @name util.float.readFloatLE\r\n * @function\r\n * @param {Uint8Array} buf Source buffer\r\n * @param {number} pos Source buffer offset\r\n * @returns {number} Value read\r\n */\r\n\r\n/**\r\n * Reads a 32 bit float from a buffer using big endian byte order.\r\n * @name util.float.readFloatBE\r\n * @function\r\n * @param {Uint8Array} buf Source buffer\r\n * @param {number} pos Source buffer offset\r\n * @returns {number} Value read\r\n */\r\n\r\n/**\r\n * Writes a 64 bit double to a buffer using little endian byte order.\r\n * @name util.float.writeDoubleLE\r\n * @function\r\n * @param {number} val Value to write\r\n * @param {Uint8Array} buf Target buffer\r\n * @param {number} pos Target buffer offset\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Writes a 64 bit double to a buffer using big endian byte order.\r\n * @name util.float.writeDoubleBE\r\n * @function\r\n * @param {number} val Value to write\r\n * @param {Uint8Array} buf Target buffer\r\n * @param {number} pos Target buffer offset\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Reads a 64 bit double from a buffer using little endian byte order.\r\n * @name util.float.readDoubleLE\r\n * @function\r\n * @param {Uint8Array} buf Source buffer\r\n * @param {number} pos Source buffer offset\r\n * @returns {number} Value read\r\n */\r\n\r\n/**\r\n * Reads a 64 bit double from a buffer using big endian byte order.\r\n * @name util.float.readDoubleBE\r\n * @function\r\n * @param {Uint8Array} buf Source buffer\r\n * @param {number} pos Source buffer offset\r\n * @returns {number} Value read\r\n */\r\n\r\n// Factory function for the purpose of node-based testing in modified global environments\r\nfunction factory(exports) {\r\n\r\n // float: typed array\r\n if (typeof Float32Array !== \"undefined\") (function() {\r\n\r\n var f32 = new Float32Array([ -0 ]),\r\n f8b = new Uint8Array(f32.buffer),\r\n le = f8b[3] === 128;\r\n\r\n function writeFloat_f32_cpy(val, buf, pos) {\r\n f32[0] = val;\r\n buf[pos ] = f8b[0];\r\n buf[pos + 1] = f8b[1];\r\n buf[pos + 2] = f8b[2];\r\n buf[pos + 3] = f8b[3];\r\n }\r\n\r\n function writeFloat_f32_rev(val, buf, pos) {\r\n f32[0] = val;\r\n buf[pos ] = f8b[3];\r\n buf[pos + 1] = f8b[2];\r\n buf[pos + 2] = f8b[1];\r\n buf[pos + 3] = f8b[0];\r\n }\r\n\r\n /* istanbul ignore next */\r\n exports.writeFloatLE = le ? writeFloat_f32_cpy : writeFloat_f32_rev;\r\n /* istanbul ignore next */\r\n exports.writeFloatBE = le ? writeFloat_f32_rev : writeFloat_f32_cpy;\r\n\r\n function readFloat_f32_cpy(buf, pos) {\r\n f8b[0] = buf[pos ];\r\n f8b[1] = buf[pos + 1];\r\n f8b[2] = buf[pos + 2];\r\n f8b[3] = buf[pos + 3];\r\n return f32[0];\r\n }\r\n\r\n function readFloat_f32_rev(buf, pos) {\r\n f8b[3] = buf[pos ];\r\n f8b[2] = buf[pos + 1];\r\n f8b[1] = buf[pos + 2];\r\n f8b[0] = buf[pos + 3];\r\n return f32[0];\r\n }\r\n\r\n /* istanbul ignore next */\r\n exports.readFloatLE = le ? readFloat_f32_cpy : readFloat_f32_rev;\r\n /* istanbul ignore next */\r\n exports.readFloatBE = le ? readFloat_f32_rev : readFloat_f32_cpy;\r\n\r\n // float: ieee754\r\n })(); else (function() {\r\n\r\n function writeFloat_ieee754(writeUint, val, buf, pos) {\r\n var sign = val < 0 ? 1 : 0;\r\n if (sign)\r\n val = -val;\r\n if (val === 0)\r\n writeUint(1 / val > 0 ? /* positive */ 0 : /* negative 0 */ 2147483648, buf, pos);\r\n else if (isNaN(val))\r\n writeUint(2143289344, buf, pos);\r\n else if (val > 3.4028234663852886e+38) // +-Infinity\r\n writeUint((sign << 31 | 2139095040) >>> 0, buf, pos);\r\n else if (val < 1.1754943508222875e-38) // denormal\r\n writeUint((sign << 31 | Math.round(val / 1.401298464324817e-45)) >>> 0, buf, pos);\r\n else {\r\n var exponent = Math.floor(Math.log(val) / Math.LN2),\r\n mantissa = Math.round(val * Math.pow(2, -exponent) * 8388608) & 8388607;\r\n writeUint((sign << 31 | exponent + 127 << 23 | mantissa) >>> 0, buf, pos);\r\n }\r\n }\r\n\r\n exports.writeFloatLE = writeFloat_ieee754.bind(null, writeUintLE);\r\n exports.writeFloatBE = writeFloat_ieee754.bind(null, writeUintBE);\r\n\r\n function readFloat_ieee754(readUint, buf, pos) {\r\n var uint = readUint(buf, pos),\r\n sign = (uint >> 31) * 2 + 1,\r\n exponent = uint >>> 23 & 255,\r\n mantissa = uint & 8388607;\r\n return exponent === 255\r\n ? mantissa\r\n ? NaN\r\n : sign * Infinity\r\n : exponent === 0 // denormal\r\n ? sign * 1.401298464324817e-45 * mantissa\r\n : sign * Math.pow(2, exponent - 150) * (mantissa + 8388608);\r\n }\r\n\r\n exports.readFloatLE = readFloat_ieee754.bind(null, readUintLE);\r\n exports.readFloatBE = readFloat_ieee754.bind(null, readUintBE);\r\n\r\n })();\r\n\r\n // double: typed array\r\n if (typeof Float64Array !== \"undefined\") (function() {\r\n\r\n var f64 = new Float64Array([-0]),\r\n f8b = new Uint8Array(f64.buffer),\r\n le = f8b[7] === 128;\r\n\r\n function writeDouble_f64_cpy(val, buf, pos) {\r\n f64[0] = val;\r\n buf[pos ] = f8b[0];\r\n buf[pos + 1] = f8b[1];\r\n buf[pos + 2] = f8b[2];\r\n buf[pos + 3] = f8b[3];\r\n buf[pos + 4] = f8b[4];\r\n buf[pos + 5] = f8b[5];\r\n buf[pos + 6] = f8b[6];\r\n buf[pos + 7] = f8b[7];\r\n }\r\n\r\n function writeDouble_f64_rev(val, buf, pos) {\r\n f64[0] = val;\r\n buf[pos ] = f8b[7];\r\n buf[pos + 1] = f8b[6];\r\n buf[pos + 2] = f8b[5];\r\n buf[pos + 3] = f8b[4];\r\n buf[pos + 4] = f8b[3];\r\n buf[pos + 5] = f8b[2];\r\n buf[pos + 6] = f8b[1];\r\n buf[pos + 7] = f8b[0];\r\n }\r\n\r\n /* istanbul ignore next */\r\n exports.writeDoubleLE = le ? writeDouble_f64_cpy : writeDouble_f64_rev;\r\n /* istanbul ignore next */\r\n exports.writeDoubleBE = le ? writeDouble_f64_rev : writeDouble_f64_cpy;\r\n\r\n function readDouble_f64_cpy(buf, pos) {\r\n f8b[0] = buf[pos ];\r\n f8b[1] = buf[pos + 1];\r\n f8b[2] = buf[pos + 2];\r\n f8b[3] = buf[pos + 3];\r\n f8b[4] = buf[pos + 4];\r\n f8b[5] = buf[pos + 5];\r\n f8b[6] = buf[pos + 6];\r\n f8b[7] = buf[pos + 7];\r\n return f64[0];\r\n }\r\n\r\n function readDouble_f64_rev(buf, pos) {\r\n f8b[7] = buf[pos ];\r\n f8b[6] = buf[pos + 1];\r\n f8b[5] = buf[pos + 2];\r\n f8b[4] = buf[pos + 3];\r\n f8b[3] = buf[pos + 4];\r\n f8b[2] = buf[pos + 5];\r\n f8b[1] = buf[pos + 6];\r\n f8b[0] = buf[pos + 7];\r\n return f64[0];\r\n }\r\n\r\n /* istanbul ignore next */\r\n exports.readDoubleLE = le ? readDouble_f64_cpy : readDouble_f64_rev;\r\n /* istanbul ignore next */\r\n exports.readDoubleBE = le ? readDouble_f64_rev : readDouble_f64_cpy;\r\n\r\n // double: ieee754\r\n })(); else (function() {\r\n\r\n function writeDouble_ieee754(writeUint, off0, off1, val, buf, pos) {\r\n var sign = val < 0 ? 1 : 0;\r\n if (sign)\r\n val = -val;\r\n if (val === 0) {\r\n writeUint(0, buf, pos + off0);\r\n writeUint(1 / val > 0 ? /* positive */ 0 : /* negative 0 */ 2147483648, buf, pos + off1);\r\n } else if (isNaN(val)) {\r\n writeUint(0, buf, pos + off0);\r\n writeUint(2146959360, buf, pos + off1);\r\n } else if (val > 1.7976931348623157e+308) { // +-Infinity\r\n writeUint(0, buf, pos + off0);\r\n writeUint((sign << 31 | 2146435072) >>> 0, buf, pos + off1);\r\n } else {\r\n var mantissa;\r\n if (val < 2.2250738585072014e-308) { // denormal\r\n mantissa = val / 5e-324;\r\n writeUint(mantissa >>> 0, buf, pos + off0);\r\n writeUint((sign << 31 | mantissa / 4294967296) >>> 0, buf, pos + off1);\r\n } else {\r\n var exponent = Math.floor(Math.log(val) / Math.LN2);\r\n if (exponent === 1024)\r\n exponent = 1023;\r\n mantissa = val * Math.pow(2, -exponent);\r\n writeUint(mantissa * 4503599627370496 >>> 0, buf, pos + off0);\r\n writeUint((sign << 31 | exponent + 1023 << 20 | mantissa * 1048576 & 1048575) >>> 0, buf, pos + off1);\r\n }\r\n }\r\n }\r\n\r\n exports.writeDoubleLE = writeDouble_ieee754.bind(null, writeUintLE, 0, 4);\r\n exports.writeDoubleBE = writeDouble_ieee754.bind(null, writeUintBE, 4, 0);\r\n\r\n function readDouble_ieee754(readUint, off0, off1, buf, pos) {\r\n var lo = readUint(buf, pos + off0),\r\n hi = readUint(buf, pos + off1);\r\n var sign = (hi >> 31) * 2 + 1,\r\n exponent = hi >>> 20 & 2047,\r\n mantissa = 4294967296 * (hi & 1048575) + lo;\r\n return exponent === 2047\r\n ? mantissa\r\n ? NaN\r\n : sign * Infinity\r\n : exponent === 0 // denormal\r\n ? sign * 5e-324 * mantissa\r\n : sign * Math.pow(2, exponent - 1075) * (mantissa + 4503599627370496);\r\n }\r\n\r\n exports.readDoubleLE = readDouble_ieee754.bind(null, readUintLE, 0, 4);\r\n exports.readDoubleBE = readDouble_ieee754.bind(null, readUintBE, 4, 0);\r\n\r\n })();\r\n\r\n return exports;\r\n}\r\n\r\n// uint helpers\r\n\r\nfunction writeUintLE(val, buf, pos) {\r\n buf[pos ] = val & 255;\r\n buf[pos + 1] = val >>> 8 & 255;\r\n buf[pos + 2] = val >>> 16 & 255;\r\n buf[pos + 3] = val >>> 24;\r\n}\r\n\r\nfunction writeUintBE(val, buf, pos) {\r\n buf[pos ] = val >>> 24;\r\n buf[pos + 1] = val >>> 16 & 255;\r\n buf[pos + 2] = val >>> 8 & 255;\r\n buf[pos + 3] = val & 255;\r\n}\r\n\r\nfunction readUintLE(buf, pos) {\r\n return (buf[pos ]\r\n | buf[pos + 1] << 8\r\n | buf[pos + 2] << 16\r\n | buf[pos + 3] << 24) >>> 0;\r\n}\r\n\r\nfunction readUintBE(buf, pos) {\r\n return (buf[pos ] << 24\r\n | buf[pos + 1] << 16\r\n | buf[pos + 2] << 8\r\n | buf[pos + 3]) >>> 0;\r\n}\r\n","\"use strict\";\r\nmodule.exports = inquire;\r\n\r\n/**\r\n * Requires a module only if available.\r\n * @memberof util\r\n * @param {string} moduleName Module to require\r\n * @returns {?Object} Required module if available and not empty, otherwise `null`\r\n */\r\nfunction inquire(moduleName) {\r\n try {\r\n var mod = eval(\"quire\".replace(/^/,\"re\"))(moduleName); // eslint-disable-line no-eval\r\n if (mod && (mod.length || Object.keys(mod).length))\r\n return mod;\r\n } catch (e) {} // eslint-disable-line no-empty\r\n return null;\r\n}\r\n","\"use strict\";\r\n\r\n/**\r\n * A minimal path module to resolve Unix, Windows and URL paths alike.\r\n * @memberof util\r\n * @namespace\r\n */\r\nvar path = exports;\r\n\r\nvar isAbsolute =\r\n/**\r\n * Tests if the specified path is absolute.\r\n * @param {string} path Path to test\r\n * @returns {boolean} `true` if path is absolute\r\n */\r\npath.isAbsolute = function isAbsolute(path) {\r\n return /^(?:\\/|\\w+:)/.test(path);\r\n};\r\n\r\nvar normalize =\r\n/**\r\n * Normalizes the specified path.\r\n * @param {string} path Path to normalize\r\n * @returns {string} Normalized path\r\n */\r\npath.normalize = function normalize(path) {\r\n path = path.replace(/\\\\/g, \"/\")\r\n .replace(/\\/{2,}/g, \"/\");\r\n var parts = path.split(\"/\"),\r\n absolute = isAbsolute(path),\r\n prefix = \"\";\r\n if (absolute)\r\n prefix = parts.shift() + \"/\";\r\n for (var i = 0; i < parts.length;) {\r\n if (parts[i] === \"..\") {\r\n if (i > 0 && parts[i - 1] !== \"..\")\r\n parts.splice(--i, 2);\r\n else if (absolute)\r\n parts.splice(i, 1);\r\n else\r\n ++i;\r\n } else if (parts[i] === \".\")\r\n parts.splice(i, 1);\r\n else\r\n ++i;\r\n }\r\n return prefix + parts.join(\"/\");\r\n};\r\n\r\n/**\r\n * Resolves the specified include path against the specified origin path.\r\n * @param {string} originPath Path to the origin file\r\n * @param {string} includePath Include path relative to origin path\r\n * @param {boolean} [alreadyNormalized=false] `true` if both paths are already known to be normalized\r\n * @returns {string} Path to the include file\r\n */\r\npath.resolve = function resolve(originPath, includePath, alreadyNormalized) {\r\n if (!alreadyNormalized)\r\n includePath = normalize(includePath);\r\n if (isAbsolute(includePath))\r\n return includePath;\r\n if (!alreadyNormalized)\r\n originPath = normalize(originPath);\r\n return (originPath = originPath.replace(/(?:\\/|^)[^/]+$/, \"\")).length ? normalize(originPath + \"/\" + includePath) : includePath;\r\n};\r\n","\"use strict\";\r\nmodule.exports = pool;\r\n\r\n/**\r\n * An allocator as used by {@link util.pool}.\r\n * @typedef PoolAllocator\r\n * @type {function}\r\n * @param {number} size Buffer size\r\n * @returns {Uint8Array} Buffer\r\n */\r\n\r\n/**\r\n * A slicer as used by {@link util.pool}.\r\n * @typedef PoolSlicer\r\n * @type {function}\r\n * @param {number} start Start offset\r\n * @param {number} end End offset\r\n * @returns {Uint8Array} Buffer slice\r\n * @this {Uint8Array}\r\n */\r\n\r\n/**\r\n * A general purpose buffer pool.\r\n * @memberof util\r\n * @function\r\n * @param {PoolAllocator} alloc Allocator\r\n * @param {PoolSlicer} slice Slicer\r\n * @param {number} [size=8192] Slab size\r\n * @returns {PoolAllocator} Pooled allocator\r\n */\r\nfunction pool(alloc, slice, size) {\r\n var SIZE = size || 8192;\r\n var MAX = SIZE >>> 1;\r\n var slab = null;\r\n var offset = SIZE;\r\n return function pool_alloc(size) {\r\n if (size < 1 || size > MAX)\r\n return alloc(size);\r\n if (offset + size > SIZE) {\r\n slab = alloc(SIZE);\r\n offset = 0;\r\n }\r\n var buf = slice.call(slab, offset, offset += size);\r\n if (offset & 7) // align to 32 bit\r\n offset = (offset | 7) + 1;\r\n return buf;\r\n };\r\n}\r\n","\"use strict\";\r\n\r\n/**\r\n * A minimal UTF8 implementation for number arrays.\r\n * @memberof util\r\n * @namespace\r\n */\r\nvar utf8 = exports;\r\n\r\n/**\r\n * Calculates the UTF8 byte length of a string.\r\n * @param {string} string String\r\n * @returns {number} Byte length\r\n */\r\nutf8.length = function utf8_length(string) {\r\n var len = 0,\r\n c = 0;\r\n for (var i = 0; i < string.length; ++i) {\r\n c = string.charCodeAt(i);\r\n if (c < 128)\r\n len += 1;\r\n else if (c < 2048)\r\n len += 2;\r\n else if ((c & 0xFC00) === 0xD800 && (string.charCodeAt(i + 1) & 0xFC00) === 0xDC00) {\r\n ++i;\r\n len += 4;\r\n } else\r\n len += 3;\r\n }\r\n return len;\r\n};\r\n\r\n/**\r\n * Reads UTF8 bytes as a string.\r\n * @param {Uint8Array} buffer Source buffer\r\n * @param {number} start Source start\r\n * @param {number} end Source end\r\n * @returns {string} String read\r\n */\r\nutf8.read = function utf8_read(buffer, start, end) {\r\n var len = end - start;\r\n if (len < 1)\r\n return \"\";\r\n var parts = null,\r\n chunk = [],\r\n i = 0, // char offset\r\n t; // temporary\r\n while (start < end) {\r\n t = buffer[start++];\r\n if (t < 128)\r\n chunk[i++] = t;\r\n else if (t > 191 && t < 224)\r\n chunk[i++] = (t & 31) << 6 | buffer[start++] & 63;\r\n else if (t > 239 && t < 365) {\r\n t = ((t & 7) << 18 | (buffer[start++] & 63) << 12 | (buffer[start++] & 63) << 6 | buffer[start++] & 63) - 0x10000;\r\n chunk[i++] = 0xD800 + (t >> 10);\r\n chunk[i++] = 0xDC00 + (t & 1023);\r\n } else\r\n chunk[i++] = (t & 15) << 12 | (buffer[start++] & 63) << 6 | buffer[start++] & 63;\r\n if (i > 8191) {\r\n (parts || (parts = [])).push(String.fromCharCode.apply(String, chunk));\r\n i = 0;\r\n }\r\n }\r\n if (parts) {\r\n if (i)\r\n parts.push(String.fromCharCode.apply(String, chunk.slice(0, i)));\r\n return parts.join(\"\");\r\n }\r\n return String.fromCharCode.apply(String, chunk.slice(0, i));\r\n};\r\n\r\n/**\r\n * Writes a string as UTF8 bytes.\r\n * @param {string} string Source string\r\n * @param {Uint8Array} buffer Destination buffer\r\n * @param {number} offset Destination offset\r\n * @returns {number} Bytes written\r\n */\r\nutf8.write = function utf8_write(string, buffer, offset) {\r\n var start = offset,\r\n c1, // character 1\r\n c2; // character 2\r\n for (var i = 0; i < string.length; ++i) {\r\n c1 = string.charCodeAt(i);\r\n if (c1 < 128) {\r\n buffer[offset++] = c1;\r\n } else if (c1 < 2048) {\r\n buffer[offset++] = c1 >> 6 | 192;\r\n buffer[offset++] = c1 & 63 | 128;\r\n } else if ((c1 & 0xFC00) === 0xD800 && ((c2 = string.charCodeAt(i + 1)) & 0xFC00) === 0xDC00) {\r\n c1 = 0x10000 + ((c1 & 0x03FF) << 10) + (c2 & 0x03FF);\r\n ++i;\r\n buffer[offset++] = c1 >> 18 | 240;\r\n buffer[offset++] = c1 >> 12 & 63 | 128;\r\n buffer[offset++] = c1 >> 6 & 63 | 128;\r\n buffer[offset++] = c1 & 63 | 128;\r\n } else {\r\n buffer[offset++] = c1 >> 12 | 224;\r\n buffer[offset++] = c1 >> 6 & 63 | 128;\r\n buffer[offset++] = c1 & 63 | 128;\r\n }\r\n }\r\n return offset - start;\r\n};\r\n","/* eslint-env browser */\n\n/**\n * This is the web browser implementation of `debug()`.\n */\n\nexports.formatArgs = formatArgs;\nexports.save = save;\nexports.load = load;\nexports.useColors = useColors;\nexports.storage = localstorage();\nexports.destroy = (() => {\n\tlet warned = false;\n\n\treturn () => {\n\t\tif (!warned) {\n\t\t\twarned = true;\n\t\t\tconsole.warn('Instance method `debug.destroy()` is deprecated and no longer does anything. It will be removed in the next major version of `debug`.');\n\t\t}\n\t};\n})();\n\n/**\n * Colors.\n */\n\nexports.colors = [\n\t'#0000CC',\n\t'#0000FF',\n\t'#0033CC',\n\t'#0033FF',\n\t'#0066CC',\n\t'#0066FF',\n\t'#0099CC',\n\t'#0099FF',\n\t'#00CC00',\n\t'#00CC33',\n\t'#00CC66',\n\t'#00CC99',\n\t'#00CCCC',\n\t'#00CCFF',\n\t'#3300CC',\n\t'#3300FF',\n\t'#3333CC',\n\t'#3333FF',\n\t'#3366CC',\n\t'#3366FF',\n\t'#3399CC',\n\t'#3399FF',\n\t'#33CC00',\n\t'#33CC33',\n\t'#33CC66',\n\t'#33CC99',\n\t'#33CCCC',\n\t'#33CCFF',\n\t'#6600CC',\n\t'#6600FF',\n\t'#6633CC',\n\t'#6633FF',\n\t'#66CC00',\n\t'#66CC33',\n\t'#9900CC',\n\t'#9900FF',\n\t'#9933CC',\n\t'#9933FF',\n\t'#99CC00',\n\t'#99CC33',\n\t'#CC0000',\n\t'#CC0033',\n\t'#CC0066',\n\t'#CC0099',\n\t'#CC00CC',\n\t'#CC00FF',\n\t'#CC3300',\n\t'#CC3333',\n\t'#CC3366',\n\t'#CC3399',\n\t'#CC33CC',\n\t'#CC33FF',\n\t'#CC6600',\n\t'#CC6633',\n\t'#CC9900',\n\t'#CC9933',\n\t'#CCCC00',\n\t'#CCCC33',\n\t'#FF0000',\n\t'#FF0033',\n\t'#FF0066',\n\t'#FF0099',\n\t'#FF00CC',\n\t'#FF00FF',\n\t'#FF3300',\n\t'#FF3333',\n\t'#FF3366',\n\t'#FF3399',\n\t'#FF33CC',\n\t'#FF33FF',\n\t'#FF6600',\n\t'#FF6633',\n\t'#FF9900',\n\t'#FF9933',\n\t'#FFCC00',\n\t'#FFCC33'\n];\n\n/**\n * Currently only WebKit-based Web Inspectors, Firefox >= v31,\n * and the Firebug extension (any Firefox version) are known\n * to support \"%c\" CSS customizations.\n *\n * TODO: add a `localStorage` variable to explicitly enable/disable colors\n */\n\n// eslint-disable-next-line complexity\nfunction useColors() {\n\t// NB: In an Electron preload script, document will be defined but not fully\n\t// initialized. Since we know we're in Chrome, we'll just detect this case\n\t// explicitly\n\tif (typeof window !== 'undefined' && window.process && (window.process.type === 'renderer' || window.process.__nwjs)) {\n\t\treturn true;\n\t}\n\n\t// Internet Explorer and Edge do not support colors.\n\tif (typeof navigator !== 'undefined' && navigator.userAgent && navigator.userAgent.toLowerCase().match(/(edge|trident)\\/(\\d+)/)) {\n\t\treturn false;\n\t}\n\n\t// Is webkit? http://stackoverflow.com/a/16459606/376773\n\t// document is undefined in react-native: https://github.com/facebook/react-native/pull/1632\n\treturn (typeof document !== 'undefined' && document.documentElement && document.documentElement.style && document.documentElement.style.WebkitAppearance) ||\n\t\t// Is firebug? http://stackoverflow.com/a/398120/376773\n\t\t(typeof window !== 'undefined' && window.console && (window.console.firebug || (window.console.exception && window.console.table))) ||\n\t\t// Is firefox >= v31?\n\t\t// https://developer.mozilla.org/en-US/docs/Tools/Web_Console#Styling_messages\n\t\t(typeof navigator !== 'undefined' && navigator.userAgent && navigator.userAgent.toLowerCase().match(/firefox\\/(\\d+)/) && parseInt(RegExp.$1, 10) >= 31) ||\n\t\t// Double check webkit in userAgent just in case we are in a worker\n\t\t(typeof navigator !== 'undefined' && navigator.userAgent && navigator.userAgent.toLowerCase().match(/applewebkit\\/(\\d+)/));\n}\n\n/**\n * Colorize log arguments if enabled.\n *\n * @api public\n */\n\nfunction formatArgs(args) {\n\targs[0] = (this.useColors ? '%c' : '') +\n\t\tthis.namespace +\n\t\t(this.useColors ? ' %c' : ' ') +\n\t\targs[0] +\n\t\t(this.useColors ? '%c ' : ' ') +\n\t\t'+' + module.exports.humanize(this.diff);\n\n\tif (!this.useColors) {\n\t\treturn;\n\t}\n\n\tconst c = 'color: ' + this.color;\n\targs.splice(1, 0, c, 'color: inherit');\n\n\t// The final \"%c\" is somewhat tricky, because there could be other\n\t// arguments passed either before or after the %c, so we need to\n\t// figure out the correct index to insert the CSS into\n\tlet index = 0;\n\tlet lastC = 0;\n\targs[0].replace(/%[a-zA-Z%]/g, match => {\n\t\tif (match === '%%') {\n\t\t\treturn;\n\t\t}\n\t\tindex++;\n\t\tif (match === '%c') {\n\t\t\t// We only are interested in the *last* %c\n\t\t\t// (the user may have provided their own)\n\t\t\tlastC = index;\n\t\t}\n\t});\n\n\targs.splice(lastC, 0, c);\n}\n\n/**\n * Invokes `console.debug()` when available.\n * No-op when `console.debug` is not a \"function\".\n * If `console.debug` is not available, falls back\n * to `console.log`.\n *\n * @api public\n */\nexports.log = console.debug || console.log || (() => {});\n\n/**\n * Save `namespaces`.\n *\n * @param {String} namespaces\n * @api private\n */\nfunction save(namespaces) {\n\ttry {\n\t\tif (namespaces) {\n\t\t\texports.storage.setItem('debug', namespaces);\n\t\t} else {\n\t\t\texports.storage.removeItem('debug');\n\t\t}\n\t} catch (error) {\n\t\t// Swallow\n\t\t// XXX (@Qix-) should we be logging these?\n\t}\n}\n\n/**\n * Load `namespaces`.\n *\n * @return {String} returns the previously persisted debug modes\n * @api private\n */\nfunction load() {\n\tlet r;\n\ttry {\n\t\tr = exports.storage.getItem('debug');\n\t} catch (error) {\n\t\t// Swallow\n\t\t// XXX (@Qix-) should we be logging these?\n\t}\n\n\t// If debug isn't set in LS, and we're in Electron, try to load $DEBUG\n\tif (!r && typeof process !== 'undefined' && 'env' in process) {\n\t\tr = process.env.DEBUG;\n\t}\n\n\treturn r;\n}\n\n/**\n * Localstorage attempts to return the localstorage.\n *\n * This is necessary because safari throws\n * when a user disables cookies/localstorage\n * and you attempt to access it.\n *\n * @return {LocalStorage}\n * @api private\n */\n\nfunction localstorage() {\n\ttry {\n\t\t// TVMLKit (Apple TV JS Runtime) does not have a window object, just localStorage in the global context\n\t\t// The Browser also has localStorage in the global context.\n\t\treturn localStorage;\n\t} catch (error) {\n\t\t// Swallow\n\t\t// XXX (@Qix-) should we be logging these?\n\t}\n}\n\nmodule.exports = require('./common')(exports);\n\nconst {formatters} = module.exports;\n\n/**\n * Map %j to `JSON.stringify()`, since no Web Inspectors do that by default.\n */\n\nformatters.j = function (v) {\n\ttry {\n\t\treturn JSON.stringify(v);\n\t} catch (error) {\n\t\treturn '[UnexpectedJSONParseError]: ' + error.message;\n\t}\n};\n","\n/**\n * This is the common logic for both the Node.js and web browser\n * implementations of `debug()`.\n */\n\nfunction setup(env) {\n\tcreateDebug.debug = createDebug;\n\tcreateDebug.default = createDebug;\n\tcreateDebug.coerce = coerce;\n\tcreateDebug.disable = disable;\n\tcreateDebug.enable = enable;\n\tcreateDebug.enabled = enabled;\n\tcreateDebug.humanize = require('ms');\n\tcreateDebug.destroy = destroy;\n\n\tObject.keys(env).forEach(key => {\n\t\tcreateDebug[key] = env[key];\n\t});\n\n\t/**\n\t* The currently active debug mode names, and names to skip.\n\t*/\n\n\tcreateDebug.names = [];\n\tcreateDebug.skips = [];\n\n\t/**\n\t* Map of special \"%n\" handling functions, for the debug \"format\" argument.\n\t*\n\t* Valid key names are a single, lower or upper-case letter, i.e. \"n\" and \"N\".\n\t*/\n\tcreateDebug.formatters = {};\n\n\t/**\n\t* Selects a color for a debug namespace\n\t* @param {String} namespace The namespace string for the debug instance to be colored\n\t* @return {Number|String} An ANSI color code for the given namespace\n\t* @api private\n\t*/\n\tfunction selectColor(namespace) {\n\t\tlet hash = 0;\n\n\t\tfor (let i = 0; i < namespace.length; i++) {\n\t\t\thash = ((hash << 5) - hash) + namespace.charCodeAt(i);\n\t\t\thash |= 0; // Convert to 32bit integer\n\t\t}\n\n\t\treturn createDebug.colors[Math.abs(hash) % createDebug.colors.length];\n\t}\n\tcreateDebug.selectColor = selectColor;\n\n\t/**\n\t* Create a debugger with the given `namespace`.\n\t*\n\t* @param {String} namespace\n\t* @return {Function}\n\t* @api public\n\t*/\n\tfunction createDebug(namespace) {\n\t\tlet prevTime;\n\t\tlet enableOverride = null;\n\t\tlet namespacesCache;\n\t\tlet enabledCache;\n\n\t\tfunction debug(...args) {\n\t\t\t// Disabled?\n\t\t\tif (!debug.enabled) {\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tconst self = debug;\n\n\t\t\t// Set `diff` timestamp\n\t\t\tconst curr = Number(new Date());\n\t\t\tconst ms = curr - (prevTime || curr);\n\t\t\tself.diff = ms;\n\t\t\tself.prev = prevTime;\n\t\t\tself.curr = curr;\n\t\t\tprevTime = curr;\n\n\t\t\targs[0] = createDebug.coerce(args[0]);\n\n\t\t\tif (typeof args[0] !== 'string') {\n\t\t\t\t// Anything else let's inspect with %O\n\t\t\t\targs.unshift('%O');\n\t\t\t}\n\n\t\t\t// Apply any `formatters` transformations\n\t\t\tlet index = 0;\n\t\t\targs[0] = args[0].replace(/%([a-zA-Z%])/g, (match, format) => {\n\t\t\t\t// If we encounter an escaped % then don't increase the array index\n\t\t\t\tif (match === '%%') {\n\t\t\t\t\treturn '%';\n\t\t\t\t}\n\t\t\t\tindex++;\n\t\t\t\tconst formatter = createDebug.formatters[format];\n\t\t\t\tif (typeof formatter === 'function') {\n\t\t\t\t\tconst val = args[index];\n\t\t\t\t\tmatch = formatter.call(self, val);\n\n\t\t\t\t\t// Now we need to remove `args[index]` since it's inlined in the `format`\n\t\t\t\t\targs.splice(index, 1);\n\t\t\t\t\tindex--;\n\t\t\t\t}\n\t\t\t\treturn match;\n\t\t\t});\n\n\t\t\t// Apply env-specific formatting (colors, etc.)\n\t\t\tcreateDebug.formatArgs.call(self, args);\n\n\t\t\tconst logFn = self.log || createDebug.log;\n\t\t\tlogFn.apply(self, args);\n\t\t}\n\n\t\tdebug.namespace = namespace;\n\t\tdebug.useColors = createDebug.useColors();\n\t\tdebug.color = createDebug.selectColor(namespace);\n\t\tdebug.extend = extend;\n\t\tdebug.destroy = createDebug.destroy; // XXX Temporary. Will be removed in the next major release.\n\n\t\tObject.defineProperty(debug, 'enabled', {\n\t\t\tenumerable: true,\n\t\t\tconfigurable: false,\n\t\t\tget: () => {\n\t\t\t\tif (enableOverride !== null) {\n\t\t\t\t\treturn enableOverride;\n\t\t\t\t}\n\t\t\t\tif (namespacesCache !== createDebug.namespaces) {\n\t\t\t\t\tnamespacesCache = createDebug.namespaces;\n\t\t\t\t\tenabledCache = createDebug.enabled(namespace);\n\t\t\t\t}\n\n\t\t\t\treturn enabledCache;\n\t\t\t},\n\t\t\tset: v => {\n\t\t\t\tenableOverride = v;\n\t\t\t}\n\t\t});\n\n\t\t// Env-specific initialization logic for debug instances\n\t\tif (typeof createDebug.init === 'function') {\n\t\t\tcreateDebug.init(debug);\n\t\t}\n\n\t\treturn debug;\n\t}\n\n\tfunction extend(namespace, delimiter) {\n\t\tconst newDebug = createDebug(this.namespace + (typeof delimiter === 'undefined' ? ':' : delimiter) + namespace);\n\t\tnewDebug.log = this.log;\n\t\treturn newDebug;\n\t}\n\n\t/**\n\t* Enables a debug mode by namespaces. This can include modes\n\t* separated by a colon and wildcards.\n\t*\n\t* @param {String} namespaces\n\t* @api public\n\t*/\n\tfunction enable(namespaces) {\n\t\tcreateDebug.save(namespaces);\n\t\tcreateDebug.namespaces = namespaces;\n\n\t\tcreateDebug.names = [];\n\t\tcreateDebug.skips = [];\n\n\t\tlet i;\n\t\tconst split = (typeof namespaces === 'string' ? namespaces : '').split(/[\\s,]+/);\n\t\tconst len = split.length;\n\n\t\tfor (i = 0; i < len; i++) {\n\t\t\tif (!split[i]) {\n\t\t\t\t// ignore empty strings\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tnamespaces = split[i].replace(/\\*/g, '.*?');\n\n\t\t\tif (namespaces[0] === '-') {\n\t\t\t\tcreateDebug.skips.push(new RegExp('^' + namespaces.slice(1) + '$'));\n\t\t\t} else {\n\t\t\t\tcreateDebug.names.push(new RegExp('^' + namespaces + '$'));\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t* Disable debug output.\n\t*\n\t* @return {String} namespaces\n\t* @api public\n\t*/\n\tfunction disable() {\n\t\tconst namespaces = [\n\t\t\t...createDebug.names.map(toNamespace),\n\t\t\t...createDebug.skips.map(toNamespace).map(namespace => '-' + namespace)\n\t\t].join(',');\n\t\tcreateDebug.enable('');\n\t\treturn namespaces;\n\t}\n\n\t/**\n\t* Returns true if the given mode name is enabled, false otherwise.\n\t*\n\t* @param {String} name\n\t* @return {Boolean}\n\t* @api public\n\t*/\n\tfunction enabled(name) {\n\t\tif (name[name.length - 1] === '*') {\n\t\t\treturn true;\n\t\t}\n\n\t\tlet i;\n\t\tlet len;\n\n\t\tfor (i = 0, len = createDebug.skips.length; i < len; i++) {\n\t\t\tif (createDebug.skips[i].test(name)) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\tfor (i = 0, len = createDebug.names.length; i < len; i++) {\n\t\t\tif (createDebug.names[i].test(name)) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\n\t\treturn false;\n\t}\n\n\t/**\n\t* Convert regexp to namespace\n\t*\n\t* @param {RegExp} regxep\n\t* @return {String} namespace\n\t* @api private\n\t*/\n\tfunction toNamespace(regexp) {\n\t\treturn regexp.toString()\n\t\t\t.substring(2, regexp.toString().length - 2)\n\t\t\t.replace(/\\.\\*\\?$/, '*');\n\t}\n\n\t/**\n\t* Coerce `val`.\n\t*\n\t* @param {Mixed} val\n\t* @return {Mixed}\n\t* @api private\n\t*/\n\tfunction coerce(val) {\n\t\tif (val instanceof Error) {\n\t\t\treturn val.stack || val.message;\n\t\t}\n\t\treturn val;\n\t}\n\n\t/**\n\t* XXX DO NOT USE. This is a temporary stub function.\n\t* XXX It WILL be removed in the next major release.\n\t*/\n\tfunction destroy() {\n\t\tconsole.warn('Instance method `debug.destroy()` is deprecated and no longer does anything. It will be removed in the next major version of `debug`.');\n\t}\n\n\tcreateDebug.enable(createDebug.load());\n\n\treturn createDebug;\n}\n\nmodule.exports = setup;\n","'use strict';\n\n/**\n * @typedef {{ [key: string]: any }} Extensions\n * @typedef {Error} Err\n * @property {string} message\n */\n\n/**\n *\n * @param {Error} obj\n * @param {Extensions} props\n * @returns {Error & Extensions}\n */\nfunction assign(obj, props) {\n for (const key in props) {\n Object.defineProperty(obj, key, {\n value: props[key],\n enumerable: true,\n configurable: true,\n });\n }\n\n return obj;\n}\n\n/**\n *\n * @param {any} err - An Error\n * @param {string|Extensions} code - A string code or props to set on the error\n * @param {Extensions} [props] - Props to set on the error\n * @returns {Error & Extensions}\n */\nfunction createError(err, code, props) {\n if (!err || typeof err === 'string') {\n throw new TypeError('Please pass an Error to err-code');\n }\n\n if (!props) {\n props = {};\n }\n\n if (typeof code === 'object') {\n props = code;\n code = '';\n }\n\n if (code) {\n props.code = code;\n }\n\n try {\n return assign(err, props);\n } catch (_) {\n props.message = err.message;\n props.stack = err.stack;\n\n const ErrClass = function () {};\n\n ErrClass.prototype = Object.create(Object.getPrototypeOf(err));\n\n // @ts-ignore\n const output = assign(new ErrClass(), props);\n\n return output;\n }\n}\n\nmodule.exports = createError;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst event_iterator_1 = require(\"./event-iterator\");\nexports.EventIterator = event_iterator_1.EventIterator;\nfunction subscribe(event, options, evOptions) {\n return new event_iterator_1.EventIterator(({ push }) => {\n this.addEventListener(event, push, options);\n return () => this.removeEventListener(event, push, options);\n }, evOptions);\n}\nexports.subscribe = subscribe;\nexports.default = event_iterator_1.EventIterator;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nclass EventQueue {\n constructor() {\n this.pullQueue = [];\n this.pushQueue = [];\n this.eventHandlers = {};\n this.isPaused = false;\n this.isStopped = false;\n }\n push(value) {\n if (this.isStopped)\n return;\n const resolution = { value, done: false };\n if (this.pullQueue.length) {\n const placeholder = this.pullQueue.shift();\n if (placeholder)\n placeholder.resolve(resolution);\n }\n else {\n this.pushQueue.push(Promise.resolve(resolution));\n if (this.highWaterMark !== undefined &&\n this.pushQueue.length >= this.highWaterMark &&\n !this.isPaused) {\n this.isPaused = true;\n if (this.eventHandlers.highWater) {\n this.eventHandlers.highWater();\n }\n else if (console) {\n console.warn(`EventIterator queue reached ${this.pushQueue.length} items`);\n }\n }\n }\n }\n stop() {\n if (this.isStopped)\n return;\n this.isStopped = true;\n this.remove();\n for (const placeholder of this.pullQueue) {\n placeholder.resolve({ value: undefined, done: true });\n }\n this.pullQueue.length = 0;\n }\n fail(error) {\n if (this.isStopped)\n return;\n this.isStopped = true;\n this.remove();\n if (this.pullQueue.length) {\n for (const placeholder of this.pullQueue) {\n placeholder.reject(error);\n }\n this.pullQueue.length = 0;\n }\n else {\n const rejection = Promise.reject(error);\n /* Attach error handler to avoid leaking an unhandled promise rejection. */\n rejection.catch(() => { });\n this.pushQueue.push(rejection);\n }\n }\n remove() {\n Promise.resolve().then(() => {\n if (this.removeCallback)\n this.removeCallback();\n });\n }\n [Symbol.asyncIterator]() {\n return {\n next: (value) => {\n const result = this.pushQueue.shift();\n if (result) {\n if (this.lowWaterMark !== undefined &&\n this.pushQueue.length <= this.lowWaterMark &&\n this.isPaused) {\n this.isPaused = false;\n if (this.eventHandlers.lowWater) {\n this.eventHandlers.lowWater();\n }\n }\n return result;\n }\n else if (this.isStopped) {\n return Promise.resolve({ value: undefined, done: true });\n }\n else {\n return new Promise((resolve, reject) => {\n this.pullQueue.push({ resolve, reject });\n });\n }\n },\n return: () => {\n this.isStopped = true;\n this.pushQueue.length = 0;\n this.remove();\n return Promise.resolve({ value: undefined, done: true });\n },\n };\n }\n}\nclass EventIterator {\n constructor(listen, { highWaterMark = 100, lowWaterMark = 1 } = {}) {\n const queue = new EventQueue();\n queue.highWaterMark = highWaterMark;\n queue.lowWaterMark = lowWaterMark;\n queue.removeCallback =\n listen({\n push: value => queue.push(value),\n stop: () => queue.stop(),\n fail: error => queue.fail(error),\n on: (event, fn) => {\n queue.eventHandlers[event] = fn;\n },\n }) || (() => { });\n this[Symbol.asyncIterator] = () => queue[Symbol.asyncIterator]();\n Object.freeze(this);\n }\n}\nexports.EventIterator = EventIterator;\nexports.default = EventIterator;\n","'use strict';\n\nvar has = Object.prototype.hasOwnProperty\n , prefix = '~';\n\n/**\n * Constructor to create a storage for our `EE` objects.\n * An `Events` instance is a plain object whose properties are event names.\n *\n * @constructor\n * @private\n */\nfunction Events() {}\n\n//\n// We try to not inherit from `Object.prototype`. In some engines creating an\n// instance in this way is faster than calling `Object.create(null)` directly.\n// If `Object.create(null)` is not supported we prefix the event names with a\n// character to make sure that the built-in object properties are not\n// overridden or used as an attack vector.\n//\nif (Object.create) {\n Events.prototype = Object.create(null);\n\n //\n // This hack is needed because the `__proto__` property is still inherited in\n // some old browsers like Android 4, iPhone 5.1, Opera 11 and Safari 5.\n //\n if (!new Events().__proto__) prefix = false;\n}\n\n/**\n * Representation of a single event listener.\n *\n * @param {Function} fn The listener function.\n * @param {*} context The context to invoke the listener with.\n * @param {Boolean} [once=false] Specify if the listener is a one-time listener.\n * @constructor\n * @private\n */\nfunction EE(fn, context, once) {\n this.fn = fn;\n this.context = context;\n this.once = once || false;\n}\n\n/**\n * Add a listener for a given event.\n *\n * @param {EventEmitter} emitter Reference to the `EventEmitter` instance.\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} context The context to invoke the listener with.\n * @param {Boolean} once Specify if the listener is a one-time listener.\n * @returns {EventEmitter}\n * @private\n */\nfunction addListener(emitter, event, fn, context, once) {\n if (typeof fn !== 'function') {\n throw new TypeError('The listener must be a function');\n }\n\n var listener = new EE(fn, context || emitter, once)\n , evt = prefix ? prefix + event : event;\n\n if (!emitter._events[evt]) emitter._events[evt] = listener, emitter._eventsCount++;\n else if (!emitter._events[evt].fn) emitter._events[evt].push(listener);\n else emitter._events[evt] = [emitter._events[evt], listener];\n\n return emitter;\n}\n\n/**\n * Clear event by name.\n *\n * @param {EventEmitter} emitter Reference to the `EventEmitter` instance.\n * @param {(String|Symbol)} evt The Event name.\n * @private\n */\nfunction clearEvent(emitter, evt) {\n if (--emitter._eventsCount === 0) emitter._events = new Events();\n else delete emitter._events[evt];\n}\n\n/**\n * Minimal `EventEmitter` interface that is molded against the Node.js\n * `EventEmitter` interface.\n *\n * @constructor\n * @public\n */\nfunction EventEmitter() {\n this._events = new Events();\n this._eventsCount = 0;\n}\n\n/**\n * Return an array listing the events for which the emitter has registered\n * listeners.\n *\n * @returns {Array}\n * @public\n */\nEventEmitter.prototype.eventNames = function eventNames() {\n var names = []\n , events\n , name;\n\n if (this._eventsCount === 0) return names;\n\n for (name in (events = this._events)) {\n if (has.call(events, name)) names.push(prefix ? name.slice(1) : name);\n }\n\n if (Object.getOwnPropertySymbols) {\n return names.concat(Object.getOwnPropertySymbols(events));\n }\n\n return names;\n};\n\n/**\n * Return the listeners registered for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Array} The registered listeners.\n * @public\n */\nEventEmitter.prototype.listeners = function listeners(event) {\n var evt = prefix ? prefix + event : event\n , handlers = this._events[evt];\n\n if (!handlers) return [];\n if (handlers.fn) return [handlers.fn];\n\n for (var i = 0, l = handlers.length, ee = new Array(l); i < l; i++) {\n ee[i] = handlers[i].fn;\n }\n\n return ee;\n};\n\n/**\n * Return the number of listeners listening to a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Number} The number of listeners.\n * @public\n */\nEventEmitter.prototype.listenerCount = function listenerCount(event) {\n var evt = prefix ? prefix + event : event\n , listeners = this._events[evt];\n\n if (!listeners) return 0;\n if (listeners.fn) return 1;\n return listeners.length;\n};\n\n/**\n * Calls each of the listeners registered for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Boolean} `true` if the event had listeners, else `false`.\n * @public\n */\nEventEmitter.prototype.emit = function emit(event, a1, a2, a3, a4, a5) {\n var evt = prefix ? prefix + event : event;\n\n if (!this._events[evt]) return false;\n\n var listeners = this._events[evt]\n , len = arguments.length\n , args\n , i;\n\n if (listeners.fn) {\n if (listeners.once) this.removeListener(event, listeners.fn, undefined, true);\n\n switch (len) {\n case 1: return listeners.fn.call(listeners.context), true;\n case 2: return listeners.fn.call(listeners.context, a1), true;\n case 3: return listeners.fn.call(listeners.context, a1, a2), true;\n case 4: return listeners.fn.call(listeners.context, a1, a2, a3), true;\n case 5: return listeners.fn.call(listeners.context, a1, a2, a3, a4), true;\n case 6: return listeners.fn.call(listeners.context, a1, a2, a3, a4, a5), true;\n }\n\n for (i = 1, args = new Array(len -1); i < len; i++) {\n args[i - 1] = arguments[i];\n }\n\n listeners.fn.apply(listeners.context, args);\n } else {\n var length = listeners.length\n , j;\n\n for (i = 0; i < length; i++) {\n if (listeners[i].once) this.removeListener(event, listeners[i].fn, undefined, true);\n\n switch (len) {\n case 1: listeners[i].fn.call(listeners[i].context); break;\n case 2: listeners[i].fn.call(listeners[i].context, a1); break;\n case 3: listeners[i].fn.call(listeners[i].context, a1, a2); break;\n case 4: listeners[i].fn.call(listeners[i].context, a1, a2, a3); break;\n default:\n if (!args) for (j = 1, args = new Array(len -1); j < len; j++) {\n args[j - 1] = arguments[j];\n }\n\n listeners[i].fn.apply(listeners[i].context, args);\n }\n }\n }\n\n return true;\n};\n\n/**\n * Add a listener for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} [context=this] The context to invoke the listener with.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.on = function on(event, fn, context) {\n return addListener(this, event, fn, context, false);\n};\n\n/**\n * Add a one-time listener for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} [context=this] The context to invoke the listener with.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.once = function once(event, fn, context) {\n return addListener(this, event, fn, context, true);\n};\n\n/**\n * Remove the listeners of a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn Only remove the listeners that match this function.\n * @param {*} context Only remove the listeners that have this context.\n * @param {Boolean} once Only remove one-time listeners.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.removeListener = function removeListener(event, fn, context, once) {\n var evt = prefix ? prefix + event : event;\n\n if (!this._events[evt]) return this;\n if (!fn) {\n clearEvent(this, evt);\n return this;\n }\n\n var listeners = this._events[evt];\n\n if (listeners.fn) {\n if (\n listeners.fn === fn &&\n (!once || listeners.once) &&\n (!context || listeners.context === context)\n ) {\n clearEvent(this, evt);\n }\n } else {\n for (var i = 0, events = [], length = listeners.length; i < length; i++) {\n if (\n listeners[i].fn !== fn ||\n (once && !listeners[i].once) ||\n (context && listeners[i].context !== context)\n ) {\n events.push(listeners[i]);\n }\n }\n\n //\n // Reset the array, or remove it completely if we have no more listeners.\n //\n if (events.length) this._events[evt] = events.length === 1 ? events[0] : events;\n else clearEvent(this, evt);\n }\n\n return this;\n};\n\n/**\n * Remove all listeners, or those of the specified event.\n *\n * @param {(String|Symbol)} [event] The event name.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.removeAllListeners = function removeAllListeners(event) {\n var evt;\n\n if (event) {\n evt = prefix ? prefix + event : event;\n if (this._events[evt]) clearEvent(this, evt);\n } else {\n this._events = new Events();\n this._eventsCount = 0;\n }\n\n return this;\n};\n\n//\n// Alias methods names because people roll like that.\n//\nEventEmitter.prototype.off = EventEmitter.prototype.removeListener;\nEventEmitter.prototype.addListener = EventEmitter.prototype.on;\n\n//\n// Expose the prefix.\n//\nEventEmitter.prefixed = prefix;\n\n//\n// Allow `EventEmitter` to be imported as module namespace.\n//\nEventEmitter.EventEmitter = EventEmitter;\n\n//\n// Expose the module.\n//\nif ('undefined' !== typeof module) {\n module.exports = EventEmitter;\n}\n","module.exports = function (max) {\n\n if (!max) throw Error('hashlru must have a max value, of type number, greater than 0')\n\n var size = 0, cache = Object.create(null), _cache = Object.create(null)\n\n function update (key, value) {\n cache[key] = value\n size ++\n if(size >= max) {\n size = 0\n _cache = cache\n cache = Object.create(null)\n }\n }\n\n return {\n has: function (key) {\n return cache[key] !== undefined || _cache[key] !== undefined\n },\n remove: function (key) {\n if(cache[key] !== undefined)\n cache[key] = undefined\n if(_cache[key] !== undefined)\n _cache[key] = undefined\n },\n get: function (key) {\n var v = cache[key]\n if(v !== undefined) return v\n if((v = _cache[key]) !== undefined) {\n update(key, v)\n return v\n }\n },\n set: function (key, value) {\n if(cache[key] !== undefined) cache[key] = value\n else update(key, value)\n },\n clear: function () {\n cache = Object.create(null)\n _cache = Object.create(null)\n }\n }\n}\n\n\n\n\n\n\n\n","/*\n * [hi-base32]{@link https://github.com/emn178/hi-base32}\n *\n * @version 0.5.0\n * @author Chen, Yi-Cyuan [emn178@gmail.com]\n * @copyright Chen, Yi-Cyuan 2015-2018\n * @license MIT\n */\n/*jslint bitwise: true */\n(function () {\n 'use strict';\n\n var root = typeof window === 'object' ? window : {};\n var NODE_JS = !root.HI_BASE32_NO_NODE_JS && typeof process === 'object' && process.versions && process.versions.node;\n if (NODE_JS) {\n root = global;\n }\n var COMMON_JS = !root.HI_BASE32_NO_COMMON_JS && typeof module === 'object' && module.exports;\n var AMD = typeof define === 'function' && define.amd;\n var BASE32_ENCODE_CHAR = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ234567'.split('');\n var BASE32_DECODE_CHAR = {\n 'A': 0, 'B': 1, 'C': 2, 'D': 3, 'E': 4, 'F': 5, 'G': 6, 'H': 7, 'I': 8,\n 'J': 9, 'K': 10, 'L': 11, 'M': 12, 'N': 13, 'O': 14, 'P': 15, 'Q': 16,\n 'R': 17, 'S': 18, 'T': 19, 'U': 20, 'V': 21, 'W': 22, 'X': 23, 'Y': 24,\n 'Z': 25, '2': 26, '3': 27, '4': 28, '5': 29, '6': 30, '7': 31\n };\n\n var blocks = [0, 0, 0, 0, 0, 0, 0, 0];\n\n var throwInvalidUtf8 = function (position, partial) {\n if (partial.length > 10) {\n partial = '...' + partial.substr(-10);\n }\n var err = new Error('Decoded data is not valid UTF-8.'\n + ' Maybe try base32.decode.asBytes()?'\n + ' Partial data after reading ' + position + ' bytes: ' + partial + ' <-');\n err.position = position;\n throw err;\n };\n\n var toUtf8String = function (bytes) {\n var str = '', length = bytes.length, i = 0, followingChars = 0, b, c;\n while (i < length) {\n b = bytes[i++];\n if (b <= 0x7F) {\n str += String.fromCharCode(b);\n continue;\n } else if (b > 0xBF && b <= 0xDF) {\n c = b & 0x1F;\n followingChars = 1;\n } else if (b <= 0xEF) {\n c = b & 0x0F;\n followingChars = 2;\n } else if (b <= 0xF7) {\n c = b & 0x07;\n followingChars = 3;\n } else {\n throwInvalidUtf8(i, str);\n }\n\n for (var j = 0; j < followingChars; ++j) {\n b = bytes[i++];\n if (b < 0x80 || b > 0xBF) {\n throwInvalidUtf8(i, str);\n }\n c <<= 6;\n c += b & 0x3F;\n }\n if (c >= 0xD800 && c <= 0xDFFF) {\n throwInvalidUtf8(i, str);\n }\n if (c > 0x10FFFF) {\n throwInvalidUtf8(i, str);\n }\n\n if (c <= 0xFFFF) {\n str += String.fromCharCode(c);\n } else {\n c -= 0x10000;\n str += String.fromCharCode((c >> 10) + 0xD800);\n str += String.fromCharCode((c & 0x3FF) + 0xDC00);\n }\n }\n return str;\n };\n\n var decodeAsBytes = function (base32Str) {\n if (base32Str === '') {\n return [];\n } else if (!/^[A-Z2-7=]+$/.test(base32Str)) {\n throw new Error('Invalid base32 characters');\n }\n base32Str = base32Str.replace(/=/g, '');\n var v1, v2, v3, v4, v5, v6, v7, v8, bytes = [], index = 0, length = base32Str.length;\n\n // 4 char to 3 bytes\n for (var i = 0, count = length >> 3 << 3; i < count;) {\n v1 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v2 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v3 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v4 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v5 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v6 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v7 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v8 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n bytes[index++] = (v1 << 3 | v2 >>> 2) & 255;\n bytes[index++] = (v2 << 6 | v3 << 1 | v4 >>> 4) & 255;\n bytes[index++] = (v4 << 4 | v5 >>> 1) & 255;\n bytes[index++] = (v5 << 7 | v6 << 2 | v7 >>> 3) & 255;\n bytes[index++] = (v7 << 5 | v8) & 255;\n }\n\n // remain bytes\n var remain = length - count;\n if (remain === 2) {\n v1 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v2 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n bytes[index++] = (v1 << 3 | v2 >>> 2) & 255;\n } else if (remain === 4) {\n v1 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v2 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v3 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v4 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n bytes[index++] = (v1 << 3 | v2 >>> 2) & 255;\n bytes[index++] = (v2 << 6 | v3 << 1 | v4 >>> 4) & 255;\n } else if (remain === 5) {\n v1 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v2 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v3 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v4 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v5 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n bytes[index++] = (v1 << 3 | v2 >>> 2) & 255;\n bytes[index++] = (v2 << 6 | v3 << 1 | v4 >>> 4) & 255;\n bytes[index++] = (v4 << 4 | v5 >>> 1) & 255;\n } else if (remain === 7) {\n v1 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v2 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v3 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v4 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v5 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v6 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v7 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n bytes[index++] = (v1 << 3 | v2 >>> 2) & 255;\n bytes[index++] = (v2 << 6 | v3 << 1 | v4 >>> 4) & 255;\n bytes[index++] = (v4 << 4 | v5 >>> 1) & 255;\n bytes[index++] = (v5 << 7 | v6 << 2 | v7 >>> 3) & 255;\n }\n return bytes;\n };\n\n var encodeAscii = function (str) {\n var v1, v2, v3, v4, v5, base32Str = '', length = str.length;\n for (var i = 0, count = parseInt(length / 5) * 5; i < count;) {\n v1 = str.charCodeAt(i++);\n v2 = str.charCodeAt(i++);\n v3 = str.charCodeAt(i++);\n v4 = str.charCodeAt(i++);\n v5 = str.charCodeAt(i++);\n base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] +\n BASE32_ENCODE_CHAR[(v1 << 2 | v2 >>> 6) & 31] +\n BASE32_ENCODE_CHAR[(v2 >>> 1) & 31] +\n BASE32_ENCODE_CHAR[(v2 << 4 | v3 >>> 4) & 31] +\n BASE32_ENCODE_CHAR[(v3 << 1 | v4 >>> 7) & 31] +\n BASE32_ENCODE_CHAR[(v4 >>> 2) & 31] +\n BASE32_ENCODE_CHAR[(v4 << 3 | v5 >>> 5) & 31] +\n BASE32_ENCODE_CHAR[v5 & 31];\n }\n\n // remain char\n var remain = length - count;\n if (remain === 1) {\n v1 = str.charCodeAt(i);\n base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] +\n BASE32_ENCODE_CHAR[(v1 << 2) & 31] +\n '======';\n } else if (remain === 2) {\n v1 = str.charCodeAt(i++);\n v2 = str.charCodeAt(i);\n base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] +\n BASE32_ENCODE_CHAR[(v1 << 2 | v2 >>> 6) & 31] +\n BASE32_ENCODE_CHAR[(v2 >>> 1) & 31] +\n BASE32_ENCODE_CHAR[(v2 << 4) & 31] +\n '====';\n } else if (remain === 3) {\n v1 = str.charCodeAt(i++);\n v2 = str.charCodeAt(i++);\n v3 = str.charCodeAt(i);\n base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] +\n BASE32_ENCODE_CHAR[(v1 << 2 | v2 >>> 6) & 31] +\n BASE32_ENCODE_CHAR[(v2 >>> 1) & 31] +\n BASE32_ENCODE_CHAR[(v2 << 4 | v3 >>> 4) & 31] +\n BASE32_ENCODE_CHAR[(v3 << 1) & 31] +\n '===';\n } else if (remain === 4) {\n v1 = str.charCodeAt(i++);\n v2 = str.charCodeAt(i++);\n v3 = str.charCodeAt(i++);\n v4 = str.charCodeAt(i);\n base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] +\n BASE32_ENCODE_CHAR[(v1 << 2 | v2 >>> 6) & 31] +\n BASE32_ENCODE_CHAR[(v2 >>> 1) & 31] +\n BASE32_ENCODE_CHAR[(v2 << 4 | v3 >>> 4) & 31] +\n BASE32_ENCODE_CHAR[(v3 << 1 | v4 >>> 7) & 31] +\n BASE32_ENCODE_CHAR[(v4 >>> 2) & 31] +\n BASE32_ENCODE_CHAR[(v4 << 3) & 31] +\n '=';\n }\n return base32Str;\n };\n\n var encodeUtf8 = function (str) {\n var v1, v2, v3, v4, v5, code, end = false, base32Str = '',\n index = 0, i, start = 0, bytes = 0, length = str.length;\n if (str === '') {\n return base32Str;\n }\n do {\n blocks[0] = blocks[5];\n blocks[1] = blocks[6];\n blocks[2] = blocks[7];\n for (i = start; index < length && i < 5; ++index) {\n code = str.charCodeAt(index);\n if (code < 0x80) {\n blocks[i++] = code;\n } else if (code < 0x800) {\n blocks[i++] = 0xc0 | (code >> 6);\n blocks[i++] = 0x80 | (code & 0x3f);\n } else if (code < 0xd800 || code >= 0xe000) {\n blocks[i++] = 0xe0 | (code >> 12);\n blocks[i++] = 0x80 | ((code >> 6) & 0x3f);\n blocks[i++] = 0x80 | (code & 0x3f);\n } else {\n code = 0x10000 + (((code & 0x3ff) << 10) | (str.charCodeAt(++index) & 0x3ff));\n blocks[i++] = 0xf0 | (code >> 18);\n blocks[i++] = 0x80 | ((code >> 12) & 0x3f);\n blocks[i++] = 0x80 | ((code >> 6) & 0x3f);\n blocks[i++] = 0x80 | (code & 0x3f);\n }\n }\n bytes += i - start;\n start = i - 5;\n if (index === length) {\n ++index;\n }\n if (index > length && i < 6) {\n end = true;\n }\n v1 = blocks[0];\n if (i > 4) {\n v2 = blocks[1];\n v3 = blocks[2];\n v4 = blocks[3];\n v5 = blocks[4];\n base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] +\n BASE32_ENCODE_CHAR[(v1 << 2 | v2 >>> 6) & 31] +\n BASE32_ENCODE_CHAR[(v2 >>> 1) & 31] +\n BASE32_ENCODE_CHAR[(v2 << 4 | v3 >>> 4) & 31] +\n BASE32_ENCODE_CHAR[(v3 << 1 | v4 >>> 7) & 31] +\n BASE32_ENCODE_CHAR[(v4 >>> 2) & 31] +\n BASE32_ENCODE_CHAR[(v4 << 3 | v5 >>> 5) & 31] +\n BASE32_ENCODE_CHAR[v5 & 31];\n } else if (i === 1) {\n base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] +\n BASE32_ENCODE_CHAR[(v1 << 2) & 31] +\n '======';\n } else if (i === 2) {\n v2 = blocks[1];\n base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] +\n BASE32_ENCODE_CHAR[(v1 << 2 | v2 >>> 6) & 31] +\n BASE32_ENCODE_CHAR[(v2 >>> 1) & 31] +\n BASE32_ENCODE_CHAR[(v2 << 4) & 31] +\n '====';\n } else if (i === 3) {\n v2 = blocks[1];\n v3 = blocks[2];\n base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] +\n BASE32_ENCODE_CHAR[(v1 << 2 | v2 >>> 6) & 31] +\n BASE32_ENCODE_CHAR[(v2 >>> 1) & 31] +\n BASE32_ENCODE_CHAR[(v2 << 4 | v3 >>> 4) & 31] +\n BASE32_ENCODE_CHAR[(v3 << 1) & 31] +\n '===';\n } else {\n v2 = blocks[1];\n v3 = blocks[2];\n v4 = blocks[3];\n base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] +\n BASE32_ENCODE_CHAR[(v1 << 2 | v2 >>> 6) & 31] +\n BASE32_ENCODE_CHAR[(v2 >>> 1) & 31] +\n BASE32_ENCODE_CHAR[(v2 << 4 | v3 >>> 4) & 31] +\n BASE32_ENCODE_CHAR[(v3 << 1 | v4 >>> 7) & 31] +\n BASE32_ENCODE_CHAR[(v4 >>> 2) & 31] +\n BASE32_ENCODE_CHAR[(v4 << 3) & 31] +\n '=';\n }\n } while (!end);\n return base32Str;\n };\n\n var encodeBytes = function (bytes) {\n var v1, v2, v3, v4, v5, base32Str = '', length = bytes.length;\n for (var i = 0, count = parseInt(length / 5) * 5; i < count;) {\n v1 = bytes[i++];\n v2 = bytes[i++];\n v3 = bytes[i++];\n v4 = bytes[i++];\n v5 = bytes[i++];\n base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] +\n BASE32_ENCODE_CHAR[(v1 << 2 | v2 >>> 6) & 31] +\n BASE32_ENCODE_CHAR[(v2 >>> 1) & 31] +\n BASE32_ENCODE_CHAR[(v2 << 4 | v3 >>> 4) & 31] +\n BASE32_ENCODE_CHAR[(v3 << 1 | v4 >>> 7) & 31] +\n BASE32_ENCODE_CHAR[(v4 >>> 2) & 31] +\n BASE32_ENCODE_CHAR[(v4 << 3 | v5 >>> 5) & 31] +\n BASE32_ENCODE_CHAR[v5 & 31];\n }\n\n // remain char\n var remain = length - count;\n if (remain === 1) {\n v1 = bytes[i];\n base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] +\n BASE32_ENCODE_CHAR[(v1 << 2) & 31] +\n '======';\n } else if (remain === 2) {\n v1 = bytes[i++];\n v2 = bytes[i];\n base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] +\n BASE32_ENCODE_CHAR[(v1 << 2 | v2 >>> 6) & 31] +\n BASE32_ENCODE_CHAR[(v2 >>> 1) & 31] +\n BASE32_ENCODE_CHAR[(v2 << 4) & 31] +\n '====';\n } else if (remain === 3) {\n v1 = bytes[i++];\n v2 = bytes[i++];\n v3 = bytes[i];\n base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] +\n BASE32_ENCODE_CHAR[(v1 << 2 | v2 >>> 6) & 31] +\n BASE32_ENCODE_CHAR[(v2 >>> 1) & 31] +\n BASE32_ENCODE_CHAR[(v2 << 4 | v3 >>> 4) & 31] +\n BASE32_ENCODE_CHAR[(v3 << 1) & 31] +\n '===';\n } else if (remain === 4) {\n v1 = bytes[i++];\n v2 = bytes[i++];\n v3 = bytes[i++];\n v4 = bytes[i];\n base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] +\n BASE32_ENCODE_CHAR[(v1 << 2 | v2 >>> 6) & 31] +\n BASE32_ENCODE_CHAR[(v2 >>> 1) & 31] +\n BASE32_ENCODE_CHAR[(v2 << 4 | v3 >>> 4) & 31] +\n BASE32_ENCODE_CHAR[(v3 << 1 | v4 >>> 7) & 31] +\n BASE32_ENCODE_CHAR[(v4 >>> 2) & 31] +\n BASE32_ENCODE_CHAR[(v4 << 3) & 31] +\n '=';\n }\n return base32Str;\n };\n\n var encode = function (input, asciiOnly) {\n var notString = typeof(input) !== 'string';\n if (notString && input.constructor === ArrayBuffer) {\n input = new Uint8Array(input);\n }\n if (notString) {\n return encodeBytes(input);\n } else if (asciiOnly) {\n return encodeAscii(input);\n } else {\n return encodeUtf8(input);\n }\n };\n\n var decode = function (base32Str, asciiOnly) {\n if (!asciiOnly) {\n return toUtf8String(decodeAsBytes(base32Str));\n }\n if (base32Str === '') {\n return '';\n } else if (!/^[A-Z2-7=]+$/.test(base32Str)) {\n throw new Error('Invalid base32 characters');\n }\n var v1, v2, v3, v4, v5, v6, v7, v8, str = '', length = base32Str.indexOf('=');\n if (length === -1) {\n length = base32Str.length;\n }\n\n // 8 char to 5 bytes\n for (var i = 0, count = length >> 3 << 3; i < count;) {\n v1 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v2 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v3 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v4 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v5 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v6 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v7 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v8 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n str += String.fromCharCode((v1 << 3 | v2 >>> 2) & 255) +\n String.fromCharCode((v2 << 6 | v3 << 1 | v4 >>> 4) & 255) +\n String.fromCharCode((v4 << 4 | v5 >>> 1) & 255) +\n String.fromCharCode((v5 << 7 | v6 << 2 | v7 >>> 3) & 255) +\n String.fromCharCode((v7 << 5 | v8) & 255);\n }\n\n // remain bytes\n var remain = length - count;\n if (remain === 2) {\n v1 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v2 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n str += String.fromCharCode((v1 << 3 | v2 >>> 2) & 255);\n } else if (remain === 4) {\n v1 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v2 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v3 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v4 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n str += String.fromCharCode((v1 << 3 | v2 >>> 2) & 255) +\n String.fromCharCode((v2 << 6 | v3 << 1 | v4 >>> 4) & 255);\n } else if (remain === 5) {\n v1 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v2 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v3 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v4 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v5 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n str += String.fromCharCode((v1 << 3 | v2 >>> 2) & 255) +\n String.fromCharCode((v2 << 6 | v3 << 1 | v4 >>> 4) & 255) +\n String.fromCharCode((v4 << 4 | v5 >>> 1) & 255);\n } else if (remain === 7) {\n v1 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v2 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v3 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v4 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v5 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v6 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n v7 = BASE32_DECODE_CHAR[base32Str.charAt(i++)];\n str += String.fromCharCode((v1 << 3 | v2 >>> 2) & 255) +\n String.fromCharCode((v2 << 6 | v3 << 1 | v4 >>> 4) & 255) +\n String.fromCharCode((v4 << 4 | v5 >>> 1) & 255) +\n String.fromCharCode((v5 << 7 | v6 << 2 | v7 >>> 3) & 255);\n }\n return str;\n };\n\n var exports = {\n encode: encode,\n decode: decode\n };\n decode.asBytes = decodeAsBytes;\n\n if (COMMON_JS) {\n module.exports = exports;\n } else {\n root.base32 = exports;\n if (AMD) {\n define(function() {\n return exports;\n });\n }\n }\n})();\n","// https://github.com/electron/electron/issues/2288\nfunction isElectron() {\n // Renderer process\n if (typeof window !== 'undefined' && typeof window.process === 'object' && window.process.type === 'renderer') {\n return true;\n }\n\n // Main process\n if (typeof process !== 'undefined' && typeof process.versions === 'object' && !!process.versions.electron) {\n return true;\n }\n\n // Detect the user agent when the `nodeIntegration` option is set to false\n if (typeof navigator === 'object' && typeof navigator.userAgent === 'string' && navigator.userAgent.indexOf('Electron') >= 0) {\n return true;\n }\n\n return false;\n}\n\nmodule.exports = isElectron;\n","'use strict';\n\nmodule.exports = value => {\n\tif (Object.prototype.toString.call(value) !== '[object Object]') {\n\t\treturn false;\n\t}\n\n\tconst prototype = Object.getPrototypeOf(value);\n\treturn prototype === null || prototype === Object.prototype;\n};\n","/**\n * [js-sha3]{@link https://github.com/emn178/js-sha3}\n *\n * @version 0.9.3\n * @author Chen, Yi-Cyuan [emn178@gmail.com]\n * @copyright Chen, Yi-Cyuan 2015-2023\n * @license MIT\n */\n/*jslint bitwise: true */\n(function () {\n 'use strict';\n\n var INPUT_ERROR = 'input is invalid type';\n var FINALIZE_ERROR = 'finalize already called';\n var WINDOW = typeof window === 'object';\n var root = WINDOW ? window : {};\n if (root.JS_SHA3_NO_WINDOW) {\n WINDOW = false;\n }\n var WEB_WORKER = !WINDOW && typeof self === 'object';\n var NODE_JS = !root.JS_SHA3_NO_NODE_JS && typeof process === 'object' && process.versions && process.versions.node;\n if (NODE_JS) {\n root = global;\n } else if (WEB_WORKER) {\n root = self;\n }\n var COMMON_JS = !root.JS_SHA3_NO_COMMON_JS && typeof module === 'object' && module.exports;\n var AMD = typeof define === 'function' && define.amd;\n var ARRAY_BUFFER = !root.JS_SHA3_NO_ARRAY_BUFFER && typeof ArrayBuffer !== 'undefined';\n var HEX_CHARS = '0123456789abcdef'.split('');\n var SHAKE_PADDING = [31, 7936, 2031616, 520093696];\n var CSHAKE_PADDING = [4, 1024, 262144, 67108864];\n var KECCAK_PADDING = [1, 256, 65536, 16777216];\n var PADDING = [6, 1536, 393216, 100663296];\n var SHIFT = [0, 8, 16, 24];\n var RC = [1, 0, 32898, 0, 32906, 2147483648, 2147516416, 2147483648, 32907, 0, 2147483649,\n 0, 2147516545, 2147483648, 32777, 2147483648, 138, 0, 136, 0, 2147516425, 0,\n 2147483658, 0, 2147516555, 0, 139, 2147483648, 32905, 2147483648, 32771,\n 2147483648, 32770, 2147483648, 128, 2147483648, 32778, 0, 2147483658, 2147483648,\n 2147516545, 2147483648, 32896, 2147483648, 2147483649, 0, 2147516424, 2147483648];\n var BITS = [224, 256, 384, 512];\n var SHAKE_BITS = [128, 256];\n var OUTPUT_TYPES = ['hex', 'buffer', 'arrayBuffer', 'array', 'digest'];\n var CSHAKE_BYTEPAD = {\n '128': 168,\n '256': 136\n };\n\n\n var isArray = root.JS_SHA3_NO_NODE_JS || !Array.isArray\n ? function (obj) {\n return Object.prototype.toString.call(obj) === '[object Array]';\n }\n : Array.isArray;\n\n var isView = (ARRAY_BUFFER && (root.JS_SHA3_NO_ARRAY_BUFFER_IS_VIEW || !ArrayBuffer.isView))\n ? function (obj) {\n return typeof obj === 'object' && obj.buffer && obj.buffer.constructor === ArrayBuffer;\n }\n : ArrayBuffer.isView;\n\n // [message: string, isString: bool]\n var formatMessage = function (message) {\n var type = typeof message;\n if (type === 'string') {\n return [message, true];\n }\n if (type !== 'object' || message === null) {\n throw new Error(INPUT_ERROR);\n }\n if (ARRAY_BUFFER && message.constructor === ArrayBuffer) {\n return [new Uint8Array(message), false];\n }\n if (!isArray(message) && !isView(message)) {\n throw new Error(INPUT_ERROR);\n }\n return [message, false];\n }\n\n var empty = function (message) {\n return formatMessage(message)[0].length === 0;\n };\n\n var cloneArray = function (array) {\n var newArray = [];\n for (var i = 0; i < array.length; ++i) {\n newArray[i] = array[i];\n }\n return newArray;\n }\n\n var createOutputMethod = function (bits, padding, outputType) {\n return function (message) {\n return new Keccak(bits, padding, bits).update(message)[outputType]();\n };\n };\n\n var createShakeOutputMethod = function (bits, padding, outputType) {\n return function (message, outputBits) {\n return new Keccak(bits, padding, outputBits).update(message)[outputType]();\n };\n };\n\n var createCshakeOutputMethod = function (bits, padding, outputType) {\n return function (message, outputBits, n, s) {\n return methods['cshake' + bits].update(message, outputBits, n, s)[outputType]();\n };\n };\n\n var createKmacOutputMethod = function (bits, padding, outputType) {\n return function (key, message, outputBits, s) {\n return methods['kmac' + bits].update(key, message, outputBits, s)[outputType]();\n };\n };\n\n var createOutputMethods = function (method, createMethod, bits, padding) {\n for (var i = 0; i < OUTPUT_TYPES.length; ++i) {\n var type = OUTPUT_TYPES[i];\n method[type] = createMethod(bits, padding, type);\n }\n return method;\n };\n\n var createMethod = function (bits, padding) {\n var method = createOutputMethod(bits, padding, 'hex');\n method.create = function () {\n return new Keccak(bits, padding, bits);\n };\n method.update = function (message) {\n return method.create().update(message);\n };\n return createOutputMethods(method, createOutputMethod, bits, padding);\n };\n\n var createShakeMethod = function (bits, padding) {\n var method = createShakeOutputMethod(bits, padding, 'hex');\n method.create = function (outputBits) {\n return new Keccak(bits, padding, outputBits);\n };\n method.update = function (message, outputBits) {\n return method.create(outputBits).update(message);\n };\n return createOutputMethods(method, createShakeOutputMethod, bits, padding);\n };\n\n var createCshakeMethod = function (bits, padding) {\n var w = CSHAKE_BYTEPAD[bits];\n var method = createCshakeOutputMethod(bits, padding, 'hex');\n method.create = function (outputBits, n, s) {\n if (empty(n) && empty(s)) {\n return methods['shake' + bits].create(outputBits);\n } else {\n return new Keccak(bits, padding, outputBits).bytepad([n, s], w);\n }\n };\n method.update = function (message, outputBits, n, s) {\n return method.create(outputBits, n, s).update(message);\n };\n return createOutputMethods(method, createCshakeOutputMethod, bits, padding);\n };\n\n var createKmacMethod = function (bits, padding) {\n var w = CSHAKE_BYTEPAD[bits];\n var method = createKmacOutputMethod(bits, padding, 'hex');\n method.create = function (key, outputBits, s) {\n return new Kmac(bits, padding, outputBits).bytepad(['KMAC', s], w).bytepad([key], w);\n };\n method.update = function (key, message, outputBits, s) {\n return method.create(key, outputBits, s).update(message);\n };\n return createOutputMethods(method, createKmacOutputMethod, bits, padding);\n };\n\n var algorithms = [\n { name: 'keccak', padding: KECCAK_PADDING, bits: BITS, createMethod: createMethod },\n { name: 'sha3', padding: PADDING, bits: BITS, createMethod: createMethod },\n { name: 'shake', padding: SHAKE_PADDING, bits: SHAKE_BITS, createMethod: createShakeMethod },\n { name: 'cshake', padding: CSHAKE_PADDING, bits: SHAKE_BITS, createMethod: createCshakeMethod },\n { name: 'kmac', padding: CSHAKE_PADDING, bits: SHAKE_BITS, createMethod: createKmacMethod }\n ];\n\n var methods = {}, methodNames = [];\n\n for (var i = 0; i < algorithms.length; ++i) {\n var algorithm = algorithms[i];\n var bits = algorithm.bits;\n for (var j = 0; j < bits.length; ++j) {\n var methodName = algorithm.name + '_' + bits[j];\n methodNames.push(methodName);\n methods[methodName] = algorithm.createMethod(bits[j], algorithm.padding);\n if (algorithm.name !== 'sha3') {\n var newMethodName = algorithm.name + bits[j];\n methodNames.push(newMethodName);\n methods[newMethodName] = methods[methodName];\n }\n }\n }\n\n function Keccak(bits, padding, outputBits) {\n this.blocks = [];\n this.s = [];\n this.padding = padding;\n this.outputBits = outputBits;\n this.reset = true;\n this.finalized = false;\n this.block = 0;\n this.start = 0;\n this.blockCount = (1600 - (bits << 1)) >> 5;\n this.byteCount = this.blockCount << 2;\n this.outputBlocks = outputBits >> 5;\n this.extraBytes = (outputBits & 31) >> 3;\n\n for (var i = 0; i < 50; ++i) {\n this.s[i] = 0;\n }\n }\n\n Keccak.prototype.update = function (message) {\n if (this.finalized) {\n throw new Error(FINALIZE_ERROR);\n }\n var result = formatMessage(message);\n message = result[0];\n var isString = result[1];\n var blocks = this.blocks, byteCount = this.byteCount, length = message.length,\n blockCount = this.blockCount, index = 0, s = this.s, i, code;\n\n while (index < length) {\n if (this.reset) {\n this.reset = false;\n blocks[0] = this.block;\n for (i = 1; i < blockCount + 1; ++i) {\n blocks[i] = 0;\n }\n }\n if (isString) {\n for (i = this.start; index < length && i < byteCount; ++index) {\n code = message.charCodeAt(index);\n if (code < 0x80) {\n blocks[i >> 2] |= code << SHIFT[i++ & 3];\n } else if (code < 0x800) {\n blocks[i >> 2] |= (0xc0 | (code >> 6)) << SHIFT[i++ & 3];\n blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];\n } else if (code < 0xd800 || code >= 0xe000) {\n blocks[i >> 2] |= (0xe0 | (code >> 12)) << SHIFT[i++ & 3];\n blocks[i >> 2] |= (0x80 | ((code >> 6) & 0x3f)) << SHIFT[i++ & 3];\n blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];\n } else {\n code = 0x10000 + (((code & 0x3ff) << 10) | (message.charCodeAt(++index) & 0x3ff));\n blocks[i >> 2] |= (0xf0 | (code >> 18)) << SHIFT[i++ & 3];\n blocks[i >> 2] |= (0x80 | ((code >> 12) & 0x3f)) << SHIFT[i++ & 3];\n blocks[i >> 2] |= (0x80 | ((code >> 6) & 0x3f)) << SHIFT[i++ & 3];\n blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];\n }\n }\n } else {\n for (i = this.start; index < length && i < byteCount; ++index) {\n blocks[i >> 2] |= message[index] << SHIFT[i++ & 3];\n }\n }\n this.lastByteIndex = i;\n if (i >= byteCount) {\n this.start = i - byteCount;\n this.block = blocks[blockCount];\n for (i = 0; i < blockCount; ++i) {\n s[i] ^= blocks[i];\n }\n f(s);\n this.reset = true;\n } else {\n this.start = i;\n }\n }\n return this;\n };\n\n Keccak.prototype.encode = function (x, right) {\n var o = x & 255, n = 1;\n var bytes = [o];\n x = x >> 8;\n o = x & 255;\n while (o > 0) {\n bytes.unshift(o);\n x = x >> 8;\n o = x & 255;\n ++n;\n }\n if (right) {\n bytes.push(n);\n } else {\n bytes.unshift(n);\n }\n this.update(bytes);\n return bytes.length;\n };\n\n Keccak.prototype.encodeString = function (str) {\n var result = formatMessage(str);\n str = result[0];\n var isString = result[1];\n var bytes = 0, length = str.length;\n if (isString) {\n for (var i = 0; i < str.length; ++i) {\n var code = str.charCodeAt(i);\n if (code < 0x80) {\n bytes += 1;\n } else if (code < 0x800) {\n bytes += 2;\n } else if (code < 0xd800 || code >= 0xe000) {\n bytes += 3;\n } else {\n code = 0x10000 + (((code & 0x3ff) << 10) | (str.charCodeAt(++i) & 0x3ff));\n bytes += 4;\n }\n }\n } else {\n bytes = length;\n }\n bytes += this.encode(bytes * 8);\n this.update(str);\n return bytes;\n };\n\n Keccak.prototype.bytepad = function (strs, w) {\n var bytes = this.encode(w);\n for (var i = 0; i < strs.length; ++i) {\n bytes += this.encodeString(strs[i]);\n }\n var paddingBytes = (w - bytes % w) % w;\n var zeros = [];\n zeros.length = paddingBytes;\n this.update(zeros);\n return this;\n };\n\n Keccak.prototype.finalize = function () {\n if (this.finalized) {\n return;\n }\n this.finalized = true;\n var blocks = this.blocks, i = this.lastByteIndex, blockCount = this.blockCount, s = this.s;\n blocks[i >> 2] |= this.padding[i & 3];\n if (this.lastByteIndex === this.byteCount) {\n blocks[0] = blocks[blockCount];\n for (i = 1; i < blockCount + 1; ++i) {\n blocks[i] = 0;\n }\n }\n blocks[blockCount - 1] |= 0x80000000;\n for (i = 0; i < blockCount; ++i) {\n s[i] ^= blocks[i];\n }\n f(s);\n };\n\n Keccak.prototype.toString = Keccak.prototype.hex = function () {\n this.finalize();\n\n var blockCount = this.blockCount, s = this.s, outputBlocks = this.outputBlocks,\n extraBytes = this.extraBytes, i = 0, j = 0;\n var hex = '', block;\n while (j < outputBlocks) {\n for (i = 0; i < blockCount && j < outputBlocks; ++i, ++j) {\n block = s[i];\n hex += HEX_CHARS[(block >> 4) & 0x0F] + HEX_CHARS[block & 0x0F] +\n HEX_CHARS[(block >> 12) & 0x0F] + HEX_CHARS[(block >> 8) & 0x0F] +\n HEX_CHARS[(block >> 20) & 0x0F] + HEX_CHARS[(block >> 16) & 0x0F] +\n HEX_CHARS[(block >> 28) & 0x0F] + HEX_CHARS[(block >> 24) & 0x0F];\n }\n if (j % blockCount === 0) {\n s = cloneArray(s);\n f(s);\n i = 0;\n }\n }\n if (extraBytes) {\n block = s[i];\n hex += HEX_CHARS[(block >> 4) & 0x0F] + HEX_CHARS[block & 0x0F];\n if (extraBytes > 1) {\n hex += HEX_CHARS[(block >> 12) & 0x0F] + HEX_CHARS[(block >> 8) & 0x0F];\n }\n if (extraBytes > 2) {\n hex += HEX_CHARS[(block >> 20) & 0x0F] + HEX_CHARS[(block >> 16) & 0x0F];\n }\n }\n return hex;\n };\n\n Keccak.prototype.arrayBuffer = function () {\n this.finalize();\n\n var blockCount = this.blockCount, s = this.s, outputBlocks = this.outputBlocks,\n extraBytes = this.extraBytes, i = 0, j = 0;\n var bytes = this.outputBits >> 3;\n var buffer;\n if (extraBytes) {\n buffer = new ArrayBuffer((outputBlocks + 1) << 2);\n } else {\n buffer = new ArrayBuffer(bytes);\n }\n var array = new Uint32Array(buffer);\n while (j < outputBlocks) {\n for (i = 0; i < blockCount && j < outputBlocks; ++i, ++j) {\n array[j] = s[i];\n }\n if (j % blockCount === 0) {\n s = cloneArray(s);\n f(s);\n }\n }\n if (extraBytes) {\n array[j] = s[i];\n buffer = buffer.slice(0, bytes);\n }\n return buffer;\n };\n\n Keccak.prototype.buffer = Keccak.prototype.arrayBuffer;\n\n Keccak.prototype.digest = Keccak.prototype.array = function () {\n this.finalize();\n\n var blockCount = this.blockCount, s = this.s, outputBlocks = this.outputBlocks,\n extraBytes = this.extraBytes, i = 0, j = 0;\n var array = [], offset, block;\n while (j < outputBlocks) {\n for (i = 0; i < blockCount && j < outputBlocks; ++i, ++j) {\n offset = j << 2;\n block = s[i];\n array[offset] = block & 0xFF;\n array[offset + 1] = (block >> 8) & 0xFF;\n array[offset + 2] = (block >> 16) & 0xFF;\n array[offset + 3] = (block >> 24) & 0xFF;\n }\n if (j % blockCount === 0) {\n s = cloneArray(s);\n f(s);\n }\n }\n if (extraBytes) {\n offset = j << 2;\n block = s[i];\n array[offset] = block & 0xFF;\n if (extraBytes > 1) {\n array[offset + 1] = (block >> 8) & 0xFF;\n }\n if (extraBytes > 2) {\n array[offset + 2] = (block >> 16) & 0xFF;\n }\n }\n return array;\n };\n\n function Kmac(bits, padding, outputBits) {\n Keccak.call(this, bits, padding, outputBits);\n }\n\n Kmac.prototype = new Keccak();\n\n Kmac.prototype.finalize = function () {\n this.encode(this.outputBits, true);\n return Keccak.prototype.finalize.call(this);\n };\n\n var f = function (s) {\n var h, l, n, c0, c1, c2, c3, c4, c5, c6, c7, c8, c9,\n b0, b1, b2, b3, b4, b5, b6, b7, b8, b9, b10, b11, b12, b13, b14, b15, b16, b17,\n b18, b19, b20, b21, b22, b23, b24, b25, b26, b27, b28, b29, b30, b31, b32, b33,\n b34, b35, b36, b37, b38, b39, b40, b41, b42, b43, b44, b45, b46, b47, b48, b49;\n for (n = 0; n < 48; n += 2) {\n c0 = s[0] ^ s[10] ^ s[20] ^ s[30] ^ s[40];\n c1 = s[1] ^ s[11] ^ s[21] ^ s[31] ^ s[41];\n c2 = s[2] ^ s[12] ^ s[22] ^ s[32] ^ s[42];\n c3 = s[3] ^ s[13] ^ s[23] ^ s[33] ^ s[43];\n c4 = s[4] ^ s[14] ^ s[24] ^ s[34] ^ s[44];\n c5 = s[5] ^ s[15] ^ s[25] ^ s[35] ^ s[45];\n c6 = s[6] ^ s[16] ^ s[26] ^ s[36] ^ s[46];\n c7 = s[7] ^ s[17] ^ s[27] ^ s[37] ^ s[47];\n c8 = s[8] ^ s[18] ^ s[28] ^ s[38] ^ s[48];\n c9 = s[9] ^ s[19] ^ s[29] ^ s[39] ^ s[49];\n\n h = c8 ^ ((c2 << 1) | (c3 >>> 31));\n l = c9 ^ ((c3 << 1) | (c2 >>> 31));\n s[0] ^= h;\n s[1] ^= l;\n s[10] ^= h;\n s[11] ^= l;\n s[20] ^= h;\n s[21] ^= l;\n s[30] ^= h;\n s[31] ^= l;\n s[40] ^= h;\n s[41] ^= l;\n h = c0 ^ ((c4 << 1) | (c5 >>> 31));\n l = c1 ^ ((c5 << 1) | (c4 >>> 31));\n s[2] ^= h;\n s[3] ^= l;\n s[12] ^= h;\n s[13] ^= l;\n s[22] ^= h;\n s[23] ^= l;\n s[32] ^= h;\n s[33] ^= l;\n s[42] ^= h;\n s[43] ^= l;\n h = c2 ^ ((c6 << 1) | (c7 >>> 31));\n l = c3 ^ ((c7 << 1) | (c6 >>> 31));\n s[4] ^= h;\n s[5] ^= l;\n s[14] ^= h;\n s[15] ^= l;\n s[24] ^= h;\n s[25] ^= l;\n s[34] ^= h;\n s[35] ^= l;\n s[44] ^= h;\n s[45] ^= l;\n h = c4 ^ ((c8 << 1) | (c9 >>> 31));\n l = c5 ^ ((c9 << 1) | (c8 >>> 31));\n s[6] ^= h;\n s[7] ^= l;\n s[16] ^= h;\n s[17] ^= l;\n s[26] ^= h;\n s[27] ^= l;\n s[36] ^= h;\n s[37] ^= l;\n s[46] ^= h;\n s[47] ^= l;\n h = c6 ^ ((c0 << 1) | (c1 >>> 31));\n l = c7 ^ ((c1 << 1) | (c0 >>> 31));\n s[8] ^= h;\n s[9] ^= l;\n s[18] ^= h;\n s[19] ^= l;\n s[28] ^= h;\n s[29] ^= l;\n s[38] ^= h;\n s[39] ^= l;\n s[48] ^= h;\n s[49] ^= l;\n\n b0 = s[0];\n b1 = s[1];\n b32 = (s[11] << 4) | (s[10] >>> 28);\n b33 = (s[10] << 4) | (s[11] >>> 28);\n b14 = (s[20] << 3) | (s[21] >>> 29);\n b15 = (s[21] << 3) | (s[20] >>> 29);\n b46 = (s[31] << 9) | (s[30] >>> 23);\n b47 = (s[30] << 9) | (s[31] >>> 23);\n b28 = (s[40] << 18) | (s[41] >>> 14);\n b29 = (s[41] << 18) | (s[40] >>> 14);\n b20 = (s[2] << 1) | (s[3] >>> 31);\n b21 = (s[3] << 1) | (s[2] >>> 31);\n b2 = (s[13] << 12) | (s[12] >>> 20);\n b3 = (s[12] << 12) | (s[13] >>> 20);\n b34 = (s[22] << 10) | (s[23] >>> 22);\n b35 = (s[23] << 10) | (s[22] >>> 22);\n b16 = (s[33] << 13) | (s[32] >>> 19);\n b17 = (s[32] << 13) | (s[33] >>> 19);\n b48 = (s[42] << 2) | (s[43] >>> 30);\n b49 = (s[43] << 2) | (s[42] >>> 30);\n b40 = (s[5] << 30) | (s[4] >>> 2);\n b41 = (s[4] << 30) | (s[5] >>> 2);\n b22 = (s[14] << 6) | (s[15] >>> 26);\n b23 = (s[15] << 6) | (s[14] >>> 26);\n b4 = (s[25] << 11) | (s[24] >>> 21);\n b5 = (s[24] << 11) | (s[25] >>> 21);\n b36 = (s[34] << 15) | (s[35] >>> 17);\n b37 = (s[35] << 15) | (s[34] >>> 17);\n b18 = (s[45] << 29) | (s[44] >>> 3);\n b19 = (s[44] << 29) | (s[45] >>> 3);\n b10 = (s[6] << 28) | (s[7] >>> 4);\n b11 = (s[7] << 28) | (s[6] >>> 4);\n b42 = (s[17] << 23) | (s[16] >>> 9);\n b43 = (s[16] << 23) | (s[17] >>> 9);\n b24 = (s[26] << 25) | (s[27] >>> 7);\n b25 = (s[27] << 25) | (s[26] >>> 7);\n b6 = (s[36] << 21) | (s[37] >>> 11);\n b7 = (s[37] << 21) | (s[36] >>> 11);\n b38 = (s[47] << 24) | (s[46] >>> 8);\n b39 = (s[46] << 24) | (s[47] >>> 8);\n b30 = (s[8] << 27) | (s[9] >>> 5);\n b31 = (s[9] << 27) | (s[8] >>> 5);\n b12 = (s[18] << 20) | (s[19] >>> 12);\n b13 = (s[19] << 20) | (s[18] >>> 12);\n b44 = (s[29] << 7) | (s[28] >>> 25);\n b45 = (s[28] << 7) | (s[29] >>> 25);\n b26 = (s[38] << 8) | (s[39] >>> 24);\n b27 = (s[39] << 8) | (s[38] >>> 24);\n b8 = (s[48] << 14) | (s[49] >>> 18);\n b9 = (s[49] << 14) | (s[48] >>> 18);\n\n s[0] = b0 ^ (~b2 & b4);\n s[1] = b1 ^ (~b3 & b5);\n s[10] = b10 ^ (~b12 & b14);\n s[11] = b11 ^ (~b13 & b15);\n s[20] = b20 ^ (~b22 & b24);\n s[21] = b21 ^ (~b23 & b25);\n s[30] = b30 ^ (~b32 & b34);\n s[31] = b31 ^ (~b33 & b35);\n s[40] = b40 ^ (~b42 & b44);\n s[41] = b41 ^ (~b43 & b45);\n s[2] = b2 ^ (~b4 & b6);\n s[3] = b3 ^ (~b5 & b7);\n s[12] = b12 ^ (~b14 & b16);\n s[13] = b13 ^ (~b15 & b17);\n s[22] = b22 ^ (~b24 & b26);\n s[23] = b23 ^ (~b25 & b27);\n s[32] = b32 ^ (~b34 & b36);\n s[33] = b33 ^ (~b35 & b37);\n s[42] = b42 ^ (~b44 & b46);\n s[43] = b43 ^ (~b45 & b47);\n s[4] = b4 ^ (~b6 & b8);\n s[5] = b5 ^ (~b7 & b9);\n s[14] = b14 ^ (~b16 & b18);\n s[15] = b15 ^ (~b17 & b19);\n s[24] = b24 ^ (~b26 & b28);\n s[25] = b25 ^ (~b27 & b29);\n s[34] = b34 ^ (~b36 & b38);\n s[35] = b35 ^ (~b37 & b39);\n s[44] = b44 ^ (~b46 & b48);\n s[45] = b45 ^ (~b47 & b49);\n s[6] = b6 ^ (~b8 & b0);\n s[7] = b7 ^ (~b9 & b1);\n s[16] = b16 ^ (~b18 & b10);\n s[17] = b17 ^ (~b19 & b11);\n s[26] = b26 ^ (~b28 & b20);\n s[27] = b27 ^ (~b29 & b21);\n s[36] = b36 ^ (~b38 & b30);\n s[37] = b37 ^ (~b39 & b31);\n s[46] = b46 ^ (~b48 & b40);\n s[47] = b47 ^ (~b49 & b41);\n s[8] = b8 ^ (~b0 & b2);\n s[9] = b9 ^ (~b1 & b3);\n s[18] = b18 ^ (~b10 & b12);\n s[19] = b19 ^ (~b11 & b13);\n s[28] = b28 ^ (~b20 & b22);\n s[29] = b29 ^ (~b21 & b23);\n s[38] = b38 ^ (~b30 & b32);\n s[39] = b39 ^ (~b31 & b33);\n s[48] = b48 ^ (~b40 & b42);\n s[49] = b49 ^ (~b41 & b43);\n\n s[0] ^= RC[n];\n s[1] ^= RC[n + 1];\n }\n };\n\n if (COMMON_JS) {\n module.exports = methods;\n } else {\n for (i = 0; i < methodNames.length; ++i) {\n root[methodNames[i]] = methods[methodNames[i]];\n }\n if (AMD) {\n define(function () {\n return methods;\n });\n }\n }\n})();\n","'use strict';\nconst isOptionObject = require('is-plain-obj');\n\nconst {hasOwnProperty} = Object.prototype;\nconst {propertyIsEnumerable} = Object;\nconst defineProperty = (object, name, value) => Object.defineProperty(object, name, {\n\tvalue,\n\twritable: true,\n\tenumerable: true,\n\tconfigurable: true\n});\n\nconst globalThis = this;\nconst defaultMergeOptions = {\n\tconcatArrays: false,\n\tignoreUndefined: false\n};\n\nconst getEnumerableOwnPropertyKeys = value => {\n\tconst keys = [];\n\n\tfor (const key in value) {\n\t\tif (hasOwnProperty.call(value, key)) {\n\t\t\tkeys.push(key);\n\t\t}\n\t}\n\n\t/* istanbul ignore else */\n\tif (Object.getOwnPropertySymbols) {\n\t\tconst symbols = Object.getOwnPropertySymbols(value);\n\n\t\tfor (const symbol of symbols) {\n\t\t\tif (propertyIsEnumerable.call(value, symbol)) {\n\t\t\t\tkeys.push(symbol);\n\t\t\t}\n\t\t}\n\t}\n\n\treturn keys;\n};\n\nfunction clone(value) {\n\tif (Array.isArray(value)) {\n\t\treturn cloneArray(value);\n\t}\n\n\tif (isOptionObject(value)) {\n\t\treturn cloneOptionObject(value);\n\t}\n\n\treturn value;\n}\n\nfunction cloneArray(array) {\n\tconst result = array.slice(0, 0);\n\n\tgetEnumerableOwnPropertyKeys(array).forEach(key => {\n\t\tdefineProperty(result, key, clone(array[key]));\n\t});\n\n\treturn result;\n}\n\nfunction cloneOptionObject(object) {\n\tconst result = Object.getPrototypeOf(object) === null ? Object.create(null) : {};\n\n\tgetEnumerableOwnPropertyKeys(object).forEach(key => {\n\t\tdefineProperty(result, key, clone(object[key]));\n\t});\n\n\treturn result;\n}\n\n/**\n * @param {*} merged already cloned\n * @param {*} source something to merge\n * @param {string[]} keys keys to merge\n * @param {Object} config Config Object\n * @returns {*} cloned Object\n */\nconst mergeKeys = (merged, source, keys, config) => {\n\tkeys.forEach(key => {\n\t\tif (typeof source[key] === 'undefined' && config.ignoreUndefined) {\n\t\t\treturn;\n\t\t}\n\n\t\t// Do not recurse into prototype chain of merged\n\t\tif (key in merged && merged[key] !== Object.getPrototypeOf(merged)) {\n\t\t\tdefineProperty(merged, key, merge(merged[key], source[key], config));\n\t\t} else {\n\t\t\tdefineProperty(merged, key, clone(source[key]));\n\t\t}\n\t});\n\n\treturn merged;\n};\n\n/**\n * @param {*} merged already cloned\n * @param {*} source something to merge\n * @param {Object} config Config Object\n * @returns {*} cloned Object\n *\n * see [Array.prototype.concat ( ...arguments )](http://www.ecma-international.org/ecma-262/6.0/#sec-array.prototype.concat)\n */\nconst concatArrays = (merged, source, config) => {\n\tlet result = merged.slice(0, 0);\n\tlet resultIndex = 0;\n\n\t[merged, source].forEach(array => {\n\t\tconst indices = [];\n\n\t\t// `result.concat(array)` with cloning\n\t\tfor (let k = 0; k < array.length; k++) {\n\t\t\tif (!hasOwnProperty.call(array, k)) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tindices.push(String(k));\n\n\t\t\tif (array === merged) {\n\t\t\t\t// Already cloned\n\t\t\t\tdefineProperty(result, resultIndex++, array[k]);\n\t\t\t} else {\n\t\t\t\tdefineProperty(result, resultIndex++, clone(array[k]));\n\t\t\t}\n\t\t}\n\n\t\t// Merge non-index keys\n\t\tresult = mergeKeys(result, array, getEnumerableOwnPropertyKeys(array).filter(key => !indices.includes(key)), config);\n\t});\n\n\treturn result;\n};\n\n/**\n * @param {*} merged already cloned\n * @param {*} source something to merge\n * @param {Object} config Config Object\n * @returns {*} cloned Object\n */\nfunction merge(merged, source, config) {\n\tif (config.concatArrays && Array.isArray(merged) && Array.isArray(source)) {\n\t\treturn concatArrays(merged, source, config);\n\t}\n\n\tif (!isOptionObject(source) || !isOptionObject(merged)) {\n\t\treturn clone(source);\n\t}\n\n\treturn mergeKeys(merged, source, getEnumerableOwnPropertyKeys(source), config);\n}\n\nmodule.exports = function (...options) {\n\tconst config = merge(clone(defaultMergeOptions), (this !== globalThis && this) || {}, defaultMergeOptions);\n\tlet merged = {_: {}};\n\n\tfor (const option of options) {\n\t\tif (option === undefined) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (!isOptionObject(option)) {\n\t\t\tthrow new TypeError('`' + option + '` is not an Option Object');\n\t\t}\n\n\t\tmerged = merge(merged, {_: option}, config);\n\t}\n\n\treturn merged._;\n};\n","/**\n * Helpers.\n */\n\nvar s = 1000;\nvar m = s * 60;\nvar h = m * 60;\nvar d = h * 24;\nvar w = d * 7;\nvar y = d * 365.25;\n\n/**\n * Parse or format the given `val`.\n *\n * Options:\n *\n * - `long` verbose formatting [false]\n *\n * @param {String|Number} val\n * @param {Object} [options]\n * @throws {Error} throw an error if val is not a non-empty string or a number\n * @return {String|Number}\n * @api public\n */\n\nmodule.exports = function(val, options) {\n options = options || {};\n var type = typeof val;\n if (type === 'string' && val.length > 0) {\n return parse(val);\n } else if (type === 'number' && isFinite(val)) {\n return options.long ? fmtLong(val) : fmtShort(val);\n }\n throw new Error(\n 'val is not a non-empty string or a valid number. val=' +\n JSON.stringify(val)\n );\n};\n\n/**\n * Parse the given `str` and return milliseconds.\n *\n * @param {String} str\n * @return {Number}\n * @api private\n */\n\nfunction parse(str) {\n str = String(str);\n if (str.length > 100) {\n return;\n }\n var match = /^(-?(?:\\d+)?\\.?\\d+) *(milliseconds?|msecs?|ms|seconds?|secs?|s|minutes?|mins?|m|hours?|hrs?|h|days?|d|weeks?|w|years?|yrs?|y)?$/i.exec(\n str\n );\n if (!match) {\n return;\n }\n var n = parseFloat(match[1]);\n var type = (match[2] || 'ms').toLowerCase();\n switch (type) {\n case 'years':\n case 'year':\n case 'yrs':\n case 'yr':\n case 'y':\n return n * y;\n case 'weeks':\n case 'week':\n case 'w':\n return n * w;\n case 'days':\n case 'day':\n case 'd':\n return n * d;\n case 'hours':\n case 'hour':\n case 'hrs':\n case 'hr':\n case 'h':\n return n * h;\n case 'minutes':\n case 'minute':\n case 'mins':\n case 'min':\n case 'm':\n return n * m;\n case 'seconds':\n case 'second':\n case 'secs':\n case 'sec':\n case 's':\n return n * s;\n case 'milliseconds':\n case 'millisecond':\n case 'msecs':\n case 'msec':\n case 'ms':\n return n;\n default:\n return undefined;\n }\n}\n\n/**\n * Short format for `ms`.\n *\n * @param {Number} ms\n * @return {String}\n * @api private\n */\n\nfunction fmtShort(ms) {\n var msAbs = Math.abs(ms);\n if (msAbs >= d) {\n return Math.round(ms / d) + 'd';\n }\n if (msAbs >= h) {\n return Math.round(ms / h) + 'h';\n }\n if (msAbs >= m) {\n return Math.round(ms / m) + 'm';\n }\n if (msAbs >= s) {\n return Math.round(ms / s) + 's';\n }\n return ms + 'ms';\n}\n\n/**\n * Long format for `ms`.\n *\n * @param {Number} ms\n * @return {String}\n * @api private\n */\n\nfunction fmtLong(ms) {\n var msAbs = Math.abs(ms);\n if (msAbs >= d) {\n return plural(ms, msAbs, d, 'day');\n }\n if (msAbs >= h) {\n return plural(ms, msAbs, h, 'hour');\n }\n if (msAbs >= m) {\n return plural(ms, msAbs, m, 'minute');\n }\n if (msAbs >= s) {\n return plural(ms, msAbs, s, 'second');\n }\n return ms + ' ms';\n}\n\n/**\n * Pluralization helper.\n */\n\nfunction plural(ms, msAbs, n, name) {\n var isPlural = msAbs >= n * 1.5;\n return Math.round(ms / n) + ' ' + name + (isPlural ? 's' : '');\n}\n","module.exports = require('./lib/murmurHash3js');\n","/* jshint -W086: true */\n// +----------------------------------------------------------------------+\n// | murmurHash3js.js v3.0.1 // https://github.com/pid/murmurHash3js\n// | A javascript implementation of MurmurHash3's x86 hashing algorithms. |\n// |----------------------------------------------------------------------|\n// | Copyright (c) 2012-2015 Karan Lyons |\n// | https://github.com/karanlyons/murmurHash3.js/blob/c1778f75792abef7bdd74bc85d2d4e1a3d25cfe9/murmurHash3.js |\n// | Freely distributable under the MIT license. |\n// +----------------------------------------------------------------------+\n\n;(function (root, undefined) {\n 'use strict';\n\n // Create a local object that'll be exported or referenced globally.\n var library = {\n 'version': '3.0.0',\n 'x86': {},\n 'x64': {},\n 'inputValidation': true\n };\n\n // PRIVATE FUNCTIONS\n // -----------------\n\n function _validBytes(bytes) {\n // check the input is an array or a typed array\n if (!Array.isArray(bytes) && !ArrayBuffer.isView(bytes)) {\n return false;\n }\n\n // check all bytes are actually bytes\n for (var i = 0; i < bytes.length; i++) {\n if (!Number.isInteger(bytes[i]) || bytes[i] < 0 || bytes[i] > 255) {\n return false;\n }\n }\n return true;\n }\n\n function _x86Multiply(m, n) {\n //\n // Given two 32bit ints, returns the two multiplied together as a\n // 32bit int.\n //\n\n return ((m & 0xffff) * n) + ((((m >>> 16) * n) & 0xffff) << 16);\n }\n\n function _x86Rotl(m, n) {\n //\n // Given a 32bit int and an int representing a number of bit positions,\n // returns the 32bit int rotated left by that number of positions.\n //\n\n return (m << n) | (m >>> (32 - n));\n }\n\n function _x86Fmix(h) {\n //\n // Given a block, returns murmurHash3's final x86 mix of that block.\n //\n\n h ^= h >>> 16;\n h = _x86Multiply(h, 0x85ebca6b);\n h ^= h >>> 13;\n h = _x86Multiply(h, 0xc2b2ae35);\n h ^= h >>> 16;\n\n return h;\n }\n\n function _x64Add(m, n) {\n //\n // Given two 64bit ints (as an array of two 32bit ints) returns the two\n // added together as a 64bit int (as an array of two 32bit ints).\n //\n\n m = [m[0] >>> 16, m[0] & 0xffff, m[1] >>> 16, m[1] & 0xffff];\n n = [n[0] >>> 16, n[0] & 0xffff, n[1] >>> 16, n[1] & 0xffff];\n var o = [0, 0, 0, 0];\n\n o[3] += m[3] + n[3];\n o[2] += o[3] >>> 16;\n o[3] &= 0xffff;\n\n o[2] += m[2] + n[2];\n o[1] += o[2] >>> 16;\n o[2] &= 0xffff;\n\n o[1] += m[1] + n[1];\n o[0] += o[1] >>> 16;\n o[1] &= 0xffff;\n\n o[0] += m[0] + n[0];\n o[0] &= 0xffff;\n\n return [(o[0] << 16) | o[1], (o[2] << 16) | o[3]];\n }\n\n function _x64Multiply(m, n) {\n //\n // Given two 64bit ints (as an array of two 32bit ints) returns the two\n // multiplied together as a 64bit int (as an array of two 32bit ints).\n //\n\n m = [m[0] >>> 16, m[0] & 0xffff, m[1] >>> 16, m[1] & 0xffff];\n n = [n[0] >>> 16, n[0] & 0xffff, n[1] >>> 16, n[1] & 0xffff];\n var o = [0, 0, 0, 0];\n\n o[3] += m[3] * n[3];\n o[2] += o[3] >>> 16;\n o[3] &= 0xffff;\n\n o[2] += m[2] * n[3];\n o[1] += o[2] >>> 16;\n o[2] &= 0xffff;\n\n o[2] += m[3] * n[2];\n o[1] += o[2] >>> 16;\n o[2] &= 0xffff;\n\n o[1] += m[1] * n[3];\n o[0] += o[1] >>> 16;\n o[1] &= 0xffff;\n\n o[1] += m[2] * n[2];\n o[0] += o[1] >>> 16;\n o[1] &= 0xffff;\n\n o[1] += m[3] * n[1];\n o[0] += o[1] >>> 16;\n o[1] &= 0xffff;\n\n o[0] += (m[0] * n[3]) + (m[1] * n[2]) + (m[2] * n[1]) + (m[3] * n[0]);\n o[0] &= 0xffff;\n\n return [(o[0] << 16) | o[1], (o[2] << 16) | o[3]];\n }\n\n function _x64Rotl(m, n) {\n //\n // Given a 64bit int (as an array of two 32bit ints) and an int\n // representing a number of bit positions, returns the 64bit int (as an\n // array of two 32bit ints) rotated left by that number of positions.\n //\n\n n %= 64;\n\n if (n === 32) {\n return [m[1], m[0]];\n } else if (n < 32) {\n return [(m[0] << n) | (m[1] >>> (32 - n)), (m[1] << n) | (m[0] >>> (32 - n))];\n } else {\n n -= 32;\n return [(m[1] << n) | (m[0] >>> (32 - n)), (m[0] << n) | (m[1] >>> (32 - n))];\n }\n }\n\n function _x64LeftShift(m, n) {\n //\n // Given a 64bit int (as an array of two 32bit ints) and an int\n // representing a number of bit positions, returns the 64bit int (as an\n // array of two 32bit ints) shifted left by that number of positions.\n //\n\n n %= 64;\n\n if (n === 0) {\n return m;\n } else if (n < 32) {\n return [(m[0] << n) | (m[1] >>> (32 - n)), m[1] << n];\n } else {\n return [m[1] << (n - 32), 0];\n }\n }\n\n function _x64Xor(m, n) {\n //\n // Given two 64bit ints (as an array of two 32bit ints) returns the two\n // xored together as a 64bit int (as an array of two 32bit ints).\n //\n\n return [m[0] ^ n[0], m[1] ^ n[1]];\n }\n\n function _x64Fmix(h) {\n //\n // Given a block, returns murmurHash3's final x64 mix of that block.\n // (`[0, h[0] >>> 1]` is a 33 bit unsigned right shift. This is the\n // only place where we need to right shift 64bit ints.)\n //\n\n h = _x64Xor(h, [0, h[0] >>> 1]);\n h = _x64Multiply(h, [0xff51afd7, 0xed558ccd]);\n h = _x64Xor(h, [0, h[0] >>> 1]);\n h = _x64Multiply(h, [0xc4ceb9fe, 0x1a85ec53]);\n h = _x64Xor(h, [0, h[0] >>> 1]);\n\n return h;\n }\n\n // PUBLIC FUNCTIONS\n // ----------------\n\n library.x86.hash32 = function (bytes, seed) {\n //\n // Given a string and an optional seed as an int, returns a 32 bit hash\n // using the x86 flavor of MurmurHash3, as an unsigned int.\n //\n if (library.inputValidation && !_validBytes(bytes)) {\n return undefined;\n }\n seed = seed || 0;\n\n var remainder = bytes.length % 4;\n var blocks = bytes.length - remainder;\n\n var h1 = seed;\n\n var k1 = 0;\n\n var c1 = 0xcc9e2d51;\n var c2 = 0x1b873593;\n\n for (var i = 0; i < blocks; i = i + 4) {\n k1 = (bytes[i]) | (bytes[i + 1] << 8) | (bytes[i + 2] << 16) | (bytes[i + 3] << 24);\n\n k1 = _x86Multiply(k1, c1);\n k1 = _x86Rotl(k1, 15);\n k1 = _x86Multiply(k1, c2);\n\n h1 ^= k1;\n h1 = _x86Rotl(h1, 13);\n h1 = _x86Multiply(h1, 5) + 0xe6546b64;\n }\n\n k1 = 0;\n\n switch (remainder) {\n case 3:\n k1 ^= bytes[i + 2] << 16;\n\n case 2:\n k1 ^= bytes[i + 1] << 8;\n\n case 1:\n k1 ^= bytes[i];\n k1 = _x86Multiply(k1, c1);\n k1 = _x86Rotl(k1, 15);\n k1 = _x86Multiply(k1, c2);\n h1 ^= k1;\n }\n\n h1 ^= bytes.length;\n h1 = _x86Fmix(h1);\n\n return h1 >>> 0;\n };\n\n library.x86.hash128 = function (bytes, seed) {\n //\n // Given a string and an optional seed as an int, returns a 128 bit\n // hash using the x86 flavor of MurmurHash3, as an unsigned hex.\n //\n if (library.inputValidation && !_validBytes(bytes)) {\n return undefined;\n }\n\n seed = seed || 0;\n var remainder = bytes.length % 16;\n var blocks = bytes.length - remainder;\n\n var h1 = seed;\n var h2 = seed;\n var h3 = seed;\n var h4 = seed;\n\n var k1 = 0;\n var k2 = 0;\n var k3 = 0;\n var k4 = 0;\n\n var c1 = 0x239b961b;\n var c2 = 0xab0e9789;\n var c3 = 0x38b34ae5;\n var c4 = 0xa1e38b93;\n\n for (var i = 0; i < blocks; i = i + 16) {\n k1 = (bytes[i]) | (bytes[i + 1] << 8) | (bytes[i + 2] << 16) | (bytes[i + 3] << 24);\n k2 = (bytes[i + 4]) | (bytes[i + 5] << 8) | (bytes[i + 6] << 16) | (bytes[i + 7] << 24);\n k3 = (bytes[i + 8]) | (bytes[i + 9] << 8) | (bytes[i + 10] << 16) | (bytes[i + 11] << 24);\n k4 = (bytes[i + 12]) | (bytes[i + 13] << 8) | (bytes[i + 14] << 16) | (bytes[i + 15] << 24);\n\n k1 = _x86Multiply(k1, c1);\n k1 = _x86Rotl(k1, 15);\n k1 = _x86Multiply(k1, c2);\n h1 ^= k1;\n\n h1 = _x86Rotl(h1, 19);\n h1 += h2;\n h1 = _x86Multiply(h1, 5) + 0x561ccd1b;\n\n k2 = _x86Multiply(k2, c2);\n k2 = _x86Rotl(k2, 16);\n k2 = _x86Multiply(k2, c3);\n h2 ^= k2;\n\n h2 = _x86Rotl(h2, 17);\n h2 += h3;\n h2 = _x86Multiply(h2, 5) + 0x0bcaa747;\n\n k3 = _x86Multiply(k3, c3);\n k3 = _x86Rotl(k3, 17);\n k3 = _x86Multiply(k3, c4);\n h3 ^= k3;\n\n h3 = _x86Rotl(h3, 15);\n h3 += h4;\n h3 = _x86Multiply(h3, 5) + 0x96cd1c35;\n\n k4 = _x86Multiply(k4, c4);\n k4 = _x86Rotl(k4, 18);\n k4 = _x86Multiply(k4, c1);\n h4 ^= k4;\n\n h4 = _x86Rotl(h4, 13);\n h4 += h1;\n h4 = _x86Multiply(h4, 5) + 0x32ac3b17;\n }\n\n k1 = 0;\n k2 = 0;\n k3 = 0;\n k4 = 0;\n\n switch (remainder) {\n case 15:\n k4 ^= bytes[i + 14] << 16;\n\n case 14:\n k4 ^= bytes[i + 13] << 8;\n\n case 13:\n k4 ^= bytes[i + 12];\n k4 = _x86Multiply(k4, c4);\n k4 = _x86Rotl(k4, 18);\n k4 = _x86Multiply(k4, c1);\n h4 ^= k4;\n\n case 12:\n k3 ^= bytes[i + 11] << 24;\n\n case 11:\n k3 ^= bytes[i + 10] << 16;\n\n case 10:\n k3 ^= bytes[i + 9] << 8;\n\n case 9:\n k3 ^= bytes[i + 8];\n k3 = _x86Multiply(k3, c3);\n k3 = _x86Rotl(k3, 17);\n k3 = _x86Multiply(k3, c4);\n h3 ^= k3;\n\n case 8:\n k2 ^= bytes[i + 7] << 24;\n\n case 7:\n k2 ^= bytes[i + 6] << 16;\n\n case 6:\n k2 ^= bytes[i + 5] << 8;\n\n case 5:\n k2 ^= bytes[i + 4];\n k2 = _x86Multiply(k2, c2);\n k2 = _x86Rotl(k2, 16);\n k2 = _x86Multiply(k2, c3);\n h2 ^= k2;\n\n case 4:\n k1 ^= bytes[i + 3] << 24;\n\n case 3:\n k1 ^= bytes[i + 2] << 16;\n\n case 2:\n k1 ^= bytes[i + 1] << 8;\n\n case 1:\n k1 ^= bytes[i];\n k1 = _x86Multiply(k1, c1);\n k1 = _x86Rotl(k1, 15);\n k1 = _x86Multiply(k1, c2);\n h1 ^= k1;\n }\n\n h1 ^= bytes.length;\n h2 ^= bytes.length;\n h3 ^= bytes.length;\n h4 ^= bytes.length;\n\n h1 += h2;\n h1 += h3;\n h1 += h4;\n h2 += h1;\n h3 += h1;\n h4 += h1;\n\n h1 = _x86Fmix(h1);\n h2 = _x86Fmix(h2);\n h3 = _x86Fmix(h3);\n h4 = _x86Fmix(h4);\n\n h1 += h2;\n h1 += h3;\n h1 += h4;\n h2 += h1;\n h3 += h1;\n h4 += h1;\n\n return (\"00000000\" + (h1 >>> 0).toString(16)).slice(-8) + (\"00000000\" + (h2 >>> 0).toString(16)).slice(-8) + (\"00000000\" + (h3 >>> 0).toString(16)).slice(-8) + (\"00000000\" + (h4 >>> 0).toString(16)).slice(-8);\n };\n\n library.x64.hash128 = function (bytes, seed) {\n //\n // Given a string and an optional seed as an int, returns a 128 bit\n // hash using the x64 flavor of MurmurHash3, as an unsigned hex.\n //\n if (library.inputValidation && !_validBytes(bytes)) {\n return undefined;\n }\n seed = seed || 0;\n\n var remainder = bytes.length % 16;\n var blocks = bytes.length - remainder;\n\n var h1 = [0, seed];\n var h2 = [0, seed];\n\n var k1 = [0, 0];\n var k2 = [0, 0];\n\n var c1 = [0x87c37b91, 0x114253d5];\n var c2 = [0x4cf5ad43, 0x2745937f];\n\n for (var i = 0; i < blocks; i = i + 16) {\n k1 = [(bytes[i + 4]) | (bytes[i + 5] << 8) | (bytes[i + 6] << 16) | (bytes[i + 7] << 24), (bytes[i]) |\n (bytes[i + 1] << 8) | (bytes[i + 2] << 16) | (bytes[i + 3] << 24)];\n k2 = [(bytes[i + 12]) | (bytes[i + 13] << 8) | (bytes[i + 14] << 16) | (bytes[i + 15] << 24), (bytes[i + 8]) |\n (bytes[i + 9] << 8) | (bytes[i + 10] << 16) | (bytes[i + 11] << 24)];\n\n k1 = _x64Multiply(k1, c1);\n k1 = _x64Rotl(k1, 31);\n k1 = _x64Multiply(k1, c2);\n h1 = _x64Xor(h1, k1);\n\n h1 = _x64Rotl(h1, 27);\n h1 = _x64Add(h1, h2);\n h1 = _x64Add(_x64Multiply(h1, [0, 5]), [0, 0x52dce729]);\n\n k2 = _x64Multiply(k2, c2);\n k2 = _x64Rotl(k2, 33);\n k2 = _x64Multiply(k2, c1);\n h2 = _x64Xor(h2, k2);\n\n h2 = _x64Rotl(h2, 31);\n h2 = _x64Add(h2, h1);\n h2 = _x64Add(_x64Multiply(h2, [0, 5]), [0, 0x38495ab5]);\n }\n\n k1 = [0, 0];\n k2 = [0, 0];\n\n switch (remainder) {\n case 15:\n k2 = _x64Xor(k2, _x64LeftShift([0, bytes[i + 14]], 48));\n\n case 14:\n k2 = _x64Xor(k2, _x64LeftShift([0, bytes[i + 13]], 40));\n\n case 13:\n k2 = _x64Xor(k2, _x64LeftShift([0, bytes[i + 12]], 32));\n\n case 12:\n k2 = _x64Xor(k2, _x64LeftShift([0, bytes[i + 11]], 24));\n\n case 11:\n k2 = _x64Xor(k2, _x64LeftShift([0, bytes[i + 10]], 16));\n\n case 10:\n k2 = _x64Xor(k2, _x64LeftShift([0, bytes[i + 9]], 8));\n\n case 9:\n k2 = _x64Xor(k2, [0, bytes[i + 8]]);\n k2 = _x64Multiply(k2, c2);\n k2 = _x64Rotl(k2, 33);\n k2 = _x64Multiply(k2, c1);\n h2 = _x64Xor(h2, k2);\n\n case 8:\n k1 = _x64Xor(k1, _x64LeftShift([0, bytes[i + 7]], 56));\n\n case 7:\n k1 = _x64Xor(k1, _x64LeftShift([0, bytes[i + 6]], 48));\n\n case 6:\n k1 = _x64Xor(k1, _x64LeftShift([0, bytes[i + 5]], 40));\n\n case 5:\n k1 = _x64Xor(k1, _x64LeftShift([0, bytes[i + 4]], 32));\n\n case 4:\n k1 = _x64Xor(k1, _x64LeftShift([0, bytes[i + 3]], 24));\n\n case 3:\n k1 = _x64Xor(k1, _x64LeftShift([0, bytes[i + 2]], 16));\n\n case 2:\n k1 = _x64Xor(k1, _x64LeftShift([0, bytes[i + 1]], 8));\n\n case 1:\n k1 = _x64Xor(k1, [0, bytes[i]]);\n k1 = _x64Multiply(k1, c1);\n k1 = _x64Rotl(k1, 31);\n k1 = _x64Multiply(k1, c2);\n h1 = _x64Xor(h1, k1);\n }\n\n h1 = _x64Xor(h1, [0, bytes.length]);\n h2 = _x64Xor(h2, [0, bytes.length]);\n\n h1 = _x64Add(h1, h2);\n h2 = _x64Add(h2, h1);\n\n h1 = _x64Fmix(h1);\n h2 = _x64Fmix(h2);\n\n h1 = _x64Add(h1, h2);\n h2 = _x64Add(h2, h1);\n\n return (\"00000000\" + (h1[0] >>> 0).toString(16)).slice(-8) + (\"00000000\" + (h1[1] >>> 0).toString(16)).slice(-8) + (\"00000000\" + (h2[0] >>> 0).toString(16)).slice(-8) + (\"00000000\" + (h2[1] >>> 0).toString(16)).slice(-8);\n };\n\n // INITIALIZATION\n // --------------\n\n // Export murmurHash3 for CommonJS, either as an AMD module or just as part\n // of the global object.\n if (typeof exports !== 'undefined') {\n\n if (typeof module !== 'undefined' && module.exports) {\n exports = module.exports = library;\n }\n\n exports.murmurHash3 = library;\n\n } else if (typeof define === 'function' && define.amd) {\n\n define([], function () {\n return library;\n });\n } else {\n\n // Use murmurHash3.noConflict to restore `murmurHash3` back to its\n // original value. Returns a reference to the library object, to allow\n // it to be used under a different name.\n library._murmurHash3 = root.murmurHash3;\n\n library.noConflict = function () {\n root.murmurHash3 = library._murmurHash3;\n library._murmurHash3 = undefined;\n library.noConflict = undefined;\n\n return library;\n };\n\n root.murmurHash3 = library;\n }\n})(this);\n","// Generated by CoffeeScript 1.12.7\n(function() {\n var Netmask, atob, chr, chr0, chrA, chra, ip2long, long2ip;\n\n long2ip = function(long) {\n var a, b, c, d;\n a = (long & (0xff << 24)) >>> 24;\n b = (long & (0xff << 16)) >>> 16;\n c = (long & (0xff << 8)) >>> 8;\n d = long & 0xff;\n return [a, b, c, d].join('.');\n };\n\n ip2long = function(ip) {\n var b, c, i, j, n, ref;\n b = [];\n for (i = j = 0; j <= 3; i = ++j) {\n if (ip.length === 0) {\n break;\n }\n if (i > 0) {\n if (ip[0] !== '.') {\n throw new Error('Invalid IP');\n }\n ip = ip.substring(1);\n }\n ref = atob(ip), n = ref[0], c = ref[1];\n ip = ip.substring(c);\n b.push(n);\n }\n if (ip.length !== 0) {\n throw new Error('Invalid IP');\n }\n switch (b.length) {\n case 1:\n if (b[0] > 0xFFFFFFFF) {\n throw new Error('Invalid IP');\n }\n return b[0] >>> 0;\n case 2:\n if (b[0] > 0xFF || b[1] > 0xFFFFFF) {\n throw new Error('Invalid IP');\n }\n return (b[0] << 24 | b[1]) >>> 0;\n case 3:\n if (b[0] > 0xFF || b[1] > 0xFF || b[2] > 0xFFFF) {\n throw new Error('Invalid IP');\n }\n return (b[0] << 24 | b[1] << 16 | b[2]) >>> 0;\n case 4:\n if (b[0] > 0xFF || b[1] > 0xFF || b[2] > 0xFF || b[3] > 0xFF) {\n throw new Error('Invalid IP');\n }\n return (b[0] << 24 | b[1] << 16 | b[2] << 8 | b[3]) >>> 0;\n default:\n throw new Error('Invalid IP');\n }\n };\n\n chr = function(b) {\n return b.charCodeAt(0);\n };\n\n chr0 = chr('0');\n\n chra = chr('a');\n\n chrA = chr('A');\n\n atob = function(s) {\n var base, dmax, i, n, start;\n n = 0;\n base = 10;\n dmax = '9';\n i = 0;\n if (s.length > 1 && s[i] === '0') {\n if (s[i + 1] === 'x' || s[i + 1] === 'X') {\n i += 2;\n base = 16;\n } else if ('0' <= s[i + 1] && s[i + 1] <= '9') {\n i++;\n base = 8;\n dmax = '7';\n }\n }\n start = i;\n while (i < s.length) {\n if ('0' <= s[i] && s[i] <= dmax) {\n n = (n * base + (chr(s[i]) - chr0)) >>> 0;\n } else if (base === 16) {\n if ('a' <= s[i] && s[i] <= 'f') {\n n = (n * base + (10 + chr(s[i]) - chra)) >>> 0;\n } else if ('A' <= s[i] && s[i] <= 'F') {\n n = (n * base + (10 + chr(s[i]) - chrA)) >>> 0;\n } else {\n break;\n }\n } else {\n break;\n }\n if (n > 0xFFFFFFFF) {\n throw new Error('too large');\n }\n i++;\n }\n if (i === start) {\n throw new Error('empty octet');\n }\n return [n, i];\n };\n\n Netmask = (function() {\n function Netmask(net, mask) {\n var error, i, j, ref;\n if (typeof net !== 'string') {\n throw new Error(\"Missing `net' parameter\");\n }\n if (!mask) {\n ref = net.split('/', 2), net = ref[0], mask = ref[1];\n }\n if (!mask) {\n mask = 32;\n }\n if (typeof mask === 'string' && mask.indexOf('.') > -1) {\n try {\n this.maskLong = ip2long(mask);\n } catch (error1) {\n error = error1;\n throw new Error(\"Invalid mask: \" + mask);\n }\n for (i = j = 32; j >= 0; i = --j) {\n if (this.maskLong === (0xffffffff << (32 - i)) >>> 0) {\n this.bitmask = i;\n break;\n }\n }\n } else if (mask || mask === 0) {\n this.bitmask = parseInt(mask, 10);\n this.maskLong = 0;\n if (this.bitmask > 0) {\n this.maskLong = (0xffffffff << (32 - this.bitmask)) >>> 0;\n }\n } else {\n throw new Error(\"Invalid mask: empty\");\n }\n try {\n this.netLong = (ip2long(net) & this.maskLong) >>> 0;\n } catch (error1) {\n error = error1;\n throw new Error(\"Invalid net address: \" + net);\n }\n if (!(this.bitmask <= 32)) {\n throw new Error(\"Invalid mask for ip4: \" + mask);\n }\n this.size = Math.pow(2, 32 - this.bitmask);\n this.base = long2ip(this.netLong);\n this.mask = long2ip(this.maskLong);\n this.hostmask = long2ip(~this.maskLong);\n this.first = this.bitmask <= 30 ? long2ip(this.netLong + 1) : this.base;\n this.last = this.bitmask <= 30 ? long2ip(this.netLong + this.size - 2) : long2ip(this.netLong + this.size - 1);\n this.broadcast = this.bitmask <= 30 ? long2ip(this.netLong + this.size - 1) : void 0;\n }\n\n Netmask.prototype.contains = function(ip) {\n if (typeof ip === 'string' && (ip.indexOf('/') > 0 || ip.split('.').length !== 4)) {\n ip = new Netmask(ip);\n }\n if (ip instanceof Netmask) {\n return this.contains(ip.base) && this.contains(ip.broadcast || ip.last);\n } else {\n return (ip2long(ip) & this.maskLong) >>> 0 === (this.netLong & this.maskLong) >>> 0;\n }\n };\n\n Netmask.prototype.next = function(count) {\n if (count == null) {\n count = 1;\n }\n return new Netmask(long2ip(this.netLong + (this.size * count)), this.mask);\n };\n\n Netmask.prototype.forEach = function(fn) {\n var index, lastLong, long;\n long = ip2long(this.first);\n lastLong = ip2long(this.last);\n index = 0;\n while (long <= lastLong) {\n fn(long2ip(long), long, index);\n index++;\n long++;\n }\n };\n\n Netmask.prototype.toString = function() {\n return this.base + \"/\" + this.bitmask;\n };\n\n return Netmask;\n\n })();\n\n exports.ip2long = ip2long;\n\n exports.long2ip = long2ip;\n\n exports.Netmask = Netmask;\n\n}).call(this);\n","// full library entry point.\r\n\r\n\"use strict\";\r\nmodule.exports = require(\"./src/index\");\r\n","\"use strict\";\r\nmodule.exports = common;\r\n\r\nvar commonRe = /\\/|\\./;\r\n\r\n/**\r\n * Provides common type definitions.\r\n * Can also be used to provide additional google types or your own custom types.\r\n * @param {string} name Short name as in `google/protobuf/[name].proto` or full file name\r\n * @param {Object.} json JSON definition within `google.protobuf` if a short name, otherwise the file's root definition\r\n * @returns {undefined}\r\n * @property {INamespace} google/protobuf/any.proto Any\r\n * @property {INamespace} google/protobuf/duration.proto Duration\r\n * @property {INamespace} google/protobuf/empty.proto Empty\r\n * @property {INamespace} google/protobuf/field_mask.proto FieldMask\r\n * @property {INamespace} google/protobuf/struct.proto Struct, Value, NullValue and ListValue\r\n * @property {INamespace} google/protobuf/timestamp.proto Timestamp\r\n * @property {INamespace} google/protobuf/wrappers.proto Wrappers\r\n * @example\r\n * // manually provides descriptor.proto (assumes google/protobuf/ namespace and .proto extension)\r\n * protobuf.common(\"descriptor\", descriptorJson);\r\n *\r\n * // manually provides a custom definition (uses my.foo namespace)\r\n * protobuf.common(\"my/foo/bar.proto\", myFooBarJson);\r\n */\r\nfunction common(name, json) {\r\n if (!commonRe.test(name)) {\r\n name = \"google/protobuf/\" + name + \".proto\";\r\n json = { nested: { google: { nested: { protobuf: { nested: json } } } } };\r\n }\r\n common[name] = json;\r\n}\r\n\r\n// Not provided because of limited use (feel free to discuss or to provide yourself):\r\n//\r\n// google/protobuf/descriptor.proto\r\n// google/protobuf/source_context.proto\r\n// google/protobuf/type.proto\r\n//\r\n// Stripped and pre-parsed versions of these non-bundled files are instead available as part of\r\n// the repository or package within the google/protobuf directory.\r\n\r\ncommon(\"any\", {\r\n\r\n /**\r\n * Properties of a google.protobuf.Any message.\r\n * @interface IAny\r\n * @type {Object}\r\n * @property {string} [typeUrl]\r\n * @property {Uint8Array} [bytes]\r\n * @memberof common\r\n */\r\n Any: {\r\n fields: {\r\n type_url: {\r\n type: \"string\",\r\n id: 1\r\n },\r\n value: {\r\n type: \"bytes\",\r\n id: 2\r\n }\r\n }\r\n }\r\n});\r\n\r\nvar timeType;\r\n\r\ncommon(\"duration\", {\r\n\r\n /**\r\n * Properties of a google.protobuf.Duration message.\r\n * @interface IDuration\r\n * @type {Object}\r\n * @property {number|Long} [seconds]\r\n * @property {number} [nanos]\r\n * @memberof common\r\n */\r\n Duration: timeType = {\r\n fields: {\r\n seconds: {\r\n type: \"int64\",\r\n id: 1\r\n },\r\n nanos: {\r\n type: \"int32\",\r\n id: 2\r\n }\r\n }\r\n }\r\n});\r\n\r\ncommon(\"timestamp\", {\r\n\r\n /**\r\n * Properties of a google.protobuf.Timestamp message.\r\n * @interface ITimestamp\r\n * @type {Object}\r\n * @property {number|Long} [seconds]\r\n * @property {number} [nanos]\r\n * @memberof common\r\n */\r\n Timestamp: timeType\r\n});\r\n\r\ncommon(\"empty\", {\r\n\r\n /**\r\n * Properties of a google.protobuf.Empty message.\r\n * @interface IEmpty\r\n * @memberof common\r\n */\r\n Empty: {\r\n fields: {}\r\n }\r\n});\r\n\r\ncommon(\"struct\", {\r\n\r\n /**\r\n * Properties of a google.protobuf.Struct message.\r\n * @interface IStruct\r\n * @type {Object}\r\n * @property {Object.} [fields]\r\n * @memberof common\r\n */\r\n Struct: {\r\n fields: {\r\n fields: {\r\n keyType: \"string\",\r\n type: \"Value\",\r\n id: 1\r\n }\r\n }\r\n },\r\n\r\n /**\r\n * Properties of a google.protobuf.Value message.\r\n * @interface IValue\r\n * @type {Object}\r\n * @property {string} [kind]\r\n * @property {0} [nullValue]\r\n * @property {number} [numberValue]\r\n * @property {string} [stringValue]\r\n * @property {boolean} [boolValue]\r\n * @property {IStruct} [structValue]\r\n * @property {IListValue} [listValue]\r\n * @memberof common\r\n */\r\n Value: {\r\n oneofs: {\r\n kind: {\r\n oneof: [\r\n \"nullValue\",\r\n \"numberValue\",\r\n \"stringValue\",\r\n \"boolValue\",\r\n \"structValue\",\r\n \"listValue\"\r\n ]\r\n }\r\n },\r\n fields: {\r\n nullValue: {\r\n type: \"NullValue\",\r\n id: 1\r\n },\r\n numberValue: {\r\n type: \"double\",\r\n id: 2\r\n },\r\n stringValue: {\r\n type: \"string\",\r\n id: 3\r\n },\r\n boolValue: {\r\n type: \"bool\",\r\n id: 4\r\n },\r\n structValue: {\r\n type: \"Struct\",\r\n id: 5\r\n },\r\n listValue: {\r\n type: \"ListValue\",\r\n id: 6\r\n }\r\n }\r\n },\r\n\r\n NullValue: {\r\n values: {\r\n NULL_VALUE: 0\r\n }\r\n },\r\n\r\n /**\r\n * Properties of a google.protobuf.ListValue message.\r\n * @interface IListValue\r\n * @type {Object}\r\n * @property {Array.} [values]\r\n * @memberof common\r\n */\r\n ListValue: {\r\n fields: {\r\n values: {\r\n rule: \"repeated\",\r\n type: \"Value\",\r\n id: 1\r\n }\r\n }\r\n }\r\n});\r\n\r\ncommon(\"wrappers\", {\r\n\r\n /**\r\n * Properties of a google.protobuf.DoubleValue message.\r\n * @interface IDoubleValue\r\n * @type {Object}\r\n * @property {number} [value]\r\n * @memberof common\r\n */\r\n DoubleValue: {\r\n fields: {\r\n value: {\r\n type: \"double\",\r\n id: 1\r\n }\r\n }\r\n },\r\n\r\n /**\r\n * Properties of a google.protobuf.FloatValue message.\r\n * @interface IFloatValue\r\n * @type {Object}\r\n * @property {number} [value]\r\n * @memberof common\r\n */\r\n FloatValue: {\r\n fields: {\r\n value: {\r\n type: \"float\",\r\n id: 1\r\n }\r\n }\r\n },\r\n\r\n /**\r\n * Properties of a google.protobuf.Int64Value message.\r\n * @interface IInt64Value\r\n * @type {Object}\r\n * @property {number|Long} [value]\r\n * @memberof common\r\n */\r\n Int64Value: {\r\n fields: {\r\n value: {\r\n type: \"int64\",\r\n id: 1\r\n }\r\n }\r\n },\r\n\r\n /**\r\n * Properties of a google.protobuf.UInt64Value message.\r\n * @interface IUInt64Value\r\n * @type {Object}\r\n * @property {number|Long} [value]\r\n * @memberof common\r\n */\r\n UInt64Value: {\r\n fields: {\r\n value: {\r\n type: \"uint64\",\r\n id: 1\r\n }\r\n }\r\n },\r\n\r\n /**\r\n * Properties of a google.protobuf.Int32Value message.\r\n * @interface IInt32Value\r\n * @type {Object}\r\n * @property {number} [value]\r\n * @memberof common\r\n */\r\n Int32Value: {\r\n fields: {\r\n value: {\r\n type: \"int32\",\r\n id: 1\r\n }\r\n }\r\n },\r\n\r\n /**\r\n * Properties of a google.protobuf.UInt32Value message.\r\n * @interface IUInt32Value\r\n * @type {Object}\r\n * @property {number} [value]\r\n * @memberof common\r\n */\r\n UInt32Value: {\r\n fields: {\r\n value: {\r\n type: \"uint32\",\r\n id: 1\r\n }\r\n }\r\n },\r\n\r\n /**\r\n * Properties of a google.protobuf.BoolValue message.\r\n * @interface IBoolValue\r\n * @type {Object}\r\n * @property {boolean} [value]\r\n * @memberof common\r\n */\r\n BoolValue: {\r\n fields: {\r\n value: {\r\n type: \"bool\",\r\n id: 1\r\n }\r\n }\r\n },\r\n\r\n /**\r\n * Properties of a google.protobuf.StringValue message.\r\n * @interface IStringValue\r\n * @type {Object}\r\n * @property {string} [value]\r\n * @memberof common\r\n */\r\n StringValue: {\r\n fields: {\r\n value: {\r\n type: \"string\",\r\n id: 1\r\n }\r\n }\r\n },\r\n\r\n /**\r\n * Properties of a google.protobuf.BytesValue message.\r\n * @interface IBytesValue\r\n * @type {Object}\r\n * @property {Uint8Array} [value]\r\n * @memberof common\r\n */\r\n BytesValue: {\r\n fields: {\r\n value: {\r\n type: \"bytes\",\r\n id: 1\r\n }\r\n }\r\n }\r\n});\r\n\r\ncommon(\"field_mask\", {\r\n\r\n /**\r\n * Properties of a google.protobuf.FieldMask message.\r\n * @interface IDoubleValue\r\n * @type {Object}\r\n * @property {number} [value]\r\n * @memberof common\r\n */\r\n FieldMask: {\r\n fields: {\r\n paths: {\r\n rule: \"repeated\",\r\n type: \"string\",\r\n id: 1\r\n }\r\n }\r\n }\r\n});\r\n\r\n/**\r\n * Gets the root definition of the specified common proto file.\r\n *\r\n * Bundled definitions are:\r\n * - google/protobuf/any.proto\r\n * - google/protobuf/duration.proto\r\n * - google/protobuf/empty.proto\r\n * - google/protobuf/field_mask.proto\r\n * - google/protobuf/struct.proto\r\n * - google/protobuf/timestamp.proto\r\n * - google/protobuf/wrappers.proto\r\n *\r\n * @param {string} file Proto file name\r\n * @returns {INamespace|null} Root definition or `null` if not defined\r\n */\r\ncommon.get = function get(file) {\r\n return common[file] || null;\r\n};\r\n","\"use strict\";\r\n/**\r\n * Runtime message from/to plain object converters.\r\n * @namespace\r\n */\r\nvar converter = exports;\r\n\r\nvar Enum = require(\"./enum\"),\r\n util = require(\"./util\");\r\n\r\n/**\r\n * Generates a partial value fromObject conveter.\r\n * @param {Codegen} gen Codegen instance\r\n * @param {Field} field Reflected field\r\n * @param {number} fieldIndex Field index\r\n * @param {string} prop Property reference\r\n * @returns {Codegen} Codegen instance\r\n * @ignore\r\n */\r\nfunction genValuePartial_fromObject(gen, field, fieldIndex, prop) {\r\n var defaultAlreadyEmitted = false;\r\n /* eslint-disable no-unexpected-multiline, block-scoped-var, no-redeclare */\r\n if (field.resolvedType) {\r\n if (field.resolvedType instanceof Enum) { gen\r\n (\"switch(d%s){\", prop);\r\n for (var values = field.resolvedType.values, keys = Object.keys(values), i = 0; i < keys.length; ++i) {\r\n // enum unknown values passthrough\r\n if (values[keys[i]] === field.typeDefault && !defaultAlreadyEmitted) { gen\r\n (\"default:\")\r\n (\"if(typeof(d%s)===\\\"number\\\"){m%s=d%s;break}\", prop, prop, prop);\r\n if (!field.repeated) gen // fallback to default value only for\r\n // arrays, to avoid leaving holes.\r\n (\"break\"); // for non-repeated fields, just ignore\r\n defaultAlreadyEmitted = true;\r\n }\r\n gen\r\n (\"case%j:\", keys[i])\r\n (\"case %i:\", values[keys[i]])\r\n (\"m%s=%j\", prop, values[keys[i]])\r\n (\"break\");\r\n } gen\r\n (\"}\");\r\n } else gen\r\n (\"if(typeof d%s!==\\\"object\\\")\", prop)\r\n (\"throw TypeError(%j)\", field.fullName + \": object expected\")\r\n (\"m%s=types[%i].fromObject(d%s)\", prop, fieldIndex, prop);\r\n } else {\r\n var isUnsigned = false;\r\n switch (field.type) {\r\n case \"double\":\r\n case \"float\": gen\r\n (\"m%s=Number(d%s)\", prop, prop); // also catches \"NaN\", \"Infinity\"\r\n break;\r\n case \"uint32\":\r\n case \"fixed32\": gen\r\n (\"m%s=d%s>>>0\", prop, prop);\r\n break;\r\n case \"int32\":\r\n case \"sint32\":\r\n case \"sfixed32\": gen\r\n (\"m%s=d%s|0\", prop, prop);\r\n break;\r\n case \"uint64\":\r\n isUnsigned = true;\r\n // eslint-disable-next-line no-fallthrough\r\n case \"int64\":\r\n case \"sint64\":\r\n case \"fixed64\":\r\n case \"sfixed64\": gen\r\n (\"if(util.Long)\")\r\n (\"(m%s=util.Long.fromValue(d%s)).unsigned=%j\", prop, prop, isUnsigned)\r\n (\"else if(typeof d%s===\\\"string\\\")\", prop)\r\n (\"m%s=parseInt(d%s,10)\", prop, prop)\r\n (\"else if(typeof d%s===\\\"number\\\")\", prop)\r\n (\"m%s=d%s\", prop, prop)\r\n (\"else if(typeof d%s===\\\"object\\\")\", prop)\r\n (\"m%s=new util.LongBits(d%s.low>>>0,d%s.high>>>0).toNumber(%s)\", prop, prop, prop, isUnsigned ? \"true\" : \"\");\r\n break;\r\n case \"bytes\": gen\r\n (\"if(typeof d%s===\\\"string\\\")\", prop)\r\n (\"util.base64.decode(d%s,m%s=util.newBuffer(util.base64.length(d%s)),0)\", prop, prop, prop)\r\n (\"else if(d%s.length >= 0)\", prop)\r\n (\"m%s=d%s\", prop, prop);\r\n break;\r\n case \"string\": gen\r\n (\"m%s=String(d%s)\", prop, prop);\r\n break;\r\n case \"bool\": gen\r\n (\"m%s=Boolean(d%s)\", prop, prop);\r\n break;\r\n /* default: gen\r\n (\"m%s=d%s\", prop, prop);\r\n break; */\r\n }\r\n }\r\n return gen;\r\n /* eslint-enable no-unexpected-multiline, block-scoped-var, no-redeclare */\r\n}\r\n\r\n/**\r\n * Generates a plain object to runtime message converter specific to the specified message type.\r\n * @param {Type} mtype Message type\r\n * @returns {Codegen} Codegen instance\r\n */\r\nconverter.fromObject = function fromObject(mtype) {\r\n /* eslint-disable no-unexpected-multiline, block-scoped-var, no-redeclare */\r\n var fields = mtype.fieldsArray;\r\n var gen = util.codegen([\"d\"], mtype.name + \"$fromObject\")\r\n (\"if(d instanceof this.ctor)\")\r\n (\"return d\");\r\n if (!fields.length) return gen\r\n (\"return new this.ctor\");\r\n gen\r\n (\"var m=new this.ctor\");\r\n for (var i = 0; i < fields.length; ++i) {\r\n var field = fields[i].resolve(),\r\n prop = util.safeProp(field.name);\r\n\r\n // Map fields\r\n if (field.map) { gen\r\n (\"if(d%s){\", prop)\r\n (\"if(typeof d%s!==\\\"object\\\")\", prop)\r\n (\"throw TypeError(%j)\", field.fullName + \": object expected\")\r\n (\"m%s={}\", prop)\r\n (\"for(var ks=Object.keys(d%s),i=0;i>>0,m%s.high>>>0).toNumber(%s):m%s\", prop, prop, prop, prop, isUnsigned ? \"true\": \"\", prop);\r\n break;\r\n case \"bytes\": gen\r\n (\"d%s=o.bytes===String?util.base64.encode(m%s,0,m%s.length):o.bytes===Array?Array.prototype.slice.call(m%s):m%s\", prop, prop, prop, prop, prop);\r\n break;\r\n default: gen\r\n (\"d%s=m%s\", prop, prop);\r\n break;\r\n }\r\n }\r\n return gen;\r\n /* eslint-enable no-unexpected-multiline, block-scoped-var, no-redeclare */\r\n}\r\n\r\n/**\r\n * Generates a runtime message to plain object converter specific to the specified message type.\r\n * @param {Type} mtype Message type\r\n * @returns {Codegen} Codegen instance\r\n */\r\nconverter.toObject = function toObject(mtype) {\r\n /* eslint-disable no-unexpected-multiline, block-scoped-var, no-redeclare */\r\n var fields = mtype.fieldsArray.slice().sort(util.compareFieldsById);\r\n if (!fields.length)\r\n return util.codegen()(\"return {}\");\r\n var gen = util.codegen([\"m\", \"o\"], mtype.name + \"$toObject\")\r\n (\"if(!o)\")\r\n (\"o={}\")\r\n (\"var d={}\");\r\n\r\n var repeatedFields = [],\r\n mapFields = [],\r\n normalFields = [],\r\n i = 0;\r\n for (; i < fields.length; ++i)\r\n if (!fields[i].partOf)\r\n ( fields[i].resolve().repeated ? repeatedFields\r\n : fields[i].map ? mapFields\r\n : normalFields).push(fields[i]);\r\n\r\n if (repeatedFields.length) { gen\r\n (\"if(o.arrays||o.defaults){\");\r\n for (i = 0; i < repeatedFields.length; ++i) gen\r\n (\"d%s=[]\", util.safeProp(repeatedFields[i].name));\r\n gen\r\n (\"}\");\r\n }\r\n\r\n if (mapFields.length) { gen\r\n (\"if(o.objects||o.defaults){\");\r\n for (i = 0; i < mapFields.length; ++i) gen\r\n (\"d%s={}\", util.safeProp(mapFields[i].name));\r\n gen\r\n (\"}\");\r\n }\r\n\r\n if (normalFields.length) { gen\r\n (\"if(o.defaults){\");\r\n for (i = 0; i < normalFields.length; ++i) {\r\n var field = normalFields[i],\r\n prop = util.safeProp(field.name);\r\n if (field.resolvedType instanceof Enum) gen\r\n (\"d%s=o.enums===String?%j:%j\", prop, field.resolvedType.valuesById[field.typeDefault], field.typeDefault);\r\n else if (field.long) gen\r\n (\"if(util.Long){\")\r\n (\"var n=new util.Long(%i,%i,%j)\", field.typeDefault.low, field.typeDefault.high, field.typeDefault.unsigned)\r\n (\"d%s=o.longs===String?n.toString():o.longs===Number?n.toNumber():n\", prop)\r\n (\"}else\")\r\n (\"d%s=o.longs===String?%j:%i\", prop, field.typeDefault.toString(), field.typeDefault.toNumber());\r\n else if (field.bytes) {\r\n var arrayDefault = \"[\" + Array.prototype.slice.call(field.typeDefault).join(\",\") + \"]\";\r\n gen\r\n (\"if(o.bytes===String)d%s=%j\", prop, String.fromCharCode.apply(String, field.typeDefault))\r\n (\"else{\")\r\n (\"d%s=%s\", prop, arrayDefault)\r\n (\"if(o.bytes!==Array)d%s=util.newBuffer(d%s)\", prop, prop)\r\n (\"}\");\r\n } else gen\r\n (\"d%s=%j\", prop, field.typeDefault); // also messages (=null)\r\n } gen\r\n (\"}\");\r\n }\r\n var hasKs2 = false;\r\n for (i = 0; i < fields.length; ++i) {\r\n var field = fields[i],\r\n index = mtype._fieldsArray.indexOf(field),\r\n prop = util.safeProp(field.name);\r\n if (field.map) {\r\n if (!hasKs2) { hasKs2 = true; gen\r\n (\"var ks2\");\r\n } gen\r\n (\"if(m%s&&(ks2=Object.keys(m%s)).length){\", prop, prop)\r\n (\"d%s={}\", prop)\r\n (\"for(var j=0;j>>3){\");\r\n\r\n var i = 0;\r\n for (; i < /* initializes */ mtype.fieldsArray.length; ++i) {\r\n var field = mtype._fieldsArray[i].resolve(),\r\n type = field.resolvedType instanceof Enum ? \"int32\" : field.type,\r\n ref = \"m\" + util.safeProp(field.name); gen\r\n (\"case %i: {\", field.id);\r\n\r\n // Map fields\r\n if (field.map) { gen\r\n (\"if(%s===util.emptyObject)\", ref)\r\n (\"%s={}\", ref)\r\n (\"var c2 = r.uint32()+r.pos\");\r\n\r\n if (types.defaults[field.keyType] !== undefined) gen\r\n (\"k=%j\", types.defaults[field.keyType]);\r\n else gen\r\n (\"k=null\");\r\n\r\n if (types.defaults[type] !== undefined) gen\r\n (\"value=%j\", types.defaults[type]);\r\n else gen\r\n (\"value=null\");\r\n\r\n gen\r\n (\"while(r.pos>>3){\")\r\n (\"case 1: k=r.%s(); break\", field.keyType)\r\n (\"case 2:\");\r\n\r\n if (types.basic[type] === undefined) gen\r\n (\"value=types[%i].decode(r,r.uint32())\", i); // can't be groups\r\n else gen\r\n (\"value=r.%s()\", type);\r\n\r\n gen\r\n (\"break\")\r\n (\"default:\")\r\n (\"r.skipType(tag2&7)\")\r\n (\"break\")\r\n (\"}\")\r\n (\"}\");\r\n\r\n if (types.long[field.keyType] !== undefined) gen\r\n (\"%s[typeof k===\\\"object\\\"?util.longToHash(k):k]=value\", ref);\r\n else gen\r\n (\"%s[k]=value\", ref);\r\n\r\n // Repeated fields\r\n } else if (field.repeated) { gen\r\n\r\n (\"if(!(%s&&%s.length))\", ref, ref)\r\n (\"%s=[]\", ref);\r\n\r\n // Packable (always check for forward and backward compatiblity)\r\n if (types.packed[type] !== undefined) gen\r\n (\"if((t&7)===2){\")\r\n (\"var c2=r.uint32()+r.pos\")\r\n (\"while(r.pos>> 0, (field.id << 3 | 4) >>> 0)\r\n : gen(\"types[%i].encode(%s,w.uint32(%i).fork()).ldelim()\", fieldIndex, ref, (field.id << 3 | 2) >>> 0);\r\n}\r\n\r\n/**\r\n * Generates an encoder specific to the specified message type.\r\n * @param {Type} mtype Message type\r\n * @returns {Codegen} Codegen instance\r\n */\r\nfunction encoder(mtype) {\r\n /* eslint-disable no-unexpected-multiline, block-scoped-var, no-redeclare */\r\n var gen = util.codegen([\"m\", \"w\"], mtype.name + \"$encode\")\r\n (\"if(!w)\")\r\n (\"w=Writer.create()\");\r\n\r\n var i, ref;\r\n\r\n // \"when a message is serialized its known fields should be written sequentially by field number\"\r\n var fields = /* initializes */ mtype.fieldsArray.slice().sort(util.compareFieldsById);\r\n\r\n for (var i = 0; i < fields.length; ++i) {\r\n var field = fields[i].resolve(),\r\n index = mtype._fieldsArray.indexOf(field),\r\n type = field.resolvedType instanceof Enum ? \"int32\" : field.type,\r\n wireType = types.basic[type];\r\n ref = \"m\" + util.safeProp(field.name);\r\n\r\n // Map fields\r\n if (field.map) {\r\n gen\r\n (\"if(%s!=null&&Object.hasOwnProperty.call(m,%j)){\", ref, field.name) // !== undefined && !== null\r\n (\"for(var ks=Object.keys(%s),i=0;i>> 0, 8 | types.mapKey[field.keyType], field.keyType);\r\n if (wireType === undefined) gen\r\n (\"types[%i].encode(%s[ks[i]],w.uint32(18).fork()).ldelim().ldelim()\", index, ref); // can't be groups\r\n else gen\r\n (\".uint32(%i).%s(%s[ks[i]]).ldelim()\", 16 | wireType, type, ref);\r\n gen\r\n (\"}\")\r\n (\"}\");\r\n\r\n // Repeated fields\r\n } else if (field.repeated) { gen\r\n (\"if(%s!=null&&%s.length){\", ref, ref); // !== undefined && !== null\r\n\r\n // Packed repeated\r\n if (field.packed && types.packed[type] !== undefined) { gen\r\n\r\n (\"w.uint32(%i).fork()\", (field.id << 3 | 2) >>> 0)\r\n (\"for(var i=0;i<%s.length;++i)\", ref)\r\n (\"w.%s(%s[i])\", type, ref)\r\n (\"w.ldelim()\");\r\n\r\n // Non-packed\r\n } else { gen\r\n\r\n (\"for(var i=0;i<%s.length;++i)\", ref);\r\n if (wireType === undefined)\r\n genTypePartial(gen, field, index, ref + \"[i]\");\r\n else gen\r\n (\"w.uint32(%i).%s(%s[i])\", (field.id << 3 | wireType) >>> 0, type, ref);\r\n\r\n } gen\r\n (\"}\");\r\n\r\n // Non-repeated\r\n } else {\r\n if (field.optional) gen\r\n (\"if(%s!=null&&Object.hasOwnProperty.call(m,%j))\", ref, field.name); // !== undefined && !== null\r\n\r\n if (wireType === undefined)\r\n genTypePartial(gen, field, index, ref);\r\n else gen\r\n (\"w.uint32(%i).%s(%s)\", (field.id << 3 | wireType) >>> 0, type, ref);\r\n\r\n }\r\n }\r\n\r\n return gen\r\n (\"return w\");\r\n /* eslint-enable no-unexpected-multiline, block-scoped-var, no-redeclare */\r\n}\r\n","\"use strict\";\r\nmodule.exports = Enum;\r\n\r\n// extends ReflectionObject\r\nvar ReflectionObject = require(\"./object\");\r\n((Enum.prototype = Object.create(ReflectionObject.prototype)).constructor = Enum).className = \"Enum\";\r\n\r\nvar Namespace = require(\"./namespace\"),\r\n util = require(\"./util\");\r\n\r\n/**\r\n * Constructs a new enum instance.\r\n * @classdesc Reflected enum.\r\n * @extends ReflectionObject\r\n * @constructor\r\n * @param {string} name Unique name within its namespace\r\n * @param {Object.} [values] Enum values as an object, by name\r\n * @param {Object.} [options] Declared options\r\n * @param {string} [comment] The comment for this enum\r\n * @param {Object.} [comments] The value comments for this enum\r\n * @param {Object.>|undefined} [valuesOptions] The value options for this enum\r\n */\r\nfunction Enum(name, values, options, comment, comments, valuesOptions) {\r\n ReflectionObject.call(this, name, options);\r\n\r\n if (values && typeof values !== \"object\")\r\n throw TypeError(\"values must be an object\");\r\n\r\n /**\r\n * Enum values by id.\r\n * @type {Object.}\r\n */\r\n this.valuesById = {};\r\n\r\n /**\r\n * Enum values by name.\r\n * @type {Object.}\r\n */\r\n this.values = Object.create(this.valuesById); // toJSON, marker\r\n\r\n /**\r\n * Enum comment text.\r\n * @type {string|null}\r\n */\r\n this.comment = comment;\r\n\r\n /**\r\n * Value comment texts, if any.\r\n * @type {Object.}\r\n */\r\n this.comments = comments || {};\r\n\r\n /**\r\n * Values options, if any\r\n * @type {Object>|undefined}\r\n */\r\n this.valuesOptions = valuesOptions;\r\n\r\n /**\r\n * Reserved ranges, if any.\r\n * @type {Array.}\r\n */\r\n this.reserved = undefined; // toJSON\r\n\r\n // Note that values inherit valuesById on their prototype which makes them a TypeScript-\r\n // compatible enum. This is used by pbts to write actual enum definitions that work for\r\n // static and reflection code alike instead of emitting generic object definitions.\r\n\r\n if (values)\r\n for (var keys = Object.keys(values), i = 0; i < keys.length; ++i)\r\n if (typeof values[keys[i]] === \"number\") // use forward entries only\r\n this.valuesById[ this.values[keys[i]] = values[keys[i]] ] = keys[i];\r\n}\r\n\r\n/**\r\n * Enum descriptor.\r\n * @interface IEnum\r\n * @property {Object.} values Enum values\r\n * @property {Object.} [options] Enum options\r\n */\r\n\r\n/**\r\n * Constructs an enum from an enum descriptor.\r\n * @param {string} name Enum name\r\n * @param {IEnum} json Enum descriptor\r\n * @returns {Enum} Created enum\r\n * @throws {TypeError} If arguments are invalid\r\n */\r\nEnum.fromJSON = function fromJSON(name, json) {\r\n var enm = new Enum(name, json.values, json.options, json.comment, json.comments);\r\n enm.reserved = json.reserved;\r\n return enm;\r\n};\r\n\r\n/**\r\n * Converts this enum to an enum descriptor.\r\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\r\n * @returns {IEnum} Enum descriptor\r\n */\r\nEnum.prototype.toJSON = function toJSON(toJSONOptions) {\r\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\r\n return util.toObject([\r\n \"options\" , this.options,\r\n \"valuesOptions\" , this.valuesOptions,\r\n \"values\" , this.values,\r\n \"reserved\" , this.reserved && this.reserved.length ? this.reserved : undefined,\r\n \"comment\" , keepComments ? this.comment : undefined,\r\n \"comments\" , keepComments ? this.comments : undefined\r\n ]);\r\n};\r\n\r\n/**\r\n * Adds a value to this enum.\r\n * @param {string} name Value name\r\n * @param {number} id Value id\r\n * @param {string} [comment] Comment, if any\r\n * @param {Object.|undefined} [options] Options, if any\r\n * @returns {Enum} `this`\r\n * @throws {TypeError} If arguments are invalid\r\n * @throws {Error} If there is already a value with this name or id\r\n */\r\nEnum.prototype.add = function add(name, id, comment, options) {\r\n // utilized by the parser but not by .fromJSON\r\n\r\n if (!util.isString(name))\r\n throw TypeError(\"name must be a string\");\r\n\r\n if (!util.isInteger(id))\r\n throw TypeError(\"id must be an integer\");\r\n\r\n if (this.values[name] !== undefined)\r\n throw Error(\"duplicate name '\" + name + \"' in \" + this);\r\n\r\n if (this.isReservedId(id))\r\n throw Error(\"id \" + id + \" is reserved in \" + this);\r\n\r\n if (this.isReservedName(name))\r\n throw Error(\"name '\" + name + \"' is reserved in \" + this);\r\n\r\n if (this.valuesById[id] !== undefined) {\r\n if (!(this.options && this.options.allow_alias))\r\n throw Error(\"duplicate id \" + id + \" in \" + this);\r\n this.values[name] = id;\r\n } else\r\n this.valuesById[this.values[name] = id] = name;\r\n\r\n if (options) {\r\n if (this.valuesOptions === undefined)\r\n this.valuesOptions = {};\r\n this.valuesOptions[name] = options || null;\r\n }\r\n\r\n this.comments[name] = comment || null;\r\n return this;\r\n};\r\n\r\n/**\r\n * Removes a value from this enum\r\n * @param {string} name Value name\r\n * @returns {Enum} `this`\r\n * @throws {TypeError} If arguments are invalid\r\n * @throws {Error} If `name` is not a name of this enum\r\n */\r\nEnum.prototype.remove = function remove(name) {\r\n\r\n if (!util.isString(name))\r\n throw TypeError(\"name must be a string\");\r\n\r\n var val = this.values[name];\r\n if (val == null)\r\n throw Error(\"name '\" + name + \"' does not exist in \" + this);\r\n\r\n delete this.valuesById[val];\r\n delete this.values[name];\r\n delete this.comments[name];\r\n if (this.valuesOptions)\r\n delete this.valuesOptions[name];\r\n\r\n return this;\r\n};\r\n\r\n/**\r\n * Tests if the specified id is reserved.\r\n * @param {number} id Id to test\r\n * @returns {boolean} `true` if reserved, otherwise `false`\r\n */\r\nEnum.prototype.isReservedId = function isReservedId(id) {\r\n return Namespace.isReservedId(this.reserved, id);\r\n};\r\n\r\n/**\r\n * Tests if the specified name is reserved.\r\n * @param {string} name Name to test\r\n * @returns {boolean} `true` if reserved, otherwise `false`\r\n */\r\nEnum.prototype.isReservedName = function isReservedName(name) {\r\n return Namespace.isReservedName(this.reserved, name);\r\n};\r\n","\"use strict\";\r\nmodule.exports = Field;\r\n\r\n// extends ReflectionObject\r\nvar ReflectionObject = require(\"./object\");\r\n((Field.prototype = Object.create(ReflectionObject.prototype)).constructor = Field).className = \"Field\";\r\n\r\nvar Enum = require(\"./enum\"),\r\n types = require(\"./types\"),\r\n util = require(\"./util\");\r\n\r\nvar Type; // cyclic\r\n\r\nvar ruleRe = /^required|optional|repeated$/;\r\n\r\n/**\r\n * Constructs a new message field instance. Note that {@link MapField|map fields} have their own class.\r\n * @name Field\r\n * @classdesc Reflected message field.\r\n * @extends FieldBase\r\n * @constructor\r\n * @param {string} name Unique name within its namespace\r\n * @param {number} id Unique id within its namespace\r\n * @param {string} type Value type\r\n * @param {string|Object.} [rule=\"optional\"] Field rule\r\n * @param {string|Object.} [extend] Extended type if different from parent\r\n * @param {Object.} [options] Declared options\r\n */\r\n\r\n/**\r\n * Constructs a field from a field descriptor.\r\n * @param {string} name Field name\r\n * @param {IField} json Field descriptor\r\n * @returns {Field} Created field\r\n * @throws {TypeError} If arguments are invalid\r\n */\r\nField.fromJSON = function fromJSON(name, json) {\r\n return new Field(name, json.id, json.type, json.rule, json.extend, json.options, json.comment);\r\n};\r\n\r\n/**\r\n * Not an actual constructor. Use {@link Field} instead.\r\n * @classdesc Base class of all reflected message fields. This is not an actual class but here for the sake of having consistent type definitions.\r\n * @exports FieldBase\r\n * @extends ReflectionObject\r\n * @constructor\r\n * @param {string} name Unique name within its namespace\r\n * @param {number} id Unique id within its namespace\r\n * @param {string} type Value type\r\n * @param {string|Object.} [rule=\"optional\"] Field rule\r\n * @param {string|Object.} [extend] Extended type if different from parent\r\n * @param {Object.} [options] Declared options\r\n * @param {string} [comment] Comment associated with this field\r\n */\r\nfunction Field(name, id, type, rule, extend, options, comment) {\r\n\r\n if (util.isObject(rule)) {\r\n comment = extend;\r\n options = rule;\r\n rule = extend = undefined;\r\n } else if (util.isObject(extend)) {\r\n comment = options;\r\n options = extend;\r\n extend = undefined;\r\n }\r\n\r\n ReflectionObject.call(this, name, options);\r\n\r\n if (!util.isInteger(id) || id < 0)\r\n throw TypeError(\"id must be a non-negative integer\");\r\n\r\n if (!util.isString(type))\r\n throw TypeError(\"type must be a string\");\r\n\r\n if (rule !== undefined && !ruleRe.test(rule = rule.toString().toLowerCase()))\r\n throw TypeError(\"rule must be a string rule\");\r\n\r\n if (extend !== undefined && !util.isString(extend))\r\n throw TypeError(\"extend must be a string\");\r\n\r\n /**\r\n * Field rule, if any.\r\n * @type {string|undefined}\r\n */\r\n if (rule === \"proto3_optional\") {\r\n rule = \"optional\";\r\n }\r\n this.rule = rule && rule !== \"optional\" ? rule : undefined; // toJSON\r\n\r\n /**\r\n * Field type.\r\n * @type {string}\r\n */\r\n this.type = type; // toJSON\r\n\r\n /**\r\n * Unique field id.\r\n * @type {number}\r\n */\r\n this.id = id; // toJSON, marker\r\n\r\n /**\r\n * Extended type if different from parent.\r\n * @type {string|undefined}\r\n */\r\n this.extend = extend || undefined; // toJSON\r\n\r\n /**\r\n * Whether this field is required.\r\n * @type {boolean}\r\n */\r\n this.required = rule === \"required\";\r\n\r\n /**\r\n * Whether this field is optional.\r\n * @type {boolean}\r\n */\r\n this.optional = !this.required;\r\n\r\n /**\r\n * Whether this field is repeated.\r\n * @type {boolean}\r\n */\r\n this.repeated = rule === \"repeated\";\r\n\r\n /**\r\n * Whether this field is a map or not.\r\n * @type {boolean}\r\n */\r\n this.map = false;\r\n\r\n /**\r\n * Message this field belongs to.\r\n * @type {Type|null}\r\n */\r\n this.message = null;\r\n\r\n /**\r\n * OneOf this field belongs to, if any,\r\n * @type {OneOf|null}\r\n */\r\n this.partOf = null;\r\n\r\n /**\r\n * The field type's default value.\r\n * @type {*}\r\n */\r\n this.typeDefault = null;\r\n\r\n /**\r\n * The field's default value on prototypes.\r\n * @type {*}\r\n */\r\n this.defaultValue = null;\r\n\r\n /**\r\n * Whether this field's value should be treated as a long.\r\n * @type {boolean}\r\n */\r\n this.long = util.Long ? types.long[type] !== undefined : /* istanbul ignore next */ false;\r\n\r\n /**\r\n * Whether this field's value is a buffer.\r\n * @type {boolean}\r\n */\r\n this.bytes = type === \"bytes\";\r\n\r\n /**\r\n * Resolved type if not a basic type.\r\n * @type {Type|Enum|null}\r\n */\r\n this.resolvedType = null;\r\n\r\n /**\r\n * Sister-field within the extended type if a declaring extension field.\r\n * @type {Field|null}\r\n */\r\n this.extensionField = null;\r\n\r\n /**\r\n * Sister-field within the declaring namespace if an extended field.\r\n * @type {Field|null}\r\n */\r\n this.declaringField = null;\r\n\r\n /**\r\n * Internally remembers whether this field is packed.\r\n * @type {boolean|null}\r\n * @private\r\n */\r\n this._packed = null;\r\n\r\n /**\r\n * Comment for this field.\r\n * @type {string|null}\r\n */\r\n this.comment = comment;\r\n}\r\n\r\n/**\r\n * Determines whether this field is packed. Only relevant when repeated and working with proto2.\r\n * @name Field#packed\r\n * @type {boolean}\r\n * @readonly\r\n */\r\nObject.defineProperty(Field.prototype, \"packed\", {\r\n get: function() {\r\n // defaults to packed=true if not explicity set to false\r\n if (this._packed === null)\r\n this._packed = this.getOption(\"packed\") !== false;\r\n return this._packed;\r\n }\r\n});\r\n\r\n/**\r\n * @override\r\n */\r\nField.prototype.setOption = function setOption(name, value, ifNotSet) {\r\n if (name === \"packed\") // clear cached before setting\r\n this._packed = null;\r\n return ReflectionObject.prototype.setOption.call(this, name, value, ifNotSet);\r\n};\r\n\r\n/**\r\n * Field descriptor.\r\n * @interface IField\r\n * @property {string} [rule=\"optional\"] Field rule\r\n * @property {string} type Field type\r\n * @property {number} id Field id\r\n * @property {Object.} [options] Field options\r\n */\r\n\r\n/**\r\n * Extension field descriptor.\r\n * @interface IExtensionField\r\n * @extends IField\r\n * @property {string} extend Extended type\r\n */\r\n\r\n/**\r\n * Converts this field to a field descriptor.\r\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\r\n * @returns {IField} Field descriptor\r\n */\r\nField.prototype.toJSON = function toJSON(toJSONOptions) {\r\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\r\n return util.toObject([\r\n \"rule\" , this.rule !== \"optional\" && this.rule || undefined,\r\n \"type\" , this.type,\r\n \"id\" , this.id,\r\n \"extend\" , this.extend,\r\n \"options\" , this.options,\r\n \"comment\" , keepComments ? this.comment : undefined\r\n ]);\r\n};\r\n\r\n/**\r\n * Resolves this field's type references.\r\n * @returns {Field} `this`\r\n * @throws {Error} If any reference cannot be resolved\r\n */\r\nField.prototype.resolve = function resolve() {\r\n\r\n if (this.resolved)\r\n return this;\r\n\r\n if ((this.typeDefault = types.defaults[this.type]) === undefined) { // if not a basic type, resolve it\r\n this.resolvedType = (this.declaringField ? this.declaringField.parent : this.parent).lookupTypeOrEnum(this.type);\r\n if (this.resolvedType instanceof Type)\r\n this.typeDefault = null;\r\n else // instanceof Enum\r\n this.typeDefault = this.resolvedType.values[Object.keys(this.resolvedType.values)[0]]; // first defined\r\n } else if (this.options && this.options.proto3_optional) {\r\n // proto3 scalar value marked optional; should default to null\r\n this.typeDefault = null;\r\n }\r\n\r\n // use explicitly set default value if present\r\n if (this.options && this.options[\"default\"] != null) {\r\n this.typeDefault = this.options[\"default\"];\r\n if (this.resolvedType instanceof Enum && typeof this.typeDefault === \"string\")\r\n this.typeDefault = this.resolvedType.values[this.typeDefault];\r\n }\r\n\r\n // remove unnecessary options\r\n if (this.options) {\r\n if (this.options.packed === true || this.options.packed !== undefined && this.resolvedType && !(this.resolvedType instanceof Enum))\r\n delete this.options.packed;\r\n if (!Object.keys(this.options).length)\r\n this.options = undefined;\r\n }\r\n\r\n // convert to internal data type if necesssary\r\n if (this.long) {\r\n this.typeDefault = util.Long.fromNumber(this.typeDefault, this.type.charAt(0) === \"u\");\r\n\r\n /* istanbul ignore else */\r\n if (Object.freeze)\r\n Object.freeze(this.typeDefault); // long instances are meant to be immutable anyway (i.e. use small int cache that even requires it)\r\n\r\n } else if (this.bytes && typeof this.typeDefault === \"string\") {\r\n var buf;\r\n if (util.base64.test(this.typeDefault))\r\n util.base64.decode(this.typeDefault, buf = util.newBuffer(util.base64.length(this.typeDefault)), 0);\r\n else\r\n util.utf8.write(this.typeDefault, buf = util.newBuffer(util.utf8.length(this.typeDefault)), 0);\r\n this.typeDefault = buf;\r\n }\r\n\r\n // take special care of maps and repeated fields\r\n if (this.map)\r\n this.defaultValue = util.emptyObject;\r\n else if (this.repeated)\r\n this.defaultValue = util.emptyArray;\r\n else\r\n this.defaultValue = this.typeDefault;\r\n\r\n // ensure proper value on prototype\r\n if (this.parent instanceof Type)\r\n this.parent.ctor.prototype[this.name] = this.defaultValue;\r\n\r\n return ReflectionObject.prototype.resolve.call(this);\r\n};\r\n\r\n/**\r\n * Decorator function as returned by {@link Field.d} and {@link MapField.d} (TypeScript).\r\n * @typedef FieldDecorator\r\n * @type {function}\r\n * @param {Object} prototype Target prototype\r\n * @param {string} fieldName Field name\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Field decorator (TypeScript).\r\n * @name Field.d\r\n * @function\r\n * @param {number} fieldId Field id\r\n * @param {\"double\"|\"float\"|\"int32\"|\"uint32\"|\"sint32\"|\"fixed32\"|\"sfixed32\"|\"int64\"|\"uint64\"|\"sint64\"|\"fixed64\"|\"sfixed64\"|\"string\"|\"bool\"|\"bytes\"|Object} fieldType Field type\r\n * @param {\"optional\"|\"required\"|\"repeated\"} [fieldRule=\"optional\"] Field rule\r\n * @param {T} [defaultValue] Default value\r\n * @returns {FieldDecorator} Decorator function\r\n * @template T extends number | number[] | Long | Long[] | string | string[] | boolean | boolean[] | Uint8Array | Uint8Array[] | Buffer | Buffer[]\r\n */\r\nField.d = function decorateField(fieldId, fieldType, fieldRule, defaultValue) {\r\n\r\n // submessage: decorate the submessage and use its name as the type\r\n if (typeof fieldType === \"function\")\r\n fieldType = util.decorateType(fieldType).name;\r\n\r\n // enum reference: create a reflected copy of the enum and keep reuseing it\r\n else if (fieldType && typeof fieldType === \"object\")\r\n fieldType = util.decorateEnum(fieldType).name;\r\n\r\n return function fieldDecorator(prototype, fieldName) {\r\n util.decorateType(prototype.constructor)\r\n .add(new Field(fieldName, fieldId, fieldType, fieldRule, { \"default\": defaultValue }));\r\n };\r\n};\r\n\r\n/**\r\n * Field decorator (TypeScript).\r\n * @name Field.d\r\n * @function\r\n * @param {number} fieldId Field id\r\n * @param {Constructor|string} fieldType Field type\r\n * @param {\"optional\"|\"required\"|\"repeated\"} [fieldRule=\"optional\"] Field rule\r\n * @returns {FieldDecorator} Decorator function\r\n * @template T extends Message\r\n * @variation 2\r\n */\r\n// like Field.d but without a default value\r\n\r\n// Sets up cyclic dependencies (called in index-light)\r\nField._configure = function configure(Type_) {\r\n Type = Type_;\r\n};\r\n","\"use strict\";\r\nvar protobuf = module.exports = require(\"./index-minimal\");\r\n\r\nprotobuf.build = \"light\";\r\n\r\n/**\r\n * A node-style callback as used by {@link load} and {@link Root#load}.\r\n * @typedef LoadCallback\r\n * @type {function}\r\n * @param {Error|null} error Error, if any, otherwise `null`\r\n * @param {Root} [root] Root, if there hasn't been an error\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Loads one or multiple .proto or preprocessed .json files into a common root namespace and calls the callback.\r\n * @param {string|string[]} filename One or multiple files to load\r\n * @param {Root} root Root namespace, defaults to create a new one if omitted.\r\n * @param {LoadCallback} callback Callback function\r\n * @returns {undefined}\r\n * @see {@link Root#load}\r\n */\r\nfunction load(filename, root, callback) {\r\n if (typeof root === \"function\") {\r\n callback = root;\r\n root = new protobuf.Root();\r\n } else if (!root)\r\n root = new protobuf.Root();\r\n return root.load(filename, callback);\r\n}\r\n\r\n/**\r\n * Loads one or multiple .proto or preprocessed .json files into a common root namespace and calls the callback.\r\n * @name load\r\n * @function\r\n * @param {string|string[]} filename One or multiple files to load\r\n * @param {LoadCallback} callback Callback function\r\n * @returns {undefined}\r\n * @see {@link Root#load}\r\n * @variation 2\r\n */\r\n// function load(filename:string, callback:LoadCallback):undefined\r\n\r\n/**\r\n * Loads one or multiple .proto or preprocessed .json files into a common root namespace and returns a promise.\r\n * @name load\r\n * @function\r\n * @param {string|string[]} filename One or multiple files to load\r\n * @param {Root} [root] Root namespace, defaults to create a new one if omitted.\r\n * @returns {Promise} Promise\r\n * @see {@link Root#load}\r\n * @variation 3\r\n */\r\n// function load(filename:string, [root:Root]):Promise\r\n\r\nprotobuf.load = load;\r\n\r\n/**\r\n * Synchronously loads one or multiple .proto or preprocessed .json files into a common root namespace (node only).\r\n * @param {string|string[]} filename One or multiple files to load\r\n * @param {Root} [root] Root namespace, defaults to create a new one if omitted.\r\n * @returns {Root} Root namespace\r\n * @throws {Error} If synchronous fetching is not supported (i.e. in browsers) or if a file's syntax is invalid\r\n * @see {@link Root#loadSync}\r\n */\r\nfunction loadSync(filename, root) {\r\n if (!root)\r\n root = new protobuf.Root();\r\n return root.loadSync(filename);\r\n}\r\n\r\nprotobuf.loadSync = loadSync;\r\n\r\n// Serialization\r\nprotobuf.encoder = require(\"./encoder\");\r\nprotobuf.decoder = require(\"./decoder\");\r\nprotobuf.verifier = require(\"./verifier\");\r\nprotobuf.converter = require(\"./converter\");\r\n\r\n// Reflection\r\nprotobuf.ReflectionObject = require(\"./object\");\r\nprotobuf.Namespace = require(\"./namespace\");\r\nprotobuf.Root = require(\"./root\");\r\nprotobuf.Enum = require(\"./enum\");\r\nprotobuf.Type = require(\"./type\");\r\nprotobuf.Field = require(\"./field\");\r\nprotobuf.OneOf = require(\"./oneof\");\r\nprotobuf.MapField = require(\"./mapfield\");\r\nprotobuf.Service = require(\"./service\");\r\nprotobuf.Method = require(\"./method\");\r\n\r\n// Runtime\r\nprotobuf.Message = require(\"./message\");\r\nprotobuf.wrappers = require(\"./wrappers\");\r\n\r\n// Utility\r\nprotobuf.types = require(\"./types\");\r\nprotobuf.util = require(\"./util\");\r\n\r\n// Set up possibly cyclic reflection dependencies\r\nprotobuf.ReflectionObject._configure(protobuf.Root);\r\nprotobuf.Namespace._configure(protobuf.Type, protobuf.Service, protobuf.Enum);\r\nprotobuf.Root._configure(protobuf.Type);\r\nprotobuf.Field._configure(protobuf.Type);\r\n","\"use strict\";\r\nvar protobuf = exports;\r\n\r\n/**\r\n * Build type, one of `\"full\"`, `\"light\"` or `\"minimal\"`.\r\n * @name build\r\n * @type {string}\r\n * @const\r\n */\r\nprotobuf.build = \"minimal\";\r\n\r\n// Serialization\r\nprotobuf.Writer = require(\"./writer\");\r\nprotobuf.BufferWriter = require(\"./writer_buffer\");\r\nprotobuf.Reader = require(\"./reader\");\r\nprotobuf.BufferReader = require(\"./reader_buffer\");\r\n\r\n// Utility\r\nprotobuf.util = require(\"./util/minimal\");\r\nprotobuf.rpc = require(\"./rpc\");\r\nprotobuf.roots = require(\"./roots\");\r\nprotobuf.configure = configure;\r\n\r\n/* istanbul ignore next */\r\n/**\r\n * Reconfigures the library according to the environment.\r\n * @returns {undefined}\r\n */\r\nfunction configure() {\r\n protobuf.util._configure();\r\n protobuf.Writer._configure(protobuf.BufferWriter);\r\n protobuf.Reader._configure(protobuf.BufferReader);\r\n}\r\n\r\n// Set up buffer utility according to the environment\r\nconfigure();\r\n","\"use strict\";\r\nvar protobuf = module.exports = require(\"./index-light\");\r\n\r\nprotobuf.build = \"full\";\r\n\r\n// Parser\r\nprotobuf.tokenize = require(\"./tokenize\");\r\nprotobuf.parse = require(\"./parse\");\r\nprotobuf.common = require(\"./common\");\r\n\r\n// Configure parser\r\nprotobuf.Root._configure(protobuf.Type, protobuf.parse, protobuf.common);\r\n","\"use strict\";\r\nmodule.exports = MapField;\r\n\r\n// extends Field\r\nvar Field = require(\"./field\");\r\n((MapField.prototype = Object.create(Field.prototype)).constructor = MapField).className = \"MapField\";\r\n\r\nvar types = require(\"./types\"),\r\n util = require(\"./util\");\r\n\r\n/**\r\n * Constructs a new map field instance.\r\n * @classdesc Reflected map field.\r\n * @extends FieldBase\r\n * @constructor\r\n * @param {string} name Unique name within its namespace\r\n * @param {number} id Unique id within its namespace\r\n * @param {string} keyType Key type\r\n * @param {string} type Value type\r\n * @param {Object.} [options] Declared options\r\n * @param {string} [comment] Comment associated with this field\r\n */\r\nfunction MapField(name, id, keyType, type, options, comment) {\r\n Field.call(this, name, id, type, undefined, undefined, options, comment);\r\n\r\n /* istanbul ignore if */\r\n if (!util.isString(keyType))\r\n throw TypeError(\"keyType must be a string\");\r\n\r\n /**\r\n * Key type.\r\n * @type {string}\r\n */\r\n this.keyType = keyType; // toJSON, marker\r\n\r\n /**\r\n * Resolved key type if not a basic type.\r\n * @type {ReflectionObject|null}\r\n */\r\n this.resolvedKeyType = null;\r\n\r\n // Overrides Field#map\r\n this.map = true;\r\n}\r\n\r\n/**\r\n * Map field descriptor.\r\n * @interface IMapField\r\n * @extends {IField}\r\n * @property {string} keyType Key type\r\n */\r\n\r\n/**\r\n * Extension map field descriptor.\r\n * @interface IExtensionMapField\r\n * @extends IMapField\r\n * @property {string} extend Extended type\r\n */\r\n\r\n/**\r\n * Constructs a map field from a map field descriptor.\r\n * @param {string} name Field name\r\n * @param {IMapField} json Map field descriptor\r\n * @returns {MapField} Created map field\r\n * @throws {TypeError} If arguments are invalid\r\n */\r\nMapField.fromJSON = function fromJSON(name, json) {\r\n return new MapField(name, json.id, json.keyType, json.type, json.options, json.comment);\r\n};\r\n\r\n/**\r\n * Converts this map field to a map field descriptor.\r\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\r\n * @returns {IMapField} Map field descriptor\r\n */\r\nMapField.prototype.toJSON = function toJSON(toJSONOptions) {\r\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\r\n return util.toObject([\r\n \"keyType\" , this.keyType,\r\n \"type\" , this.type,\r\n \"id\" , this.id,\r\n \"extend\" , this.extend,\r\n \"options\" , this.options,\r\n \"comment\" , keepComments ? this.comment : undefined\r\n ]);\r\n};\r\n\r\n/**\r\n * @override\r\n */\r\nMapField.prototype.resolve = function resolve() {\r\n if (this.resolved)\r\n return this;\r\n\r\n // Besides a value type, map fields have a key type that may be \"any scalar type except for floating point types and bytes\"\r\n if (types.mapKey[this.keyType] === undefined)\r\n throw Error(\"invalid key type: \" + this.keyType);\r\n\r\n return Field.prototype.resolve.call(this);\r\n};\r\n\r\n/**\r\n * Map field decorator (TypeScript).\r\n * @name MapField.d\r\n * @function\r\n * @param {number} fieldId Field id\r\n * @param {\"int32\"|\"uint32\"|\"sint32\"|\"fixed32\"|\"sfixed32\"|\"int64\"|\"uint64\"|\"sint64\"|\"fixed64\"|\"sfixed64\"|\"bool\"|\"string\"} fieldKeyType Field key type\r\n * @param {\"double\"|\"float\"|\"int32\"|\"uint32\"|\"sint32\"|\"fixed32\"|\"sfixed32\"|\"int64\"|\"uint64\"|\"sint64\"|\"fixed64\"|\"sfixed64\"|\"bool\"|\"string\"|\"bytes\"|Object|Constructor<{}>} fieldValueType Field value type\r\n * @returns {FieldDecorator} Decorator function\r\n * @template T extends { [key: string]: number | Long | string | boolean | Uint8Array | Buffer | number[] | Message<{}> }\r\n */\r\nMapField.d = function decorateMapField(fieldId, fieldKeyType, fieldValueType) {\r\n\r\n // submessage value: decorate the submessage and use its name as the type\r\n if (typeof fieldValueType === \"function\")\r\n fieldValueType = util.decorateType(fieldValueType).name;\r\n\r\n // enum reference value: create a reflected copy of the enum and keep reuseing it\r\n else if (fieldValueType && typeof fieldValueType === \"object\")\r\n fieldValueType = util.decorateEnum(fieldValueType).name;\r\n\r\n return function mapFieldDecorator(prototype, fieldName) {\r\n util.decorateType(prototype.constructor)\r\n .add(new MapField(fieldName, fieldId, fieldKeyType, fieldValueType));\r\n };\r\n};\r\n","\"use strict\";\r\nmodule.exports = Message;\r\n\r\nvar util = require(\"./util/minimal\");\r\n\r\n/**\r\n * Constructs a new message instance.\r\n * @classdesc Abstract runtime message.\r\n * @constructor\r\n * @param {Properties} [properties] Properties to set\r\n * @template T extends object = object\r\n */\r\nfunction Message(properties) {\r\n // not used internally\r\n if (properties)\r\n for (var keys = Object.keys(properties), i = 0; i < keys.length; ++i)\r\n this[keys[i]] = properties[keys[i]];\r\n}\r\n\r\n/**\r\n * Reference to the reflected type.\r\n * @name Message.$type\r\n * @type {Type}\r\n * @readonly\r\n */\r\n\r\n/**\r\n * Reference to the reflected type.\r\n * @name Message#$type\r\n * @type {Type}\r\n * @readonly\r\n */\r\n\r\n/*eslint-disable valid-jsdoc*/\r\n\r\n/**\r\n * Creates a new message of this type using the specified properties.\r\n * @param {Object.} [properties] Properties to set\r\n * @returns {Message} Message instance\r\n * @template T extends Message\r\n * @this Constructor\r\n */\r\nMessage.create = function create(properties) {\r\n return this.$type.create(properties);\r\n};\r\n\r\n/**\r\n * Encodes a message of this type.\r\n * @param {T|Object.} message Message to encode\r\n * @param {Writer} [writer] Writer to use\r\n * @returns {Writer} Writer\r\n * @template T extends Message\r\n * @this Constructor\r\n */\r\nMessage.encode = function encode(message, writer) {\r\n return this.$type.encode(message, writer);\r\n};\r\n\r\n/**\r\n * Encodes a message of this type preceeded by its length as a varint.\r\n * @param {T|Object.} message Message to encode\r\n * @param {Writer} [writer] Writer to use\r\n * @returns {Writer} Writer\r\n * @template T extends Message\r\n * @this Constructor\r\n */\r\nMessage.encodeDelimited = function encodeDelimited(message, writer) {\r\n return this.$type.encodeDelimited(message, writer);\r\n};\r\n\r\n/**\r\n * Decodes a message of this type.\r\n * @name Message.decode\r\n * @function\r\n * @param {Reader|Uint8Array} reader Reader or buffer to decode\r\n * @returns {T} Decoded message\r\n * @template T extends Message\r\n * @this Constructor\r\n */\r\nMessage.decode = function decode(reader) {\r\n return this.$type.decode(reader);\r\n};\r\n\r\n/**\r\n * Decodes a message of this type preceeded by its length as a varint.\r\n * @name Message.decodeDelimited\r\n * @function\r\n * @param {Reader|Uint8Array} reader Reader or buffer to decode\r\n * @returns {T} Decoded message\r\n * @template T extends Message\r\n * @this Constructor\r\n */\r\nMessage.decodeDelimited = function decodeDelimited(reader) {\r\n return this.$type.decodeDelimited(reader);\r\n};\r\n\r\n/**\r\n * Verifies a message of this type.\r\n * @name Message.verify\r\n * @function\r\n * @param {Object.} message Plain object to verify\r\n * @returns {string|null} `null` if valid, otherwise the reason why it is not\r\n */\r\nMessage.verify = function verify(message) {\r\n return this.$type.verify(message);\r\n};\r\n\r\n/**\r\n * Creates a new message of this type from a plain object. Also converts values to their respective internal types.\r\n * @param {Object.} object Plain object\r\n * @returns {T} Message instance\r\n * @template T extends Message\r\n * @this Constructor\r\n */\r\nMessage.fromObject = function fromObject(object) {\r\n return this.$type.fromObject(object);\r\n};\r\n\r\n/**\r\n * Creates a plain object from a message of this type. Also converts values to other types if specified.\r\n * @param {T} message Message instance\r\n * @param {IConversionOptions} [options] Conversion options\r\n * @returns {Object.} Plain object\r\n * @template T extends Message\r\n * @this Constructor\r\n */\r\nMessage.toObject = function toObject(message, options) {\r\n return this.$type.toObject(message, options);\r\n};\r\n\r\n/**\r\n * Converts this message to JSON.\r\n * @returns {Object.} JSON object\r\n */\r\nMessage.prototype.toJSON = function toJSON() {\r\n return this.$type.toObject(this, util.toJSONOptions);\r\n};\r\n\r\n/*eslint-enable valid-jsdoc*/","\"use strict\";\r\nmodule.exports = Method;\r\n\r\n// extends ReflectionObject\r\nvar ReflectionObject = require(\"./object\");\r\n((Method.prototype = Object.create(ReflectionObject.prototype)).constructor = Method).className = \"Method\";\r\n\r\nvar util = require(\"./util\");\r\n\r\n/**\r\n * Constructs a new service method instance.\r\n * @classdesc Reflected service method.\r\n * @extends ReflectionObject\r\n * @constructor\r\n * @param {string} name Method name\r\n * @param {string|undefined} type Method type, usually `\"rpc\"`\r\n * @param {string} requestType Request message type\r\n * @param {string} responseType Response message type\r\n * @param {boolean|Object.} [requestStream] Whether the request is streamed\r\n * @param {boolean|Object.} [responseStream] Whether the response is streamed\r\n * @param {Object.} [options] Declared options\r\n * @param {string} [comment] The comment for this method\r\n * @param {Object.} [parsedOptions] Declared options, properly parsed into an object\r\n */\r\nfunction Method(name, type, requestType, responseType, requestStream, responseStream, options, comment, parsedOptions) {\r\n\r\n /* istanbul ignore next */\r\n if (util.isObject(requestStream)) {\r\n options = requestStream;\r\n requestStream = responseStream = undefined;\r\n } else if (util.isObject(responseStream)) {\r\n options = responseStream;\r\n responseStream = undefined;\r\n }\r\n\r\n /* istanbul ignore if */\r\n if (!(type === undefined || util.isString(type)))\r\n throw TypeError(\"type must be a string\");\r\n\r\n /* istanbul ignore if */\r\n if (!util.isString(requestType))\r\n throw TypeError(\"requestType must be a string\");\r\n\r\n /* istanbul ignore if */\r\n if (!util.isString(responseType))\r\n throw TypeError(\"responseType must be a string\");\r\n\r\n ReflectionObject.call(this, name, options);\r\n\r\n /**\r\n * Method type.\r\n * @type {string}\r\n */\r\n this.type = type || \"rpc\"; // toJSON\r\n\r\n /**\r\n * Request type.\r\n * @type {string}\r\n */\r\n this.requestType = requestType; // toJSON, marker\r\n\r\n /**\r\n * Whether requests are streamed or not.\r\n * @type {boolean|undefined}\r\n */\r\n this.requestStream = requestStream ? true : undefined; // toJSON\r\n\r\n /**\r\n * Response type.\r\n * @type {string}\r\n */\r\n this.responseType = responseType; // toJSON\r\n\r\n /**\r\n * Whether responses are streamed or not.\r\n * @type {boolean|undefined}\r\n */\r\n this.responseStream = responseStream ? true : undefined; // toJSON\r\n\r\n /**\r\n * Resolved request type.\r\n * @type {Type|null}\r\n */\r\n this.resolvedRequestType = null;\r\n\r\n /**\r\n * Resolved response type.\r\n * @type {Type|null}\r\n */\r\n this.resolvedResponseType = null;\r\n\r\n /**\r\n * Comment for this method\r\n * @type {string|null}\r\n */\r\n this.comment = comment;\r\n\r\n /**\r\n * Options properly parsed into an object\r\n */\r\n this.parsedOptions = parsedOptions;\r\n}\r\n\r\n/**\r\n * Method descriptor.\r\n * @interface IMethod\r\n * @property {string} [type=\"rpc\"] Method type\r\n * @property {string} requestType Request type\r\n * @property {string} responseType Response type\r\n * @property {boolean} [requestStream=false] Whether requests are streamed\r\n * @property {boolean} [responseStream=false] Whether responses are streamed\r\n * @property {Object.} [options] Method options\r\n * @property {string} comment Method comments\r\n * @property {Object.} [parsedOptions] Method options properly parsed into an object\r\n */\r\n\r\n/**\r\n * Constructs a method from a method descriptor.\r\n * @param {string} name Method name\r\n * @param {IMethod} json Method descriptor\r\n * @returns {Method} Created method\r\n * @throws {TypeError} If arguments are invalid\r\n */\r\nMethod.fromJSON = function fromJSON(name, json) {\r\n return new Method(name, json.type, json.requestType, json.responseType, json.requestStream, json.responseStream, json.options, json.comment, json.parsedOptions);\r\n};\r\n\r\n/**\r\n * Converts this method to a method descriptor.\r\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\r\n * @returns {IMethod} Method descriptor\r\n */\r\nMethod.prototype.toJSON = function toJSON(toJSONOptions) {\r\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\r\n return util.toObject([\r\n \"type\" , this.type !== \"rpc\" && /* istanbul ignore next */ this.type || undefined,\r\n \"requestType\" , this.requestType,\r\n \"requestStream\" , this.requestStream,\r\n \"responseType\" , this.responseType,\r\n \"responseStream\" , this.responseStream,\r\n \"options\" , this.options,\r\n \"comment\" , keepComments ? this.comment : undefined,\r\n \"parsedOptions\" , this.parsedOptions,\r\n ]);\r\n};\r\n\r\n/**\r\n * @override\r\n */\r\nMethod.prototype.resolve = function resolve() {\r\n\r\n /* istanbul ignore if */\r\n if (this.resolved)\r\n return this;\r\n\r\n this.resolvedRequestType = this.parent.lookupType(this.requestType);\r\n this.resolvedResponseType = this.parent.lookupType(this.responseType);\r\n\r\n return ReflectionObject.prototype.resolve.call(this);\r\n};\r\n","\"use strict\";\r\nmodule.exports = Namespace;\r\n\r\n// extends ReflectionObject\r\nvar ReflectionObject = require(\"./object\");\r\n((Namespace.prototype = Object.create(ReflectionObject.prototype)).constructor = Namespace).className = \"Namespace\";\r\n\r\nvar Field = require(\"./field\"),\r\n util = require(\"./util\"),\r\n OneOf = require(\"./oneof\");\r\n\r\nvar Type, // cyclic\r\n Service,\r\n Enum;\r\n\r\n/**\r\n * Constructs a new namespace instance.\r\n * @name Namespace\r\n * @classdesc Reflected namespace.\r\n * @extends NamespaceBase\r\n * @constructor\r\n * @param {string} name Namespace name\r\n * @param {Object.} [options] Declared options\r\n */\r\n\r\n/**\r\n * Constructs a namespace from JSON.\r\n * @memberof Namespace\r\n * @function\r\n * @param {string} name Namespace name\r\n * @param {Object.} json JSON object\r\n * @returns {Namespace} Created namespace\r\n * @throws {TypeError} If arguments are invalid\r\n */\r\nNamespace.fromJSON = function fromJSON(name, json) {\r\n return new Namespace(name, json.options).addJSON(json.nested);\r\n};\r\n\r\n/**\r\n * Converts an array of reflection objects to JSON.\r\n * @memberof Namespace\r\n * @param {ReflectionObject[]} array Object array\r\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\r\n * @returns {Object.|undefined} JSON object or `undefined` when array is empty\r\n */\r\nfunction arrayToJSON(array, toJSONOptions) {\r\n if (!(array && array.length))\r\n return undefined;\r\n var obj = {};\r\n for (var i = 0; i < array.length; ++i)\r\n obj[array[i].name] = array[i].toJSON(toJSONOptions);\r\n return obj;\r\n}\r\n\r\nNamespace.arrayToJSON = arrayToJSON;\r\n\r\n/**\r\n * Tests if the specified id is reserved.\r\n * @param {Array.|undefined} reserved Array of reserved ranges and names\r\n * @param {number} id Id to test\r\n * @returns {boolean} `true` if reserved, otherwise `false`\r\n */\r\nNamespace.isReservedId = function isReservedId(reserved, id) {\r\n if (reserved)\r\n for (var i = 0; i < reserved.length; ++i)\r\n if (typeof reserved[i] !== \"string\" && reserved[i][0] <= id && reserved[i][1] > id)\r\n return true;\r\n return false;\r\n};\r\n\r\n/**\r\n * Tests if the specified name is reserved.\r\n * @param {Array.|undefined} reserved Array of reserved ranges and names\r\n * @param {string} name Name to test\r\n * @returns {boolean} `true` if reserved, otherwise `false`\r\n */\r\nNamespace.isReservedName = function isReservedName(reserved, name) {\r\n if (reserved)\r\n for (var i = 0; i < reserved.length; ++i)\r\n if (reserved[i] === name)\r\n return true;\r\n return false;\r\n};\r\n\r\n/**\r\n * Not an actual constructor. Use {@link Namespace} instead.\r\n * @classdesc Base class of all reflection objects containing nested objects. This is not an actual class but here for the sake of having consistent type definitions.\r\n * @exports NamespaceBase\r\n * @extends ReflectionObject\r\n * @abstract\r\n * @constructor\r\n * @param {string} name Namespace name\r\n * @param {Object.} [options] Declared options\r\n * @see {@link Namespace}\r\n */\r\nfunction Namespace(name, options) {\r\n ReflectionObject.call(this, name, options);\r\n\r\n /**\r\n * Nested objects by name.\r\n * @type {Object.|undefined}\r\n */\r\n this.nested = undefined; // toJSON\r\n\r\n /**\r\n * Cached nested objects as an array.\r\n * @type {ReflectionObject[]|null}\r\n * @private\r\n */\r\n this._nestedArray = null;\r\n}\r\n\r\nfunction clearCache(namespace) {\r\n namespace._nestedArray = null;\r\n return namespace;\r\n}\r\n\r\n/**\r\n * Nested objects of this namespace as an array for iteration.\r\n * @name NamespaceBase#nestedArray\r\n * @type {ReflectionObject[]}\r\n * @readonly\r\n */\r\nObject.defineProperty(Namespace.prototype, \"nestedArray\", {\r\n get: function() {\r\n return this._nestedArray || (this._nestedArray = util.toArray(this.nested));\r\n }\r\n});\r\n\r\n/**\r\n * Namespace descriptor.\r\n * @interface INamespace\r\n * @property {Object.} [options] Namespace options\r\n * @property {Object.} [nested] Nested object descriptors\r\n */\r\n\r\n/**\r\n * Any extension field descriptor.\r\n * @typedef AnyExtensionField\r\n * @type {IExtensionField|IExtensionMapField}\r\n */\r\n\r\n/**\r\n * Any nested object descriptor.\r\n * @typedef AnyNestedObject\r\n * @type {IEnum|IType|IService|AnyExtensionField|INamespace|IOneOf}\r\n */\r\n\r\n/**\r\n * Converts this namespace to a namespace descriptor.\r\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\r\n * @returns {INamespace} Namespace descriptor\r\n */\r\nNamespace.prototype.toJSON = function toJSON(toJSONOptions) {\r\n return util.toObject([\r\n \"options\" , this.options,\r\n \"nested\" , arrayToJSON(this.nestedArray, toJSONOptions)\r\n ]);\r\n};\r\n\r\n/**\r\n * Adds nested objects to this namespace from nested object descriptors.\r\n * @param {Object.} nestedJson Any nested object descriptors\r\n * @returns {Namespace} `this`\r\n */\r\nNamespace.prototype.addJSON = function addJSON(nestedJson) {\r\n var ns = this;\r\n /* istanbul ignore else */\r\n if (nestedJson) {\r\n for (var names = Object.keys(nestedJson), i = 0, nested; i < names.length; ++i) {\r\n nested = nestedJson[names[i]];\r\n ns.add( // most to least likely\r\n ( nested.fields !== undefined\r\n ? Type.fromJSON\r\n : nested.values !== undefined\r\n ? Enum.fromJSON\r\n : nested.methods !== undefined\r\n ? Service.fromJSON\r\n : nested.id !== undefined\r\n ? Field.fromJSON\r\n : Namespace.fromJSON )(names[i], nested)\r\n );\r\n }\r\n }\r\n return this;\r\n};\r\n\r\n/**\r\n * Gets the nested object of the specified name.\r\n * @param {string} name Nested object name\r\n * @returns {ReflectionObject|null} The reflection object or `null` if it doesn't exist\r\n */\r\nNamespace.prototype.get = function get(name) {\r\n return this.nested && this.nested[name]\r\n || null;\r\n};\r\n\r\n/**\r\n * Gets the values of the nested {@link Enum|enum} of the specified name.\r\n * This methods differs from {@link Namespace#get|get} in that it returns an enum's values directly and throws instead of returning `null`.\r\n * @param {string} name Nested enum name\r\n * @returns {Object.} Enum values\r\n * @throws {Error} If there is no such enum\r\n */\r\nNamespace.prototype.getEnum = function getEnum(name) {\r\n if (this.nested && this.nested[name] instanceof Enum)\r\n return this.nested[name].values;\r\n throw Error(\"no such enum: \" + name);\r\n};\r\n\r\n/**\r\n * Adds a nested object to this namespace.\r\n * @param {ReflectionObject} object Nested object to add\r\n * @returns {Namespace} `this`\r\n * @throws {TypeError} If arguments are invalid\r\n * @throws {Error} If there is already a nested object with this name\r\n */\r\nNamespace.prototype.add = function add(object) {\r\n\r\n if (!(object instanceof Field && object.extend !== undefined || object instanceof Type || object instanceof OneOf || object instanceof Enum || object instanceof Service || object instanceof Namespace))\r\n throw TypeError(\"object must be a valid nested object\");\r\n\r\n if (!this.nested)\r\n this.nested = {};\r\n else {\r\n var prev = this.get(object.name);\r\n if (prev) {\r\n if (prev instanceof Namespace && object instanceof Namespace && !(prev instanceof Type || prev instanceof Service)) {\r\n // replace plain namespace but keep existing nested elements and options\r\n var nested = prev.nestedArray;\r\n for (var i = 0; i < nested.length; ++i)\r\n object.add(nested[i]);\r\n this.remove(prev);\r\n if (!this.nested)\r\n this.nested = {};\r\n object.setOptions(prev.options, true);\r\n\r\n } else\r\n throw Error(\"duplicate name '\" + object.name + \"' in \" + this);\r\n }\r\n }\r\n this.nested[object.name] = object;\r\n object.onAdd(this);\r\n return clearCache(this);\r\n};\r\n\r\n/**\r\n * Removes a nested object from this namespace.\r\n * @param {ReflectionObject} object Nested object to remove\r\n * @returns {Namespace} `this`\r\n * @throws {TypeError} If arguments are invalid\r\n * @throws {Error} If `object` is not a member of this namespace\r\n */\r\nNamespace.prototype.remove = function remove(object) {\r\n\r\n if (!(object instanceof ReflectionObject))\r\n throw TypeError(\"object must be a ReflectionObject\");\r\n if (object.parent !== this)\r\n throw Error(object + \" is not a member of \" + this);\r\n\r\n delete this.nested[object.name];\r\n if (!Object.keys(this.nested).length)\r\n this.nested = undefined;\r\n\r\n object.onRemove(this);\r\n return clearCache(this);\r\n};\r\n\r\n/**\r\n * Defines additial namespaces within this one if not yet existing.\r\n * @param {string|string[]} path Path to create\r\n * @param {*} [json] Nested types to create from JSON\r\n * @returns {Namespace} Pointer to the last namespace created or `this` if path is empty\r\n */\r\nNamespace.prototype.define = function define(path, json) {\r\n\r\n if (util.isString(path))\r\n path = path.split(\".\");\r\n else if (!Array.isArray(path))\r\n throw TypeError(\"illegal path\");\r\n if (path && path.length && path[0] === \"\")\r\n throw Error(\"path must be relative\");\r\n\r\n var ptr = this;\r\n while (path.length > 0) {\r\n var part = path.shift();\r\n if (ptr.nested && ptr.nested[part]) {\r\n ptr = ptr.nested[part];\r\n if (!(ptr instanceof Namespace))\r\n throw Error(\"path conflicts with non-namespace objects\");\r\n } else\r\n ptr.add(ptr = new Namespace(part));\r\n }\r\n if (json)\r\n ptr.addJSON(json);\r\n return ptr;\r\n};\r\n\r\n/**\r\n * Resolves this namespace's and all its nested objects' type references. Useful to validate a reflection tree, but comes at a cost.\r\n * @returns {Namespace} `this`\r\n */\r\nNamespace.prototype.resolveAll = function resolveAll() {\r\n var nested = this.nestedArray, i = 0;\r\n while (i < nested.length)\r\n if (nested[i] instanceof Namespace)\r\n nested[i++].resolveAll();\r\n else\r\n nested[i++].resolve();\r\n return this.resolve();\r\n};\r\n\r\n/**\r\n * Recursively looks up the reflection object matching the specified path in the scope of this namespace.\r\n * @param {string|string[]} path Path to look up\r\n * @param {*|Array.<*>} filterTypes Filter types, any combination of the constructors of `protobuf.Type`, `protobuf.Enum`, `protobuf.Service` etc.\r\n * @param {boolean} [parentAlreadyChecked=false] If known, whether the parent has already been checked\r\n * @returns {ReflectionObject|null} Looked up object or `null` if none could be found\r\n */\r\nNamespace.prototype.lookup = function lookup(path, filterTypes, parentAlreadyChecked) {\r\n\r\n /* istanbul ignore next */\r\n if (typeof filterTypes === \"boolean\") {\r\n parentAlreadyChecked = filterTypes;\r\n filterTypes = undefined;\r\n } else if (filterTypes && !Array.isArray(filterTypes))\r\n filterTypes = [ filterTypes ];\r\n\r\n if (util.isString(path) && path.length) {\r\n if (path === \".\")\r\n return this.root;\r\n path = path.split(\".\");\r\n } else if (!path.length)\r\n return this;\r\n\r\n // Start at root if path is absolute\r\n if (path[0] === \"\")\r\n return this.root.lookup(path.slice(1), filterTypes);\r\n\r\n // Test if the first part matches any nested object, and if so, traverse if path contains more\r\n var found = this.get(path[0]);\r\n if (found) {\r\n if (path.length === 1) {\r\n if (!filterTypes || filterTypes.indexOf(found.constructor) > -1)\r\n return found;\r\n } else if (found instanceof Namespace && (found = found.lookup(path.slice(1), filterTypes, true)))\r\n return found;\r\n\r\n // Otherwise try each nested namespace\r\n } else\r\n for (var i = 0; i < this.nestedArray.length; ++i)\r\n if (this._nestedArray[i] instanceof Namespace && (found = this._nestedArray[i].lookup(path, filterTypes, true)))\r\n return found;\r\n\r\n // If there hasn't been a match, try again at the parent\r\n if (this.parent === null || parentAlreadyChecked)\r\n return null;\r\n return this.parent.lookup(path, filterTypes);\r\n};\r\n\r\n/**\r\n * Looks up the reflection object at the specified path, relative to this namespace.\r\n * @name NamespaceBase#lookup\r\n * @function\r\n * @param {string|string[]} path Path to look up\r\n * @param {boolean} [parentAlreadyChecked=false] Whether the parent has already been checked\r\n * @returns {ReflectionObject|null} Looked up object or `null` if none could be found\r\n * @variation 2\r\n */\r\n// lookup(path: string, [parentAlreadyChecked: boolean])\r\n\r\n/**\r\n * Looks up the {@link Type|type} at the specified path, relative to this namespace.\r\n * Besides its signature, this methods differs from {@link Namespace#lookup|lookup} in that it throws instead of returning `null`.\r\n * @param {string|string[]} path Path to look up\r\n * @returns {Type} Looked up type\r\n * @throws {Error} If `path` does not point to a type\r\n */\r\nNamespace.prototype.lookupType = function lookupType(path) {\r\n var found = this.lookup(path, [ Type ]);\r\n if (!found)\r\n throw Error(\"no such type: \" + path);\r\n return found;\r\n};\r\n\r\n/**\r\n * Looks up the values of the {@link Enum|enum} at the specified path, relative to this namespace.\r\n * Besides its signature, this methods differs from {@link Namespace#lookup|lookup} in that it throws instead of returning `null`.\r\n * @param {string|string[]} path Path to look up\r\n * @returns {Enum} Looked up enum\r\n * @throws {Error} If `path` does not point to an enum\r\n */\r\nNamespace.prototype.lookupEnum = function lookupEnum(path) {\r\n var found = this.lookup(path, [ Enum ]);\r\n if (!found)\r\n throw Error(\"no such Enum '\" + path + \"' in \" + this);\r\n return found;\r\n};\r\n\r\n/**\r\n * Looks up the {@link Type|type} or {@link Enum|enum} at the specified path, relative to this namespace.\r\n * Besides its signature, this methods differs from {@link Namespace#lookup|lookup} in that it throws instead of returning `null`.\r\n * @param {string|string[]} path Path to look up\r\n * @returns {Type} Looked up type or enum\r\n * @throws {Error} If `path` does not point to a type or enum\r\n */\r\nNamespace.prototype.lookupTypeOrEnum = function lookupTypeOrEnum(path) {\r\n var found = this.lookup(path, [ Type, Enum ]);\r\n if (!found)\r\n throw Error(\"no such Type or Enum '\" + path + \"' in \" + this);\r\n return found;\r\n};\r\n\r\n/**\r\n * Looks up the {@link Service|service} at the specified path, relative to this namespace.\r\n * Besides its signature, this methods differs from {@link Namespace#lookup|lookup} in that it throws instead of returning `null`.\r\n * @param {string|string[]} path Path to look up\r\n * @returns {Service} Looked up service\r\n * @throws {Error} If `path` does not point to a service\r\n */\r\nNamespace.prototype.lookupService = function lookupService(path) {\r\n var found = this.lookup(path, [ Service ]);\r\n if (!found)\r\n throw Error(\"no such Service '\" + path + \"' in \" + this);\r\n return found;\r\n};\r\n\r\n// Sets up cyclic dependencies (called in index-light)\r\nNamespace._configure = function(Type_, Service_, Enum_) {\r\n Type = Type_;\r\n Service = Service_;\r\n Enum = Enum_;\r\n};\r\n","\"use strict\";\r\nmodule.exports = ReflectionObject;\r\n\r\nReflectionObject.className = \"ReflectionObject\";\r\n\r\nvar util = require(\"./util\");\r\n\r\nvar Root; // cyclic\r\n\r\n/**\r\n * Constructs a new reflection object instance.\r\n * @classdesc Base class of all reflection objects.\r\n * @constructor\r\n * @param {string} name Object name\r\n * @param {Object.} [options] Declared options\r\n * @abstract\r\n */\r\nfunction ReflectionObject(name, options) {\r\n\r\n if (!util.isString(name))\r\n throw TypeError(\"name must be a string\");\r\n\r\n if (options && !util.isObject(options))\r\n throw TypeError(\"options must be an object\");\r\n\r\n /**\r\n * Options.\r\n * @type {Object.|undefined}\r\n */\r\n this.options = options; // toJSON\r\n\r\n /**\r\n * Parsed Options.\r\n * @type {Array.>|undefined}\r\n */\r\n this.parsedOptions = null;\r\n\r\n /**\r\n * Unique name within its namespace.\r\n * @type {string}\r\n */\r\n this.name = name;\r\n\r\n /**\r\n * Parent namespace.\r\n * @type {Namespace|null}\r\n */\r\n this.parent = null;\r\n\r\n /**\r\n * Whether already resolved or not.\r\n * @type {boolean}\r\n */\r\n this.resolved = false;\r\n\r\n /**\r\n * Comment text, if any.\r\n * @type {string|null}\r\n */\r\n this.comment = null;\r\n\r\n /**\r\n * Defining file name.\r\n * @type {string|null}\r\n */\r\n this.filename = null;\r\n}\r\n\r\nObject.defineProperties(ReflectionObject.prototype, {\r\n\r\n /**\r\n * Reference to the root namespace.\r\n * @name ReflectionObject#root\r\n * @type {Root}\r\n * @readonly\r\n */\r\n root: {\r\n get: function() {\r\n var ptr = this;\r\n while (ptr.parent !== null)\r\n ptr = ptr.parent;\r\n return ptr;\r\n }\r\n },\r\n\r\n /**\r\n * Full name including leading dot.\r\n * @name ReflectionObject#fullName\r\n * @type {string}\r\n * @readonly\r\n */\r\n fullName: {\r\n get: function() {\r\n var path = [ this.name ],\r\n ptr = this.parent;\r\n while (ptr) {\r\n path.unshift(ptr.name);\r\n ptr = ptr.parent;\r\n }\r\n return path.join(\".\");\r\n }\r\n }\r\n});\r\n\r\n/**\r\n * Converts this reflection object to its descriptor representation.\r\n * @returns {Object.} Descriptor\r\n * @abstract\r\n */\r\nReflectionObject.prototype.toJSON = /* istanbul ignore next */ function toJSON() {\r\n throw Error(); // not implemented, shouldn't happen\r\n};\r\n\r\n/**\r\n * Called when this object is added to a parent.\r\n * @param {ReflectionObject} parent Parent added to\r\n * @returns {undefined}\r\n */\r\nReflectionObject.prototype.onAdd = function onAdd(parent) {\r\n if (this.parent && this.parent !== parent)\r\n this.parent.remove(this);\r\n this.parent = parent;\r\n this.resolved = false;\r\n var root = parent.root;\r\n if (root instanceof Root)\r\n root._handleAdd(this);\r\n};\r\n\r\n/**\r\n * Called when this object is removed from a parent.\r\n * @param {ReflectionObject} parent Parent removed from\r\n * @returns {undefined}\r\n */\r\nReflectionObject.prototype.onRemove = function onRemove(parent) {\r\n var root = parent.root;\r\n if (root instanceof Root)\r\n root._handleRemove(this);\r\n this.parent = null;\r\n this.resolved = false;\r\n};\r\n\r\n/**\r\n * Resolves this objects type references.\r\n * @returns {ReflectionObject} `this`\r\n */\r\nReflectionObject.prototype.resolve = function resolve() {\r\n if (this.resolved)\r\n return this;\r\n if (this.root instanceof Root)\r\n this.resolved = true; // only if part of a root\r\n return this;\r\n};\r\n\r\n/**\r\n * Gets an option value.\r\n * @param {string} name Option name\r\n * @returns {*} Option value or `undefined` if not set\r\n */\r\nReflectionObject.prototype.getOption = function getOption(name) {\r\n if (this.options)\r\n return this.options[name];\r\n return undefined;\r\n};\r\n\r\n/**\r\n * Sets an option.\r\n * @param {string} name Option name\r\n * @param {*} value Option value\r\n * @param {boolean} [ifNotSet] Sets the option only if it isn't currently set\r\n * @returns {ReflectionObject} `this`\r\n */\r\nReflectionObject.prototype.setOption = function setOption(name, value, ifNotSet) {\r\n if (!ifNotSet || !this.options || this.options[name] === undefined)\r\n (this.options || (this.options = {}))[name] = value;\r\n return this;\r\n};\r\n\r\n/**\r\n * Sets a parsed option.\r\n * @param {string} name parsed Option name\r\n * @param {*} value Option value\r\n * @param {string} propName dot '.' delimited full path of property within the option to set. if undefined\\empty, will add a new option with that value\r\n * @returns {ReflectionObject} `this`\r\n */\r\nReflectionObject.prototype.setParsedOption = function setParsedOption(name, value, propName) {\r\n if (!this.parsedOptions) {\r\n this.parsedOptions = [];\r\n }\r\n var parsedOptions = this.parsedOptions;\r\n if (propName) {\r\n // If setting a sub property of an option then try to merge it\r\n // with an existing option\r\n var opt = parsedOptions.find(function (opt) {\r\n return Object.prototype.hasOwnProperty.call(opt, name);\r\n });\r\n if (opt) {\r\n // If we found an existing option - just merge the property value\r\n var newValue = opt[name];\r\n util.setProperty(newValue, propName, value);\r\n } else {\r\n // otherwise, create a new option, set it's property and add it to the list\r\n opt = {};\r\n opt[name] = util.setProperty({}, propName, value);\r\n parsedOptions.push(opt);\r\n }\r\n } else {\r\n // Always create a new option when setting the value of the option itself\r\n var newOpt = {};\r\n newOpt[name] = value;\r\n parsedOptions.push(newOpt);\r\n }\r\n return this;\r\n};\r\n\r\n/**\r\n * Sets multiple options.\r\n * @param {Object.} options Options to set\r\n * @param {boolean} [ifNotSet] Sets an option only if it isn't currently set\r\n * @returns {ReflectionObject} `this`\r\n */\r\nReflectionObject.prototype.setOptions = function setOptions(options, ifNotSet) {\r\n if (options)\r\n for (var keys = Object.keys(options), i = 0; i < keys.length; ++i)\r\n this.setOption(keys[i], options[keys[i]], ifNotSet);\r\n return this;\r\n};\r\n\r\n/**\r\n * Converts this instance to its string representation.\r\n * @returns {string} Class name[, space, full name]\r\n */\r\nReflectionObject.prototype.toString = function toString() {\r\n var className = this.constructor.className,\r\n fullName = this.fullName;\r\n if (fullName.length)\r\n return className + \" \" + fullName;\r\n return className;\r\n};\r\n\r\n// Sets up cyclic dependencies (called in index-light)\r\nReflectionObject._configure = function(Root_) {\r\n Root = Root_;\r\n};\r\n","\"use strict\";\r\nmodule.exports = OneOf;\r\n\r\n// extends ReflectionObject\r\nvar ReflectionObject = require(\"./object\");\r\n((OneOf.prototype = Object.create(ReflectionObject.prototype)).constructor = OneOf).className = \"OneOf\";\r\n\r\nvar Field = require(\"./field\"),\r\n util = require(\"./util\");\r\n\r\n/**\r\n * Constructs a new oneof instance.\r\n * @classdesc Reflected oneof.\r\n * @extends ReflectionObject\r\n * @constructor\r\n * @param {string} name Oneof name\r\n * @param {string[]|Object.} [fieldNames] Field names\r\n * @param {Object.} [options] Declared options\r\n * @param {string} [comment] Comment associated with this field\r\n */\r\nfunction OneOf(name, fieldNames, options, comment) {\r\n if (!Array.isArray(fieldNames)) {\r\n options = fieldNames;\r\n fieldNames = undefined;\r\n }\r\n ReflectionObject.call(this, name, options);\r\n\r\n /* istanbul ignore if */\r\n if (!(fieldNames === undefined || Array.isArray(fieldNames)))\r\n throw TypeError(\"fieldNames must be an Array\");\r\n\r\n /**\r\n * Field names that belong to this oneof.\r\n * @type {string[]}\r\n */\r\n this.oneof = fieldNames || []; // toJSON, marker\r\n\r\n /**\r\n * Fields that belong to this oneof as an array for iteration.\r\n * @type {Field[]}\r\n * @readonly\r\n */\r\n this.fieldsArray = []; // declared readonly for conformance, possibly not yet added to parent\r\n\r\n /**\r\n * Comment for this field.\r\n * @type {string|null}\r\n */\r\n this.comment = comment;\r\n}\r\n\r\n/**\r\n * Oneof descriptor.\r\n * @interface IOneOf\r\n * @property {Array.} oneof Oneof field names\r\n * @property {Object.} [options] Oneof options\r\n */\r\n\r\n/**\r\n * Constructs a oneof from a oneof descriptor.\r\n * @param {string} name Oneof name\r\n * @param {IOneOf} json Oneof descriptor\r\n * @returns {OneOf} Created oneof\r\n * @throws {TypeError} If arguments are invalid\r\n */\r\nOneOf.fromJSON = function fromJSON(name, json) {\r\n return new OneOf(name, json.oneof, json.options, json.comment);\r\n};\r\n\r\n/**\r\n * Converts this oneof to a oneof descriptor.\r\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\r\n * @returns {IOneOf} Oneof descriptor\r\n */\r\nOneOf.prototype.toJSON = function toJSON(toJSONOptions) {\r\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\r\n return util.toObject([\r\n \"options\" , this.options,\r\n \"oneof\" , this.oneof,\r\n \"comment\" , keepComments ? this.comment : undefined\r\n ]);\r\n};\r\n\r\n/**\r\n * Adds the fields of the specified oneof to the parent if not already done so.\r\n * @param {OneOf} oneof The oneof\r\n * @returns {undefined}\r\n * @inner\r\n * @ignore\r\n */\r\nfunction addFieldsToParent(oneof) {\r\n if (oneof.parent)\r\n for (var i = 0; i < oneof.fieldsArray.length; ++i)\r\n if (!oneof.fieldsArray[i].parent)\r\n oneof.parent.add(oneof.fieldsArray[i]);\r\n}\r\n\r\n/**\r\n * Adds a field to this oneof and removes it from its current parent, if any.\r\n * @param {Field} field Field to add\r\n * @returns {OneOf} `this`\r\n */\r\nOneOf.prototype.add = function add(field) {\r\n\r\n /* istanbul ignore if */\r\n if (!(field instanceof Field))\r\n throw TypeError(\"field must be a Field\");\r\n\r\n if (field.parent && field.parent !== this.parent)\r\n field.parent.remove(field);\r\n this.oneof.push(field.name);\r\n this.fieldsArray.push(field);\r\n field.partOf = this; // field.parent remains null\r\n addFieldsToParent(this);\r\n return this;\r\n};\r\n\r\n/**\r\n * Removes a field from this oneof and puts it back to the oneof's parent.\r\n * @param {Field} field Field to remove\r\n * @returns {OneOf} `this`\r\n */\r\nOneOf.prototype.remove = function remove(field) {\r\n\r\n /* istanbul ignore if */\r\n if (!(field instanceof Field))\r\n throw TypeError(\"field must be a Field\");\r\n\r\n var index = this.fieldsArray.indexOf(field);\r\n\r\n /* istanbul ignore if */\r\n if (index < 0)\r\n throw Error(field + \" is not a member of \" + this);\r\n\r\n this.fieldsArray.splice(index, 1);\r\n index = this.oneof.indexOf(field.name);\r\n\r\n /* istanbul ignore else */\r\n if (index > -1) // theoretical\r\n this.oneof.splice(index, 1);\r\n\r\n field.partOf = null;\r\n return this;\r\n};\r\n\r\n/**\r\n * @override\r\n */\r\nOneOf.prototype.onAdd = function onAdd(parent) {\r\n ReflectionObject.prototype.onAdd.call(this, parent);\r\n var self = this;\r\n // Collect present fields\r\n for (var i = 0; i < this.oneof.length; ++i) {\r\n var field = parent.get(this.oneof[i]);\r\n if (field && !field.partOf) {\r\n field.partOf = self;\r\n self.fieldsArray.push(field);\r\n }\r\n }\r\n // Add not yet present fields\r\n addFieldsToParent(this);\r\n};\r\n\r\n/**\r\n * @override\r\n */\r\nOneOf.prototype.onRemove = function onRemove(parent) {\r\n for (var i = 0, field; i < this.fieldsArray.length; ++i)\r\n if ((field = this.fieldsArray[i]).parent)\r\n field.parent.remove(field);\r\n ReflectionObject.prototype.onRemove.call(this, parent);\r\n};\r\n\r\n/**\r\n * Decorator function as returned by {@link OneOf.d} (TypeScript).\r\n * @typedef OneOfDecorator\r\n * @type {function}\r\n * @param {Object} prototype Target prototype\r\n * @param {string} oneofName OneOf name\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * OneOf decorator (TypeScript).\r\n * @function\r\n * @param {...string} fieldNames Field names\r\n * @returns {OneOfDecorator} Decorator function\r\n * @template T extends string\r\n */\r\nOneOf.d = function decorateOneOf() {\r\n var fieldNames = new Array(arguments.length),\r\n index = 0;\r\n while (index < arguments.length)\r\n fieldNames[index] = arguments[index++];\r\n return function oneOfDecorator(prototype, oneofName) {\r\n util.decorateType(prototype.constructor)\r\n .add(new OneOf(oneofName, fieldNames));\r\n Object.defineProperty(prototype, oneofName, {\r\n get: util.oneOfGetter(fieldNames),\r\n set: util.oneOfSetter(fieldNames)\r\n });\r\n };\r\n};\r\n","\"use strict\";\r\nmodule.exports = parse;\r\n\r\nparse.filename = null;\r\nparse.defaults = { keepCase: false };\r\n\r\nvar tokenize = require(\"./tokenize\"),\r\n Root = require(\"./root\"),\r\n Type = require(\"./type\"),\r\n Field = require(\"./field\"),\r\n MapField = require(\"./mapfield\"),\r\n OneOf = require(\"./oneof\"),\r\n Enum = require(\"./enum\"),\r\n Service = require(\"./service\"),\r\n Method = require(\"./method\"),\r\n types = require(\"./types\"),\r\n util = require(\"./util\");\r\n\r\nvar base10Re = /^[1-9][0-9]*$/,\r\n base10NegRe = /^-?[1-9][0-9]*$/,\r\n base16Re = /^0[x][0-9a-fA-F]+$/,\r\n base16NegRe = /^-?0[x][0-9a-fA-F]+$/,\r\n base8Re = /^0[0-7]+$/,\r\n base8NegRe = /^-?0[0-7]+$/,\r\n numberRe = /^(?![eE])[0-9]*(?:\\.[0-9]*)?(?:[eE][+-]?[0-9]+)?$/,\r\n nameRe = /^[a-zA-Z_][a-zA-Z_0-9]*$/,\r\n typeRefRe = /^(?:\\.?[a-zA-Z_][a-zA-Z_0-9]*)(?:\\.[a-zA-Z_][a-zA-Z_0-9]*)*$/,\r\n fqTypeRefRe = /^(?:\\.[a-zA-Z_][a-zA-Z_0-9]*)+$/;\r\n\r\n/**\r\n * Result object returned from {@link parse}.\r\n * @interface IParserResult\r\n * @property {string|undefined} package Package name, if declared\r\n * @property {string[]|undefined} imports Imports, if any\r\n * @property {string[]|undefined} weakImports Weak imports, if any\r\n * @property {string|undefined} syntax Syntax, if specified (either `\"proto2\"` or `\"proto3\"`)\r\n * @property {Root} root Populated root instance\r\n */\r\n\r\n/**\r\n * Options modifying the behavior of {@link parse}.\r\n * @interface IParseOptions\r\n * @property {boolean} [keepCase=false] Keeps field casing instead of converting to camel case\r\n * @property {boolean} [alternateCommentMode=false] Recognize double-slash comments in addition to doc-block comments.\r\n * @property {boolean} [preferTrailingComment=false] Use trailing comment when both leading comment and trailing comment exist.\r\n */\r\n\r\n/**\r\n * Options modifying the behavior of JSON serialization.\r\n * @interface IToJSONOptions\r\n * @property {boolean} [keepComments=false] Serializes comments.\r\n */\r\n\r\n/**\r\n * Parses the given .proto source and returns an object with the parsed contents.\r\n * @param {string} source Source contents\r\n * @param {Root} root Root to populate\r\n * @param {IParseOptions} [options] Parse options. Defaults to {@link parse.defaults} when omitted.\r\n * @returns {IParserResult} Parser result\r\n * @property {string} filename=null Currently processing file name for error reporting, if known\r\n * @property {IParseOptions} defaults Default {@link IParseOptions}\r\n */\r\nfunction parse(source, root, options) {\r\n /* eslint-disable callback-return */\r\n if (!(root instanceof Root)) {\r\n options = root;\r\n root = new Root();\r\n }\r\n if (!options)\r\n options = parse.defaults;\r\n\r\n var preferTrailingComment = options.preferTrailingComment || false;\r\n var tn = tokenize(source, options.alternateCommentMode || false),\r\n next = tn.next,\r\n push = tn.push,\r\n peek = tn.peek,\r\n skip = tn.skip,\r\n cmnt = tn.cmnt;\r\n\r\n var head = true,\r\n pkg,\r\n imports,\r\n weakImports,\r\n syntax,\r\n isProto3 = false;\r\n\r\n var ptr = root;\r\n\r\n var applyCase = options.keepCase ? function(name) { return name; } : util.camelCase;\r\n\r\n /* istanbul ignore next */\r\n function illegal(token, name, insideTryCatch) {\r\n var filename = parse.filename;\r\n if (!insideTryCatch)\r\n parse.filename = null;\r\n return Error(\"illegal \" + (name || \"token\") + \" '\" + token + \"' (\" + (filename ? filename + \", \" : \"\") + \"line \" + tn.line + \")\");\r\n }\r\n\r\n function readString() {\r\n var values = [],\r\n token;\r\n do {\r\n /* istanbul ignore if */\r\n if ((token = next()) !== \"\\\"\" && token !== \"'\")\r\n throw illegal(token);\r\n\r\n values.push(next());\r\n skip(token);\r\n token = peek();\r\n } while (token === \"\\\"\" || token === \"'\");\r\n return values.join(\"\");\r\n }\r\n\r\n function readValue(acceptTypeRef) {\r\n var token = next();\r\n switch (token) {\r\n case \"'\":\r\n case \"\\\"\":\r\n push(token);\r\n return readString();\r\n case \"true\": case \"TRUE\":\r\n return true;\r\n case \"false\": case \"FALSE\":\r\n return false;\r\n }\r\n try {\r\n return parseNumber(token, /* insideTryCatch */ true);\r\n } catch (e) {\r\n\r\n /* istanbul ignore else */\r\n if (acceptTypeRef && typeRefRe.test(token))\r\n return token;\r\n\r\n /* istanbul ignore next */\r\n throw illegal(token, \"value\");\r\n }\r\n }\r\n\r\n function readRanges(target, acceptStrings) {\r\n var token, start;\r\n do {\r\n if (acceptStrings && ((token = peek()) === \"\\\"\" || token === \"'\"))\r\n target.push(readString());\r\n else\r\n target.push([ start = parseId(next()), skip(\"to\", true) ? parseId(next()) : start ]);\r\n } while (skip(\",\", true));\r\n var dummy = {options: undefined};\r\n dummy.setOption = function(name, value) {\r\n if (this.options === undefined) this.options = {};\r\n this.options[name] = value;\r\n };\r\n ifBlock(\r\n dummy,\r\n function parseRange_block(token) {\r\n /* istanbul ignore else */\r\n if (token === \"option\") {\r\n parseOption(dummy, token); // skip\r\n skip(\";\");\r\n } else\r\n throw illegal(token);\r\n },\r\n function parseRange_line() {\r\n parseInlineOptions(dummy); // skip\r\n });\r\n }\r\n\r\n function parseNumber(token, insideTryCatch) {\r\n var sign = 1;\r\n if (token.charAt(0) === \"-\") {\r\n sign = -1;\r\n token = token.substring(1);\r\n }\r\n switch (token) {\r\n case \"inf\": case \"INF\": case \"Inf\":\r\n return sign * Infinity;\r\n case \"nan\": case \"NAN\": case \"Nan\": case \"NaN\":\r\n return NaN;\r\n case \"0\":\r\n return 0;\r\n }\r\n if (base10Re.test(token))\r\n return sign * parseInt(token, 10);\r\n if (base16Re.test(token))\r\n return sign * parseInt(token, 16);\r\n if (base8Re.test(token))\r\n return sign * parseInt(token, 8);\r\n\r\n /* istanbul ignore else */\r\n if (numberRe.test(token))\r\n return sign * parseFloat(token);\r\n\r\n /* istanbul ignore next */\r\n throw illegal(token, \"number\", insideTryCatch);\r\n }\r\n\r\n function parseId(token, acceptNegative) {\r\n switch (token) {\r\n case \"max\": case \"MAX\": case \"Max\":\r\n return 536870911;\r\n case \"0\":\r\n return 0;\r\n }\r\n\r\n /* istanbul ignore if */\r\n if (!acceptNegative && token.charAt(0) === \"-\")\r\n throw illegal(token, \"id\");\r\n\r\n if (base10NegRe.test(token))\r\n return parseInt(token, 10);\r\n if (base16NegRe.test(token))\r\n return parseInt(token, 16);\r\n\r\n /* istanbul ignore else */\r\n if (base8NegRe.test(token))\r\n return parseInt(token, 8);\r\n\r\n /* istanbul ignore next */\r\n throw illegal(token, \"id\");\r\n }\r\n\r\n function parsePackage() {\r\n\r\n /* istanbul ignore if */\r\n if (pkg !== undefined)\r\n throw illegal(\"package\");\r\n\r\n pkg = next();\r\n\r\n /* istanbul ignore if */\r\n if (!typeRefRe.test(pkg))\r\n throw illegal(pkg, \"name\");\r\n\r\n ptr = ptr.define(pkg);\r\n skip(\";\");\r\n }\r\n\r\n function parseImport() {\r\n var token = peek();\r\n var whichImports;\r\n switch (token) {\r\n case \"weak\":\r\n whichImports = weakImports || (weakImports = []);\r\n next();\r\n break;\r\n case \"public\":\r\n next();\r\n // eslint-disable-next-line no-fallthrough\r\n default:\r\n whichImports = imports || (imports = []);\r\n break;\r\n }\r\n token = readString();\r\n skip(\";\");\r\n whichImports.push(token);\r\n }\r\n\r\n function parseSyntax() {\r\n skip(\"=\");\r\n syntax = readString();\r\n isProto3 = syntax === \"proto3\";\r\n\r\n /* istanbul ignore if */\r\n if (!isProto3 && syntax !== \"proto2\")\r\n throw illegal(syntax, \"syntax\");\r\n\r\n skip(\";\");\r\n }\r\n\r\n function parseCommon(parent, token) {\r\n switch (token) {\r\n\r\n case \"option\":\r\n parseOption(parent, token);\r\n skip(\";\");\r\n return true;\r\n\r\n case \"message\":\r\n parseType(parent, token);\r\n return true;\r\n\r\n case \"enum\":\r\n parseEnum(parent, token);\r\n return true;\r\n\r\n case \"service\":\r\n parseService(parent, token);\r\n return true;\r\n\r\n case \"extend\":\r\n parseExtension(parent, token);\r\n return true;\r\n }\r\n return false;\r\n }\r\n\r\n function ifBlock(obj, fnIf, fnElse) {\r\n var trailingLine = tn.line;\r\n if (obj) {\r\n if(typeof obj.comment !== \"string\") {\r\n obj.comment = cmnt(); // try block-type comment\r\n }\r\n obj.filename = parse.filename;\r\n }\r\n if (skip(\"{\", true)) {\r\n var token;\r\n while ((token = next()) !== \"}\")\r\n fnIf(token);\r\n skip(\";\", true);\r\n } else {\r\n if (fnElse)\r\n fnElse();\r\n skip(\";\");\r\n if (obj && (typeof obj.comment !== \"string\" || preferTrailingComment))\r\n obj.comment = cmnt(trailingLine) || obj.comment; // try line-type comment\r\n }\r\n }\r\n\r\n function parseType(parent, token) {\r\n\r\n /* istanbul ignore if */\r\n if (!nameRe.test(token = next()))\r\n throw illegal(token, \"type name\");\r\n\r\n var type = new Type(token);\r\n ifBlock(type, function parseType_block(token) {\r\n if (parseCommon(type, token))\r\n return;\r\n\r\n switch (token) {\r\n\r\n case \"map\":\r\n parseMapField(type, token);\r\n break;\r\n\r\n case \"required\":\r\n case \"repeated\":\r\n parseField(type, token);\r\n break;\r\n\r\n case \"optional\":\r\n /* istanbul ignore if */\r\n if (isProto3) {\r\n parseField(type, \"proto3_optional\");\r\n } else {\r\n parseField(type, \"optional\");\r\n }\r\n break;\r\n\r\n case \"oneof\":\r\n parseOneOf(type, token);\r\n break;\r\n\r\n case \"extensions\":\r\n readRanges(type.extensions || (type.extensions = []));\r\n break;\r\n\r\n case \"reserved\":\r\n readRanges(type.reserved || (type.reserved = []), true);\r\n break;\r\n\r\n default:\r\n /* istanbul ignore if */\r\n if (!isProto3 || !typeRefRe.test(token))\r\n throw illegal(token);\r\n\r\n push(token);\r\n parseField(type, \"optional\");\r\n break;\r\n }\r\n });\r\n parent.add(type);\r\n }\r\n\r\n function parseField(parent, rule, extend) {\r\n var type = next();\r\n if (type === \"group\") {\r\n parseGroup(parent, rule);\r\n return;\r\n }\r\n // Type names can consume multiple tokens, in multiple variants:\r\n // package.subpackage field tokens: \"package.subpackage\" [TYPE NAME ENDS HERE] \"field\"\r\n // package . subpackage field tokens: \"package\" \".\" \"subpackage\" [TYPE NAME ENDS HERE] \"field\"\r\n // package. subpackage field tokens: \"package.\" \"subpackage\" [TYPE NAME ENDS HERE] \"field\"\r\n // package .subpackage field tokens: \"package\" \".subpackage\" [TYPE NAME ENDS HERE] \"field\"\r\n // Keep reading tokens until we get a type name with no period at the end,\r\n // and the next token does not start with a period.\r\n while (type.endsWith(\".\") || peek().startsWith(\".\")) {\r\n type += next();\r\n }\r\n\r\n /* istanbul ignore if */\r\n if (!typeRefRe.test(type))\r\n throw illegal(type, \"type\");\r\n\r\n var name = next();\r\n\r\n /* istanbul ignore if */\r\n if (!nameRe.test(name))\r\n throw illegal(name, \"name\");\r\n\r\n name = applyCase(name);\r\n skip(\"=\");\r\n\r\n var field = new Field(name, parseId(next()), type, rule, extend);\r\n ifBlock(field, function parseField_block(token) {\r\n\r\n /* istanbul ignore else */\r\n if (token === \"option\") {\r\n parseOption(field, token);\r\n skip(\";\");\r\n } else\r\n throw illegal(token);\r\n\r\n }, function parseField_line() {\r\n parseInlineOptions(field);\r\n });\r\n\r\n if (rule === \"proto3_optional\") {\r\n // for proto3 optional fields, we create a single-member Oneof to mimic \"optional\" behavior\r\n var oneof = new OneOf(\"_\" + name);\r\n field.setOption(\"proto3_optional\", true);\r\n oneof.add(field);\r\n parent.add(oneof);\r\n } else {\r\n parent.add(field);\r\n }\r\n\r\n // JSON defaults to packed=true if not set so we have to set packed=false explicity when\r\n // parsing proto2 descriptors without the option, where applicable. This must be done for\r\n // all known packable types and anything that could be an enum (= is not a basic type).\r\n if (!isProto3 && field.repeated && (types.packed[type] !== undefined || types.basic[type] === undefined))\r\n field.setOption(\"packed\", false, /* ifNotSet */ true);\r\n }\r\n\r\n function parseGroup(parent, rule) {\r\n var name = next();\r\n\r\n /* istanbul ignore if */\r\n if (!nameRe.test(name))\r\n throw illegal(name, \"name\");\r\n\r\n var fieldName = util.lcFirst(name);\r\n if (name === fieldName)\r\n name = util.ucFirst(name);\r\n skip(\"=\");\r\n var id = parseId(next());\r\n var type = new Type(name);\r\n type.group = true;\r\n var field = new Field(fieldName, id, name, rule);\r\n field.filename = parse.filename;\r\n ifBlock(type, function parseGroup_block(token) {\r\n switch (token) {\r\n\r\n case \"option\":\r\n parseOption(type, token);\r\n skip(\";\");\r\n break;\r\n\r\n case \"required\":\r\n case \"repeated\":\r\n parseField(type, token);\r\n break;\r\n\r\n case \"optional\":\r\n /* istanbul ignore if */\r\n if (isProto3) {\r\n parseField(type, \"proto3_optional\");\r\n } else {\r\n parseField(type, \"optional\");\r\n }\r\n break;\r\n\r\n case \"message\":\r\n parseType(type, token);\r\n break;\r\n\r\n case \"enum\":\r\n parseEnum(type, token);\r\n break;\r\n\r\n /* istanbul ignore next */\r\n default:\r\n throw illegal(token); // there are no groups with proto3 semantics\r\n }\r\n });\r\n parent.add(type)\r\n .add(field);\r\n }\r\n\r\n function parseMapField(parent) {\r\n skip(\"<\");\r\n var keyType = next();\r\n\r\n /* istanbul ignore if */\r\n if (types.mapKey[keyType] === undefined)\r\n throw illegal(keyType, \"type\");\r\n\r\n skip(\",\");\r\n var valueType = next();\r\n\r\n /* istanbul ignore if */\r\n if (!typeRefRe.test(valueType))\r\n throw illegal(valueType, \"type\");\r\n\r\n skip(\">\");\r\n var name = next();\r\n\r\n /* istanbul ignore if */\r\n if (!nameRe.test(name))\r\n throw illegal(name, \"name\");\r\n\r\n skip(\"=\");\r\n var field = new MapField(applyCase(name), parseId(next()), keyType, valueType);\r\n ifBlock(field, function parseMapField_block(token) {\r\n\r\n /* istanbul ignore else */\r\n if (token === \"option\") {\r\n parseOption(field, token);\r\n skip(\";\");\r\n } else\r\n throw illegal(token);\r\n\r\n }, function parseMapField_line() {\r\n parseInlineOptions(field);\r\n });\r\n parent.add(field);\r\n }\r\n\r\n function parseOneOf(parent, token) {\r\n\r\n /* istanbul ignore if */\r\n if (!nameRe.test(token = next()))\r\n throw illegal(token, \"name\");\r\n\r\n var oneof = new OneOf(applyCase(token));\r\n ifBlock(oneof, function parseOneOf_block(token) {\r\n if (token === \"option\") {\r\n parseOption(oneof, token);\r\n skip(\";\");\r\n } else {\r\n push(token);\r\n parseField(oneof, \"optional\");\r\n }\r\n });\r\n parent.add(oneof);\r\n }\r\n\r\n function parseEnum(parent, token) {\r\n\r\n /* istanbul ignore if */\r\n if (!nameRe.test(token = next()))\r\n throw illegal(token, \"name\");\r\n\r\n var enm = new Enum(token);\r\n ifBlock(enm, function parseEnum_block(token) {\r\n switch(token) {\r\n case \"option\":\r\n parseOption(enm, token);\r\n skip(\";\");\r\n break;\r\n\r\n case \"reserved\":\r\n readRanges(enm.reserved || (enm.reserved = []), true);\r\n break;\r\n\r\n default:\r\n parseEnumValue(enm, token);\r\n }\r\n });\r\n parent.add(enm);\r\n }\r\n\r\n function parseEnumValue(parent, token) {\r\n\r\n /* istanbul ignore if */\r\n if (!nameRe.test(token))\r\n throw illegal(token, \"name\");\r\n\r\n skip(\"=\");\r\n var value = parseId(next(), true),\r\n dummy = {\r\n options: undefined\r\n };\r\n dummy.setOption = function(name, value) {\r\n if (this.options === undefined)\r\n this.options = {};\r\n this.options[name] = value;\r\n };\r\n ifBlock(dummy, function parseEnumValue_block(token) {\r\n\r\n /* istanbul ignore else */\r\n if (token === \"option\") {\r\n parseOption(dummy, token); // skip\r\n skip(\";\");\r\n } else\r\n throw illegal(token);\r\n\r\n }, function parseEnumValue_line() {\r\n parseInlineOptions(dummy); // skip\r\n });\r\n parent.add(token, value, dummy.comment, dummy.options);\r\n }\r\n\r\n function parseOption(parent, token) {\r\n var isCustom = skip(\"(\", true);\r\n\r\n /* istanbul ignore if */\r\n if (!typeRefRe.test(token = next()))\r\n throw illegal(token, \"name\");\r\n\r\n var name = token;\r\n var option = name;\r\n var propName;\r\n\r\n if (isCustom) {\r\n skip(\")\");\r\n name = \"(\" + name + \")\";\r\n option = name;\r\n token = peek();\r\n if (fqTypeRefRe.test(token)) {\r\n propName = token.slice(1); //remove '.' before property name\r\n name += token;\r\n next();\r\n }\r\n }\r\n skip(\"=\");\r\n var optionValue = parseOptionValue(parent, name);\r\n setParsedOption(parent, option, optionValue, propName);\r\n }\r\n\r\n function parseOptionValue(parent, name) {\r\n // { a: \"foo\" b { c: \"bar\" } }\r\n if (skip(\"{\", true)) {\r\n var objectResult = {};\r\n\r\n while (!skip(\"}\", true)) {\r\n /* istanbul ignore if */\r\n if (!nameRe.test(token = next())) {\r\n throw illegal(token, \"name\");\r\n }\r\n if (token === null) {\r\n throw illegal(token, \"end of input\");\r\n }\r\n\r\n var value;\r\n var propName = token;\r\n\r\n skip(\":\", true);\r\n\r\n if (peek() === \"{\")\r\n value = parseOptionValue(parent, name + \".\" + token);\r\n else if (peek() === \"[\") {\r\n // option (my_option) = {\r\n // repeated_value: [ \"foo\", \"bar\" ]\r\n // };\r\n value = [];\r\n var lastValue;\r\n if (skip(\"[\", true)) {\r\n do {\r\n lastValue = readValue(true);\r\n value.push(lastValue);\r\n } while (skip(\",\", true));\r\n skip(\"]\");\r\n if (typeof lastValue !== \"undefined\") {\r\n setOption(parent, name + \".\" + token, lastValue);\r\n }\r\n }\r\n } else {\r\n value = readValue(true);\r\n setOption(parent, name + \".\" + token, value);\r\n }\r\n\r\n var prevValue = objectResult[propName];\r\n\r\n if (prevValue)\r\n value = [].concat(prevValue).concat(value);\r\n\r\n objectResult[propName] = value;\r\n\r\n // Semicolons and commas can be optional\r\n skip(\",\", true);\r\n skip(\";\", true);\r\n }\r\n\r\n return objectResult;\r\n }\r\n\r\n var simpleValue = readValue(true);\r\n setOption(parent, name, simpleValue);\r\n return simpleValue;\r\n // Does not enforce a delimiter to be universal\r\n }\r\n\r\n function setOption(parent, name, value) {\r\n if (parent.setOption)\r\n parent.setOption(name, value);\r\n }\r\n\r\n function setParsedOption(parent, name, value, propName) {\r\n if (parent.setParsedOption)\r\n parent.setParsedOption(name, value, propName);\r\n }\r\n\r\n function parseInlineOptions(parent) {\r\n if (skip(\"[\", true)) {\r\n do {\r\n parseOption(parent, \"option\");\r\n } while (skip(\",\", true));\r\n skip(\"]\");\r\n }\r\n return parent;\r\n }\r\n\r\n function parseService(parent, token) {\r\n\r\n /* istanbul ignore if */\r\n if (!nameRe.test(token = next()))\r\n throw illegal(token, \"service name\");\r\n\r\n var service = new Service(token);\r\n ifBlock(service, function parseService_block(token) {\r\n if (parseCommon(service, token))\r\n return;\r\n\r\n /* istanbul ignore else */\r\n if (token === \"rpc\")\r\n parseMethod(service, token);\r\n else\r\n throw illegal(token);\r\n });\r\n parent.add(service);\r\n }\r\n\r\n function parseMethod(parent, token) {\r\n // Get the comment of the preceding line now (if one exists) in case the\r\n // method is defined across multiple lines.\r\n var commentText = cmnt();\r\n\r\n var type = token;\r\n\r\n /* istanbul ignore if */\r\n if (!nameRe.test(token = next()))\r\n throw illegal(token, \"name\");\r\n\r\n var name = token,\r\n requestType, requestStream,\r\n responseType, responseStream;\r\n\r\n skip(\"(\");\r\n if (skip(\"stream\", true))\r\n requestStream = true;\r\n\r\n /* istanbul ignore if */\r\n if (!typeRefRe.test(token = next()))\r\n throw illegal(token);\r\n\r\n requestType = token;\r\n skip(\")\"); skip(\"returns\"); skip(\"(\");\r\n if (skip(\"stream\", true))\r\n responseStream = true;\r\n\r\n /* istanbul ignore if */\r\n if (!typeRefRe.test(token = next()))\r\n throw illegal(token);\r\n\r\n responseType = token;\r\n skip(\")\");\r\n\r\n var method = new Method(name, type, requestType, responseType, requestStream, responseStream);\r\n method.comment = commentText;\r\n ifBlock(method, function parseMethod_block(token) {\r\n\r\n /* istanbul ignore else */\r\n if (token === \"option\") {\r\n parseOption(method, token);\r\n skip(\";\");\r\n } else\r\n throw illegal(token);\r\n\r\n });\r\n parent.add(method);\r\n }\r\n\r\n function parseExtension(parent, token) {\r\n\r\n /* istanbul ignore if */\r\n if (!typeRefRe.test(token = next()))\r\n throw illegal(token, \"reference\");\r\n\r\n var reference = token;\r\n ifBlock(null, function parseExtension_block(token) {\r\n switch (token) {\r\n\r\n case \"required\":\r\n case \"repeated\":\r\n parseField(parent, token, reference);\r\n break;\r\n\r\n case \"optional\":\r\n /* istanbul ignore if */\r\n if (isProto3) {\r\n parseField(parent, \"proto3_optional\", reference);\r\n } else {\r\n parseField(parent, \"optional\", reference);\r\n }\r\n break;\r\n\r\n default:\r\n /* istanbul ignore if */\r\n if (!isProto3 || !typeRefRe.test(token))\r\n throw illegal(token);\r\n push(token);\r\n parseField(parent, \"optional\", reference);\r\n break;\r\n }\r\n });\r\n }\r\n\r\n var token;\r\n while ((token = next()) !== null) {\r\n switch (token) {\r\n\r\n case \"package\":\r\n\r\n /* istanbul ignore if */\r\n if (!head)\r\n throw illegal(token);\r\n\r\n parsePackage();\r\n break;\r\n\r\n case \"import\":\r\n\r\n /* istanbul ignore if */\r\n if (!head)\r\n throw illegal(token);\r\n\r\n parseImport();\r\n break;\r\n\r\n case \"syntax\":\r\n\r\n /* istanbul ignore if */\r\n if (!head)\r\n throw illegal(token);\r\n\r\n parseSyntax();\r\n break;\r\n\r\n case \"option\":\r\n\r\n parseOption(ptr, token);\r\n skip(\";\");\r\n break;\r\n\r\n default:\r\n\r\n /* istanbul ignore else */\r\n if (parseCommon(ptr, token)) {\r\n head = false;\r\n continue;\r\n }\r\n\r\n /* istanbul ignore next */\r\n throw illegal(token);\r\n }\r\n }\r\n\r\n parse.filename = null;\r\n return {\r\n \"package\" : pkg,\r\n \"imports\" : imports,\r\n weakImports : weakImports,\r\n syntax : syntax,\r\n root : root\r\n };\r\n}\r\n\r\n/**\r\n * Parses the given .proto source and returns an object with the parsed contents.\r\n * @name parse\r\n * @function\r\n * @param {string} source Source contents\r\n * @param {IParseOptions} [options] Parse options. Defaults to {@link parse.defaults} when omitted.\r\n * @returns {IParserResult} Parser result\r\n * @property {string} filename=null Currently processing file name for error reporting, if known\r\n * @property {IParseOptions} defaults Default {@link IParseOptions}\r\n * @variation 2\r\n */\r\n","\"use strict\";\r\nmodule.exports = Reader;\r\n\r\nvar util = require(\"./util/minimal\");\r\n\r\nvar BufferReader; // cyclic\r\n\r\nvar LongBits = util.LongBits,\r\n utf8 = util.utf8;\r\n\r\n/* istanbul ignore next */\r\nfunction indexOutOfRange(reader, writeLength) {\r\n return RangeError(\"index out of range: \" + reader.pos + \" + \" + (writeLength || 1) + \" > \" + reader.len);\r\n}\r\n\r\n/**\r\n * Constructs a new reader instance using the specified buffer.\r\n * @classdesc Wire format reader using `Uint8Array` if available, otherwise `Array`.\r\n * @constructor\r\n * @param {Uint8Array} buffer Buffer to read from\r\n */\r\nfunction Reader(buffer) {\r\n\r\n /**\r\n * Read buffer.\r\n * @type {Uint8Array}\r\n */\r\n this.buf = buffer;\r\n\r\n /**\r\n * Read buffer position.\r\n * @type {number}\r\n */\r\n this.pos = 0;\r\n\r\n /**\r\n * Read buffer length.\r\n * @type {number}\r\n */\r\n this.len = buffer.length;\r\n}\r\n\r\nvar create_array = typeof Uint8Array !== \"undefined\"\r\n ? function create_typed_array(buffer) {\r\n if (buffer instanceof Uint8Array || Array.isArray(buffer))\r\n return new Reader(buffer);\r\n throw Error(\"illegal buffer\");\r\n }\r\n /* istanbul ignore next */\r\n : function create_array(buffer) {\r\n if (Array.isArray(buffer))\r\n return new Reader(buffer);\r\n throw Error(\"illegal buffer\");\r\n };\r\n\r\nvar create = function create() {\r\n return util.Buffer\r\n ? function create_buffer_setup(buffer) {\r\n return (Reader.create = function create_buffer(buffer) {\r\n return util.Buffer.isBuffer(buffer)\r\n ? new BufferReader(buffer)\r\n /* istanbul ignore next */\r\n : create_array(buffer);\r\n })(buffer);\r\n }\r\n /* istanbul ignore next */\r\n : create_array;\r\n};\r\n\r\n/**\r\n * Creates a new reader using the specified buffer.\r\n * @function\r\n * @param {Uint8Array|Buffer} buffer Buffer to read from\r\n * @returns {Reader|BufferReader} A {@link BufferReader} if `buffer` is a Buffer, otherwise a {@link Reader}\r\n * @throws {Error} If `buffer` is not a valid buffer\r\n */\r\nReader.create = create();\r\n\r\nReader.prototype._slice = util.Array.prototype.subarray || /* istanbul ignore next */ util.Array.prototype.slice;\r\n\r\n/**\r\n * Reads a varint as an unsigned 32 bit value.\r\n * @function\r\n * @returns {number} Value read\r\n */\r\nReader.prototype.uint32 = (function read_uint32_setup() {\r\n var value = 4294967295; // optimizer type-hint, tends to deopt otherwise (?!)\r\n return function read_uint32() {\r\n value = ( this.buf[this.pos] & 127 ) >>> 0; if (this.buf[this.pos++] < 128) return value;\r\n value = (value | (this.buf[this.pos] & 127) << 7) >>> 0; if (this.buf[this.pos++] < 128) return value;\r\n value = (value | (this.buf[this.pos] & 127) << 14) >>> 0; if (this.buf[this.pos++] < 128) return value;\r\n value = (value | (this.buf[this.pos] & 127) << 21) >>> 0; if (this.buf[this.pos++] < 128) return value;\r\n value = (value | (this.buf[this.pos] & 15) << 28) >>> 0; if (this.buf[this.pos++] < 128) return value;\r\n\r\n /* istanbul ignore if */\r\n if ((this.pos += 5) > this.len) {\r\n this.pos = this.len;\r\n throw indexOutOfRange(this, 10);\r\n }\r\n return value;\r\n };\r\n})();\r\n\r\n/**\r\n * Reads a varint as a signed 32 bit value.\r\n * @returns {number} Value read\r\n */\r\nReader.prototype.int32 = function read_int32() {\r\n return this.uint32() | 0;\r\n};\r\n\r\n/**\r\n * Reads a zig-zag encoded varint as a signed 32 bit value.\r\n * @returns {number} Value read\r\n */\r\nReader.prototype.sint32 = function read_sint32() {\r\n var value = this.uint32();\r\n return value >>> 1 ^ -(value & 1) | 0;\r\n};\r\n\r\n/* eslint-disable no-invalid-this */\r\n\r\nfunction readLongVarint() {\r\n // tends to deopt with local vars for octet etc.\r\n var bits = new LongBits(0, 0);\r\n var i = 0;\r\n if (this.len - this.pos > 4) { // fast route (lo)\r\n for (; i < 4; ++i) {\r\n // 1st..4th\r\n bits.lo = (bits.lo | (this.buf[this.pos] & 127) << i * 7) >>> 0;\r\n if (this.buf[this.pos++] < 128)\r\n return bits;\r\n }\r\n // 5th\r\n bits.lo = (bits.lo | (this.buf[this.pos] & 127) << 28) >>> 0;\r\n bits.hi = (bits.hi | (this.buf[this.pos] & 127) >> 4) >>> 0;\r\n if (this.buf[this.pos++] < 128)\r\n return bits;\r\n i = 0;\r\n } else {\r\n for (; i < 3; ++i) {\r\n /* istanbul ignore if */\r\n if (this.pos >= this.len)\r\n throw indexOutOfRange(this);\r\n // 1st..3th\r\n bits.lo = (bits.lo | (this.buf[this.pos] & 127) << i * 7) >>> 0;\r\n if (this.buf[this.pos++] < 128)\r\n return bits;\r\n }\r\n // 4th\r\n bits.lo = (bits.lo | (this.buf[this.pos++] & 127) << i * 7) >>> 0;\r\n return bits;\r\n }\r\n if (this.len - this.pos > 4) { // fast route (hi)\r\n for (; i < 5; ++i) {\r\n // 6th..10th\r\n bits.hi = (bits.hi | (this.buf[this.pos] & 127) << i * 7 + 3) >>> 0;\r\n if (this.buf[this.pos++] < 128)\r\n return bits;\r\n }\r\n } else {\r\n for (; i < 5; ++i) {\r\n /* istanbul ignore if */\r\n if (this.pos >= this.len)\r\n throw indexOutOfRange(this);\r\n // 6th..10th\r\n bits.hi = (bits.hi | (this.buf[this.pos] & 127) << i * 7 + 3) >>> 0;\r\n if (this.buf[this.pos++] < 128)\r\n return bits;\r\n }\r\n }\r\n /* istanbul ignore next */\r\n throw Error(\"invalid varint encoding\");\r\n}\r\n\r\n/* eslint-enable no-invalid-this */\r\n\r\n/**\r\n * Reads a varint as a signed 64 bit value.\r\n * @name Reader#int64\r\n * @function\r\n * @returns {Long} Value read\r\n */\r\n\r\n/**\r\n * Reads a varint as an unsigned 64 bit value.\r\n * @name Reader#uint64\r\n * @function\r\n * @returns {Long} Value read\r\n */\r\n\r\n/**\r\n * Reads a zig-zag encoded varint as a signed 64 bit value.\r\n * @name Reader#sint64\r\n * @function\r\n * @returns {Long} Value read\r\n */\r\n\r\n/**\r\n * Reads a varint as a boolean.\r\n * @returns {boolean} Value read\r\n */\r\nReader.prototype.bool = function read_bool() {\r\n return this.uint32() !== 0;\r\n};\r\n\r\nfunction readFixed32_end(buf, end) { // note that this uses `end`, not `pos`\r\n return (buf[end - 4]\r\n | buf[end - 3] << 8\r\n | buf[end - 2] << 16\r\n | buf[end - 1] << 24) >>> 0;\r\n}\r\n\r\n/**\r\n * Reads fixed 32 bits as an unsigned 32 bit integer.\r\n * @returns {number} Value read\r\n */\r\nReader.prototype.fixed32 = function read_fixed32() {\r\n\r\n /* istanbul ignore if */\r\n if (this.pos + 4 > this.len)\r\n throw indexOutOfRange(this, 4);\r\n\r\n return readFixed32_end(this.buf, this.pos += 4);\r\n};\r\n\r\n/**\r\n * Reads fixed 32 bits as a signed 32 bit integer.\r\n * @returns {number} Value read\r\n */\r\nReader.prototype.sfixed32 = function read_sfixed32() {\r\n\r\n /* istanbul ignore if */\r\n if (this.pos + 4 > this.len)\r\n throw indexOutOfRange(this, 4);\r\n\r\n return readFixed32_end(this.buf, this.pos += 4) | 0;\r\n};\r\n\r\n/* eslint-disable no-invalid-this */\r\n\r\nfunction readFixed64(/* this: Reader */) {\r\n\r\n /* istanbul ignore if */\r\n if (this.pos + 8 > this.len)\r\n throw indexOutOfRange(this, 8);\r\n\r\n return new LongBits(readFixed32_end(this.buf, this.pos += 4), readFixed32_end(this.buf, this.pos += 4));\r\n}\r\n\r\n/* eslint-enable no-invalid-this */\r\n\r\n/**\r\n * Reads fixed 64 bits.\r\n * @name Reader#fixed64\r\n * @function\r\n * @returns {Long} Value read\r\n */\r\n\r\n/**\r\n * Reads zig-zag encoded fixed 64 bits.\r\n * @name Reader#sfixed64\r\n * @function\r\n * @returns {Long} Value read\r\n */\r\n\r\n/**\r\n * Reads a float (32 bit) as a number.\r\n * @function\r\n * @returns {number} Value read\r\n */\r\nReader.prototype.float = function read_float() {\r\n\r\n /* istanbul ignore if */\r\n if (this.pos + 4 > this.len)\r\n throw indexOutOfRange(this, 4);\r\n\r\n var value = util.float.readFloatLE(this.buf, this.pos);\r\n this.pos += 4;\r\n return value;\r\n};\r\n\r\n/**\r\n * Reads a double (64 bit float) as a number.\r\n * @function\r\n * @returns {number} Value read\r\n */\r\nReader.prototype.double = function read_double() {\r\n\r\n /* istanbul ignore if */\r\n if (this.pos + 8 > this.len)\r\n throw indexOutOfRange(this, 4);\r\n\r\n var value = util.float.readDoubleLE(this.buf, this.pos);\r\n this.pos += 8;\r\n return value;\r\n};\r\n\r\n/**\r\n * Reads a sequence of bytes preceeded by its length as a varint.\r\n * @returns {Uint8Array} Value read\r\n */\r\nReader.prototype.bytes = function read_bytes() {\r\n var length = this.uint32(),\r\n start = this.pos,\r\n end = this.pos + length;\r\n\r\n /* istanbul ignore if */\r\n if (end > this.len)\r\n throw indexOutOfRange(this, length);\r\n\r\n this.pos += length;\r\n if (Array.isArray(this.buf)) // plain array\r\n return this.buf.slice(start, end);\r\n\r\n if (start === end) { // fix for IE 10/Win8 and others' subarray returning array of size 1\r\n var nativeBuffer = util.Buffer;\r\n return nativeBuffer\r\n ? nativeBuffer.alloc(0)\r\n : new this.buf.constructor(0);\r\n }\r\n return this._slice.call(this.buf, start, end);\r\n};\r\n\r\n/**\r\n * Reads a string preceeded by its byte length as a varint.\r\n * @returns {string} Value read\r\n */\r\nReader.prototype.string = function read_string() {\r\n var bytes = this.bytes();\r\n return utf8.read(bytes, 0, bytes.length);\r\n};\r\n\r\n/**\r\n * Skips the specified number of bytes if specified, otherwise skips a varint.\r\n * @param {number} [length] Length if known, otherwise a varint is assumed\r\n * @returns {Reader} `this`\r\n */\r\nReader.prototype.skip = function skip(length) {\r\n if (typeof length === \"number\") {\r\n /* istanbul ignore if */\r\n if (this.pos + length > this.len)\r\n throw indexOutOfRange(this, length);\r\n this.pos += length;\r\n } else {\r\n do {\r\n /* istanbul ignore if */\r\n if (this.pos >= this.len)\r\n throw indexOutOfRange(this);\r\n } while (this.buf[this.pos++] & 128);\r\n }\r\n return this;\r\n};\r\n\r\n/**\r\n * Skips the next element of the specified wire type.\r\n * @param {number} wireType Wire type received\r\n * @returns {Reader} `this`\r\n */\r\nReader.prototype.skipType = function(wireType) {\r\n switch (wireType) {\r\n case 0:\r\n this.skip();\r\n break;\r\n case 1:\r\n this.skip(8);\r\n break;\r\n case 2:\r\n this.skip(this.uint32());\r\n break;\r\n case 3:\r\n while ((wireType = this.uint32() & 7) !== 4) {\r\n this.skipType(wireType);\r\n }\r\n break;\r\n case 5:\r\n this.skip(4);\r\n break;\r\n\r\n /* istanbul ignore next */\r\n default:\r\n throw Error(\"invalid wire type \" + wireType + \" at offset \" + this.pos);\r\n }\r\n return this;\r\n};\r\n\r\nReader._configure = function(BufferReader_) {\r\n BufferReader = BufferReader_;\r\n Reader.create = create();\r\n BufferReader._configure();\r\n\r\n var fn = util.Long ? \"toLong\" : /* istanbul ignore next */ \"toNumber\";\r\n util.merge(Reader.prototype, {\r\n\r\n int64: function read_int64() {\r\n return readLongVarint.call(this)[fn](false);\r\n },\r\n\r\n uint64: function read_uint64() {\r\n return readLongVarint.call(this)[fn](true);\r\n },\r\n\r\n sint64: function read_sint64() {\r\n return readLongVarint.call(this).zzDecode()[fn](false);\r\n },\r\n\r\n fixed64: function read_fixed64() {\r\n return readFixed64.call(this)[fn](true);\r\n },\r\n\r\n sfixed64: function read_sfixed64() {\r\n return readFixed64.call(this)[fn](false);\r\n }\r\n\r\n });\r\n};\r\n","\"use strict\";\r\nmodule.exports = BufferReader;\r\n\r\n// extends Reader\r\nvar Reader = require(\"./reader\");\r\n(BufferReader.prototype = Object.create(Reader.prototype)).constructor = BufferReader;\r\n\r\nvar util = require(\"./util/minimal\");\r\n\r\n/**\r\n * Constructs a new buffer reader instance.\r\n * @classdesc Wire format reader using node buffers.\r\n * @extends Reader\r\n * @constructor\r\n * @param {Buffer} buffer Buffer to read from\r\n */\r\nfunction BufferReader(buffer) {\r\n Reader.call(this, buffer);\r\n\r\n /**\r\n * Read buffer.\r\n * @name BufferReader#buf\r\n * @type {Buffer}\r\n */\r\n}\r\n\r\nBufferReader._configure = function () {\r\n /* istanbul ignore else */\r\n if (util.Buffer)\r\n BufferReader.prototype._slice = util.Buffer.prototype.slice;\r\n};\r\n\r\n\r\n/**\r\n * @override\r\n */\r\nBufferReader.prototype.string = function read_string_buffer() {\r\n var len = this.uint32(); // modifies pos\r\n return this.buf.utf8Slice\r\n ? this.buf.utf8Slice(this.pos, this.pos = Math.min(this.pos + len, this.len))\r\n : this.buf.toString(\"utf-8\", this.pos, this.pos = Math.min(this.pos + len, this.len));\r\n};\r\n\r\n/**\r\n * Reads a sequence of bytes preceeded by its length as a varint.\r\n * @name BufferReader#bytes\r\n * @function\r\n * @returns {Buffer} Value read\r\n */\r\n\r\nBufferReader._configure();\r\n","\"use strict\";\r\nmodule.exports = Root;\r\n\r\n// extends Namespace\r\nvar Namespace = require(\"./namespace\");\r\n((Root.prototype = Object.create(Namespace.prototype)).constructor = Root).className = \"Root\";\r\n\r\nvar Field = require(\"./field\"),\r\n Enum = require(\"./enum\"),\r\n OneOf = require(\"./oneof\"),\r\n util = require(\"./util\");\r\n\r\nvar Type, // cyclic\r\n parse, // might be excluded\r\n common; // \"\r\n\r\n/**\r\n * Constructs a new root namespace instance.\r\n * @classdesc Root namespace wrapping all types, enums, services, sub-namespaces etc. that belong together.\r\n * @extends NamespaceBase\r\n * @constructor\r\n * @param {Object.} [options] Top level options\r\n */\r\nfunction Root(options) {\r\n Namespace.call(this, \"\", options);\r\n\r\n /**\r\n * Deferred extension fields.\r\n * @type {Field[]}\r\n */\r\n this.deferred = [];\r\n\r\n /**\r\n * Resolved file names of loaded files.\r\n * @type {string[]}\r\n */\r\n this.files = [];\r\n}\r\n\r\n/**\r\n * Loads a namespace descriptor into a root namespace.\r\n * @param {INamespace} json Nameespace descriptor\r\n * @param {Root} [root] Root namespace, defaults to create a new one if omitted\r\n * @returns {Root} Root namespace\r\n */\r\nRoot.fromJSON = function fromJSON(json, root) {\r\n if (!root)\r\n root = new Root();\r\n if (json.options)\r\n root.setOptions(json.options);\r\n return root.addJSON(json.nested);\r\n};\r\n\r\n/**\r\n * Resolves the path of an imported file, relative to the importing origin.\r\n * This method exists so you can override it with your own logic in case your imports are scattered over multiple directories.\r\n * @function\r\n * @param {string} origin The file name of the importing file\r\n * @param {string} target The file name being imported\r\n * @returns {string|null} Resolved path to `target` or `null` to skip the file\r\n */\r\nRoot.prototype.resolvePath = util.path.resolve;\r\n\r\n/**\r\n * Fetch content from file path or url\r\n * This method exists so you can override it with your own logic.\r\n * @function\r\n * @param {string} path File path or url\r\n * @param {FetchCallback} callback Callback function\r\n * @returns {undefined}\r\n */\r\nRoot.prototype.fetch = util.fetch;\r\n\r\n// A symbol-like function to safely signal synchronous loading\r\n/* istanbul ignore next */\r\nfunction SYNC() {} // eslint-disable-line no-empty-function\r\n\r\n/**\r\n * Loads one or multiple .proto or preprocessed .json files into this root namespace and calls the callback.\r\n * @param {string|string[]} filename Names of one or multiple files to load\r\n * @param {IParseOptions} options Parse options\r\n * @param {LoadCallback} callback Callback function\r\n * @returns {undefined}\r\n */\r\nRoot.prototype.load = function load(filename, options, callback) {\r\n if (typeof options === \"function\") {\r\n callback = options;\r\n options = undefined;\r\n }\r\n var self = this;\r\n if (!callback)\r\n return util.asPromise(load, self, filename, options);\r\n\r\n var sync = callback === SYNC; // undocumented\r\n\r\n // Finishes loading by calling the callback (exactly once)\r\n function finish(err, root) {\r\n /* istanbul ignore if */\r\n if (!callback)\r\n return;\r\n if (sync)\r\n throw err;\r\n var cb = callback;\r\n callback = null;\r\n cb(err, root);\r\n }\r\n\r\n // Bundled definition existence checking\r\n function getBundledFileName(filename) {\r\n var idx = filename.lastIndexOf(\"google/protobuf/\");\r\n if (idx > -1) {\r\n var altname = filename.substring(idx);\r\n if (altname in common) return altname;\r\n }\r\n return null;\r\n }\r\n\r\n // Processes a single file\r\n function process(filename, source) {\r\n try {\r\n if (util.isString(source) && source.charAt(0) === \"{\")\r\n source = JSON.parse(source);\r\n if (!util.isString(source))\r\n self.setOptions(source.options).addJSON(source.nested);\r\n else {\r\n parse.filename = filename;\r\n var parsed = parse(source, self, options),\r\n resolved,\r\n i = 0;\r\n if (parsed.imports)\r\n for (; i < parsed.imports.length; ++i)\r\n if (resolved = getBundledFileName(parsed.imports[i]) || self.resolvePath(filename, parsed.imports[i]))\r\n fetch(resolved);\r\n if (parsed.weakImports)\r\n for (i = 0; i < parsed.weakImports.length; ++i)\r\n if (resolved = getBundledFileName(parsed.weakImports[i]) || self.resolvePath(filename, parsed.weakImports[i]))\r\n fetch(resolved, true);\r\n }\r\n } catch (err) {\r\n finish(err);\r\n }\r\n if (!sync && !queued)\r\n finish(null, self); // only once anyway\r\n }\r\n\r\n // Fetches a single file\r\n function fetch(filename, weak) {\r\n filename = getBundledFileName(filename) || filename;\r\n\r\n // Skip if already loaded / attempted\r\n if (self.files.indexOf(filename) > -1)\r\n return;\r\n self.files.push(filename);\r\n\r\n // Shortcut bundled definitions\r\n if (filename in common) {\r\n if (sync)\r\n process(filename, common[filename]);\r\n else {\r\n ++queued;\r\n setTimeout(function() {\r\n --queued;\r\n process(filename, common[filename]);\r\n });\r\n }\r\n return;\r\n }\r\n\r\n // Otherwise fetch from disk or network\r\n if (sync) {\r\n var source;\r\n try {\r\n source = util.fs.readFileSync(filename).toString(\"utf8\");\r\n } catch (err) {\r\n if (!weak)\r\n finish(err);\r\n return;\r\n }\r\n process(filename, source);\r\n } else {\r\n ++queued;\r\n self.fetch(filename, function(err, source) {\r\n --queued;\r\n /* istanbul ignore if */\r\n if (!callback)\r\n return; // terminated meanwhile\r\n if (err) {\r\n /* istanbul ignore else */\r\n if (!weak)\r\n finish(err);\r\n else if (!queued) // can't be covered reliably\r\n finish(null, self);\r\n return;\r\n }\r\n process(filename, source);\r\n });\r\n }\r\n }\r\n var queued = 0;\r\n\r\n // Assembling the root namespace doesn't require working type\r\n // references anymore, so we can load everything in parallel\r\n if (util.isString(filename))\r\n filename = [ filename ];\r\n for (var i = 0, resolved; i < filename.length; ++i)\r\n if (resolved = self.resolvePath(\"\", filename[i]))\r\n fetch(resolved);\r\n\r\n if (sync)\r\n return self;\r\n if (!queued)\r\n finish(null, self);\r\n return undefined;\r\n};\r\n// function load(filename:string, options:IParseOptions, callback:LoadCallback):undefined\r\n\r\n/**\r\n * Loads one or multiple .proto or preprocessed .json files into this root namespace and calls the callback.\r\n * @function Root#load\r\n * @param {string|string[]} filename Names of one or multiple files to load\r\n * @param {LoadCallback} callback Callback function\r\n * @returns {undefined}\r\n * @variation 2\r\n */\r\n// function load(filename:string, callback:LoadCallback):undefined\r\n\r\n/**\r\n * Loads one or multiple .proto or preprocessed .json files into this root namespace and returns a promise.\r\n * @function Root#load\r\n * @param {string|string[]} filename Names of one or multiple files to load\r\n * @param {IParseOptions} [options] Parse options. Defaults to {@link parse.defaults} when omitted.\r\n * @returns {Promise} Promise\r\n * @variation 3\r\n */\r\n// function load(filename:string, [options:IParseOptions]):Promise\r\n\r\n/**\r\n * Synchronously loads one or multiple .proto or preprocessed .json files into this root namespace (node only).\r\n * @function Root#loadSync\r\n * @param {string|string[]} filename Names of one or multiple files to load\r\n * @param {IParseOptions} [options] Parse options. Defaults to {@link parse.defaults} when omitted.\r\n * @returns {Root} Root namespace\r\n * @throws {Error} If synchronous fetching is not supported (i.e. in browsers) or if a file's syntax is invalid\r\n */\r\nRoot.prototype.loadSync = function loadSync(filename, options) {\r\n if (!util.isNode)\r\n throw Error(\"not supported\");\r\n return this.load(filename, options, SYNC);\r\n};\r\n\r\n/**\r\n * @override\r\n */\r\nRoot.prototype.resolveAll = function resolveAll() {\r\n if (this.deferred.length)\r\n throw Error(\"unresolvable extensions: \" + this.deferred.map(function(field) {\r\n return \"'extend \" + field.extend + \"' in \" + field.parent.fullName;\r\n }).join(\", \"));\r\n return Namespace.prototype.resolveAll.call(this);\r\n};\r\n\r\n// only uppercased (and thus conflict-free) children are exposed, see below\r\nvar exposeRe = /^[A-Z]/;\r\n\r\n/**\r\n * Handles a deferred declaring extension field by creating a sister field to represent it within its extended type.\r\n * @param {Root} root Root instance\r\n * @param {Field} field Declaring extension field witin the declaring type\r\n * @returns {boolean} `true` if successfully added to the extended type, `false` otherwise\r\n * @inner\r\n * @ignore\r\n */\r\nfunction tryHandleExtension(root, field) {\r\n var extendedType = field.parent.lookup(field.extend);\r\n if (extendedType) {\r\n var sisterField = new Field(field.fullName, field.id, field.type, field.rule, undefined, field.options);\r\n //do not allow to extend same field twice to prevent the error\r\n if (extendedType.get(sisterField.name)) {\r\n return true;\r\n }\r\n sisterField.declaringField = field;\r\n field.extensionField = sisterField;\r\n extendedType.add(sisterField);\r\n return true;\r\n }\r\n return false;\r\n}\r\n\r\n/**\r\n * Called when any object is added to this root or its sub-namespaces.\r\n * @param {ReflectionObject} object Object added\r\n * @returns {undefined}\r\n * @private\r\n */\r\nRoot.prototype._handleAdd = function _handleAdd(object) {\r\n if (object instanceof Field) {\r\n\r\n if (/* an extension field (implies not part of a oneof) */ object.extend !== undefined && /* not already handled */ !object.extensionField)\r\n if (!tryHandleExtension(this, object))\r\n this.deferred.push(object);\r\n\r\n } else if (object instanceof Enum) {\r\n\r\n if (exposeRe.test(object.name))\r\n object.parent[object.name] = object.values; // expose enum values as property of its parent\r\n\r\n } else if (!(object instanceof OneOf)) /* everything else is a namespace */ {\r\n\r\n if (object instanceof Type) // Try to handle any deferred extensions\r\n for (var i = 0; i < this.deferred.length;)\r\n if (tryHandleExtension(this, this.deferred[i]))\r\n this.deferred.splice(i, 1);\r\n else\r\n ++i;\r\n for (var j = 0; j < /* initializes */ object.nestedArray.length; ++j) // recurse into the namespace\r\n this._handleAdd(object._nestedArray[j]);\r\n if (exposeRe.test(object.name))\r\n object.parent[object.name] = object; // expose namespace as property of its parent\r\n }\r\n\r\n // The above also adds uppercased (and thus conflict-free) nested types, services and enums as\r\n // properties of namespaces just like static code does. This allows using a .d.ts generated for\r\n // a static module with reflection-based solutions where the condition is met.\r\n};\r\n\r\n/**\r\n * Called when any object is removed from this root or its sub-namespaces.\r\n * @param {ReflectionObject} object Object removed\r\n * @returns {undefined}\r\n * @private\r\n */\r\nRoot.prototype._handleRemove = function _handleRemove(object) {\r\n if (object instanceof Field) {\r\n\r\n if (/* an extension field */ object.extend !== undefined) {\r\n if (/* already handled */ object.extensionField) { // remove its sister field\r\n object.extensionField.parent.remove(object.extensionField);\r\n object.extensionField = null;\r\n } else { // cancel the extension\r\n var index = this.deferred.indexOf(object);\r\n /* istanbul ignore else */\r\n if (index > -1)\r\n this.deferred.splice(index, 1);\r\n }\r\n }\r\n\r\n } else if (object instanceof Enum) {\r\n\r\n if (exposeRe.test(object.name))\r\n delete object.parent[object.name]; // unexpose enum values\r\n\r\n } else if (object instanceof Namespace) {\r\n\r\n for (var i = 0; i < /* initializes */ object.nestedArray.length; ++i) // recurse into the namespace\r\n this._handleRemove(object._nestedArray[i]);\r\n\r\n if (exposeRe.test(object.name))\r\n delete object.parent[object.name]; // unexpose namespaces\r\n\r\n }\r\n};\r\n\r\n// Sets up cyclic dependencies (called in index-light)\r\nRoot._configure = function(Type_, parse_, common_) {\r\n Type = Type_;\r\n parse = parse_;\r\n common = common_;\r\n};\r\n","\"use strict\";\r\nmodule.exports = {};\r\n\r\n/**\r\n * Named roots.\r\n * This is where pbjs stores generated structures (the option `-r, --root` specifies a name).\r\n * Can also be used manually to make roots available across modules.\r\n * @name roots\r\n * @type {Object.}\r\n * @example\r\n * // pbjs -r myroot -o compiled.js ...\r\n *\r\n * // in another module:\r\n * require(\"./compiled.js\");\r\n *\r\n * // in any subsequent module:\r\n * var root = protobuf.roots[\"myroot\"];\r\n */\r\n","\"use strict\";\r\n\r\n/**\r\n * Streaming RPC helpers.\r\n * @namespace\r\n */\r\nvar rpc = exports;\r\n\r\n/**\r\n * RPC implementation passed to {@link Service#create} performing a service request on network level, i.e. by utilizing http requests or websockets.\r\n * @typedef RPCImpl\r\n * @type {function}\r\n * @param {Method|rpc.ServiceMethod,Message<{}>>} method Reflected or static method being called\r\n * @param {Uint8Array} requestData Request data\r\n * @param {RPCImplCallback} callback Callback function\r\n * @returns {undefined}\r\n * @example\r\n * function rpcImpl(method, requestData, callback) {\r\n * if (protobuf.util.lcFirst(method.name) !== \"myMethod\") // compatible with static code\r\n * throw Error(\"no such method\");\r\n * asynchronouslyObtainAResponse(requestData, function(err, responseData) {\r\n * callback(err, responseData);\r\n * });\r\n * }\r\n */\r\n\r\n/**\r\n * Node-style callback as used by {@link RPCImpl}.\r\n * @typedef RPCImplCallback\r\n * @type {function}\r\n * @param {Error|null} error Error, if any, otherwise `null`\r\n * @param {Uint8Array|null} [response] Response data or `null` to signal end of stream, if there hasn't been an error\r\n * @returns {undefined}\r\n */\r\n\r\nrpc.Service = require(\"./rpc/service\");\r\n","\"use strict\";\r\nmodule.exports = Service;\r\n\r\nvar util = require(\"../util/minimal\");\r\n\r\n// Extends EventEmitter\r\n(Service.prototype = Object.create(util.EventEmitter.prototype)).constructor = Service;\r\n\r\n/**\r\n * A service method callback as used by {@link rpc.ServiceMethod|ServiceMethod}.\r\n *\r\n * Differs from {@link RPCImplCallback} in that it is an actual callback of a service method which may not return `response = null`.\r\n * @typedef rpc.ServiceMethodCallback\r\n * @template TRes extends Message\r\n * @type {function}\r\n * @param {Error|null} error Error, if any\r\n * @param {TRes} [response] Response message\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * A service method part of a {@link rpc.Service} as created by {@link Service.create}.\r\n * @typedef rpc.ServiceMethod\r\n * @template TReq extends Message\r\n * @template TRes extends Message\r\n * @type {function}\r\n * @param {TReq|Properties} request Request message or plain object\r\n * @param {rpc.ServiceMethodCallback} [callback] Node-style callback called with the error, if any, and the response message\r\n * @returns {Promise>} Promise if `callback` has been omitted, otherwise `undefined`\r\n */\r\n\r\n/**\r\n * Constructs a new RPC service instance.\r\n * @classdesc An RPC service as returned by {@link Service#create}.\r\n * @exports rpc.Service\r\n * @extends util.EventEmitter\r\n * @constructor\r\n * @param {RPCImpl} rpcImpl RPC implementation\r\n * @param {boolean} [requestDelimited=false] Whether requests are length-delimited\r\n * @param {boolean} [responseDelimited=false] Whether responses are length-delimited\r\n */\r\nfunction Service(rpcImpl, requestDelimited, responseDelimited) {\r\n\r\n if (typeof rpcImpl !== \"function\")\r\n throw TypeError(\"rpcImpl must be a function\");\r\n\r\n util.EventEmitter.call(this);\r\n\r\n /**\r\n * RPC implementation. Becomes `null` once the service is ended.\r\n * @type {RPCImpl|null}\r\n */\r\n this.rpcImpl = rpcImpl;\r\n\r\n /**\r\n * Whether requests are length-delimited.\r\n * @type {boolean}\r\n */\r\n this.requestDelimited = Boolean(requestDelimited);\r\n\r\n /**\r\n * Whether responses are length-delimited.\r\n * @type {boolean}\r\n */\r\n this.responseDelimited = Boolean(responseDelimited);\r\n}\r\n\r\n/**\r\n * Calls a service method through {@link rpc.Service#rpcImpl|rpcImpl}.\r\n * @param {Method|rpc.ServiceMethod} method Reflected or static method\r\n * @param {Constructor} requestCtor Request constructor\r\n * @param {Constructor} responseCtor Response constructor\r\n * @param {TReq|Properties} request Request message or plain object\r\n * @param {rpc.ServiceMethodCallback} callback Service callback\r\n * @returns {undefined}\r\n * @template TReq extends Message\r\n * @template TRes extends Message\r\n */\r\nService.prototype.rpcCall = function rpcCall(method, requestCtor, responseCtor, request, callback) {\r\n\r\n if (!request)\r\n throw TypeError(\"request must be specified\");\r\n\r\n var self = this;\r\n if (!callback)\r\n return util.asPromise(rpcCall, self, method, requestCtor, responseCtor, request);\r\n\r\n if (!self.rpcImpl) {\r\n setTimeout(function() { callback(Error(\"already ended\")); }, 0);\r\n return undefined;\r\n }\r\n\r\n try {\r\n return self.rpcImpl(\r\n method,\r\n requestCtor[self.requestDelimited ? \"encodeDelimited\" : \"encode\"](request).finish(),\r\n function rpcCallback(err, response) {\r\n\r\n if (err) {\r\n self.emit(\"error\", err, method);\r\n return callback(err);\r\n }\r\n\r\n if (response === null) {\r\n self.end(/* endedByRPC */ true);\r\n return undefined;\r\n }\r\n\r\n if (!(response instanceof responseCtor)) {\r\n try {\r\n response = responseCtor[self.responseDelimited ? \"decodeDelimited\" : \"decode\"](response);\r\n } catch (err) {\r\n self.emit(\"error\", err, method);\r\n return callback(err);\r\n }\r\n }\r\n\r\n self.emit(\"data\", response, method);\r\n return callback(null, response);\r\n }\r\n );\r\n } catch (err) {\r\n self.emit(\"error\", err, method);\r\n setTimeout(function() { callback(err); }, 0);\r\n return undefined;\r\n }\r\n};\r\n\r\n/**\r\n * Ends this service and emits the `end` event.\r\n * @param {boolean} [endedByRPC=false] Whether the service has been ended by the RPC implementation.\r\n * @returns {rpc.Service} `this`\r\n */\r\nService.prototype.end = function end(endedByRPC) {\r\n if (this.rpcImpl) {\r\n if (!endedByRPC) // signal end to rpcImpl\r\n this.rpcImpl(null, null, null);\r\n this.rpcImpl = null;\r\n this.emit(\"end\").off();\r\n }\r\n return this;\r\n};\r\n","\"use strict\";\r\nmodule.exports = Service;\r\n\r\n// extends Namespace\r\nvar Namespace = require(\"./namespace\");\r\n((Service.prototype = Object.create(Namespace.prototype)).constructor = Service).className = \"Service\";\r\n\r\nvar Method = require(\"./method\"),\r\n util = require(\"./util\"),\r\n rpc = require(\"./rpc\");\r\n\r\n/**\r\n * Constructs a new service instance.\r\n * @classdesc Reflected service.\r\n * @extends NamespaceBase\r\n * @constructor\r\n * @param {string} name Service name\r\n * @param {Object.} [options] Service options\r\n * @throws {TypeError} If arguments are invalid\r\n */\r\nfunction Service(name, options) {\r\n Namespace.call(this, name, options);\r\n\r\n /**\r\n * Service methods.\r\n * @type {Object.}\r\n */\r\n this.methods = {}; // toJSON, marker\r\n\r\n /**\r\n * Cached methods as an array.\r\n * @type {Method[]|null}\r\n * @private\r\n */\r\n this._methodsArray = null;\r\n}\r\n\r\n/**\r\n * Service descriptor.\r\n * @interface IService\r\n * @extends INamespace\r\n * @property {Object.} methods Method descriptors\r\n */\r\n\r\n/**\r\n * Constructs a service from a service descriptor.\r\n * @param {string} name Service name\r\n * @param {IService} json Service descriptor\r\n * @returns {Service} Created service\r\n * @throws {TypeError} If arguments are invalid\r\n */\r\nService.fromJSON = function fromJSON(name, json) {\r\n var service = new Service(name, json.options);\r\n /* istanbul ignore else */\r\n if (json.methods)\r\n for (var names = Object.keys(json.methods), i = 0; i < names.length; ++i)\r\n service.add(Method.fromJSON(names[i], json.methods[names[i]]));\r\n if (json.nested)\r\n service.addJSON(json.nested);\r\n service.comment = json.comment;\r\n return service;\r\n};\r\n\r\n/**\r\n * Converts this service to a service descriptor.\r\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\r\n * @returns {IService} Service descriptor\r\n */\r\nService.prototype.toJSON = function toJSON(toJSONOptions) {\r\n var inherited = Namespace.prototype.toJSON.call(this, toJSONOptions);\r\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\r\n return util.toObject([\r\n \"options\" , inherited && inherited.options || undefined,\r\n \"methods\" , Namespace.arrayToJSON(this.methodsArray, toJSONOptions) || /* istanbul ignore next */ {},\r\n \"nested\" , inherited && inherited.nested || undefined,\r\n \"comment\" , keepComments ? this.comment : undefined\r\n ]);\r\n};\r\n\r\n/**\r\n * Methods of this service as an array for iteration.\r\n * @name Service#methodsArray\r\n * @type {Method[]}\r\n * @readonly\r\n */\r\nObject.defineProperty(Service.prototype, \"methodsArray\", {\r\n get: function() {\r\n return this._methodsArray || (this._methodsArray = util.toArray(this.methods));\r\n }\r\n});\r\n\r\nfunction clearCache(service) {\r\n service._methodsArray = null;\r\n return service;\r\n}\r\n\r\n/**\r\n * @override\r\n */\r\nService.prototype.get = function get(name) {\r\n return this.methods[name]\r\n || Namespace.prototype.get.call(this, name);\r\n};\r\n\r\n/**\r\n * @override\r\n */\r\nService.prototype.resolveAll = function resolveAll() {\r\n var methods = this.methodsArray;\r\n for (var i = 0; i < methods.length; ++i)\r\n methods[i].resolve();\r\n return Namespace.prototype.resolve.call(this);\r\n};\r\n\r\n/**\r\n * @override\r\n */\r\nService.prototype.add = function add(object) {\r\n\r\n /* istanbul ignore if */\r\n if (this.get(object.name))\r\n throw Error(\"duplicate name '\" + object.name + \"' in \" + this);\r\n\r\n if (object instanceof Method) {\r\n this.methods[object.name] = object;\r\n object.parent = this;\r\n return clearCache(this);\r\n }\r\n return Namespace.prototype.add.call(this, object);\r\n};\r\n\r\n/**\r\n * @override\r\n */\r\nService.prototype.remove = function remove(object) {\r\n if (object instanceof Method) {\r\n\r\n /* istanbul ignore if */\r\n if (this.methods[object.name] !== object)\r\n throw Error(object + \" is not a member of \" + this);\r\n\r\n delete this.methods[object.name];\r\n object.parent = null;\r\n return clearCache(this);\r\n }\r\n return Namespace.prototype.remove.call(this, object);\r\n};\r\n\r\n/**\r\n * Creates a runtime service using the specified rpc implementation.\r\n * @param {RPCImpl} rpcImpl RPC implementation\r\n * @param {boolean} [requestDelimited=false] Whether requests are length-delimited\r\n * @param {boolean} [responseDelimited=false] Whether responses are length-delimited\r\n * @returns {rpc.Service} RPC service. Useful where requests and/or responses are streamed.\r\n */\r\nService.prototype.create = function create(rpcImpl, requestDelimited, responseDelimited) {\r\n var rpcService = new rpc.Service(rpcImpl, requestDelimited, responseDelimited);\r\n for (var i = 0, method; i < /* initializes */ this.methodsArray.length; ++i) {\r\n var methodName = util.lcFirst((method = this._methodsArray[i]).resolve().name).replace(/[^$\\w_]/g, \"\");\r\n rpcService[methodName] = util.codegen([\"r\",\"c\"], util.isReserved(methodName) ? methodName + \"_\" : methodName)(\"return this.rpcCall(m,q,s,r,c)\")({\r\n m: method,\r\n q: method.resolvedRequestType.ctor,\r\n s: method.resolvedResponseType.ctor\r\n });\r\n }\r\n return rpcService;\r\n};\r\n","\"use strict\";\r\nmodule.exports = tokenize;\r\n\r\nvar delimRe = /[\\s{}=;:[\\],'\"()<>]/g,\r\n stringDoubleRe = /(?:\"([^\"\\\\]*(?:\\\\.[^\"\\\\]*)*)\")/g,\r\n stringSingleRe = /(?:'([^'\\\\]*(?:\\\\.[^'\\\\]*)*)')/g;\r\n\r\nvar setCommentRe = /^ *[*/]+ */,\r\n setCommentAltRe = /^\\s*\\*?\\/*/,\r\n setCommentSplitRe = /\\n/g,\r\n whitespaceRe = /\\s/,\r\n unescapeRe = /\\\\(.?)/g;\r\n\r\nvar unescapeMap = {\r\n \"0\": \"\\0\",\r\n \"r\": \"\\r\",\r\n \"n\": \"\\n\",\r\n \"t\": \"\\t\"\r\n};\r\n\r\n/**\r\n * Unescapes a string.\r\n * @param {string} str String to unescape\r\n * @returns {string} Unescaped string\r\n * @property {Object.} map Special characters map\r\n * @memberof tokenize\r\n */\r\nfunction unescape(str) {\r\n return str.replace(unescapeRe, function($0, $1) {\r\n switch ($1) {\r\n case \"\\\\\":\r\n case \"\":\r\n return $1;\r\n default:\r\n return unescapeMap[$1] || \"\";\r\n }\r\n });\r\n}\r\n\r\ntokenize.unescape = unescape;\r\n\r\n/**\r\n * Gets the next token and advances.\r\n * @typedef TokenizerHandleNext\r\n * @type {function}\r\n * @returns {string|null} Next token or `null` on eof\r\n */\r\n\r\n/**\r\n * Peeks for the next token.\r\n * @typedef TokenizerHandlePeek\r\n * @type {function}\r\n * @returns {string|null} Next token or `null` on eof\r\n */\r\n\r\n/**\r\n * Pushes a token back to the stack.\r\n * @typedef TokenizerHandlePush\r\n * @type {function}\r\n * @param {string} token Token\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Skips the next token.\r\n * @typedef TokenizerHandleSkip\r\n * @type {function}\r\n * @param {string} expected Expected token\r\n * @param {boolean} [optional=false] If optional\r\n * @returns {boolean} Whether the token matched\r\n * @throws {Error} If the token didn't match and is not optional\r\n */\r\n\r\n/**\r\n * Gets the comment on the previous line or, alternatively, the line comment on the specified line.\r\n * @typedef TokenizerHandleCmnt\r\n * @type {function}\r\n * @param {number} [line] Line number\r\n * @returns {string|null} Comment text or `null` if none\r\n */\r\n\r\n/**\r\n * Handle object returned from {@link tokenize}.\r\n * @interface ITokenizerHandle\r\n * @property {TokenizerHandleNext} next Gets the next token and advances (`null` on eof)\r\n * @property {TokenizerHandlePeek} peek Peeks for the next token (`null` on eof)\r\n * @property {TokenizerHandlePush} push Pushes a token back to the stack\r\n * @property {TokenizerHandleSkip} skip Skips a token, returns its presence and advances or, if non-optional and not present, throws\r\n * @property {TokenizerHandleCmnt} cmnt Gets the comment on the previous line or the line comment on the specified line, if any\r\n * @property {number} line Current line number\r\n */\r\n\r\n/**\r\n * Tokenizes the given .proto source and returns an object with useful utility functions.\r\n * @param {string} source Source contents\r\n * @param {boolean} alternateCommentMode Whether we should activate alternate comment parsing mode.\r\n * @returns {ITokenizerHandle} Tokenizer handle\r\n */\r\nfunction tokenize(source, alternateCommentMode) {\r\n /* eslint-disable callback-return */\r\n source = source.toString();\r\n\r\n var offset = 0,\r\n length = source.length,\r\n line = 1,\r\n lastCommentLine = 0,\r\n comments = {};\r\n\r\n var stack = [];\r\n\r\n var stringDelim = null;\r\n\r\n /* istanbul ignore next */\r\n /**\r\n * Creates an error for illegal syntax.\r\n * @param {string} subject Subject\r\n * @returns {Error} Error created\r\n * @inner\r\n */\r\n function illegal(subject) {\r\n return Error(\"illegal \" + subject + \" (line \" + line + \")\");\r\n }\r\n\r\n /**\r\n * Reads a string till its end.\r\n * @returns {string} String read\r\n * @inner\r\n */\r\n function readString() {\r\n var re = stringDelim === \"'\" ? stringSingleRe : stringDoubleRe;\r\n re.lastIndex = offset - 1;\r\n var match = re.exec(source);\r\n if (!match)\r\n throw illegal(\"string\");\r\n offset = re.lastIndex;\r\n push(stringDelim);\r\n stringDelim = null;\r\n return unescape(match[1]);\r\n }\r\n\r\n /**\r\n * Gets the character at `pos` within the source.\r\n * @param {number} pos Position\r\n * @returns {string} Character\r\n * @inner\r\n */\r\n function charAt(pos) {\r\n return source.charAt(pos);\r\n }\r\n\r\n /**\r\n * Sets the current comment text.\r\n * @param {number} start Start offset\r\n * @param {number} end End offset\r\n * @param {boolean} isLeading set if a leading comment\r\n * @returns {undefined}\r\n * @inner\r\n */\r\n function setComment(start, end, isLeading) {\r\n var comment = {\r\n type: source.charAt(start++),\r\n lineEmpty: false,\r\n leading: isLeading,\r\n };\r\n var lookback;\r\n if (alternateCommentMode) {\r\n lookback = 2; // alternate comment parsing: \"//\" or \"/*\"\r\n } else {\r\n lookback = 3; // \"///\" or \"/**\"\r\n }\r\n var commentOffset = start - lookback,\r\n c;\r\n do {\r\n if (--commentOffset < 0 ||\r\n (c = source.charAt(commentOffset)) === \"\\n\") {\r\n comment.lineEmpty = true;\r\n break;\r\n }\r\n } while (c === \" \" || c === \"\\t\");\r\n var lines = source\r\n .substring(start, end)\r\n .split(setCommentSplitRe);\r\n for (var i = 0; i < lines.length; ++i)\r\n lines[i] = lines[i]\r\n .replace(alternateCommentMode ? setCommentAltRe : setCommentRe, \"\")\r\n .trim();\r\n comment.text = lines\r\n .join(\"\\n\")\r\n .trim();\r\n\r\n comments[line] = comment;\r\n lastCommentLine = line;\r\n }\r\n\r\n function isDoubleSlashCommentLine(startOffset) {\r\n var endOffset = findEndOfLine(startOffset);\r\n\r\n // see if remaining line matches comment pattern\r\n var lineText = source.substring(startOffset, endOffset);\r\n var isComment = /^\\s*\\/\\//.test(lineText);\r\n return isComment;\r\n }\r\n\r\n function findEndOfLine(cursor) {\r\n // find end of cursor's line\r\n var endOffset = cursor;\r\n while (endOffset < length && charAt(endOffset) !== \"\\n\") {\r\n endOffset++;\r\n }\r\n return endOffset;\r\n }\r\n\r\n /**\r\n * Obtains the next token.\r\n * @returns {string|null} Next token or `null` on eof\r\n * @inner\r\n */\r\n function next() {\r\n if (stack.length > 0)\r\n return stack.shift();\r\n if (stringDelim)\r\n return readString();\r\n var repeat,\r\n prev,\r\n curr,\r\n start,\r\n isDoc,\r\n isLeadingComment = offset === 0;\r\n do {\r\n if (offset === length)\r\n return null;\r\n repeat = false;\r\n while (whitespaceRe.test(curr = charAt(offset))) {\r\n if (curr === \"\\n\") {\r\n isLeadingComment = true;\r\n ++line;\r\n }\r\n if (++offset === length)\r\n return null;\r\n }\r\n\r\n if (charAt(offset) === \"/\") {\r\n if (++offset === length) {\r\n throw illegal(\"comment\");\r\n }\r\n if (charAt(offset) === \"/\") { // Line\r\n if (!alternateCommentMode) {\r\n // check for triple-slash comment\r\n isDoc = charAt(start = offset + 1) === \"/\";\r\n\r\n while (charAt(++offset) !== \"\\n\") {\r\n if (offset === length) {\r\n return null;\r\n }\r\n }\r\n ++offset;\r\n if (isDoc) {\r\n setComment(start, offset - 1, isLeadingComment);\r\n // Trailing comment cannot not be multi-line,\r\n // so leading comment state should be reset to handle potential next comments\r\n isLeadingComment = true;\r\n }\r\n ++line;\r\n repeat = true;\r\n } else {\r\n // check for double-slash comments, consolidating consecutive lines\r\n start = offset;\r\n isDoc = false;\r\n if (isDoubleSlashCommentLine(offset - 1)) {\r\n isDoc = true;\r\n do {\r\n offset = findEndOfLine(offset);\r\n if (offset === length) {\r\n break;\r\n }\r\n offset++;\r\n if (!isLeadingComment) {\r\n // Trailing comment cannot not be multi-line\r\n break;\r\n }\r\n } while (isDoubleSlashCommentLine(offset));\r\n } else {\r\n offset = Math.min(length, findEndOfLine(offset) + 1);\r\n }\r\n if (isDoc) {\r\n setComment(start, offset, isLeadingComment);\r\n isLeadingComment = true;\r\n }\r\n line++;\r\n repeat = true;\r\n }\r\n } else if ((curr = charAt(offset)) === \"*\") { /* Block */\r\n // check for /** (regular comment mode) or /* (alternate comment mode)\r\n start = offset + 1;\r\n isDoc = alternateCommentMode || charAt(start) === \"*\";\r\n do {\r\n if (curr === \"\\n\") {\r\n ++line;\r\n }\r\n if (++offset === length) {\r\n throw illegal(\"comment\");\r\n }\r\n prev = curr;\r\n curr = charAt(offset);\r\n } while (prev !== \"*\" || curr !== \"/\");\r\n ++offset;\r\n if (isDoc) {\r\n setComment(start, offset - 2, isLeadingComment);\r\n isLeadingComment = true;\r\n }\r\n repeat = true;\r\n } else {\r\n return \"/\";\r\n }\r\n }\r\n } while (repeat);\r\n\r\n // offset !== length if we got here\r\n\r\n var end = offset;\r\n delimRe.lastIndex = 0;\r\n var delim = delimRe.test(charAt(end++));\r\n if (!delim)\r\n while (end < length && !delimRe.test(charAt(end)))\r\n ++end;\r\n var token = source.substring(offset, offset = end);\r\n if (token === \"\\\"\" || token === \"'\")\r\n stringDelim = token;\r\n return token;\r\n }\r\n\r\n /**\r\n * Pushes a token back to the stack.\r\n * @param {string} token Token\r\n * @returns {undefined}\r\n * @inner\r\n */\r\n function push(token) {\r\n stack.push(token);\r\n }\r\n\r\n /**\r\n * Peeks for the next token.\r\n * @returns {string|null} Token or `null` on eof\r\n * @inner\r\n */\r\n function peek() {\r\n if (!stack.length) {\r\n var token = next();\r\n if (token === null)\r\n return null;\r\n push(token);\r\n }\r\n return stack[0];\r\n }\r\n\r\n /**\r\n * Skips a token.\r\n * @param {string} expected Expected token\r\n * @param {boolean} [optional=false] Whether the token is optional\r\n * @returns {boolean} `true` when skipped, `false` if not\r\n * @throws {Error} When a required token is not present\r\n * @inner\r\n */\r\n function skip(expected, optional) {\r\n var actual = peek(),\r\n equals = actual === expected;\r\n if (equals) {\r\n next();\r\n return true;\r\n }\r\n if (!optional)\r\n throw illegal(\"token '\" + actual + \"', '\" + expected + \"' expected\");\r\n return false;\r\n }\r\n\r\n /**\r\n * Gets a comment.\r\n * @param {number} [trailingLine] Line number if looking for a trailing comment\r\n * @returns {string|null} Comment text\r\n * @inner\r\n */\r\n function cmnt(trailingLine) {\r\n var ret = null;\r\n var comment;\r\n if (trailingLine === undefined) {\r\n comment = comments[line - 1];\r\n delete comments[line - 1];\r\n if (comment && (alternateCommentMode || comment.type === \"*\" || comment.lineEmpty)) {\r\n ret = comment.leading ? comment.text : null;\r\n }\r\n } else {\r\n /* istanbul ignore else */\r\n if (lastCommentLine < trailingLine) {\r\n peek();\r\n }\r\n comment = comments[trailingLine];\r\n delete comments[trailingLine];\r\n if (comment && !comment.lineEmpty && (alternateCommentMode || comment.type === \"/\")) {\r\n ret = comment.leading ? null : comment.text;\r\n }\r\n }\r\n return ret;\r\n }\r\n\r\n return Object.defineProperty({\r\n next: next,\r\n peek: peek,\r\n push: push,\r\n skip: skip,\r\n cmnt: cmnt\r\n }, \"line\", {\r\n get: function() { return line; }\r\n });\r\n /* eslint-enable callback-return */\r\n}\r\n","\"use strict\";\r\nmodule.exports = Type;\r\n\r\n// extends Namespace\r\nvar Namespace = require(\"./namespace\");\r\n((Type.prototype = Object.create(Namespace.prototype)).constructor = Type).className = \"Type\";\r\n\r\nvar Enum = require(\"./enum\"),\r\n OneOf = require(\"./oneof\"),\r\n Field = require(\"./field\"),\r\n MapField = require(\"./mapfield\"),\r\n Service = require(\"./service\"),\r\n Message = require(\"./message\"),\r\n Reader = require(\"./reader\"),\r\n Writer = require(\"./writer\"),\r\n util = require(\"./util\"),\r\n encoder = require(\"./encoder\"),\r\n decoder = require(\"./decoder\"),\r\n verifier = require(\"./verifier\"),\r\n converter = require(\"./converter\"),\r\n wrappers = require(\"./wrappers\");\r\n\r\n/**\r\n * Constructs a new reflected message type instance.\r\n * @classdesc Reflected message type.\r\n * @extends NamespaceBase\r\n * @constructor\r\n * @param {string} name Message name\r\n * @param {Object.} [options] Declared options\r\n */\r\nfunction Type(name, options) {\r\n Namespace.call(this, name, options);\r\n\r\n /**\r\n * Message fields.\r\n * @type {Object.}\r\n */\r\n this.fields = {}; // toJSON, marker\r\n\r\n /**\r\n * Oneofs declared within this namespace, if any.\r\n * @type {Object.}\r\n */\r\n this.oneofs = undefined; // toJSON\r\n\r\n /**\r\n * Extension ranges, if any.\r\n * @type {number[][]}\r\n */\r\n this.extensions = undefined; // toJSON\r\n\r\n /**\r\n * Reserved ranges, if any.\r\n * @type {Array.}\r\n */\r\n this.reserved = undefined; // toJSON\r\n\r\n /*?\r\n * Whether this type is a legacy group.\r\n * @type {boolean|undefined}\r\n */\r\n this.group = undefined; // toJSON\r\n\r\n /**\r\n * Cached fields by id.\r\n * @type {Object.|null}\r\n * @private\r\n */\r\n this._fieldsById = null;\r\n\r\n /**\r\n * Cached fields as an array.\r\n * @type {Field[]|null}\r\n * @private\r\n */\r\n this._fieldsArray = null;\r\n\r\n /**\r\n * Cached oneofs as an array.\r\n * @type {OneOf[]|null}\r\n * @private\r\n */\r\n this._oneofsArray = null;\r\n\r\n /**\r\n * Cached constructor.\r\n * @type {Constructor<{}>}\r\n * @private\r\n */\r\n this._ctor = null;\r\n}\r\n\r\nObject.defineProperties(Type.prototype, {\r\n\r\n /**\r\n * Message fields by id.\r\n * @name Type#fieldsById\r\n * @type {Object.}\r\n * @readonly\r\n */\r\n fieldsById: {\r\n get: function() {\r\n\r\n /* istanbul ignore if */\r\n if (this._fieldsById)\r\n return this._fieldsById;\r\n\r\n this._fieldsById = {};\r\n for (var names = Object.keys(this.fields), i = 0; i < names.length; ++i) {\r\n var field = this.fields[names[i]],\r\n id = field.id;\r\n\r\n /* istanbul ignore if */\r\n if (this._fieldsById[id])\r\n throw Error(\"duplicate id \" + id + \" in \" + this);\r\n\r\n this._fieldsById[id] = field;\r\n }\r\n return this._fieldsById;\r\n }\r\n },\r\n\r\n /**\r\n * Fields of this message as an array for iteration.\r\n * @name Type#fieldsArray\r\n * @type {Field[]}\r\n * @readonly\r\n */\r\n fieldsArray: {\r\n get: function() {\r\n return this._fieldsArray || (this._fieldsArray = util.toArray(this.fields));\r\n }\r\n },\r\n\r\n /**\r\n * Oneofs of this message as an array for iteration.\r\n * @name Type#oneofsArray\r\n * @type {OneOf[]}\r\n * @readonly\r\n */\r\n oneofsArray: {\r\n get: function() {\r\n return this._oneofsArray || (this._oneofsArray = util.toArray(this.oneofs));\r\n }\r\n },\r\n\r\n /**\r\n * The registered constructor, if any registered, otherwise a generic constructor.\r\n * Assigning a function replaces the internal constructor. If the function does not extend {@link Message} yet, its prototype will be setup accordingly and static methods will be populated. If it already extends {@link Message}, it will just replace the internal constructor.\r\n * @name Type#ctor\r\n * @type {Constructor<{}>}\r\n */\r\n ctor: {\r\n get: function() {\r\n return this._ctor || (this.ctor = Type.generateConstructor(this)());\r\n },\r\n set: function(ctor) {\r\n\r\n // Ensure proper prototype\r\n var prototype = ctor.prototype;\r\n if (!(prototype instanceof Message)) {\r\n (ctor.prototype = new Message()).constructor = ctor;\r\n util.merge(ctor.prototype, prototype);\r\n }\r\n\r\n // Classes and messages reference their reflected type\r\n ctor.$type = ctor.prototype.$type = this;\r\n\r\n // Mix in static methods\r\n util.merge(ctor, Message, true);\r\n\r\n this._ctor = ctor;\r\n\r\n // Messages have non-enumerable default values on their prototype\r\n var i = 0;\r\n for (; i < /* initializes */ this.fieldsArray.length; ++i)\r\n this._fieldsArray[i].resolve(); // ensures a proper value\r\n\r\n // Messages have non-enumerable getters and setters for each virtual oneof field\r\n var ctorProperties = {};\r\n for (i = 0; i < /* initializes */ this.oneofsArray.length; ++i)\r\n ctorProperties[this._oneofsArray[i].resolve().name] = {\r\n get: util.oneOfGetter(this._oneofsArray[i].oneof),\r\n set: util.oneOfSetter(this._oneofsArray[i].oneof)\r\n };\r\n if (i)\r\n Object.defineProperties(ctor.prototype, ctorProperties);\r\n }\r\n }\r\n});\r\n\r\n/**\r\n * Generates a constructor function for the specified type.\r\n * @param {Type} mtype Message type\r\n * @returns {Codegen} Codegen instance\r\n */\r\nType.generateConstructor = function generateConstructor(mtype) {\r\n /* eslint-disable no-unexpected-multiline */\r\n var gen = util.codegen([\"p\"], mtype.name);\r\n // explicitly initialize mutable object/array fields so that these aren't just inherited from the prototype\r\n for (var i = 0, field; i < mtype.fieldsArray.length; ++i)\r\n if ((field = mtype._fieldsArray[i]).map) gen\r\n (\"this%s={}\", util.safeProp(field.name));\r\n else if (field.repeated) gen\r\n (\"this%s=[]\", util.safeProp(field.name));\r\n return gen\r\n (\"if(p)for(var ks=Object.keys(p),i=0;i} [oneofs] Oneof descriptors\r\n * @property {Object.} fields Field descriptors\r\n * @property {number[][]} [extensions] Extension ranges\r\n * @property {Array.} [reserved] Reserved ranges\r\n * @property {boolean} [group=false] Whether a legacy group or not\r\n */\r\n\r\n/**\r\n * Creates a message type from a message type descriptor.\r\n * @param {string} name Message name\r\n * @param {IType} json Message type descriptor\r\n * @returns {Type} Created message type\r\n */\r\nType.fromJSON = function fromJSON(name, json) {\r\n var type = new Type(name, json.options);\r\n type.extensions = json.extensions;\r\n type.reserved = json.reserved;\r\n var names = Object.keys(json.fields),\r\n i = 0;\r\n for (; i < names.length; ++i)\r\n type.add(\r\n ( typeof json.fields[names[i]].keyType !== \"undefined\"\r\n ? MapField.fromJSON\r\n : Field.fromJSON )(names[i], json.fields[names[i]])\r\n );\r\n if (json.oneofs)\r\n for (names = Object.keys(json.oneofs), i = 0; i < names.length; ++i)\r\n type.add(OneOf.fromJSON(names[i], json.oneofs[names[i]]));\r\n if (json.nested)\r\n for (names = Object.keys(json.nested), i = 0; i < names.length; ++i) {\r\n var nested = json.nested[names[i]];\r\n type.add( // most to least likely\r\n ( nested.id !== undefined\r\n ? Field.fromJSON\r\n : nested.fields !== undefined\r\n ? Type.fromJSON\r\n : nested.values !== undefined\r\n ? Enum.fromJSON\r\n : nested.methods !== undefined\r\n ? Service.fromJSON\r\n : Namespace.fromJSON )(names[i], nested)\r\n );\r\n }\r\n if (json.extensions && json.extensions.length)\r\n type.extensions = json.extensions;\r\n if (json.reserved && json.reserved.length)\r\n type.reserved = json.reserved;\r\n if (json.group)\r\n type.group = true;\r\n if (json.comment)\r\n type.comment = json.comment;\r\n return type;\r\n};\r\n\r\n/**\r\n * Converts this message type to a message type descriptor.\r\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\r\n * @returns {IType} Message type descriptor\r\n */\r\nType.prototype.toJSON = function toJSON(toJSONOptions) {\r\n var inherited = Namespace.prototype.toJSON.call(this, toJSONOptions);\r\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\r\n return util.toObject([\r\n \"options\" , inherited && inherited.options || undefined,\r\n \"oneofs\" , Namespace.arrayToJSON(this.oneofsArray, toJSONOptions),\r\n \"fields\" , Namespace.arrayToJSON(this.fieldsArray.filter(function(obj) { return !obj.declaringField; }), toJSONOptions) || {},\r\n \"extensions\" , this.extensions && this.extensions.length ? this.extensions : undefined,\r\n \"reserved\" , this.reserved && this.reserved.length ? this.reserved : undefined,\r\n \"group\" , this.group || undefined,\r\n \"nested\" , inherited && inherited.nested || undefined,\r\n \"comment\" , keepComments ? this.comment : undefined\r\n ]);\r\n};\r\n\r\n/**\r\n * @override\r\n */\r\nType.prototype.resolveAll = function resolveAll() {\r\n var fields = this.fieldsArray, i = 0;\r\n while (i < fields.length)\r\n fields[i++].resolve();\r\n var oneofs = this.oneofsArray; i = 0;\r\n while (i < oneofs.length)\r\n oneofs[i++].resolve();\r\n return Namespace.prototype.resolveAll.call(this);\r\n};\r\n\r\n/**\r\n * @override\r\n */\r\nType.prototype.get = function get(name) {\r\n return this.fields[name]\r\n || this.oneofs && this.oneofs[name]\r\n || this.nested && this.nested[name]\r\n || null;\r\n};\r\n\r\n/**\r\n * Adds a nested object to this type.\r\n * @param {ReflectionObject} object Nested object to add\r\n * @returns {Type} `this`\r\n * @throws {TypeError} If arguments are invalid\r\n * @throws {Error} If there is already a nested object with this name or, if a field, when there is already a field with this id\r\n */\r\nType.prototype.add = function add(object) {\r\n\r\n if (this.get(object.name))\r\n throw Error(\"duplicate name '\" + object.name + \"' in \" + this);\r\n\r\n if (object instanceof Field && object.extend === undefined) {\r\n // NOTE: Extension fields aren't actual fields on the declaring type, but nested objects.\r\n // The root object takes care of adding distinct sister-fields to the respective extended\r\n // type instead.\r\n\r\n // avoids calling the getter if not absolutely necessary because it's called quite frequently\r\n if (this._fieldsById ? /* istanbul ignore next */ this._fieldsById[object.id] : this.fieldsById[object.id])\r\n throw Error(\"duplicate id \" + object.id + \" in \" + this);\r\n if (this.isReservedId(object.id))\r\n throw Error(\"id \" + object.id + \" is reserved in \" + this);\r\n if (this.isReservedName(object.name))\r\n throw Error(\"name '\" + object.name + \"' is reserved in \" + this);\r\n\r\n if (object.parent)\r\n object.parent.remove(object);\r\n this.fields[object.name] = object;\r\n object.message = this;\r\n object.onAdd(this);\r\n return clearCache(this);\r\n }\r\n if (object instanceof OneOf) {\r\n if (!this.oneofs)\r\n this.oneofs = {};\r\n this.oneofs[object.name] = object;\r\n object.onAdd(this);\r\n return clearCache(this);\r\n }\r\n return Namespace.prototype.add.call(this, object);\r\n};\r\n\r\n/**\r\n * Removes a nested object from this type.\r\n * @param {ReflectionObject} object Nested object to remove\r\n * @returns {Type} `this`\r\n * @throws {TypeError} If arguments are invalid\r\n * @throws {Error} If `object` is not a member of this type\r\n */\r\nType.prototype.remove = function remove(object) {\r\n if (object instanceof Field && object.extend === undefined) {\r\n // See Type#add for the reason why extension fields are excluded here.\r\n\r\n /* istanbul ignore if */\r\n if (!this.fields || this.fields[object.name] !== object)\r\n throw Error(object + \" is not a member of \" + this);\r\n\r\n delete this.fields[object.name];\r\n object.parent = null;\r\n object.onRemove(this);\r\n return clearCache(this);\r\n }\r\n if (object instanceof OneOf) {\r\n\r\n /* istanbul ignore if */\r\n if (!this.oneofs || this.oneofs[object.name] !== object)\r\n throw Error(object + \" is not a member of \" + this);\r\n\r\n delete this.oneofs[object.name];\r\n object.parent = null;\r\n object.onRemove(this);\r\n return clearCache(this);\r\n }\r\n return Namespace.prototype.remove.call(this, object);\r\n};\r\n\r\n/**\r\n * Tests if the specified id is reserved.\r\n * @param {number} id Id to test\r\n * @returns {boolean} `true` if reserved, otherwise `false`\r\n */\r\nType.prototype.isReservedId = function isReservedId(id) {\r\n return Namespace.isReservedId(this.reserved, id);\r\n};\r\n\r\n/**\r\n * Tests if the specified name is reserved.\r\n * @param {string} name Name to test\r\n * @returns {boolean} `true` if reserved, otherwise `false`\r\n */\r\nType.prototype.isReservedName = function isReservedName(name) {\r\n return Namespace.isReservedName(this.reserved, name);\r\n};\r\n\r\n/**\r\n * Creates a new message of this type using the specified properties.\r\n * @param {Object.} [properties] Properties to set\r\n * @returns {Message<{}>} Message instance\r\n */\r\nType.prototype.create = function create(properties) {\r\n return new this.ctor(properties);\r\n};\r\n\r\n/**\r\n * Sets up {@link Type#encode|encode}, {@link Type#decode|decode} and {@link Type#verify|verify}.\r\n * @returns {Type} `this`\r\n */\r\nType.prototype.setup = function setup() {\r\n // Sets up everything at once so that the prototype chain does not have to be re-evaluated\r\n // multiple times (V8, soft-deopt prototype-check).\r\n\r\n var fullName = this.fullName,\r\n types = [];\r\n for (var i = 0; i < /* initializes */ this.fieldsArray.length; ++i)\r\n types.push(this._fieldsArray[i].resolve().resolvedType);\r\n\r\n // Replace setup methods with type-specific generated functions\r\n this.encode = encoder(this)({\r\n Writer : Writer,\r\n types : types,\r\n util : util\r\n });\r\n this.decode = decoder(this)({\r\n Reader : Reader,\r\n types : types,\r\n util : util\r\n });\r\n this.verify = verifier(this)({\r\n types : types,\r\n util : util\r\n });\r\n this.fromObject = converter.fromObject(this)({\r\n types : types,\r\n util : util\r\n });\r\n this.toObject = converter.toObject(this)({\r\n types : types,\r\n util : util\r\n });\r\n\r\n // Inject custom wrappers for common types\r\n var wrapper = wrappers[fullName];\r\n if (wrapper) {\r\n var originalThis = Object.create(this);\r\n // if (wrapper.fromObject) {\r\n originalThis.fromObject = this.fromObject;\r\n this.fromObject = wrapper.fromObject.bind(originalThis);\r\n // }\r\n // if (wrapper.toObject) {\r\n originalThis.toObject = this.toObject;\r\n this.toObject = wrapper.toObject.bind(originalThis);\r\n // }\r\n }\r\n\r\n return this;\r\n};\r\n\r\n/**\r\n * Encodes a message of this type. Does not implicitly {@link Type#verify|verify} messages.\r\n * @param {Message<{}>|Object.} message Message instance or plain object\r\n * @param {Writer} [writer] Writer to encode to\r\n * @returns {Writer} writer\r\n */\r\nType.prototype.encode = function encode_setup(message, writer) {\r\n return this.setup().encode(message, writer); // overrides this method\r\n};\r\n\r\n/**\r\n * Encodes a message of this type preceeded by its byte length as a varint. Does not implicitly {@link Type#verify|verify} messages.\r\n * @param {Message<{}>|Object.} message Message instance or plain object\r\n * @param {Writer} [writer] Writer to encode to\r\n * @returns {Writer} writer\r\n */\r\nType.prototype.encodeDelimited = function encodeDelimited(message, writer) {\r\n return this.encode(message, writer && writer.len ? writer.fork() : writer).ldelim();\r\n};\r\n\r\n/**\r\n * Decodes a message of this type.\r\n * @param {Reader|Uint8Array} reader Reader or buffer to decode from\r\n * @param {number} [length] Length of the message, if known beforehand\r\n * @returns {Message<{}>} Decoded message\r\n * @throws {Error} If the payload is not a reader or valid buffer\r\n * @throws {util.ProtocolError<{}>} If required fields are missing\r\n */\r\nType.prototype.decode = function decode_setup(reader, length) {\r\n return this.setup().decode(reader, length); // overrides this method\r\n};\r\n\r\n/**\r\n * Decodes a message of this type preceeded by its byte length as a varint.\r\n * @param {Reader|Uint8Array} reader Reader or buffer to decode from\r\n * @returns {Message<{}>} Decoded message\r\n * @throws {Error} If the payload is not a reader or valid buffer\r\n * @throws {util.ProtocolError} If required fields are missing\r\n */\r\nType.prototype.decodeDelimited = function decodeDelimited(reader) {\r\n if (!(reader instanceof Reader))\r\n reader = Reader.create(reader);\r\n return this.decode(reader, reader.uint32());\r\n};\r\n\r\n/**\r\n * Verifies that field values are valid and that required fields are present.\r\n * @param {Object.} message Plain object to verify\r\n * @returns {null|string} `null` if valid, otherwise the reason why it is not\r\n */\r\nType.prototype.verify = function verify_setup(message) {\r\n return this.setup().verify(message); // overrides this method\r\n};\r\n\r\n/**\r\n * Creates a new message of this type from a plain object. Also converts values to their respective internal types.\r\n * @param {Object.} object Plain object to convert\r\n * @returns {Message<{}>} Message instance\r\n */\r\nType.prototype.fromObject = function fromObject(object) {\r\n return this.setup().fromObject(object);\r\n};\r\n\r\n/**\r\n * Conversion options as used by {@link Type#toObject} and {@link Message.toObject}.\r\n * @interface IConversionOptions\r\n * @property {Function} [longs] Long conversion type.\r\n * Valid values are `String` and `Number` (the global types).\r\n * Defaults to copy the present value, which is a possibly unsafe number without and a {@link Long} with a long library.\r\n * @property {Function} [enums] Enum value conversion type.\r\n * Only valid value is `String` (the global type).\r\n * Defaults to copy the present value, which is the numeric id.\r\n * @property {Function} [bytes] Bytes value conversion type.\r\n * Valid values are `Array` and (a base64 encoded) `String` (the global types).\r\n * Defaults to copy the present value, which usually is a Buffer under node and an Uint8Array in the browser.\r\n * @property {boolean} [defaults=false] Also sets default values on the resulting object\r\n * @property {boolean} [arrays=false] Sets empty arrays for missing repeated fields even if `defaults=false`\r\n * @property {boolean} [objects=false] Sets empty objects for missing map fields even if `defaults=false`\r\n * @property {boolean} [oneofs=false] Includes virtual oneof properties set to the present field's name, if any\r\n * @property {boolean} [json=false] Performs additional JSON compatibility conversions, i.e. NaN and Infinity to strings\r\n */\r\n\r\n/**\r\n * Creates a plain object from a message of this type. Also converts values to other types if specified.\r\n * @param {Message<{}>} message Message instance\r\n * @param {IConversionOptions} [options] Conversion options\r\n * @returns {Object.} Plain object\r\n */\r\nType.prototype.toObject = function toObject(message, options) {\r\n return this.setup().toObject(message, options);\r\n};\r\n\r\n/**\r\n * Decorator function as returned by {@link Type.d} (TypeScript).\r\n * @typedef TypeDecorator\r\n * @type {function}\r\n * @param {Constructor} target Target constructor\r\n * @returns {undefined}\r\n * @template T extends Message\r\n */\r\n\r\n/**\r\n * Type decorator (TypeScript).\r\n * @param {string} [typeName] Type name, defaults to the constructor's name\r\n * @returns {TypeDecorator} Decorator function\r\n * @template T extends Message\r\n */\r\nType.d = function decorateType(typeName) {\r\n return function typeDecorator(target) {\r\n util.decorateType(target, typeName);\r\n };\r\n};\r\n","\"use strict\";\r\n\r\n/**\r\n * Common type constants.\r\n * @namespace\r\n */\r\nvar types = exports;\r\n\r\nvar util = require(\"./util\");\r\n\r\nvar s = [\r\n \"double\", // 0\r\n \"float\", // 1\r\n \"int32\", // 2\r\n \"uint32\", // 3\r\n \"sint32\", // 4\r\n \"fixed32\", // 5\r\n \"sfixed32\", // 6\r\n \"int64\", // 7\r\n \"uint64\", // 8\r\n \"sint64\", // 9\r\n \"fixed64\", // 10\r\n \"sfixed64\", // 11\r\n \"bool\", // 12\r\n \"string\", // 13\r\n \"bytes\" // 14\r\n];\r\n\r\nfunction bake(values, offset) {\r\n var i = 0, o = {};\r\n offset |= 0;\r\n while (i < values.length) o[s[i + offset]] = values[i++];\r\n return o;\r\n}\r\n\r\n/**\r\n * Basic type wire types.\r\n * @type {Object.}\r\n * @const\r\n * @property {number} double=1 Fixed64 wire type\r\n * @property {number} float=5 Fixed32 wire type\r\n * @property {number} int32=0 Varint wire type\r\n * @property {number} uint32=0 Varint wire type\r\n * @property {number} sint32=0 Varint wire type\r\n * @property {number} fixed32=5 Fixed32 wire type\r\n * @property {number} sfixed32=5 Fixed32 wire type\r\n * @property {number} int64=0 Varint wire type\r\n * @property {number} uint64=0 Varint wire type\r\n * @property {number} sint64=0 Varint wire type\r\n * @property {number} fixed64=1 Fixed64 wire type\r\n * @property {number} sfixed64=1 Fixed64 wire type\r\n * @property {number} bool=0 Varint wire type\r\n * @property {number} string=2 Ldelim wire type\r\n * @property {number} bytes=2 Ldelim wire type\r\n */\r\ntypes.basic = bake([\r\n /* double */ 1,\r\n /* float */ 5,\r\n /* int32 */ 0,\r\n /* uint32 */ 0,\r\n /* sint32 */ 0,\r\n /* fixed32 */ 5,\r\n /* sfixed32 */ 5,\r\n /* int64 */ 0,\r\n /* uint64 */ 0,\r\n /* sint64 */ 0,\r\n /* fixed64 */ 1,\r\n /* sfixed64 */ 1,\r\n /* bool */ 0,\r\n /* string */ 2,\r\n /* bytes */ 2\r\n]);\r\n\r\n/**\r\n * Basic type defaults.\r\n * @type {Object.}\r\n * @const\r\n * @property {number} double=0 Double default\r\n * @property {number} float=0 Float default\r\n * @property {number} int32=0 Int32 default\r\n * @property {number} uint32=0 Uint32 default\r\n * @property {number} sint32=0 Sint32 default\r\n * @property {number} fixed32=0 Fixed32 default\r\n * @property {number} sfixed32=0 Sfixed32 default\r\n * @property {number} int64=0 Int64 default\r\n * @property {number} uint64=0 Uint64 default\r\n * @property {number} sint64=0 Sint32 default\r\n * @property {number} fixed64=0 Fixed64 default\r\n * @property {number} sfixed64=0 Sfixed64 default\r\n * @property {boolean} bool=false Bool default\r\n * @property {string} string=\"\" String default\r\n * @property {Array.} bytes=Array(0) Bytes default\r\n * @property {null} message=null Message default\r\n */\r\ntypes.defaults = bake([\r\n /* double */ 0,\r\n /* float */ 0,\r\n /* int32 */ 0,\r\n /* uint32 */ 0,\r\n /* sint32 */ 0,\r\n /* fixed32 */ 0,\r\n /* sfixed32 */ 0,\r\n /* int64 */ 0,\r\n /* uint64 */ 0,\r\n /* sint64 */ 0,\r\n /* fixed64 */ 0,\r\n /* sfixed64 */ 0,\r\n /* bool */ false,\r\n /* string */ \"\",\r\n /* bytes */ util.emptyArray,\r\n /* message */ null\r\n]);\r\n\r\n/**\r\n * Basic long type wire types.\r\n * @type {Object.}\r\n * @const\r\n * @property {number} int64=0 Varint wire type\r\n * @property {number} uint64=0 Varint wire type\r\n * @property {number} sint64=0 Varint wire type\r\n * @property {number} fixed64=1 Fixed64 wire type\r\n * @property {number} sfixed64=1 Fixed64 wire type\r\n */\r\ntypes.long = bake([\r\n /* int64 */ 0,\r\n /* uint64 */ 0,\r\n /* sint64 */ 0,\r\n /* fixed64 */ 1,\r\n /* sfixed64 */ 1\r\n], 7);\r\n\r\n/**\r\n * Allowed types for map keys with their associated wire type.\r\n * @type {Object.}\r\n * @const\r\n * @property {number} int32=0 Varint wire type\r\n * @property {number} uint32=0 Varint wire type\r\n * @property {number} sint32=0 Varint wire type\r\n * @property {number} fixed32=5 Fixed32 wire type\r\n * @property {number} sfixed32=5 Fixed32 wire type\r\n * @property {number} int64=0 Varint wire type\r\n * @property {number} uint64=0 Varint wire type\r\n * @property {number} sint64=0 Varint wire type\r\n * @property {number} fixed64=1 Fixed64 wire type\r\n * @property {number} sfixed64=1 Fixed64 wire type\r\n * @property {number} bool=0 Varint wire type\r\n * @property {number} string=2 Ldelim wire type\r\n */\r\ntypes.mapKey = bake([\r\n /* int32 */ 0,\r\n /* uint32 */ 0,\r\n /* sint32 */ 0,\r\n /* fixed32 */ 5,\r\n /* sfixed32 */ 5,\r\n /* int64 */ 0,\r\n /* uint64 */ 0,\r\n /* sint64 */ 0,\r\n /* fixed64 */ 1,\r\n /* sfixed64 */ 1,\r\n /* bool */ 0,\r\n /* string */ 2\r\n], 2);\r\n\r\n/**\r\n * Allowed types for packed repeated fields with their associated wire type.\r\n * @type {Object.}\r\n * @const\r\n * @property {number} double=1 Fixed64 wire type\r\n * @property {number} float=5 Fixed32 wire type\r\n * @property {number} int32=0 Varint wire type\r\n * @property {number} uint32=0 Varint wire type\r\n * @property {number} sint32=0 Varint wire type\r\n * @property {number} fixed32=5 Fixed32 wire type\r\n * @property {number} sfixed32=5 Fixed32 wire type\r\n * @property {number} int64=0 Varint wire type\r\n * @property {number} uint64=0 Varint wire type\r\n * @property {number} sint64=0 Varint wire type\r\n * @property {number} fixed64=1 Fixed64 wire type\r\n * @property {number} sfixed64=1 Fixed64 wire type\r\n * @property {number} bool=0 Varint wire type\r\n */\r\ntypes.packed = bake([\r\n /* double */ 1,\r\n /* float */ 5,\r\n /* int32 */ 0,\r\n /* uint32 */ 0,\r\n /* sint32 */ 0,\r\n /* fixed32 */ 5,\r\n /* sfixed32 */ 5,\r\n /* int64 */ 0,\r\n /* uint64 */ 0,\r\n /* sint64 */ 0,\r\n /* fixed64 */ 1,\r\n /* sfixed64 */ 1,\r\n /* bool */ 0\r\n]);\r\n","\"use strict\";\r\n\r\n/**\r\n * Various utility functions.\r\n * @namespace\r\n */\r\nvar util = module.exports = require(\"./util/minimal\");\r\n\r\nvar roots = require(\"./roots\");\r\n\r\nvar Type, // cyclic\r\n Enum;\r\n\r\nutil.codegen = require(\"@protobufjs/codegen\");\r\nutil.fetch = require(\"@protobufjs/fetch\");\r\nutil.path = require(\"@protobufjs/path\");\r\n\r\n/**\r\n * Node's fs module if available.\r\n * @type {Object.}\r\n */\r\nutil.fs = util.inquire(\"fs\");\r\n\r\n/**\r\n * Converts an object's values to an array.\r\n * @param {Object.} object Object to convert\r\n * @returns {Array.<*>} Converted array\r\n */\r\nutil.toArray = function toArray(object) {\r\n if (object) {\r\n var keys = Object.keys(object),\r\n array = new Array(keys.length),\r\n index = 0;\r\n while (index < keys.length)\r\n array[index] = object[keys[index++]];\r\n return array;\r\n }\r\n return [];\r\n};\r\n\r\n/**\r\n * Converts an array of keys immediately followed by their respective value to an object, omitting undefined values.\r\n * @param {Array.<*>} array Array to convert\r\n * @returns {Object.} Converted object\r\n */\r\nutil.toObject = function toObject(array) {\r\n var object = {},\r\n index = 0;\r\n while (index < array.length) {\r\n var key = array[index++],\r\n val = array[index++];\r\n if (val !== undefined)\r\n object[key] = val;\r\n }\r\n return object;\r\n};\r\n\r\nvar safePropBackslashRe = /\\\\/g,\r\n safePropQuoteRe = /\"/g;\r\n\r\n/**\r\n * Tests whether the specified name is a reserved word in JS.\r\n * @param {string} name Name to test\r\n * @returns {boolean} `true` if reserved, otherwise `false`\r\n */\r\nutil.isReserved = function isReserved(name) {\r\n return /^(?:do|if|in|for|let|new|try|var|case|else|enum|eval|false|null|this|true|void|with|break|catch|class|const|super|throw|while|yield|delete|export|import|public|return|static|switch|typeof|default|extends|finally|package|private|continue|debugger|function|arguments|interface|protected|implements|instanceof)$/.test(name);\r\n};\r\n\r\n/**\r\n * Returns a safe property accessor for the specified property name.\r\n * @param {string} prop Property name\r\n * @returns {string} Safe accessor\r\n */\r\nutil.safeProp = function safeProp(prop) {\r\n if (!/^[$\\w_]+$/.test(prop) || util.isReserved(prop))\r\n return \"[\\\"\" + prop.replace(safePropBackslashRe, \"\\\\\\\\\").replace(safePropQuoteRe, \"\\\\\\\"\") + \"\\\"]\";\r\n return \".\" + prop;\r\n};\r\n\r\n/**\r\n * Converts the first character of a string to upper case.\r\n * @param {string} str String to convert\r\n * @returns {string} Converted string\r\n */\r\nutil.ucFirst = function ucFirst(str) {\r\n return str.charAt(0).toUpperCase() + str.substring(1);\r\n};\r\n\r\nvar camelCaseRe = /_([a-z])/g;\r\n\r\n/**\r\n * Converts a string to camel case.\r\n * @param {string} str String to convert\r\n * @returns {string} Converted string\r\n */\r\nutil.camelCase = function camelCase(str) {\r\n return str.substring(0, 1)\r\n + str.substring(1)\r\n .replace(camelCaseRe, function($0, $1) { return $1.toUpperCase(); });\r\n};\r\n\r\n/**\r\n * Compares reflected fields by id.\r\n * @param {Field} a First field\r\n * @param {Field} b Second field\r\n * @returns {number} Comparison value\r\n */\r\nutil.compareFieldsById = function compareFieldsById(a, b) {\r\n return a.id - b.id;\r\n};\r\n\r\n/**\r\n * Decorator helper for types (TypeScript).\r\n * @param {Constructor} ctor Constructor function\r\n * @param {string} [typeName] Type name, defaults to the constructor's name\r\n * @returns {Type} Reflected type\r\n * @template T extends Message\r\n * @property {Root} root Decorators root\r\n */\r\nutil.decorateType = function decorateType(ctor, typeName) {\r\n\r\n /* istanbul ignore if */\r\n if (ctor.$type) {\r\n if (typeName && ctor.$type.name !== typeName) {\r\n util.decorateRoot.remove(ctor.$type);\r\n ctor.$type.name = typeName;\r\n util.decorateRoot.add(ctor.$type);\r\n }\r\n return ctor.$type;\r\n }\r\n\r\n /* istanbul ignore next */\r\n if (!Type)\r\n Type = require(\"./type\");\r\n\r\n var type = new Type(typeName || ctor.name);\r\n util.decorateRoot.add(type);\r\n type.ctor = ctor; // sets up .encode, .decode etc.\r\n Object.defineProperty(ctor, \"$type\", { value: type, enumerable: false });\r\n Object.defineProperty(ctor.prototype, \"$type\", { value: type, enumerable: false });\r\n return type;\r\n};\r\n\r\nvar decorateEnumIndex = 0;\r\n\r\n/**\r\n * Decorator helper for enums (TypeScript).\r\n * @param {Object} object Enum object\r\n * @returns {Enum} Reflected enum\r\n */\r\nutil.decorateEnum = function decorateEnum(object) {\r\n\r\n /* istanbul ignore if */\r\n if (object.$type)\r\n return object.$type;\r\n\r\n /* istanbul ignore next */\r\n if (!Enum)\r\n Enum = require(\"./enum\");\r\n\r\n var enm = new Enum(\"Enum\" + decorateEnumIndex++, object);\r\n util.decorateRoot.add(enm);\r\n Object.defineProperty(object, \"$type\", { value: enm, enumerable: false });\r\n return enm;\r\n};\r\n\r\n\r\n/**\r\n * Sets the value of a property by property path. If a value already exists, it is turned to an array\r\n * @param {Object.} dst Destination object\r\n * @param {string} path dot '.' delimited path of the property to set\r\n * @param {Object} value the value to set\r\n * @returns {Object.} Destination object\r\n */\r\nutil.setProperty = function setProperty(dst, path, value) {\r\n function setProp(dst, path, value) {\r\n var part = path.shift();\r\n if (part === \"__proto__\" || part === \"prototype\") {\r\n return dst;\r\n }\r\n if (path.length > 0) {\r\n dst[part] = setProp(dst[part] || {}, path, value);\r\n } else {\r\n var prevValue = dst[part];\r\n if (prevValue)\r\n value = [].concat(prevValue).concat(value);\r\n dst[part] = value;\r\n }\r\n return dst;\r\n }\r\n\r\n if (typeof dst !== \"object\")\r\n throw TypeError(\"dst must be an object\");\r\n if (!path)\r\n throw TypeError(\"path must be specified\");\r\n\r\n path = path.split(\".\");\r\n return setProp(dst, path, value);\r\n};\r\n\r\n/**\r\n * Decorator root (TypeScript).\r\n * @name util.decorateRoot\r\n * @type {Root}\r\n * @readonly\r\n */\r\nObject.defineProperty(util, \"decorateRoot\", {\r\n get: function() {\r\n return roots[\"decorated\"] || (roots[\"decorated\"] = new (require(\"./root\"))());\r\n }\r\n});\r\n","\"use strict\";\r\nmodule.exports = LongBits;\r\n\r\nvar util = require(\"../util/minimal\");\r\n\r\n/**\r\n * Constructs new long bits.\r\n * @classdesc Helper class for working with the low and high bits of a 64 bit value.\r\n * @memberof util\r\n * @constructor\r\n * @param {number} lo Low 32 bits, unsigned\r\n * @param {number} hi High 32 bits, unsigned\r\n */\r\nfunction LongBits(lo, hi) {\r\n\r\n // note that the casts below are theoretically unnecessary as of today, but older statically\r\n // generated converter code might still call the ctor with signed 32bits. kept for compat.\r\n\r\n /**\r\n * Low bits.\r\n * @type {number}\r\n */\r\n this.lo = lo >>> 0;\r\n\r\n /**\r\n * High bits.\r\n * @type {number}\r\n */\r\n this.hi = hi >>> 0;\r\n}\r\n\r\n/**\r\n * Zero bits.\r\n * @memberof util.LongBits\r\n * @type {util.LongBits}\r\n */\r\nvar zero = LongBits.zero = new LongBits(0, 0);\r\n\r\nzero.toNumber = function() { return 0; };\r\nzero.zzEncode = zero.zzDecode = function() { return this; };\r\nzero.length = function() { return 1; };\r\n\r\n/**\r\n * Zero hash.\r\n * @memberof util.LongBits\r\n * @type {string}\r\n */\r\nvar zeroHash = LongBits.zeroHash = \"\\0\\0\\0\\0\\0\\0\\0\\0\";\r\n\r\n/**\r\n * Constructs new long bits from the specified number.\r\n * @param {number} value Value\r\n * @returns {util.LongBits} Instance\r\n */\r\nLongBits.fromNumber = function fromNumber(value) {\r\n if (value === 0)\r\n return zero;\r\n var sign = value < 0;\r\n if (sign)\r\n value = -value;\r\n var lo = value >>> 0,\r\n hi = (value - lo) / 4294967296 >>> 0;\r\n if (sign) {\r\n hi = ~hi >>> 0;\r\n lo = ~lo >>> 0;\r\n if (++lo > 4294967295) {\r\n lo = 0;\r\n if (++hi > 4294967295)\r\n hi = 0;\r\n }\r\n }\r\n return new LongBits(lo, hi);\r\n};\r\n\r\n/**\r\n * Constructs new long bits from a number, long or string.\r\n * @param {Long|number|string} value Value\r\n * @returns {util.LongBits} Instance\r\n */\r\nLongBits.from = function from(value) {\r\n if (typeof value === \"number\")\r\n return LongBits.fromNumber(value);\r\n if (util.isString(value)) {\r\n /* istanbul ignore else */\r\n if (util.Long)\r\n value = util.Long.fromString(value);\r\n else\r\n return LongBits.fromNumber(parseInt(value, 10));\r\n }\r\n return value.low || value.high ? new LongBits(value.low >>> 0, value.high >>> 0) : zero;\r\n};\r\n\r\n/**\r\n * Converts this long bits to a possibly unsafe JavaScript number.\r\n * @param {boolean} [unsigned=false] Whether unsigned or not\r\n * @returns {number} Possibly unsafe number\r\n */\r\nLongBits.prototype.toNumber = function toNumber(unsigned) {\r\n if (!unsigned && this.hi >>> 31) {\r\n var lo = ~this.lo + 1 >>> 0,\r\n hi = ~this.hi >>> 0;\r\n if (!lo)\r\n hi = hi + 1 >>> 0;\r\n return -(lo + hi * 4294967296);\r\n }\r\n return this.lo + this.hi * 4294967296;\r\n};\r\n\r\n/**\r\n * Converts this long bits to a long.\r\n * @param {boolean} [unsigned=false] Whether unsigned or not\r\n * @returns {Long} Long\r\n */\r\nLongBits.prototype.toLong = function toLong(unsigned) {\r\n return util.Long\r\n ? new util.Long(this.lo | 0, this.hi | 0, Boolean(unsigned))\r\n /* istanbul ignore next */\r\n : { low: this.lo | 0, high: this.hi | 0, unsigned: Boolean(unsigned) };\r\n};\r\n\r\nvar charCodeAt = String.prototype.charCodeAt;\r\n\r\n/**\r\n * Constructs new long bits from the specified 8 characters long hash.\r\n * @param {string} hash Hash\r\n * @returns {util.LongBits} Bits\r\n */\r\nLongBits.fromHash = function fromHash(hash) {\r\n if (hash === zeroHash)\r\n return zero;\r\n return new LongBits(\r\n ( charCodeAt.call(hash, 0)\r\n | charCodeAt.call(hash, 1) << 8\r\n | charCodeAt.call(hash, 2) << 16\r\n | charCodeAt.call(hash, 3) << 24) >>> 0\r\n ,\r\n ( charCodeAt.call(hash, 4)\r\n | charCodeAt.call(hash, 5) << 8\r\n | charCodeAt.call(hash, 6) << 16\r\n | charCodeAt.call(hash, 7) << 24) >>> 0\r\n );\r\n};\r\n\r\n/**\r\n * Converts this long bits to a 8 characters long hash.\r\n * @returns {string} Hash\r\n */\r\nLongBits.prototype.toHash = function toHash() {\r\n return String.fromCharCode(\r\n this.lo & 255,\r\n this.lo >>> 8 & 255,\r\n this.lo >>> 16 & 255,\r\n this.lo >>> 24 ,\r\n this.hi & 255,\r\n this.hi >>> 8 & 255,\r\n this.hi >>> 16 & 255,\r\n this.hi >>> 24\r\n );\r\n};\r\n\r\n/**\r\n * Zig-zag encodes this long bits.\r\n * @returns {util.LongBits} `this`\r\n */\r\nLongBits.prototype.zzEncode = function zzEncode() {\r\n var mask = this.hi >> 31;\r\n this.hi = ((this.hi << 1 | this.lo >>> 31) ^ mask) >>> 0;\r\n this.lo = ( this.lo << 1 ^ mask) >>> 0;\r\n return this;\r\n};\r\n\r\n/**\r\n * Zig-zag decodes this long bits.\r\n * @returns {util.LongBits} `this`\r\n */\r\nLongBits.prototype.zzDecode = function zzDecode() {\r\n var mask = -(this.lo & 1);\r\n this.lo = ((this.lo >>> 1 | this.hi << 31) ^ mask) >>> 0;\r\n this.hi = ( this.hi >>> 1 ^ mask) >>> 0;\r\n return this;\r\n};\r\n\r\n/**\r\n * Calculates the length of this longbits when encoded as a varint.\r\n * @returns {number} Length\r\n */\r\nLongBits.prototype.length = function length() {\r\n var part0 = this.lo,\r\n part1 = (this.lo >>> 28 | this.hi << 4) >>> 0,\r\n part2 = this.hi >>> 24;\r\n return part2 === 0\r\n ? part1 === 0\r\n ? part0 < 16384\r\n ? part0 < 128 ? 1 : 2\r\n : part0 < 2097152 ? 3 : 4\r\n : part1 < 16384\r\n ? part1 < 128 ? 5 : 6\r\n : part1 < 2097152 ? 7 : 8\r\n : part2 < 128 ? 9 : 10;\r\n};\r\n","\"use strict\";\r\nvar util = exports;\r\n\r\n// used to return a Promise where callback is omitted\r\nutil.asPromise = require(\"@protobufjs/aspromise\");\r\n\r\n// converts to / from base64 encoded strings\r\nutil.base64 = require(\"@protobufjs/base64\");\r\n\r\n// base class of rpc.Service\r\nutil.EventEmitter = require(\"@protobufjs/eventemitter\");\r\n\r\n// float handling accross browsers\r\nutil.float = require(\"@protobufjs/float\");\r\n\r\n// requires modules optionally and hides the call from bundlers\r\nutil.inquire = require(\"@protobufjs/inquire\");\r\n\r\n// converts to / from utf8 encoded strings\r\nutil.utf8 = require(\"@protobufjs/utf8\");\r\n\r\n// provides a node-like buffer pool in the browser\r\nutil.pool = require(\"@protobufjs/pool\");\r\n\r\n// utility to work with the low and high bits of a 64 bit value\r\nutil.LongBits = require(\"./longbits\");\r\n\r\n/**\r\n * Whether running within node or not.\r\n * @memberof util\r\n * @type {boolean}\r\n */\r\nutil.isNode = Boolean(typeof global !== \"undefined\"\r\n && global\r\n && global.process\r\n && global.process.versions\r\n && global.process.versions.node);\r\n\r\n/**\r\n * Global object reference.\r\n * @memberof util\r\n * @type {Object}\r\n */\r\nutil.global = util.isNode && global\r\n || typeof window !== \"undefined\" && window\r\n || typeof self !== \"undefined\" && self\r\n || this; // eslint-disable-line no-invalid-this\r\n\r\n/**\r\n * An immuable empty array.\r\n * @memberof util\r\n * @type {Array.<*>}\r\n * @const\r\n */\r\nutil.emptyArray = Object.freeze ? Object.freeze([]) : /* istanbul ignore next */ []; // used on prototypes\r\n\r\n/**\r\n * An immutable empty object.\r\n * @type {Object}\r\n * @const\r\n */\r\nutil.emptyObject = Object.freeze ? Object.freeze({}) : /* istanbul ignore next */ {}; // used on prototypes\r\n\r\n/**\r\n * Tests if the specified value is an integer.\r\n * @function\r\n * @param {*} value Value to test\r\n * @returns {boolean} `true` if the value is an integer\r\n */\r\nutil.isInteger = Number.isInteger || /* istanbul ignore next */ function isInteger(value) {\r\n return typeof value === \"number\" && isFinite(value) && Math.floor(value) === value;\r\n};\r\n\r\n/**\r\n * Tests if the specified value is a string.\r\n * @param {*} value Value to test\r\n * @returns {boolean} `true` if the value is a string\r\n */\r\nutil.isString = function isString(value) {\r\n return typeof value === \"string\" || value instanceof String;\r\n};\r\n\r\n/**\r\n * Tests if the specified value is a non-null object.\r\n * @param {*} value Value to test\r\n * @returns {boolean} `true` if the value is a non-null object\r\n */\r\nutil.isObject = function isObject(value) {\r\n return value && typeof value === \"object\";\r\n};\r\n\r\n/**\r\n * Checks if a property on a message is considered to be present.\r\n * This is an alias of {@link util.isSet}.\r\n * @function\r\n * @param {Object} obj Plain object or message instance\r\n * @param {string} prop Property name\r\n * @returns {boolean} `true` if considered to be present, otherwise `false`\r\n */\r\nutil.isset =\r\n\r\n/**\r\n * Checks if a property on a message is considered to be present.\r\n * @param {Object} obj Plain object or message instance\r\n * @param {string} prop Property name\r\n * @returns {boolean} `true` if considered to be present, otherwise `false`\r\n */\r\nutil.isSet = function isSet(obj, prop) {\r\n var value = obj[prop];\r\n if (value != null && obj.hasOwnProperty(prop)) // eslint-disable-line eqeqeq, no-prototype-builtins\r\n return typeof value !== \"object\" || (Array.isArray(value) ? value.length : Object.keys(value).length) > 0;\r\n return false;\r\n};\r\n\r\n/**\r\n * Any compatible Buffer instance.\r\n * This is a minimal stand-alone definition of a Buffer instance. The actual type is that exported by node's typings.\r\n * @interface Buffer\r\n * @extends Uint8Array\r\n */\r\n\r\n/**\r\n * Node's Buffer class if available.\r\n * @type {Constructor}\r\n */\r\nutil.Buffer = (function() {\r\n try {\r\n var Buffer = util.inquire(\"buffer\").Buffer;\r\n // refuse to use non-node buffers if not explicitly assigned (perf reasons):\r\n return Buffer.prototype.utf8Write ? Buffer : /* istanbul ignore next */ null;\r\n } catch (e) {\r\n /* istanbul ignore next */\r\n return null;\r\n }\r\n})();\r\n\r\n// Internal alias of or polyfull for Buffer.from.\r\nutil._Buffer_from = null;\r\n\r\n// Internal alias of or polyfill for Buffer.allocUnsafe.\r\nutil._Buffer_allocUnsafe = null;\r\n\r\n/**\r\n * Creates a new buffer of whatever type supported by the environment.\r\n * @param {number|number[]} [sizeOrArray=0] Buffer size or number array\r\n * @returns {Uint8Array|Buffer} Buffer\r\n */\r\nutil.newBuffer = function newBuffer(sizeOrArray) {\r\n /* istanbul ignore next */\r\n return typeof sizeOrArray === \"number\"\r\n ? util.Buffer\r\n ? util._Buffer_allocUnsafe(sizeOrArray)\r\n : new util.Array(sizeOrArray)\r\n : util.Buffer\r\n ? util._Buffer_from(sizeOrArray)\r\n : typeof Uint8Array === \"undefined\"\r\n ? sizeOrArray\r\n : new Uint8Array(sizeOrArray);\r\n};\r\n\r\n/**\r\n * Array implementation used in the browser. `Uint8Array` if supported, otherwise `Array`.\r\n * @type {Constructor}\r\n */\r\nutil.Array = typeof Uint8Array !== \"undefined\" ? Uint8Array /* istanbul ignore next */ : Array;\r\n\r\n/**\r\n * Any compatible Long instance.\r\n * This is a minimal stand-alone definition of a Long instance. The actual type is that exported by long.js.\r\n * @interface Long\r\n * @property {number} low Low bits\r\n * @property {number} high High bits\r\n * @property {boolean} unsigned Whether unsigned or not\r\n */\r\n\r\n/**\r\n * Long.js's Long class if available.\r\n * @type {Constructor}\r\n */\r\nutil.Long = /* istanbul ignore next */ util.global.dcodeIO && /* istanbul ignore next */ util.global.dcodeIO.Long\r\n || /* istanbul ignore next */ util.global.Long\r\n || util.inquire(\"long\");\r\n\r\n/**\r\n * Regular expression used to verify 2 bit (`bool`) map keys.\r\n * @type {RegExp}\r\n * @const\r\n */\r\nutil.key2Re = /^true|false|0|1$/;\r\n\r\n/**\r\n * Regular expression used to verify 32 bit (`int32` etc.) map keys.\r\n * @type {RegExp}\r\n * @const\r\n */\r\nutil.key32Re = /^-?(?:0|[1-9][0-9]*)$/;\r\n\r\n/**\r\n * Regular expression used to verify 64 bit (`int64` etc.) map keys.\r\n * @type {RegExp}\r\n * @const\r\n */\r\nutil.key64Re = /^(?:[\\\\x00-\\\\xff]{8}|-?(?:0|[1-9][0-9]*))$/;\r\n\r\n/**\r\n * Converts a number or long to an 8 characters long hash string.\r\n * @param {Long|number} value Value to convert\r\n * @returns {string} Hash\r\n */\r\nutil.longToHash = function longToHash(value) {\r\n return value\r\n ? util.LongBits.from(value).toHash()\r\n : util.LongBits.zeroHash;\r\n};\r\n\r\n/**\r\n * Converts an 8 characters long hash string to a long or number.\r\n * @param {string} hash Hash\r\n * @param {boolean} [unsigned=false] Whether unsigned or not\r\n * @returns {Long|number} Original value\r\n */\r\nutil.longFromHash = function longFromHash(hash, unsigned) {\r\n var bits = util.LongBits.fromHash(hash);\r\n if (util.Long)\r\n return util.Long.fromBits(bits.lo, bits.hi, unsigned);\r\n return bits.toNumber(Boolean(unsigned));\r\n};\r\n\r\n/**\r\n * Merges the properties of the source object into the destination object.\r\n * @memberof util\r\n * @param {Object.} dst Destination object\r\n * @param {Object.} src Source object\r\n * @param {boolean} [ifNotSet=false] Merges only if the key is not already set\r\n * @returns {Object.} Destination object\r\n */\r\nfunction merge(dst, src, ifNotSet) { // used by converters\r\n for (var keys = Object.keys(src), i = 0; i < keys.length; ++i)\r\n if (dst[keys[i]] === undefined || !ifNotSet)\r\n dst[keys[i]] = src[keys[i]];\r\n return dst;\r\n}\r\n\r\nutil.merge = merge;\r\n\r\n/**\r\n * Converts the first character of a string to lower case.\r\n * @param {string} str String to convert\r\n * @returns {string} Converted string\r\n */\r\nutil.lcFirst = function lcFirst(str) {\r\n return str.charAt(0).toLowerCase() + str.substring(1);\r\n};\r\n\r\n/**\r\n * Creates a custom error constructor.\r\n * @memberof util\r\n * @param {string} name Error name\r\n * @returns {Constructor} Custom error constructor\r\n */\r\nfunction newError(name) {\r\n\r\n function CustomError(message, properties) {\r\n\r\n if (!(this instanceof CustomError))\r\n return new CustomError(message, properties);\r\n\r\n // Error.call(this, message);\r\n // ^ just returns a new error instance because the ctor can be called as a function\r\n\r\n Object.defineProperty(this, \"message\", { get: function() { return message; } });\r\n\r\n /* istanbul ignore next */\r\n if (Error.captureStackTrace) // node\r\n Error.captureStackTrace(this, CustomError);\r\n else\r\n Object.defineProperty(this, \"stack\", { value: new Error().stack || \"\" });\r\n\r\n if (properties)\r\n merge(this, properties);\r\n }\r\n\r\n CustomError.prototype = Object.create(Error.prototype, {\r\n constructor: {\r\n value: CustomError,\r\n writable: true,\r\n enumerable: false,\r\n configurable: true,\r\n },\r\n name: {\r\n get: function get() { return name; },\r\n set: undefined,\r\n enumerable: false,\r\n // configurable: false would accurately preserve the behavior of\r\n // the original, but I'm guessing that was not intentional.\r\n // For an actual error subclass, this property would\r\n // be configurable.\r\n configurable: true,\r\n },\r\n toString: {\r\n value: function value() { return this.name + \": \" + this.message; },\r\n writable: true,\r\n enumerable: false,\r\n configurable: true,\r\n },\r\n });\r\n\r\n return CustomError;\r\n}\r\n\r\nutil.newError = newError;\r\n\r\n/**\r\n * Constructs a new protocol error.\r\n * @classdesc Error subclass indicating a protocol specifc error.\r\n * @memberof util\r\n * @extends Error\r\n * @template T extends Message\r\n * @constructor\r\n * @param {string} message Error message\r\n * @param {Object.} [properties] Additional properties\r\n * @example\r\n * try {\r\n * MyMessage.decode(someBuffer); // throws if required fields are missing\r\n * } catch (e) {\r\n * if (e instanceof ProtocolError && e.instance)\r\n * console.log(\"decoded so far: \" + JSON.stringify(e.instance));\r\n * }\r\n */\r\nutil.ProtocolError = newError(\"ProtocolError\");\r\n\r\n/**\r\n * So far decoded message instance.\r\n * @name util.ProtocolError#instance\r\n * @type {Message}\r\n */\r\n\r\n/**\r\n * A OneOf getter as returned by {@link util.oneOfGetter}.\r\n * @typedef OneOfGetter\r\n * @type {function}\r\n * @returns {string|undefined} Set field name, if any\r\n */\r\n\r\n/**\r\n * Builds a getter for a oneof's present field name.\r\n * @param {string[]} fieldNames Field names\r\n * @returns {OneOfGetter} Unbound getter\r\n */\r\nutil.oneOfGetter = function getOneOf(fieldNames) {\r\n var fieldMap = {};\r\n for (var i = 0; i < fieldNames.length; ++i)\r\n fieldMap[fieldNames[i]] = 1;\r\n\r\n /**\r\n * @returns {string|undefined} Set field name, if any\r\n * @this Object\r\n * @ignore\r\n */\r\n return function() { // eslint-disable-line consistent-return\r\n for (var keys = Object.keys(this), i = keys.length - 1; i > -1; --i)\r\n if (fieldMap[keys[i]] === 1 && this[keys[i]] !== undefined && this[keys[i]] !== null)\r\n return keys[i];\r\n };\r\n};\r\n\r\n/**\r\n * A OneOf setter as returned by {@link util.oneOfSetter}.\r\n * @typedef OneOfSetter\r\n * @type {function}\r\n * @param {string|undefined} value Field name\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Builds a setter for a oneof's present field name.\r\n * @param {string[]} fieldNames Field names\r\n * @returns {OneOfSetter} Unbound setter\r\n */\r\nutil.oneOfSetter = function setOneOf(fieldNames) {\r\n\r\n /**\r\n * @param {string} name Field name\r\n * @returns {undefined}\r\n * @this Object\r\n * @ignore\r\n */\r\n return function(name) {\r\n for (var i = 0; i < fieldNames.length; ++i)\r\n if (fieldNames[i] !== name)\r\n delete this[fieldNames[i]];\r\n };\r\n};\r\n\r\n/**\r\n * Default conversion options used for {@link Message#toJSON} implementations.\r\n *\r\n * These options are close to proto3's JSON mapping with the exception that internal types like Any are handled just like messages. More precisely:\r\n *\r\n * - Longs become strings\r\n * - Enums become string keys\r\n * - Bytes become base64 encoded strings\r\n * - (Sub-)Messages become plain objects\r\n * - Maps become plain objects with all string keys\r\n * - Repeated fields become arrays\r\n * - NaN and Infinity for float and double fields become strings\r\n *\r\n * @type {IConversionOptions}\r\n * @see https://developers.google.com/protocol-buffers/docs/proto3?hl=en#json\r\n */\r\nutil.toJSONOptions = {\r\n longs: String,\r\n enums: String,\r\n bytes: String,\r\n json: true\r\n};\r\n\r\n// Sets up buffer utility according to the environment (called in index-minimal)\r\nutil._configure = function() {\r\n var Buffer = util.Buffer;\r\n /* istanbul ignore if */\r\n if (!Buffer) {\r\n util._Buffer_from = util._Buffer_allocUnsafe = null;\r\n return;\r\n }\r\n // because node 4.x buffers are incompatible & immutable\r\n // see: https://github.com/dcodeIO/protobuf.js/pull/665\r\n util._Buffer_from = Buffer.from !== Uint8Array.from && Buffer.from ||\r\n /* istanbul ignore next */\r\n function Buffer_from(value, encoding) {\r\n return new Buffer(value, encoding);\r\n };\r\n util._Buffer_allocUnsafe = Buffer.allocUnsafe ||\r\n /* istanbul ignore next */\r\n function Buffer_allocUnsafe(size) {\r\n return new Buffer(size);\r\n };\r\n};\r\n","\"use strict\";\r\nmodule.exports = verifier;\r\n\r\nvar Enum = require(\"./enum\"),\r\n util = require(\"./util\");\r\n\r\nfunction invalid(field, expected) {\r\n return field.name + \": \" + expected + (field.repeated && expected !== \"array\" ? \"[]\" : field.map && expected !== \"object\" ? \"{k:\"+field.keyType+\"}\" : \"\") + \" expected\";\r\n}\r\n\r\n/**\r\n * Generates a partial value verifier.\r\n * @param {Codegen} gen Codegen instance\r\n * @param {Field} field Reflected field\r\n * @param {number} fieldIndex Field index\r\n * @param {string} ref Variable reference\r\n * @returns {Codegen} Codegen instance\r\n * @ignore\r\n */\r\nfunction genVerifyValue(gen, field, fieldIndex, ref) {\r\n /* eslint-disable no-unexpected-multiline */\r\n if (field.resolvedType) {\r\n if (field.resolvedType instanceof Enum) { gen\r\n (\"switch(%s){\", ref)\r\n (\"default:\")\r\n (\"return%j\", invalid(field, \"enum value\"));\r\n for (var keys = Object.keys(field.resolvedType.values), j = 0; j < keys.length; ++j) gen\r\n (\"case %i:\", field.resolvedType.values[keys[j]]);\r\n gen\r\n (\"break\")\r\n (\"}\");\r\n } else {\r\n gen\r\n (\"{\")\r\n (\"var e=types[%i].verify(%s);\", fieldIndex, ref)\r\n (\"if(e)\")\r\n (\"return%j+e\", field.name + \".\")\r\n (\"}\");\r\n }\r\n } else {\r\n switch (field.type) {\r\n case \"int32\":\r\n case \"uint32\":\r\n case \"sint32\":\r\n case \"fixed32\":\r\n case \"sfixed32\": gen\r\n (\"if(!util.isInteger(%s))\", ref)\r\n (\"return%j\", invalid(field, \"integer\"));\r\n break;\r\n case \"int64\":\r\n case \"uint64\":\r\n case \"sint64\":\r\n case \"fixed64\":\r\n case \"sfixed64\": gen\r\n (\"if(!util.isInteger(%s)&&!(%s&&util.isInteger(%s.low)&&util.isInteger(%s.high)))\", ref, ref, ref, ref)\r\n (\"return%j\", invalid(field, \"integer|Long\"));\r\n break;\r\n case \"float\":\r\n case \"double\": gen\r\n (\"if(typeof %s!==\\\"number\\\")\", ref)\r\n (\"return%j\", invalid(field, \"number\"));\r\n break;\r\n case \"bool\": gen\r\n (\"if(typeof %s!==\\\"boolean\\\")\", ref)\r\n (\"return%j\", invalid(field, \"boolean\"));\r\n break;\r\n case \"string\": gen\r\n (\"if(!util.isString(%s))\", ref)\r\n (\"return%j\", invalid(field, \"string\"));\r\n break;\r\n case \"bytes\": gen\r\n (\"if(!(%s&&typeof %s.length===\\\"number\\\"||util.isString(%s)))\", ref, ref, ref)\r\n (\"return%j\", invalid(field, \"buffer\"));\r\n break;\r\n }\r\n }\r\n return gen;\r\n /* eslint-enable no-unexpected-multiline */\r\n}\r\n\r\n/**\r\n * Generates a partial key verifier.\r\n * @param {Codegen} gen Codegen instance\r\n * @param {Field} field Reflected field\r\n * @param {string} ref Variable reference\r\n * @returns {Codegen} Codegen instance\r\n * @ignore\r\n */\r\nfunction genVerifyKey(gen, field, ref) {\r\n /* eslint-disable no-unexpected-multiline */\r\n switch (field.keyType) {\r\n case \"int32\":\r\n case \"uint32\":\r\n case \"sint32\":\r\n case \"fixed32\":\r\n case \"sfixed32\": gen\r\n (\"if(!util.key32Re.test(%s))\", ref)\r\n (\"return%j\", invalid(field, \"integer key\"));\r\n break;\r\n case \"int64\":\r\n case \"uint64\":\r\n case \"sint64\":\r\n case \"fixed64\":\r\n case \"sfixed64\": gen\r\n (\"if(!util.key64Re.test(%s))\", ref) // see comment above: x is ok, d is not\r\n (\"return%j\", invalid(field, \"integer|Long key\"));\r\n break;\r\n case \"bool\": gen\r\n (\"if(!util.key2Re.test(%s))\", ref)\r\n (\"return%j\", invalid(field, \"boolean key\"));\r\n break;\r\n }\r\n return gen;\r\n /* eslint-enable no-unexpected-multiline */\r\n}\r\n\r\n/**\r\n * Generates a verifier specific to the specified message type.\r\n * @param {Type} mtype Message type\r\n * @returns {Codegen} Codegen instance\r\n */\r\nfunction verifier(mtype) {\r\n /* eslint-disable no-unexpected-multiline */\r\n\r\n var gen = util.codegen([\"m\"], mtype.name + \"$verify\")\r\n (\"if(typeof m!==\\\"object\\\"||m===null)\")\r\n (\"return%j\", \"object expected\");\r\n var oneofs = mtype.oneofsArray,\r\n seenFirstField = {};\r\n if (oneofs.length) gen\r\n (\"var p={}\");\r\n\r\n for (var i = 0; i < /* initializes */ mtype.fieldsArray.length; ++i) {\r\n var field = mtype._fieldsArray[i].resolve(),\r\n ref = \"m\" + util.safeProp(field.name);\r\n\r\n if (field.optional) gen\r\n (\"if(%s!=null&&m.hasOwnProperty(%j)){\", ref, field.name); // !== undefined && !== null\r\n\r\n // map fields\r\n if (field.map) { gen\r\n (\"if(!util.isObject(%s))\", ref)\r\n (\"return%j\", invalid(field, \"object\"))\r\n (\"var k=Object.keys(%s)\", ref)\r\n (\"for(var i=0;i}\r\n * @const\r\n */\r\nvar wrappers = exports;\r\n\r\nvar Message = require(\"./message\");\r\n\r\n/**\r\n * From object converter part of an {@link IWrapper}.\r\n * @typedef WrapperFromObjectConverter\r\n * @type {function}\r\n * @param {Object.} object Plain object\r\n * @returns {Message<{}>} Message instance\r\n * @this Type\r\n */\r\n\r\n/**\r\n * To object converter part of an {@link IWrapper}.\r\n * @typedef WrapperToObjectConverter\r\n * @type {function}\r\n * @param {Message<{}>} message Message instance\r\n * @param {IConversionOptions} [options] Conversion options\r\n * @returns {Object.} Plain object\r\n * @this Type\r\n */\r\n\r\n/**\r\n * Common type wrapper part of {@link wrappers}.\r\n * @interface IWrapper\r\n * @property {WrapperFromObjectConverter} [fromObject] From object converter\r\n * @property {WrapperToObjectConverter} [toObject] To object converter\r\n */\r\n\r\n// Custom wrapper for Any\r\nwrappers[\".google.protobuf.Any\"] = {\r\n\r\n fromObject: function(object) {\r\n\r\n // unwrap value type if mapped\r\n if (object && object[\"@type\"]) {\r\n // Only use fully qualified type name after the last '/'\r\n var name = object[\"@type\"].substring(object[\"@type\"].lastIndexOf(\"/\") + 1);\r\n var type = this.lookup(name);\r\n /* istanbul ignore else */\r\n if (type) {\r\n // type_url does not accept leading \".\"\r\n var type_url = object[\"@type\"].charAt(0) === \".\" ?\r\n object[\"@type\"].slice(1) : object[\"@type\"];\r\n // type_url prefix is optional, but path seperator is required\r\n if (type_url.indexOf(\"/\") === -1) {\r\n type_url = \"/\" + type_url;\r\n }\r\n return this.create({\r\n type_url: type_url,\r\n value: type.encode(type.fromObject(object)).finish()\r\n });\r\n }\r\n }\r\n\r\n return this.fromObject(object);\r\n },\r\n\r\n toObject: function(message, options) {\r\n\r\n // Default prefix\r\n var googleApi = \"type.googleapis.com/\";\r\n var prefix = \"\";\r\n var name = \"\";\r\n\r\n // decode value if requested and unmapped\r\n if (options && options.json && message.type_url && message.value) {\r\n // Only use fully qualified type name after the last '/'\r\n name = message.type_url.substring(message.type_url.lastIndexOf(\"/\") + 1);\r\n // Separate the prefix used\r\n prefix = message.type_url.substring(0, message.type_url.lastIndexOf(\"/\") + 1);\r\n var type = this.lookup(name);\r\n /* istanbul ignore else */\r\n if (type)\r\n message = type.decode(message.value);\r\n }\r\n\r\n // wrap value if unmapped\r\n if (!(message instanceof this.ctor) && message instanceof Message) {\r\n var object = message.$type.toObject(message, options);\r\n var messageName = message.$type.fullName[0] === \".\" ?\r\n message.$type.fullName.slice(1) : message.$type.fullName;\r\n // Default to type.googleapis.com prefix if no prefix is used\r\n if (prefix === \"\") {\r\n prefix = googleApi;\r\n }\r\n name = prefix + messageName;\r\n object[\"@type\"] = name;\r\n return object;\r\n }\r\n\r\n return this.toObject(message, options);\r\n }\r\n};\r\n","\"use strict\";\r\nmodule.exports = Writer;\r\n\r\nvar util = require(\"./util/minimal\");\r\n\r\nvar BufferWriter; // cyclic\r\n\r\nvar LongBits = util.LongBits,\r\n base64 = util.base64,\r\n utf8 = util.utf8;\r\n\r\n/**\r\n * Constructs a new writer operation instance.\r\n * @classdesc Scheduled writer operation.\r\n * @constructor\r\n * @param {function(*, Uint8Array, number)} fn Function to call\r\n * @param {number} len Value byte length\r\n * @param {*} val Value to write\r\n * @ignore\r\n */\r\nfunction Op(fn, len, val) {\r\n\r\n /**\r\n * Function to call.\r\n * @type {function(Uint8Array, number, *)}\r\n */\r\n this.fn = fn;\r\n\r\n /**\r\n * Value byte length.\r\n * @type {number}\r\n */\r\n this.len = len;\r\n\r\n /**\r\n * Next operation.\r\n * @type {Writer.Op|undefined}\r\n */\r\n this.next = undefined;\r\n\r\n /**\r\n * Value to write.\r\n * @type {*}\r\n */\r\n this.val = val; // type varies\r\n}\r\n\r\n/* istanbul ignore next */\r\nfunction noop() {} // eslint-disable-line no-empty-function\r\n\r\n/**\r\n * Constructs a new writer state instance.\r\n * @classdesc Copied writer state.\r\n * @memberof Writer\r\n * @constructor\r\n * @param {Writer} writer Writer to copy state from\r\n * @ignore\r\n */\r\nfunction State(writer) {\r\n\r\n /**\r\n * Current head.\r\n * @type {Writer.Op}\r\n */\r\n this.head = writer.head;\r\n\r\n /**\r\n * Current tail.\r\n * @type {Writer.Op}\r\n */\r\n this.tail = writer.tail;\r\n\r\n /**\r\n * Current buffer length.\r\n * @type {number}\r\n */\r\n this.len = writer.len;\r\n\r\n /**\r\n * Next state.\r\n * @type {State|null}\r\n */\r\n this.next = writer.states;\r\n}\r\n\r\n/**\r\n * Constructs a new writer instance.\r\n * @classdesc Wire format writer using `Uint8Array` if available, otherwise `Array`.\r\n * @constructor\r\n */\r\nfunction Writer() {\r\n\r\n /**\r\n * Current length.\r\n * @type {number}\r\n */\r\n this.len = 0;\r\n\r\n /**\r\n * Operations head.\r\n * @type {Object}\r\n */\r\n this.head = new Op(noop, 0, 0);\r\n\r\n /**\r\n * Operations tail\r\n * @type {Object}\r\n */\r\n this.tail = this.head;\r\n\r\n /**\r\n * Linked forked states.\r\n * @type {Object|null}\r\n */\r\n this.states = null;\r\n\r\n // When a value is written, the writer calculates its byte length and puts it into a linked\r\n // list of operations to perform when finish() is called. This both allows us to allocate\r\n // buffers of the exact required size and reduces the amount of work we have to do compared\r\n // to first calculating over objects and then encoding over objects. In our case, the encoding\r\n // part is just a linked list walk calling operations with already prepared values.\r\n}\r\n\r\nvar create = function create() {\r\n return util.Buffer\r\n ? function create_buffer_setup() {\r\n return (Writer.create = function create_buffer() {\r\n return new BufferWriter();\r\n })();\r\n }\r\n /* istanbul ignore next */\r\n : function create_array() {\r\n return new Writer();\r\n };\r\n};\r\n\r\n/**\r\n * Creates a new writer.\r\n * @function\r\n * @returns {BufferWriter|Writer} A {@link BufferWriter} when Buffers are supported, otherwise a {@link Writer}\r\n */\r\nWriter.create = create();\r\n\r\n/**\r\n * Allocates a buffer of the specified size.\r\n * @param {number} size Buffer size\r\n * @returns {Uint8Array} Buffer\r\n */\r\nWriter.alloc = function alloc(size) {\r\n return new util.Array(size);\r\n};\r\n\r\n// Use Uint8Array buffer pool in the browser, just like node does with buffers\r\n/* istanbul ignore else */\r\nif (util.Array !== Array)\r\n Writer.alloc = util.pool(Writer.alloc, util.Array.prototype.subarray);\r\n\r\n/**\r\n * Pushes a new operation to the queue.\r\n * @param {function(Uint8Array, number, *)} fn Function to call\r\n * @param {number} len Value byte length\r\n * @param {number} val Value to write\r\n * @returns {Writer} `this`\r\n * @private\r\n */\r\nWriter.prototype._push = function push(fn, len, val) {\r\n this.tail = this.tail.next = new Op(fn, len, val);\r\n this.len += len;\r\n return this;\r\n};\r\n\r\nfunction writeByte(val, buf, pos) {\r\n buf[pos] = val & 255;\r\n}\r\n\r\nfunction writeVarint32(val, buf, pos) {\r\n while (val > 127) {\r\n buf[pos++] = val & 127 | 128;\r\n val >>>= 7;\r\n }\r\n buf[pos] = val;\r\n}\r\n\r\n/**\r\n * Constructs a new varint writer operation instance.\r\n * @classdesc Scheduled varint writer operation.\r\n * @extends Op\r\n * @constructor\r\n * @param {number} len Value byte length\r\n * @param {number} val Value to write\r\n * @ignore\r\n */\r\nfunction VarintOp(len, val) {\r\n this.len = len;\r\n this.next = undefined;\r\n this.val = val;\r\n}\r\n\r\nVarintOp.prototype = Object.create(Op.prototype);\r\nVarintOp.prototype.fn = writeVarint32;\r\n\r\n/**\r\n * Writes an unsigned 32 bit value as a varint.\r\n * @param {number} value Value to write\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.uint32 = function write_uint32(value) {\r\n // here, the call to this.push has been inlined and a varint specific Op subclass is used.\r\n // uint32 is by far the most frequently used operation and benefits significantly from this.\r\n this.len += (this.tail = this.tail.next = new VarintOp(\r\n (value = value >>> 0)\r\n < 128 ? 1\r\n : value < 16384 ? 2\r\n : value < 2097152 ? 3\r\n : value < 268435456 ? 4\r\n : 5,\r\n value)).len;\r\n return this;\r\n};\r\n\r\n/**\r\n * Writes a signed 32 bit value as a varint.\r\n * @function\r\n * @param {number} value Value to write\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.int32 = function write_int32(value) {\r\n return value < 0\r\n ? this._push(writeVarint64, 10, LongBits.fromNumber(value)) // 10 bytes per spec\r\n : this.uint32(value);\r\n};\r\n\r\n/**\r\n * Writes a 32 bit value as a varint, zig-zag encoded.\r\n * @param {number} value Value to write\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.sint32 = function write_sint32(value) {\r\n return this.uint32((value << 1 ^ value >> 31) >>> 0);\r\n};\r\n\r\nfunction writeVarint64(val, buf, pos) {\r\n while (val.hi) {\r\n buf[pos++] = val.lo & 127 | 128;\r\n val.lo = (val.lo >>> 7 | val.hi << 25) >>> 0;\r\n val.hi >>>= 7;\r\n }\r\n while (val.lo > 127) {\r\n buf[pos++] = val.lo & 127 | 128;\r\n val.lo = val.lo >>> 7;\r\n }\r\n buf[pos++] = val.lo;\r\n}\r\n\r\n/**\r\n * Writes an unsigned 64 bit value as a varint.\r\n * @param {Long|number|string} value Value to write\r\n * @returns {Writer} `this`\r\n * @throws {TypeError} If `value` is a string and no long library is present.\r\n */\r\nWriter.prototype.uint64 = function write_uint64(value) {\r\n var bits = LongBits.from(value);\r\n return this._push(writeVarint64, bits.length(), bits);\r\n};\r\n\r\n/**\r\n * Writes a signed 64 bit value as a varint.\r\n * @function\r\n * @param {Long|number|string} value Value to write\r\n * @returns {Writer} `this`\r\n * @throws {TypeError} If `value` is a string and no long library is present.\r\n */\r\nWriter.prototype.int64 = Writer.prototype.uint64;\r\n\r\n/**\r\n * Writes a signed 64 bit value as a varint, zig-zag encoded.\r\n * @param {Long|number|string} value Value to write\r\n * @returns {Writer} `this`\r\n * @throws {TypeError} If `value` is a string and no long library is present.\r\n */\r\nWriter.prototype.sint64 = function write_sint64(value) {\r\n var bits = LongBits.from(value).zzEncode();\r\n return this._push(writeVarint64, bits.length(), bits);\r\n};\r\n\r\n/**\r\n * Writes a boolish value as a varint.\r\n * @param {boolean} value Value to write\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.bool = function write_bool(value) {\r\n return this._push(writeByte, 1, value ? 1 : 0);\r\n};\r\n\r\nfunction writeFixed32(val, buf, pos) {\r\n buf[pos ] = val & 255;\r\n buf[pos + 1] = val >>> 8 & 255;\r\n buf[pos + 2] = val >>> 16 & 255;\r\n buf[pos + 3] = val >>> 24;\r\n}\r\n\r\n/**\r\n * Writes an unsigned 32 bit value as fixed 32 bits.\r\n * @param {number} value Value to write\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.fixed32 = function write_fixed32(value) {\r\n return this._push(writeFixed32, 4, value >>> 0);\r\n};\r\n\r\n/**\r\n * Writes a signed 32 bit value as fixed 32 bits.\r\n * @function\r\n * @param {number} value Value to write\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.sfixed32 = Writer.prototype.fixed32;\r\n\r\n/**\r\n * Writes an unsigned 64 bit value as fixed 64 bits.\r\n * @param {Long|number|string} value Value to write\r\n * @returns {Writer} `this`\r\n * @throws {TypeError} If `value` is a string and no long library is present.\r\n */\r\nWriter.prototype.fixed64 = function write_fixed64(value) {\r\n var bits = LongBits.from(value);\r\n return this._push(writeFixed32, 4, bits.lo)._push(writeFixed32, 4, bits.hi);\r\n};\r\n\r\n/**\r\n * Writes a signed 64 bit value as fixed 64 bits.\r\n * @function\r\n * @param {Long|number|string} value Value to write\r\n * @returns {Writer} `this`\r\n * @throws {TypeError} If `value` is a string and no long library is present.\r\n */\r\nWriter.prototype.sfixed64 = Writer.prototype.fixed64;\r\n\r\n/**\r\n * Writes a float (32 bit).\r\n * @function\r\n * @param {number} value Value to write\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.float = function write_float(value) {\r\n return this._push(util.float.writeFloatLE, 4, value);\r\n};\r\n\r\n/**\r\n * Writes a double (64 bit float).\r\n * @function\r\n * @param {number} value Value to write\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.double = function write_double(value) {\r\n return this._push(util.float.writeDoubleLE, 8, value);\r\n};\r\n\r\nvar writeBytes = util.Array.prototype.set\r\n ? function writeBytes_set(val, buf, pos) {\r\n buf.set(val, pos); // also works for plain array values\r\n }\r\n /* istanbul ignore next */\r\n : function writeBytes_for(val, buf, pos) {\r\n for (var i = 0; i < val.length; ++i)\r\n buf[pos + i] = val[i];\r\n };\r\n\r\n/**\r\n * Writes a sequence of bytes.\r\n * @param {Uint8Array|string} value Buffer or base64 encoded string to write\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.bytes = function write_bytes(value) {\r\n var len = value.length >>> 0;\r\n if (!len)\r\n return this._push(writeByte, 1, 0);\r\n if (util.isString(value)) {\r\n var buf = Writer.alloc(len = base64.length(value));\r\n base64.decode(value, buf, 0);\r\n value = buf;\r\n }\r\n return this.uint32(len)._push(writeBytes, len, value);\r\n};\r\n\r\n/**\r\n * Writes a string.\r\n * @param {string} value Value to write\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.string = function write_string(value) {\r\n var len = utf8.length(value);\r\n return len\r\n ? this.uint32(len)._push(utf8.write, len, value)\r\n : this._push(writeByte, 1, 0);\r\n};\r\n\r\n/**\r\n * Forks this writer's state by pushing it to a stack.\r\n * Calling {@link Writer#reset|reset} or {@link Writer#ldelim|ldelim} resets the writer to the previous state.\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.fork = function fork() {\r\n this.states = new State(this);\r\n this.head = this.tail = new Op(noop, 0, 0);\r\n this.len = 0;\r\n return this;\r\n};\r\n\r\n/**\r\n * Resets this instance to the last state.\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.reset = function reset() {\r\n if (this.states) {\r\n this.head = this.states.head;\r\n this.tail = this.states.tail;\r\n this.len = this.states.len;\r\n this.states = this.states.next;\r\n } else {\r\n this.head = this.tail = new Op(noop, 0, 0);\r\n this.len = 0;\r\n }\r\n return this;\r\n};\r\n\r\n/**\r\n * Resets to the last state and appends the fork state's current write length as a varint followed by its operations.\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.ldelim = function ldelim() {\r\n var head = this.head,\r\n tail = this.tail,\r\n len = this.len;\r\n this.reset().uint32(len);\r\n if (len) {\r\n this.tail.next = head.next; // skip noop\r\n this.tail = tail;\r\n this.len += len;\r\n }\r\n return this;\r\n};\r\n\r\n/**\r\n * Finishes the write operation.\r\n * @returns {Uint8Array} Finished buffer\r\n */\r\nWriter.prototype.finish = function finish() {\r\n var head = this.head.next, // skip noop\r\n buf = this.constructor.alloc(this.len),\r\n pos = 0;\r\n while (head) {\r\n head.fn(head.val, buf, pos);\r\n pos += head.len;\r\n head = head.next;\r\n }\r\n // this.head = this.tail = null;\r\n return buf;\r\n};\r\n\r\nWriter._configure = function(BufferWriter_) {\r\n BufferWriter = BufferWriter_;\r\n Writer.create = create();\r\n BufferWriter._configure();\r\n};\r\n","\"use strict\";\r\nmodule.exports = BufferWriter;\r\n\r\n// extends Writer\r\nvar Writer = require(\"./writer\");\r\n(BufferWriter.prototype = Object.create(Writer.prototype)).constructor = BufferWriter;\r\n\r\nvar util = require(\"./util/minimal\");\r\n\r\n/**\r\n * Constructs a new buffer writer instance.\r\n * @classdesc Wire format writer using node buffers.\r\n * @extends Writer\r\n * @constructor\r\n */\r\nfunction BufferWriter() {\r\n Writer.call(this);\r\n}\r\n\r\nBufferWriter._configure = function () {\r\n /**\r\n * Allocates a buffer of the specified size.\r\n * @function\r\n * @param {number} size Buffer size\r\n * @returns {Buffer} Buffer\r\n */\r\n BufferWriter.alloc = util._Buffer_allocUnsafe;\r\n\r\n BufferWriter.writeBytesBuffer = util.Buffer && util.Buffer.prototype instanceof Uint8Array && util.Buffer.prototype.set.name === \"set\"\r\n ? function writeBytesBuffer_set(val, buf, pos) {\r\n buf.set(val, pos); // faster than copy (requires node >= 4 where Buffers extend Uint8Array and set is properly inherited)\r\n // also works for plain array values\r\n }\r\n /* istanbul ignore next */\r\n : function writeBytesBuffer_copy(val, buf, pos) {\r\n if (val.copy) // Buffer values\r\n val.copy(buf, pos, 0, val.length);\r\n else for (var i = 0; i < val.length;) // plain array values\r\n buf[pos++] = val[i++];\r\n };\r\n};\r\n\r\n\r\n/**\r\n * @override\r\n */\r\nBufferWriter.prototype.bytes = function write_bytes_buffer(value) {\r\n if (util.isString(value))\r\n value = util._Buffer_from(value, \"base64\");\r\n var len = value.length >>> 0;\r\n this.uint32(len);\r\n if (len)\r\n this._push(BufferWriter.writeBytesBuffer, len, value);\r\n return this;\r\n};\r\n\r\nfunction writeStringBuffer(val, buf, pos) {\r\n if (val.length < 40) // plain js is faster for short strings (probably due to redundant assertions)\r\n util.utf8.write(val, buf, pos);\r\n else if (buf.utf8Write)\r\n buf.utf8Write(val, pos);\r\n else\r\n buf.write(val, pos);\r\n}\r\n\r\n/**\r\n * @override\r\n */\r\nBufferWriter.prototype.string = function write_string_buffer(value) {\r\n var len = util.Buffer.byteLength(value);\r\n this.uint32(len);\r\n if (len)\r\n this._push(writeStringBuffer, len, value);\r\n return this;\r\n};\r\n\r\n\r\n/**\r\n * Finishes the write operation.\r\n * @name BufferWriter#finish\r\n * @function\r\n * @returns {Buffer} Finished buffer\r\n */\r\n\r\nBufferWriter._configure();\r\n","/*!\n * MIT License\n * \n * Copyright (c) 2017-2022 Peculiar Ventures, LLC\n * \n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n * \n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n * \n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n * \n */\n\n'use strict';\n\nconst ARRAY_BUFFER_NAME = \"[object ArrayBuffer]\";\nclass BufferSourceConverter {\n static isArrayBuffer(data) {\n return Object.prototype.toString.call(data) === ARRAY_BUFFER_NAME;\n }\n static toArrayBuffer(data) {\n if (this.isArrayBuffer(data)) {\n return data;\n }\n if (data.byteLength === data.buffer.byteLength) {\n return data.buffer;\n }\n if (data.byteOffset === 0 && data.byteLength === data.buffer.byteLength) {\n return data.buffer;\n }\n return this.toUint8Array(data.buffer)\n .slice(data.byteOffset, data.byteOffset + data.byteLength)\n .buffer;\n }\n static toUint8Array(data) {\n return this.toView(data, Uint8Array);\n }\n static toView(data, type) {\n if (data.constructor === type) {\n return data;\n }\n if (this.isArrayBuffer(data)) {\n return new type(data);\n }\n if (this.isArrayBufferView(data)) {\n return new type(data.buffer, data.byteOffset, data.byteLength);\n }\n throw new TypeError(\"The provided value is not of type '(ArrayBuffer or ArrayBufferView)'\");\n }\n static isBufferSource(data) {\n return this.isArrayBufferView(data)\n || this.isArrayBuffer(data);\n }\n static isArrayBufferView(data) {\n return ArrayBuffer.isView(data)\n || (data && this.isArrayBuffer(data.buffer));\n }\n static isEqual(a, b) {\n const aView = BufferSourceConverter.toUint8Array(a);\n const bView = BufferSourceConverter.toUint8Array(b);\n if (aView.length !== bView.byteLength) {\n return false;\n }\n for (let i = 0; i < aView.length; i++) {\n if (aView[i] !== bView[i]) {\n return false;\n }\n }\n return true;\n }\n static concat(...args) {\n let buffers;\n if (Array.isArray(args[0]) && !(args[1] instanceof Function)) {\n buffers = args[0];\n }\n else if (Array.isArray(args[0]) && args[1] instanceof Function) {\n buffers = args[0];\n }\n else {\n if (args[args.length - 1] instanceof Function) {\n buffers = args.slice(0, args.length - 1);\n }\n else {\n buffers = args;\n }\n }\n let size = 0;\n for (const buffer of buffers) {\n size += buffer.byteLength;\n }\n const res = new Uint8Array(size);\n let offset = 0;\n for (const buffer of buffers) {\n const view = this.toUint8Array(buffer);\n res.set(view, offset);\n offset += view.length;\n }\n if (args[args.length - 1] instanceof Function) {\n return this.toView(res, args[args.length - 1]);\n }\n return res.buffer;\n }\n}\n\nconst STRING_TYPE = \"string\";\nconst HEX_REGEX = /^[0-9a-f]+$/i;\nconst BASE64_REGEX = /^(?:[A-Za-z0-9+/]{4})*(?:[A-Za-z0-9+/]{2}==|[A-Za-z0-9+/]{3}=)?$/;\nconst BASE64URL_REGEX = /^[a-zA-Z0-9-_]+$/;\nclass Utf8Converter {\n static fromString(text) {\n const s = unescape(encodeURIComponent(text));\n const uintArray = new Uint8Array(s.length);\n for (let i = 0; i < s.length; i++) {\n uintArray[i] = s.charCodeAt(i);\n }\n return uintArray.buffer;\n }\n static toString(buffer) {\n const buf = BufferSourceConverter.toUint8Array(buffer);\n let encodedString = \"\";\n for (let i = 0; i < buf.length; i++) {\n encodedString += String.fromCharCode(buf[i]);\n }\n const decodedString = decodeURIComponent(escape(encodedString));\n return decodedString;\n }\n}\nclass Utf16Converter {\n static toString(buffer, littleEndian = false) {\n const arrayBuffer = BufferSourceConverter.toArrayBuffer(buffer);\n const dataView = new DataView(arrayBuffer);\n let res = \"\";\n for (let i = 0; i < arrayBuffer.byteLength; i += 2) {\n const code = dataView.getUint16(i, littleEndian);\n res += String.fromCharCode(code);\n }\n return res;\n }\n static fromString(text, littleEndian = false) {\n const res = new ArrayBuffer(text.length * 2);\n const dataView = new DataView(res);\n for (let i = 0; i < text.length; i++) {\n dataView.setUint16(i * 2, text.charCodeAt(i), littleEndian);\n }\n return res;\n }\n}\nclass Convert {\n static isHex(data) {\n return typeof data === STRING_TYPE\n && HEX_REGEX.test(data);\n }\n static isBase64(data) {\n return typeof data === STRING_TYPE\n && BASE64_REGEX.test(data);\n }\n static isBase64Url(data) {\n return typeof data === STRING_TYPE\n && BASE64URL_REGEX.test(data);\n }\n static ToString(buffer, enc = \"utf8\") {\n const buf = BufferSourceConverter.toUint8Array(buffer);\n switch (enc.toLowerCase()) {\n case \"utf8\":\n return this.ToUtf8String(buf);\n case \"binary\":\n return this.ToBinary(buf);\n case \"hex\":\n return this.ToHex(buf);\n case \"base64\":\n return this.ToBase64(buf);\n case \"base64url\":\n return this.ToBase64Url(buf);\n case \"utf16le\":\n return Utf16Converter.toString(buf, true);\n case \"utf16\":\n case \"utf16be\":\n return Utf16Converter.toString(buf);\n default:\n throw new Error(`Unknown type of encoding '${enc}'`);\n }\n }\n static FromString(str, enc = \"utf8\") {\n if (!str) {\n return new ArrayBuffer(0);\n }\n switch (enc.toLowerCase()) {\n case \"utf8\":\n return this.FromUtf8String(str);\n case \"binary\":\n return this.FromBinary(str);\n case \"hex\":\n return this.FromHex(str);\n case \"base64\":\n return this.FromBase64(str);\n case \"base64url\":\n return this.FromBase64Url(str);\n case \"utf16le\":\n return Utf16Converter.fromString(str, true);\n case \"utf16\":\n case \"utf16be\":\n return Utf16Converter.fromString(str);\n default:\n throw new Error(`Unknown type of encoding '${enc}'`);\n }\n }\n static ToBase64(buffer) {\n const buf = BufferSourceConverter.toUint8Array(buffer);\n if (typeof btoa !== \"undefined\") {\n const binary = this.ToString(buf, \"binary\");\n return btoa(binary);\n }\n else {\n return Buffer.from(buf).toString(\"base64\");\n }\n }\n static FromBase64(base64) {\n const formatted = this.formatString(base64);\n if (!formatted) {\n return new ArrayBuffer(0);\n }\n if (!Convert.isBase64(formatted)) {\n throw new TypeError(\"Argument 'base64Text' is not Base64 encoded\");\n }\n if (typeof atob !== \"undefined\") {\n return this.FromBinary(atob(formatted));\n }\n else {\n return new Uint8Array(Buffer.from(formatted, \"base64\")).buffer;\n }\n }\n static FromBase64Url(base64url) {\n const formatted = this.formatString(base64url);\n if (!formatted) {\n return new ArrayBuffer(0);\n }\n if (!Convert.isBase64Url(formatted)) {\n throw new TypeError(\"Argument 'base64url' is not Base64Url encoded\");\n }\n return this.FromBase64(this.Base64Padding(formatted.replace(/\\-/g, \"+\").replace(/\\_/g, \"/\")));\n }\n static ToBase64Url(data) {\n return this.ToBase64(data).replace(/\\+/g, \"-\").replace(/\\//g, \"_\").replace(/\\=/g, \"\");\n }\n static FromUtf8String(text, encoding = Convert.DEFAULT_UTF8_ENCODING) {\n switch (encoding) {\n case \"ascii\":\n return this.FromBinary(text);\n case \"utf8\":\n return Utf8Converter.fromString(text);\n case \"utf16\":\n case \"utf16be\":\n return Utf16Converter.fromString(text);\n case \"utf16le\":\n case \"usc2\":\n return Utf16Converter.fromString(text, true);\n default:\n throw new Error(`Unknown type of encoding '${encoding}'`);\n }\n }\n static ToUtf8String(buffer, encoding = Convert.DEFAULT_UTF8_ENCODING) {\n switch (encoding) {\n case \"ascii\":\n return this.ToBinary(buffer);\n case \"utf8\":\n return Utf8Converter.toString(buffer);\n case \"utf16\":\n case \"utf16be\":\n return Utf16Converter.toString(buffer);\n case \"utf16le\":\n case \"usc2\":\n return Utf16Converter.toString(buffer, true);\n default:\n throw new Error(`Unknown type of encoding '${encoding}'`);\n }\n }\n static FromBinary(text) {\n const stringLength = text.length;\n const resultView = new Uint8Array(stringLength);\n for (let i = 0; i < stringLength; i++) {\n resultView[i] = text.charCodeAt(i);\n }\n return resultView.buffer;\n }\n static ToBinary(buffer) {\n const buf = BufferSourceConverter.toUint8Array(buffer);\n let res = \"\";\n for (let i = 0; i < buf.length; i++) {\n res += String.fromCharCode(buf[i]);\n }\n return res;\n }\n static ToHex(buffer) {\n const buf = BufferSourceConverter.toUint8Array(buffer);\n let result = \"\";\n const len = buf.length;\n for (let i = 0; i < len; i++) {\n const byte = buf[i];\n if (byte < 16) {\n result += \"0\";\n }\n result += byte.toString(16);\n }\n return result;\n }\n static FromHex(hexString) {\n let formatted = this.formatString(hexString);\n if (!formatted) {\n return new ArrayBuffer(0);\n }\n if (!Convert.isHex(formatted)) {\n throw new TypeError(\"Argument 'hexString' is not HEX encoded\");\n }\n if (formatted.length % 2) {\n formatted = `0${formatted}`;\n }\n const res = new Uint8Array(formatted.length / 2);\n for (let i = 0; i < formatted.length; i = i + 2) {\n const c = formatted.slice(i, i + 2);\n res[i / 2] = parseInt(c, 16);\n }\n return res.buffer;\n }\n static ToUtf16String(buffer, littleEndian = false) {\n return Utf16Converter.toString(buffer, littleEndian);\n }\n static FromUtf16String(text, littleEndian = false) {\n return Utf16Converter.fromString(text, littleEndian);\n }\n static Base64Padding(base64) {\n const padCount = 4 - (base64.length % 4);\n if (padCount < 4) {\n for (let i = 0; i < padCount; i++) {\n base64 += \"=\";\n }\n }\n return base64;\n }\n static formatString(data) {\n return (data === null || data === void 0 ? void 0 : data.replace(/[\\n\\r\\t ]/g, \"\")) || \"\";\n }\n}\nConvert.DEFAULT_UTF8_ENCODING = \"utf8\";\n\nfunction assign(target, ...sources) {\n const res = arguments[0];\n for (let i = 1; i < arguments.length; i++) {\n const obj = arguments[i];\n for (const prop in obj) {\n res[prop] = obj[prop];\n }\n }\n return res;\n}\nfunction combine(...buf) {\n const totalByteLength = buf.map((item) => item.byteLength).reduce((prev, cur) => prev + cur);\n const res = new Uint8Array(totalByteLength);\n let currentPos = 0;\n buf.map((item) => new Uint8Array(item)).forEach((arr) => {\n for (const item2 of arr) {\n res[currentPos++] = item2;\n }\n });\n return res.buffer;\n}\nfunction isEqual(bytes1, bytes2) {\n if (!(bytes1 && bytes2)) {\n return false;\n }\n if (bytes1.byteLength !== bytes2.byteLength) {\n return false;\n }\n const b1 = new Uint8Array(bytes1);\n const b2 = new Uint8Array(bytes2);\n for (let i = 0; i < bytes1.byteLength; i++) {\n if (b1[i] !== b2[i]) {\n return false;\n }\n }\n return true;\n}\n\nexports.BufferSourceConverter = BufferSourceConverter;\nexports.Convert = Convert;\nexports.assign = assign;\nexports.combine = combine;\nexports.isEqual = isEqual;\n","// The module cache\nvar __webpack_module_cache__ = {};\n\n// The require function\nfunction __webpack_require__(moduleId) {\n\t// Check if module is in cache\n\tvar cachedModule = __webpack_module_cache__[moduleId];\n\tif (cachedModule !== undefined) {\n\t\treturn cachedModule.exports;\n\t}\n\t// Create a new module (and put it into the cache)\n\tvar module = __webpack_module_cache__[moduleId] = {\n\t\t// no module.id needed\n\t\t// no module.loaded needed\n\t\texports: {}\n\t};\n\n\t// Execute the module function\n\t__webpack_modules__[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n\t// Return the exports of the module\n\treturn module.exports;\n}\n\n","var getProto = Object.getPrototypeOf ? (obj) => (Object.getPrototypeOf(obj)) : (obj) => (obj.__proto__);\nvar leafPrototypes;\n// create a fake namespace object\n// mode & 1: value is a module id, require it\n// mode & 2: merge all properties of value into the ns\n// mode & 4: return value when already ns object\n// mode & 16: return value when it's Promise-like\n// mode & 8|1: behave like require\n__webpack_require__.t = function(value, mode) {\n\tif(mode & 1) value = this(value);\n\tif(mode & 8) return value;\n\tif(typeof value === 'object' && value) {\n\t\tif((mode & 4) && value.__esModule) return value;\n\t\tif((mode & 16) && typeof value.then === 'function') return value;\n\t}\n\tvar ns = Object.create(null);\n\t__webpack_require__.r(ns);\n\tvar def = {};\n\tleafPrototypes = leafPrototypes || [null, getProto({}), getProto([]), getProto(getProto)];\n\tfor(var current = mode & 2 && value; typeof current == 'object' && !~leafPrototypes.indexOf(current); current = getProto(current)) {\n\t\tObject.getOwnPropertyNames(current).forEach((key) => (def[key] = () => (value[key])));\n\t}\n\tdef['default'] = () => (value);\n\t__webpack_require__.d(ns, def);\n\treturn ns;\n};","__webpack_require__.amdO = {};","// define getter functions for harmony exports\n__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n\t\t}\n\t}\n};","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","// define __esModule on exports\n__webpack_require__.r = (exports) => {\n\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n\t}\n\tObject.defineProperty(exports, '__esModule', { value: true });\n};","/**\n * Returns a `Uint8Array` of the requested size. Referenced memory will\n * be initialized to 0.\n */\nexport function alloc(size = 0) {\n return new Uint8Array(size);\n}\n/**\n * Where possible returns a Uint8Array of the requested size that references\n * uninitialized memory. Only use if you are certain you will immediately\n * overwrite every value in the returned `Uint8Array`.\n */\nexport function allocUnsafe(size = 0) {\n return new Uint8Array(size);\n}\n//# sourceMappingURL=alloc.js.map","/* eslint-disable no-fallthrough */\nimport { allocUnsafe } from 'uint8arrays/alloc';\nconst N1 = Math.pow(2, 7);\nconst N2 = Math.pow(2, 14);\nconst N3 = Math.pow(2, 21);\nconst N4 = Math.pow(2, 28);\nconst N5 = Math.pow(2, 35);\nconst N6 = Math.pow(2, 42);\nconst N7 = Math.pow(2, 49);\n/** Most significant bit of a byte */\nconst MSB = 0x80;\n/** Rest of the bits in a byte */\nconst REST = 0x7f;\nexport function encodingLength(value) {\n if (value < N1) {\n return 1;\n }\n if (value < N2) {\n return 2;\n }\n if (value < N3) {\n return 3;\n }\n if (value < N4) {\n return 4;\n }\n if (value < N5) {\n return 5;\n }\n if (value < N6) {\n return 6;\n }\n if (value < N7) {\n return 7;\n }\n if (Number.MAX_SAFE_INTEGER != null && value > Number.MAX_SAFE_INTEGER) {\n throw new RangeError('Could not encode varint');\n }\n return 8;\n}\nexport function encodeUint8Array(value, buf, offset = 0) {\n switch (encodingLength(value)) {\n case 8: {\n buf[offset++] = (value & 0xFF) | MSB;\n value /= 128;\n }\n case 7: {\n buf[offset++] = (value & 0xFF) | MSB;\n value /= 128;\n }\n case 6: {\n buf[offset++] = (value & 0xFF) | MSB;\n value /= 128;\n }\n case 5: {\n buf[offset++] = (value & 0xFF) | MSB;\n value /= 128;\n }\n case 4: {\n buf[offset++] = (value & 0xFF) | MSB;\n value >>>= 7;\n }\n case 3: {\n buf[offset++] = (value & 0xFF) | MSB;\n value >>>= 7;\n }\n case 2: {\n buf[offset++] = (value & 0xFF) | MSB;\n value >>>= 7;\n }\n case 1: {\n buf[offset++] = (value & 0xFF);\n value >>>= 7;\n break;\n }\n default: throw new Error('unreachable');\n }\n return buf;\n}\nexport function encodeUint8ArrayList(value, buf, offset = 0) {\n switch (encodingLength(value)) {\n case 8: {\n buf.set(offset++, (value & 0xFF) | MSB);\n value /= 128;\n }\n case 7: {\n buf.set(offset++, (value & 0xFF) | MSB);\n value /= 128;\n }\n case 6: {\n buf.set(offset++, (value & 0xFF) | MSB);\n value /= 128;\n }\n case 5: {\n buf.set(offset++, (value & 0xFF) | MSB);\n value /= 128;\n }\n case 4: {\n buf.set(offset++, (value & 0xFF) | MSB);\n value >>>= 7;\n }\n case 3: {\n buf.set(offset++, (value & 0xFF) | MSB);\n value >>>= 7;\n }\n case 2: {\n buf.set(offset++, (value & 0xFF) | MSB);\n value >>>= 7;\n }\n case 1: {\n buf.set(offset++, (value & 0xFF));\n value >>>= 7;\n break;\n }\n default: throw new Error('unreachable');\n }\n return buf;\n}\nexport function decodeUint8Array(buf, offset) {\n let b = buf[offset];\n let res = 0;\n res += b & REST;\n if (b < MSB) {\n return res;\n }\n b = buf[offset + 1];\n res += (b & REST) << 7;\n if (b < MSB) {\n return res;\n }\n b = buf[offset + 2];\n res += (b & REST) << 14;\n if (b < MSB) {\n return res;\n }\n b = buf[offset + 3];\n res += (b & REST) << 21;\n if (b < MSB) {\n return res;\n }\n b = buf[offset + 4];\n res += (b & REST) * N4;\n if (b < MSB) {\n return res;\n }\n b = buf[offset + 5];\n res += (b & REST) * N5;\n if (b < MSB) {\n return res;\n }\n b = buf[offset + 6];\n res += (b & REST) * N6;\n if (b < MSB) {\n return res;\n }\n b = buf[offset + 7];\n res += (b & REST) * N7;\n if (b < MSB) {\n return res;\n }\n throw new RangeError('Could not decode varint');\n}\nexport function decodeUint8ArrayList(buf, offset) {\n let b = buf.get(offset);\n let res = 0;\n res += b & REST;\n if (b < MSB) {\n return res;\n }\n b = buf.get(offset + 1);\n res += (b & REST) << 7;\n if (b < MSB) {\n return res;\n }\n b = buf.get(offset + 2);\n res += (b & REST) << 14;\n if (b < MSB) {\n return res;\n }\n b = buf.get(offset + 3);\n res += (b & REST) << 21;\n if (b < MSB) {\n return res;\n }\n b = buf.get(offset + 4);\n res += (b & REST) * N4;\n if (b < MSB) {\n return res;\n }\n b = buf.get(offset + 5);\n res += (b & REST) * N5;\n if (b < MSB) {\n return res;\n }\n b = buf.get(offset + 6);\n res += (b & REST) * N6;\n if (b < MSB) {\n return res;\n }\n b = buf.get(offset + 7);\n res += (b & REST) * N7;\n if (b < MSB) {\n return res;\n }\n throw new RangeError('Could not decode varint');\n}\nexport function encode(value, buf, offset = 0) {\n if (buf == null) {\n buf = allocUnsafe(encodingLength(value));\n }\n if (buf instanceof Uint8Array) {\n return encodeUint8Array(value, buf, offset);\n }\n else {\n return encodeUint8ArrayList(value, buf, offset);\n }\n}\nexport function decode(buf, offset = 0) {\n if (buf instanceof Uint8Array) {\n return decodeUint8Array(buf, offset);\n }\n else {\n return decodeUint8ArrayList(buf, offset);\n }\n}\n//# sourceMappingURL=index.js.map","const f32 = new Float32Array([-0]);\nconst f8b = new Uint8Array(f32.buffer);\n/**\n * Writes a 32 bit float to a buffer using little endian byte order\n */\nexport function writeFloatLE(val, buf, pos) {\n f32[0] = val;\n buf[pos] = f8b[0];\n buf[pos + 1] = f8b[1];\n buf[pos + 2] = f8b[2];\n buf[pos + 3] = f8b[3];\n}\n/**\n * Writes a 32 bit float to a buffer using big endian byte order\n */\nexport function writeFloatBE(val, buf, pos) {\n f32[0] = val;\n buf[pos] = f8b[3];\n buf[pos + 1] = f8b[2];\n buf[pos + 2] = f8b[1];\n buf[pos + 3] = f8b[0];\n}\n/**\n * Reads a 32 bit float from a buffer using little endian byte order\n */\nexport function readFloatLE(buf, pos) {\n f8b[0] = buf[pos];\n f8b[1] = buf[pos + 1];\n f8b[2] = buf[pos + 2];\n f8b[3] = buf[pos + 3];\n return f32[0];\n}\n/**\n * Reads a 32 bit float from a buffer using big endian byte order\n */\nexport function readFloatBE(buf, pos) {\n f8b[3] = buf[pos];\n f8b[2] = buf[pos + 1];\n f8b[1] = buf[pos + 2];\n f8b[0] = buf[pos + 3];\n return f32[0];\n}\nconst f64 = new Float64Array([-0]);\nconst d8b = new Uint8Array(f64.buffer);\n/**\n * Writes a 64 bit double to a buffer using little endian byte order\n */\nexport function writeDoubleLE(val, buf, pos) {\n f64[0] = val;\n buf[pos] = d8b[0];\n buf[pos + 1] = d8b[1];\n buf[pos + 2] = d8b[2];\n buf[pos + 3] = d8b[3];\n buf[pos + 4] = d8b[4];\n buf[pos + 5] = d8b[5];\n buf[pos + 6] = d8b[6];\n buf[pos + 7] = d8b[7];\n}\n/**\n * Writes a 64 bit double to a buffer using big endian byte order\n */\nexport function writeDoubleBE(val, buf, pos) {\n f64[0] = val;\n buf[pos] = d8b[7];\n buf[pos + 1] = d8b[6];\n buf[pos + 2] = d8b[5];\n buf[pos + 3] = d8b[4];\n buf[pos + 4] = d8b[3];\n buf[pos + 5] = d8b[2];\n buf[pos + 6] = d8b[1];\n buf[pos + 7] = d8b[0];\n}\n/**\n * Reads a 64 bit double from a buffer using little endian byte order\n */\nexport function readDoubleLE(buf, pos) {\n d8b[0] = buf[pos];\n d8b[1] = buf[pos + 1];\n d8b[2] = buf[pos + 2];\n d8b[3] = buf[pos + 3];\n d8b[4] = buf[pos + 4];\n d8b[5] = buf[pos + 5];\n d8b[6] = buf[pos + 6];\n d8b[7] = buf[pos + 7];\n return f64[0];\n}\n/**\n * Reads a 64 bit double from a buffer using big endian byte order\n */\nexport function readDoubleBE(buf, pos) {\n d8b[7] = buf[pos];\n d8b[6] = buf[pos + 1];\n d8b[5] = buf[pos + 2];\n d8b[4] = buf[pos + 3];\n d8b[3] = buf[pos + 4];\n d8b[2] = buf[pos + 5];\n d8b[1] = buf[pos + 6];\n d8b[0] = buf[pos + 7];\n return f64[0];\n}\n//# sourceMappingURL=float.js.map","// the largest BigInt we can safely downcast to a Number\nconst MAX_SAFE_NUMBER_INTEGER = BigInt(Number.MAX_SAFE_INTEGER);\nconst MIN_SAFE_NUMBER_INTEGER = BigInt(Number.MIN_SAFE_INTEGER);\n/**\n * Constructs new long bits.\n *\n * @classdesc Helper class for working with the low and high bits of a 64 bit value.\n * @memberof util\n * @function Object() { [native code] }\n * @param {number} lo - Low 32 bits, unsigned\n * @param {number} hi - High 32 bits, unsigned\n */\nexport class LongBits {\n lo;\n hi;\n constructor(lo, hi) {\n // note that the casts below are theoretically unnecessary as of today, but older statically\n // generated converter code might still call the ctor with signed 32bits. kept for compat.\n /**\n * Low bits\n */\n this.lo = lo | 0;\n /**\n * High bits\n */\n this.hi = hi | 0;\n }\n /**\n * Converts this long bits to a possibly unsafe JavaScript number\n */\n toNumber(unsigned = false) {\n if (!unsigned && (this.hi >>> 31) > 0) {\n const lo = ~this.lo + 1 >>> 0;\n let hi = ~this.hi >>> 0;\n if (lo === 0) {\n hi = hi + 1 >>> 0;\n }\n return -(lo + hi * 4294967296);\n }\n return this.lo + this.hi * 4294967296;\n }\n /**\n * Converts this long bits to a bigint\n */\n toBigInt(unsigned = false) {\n if (unsigned) {\n return BigInt(this.lo >>> 0) + (BigInt(this.hi >>> 0) << 32n);\n }\n if ((this.hi >>> 31) !== 0) {\n const lo = ~this.lo + 1 >>> 0;\n let hi = ~this.hi >>> 0;\n if (lo === 0) {\n hi = hi + 1 >>> 0;\n }\n return -(BigInt(lo) + (BigInt(hi) << 32n));\n }\n return BigInt(this.lo >>> 0) + (BigInt(this.hi >>> 0) << 32n);\n }\n /**\n * Converts this long bits to a string\n */\n toString(unsigned = false) {\n return this.toBigInt(unsigned).toString();\n }\n /**\n * Zig-zag encodes this long bits\n */\n zzEncode() {\n const mask = this.hi >> 31;\n this.hi = ((this.hi << 1 | this.lo >>> 31) ^ mask) >>> 0;\n this.lo = (this.lo << 1 ^ mask) >>> 0;\n return this;\n }\n /**\n * Zig-zag decodes this long bits\n */\n zzDecode() {\n const mask = -(this.lo & 1);\n this.lo = ((this.lo >>> 1 | this.hi << 31) ^ mask) >>> 0;\n this.hi = (this.hi >>> 1 ^ mask) >>> 0;\n return this;\n }\n /**\n * Calculates the length of this longbits when encoded as a varint.\n */\n length() {\n const part0 = this.lo;\n const part1 = (this.lo >>> 28 | this.hi << 4) >>> 0;\n const part2 = this.hi >>> 24;\n return part2 === 0\n ? part1 === 0\n ? part0 < 16384\n ? part0 < 128 ? 1 : 2\n : part0 < 2097152 ? 3 : 4\n : part1 < 16384\n ? part1 < 128 ? 5 : 6\n : part1 < 2097152 ? 7 : 8\n : part2 < 128 ? 9 : 10;\n }\n /**\n * Constructs new long bits from the specified number\n */\n static fromBigInt(value) {\n if (value === 0n) {\n return zero;\n }\n if (value < MAX_SAFE_NUMBER_INTEGER && value > MIN_SAFE_NUMBER_INTEGER) {\n return this.fromNumber(Number(value));\n }\n const negative = value < 0n;\n if (negative) {\n value = -value;\n }\n let hi = value >> 32n;\n let lo = value - (hi << 32n);\n if (negative) {\n hi = ~hi | 0n;\n lo = ~lo | 0n;\n if (++lo > TWO_32) {\n lo = 0n;\n if (++hi > TWO_32) {\n hi = 0n;\n }\n }\n }\n return new LongBits(Number(lo), Number(hi));\n }\n /**\n * Constructs new long bits from the specified number\n */\n static fromNumber(value) {\n if (value === 0) {\n return zero;\n }\n const sign = value < 0;\n if (sign) {\n value = -value;\n }\n let lo = value >>> 0;\n let hi = (value - lo) / 4294967296 >>> 0;\n if (sign) {\n hi = ~hi >>> 0;\n lo = ~lo >>> 0;\n if (++lo > 4294967295) {\n lo = 0;\n if (++hi > 4294967295) {\n hi = 0;\n }\n }\n }\n return new LongBits(lo, hi);\n }\n /**\n * Constructs new long bits from a number, long or string\n */\n static from(value) {\n if (typeof value === 'number') {\n return LongBits.fromNumber(value);\n }\n if (typeof value === 'bigint') {\n return LongBits.fromBigInt(value);\n }\n if (typeof value === 'string') {\n return LongBits.fromBigInt(BigInt(value));\n }\n return value.low != null || value.high != null ? new LongBits(value.low >>> 0, value.high >>> 0) : zero;\n }\n}\nconst zero = new LongBits(0, 0);\nzero.toBigInt = function () { return 0n; };\nzero.zzEncode = zero.zzDecode = function () { return this; };\nzero.length = function () { return 1; };\nconst TWO_32 = 4294967296n;\n//# sourceMappingURL=longbits.js.map","/**\n * Calculates the UTF8 byte length of a string\n */\nexport function length(string) {\n let len = 0;\n let c = 0;\n for (let i = 0; i < string.length; ++i) {\n c = string.charCodeAt(i);\n if (c < 128) {\n len += 1;\n }\n else if (c < 2048) {\n len += 2;\n }\n else if ((c & 0xFC00) === 0xD800 && (string.charCodeAt(i + 1) & 0xFC00) === 0xDC00) {\n ++i;\n len += 4;\n }\n else {\n len += 3;\n }\n }\n return len;\n}\n/**\n * Reads UTF8 bytes as a string\n */\nexport function read(buffer, start, end) {\n const len = end - start;\n if (len < 1) {\n return '';\n }\n let parts;\n const chunk = [];\n let i = 0; // char offset\n let t; // temporary\n while (start < end) {\n t = buffer[start++];\n if (t < 128) {\n chunk[i++] = t;\n }\n else if (t > 191 && t < 224) {\n chunk[i++] = (t & 31) << 6 | buffer[start++] & 63;\n }\n else if (t > 239 && t < 365) {\n t = ((t & 7) << 18 | (buffer[start++] & 63) << 12 | (buffer[start++] & 63) << 6 | buffer[start++] & 63) - 0x10000;\n chunk[i++] = 0xD800 + (t >> 10);\n chunk[i++] = 0xDC00 + (t & 1023);\n }\n else {\n chunk[i++] = (t & 15) << 12 | (buffer[start++] & 63) << 6 | buffer[start++] & 63;\n }\n if (i > 8191) {\n (parts ?? (parts = [])).push(String.fromCharCode.apply(String, chunk));\n i = 0;\n }\n }\n if (parts != null) {\n if (i > 0) {\n parts.push(String.fromCharCode.apply(String, chunk.slice(0, i)));\n }\n return parts.join('');\n }\n return String.fromCharCode.apply(String, chunk.slice(0, i));\n}\n/**\n * Writes a string as UTF8 bytes\n */\nexport function write(string, buffer, offset) {\n const start = offset;\n let c1; // character 1\n let c2; // character 2\n for (let i = 0; i < string.length; ++i) {\n c1 = string.charCodeAt(i);\n if (c1 < 128) {\n buffer[offset++] = c1;\n }\n else if (c1 < 2048) {\n buffer[offset++] = c1 >> 6 | 192;\n buffer[offset++] = c1 & 63 | 128;\n }\n else if ((c1 & 0xFC00) === 0xD800 && ((c2 = string.charCodeAt(i + 1)) & 0xFC00) === 0xDC00) {\n c1 = 0x10000 + ((c1 & 0x03FF) << 10) + (c2 & 0x03FF);\n ++i;\n buffer[offset++] = c1 >> 18 | 240;\n buffer[offset++] = c1 >> 12 & 63 | 128;\n buffer[offset++] = c1 >> 6 & 63 | 128;\n buffer[offset++] = c1 & 63 | 128;\n }\n else {\n buffer[offset++] = c1 >> 12 | 224;\n buffer[offset++] = c1 >> 6 & 63 | 128;\n buffer[offset++] = c1 & 63 | 128;\n }\n }\n return offset - start;\n}\n//# sourceMappingURL=utf8.js.map","import { decodeUint8Array, encodingLength } from 'uint8-varint';\nimport { readFloatLE, readDoubleLE } from './float.js';\nimport { LongBits } from './longbits.js';\nimport * as utf8 from './utf8.js';\n/* istanbul ignore next */\nfunction indexOutOfRange(reader, writeLength) {\n return RangeError(`index out of range: ${reader.pos} + ${writeLength ?? 1} > ${reader.len}`);\n}\nfunction readFixed32End(buf, end) {\n return (buf[end - 4] |\n buf[end - 3] << 8 |\n buf[end - 2] << 16 |\n buf[end - 1] << 24) >>> 0;\n}\n/**\n * Constructs a new reader instance using the specified buffer.\n */\nexport class Uint8ArrayReader {\n buf;\n pos;\n len;\n _slice = Uint8Array.prototype.subarray;\n constructor(buffer) {\n /**\n * Read buffer\n */\n this.buf = buffer;\n /**\n * Read buffer position\n */\n this.pos = 0;\n /**\n * Read buffer length\n */\n this.len = buffer.length;\n }\n /**\n * Reads a varint as an unsigned 32 bit value\n */\n uint32() {\n let value = 4294967295;\n value = (this.buf[this.pos] & 127) >>> 0;\n if (this.buf[this.pos++] < 128)\n return value;\n value = (value | (this.buf[this.pos] & 127) << 7) >>> 0;\n if (this.buf[this.pos++] < 128)\n return value;\n value = (value | (this.buf[this.pos] & 127) << 14) >>> 0;\n if (this.buf[this.pos++] < 128)\n return value;\n value = (value | (this.buf[this.pos] & 127) << 21) >>> 0;\n if (this.buf[this.pos++] < 128)\n return value;\n value = (value | (this.buf[this.pos] & 15) << 28) >>> 0;\n if (this.buf[this.pos++] < 128)\n return value;\n if ((this.pos += 5) > this.len) {\n this.pos = this.len;\n throw indexOutOfRange(this, 10);\n }\n return value;\n }\n /**\n * Reads a varint as a signed 32 bit value\n */\n int32() {\n return this.uint32() | 0;\n }\n /**\n * Reads a zig-zag encoded varint as a signed 32 bit value\n */\n sint32() {\n const value = this.uint32();\n return value >>> 1 ^ -(value & 1) | 0;\n }\n /**\n * Reads a varint as a boolean\n */\n bool() {\n return this.uint32() !== 0;\n }\n /**\n * Reads fixed 32 bits as an unsigned 32 bit integer\n */\n fixed32() {\n if (this.pos + 4 > this.len) {\n throw indexOutOfRange(this, 4);\n }\n const res = readFixed32End(this.buf, this.pos += 4);\n return res;\n }\n /**\n * Reads fixed 32 bits as a signed 32 bit integer\n */\n sfixed32() {\n if (this.pos + 4 > this.len) {\n throw indexOutOfRange(this, 4);\n }\n const res = readFixed32End(this.buf, this.pos += 4) | 0;\n return res;\n }\n /**\n * Reads a float (32 bit) as a number\n */\n float() {\n if (this.pos + 4 > this.len) {\n throw indexOutOfRange(this, 4);\n }\n const value = readFloatLE(this.buf, this.pos);\n this.pos += 4;\n return value;\n }\n /**\n * Reads a double (64 bit float) as a number\n */\n double() {\n /* istanbul ignore if */\n if (this.pos + 8 > this.len) {\n throw indexOutOfRange(this, 4);\n }\n const value = readDoubleLE(this.buf, this.pos);\n this.pos += 8;\n return value;\n }\n /**\n * Reads a sequence of bytes preceded by its length as a varint\n */\n bytes() {\n const length = this.uint32();\n const start = this.pos;\n const end = this.pos + length;\n /* istanbul ignore if */\n if (end > this.len) {\n throw indexOutOfRange(this, length);\n }\n this.pos += length;\n return start === end // fix for IE 10/Win8 and others' subarray returning array of size 1\n ? new Uint8Array(0)\n : this.buf.subarray(start, end);\n }\n /**\n * Reads a string preceded by its byte length as a varint\n */\n string() {\n const bytes = this.bytes();\n return utf8.read(bytes, 0, bytes.length);\n }\n /**\n * Skips the specified number of bytes if specified, otherwise skips a varint\n */\n skip(length) {\n if (typeof length === 'number') {\n /* istanbul ignore if */\n if (this.pos + length > this.len) {\n throw indexOutOfRange(this, length);\n }\n this.pos += length;\n }\n else {\n do {\n /* istanbul ignore if */\n if (this.pos >= this.len) {\n throw indexOutOfRange(this);\n }\n } while ((this.buf[this.pos++] & 128) !== 0);\n }\n return this;\n }\n /**\n * Skips the next element of the specified wire type\n */\n skipType(wireType) {\n switch (wireType) {\n case 0:\n this.skip();\n break;\n case 1:\n this.skip(8);\n break;\n case 2:\n this.skip(this.uint32());\n break;\n case 3:\n while ((wireType = this.uint32() & 7) !== 4) {\n this.skipType(wireType);\n }\n break;\n case 5:\n this.skip(4);\n break;\n /* istanbul ignore next */\n default:\n throw Error(`invalid wire type ${wireType} at offset ${this.pos}`);\n }\n return this;\n }\n readLongVarint() {\n // tends to deopt with local vars for octet etc.\n const bits = new LongBits(0, 0);\n let i = 0;\n if (this.len - this.pos > 4) { // fast route (lo)\n for (; i < 4; ++i) {\n // 1st..4th\n bits.lo = (bits.lo | (this.buf[this.pos] & 127) << i * 7) >>> 0;\n if (this.buf[this.pos++] < 128) {\n return bits;\n }\n }\n // 5th\n bits.lo = (bits.lo | (this.buf[this.pos] & 127) << 28) >>> 0;\n bits.hi = (bits.hi | (this.buf[this.pos] & 127) >> 4) >>> 0;\n if (this.buf[this.pos++] < 128) {\n return bits;\n }\n i = 0;\n }\n else {\n for (; i < 3; ++i) {\n /* istanbul ignore if */\n if (this.pos >= this.len) {\n throw indexOutOfRange(this);\n }\n // 1st..3th\n bits.lo = (bits.lo | (this.buf[this.pos] & 127) << i * 7) >>> 0;\n if (this.buf[this.pos++] < 128) {\n return bits;\n }\n }\n // 4th\n bits.lo = (bits.lo | (this.buf[this.pos++] & 127) << i * 7) >>> 0;\n return bits;\n }\n if (this.len - this.pos > 4) { // fast route (hi)\n for (; i < 5; ++i) {\n // 6th..10th\n bits.hi = (bits.hi | (this.buf[this.pos] & 127) << i * 7 + 3) >>> 0;\n if (this.buf[this.pos++] < 128) {\n return bits;\n }\n }\n }\n else {\n for (; i < 5; ++i) {\n if (this.pos >= this.len) {\n throw indexOutOfRange(this);\n }\n // 6th..10th\n bits.hi = (bits.hi | (this.buf[this.pos] & 127) << i * 7 + 3) >>> 0;\n if (this.buf[this.pos++] < 128) {\n return bits;\n }\n }\n }\n throw Error('invalid varint encoding');\n }\n readFixed64() {\n if (this.pos + 8 > this.len) {\n throw indexOutOfRange(this, 8);\n }\n const lo = readFixed32End(this.buf, this.pos += 4);\n const hi = readFixed32End(this.buf, this.pos += 4);\n return new LongBits(lo, hi);\n }\n /**\n * Reads a varint as a signed 64 bit value\n */\n int64() {\n return this.readLongVarint().toBigInt();\n }\n /**\n * Reads a varint as a signed 64 bit value returned as a possibly unsafe\n * JavaScript number\n */\n int64Number() {\n return this.readLongVarint().toNumber();\n }\n /**\n * Reads a varint as a signed 64 bit value returned as a string\n */\n int64String() {\n return this.readLongVarint().toString();\n }\n /**\n * Reads a varint as an unsigned 64 bit value\n */\n uint64() {\n return this.readLongVarint().toBigInt(true);\n }\n /**\n * Reads a varint as an unsigned 64 bit value returned as a possibly unsafe\n * JavaScript number\n */\n uint64Number() {\n const value = decodeUint8Array(this.buf, this.pos);\n this.pos += encodingLength(value);\n return value;\n }\n /**\n * Reads a varint as an unsigned 64 bit value returned as a string\n */\n uint64String() {\n return this.readLongVarint().toString(true);\n }\n /**\n * Reads a zig-zag encoded varint as a signed 64 bit value\n */\n sint64() {\n return this.readLongVarint().zzDecode().toBigInt();\n }\n /**\n * Reads a zig-zag encoded varint as a signed 64 bit value returned as a\n * possibly unsafe JavaScript number\n */\n sint64Number() {\n return this.readLongVarint().zzDecode().toNumber();\n }\n /**\n * Reads a zig-zag encoded varint as a signed 64 bit value returned as a\n * string\n */\n sint64String() {\n return this.readLongVarint().zzDecode().toString();\n }\n /**\n * Reads fixed 64 bits\n */\n fixed64() {\n return this.readFixed64().toBigInt();\n }\n /**\n * Reads fixed 64 bits returned as a possibly unsafe JavaScript number\n */\n fixed64Number() {\n return this.readFixed64().toNumber();\n }\n /**\n * Reads fixed 64 bits returned as a string\n */\n fixed64String() {\n return this.readFixed64().toString();\n }\n /**\n * Reads zig-zag encoded fixed 64 bits\n */\n sfixed64() {\n return this.readFixed64().toBigInt();\n }\n /**\n * Reads zig-zag encoded fixed 64 bits returned as a possibly unsafe\n * JavaScript number\n */\n sfixed64Number() {\n return this.readFixed64().toNumber();\n }\n /**\n * Reads zig-zag encoded fixed 64 bits returned as a string\n */\n sfixed64String() {\n return this.readFixed64().toString();\n }\n}\nexport function createReader(buf) {\n return new Uint8ArrayReader(buf instanceof Uint8Array ? buf : buf.subarray());\n}\n//# sourceMappingURL=reader.js.map","import { createReader } from './utils/reader.js';\nexport function decodeMessage(buf, codec, opts) {\n const reader = createReader(buf);\n return codec.decode(reader, undefined, opts);\n}\n//# sourceMappingURL=decode.js.map","export const empty = new Uint8Array(0);\nexport function toHex(d) {\n return d.reduce((hex, byte) => hex + byte.toString(16).padStart(2, '0'), '');\n}\nexport function fromHex(hex) {\n const hexes = hex.match(/../g);\n return hexes != null ? new Uint8Array(hexes.map(b => parseInt(b, 16))) : empty;\n}\nexport function equals(aa, bb) {\n if (aa === bb)\n return true;\n if (aa.byteLength !== bb.byteLength) {\n return false;\n }\n for (let ii = 0; ii < aa.byteLength; ii++) {\n if (aa[ii] !== bb[ii]) {\n return false;\n }\n }\n return true;\n}\nexport function coerce(o) {\n if (o instanceof Uint8Array && o.constructor.name === 'Uint8Array')\n return o;\n if (o instanceof ArrayBuffer)\n return new Uint8Array(o);\n if (ArrayBuffer.isView(o)) {\n return new Uint8Array(o.buffer, o.byteOffset, o.byteLength);\n }\n throw new Error('Unknown type, must be binary type');\n}\nexport function isBinary(o) {\n return o instanceof ArrayBuffer || ArrayBuffer.isView(o);\n}\nexport function fromString(str) {\n return new TextEncoder().encode(str);\n}\nexport function toString(b) {\n return new TextDecoder().decode(b);\n}\n//# sourceMappingURL=bytes.js.map","/* eslint-disable */\n// base-x encoding / decoding\n// Copyright (c) 2018 base-x contributors\n// Copyright (c) 2014-2018 The Bitcoin Core developers (base58.cpp)\n// Distributed under the MIT software license, see the accompanying\n// file LICENSE or http://www.opensource.org/licenses/mit-license.php.\n/**\n * @param {string} ALPHABET\n * @param {any} name\n */\nfunction base(ALPHABET, name) {\n if (ALPHABET.length >= 255) {\n throw new TypeError('Alphabet too long');\n }\n var BASE_MAP = new Uint8Array(256);\n for (var j = 0; j < BASE_MAP.length; j++) {\n BASE_MAP[j] = 255;\n }\n for (var i = 0; i < ALPHABET.length; i++) {\n var x = ALPHABET.charAt(i);\n var xc = x.charCodeAt(0);\n if (BASE_MAP[xc] !== 255) {\n throw new TypeError(x + ' is ambiguous');\n }\n BASE_MAP[xc] = i;\n }\n var BASE = ALPHABET.length;\n var LEADER = ALPHABET.charAt(0);\n var FACTOR = Math.log(BASE) / Math.log(256); // log(BASE) / log(256), rounded up\n var iFACTOR = Math.log(256) / Math.log(BASE); // log(256) / log(BASE), rounded up\n /**\n * @param {any[] | Iterable} source\n */\n function encode(source) {\n // @ts-ignore\n if (source instanceof Uint8Array)\n ;\n else if (ArrayBuffer.isView(source)) {\n source = new Uint8Array(source.buffer, source.byteOffset, source.byteLength);\n }\n else if (Array.isArray(source)) {\n source = Uint8Array.from(source);\n }\n if (!(source instanceof Uint8Array)) {\n throw new TypeError('Expected Uint8Array');\n }\n if (source.length === 0) {\n return '';\n }\n // Skip & count leading zeroes.\n var zeroes = 0;\n var length = 0;\n var pbegin = 0;\n var pend = source.length;\n while (pbegin !== pend && source[pbegin] === 0) {\n pbegin++;\n zeroes++;\n }\n // Allocate enough space in big-endian base58 representation.\n var size = ((pend - pbegin) * iFACTOR + 1) >>> 0;\n var b58 = new Uint8Array(size);\n // Process the bytes.\n while (pbegin !== pend) {\n var carry = source[pbegin];\n // Apply \"b58 = b58 * 256 + ch\".\n var i = 0;\n for (var it1 = size - 1; (carry !== 0 || i < length) && (it1 !== -1); it1--, i++) {\n carry += (256 * b58[it1]) >>> 0;\n b58[it1] = (carry % BASE) >>> 0;\n carry = (carry / BASE) >>> 0;\n }\n if (carry !== 0) {\n throw new Error('Non-zero carry');\n }\n length = i;\n pbegin++;\n }\n // Skip leading zeroes in base58 result.\n var it2 = size - length;\n while (it2 !== size && b58[it2] === 0) {\n it2++;\n }\n // Translate the result into a string.\n var str = LEADER.repeat(zeroes);\n for (; it2 < size; ++it2) {\n str += ALPHABET.charAt(b58[it2]);\n }\n return str;\n }\n /**\n * @param {string | string[]} source\n */\n function decodeUnsafe(source) {\n if (typeof source !== 'string') {\n throw new TypeError('Expected String');\n }\n if (source.length === 0) {\n return new Uint8Array();\n }\n var psz = 0;\n // Skip leading spaces.\n if (source[psz] === ' ') {\n return;\n }\n // Skip and count leading '1's.\n var zeroes = 0;\n var length = 0;\n while (source[psz] === LEADER) {\n zeroes++;\n psz++;\n }\n // Allocate enough space in big-endian base256 representation.\n var size = (((source.length - psz) * FACTOR) + 1) >>> 0; // log(58) / log(256), rounded up.\n var b256 = new Uint8Array(size);\n // Process the characters.\n while (source[psz]) {\n // Decode character\n var carry = BASE_MAP[source.charCodeAt(psz)];\n // Invalid character\n if (carry === 255) {\n return;\n }\n var i = 0;\n for (var it3 = size - 1; (carry !== 0 || i < length) && (it3 !== -1); it3--, i++) {\n carry += (BASE * b256[it3]) >>> 0;\n b256[it3] = (carry % 256) >>> 0;\n carry = (carry / 256) >>> 0;\n }\n if (carry !== 0) {\n throw new Error('Non-zero carry');\n }\n length = i;\n psz++;\n }\n // Skip trailing spaces.\n if (source[psz] === ' ') {\n return;\n }\n // Skip leading zeroes in b256.\n var it4 = size - length;\n while (it4 !== size && b256[it4] === 0) {\n it4++;\n }\n var vch = new Uint8Array(zeroes + (size - it4));\n var j = zeroes;\n while (it4 !== size) {\n vch[j++] = b256[it4++];\n }\n return vch;\n }\n /**\n * @param {string | string[]} string\n */\n function decode(string) {\n var buffer = decodeUnsafe(string);\n if (buffer) {\n return buffer;\n }\n throw new Error(`Non-${name} character`);\n }\n return {\n encode: encode,\n decodeUnsafe: decodeUnsafe,\n decode: decode\n };\n}\nvar src = base;\nvar _brrp__multiformats_scope_baseX = src;\nexport default _brrp__multiformats_scope_baseX;\n//# sourceMappingURL=base-x.js.map","import { coerce } from '../bytes.js';\nimport basex from '../vendor/base-x.js';\n/**\n * Class represents both BaseEncoder and MultibaseEncoder meaning it\n * can be used to encode to multibase or base encode without multibase\n * prefix.\n */\nclass Encoder {\n name;\n prefix;\n baseEncode;\n constructor(name, prefix, baseEncode) {\n this.name = name;\n this.prefix = prefix;\n this.baseEncode = baseEncode;\n }\n encode(bytes) {\n if (bytes instanceof Uint8Array) {\n return `${this.prefix}${this.baseEncode(bytes)}`;\n }\n else {\n throw Error('Unknown type, must be binary type');\n }\n }\n}\n/**\n * Class represents both BaseDecoder and MultibaseDecoder so it could be used\n * to decode multibases (with matching prefix) or just base decode strings\n * with corresponding base encoding.\n */\nclass Decoder {\n name;\n prefix;\n baseDecode;\n prefixCodePoint;\n constructor(name, prefix, baseDecode) {\n this.name = name;\n this.prefix = prefix;\n /* c8 ignore next 3 */\n if (prefix.codePointAt(0) === undefined) {\n throw new Error('Invalid prefix character');\n }\n this.prefixCodePoint = prefix.codePointAt(0);\n this.baseDecode = baseDecode;\n }\n decode(text) {\n if (typeof text === 'string') {\n if (text.codePointAt(0) !== this.prefixCodePoint) {\n throw Error(`Unable to decode multibase string ${JSON.stringify(text)}, ${this.name} decoder only supports inputs prefixed with ${this.prefix}`);\n }\n return this.baseDecode(text.slice(this.prefix.length));\n }\n else {\n throw Error('Can only multibase decode strings');\n }\n }\n or(decoder) {\n return or(this, decoder);\n }\n}\nclass ComposedDecoder {\n decoders;\n constructor(decoders) {\n this.decoders = decoders;\n }\n or(decoder) {\n return or(this, decoder);\n }\n decode(input) {\n const prefix = input[0];\n const decoder = this.decoders[prefix];\n if (decoder != null) {\n return decoder.decode(input);\n }\n else {\n throw RangeError(`Unable to decode multibase string ${JSON.stringify(input)}, only inputs prefixed with ${Object.keys(this.decoders)} are supported`);\n }\n }\n}\nexport function or(left, right) {\n // eslint-disable-next-line @typescript-eslint/consistent-type-assertions\n return new ComposedDecoder({\n ...(left.decoders ?? { [left.prefix]: left }),\n ...(right.decoders ?? { [right.prefix]: right })\n });\n}\nexport class Codec {\n name;\n prefix;\n baseEncode;\n baseDecode;\n encoder;\n decoder;\n constructor(name, prefix, baseEncode, baseDecode) {\n this.name = name;\n this.prefix = prefix;\n this.baseEncode = baseEncode;\n this.baseDecode = baseDecode;\n this.encoder = new Encoder(name, prefix, baseEncode);\n this.decoder = new Decoder(name, prefix, baseDecode);\n }\n encode(input) {\n return this.encoder.encode(input);\n }\n decode(input) {\n return this.decoder.decode(input);\n }\n}\nexport function from({ name, prefix, encode, decode }) {\n return new Codec(name, prefix, encode, decode);\n}\nexport function baseX({ name, prefix, alphabet }) {\n const { encode, decode } = basex(alphabet, name);\n return from({\n prefix,\n name,\n encode,\n decode: (text) => coerce(decode(text))\n });\n}\nfunction decode(string, alphabet, bitsPerChar, name) {\n // Build the character lookup table:\n const codes = {};\n for (let i = 0; i < alphabet.length; ++i) {\n codes[alphabet[i]] = i;\n }\n // Count the padding bytes:\n let end = string.length;\n while (string[end - 1] === '=') {\n --end;\n }\n // Allocate the output:\n const out = new Uint8Array((end * bitsPerChar / 8) | 0);\n // Parse the data:\n let bits = 0; // Number of bits currently in the buffer\n let buffer = 0; // Bits waiting to be written out, MSB first\n let written = 0; // Next byte to write\n for (let i = 0; i < end; ++i) {\n // Read one character from the string:\n const value = codes[string[i]];\n if (value === undefined) {\n throw new SyntaxError(`Non-${name} character`);\n }\n // Append the bits to the buffer:\n buffer = (buffer << bitsPerChar) | value;\n bits += bitsPerChar;\n // Write out some bits if the buffer has a byte's worth:\n if (bits >= 8) {\n bits -= 8;\n out[written++] = 0xff & (buffer >> bits);\n }\n }\n // Verify that we have received just enough bits:\n if (bits >= bitsPerChar || (0xff & (buffer << (8 - bits))) !== 0) {\n throw new SyntaxError('Unexpected end of data');\n }\n return out;\n}\nfunction encode(data, alphabet, bitsPerChar) {\n const pad = alphabet[alphabet.length - 1] === '=';\n const mask = (1 << bitsPerChar) - 1;\n let out = '';\n let bits = 0; // Number of bits currently in the buffer\n let buffer = 0; // Bits waiting to be written out, MSB first\n for (let i = 0; i < data.length; ++i) {\n // Slurp data into the buffer:\n buffer = (buffer << 8) | data[i];\n bits += 8;\n // Write out as much as we can:\n while (bits > bitsPerChar) {\n bits -= bitsPerChar;\n out += alphabet[mask & (buffer >> bits)];\n }\n }\n // Partial character:\n if (bits !== 0) {\n out += alphabet[mask & (buffer << (bitsPerChar - bits))];\n }\n // Add padding characters until we hit a byte boundary:\n if (pad) {\n while (((out.length * bitsPerChar) & 7) !== 0) {\n out += '=';\n }\n }\n return out;\n}\n/**\n * RFC4648 Factory\n */\nexport function rfc4648({ name, prefix, bitsPerChar, alphabet }) {\n return from({\n prefix,\n name,\n encode(input) {\n return encode(input, alphabet, bitsPerChar);\n },\n decode(input) {\n return decode(input, alphabet, bitsPerChar, name);\n }\n });\n}\n//# sourceMappingURL=base.js.map","import { baseX } from './base.js';\nexport const base10 = baseX({\n prefix: '9',\n name: 'base10',\n alphabet: '0123456789'\n});\n//# sourceMappingURL=base10.js.map","import { rfc4648 } from './base.js';\nexport const base16 = rfc4648({\n prefix: 'f',\n name: 'base16',\n alphabet: '0123456789abcdef',\n bitsPerChar: 4\n});\nexport const base16upper = rfc4648({\n prefix: 'F',\n name: 'base16upper',\n alphabet: '0123456789ABCDEF',\n bitsPerChar: 4\n});\n//# sourceMappingURL=base16.js.map","import { rfc4648 } from './base.js';\nexport const base2 = rfc4648({\n prefix: '0',\n name: 'base2',\n alphabet: '01',\n bitsPerChar: 1\n});\n//# sourceMappingURL=base2.js.map","import { from } from './base.js';\nconst alphabet = Array.from('🚀🪐☄🛰🌌🌑🌒🌓🌔🌕🌖🌗🌘🌍🌏🌎🐉☀💻🖥💾💿😂❤😍🤣😊🙏💕😭😘👍😅👏😁🔥🥰💔💖💙😢🤔😆🙄💪😉☺👌🤗💜😔😎😇🌹🤦🎉💞✌✨🤷😱😌🌸🙌😋💗💚😏💛🙂💓🤩😄😀🖤😃💯🙈👇🎶😒🤭❣😜💋👀😪😑💥🙋😞😩😡🤪👊🥳😥🤤👉💃😳✋😚😝😴🌟😬🙃🍀🌷😻😓⭐✅🥺🌈😈🤘💦✔😣🏃💐☹🎊💘😠☝😕🌺🎂🌻😐🖕💝🙊😹🗣💫💀👑🎵🤞😛🔴😤🌼😫⚽🤙☕🏆🤫👈😮🙆🍻🍃🐶💁😲🌿🧡🎁⚡🌞🎈❌✊👋😰🤨😶🤝🚶💰🍓💢🤟🙁🚨💨🤬✈🎀🍺🤓😙💟🌱😖👶🥴▶➡❓💎💸⬇😨🌚🦋😷🕺⚠🙅😟😵👎🤲🤠🤧📌🔵💅🧐🐾🍒😗🤑🌊🤯🐷☎💧😯💆👆🎤🙇🍑❄🌴💣🐸💌📍🥀🤢👅💡💩👐📸👻🤐🤮🎼🥵🚩🍎🍊👼💍📣🥂');\nconst alphabetBytesToChars = (alphabet.reduce((p, c, i) => { p[i] = c; return p; }, ([])));\nconst alphabetCharsToBytes = (alphabet.reduce((p, c, i) => { p[c.codePointAt(0)] = i; return p; }, ([])));\nfunction encode(data) {\n return data.reduce((p, c) => {\n p += alphabetBytesToChars[c];\n return p;\n }, '');\n}\nfunction decode(str) {\n const byts = [];\n for (const char of str) {\n const byt = alphabetCharsToBytes[char.codePointAt(0)];\n if (byt === undefined) {\n throw new Error(`Non-base256emoji character: ${char}`);\n }\n byts.push(byt);\n }\n return new Uint8Array(byts);\n}\nexport const base256emoji = from({\n prefix: '🚀',\n name: 'base256emoji',\n encode,\n decode\n});\n//# sourceMappingURL=base256emoji.js.map","import { rfc4648 } from './base.js';\nexport const base32 = rfc4648({\n prefix: 'b',\n name: 'base32',\n alphabet: 'abcdefghijklmnopqrstuvwxyz234567',\n bitsPerChar: 5\n});\nexport const base32upper = rfc4648({\n prefix: 'B',\n name: 'base32upper',\n alphabet: 'ABCDEFGHIJKLMNOPQRSTUVWXYZ234567',\n bitsPerChar: 5\n});\nexport const base32pad = rfc4648({\n prefix: 'c',\n name: 'base32pad',\n alphabet: 'abcdefghijklmnopqrstuvwxyz234567=',\n bitsPerChar: 5\n});\nexport const base32padupper = rfc4648({\n prefix: 'C',\n name: 'base32padupper',\n alphabet: 'ABCDEFGHIJKLMNOPQRSTUVWXYZ234567=',\n bitsPerChar: 5\n});\nexport const base32hex = rfc4648({\n prefix: 'v',\n name: 'base32hex',\n alphabet: '0123456789abcdefghijklmnopqrstuv',\n bitsPerChar: 5\n});\nexport const base32hexupper = rfc4648({\n prefix: 'V',\n name: 'base32hexupper',\n alphabet: '0123456789ABCDEFGHIJKLMNOPQRSTUV',\n bitsPerChar: 5\n});\nexport const base32hexpad = rfc4648({\n prefix: 't',\n name: 'base32hexpad',\n alphabet: '0123456789abcdefghijklmnopqrstuv=',\n bitsPerChar: 5\n});\nexport const base32hexpadupper = rfc4648({\n prefix: 'T',\n name: 'base32hexpadupper',\n alphabet: '0123456789ABCDEFGHIJKLMNOPQRSTUV=',\n bitsPerChar: 5\n});\nexport const base32z = rfc4648({\n prefix: 'h',\n name: 'base32z',\n alphabet: 'ybndrfg8ejkmcpqxot1uwisza345h769',\n bitsPerChar: 5\n});\n//# sourceMappingURL=base32.js.map","import { baseX } from './base.js';\nexport const base36 = baseX({\n prefix: 'k',\n name: 'base36',\n alphabet: '0123456789abcdefghijklmnopqrstuvwxyz'\n});\nexport const base36upper = baseX({\n prefix: 'K',\n name: 'base36upper',\n alphabet: '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ'\n});\n//# sourceMappingURL=base36.js.map","import { baseX } from './base.js';\nexport const base58btc = baseX({\n name: 'base58btc',\n prefix: 'z',\n alphabet: '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'\n});\nexport const base58flickr = baseX({\n name: 'base58flickr',\n prefix: 'Z',\n alphabet: '123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ'\n});\n//# sourceMappingURL=base58.js.map","import { rfc4648 } from './base.js';\nexport const base64 = rfc4648({\n prefix: 'm',\n name: 'base64',\n alphabet: 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/',\n bitsPerChar: 6\n});\nexport const base64pad = rfc4648({\n prefix: 'M',\n name: 'base64pad',\n alphabet: 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=',\n bitsPerChar: 6\n});\nexport const base64url = rfc4648({\n prefix: 'u',\n name: 'base64url',\n alphabet: 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_',\n bitsPerChar: 6\n});\nexport const base64urlpad = rfc4648({\n prefix: 'U',\n name: 'base64urlpad',\n alphabet: 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_=',\n bitsPerChar: 6\n});\n//# sourceMappingURL=base64.js.map","import { rfc4648 } from './base.js';\nexport const base8 = rfc4648({\n prefix: '7',\n name: 'base8',\n alphabet: '01234567',\n bitsPerChar: 3\n});\n//# sourceMappingURL=base8.js.map","import { fromString, toString } from '../bytes.js';\nimport { from } from './base.js';\nexport const identity = from({\n prefix: '\\x00',\n name: 'identity',\n encode: (buf) => toString(buf),\n decode: (str) => fromString(str)\n});\n//# sourceMappingURL=identity.js.map","const textEncoder = new TextEncoder();\nconst textDecoder = new TextDecoder();\nexport const name = 'json';\nexport const code = 0x0200;\nexport function encode(node) {\n return textEncoder.encode(JSON.stringify(node));\n}\nexport function decode(data) {\n return JSON.parse(textDecoder.decode(data));\n}\n//# sourceMappingURL=json.js.map","import { coerce } from '../bytes.js';\nexport const name = 'raw';\nexport const code = 0x55;\nexport function encode(node) {\n return coerce(node);\n}\nexport function decode(data) {\n return coerce(data);\n}\n//# sourceMappingURL=raw.js.map","/* eslint-disable */\nvar encode_1 = encode;\nvar MSB = 0x80, REST = 0x7F, MSBALL = ~REST, INT = Math.pow(2, 31);\n/**\n * @param {number} num\n * @param {number[]} out\n * @param {number} offset\n */\nfunction encode(num, out, offset) {\n out = out || [];\n offset = offset || 0;\n var oldOffset = offset;\n while (num >= INT) {\n out[offset++] = (num & 0xFF) | MSB;\n num /= 128;\n }\n while (num & MSBALL) {\n out[offset++] = (num & 0xFF) | MSB;\n num >>>= 7;\n }\n out[offset] = num | 0;\n // @ts-ignore\n encode.bytes = offset - oldOffset + 1;\n return out;\n}\nvar decode = read;\nvar MSB$1 = 0x80, REST$1 = 0x7F;\n/**\n * @param {string | any[]} buf\n * @param {number} offset\n */\nfunction read(buf, offset) {\n var res = 0, offset = offset || 0, shift = 0, counter = offset, b, l = buf.length;\n do {\n if (counter >= l) {\n // @ts-ignore\n read.bytes = 0;\n throw new RangeError('Could not decode varint');\n }\n b = buf[counter++];\n res += shift < 28\n ? (b & REST$1) << shift\n : (b & REST$1) * Math.pow(2, shift);\n shift += 7;\n } while (b >= MSB$1);\n // @ts-ignore\n read.bytes = counter - offset;\n return res;\n}\nvar N1 = Math.pow(2, 7);\nvar N2 = Math.pow(2, 14);\nvar N3 = Math.pow(2, 21);\nvar N4 = Math.pow(2, 28);\nvar N5 = Math.pow(2, 35);\nvar N6 = Math.pow(2, 42);\nvar N7 = Math.pow(2, 49);\nvar N8 = Math.pow(2, 56);\nvar N9 = Math.pow(2, 63);\nvar length = function (/** @type {number} */ value) {\n return (value < N1 ? 1\n : value < N2 ? 2\n : value < N3 ? 3\n : value < N4 ? 4\n : value < N5 ? 5\n : value < N6 ? 6\n : value < N7 ? 7\n : value < N8 ? 8\n : value < N9 ? 9\n : 10);\n};\nvar varint = {\n encode: encode_1,\n decode: decode,\n encodingLength: length\n};\nvar _brrp_varint = varint;\nexport default _brrp_varint;\n//# sourceMappingURL=varint.js.map","import varint from './vendor/varint.js';\nexport function decode(data, offset = 0) {\n const code = varint.decode(data, offset);\n return [code, varint.decode.bytes];\n}\nexport function encodeTo(int, target, offset = 0) {\n varint.encode(int, target, offset);\n return target;\n}\nexport function encodingLength(int) {\n return varint.encodingLength(int);\n}\n//# sourceMappingURL=varint.js.map","import { coerce, equals as equalBytes } from '../bytes.js';\nimport * as varint from '../varint.js';\n/**\n * Creates a multihash digest.\n */\nexport function create(code, digest) {\n const size = digest.byteLength;\n const sizeOffset = varint.encodingLength(code);\n const digestOffset = sizeOffset + varint.encodingLength(size);\n const bytes = new Uint8Array(digestOffset + size);\n varint.encodeTo(code, bytes, 0);\n varint.encodeTo(size, bytes, sizeOffset);\n bytes.set(digest, digestOffset);\n return new Digest(code, size, digest, bytes);\n}\n/**\n * Turns bytes representation of multihash digest into an instance.\n */\nexport function decode(multihash) {\n const bytes = coerce(multihash);\n const [code, sizeOffset] = varint.decode(bytes);\n const [size, digestOffset] = varint.decode(bytes.subarray(sizeOffset));\n const digest = bytes.subarray(sizeOffset + digestOffset);\n if (digest.byteLength !== size) {\n throw new Error('Incorrect length');\n }\n return new Digest(code, size, digest, bytes);\n}\nexport function equals(a, b) {\n if (a === b) {\n return true;\n }\n else {\n const data = b;\n return (a.code === data.code &&\n a.size === data.size &&\n data.bytes instanceof Uint8Array &&\n equalBytes(a.bytes, data.bytes));\n }\n}\n/**\n * Represents a multihash digest which carries information about the\n * hashing algorithm and an actual hash digest.\n */\nexport class Digest {\n code;\n size;\n digest;\n bytes;\n /**\n * Creates a multihash digest.\n */\n constructor(code, size, digest, bytes) {\n this.code = code;\n this.size = size;\n this.digest = digest;\n this.bytes = bytes;\n }\n}\n//# sourceMappingURL=digest.js.map","import { coerce } from '../bytes.js';\nimport * as Digest from './digest.js';\nconst code = 0x0;\nconst name = 'identity';\nconst encode = coerce;\nfunction digest(input) {\n return Digest.create(code, encode(input));\n}\nexport const identity = { code, name, encode, digest };\n//# sourceMappingURL=identity.js.map","import * as Digest from './digest.js';\nexport function from({ name, code, encode }) {\n return new Hasher(name, code, encode);\n}\n/**\n * Hasher represents a hashing algorithm implementation that produces as\n * `MultihashDigest`.\n */\nexport class Hasher {\n name;\n code;\n encode;\n constructor(name, code, encode) {\n this.name = name;\n this.code = code;\n this.encode = encode;\n }\n digest(input) {\n if (input instanceof Uint8Array) {\n const result = this.encode(input);\n return result instanceof Uint8Array\n ? Digest.create(this.code, result)\n /* c8 ignore next 1 */\n : result.then(digest => Digest.create(this.code, digest));\n }\n else {\n throw Error('Unknown type, must be binary type');\n /* c8 ignore next 1 */\n }\n }\n}\n//# sourceMappingURL=hasher.js.map","/* global crypto */\nimport { from } from './hasher.js';\nfunction sha(name) {\n return async (data) => new Uint8Array(await crypto.subtle.digest(name, data));\n}\nexport const sha256 = from({\n name: 'sha2-256',\n code: 0x12,\n encode: sha('SHA-256')\n});\nexport const sha512 = from({\n name: 'sha2-512',\n code: 0x13,\n encode: sha('SHA-512')\n});\n//# sourceMappingURL=sha2-browser.js.map","import { base32 } from './bases/base32.js';\nimport { base58btc } from './bases/base58.js';\nimport { coerce } from './bytes.js';\nimport * as Digest from './hashes/digest.js';\nimport * as varint from './varint.js';\n// This way TS will also expose all the types from module\nexport * from './link/interface.js';\nexport function format(link, base) {\n const { bytes, version } = link;\n switch (version) {\n case 0:\n return toStringV0(bytes, baseCache(link), base ?? base58btc.encoder);\n default:\n return toStringV1(bytes, baseCache(link), (base ?? base32.encoder));\n }\n}\nexport function toJSON(link) {\n return {\n '/': format(link)\n };\n}\nexport function fromJSON(json) {\n return CID.parse(json['/']);\n}\nconst cache = new WeakMap();\nfunction baseCache(cid) {\n const baseCache = cache.get(cid);\n if (baseCache == null) {\n const baseCache = new Map();\n cache.set(cid, baseCache);\n return baseCache;\n }\n return baseCache;\n}\nexport class CID {\n code;\n version;\n multihash;\n bytes;\n '/';\n /**\n * @param version - Version of the CID\n * @param code - Code of the codec content is encoded in, see https://github.com/multiformats/multicodec/blob/master/table.csv\n * @param multihash - (Multi)hash of the of the content.\n */\n constructor(version, code, multihash, bytes) {\n this.code = code;\n this.version = version;\n this.multihash = multihash;\n this.bytes = bytes;\n // flag to serializers that this is a CID and\n // should be treated specially\n this['/'] = bytes;\n }\n /**\n * Signalling `cid.asCID === cid` has been replaced with `cid['/'] === cid.bytes`\n * please either use `CID.asCID(cid)` or switch to new signalling mechanism\n *\n * @deprecated\n */\n get asCID() {\n return this;\n }\n // ArrayBufferView\n get byteOffset() {\n return this.bytes.byteOffset;\n }\n // ArrayBufferView\n get byteLength() {\n return this.bytes.byteLength;\n }\n toV0() {\n switch (this.version) {\n case 0: {\n return this;\n }\n case 1: {\n const { code, multihash } = this;\n if (code !== DAG_PB_CODE) {\n throw new Error('Cannot convert a non dag-pb CID to CIDv0');\n }\n // sha2-256\n if (multihash.code !== SHA_256_CODE) {\n throw new Error('Cannot convert non sha2-256 multihash CID to CIDv0');\n }\n return (CID.createV0(multihash));\n }\n default: {\n throw Error(`Can not convert CID version ${this.version} to version 0. This is a bug please report`);\n }\n }\n }\n toV1() {\n switch (this.version) {\n case 0: {\n const { code, digest } = this.multihash;\n const multihash = Digest.create(code, digest);\n return (CID.createV1(this.code, multihash));\n }\n case 1: {\n return this;\n }\n default: {\n throw Error(`Can not convert CID version ${this.version} to version 1. This is a bug please report`);\n }\n }\n }\n equals(other) {\n return CID.equals(this, other);\n }\n static equals(self, other) {\n const unknown = other;\n return (unknown != null &&\n self.code === unknown.code &&\n self.version === unknown.version &&\n Digest.equals(self.multihash, unknown.multihash));\n }\n toString(base) {\n return format(this, base);\n }\n toJSON() {\n return { '/': format(this) };\n }\n link() {\n return this;\n }\n [Symbol.toStringTag] = 'CID';\n // Legacy\n [Symbol.for('nodejs.util.inspect.custom')]() {\n return `CID(${this.toString()})`;\n }\n /**\n * Takes any input `value` and returns a `CID` instance if it was\n * a `CID` otherwise returns `null`. If `value` is instanceof `CID`\n * it will return value back. If `value` is not instance of this CID\n * class, but is compatible CID it will return new instance of this\n * `CID` class. Otherwise returns null.\n *\n * This allows two different incompatible versions of CID library to\n * co-exist and interop as long as binary interface is compatible.\n */\n static asCID(input) {\n if (input == null) {\n return null;\n }\n const value = input;\n if (value instanceof CID) {\n // If value is instance of CID then we're all set.\n return value;\n }\n else if ((value['/'] != null && value['/'] === value.bytes) || value.asCID === value) {\n // If value isn't instance of this CID class but `this.asCID === this` or\n // `value['/'] === value.bytes` is true it is CID instance coming from a\n // different implementation (diff version or duplicate). In that case we\n // rebase it to this `CID` implementation so caller is guaranteed to get\n // instance with expected API.\n const { version, code, multihash, bytes } = value;\n return new CID(version, code, multihash, bytes ?? encodeCID(version, code, multihash.bytes));\n }\n else if (value[cidSymbol] === true) {\n // If value is a CID from older implementation that used to be tagged via\n // symbol we still rebase it to the this `CID` implementation by\n // delegating that to a constructor.\n const { version, multihash, code } = value;\n const digest = Digest.decode(multihash);\n return CID.create(version, code, digest);\n }\n else {\n // Otherwise value is not a CID (or an incompatible version of it) in\n // which case we return `null`.\n return null;\n }\n }\n /**\n * @param version - Version of the CID\n * @param code - Code of the codec content is encoded in, see https://github.com/multiformats/multicodec/blob/master/table.csv\n * @param digest - (Multi)hash of the of the content.\n */\n static create(version, code, digest) {\n if (typeof code !== 'number') {\n throw new Error('String codecs are no longer supported');\n }\n if (!(digest.bytes instanceof Uint8Array)) {\n throw new Error('Invalid digest');\n }\n switch (version) {\n case 0: {\n if (code !== DAG_PB_CODE) {\n throw new Error(`Version 0 CID must use dag-pb (code: ${DAG_PB_CODE}) block encoding`);\n }\n else {\n return new CID(version, code, digest, digest.bytes);\n }\n }\n case 1: {\n const bytes = encodeCID(version, code, digest.bytes);\n return new CID(version, code, digest, bytes);\n }\n default: {\n throw new Error('Invalid version');\n }\n }\n }\n /**\n * Simplified version of `create` for CIDv0.\n */\n static createV0(digest) {\n return CID.create(0, DAG_PB_CODE, digest);\n }\n /**\n * Simplified version of `create` for CIDv1.\n *\n * @param code - Content encoding format code.\n * @param digest - Multihash of the content.\n */\n static createV1(code, digest) {\n return CID.create(1, code, digest);\n }\n /**\n * Decoded a CID from its binary representation. The byte array must contain\n * only the CID with no additional bytes.\n *\n * An error will be thrown if the bytes provided do not contain a valid\n * binary representation of a CID.\n */\n static decode(bytes) {\n const [cid, remainder] = CID.decodeFirst(bytes);\n if (remainder.length !== 0) {\n throw new Error('Incorrect length');\n }\n return cid;\n }\n /**\n * Decoded a CID from its binary representation at the beginning of a byte\n * array.\n *\n * Returns an array with the first element containing the CID and the second\n * element containing the remainder of the original byte array. The remainder\n * will be a zero-length byte array if the provided bytes only contained a\n * binary CID representation.\n */\n static decodeFirst(bytes) {\n const specs = CID.inspectBytes(bytes);\n const prefixSize = specs.size - specs.multihashSize;\n const multihashBytes = coerce(bytes.subarray(prefixSize, prefixSize + specs.multihashSize));\n if (multihashBytes.byteLength !== specs.multihashSize) {\n throw new Error('Incorrect length');\n }\n const digestBytes = multihashBytes.subarray(specs.multihashSize - specs.digestSize);\n const digest = new Digest.Digest(specs.multihashCode, specs.digestSize, digestBytes, multihashBytes);\n const cid = specs.version === 0\n ? CID.createV0(digest)\n : CID.createV1(specs.codec, digest);\n return [cid, bytes.subarray(specs.size)];\n }\n /**\n * Inspect the initial bytes of a CID to determine its properties.\n *\n * Involves decoding up to 4 varints. Typically this will require only 4 to 6\n * bytes but for larger multicodec code values and larger multihash digest\n * lengths these varints can be quite large. It is recommended that at least\n * 10 bytes be made available in the `initialBytes` argument for a complete\n * inspection.\n */\n static inspectBytes(initialBytes) {\n let offset = 0;\n const next = () => {\n const [i, length] = varint.decode(initialBytes.subarray(offset));\n offset += length;\n return i;\n };\n let version = next();\n let codec = DAG_PB_CODE;\n if (version === 18) {\n // CIDv0\n version = 0;\n offset = 0;\n }\n else {\n codec = next();\n }\n if (version !== 0 && version !== 1) {\n throw new RangeError(`Invalid CID version ${version}`);\n }\n const prefixSize = offset;\n const multihashCode = next(); // multihash code\n const digestSize = next(); // multihash length\n const size = offset + digestSize;\n const multihashSize = size - prefixSize;\n return { version, codec, multihashCode, digestSize, multihashSize, size };\n }\n /**\n * Takes cid in a string representation and creates an instance. If `base`\n * decoder is not provided will use a default from the configuration. It will\n * throw an error if encoding of the CID is not compatible with supplied (or\n * a default decoder).\n */\n static parse(source, base) {\n const [prefix, bytes] = parseCIDtoBytes(source, base);\n const cid = CID.decode(bytes);\n if (cid.version === 0 && source[0] !== 'Q') {\n throw Error('Version 0 CID string must not include multibase prefix');\n }\n // Cache string representation to avoid computing it on `this.toString()`\n baseCache(cid).set(prefix, source);\n return cid;\n }\n}\nfunction parseCIDtoBytes(source, base) {\n switch (source[0]) {\n // CIDv0 is parsed differently\n case 'Q': {\n const decoder = base ?? base58btc;\n return [\n base58btc.prefix,\n decoder.decode(`${base58btc.prefix}${source}`)\n ];\n }\n case base58btc.prefix: {\n const decoder = base ?? base58btc;\n return [base58btc.prefix, decoder.decode(source)];\n }\n case base32.prefix: {\n const decoder = base ?? base32;\n return [base32.prefix, decoder.decode(source)];\n }\n default: {\n if (base == null) {\n throw Error('To parse non base32 or base58btc encoded CID multibase decoder must be provided');\n }\n return [source[0], base.decode(source)];\n }\n }\n}\nfunction toStringV0(bytes, cache, base) {\n const { prefix } = base;\n if (prefix !== base58btc.prefix) {\n throw Error(`Cannot string encode V0 in ${base.name} encoding`);\n }\n const cid = cache.get(prefix);\n if (cid == null) {\n const cid = base.encode(bytes).slice(1);\n cache.set(prefix, cid);\n return cid;\n }\n else {\n return cid;\n }\n}\nfunction toStringV1(bytes, cache, base) {\n const { prefix } = base;\n const cid = cache.get(prefix);\n if (cid == null) {\n const cid = base.encode(bytes);\n cache.set(prefix, cid);\n return cid;\n }\n else {\n return cid;\n }\n}\nconst DAG_PB_CODE = 0x70;\nconst SHA_256_CODE = 0x12;\nfunction encodeCID(version, code, multihash) {\n const codeOffset = varint.encodingLength(version);\n const hashOffset = codeOffset + varint.encodingLength(code);\n const bytes = new Uint8Array(hashOffset + multihash.byteLength);\n varint.encodeTo(version, bytes, 0);\n varint.encodeTo(code, bytes, codeOffset);\n bytes.set(multihash, hashOffset);\n return bytes;\n}\nconst cidSymbol = Symbol.for('@ipld/js-cid/CID');\n//# sourceMappingURL=cid.js.map","import * as base10 from './bases/base10.js';\nimport * as base16 from './bases/base16.js';\nimport * as base2 from './bases/base2.js';\nimport * as base256emoji from './bases/base256emoji.js';\nimport * as base32 from './bases/base32.js';\nimport * as base36 from './bases/base36.js';\nimport * as base58 from './bases/base58.js';\nimport * as base64 from './bases/base64.js';\nimport * as base8 from './bases/base8.js';\nimport * as identityBase from './bases/identity.js';\nimport * as json from './codecs/json.js';\nimport * as raw from './codecs/raw.js';\nimport * as identity from './hashes/identity.js';\nimport * as sha2 from './hashes/sha2.js';\nimport { CID, hasher, digest, varint, bytes } from './index.js';\nexport const bases = { ...identityBase, ...base2, ...base8, ...base10, ...base16, ...base32, ...base36, ...base58, ...base64, ...base256emoji };\nexport const hashes = { ...sha2, ...identity };\nexport const codecs = { raw, json };\nexport { CID, hasher, digest, varint, bytes };\n//# sourceMappingURL=basics.js.map","import { bases } from 'multiformats/basics';\nimport { allocUnsafe } from '#alloc';\nfunction createCodec(name, prefix, encode, decode) {\n return {\n name,\n prefix,\n encoder: {\n name,\n prefix,\n encode\n },\n decoder: {\n decode\n }\n };\n}\nconst string = createCodec('utf8', 'u', (buf) => {\n const decoder = new TextDecoder('utf8');\n return 'u' + decoder.decode(buf);\n}, (str) => {\n const encoder = new TextEncoder();\n return encoder.encode(str.substring(1));\n});\nconst ascii = createCodec('ascii', 'a', (buf) => {\n let string = 'a';\n for (let i = 0; i < buf.length; i++) {\n string += String.fromCharCode(buf[i]);\n }\n return string;\n}, (str) => {\n str = str.substring(1);\n const buf = allocUnsafe(str.length);\n for (let i = 0; i < str.length; i++) {\n buf[i] = str.charCodeAt(i);\n }\n return buf;\n});\nconst BASES = {\n utf8: string,\n 'utf-8': string,\n hex: bases.base16,\n latin1: ascii,\n ascii,\n binary: ascii,\n ...bases\n};\nexport default BASES;\n//# sourceMappingURL=bases.js.map","import bases, {} from './util/bases.js';\n/**\n * Create a `Uint8Array` from the passed string\n *\n * Supports `utf8`, `utf-8`, `hex`, and any encoding supported by the multiformats module.\n *\n * Also `ascii` which is similar to node's 'binary' encoding.\n */\nexport function fromString(string, encoding = 'utf8') {\n const base = bases[encoding];\n if (base == null) {\n throw new Error(`Unsupported encoding \"${encoding}\"`);\n }\n // add multibase prefix\n return base.decoder.decode(`${base.prefix}${string}`); // eslint-disable-line @typescript-eslint/restrict-template-expressions\n}\n//# sourceMappingURL=from-string.js.map","import { encodeUint8Array, encodingLength } from 'uint8-varint';\nimport { allocUnsafe } from 'uint8arrays/alloc';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport { writeFloatLE, writeDoubleLE } from './float.js';\nimport { LongBits } from './longbits.js';\nimport pool from './pool.js';\nimport * as utf8 from './utf8.js';\n/**\n * Constructs a new writer operation instance.\n *\n * @classdesc Scheduled writer operation\n */\nclass Op {\n /**\n * Function to call\n */\n fn;\n /**\n * Value byte length\n */\n len;\n /**\n * Next operation\n */\n next;\n /**\n * Value to write\n */\n val;\n constructor(fn, len, val) {\n this.fn = fn;\n this.len = len;\n this.next = undefined;\n this.val = val; // type varies\n }\n}\n/* istanbul ignore next */\nfunction noop() { } // eslint-disable-line no-empty-function\n/**\n * Constructs a new writer state instance\n */\nclass State {\n /**\n * Current head\n */\n head;\n /**\n * Current tail\n */\n tail;\n /**\n * Current buffer length\n */\n len;\n /**\n * Next state\n */\n next;\n constructor(writer) {\n this.head = writer.head;\n this.tail = writer.tail;\n this.len = writer.len;\n this.next = writer.states;\n }\n}\nconst bufferPool = pool();\n/**\n * Allocates a buffer of the specified size\n */\nfunction alloc(size) {\n if (globalThis.Buffer != null) {\n return allocUnsafe(size);\n }\n return bufferPool(size);\n}\n/**\n * When a value is written, the writer calculates its byte length and puts it into a linked\n * list of operations to perform when finish() is called. This both allows us to allocate\n * buffers of the exact required size and reduces the amount of work we have to do compared\n * to first calculating over objects and then encoding over objects. In our case, the encoding\n * part is just a linked list walk calling operations with already prepared values.\n */\nclass Uint8ArrayWriter {\n /**\n * Current length\n */\n len;\n /**\n * Operations head\n */\n head;\n /**\n * Operations tail\n */\n tail;\n /**\n * Linked forked states\n */\n states;\n constructor() {\n this.len = 0;\n this.head = new Op(noop, 0, 0);\n this.tail = this.head;\n this.states = null;\n }\n /**\n * Pushes a new operation to the queue\n */\n _push(fn, len, val) {\n this.tail = this.tail.next = new Op(fn, len, val);\n this.len += len;\n return this;\n }\n /**\n * Writes an unsigned 32 bit value as a varint\n */\n uint32(value) {\n // here, the call to this.push has been inlined and a varint specific Op subclass is used.\n // uint32 is by far the most frequently used operation and benefits significantly from this.\n this.len += (this.tail = this.tail.next = new VarintOp((value = value >>> 0) <\n 128\n ? 1\n : value < 16384\n ? 2\n : value < 2097152\n ? 3\n : value < 268435456\n ? 4\n : 5, value)).len;\n return this;\n }\n /**\n * Writes a signed 32 bit value as a varint`\n */\n int32(value) {\n return value < 0\n ? this._push(writeVarint64, 10, LongBits.fromNumber(value)) // 10 bytes per spec\n : this.uint32(value);\n }\n /**\n * Writes a 32 bit value as a varint, zig-zag encoded\n */\n sint32(value) {\n return this.uint32((value << 1 ^ value >> 31) >>> 0);\n }\n /**\n * Writes an unsigned 64 bit value as a varint\n */\n uint64(value) {\n const bits = LongBits.fromBigInt(value);\n return this._push(writeVarint64, bits.length(), bits);\n }\n /**\n * Writes an unsigned 64 bit value as a varint\n */\n uint64Number(value) {\n return this._push(encodeUint8Array, encodingLength(value), value);\n }\n /**\n * Writes an unsigned 64 bit value as a varint\n */\n uint64String(value) {\n return this.uint64(BigInt(value));\n }\n /**\n * Writes a signed 64 bit value as a varint\n */\n int64(value) {\n return this.uint64(value);\n }\n /**\n * Writes a signed 64 bit value as a varint\n */\n int64Number(value) {\n return this.uint64Number(value);\n }\n /**\n * Writes a signed 64 bit value as a varint\n */\n int64String(value) {\n return this.uint64String(value);\n }\n /**\n * Writes a signed 64 bit value as a varint, zig-zag encoded\n */\n sint64(value) {\n const bits = LongBits.fromBigInt(value).zzEncode();\n return this._push(writeVarint64, bits.length(), bits);\n }\n /**\n * Writes a signed 64 bit value as a varint, zig-zag encoded\n */\n sint64Number(value) {\n const bits = LongBits.fromNumber(value).zzEncode();\n return this._push(writeVarint64, bits.length(), bits);\n }\n /**\n * Writes a signed 64 bit value as a varint, zig-zag encoded\n */\n sint64String(value) {\n return this.sint64(BigInt(value));\n }\n /**\n * Writes a boolish value as a varint\n */\n bool(value) {\n return this._push(writeByte, 1, value ? 1 : 0);\n }\n /**\n * Writes an unsigned 32 bit value as fixed 32 bits\n */\n fixed32(value) {\n return this._push(writeFixed32, 4, value >>> 0);\n }\n /**\n * Writes a signed 32 bit value as fixed 32 bits\n */\n sfixed32(value) {\n return this.fixed32(value);\n }\n /**\n * Writes an unsigned 64 bit value as fixed 64 bits\n */\n fixed64(value) {\n const bits = LongBits.fromBigInt(value);\n return this._push(writeFixed32, 4, bits.lo)._push(writeFixed32, 4, bits.hi);\n }\n /**\n * Writes an unsigned 64 bit value as fixed 64 bits\n */\n fixed64Number(value) {\n const bits = LongBits.fromNumber(value);\n return this._push(writeFixed32, 4, bits.lo)._push(writeFixed32, 4, bits.hi);\n }\n /**\n * Writes an unsigned 64 bit value as fixed 64 bits\n */\n fixed64String(value) {\n return this.fixed64(BigInt(value));\n }\n /**\n * Writes a signed 64 bit value as fixed 64 bits\n */\n sfixed64(value) {\n return this.fixed64(value);\n }\n /**\n * Writes a signed 64 bit value as fixed 64 bits\n */\n sfixed64Number(value) {\n return this.fixed64Number(value);\n }\n /**\n * Writes a signed 64 bit value as fixed 64 bits\n */\n sfixed64String(value) {\n return this.fixed64String(value);\n }\n /**\n * Writes a float (32 bit)\n */\n float(value) {\n return this._push(writeFloatLE, 4, value);\n }\n /**\n * Writes a double (64 bit float).\n *\n * @function\n * @param {number} value - Value to write\n * @returns {Writer} `this`\n */\n double(value) {\n return this._push(writeDoubleLE, 8, value);\n }\n /**\n * Writes a sequence of bytes\n */\n bytes(value) {\n const len = value.length >>> 0;\n if (len === 0) {\n return this._push(writeByte, 1, 0);\n }\n return this.uint32(len)._push(writeBytes, len, value);\n }\n /**\n * Writes a string\n */\n string(value) {\n const len = utf8.length(value);\n return len !== 0\n ? this.uint32(len)._push(utf8.write, len, value)\n : this._push(writeByte, 1, 0);\n }\n /**\n * Forks this writer's state by pushing it to a stack.\n * Calling {@link Writer#reset|reset} or {@link Writer#ldelim|ldelim} resets the writer to the previous state.\n */\n fork() {\n this.states = new State(this);\n this.head = this.tail = new Op(noop, 0, 0);\n this.len = 0;\n return this;\n }\n /**\n * Resets this instance to the last state\n */\n reset() {\n if (this.states != null) {\n this.head = this.states.head;\n this.tail = this.states.tail;\n this.len = this.states.len;\n this.states = this.states.next;\n }\n else {\n this.head = this.tail = new Op(noop, 0, 0);\n this.len = 0;\n }\n return this;\n }\n /**\n * Resets to the last state and appends the fork state's current write length as a varint followed by its operations.\n */\n ldelim() {\n const head = this.head;\n const tail = this.tail;\n const len = this.len;\n this.reset().uint32(len);\n if (len !== 0) {\n this.tail.next = head.next; // skip noop\n this.tail = tail;\n this.len += len;\n }\n return this;\n }\n /**\n * Finishes the write operation\n */\n finish() {\n let head = this.head.next; // skip noop\n const buf = alloc(this.len);\n let pos = 0;\n while (head != null) {\n head.fn(head.val, buf, pos);\n pos += head.len;\n head = head.next;\n }\n // this.head = this.tail = null;\n return buf;\n }\n}\nfunction writeByte(val, buf, pos) {\n buf[pos] = val & 255;\n}\nfunction writeVarint32(val, buf, pos) {\n while (val > 127) {\n buf[pos++] = val & 127 | 128;\n val >>>= 7;\n }\n buf[pos] = val;\n}\n/**\n * Constructs a new varint writer operation instance.\n *\n * @classdesc Scheduled varint writer operation\n */\nclass VarintOp extends Op {\n next;\n constructor(len, val) {\n super(writeVarint32, len, val);\n this.next = undefined;\n }\n}\nfunction writeVarint64(val, buf, pos) {\n while (val.hi !== 0) {\n buf[pos++] = val.lo & 127 | 128;\n val.lo = (val.lo >>> 7 | val.hi << 25) >>> 0;\n val.hi >>>= 7;\n }\n while (val.lo > 127) {\n buf[pos++] = val.lo & 127 | 128;\n val.lo = val.lo >>> 7;\n }\n buf[pos++] = val.lo;\n}\nfunction writeFixed32(val, buf, pos) {\n buf[pos] = val & 255;\n buf[pos + 1] = val >>> 8 & 255;\n buf[pos + 2] = val >>> 16 & 255;\n buf[pos + 3] = val >>> 24;\n}\nfunction writeBytes(val, buf, pos) {\n buf.set(val, pos);\n}\nif (globalThis.Buffer != null) {\n Uint8ArrayWriter.prototype.bytes = function (value) {\n const len = value.length >>> 0;\n this.uint32(len);\n if (len > 0) {\n this._push(writeBytesBuffer, len, value);\n }\n return this;\n };\n Uint8ArrayWriter.prototype.string = function (value) {\n const len = globalThis.Buffer.byteLength(value);\n this.uint32(len);\n if (len > 0) {\n this._push(writeStringBuffer, len, value);\n }\n return this;\n };\n}\nfunction writeBytesBuffer(val, buf, pos) {\n buf.set(val, pos); // faster than copy (requires node >= 4 where Buffers extend Uint8Array and set is properly inherited)\n // also works for plain array values\n}\nfunction writeStringBuffer(val, buf, pos) {\n if (val.length < 40) {\n // plain js is faster for short strings (probably due to redundant assertions)\n utf8.write(val, buf, pos);\n // @ts-expect-error buf isn't a Uint8Array?\n }\n else if (buf.utf8Write != null) {\n // @ts-expect-error buf isn't a Uint8Array?\n buf.utf8Write(val, pos);\n }\n else {\n buf.set(uint8ArrayFromString(val), pos);\n }\n}\n/**\n * Creates a new writer\n */\nexport function createWriter() {\n return new Uint8ArrayWriter();\n}\n//# sourceMappingURL=writer.js.map","import { allocUnsafe } from 'uint8arrays/alloc';\n/**\n * A general purpose buffer pool\n */\nexport default function pool(size) {\n const SIZE = size ?? 8192;\n const MAX = SIZE >>> 1;\n let slab;\n let offset = SIZE;\n return function poolAlloc(size) {\n if (size < 1 || size > MAX) {\n return allocUnsafe(size);\n }\n if (offset + size > SIZE) {\n slab = allocUnsafe(SIZE);\n offset = 0;\n }\n const buf = slab.subarray(offset, offset += size);\n if ((offset & 7) !== 0) {\n // align to 32 bit\n offset = (offset | 7) + 1;\n }\n return buf;\n };\n}\n//# sourceMappingURL=pool.js.map","import { createWriter } from './utils/writer.js';\nexport function encodeMessage(message, codec) {\n const w = createWriter();\n codec.encode(message, w, {\n lengthDelimited: false\n });\n return w.finish();\n}\n//# sourceMappingURL=encode.js.map","// https://developers.google.com/protocol-buffers/docs/encoding#structure\nexport var CODEC_TYPES;\n(function (CODEC_TYPES) {\n CODEC_TYPES[CODEC_TYPES[\"VARINT\"] = 0] = \"VARINT\";\n CODEC_TYPES[CODEC_TYPES[\"BIT64\"] = 1] = \"BIT64\";\n CODEC_TYPES[CODEC_TYPES[\"LENGTH_DELIMITED\"] = 2] = \"LENGTH_DELIMITED\";\n CODEC_TYPES[CODEC_TYPES[\"START_GROUP\"] = 3] = \"START_GROUP\";\n CODEC_TYPES[CODEC_TYPES[\"END_GROUP\"] = 4] = \"END_GROUP\";\n CODEC_TYPES[CODEC_TYPES[\"BIT32\"] = 5] = \"BIT32\";\n})(CODEC_TYPES || (CODEC_TYPES = {}));\nexport function createCodec(name, type, encode, decode) {\n return {\n name,\n type,\n encode,\n decode\n };\n}\n//# sourceMappingURL=codec.js.map","/* eslint-disable import/export */\n/* eslint-disable complexity */\n/* eslint-disable @typescript-eslint/no-namespace */\n/* eslint-disable @typescript-eslint/no-unnecessary-boolean-literal-compare */\n/* eslint-disable @typescript-eslint/no-empty-interface */\nimport { decodeMessage, encodeMessage, message } from 'protons-runtime';\nimport { alloc as uint8ArrayAlloc } from 'uint8arrays/alloc';\nexport var RateLimitProof;\n(function (RateLimitProof) {\n let _codec;\n RateLimitProof.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.proof != null && obj.proof.byteLength > 0)) {\n w.uint32(10);\n w.bytes(obj.proof);\n }\n if ((obj.merkleRoot != null && obj.merkleRoot.byteLength > 0)) {\n w.uint32(18);\n w.bytes(obj.merkleRoot);\n }\n if ((obj.epoch != null && obj.epoch.byteLength > 0)) {\n w.uint32(26);\n w.bytes(obj.epoch);\n }\n if ((obj.shareX != null && obj.shareX.byteLength > 0)) {\n w.uint32(34);\n w.bytes(obj.shareX);\n }\n if ((obj.shareY != null && obj.shareY.byteLength > 0)) {\n w.uint32(42);\n w.bytes(obj.shareY);\n }\n if ((obj.nullifier != null && obj.nullifier.byteLength > 0)) {\n w.uint32(50);\n w.bytes(obj.nullifier);\n }\n if ((obj.rlnIdentifier != null && obj.rlnIdentifier.byteLength > 0)) {\n w.uint32(58);\n w.bytes(obj.rlnIdentifier);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n proof: uint8ArrayAlloc(0),\n merkleRoot: uint8ArrayAlloc(0),\n epoch: uint8ArrayAlloc(0),\n shareX: uint8ArrayAlloc(0),\n shareY: uint8ArrayAlloc(0),\n nullifier: uint8ArrayAlloc(0),\n rlnIdentifier: uint8ArrayAlloc(0)\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.proof = reader.bytes();\n break;\n }\n case 2: {\n obj.merkleRoot = reader.bytes();\n break;\n }\n case 3: {\n obj.epoch = reader.bytes();\n break;\n }\n case 4: {\n obj.shareX = reader.bytes();\n break;\n }\n case 5: {\n obj.shareY = reader.bytes();\n break;\n }\n case 6: {\n obj.nullifier = reader.bytes();\n break;\n }\n case 7: {\n obj.rlnIdentifier = reader.bytes();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n RateLimitProof.encode = (obj) => {\n return encodeMessage(obj, RateLimitProof.codec());\n };\n RateLimitProof.decode = (buf, opts) => {\n return decodeMessage(buf, RateLimitProof.codec(), opts);\n };\n})(RateLimitProof || (RateLimitProof = {}));\nexport var WakuMessage;\n(function (WakuMessage) {\n let _codec;\n WakuMessage.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.payload != null && obj.payload.byteLength > 0)) {\n w.uint32(10);\n w.bytes(obj.payload);\n }\n if ((obj.contentTopic != null && obj.contentTopic !== '')) {\n w.uint32(18);\n w.string(obj.contentTopic);\n }\n if (obj.version != null) {\n w.uint32(24);\n w.uint32(obj.version);\n }\n if (obj.timestamp != null) {\n w.uint32(80);\n w.sint64(obj.timestamp);\n }\n if (obj.meta != null) {\n w.uint32(90);\n w.bytes(obj.meta);\n }\n if (obj.rateLimitProof != null) {\n w.uint32(170);\n RateLimitProof.codec().encode(obj.rateLimitProof, w);\n }\n if (obj.ephemeral != null) {\n w.uint32(248);\n w.bool(obj.ephemeral);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n payload: uint8ArrayAlloc(0),\n contentTopic: ''\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.payload = reader.bytes();\n break;\n }\n case 2: {\n obj.contentTopic = reader.string();\n break;\n }\n case 3: {\n obj.version = reader.uint32();\n break;\n }\n case 10: {\n obj.timestamp = reader.sint64();\n break;\n }\n case 11: {\n obj.meta = reader.bytes();\n break;\n }\n case 21: {\n obj.rateLimitProof = RateLimitProof.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.rateLimitProof\n });\n break;\n }\n case 31: {\n obj.ephemeral = reader.bool();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n WakuMessage.encode = (obj) => {\n return encodeMessage(obj, WakuMessage.codec());\n };\n WakuMessage.decode = (buf, opts) => {\n return decodeMessage(buf, WakuMessage.codec(), opts);\n };\n})(WakuMessage || (WakuMessage = {}));\n//# sourceMappingURL=message.js.map","/* eslint-disable import/export */\n/* eslint-disable complexity */\n/* eslint-disable @typescript-eslint/no-namespace */\n/* eslint-disable @typescript-eslint/no-unnecessary-boolean-literal-compare */\n/* eslint-disable @typescript-eslint/no-empty-interface */\nimport { decodeMessage, encodeMessage, MaxLengthError, message } from 'protons-runtime';\nimport { alloc as uint8ArrayAlloc } from 'uint8arrays/alloc';\nexport var FilterRequest;\n(function (FilterRequest) {\n let ContentFilter;\n (function (ContentFilter) {\n let _codec;\n ContentFilter.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.contentTopic != null && obj.contentTopic !== '')) {\n w.uint32(10);\n w.string(obj.contentTopic);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n contentTopic: ''\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.contentTopic = reader.string();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n ContentFilter.encode = (obj) => {\n return encodeMessage(obj, ContentFilter.codec());\n };\n ContentFilter.decode = (buf, opts) => {\n return decodeMessage(buf, ContentFilter.codec(), opts);\n };\n })(ContentFilter = FilterRequest.ContentFilter || (FilterRequest.ContentFilter = {}));\n let _codec;\n FilterRequest.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.subscribe != null && obj.subscribe !== false)) {\n w.uint32(8);\n w.bool(obj.subscribe);\n }\n if ((obj.topic != null && obj.topic !== '')) {\n w.uint32(18);\n w.string(obj.topic);\n }\n if (obj.contentFilters != null) {\n for (const value of obj.contentFilters) {\n w.uint32(26);\n FilterRequest.ContentFilter.codec().encode(value, w);\n }\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n subscribe: false,\n topic: '',\n contentFilters: []\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.subscribe = reader.bool();\n break;\n }\n case 2: {\n obj.topic = reader.string();\n break;\n }\n case 3: {\n if (opts.limits?.contentFilters != null && obj.contentFilters.length === opts.limits.contentFilters) {\n throw new MaxLengthError('Decode error - map field \"contentFilters\" had too many elements');\n }\n obj.contentFilters.push(FilterRequest.ContentFilter.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.contentFilters$\n }));\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n FilterRequest.encode = (obj) => {\n return encodeMessage(obj, FilterRequest.codec());\n };\n FilterRequest.decode = (buf, opts) => {\n return decodeMessage(buf, FilterRequest.codec(), opts);\n };\n})(FilterRequest || (FilterRequest = {}));\nexport var MessagePush;\n(function (MessagePush) {\n let _codec;\n MessagePush.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if (obj.messages != null) {\n for (const value of obj.messages) {\n w.uint32(10);\n WakuMessage.codec().encode(value, w);\n }\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n messages: []\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n if (opts.limits?.messages != null && obj.messages.length === opts.limits.messages) {\n throw new MaxLengthError('Decode error - map field \"messages\" had too many elements');\n }\n obj.messages.push(WakuMessage.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.messages$\n }));\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n MessagePush.encode = (obj) => {\n return encodeMessage(obj, MessagePush.codec());\n };\n MessagePush.decode = (buf, opts) => {\n return decodeMessage(buf, MessagePush.codec(), opts);\n };\n})(MessagePush || (MessagePush = {}));\nexport var FilterRpc;\n(function (FilterRpc) {\n let _codec;\n FilterRpc.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.requestId != null && obj.requestId !== '')) {\n w.uint32(10);\n w.string(obj.requestId);\n }\n if (obj.request != null) {\n w.uint32(18);\n FilterRequest.codec().encode(obj.request, w);\n }\n if (obj.push != null) {\n w.uint32(26);\n MessagePush.codec().encode(obj.push, w);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n requestId: ''\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.requestId = reader.string();\n break;\n }\n case 2: {\n obj.request = FilterRequest.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.request\n });\n break;\n }\n case 3: {\n obj.push = MessagePush.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.push\n });\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n FilterRpc.encode = (obj) => {\n return encodeMessage(obj, FilterRpc.codec());\n };\n FilterRpc.decode = (buf, opts) => {\n return decodeMessage(buf, FilterRpc.codec(), opts);\n };\n})(FilterRpc || (FilterRpc = {}));\nexport var RateLimitProof;\n(function (RateLimitProof) {\n let _codec;\n RateLimitProof.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.proof != null && obj.proof.byteLength > 0)) {\n w.uint32(10);\n w.bytes(obj.proof);\n }\n if ((obj.merkleRoot != null && obj.merkleRoot.byteLength > 0)) {\n w.uint32(18);\n w.bytes(obj.merkleRoot);\n }\n if ((obj.epoch != null && obj.epoch.byteLength > 0)) {\n w.uint32(26);\n w.bytes(obj.epoch);\n }\n if ((obj.shareX != null && obj.shareX.byteLength > 0)) {\n w.uint32(34);\n w.bytes(obj.shareX);\n }\n if ((obj.shareY != null && obj.shareY.byteLength > 0)) {\n w.uint32(42);\n w.bytes(obj.shareY);\n }\n if ((obj.nullifier != null && obj.nullifier.byteLength > 0)) {\n w.uint32(50);\n w.bytes(obj.nullifier);\n }\n if ((obj.rlnIdentifier != null && obj.rlnIdentifier.byteLength > 0)) {\n w.uint32(58);\n w.bytes(obj.rlnIdentifier);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n proof: uint8ArrayAlloc(0),\n merkleRoot: uint8ArrayAlloc(0),\n epoch: uint8ArrayAlloc(0),\n shareX: uint8ArrayAlloc(0),\n shareY: uint8ArrayAlloc(0),\n nullifier: uint8ArrayAlloc(0),\n rlnIdentifier: uint8ArrayAlloc(0)\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.proof = reader.bytes();\n break;\n }\n case 2: {\n obj.merkleRoot = reader.bytes();\n break;\n }\n case 3: {\n obj.epoch = reader.bytes();\n break;\n }\n case 4: {\n obj.shareX = reader.bytes();\n break;\n }\n case 5: {\n obj.shareY = reader.bytes();\n break;\n }\n case 6: {\n obj.nullifier = reader.bytes();\n break;\n }\n case 7: {\n obj.rlnIdentifier = reader.bytes();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n RateLimitProof.encode = (obj) => {\n return encodeMessage(obj, RateLimitProof.codec());\n };\n RateLimitProof.decode = (buf, opts) => {\n return decodeMessage(buf, RateLimitProof.codec(), opts);\n };\n})(RateLimitProof || (RateLimitProof = {}));\nexport var WakuMessage;\n(function (WakuMessage) {\n let _codec;\n WakuMessage.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.payload != null && obj.payload.byteLength > 0)) {\n w.uint32(10);\n w.bytes(obj.payload);\n }\n if ((obj.contentTopic != null && obj.contentTopic !== '')) {\n w.uint32(18);\n w.string(obj.contentTopic);\n }\n if (obj.version != null) {\n w.uint32(24);\n w.uint32(obj.version);\n }\n if (obj.timestamp != null) {\n w.uint32(80);\n w.sint64(obj.timestamp);\n }\n if (obj.meta != null) {\n w.uint32(90);\n w.bytes(obj.meta);\n }\n if (obj.rateLimitProof != null) {\n w.uint32(170);\n RateLimitProof.codec().encode(obj.rateLimitProof, w);\n }\n if (obj.ephemeral != null) {\n w.uint32(248);\n w.bool(obj.ephemeral);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n payload: uint8ArrayAlloc(0),\n contentTopic: ''\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.payload = reader.bytes();\n break;\n }\n case 2: {\n obj.contentTopic = reader.string();\n break;\n }\n case 3: {\n obj.version = reader.uint32();\n break;\n }\n case 10: {\n obj.timestamp = reader.sint64();\n break;\n }\n case 11: {\n obj.meta = reader.bytes();\n break;\n }\n case 21: {\n obj.rateLimitProof = RateLimitProof.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.rateLimitProof\n });\n break;\n }\n case 31: {\n obj.ephemeral = reader.bool();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n WakuMessage.encode = (obj) => {\n return encodeMessage(obj, WakuMessage.codec());\n };\n WakuMessage.decode = (buf, opts) => {\n return decodeMessage(buf, WakuMessage.codec(), opts);\n };\n})(WakuMessage || (WakuMessage = {}));\n//# sourceMappingURL=filter.js.map","/* eslint-disable import/export */\n/* eslint-disable complexity */\n/* eslint-disable @typescript-eslint/no-namespace */\n/* eslint-disable @typescript-eslint/no-unnecessary-boolean-literal-compare */\n/* eslint-disable @typescript-eslint/no-empty-interface */\nimport { decodeMessage, encodeMessage, message } from 'protons-runtime';\nexport var TopicOnlyMessage;\n(function (TopicOnlyMessage) {\n let _codec;\n TopicOnlyMessage.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.contentTopic != null && obj.contentTopic !== '')) {\n w.uint32(18);\n w.string(obj.contentTopic);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n contentTopic: ''\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 2: {\n obj.contentTopic = reader.string();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n TopicOnlyMessage.encode = (obj) => {\n return encodeMessage(obj, TopicOnlyMessage.codec());\n };\n TopicOnlyMessage.decode = (buf, opts) => {\n return decodeMessage(buf, TopicOnlyMessage.codec(), opts);\n };\n})(TopicOnlyMessage || (TopicOnlyMessage = {}));\n//# sourceMappingURL=topic_only_message.js.map","/* eslint-disable import/export */\n/* eslint-disable complexity */\n/* eslint-disable @typescript-eslint/no-namespace */\n/* eslint-disable @typescript-eslint/no-unnecessary-boolean-literal-compare */\n/* eslint-disable @typescript-eslint/no-empty-interface */\nimport { decodeMessage, encodeMessage, enumeration, MaxLengthError, message } from 'protons-runtime';\nimport { alloc as uint8ArrayAlloc } from 'uint8arrays/alloc';\nexport var FilterSubscribeRequest;\n(function (FilterSubscribeRequest) {\n let FilterSubscribeType;\n (function (FilterSubscribeType) {\n FilterSubscribeType[\"SUBSCRIBER_PING\"] = \"SUBSCRIBER_PING\";\n FilterSubscribeType[\"SUBSCRIBE\"] = \"SUBSCRIBE\";\n FilterSubscribeType[\"UNSUBSCRIBE\"] = \"UNSUBSCRIBE\";\n FilterSubscribeType[\"UNSUBSCRIBE_ALL\"] = \"UNSUBSCRIBE_ALL\";\n })(FilterSubscribeType = FilterSubscribeRequest.FilterSubscribeType || (FilterSubscribeRequest.FilterSubscribeType = {}));\n let __FilterSubscribeTypeValues;\n (function (__FilterSubscribeTypeValues) {\n __FilterSubscribeTypeValues[__FilterSubscribeTypeValues[\"SUBSCRIBER_PING\"] = 0] = \"SUBSCRIBER_PING\";\n __FilterSubscribeTypeValues[__FilterSubscribeTypeValues[\"SUBSCRIBE\"] = 1] = \"SUBSCRIBE\";\n __FilterSubscribeTypeValues[__FilterSubscribeTypeValues[\"UNSUBSCRIBE\"] = 2] = \"UNSUBSCRIBE\";\n __FilterSubscribeTypeValues[__FilterSubscribeTypeValues[\"UNSUBSCRIBE_ALL\"] = 3] = \"UNSUBSCRIBE_ALL\";\n })(__FilterSubscribeTypeValues || (__FilterSubscribeTypeValues = {}));\n (function (FilterSubscribeType) {\n FilterSubscribeType.codec = () => {\n return enumeration(__FilterSubscribeTypeValues);\n };\n })(FilterSubscribeType = FilterSubscribeRequest.FilterSubscribeType || (FilterSubscribeRequest.FilterSubscribeType = {}));\n let _codec;\n FilterSubscribeRequest.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.requestId != null && obj.requestId !== '')) {\n w.uint32(10);\n w.string(obj.requestId);\n }\n if (obj.filterSubscribeType != null && __FilterSubscribeTypeValues[obj.filterSubscribeType] !== 0) {\n w.uint32(16);\n FilterSubscribeRequest.FilterSubscribeType.codec().encode(obj.filterSubscribeType, w);\n }\n if (obj.pubsubTopic != null) {\n w.uint32(82);\n w.string(obj.pubsubTopic);\n }\n if (obj.contentTopics != null) {\n for (const value of obj.contentTopics) {\n w.uint32(90);\n w.string(value);\n }\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n requestId: '',\n filterSubscribeType: FilterSubscribeType.SUBSCRIBER_PING,\n contentTopics: []\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.requestId = reader.string();\n break;\n }\n case 2: {\n obj.filterSubscribeType = FilterSubscribeRequest.FilterSubscribeType.codec().decode(reader);\n break;\n }\n case 10: {\n obj.pubsubTopic = reader.string();\n break;\n }\n case 11: {\n if (opts.limits?.contentTopics != null && obj.contentTopics.length === opts.limits.contentTopics) {\n throw new MaxLengthError('Decode error - map field \"contentTopics\" had too many elements');\n }\n obj.contentTopics.push(reader.string());\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n FilterSubscribeRequest.encode = (obj) => {\n return encodeMessage(obj, FilterSubscribeRequest.codec());\n };\n FilterSubscribeRequest.decode = (buf, opts) => {\n return decodeMessage(buf, FilterSubscribeRequest.codec(), opts);\n };\n})(FilterSubscribeRequest || (FilterSubscribeRequest = {}));\nexport var FilterSubscribeResponse;\n(function (FilterSubscribeResponse) {\n let _codec;\n FilterSubscribeResponse.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.requestId != null && obj.requestId !== '')) {\n w.uint32(10);\n w.string(obj.requestId);\n }\n if ((obj.statusCode != null && obj.statusCode !== 0)) {\n w.uint32(80);\n w.uint32(obj.statusCode);\n }\n if (obj.statusDesc != null) {\n w.uint32(90);\n w.string(obj.statusDesc);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n requestId: '',\n statusCode: 0\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.requestId = reader.string();\n break;\n }\n case 10: {\n obj.statusCode = reader.uint32();\n break;\n }\n case 11: {\n obj.statusDesc = reader.string();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n FilterSubscribeResponse.encode = (obj) => {\n return encodeMessage(obj, FilterSubscribeResponse.codec());\n };\n FilterSubscribeResponse.decode = (buf, opts) => {\n return decodeMessage(buf, FilterSubscribeResponse.codec(), opts);\n };\n})(FilterSubscribeResponse || (FilterSubscribeResponse = {}));\nexport var MessagePush;\n(function (MessagePush) {\n let _codec;\n MessagePush.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if (obj.wakuMessage != null) {\n w.uint32(10);\n WakuMessage.codec().encode(obj.wakuMessage, w);\n }\n if (obj.pubsubTopic != null) {\n w.uint32(18);\n w.string(obj.pubsubTopic);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {};\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.wakuMessage = WakuMessage.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.wakuMessage\n });\n break;\n }\n case 2: {\n obj.pubsubTopic = reader.string();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n MessagePush.encode = (obj) => {\n return encodeMessage(obj, MessagePush.codec());\n };\n MessagePush.decode = (buf, opts) => {\n return decodeMessage(buf, MessagePush.codec(), opts);\n };\n})(MessagePush || (MessagePush = {}));\nexport var RateLimitProof;\n(function (RateLimitProof) {\n let _codec;\n RateLimitProof.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.proof != null && obj.proof.byteLength > 0)) {\n w.uint32(10);\n w.bytes(obj.proof);\n }\n if ((obj.merkleRoot != null && obj.merkleRoot.byteLength > 0)) {\n w.uint32(18);\n w.bytes(obj.merkleRoot);\n }\n if ((obj.epoch != null && obj.epoch.byteLength > 0)) {\n w.uint32(26);\n w.bytes(obj.epoch);\n }\n if ((obj.shareX != null && obj.shareX.byteLength > 0)) {\n w.uint32(34);\n w.bytes(obj.shareX);\n }\n if ((obj.shareY != null && obj.shareY.byteLength > 0)) {\n w.uint32(42);\n w.bytes(obj.shareY);\n }\n if ((obj.nullifier != null && obj.nullifier.byteLength > 0)) {\n w.uint32(50);\n w.bytes(obj.nullifier);\n }\n if ((obj.rlnIdentifier != null && obj.rlnIdentifier.byteLength > 0)) {\n w.uint32(58);\n w.bytes(obj.rlnIdentifier);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n proof: uint8ArrayAlloc(0),\n merkleRoot: uint8ArrayAlloc(0),\n epoch: uint8ArrayAlloc(0),\n shareX: uint8ArrayAlloc(0),\n shareY: uint8ArrayAlloc(0),\n nullifier: uint8ArrayAlloc(0),\n rlnIdentifier: uint8ArrayAlloc(0)\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.proof = reader.bytes();\n break;\n }\n case 2: {\n obj.merkleRoot = reader.bytes();\n break;\n }\n case 3: {\n obj.epoch = reader.bytes();\n break;\n }\n case 4: {\n obj.shareX = reader.bytes();\n break;\n }\n case 5: {\n obj.shareY = reader.bytes();\n break;\n }\n case 6: {\n obj.nullifier = reader.bytes();\n break;\n }\n case 7: {\n obj.rlnIdentifier = reader.bytes();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n RateLimitProof.encode = (obj) => {\n return encodeMessage(obj, RateLimitProof.codec());\n };\n RateLimitProof.decode = (buf, opts) => {\n return decodeMessage(buf, RateLimitProof.codec(), opts);\n };\n})(RateLimitProof || (RateLimitProof = {}));\nexport var WakuMessage;\n(function (WakuMessage) {\n let _codec;\n WakuMessage.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.payload != null && obj.payload.byteLength > 0)) {\n w.uint32(10);\n w.bytes(obj.payload);\n }\n if ((obj.contentTopic != null && obj.contentTopic !== '')) {\n w.uint32(18);\n w.string(obj.contentTopic);\n }\n if (obj.version != null) {\n w.uint32(24);\n w.uint32(obj.version);\n }\n if (obj.timestamp != null) {\n w.uint32(80);\n w.sint64(obj.timestamp);\n }\n if (obj.meta != null) {\n w.uint32(90);\n w.bytes(obj.meta);\n }\n if (obj.rateLimitProof != null) {\n w.uint32(170);\n RateLimitProof.codec().encode(obj.rateLimitProof, w);\n }\n if (obj.ephemeral != null) {\n w.uint32(248);\n w.bool(obj.ephemeral);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n payload: uint8ArrayAlloc(0),\n contentTopic: ''\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.payload = reader.bytes();\n break;\n }\n case 2: {\n obj.contentTopic = reader.string();\n break;\n }\n case 3: {\n obj.version = reader.uint32();\n break;\n }\n case 10: {\n obj.timestamp = reader.sint64();\n break;\n }\n case 11: {\n obj.meta = reader.bytes();\n break;\n }\n case 21: {\n obj.rateLimitProof = RateLimitProof.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.rateLimitProof\n });\n break;\n }\n case 31: {\n obj.ephemeral = reader.bool();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n WakuMessage.encode = (obj) => {\n return encodeMessage(obj, WakuMessage.codec());\n };\n WakuMessage.decode = (buf, opts) => {\n return decodeMessage(buf, WakuMessage.codec(), opts);\n };\n})(WakuMessage || (WakuMessage = {}));\n//# sourceMappingURL=filter_v2.js.map","/* eslint-disable import/export */\n/* eslint-disable complexity */\n/* eslint-disable @typescript-eslint/no-namespace */\n/* eslint-disable @typescript-eslint/no-unnecessary-boolean-literal-compare */\n/* eslint-disable @typescript-eslint/no-empty-interface */\nimport { decodeMessage, encodeMessage, message } from 'protons-runtime';\nimport { alloc as uint8ArrayAlloc } from 'uint8arrays/alloc';\nexport var PushRequest;\n(function (PushRequest) {\n let _codec;\n PushRequest.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.pubsubTopic != null && obj.pubsubTopic !== '')) {\n w.uint32(10);\n w.string(obj.pubsubTopic);\n }\n if (obj.message != null) {\n w.uint32(18);\n WakuMessage.codec().encode(obj.message, w);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n pubsubTopic: ''\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.pubsubTopic = reader.string();\n break;\n }\n case 2: {\n obj.message = WakuMessage.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.message\n });\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n PushRequest.encode = (obj) => {\n return encodeMessage(obj, PushRequest.codec());\n };\n PushRequest.decode = (buf, opts) => {\n return decodeMessage(buf, PushRequest.codec(), opts);\n };\n})(PushRequest || (PushRequest = {}));\nexport var PushResponse;\n(function (PushResponse) {\n let _codec;\n PushResponse.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.isSuccess != null && obj.isSuccess !== false)) {\n w.uint32(8);\n w.bool(obj.isSuccess);\n }\n if (obj.info != null) {\n w.uint32(18);\n w.string(obj.info);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n isSuccess: false\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.isSuccess = reader.bool();\n break;\n }\n case 2: {\n obj.info = reader.string();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n PushResponse.encode = (obj) => {\n return encodeMessage(obj, PushResponse.codec());\n };\n PushResponse.decode = (buf, opts) => {\n return decodeMessage(buf, PushResponse.codec(), opts);\n };\n})(PushResponse || (PushResponse = {}));\nexport var PushRpc;\n(function (PushRpc) {\n let _codec;\n PushRpc.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.requestId != null && obj.requestId !== '')) {\n w.uint32(10);\n w.string(obj.requestId);\n }\n if (obj.request != null) {\n w.uint32(18);\n PushRequest.codec().encode(obj.request, w);\n }\n if (obj.response != null) {\n w.uint32(26);\n PushResponse.codec().encode(obj.response, w);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n requestId: ''\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.requestId = reader.string();\n break;\n }\n case 2: {\n obj.request = PushRequest.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.request\n });\n break;\n }\n case 3: {\n obj.response = PushResponse.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.response\n });\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n PushRpc.encode = (obj) => {\n return encodeMessage(obj, PushRpc.codec());\n };\n PushRpc.decode = (buf, opts) => {\n return decodeMessage(buf, PushRpc.codec(), opts);\n };\n})(PushRpc || (PushRpc = {}));\nexport var RateLimitProof;\n(function (RateLimitProof) {\n let _codec;\n RateLimitProof.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.proof != null && obj.proof.byteLength > 0)) {\n w.uint32(10);\n w.bytes(obj.proof);\n }\n if ((obj.merkleRoot != null && obj.merkleRoot.byteLength > 0)) {\n w.uint32(18);\n w.bytes(obj.merkleRoot);\n }\n if ((obj.epoch != null && obj.epoch.byteLength > 0)) {\n w.uint32(26);\n w.bytes(obj.epoch);\n }\n if ((obj.shareX != null && obj.shareX.byteLength > 0)) {\n w.uint32(34);\n w.bytes(obj.shareX);\n }\n if ((obj.shareY != null && obj.shareY.byteLength > 0)) {\n w.uint32(42);\n w.bytes(obj.shareY);\n }\n if ((obj.nullifier != null && obj.nullifier.byteLength > 0)) {\n w.uint32(50);\n w.bytes(obj.nullifier);\n }\n if ((obj.rlnIdentifier != null && obj.rlnIdentifier.byteLength > 0)) {\n w.uint32(58);\n w.bytes(obj.rlnIdentifier);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n proof: uint8ArrayAlloc(0),\n merkleRoot: uint8ArrayAlloc(0),\n epoch: uint8ArrayAlloc(0),\n shareX: uint8ArrayAlloc(0),\n shareY: uint8ArrayAlloc(0),\n nullifier: uint8ArrayAlloc(0),\n rlnIdentifier: uint8ArrayAlloc(0)\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.proof = reader.bytes();\n break;\n }\n case 2: {\n obj.merkleRoot = reader.bytes();\n break;\n }\n case 3: {\n obj.epoch = reader.bytes();\n break;\n }\n case 4: {\n obj.shareX = reader.bytes();\n break;\n }\n case 5: {\n obj.shareY = reader.bytes();\n break;\n }\n case 6: {\n obj.nullifier = reader.bytes();\n break;\n }\n case 7: {\n obj.rlnIdentifier = reader.bytes();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n RateLimitProof.encode = (obj) => {\n return encodeMessage(obj, RateLimitProof.codec());\n };\n RateLimitProof.decode = (buf, opts) => {\n return decodeMessage(buf, RateLimitProof.codec(), opts);\n };\n})(RateLimitProof || (RateLimitProof = {}));\nexport var WakuMessage;\n(function (WakuMessage) {\n let _codec;\n WakuMessage.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.payload != null && obj.payload.byteLength > 0)) {\n w.uint32(10);\n w.bytes(obj.payload);\n }\n if ((obj.contentTopic != null && obj.contentTopic !== '')) {\n w.uint32(18);\n w.string(obj.contentTopic);\n }\n if (obj.version != null) {\n w.uint32(24);\n w.uint32(obj.version);\n }\n if (obj.timestamp != null) {\n w.uint32(80);\n w.sint64(obj.timestamp);\n }\n if (obj.meta != null) {\n w.uint32(90);\n w.bytes(obj.meta);\n }\n if (obj.rateLimitProof != null) {\n w.uint32(170);\n RateLimitProof.codec().encode(obj.rateLimitProof, w);\n }\n if (obj.ephemeral != null) {\n w.uint32(248);\n w.bool(obj.ephemeral);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n payload: uint8ArrayAlloc(0),\n contentTopic: ''\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.payload = reader.bytes();\n break;\n }\n case 2: {\n obj.contentTopic = reader.string();\n break;\n }\n case 3: {\n obj.version = reader.uint32();\n break;\n }\n case 10: {\n obj.timestamp = reader.sint64();\n break;\n }\n case 11: {\n obj.meta = reader.bytes();\n break;\n }\n case 21: {\n obj.rateLimitProof = RateLimitProof.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.rateLimitProof\n });\n break;\n }\n case 31: {\n obj.ephemeral = reader.bool();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n WakuMessage.encode = (obj) => {\n return encodeMessage(obj, WakuMessage.codec());\n };\n WakuMessage.decode = (buf, opts) => {\n return decodeMessage(buf, WakuMessage.codec(), opts);\n };\n})(WakuMessage || (WakuMessage = {}));\n//# sourceMappingURL=light_push.js.map","/* eslint-disable import/export */\n/* eslint-disable complexity */\n/* eslint-disable @typescript-eslint/no-namespace */\n/* eslint-disable @typescript-eslint/no-unnecessary-boolean-literal-compare */\n/* eslint-disable @typescript-eslint/no-empty-interface */\nimport { decodeMessage, encodeMessage, MaxLengthError, message } from 'protons-runtime';\nimport { alloc as uint8ArrayAlloc } from 'uint8arrays/alloc';\nexport var WakuMessageKeyValue;\n(function (WakuMessageKeyValue) {\n let _codec;\n WakuMessageKeyValue.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if (obj.messageHash != null) {\n w.uint32(10);\n w.bytes(obj.messageHash);\n }\n if (obj.message != null) {\n w.uint32(18);\n WakuMessage.codec().encode(obj.message, w);\n }\n if (obj.pubsubTopic != null) {\n w.uint32(26);\n w.string(obj.pubsubTopic);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {};\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.messageHash = reader.bytes();\n break;\n }\n case 2: {\n obj.message = WakuMessage.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.message\n });\n break;\n }\n case 3: {\n obj.pubsubTopic = reader.string();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n WakuMessageKeyValue.encode = (obj) => {\n return encodeMessage(obj, WakuMessageKeyValue.codec());\n };\n WakuMessageKeyValue.decode = (buf, opts) => {\n return decodeMessage(buf, WakuMessageKeyValue.codec(), opts);\n };\n})(WakuMessageKeyValue || (WakuMessageKeyValue = {}));\nexport var StoreQueryRequest;\n(function (StoreQueryRequest) {\n let _codec;\n StoreQueryRequest.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.requestId != null && obj.requestId !== '')) {\n w.uint32(10);\n w.string(obj.requestId);\n }\n if ((obj.includeData != null && obj.includeData !== false)) {\n w.uint32(16);\n w.bool(obj.includeData);\n }\n if (obj.pubsubTopic != null) {\n w.uint32(82);\n w.string(obj.pubsubTopic);\n }\n if (obj.contentTopics != null) {\n for (const value of obj.contentTopics) {\n w.uint32(90);\n w.string(value);\n }\n }\n if (obj.timeStart != null) {\n w.uint32(96);\n w.sint64(obj.timeStart);\n }\n if (obj.timeEnd != null) {\n w.uint32(104);\n w.sint64(obj.timeEnd);\n }\n if (obj.messageHashes != null) {\n for (const value of obj.messageHashes) {\n w.uint32(162);\n w.bytes(value);\n }\n }\n if (obj.paginationCursor != null) {\n w.uint32(410);\n w.bytes(obj.paginationCursor);\n }\n if ((obj.paginationForward != null && obj.paginationForward !== false)) {\n w.uint32(416);\n w.bool(obj.paginationForward);\n }\n if (obj.paginationLimit != null) {\n w.uint32(424);\n w.uint64(obj.paginationLimit);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n requestId: '',\n includeData: false,\n contentTopics: [],\n messageHashes: [],\n paginationForward: false\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.requestId = reader.string();\n break;\n }\n case 2: {\n obj.includeData = reader.bool();\n break;\n }\n case 10: {\n obj.pubsubTopic = reader.string();\n break;\n }\n case 11: {\n if (opts.limits?.contentTopics != null && obj.contentTopics.length === opts.limits.contentTopics) {\n throw new MaxLengthError('Decode error - map field \"contentTopics\" had too many elements');\n }\n obj.contentTopics.push(reader.string());\n break;\n }\n case 12: {\n obj.timeStart = reader.sint64();\n break;\n }\n case 13: {\n obj.timeEnd = reader.sint64();\n break;\n }\n case 20: {\n if (opts.limits?.messageHashes != null && obj.messageHashes.length === opts.limits.messageHashes) {\n throw new MaxLengthError('Decode error - map field \"messageHashes\" had too many elements');\n }\n obj.messageHashes.push(reader.bytes());\n break;\n }\n case 51: {\n obj.paginationCursor = reader.bytes();\n break;\n }\n case 52: {\n obj.paginationForward = reader.bool();\n break;\n }\n case 53: {\n obj.paginationLimit = reader.uint64();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n StoreQueryRequest.encode = (obj) => {\n return encodeMessage(obj, StoreQueryRequest.codec());\n };\n StoreQueryRequest.decode = (buf, opts) => {\n return decodeMessage(buf, StoreQueryRequest.codec(), opts);\n };\n})(StoreQueryRequest || (StoreQueryRequest = {}));\nexport var StoreQueryResponse;\n(function (StoreQueryResponse) {\n let _codec;\n StoreQueryResponse.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.requestId != null && obj.requestId !== '')) {\n w.uint32(10);\n w.string(obj.requestId);\n }\n if (obj.statusCode != null) {\n w.uint32(80);\n w.uint32(obj.statusCode);\n }\n if (obj.statusDesc != null) {\n w.uint32(90);\n w.string(obj.statusDesc);\n }\n if (obj.messages != null) {\n for (const value of obj.messages) {\n w.uint32(162);\n WakuMessageKeyValue.codec().encode(value, w);\n }\n }\n if (obj.paginationCursor != null) {\n w.uint32(410);\n w.bytes(obj.paginationCursor);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n requestId: '',\n messages: []\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.requestId = reader.string();\n break;\n }\n case 10: {\n obj.statusCode = reader.uint32();\n break;\n }\n case 11: {\n obj.statusDesc = reader.string();\n break;\n }\n case 20: {\n if (opts.limits?.messages != null && obj.messages.length === opts.limits.messages) {\n throw new MaxLengthError('Decode error - map field \"messages\" had too many elements');\n }\n obj.messages.push(WakuMessageKeyValue.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.messages$\n }));\n break;\n }\n case 51: {\n obj.paginationCursor = reader.bytes();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n StoreQueryResponse.encode = (obj) => {\n return encodeMessage(obj, StoreQueryResponse.codec());\n };\n StoreQueryResponse.decode = (buf, opts) => {\n return decodeMessage(buf, StoreQueryResponse.codec(), opts);\n };\n})(StoreQueryResponse || (StoreQueryResponse = {}));\nexport var RateLimitProof;\n(function (RateLimitProof) {\n let _codec;\n RateLimitProof.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.proof != null && obj.proof.byteLength > 0)) {\n w.uint32(10);\n w.bytes(obj.proof);\n }\n if ((obj.merkleRoot != null && obj.merkleRoot.byteLength > 0)) {\n w.uint32(18);\n w.bytes(obj.merkleRoot);\n }\n if ((obj.epoch != null && obj.epoch.byteLength > 0)) {\n w.uint32(26);\n w.bytes(obj.epoch);\n }\n if ((obj.shareX != null && obj.shareX.byteLength > 0)) {\n w.uint32(34);\n w.bytes(obj.shareX);\n }\n if ((obj.shareY != null && obj.shareY.byteLength > 0)) {\n w.uint32(42);\n w.bytes(obj.shareY);\n }\n if ((obj.nullifier != null && obj.nullifier.byteLength > 0)) {\n w.uint32(50);\n w.bytes(obj.nullifier);\n }\n if ((obj.rlnIdentifier != null && obj.rlnIdentifier.byteLength > 0)) {\n w.uint32(58);\n w.bytes(obj.rlnIdentifier);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n proof: uint8ArrayAlloc(0),\n merkleRoot: uint8ArrayAlloc(0),\n epoch: uint8ArrayAlloc(0),\n shareX: uint8ArrayAlloc(0),\n shareY: uint8ArrayAlloc(0),\n nullifier: uint8ArrayAlloc(0),\n rlnIdentifier: uint8ArrayAlloc(0)\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.proof = reader.bytes();\n break;\n }\n case 2: {\n obj.merkleRoot = reader.bytes();\n break;\n }\n case 3: {\n obj.epoch = reader.bytes();\n break;\n }\n case 4: {\n obj.shareX = reader.bytes();\n break;\n }\n case 5: {\n obj.shareY = reader.bytes();\n break;\n }\n case 6: {\n obj.nullifier = reader.bytes();\n break;\n }\n case 7: {\n obj.rlnIdentifier = reader.bytes();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n RateLimitProof.encode = (obj) => {\n return encodeMessage(obj, RateLimitProof.codec());\n };\n RateLimitProof.decode = (buf, opts) => {\n return decodeMessage(buf, RateLimitProof.codec(), opts);\n };\n})(RateLimitProof || (RateLimitProof = {}));\nexport var WakuMessage;\n(function (WakuMessage) {\n let _codec;\n WakuMessage.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.payload != null && obj.payload.byteLength > 0)) {\n w.uint32(10);\n w.bytes(obj.payload);\n }\n if ((obj.contentTopic != null && obj.contentTopic !== '')) {\n w.uint32(18);\n w.string(obj.contentTopic);\n }\n if (obj.version != null) {\n w.uint32(24);\n w.uint32(obj.version);\n }\n if (obj.timestamp != null) {\n w.uint32(80);\n w.sint64(obj.timestamp);\n }\n if (obj.meta != null) {\n w.uint32(90);\n w.bytes(obj.meta);\n }\n if (obj.rateLimitProof != null) {\n w.uint32(170);\n RateLimitProof.codec().encode(obj.rateLimitProof, w);\n }\n if (obj.ephemeral != null) {\n w.uint32(248);\n w.bool(obj.ephemeral);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n payload: uint8ArrayAlloc(0),\n contentTopic: ''\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.payload = reader.bytes();\n break;\n }\n case 2: {\n obj.contentTopic = reader.string();\n break;\n }\n case 3: {\n obj.version = reader.uint32();\n break;\n }\n case 10: {\n obj.timestamp = reader.sint64();\n break;\n }\n case 11: {\n obj.meta = reader.bytes();\n break;\n }\n case 21: {\n obj.rateLimitProof = RateLimitProof.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.rateLimitProof\n });\n break;\n }\n case 31: {\n obj.ephemeral = reader.bool();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n WakuMessage.encode = (obj) => {\n return encodeMessage(obj, WakuMessage.codec());\n };\n WakuMessage.decode = (buf, opts) => {\n return decodeMessage(buf, WakuMessage.codec(), opts);\n };\n})(WakuMessage || (WakuMessage = {}));\n//# sourceMappingURL=store_v3.js.map","/* eslint-disable import/export */\n/* eslint-disable complexity */\n/* eslint-disable @typescript-eslint/no-namespace */\n/* eslint-disable @typescript-eslint/no-unnecessary-boolean-literal-compare */\n/* eslint-disable @typescript-eslint/no-empty-interface */\nimport { decodeMessage, encodeMessage, MaxLengthError, message } from 'protons-runtime';\nexport var PeerInfo;\n(function (PeerInfo) {\n let _codec;\n PeerInfo.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if (obj.enr != null) {\n w.uint32(10);\n w.bytes(obj.enr);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {};\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.enr = reader.bytes();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n PeerInfo.encode = (obj) => {\n return encodeMessage(obj, PeerInfo.codec());\n };\n PeerInfo.decode = (buf, opts) => {\n return decodeMessage(buf, PeerInfo.codec(), opts);\n };\n})(PeerInfo || (PeerInfo = {}));\nexport var PeerExchangeQuery;\n(function (PeerExchangeQuery) {\n let _codec;\n PeerExchangeQuery.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if (obj.numPeers != null) {\n w.uint32(8);\n w.uint64(obj.numPeers);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {};\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.numPeers = reader.uint64();\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n PeerExchangeQuery.encode = (obj) => {\n return encodeMessage(obj, PeerExchangeQuery.codec());\n };\n PeerExchangeQuery.decode = (buf, opts) => {\n return decodeMessage(buf, PeerExchangeQuery.codec(), opts);\n };\n})(PeerExchangeQuery || (PeerExchangeQuery = {}));\nexport var PeerExchangeResponse;\n(function (PeerExchangeResponse) {\n let _codec;\n PeerExchangeResponse.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if (obj.peerInfos != null) {\n for (const value of obj.peerInfos) {\n w.uint32(10);\n PeerInfo.codec().encode(value, w);\n }\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n peerInfos: []\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n if (opts.limits?.peerInfos != null && obj.peerInfos.length === opts.limits.peerInfos) {\n throw new MaxLengthError('Decode error - map field \"peerInfos\" had too many elements');\n }\n obj.peerInfos.push(PeerInfo.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.peerInfos$\n }));\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n PeerExchangeResponse.encode = (obj) => {\n return encodeMessage(obj, PeerExchangeResponse.codec());\n };\n PeerExchangeResponse.decode = (buf, opts) => {\n return decodeMessage(buf, PeerExchangeResponse.codec(), opts);\n };\n})(PeerExchangeResponse || (PeerExchangeResponse = {}));\nexport var PeerExchangeRPC;\n(function (PeerExchangeRPC) {\n let _codec;\n PeerExchangeRPC.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if (obj.query != null) {\n w.uint32(10);\n PeerExchangeQuery.codec().encode(obj.query, w);\n }\n if (obj.response != null) {\n w.uint32(18);\n PeerExchangeResponse.codec().encode(obj.response, w);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {};\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.query = PeerExchangeQuery.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.query\n });\n break;\n }\n case 2: {\n obj.response = PeerExchangeResponse.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.response\n });\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n PeerExchangeRPC.encode = (obj) => {\n return encodeMessage(obj, PeerExchangeRPC.codec());\n };\n PeerExchangeRPC.decode = (buf, opts) => {\n return decodeMessage(buf, PeerExchangeRPC.codec(), opts);\n };\n})(PeerExchangeRPC || (PeerExchangeRPC = {}));\n//# sourceMappingURL=peer_exchange.js.map","/* eslint-disable import/export */\n/* eslint-disable complexity */\n/* eslint-disable @typescript-eslint/no-namespace */\n/* eslint-disable @typescript-eslint/no-unnecessary-boolean-literal-compare */\n/* eslint-disable @typescript-eslint/no-empty-interface */\nimport { decodeMessage, encodeMessage, MaxLengthError, message } from 'protons-runtime';\nexport var WakuMetadataRequest;\n(function (WakuMetadataRequest) {\n let _codec;\n WakuMetadataRequest.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if (obj.clusterId != null) {\n w.uint32(8);\n w.uint32(obj.clusterId);\n }\n if (obj.shards != null) {\n for (const value of obj.shards) {\n w.uint32(16);\n w.uint32(value);\n }\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n shards: []\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.clusterId = reader.uint32();\n break;\n }\n case 2: {\n if (opts.limits?.shards != null && obj.shards.length === opts.limits.shards) {\n throw new MaxLengthError('Decode error - map field \"shards\" had too many elements');\n }\n obj.shards.push(reader.uint32());\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n WakuMetadataRequest.encode = (obj) => {\n return encodeMessage(obj, WakuMetadataRequest.codec());\n };\n WakuMetadataRequest.decode = (buf, opts) => {\n return decodeMessage(buf, WakuMetadataRequest.codec(), opts);\n };\n})(WakuMetadataRequest || (WakuMetadataRequest = {}));\nexport var WakuMetadataResponse;\n(function (WakuMetadataResponse) {\n let _codec;\n WakuMetadataResponse.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if (obj.clusterId != null) {\n w.uint32(8);\n w.uint32(obj.clusterId);\n }\n if (obj.shards != null) {\n for (const value of obj.shards) {\n w.uint32(16);\n w.uint32(value);\n }\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n shards: []\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.clusterId = reader.uint32();\n break;\n }\n case 2: {\n if (opts.limits?.shards != null && obj.shards.length === opts.limits.shards) {\n throw new MaxLengthError('Decode error - map field \"shards\" had too many elements');\n }\n obj.shards.push(reader.uint32());\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n WakuMetadataResponse.encode = (obj) => {\n return encodeMessage(obj, WakuMetadataResponse.codec());\n };\n WakuMetadataResponse.decode = (buf, opts) => {\n return decodeMessage(buf, WakuMetadataResponse.codec(), opts);\n };\n})(WakuMetadataResponse || (WakuMetadataResponse = {}));\n//# sourceMappingURL=metadata.js.map","import { createCodec, CODEC_TYPES } from '../codec.js';\nexport function enumeration(v) {\n function findValue(val) {\n // Use the reverse mapping to look up the enum key for the stored value\n // https://www.typescriptlang.org/docs/handbook/enums.html#reverse-mappings\n if (v[val.toString()] == null) {\n throw new Error('Invalid enum value');\n }\n return v[val];\n }\n const encode = function enumEncode(val, writer) {\n const enumValue = findValue(val);\n writer.int32(enumValue);\n };\n const decode = function enumDecode(reader) {\n const val = reader.int32();\n return findValue(val);\n };\n // @ts-expect-error yeah yeah\n return createCodec('enum', CODEC_TYPES.VARINT, encode, decode);\n}\n//# sourceMappingURL=enum.js.map","import { createCodec, CODEC_TYPES } from '../codec.js';\nexport function message(encode, decode) {\n return createCodec('message', CODEC_TYPES.LENGTH_DELIMITED, encode, decode);\n}\n//# sourceMappingURL=message.js.map","/**\n * @packageDocumentation\n *\n * This module contains serialization/deserialization code used when encoding/decoding protobufs.\n *\n * It should be declared as a dependency of your project:\n *\n * ```console\n * npm i protons-runtime\n * ```\n */\nexport { decodeMessage } from './decode.js';\nexport { encodeMessage } from './encode.js';\nexport { enumeration } from './codecs/enum.js';\nexport { message } from './codecs/message.js';\nexport { createReader as reader } from './utils/reader.js';\nexport { createWriter as writer } from './utils/writer.js';\n/**\n * This will be removed in a future release\n *\n * @deprecated\n */\nexport class CodeError extends Error {\n code;\n constructor(message, code) {\n super(message);\n this.code = code;\n }\n}\n/**\n * Thrown when a repeated field has too many elements\n */\nexport class MaxLengthError extends Error {\n /**\n * This will be removed in a future release\n *\n * @deprecated use the `.name` property instead\n */\n code = 'ERR_MAX_LENGTH';\n name = 'MaxLengthError';\n}\n/**\n * Thrown when a map has too many elements\n */\nexport class MaxSizeError extends Error {\n /**\n * This will be removed in a future release\n *\n * @deprecated use the `.name` property instead\n */\n code = 'ERR_MAX_SIZE';\n name = 'MaxSizeError';\n}\nexport class ParseError extends Error {\n /**\n * This will be removed in a future release\n *\n * @deprecated use the `.name` property instead\n */\n code = 'ERR_PARSE_ERROR';\n name = 'ParseError';\n}\nexport class NoMessagesFoundError extends Error {\n /**\n * This will be removed in a future release\n *\n * @deprecated use the `.name` property instead\n */\n code = 'ERR_NO_MESSAGES_FOUND';\n name = 'NoMessagesFoundError';\n}\n//# sourceMappingURL=index.js.map","export function isDefined(value) {\n return Boolean(value);\n}\n//# sourceMappingURL=is_defined.js.map","export function groupByContentTopic(values) {\n const groupedDecoders = new Map();\n values.forEach((value) => {\n let decs = groupedDecoders.get(value.contentTopic);\n if (!decs) {\n groupedDecoders.set(value.contentTopic, []);\n decs = groupedDecoders.get(value.contentTopic);\n }\n decs.push(value);\n });\n return groupedDecoders;\n}\n//# sourceMappingURL=group_by.js.map","const FRAME_RATE = 60;\n/**\n * Function that transforms IReceiver subscription to iterable stream of data.\n * @param receiver - object that allows to be subscribed to;\n * @param decoder - parameter to be passed to receiver for subscription;\n * @param options - options for receiver for subscription;\n * @param iteratorOptions - optional configuration for iterator;\n * @returns iterator and stop function to terminate it.\n */\nexport async function toAsyncIterator(receiver, decoder, iteratorOptions) {\n const iteratorDelay = iteratorOptions?.iteratorDelay ?? FRAME_RATE;\n const messages = [];\n let unsubscribe;\n unsubscribe = await receiver.subscribeWithUnsubscribe(decoder, (message) => {\n messages.push(message);\n });\n const isWithTimeout = Number.isInteger(iteratorOptions?.timeoutMs);\n const timeoutMs = iteratorOptions?.timeoutMs ?? 0;\n const startTime = Date.now();\n async function* iterator() {\n while (true) {\n if (isWithTimeout && Date.now() - startTime >= timeoutMs) {\n return;\n }\n await wait(iteratorDelay);\n const message = messages.shift();\n if (!unsubscribe && messages.length === 0) {\n return message;\n }\n if (!message && unsubscribe) {\n continue;\n }\n yield message;\n }\n }\n return {\n iterator: iterator(),\n async stop() {\n if (unsubscribe) {\n await unsubscribe();\n unsubscribe = undefined;\n }\n }\n };\n}\nfunction wait(ms) {\n return new Promise((resolve) => {\n setTimeout(resolve, ms);\n });\n}\n//# sourceMappingURL=to_async_iterator.js.map","function number(n) {\n if (!Number.isSafeInteger(n) || n < 0)\n throw new Error(`positive integer expected, not ${n}`);\n}\nfunction bool(b) {\n if (typeof b !== 'boolean')\n throw new Error(`boolean expected, not ${b}`);\n}\n// copied from utils\nexport function isBytes(a) {\n return (a instanceof Uint8Array ||\n (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array'));\n}\nfunction bytes(b, ...lengths) {\n if (!isBytes(b))\n throw new Error('Uint8Array expected');\n if (lengths.length > 0 && !lengths.includes(b.length))\n throw new Error(`Uint8Array expected of length ${lengths}, not of length=${b.length}`);\n}\nfunction hash(h) {\n if (typeof h !== 'function' || typeof h.create !== 'function')\n throw new Error('Hash should be wrapped by utils.wrapConstructor');\n number(h.outputLen);\n number(h.blockLen);\n}\nfunction exists(instance, checkFinished = true) {\n if (instance.destroyed)\n throw new Error('Hash instance has been destroyed');\n if (checkFinished && instance.finished)\n throw new Error('Hash#digest() has already been called');\n}\nfunction output(out, instance) {\n bytes(out);\n const min = instance.outputLen;\n if (out.length < min) {\n throw new Error(`digestInto() expects output buffer of length at least ${min}`);\n }\n}\nexport { number, bool, bytes, hash, exists, output };\nconst assert = { number, bool, bytes, hash, exists, output };\nexport default assert;\n//# sourceMappingURL=_assert.js.map","export const crypto = typeof globalThis === 'object' && 'crypto' in globalThis ? globalThis.crypto : undefined;\n//# sourceMappingURL=crypto.js.map","/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// We use WebCrypto aka globalThis.crypto, which exists in browsers and node.js 16+.\n// node.js versions earlier than v19 don't declare it in global scope.\n// For node.js, package.json#exports field mapping rewrites import\n// from `crypto` to `cryptoNode`, which imports native module.\n// Makes the utils un-importable in browsers without a bundler.\n// Once node.js 18 is deprecated (2025-04-30), we can just drop the import.\nimport { crypto } from '@noble/hashes/crypto';\nimport { bytes as abytes } from './_assert.js';\n// export { isBytes } from './_assert.js';\n// We can't reuse isBytes from _assert, because somehow this causes huge perf issues\nexport function isBytes(a) {\n return (a instanceof Uint8Array ||\n (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array'));\n}\n// Cast array to different type\nexport const u8 = (arr) => new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\nexport const u32 = (arr) => new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n// Cast array to view\nexport const createView = (arr) => new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n// The rotate right (circular right shift) operation for uint32\nexport const rotr = (word, shift) => (word << (32 - shift)) | (word >>> shift);\n// The rotate left (circular left shift) operation for uint32\nexport const rotl = (word, shift) => (word << shift) | ((word >>> (32 - shift)) >>> 0);\nexport const isLE = new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44;\n// The byte swap operation for uint32\nexport const byteSwap = (word) => ((word << 24) & 0xff000000) |\n ((word << 8) & 0xff0000) |\n ((word >>> 8) & 0xff00) |\n ((word >>> 24) & 0xff);\n// Conditionally byte swap if on a big-endian platform\nexport const byteSwapIfBE = isLE ? (n) => n : (n) => byteSwap(n);\n// In place byte swap for Uint32Array\nexport function byteSwap32(arr) {\n for (let i = 0; i < arr.length; i++) {\n arr[i] = byteSwap(arr[i]);\n }\n}\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'));\n/**\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes) {\n abytes(bytes);\n // pre-caching improves the speed 6x\n let hex = '';\n for (let i = 0; i < bytes.length; i++) {\n hex += hexes[bytes[i]];\n }\n return hex;\n}\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, _A: 65, _F: 70, _a: 97, _f: 102 };\nfunction asciiToBase16(char) {\n if (char >= asciis._0 && char <= asciis._9)\n return char - asciis._0;\n if (char >= asciis._A && char <= asciis._F)\n return char - (asciis._A - 10);\n if (char >= asciis._a && char <= asciis._f)\n return char - (asciis._a - 10);\n return;\n}\n/**\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex) {\n if (typeof hex !== 'string')\n throw new Error('hex string expected, got ' + typeof hex);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2)\n throw new Error('padded hex string expected, got unpadded hex of length ' + hl);\n const array = new Uint8Array(al);\n for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n const n1 = asciiToBase16(hex.charCodeAt(hi));\n const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n if (n1 === undefined || n2 === undefined) {\n const char = hex[hi] + hex[hi + 1];\n throw new Error('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n }\n array[ai] = n1 * 16 + n2;\n }\n return array;\n}\n// There is no setImmediate in browser and setTimeout is slow.\n// call of async fn will return Promise, which will be fullfiled only on\n// next scheduler queue processing step and this is exactly what we need.\nexport const nextTick = async () => { };\n// Returns control to thread each 'tick' ms to avoid blocking\nexport async function asyncLoop(iters, tick, cb) {\n let ts = Date.now();\n for (let i = 0; i < iters; i++) {\n cb(i);\n // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n const diff = Date.now() - ts;\n if (diff >= 0 && diff < tick)\n continue;\n await nextTick();\n ts += diff;\n }\n}\n/**\n * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nexport function utf8ToBytes(str) {\n if (typeof str !== 'string')\n throw new Error(`utf8ToBytes expected string, got ${typeof str}`);\n return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n/**\n * Normalizes (non-hex) string or Uint8Array to Uint8Array.\n * Warning: when Uint8Array is passed, it would NOT get copied.\n * Keep in mind for future mutable operations.\n */\nexport function toBytes(data) {\n if (typeof data === 'string')\n data = utf8ToBytes(data);\n abytes(data);\n return data;\n}\n/**\n * Copies several Uint8Arrays into one.\n */\nexport function concatBytes(...arrays) {\n let sum = 0;\n for (let i = 0; i < arrays.length; i++) {\n const a = arrays[i];\n abytes(a);\n sum += a.length;\n }\n const res = new Uint8Array(sum);\n for (let i = 0, pad = 0; i < arrays.length; i++) {\n const a = arrays[i];\n res.set(a, pad);\n pad += a.length;\n }\n return res;\n}\n// For runtime check if class implements interface\nexport class Hash {\n // Safe version that clones internal state\n clone() {\n return this._cloneInto();\n }\n}\nconst toStr = {}.toString;\nexport function checkOpts(defaults, opts) {\n if (opts !== undefined && toStr.call(opts) !== '[object Object]')\n throw new Error('Options should be object or undefined');\n const merged = Object.assign(defaults, opts);\n return merged;\n}\nexport function wrapConstructor(hashCons) {\n const hashC = (msg) => hashCons().update(toBytes(msg)).digest();\n const tmp = hashCons();\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = () => hashCons();\n return hashC;\n}\nexport function wrapConstructorWithOpts(hashCons) {\n const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();\n const tmp = hashCons({});\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts) => hashCons(opts);\n return hashC;\n}\nexport function wrapXOFConstructorWithOpts(hashCons) {\n const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();\n const tmp = hashCons({});\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts) => hashCons(opts);\n return hashC;\n}\n/**\n * Secure PRNG. Uses `crypto.getRandomValues`, which defers to OS.\n */\nexport function randomBytes(bytesLength = 32) {\n if (crypto && typeof crypto.getRandomValues === 'function') {\n return crypto.getRandomValues(new Uint8Array(bytesLength));\n }\n throw new Error('crypto.getRandomValues must be defined');\n}\n//# sourceMappingURL=utils.js.map","import { exists, output } from './_assert.js';\nimport { Hash, createView, toBytes } from './utils.js';\n// Polyfill for Safari 14\nfunction setBigUint64(view, byteOffset, value, isLE) {\n if (typeof view.setBigUint64 === 'function')\n return view.setBigUint64(byteOffset, value, isLE);\n const _32n = BigInt(32);\n const _u32_max = BigInt(0xffffffff);\n const wh = Number((value >> _32n) & _u32_max);\n const wl = Number(value & _u32_max);\n const h = isLE ? 4 : 0;\n const l = isLE ? 0 : 4;\n view.setUint32(byteOffset + h, wh, isLE);\n view.setUint32(byteOffset + l, wl, isLE);\n}\n// Choice: a ? b : c\nexport const Chi = (a, b, c) => (a & b) ^ (~a & c);\n// Majority function, true if any two inpust is true\nexport const Maj = (a, b, c) => (a & b) ^ (a & c) ^ (b & c);\n/**\n * Merkle-Damgard hash construction base class.\n * Could be used to create MD5, RIPEMD, SHA1, SHA2.\n */\nexport class HashMD extends Hash {\n constructor(blockLen, outputLen, padOffset, isLE) {\n super();\n this.blockLen = blockLen;\n this.outputLen = outputLen;\n this.padOffset = padOffset;\n this.isLE = isLE;\n this.finished = false;\n this.length = 0;\n this.pos = 0;\n this.destroyed = false;\n this.buffer = new Uint8Array(blockLen);\n this.view = createView(this.buffer);\n }\n update(data) {\n exists(this);\n const { view, buffer, blockLen } = this;\n data = toBytes(data);\n const len = data.length;\n for (let pos = 0; pos < len;) {\n const take = Math.min(blockLen - this.pos, len - pos);\n // Fast path: we have at least one block in input, cast it to view and process\n if (take === blockLen) {\n const dataView = createView(data);\n for (; blockLen <= len - pos; pos += blockLen)\n this.process(dataView, pos);\n continue;\n }\n buffer.set(data.subarray(pos, pos + take), this.pos);\n this.pos += take;\n pos += take;\n if (this.pos === blockLen) {\n this.process(view, 0);\n this.pos = 0;\n }\n }\n this.length += data.length;\n this.roundClean();\n return this;\n }\n digestInto(out) {\n exists(this);\n output(out, this);\n this.finished = true;\n // Padding\n // We can avoid allocation of buffer for padding completely if it\n // was previously not allocated here. But it won't change performance.\n const { buffer, view, blockLen, isLE } = this;\n let { pos } = this;\n // append the bit '1' to the message\n buffer[pos++] = 0b10000000;\n this.buffer.subarray(pos).fill(0);\n // we have less than padOffset left in buffer, so we cannot put length in\n // current block, need process it and pad again\n if (this.padOffset > blockLen - pos) {\n this.process(view, 0);\n pos = 0;\n }\n // Pad until full block byte with zeros\n for (let i = pos; i < blockLen; i++)\n buffer[i] = 0;\n // Note: sha512 requires length to be 128bit integer, but length in JS will overflow before that\n // You need to write around 2 exabytes (u64_max / 8 / (1024**6)) for this to happen.\n // So we just write lowest 64 bits of that value.\n setBigUint64(view, blockLen - 8, BigInt(this.length * 8), isLE);\n this.process(view, 0);\n const oview = createView(out);\n const len = this.outputLen;\n // NOTE: we do division by 4 later, which should be fused in single op with modulo by JIT\n if (len % 4)\n throw new Error('_sha2: outputLen should be aligned to 32bit');\n const outLen = len / 4;\n const state = this.get();\n if (outLen > state.length)\n throw new Error('_sha2: outputLen bigger than state');\n for (let i = 0; i < outLen; i++)\n oview.setUint32(4 * i, state[i], isLE);\n }\n digest() {\n const { buffer, outputLen } = this;\n this.digestInto(buffer);\n const res = buffer.slice(0, outputLen);\n this.destroy();\n return res;\n }\n _cloneInto(to) {\n to || (to = new this.constructor());\n to.set(...this.get());\n const { blockLen, buffer, length, finished, destroyed, pos } = this;\n to.length = length;\n to.pos = pos;\n to.finished = finished;\n to.destroyed = destroyed;\n if (length % blockLen)\n to.buffer.set(buffer);\n return to;\n }\n}\n//# sourceMappingURL=_md.js.map","import { HashMD, Chi, Maj } from './_md.js';\nimport { rotr, wrapConstructor } from './utils.js';\n// SHA2-256 need to try 2^128 hashes to execute birthday attack.\n// BTC network is doing 2^67 hashes/sec as per early 2023.\n// Round constants:\n// first 32 bits of the fractional parts of the cube roots of the first 64 primes 2..311)\n// prettier-ignore\nconst SHA256_K = /* @__PURE__ */ new Uint32Array([\n 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2\n]);\n// Initial state:\n// first 32 bits of the fractional parts of the square roots of the first 8 primes 2..19\n// prettier-ignore\nconst SHA256_IV = /* @__PURE__ */ new Uint32Array([\n 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19\n]);\n// Temporary buffer, not used to store anything between runs\n// Named this way because it matches specification.\nconst SHA256_W = /* @__PURE__ */ new Uint32Array(64);\nclass SHA256 extends HashMD {\n constructor() {\n super(64, 32, 8, false);\n // We cannot use array here since array allows indexing by variable\n // which means optimizer/compiler cannot use registers.\n this.A = SHA256_IV[0] | 0;\n this.B = SHA256_IV[1] | 0;\n this.C = SHA256_IV[2] | 0;\n this.D = SHA256_IV[3] | 0;\n this.E = SHA256_IV[4] | 0;\n this.F = SHA256_IV[5] | 0;\n this.G = SHA256_IV[6] | 0;\n this.H = SHA256_IV[7] | 0;\n }\n get() {\n const { A, B, C, D, E, F, G, H } = this;\n return [A, B, C, D, E, F, G, H];\n }\n // prettier-ignore\n set(A, B, C, D, E, F, G, H) {\n this.A = A | 0;\n this.B = B | 0;\n this.C = C | 0;\n this.D = D | 0;\n this.E = E | 0;\n this.F = F | 0;\n this.G = G | 0;\n this.H = H | 0;\n }\n process(view, offset) {\n // Extend the first 16 words into the remaining 48 words w[16..63] of the message schedule array\n for (let i = 0; i < 16; i++, offset += 4)\n SHA256_W[i] = view.getUint32(offset, false);\n for (let i = 16; i < 64; i++) {\n const W15 = SHA256_W[i - 15];\n const W2 = SHA256_W[i - 2];\n const s0 = rotr(W15, 7) ^ rotr(W15, 18) ^ (W15 >>> 3);\n const s1 = rotr(W2, 17) ^ rotr(W2, 19) ^ (W2 >>> 10);\n SHA256_W[i] = (s1 + SHA256_W[i - 7] + s0 + SHA256_W[i - 16]) | 0;\n }\n // Compression function main loop, 64 rounds\n let { A, B, C, D, E, F, G, H } = this;\n for (let i = 0; i < 64; i++) {\n const sigma1 = rotr(E, 6) ^ rotr(E, 11) ^ rotr(E, 25);\n const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;\n const sigma0 = rotr(A, 2) ^ rotr(A, 13) ^ rotr(A, 22);\n const T2 = (sigma0 + Maj(A, B, C)) | 0;\n H = G;\n G = F;\n F = E;\n E = (D + T1) | 0;\n D = C;\n C = B;\n B = A;\n A = (T1 + T2) | 0;\n }\n // Add the compressed chunk to the current hash value\n A = (A + this.A) | 0;\n B = (B + this.B) | 0;\n C = (C + this.C) | 0;\n D = (D + this.D) | 0;\n E = (E + this.E) | 0;\n F = (F + this.F) | 0;\n G = (G + this.G) | 0;\n H = (H + this.H) | 0;\n this.set(A, B, C, D, E, F, G, H);\n }\n roundClean() {\n SHA256_W.fill(0);\n }\n destroy() {\n this.set(0, 0, 0, 0, 0, 0, 0, 0);\n this.buffer.fill(0);\n }\n}\n// Constants from https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf\nclass SHA224 extends SHA256 {\n constructor() {\n super();\n this.A = 0xc1059ed8 | 0;\n this.B = 0x367cd507 | 0;\n this.C = 0x3070dd17 | 0;\n this.D = 0xf70e5939 | 0;\n this.E = 0xffc00b31 | 0;\n this.F = 0x68581511 | 0;\n this.G = 0x64f98fa7 | 0;\n this.H = 0xbefa4fa4 | 0;\n this.outputLen = 28;\n }\n}\n/**\n * SHA2-256 hash function\n * @param message - data that would be hashed\n */\nexport const sha256 = /* @__PURE__ */ wrapConstructor(() => new SHA256());\nexport const sha224 = /* @__PURE__ */ wrapConstructor(() => new SHA224());\n//# sourceMappingURL=sha256.js.map","export var Protocols;\n(function (Protocols) {\n Protocols[\"Relay\"] = \"relay\";\n Protocols[\"Store\"] = \"store\";\n Protocols[\"LightPush\"] = \"lightpush\";\n Protocols[\"Filter\"] = \"filter\";\n})(Protocols || (Protocols = {}));\nexport var ProtocolError;\n(function (ProtocolError) {\n /** Could not determine the origin of the fault. Best to check connectivity and try again */\n ProtocolError[\"GENERIC_FAIL\"] = \"Generic error\";\n /**\n * Failure to protobuf encode the message. This is not recoverable and needs\n * further investigation.\n */\n ProtocolError[\"ENCODE_FAILED\"] = \"Failed to encode\";\n /**\n * Failure to protobuf decode the message. May be due to a remote peer issue,\n * ensuring that messages are sent via several peer enable mitigation of this error.\n */\n ProtocolError[\"DECODE_FAILED\"] = \"Failed to decode\";\n /**\n * The message payload is empty, making the message invalid. Ensure that a non-empty\n * payload is set on the outgoing message.\n */\n ProtocolError[\"EMPTY_PAYLOAD\"] = \"Payload is empty\";\n /**\n * The message size is above the maximum message size allowed on the Waku Network.\n * Compressing the message or using an alternative strategy for large messages is recommended.\n */\n ProtocolError[\"SIZE_TOO_BIG\"] = \"Size is too big\";\n /**\n * The PubsubTopic passed to the send function is not configured on the Waku node.\n * Please ensure that the PubsubTopic is used when initializing the Waku node.\n */\n ProtocolError[\"TOPIC_NOT_CONFIGURED\"] = \"Topic not configured\";\n /**\n * The pubsub topic configured on the decoder does not match the pubsub topic setup on the protocol.\n * Ensure that the pubsub topic used for decoder creation is the same as the one used for protocol.\n */\n ProtocolError[\"TOPIC_DECODER_MISMATCH\"] = \"Topic decoder mismatch\";\n /**\n * The topics passed in the decoders do not match each other, or don't exist at all.\n * Ensure that all the pubsub topics used in the decoders are valid and match each other.\n */\n ProtocolError[\"INVALID_DECODER_TOPICS\"] = \"Invalid decoder topics\";\n /**\n * Failure to find a peer with suitable protocols. This may due to a connection issue.\n * Mitigation can be: retrying after a given time period, display connectivity issue\n * to user or listening for `peer:connected:bootstrap` or `peer:connected:peer-exchange`\n * on the connection manager before retrying.\n */\n ProtocolError[\"NO_PEER_AVAILABLE\"] = \"No peer available\";\n /**\n * Failure to find a stream to the peer. This may be because the connection with the peer is not still alive.\n * Mitigation can be: retrying after a given time period, or mitigation for `NO_PEER_AVAILABLE` can be used.\n */\n ProtocolError[\"NO_STREAM_AVAILABLE\"] = \"No stream available\";\n /**\n * The remote peer did not behave as expected. Mitigation for `NO_PEER_AVAILABLE`\n * or `DECODE_FAILED` can be used.\n */\n ProtocolError[\"NO_RESPONSE\"] = \"No response received\";\n /**\n * The remote peer rejected the message. Information provided by the remote peer\n * is logged. Review message validity, or mitigation for `NO_PEER_AVAILABLE`\n * or `DECODE_FAILED` can be used.\n */\n ProtocolError[\"REMOTE_PEER_REJECTED\"] = \"Remote peer rejected\";\n /**\n * The protocol request timed out without a response. This may be due to a connection issue.\n * Mitigation can be: retrying after a given time period\n */\n ProtocolError[\"REQUEST_TIMEOUT\"] = \"Request timeout\";\n /**\n * Missing credentials info message.\n * nwaku: https://github.com/waku-org/nwaku/blob/c3cb06ac6c03f0f382d3941ea53b330f6a8dd127/waku/waku_rln_relay/group_manager/group_manager_base.nim#L186\n */\n ProtocolError[\"RLN_IDENTITY_MISSING\"] = \"Identity credentials are not set\";\n /**\n * Membership index missing info message.\n * nwaku: https://github.com/waku-org/nwaku/blob/c3cb06ac6c03f0f382d3941ea53b330f6a8dd127/waku/waku_rln_relay/group_manager/group_manager_base.nim#L188\n */\n ProtocolError[\"RLN_MEMBERSHIP_INDEX\"] = \"Membership index is not set\";\n /**\n * Message limit is missing.\n * nwaku: https://github.com/waku-org/nwaku/blob/c3cb06ac6c03f0f382d3941ea53b330f6a8dd127/waku/waku_rln_relay/group_manager/group_manager_base.nim#L190\n */\n ProtocolError[\"RLN_LIMIT_MISSING\"] = \"User message limit is not set\";\n /**\n * General proof generation error message.\n * nwaku: https://github.com/waku-org/nwaku/blob/c3cb06ac6c03f0f382d3941ea53b330f6a8dd127/waku/waku_rln_relay/group_manager/group_manager_base.nim#L201C19-L201C42\n */\n ProtocolError[\"RLN_PROOF_GENERATION\"] = \"Proof generation failed\";\n})(ProtocolError || (ProtocolError = {}));\n//# sourceMappingURL=protocols.js.map","export var Tags;\n(function (Tags) {\n Tags[\"BOOTSTRAP\"] = \"bootstrap\";\n Tags[\"PEER_EXCHANGE\"] = \"peer-exchange\";\n Tags[\"LOCAL\"] = \"local-peer-cache\";\n})(Tags || (Tags = {}));\nexport var EPeersByDiscoveryEvents;\n(function (EPeersByDiscoveryEvents) {\n EPeersByDiscoveryEvents[\"PEER_DISCOVERY_BOOTSTRAP\"] = \"peer:discovery:bootstrap\";\n EPeersByDiscoveryEvents[\"PEER_DISCOVERY_PEER_EXCHANGE\"] = \"peer:discovery:peer-exchange\";\n EPeersByDiscoveryEvents[\"PEER_CONNECT_BOOTSTRAP\"] = \"peer:connected:bootstrap\";\n EPeersByDiscoveryEvents[\"PEER_CONNECT_PEER_EXCHANGE\"] = \"peer:connected:peer-exchange\";\n})(EPeersByDiscoveryEvents || (EPeersByDiscoveryEvents = {}));\nexport var EConnectionStateEvents;\n(function (EConnectionStateEvents) {\n EConnectionStateEvents[\"CONNECTION_STATUS\"] = \"waku:connection\";\n})(EConnectionStateEvents || (EConnectionStateEvents = {}));\n//# sourceMappingURL=connection_manager.js.map","export const DNS_DISCOVERY_TAG = \"@waku/bootstrap\";\n//# sourceMappingURL=dns_discovery.js.map","/**\n * The default cluster ID for The Waku Network\n */\nexport const DEFAULT_CLUSTER_ID = 1;\n/**\n * DefaultShardInfo is default configuration for The Waku Network.\n */\nexport const DefaultShardInfo = {\n clusterId: DEFAULT_CLUSTER_ID,\n shards: [0, 1, 2, 3, 4, 5, 6, 7, 8]\n};\nexport const DefaultNetworkConfig = DefaultShardInfo;\n//# sourceMappingURL=constants.js.map","export var HealthStatus;\n(function (HealthStatus) {\n HealthStatus[\"Unhealthy\"] = \"Unhealthy\";\n HealthStatus[\"MinimallyHealthy\"] = \"MinimallyHealthy\";\n HealthStatus[\"SufficientlyHealthy\"] = \"SufficientlyHealthy\";\n})(HealthStatus || (HealthStatus = {}));\n//# sourceMappingURL=health_manager.js.map","import bases, {} from './util/bases.js';\n/**\n * Turns a `Uint8Array` into a string.\n *\n * Supports `utf8`, `utf-8` and any encoding supported by the multibase module.\n *\n * Also `ascii` which is similar to node's 'binary' encoding.\n */\nexport function toString(array, encoding = 'utf8') {\n const base = bases[encoding];\n if (base == null) {\n throw new Error(`Unsupported encoding \"${encoding}\"`);\n }\n // strip multibase prefix\n return base.encoder.encode(array).substring(1);\n}\n//# sourceMappingURL=to-string.js.map","import { fromString } from \"uint8arrays/from-string\";\nimport { toString } from \"uint8arrays/to-string\";\n/**\n * Convert input to a byte array.\n *\n * Handles both `0x` prefixed and non-prefixed strings.\n */\nexport function hexToBytes(hex) {\n if (typeof hex === \"string\") {\n const _hex = hex.replace(/^0x/i, \"\");\n return fromString(_hex.toLowerCase(), \"base16\");\n }\n return hex;\n}\nexport function numberToBytes(value) {\n const buffer = new ArrayBuffer(8);\n const view = new DataView(buffer);\n if (typeof value === \"number\") {\n view.setFloat64(0, value, false);\n }\n else {\n view.setBigInt64(0, value, false);\n }\n return new Uint8Array(buffer);\n}\n/**\n * Convert byte array to hex string (no `0x` prefix).\n */\nexport const bytesToHex = (bytes) => toString(bytes, \"base16\");\n/**\n * Decode byte array to utf-8 string.\n */\nexport const bytesToUtf8 = (b) => toString(b, \"utf8\");\n/**\n * Encode utf-8 string to byte array.\n */\nexport const utf8ToBytes = (s) => fromString(s, \"utf8\");\n/**\n * Concatenate using Uint8Arrays as `Buffer` has a different behavior with `DataView`\n */\nexport function concat(byteArrays, totalLength) {\n const len = totalLength ?? byteArrays.reduce((acc, curr) => acc + curr.length, 0);\n const res = new Uint8Array(len);\n let offset = 0;\n for (const bytes of byteArrays) {\n res.set(bytes, offset);\n offset += bytes.length;\n }\n return res;\n}\n//# sourceMappingURL=index.js.map","import { sha256 } from \"@noble/hashes/sha256\";\nimport { DEFAULT_CLUSTER_ID } from \"@waku/interfaces\";\nimport { concat, utf8ToBytes } from \"../../bytes/index.js\";\nimport { isAutoSharding, isStaticSharding } from \"./type_guards.js\";\nexport * from \"./type_guards.js\";\nexport function derivePubsubTopicsFromNetworkConfig(networkConfig) {\n if (isStaticSharding(networkConfig)) {\n if (networkConfig.shards.length === 0) {\n throw new Error(\"Invalid shards configuration: please provide at least one shard\");\n }\n return shardInfoToPubsubTopics(networkConfig);\n }\n else if (isAutoSharding(networkConfig)) {\n if (networkConfig.contentTopics.length === 0) {\n throw new Error(\"Invalid content topics configuration: please provide at least one content topic\");\n }\n return networkConfig.contentTopics.map((contentTopic) => contentTopicToPubsubTopic(contentTopic, networkConfig.clusterId));\n }\n else {\n throw new Error(\"Unknown shard config. Please use ShardInfo or ContentTopicInfo\");\n }\n}\nexport const singleShardInfoToPubsubTopic = (shardInfo) => {\n if (shardInfo.shard === undefined)\n throw new Error(\"Invalid shard\");\n return `/waku/2/rs/${shardInfo.clusterId ?? DEFAULT_CLUSTER_ID}/${shardInfo.shard}`;\n};\nexport const singleShardInfosToShardInfo = (singleShardInfos) => {\n if (singleShardInfos.length === 0)\n throw new Error(\"Invalid shard\");\n const clusterIds = singleShardInfos.map((shardInfo) => shardInfo.clusterId);\n if (new Set(clusterIds).size !== 1) {\n throw new Error(\"Passed shard infos have different clusterIds\");\n }\n const shards = singleShardInfos\n .map((shardInfo) => shardInfo.shard)\n .filter((shard) => shard !== undefined);\n return {\n clusterId: singleShardInfos[0].clusterId,\n shards\n };\n};\nexport const shardInfoToPubsubTopics = (shardInfo) => {\n if (\"contentTopics\" in shardInfo && shardInfo.contentTopics) {\n // Autosharding: explicitly defined content topics\n return Array.from(new Set(shardInfo.contentTopics.map((contentTopic) => contentTopicToPubsubTopic(contentTopic, shardInfo.clusterId))));\n }\n else if (\"shards\" in shardInfo) {\n // Static sharding\n if (shardInfo.shards === undefined)\n throw new Error(\"Invalid shard\");\n return Array.from(new Set(shardInfo.shards.map((index) => `/waku/2/rs/${shardInfo.clusterId ?? DEFAULT_CLUSTER_ID}/${index}`)));\n }\n else if (\"application\" in shardInfo && \"version\" in shardInfo) {\n // Autosharding: single shard from application and version\n return [\n contentTopicToPubsubTopic(`/${shardInfo.application}/${shardInfo.version}/default/default`, shardInfo.clusterId)\n ];\n }\n else {\n throw new Error(\"Missing required configuration in shard parameters\");\n }\n};\nexport const pubsubTopicToSingleShardInfo = (pubsubTopics) => {\n const parts = pubsubTopics.split(\"/\");\n if (parts.length != 6 ||\n parts[1] !== \"waku\" ||\n parts[2] !== \"2\" ||\n parts[3] !== \"rs\")\n throw new Error(\"Invalid pubsub topic\");\n const clusterId = parseInt(parts[4]);\n const shard = parseInt(parts[5]);\n if (isNaN(clusterId) || isNaN(shard))\n throw new Error(\"Invalid clusterId or shard\");\n return {\n clusterId,\n shard\n };\n};\nexport const pubsubTopicsToShardInfo = (pubsubTopics) => {\n const shardInfoSet = new Set();\n const clusterIds = new Set();\n for (const topic of pubsubTopics) {\n const { clusterId, shard } = pubsubTopicToSingleShardInfo(topic);\n shardInfoSet.add(`${clusterId}:${shard}`);\n clusterIds.add(clusterId);\n }\n if (shardInfoSet.size === 0) {\n throw new Error(\"No valid pubsub topics provided\");\n }\n if (clusterIds.size > 1) {\n throw new Error(\"Pubsub topics from multiple cluster IDs are not supported\");\n }\n const clusterId = clusterIds.values().next().value;\n const shards = Array.from(shardInfoSet).map((info) => parseInt(info.split(\":\")[1]));\n return {\n clusterId,\n shards\n };\n};\n//TODO: move part of BaseProtocol instead of utils\n// return `ProtocolError.TOPIC_NOT_CONFIGURED` instead of throwing\nexport function ensurePubsubTopicIsConfigured(pubsubTopic, configuredTopics) {\n if (!configuredTopics.includes(pubsubTopic)) {\n throw new Error(`Pubsub topic ${pubsubTopic} has not been configured on this instance. Configured topics are: ${configuredTopics}. Please update your configuration by passing in the topic during Waku node instantiation.`);\n }\n}\n/**\n * Given a string, will throw an error if it is not formatted as a valid content topic for autosharding based on https://rfc.vac.dev/spec/51/\n * @param contentTopic String to validate\n * @returns Object with each content topic field as an attribute\n */\nexport function ensureValidContentTopic(contentTopic) {\n const parts = contentTopic.split(\"/\");\n if (parts.length < 5 || parts.length > 6) {\n throw Error(\"Content topic format is invalid\");\n }\n // Validate generation field if present\n let generation = 0;\n if (parts.length == 6) {\n generation = parseInt(parts[1]);\n if (isNaN(generation)) {\n throw new Error(\"Invalid generation field in content topic\");\n }\n if (generation > 0) {\n throw new Error(\"Generation greater than 0 is not supported\");\n }\n }\n // Validate remaining fields\n const fields = parts.splice(-4);\n // Validate application field\n if (fields[0].length == 0) {\n throw new Error(\"Application field cannot be empty\");\n }\n // Validate version field\n if (fields[1].length == 0) {\n throw new Error(\"Version field cannot be empty\");\n }\n // Validate topic name field\n if (fields[2].length == 0) {\n throw new Error(\"Topic name field cannot be empty\");\n }\n // Validate encoding field\n if (fields[3].length == 0) {\n throw new Error(\"Encoding field cannot be empty\");\n }\n return {\n generation,\n application: fields[0],\n version: fields[1],\n topicName: fields[2],\n encoding: fields[3]\n };\n}\n/**\n * Given a string, determines which autoshard index to use for its pubsub topic.\n * Based on the algorithm described in the RFC: https://rfc.vac.dev/spec/51//#algorithm\n */\nexport function contentTopicToShardIndex(contentTopic, networkShards = 8) {\n const { application, version } = ensureValidContentTopic(contentTopic);\n const digest = sha256(concat([utf8ToBytes(application), utf8ToBytes(version)]));\n const dataview = new DataView(digest.buffer.slice(-8));\n return Number(dataview.getBigUint64(0, false) % BigInt(networkShards));\n}\nexport function contentTopicToPubsubTopic(contentTopic, clusterId = DEFAULT_CLUSTER_ID, networkShards = 8) {\n if (!contentTopic) {\n throw Error(\"Content topic must be specified\");\n }\n const shardIndex = contentTopicToShardIndex(contentTopic, networkShards);\n return `/waku/2/rs/${clusterId}/${shardIndex}`;\n}\n/**\n * Given an array of content topics, groups them together by their Pubsub topic as derived using the algorithm for autosharding.\n * If any of the content topics are not properly formatted, the function will throw an error.\n */\nexport function contentTopicsByPubsubTopic(contentTopics, clusterId = DEFAULT_CLUSTER_ID, networkShards = 8) {\n const groupedContentTopics = new Map();\n for (const contentTopic of contentTopics) {\n const pubsubTopic = contentTopicToPubsubTopic(contentTopic, clusterId, networkShards);\n let topics = groupedContentTopics.get(pubsubTopic);\n if (!topics) {\n groupedContentTopics.set(pubsubTopic, []);\n topics = groupedContentTopics.get(pubsubTopic);\n }\n topics.push(contentTopic);\n }\n return groupedContentTopics;\n}\n/**\n * Used when creating encoders/decoders to determine which pubsub topic to use\n */\nexport function determinePubsubTopic(contentTopic, \n// TODO: make it accept ShardInfo https://github.com/waku-org/js-waku/issues/2086\npubsubTopicShardInfo) {\n if (typeof pubsubTopicShardInfo == \"string\") {\n return pubsubTopicShardInfo;\n }\n return pubsubTopicShardInfo?.shard !== undefined\n ? singleShardInfoToPubsubTopic(pubsubTopicShardInfo)\n : contentTopicToPubsubTopic(contentTopic, pubsubTopicShardInfo?.clusterId ?? DEFAULT_CLUSTER_ID);\n}\n/**\n * Validates sharding configuration and sets defaults where possible.\n * @returns Validated sharding parameters, with any missing values set to defaults\n */\nexport const ensureShardingConfigured = (networkConfig) => {\n const clusterId = networkConfig.clusterId ?? DEFAULT_CLUSTER_ID;\n const shards = \"shards\" in networkConfig ? networkConfig.shards : [];\n const contentTopics = \"contentTopics\" in networkConfig ? networkConfig.contentTopics : [];\n const isShardsConfigured = shards && shards.length > 0;\n const isContentTopicsConfigured = contentTopics && contentTopics.length > 0;\n if (isShardsConfigured) {\n return {\n shardInfo: { clusterId, shards },\n pubsubTopics: shardInfoToPubsubTopics({ clusterId, shards })\n };\n }\n if (isContentTopicsConfigured) {\n const pubsubTopics = Array.from(new Set(contentTopics.map((topic) => contentTopicToPubsubTopic(topic, clusterId))));\n const shards = Array.from(new Set(contentTopics.map((topic) => contentTopicToShardIndex(topic))));\n return {\n shardInfo: { clusterId, shards },\n pubsubTopics\n };\n }\n throw new Error(\"Missing minimum required configuration options for static sharding or autosharding.\");\n};\n//# sourceMappingURL=index.js.map","export const decodeRelayShard = (bytes) => {\n // explicitly converting to Uint8Array to avoid Buffer\n // https://github.com/libp2p/js-libp2p/issues/2146\n bytes = new Uint8Array(bytes);\n if (bytes.length < 3)\n throw new Error(\"Insufficient data\");\n const view = new DataView(bytes.buffer);\n const clusterId = view.getUint16(0);\n const shards = [];\n if (bytes.length === 130) {\n // rsv format (Bit Vector)\n for (let i = 0; i < 1024; i++) {\n const byteIndex = Math.floor(i / 8) + 2; // Adjusted for the 2-byte cluster field\n const bitIndex = 7 - (i % 8);\n if (view.getUint8(byteIndex) & (1 << bitIndex)) {\n shards.push(i);\n }\n }\n }\n else {\n // rs format (Index List)\n const numIndices = view.getUint8(2);\n for (let i = 0, offset = 3; i < numIndices; i++, offset += 2) {\n if (offset + 1 >= bytes.length)\n throw new Error(\"Unexpected end of data\");\n shards.push(view.getUint16(offset));\n }\n }\n return { clusterId, shards };\n};\nexport const encodeRelayShard = (shardInfo) => {\n const { clusterId, shards } = shardInfo;\n const totalLength = shards.length >= 64 ? 130 : 3 + 2 * shards.length;\n const buffer = new ArrayBuffer(totalLength);\n const view = new DataView(buffer);\n view.setUint16(0, clusterId);\n if (shards.length >= 64) {\n // rsv format (Bit Vector)\n for (const index of shards) {\n const byteIndex = Math.floor(index / 8) + 2; // Adjusted for the 2-byte cluster field\n const bitIndex = 7 - (index % 8);\n view.setUint8(byteIndex, view.getUint8(byteIndex) | (1 << bitIndex));\n }\n }\n else {\n // rs format (Index List)\n view.setUint8(2, shards.length);\n for (let i = 0, offset = 3; i < shards.length; i++, offset += 2) {\n view.setUint16(offset, shards[i]);\n }\n }\n return new Uint8Array(buffer);\n};\n//# sourceMappingURL=relay_shard_codec.js.map","export async function delay(ms) {\n return new Promise((resolve) => setTimeout(resolve, ms));\n}\n//# sourceMappingURL=delay.js.map","import debug from \"debug\";\nconst APP_NAME = \"waku\";\nexport class Logger {\n _info;\n _warn;\n _error;\n static createDebugNamespace(level, prefix) {\n return prefix ? `${APP_NAME}:${level}:${prefix}` : `${APP_NAME}:${level}`;\n }\n constructor(prefix) {\n this._info = debug(Logger.createDebugNamespace(\"info\", prefix));\n this._warn = debug(Logger.createDebugNamespace(\"warn\", prefix));\n this._error = debug(Logger.createDebugNamespace(\"error\", prefix));\n }\n get info() {\n return this._info;\n }\n get warn() {\n return this._warn;\n }\n get error() {\n return this._error;\n }\n log(level, ...args) {\n const logger = this[level];\n logger(...args);\n }\n}\n//# sourceMappingURL=index.js.map","import { proto_message as proto } from \"@waku/proto\";\nimport { determinePubsubTopic, Logger } from \"@waku/utils\";\nconst log = new Logger(\"message:version-0\");\nconst OneMillion = BigInt(1_000_000);\nexport const Version = 0;\nexport { proto };\nexport class DecodedMessage {\n pubsubTopic;\n proto;\n constructor(pubsubTopic, proto) {\n this.pubsubTopic = pubsubTopic;\n this.proto = proto;\n }\n get ephemeral() {\n return Boolean(this.proto.ephemeral);\n }\n get payload() {\n return this.proto.payload;\n }\n get contentTopic() {\n return this.proto.contentTopic;\n }\n get _rawTimestamp() {\n return this.proto.timestamp;\n }\n get timestamp() {\n // In the case we receive a value that is bigger than JS's max number,\n // we catch the error and return undefined.\n try {\n if (this.proto.timestamp) {\n // nanoseconds 10^-9 to milliseconds 10^-3\n const timestamp = this.proto.timestamp / OneMillion;\n return new Date(Number(timestamp));\n }\n return;\n }\n catch (e) {\n return;\n }\n }\n get meta() {\n return this.proto.meta;\n }\n get version() {\n // https://rfc.vac.dev/spec/14/\n // > If omitted, the value SHOULD be interpreted as version 0.\n return this.proto.version ?? 0;\n }\n get rateLimitProof() {\n return this.proto.rateLimitProof;\n }\n}\nexport class Encoder {\n contentTopic;\n ephemeral;\n pubsubTopic;\n metaSetter;\n constructor(contentTopic, ephemeral = false, pubsubTopic, metaSetter) {\n this.contentTopic = contentTopic;\n this.ephemeral = ephemeral;\n this.pubsubTopic = pubsubTopic;\n this.metaSetter = metaSetter;\n if (!contentTopic || contentTopic === \"\") {\n throw new Error(\"Content topic must be specified\");\n }\n }\n async toWire(message) {\n return proto.WakuMessage.encode(await this.toProtoObj(message));\n }\n async toProtoObj(message) {\n const timestamp = message.timestamp ?? new Date();\n const protoMessage = {\n payload: message.payload,\n version: Version,\n contentTopic: this.contentTopic,\n timestamp: BigInt(timestamp.valueOf()) * OneMillion,\n meta: undefined,\n rateLimitProof: message.rateLimitProof,\n ephemeral: this.ephemeral\n };\n if (this.metaSetter) {\n const meta = this.metaSetter(protoMessage);\n return { ...protoMessage, meta };\n }\n return protoMessage;\n }\n}\n/**\n * Creates an encoder that encode messages without Waku level encryption or signature.\n *\n * An encoder is used to encode messages in the [14/WAKU2-MESSAGE](https://rfc.vac.dev/spec/14/)\n * format to be sent over the Waku network. The resulting encoder can then be\n * pass to { @link @waku/interfaces!ISender.send } to automatically encode outgoing\n * messages.\n */\nexport function createEncoder({ pubsubTopic, pubsubTopicShardInfo, contentTopic, ephemeral, metaSetter }) {\n return new Encoder(contentTopic, ephemeral, determinePubsubTopic(contentTopic, pubsubTopic ?? pubsubTopicShardInfo), metaSetter);\n}\nexport class Decoder {\n pubsubTopic;\n contentTopic;\n constructor(pubsubTopic, contentTopic) {\n this.pubsubTopic = pubsubTopic;\n this.contentTopic = contentTopic;\n if (!contentTopic || contentTopic === \"\") {\n throw new Error(\"Content topic must be specified\");\n }\n }\n fromWireToProtoObj(bytes) {\n const protoMessage = proto.WakuMessage.decode(bytes);\n return Promise.resolve({\n payload: protoMessage.payload,\n contentTopic: protoMessage.contentTopic,\n version: protoMessage.version ?? undefined,\n timestamp: protoMessage.timestamp ?? undefined,\n meta: protoMessage.meta ?? undefined,\n rateLimitProof: protoMessage.rateLimitProof ?? undefined,\n ephemeral: protoMessage.ephemeral ?? false\n });\n }\n async fromProtoObj(pubsubTopic, proto) {\n // https://rfc.vac.dev/spec/14/\n // > If omitted, the value SHOULD be interpreted as version 0.\n if (proto.version ?? 0 !== Version) {\n log.error(\"Failed to decode due to incorrect version, expected:\", Version, \", actual:\", proto.version);\n return Promise.resolve(undefined);\n }\n return new DecodedMessage(pubsubTopic, proto);\n }\n}\n/**\n * Creates a decoder that decode messages without Waku level encryption.\n *\n * A decoder is used to decode messages from the [14/WAKU2-MESSAGE](https://rfc.vac.dev/spec/14/)\n * format when received from the Waku network. The resulting decoder can then be\n * pass to { @link @waku/interfaces!IReceiver.subscribe } to automatically decode incoming\n * messages.\n *\n * @param contentTopic The resulting decoder will only decode messages with this content topic.\n */\nexport function createDecoder(contentTopic, pubsubTopicShardInfo) {\n return new Decoder(determinePubsubTopic(contentTopic, pubsubTopicShardInfo), contentTopic);\n}\n//# sourceMappingURL=version_0.js.map","/**\n * @packageDocumentation\n *\n * For when you need a one-liner to collect iterable values.\n *\n * @example\n *\n * ```javascript\n * import all from 'it-all'\n *\n * // This can also be an iterator, etc\n * const values = function * () {\n * yield * [0, 1, 2, 3, 4]\n * }\n *\n * const arr = all(values)\n *\n * console.info(arr) // 0, 1, 2, 3, 4\n * ```\n *\n * Async sources must be awaited:\n *\n * ```javascript\n * const values = async function * () {\n * yield * [0, 1, 2, 3, 4]\n * }\n *\n * const arr = await all(values())\n *\n * console.info(arr) // 0, 1, 2, 3, 4\n * ```\n */\nfunction isAsyncIterable(thing) {\n return thing[Symbol.asyncIterator] != null;\n}\nfunction all(source) {\n if (isAsyncIterable(source)) {\n return (async () => {\n const arr = [];\n for await (const entry of source) {\n arr.push(entry);\n }\n return arr;\n })();\n }\n const arr = [];\n for (const entry of source) {\n arr.push(entry);\n }\n return arr;\n}\nexport default all;\n//# sourceMappingURL=index.js.map","import { allocUnsafe } from '#alloc';\nimport { asUint8Array } from '#util/as-uint8array';\n/**\n * Returns a new Uint8Array created by concatenating the passed Uint8Arrays\n */\nexport function concat(arrays, length) {\n if (length == null) {\n length = arrays.reduce((acc, curr) => acc + curr.length, 0);\n }\n const output = allocUnsafe(length);\n let offset = 0;\n for (const arr of arrays) {\n output.set(arr, offset);\n offset += arr.length;\n }\n return asUint8Array(output);\n}\n//# sourceMappingURL=concat.js.map","/**\n * Returns true if the two passed Uint8Arrays have the same content\n */\nexport function equals(a, b) {\n if (a === b) {\n return true;\n }\n if (a.byteLength !== b.byteLength) {\n return false;\n }\n for (let i = 0; i < a.byteLength; i++) {\n if (a[i] !== b[i]) {\n return false;\n }\n }\n return true;\n}\n//# sourceMappingURL=equals.js.map","/**\n * @packageDocumentation\n *\n * A class that lets you do operations over a list of Uint8Arrays without\n * copying them.\n *\n * ```js\n * import { Uint8ArrayList } from 'uint8arraylist'\n *\n * const list = new Uint8ArrayList()\n * list.append(Uint8Array.from([0, 1, 2]))\n * list.append(Uint8Array.from([3, 4, 5]))\n *\n * list.subarray()\n * // -> Uint8Array([0, 1, 2, 3, 4, 5])\n *\n * list.consume(3)\n * list.subarray()\n * // -> Uint8Array([3, 4, 5])\n *\n * // you can also iterate over the list\n * for (const buf of list) {\n * // ..do something with `buf`\n * }\n *\n * list.subarray(0, 1)\n * // -> Uint8Array([0])\n * ```\n *\n * ## Converting Uint8ArrayLists to Uint8Arrays\n *\n * There are two ways to turn a `Uint8ArrayList` into a `Uint8Array` - `.slice` and `.subarray` and one way to turn a `Uint8ArrayList` into a `Uint8ArrayList` with different contents - `.sublist`.\n *\n * ### slice\n *\n * Slice follows the same semantics as [Uint8Array.slice](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/TypedArray/slice) in that it creates a new `Uint8Array` and copies bytes into it using an optional offset & length.\n *\n * ```js\n * const list = new Uint8ArrayList()\n * list.append(Uint8Array.from([0, 1, 2]))\n * list.append(Uint8Array.from([3, 4, 5]))\n *\n * list.slice(0, 1)\n * // -> Uint8Array([0])\n * ```\n *\n * ### subarray\n *\n * Subarray attempts to follow the same semantics as [Uint8Array.subarray](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/TypedArray/subarray) with one important different - this is a no-copy operation, unless the requested bytes span two internal buffers in which case it is a copy operation.\n *\n * ```js\n * const list = new Uint8ArrayList()\n * list.append(Uint8Array.from([0, 1, 2]))\n * list.append(Uint8Array.from([3, 4, 5]))\n *\n * list.subarray(0, 1)\n * // -> Uint8Array([0]) - no-copy\n *\n * list.subarray(2, 5)\n * // -> Uint8Array([2, 3, 4]) - copy\n * ```\n *\n * ### sublist\n *\n * Sublist creates and returns a new `Uint8ArrayList` that shares the underlying buffers with the original so is always a no-copy operation.\n *\n * ```js\n * const list = new Uint8ArrayList()\n * list.append(Uint8Array.from([0, 1, 2]))\n * list.append(Uint8Array.from([3, 4, 5]))\n *\n * list.sublist(0, 1)\n * // -> Uint8ArrayList([0]) - no-copy\n *\n * list.sublist(2, 5)\n * // -> Uint8ArrayList([2], [3, 4]) - no-copy\n * ```\n *\n * ## Inspiration\n *\n * Borrows liberally from [bl](https://www.npmjs.com/package/bl) but only uses native JS types.\n */\nimport { allocUnsafe, alloc } from 'uint8arrays/alloc';\nimport { concat } from 'uint8arrays/concat';\nimport { equals } from 'uint8arrays/equals';\nconst symbol = Symbol.for('@achingbrain/uint8arraylist');\nfunction findBufAndOffset(bufs, index) {\n if (index == null || index < 0) {\n throw new RangeError('index is out of bounds');\n }\n let offset = 0;\n for (const buf of bufs) {\n const bufEnd = offset + buf.byteLength;\n if (index < bufEnd) {\n return {\n buf,\n index: index - offset\n };\n }\n offset = bufEnd;\n }\n throw new RangeError('index is out of bounds');\n}\n/**\n * Check if object is a CID instance\n *\n * @example\n *\n * ```js\n * import { isUint8ArrayList, Uint8ArrayList } from 'uint8arraylist'\n *\n * isUint8ArrayList(true) // false\n * isUint8ArrayList([]) // false\n * isUint8ArrayList(new Uint8ArrayList()) // true\n * ```\n */\nexport function isUint8ArrayList(value) {\n return Boolean(value?.[symbol]);\n}\nexport class Uint8ArrayList {\n bufs;\n length;\n [symbol] = true;\n constructor(...data) {\n this.bufs = [];\n this.length = 0;\n if (data.length > 0) {\n this.appendAll(data);\n }\n }\n *[Symbol.iterator]() {\n yield* this.bufs;\n }\n get byteLength() {\n return this.length;\n }\n /**\n * Add one or more `bufs` to the end of this Uint8ArrayList\n */\n append(...bufs) {\n this.appendAll(bufs);\n }\n /**\n * Add all `bufs` to the end of this Uint8ArrayList\n */\n appendAll(bufs) {\n let length = 0;\n for (const buf of bufs) {\n if (buf instanceof Uint8Array) {\n length += buf.byteLength;\n this.bufs.push(buf);\n }\n else if (isUint8ArrayList(buf)) {\n length += buf.byteLength;\n this.bufs.push(...buf.bufs);\n }\n else {\n throw new Error('Could not append value, must be an Uint8Array or a Uint8ArrayList');\n }\n }\n this.length += length;\n }\n /**\n * Add one or more `bufs` to the start of this Uint8ArrayList\n */\n prepend(...bufs) {\n this.prependAll(bufs);\n }\n /**\n * Add all `bufs` to the start of this Uint8ArrayList\n */\n prependAll(bufs) {\n let length = 0;\n for (const buf of bufs.reverse()) {\n if (buf instanceof Uint8Array) {\n length += buf.byteLength;\n this.bufs.unshift(buf);\n }\n else if (isUint8ArrayList(buf)) {\n length += buf.byteLength;\n this.bufs.unshift(...buf.bufs);\n }\n else {\n throw new Error('Could not prepend value, must be an Uint8Array or a Uint8ArrayList');\n }\n }\n this.length += length;\n }\n /**\n * Read the value at `index`\n */\n get(index) {\n const res = findBufAndOffset(this.bufs, index);\n return res.buf[res.index];\n }\n /**\n * Set the value at `index` to `value`\n */\n set(index, value) {\n const res = findBufAndOffset(this.bufs, index);\n res.buf[res.index] = value;\n }\n /**\n * Copy bytes from `buf` to the index specified by `offset`\n */\n write(buf, offset = 0) {\n if (buf instanceof Uint8Array) {\n for (let i = 0; i < buf.length; i++) {\n this.set(offset + i, buf[i]);\n }\n }\n else if (isUint8ArrayList(buf)) {\n for (let i = 0; i < buf.length; i++) {\n this.set(offset + i, buf.get(i));\n }\n }\n else {\n throw new Error('Could not write value, must be an Uint8Array or a Uint8ArrayList');\n }\n }\n /**\n * Remove bytes from the front of the pool\n */\n consume(bytes) {\n // first, normalize the argument, in accordance with how Buffer does it\n bytes = Math.trunc(bytes);\n // do nothing if not a positive number\n if (Number.isNaN(bytes) || bytes <= 0) {\n return;\n }\n // if consuming all bytes, skip iterating\n if (bytes === this.byteLength) {\n this.bufs = [];\n this.length = 0;\n return;\n }\n while (this.bufs.length > 0) {\n if (bytes >= this.bufs[0].byteLength) {\n bytes -= this.bufs[0].byteLength;\n this.length -= this.bufs[0].byteLength;\n this.bufs.shift();\n }\n else {\n this.bufs[0] = this.bufs[0].subarray(bytes);\n this.length -= bytes;\n break;\n }\n }\n }\n /**\n * Extracts a section of an array and returns a new array.\n *\n * This is a copy operation as it is with Uint8Arrays and Arrays\n * - note this is different to the behaviour of Node Buffers.\n */\n slice(beginInclusive, endExclusive) {\n const { bufs, length } = this._subList(beginInclusive, endExclusive);\n return concat(bufs, length);\n }\n /**\n * Returns a alloc from the given start and end element index.\n *\n * In the best case where the data extracted comes from a single Uint8Array\n * internally this is a no-copy operation otherwise it is a copy operation.\n */\n subarray(beginInclusive, endExclusive) {\n const { bufs, length } = this._subList(beginInclusive, endExclusive);\n if (bufs.length === 1) {\n return bufs[0];\n }\n return concat(bufs, length);\n }\n /**\n * Returns a allocList from the given start and end element index.\n *\n * This is a no-copy operation.\n */\n sublist(beginInclusive, endExclusive) {\n const { bufs, length } = this._subList(beginInclusive, endExclusive);\n const list = new Uint8ArrayList();\n list.length = length;\n // don't loop, just set the bufs\n list.bufs = [...bufs];\n return list;\n }\n _subList(beginInclusive, endExclusive) {\n beginInclusive = beginInclusive ?? 0;\n endExclusive = endExclusive ?? this.length;\n if (beginInclusive < 0) {\n beginInclusive = this.length + beginInclusive;\n }\n if (endExclusive < 0) {\n endExclusive = this.length + endExclusive;\n }\n if (beginInclusive < 0 || endExclusive > this.length) {\n throw new RangeError('index is out of bounds');\n }\n if (beginInclusive === endExclusive) {\n return { bufs: [], length: 0 };\n }\n if (beginInclusive === 0 && endExclusive === this.length) {\n return { bufs: this.bufs, length: this.length };\n }\n const bufs = [];\n let offset = 0;\n for (let i = 0; i < this.bufs.length; i++) {\n const buf = this.bufs[i];\n const bufStart = offset;\n const bufEnd = bufStart + buf.byteLength;\n // for next loop\n offset = bufEnd;\n if (beginInclusive >= bufEnd) {\n // start after this buf\n continue;\n }\n const sliceStartInBuf = beginInclusive >= bufStart && beginInclusive < bufEnd;\n const sliceEndsInBuf = endExclusive > bufStart && endExclusive <= bufEnd;\n if (sliceStartInBuf && sliceEndsInBuf) {\n // slice is wholly contained within this buffer\n if (beginInclusive === bufStart && endExclusive === bufEnd) {\n // requested whole buffer\n bufs.push(buf);\n break;\n }\n // requested part of buffer\n const start = beginInclusive - bufStart;\n bufs.push(buf.subarray(start, start + (endExclusive - beginInclusive)));\n break;\n }\n if (sliceStartInBuf) {\n // slice starts in this buffer\n if (beginInclusive === 0) {\n // requested whole buffer\n bufs.push(buf);\n continue;\n }\n // requested part of buffer\n bufs.push(buf.subarray(beginInclusive - bufStart));\n continue;\n }\n if (sliceEndsInBuf) {\n if (endExclusive === bufEnd) {\n // requested whole buffer\n bufs.push(buf);\n break;\n }\n // requested part of buffer\n bufs.push(buf.subarray(0, endExclusive - bufStart));\n break;\n }\n // slice started before this buffer and ends after it\n bufs.push(buf);\n }\n return { bufs, length: endExclusive - beginInclusive };\n }\n indexOf(search, offset = 0) {\n if (!isUint8ArrayList(search) && !(search instanceof Uint8Array)) {\n throw new TypeError('The \"value\" argument must be a Uint8ArrayList or Uint8Array');\n }\n const needle = search instanceof Uint8Array ? search : search.subarray();\n offset = Number(offset ?? 0);\n if (isNaN(offset)) {\n offset = 0;\n }\n if (offset < 0) {\n offset = this.length + offset;\n }\n if (offset < 0) {\n offset = 0;\n }\n if (search.length === 0) {\n return offset > this.length ? this.length : offset;\n }\n // https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string-search_algorithm\n const M = needle.byteLength;\n if (M === 0) {\n throw new TypeError('search must be at least 1 byte long');\n }\n // radix\n const radix = 256;\n const rightmostPositions = new Int32Array(radix);\n // position of the rightmost occurrence of the byte c in the pattern\n for (let c = 0; c < radix; c++) {\n // -1 for bytes not in pattern\n rightmostPositions[c] = -1;\n }\n for (let j = 0; j < M; j++) {\n // rightmost position for bytes in pattern\n rightmostPositions[needle[j]] = j;\n }\n // Return offset of first match, -1 if no match\n const right = rightmostPositions;\n const lastIndex = this.byteLength - needle.byteLength;\n const lastPatIndex = needle.byteLength - 1;\n let skip;\n for (let i = offset; i <= lastIndex; i += skip) {\n skip = 0;\n for (let j = lastPatIndex; j >= 0; j--) {\n const char = this.get(i + j);\n if (needle[j] !== char) {\n skip = Math.max(1, j - right[char]);\n break;\n }\n }\n if (skip === 0) {\n return i;\n }\n }\n return -1;\n }\n getInt8(byteOffset) {\n const buf = this.subarray(byteOffset, byteOffset + 1);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n return view.getInt8(0);\n }\n setInt8(byteOffset, value) {\n const buf = allocUnsafe(1);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n view.setInt8(0, value);\n this.write(buf, byteOffset);\n }\n getInt16(byteOffset, littleEndian) {\n const buf = this.subarray(byteOffset, byteOffset + 2);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n return view.getInt16(0, littleEndian);\n }\n setInt16(byteOffset, value, littleEndian) {\n const buf = alloc(2);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n view.setInt16(0, value, littleEndian);\n this.write(buf, byteOffset);\n }\n getInt32(byteOffset, littleEndian) {\n const buf = this.subarray(byteOffset, byteOffset + 4);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n return view.getInt32(0, littleEndian);\n }\n setInt32(byteOffset, value, littleEndian) {\n const buf = alloc(4);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n view.setInt32(0, value, littleEndian);\n this.write(buf, byteOffset);\n }\n getBigInt64(byteOffset, littleEndian) {\n const buf = this.subarray(byteOffset, byteOffset + 8);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n return view.getBigInt64(0, littleEndian);\n }\n setBigInt64(byteOffset, value, littleEndian) {\n const buf = alloc(8);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n view.setBigInt64(0, value, littleEndian);\n this.write(buf, byteOffset);\n }\n getUint8(byteOffset) {\n const buf = this.subarray(byteOffset, byteOffset + 1);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n return view.getUint8(0);\n }\n setUint8(byteOffset, value) {\n const buf = allocUnsafe(1);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n view.setUint8(0, value);\n this.write(buf, byteOffset);\n }\n getUint16(byteOffset, littleEndian) {\n const buf = this.subarray(byteOffset, byteOffset + 2);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n return view.getUint16(0, littleEndian);\n }\n setUint16(byteOffset, value, littleEndian) {\n const buf = alloc(2);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n view.setUint16(0, value, littleEndian);\n this.write(buf, byteOffset);\n }\n getUint32(byteOffset, littleEndian) {\n const buf = this.subarray(byteOffset, byteOffset + 4);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n return view.getUint32(0, littleEndian);\n }\n setUint32(byteOffset, value, littleEndian) {\n const buf = alloc(4);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n view.setUint32(0, value, littleEndian);\n this.write(buf, byteOffset);\n }\n getBigUint64(byteOffset, littleEndian) {\n const buf = this.subarray(byteOffset, byteOffset + 8);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n return view.getBigUint64(0, littleEndian);\n }\n setBigUint64(byteOffset, value, littleEndian) {\n const buf = alloc(8);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n view.setBigUint64(0, value, littleEndian);\n this.write(buf, byteOffset);\n }\n getFloat32(byteOffset, littleEndian) {\n const buf = this.subarray(byteOffset, byteOffset + 4);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n return view.getFloat32(0, littleEndian);\n }\n setFloat32(byteOffset, value, littleEndian) {\n const buf = alloc(4);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n view.setFloat32(0, value, littleEndian);\n this.write(buf, byteOffset);\n }\n getFloat64(byteOffset, littleEndian) {\n const buf = this.subarray(byteOffset, byteOffset + 8);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n return view.getFloat64(0, littleEndian);\n }\n setFloat64(byteOffset, value, littleEndian) {\n const buf = alloc(8);\n const view = new DataView(buf.buffer, buf.byteOffset, buf.byteLength);\n view.setFloat64(0, value, littleEndian);\n this.write(buf, byteOffset);\n }\n equals(other) {\n if (other == null) {\n return false;\n }\n if (!(other instanceof Uint8ArrayList)) {\n return false;\n }\n if (other.bufs.length !== this.bufs.length) {\n return false;\n }\n for (let i = 0; i < this.bufs.length; i++) {\n if (!equals(this.bufs[i], other.bufs[i])) {\n return false;\n }\n }\n return true;\n }\n /**\n * Create a Uint8ArrayList from a pre-existing list of Uint8Arrays. Use this\n * method if you know the total size of all the Uint8Arrays ahead of time.\n */\n static fromUint8Arrays(bufs, length) {\n const list = new Uint8ArrayList();\n list.bufs = bufs;\n if (length == null) {\n length = bufs.reduce((acc, curr) => acc + curr.byteLength, 0);\n }\n list.length = length;\n return list;\n }\n}\n/*\nfunction indexOf (needle: Uint8Array, haystack: Uint8Array, offset = 0) {\n for (let i = offset; i < haystack.byteLength; i++) {\n for (let j = 0; j < needle.length; j++) {\n if (haystack[i + j] !== needle[j]) {\n break\n }\n\n if (j === needle.byteLength -1) {\n return i\n }\n }\n\n if (haystack.byteLength - i < needle.byteLength) {\n break\n }\n }\n\n return -1\n}\n*/\n//# sourceMappingURL=index.js.map","export function isAsyncIterable(thing) {\n return thing[Symbol.asyncIterator] != null;\n}\n//# sourceMappingURL=utils.js.map","import * as varint from 'uint8-varint';\nimport { Uint8ArrayList } from 'uint8arraylist';\nimport { allocUnsafe } from 'uint8arrays/alloc';\nimport { isAsyncIterable } from './utils.js';\nconst defaultEncoder = (length) => {\n const lengthLength = varint.encodingLength(length);\n const lengthBuf = allocUnsafe(lengthLength);\n varint.encode(length, lengthBuf);\n defaultEncoder.bytes = lengthLength;\n return lengthBuf;\n};\ndefaultEncoder.bytes = 0;\nexport function encode(source, options) {\n options = options ?? {};\n const encodeLength = options.lengthEncoder ?? defaultEncoder;\n function* maybeYield(chunk) {\n // length + data\n const length = encodeLength(chunk.byteLength);\n // yield only Uint8Arrays\n if (length instanceof Uint8Array) {\n yield length;\n }\n else {\n yield* length;\n }\n // yield only Uint8Arrays\n if (chunk instanceof Uint8Array) {\n yield chunk;\n }\n else {\n yield* chunk;\n }\n }\n if (isAsyncIterable(source)) {\n return (async function* () {\n for await (const chunk of source) {\n yield* maybeYield(chunk);\n }\n })();\n }\n return (function* () {\n for (const chunk of source) {\n yield* maybeYield(chunk);\n }\n })();\n}\nencode.single = (chunk, options) => {\n options = options ?? {};\n const encodeLength = options.lengthEncoder ?? defaultEncoder;\n return new Uint8ArrayList(encodeLength(chunk.byteLength), chunk);\n};\n//# sourceMappingURL=encode.js.map","/**\n * The reported length of the next data message was not a positive integer\n */\nexport class InvalidMessageLengthError extends Error {\n name = 'InvalidMessageLengthError';\n code = 'ERR_INVALID_MSG_LENGTH';\n}\n/**\n * The reported length of the next data message was larger than the configured\n * max allowable value\n */\nexport class InvalidDataLengthError extends Error {\n name = 'InvalidDataLengthError';\n code = 'ERR_MSG_DATA_TOO_LONG';\n}\n/**\n * The varint used to specify the length of the next data message contained more\n * bytes than the configured max allowable value\n */\nexport class InvalidDataLengthLengthError extends Error {\n name = 'InvalidDataLengthLengthError';\n code = 'ERR_MSG_LENGTH_TOO_LONG';\n}\n/**\n * The incoming stream ended before the expected number of bytes were read\n */\nexport class UnexpectedEOFError extends Error {\n name = 'UnexpectedEOFError';\n code = 'ERR_UNEXPECTED_EOF';\n}\n//# sourceMappingURL=errors.js.map","/* eslint max-depth: [\"error\", 6] */\nimport * as varint from 'uint8-varint';\nimport { Uint8ArrayList } from 'uint8arraylist';\nimport { InvalidDataLengthError, InvalidDataLengthLengthError, InvalidMessageLengthError, UnexpectedEOFError } from './errors.js';\nimport { isAsyncIterable } from './utils.js';\n// Maximum length of the length section of the message\nexport const MAX_LENGTH_LENGTH = 8; // Varint.encode(Number.MAX_SAFE_INTEGER).length\n// Maximum length of the data section of the message\nexport const MAX_DATA_LENGTH = 1024 * 1024 * 4;\nvar ReadMode;\n(function (ReadMode) {\n ReadMode[ReadMode[\"LENGTH\"] = 0] = \"LENGTH\";\n ReadMode[ReadMode[\"DATA\"] = 1] = \"DATA\";\n})(ReadMode || (ReadMode = {}));\nconst defaultDecoder = (buf) => {\n const length = varint.decode(buf);\n defaultDecoder.bytes = varint.encodingLength(length);\n return length;\n};\ndefaultDecoder.bytes = 0;\nexport function decode(source, options) {\n const buffer = new Uint8ArrayList();\n let mode = ReadMode.LENGTH;\n let dataLength = -1;\n const lengthDecoder = options?.lengthDecoder ?? defaultDecoder;\n const maxLengthLength = options?.maxLengthLength ?? MAX_LENGTH_LENGTH;\n const maxDataLength = options?.maxDataLength ?? MAX_DATA_LENGTH;\n function* maybeYield() {\n while (buffer.byteLength > 0) {\n if (mode === ReadMode.LENGTH) {\n // read length, ignore errors for short reads\n try {\n dataLength = lengthDecoder(buffer);\n if (dataLength < 0) {\n throw new InvalidMessageLengthError('Invalid message length');\n }\n if (dataLength > maxDataLength) {\n throw new InvalidDataLengthError('Message length too long');\n }\n const dataLengthLength = lengthDecoder.bytes;\n buffer.consume(dataLengthLength);\n if (options?.onLength != null) {\n options.onLength(dataLength);\n }\n mode = ReadMode.DATA;\n }\n catch (err) {\n if (err instanceof RangeError) {\n if (buffer.byteLength > maxLengthLength) {\n throw new InvalidDataLengthLengthError('Message length length too long');\n }\n break;\n }\n throw err;\n }\n }\n if (mode === ReadMode.DATA) {\n if (buffer.byteLength < dataLength) {\n // not enough data, wait for more\n break;\n }\n const data = buffer.sublist(0, dataLength);\n buffer.consume(dataLength);\n if (options?.onData != null) {\n options.onData(data);\n }\n yield data;\n mode = ReadMode.LENGTH;\n }\n }\n }\n if (isAsyncIterable(source)) {\n return (async function* () {\n for await (const buf of source) {\n buffer.append(buf);\n yield* maybeYield();\n }\n if (buffer.byteLength > 0) {\n throw new UnexpectedEOFError('Unexpected end of input');\n }\n })();\n }\n return (function* () {\n for (const buf of source) {\n buffer.append(buf);\n yield* maybeYield();\n }\n if (buffer.byteLength > 0) {\n throw new UnexpectedEOFError('Unexpected end of input');\n }\n })();\n}\ndecode.fromReader = (reader, options) => {\n let byteLength = 1; // Read single byte chunks until the length is known\n const varByteSource = (async function* () {\n while (true) {\n try {\n const { done, value } = await reader.next(byteLength);\n if (done === true) {\n return;\n }\n if (value != null) {\n yield value;\n }\n }\n catch (err) {\n if (err.code === 'ERR_UNDER_READ') {\n return { done: true, value: null };\n }\n throw err;\n }\n finally {\n // Reset the byteLength so we continue to check for varints\n byteLength = 1;\n }\n }\n }());\n /**\n * Once the length has been parsed, read chunk for that length\n */\n const onLength = (l) => { byteLength = l; };\n return decode(varByteSource, {\n ...(options ?? {}),\n onLength\n });\n};\n//# sourceMappingURL=decode.js.map","export default function pDefer() {\n\tconst deferred = {};\n\n\tdeferred.promise = new Promise((resolve, reject) => {\n\t\tdeferred.resolve = resolve;\n\t\tdeferred.reject = reject;\n\t});\n\n\treturn deferred;\n}\n","// ported from https://www.npmjs.com/package/fast-fifo\nclass FixedFIFO {\n buffer;\n mask;\n top;\n btm;\n next;\n constructor(hwm) {\n if (!(hwm > 0) || ((hwm - 1) & hwm) !== 0) {\n throw new Error('Max size for a FixedFIFO should be a power of two');\n }\n this.buffer = new Array(hwm);\n this.mask = hwm - 1;\n this.top = 0;\n this.btm = 0;\n this.next = null;\n }\n push(data) {\n if (this.buffer[this.top] !== undefined) {\n return false;\n }\n this.buffer[this.top] = data;\n this.top = (this.top + 1) & this.mask;\n return true;\n }\n shift() {\n const last = this.buffer[this.btm];\n if (last === undefined) {\n return undefined;\n }\n this.buffer[this.btm] = undefined;\n this.btm = (this.btm + 1) & this.mask;\n return last;\n }\n isEmpty() {\n return this.buffer[this.btm] === undefined;\n }\n}\nexport class FIFO {\n size;\n hwm;\n head;\n tail;\n constructor(options = {}) {\n this.hwm = options.splitLimit ?? 16;\n this.head = new FixedFIFO(this.hwm);\n this.tail = this.head;\n this.size = 0;\n }\n calculateSize(obj) {\n if (obj?.byteLength != null) {\n return obj.byteLength;\n }\n return 1;\n }\n push(val) {\n if (val?.value != null) {\n this.size += this.calculateSize(val.value);\n }\n if (!this.head.push(val)) {\n const prev = this.head;\n this.head = prev.next = new FixedFIFO(2 * this.head.buffer.length);\n this.head.push(val);\n }\n }\n shift() {\n let val = this.tail.shift();\n if (val === undefined && (this.tail.next != null)) {\n const next = this.tail.next;\n this.tail.next = null;\n this.tail = next;\n val = this.tail.shift();\n }\n if (val?.value != null) {\n this.size -= this.calculateSize(val.value);\n }\n return val;\n }\n isEmpty() {\n return this.head.isEmpty();\n }\n}\n//# sourceMappingURL=fifo.js.map","/**\n * @packageDocumentation\n *\n * An iterable that you can push values into.\n *\n * @example\n *\n * ```js\n * import { pushable } from 'it-pushable'\n *\n * const source = pushable()\n *\n * setTimeout(() => source.push('hello'), 100)\n * setTimeout(() => source.push('world'), 200)\n * setTimeout(() => source.end(), 300)\n *\n * const start = Date.now()\n *\n * for await (const value of source) {\n * console.log(`got \"${value}\" after ${Date.now() - start}ms`)\n * }\n * console.log(`done after ${Date.now() - start}ms`)\n *\n * // Output:\n * // got \"hello\" after 105ms\n * // got \"world\" after 207ms\n * // done after 309ms\n * ```\n *\n * @example\n *\n * ```js\n * import { pushableV } from 'it-pushable'\n * import all from 'it-all'\n *\n * const source = pushableV()\n *\n * source.push(1)\n * source.push(2)\n * source.push(3)\n * source.end()\n *\n * console.info(await all(source))\n *\n * // Output:\n * // [ [1, 2, 3] ]\n * ```\n */\nimport deferred from 'p-defer';\nimport { FIFO } from './fifo.js';\nexport class AbortError extends Error {\n type;\n code;\n constructor(message, code) {\n super(message ?? 'The operation was aborted');\n this.type = 'aborted';\n this.code = code ?? 'ABORT_ERR';\n }\n}\nexport function pushable(options = {}) {\n const getNext = (buffer) => {\n const next = buffer.shift();\n if (next == null) {\n return { done: true };\n }\n if (next.error != null) {\n throw next.error;\n }\n return {\n done: next.done === true,\n // @ts-expect-error if done is false, value will be present\n value: next.value\n };\n };\n return _pushable(getNext, options);\n}\nexport function pushableV(options = {}) {\n const getNext = (buffer) => {\n let next;\n const values = [];\n while (!buffer.isEmpty()) {\n next = buffer.shift();\n if (next == null) {\n break;\n }\n if (next.error != null) {\n throw next.error;\n }\n if (next.done === false) {\n // @ts-expect-error if done is false value should be pushed\n values.push(next.value);\n }\n }\n if (next == null) {\n return { done: true };\n }\n return {\n done: next.done === true,\n value: values\n };\n };\n return _pushable(getNext, options);\n}\nfunction _pushable(getNext, options) {\n options = options ?? {};\n let onEnd = options.onEnd;\n let buffer = new FIFO();\n let pushable;\n let onNext;\n let ended;\n let drain = deferred();\n const waitNext = async () => {\n try {\n if (!buffer.isEmpty()) {\n return getNext(buffer);\n }\n if (ended) {\n return { done: true };\n }\n return await new Promise((resolve, reject) => {\n onNext = (next) => {\n onNext = null;\n buffer.push(next);\n try {\n resolve(getNext(buffer));\n }\n catch (err) {\n reject(err);\n }\n return pushable;\n };\n });\n }\n finally {\n if (buffer.isEmpty()) {\n // settle promise in the microtask queue to give consumers a chance to\n // await after calling .push\n queueMicrotask(() => {\n drain.resolve();\n drain = deferred();\n });\n }\n }\n };\n const bufferNext = (next) => {\n if (onNext != null) {\n return onNext(next);\n }\n buffer.push(next);\n return pushable;\n };\n const bufferError = (err) => {\n buffer = new FIFO();\n if (onNext != null) {\n return onNext({ error: err });\n }\n buffer.push({ error: err });\n return pushable;\n };\n const push = (value) => {\n if (ended) {\n return pushable;\n }\n // @ts-expect-error `byteLength` is not declared on PushType\n if (options?.objectMode !== true && value?.byteLength == null) {\n throw new Error('objectMode was not true but tried to push non-Uint8Array value');\n }\n return bufferNext({ done: false, value });\n };\n const end = (err) => {\n if (ended)\n return pushable;\n ended = true;\n return (err != null) ? bufferError(err) : bufferNext({ done: true });\n };\n const _return = () => {\n buffer = new FIFO();\n end();\n return { done: true };\n };\n const _throw = (err) => {\n end(err);\n return { done: true };\n };\n pushable = {\n [Symbol.asyncIterator]() { return this; },\n next: waitNext,\n return: _return,\n throw: _throw,\n push,\n end,\n get readableLength() {\n return buffer.size;\n },\n onEmpty: async (options) => {\n const signal = options?.signal;\n signal?.throwIfAborted();\n if (buffer.isEmpty()) {\n return;\n }\n let cancel;\n let listener;\n if (signal != null) {\n cancel = new Promise((resolve, reject) => {\n listener = () => {\n reject(new AbortError());\n };\n signal.addEventListener('abort', listener);\n });\n }\n try {\n await Promise.race([\n drain.promise,\n cancel\n ]);\n }\n finally {\n if (listener != null && signal != null) {\n signal?.removeEventListener('abort', listener);\n }\n }\n }\n };\n if (onEnd == null) {\n return pushable;\n }\n const _pushable = pushable;\n pushable = {\n [Symbol.asyncIterator]() { return this; },\n next() {\n return _pushable.next();\n },\n throw(err) {\n _pushable.throw(err);\n if (onEnd != null) {\n onEnd(err);\n onEnd = undefined;\n }\n return { done: true };\n },\n return() {\n _pushable.return();\n if (onEnd != null) {\n onEnd();\n onEnd = undefined;\n }\n return { done: true };\n },\n push,\n end(err) {\n _pushable.end(err);\n if (onEnd != null) {\n onEnd(err);\n onEnd = undefined;\n }\n return pushable;\n },\n get readableLength() {\n return _pushable.readableLength;\n },\n onEmpty: (opts) => {\n return _pushable.onEmpty(opts);\n }\n };\n return pushable;\n}\n//# sourceMappingURL=index.js.map","/**\n * @packageDocumentation\n *\n * Merge several (async)iterables into one, yield values as they arrive.\n *\n * Nb. sources are iterated over in parallel so the order of emitted items is not guaranteed.\n *\n * @example\n *\n * ```javascript\n * import merge from 'it-merge'\n * import all from 'it-all'\n *\n * // This can also be an iterator, generator, etc\n * const values1 = [0, 1, 2, 3, 4]\n * const values2 = [5, 6, 7, 8, 9]\n *\n * const arr = all(merge(values1, values2))\n *\n * console.info(arr) // 0, 1, 2, 3, 4, 5, 6, 7, 8, 9\n * ```\n *\n * Async sources must be awaited:\n *\n * ```javascript\n * import merge from 'it-merge'\n * import all from 'it-all'\n *\n * // This can also be an iterator, async iterator, generator, etc\n * const values1 = async function * () {\n * yield * [0, 1, 2, 3, 4]\n * }\n * const values2 = async function * () {\n * yield * [5, 6, 7, 8, 9]\n * }\n *\n * const arr = await all(merge(values1(), values2()))\n *\n * console.info(arr) // 0, 1, 5, 6, 2, 3, 4, 7, 8, 9 <- nb. order is not guaranteed\n * ```\n */\nimport { pushable } from 'it-pushable';\nfunction isAsyncIterable(thing) {\n return thing[Symbol.asyncIterator] != null;\n}\nfunction merge(...sources) {\n const syncSources = [];\n for (const source of sources) {\n if (!isAsyncIterable(source)) {\n syncSources.push(source);\n }\n }\n if (syncSources.length === sources.length) {\n // all sources are synchronous\n return (function* () {\n for (const source of syncSources) {\n yield* source;\n }\n })();\n }\n return (async function* () {\n const output = pushable({\n objectMode: true\n });\n void Promise.resolve().then(async () => {\n try {\n await Promise.all(sources.map(async (source) => {\n for await (const item of source) {\n output.push(item);\n }\n }));\n output.end();\n }\n catch (err) {\n output.end(err);\n }\n });\n yield* output;\n })();\n}\nexport default merge;\n//# sourceMappingURL=index.js.map","import { pushable } from 'it-pushable';\nimport merge from 'it-merge';\nexport function pipe(first, ...rest) {\n if (first == null) {\n throw new Error('Empty pipeline');\n }\n // Duplex at start: wrap in function and return duplex source\n if (isDuplex(first)) {\n const duplex = first;\n first = () => duplex.source;\n // Iterable at start: wrap in function\n }\n else if (isIterable(first) || isAsyncIterable(first)) {\n const source = first;\n first = () => source;\n }\n const fns = [first, ...rest];\n if (fns.length > 1) {\n // Duplex at end: use duplex sink\n if (isDuplex(fns[fns.length - 1])) {\n fns[fns.length - 1] = fns[fns.length - 1].sink;\n }\n }\n if (fns.length > 2) {\n // Duplex in the middle, consume source with duplex sink and return duplex source\n for (let i = 1; i < fns.length - 1; i++) {\n if (isDuplex(fns[i])) {\n fns[i] = duplexPipelineFn(fns[i]);\n }\n }\n }\n return rawPipe(...fns);\n}\nexport const rawPipe = (...fns) => {\n let res;\n while (fns.length > 0) {\n res = fns.shift()(res);\n }\n return res;\n};\nconst isAsyncIterable = (obj) => {\n return obj?.[Symbol.asyncIterator] != null;\n};\nconst isIterable = (obj) => {\n return obj?.[Symbol.iterator] != null;\n};\nconst isDuplex = (obj) => {\n if (obj == null) {\n return false;\n }\n return obj.sink != null && obj.source != null;\n};\nconst duplexPipelineFn = (duplex) => {\n return (source) => {\n const p = duplex.sink(source);\n if (p?.then != null) {\n const stream = pushable({\n objectMode: true\n });\n p.then(() => {\n stream.end();\n }, (err) => {\n stream.end(err);\n });\n let sourceWrap;\n const source = duplex.source;\n if (isAsyncIterable(source)) {\n sourceWrap = async function* () {\n yield* source;\n stream.end();\n };\n }\n else if (isIterable(source)) {\n sourceWrap = function* () {\n yield* source;\n stream.end();\n };\n }\n else {\n throw new Error('Unknown duplex source type - must be Iterable or AsyncIterable');\n }\n return merge(stream, sourceWrap());\n }\n return duplex.source;\n };\n};\n//# sourceMappingURL=index.js.map","import { Logger } from \"@waku/utils\";\nimport { selectConnection } from \"./utils.js\";\nconst CONNECTION_TIMEOUT = 5_000;\nconst RETRY_BACKOFF_BASE = 1_000;\nconst MAX_RETRIES = 3;\nexport class StreamManager {\n multicodec;\n getConnections;\n addEventListener;\n streamPool;\n log;\n constructor(multicodec, getConnections, addEventListener) {\n this.multicodec = multicodec;\n this.getConnections = getConnections;\n this.addEventListener = addEventListener;\n this.log = new Logger(`stream-manager:${multicodec}`);\n this.streamPool = new Map();\n this.addEventListener(\"peer:update\", this.handlePeerUpdateStreamPool);\n }\n async getStream(peer) {\n const peerIdStr = peer.id.toString();\n const streamPromise = this.streamPool.get(peerIdStr);\n if (!streamPromise) {\n return this.createStream(peer);\n }\n this.streamPool.delete(peerIdStr);\n this.prepareStream(peer);\n try {\n const stream = await streamPromise;\n if (stream && stream.status !== \"closed\") {\n return stream;\n }\n }\n catch (error) {\n this.log.warn(`Failed to get stream for ${peerIdStr} -- `, error);\n this.log.warn(\"Attempting to create a new stream for the peer\");\n }\n return this.createStream(peer);\n }\n async createStream(peer, retries = 0) {\n const connections = this.getConnections(peer.id);\n const connection = selectConnection(connections);\n if (!connection) {\n throw new Error(\"Failed to get a connection to the peer\");\n }\n try {\n return await connection.newStream(this.multicodec);\n }\n catch (error) {\n if (retries < MAX_RETRIES) {\n const backoff = RETRY_BACKOFF_BASE * Math.pow(2, retries);\n await new Promise((resolve) => setTimeout(resolve, backoff));\n return this.createStream(peer, retries + 1);\n }\n throw new Error(`Failed to create a new stream for ${peer.id.toString()} -- ` + error);\n }\n }\n prepareStream(peer) {\n const timeoutPromise = new Promise((resolve) => setTimeout(resolve, CONNECTION_TIMEOUT));\n const streamPromise = Promise.race([\n this.createStream(peer),\n timeoutPromise.then(() => {\n throw new Error(\"Connection timeout\");\n })\n ]).catch((error) => {\n this.log.error(`Failed to prepare a new stream for ${peer.id.toString()} -- `, error);\n });\n this.streamPool.set(peer.id.toString(), streamPromise);\n }\n handlePeerUpdateStreamPool = (evt) => {\n const { peer } = evt.detail;\n if (peer.protocols.includes(this.multicodec)) {\n const isConnected = this.isConnectedTo(peer.id);\n if (isConnected) {\n this.log.info(`Preemptively opening a stream to ${peer.id.toString()}`);\n this.prepareStream(peer);\n }\n else {\n const peerIdStr = peer.id.toString();\n this.streamPool.delete(peerIdStr);\n this.log.info(`Removed pending stream for disconnected peer ${peerIdStr}`);\n }\n }\n };\n isConnectedTo(peerId) {\n const connections = this.getConnections(peerId);\n return connections.some((connection) => connection.status === \"open\");\n }\n}\n//# sourceMappingURL=stream_manager.js.map","export function selectConnection(connections) {\n if (!connections.length)\n return;\n if (connections.length === 1)\n return connections[0];\n let latestConnection;\n connections.forEach((connection) => {\n if (connection.status === \"open\") {\n if (!latestConnection) {\n latestConnection = connection;\n }\n else if (connection.timeline.open > latestConnection.timeline.open) {\n latestConnection = connection;\n }\n }\n });\n return latestConnection;\n}\n//# sourceMappingURL=utils.js.map","import { pubsubTopicsToShardInfo } from \"@waku/utils\";\nimport { getConnectedPeersForProtocolAndShard, getPeersForProtocol, sortPeersByLatency } from \"@waku/utils/libp2p\";\nimport { filterPeersByDiscovery } from \"./filterPeers.js\";\nimport { StreamManager } from \"./stream_manager/index.js\";\n/**\n * A class with predefined helpers, to be used as a base to implement Waku\n * Protocols.\n */\nexport class BaseProtocol {\n multicodec;\n components;\n log;\n pubsubTopics;\n addLibp2pEventListener;\n removeLibp2pEventListener;\n streamManager;\n constructor(multicodec, components, log, pubsubTopics) {\n this.multicodec = multicodec;\n this.components = components;\n this.log = log;\n this.pubsubTopics = pubsubTopics;\n this.addLibp2pEventListener = components.events.addEventListener.bind(components.events);\n this.removeLibp2pEventListener = components.events.removeEventListener.bind(components.events);\n this.streamManager = new StreamManager(multicodec, components.connectionManager.getConnections.bind(components.connectionManager), this.addLibp2pEventListener);\n }\n async getStream(peer) {\n return this.streamManager.getStream(peer);\n }\n get peerStore() {\n return this.components.peerStore;\n }\n /**\n * Returns known peers from the address book (`libp2p.peerStore`) that support\n * the class protocol. Waku may or may not be currently connected to these\n * peers.\n */\n async allPeers() {\n return getPeersForProtocol(this.peerStore, [this.multicodec]);\n }\n async connectedPeers() {\n const peers = await this.allPeers();\n return peers.filter((peer) => {\n return (this.components.connectionManager.getConnections(peer.id).length > 0);\n });\n }\n /**\n * Retrieves a list of connected peers that support the protocol. The list is sorted by latency.\n *\n * @param numPeers - The total number of peers to retrieve. If 0, all peers are returned.\n * @param maxBootstrapPeers - The maximum number of bootstrap peers to retrieve.\n \n * @returns A list of peers that support the protocol sorted by latency.\n */\n async getPeers({ numPeers, maxBootstrapPeers } = {\n maxBootstrapPeers: 1,\n numPeers: 0\n }) {\n // Retrieve all connected peers that support the protocol & shard (if configured)\n const connectedPeersForProtocolAndShard = await getConnectedPeersForProtocolAndShard(this.components.connectionManager.getConnections(), this.peerStore, [this.multicodec], pubsubTopicsToShardInfo(this.pubsubTopics));\n // Filter the peers based on discovery & number of peers requested\n const filteredPeers = filterPeersByDiscovery(connectedPeersForProtocolAndShard, numPeers, maxBootstrapPeers);\n // Sort the peers by latency\n const sortedFilteredPeers = await sortPeersByLatency(this.peerStore, filteredPeers);\n if (sortedFilteredPeers.length === 0) {\n this.log.warn(\"No peers found. Ensure you have a connection to the network.\");\n }\n if (sortedFilteredPeers.length < numPeers) {\n this.log.warn(`Only ${sortedFilteredPeers.length} peers found. Requested ${numPeers}.`);\n }\n return sortedFilteredPeers;\n }\n}\n//# sourceMappingURL=base_protocol.js.map","import { bytesToUtf8 } from \"../bytes/index.js\";\nimport { decodeRelayShard } from \"../common/relay_shard_codec.js\";\n/**\n * Returns a pseudo-random peer that supports the given protocol.\n * Useful for protocols such as store and light push\n */\nexport function selectRandomPeer(peers) {\n if (peers.length === 0)\n return;\n const index = Math.round(Math.random() * (peers.length - 1));\n return peers[index];\n}\n/**\n * Function to sort peers by latency from lowest to highest\n * @param peerStore - The Libp2p PeerStore\n * @param peers - The list of peers to choose from\n * @returns Sorted array of peers by latency\n */\nexport async function sortPeersByLatency(peerStore, peers) {\n if (peers.length === 0)\n return [];\n const results = await Promise.all(peers.map(async (peer) => {\n try {\n const pingBytes = (await peerStore.get(peer.id)).metadata.get(\"ping\");\n if (!pingBytes)\n return { peer, ping: Infinity };\n const ping = Number(bytesToUtf8(pingBytes));\n return { peer, ping };\n }\n catch (error) {\n return { peer, ping: Infinity };\n }\n }));\n // filter out null values\n const validResults = results.filter((result) => result !== null);\n return validResults\n .sort((a, b) => a.ping - b.ping)\n .map((result) => result.peer);\n}\n/**\n * Returns the list of peers that supports the given protocol.\n */\nexport async function getPeersForProtocol(peerStore, protocols) {\n const peers = [];\n await peerStore.forEach((peer) => {\n for (let i = 0; i < protocols.length; i++) {\n if (peer.protocols.includes(protocols[i])) {\n peers.push(peer);\n break;\n }\n }\n });\n return peers;\n}\nexport async function getConnectedPeersForProtocolAndShard(connections, peerStore, protocols, shardInfo) {\n const openConnections = connections.filter((connection) => connection.status === \"open\");\n const peerPromises = openConnections.map(async (connection) => {\n const peer = await peerStore.get(connection.remotePeer);\n const supportsProtocol = protocols.some((protocol) => peer.protocols.includes(protocol));\n if (supportsProtocol) {\n if (shardInfo) {\n const encodedPeerShardInfo = peer.metadata.get(\"shardInfo\");\n const peerShardInfo = encodedPeerShardInfo && decodeRelayShard(encodedPeerShardInfo);\n if (peerShardInfo && shardInfo.clusterId === peerShardInfo.clusterId) {\n return peer;\n }\n }\n else {\n return peer;\n }\n }\n return null;\n });\n const peersWithNulls = await Promise.all(peerPromises);\n return peersWithNulls.filter((peer) => peer !== null);\n}\n//# sourceMappingURL=index.js.map","import { Tags } from \"@waku/interfaces\";\n/**\n * Retrieves a list of peers based on the specified criteria:\n * 1. If numPeers is 0, return all peers\n * 2. Bootstrap peers are prioritized\n * 3. Non-bootstrap peers are randomly selected to fill up to numPeers\n *\n * @param peers - The list of peers to filter from.\n * @param numPeers - The total number of peers to retrieve. If 0, all peers are returned, irrespective of `maxBootstrapPeers`.\n * @param maxBootstrapPeers - The maximum number of bootstrap peers to retrieve.\n * @returns An array of peers based on the specified criteria.\n */\nexport function filterPeersByDiscovery(peers, numPeers, maxBootstrapPeers) {\n // Collect the bootstrap peers up to the specified maximum\n let bootstrapPeers = peers\n .filter((peer) => peer.tags.has(Tags.BOOTSTRAP))\n .slice(0, maxBootstrapPeers);\n // If numPeers is less than the number of bootstrap peers, adjust the bootstrapPeers array\n if (numPeers > 0 && numPeers < bootstrapPeers.length) {\n bootstrapPeers = bootstrapPeers.slice(0, numPeers);\n }\n // Collect non-bootstrap peers\n const nonBootstrapPeers = peers.filter((peer) => !peer.tags.has(Tags.BOOTSTRAP));\n // If numPeers is 0, return all peers\n if (numPeers === 0) {\n return [...bootstrapPeers, ...nonBootstrapPeers];\n }\n // Initialize the list of selected peers with the bootstrap peers\n const selectedPeers = [...bootstrapPeers];\n // Fill up to numPeers with remaining random peers if needed\n while (selectedPeers.length < numPeers && nonBootstrapPeers.length > 0) {\n const randomIndex = Math.floor(Math.random() * nonBootstrapPeers.length);\n const randomPeer = nonBootstrapPeers.splice(randomIndex, 1)[0];\n selectedPeers.push(randomPeer);\n }\n return selectedPeers;\n}\n//# sourceMappingURL=filterPeers.js.map","const randomUUID = typeof crypto !== 'undefined' && crypto.randomUUID && crypto.randomUUID.bind(crypto);\nexport default {\n randomUUID\n};","// Unique ID creation requires a high quality random # generator. In the browser we therefore\n// require the crypto API and do not support built-in fallback to lower quality random number\n// generators (like Math.random()).\nlet getRandomValues;\nconst rnds8 = new Uint8Array(16);\nexport default function rng() {\n // lazy load so that environments that need to polyfill have a chance to do so\n if (!getRandomValues) {\n // getRandomValues needs to be invoked in a context where \"this\" is a Crypto implementation.\n getRandomValues = typeof crypto !== 'undefined' && crypto.getRandomValues && crypto.getRandomValues.bind(crypto);\n\n if (!getRandomValues) {\n throw new Error('crypto.getRandomValues() not supported. See https://github.com/uuidjs/uuid#getrandomvalues-not-supported');\n }\n }\n\n return getRandomValues(rnds8);\n}","import validate from './validate.js';\n/**\n * Convert array of 16 byte values to UUID string format of the form:\n * XXXXXXXX-XXXX-XXXX-XXXX-XXXXXXXXXXXX\n */\n\nconst byteToHex = [];\n\nfor (let i = 0; i < 256; ++i) {\n byteToHex.push((i + 0x100).toString(16).slice(1));\n}\n\nexport function unsafeStringify(arr, offset = 0) {\n // Note: Be careful editing this code! It's been tuned for performance\n // and works in ways you may not expect. See https://github.com/uuidjs/uuid/pull/434\n return byteToHex[arr[offset + 0]] + byteToHex[arr[offset + 1]] + byteToHex[arr[offset + 2]] + byteToHex[arr[offset + 3]] + '-' + byteToHex[arr[offset + 4]] + byteToHex[arr[offset + 5]] + '-' + byteToHex[arr[offset + 6]] + byteToHex[arr[offset + 7]] + '-' + byteToHex[arr[offset + 8]] + byteToHex[arr[offset + 9]] + '-' + byteToHex[arr[offset + 10]] + byteToHex[arr[offset + 11]] + byteToHex[arr[offset + 12]] + byteToHex[arr[offset + 13]] + byteToHex[arr[offset + 14]] + byteToHex[arr[offset + 15]];\n}\n\nfunction stringify(arr, offset = 0) {\n const uuid = unsafeStringify(arr, offset); // Consistency check for valid UUID. If this throws, it's likely due to one\n // of the following:\n // - One or more input array values don't map to a hex octet (leading to\n // \"undefined\" in the uuid)\n // - Invalid input values for the RFC `version` or `variant` fields\n\n if (!validate(uuid)) {\n throw TypeError('Stringified UUID is invalid');\n }\n\n return uuid;\n}\n\nexport default stringify;","import native from './native.js';\nimport rng from './rng.js';\nimport { unsafeStringify } from './stringify.js';\n\nfunction v4(options, buf, offset) {\n if (native.randomUUID && !buf && !options) {\n return native.randomUUID();\n }\n\n options = options || {};\n const rnds = options.random || (options.rng || rng)(); // Per 4.4, set bits for version and `clock_seq_hi_and_reserved`\n\n rnds[6] = rnds[6] & 0x0f | 0x40;\n rnds[8] = rnds[8] & 0x3f | 0x80; // Copy bytes to buffer, if provided\n\n if (buf) {\n offset = offset || 0;\n\n for (let i = 0; i < 16; ++i) {\n buf[offset + i] = rnds[i];\n }\n\n return buf;\n }\n\n return unsafeStringify(rnds);\n}\n\nexport default v4;","import { proto_filter_v2 as proto } from \"@waku/proto\";\nimport { v4 as uuid } from \"uuid\";\n/**\n * FilterPushRPC represents a message conforming to the Waku FilterPush protocol.\n * Protocol documentation: https://rfc.vac.dev/spec/12/\n */\nexport class FilterPushRpc {\n proto;\n constructor(proto) {\n this.proto = proto;\n }\n static decode(bytes) {\n const res = proto.MessagePush.decode(bytes);\n return new FilterPushRpc(res);\n }\n encode() {\n return proto.MessagePush.encode(this.proto);\n }\n get wakuMessage() {\n return this.proto.wakuMessage;\n }\n /**\n * Get the pubsub topic from the FilterPushRpc object.\n * @returns string\n */\n get pubsubTopic() {\n return this.proto.pubsubTopic;\n }\n}\nexport class FilterSubscribeRpc {\n proto;\n constructor(proto) {\n this.proto = proto;\n }\n static createSubscribeRequest(pubsubTopic, contentTopics) {\n return new FilterSubscribeRpc({\n requestId: uuid(),\n filterSubscribeType: proto.FilterSubscribeRequest.FilterSubscribeType.SUBSCRIBE,\n pubsubTopic,\n contentTopics\n });\n }\n static createUnsubscribeRequest(pubsubTopic, contentTopics) {\n return new FilterSubscribeRpc({\n requestId: uuid(),\n filterSubscribeType: proto.FilterSubscribeRequest.FilterSubscribeType.UNSUBSCRIBE,\n pubsubTopic,\n contentTopics\n });\n }\n static createUnsubscribeAllRequest(pubsubTopic) {\n return new FilterSubscribeRpc({\n requestId: uuid(),\n filterSubscribeType: proto.FilterSubscribeRequest.FilterSubscribeType.UNSUBSCRIBE_ALL,\n pubsubTopic,\n contentTopics: []\n });\n }\n static createSubscriberPingRequest() {\n return new FilterSubscribeRpc({\n requestId: uuid(),\n filterSubscribeType: proto.FilterSubscribeRequest.FilterSubscribeType.SUBSCRIBER_PING,\n pubsubTopic: \"\",\n contentTopics: []\n });\n }\n static decode(bytes) {\n const res = proto.FilterSubscribeRequest.decode(bytes);\n return new FilterSubscribeRpc(res);\n }\n encode() {\n return proto.FilterSubscribeRequest.encode(this.proto);\n }\n get filterSubscribeType() {\n return this.proto.filterSubscribeType;\n }\n get requestId() {\n return this.proto.requestId;\n }\n get pubsubTopic() {\n return this.proto.pubsubTopic;\n }\n get contentTopics() {\n return this.proto.contentTopics;\n }\n}\nexport class FilterSubscribeResponse {\n proto;\n constructor(proto) {\n this.proto = proto;\n }\n static decode(bytes) {\n const res = proto.FilterSubscribeResponse.decode(bytes);\n return new FilterSubscribeResponse(res);\n }\n encode() {\n return proto.FilterSubscribeResponse.encode(this.proto);\n }\n get statusCode() {\n return this.proto.statusCode;\n }\n get statusDesc() {\n return this.proto.statusDesc;\n }\n get requestId() {\n return this.proto.requestId;\n }\n}\n//# sourceMappingURL=filter_rpc.js.map","import { ProtocolError } from \"@waku/interfaces\";\nimport { Logger } from \"@waku/utils\";\nimport all from \"it-all\";\nimport * as lp from \"it-length-prefixed\";\nimport { pipe } from \"it-pipe\";\nimport { BaseProtocol } from \"../base_protocol.js\";\nimport { FilterPushRpc, FilterSubscribeResponse, FilterSubscribeRpc } from \"./filter_rpc.js\";\nconst log = new Logger(\"filter:v2\");\nexport const FilterCodecs = {\n SUBSCRIBE: \"/vac/waku/filter-subscribe/2.0.0-beta1\",\n PUSH: \"/vac/waku/filter-push/2.0.0-beta1\"\n};\nexport class FilterCore extends BaseProtocol {\n handleIncomingMessage;\n pubsubTopics;\n constructor(handleIncomingMessage, pubsubTopics, libp2p) {\n super(FilterCodecs.SUBSCRIBE, libp2p.components, log, pubsubTopics);\n this.handleIncomingMessage = handleIncomingMessage;\n this.pubsubTopics = pubsubTopics;\n libp2p\n .handle(FilterCodecs.PUSH, this.onRequest.bind(this), {\n maxInboundStreams: 100\n })\n .catch((e) => {\n log.error(\"Failed to register \", FilterCodecs.PUSH, e);\n });\n }\n async subscribe(pubsubTopic, peer, contentTopics) {\n const stream = await this.getStream(peer);\n const request = FilterSubscribeRpc.createSubscribeRequest(pubsubTopic, contentTopics);\n let res;\n try {\n res = await pipe([request.encode()], lp.encode, stream, lp.decode, async (source) => await all(source));\n }\n catch (error) {\n log.error(\"Failed to send subscribe request\", error);\n return {\n success: null,\n failure: {\n error: ProtocolError.GENERIC_FAIL,\n peerId: peer.id\n }\n };\n }\n const { statusCode, requestId, statusDesc } = FilterSubscribeResponse.decode(res[0].slice());\n if (statusCode < 200 || statusCode >= 300) {\n log.error(`Filter subscribe request ${requestId} failed with status code ${statusCode}: ${statusDesc}`);\n return {\n failure: {\n error: ProtocolError.REMOTE_PEER_REJECTED,\n peerId: peer.id\n },\n success: null\n };\n }\n return {\n failure: null,\n success: peer.id\n };\n }\n async unsubscribe(pubsubTopic, peer, contentTopics) {\n let stream;\n try {\n stream = await this.getStream(peer);\n }\n catch (error) {\n log.error(`Failed to get a stream for remote peer${peer.id.toString()}`, error);\n return {\n success: null,\n failure: {\n error: ProtocolError.NO_STREAM_AVAILABLE,\n peerId: peer.id\n }\n };\n }\n const unsubscribeRequest = FilterSubscribeRpc.createUnsubscribeRequest(pubsubTopic, contentTopics);\n try {\n await pipe([unsubscribeRequest.encode()], lp.encode, stream.sink);\n }\n catch (error) {\n log.error(\"Failed to send unsubscribe request\", error);\n return {\n success: null,\n failure: {\n error: ProtocolError.GENERIC_FAIL,\n peerId: peer.id\n }\n };\n }\n return {\n success: peer.id,\n failure: null\n };\n }\n async unsubscribeAll(pubsubTopic, peer) {\n const stream = await this.getStream(peer);\n const request = FilterSubscribeRpc.createUnsubscribeAllRequest(pubsubTopic);\n const res = await pipe([request.encode()], lp.encode, stream, lp.decode, async (source) => await all(source));\n if (!res || !res.length) {\n return {\n failure: {\n error: ProtocolError.NO_RESPONSE,\n peerId: peer.id\n },\n success: null\n };\n }\n const { statusCode, requestId, statusDesc } = FilterSubscribeResponse.decode(res[0].slice());\n if (statusCode < 200 || statusCode >= 300) {\n log.error(`Filter unsubscribe all request ${requestId} failed with status code ${statusCode}: ${statusDesc}`);\n return {\n failure: {\n error: ProtocolError.REMOTE_PEER_REJECTED,\n peerId: peer.id\n },\n success: null\n };\n }\n return {\n failure: null,\n success: peer.id\n };\n }\n async ping(peer) {\n let stream;\n try {\n stream = await this.getStream(peer);\n }\n catch (error) {\n log.error(`Failed to get a stream for remote peer${peer.id.toString()}`, error);\n return {\n success: null,\n failure: {\n error: ProtocolError.NO_STREAM_AVAILABLE,\n peerId: peer.id\n }\n };\n }\n const request = FilterSubscribeRpc.createSubscriberPingRequest();\n let res;\n try {\n res = await pipe([request.encode()], lp.encode, stream, lp.decode, async (source) => await all(source));\n }\n catch (error) {\n log.error(\"Failed to send ping request\", error);\n return {\n success: null,\n failure: {\n error: ProtocolError.GENERIC_FAIL,\n peerId: peer.id\n }\n };\n }\n if (!res || !res.length) {\n return {\n success: null,\n failure: {\n error: ProtocolError.NO_RESPONSE,\n peerId: peer.id\n }\n };\n }\n const { statusCode, requestId, statusDesc } = FilterSubscribeResponse.decode(res[0].slice());\n if (statusCode < 200 || statusCode >= 300) {\n log.error(`Filter ping request ${requestId} failed with status code ${statusCode}: ${statusDesc}`);\n return {\n success: null,\n failure: {\n error: ProtocolError.REMOTE_PEER_REJECTED,\n peerId: peer.id\n }\n };\n }\n return {\n success: peer.id,\n failure: null\n };\n }\n onRequest(streamData) {\n const { connection, stream } = streamData;\n const { remotePeer } = connection;\n log.info(`Received message from ${remotePeer.toString()}`);\n try {\n pipe(stream, lp.decode, async (source) => {\n for await (const bytes of source) {\n const response = FilterPushRpc.decode(bytes.slice());\n const { pubsubTopic, wakuMessage } = response;\n if (!wakuMessage) {\n log.error(\"Received empty message\");\n return;\n }\n if (!pubsubTopic) {\n log.error(\"Pubsub topic missing from push message\");\n return;\n }\n await this.handleIncomingMessage(pubsubTopic, wakuMessage, connection.remotePeer.toString());\n }\n }).then(() => {\n log.info(\"Receiving pipe closed.\");\n }, (e) => {\n log.error(\"Error with receiving pipe\", e);\n });\n }\n catch (e) {\n log.error(\"Error decoding message\", e);\n }\n }\n}\n//# sourceMappingURL=index.js.map","import { proto_lightpush as proto } from \"@waku/proto\";\nimport { v4 as uuid } from \"uuid\";\nexport class PushRpc {\n proto;\n constructor(proto) {\n this.proto = proto;\n }\n static createRequest(message, pubsubTopic) {\n return new PushRpc({\n requestId: uuid(),\n request: {\n message: message,\n pubsubTopic: pubsubTopic\n },\n response: undefined\n });\n }\n static decode(bytes) {\n const res = proto.PushRpc.decode(bytes);\n return new PushRpc(res);\n }\n encode() {\n return proto.PushRpc.encode(this.proto);\n }\n get query() {\n return this.proto.request;\n }\n get response() {\n return this.proto.response;\n }\n}\n//# sourceMappingURL=push_rpc.js.map","import { ProtocolError } from \"@waku/interfaces\";\n// should match nwaku\n// https://github.com/waku-org/nwaku/blob/c3cb06ac6c03f0f382d3941ea53b330f6a8dd127/waku/waku_rln_relay/rln_relay.nim#L309\n// https://github.com/waku-org/nwaku/blob/c3cb06ac6c03f0f382d3941ea53b330f6a8dd127/tests/waku_rln_relay/rln/waku_rln_relay_utils.nim#L20\nconst RLN_GENERATION_PREFIX_ERROR = \"could not generate rln-v2 proof\";\nexport const isRLNResponseError = (info) => {\n if (!info) {\n return false;\n }\n return info.includes(RLN_GENERATION_PREFIX_ERROR);\n};\nexport const matchRLNErrorMessage = (info) => {\n const rlnErrorMap = {\n [ProtocolError.RLN_IDENTITY_MISSING]: ProtocolError.RLN_IDENTITY_MISSING,\n [ProtocolError.RLN_MEMBERSHIP_INDEX]: ProtocolError.RLN_MEMBERSHIP_INDEX,\n [ProtocolError.RLN_LIMIT_MISSING]: ProtocolError.RLN_LIMIT_MISSING\n };\n const infoLowerCase = info.toLowerCase();\n for (const errorKey in rlnErrorMap) {\n if (infoLowerCase.includes(errorKey.toLowerCase())) {\n return rlnErrorMap[errorKey];\n }\n }\n return ProtocolError.RLN_PROOF_GENERATION;\n};\n//# sourceMappingURL=utils.js.map","import { ProtocolError } from \"@waku/interfaces\";\nimport { PushResponse } from \"@waku/proto\";\nimport { isMessageSizeUnderCap } from \"@waku/utils\";\nimport { Logger } from \"@waku/utils\";\nimport all from \"it-all\";\nimport * as lp from \"it-length-prefixed\";\nimport { pipe } from \"it-pipe\";\nimport { Uint8ArrayList } from \"uint8arraylist\";\nimport { BaseProtocol } from \"../base_protocol.js\";\nimport { PushRpc } from \"./push_rpc.js\";\nimport { isRLNResponseError, matchRLNErrorMessage } from \"./utils.js\";\nconst log = new Logger(\"light-push\");\nexport const LightPushCodec = \"/vac/waku/lightpush/2.0.0-beta1\";\nexport { PushResponse };\n/**\n * Implements the [Waku v2 Light Push protocol](https://rfc.vac.dev/spec/19/).\n */\nexport class LightPushCore extends BaseProtocol {\n pubsubTopics;\n constructor(pubsubTopics, libp2p) {\n super(LightPushCodec, libp2p.components, log, pubsubTopics);\n this.pubsubTopics = pubsubTopics;\n }\n async preparePushMessage(encoder, message) {\n try {\n if (!message.payload || message.payload.length === 0) {\n log.error(\"Failed to send waku light push: payload is empty\");\n return { query: null, error: ProtocolError.EMPTY_PAYLOAD };\n }\n if (!(await isMessageSizeUnderCap(encoder, message))) {\n log.error(\"Failed to send waku light push: message is bigger than 1MB\");\n return { query: null, error: ProtocolError.SIZE_TOO_BIG };\n }\n const protoMessage = await encoder.toProtoObj(message);\n if (!protoMessage) {\n log.error(\"Failed to encode to protoMessage, aborting push\");\n return {\n query: null,\n error: ProtocolError.ENCODE_FAILED\n };\n }\n const query = PushRpc.createRequest(protoMessage, encoder.pubsubTopic);\n return { query, error: null };\n }\n catch (error) {\n log.error(\"Failed to prepare push message\", error);\n return {\n query: null,\n error: ProtocolError.GENERIC_FAIL\n };\n }\n }\n async send(encoder, message, peer) {\n const { query, error: preparationError } = await this.preparePushMessage(encoder, message);\n if (preparationError || !query) {\n return {\n success: null,\n failure: {\n error: preparationError,\n peerId: peer.id\n }\n };\n }\n let stream;\n try {\n stream = await this.getStream(peer);\n }\n catch (error) {\n log.error(\"Failed to get stream\", error);\n return {\n success: null,\n failure: {\n error: ProtocolError.NO_STREAM_AVAILABLE,\n peerId: peer.id\n }\n };\n }\n let res;\n try {\n res = await pipe([query.encode()], lp.encode, stream, lp.decode, async (source) => await all(source));\n }\n catch (err) {\n log.error(\"Failed to send waku light push request\", err);\n return {\n success: null,\n failure: {\n error: ProtocolError.GENERIC_FAIL,\n peerId: peer.id\n }\n };\n }\n const bytes = new Uint8ArrayList();\n res.forEach((chunk) => {\n bytes.append(chunk);\n });\n let response;\n try {\n response = PushRpc.decode(bytes).response;\n }\n catch (err) {\n log.error(\"Failed to decode push reply\", err);\n return {\n success: null,\n failure: {\n error: ProtocolError.DECODE_FAILED,\n peerId: peer.id\n }\n };\n }\n if (!response) {\n log.error(\"Remote peer fault: No response in PushRPC\");\n return {\n success: null,\n failure: {\n error: ProtocolError.NO_RESPONSE,\n peerId: peer.id\n }\n };\n }\n if (isRLNResponseError(response.info)) {\n const rlnErrorCase = matchRLNErrorMessage(response.info);\n log.error(\"Remote peer rejected the message: \", rlnErrorCase);\n return {\n success: null,\n failure: {\n error: rlnErrorCase,\n peerId: peer.id\n }\n };\n }\n if (!response.isSuccess) {\n log.error(\"Remote peer rejected the message: \", response.info);\n return {\n success: null,\n failure: {\n error: ProtocolError.REMOTE_PEER_REJECTED,\n peerId: peer.id\n }\n };\n }\n return { success: peer.id, failure: null };\n }\n}\n//# sourceMappingURL=index.js.map","const MB = 1024 ** 2;\nconst SIZE_CAP_IN_MB = 1;\n/**\n * Return whether the size of the message is under the upper limit for the network.\n * This performs a protobuf encoding! If you have access to the fully encoded message,\n * use {@link isSizeUnderCapBuf} instead.\n * @param message\n * @param encoder\n */\nexport async function isMessageSizeUnderCap(encoder, message) {\n const buf = await encoder.toWire(message);\n if (!buf)\n return false;\n return isWireSizeUnderCap(buf);\n}\nexport const isWireSizeUnderCap = (buf) => buf.length / MB <= SIZE_CAP_IN_MB;\n//# sourceMappingURL=is_size_valid.js.map","const EmptyMessage = {\n payload: new Uint8Array(),\n contentTopic: \"\",\n version: undefined,\n timestamp: undefined,\n meta: undefined,\n rateLimitProof: undefined,\n ephemeral: undefined\n};\nexport function toProtoMessage(wire) {\n return { ...EmptyMessage, ...wire };\n}\n//# sourceMappingURL=to_proto_message.js.map","import { proto_store as proto } from \"@waku/proto\";\nimport { v4 as uuid } from \"uuid\";\n// https://github.com/waku-org/nwaku/blob/7205f95cff9f49ca0bb762e8fd0bf56a6a7f3b3b/waku/waku_store/common.nim#L12\nexport const DEFAULT_PAGE_SIZE = 20;\nexport const MAX_PAGE_SIZE = 100;\nconst ONE_MILLION = 1_000000;\nexport class StoreQueryRequest {\n proto;\n constructor(proto) {\n this.proto = proto;\n }\n static create(params) {\n const request = new StoreQueryRequest({\n ...params,\n requestId: uuid(),\n timeStart: params.timeStart\n ? BigInt(params.timeStart.getTime() * ONE_MILLION)\n : undefined,\n timeEnd: params.timeEnd\n ? BigInt(params.timeEnd.getTime() * ONE_MILLION)\n : undefined,\n messageHashes: params.messageHashes || [],\n paginationLimit: params.paginationLimit\n ? BigInt(params.paginationLimit)\n : undefined\n });\n // Validate request parameters based on RFC\n if ((params.pubsubTopic && !params.contentTopics) ||\n (!params.pubsubTopic && params.contentTopics)) {\n throw new Error(\"Both pubsubTopic and contentTopics must be set or unset\");\n }\n if (params.messageHashes &&\n (params.pubsubTopic ||\n params.contentTopics ||\n params.timeStart ||\n params.timeEnd)) {\n throw new Error(\"Message hash lookup queries cannot include content filter criteria\");\n }\n return request;\n }\n static decode(bytes) {\n const res = proto.StoreQueryRequest.decode(bytes);\n return new StoreQueryRequest(res);\n }\n encode() {\n return proto.StoreQueryRequest.encode(this.proto);\n }\n}\nexport class StoreQueryResponse {\n proto;\n constructor(proto) {\n this.proto = proto;\n }\n static decode(bytes) {\n const res = proto.StoreQueryResponse.decode(bytes);\n return new StoreQueryResponse(res);\n }\n encode() {\n return proto.StoreQueryResponse.encode(this.proto);\n }\n get statusCode() {\n return this.proto.statusCode;\n }\n get statusDesc() {\n return this.proto.statusDesc;\n }\n get messages() {\n return this.proto.messages;\n }\n get paginationCursor() {\n return this.proto.paginationCursor;\n }\n}\n//# sourceMappingURL=rpc.js.map","import { Logger } from \"@waku/utils\";\nimport all from \"it-all\";\nimport * as lp from \"it-length-prefixed\";\nimport { pipe } from \"it-pipe\";\nimport { Uint8ArrayList } from \"uint8arraylist\";\nimport { BaseProtocol } from \"../base_protocol.js\";\nimport { toProtoMessage } from \"../to_proto_message.js\";\nimport { DEFAULT_PAGE_SIZE, MAX_PAGE_SIZE, StoreQueryRequest, StoreQueryResponse } from \"./rpc.js\";\nconst log = new Logger(\"store\");\nexport const StoreCodec = \"/vac/waku/store-query/3.0.0\";\nexport class StoreCore extends BaseProtocol {\n pubsubTopics;\n constructor(pubsubTopics, libp2p) {\n super(StoreCodec, libp2p.components, log, pubsubTopics);\n this.pubsubTopics = pubsubTopics;\n }\n async *queryPerPage(queryOpts, decoders, peer) {\n if (queryOpts.contentTopics.toString() !==\n Array.from(decoders.keys()).toString()) {\n throw new Error(\"Internal error, the decoders should match the query's content topics\");\n }\n let currentCursor = queryOpts.paginationCursor;\n while (true) {\n const storeQueryRequest = StoreQueryRequest.create({\n ...queryOpts,\n paginationCursor: currentCursor\n });\n let stream;\n try {\n stream = await this.getStream(peer);\n }\n catch (e) {\n log.error(\"Failed to get stream\", e);\n break;\n }\n const res = await pipe([storeQueryRequest.encode()], lp.encode, stream, lp.decode, async (source) => await all(source));\n const bytes = new Uint8ArrayList();\n res.forEach((chunk) => {\n bytes.append(chunk);\n });\n const storeQueryResponse = StoreQueryResponse.decode(bytes);\n if (!storeQueryResponse.statusCode ||\n storeQueryResponse.statusCode >= 300) {\n const errorMessage = `Store query failed with status code: ${storeQueryResponse.statusCode}, description: ${storeQueryResponse.statusDesc}`;\n log.error(errorMessage);\n throw new Error(errorMessage);\n }\n if (!storeQueryResponse.messages || !storeQueryResponse.messages.length) {\n log.warn(\"Stopping pagination due to empty messages in response\");\n break;\n }\n log.info(`${storeQueryResponse.messages.length} messages retrieved from store`);\n const decodedMessages = storeQueryResponse.messages.map((protoMsg) => {\n if (!protoMsg.message) {\n return Promise.resolve(undefined);\n }\n const contentTopic = protoMsg.message.contentTopic;\n if (contentTopic) {\n const decoder = decoders.get(contentTopic);\n if (decoder) {\n return decoder.fromProtoObj(protoMsg.pubsubTopic || \"\", toProtoMessage(protoMsg.message));\n }\n }\n return Promise.resolve(undefined);\n });\n yield decodedMessages;\n if (queryOpts.paginationForward) {\n currentCursor =\n storeQueryResponse.messages[storeQueryResponse.messages.length - 1]\n .messageHash;\n }\n else {\n currentCursor = storeQueryResponse.messages[0].messageHash;\n }\n if (storeQueryResponse.messages.length > MAX_PAGE_SIZE &&\n storeQueryResponse.messages.length <\n (queryOpts.paginationLimit || DEFAULT_PAGE_SIZE)) {\n break;\n }\n }\n }\n}\n//# sourceMappingURL=index.js.map","export class TimeoutError extends Error {\n\tconstructor(message) {\n\t\tsuper(message);\n\t\tthis.name = 'TimeoutError';\n\t}\n}\n\n/**\nAn error to be thrown when the request is aborted by AbortController.\nDOMException is thrown instead of this Error when DOMException is available.\n*/\nexport class AbortError extends Error {\n\tconstructor(message) {\n\t\tsuper();\n\t\tthis.name = 'AbortError';\n\t\tthis.message = message;\n\t}\n}\n\n/**\nTODO: Remove AbortError and just throw DOMException when targeting Node 18.\n*/\nconst getDOMException = errorMessage => globalThis.DOMException === undefined\n\t? new AbortError(errorMessage)\n\t: new DOMException(errorMessage);\n\n/**\nTODO: Remove below function and just 'reject(signal.reason)' when targeting Node 18.\n*/\nconst getAbortedReason = signal => {\n\tconst reason = signal.reason === undefined\n\t\t? getDOMException('This operation was aborted.')\n\t\t: signal.reason;\n\n\treturn reason instanceof Error ? reason : getDOMException(reason);\n};\n\nexport default function pTimeout(promise, options) {\n\tconst {\n\t\tmilliseconds,\n\t\tfallback,\n\t\tmessage,\n\t\tcustomTimers = {setTimeout, clearTimeout},\n\t} = options;\n\n\tlet timer;\n\n\tconst wrappedPromise = new Promise((resolve, reject) => {\n\t\tif (typeof milliseconds !== 'number' || Math.sign(milliseconds) !== 1) {\n\t\t\tthrow new TypeError(`Expected \\`milliseconds\\` to be a positive number, got \\`${milliseconds}\\``);\n\t\t}\n\n\t\tif (options.signal) {\n\t\t\tconst {signal} = options;\n\t\t\tif (signal.aborted) {\n\t\t\t\treject(getAbortedReason(signal));\n\t\t\t}\n\n\t\t\tsignal.addEventListener('abort', () => {\n\t\t\t\treject(getAbortedReason(signal));\n\t\t\t});\n\t\t}\n\n\t\tif (milliseconds === Number.POSITIVE_INFINITY) {\n\t\t\tpromise.then(resolve, reject);\n\t\t\treturn;\n\t\t}\n\n\t\t// We create the error outside of `setTimeout` to preserve the stack trace.\n\t\tconst timeoutError = new TimeoutError();\n\n\t\ttimer = customTimers.setTimeout.call(undefined, () => {\n\t\t\tif (fallback) {\n\t\t\t\ttry {\n\t\t\t\t\tresolve(fallback());\n\t\t\t\t} catch (error) {\n\t\t\t\t\treject(error);\n\t\t\t\t}\n\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tif (typeof promise.cancel === 'function') {\n\t\t\t\tpromise.cancel();\n\t\t\t}\n\n\t\t\tif (message === false) {\n\t\t\t\tresolve();\n\t\t\t} else if (message instanceof Error) {\n\t\t\t\treject(message);\n\t\t\t} else {\n\t\t\t\ttimeoutError.message = message ?? `Promise timed out after ${milliseconds} milliseconds`;\n\t\t\t\treject(timeoutError);\n\t\t\t}\n\t\t}, milliseconds);\n\n\t\t(async () => {\n\t\t\ttry {\n\t\t\t\tresolve(await promise);\n\t\t\t} catch (error) {\n\t\t\t\treject(error);\n\t\t\t}\n\t\t})();\n\t});\n\n\tconst cancelablePromise = wrappedPromise.finally(() => {\n\t\tcancelablePromise.clear();\n\t});\n\n\tcancelablePromise.clear = () => {\n\t\tcustomTimers.clearTimeout.call(undefined, timer);\n\t\ttimer = undefined;\n\t};\n\n\treturn cancelablePromise;\n}\n","import pTimeout from 'p-timeout';\n\nconst normalizeEmitter = emitter => {\n\tconst addListener = emitter.addEventListener || emitter.on || emitter.addListener;\n\tconst removeListener = emitter.removeEventListener || emitter.off || emitter.removeListener;\n\n\tif (!addListener || !removeListener) {\n\t\tthrow new TypeError('Emitter is not compatible');\n\t}\n\n\treturn {\n\t\taddListener: addListener.bind(emitter),\n\t\tremoveListener: removeListener.bind(emitter),\n\t};\n};\n\nexport function pEventMultiple(emitter, event, options) {\n\tlet cancel;\n\tconst returnValue = new Promise((resolve, reject) => {\n\t\toptions = {\n\t\t\trejectionEvents: ['error'],\n\t\t\tmultiArgs: false,\n\t\t\tresolveImmediately: false,\n\t\t\t...options,\n\t\t};\n\n\t\tif (!(options.count >= 0 && (options.count === Number.POSITIVE_INFINITY || Number.isInteger(options.count)))) {\n\t\t\tthrow new TypeError('The `count` option should be at least 0 or more');\n\t\t}\n\n\t\toptions.signal?.throwIfAborted();\n\n\t\t// Allow multiple events\n\t\tconst events = [event].flat();\n\n\t\tconst items = [];\n\t\tconst {addListener, removeListener} = normalizeEmitter(emitter);\n\n\t\tconst onItem = (...arguments_) => {\n\t\t\tconst value = options.multiArgs ? arguments_ : arguments_[0];\n\n\t\t\t// eslint-disable-next-line unicorn/no-array-callback-reference\n\t\t\tif (options.filter && !options.filter(value)) {\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\titems.push(value);\n\n\t\t\tif (options.count === items.length) {\n\t\t\t\tcancel();\n\t\t\t\tresolve(items);\n\t\t\t}\n\t\t};\n\n\t\tconst rejectHandler = error => {\n\t\t\tcancel();\n\t\t\treject(error);\n\t\t};\n\n\t\tcancel = () => {\n\t\t\tfor (const event of events) {\n\t\t\t\tremoveListener(event, onItem);\n\t\t\t}\n\n\t\t\tfor (const rejectionEvent of options.rejectionEvents) {\n\t\t\t\tremoveListener(rejectionEvent, rejectHandler);\n\t\t\t}\n\t\t};\n\n\t\tfor (const event of events) {\n\t\t\taddListener(event, onItem);\n\t\t}\n\n\t\tfor (const rejectionEvent of options.rejectionEvents) {\n\t\t\taddListener(rejectionEvent, rejectHandler);\n\t\t}\n\n\t\tif (options.signal) {\n\t\t\toptions.signal.addEventListener('abort', () => {\n\t\t\t\trejectHandler(options.signal.reason);\n\t\t\t}, {once: true});\n\t\t}\n\n\t\tif (options.resolveImmediately) {\n\t\t\tresolve(items);\n\t\t}\n\t});\n\n\treturnValue.cancel = cancel;\n\n\tif (typeof options.timeout === 'number') {\n\t\tconst timeout = pTimeout(returnValue, {milliseconds: options.timeout});\n\t\ttimeout.cancel = cancel;\n\t\treturn timeout;\n\t}\n\n\treturn returnValue;\n}\n\nexport function pEvent(emitter, event, options) {\n\tif (typeof options === 'function') {\n\t\toptions = {filter: options};\n\t}\n\n\toptions = {\n\t\t...options,\n\t\tcount: 1,\n\t\tresolveImmediately: false,\n\t};\n\n\tconst arrayPromise = pEventMultiple(emitter, event, options);\n\tconst promise = arrayPromise.then(array => array[0]);\n\tpromise.cancel = arrayPromise.cancel;\n\n\treturn promise;\n}\n\nexport function pEventIterator(emitter, event, options) {\n\tif (typeof options === 'function') {\n\t\toptions = {filter: options};\n\t}\n\n\t// Allow multiple events\n\tconst events = [event].flat();\n\n\toptions = {\n\t\trejectionEvents: ['error'],\n\t\tresolutionEvents: [],\n\t\tlimit: Number.POSITIVE_INFINITY,\n\t\tmultiArgs: false,\n\t\t...options,\n\t};\n\n\tconst {limit} = options;\n\tconst isValidLimit = limit >= 0 && (limit === Number.POSITIVE_INFINITY || Number.isInteger(limit));\n\tif (!isValidLimit) {\n\t\tthrow new TypeError('The `limit` option should be a non-negative integer or Infinity');\n\t}\n\n\toptions.signal?.throwIfAborted();\n\n\tif (limit === 0) {\n\t\t// Return an empty async iterator to avoid any further cost\n\t\treturn {\n\t\t\t[Symbol.asyncIterator]() {\n\t\t\t\treturn this;\n\t\t\t},\n\t\t\tasync next() {\n\t\t\t\treturn {\n\t\t\t\t\tdone: true,\n\t\t\t\t\tvalue: undefined,\n\t\t\t\t};\n\t\t\t},\n\t\t};\n\t}\n\n\tconst {addListener, removeListener} = normalizeEmitter(emitter);\n\n\tlet isDone = false;\n\tlet error;\n\tlet hasPendingError = false;\n\tconst nextQueue = [];\n\tconst valueQueue = [];\n\tlet eventCount = 0;\n\tlet isLimitReached = false;\n\n\tconst valueHandler = (...arguments_) => {\n\t\teventCount++;\n\t\tisLimitReached = eventCount === limit;\n\n\t\tconst value = options.multiArgs ? arguments_ : arguments_[0];\n\n\t\tif (nextQueue.length > 0) {\n\t\t\tconst {resolve} = nextQueue.shift();\n\n\t\t\tresolve({done: false, value});\n\n\t\t\tif (isLimitReached) {\n\t\t\t\tcancel();\n\t\t\t}\n\n\t\t\treturn;\n\t\t}\n\n\t\tvalueQueue.push(value);\n\n\t\tif (isLimitReached) {\n\t\t\tcancel();\n\t\t}\n\t};\n\n\tconst cancel = () => {\n\t\tisDone = true;\n\n\t\tfor (const event of events) {\n\t\t\tremoveListener(event, valueHandler);\n\t\t}\n\n\t\tfor (const rejectionEvent of options.rejectionEvents) {\n\t\t\tremoveListener(rejectionEvent, rejectHandler);\n\t\t}\n\n\t\tfor (const resolutionEvent of options.resolutionEvents) {\n\t\t\tremoveListener(resolutionEvent, resolveHandler);\n\t\t}\n\n\t\twhile (nextQueue.length > 0) {\n\t\t\tconst {resolve} = nextQueue.shift();\n\t\t\tresolve({done: true, value: undefined});\n\t\t}\n\t};\n\n\tconst rejectHandler = (...arguments_) => {\n\t\terror = options.multiArgs ? arguments_ : arguments_[0];\n\n\t\tif (nextQueue.length > 0) {\n\t\t\tconst {reject} = nextQueue.shift();\n\t\t\treject(error);\n\t\t} else {\n\t\t\thasPendingError = true;\n\t\t}\n\n\t\tcancel();\n\t};\n\n\tconst resolveHandler = (...arguments_) => {\n\t\tconst value = options.multiArgs ? arguments_ : arguments_[0];\n\n\t\t// eslint-disable-next-line unicorn/no-array-callback-reference\n\t\tif (options.filter && !options.filter(value)) {\n\t\t\tcancel();\n\t\t\treturn;\n\t\t}\n\n\t\tif (nextQueue.length > 0) {\n\t\t\tconst {resolve} = nextQueue.shift();\n\t\t\tresolve({done: true, value});\n\t\t} else {\n\t\t\tvalueQueue.push(value);\n\t\t}\n\n\t\tcancel();\n\t};\n\n\tfor (const event of events) {\n\t\taddListener(event, valueHandler);\n\t}\n\n\tfor (const rejectionEvent of options.rejectionEvents) {\n\t\taddListener(rejectionEvent, rejectHandler);\n\t}\n\n\tfor (const resolutionEvent of options.resolutionEvents) {\n\t\taddListener(resolutionEvent, resolveHandler);\n\t}\n\n\tif (options.signal) {\n\t\toptions.signal.addEventListener('abort', () => {\n\t\t\trejectHandler(options.signal.reason);\n\t\t}, {once: true});\n\t}\n\n\treturn {\n\t\t[Symbol.asyncIterator]() {\n\t\t\treturn this;\n\t\t},\n\t\tasync next() {\n\t\t\tif (valueQueue.length > 0) {\n\t\t\t\tconst value = valueQueue.shift();\n\t\t\t\treturn {\n\t\t\t\t\tdone: isDone && valueQueue.length === 0 && !isLimitReached,\n\t\t\t\t\tvalue,\n\t\t\t\t};\n\t\t\t}\n\n\t\t\tif (hasPendingError) {\n\t\t\t\thasPendingError = false;\n\t\t\t\tthrow error;\n\t\t\t}\n\n\t\t\tif (isDone) {\n\t\t\t\treturn {\n\t\t\t\t\tdone: true,\n\t\t\t\t\tvalue: undefined,\n\t\t\t\t};\n\t\t\t}\n\n\t\t\treturn new Promise((resolve, reject) => {\n\t\t\t\tnextQueue.push({resolve, reject});\n\t\t\t});\n\t\t},\n\t\tasync return(value) {\n\t\t\tcancel();\n\t\t\treturn {\n\t\t\t\tdone: isDone,\n\t\t\t\tvalue,\n\t\t\t};\n\t\t},\n\t};\n}\n\nexport {TimeoutError} from 'p-timeout';\n","import { Protocols } from \"@waku/interfaces\";\nimport { Logger } from \"@waku/utils\";\nimport { pEvent } from \"p-event\";\nconst log = new Logger(\"wait-for-remote-peer\");\n//TODO: move this function within the Waku class: https://github.com/waku-org/js-waku/issues/1761\n/**\n * Wait for a remote peer to be ready given the passed protocols.\n * Must be used after attempting to connect to nodes, using\n * {@link @waku/sdk!WakuNode.dial} or a bootstrap method with\n * {@link @waku/sdk!createLightNode}.\n *\n * If the passed protocols is a GossipSub protocol, then it resolves only once\n * a peer is in a mesh, to help ensure that other peers will send and receive\n * message to us.\n *\n * @param waku The Waku Node\n * @param protocols The protocols that need to be enabled by remote peers.\n * @param timeoutMs A timeout value in milliseconds..\n *\n * @returns A promise that **resolves** if all desired protocols are fulfilled by\n * remote nodes, **rejects** if the timeoutMs is reached.\n * @throws If passing a protocol that is not mounted\n * @default Wait for remote peers with protocols enabled locally and no time out is applied.\n */\nexport async function waitForRemotePeer(waku, protocols, timeoutMs) {\n protocols = protocols ?? getEnabledProtocols(waku);\n if (!waku.isStarted())\n return Promise.reject(\"Waku node is not started\");\n const promises = [];\n if (protocols.includes(Protocols.Relay)) {\n if (!waku.relay)\n throw new Error(\"Cannot wait for Relay peer: protocol not mounted\");\n promises.push(waitForGossipSubPeerInMesh(waku.relay));\n }\n if (protocols.includes(Protocols.Store)) {\n if (!waku.store)\n throw new Error(\"Cannot wait for Store peer: protocol not mounted\");\n promises.push(waitForConnectedPeer(waku.store.protocol, waku.libp2p.services.metadata));\n }\n if (protocols.includes(Protocols.LightPush)) {\n if (!waku.lightPush)\n throw new Error(\"Cannot wait for LightPush peer: protocol not mounted\");\n promises.push(waitForConnectedPeer(waku.lightPush.protocol, waku.libp2p.services.metadata));\n }\n if (protocols.includes(Protocols.Filter)) {\n if (!waku.filter)\n throw new Error(\"Cannot wait for Filter peer: protocol not mounted\");\n promises.push(waitForConnectedPeer(waku.filter.protocol, waku.libp2p.services.metadata));\n }\n if (timeoutMs) {\n await rejectOnTimeout(Promise.all(promises), timeoutMs, \"Timed out waiting for a remote peer.\");\n }\n else {\n await Promise.all(promises);\n }\n}\n//TODO: move this function within protocol SDK class: https://github.com/waku-org/js-waku/issues/1761\n/**\n * Wait for a peer with the given protocol to be connected.\n * If sharding is enabled on the node, it will also wait for the peer to be confirmed by the metadata service.\n */\nasync function waitForConnectedPeer(protocol, metadataService) {\n const codec = protocol.multicodec;\n const peers = await protocol.connectedPeers();\n if (peers.length) {\n if (!metadataService) {\n log.info(`${codec} peer found: `, peers[0].id.toString());\n return;\n }\n // once a peer is connected, we need to confirm the metadata handshake with at least one of those peers if sharding is enabled\n try {\n await Promise.any(peers.map((peer) => metadataService.confirmOrAttemptHandshake(peer.id)));\n return;\n }\n catch (e) {\n if (e.code === \"ERR_CONNECTION_BEING_CLOSED\")\n log.error(`Connection with the peer was closed and possibly because it's on a different shard. Error: ${e}`);\n log.error(`Error waiting for handshake confirmation: ${e}`);\n }\n }\n log.info(`Waiting for ${codec} peer`);\n // else we'll just wait for the next peer to connect\n await new Promise((resolve) => {\n const cb = (evt) => {\n if (evt.detail?.protocols?.includes(codec)) {\n if (metadataService) {\n metadataService\n .confirmOrAttemptHandshake(evt.detail.peerId)\n .then(() => {\n protocol.removeLibp2pEventListener(\"peer:identify\", cb);\n resolve();\n })\n .catch((e) => {\n if (e.code === \"ERR_CONNECTION_BEING_CLOSED\")\n log.error(`Connection with the peer was closed and possibly because it's on a different shard. Error: ${e}`);\n log.error(`Error waiting for handshake confirmation: ${e}`);\n });\n }\n else {\n protocol.removeLibp2pEventListener(\"peer:identify\", cb);\n resolve();\n }\n }\n };\n protocol.addLibp2pEventListener(\"peer:identify\", cb);\n });\n}\n/**\n * Wait for at least one peer with the given protocol to be connected and in the gossipsub\n * mesh for all pubsubTopics.\n */\nasync function waitForGossipSubPeerInMesh(waku) {\n let peers = waku.getMeshPeers();\n const pubsubTopics = waku.pubsubTopics;\n for (const topic of pubsubTopics) {\n while (peers.length == 0) {\n await pEvent(waku.gossipSub, \"gossipsub:heartbeat\");\n peers = waku.getMeshPeers(topic);\n }\n }\n}\nconst awaitTimeout = (ms, rejectReason) => new Promise((_resolve, reject) => setTimeout(() => reject(rejectReason), ms));\nasync function rejectOnTimeout(promise, timeoutMs, rejectReason) {\n await Promise.race([promise, awaitTimeout(timeoutMs, rejectReason)]);\n}\nfunction getEnabledProtocols(waku) {\n const protocols = [];\n if (waku.relay) {\n protocols.push(Protocols.Relay);\n }\n if (waku.filter) {\n protocols.push(Protocols.Filter);\n }\n if (waku.store) {\n protocols.push(Protocols.Store);\n }\n if (waku.lightPush) {\n protocols.push(Protocols.LightPush);\n }\n return protocols;\n}\n//# sourceMappingURL=wait_for_remote_peer.js.map","import { setMaxListeners } from './events.js';\n/**\n * An implementation of a typed event target\n * etc\n */\nexport class TypedEventEmitter extends EventTarget {\n #listeners = new Map();\n constructor() {\n super();\n // silence MaxListenersExceededWarning warning on Node.js, this is a red\n // herring almost all of the time\n setMaxListeners(Infinity, this);\n }\n listenerCount(type) {\n const listeners = this.#listeners.get(type);\n if (listeners == null) {\n return 0;\n }\n return listeners.length;\n }\n addEventListener(type, listener, options) {\n super.addEventListener(type, listener, options);\n let list = this.#listeners.get(type);\n if (list == null) {\n list = [];\n this.#listeners.set(type, list);\n }\n list.push({\n callback: listener,\n once: (options !== true && options !== false && options?.once) ?? false\n });\n }\n removeEventListener(type, listener, options) {\n super.removeEventListener(type.toString(), listener ?? null, options);\n let list = this.#listeners.get(type);\n if (list == null) {\n return;\n }\n list = list.filter(({ callback }) => callback !== listener);\n this.#listeners.set(type, list);\n }\n dispatchEvent(event) {\n const result = super.dispatchEvent(event);\n let list = this.#listeners.get(event.type);\n if (list == null) {\n return result;\n }\n list = list.filter(({ once }) => !once);\n this.#listeners.set(event.type, list);\n return result;\n }\n safeDispatchEvent(type, detail = {}) {\n return this.dispatchEvent(new CustomEvent(type, detail));\n }\n}\nexport const CustomEvent = globalThis.CustomEvent;\n//# sourceMappingURL=event-target.js.map","import { Logger, pubsubTopicToSingleShardInfo } from \"@waku/utils\";\nimport { utf8ToBytes } from \"@waku/utils/bytes\";\nimport { createEncoder } from \"./message/version_0.js\";\nexport const RelayPingContentTopic = \"/relay-ping/1/ping/null\";\nconst log = new Logger(\"keep-alive\");\nexport class KeepAliveManager {\n relay;\n libp2p;\n options;\n pingKeepAliveTimers = new Map();\n relayKeepAliveTimers = new Map();\n constructor({ options, relay, libp2p }) {\n this.options = options;\n this.relay = relay;\n this.libp2p = libp2p;\n }\n start(peerId) {\n // Just in case a timer already exists for this peer\n this.stop(peerId);\n const { pingKeepAlive: pingPeriodSecs, relayKeepAlive: relayPeriodSecs } = this.options;\n const peerIdStr = peerId.toString();\n // Ping the peer every pingPeriodSecs seconds\n // if pingPeriodSecs is 0, don't ping the peer\n if (pingPeriodSecs !== 0) {\n const interval = setInterval(() => {\n void (async () => {\n let ping;\n try {\n // ping the peer for keep alive\n // also update the peer store with the latency\n try {\n ping = await this.libp2p.services.ping.ping(peerId);\n log.info(`Ping succeeded (${peerIdStr})`, ping);\n }\n catch (error) {\n log.error(`Ping failed for peer (${peerIdStr}).\n Next ping will be attempted in ${pingPeriodSecs} seconds.\n `);\n return;\n }\n try {\n await this.libp2p.peerStore.merge(peerId, {\n metadata: {\n ping: utf8ToBytes(ping.toString())\n }\n });\n }\n catch (e) {\n log.error(\"Failed to update ping\", e);\n }\n }\n catch (e) {\n log.error(`Ping failed (${peerIdStr})`, e);\n }\n })();\n }, pingPeriodSecs * 1000);\n this.pingKeepAliveTimers.set(peerIdStr, interval);\n }\n const relay = this.relay;\n if (relay && relayPeriodSecs !== 0) {\n const intervals = this.scheduleRelayPings(relay, relayPeriodSecs, peerId.toString());\n this.relayKeepAliveTimers.set(peerId, intervals);\n }\n }\n stop(peerId) {\n const peerIdStr = peerId.toString();\n if (this.pingKeepAliveTimers.has(peerIdStr)) {\n clearInterval(this.pingKeepAliveTimers.get(peerIdStr));\n this.pingKeepAliveTimers.delete(peerIdStr);\n }\n if (this.relayKeepAliveTimers.has(peerId)) {\n this.relayKeepAliveTimers.get(peerId)?.map(clearInterval);\n this.relayKeepAliveTimers.delete(peerId);\n }\n }\n stopAll() {\n for (const timer of [\n ...Object.values(this.pingKeepAliveTimers),\n ...Object.values(this.relayKeepAliveTimers)\n ]) {\n clearInterval(timer);\n }\n this.pingKeepAliveTimers.clear();\n this.relayKeepAliveTimers.clear();\n }\n connectionsExist() {\n return (this.pingKeepAliveTimers.size > 0 || this.relayKeepAliveTimers.size > 0);\n }\n scheduleRelayPings(relay, relayPeriodSecs, peerIdStr) {\n // send a ping message to each PubsubTopic the peer is part of\n const intervals = [];\n for (const topic of relay.pubsubTopics) {\n const meshPeers = relay.getMeshPeers(topic);\n if (!meshPeers.includes(peerIdStr))\n continue;\n const encoder = createEncoder({\n pubsubTopicShardInfo: pubsubTopicToSingleShardInfo(topic),\n contentTopic: RelayPingContentTopic,\n ephemeral: true\n });\n const interval = setInterval(() => {\n log.info(\"Sending Waku Relay ping message\");\n relay\n .send(encoder, { payload: new Uint8Array([1]) })\n .catch((e) => log.error(\"Failed to send relay ping\", e));\n }, relayPeriodSecs * 1000);\n intervals.push(interval);\n }\n return intervals;\n }\n}\n//# sourceMappingURL=keep_alive_manager.js.map","import { CustomEvent, TypedEventEmitter } from \"@libp2p/interface\";\nimport { DNS_DISCOVERY_TAG, EConnectionStateEvents, EPeersByDiscoveryEvents } from \"@waku/interfaces\";\nimport { Tags } from \"@waku/interfaces\";\nimport { decodeRelayShard, shardInfoToPubsubTopics } from \"@waku/utils\";\nimport { Logger } from \"@waku/utils\";\nimport { KeepAliveManager } from \"./keep_alive_manager.js\";\nconst log = new Logger(\"connection-manager\");\nexport const DEFAULT_MAX_BOOTSTRAP_PEERS_ALLOWED = 1;\nexport const DEFAULT_MAX_DIAL_ATTEMPTS_FOR_PEER = 3;\nexport const DEFAULT_MAX_PARALLEL_DIALS = 3;\nexport class ConnectionManager extends TypedEventEmitter {\n configuredPubsubTopics;\n static instances = new Map();\n keepAliveManager;\n options;\n libp2p;\n dialAttemptsForPeer = new Map();\n dialErrorsForPeer = new Map();\n currentActiveParallelDialCount = 0;\n pendingPeerDialQueue = [];\n isP2PNetworkConnected = false;\n isConnected() {\n if (globalThis?.navigator && !globalThis?.navigator?.onLine) {\n return false;\n }\n return this.isP2PNetworkConnected;\n }\n static create(peerId, libp2p, keepAliveOptions, pubsubTopics, relay, options) {\n let instance = ConnectionManager.instances.get(peerId);\n if (!instance) {\n instance = new ConnectionManager(libp2p, keepAliveOptions, pubsubTopics, relay, options);\n ConnectionManager.instances.set(peerId, instance);\n }\n return instance;\n }\n stop() {\n this.keepAliveManager.stopAll();\n this.libp2p.removeEventListener(\"peer:connect\", this.onEventHandlers[\"peer:connect\"]);\n this.libp2p.removeEventListener(\"peer:disconnect\", this.onEventHandlers[\"peer:disconnect\"]);\n this.libp2p.removeEventListener(\"peer:discovery\", this.onEventHandlers[\"peer:discovery\"]);\n this.stopNetworkStatusListener();\n }\n async dropConnection(peerId) {\n try {\n this.keepAliveManager.stop(peerId);\n await this.libp2p.hangUp(peerId);\n log.info(`Dropped connection with peer ${peerId.toString()}`);\n }\n catch (error) {\n log.error(`Error dropping connection with peer ${peerId.toString()} - ${error}`);\n }\n }\n async getPeersByDiscovery() {\n const peersDiscovered = await this.libp2p.peerStore.all();\n const peersConnected = this.libp2p\n .getConnections()\n .map((conn) => conn.remotePeer);\n const peersDiscoveredByBootstrap = [];\n const peersDiscoveredByPeerExchange = [];\n const peersDiscoveredByLocal = [];\n const peersConnectedByBootstrap = [];\n const peersConnectedByPeerExchange = [];\n const peersConnectedByLocal = [];\n for (const peer of peersDiscovered) {\n const tags = await this.getTagNamesForPeer(peer.id);\n if (tags.includes(Tags.BOOTSTRAP)) {\n peersDiscoveredByBootstrap.push(peer);\n }\n else if (tags.includes(Tags.PEER_EXCHANGE)) {\n peersDiscoveredByPeerExchange.push(peer);\n }\n else if (tags.includes(Tags.LOCAL)) {\n peersDiscoveredByLocal.push(peer);\n }\n }\n for (const peerId of peersConnected) {\n const peer = await this.libp2p.peerStore.get(peerId);\n const tags = await this.getTagNamesForPeer(peerId);\n if (tags.includes(Tags.BOOTSTRAP)) {\n peersConnectedByBootstrap.push(peer);\n }\n else if (tags.includes(Tags.PEER_EXCHANGE)) {\n peersConnectedByPeerExchange.push(peer);\n }\n else if (tags.includes(Tags.LOCAL)) {\n peersConnectedByLocal.push(peer);\n }\n }\n return {\n DISCOVERED: {\n [Tags.BOOTSTRAP]: peersDiscoveredByBootstrap,\n [Tags.PEER_EXCHANGE]: peersDiscoveredByPeerExchange,\n [Tags.LOCAL]: peersDiscoveredByLocal\n },\n CONNECTED: {\n [Tags.BOOTSTRAP]: peersConnectedByBootstrap,\n [Tags.PEER_EXCHANGE]: peersConnectedByPeerExchange,\n [Tags.LOCAL]: peersConnectedByLocal\n }\n };\n }\n constructor(libp2p, keepAliveOptions, configuredPubsubTopics, relay, options) {\n super();\n this.configuredPubsubTopics = configuredPubsubTopics;\n this.libp2p = libp2p;\n this.configuredPubsubTopics = configuredPubsubTopics;\n this.options = {\n maxDialAttemptsForPeer: DEFAULT_MAX_DIAL_ATTEMPTS_FOR_PEER,\n maxBootstrapPeersAllowed: DEFAULT_MAX_BOOTSTRAP_PEERS_ALLOWED,\n maxParallelDials: DEFAULT_MAX_PARALLEL_DIALS,\n ...options\n };\n this.keepAliveManager = new KeepAliveManager({\n relay,\n libp2p,\n options: keepAliveOptions\n });\n this.startEventListeners()\n .then(() => log.info(`Connection Manager is now running`))\n .catch((error) => log.error(`Unexpected error while running service`, error));\n // libp2p emits `peer:discovery` events during its initialization\n // which means that before the ConnectionManager is initialized, some peers may have been discovered\n // we will dial the peers in peerStore ONCE before we start to listen to the `peer:discovery` events within the ConnectionManager\n this.dialPeerStorePeers().catch((error) => log.error(`Unexpected error while dialing peer store peers`, error));\n }\n async dialPeerStorePeers() {\n const peerInfos = await this.libp2p.peerStore.all();\n const dialPromises = [];\n for (const peerInfo of peerInfos) {\n if (this.libp2p.getConnections().find((c) => c.remotePeer === peerInfo.id))\n continue;\n dialPromises.push(this.attemptDial(peerInfo.id));\n }\n try {\n await Promise.all(dialPromises);\n }\n catch (error) {\n log.error(`Unexpected error while dialing peer store peers`, error);\n }\n }\n async startEventListeners() {\n this.startPeerDiscoveryListener();\n this.startPeerConnectionListener();\n this.startPeerDisconnectionListener();\n this.startNetworkStatusListener();\n }\n async dialPeer(peerId) {\n this.currentActiveParallelDialCount += 1;\n let dialAttempt = 0;\n while (dialAttempt < this.options.maxDialAttemptsForPeer) {\n try {\n log.info(`Dialing peer ${peerId.toString()} on attempt ${dialAttempt + 1}`);\n await this.libp2p.dial(peerId);\n const tags = await this.getTagNamesForPeer(peerId);\n // add tag to connection describing discovery mechanism\n // don't add duplicate tags\n this.libp2p.getConnections(peerId).forEach((conn) => {\n conn.tags = Array.from(new Set([...conn.tags, ...tags]));\n });\n // instead of deleting the peer from the peer store, we set the dial attempt to -1\n // this helps us keep track of peers that have been dialed before\n this.dialAttemptsForPeer.set(peerId.toString(), -1);\n // Dialing succeeded, break the loop\n this.keepAliveManager.start(peerId);\n break;\n }\n catch (error) {\n if (error instanceof AggregateError) {\n // Handle AggregateError\n log.error(`Error dialing peer ${peerId.toString()} - ${error.errors}`);\n }\n else {\n // Handle generic error\n log.error(`Error dialing peer ${peerId.toString()} - ${error.message}`);\n }\n this.dialErrorsForPeer.set(peerId.toString(), error);\n dialAttempt++;\n this.dialAttemptsForPeer.set(peerId.toString(), dialAttempt);\n }\n }\n // Always decrease the active dial count and process the dial queue\n this.currentActiveParallelDialCount--;\n this.processDialQueue();\n // If max dial attempts reached and dialing failed, delete the peer\n if (dialAttempt === this.options.maxDialAttemptsForPeer) {\n try {\n const error = this.dialErrorsForPeer.get(peerId.toString());\n if (error) {\n let errorMessage;\n if (error instanceof AggregateError) {\n if (!error.errors) {\n log.warn(`No errors array found for AggregateError`);\n }\n else if (error.errors.length === 0) {\n log.warn(`Errors array is empty for AggregateError`);\n }\n else {\n errorMessage = JSON.stringify(error.errors[0]);\n }\n }\n else {\n errorMessage = error.message;\n }\n log.info(`Deleting undialable peer ${peerId.toString()} from peer store. Reason: ${errorMessage}`);\n }\n this.dialErrorsForPeer.delete(peerId.toString());\n await this.libp2p.peerStore.delete(peerId);\n // if it was last available peer - attempt DNS discovery\n await this.attemptDnsDiscovery();\n }\n catch (error) {\n throw new Error(`Error deleting undialable peer ${peerId.toString()} from peer store - ${error}`);\n }\n }\n }\n async attemptDnsDiscovery() {\n if (this.libp2p.getConnections().length > 0)\n return;\n if ((await this.libp2p.peerStore.all()).length > 0)\n return;\n log.info(\"Attempting to trigger DNS discovery.\");\n const dnsDiscovery = Object.values(this.libp2p.components.components).find((v) => {\n if (v && v.toString) {\n return v.toString().includes(DNS_DISCOVERY_TAG);\n }\n return false;\n });\n if (!dnsDiscovery)\n return;\n await dnsDiscovery.findPeers();\n }\n processDialQueue() {\n if (this.pendingPeerDialQueue.length > 0 &&\n this.currentActiveParallelDialCount < this.options.maxParallelDials) {\n const peerId = this.pendingPeerDialQueue.shift();\n if (!peerId)\n return;\n this.attemptDial(peerId).catch((error) => {\n log.error(error);\n });\n }\n }\n startPeerDiscoveryListener() {\n this.libp2p.addEventListener(\"peer:discovery\", this.onEventHandlers[\"peer:discovery\"]);\n }\n startPeerConnectionListener() {\n this.libp2p.addEventListener(\"peer:connect\", this.onEventHandlers[\"peer:connect\"]);\n }\n startPeerDisconnectionListener() {\n // TODO: ensure that these following issues are updated and confirmed\n /**\n * NOTE: Event is not being emitted on closing nor losing a connection.\n * @see https://github.com/libp2p/js-libp2p/issues/939\n * @see https://github.com/status-im/js-waku/issues/252\n *\n * >This event will be triggered anytime we are disconnected from another peer,\n * >regardless of the circumstances of that disconnection.\n * >If we happen to have multiple connections to a peer,\n * >this event will **only** be triggered when the last connection is closed.\n * @see https://github.com/libp2p/js-libp2p/blob/bad9e8c0ff58d60a78314077720c82ae331cc55b/doc/API.md?plain=1#L2100\n */\n this.libp2p.addEventListener(\"peer:disconnect\", this.onEventHandlers[\"peer:disconnect\"]);\n }\n async attemptDial(peerId) {\n if (!(await this.shouldDialPeer(peerId)))\n return;\n if (this.currentActiveParallelDialCount >= this.options.maxParallelDials) {\n this.pendingPeerDialQueue.push(peerId);\n return;\n }\n await this.dialPeer(peerId);\n }\n onEventHandlers = {\n \"peer:discovery\": (evt) => {\n void (async () => {\n const { id: peerId } = evt.detail;\n await this.dispatchDiscoveryEvent(peerId);\n try {\n await this.attemptDial(peerId);\n }\n catch (error) {\n log.error(`Error dialing peer ${peerId.toString()} : ${error}`);\n }\n })();\n },\n \"peer:connect\": (evt) => {\n void (async () => {\n log.info(`Connected to peer ${evt.detail.toString()}`);\n const peerId = evt.detail;\n this.keepAliveManager.start(peerId);\n const isBootstrap = (await this.getTagNamesForPeer(peerId)).includes(Tags.BOOTSTRAP);\n if (isBootstrap) {\n const bootstrapConnections = this.libp2p\n .getConnections()\n .filter((conn) => conn.tags.includes(Tags.BOOTSTRAP));\n // If we have too many bootstrap connections, drop one\n if (bootstrapConnections.length > this.options.maxBootstrapPeersAllowed) {\n await this.dropConnection(peerId);\n }\n else {\n this.dispatchEvent(new CustomEvent(EPeersByDiscoveryEvents.PEER_CONNECT_BOOTSTRAP, {\n detail: peerId\n }));\n }\n }\n else {\n this.dispatchEvent(new CustomEvent(EPeersByDiscoveryEvents.PEER_CONNECT_PEER_EXCHANGE, {\n detail: peerId\n }));\n }\n this.setP2PNetworkConnected();\n })();\n },\n \"peer:disconnect\": (evt) => {\n void (async () => {\n this.keepAliveManager.stop(evt.detail);\n this.setP2PNetworkDisconnected();\n })();\n },\n \"browser:network\": () => {\n this.dispatchWakuConnectionEvent();\n }\n };\n /**\n * Checks if the peer should be dialed based on the following conditions:\n * 1. If the peer is already connected, don't dial\n * 2. If the peer is not part of any of the configured pubsub topics, don't dial\n * 3. If the peer is not dialable based on bootstrap status, don't dial\n * 4. If the peer is already has an active dial attempt, or has been dialed before, don't dial it\n * @returns true if the peer should be dialed, false otherwise\n */\n async shouldDialPeer(peerId) {\n const isConnected = this.libp2p.getConnections(peerId).length > 0;\n if (isConnected) {\n log.warn(`Already connected to peer ${peerId.toString()}. Not dialing.`);\n return false;\n }\n const isSameShard = await this.isPeerTopicConfigured(peerId);\n if (!isSameShard) {\n const shardInfo = await this.getPeerShardInfo(peerId, this.libp2p.peerStore);\n log.warn(`Discovered peer ${peerId.toString()} with ShardInfo ${shardInfo} is not part of any of the configured pubsub topics (${this.configuredPubsubTopics}).\n Not dialing.`);\n return false;\n }\n const isPreferredBasedOnBootstrap = await this.isPeerDialableBasedOnBootstrapStatus(peerId);\n if (!isPreferredBasedOnBootstrap) {\n log.warn(`Peer ${peerId.toString()} is not dialable based on bootstrap status. Not dialing.`);\n return false;\n }\n const hasBeenDialed = this.dialAttemptsForPeer.has(peerId.toString());\n if (hasBeenDialed) {\n log.warn(`Peer ${peerId.toString()} has already been attempted dial before, or already has a dial attempt in progress, skipping dial`);\n return false;\n }\n return true;\n }\n /**\n * Checks if the peer is dialable based on the following conditions:\n * 1. If the peer is a bootstrap peer, it is only dialable if the number of current bootstrap connections is less than the max allowed.\n * 2. If the peer is not a bootstrap peer\n */\n async isPeerDialableBasedOnBootstrapStatus(peerId) {\n const tagNames = await this.getTagNamesForPeer(peerId);\n const isBootstrap = tagNames.some((tagName) => tagName === Tags.BOOTSTRAP);\n if (!isBootstrap) {\n return true;\n }\n const currentBootstrapConnections = this.libp2p\n .getConnections()\n .filter((conn) => {\n return conn.tags.find((name) => name === Tags.BOOTSTRAP);\n }).length;\n return currentBootstrapConnections < this.options.maxBootstrapPeersAllowed;\n }\n async dispatchDiscoveryEvent(peerId) {\n const isBootstrap = (await this.getTagNamesForPeer(peerId)).includes(Tags.BOOTSTRAP);\n this.dispatchEvent(new CustomEvent(isBootstrap\n ? EPeersByDiscoveryEvents.PEER_DISCOVERY_BOOTSTRAP\n : EPeersByDiscoveryEvents.PEER_DISCOVERY_PEER_EXCHANGE, {\n detail: peerId\n }));\n }\n /**\n * Fetches the tag names for a given peer\n */\n async getTagNamesForPeer(peerId) {\n try {\n const peer = await this.libp2p.peerStore.get(peerId);\n return Array.from(peer.tags.keys());\n }\n catch (error) {\n log.error(`Failed to get peer ${peerId}, error: ${error}`);\n return [];\n }\n }\n async isPeerTopicConfigured(peerId) {\n const shardInfo = await this.getPeerShardInfo(peerId, this.libp2p.peerStore);\n // If there's no shard information, simply return true\n if (!shardInfo)\n return true;\n const pubsubTopics = shardInfoToPubsubTopics(shardInfo);\n const isTopicConfigured = pubsubTopics.some((topic) => this.configuredPubsubTopics.includes(topic));\n return isTopicConfigured;\n }\n async getPeerShardInfo(peerId, peerStore) {\n const peer = await peerStore.get(peerId);\n const shardInfoBytes = peer.metadata.get(\"shardInfo\");\n if (!shardInfoBytes)\n return undefined;\n return decodeRelayShard(shardInfoBytes);\n }\n startNetworkStatusListener() {\n try {\n globalThis.addEventListener(\"online\", this.onEventHandlers[\"browser:network\"]);\n globalThis.addEventListener(\"offline\", this.onEventHandlers[\"browser:network\"]);\n }\n catch (err) {\n log.error(`Failed to start network listener: ${err}`);\n }\n }\n stopNetworkStatusListener() {\n try {\n globalThis.removeEventListener(\"online\", this.onEventHandlers[\"browser:network\"]);\n globalThis.removeEventListener(\"offline\", this.onEventHandlers[\"browser:network\"]);\n }\n catch (err) {\n log.error(`Failed to stop network listener: ${err}`);\n }\n }\n setP2PNetworkConnected() {\n if (!this.isP2PNetworkConnected) {\n this.isP2PNetworkConnected = true;\n this.dispatchWakuConnectionEvent();\n }\n }\n setP2PNetworkDisconnected() {\n if (this.isP2PNetworkConnected &&\n this.libp2p.getConnections().length === 0) {\n this.isP2PNetworkConnected = false;\n this.dispatchWakuConnectionEvent();\n }\n }\n dispatchWakuConnectionEvent() {\n this.dispatchEvent(new CustomEvent(EConnectionStateEvents.CONNECTION_STATUS, {\n detail: this.isConnected()\n }));\n }\n}\n//# sourceMappingURL=connection_manager.js.map","import { HealthStatus, Protocols } from \"@waku/interfaces\";\nclass HealthManager {\n static instance;\n health;\n constructor() {\n this.health = {\n overallStatus: HealthStatus.Unhealthy,\n protocolStatuses: new Map()\n };\n }\n static getInstance() {\n if (!HealthManager.instance) {\n HealthManager.instance = new HealthManager();\n }\n return HealthManager.instance;\n }\n getHealthStatus() {\n return this.health.overallStatus;\n }\n getProtocolStatus(protocol) {\n return this.health.protocolStatuses.get(protocol);\n }\n updateProtocolHealth(multicodec, connectedPeers) {\n const protocol = this.getNameFromMulticodec(multicodec);\n let status = HealthStatus.Unhealthy;\n if (connectedPeers == 1) {\n status = HealthStatus.MinimallyHealthy;\n }\n else if (connectedPeers >= 2) {\n status = HealthStatus.SufficientlyHealthy;\n }\n this.health.protocolStatuses.set(protocol, {\n name: protocol,\n status: status,\n lastUpdate: new Date()\n });\n this.updateOverallHealth();\n }\n getNameFromMulticodec(multicodec) {\n let name;\n if (multicodec.includes(\"filter\")) {\n name = Protocols.Filter;\n }\n else if (multicodec.includes(\"lightpush\")) {\n name = Protocols.LightPush;\n }\n else if (multicodec.includes(\"store\")) {\n name = Protocols.Store;\n }\n else {\n throw new Error(`Unknown protocol: ${multicodec}`);\n }\n return name;\n }\n updateOverallHealth() {\n const relevantProtocols = [Protocols.LightPush, Protocols.Filter];\n const statuses = relevantProtocols.map((p) => this.getProtocolStatus(p)?.status);\n if (statuses.some((status) => status === HealthStatus.Unhealthy)) {\n this.health.overallStatus = HealthStatus.Unhealthy;\n }\n else if (statuses.some((status) => status === HealthStatus.MinimallyHealthy)) {\n this.health.overallStatus = HealthStatus.MinimallyHealthy;\n }\n else {\n this.health.overallStatus = HealthStatus.SufficientlyHealthy;\n }\n }\n}\nexport const getHealthManager = () => HealthManager.getInstance();\n//# sourceMappingURL=health_manager.js.map","import { ProtocolError } from \"@waku/interfaces\";\nimport { proto_metadata } from \"@waku/proto\";\nimport { encodeRelayShard, Logger, pubsubTopicsToShardInfo } from \"@waku/utils\";\nimport all from \"it-all\";\nimport * as lp from \"it-length-prefixed\";\nimport { pipe } from \"it-pipe\";\nimport { Uint8ArrayList } from \"uint8arraylist\";\nimport { BaseProtocol } from \"../base_protocol.js\";\nconst log = new Logger(\"metadata\");\nexport const MetadataCodec = \"/vac/waku/metadata/1.0.0\";\nclass Metadata extends BaseProtocol {\n pubsubTopics;\n libp2pComponents;\n handshakesConfirmed = new Map();\n constructor(pubsubTopics, libp2p) {\n super(MetadataCodec, libp2p.components, log, pubsubTopics);\n this.pubsubTopics = pubsubTopics;\n this.libp2pComponents = libp2p;\n void libp2p.registrar.handle(MetadataCodec, (streamData) => {\n void this.onRequest(streamData);\n });\n }\n /**\n * Make a metadata query to a peer\n */\n async query(peerId) {\n const request = proto_metadata.WakuMetadataRequest.encode(pubsubTopicsToShardInfo(this.pubsubTopics));\n const peer = await this.peerStore.get(peerId);\n if (!peer) {\n return {\n shardInfo: null,\n error: ProtocolError.NO_PEER_AVAILABLE\n };\n }\n let stream;\n try {\n stream = await this.getStream(peer);\n }\n catch (error) {\n log.error(\"Failed to get stream\", error);\n return {\n shardInfo: null,\n error: ProtocolError.NO_STREAM_AVAILABLE\n };\n }\n const encodedResponse = await pipe([request], lp.encode, stream, lp.decode, async (source) => await all(source));\n const { error, shardInfo } = this.decodeMetadataResponse(encodedResponse);\n if (error) {\n return {\n shardInfo: null,\n error\n };\n }\n await this.savePeerShardInfo(peerId, shardInfo);\n return {\n shardInfo,\n error: null\n };\n }\n async confirmOrAttemptHandshake(peerId) {\n const shardInfo = this.handshakesConfirmed.get(peerId.toString());\n if (shardInfo) {\n return {\n shardInfo,\n error: null\n };\n }\n return await this.query(peerId);\n }\n /**\n * Handle an incoming metadata request\n */\n async onRequest(streamData) {\n try {\n const { stream, connection } = streamData;\n const encodedShardInfo = proto_metadata.WakuMetadataResponse.encode(pubsubTopicsToShardInfo(this.pubsubTopics));\n const encodedResponse = await pipe([encodedShardInfo], lp.encode, stream, lp.decode, async (source) => await all(source));\n const { error, shardInfo } = this.decodeMetadataResponse(encodedResponse);\n if (error) {\n return;\n }\n await this.savePeerShardInfo(connection.remotePeer, shardInfo);\n }\n catch (error) {\n log.error(\"Error handling metadata request\", error);\n }\n }\n decodeMetadataResponse(encodedResponse) {\n const bytes = new Uint8ArrayList();\n encodedResponse.forEach((chunk) => {\n bytes.append(chunk);\n });\n const response = proto_metadata.WakuMetadataResponse.decode(bytes);\n if (!response) {\n log.error(\"Error decoding metadata response\");\n return {\n shardInfo: null,\n error: ProtocolError.DECODE_FAILED\n };\n }\n return {\n shardInfo: response,\n error: null\n };\n }\n async savePeerShardInfo(peerId, shardInfo) {\n // add or update the shardInfo to peer store\n await this.libp2pComponents.peerStore.merge(peerId, {\n metadata: {\n shardInfo: encodeRelayShard(shardInfo)\n }\n });\n this.handshakesConfirmed.set(peerId.toString(), shardInfo);\n }\n}\nexport function wakuMetadata(pubsubTopics) {\n return (components) => new Metadata(pubsubTopics, components);\n}\n//# sourceMappingURL=index.js.map","export const peerIdSymbol = Symbol.for('@libp2p/peer-id');\nexport function isPeerId(other) {\n return other != null && Boolean(other[peerIdSymbol]);\n}\n//# sourceMappingURL=index.js.map","/**\n * When this error is thrown it means an operation was aborted,\n * usually in response to the `abort` event being emitted by an\n * AbortSignal.\n */\nexport class AbortError extends Error {\n code;\n type;\n constructor(message = 'The operation was aborted') {\n super(message);\n this.name = 'AbortError';\n this.code = AbortError.code;\n this.type = AbortError.type;\n }\n static code = 'ABORT_ERR';\n static type = 'aborted';\n}\nexport class CodeError extends Error {\n code;\n props;\n constructor(message, code, props) {\n super(message);\n this.code = code;\n this.name = props?.name ?? 'CodeError';\n this.props = props ?? {}; // eslint-disable-line @typescript-eslint/consistent-type-assertions\n }\n}\nexport class AggregateCodeError extends AggregateError {\n code;\n props;\n constructor(errors, message, code, props) {\n super(errors, message);\n this.code = code;\n this.name = props?.name ?? 'AggregateCodeError';\n this.props = props ?? {}; // eslint-disable-line @typescript-eslint/consistent-type-assertions\n }\n}\nexport class UnexpectedPeerError extends Error {\n code;\n constructor(message = 'Unexpected Peer') {\n super(message);\n this.name = 'UnexpectedPeerError';\n this.code = UnexpectedPeerError.code;\n }\n static code = 'ERR_UNEXPECTED_PEER';\n}\nexport class InvalidCryptoExchangeError extends Error {\n code;\n constructor(message = 'Invalid crypto exchange') {\n super(message);\n this.name = 'InvalidCryptoExchangeError';\n this.code = InvalidCryptoExchangeError.code;\n }\n static code = 'ERR_INVALID_CRYPTO_EXCHANGE';\n}\nexport class InvalidCryptoTransmissionError extends Error {\n code;\n constructor(message = 'Invalid crypto transmission') {\n super(message);\n this.name = 'InvalidCryptoTransmissionError';\n this.code = InvalidCryptoTransmissionError.code;\n }\n static code = 'ERR_INVALID_CRYPTO_TRANSMISSION';\n}\n// Error codes\nexport const ERR_TIMEOUT = 'ERR_TIMEOUT';\nexport const ERR_INVALID_PARAMETERS = 'ERR_INVALID_PARAMETERS';\nexport const ERR_NOT_FOUND = 'ERR_NOT_FOUND';\nexport const ERR_INVALID_MESSAGE = 'ERR_INVALID_MESSAGE';\n//# sourceMappingURL=errors.js.map","import { Parser } from \"./parser.js\";\n// See https://stackoverflow.com/questions/166132/maximum-length-of-the-textual-representation-of-an-ipv6-address\nconst MAX_IPV6_LENGTH = 45;\nconst MAX_IPV4_LENGTH = 15;\nconst parser = new Parser();\n/** Parse `input` into IPv4 bytes. */\nexport function parseIPv4(input) {\n if (input.length > MAX_IPV4_LENGTH) {\n return undefined;\n }\n return parser.new(input).parseWith(() => parser.readIPv4Addr());\n}\n/** Parse `input` into IPv6 bytes. */\nexport function parseIPv6(input) {\n // strip zone index if it is present\n if (input.includes(\"%\")) {\n input = input.split(\"%\")[0];\n }\n if (input.length > MAX_IPV6_LENGTH) {\n return undefined;\n }\n return parser.new(input).parseWith(() => parser.readIPv6Addr());\n}\n/** Parse `input` into IPv4 or IPv6 bytes. */\nexport function parseIP(input) {\n // strip zone index if it is present\n if (input.includes(\"%\")) {\n input = input.split(\"%\")[0];\n }\n if (input.length > MAX_IPV6_LENGTH) {\n return undefined;\n }\n return parser.new(input).parseWith(() => parser.readIPAddr());\n}\n//# sourceMappingURL=parse.js.map","/* eslint-disable @typescript-eslint/no-unsafe-return */\nexport class Parser {\n index = 0;\n input = \"\";\n new(input) {\n this.index = 0;\n this.input = input;\n return this;\n }\n /** Run a parser, and restore the pre-parse state if it fails. */\n readAtomically(fn) {\n const index = this.index;\n const result = fn();\n if (result === undefined) {\n this.index = index;\n }\n return result;\n }\n /** Run a parser, but fail if the entire input wasn't consumed. Doesn't run atomically. */\n parseWith(fn) {\n const result = fn();\n if (this.index !== this.input.length) {\n return undefined;\n }\n return result;\n }\n /** Peek the next character from the input */\n peekChar() {\n if (this.index >= this.input.length) {\n return undefined;\n }\n return this.input[this.index];\n }\n /** Read the next character from the input */\n readChar() {\n if (this.index >= this.input.length) {\n return undefined;\n }\n return this.input[this.index++];\n }\n /** Read the next character from the input if it matches the target. */\n readGivenChar(target) {\n return this.readAtomically(() => {\n const char = this.readChar();\n if (char !== target) {\n return undefined;\n }\n return char;\n });\n }\n /**\n * Helper for reading separators in an indexed loop. Reads the separator\n * character iff index > 0, then runs the parser. When used in a loop,\n * the separator character will only be read on index > 0 (see\n * readIPv4Addr for an example)\n */\n readSeparator(sep, index, inner) {\n return this.readAtomically(() => {\n if (index > 0) {\n if (this.readGivenChar(sep) === undefined) {\n return undefined;\n }\n }\n return inner();\n });\n }\n /**\n * Read a number off the front of the input in the given radix, stopping\n * at the first non-digit character or eof. Fails if the number has more\n * digits than max_digits or if there is no number.\n */\n readNumber(radix, maxDigits, allowZeroPrefix, maxBytes) {\n return this.readAtomically(() => {\n let result = 0;\n let digitCount = 0;\n const leadingChar = this.peekChar();\n if (leadingChar === undefined) {\n return undefined;\n }\n const hasLeadingZero = leadingChar === \"0\";\n const maxValue = 2 ** (8 * maxBytes) - 1;\n // eslint-disable-next-line no-constant-condition\n while (true) {\n const digit = this.readAtomically(() => {\n const char = this.readChar();\n if (char === undefined) {\n return undefined;\n }\n const num = Number.parseInt(char, radix);\n if (Number.isNaN(num)) {\n return undefined;\n }\n return num;\n });\n if (digit === undefined) {\n break;\n }\n result *= radix;\n result += digit;\n if (result > maxValue) {\n return undefined;\n }\n digitCount += 1;\n if (maxDigits !== undefined) {\n if (digitCount > maxDigits) {\n return undefined;\n }\n }\n }\n if (digitCount === 0) {\n return undefined;\n }\n else if (!allowZeroPrefix && hasLeadingZero && digitCount > 1) {\n return undefined;\n }\n else {\n return result;\n }\n });\n }\n /** Read an IPv4 address. */\n readIPv4Addr() {\n return this.readAtomically(() => {\n const out = new Uint8Array(4);\n for (let i = 0; i < out.length; i++) {\n const ix = this.readSeparator(\".\", i, () => this.readNumber(10, 3, false, 1));\n if (ix === undefined) {\n return undefined;\n }\n out[i] = ix;\n }\n return out;\n });\n }\n /** Read an IPv6 Address. */\n readIPv6Addr() {\n /**\n * Read a chunk of an IPv6 address into `groups`. Returns the number\n * of groups read, along with a bool indicating if an embedded\n * trailing IPv4 address was read. Specifically, read a series of\n * colon-separated IPv6 groups (0x0000 - 0xFFFF), with an optional\n * trailing embedded IPv4 address.\n */\n const readGroups = (groups) => {\n for (let i = 0; i < groups.length / 2; i++) {\n const ix = i * 2;\n // Try to read a trailing embedded IPv4 address. There must be at least 4 groups left.\n if (i < groups.length - 3) {\n const ipv4 = this.readSeparator(\":\", i, () => this.readIPv4Addr());\n if (ipv4 !== undefined) {\n groups[ix] = ipv4[0];\n groups[ix + 1] = ipv4[1];\n groups[ix + 2] = ipv4[2];\n groups[ix + 3] = ipv4[3];\n return [ix + 4, true];\n }\n }\n const group = this.readSeparator(\":\", i, () => this.readNumber(16, 4, true, 2));\n if (group === undefined) {\n return [ix, false];\n }\n groups[ix] = group >> 8;\n groups[ix + 1] = group & 255;\n }\n return [groups.length, false];\n };\n return this.readAtomically(() => {\n // Read the front part of the address; either the whole thing, or up to the first ::\n const head = new Uint8Array(16);\n const [headSize, headIp4] = readGroups(head);\n if (headSize === 16) {\n return head;\n }\n // IPv4 part is not allowed before `::`\n if (headIp4) {\n return undefined;\n }\n // Read `::` if previous code parsed less than 8 groups.\n // `::` indicates one or more groups of 16 bits of zeros.\n if (this.readGivenChar(\":\") === undefined) {\n return undefined;\n }\n if (this.readGivenChar(\":\") === undefined) {\n return undefined;\n }\n // Read the back part of the address. The :: must contain at least one\n // set of zeroes, so our max length is 7.\n const tail = new Uint8Array(14);\n const limit = 16 - (headSize + 2);\n const [tailSize] = readGroups(tail.subarray(0, limit));\n // Concat the head and tail of the IP address\n head.set(tail.subarray(0, tailSize), 16 - tailSize);\n return head;\n });\n }\n /** Read an IP Address, either IPv4 or IPv6. */\n readIPAddr() {\n return this.readIPv4Addr() ?? this.readIPv6Addr();\n }\n}\n//# sourceMappingURL=parser.js.map","import { parseIP, parseIPv4, parseIPv6 } from \"./parse.js\";\n/** Check if `input` is IPv4. */\nexport function isIPv4(input) {\n return Boolean(parseIPv4(input));\n}\n/** Check if `input` is IPv6. */\nexport function isIPv6(input) {\n return Boolean(parseIPv6(input));\n}\n/** Check if `input` is IPv4 or IPv6. */\nexport function isIP(input) {\n return Boolean(parseIP(input));\n}\n/**\n * @returns `6` if `input` is IPv6, `4` if `input` is IPv4, or `undefined` if `input` is neither.\n */\nexport function ipVersion(input) {\n if (isIPv4(input)) {\n return 4;\n }\n else if (isIPv6(input)) {\n return 6;\n }\n else {\n return undefined;\n }\n}\n//# sourceMappingURL=is-ip.js.map","import { parseIP } from \"@chainsafe/is-ip/parse\";\nimport { allFF, deepEqual } from \"./util.js\";\nexport const IPv4Len = 4;\nexport const IPv6Len = 16;\nexport const maxIPv6Octet = parseInt(\"0xFFFF\", 16);\nexport const ipv4Prefix = new Uint8Array([\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 255,\n]);\nexport function maskIp(ip, mask) {\n if (mask.length === IPv6Len && ip.length === IPv4Len && allFF(mask, 0, 11)) {\n mask = mask.slice(12);\n }\n if (mask.length === IPv4Len &&\n ip.length === IPv6Len &&\n deepEqual(ip, ipv4Prefix, 0, 11)) {\n ip = ip.slice(12);\n }\n const n = ip.length;\n if (n != mask.length) {\n throw new Error(\"Failed to mask ip\");\n }\n const out = new Uint8Array(n);\n for (let i = 0; i < n; i++) {\n out[i] = ip[i] & mask[i];\n }\n return out;\n}\nexport function containsIp(net, ip) {\n if (typeof ip === \"string\") {\n ip = parseIP(ip);\n }\n if (ip == null)\n throw new Error(\"Invalid ip\");\n if (ip.length !== net.network.length) {\n return false;\n }\n for (let i = 0; i < ip.length; i++) {\n if ((net.network[i] & net.mask[i]) !== (ip[i] & net.mask[i])) {\n return false;\n }\n }\n return true;\n}\nexport function iPv4FromIPv6(ip) {\n if (!isIPv4mappedIPv6(ip)) {\n throw new Error(\"Must have 0xffff prefix\");\n }\n return ip.slice(12);\n}\nexport function isIPv4mappedIPv6(ip) {\n return deepEqual(ip, ipv4Prefix, 0, 11);\n}\n//# sourceMappingURL=ip.js.map","import { isIPv4, isIPv6 } from '@chainsafe/is-ip';\nimport { toString as uint8ArrayToString } from 'uint8arrays/to-string';\nexport { isIP } from '@chainsafe/is-ip';\nexport const isV4 = isIPv4;\nexport const isV6 = isIPv6;\n// Copied from https://github.com/indutny/node-ip/blob/master/lib/ip.js#L7\n// but with buf/offset args removed because we don't use them\nexport const toBytes = function (ip) {\n let offset = 0;\n ip = ip.toString().trim();\n if (isV4(ip)) {\n const bytes = new Uint8Array(offset + 4);\n ip.split(/\\./g).forEach((byte) => {\n bytes[offset++] = parseInt(byte, 10) & 0xff;\n });\n return bytes;\n }\n if (isV6(ip)) {\n const sections = ip.split(':', 8);\n let i;\n for (i = 0; i < sections.length; i++) {\n const isv4 = isV4(sections[i]);\n let v4Buffer;\n if (isv4) {\n v4Buffer = toBytes(sections[i]);\n sections[i] = uint8ArrayToString(v4Buffer.slice(0, 2), 'base16');\n }\n if (v4Buffer != null && ++i < 8) {\n sections.splice(i, 0, uint8ArrayToString(v4Buffer.slice(2, 4), 'base16'));\n }\n }\n if (sections[0] === '') {\n while (sections.length < 8)\n sections.unshift('0');\n }\n else if (sections[sections.length - 1] === '') {\n while (sections.length < 8)\n sections.push('0');\n }\n else if (sections.length < 8) {\n for (i = 0; i < sections.length && sections[i] !== ''; i++)\n ;\n const argv = [i, 1];\n for (i = 9 - sections.length; i > 0; i--) {\n argv.push('0');\n }\n sections.splice.apply(sections, argv);\n }\n const bytes = new Uint8Array(offset + 16);\n for (i = 0; i < sections.length; i++) {\n const word = parseInt(sections[i], 16);\n bytes[offset++] = (word >> 8) & 0xff;\n bytes[offset++] = word & 0xff;\n }\n return bytes;\n }\n throw new Error('invalid ip address');\n};\n// Copied from https://github.com/indutny/node-ip/blob/master/lib/ip.js#L63\nexport const toString = function (buf, offset = 0, length) {\n offset = ~~offset;\n length = length ?? (buf.length - offset);\n const view = new DataView(buf.buffer);\n if (length === 4) {\n const result = [];\n // IPv4\n for (let i = 0; i < length; i++) {\n result.push(buf[offset + i]);\n }\n return result.join('.');\n }\n if (length === 16) {\n const result = [];\n // IPv6\n for (let i = 0; i < length; i += 2) {\n result.push(view.getUint16(offset + i).toString(16));\n }\n return result.join(':')\n .replace(/(^|:)0(:0)*:0(:|$)/, '$1::$3')\n .replace(/:{3,4}/, '::');\n }\n return '';\n};\n//# sourceMappingURL=ip.js.map","const V = -1;\nexport const names = {};\nexport const codes = {};\nexport const table = [\n [4, 32, 'ip4'],\n [6, 16, 'tcp'],\n [33, 16, 'dccp'],\n [41, 128, 'ip6'],\n [42, V, 'ip6zone'],\n [43, 8, 'ipcidr'],\n [53, V, 'dns', true],\n [54, V, 'dns4', true],\n [55, V, 'dns6', true],\n [56, V, 'dnsaddr', true],\n [132, 16, 'sctp'],\n [273, 16, 'udp'],\n [275, 0, 'p2p-webrtc-star'],\n [276, 0, 'p2p-webrtc-direct'],\n [277, 0, 'p2p-stardust'],\n [280, 0, 'webrtc-direct'],\n [281, 0, 'webrtc'],\n [290, 0, 'p2p-circuit'],\n [301, 0, 'udt'],\n [302, 0, 'utp'],\n [400, V, 'unix', false, true],\n // `ipfs` is added before `p2p` for legacy support.\n // All text representations will default to `p2p`, but `ipfs` will\n // still be supported\n [421, V, 'ipfs'],\n // `p2p` is the preferred name for 421, and is now the default\n [421, V, 'p2p'],\n [443, 0, 'https'],\n [444, 96, 'onion'],\n [445, 296, 'onion3'],\n [446, V, 'garlic64'],\n [448, 0, 'tls'],\n [449, V, 'sni'],\n [460, 0, 'quic'],\n [461, 0, 'quic-v1'],\n [465, 0, 'webtransport'],\n [466, V, 'certhash'],\n [477, 0, 'ws'],\n [478, 0, 'wss'],\n [479, 0, 'p2p-websocket-star'],\n [480, 0, 'http'],\n [481, V, 'http-path'],\n [777, V, 'memory']\n];\n// populate tables\ntable.forEach(row => {\n const proto = createProtocol(...row);\n codes[proto.code] = proto;\n names[proto.name] = proto;\n});\nexport function createProtocol(code, size, name, resolvable, path) {\n return {\n code,\n size,\n name,\n resolvable: Boolean(resolvable),\n path: Boolean(path)\n };\n}\n/**\n * For the passed proto string or number, return a {@link Protocol}\n *\n * @example\n *\n * ```js\n * import { protocol } from '@multiformats/multiaddr'\n *\n * console.info(protocol(4))\n * // { code: 4, size: 32, name: 'ip4', resolvable: false, path: false }\n * ```\n */\nexport function getProtocol(proto) {\n if (typeof proto === 'number') {\n if (codes[proto] != null) {\n return codes[proto];\n }\n throw new Error(`no protocol with code: ${proto}`);\n }\n else if (typeof proto === 'string') {\n if (names[proto] != null) {\n return names[proto];\n }\n throw new Error(`no protocol with name: ${proto}`);\n }\n throw new Error(`invalid protocol id type: ${typeof proto}`);\n}\n//# sourceMappingURL=protocols-table.js.map","/**\n * @packageDocumentation\n *\n * Provides methods for converting\n */\nimport { IpNet } from '@chainsafe/netmask';\nimport { base32 } from 'multiformats/bases/base32';\nimport { base58btc } from 'multiformats/bases/base58';\nimport { bases } from 'multiformats/basics';\nimport { CID } from 'multiformats/cid';\nimport * as Digest from 'multiformats/hashes/digest';\nimport * as varint from 'uint8-varint';\nimport { concat as uint8ArrayConcat } from 'uint8arrays/concat';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport { toString as uint8ArrayToString } from 'uint8arrays/to-string';\nimport * as ip from './ip.js';\nimport { getProtocol } from './protocols-table.js';\nconst ip4Protocol = getProtocol('ip4');\nconst ip6Protocol = getProtocol('ip6');\nconst ipcidrProtocol = getProtocol('ipcidr');\nexport function convert(proto, a) {\n if (a instanceof Uint8Array) {\n return convertToString(proto, a);\n }\n else {\n return convertToBytes(proto, a);\n }\n}\n/**\n * Convert [code,Uint8Array] to string\n */\nexport function convertToString(proto, buf) {\n const protocol = getProtocol(proto);\n switch (protocol.code) {\n case 4: // ipv4\n case 41: // ipv6\n return bytes2ip(buf);\n case 42: // ipv6zone\n return bytes2str(buf);\n case 6: // tcp\n case 273: // udp\n case 33: // dccp\n case 132: // sctp\n return bytes2port(buf).toString();\n case 53: // dns\n case 54: // dns4\n case 55: // dns6\n case 56: // dnsaddr\n case 400: // unix\n case 449: // sni\n case 777: // memory\n return bytes2str(buf);\n case 421: // ipfs\n return bytes2mh(buf);\n case 444: // onion\n return bytes2onion(buf);\n case 445: // onion3\n return bytes2onion(buf);\n case 466: // certhash\n return bytes2mb(buf);\n case 481: // http-path\n return globalThis.encodeURIComponent(bytes2str(buf));\n default:\n return uint8ArrayToString(buf, 'base16'); // no clue. convert to hex\n }\n}\nexport function convertToBytes(proto, str) {\n const protocol = getProtocol(proto);\n switch (protocol.code) {\n case 4: // ipv4\n return ip2bytes(str);\n case 41: // ipv6\n return ip2bytes(str);\n case 42: // ipv6zone\n return str2bytes(str);\n case 6: // tcp\n case 273: // udp\n case 33: // dccp\n case 132: // sctp\n return port2bytes(parseInt(str, 10));\n case 53: // dns\n case 54: // dns4\n case 55: // dns6\n case 56: // dnsaddr\n case 400: // unix\n case 449: // sni\n case 777: // memory\n return str2bytes(str);\n case 421: // ipfs\n return mh2bytes(str);\n case 444: // onion\n return onion2bytes(str);\n case 445: // onion3\n return onion32bytes(str);\n case 466: // certhash\n return mb2bytes(str);\n case 481: // http-path\n return str2bytes(globalThis.decodeURIComponent(str));\n default:\n return uint8ArrayFromString(str, 'base16'); // no clue. convert from hex\n }\n}\nexport function convertToIpNet(multiaddr) {\n let mask;\n let addr;\n multiaddr.stringTuples().forEach(([code, value]) => {\n if (code === ip4Protocol.code || code === ip6Protocol.code) {\n addr = value;\n }\n if (code === ipcidrProtocol.code) {\n mask = value;\n }\n });\n if (mask == null || addr == null) {\n throw new Error('Invalid multiaddr');\n }\n return new IpNet(addr, mask);\n}\nconst decoders = Object.values(bases).map((c) => c.decoder);\nconst anybaseDecoder = (function () {\n let acc = decoders[0].or(decoders[1]);\n decoders.slice(2).forEach((d) => (acc = acc.or(d)));\n return acc;\n})();\nfunction ip2bytes(ipString) {\n if (!ip.isIP(ipString)) {\n throw new Error('invalid ip address');\n }\n return ip.toBytes(ipString);\n}\nfunction bytes2ip(ipBuff) {\n const ipString = ip.toString(ipBuff, 0, ipBuff.length);\n if (ipString == null) {\n throw new Error('ipBuff is required');\n }\n if (!ip.isIP(ipString)) {\n throw new Error('invalid ip address');\n }\n return ipString;\n}\nfunction port2bytes(port) {\n const buf = new ArrayBuffer(2);\n const view = new DataView(buf);\n view.setUint16(0, port);\n return new Uint8Array(buf);\n}\nfunction bytes2port(buf) {\n const view = new DataView(buf.buffer);\n return view.getUint16(buf.byteOffset);\n}\nfunction str2bytes(str) {\n const buf = uint8ArrayFromString(str);\n const size = Uint8Array.from(varint.encode(buf.length));\n return uint8ArrayConcat([size, buf], size.length + buf.length);\n}\nfunction bytes2str(buf) {\n const size = varint.decode(buf);\n buf = buf.slice(varint.encodingLength(size));\n if (buf.length !== size) {\n throw new Error('inconsistent lengths');\n }\n return uint8ArrayToString(buf);\n}\nfunction mh2bytes(hash) {\n let mh;\n if (hash[0] === 'Q' || hash[0] === '1') {\n mh = Digest.decode(base58btc.decode(`z${hash}`)).bytes;\n }\n else {\n mh = CID.parse(hash).multihash.bytes;\n }\n // the address is a varint prefixed multihash string representation\n const size = Uint8Array.from(varint.encode(mh.length));\n return uint8ArrayConcat([size, mh], size.length + mh.length);\n}\nfunction mb2bytes(mbstr) {\n const mb = anybaseDecoder.decode(mbstr);\n const size = Uint8Array.from(varint.encode(mb.length));\n return uint8ArrayConcat([size, mb], size.length + mb.length);\n}\nfunction bytes2mb(buf) {\n const size = varint.decode(buf);\n const hash = buf.slice(varint.encodingLength(size));\n if (hash.length !== size) {\n throw new Error('inconsistent lengths');\n }\n return 'u' + uint8ArrayToString(hash, 'base64url');\n}\n/**\n * Converts bytes to bas58btc string\n */\nfunction bytes2mh(buf) {\n const size = varint.decode(buf);\n const address = buf.slice(varint.encodingLength(size));\n if (address.length !== size) {\n throw new Error('inconsistent lengths');\n }\n return uint8ArrayToString(address, 'base58btc');\n}\nfunction onion2bytes(str) {\n const addr = str.split(':');\n if (addr.length !== 2) {\n throw new Error(`failed to parse onion addr: [\"'${addr.join('\", \"')}'\"]' does not contain a port number`);\n }\n if (addr[0].length !== 16) {\n throw new Error(`failed to parse onion addr: ${addr[0]} not a Tor onion address.`);\n }\n // onion addresses do not include the multibase prefix, add it before decoding\n const buf = base32.decode('b' + addr[0]);\n // onion port number\n const port = parseInt(addr[1], 10);\n if (port < 1 || port > 65536) {\n throw new Error('Port number is not in range(1, 65536)');\n }\n const portBuf = port2bytes(port);\n return uint8ArrayConcat([buf, portBuf], buf.length + portBuf.length);\n}\nfunction onion32bytes(str) {\n const addr = str.split(':');\n if (addr.length !== 2) {\n throw new Error(`failed to parse onion addr: [\"'${addr.join('\", \"')}'\"]' does not contain a port number`);\n }\n if (addr[0].length !== 56) {\n throw new Error(`failed to parse onion addr: ${addr[0]} not a Tor onion3 address.`);\n }\n // onion addresses do not include the multibase prefix, add it before decoding\n const buf = base32.decode(`b${addr[0]}`);\n // onion port number\n const port = parseInt(addr[1], 10);\n if (port < 1 || port > 65536) {\n throw new Error('Port number is not in range(1, 65536)');\n }\n const portBuf = port2bytes(port);\n return uint8ArrayConcat([buf, portBuf], buf.length + portBuf.length);\n}\nfunction bytes2onion(buf) {\n const addrBytes = buf.slice(0, buf.length - 2);\n const portBytes = buf.slice(buf.length - 2);\n const addr = uint8ArrayToString(addrBytes, 'base32');\n const port = bytes2port(portBytes);\n return `${addr}:${port}`;\n}\n//# sourceMappingURL=convert.js.map","import * as varint from 'uint8-varint';\nimport { concat as uint8ArrayConcat } from 'uint8arrays/concat';\nimport { toString as uint8ArrayToString } from 'uint8arrays/to-string';\nimport { convertToBytes, convertToString } from './convert.js';\nimport { getProtocol } from './protocols-table.js';\nexport function stringToMultiaddrParts(str) {\n str = cleanPath(str);\n const tuples = [];\n const stringTuples = [];\n let path = null;\n const parts = str.split('/').slice(1);\n if (parts.length === 1 && parts[0] === '') {\n return {\n bytes: new Uint8Array(),\n string: '/',\n tuples: [],\n stringTuples: [],\n path: null\n };\n }\n for (let p = 0; p < parts.length; p++) {\n const part = parts[p];\n const proto = getProtocol(part);\n if (proto.size === 0) {\n tuples.push([proto.code]);\n stringTuples.push([proto.code]);\n // eslint-disable-next-line no-continue\n continue;\n }\n p++; // advance addr part\n if (p >= parts.length) {\n throw ParseError('invalid address: ' + str);\n }\n // if it's a path proto, take the rest\n if (proto.path === true) {\n // should we need to check each path part to see if it's a proto?\n // This would allow for other protocols to be added after a unix path,\n // however it would have issues if the path had a protocol name in the path\n path = cleanPath(parts.slice(p).join('/'));\n tuples.push([proto.code, convertToBytes(proto.code, path)]);\n stringTuples.push([proto.code, path]);\n break;\n }\n const bytes = convertToBytes(proto.code, parts[p]);\n tuples.push([proto.code, bytes]);\n stringTuples.push([proto.code, convertToString(proto.code, bytes)]);\n }\n return {\n string: stringTuplesToString(stringTuples),\n bytes: tuplesToBytes(tuples),\n tuples,\n stringTuples,\n path\n };\n}\nexport function bytesToMultiaddrParts(bytes) {\n const tuples = [];\n const stringTuples = [];\n let path = null;\n let i = 0;\n while (i < bytes.length) {\n const code = varint.decode(bytes, i);\n const n = varint.encodingLength(code);\n const p = getProtocol(code);\n const size = sizeForAddr(p, bytes.slice(i + n));\n if (size === 0) {\n tuples.push([code]);\n stringTuples.push([code]);\n i += n;\n // eslint-disable-next-line no-continue\n continue;\n }\n const addr = bytes.slice(i + n, i + n + size);\n i += (size + n);\n if (i > bytes.length) { // did not end _exactly_ at buffer.length\n throw ParseError('Invalid address Uint8Array: ' + uint8ArrayToString(bytes, 'base16'));\n }\n // ok, tuple seems good.\n tuples.push([code, addr]);\n const stringAddr = convertToString(code, addr);\n stringTuples.push([code, stringAddr]);\n if (p.path === true) {\n // should we need to check each path part to see if it's a proto?\n // This would allow for other protocols to be added after a unix path,\n // however it would have issues if the path had a protocol name in the path\n path = stringAddr;\n break;\n }\n }\n return {\n bytes: Uint8Array.from(bytes),\n string: stringTuplesToString(stringTuples),\n tuples,\n stringTuples,\n path\n };\n}\n/**\n * [[str name, str addr]... ] -> string\n */\nfunction stringTuplesToString(tuples) {\n const parts = [];\n tuples.map((tup) => {\n const proto = getProtocol(tup[0]);\n parts.push(proto.name);\n if (tup.length > 1 && tup[1] != null) {\n parts.push(tup[1]);\n }\n return null;\n });\n return cleanPath(parts.join('/'));\n}\n/**\n * [[int code, Uint8Array ]... ] -> Uint8Array\n */\nexport function tuplesToBytes(tuples) {\n return uint8ArrayConcat(tuples.map((tup) => {\n const proto = getProtocol(tup[0]);\n let buf = Uint8Array.from(varint.encode(proto.code));\n if (tup.length > 1 && tup[1] != null) {\n buf = uint8ArrayConcat([buf, tup[1]]); // add address buffer\n }\n return buf;\n }));\n}\n/**\n * For the passed address, return the serialized size\n */\nfunction sizeForAddr(p, addr) {\n if (p.size > 0) {\n return p.size / 8;\n }\n else if (p.size === 0) {\n return 0;\n }\n else {\n const size = varint.decode(addr instanceof Uint8Array ? addr : Uint8Array.from(addr));\n return size + varint.encodingLength(size);\n }\n}\nexport function bytesToTuples(buf) {\n const tuples = [];\n let i = 0;\n while (i < buf.length) {\n const code = varint.decode(buf, i);\n const n = varint.encodingLength(code);\n const p = getProtocol(code);\n const size = sizeForAddr(p, buf.slice(i + n));\n if (size === 0) {\n tuples.push([code]);\n i += n;\n // eslint-disable-next-line no-continue\n continue;\n }\n const addr = buf.slice(i + n, i + n + size);\n i += (size + n);\n if (i > buf.length) { // did not end _exactly_ at buffer.length\n throw ParseError('Invalid address Uint8Array: ' + uint8ArrayToString(buf, 'base16'));\n }\n // ok, tuple seems good.\n tuples.push([code, addr]);\n }\n return tuples;\n}\nexport function cleanPath(str) {\n return '/' + str.trim().split('/').filter((a) => a).join('/');\n}\nexport function ParseError(str) {\n return new Error('Error parsing address: ' + str);\n}\n//# sourceMappingURL=codec.js.map","/**\n * @packageDocumentation\n *\n * An implementation of a Multiaddr in JavaScript\n *\n * @example\n *\n * ```js\n * import { multiaddr } from '@multiformats/multiaddr'\n *\n * const ma = multiaddr('/ip4/127.0.0.1/tcp/1234')\n * ```\n */\nimport { CodeError } from '@libp2p/interface';\nimport { base58btc } from 'multiformats/bases/base58';\nimport { CID } from 'multiformats/cid';\nimport { equals as uint8ArrayEquals } from 'uint8arrays/equals';\nimport { toString as uint8ArrayToString } from 'uint8arrays/to-string';\nimport { bytesToMultiaddrParts, stringToMultiaddrParts, tuplesToBytes } from './codec.js';\nimport { getProtocol, names } from './protocols-table.js';\nimport { isMultiaddr, multiaddr, resolvers } from './index.js';\nconst inspect = Symbol.for('nodejs.util.inspect.custom');\nexport const symbol = Symbol.for('@multiformats/js-multiaddr/multiaddr');\nconst DNS_CODES = [\n getProtocol('dns').code,\n getProtocol('dns4').code,\n getProtocol('dns6').code,\n getProtocol('dnsaddr').code\n];\n/**\n * Creates a {@link Multiaddr} from a {@link MultiaddrInput}\n */\nexport class Multiaddr {\n bytes;\n #string;\n #tuples;\n #stringTuples;\n #path;\n [symbol] = true;\n constructor(addr) {\n // default\n if (addr == null) {\n addr = '';\n }\n let parts;\n if (addr instanceof Uint8Array) {\n parts = bytesToMultiaddrParts(addr);\n }\n else if (typeof addr === 'string') {\n if (addr.length > 0 && addr.charAt(0) !== '/') {\n throw new Error(`multiaddr \"${addr}\" must start with a \"/\"`);\n }\n parts = stringToMultiaddrParts(addr);\n }\n else if (isMultiaddr(addr)) { // Multiaddr\n parts = bytesToMultiaddrParts(addr.bytes);\n }\n else {\n throw new Error('addr must be a string, Buffer, or another Multiaddr');\n }\n this.bytes = parts.bytes;\n this.#string = parts.string;\n this.#tuples = parts.tuples;\n this.#stringTuples = parts.stringTuples;\n this.#path = parts.path;\n }\n toString() {\n return this.#string;\n }\n toJSON() {\n return this.toString();\n }\n toOptions() {\n let family;\n let transport;\n let host;\n let port;\n let zone = '';\n const tcp = getProtocol('tcp');\n const udp = getProtocol('udp');\n const ip4 = getProtocol('ip4');\n const ip6 = getProtocol('ip6');\n const dns6 = getProtocol('dns6');\n const ip6zone = getProtocol('ip6zone');\n for (const [code, value] of this.stringTuples()) {\n if (code === ip6zone.code) {\n zone = `%${value ?? ''}`;\n }\n // default to https when protocol & port are omitted from DNS addrs\n if (DNS_CODES.includes(code)) {\n transport = tcp.name;\n port = 443;\n host = `${value ?? ''}${zone}`;\n family = code === dns6.code ? 6 : 4;\n }\n if (code === tcp.code || code === udp.code) {\n transport = getProtocol(code).name;\n port = parseInt(value ?? '');\n }\n if (code === ip4.code || code === ip6.code) {\n transport = getProtocol(code).name;\n host = `${value ?? ''}${zone}`;\n family = code === ip6.code ? 6 : 4;\n }\n }\n if (family == null || transport == null || host == null || port == null) {\n throw new Error('multiaddr must have a valid format: \"/{ip4, ip6, dns4, dns6, dnsaddr}/{address}/{tcp, udp}/{port}\".');\n }\n const opts = {\n family,\n host,\n transport,\n port\n };\n return opts;\n }\n protos() {\n return this.#tuples.map(([code]) => Object.assign({}, getProtocol(code)));\n }\n protoCodes() {\n return this.#tuples.map(([code]) => code);\n }\n protoNames() {\n return this.#tuples.map(([code]) => getProtocol(code).name);\n }\n tuples() {\n return this.#tuples;\n }\n stringTuples() {\n return this.#stringTuples;\n }\n encapsulate(addr) {\n addr = new Multiaddr(addr);\n return new Multiaddr(this.toString() + addr.toString());\n }\n decapsulate(addr) {\n const addrString = addr.toString();\n const s = this.toString();\n const i = s.lastIndexOf(addrString);\n if (i < 0) {\n throw new Error(`Address ${this.toString()} does not contain subaddress: ${addr.toString()}`);\n }\n return new Multiaddr(s.slice(0, i));\n }\n decapsulateCode(code) {\n const tuples = this.tuples();\n for (let i = tuples.length - 1; i >= 0; i--) {\n if (tuples[i][0] === code) {\n return new Multiaddr(tuplesToBytes(tuples.slice(0, i)));\n }\n }\n return this;\n }\n getPeerId() {\n try {\n let tuples = [];\n this.stringTuples().forEach(([code, name]) => {\n if (code === names.p2p.code) {\n tuples.push([code, name]);\n }\n // if this is a p2p-circuit address, return the target peer id if present\n // not the peer id of the relay\n if (code === names['p2p-circuit'].code) {\n tuples = [];\n }\n });\n // Get the last ipfs tuple ['p2p', 'peerid string']\n const tuple = tuples.pop();\n if (tuple?.[1] != null) {\n const peerIdStr = tuple[1];\n // peer id is base58btc encoded string but not multibase encoded so add the `z`\n // prefix so we can validate that it is correctly encoded\n if (peerIdStr[0] === 'Q' || peerIdStr[0] === '1') {\n return uint8ArrayToString(base58btc.decode(`z${peerIdStr}`), 'base58btc');\n }\n // try to parse peer id as CID\n return uint8ArrayToString(CID.parse(peerIdStr).multihash.bytes, 'base58btc');\n }\n return null;\n }\n catch (e) {\n return null;\n }\n }\n getPath() {\n return this.#path;\n }\n equals(addr) {\n return uint8ArrayEquals(this.bytes, addr.bytes);\n }\n async resolve(options) {\n const resolvableProto = this.protos().find((p) => p.resolvable);\n // Multiaddr is not resolvable?\n if (resolvableProto == null) {\n return [this];\n }\n const resolver = resolvers.get(resolvableProto.name);\n if (resolver == null) {\n throw new CodeError(`no available resolver for ${resolvableProto.name}`, 'ERR_NO_AVAILABLE_RESOLVER');\n }\n const result = await resolver(this, options);\n return result.map(str => multiaddr(str));\n }\n nodeAddress() {\n const options = this.toOptions();\n if (options.transport !== 'tcp' && options.transport !== 'udp') {\n throw new Error(`multiaddr must have a valid format - no protocol with name: \"${options.transport}\". Must have a valid transport protocol: \"{tcp, udp}\"`);\n }\n return {\n family: options.family,\n address: options.host,\n port: options.port\n };\n }\n isThinWaistAddress(addr) {\n const protos = (addr ?? this).protos();\n if (protos.length !== 2) {\n return false;\n }\n if (protos[0].code !== 4 && protos[0].code !== 41) {\n return false;\n }\n if (protos[1].code !== 6 && protos[1].code !== 273) {\n return false;\n }\n return true;\n }\n /**\n * Returns Multiaddr as a human-readable string\n * https://nodejs.org/api/util.html#utilinspectcustom\n *\n * @example\n * ```js\n * import { multiaddr } from '@multiformats/multiaddr'\n *\n * console.info(multiaddr('/ip4/127.0.0.1/tcp/4001'))\n * // 'Multiaddr(/ip4/127.0.0.1/tcp/4001)'\n * ```\n */\n [inspect]() {\n return `Multiaddr(${this.#string})`;\n }\n}\n//# sourceMappingURL=multiaddr.js.map","/**\n * @packageDocumentation\n *\n * A standard way to represent addresses that\n *\n * - support any standard network protocol\n * - are self-describing\n * - have a binary packed format\n * - have a nice string representation\n * - encapsulate well\n *\n * @example\n *\n * ```TypeScript\n * import { multiaddr } from '@multiformats/multiaddr'\n * const addr = multiaddr(\"/ip4/127.0.0.1/udp/1234\")\n * // Multiaddr(/ip4/127.0.0.1/udp/1234)\n *\n * const addr = multiaddr(\"/ip4/127.0.0.1/udp/1234\")\n * // Multiaddr(/ip4/127.0.0.1/udp/1234)\n *\n * addr.bytes\n * // \n *\n * addr.toString()\n * // '/ip4/127.0.0.1/udp/1234'\n *\n * addr.protos()\n * // [\n * // {code: 4, name: 'ip4', size: 32},\n * // {code: 273, name: 'udp', size: 16}\n * // ]\n *\n * // gives you an object that is friendly with what Node.js core modules expect for addresses\n * addr.nodeAddress()\n * // {\n * // family: 4,\n * // port: 1234,\n * // address: \"127.0.0.1\"\n * // }\n *\n * addr.encapsulate('/sctp/5678')\n * // Multiaddr(/ip4/127.0.0.1/udp/1234/sctp/5678)\n * ```\n *\n * ## Resolving DNSADDR addresses\n *\n * [DNSADDR](https://github.com/multiformats/multiaddr/blob/master/protocols/DNSADDR.md) is a spec that allows storing a TXT DNS record that contains a Multiaddr.\n *\n * To resolve DNSADDR addresses, call the `.resolve()` function the multiaddr, optionally passing a `DNS` resolver.\n *\n * DNSADDR addresses can resolve to multiple multiaddrs, since there is no limit to the number of TXT records that can be stored.\n *\n * @example Resolving DNSADDR Multiaddrs\n *\n * ```TypeScript\n * import { multiaddr, resolvers } from '@multiformats/multiaddr'\n * import { dnsaddr } from '@multiformats/multiaddr/resolvers'\n *\n * resolvers.set('dnsaddr', dnsaddr)\n *\n * const ma = multiaddr('/dnsaddr/bootstrap.libp2p.io')\n *\n * // resolve with a 5s timeout\n * const resolved = await ma.resolve({\n * signal: AbortSignal.timeout(5000)\n * })\n *\n * console.info(await ma.resolve(resolved)\n * // [Multiaddr('/ip4/147.75...'), Multiaddr('/ip4/147.75...'), Multiaddr('/ip4/147.75...')...]\n * ```\n *\n * @example Using a custom DNS resolver to resolve DNSADDR Multiaddrs\n *\n * See the docs for [@multiformats/dns](https://www.npmjs.com/package/@multiformats/dns) for a full breakdown of how to specify multiple resolvers or resolvers that can be used for specific TLDs.\n *\n * ```TypeScript\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { dns } from '@multiformats/dns'\n * import { dnsJsonOverHttps } from '@multiformats/dns/resolvers'\n *\n * const resolver = dns({\n * '.': dnsJsonOverHttps('https://cloudflare-dns.com/dns-query')\n * })\n *\n * const ma = multiaddr('/dnsaddr/bootstrap.libp2p.io')\n * const resolved = await ma.resolve({\n * dns: resolver\n * })\n *\n * console.info(resolved)\n * // [Multiaddr('/ip4/147.75...'), Multiaddr('/ip4/147.75...'), Multiaddr('/ip4/147.75...')...]\n * ```\n */\nimport { Multiaddr as MultiaddrClass, symbol } from './multiaddr.js';\nimport { getProtocol } from './protocols-table.js';\n/**\n * All configured {@link Resolver}s\n */\nexport const resolvers = new Map();\nexport { MultiaddrFilter } from './filter/multiaddr-filter.js';\n/**\n * Creates a Multiaddr from a node-friendly address object\n *\n * @example\n * ```js\n * import { fromNodeAddress } from '@multiformats/multiaddr'\n *\n * fromNodeAddress({address: '127.0.0.1', port: '4001'}, 'tcp')\n * // Multiaddr(/ip4/127.0.0.1/tcp/4001)\n * ```\n */\nexport function fromNodeAddress(addr, transport) {\n if (addr == null) {\n throw new Error('requires node address object');\n }\n if (transport == null) {\n throw new Error('requires transport protocol');\n }\n let ip;\n let host = addr.address;\n switch (addr.family) {\n case 4:\n ip = 'ip4';\n break;\n case 6:\n ip = 'ip6';\n if (host.includes('%')) {\n const parts = host.split('%');\n if (parts.length !== 2) {\n throw Error('Multiple ip6 zones in multiaddr');\n }\n host = parts[0];\n const zone = parts[1];\n ip = `/ip6zone/${zone}/ip6`;\n }\n break;\n default:\n throw Error('Invalid addr family, should be 4 or 6.');\n }\n return new MultiaddrClass('/' + [ip, host, transport, addr.port].join('/'));\n}\n/**\n * Returns if something is a {@link Multiaddr} that is a resolvable name\n *\n * @example\n *\n * ```js\n * import { isName, multiaddr } from '@multiformats/multiaddr'\n *\n * isName(multiaddr('/ip4/127.0.0.1'))\n * // false\n * isName(multiaddr('/dns/ipfs.io'))\n * // true\n * ```\n */\nexport function isName(addr) {\n if (!isMultiaddr(addr)) {\n return false;\n }\n // if a part of the multiaddr is resolvable, then return true\n return addr.protos().some((proto) => proto.resolvable);\n}\n/**\n * Check if object is a {@link Multiaddr} instance\n *\n * @example\n *\n * ```js\n * import { isMultiaddr, multiaddr } from '@multiformats/multiaddr'\n *\n * isMultiaddr(5)\n * // false\n * isMultiaddr(multiaddr('/ip4/127.0.0.1'))\n * // true\n * ```\n */\nexport function isMultiaddr(value) {\n return Boolean(value?.[symbol]);\n}\n/**\n * A function that takes a {@link MultiaddrInput} and returns a {@link Multiaddr}\n *\n * @example\n * ```js\n * import { multiaddr } from '@libp2p/multiaddr'\n *\n * multiaddr('/ip4/127.0.0.1/tcp/4001')\n * // Multiaddr(/ip4/127.0.0.1/tcp/4001)\n * ```\n *\n * @param {MultiaddrInput} [addr] - If String or Uint8Array, needs to adhere to the address format of a [multiaddr](https://github.com/multiformats/multiaddr#string-format)\n */\nexport function multiaddr(addr) {\n return new MultiaddrClass(addr);\n}\nexport { getProtocol as protocols };\n//# sourceMappingURL=index.js.map","import { sha256 } from \"@noble/hashes/sha256\";\nimport { isDefined } from \"@waku/utils\";\nimport { bytesToUtf8, concat, numberToBytes, utf8ToBytes } from \"@waku/utils/bytes\";\n/**\n * Deterministic Message Hashing as defined in\n * [14/WAKU2-MESSAGE](https://rfc.vac.dev/spec/14/#deterministic-message-hashing)\n */\nexport function messageHash(pubsubTopic, message) {\n const pubsubTopicBytes = utf8ToBytes(pubsubTopic);\n const contentTopicBytes = utf8ToBytes(message.contentTopic);\n const timestampBytes = tryConvertTimestampToBytes(message.timestamp);\n const bytes = concat([\n pubsubTopicBytes,\n message.payload,\n contentTopicBytes,\n message.meta,\n timestampBytes\n ].filter(isDefined));\n return sha256(bytes);\n}\nfunction tryConvertTimestampToBytes(timestamp) {\n if (!timestamp) {\n return;\n }\n let bigIntTimestamp;\n if (typeof timestamp === \"bigint\") {\n bigIntTimestamp = timestamp;\n }\n else {\n bigIntTimestamp = BigInt(timestamp.valueOf()) * 1000000n;\n }\n return numberToBytes(bigIntTimestamp);\n}\nexport function messageHashStr(pubsubTopic, message) {\n const hash = messageHash(pubsubTopic, message);\n const hashStr = bytesToUtf8(hash);\n return hashStr;\n}\n//# sourceMappingURL=index.js.map","import { getHealthManager } from \"@waku/core\";\nimport { delay, Logger } from \"@waku/utils\";\nconst RENEW_TIME_LOCK_DURATION = 30 * 1000;\nconst DEFAULT_NUM_PEERS_TO_USE = 2;\nconst DEFAULT_MAINTAIN_PEERS_INTERVAL = 30_000;\nexport class BaseProtocolSDK {\n core;\n connectionManager;\n healthManager;\n numPeersToUse;\n peers = [];\n maintainPeersIntervalId = null;\n log;\n maintainPeersLock = false;\n renewPeersLocker = new RenewPeerLocker(RENEW_TIME_LOCK_DURATION);\n constructor(core, connectionManager, options) {\n this.core = core;\n this.connectionManager = connectionManager;\n this.log = new Logger(`sdk:${core.multicodec}`);\n this.healthManager = getHealthManager();\n this.numPeersToUse = options?.numPeersToUse ?? DEFAULT_NUM_PEERS_TO_USE;\n const maintainPeersInterval = options?.maintainPeersInterval ?? DEFAULT_MAINTAIN_PEERS_INTERVAL;\n void this.startMaintainPeersInterval(maintainPeersInterval);\n }\n get connectedPeers() {\n return this.peers;\n }\n /**\n * Disconnects from a peer and tries to find a new one to replace it.\n * @param peerToDisconnect The peer to disconnect from.\n * @returns The new peer that was found and connected to.\n */\n async renewPeer(peerToDisconnect) {\n this.log.info(`Renewing peer ${peerToDisconnect}`);\n await this.connectionManager.dropConnection(peerToDisconnect);\n const peer = (await this.findAndAddPeers(1))[0];\n if (!peer) {\n this.log.error(\"Failed to find a new peer to replace the disconnected one.\");\n }\n const updatedPeers = this.peers.filter((peer) => !peer.id.equals(peerToDisconnect));\n this.updatePeers(updatedPeers);\n this.log.info(`Peer ${peerToDisconnect} disconnected and removed from the peer list`);\n this.renewPeersLocker.lock(peerToDisconnect);\n return peer;\n }\n /**\n * Stops the maintain peers interval.\n */\n stopMaintainPeersInterval() {\n if (this.maintainPeersIntervalId) {\n clearInterval(this.maintainPeersIntervalId);\n this.maintainPeersIntervalId = null;\n this.log.info(\"Maintain peers interval stopped\");\n }\n }\n /**\n * Checks if there are peers to send a message to.\n * If `forceUseAllPeers` is `false` (default) and there are connected peers, returns `true`.\n * If `forceUseAllPeers` is `true` or there are no connected peers, tries to find new peers from the ConnectionManager.\n * If `autoRetry` is `false`, returns `false` if no peers are found.\n * If `autoRetry` is `true`, tries to find new peers from the ConnectionManager with exponential backoff.\n * Returns `true` if peers are found, `false` otherwise.\n * @param options Optional options object\n * @param options.autoRetry Optional flag to enable auto-retry with exponential backoff (default: false)\n * @param options.forceUseAllPeers Optional flag to force using all available peers (default: false)\n * @param options.initialDelay Optional initial delay in milliseconds for exponential backoff (default: 10)\n * @param options.maxAttempts Optional maximum number of attempts for exponential backoff (default: 3)\n * @param options.maxDelay Optional maximum delay in milliseconds for exponential backoff (default: 100)\n */\n hasPeers = async (options = {}) => {\n const { autoRetry = false, forceUseAllPeers = false, initialDelay = 10, maxAttempts = 3, maxDelay = 100 } = options;\n if (!forceUseAllPeers && this.connectedPeers.length > 0)\n return true;\n let attempts = 0;\n while (attempts < maxAttempts) {\n attempts++;\n if (await this.maintainPeers()) {\n if (this.peers.length < this.numPeersToUse) {\n this.log.warn(`Found only ${this.peers.length} peers, expected ${this.numPeersToUse}`);\n }\n return true;\n }\n if (!autoRetry)\n return false;\n const delayMs = Math.min(initialDelay * Math.pow(2, attempts - 1), maxDelay);\n await delay(delayMs);\n }\n this.log.error(\"Failed to find peers to send message to\");\n return false;\n };\n /**\n * Starts an interval to maintain the peers list to `numPeersToUse`.\n * @param interval The interval in milliseconds to maintain the peers.\n */\n async startMaintainPeersInterval(interval) {\n this.log.info(\"Starting maintain peers interval\");\n try {\n await this.maintainPeers();\n this.maintainPeersIntervalId = setInterval(() => {\n this.maintainPeers().catch((error) => {\n this.log.error(\"Error during maintain peers interval:\", error);\n });\n }, interval);\n this.log.info(`Maintain peers interval started with interval ${interval}ms`);\n }\n catch (error) {\n this.log.error(\"Error starting maintain peers interval:\", error);\n throw error;\n }\n }\n /**\n * Maintains the peers list to `numPeersToUse`.\n */\n async maintainPeers() {\n if (this.maintainPeersLock) {\n return false;\n }\n this.maintainPeersLock = true;\n this.log.info(`Maintaining peers, current count: ${this.peers.length}`);\n try {\n const numPeersToAdd = this.numPeersToUse - this.peers.length;\n if (numPeersToAdd > 0) {\n await this.findAndAddPeers(numPeersToAdd);\n }\n this.log.info(`Peer maintenance completed, current count: ${this.peers.length}`);\n this.renewPeersLocker.cleanUnlocked();\n }\n finally {\n this.maintainPeersLock = false;\n }\n return true;\n }\n /**\n * Finds and adds new peers to the peers list.\n * @param numPeers The number of peers to find and add.\n */\n async findAndAddPeers(numPeers) {\n this.log.info(`Finding and adding ${numPeers} new peers`);\n try {\n const additionalPeers = await this.findAdditionalPeers(numPeers);\n const dials = additionalPeers.map((peer) => this.connectionManager.attemptDial(peer.id));\n await Promise.all(dials);\n const updatedPeers = [...this.peers, ...additionalPeers];\n this.updatePeers(updatedPeers);\n this.log.info(`Added ${additionalPeers.length} new peers, total peers: ${this.peers.length}`);\n return additionalPeers;\n }\n catch (error) {\n this.log.error(\"Error finding and adding new peers:\", error);\n throw error;\n }\n }\n /**\n * Finds additional peers.\n * Attempts to find peers without using bootstrap peers first,\n * If no peers are found,\n * tries with bootstrap peers.\n * @param numPeers The number of peers to find.\n */\n async findAdditionalPeers(numPeers) {\n this.log.info(`Finding ${numPeers} additional peers`);\n try {\n let newPeers = await this.core.allPeers();\n if (newPeers.length === 0) {\n this.log.warn(\"No new peers found.\");\n }\n newPeers = newPeers\n .filter((peer) => this.peers.some((p) => p.id.equals(peer.id)) === false)\n .filter((peer) => !this.renewPeersLocker.isLocked(peer.id))\n .slice(0, numPeers);\n return newPeers;\n }\n catch (error) {\n this.log.error(\"Error finding additional peers:\", error);\n throw error;\n }\n }\n updatePeers(peers) {\n this.peers = peers;\n this.healthManager.updateProtocolHealth(this.core.multicodec, this.peers.length);\n }\n}\nclass RenewPeerLocker {\n lockDuration;\n peers = new Map();\n constructor(lockDuration) {\n this.lockDuration = lockDuration;\n }\n lock(id) {\n this.peers.set(id.toString(), Date.now());\n }\n isLocked(id) {\n const time = this.peers.get(id.toString());\n if (time && !this.isTimeUnlocked(time)) {\n return true;\n }\n return false;\n }\n cleanUnlocked() {\n Object.entries(this.peers).forEach(([id, lock]) => {\n if (this.isTimeUnlocked(lock)) {\n this.peers.delete(id.toString());\n }\n });\n }\n isTimeUnlocked(time) {\n return Date.now() - time >= this.lockDuration;\n }\n}\n//# sourceMappingURL=base_protocol.js.map","import { FilterCore } from \"@waku/core\";\nimport { EConnectionStateEvents, ProtocolError } from \"@waku/interfaces\";\nimport { messageHashStr } from \"@waku/message-hash\";\nimport { ensurePubsubTopicIsConfigured, groupByContentTopic, Logger, shardInfoToPubsubTopics, toAsyncIterator } from \"@waku/utils\";\nimport { BaseProtocolSDK } from \"./base_protocol.js\";\nconst log = new Logger(\"sdk:filter\");\nconst DEFAULT_MAX_PINGS = 2;\nconst DEFAULT_MAX_MISSED_MESSAGES_THRESHOLD = 3;\nconst DEFAULT_KEEP_ALIVE = 60 * 1000;\nexport class SubscriptionManager {\n pubsubTopic;\n protocol;\n connectionManager;\n getPeers;\n renewPeer;\n subscriptionCallbacks = new Map();\n receivedMessagesHashStr = [];\n peerFailures = new Map();\n receivedMessagesHashes;\n missedMessagesByPeer = new Map();\n keepAliveInterval = DEFAULT_KEEP_ALIVE;\n maxPingFailures = DEFAULT_MAX_PINGS;\n maxMissedMessagesThreshold = DEFAULT_MAX_MISSED_MESSAGES_THRESHOLD;\n keepAliveTimer = null;\n constructor(pubsubTopic, protocol, connectionManager, getPeers, renewPeer) {\n this.pubsubTopic = pubsubTopic;\n this.protocol = protocol;\n this.connectionManager = connectionManager;\n this.getPeers = getPeers;\n this.renewPeer = renewPeer;\n this.pubsubTopic = pubsubTopic;\n const allPeerIdStr = this.getPeers().map((p) => p.id.toString());\n this.receivedMessagesHashes = {\n all: new Set(),\n nodes: {\n ...Object.fromEntries(allPeerIdStr.map((peerId) => [peerId, new Set()]))\n }\n };\n allPeerIdStr.forEach((peerId) => this.missedMessagesByPeer.set(peerId, 0));\n }\n addHash(hash, peerIdStr) {\n this.receivedMessagesHashes.all.add(hash);\n if (!peerIdStr) {\n return;\n }\n if (!this.receivedMessagesHashes.nodes[peerIdStr]) {\n this.receivedMessagesHashes.nodes[peerIdStr] = new Set();\n }\n this.receivedMessagesHashes.nodes[peerIdStr].add(hash);\n }\n async subscribe(decoders, callback, options = {}) {\n this.keepAliveInterval = options.keepAlive || DEFAULT_KEEP_ALIVE;\n this.maxPingFailures = options.pingsBeforePeerRenewed || DEFAULT_MAX_PINGS;\n this.maxMissedMessagesThreshold =\n options.maxMissedMessagesThreshold ||\n DEFAULT_MAX_MISSED_MESSAGES_THRESHOLD;\n const decodersArray = Array.isArray(decoders) ? decoders : [decoders];\n // check that all decoders are configured for the same pubsub topic as this subscription\n for (const decoder of decodersArray) {\n if (decoder.pubsubTopic !== this.pubsubTopic) {\n return {\n failures: [\n {\n error: ProtocolError.TOPIC_DECODER_MISMATCH\n }\n ],\n successes: []\n };\n }\n }\n const decodersGroupedByCT = groupByContentTopic(decodersArray);\n const contentTopics = Array.from(decodersGroupedByCT.keys());\n const promises = this.getPeers().map(async (peer) => this.protocol.subscribe(this.pubsubTopic, peer, contentTopics));\n const results = await Promise.allSettled(promises);\n const finalResult = this.handleResult(results, \"subscribe\");\n // Save the callback functions by content topics so they\n // can easily be removed (reciprocally replaced) if `unsubscribe` (reciprocally `subscribe`)\n // is called for those content topics\n decodersGroupedByCT.forEach((decoders, contentTopic) => {\n // Cast the type because a given `subscriptionCallbacks` map may hold\n // Decoder that decode to different implementations of `IDecodedMessage`\n const subscriptionCallback = {\n decoders,\n callback\n };\n // The callback and decoder may override previous values, this is on\n // purpose as the user may call `subscribe` to refresh the subscription\n this.subscriptionCallbacks.set(contentTopic, subscriptionCallback);\n });\n this.startSubscriptionsMaintenance(this.keepAliveInterval);\n return finalResult;\n }\n async unsubscribe(contentTopics) {\n const promises = this.getPeers().map(async (peer) => {\n const response = await this.protocol.unsubscribe(this.pubsubTopic, peer, contentTopics);\n contentTopics.forEach((contentTopic) => {\n this.subscriptionCallbacks.delete(contentTopic);\n });\n return response;\n });\n const results = await Promise.allSettled(promises);\n const finalResult = this.handleResult(results, \"unsubscribe\");\n if (this.subscriptionCallbacks.size === 0) {\n this.stopSubscriptionsMaintenance();\n }\n return finalResult;\n }\n async ping(peerId) {\n const peers = peerId ? [peerId] : this.getPeers().map((peer) => peer.id);\n const promises = peers.map((peerId) => this.pingSpecificPeer(peerId));\n const results = await Promise.allSettled(promises);\n return this.handleResult(results, \"ping\");\n }\n async unsubscribeAll() {\n const promises = this.getPeers().map(async (peer) => this.protocol.unsubscribeAll(this.pubsubTopic, peer));\n const results = await Promise.allSettled(promises);\n this.subscriptionCallbacks.clear();\n const finalResult = this.handleResult(results, \"unsubscribeAll\");\n this.stopSubscriptionsMaintenance();\n return finalResult;\n }\n async validateMessage() {\n for (const hash of this.receivedMessagesHashes.all) {\n for (const [peerIdStr, hashes] of Object.entries(this.receivedMessagesHashes.nodes)) {\n if (!hashes.has(hash)) {\n this.incrementMissedMessageCount(peerIdStr);\n if (this.shouldRenewPeer(peerIdStr)) {\n log.info(`Peer ${peerIdStr} has missed too many messages, renewing.`);\n const peerId = this.getPeers().find((p) => p.id.toString() === peerIdStr)?.id;\n if (!peerId) {\n log.error(`Unexpected Error: Peer ${peerIdStr} not found in connected peers.`);\n continue;\n }\n try {\n await this.renewAndSubscribePeer(peerId);\n }\n catch (error) {\n log.error(`Failed to renew peer ${peerIdStr}: ${error}`);\n }\n }\n }\n }\n }\n }\n async processIncomingMessage(message, peerIdStr) {\n const hashedMessageStr = messageHashStr(this.pubsubTopic, message);\n this.addHash(hashedMessageStr, peerIdStr);\n void this.validateMessage();\n if (this.receivedMessagesHashStr.includes(hashedMessageStr)) {\n log.info(\"Message already received, skipping\");\n return;\n }\n this.receivedMessagesHashStr.push(hashedMessageStr);\n const { contentTopic } = message;\n const subscriptionCallback = this.subscriptionCallbacks.get(contentTopic);\n if (!subscriptionCallback) {\n log.error(\"No subscription callback available for \", contentTopic);\n return;\n }\n log.info(\"Processing message with content topic \", contentTopic, \" on pubsub topic \", this.pubsubTopic);\n await pushMessage(subscriptionCallback, this.pubsubTopic, message);\n }\n handleResult(results, type) {\n const result = { failures: [], successes: [] };\n for (const promiseResult of results) {\n if (promiseResult.status === \"rejected\") {\n log.error(`Failed to resolve ${type} promise successfully: `, promiseResult.reason);\n result.failures.push({ error: ProtocolError.GENERIC_FAIL });\n }\n else {\n const coreResult = promiseResult.value;\n if (coreResult.failure) {\n result.failures.push(coreResult.failure);\n }\n else {\n result.successes.push(coreResult.success);\n }\n }\n }\n return result;\n }\n async pingSpecificPeer(peerId) {\n const peer = this.getPeers().find((p) => p.id.equals(peerId));\n if (!peer) {\n return {\n success: null,\n failure: {\n peerId,\n error: ProtocolError.NO_PEER_AVAILABLE\n }\n };\n }\n try {\n const result = await this.protocol.ping(peer);\n if (result.failure) {\n await this.handlePeerFailure(peerId);\n }\n else {\n this.peerFailures.delete(peerId.toString());\n }\n return result;\n }\n catch (error) {\n await this.handlePeerFailure(peerId);\n return {\n success: null,\n failure: {\n peerId,\n error: ProtocolError.GENERIC_FAIL\n }\n };\n }\n }\n async handlePeerFailure(peerId) {\n const failures = (this.peerFailures.get(peerId.toString()) || 0) + 1;\n this.peerFailures.set(peerId.toString(), failures);\n if (failures > this.maxPingFailures) {\n try {\n await this.renewAndSubscribePeer(peerId);\n this.peerFailures.delete(peerId.toString());\n }\n catch (error) {\n log.error(`Failed to renew peer ${peerId.toString()}: ${error}.`);\n }\n }\n }\n async renewAndSubscribePeer(peerId) {\n try {\n const newPeer = await this.renewPeer(peerId);\n await this.protocol.subscribe(this.pubsubTopic, newPeer, Array.from(this.subscriptionCallbacks.keys()));\n this.receivedMessagesHashes.nodes[newPeer.id.toString()] = new Set();\n this.missedMessagesByPeer.set(newPeer.id.toString(), 0);\n return newPeer;\n }\n catch (error) {\n log.warn(`Failed to renew peer ${peerId.toString()}: ${error}.`);\n return;\n }\n finally {\n this.peerFailures.delete(peerId.toString());\n this.missedMessagesByPeer.delete(peerId.toString());\n delete this.receivedMessagesHashes.nodes[peerId.toString()];\n }\n }\n startSubscriptionsMaintenance(interval) {\n this.startKeepAlivePings(interval);\n this.startConnectionListener();\n }\n stopSubscriptionsMaintenance() {\n this.stopKeepAlivePings();\n this.stopConnectionListener();\n }\n startKeepAlivePings(interval) {\n if (this.keepAliveTimer) {\n log.info(\"Recurring pings already set up.\");\n return;\n }\n this.keepAliveTimer = setInterval(() => {\n void this.ping().catch((error) => {\n log.error(\"Error in keep-alive ping cycle:\", error);\n });\n }, interval);\n }\n stopKeepAlivePings() {\n if (!this.keepAliveTimer) {\n log.info(\"Already stopped recurring pings.\");\n return;\n }\n log.info(\"Stopping recurring pings.\");\n clearInterval(this.keepAliveTimer);\n this.keepAliveTimer = null;\n }\n startConnectionListener() {\n this.connectionManager.addEventListener(EConnectionStateEvents.CONNECTION_STATUS, this.connectionListener.bind(this));\n }\n stopConnectionListener() {\n this.connectionManager.removeEventListener(EConnectionStateEvents.CONNECTION_STATUS, this.connectionListener.bind(this));\n }\n async connectionListener({ detail: isConnected }) {\n if (!isConnected) {\n this.stopKeepAlivePings();\n return;\n }\n try {\n const result = await this.ping();\n const renewPeerPromises = result.failures.map(async (v) => {\n if (v.peerId) {\n await this.renewAndSubscribePeer(v.peerId);\n }\n });\n await Promise.all(renewPeerPromises);\n }\n catch (err) {\n log.error(`networkStateListener failed to recover: ${err}`);\n }\n this.startKeepAlivePings(this.keepAliveInterval);\n }\n incrementMissedMessageCount(peerIdStr) {\n const currentCount = this.missedMessagesByPeer.get(peerIdStr) || 0;\n this.missedMessagesByPeer.set(peerIdStr, currentCount + 1);\n }\n shouldRenewPeer(peerIdStr) {\n const missedMessages = this.missedMessagesByPeer.get(peerIdStr) || 0;\n return missedMessages > this.maxMissedMessagesThreshold;\n }\n}\nclass FilterSDK extends BaseProtocolSDK {\n protocol;\n _connectionManager;\n activeSubscriptions = new Map();\n constructor(connectionManager, libp2p, options) {\n super(new FilterCore(async (pubsubTopic, wakuMessage, peerIdStr) => {\n const subscription = this.getActiveSubscription(pubsubTopic);\n if (!subscription) {\n log.error(`No subscription locally registered for topic ${pubsubTopic}`);\n return;\n }\n await subscription.processIncomingMessage(wakuMessage, peerIdStr);\n }, connectionManager.configuredPubsubTopics, libp2p), connectionManager, { numPeersToUse: options?.numPeersToUse });\n this.protocol = this.core;\n this._connectionManager = connectionManager;\n }\n /**\n * Opens a subscription with the Filter protocol using the provided decoders and callback.\n * This method combines the functionality of creating a subscription and subscribing to it.\n *\n * @param {IDecoder | IDecoder[]} decoders - A single decoder or an array of decoders to use for decoding messages.\n * @param {Callback} callback - The callback function to be invoked with decoded messages.\n * @param {ProtocolUseOptions} [protocolUseOptions] - Optional settings for using the protocol.\n * @param {SubscribeOptions} [subscribeOptions] - Options for the subscription.\n *\n * @returns {Promise} A promise that resolves to an object containing:\n * - subscription: The created subscription object if successful, or null if failed.\n * - error: A ProtocolError if the subscription creation failed, or null if successful.\n * - results: An object containing arrays of failures and successes from the subscription process.\n * Only present if the subscription was created successfully.\n *\n * @throws {Error} If there's an unexpected error during the subscription process.\n *\n * @remarks\n * This method attempts to create a subscription using the pubsub topic derived from the provided decoders,\n * then tries to subscribe using the created subscription. The return value should be interpreted as follows:\n * - If `subscription` is null and `error` is non-null, a critical error occurred and the subscription failed completely.\n * - If `subscription` is non-null and `error` is null, the subscription was created successfully.\n * In this case, check the `results` field for detailed information about successes and failures during the subscription process.\n * - Even if the subscription was created successfully, there might be some failures in the results.\n *\n * @example\n * ```typescript\n * const {subscription, error, results} = await waku.filter.subscribe(decoders, callback);\n * if (!subscription || error) {\n * console.error(\"Failed to create subscription:\", error);\n * }\n * console.log(\"Subscription created successfully\");\n * if (results.failures.length > 0) {\n * console.warn(\"Some errors occurred during subscription:\", results.failures);\n * }\n * console.log(\"Successful subscriptions:\", results.successes);\n *\n * ```\n */\n async subscribe(decoders, callback, protocolUseOptions, subscribeOptions) {\n const uniquePubsubTopics = this.getUniquePubsubTopics(decoders);\n if (uniquePubsubTopics.length !== 1) {\n return {\n subscription: null,\n error: ProtocolError.INVALID_DECODER_TOPICS,\n results: null\n };\n }\n const pubsubTopic = uniquePubsubTopics[0];\n const { subscription, error } = await this.createSubscription(pubsubTopic, protocolUseOptions);\n if (error) {\n return {\n subscription: null,\n error: error,\n results: null\n };\n }\n const { failures, successes } = await subscription.subscribe(decoders, callback, subscribeOptions);\n return {\n subscription,\n error: null,\n results: {\n failures: failures,\n successes: successes\n }\n };\n }\n /**\n * Creates a new subscription to the given pubsub topic.\n * The subscription is made to multiple peers for decentralization.\n * @param pubsubTopicShardInfo The pubsub topic to subscribe to.\n * @returns The subscription object.\n */\n async createSubscription(pubsubTopicShardInfo, options) {\n options = {\n autoRetry: true,\n ...options\n };\n const pubsubTopic = typeof pubsubTopicShardInfo == \"string\"\n ? pubsubTopicShardInfo\n : shardInfoToPubsubTopics(pubsubTopicShardInfo)?.[0];\n ensurePubsubTopicIsConfigured(pubsubTopic, this.protocol.pubsubTopics);\n const hasPeers = await this.hasPeers(options);\n if (!hasPeers) {\n return {\n error: ProtocolError.NO_PEER_AVAILABLE,\n subscription: null\n };\n }\n log.info(`Creating filter subscription with ${this.connectedPeers.length} peers: `, this.connectedPeers.map((peer) => peer.id.toString()));\n const subscription = this.getActiveSubscription(pubsubTopic) ??\n this.setActiveSubscription(pubsubTopic, new SubscriptionManager(pubsubTopic, this.protocol, this._connectionManager, () => this.connectedPeers, this.renewPeer.bind(this)));\n return {\n error: null,\n subscription\n };\n }\n /**\n * This method is used to satisfy the `IReceiver` interface.\n *\n * @hidden\n *\n * @param decoders The decoders to use for the subscription.\n * @param callback The callback function to use for the subscription.\n * @param opts Optional protocol options for the subscription.\n *\n * @returns A Promise that resolves to a function that unsubscribes from the subscription.\n *\n * @remarks\n * This method should not be used directly.\n * Instead, use `createSubscription` to create a new subscription.\n */\n async subscribeWithUnsubscribe(decoders, callback, options) {\n const uniquePubsubTopics = this.getUniquePubsubTopics(decoders);\n if (uniquePubsubTopics.length === 0) {\n throw Error(\"Failed to subscribe: no pubsubTopic found on decoders provided.\");\n }\n if (uniquePubsubTopics.length > 1) {\n throw Error(\"Failed to subscribe: all decoders should have the same pubsub topic. Use createSubscription to be more agile.\");\n }\n const { subscription, error } = await this.createSubscription(uniquePubsubTopics[0]);\n if (error) {\n throw Error(`Failed to create subscription: ${error}`);\n }\n await subscription.subscribe(decoders, callback, options);\n const contentTopics = Array.from(groupByContentTopic(Array.isArray(decoders) ? decoders : [decoders]).keys());\n return async () => {\n await subscription.unsubscribe(contentTopics);\n };\n }\n toSubscriptionIterator(decoders) {\n return toAsyncIterator(this, decoders);\n }\n //TODO: move to SubscriptionManager\n getActiveSubscription(pubsubTopic) {\n return this.activeSubscriptions.get(pubsubTopic);\n }\n setActiveSubscription(pubsubTopic, subscription) {\n this.activeSubscriptions.set(pubsubTopic, subscription);\n return subscription;\n }\n getUniquePubsubTopics(decoders) {\n if (!Array.isArray(decoders)) {\n return [decoders.pubsubTopic];\n }\n if (decoders.length === 0) {\n return [];\n }\n const pubsubTopics = new Set(decoders.map((d) => d.pubsubTopic));\n return [...pubsubTopics];\n }\n}\nexport function wakuFilter(connectionManager, init) {\n return (libp2p) => new FilterSDK(connectionManager, libp2p, init);\n}\nasync function pushMessage(subscriptionCallback, pubsubTopic, message) {\n const { decoders, callback } = subscriptionCallback;\n const { contentTopic } = message;\n if (!contentTopic) {\n log.warn(\"Message has no content topic, skipping\");\n return;\n }\n try {\n const decodePromises = decoders.map((dec) => dec\n .fromProtoObj(pubsubTopic, message)\n .then((decoded) => decoded || Promise.reject(\"Decoding failed\")));\n const decodedMessage = await Promise.any(decodePromises);\n await callback(decodedMessage);\n }\n catch (e) {\n log.error(\"Error decoding message\", e);\n }\n}\n//# sourceMappingURL=filter.js.map","import { LightPushCore } from \"@waku/core\";\nimport { ProtocolError } from \"@waku/interfaces\";\nimport { ensurePubsubTopicIsConfigured, Logger } from \"@waku/utils\";\nimport { BaseProtocolSDK } from \"./base_protocol.js\";\nconst log = new Logger(\"sdk:light-push\");\nclass LightPushSDK extends BaseProtocolSDK {\n protocol;\n constructor(connectionManager, libp2p, options) {\n super(new LightPushCore(connectionManager.configuredPubsubTopics, libp2p), connectionManager, {\n numPeersToUse: options?.numPeersToUse\n });\n this.protocol = this.core;\n }\n async send(encoder, message, _options) {\n const options = {\n autoRetry: true,\n ..._options\n };\n const successes = [];\n const failures = [];\n const { pubsubTopic } = encoder;\n try {\n ensurePubsubTopicIsConfigured(pubsubTopic, this.protocol.pubsubTopics);\n }\n catch (error) {\n log.error(\"Failed to send waku light push: pubsub topic not configured\");\n return {\n failures: [\n {\n error: ProtocolError.TOPIC_NOT_CONFIGURED\n }\n ],\n successes: []\n };\n }\n const hasPeers = await this.hasPeers(options);\n if (!hasPeers) {\n return {\n successes,\n failures: [\n {\n error: ProtocolError.NO_PEER_AVAILABLE\n }\n ]\n };\n }\n const sendPromises = this.connectedPeers.map((peer) => this.protocol.send(encoder, message, peer));\n const results = await Promise.allSettled(sendPromises);\n for (const result of results) {\n if (result.status === \"fulfilled\") {\n const { failure, success } = result.value;\n if (success) {\n successes.push(success);\n }\n if (failure) {\n if (failure.peerId) {\n try {\n await this.renewPeer(failure.peerId);\n log.info(\"Renewed peer\", failure.peerId.toString());\n }\n catch (error) {\n log.error(\"Failed to renew peer\", error);\n }\n }\n failures.push(failure);\n }\n }\n else {\n log.error(\"Failed unexpectedly while sending:\", result.reason);\n failures.push({ error: ProtocolError.GENERIC_FAIL });\n }\n }\n return {\n successes,\n failures\n };\n }\n}\nexport function wakuLightPush(connectionManager, init = {}) {\n return (libp2p) => new LightPushSDK(connectionManager, libp2p, init);\n}\n//# sourceMappingURL=light_push.js.map","import { StoreCore } from \"@waku/core\";\nimport { messageHash } from \"@waku/message-hash\";\nimport { ensurePubsubTopicIsConfigured, isDefined, Logger } from \"@waku/utils\";\nimport { BaseProtocolSDK } from \"./base_protocol.js\";\nconst DEFAULT_NUM_PEERS = 1;\nconst log = new Logger(\"waku:store:sdk\");\n/**\n * StoreSDK is an implementation of the IStoreSDK interface.\n * It provides methods to interact with the Waku Store protocol.\n */\nexport class StoreSDK extends BaseProtocolSDK {\n protocol;\n constructor(connectionManager, libp2p) {\n super(new StoreCore(connectionManager.configuredPubsubTopics, libp2p), connectionManager, {\n numPeersToUse: DEFAULT_NUM_PEERS\n });\n this.protocol = this.core;\n }\n /**\n * Queries the Waku Store for historical messages using the provided decoders and options.\n * Returns an asynchronous generator that yields promises of decoded messages.\n *\n * @param decoders - An array of message decoders.\n * @param options - Optional query parameters.\n * @returns An asynchronous generator of promises of decoded messages.\n * @throws If no peers are available to query or if an error occurs during the query.\n */\n async *queryGenerator(decoders, options) {\n const { pubsubTopic, contentTopics, decodersAsMap } = this.validateDecodersAndPubsubTopic(decoders);\n const queryOpts = {\n pubsubTopic,\n contentTopics,\n includeData: true,\n paginationForward: true,\n ...options\n };\n const peer = (await this.protocol.getPeers({\n numPeers: this.numPeersToUse,\n maxBootstrapPeers: 1\n }))[0];\n if (!peer) {\n log.error(\"No peers available to query\");\n throw new Error(\"No peers available to query\");\n }\n log.info(`Querying store with options: ${JSON.stringify(options)}`);\n const responseGenerator = this.protocol.queryPerPage(queryOpts, decodersAsMap, peer);\n for await (const messages of responseGenerator) {\n yield messages;\n }\n }\n /**\n * Queries the Waku Store for historical messages and processes them with the provided callback in order.\n *\n * @param decoders - An array of message decoders.\n * @param callback - A callback function to process each decoded message.\n * @param options - Optional query parameters.\n * @returns A promise that resolves when the query and message processing are completed.\n */\n async queryWithOrderedCallback(decoders, callback, options) {\n log.info(\"Querying store with ordered callback\");\n for await (const promises of this.queryGenerator(decoders, options)) {\n if (await this.processMessages(promises, callback))\n break;\n }\n }\n /**\n * Queries the Waku Store for historical messages and processes them with the provided callback using promises.\n *\n * @param decoders - An array of message decoders.\n * @param callback - A callback function to process each promise of a decoded message.\n * @param options - Optional query parameters.\n * @returns A promise that resolves when the query and message processing are completed.\n */\n async queryWithPromiseCallback(decoders, callback, options) {\n log.info(\"Querying store with promise callback\");\n let abort = false;\n for await (const page of this.queryGenerator(decoders, options)) {\n const _promises = page.map(async (msgPromise) => {\n if (abort)\n return;\n abort = Boolean(await callback(msgPromise));\n });\n await Promise.all(_promises);\n if (abort)\n break;\n }\n }\n /**\n * Processes messages based on the provided callback and options.\n *\n * @param messages - An array of promises of decoded messages.\n * @param callback - A callback function to process each decoded message.\n * @returns A promise that resolves to a boolean indicating whether the processing should abort.\n * @private\n */\n async processMessages(messages, callback) {\n let abort = false;\n const messagesOrUndef = await Promise.all(messages);\n const processedMessages = messagesOrUndef.filter(isDefined);\n await Promise.all(processedMessages.map(async (msg) => {\n if (msg && !abort) {\n abort = Boolean(await callback(msg));\n }\n }));\n return abort;\n }\n /**\n * Creates a cursor based on the provided decoded message.\n *\n * @param message - The decoded message.\n * @returns A StoreCursor representing the message.\n */\n createCursor(message) {\n return messageHash(message.pubsubTopic, message);\n }\n /**\n * Validates the provided decoders and pubsub topic.\n *\n * @param decoders - An array of message decoders.\n * @returns An object containing the pubsub topic, content topics, and a map of decoders.\n * @throws If no decoders are provided, if multiple pubsub topics are provided, or if no decoders are found for the pubsub topic.\n * @private\n */\n validateDecodersAndPubsubTopic(decoders) {\n if (decoders.length === 0) {\n log.error(\"No decoders provided\");\n throw new Error(\"No decoders provided\");\n }\n const uniquePubsubTopicsInQuery = Array.from(new Set(decoders.map((decoder) => decoder.pubsubTopic)));\n if (uniquePubsubTopicsInQuery.length > 1) {\n log.error(\"API does not support querying multiple pubsub topics at once\");\n throw new Error(\"API does not support querying multiple pubsub topics at once\");\n }\n const pubsubTopicForQuery = uniquePubsubTopicsInQuery[0];\n ensurePubsubTopicIsConfigured(pubsubTopicForQuery, this.protocol.pubsubTopics);\n const decodersAsMap = new Map();\n decoders.forEach((dec) => {\n if (decodersAsMap.has(dec.contentTopic)) {\n log.error(\"API does not support different decoder per content topic\");\n throw new Error(\"API does not support different decoder per content topic\");\n }\n decodersAsMap.set(dec.contentTopic, dec);\n });\n const contentTopics = decoders\n .filter((decoder) => decoder.pubsubTopic === pubsubTopicForQuery)\n .map((dec) => dec.contentTopic);\n if (contentTopics.length === 0) {\n log.error(`No decoders found for topic ${pubsubTopicForQuery}`);\n throw new Error(\"No decoders found for topic \" + pubsubTopicForQuery);\n }\n return {\n pubsubTopic: pubsubTopicForQuery,\n contentTopics,\n decodersAsMap\n };\n }\n}\n/**\n * Factory function to create an instance of the StoreSDK.\n *\n * @param init - Partial options for protocol creation.\n * @returns A function that takes a Libp2p instance and returns a StoreSDK instance.\n */\nexport function wakuStore(connectionManager) {\n return (libp2p) => {\n return new StoreSDK(connectionManager, libp2p);\n };\n}\n//# sourceMappingURL=store.js.map","import { isPeerId } from \"@libp2p/interface\";\nimport { multiaddr } from \"@multiformats/multiaddr\";\nimport { ConnectionManager, getHealthManager } from \"@waku/core\";\nimport { Protocols } from \"@waku/interfaces\";\nimport { Logger } from \"@waku/utils\";\nimport { wakuFilter } from \"./protocols/filter.js\";\nimport { wakuLightPush } from \"./protocols/light_push.js\";\nimport { wakuStore } from \"./protocols/store.js\";\nexport const DefaultPingKeepAliveValueSecs = 5 * 60;\nexport const DefaultRelayKeepAliveValueSecs = 5 * 60;\nexport const DefaultUserAgent = \"js-waku\";\nexport const DefaultPingMaxInboundStreams = 10;\nconst log = new Logger(\"waku\");\nexport class WakuNode {\n pubsubTopics;\n libp2p;\n relay;\n store;\n filter;\n lightPush;\n connectionManager;\n health;\n constructor(pubsubTopics, options, libp2p, protocolsEnabled, relay) {\n this.pubsubTopics = pubsubTopics;\n this.relay = relay;\n this.libp2p = libp2p;\n protocolsEnabled = {\n filter: false,\n lightpush: false,\n store: false,\n ...protocolsEnabled\n };\n const pingKeepAlive = options.pingKeepAlive || DefaultPingKeepAliveValueSecs;\n const relayKeepAlive = this.relay\n ? options.relayKeepAlive || DefaultRelayKeepAliveValueSecs\n : 0;\n const peerId = this.libp2p.peerId.toString();\n this.connectionManager = ConnectionManager.create(peerId, libp2p, { pingKeepAlive, relayKeepAlive }, this.pubsubTopics, this.relay);\n this.health = getHealthManager();\n if (protocolsEnabled.store) {\n const store = wakuStore(this.connectionManager);\n this.store = store(libp2p);\n }\n if (protocolsEnabled.lightpush) {\n const lightPush = wakuLightPush(this.connectionManager);\n this.lightPush = lightPush(libp2p);\n }\n if (protocolsEnabled.filter) {\n const filter = wakuFilter(this.connectionManager);\n this.filter = filter(libp2p);\n }\n log.info(\"Waku node created\", peerId, `relay: ${!!this.relay}, store: ${!!this.store}, light push: ${!!this\n .lightPush}, filter: ${!!this.filter}`);\n }\n /**\n * Dials to the provided peer.\n *\n * @param peer The peer to dial\n * @param protocols Waku protocols we expect from the peer; Defaults to mounted protocols\n */\n async dial(peer, protocols) {\n const _protocols = protocols ?? [];\n const peerId = mapToPeerIdOrMultiaddr(peer);\n if (typeof protocols === \"undefined\") {\n this.relay && _protocols.push(Protocols.Relay);\n this.store && _protocols.push(Protocols.Store);\n this.filter && _protocols.push(Protocols.Filter);\n this.lightPush && _protocols.push(Protocols.LightPush);\n }\n const codecs = [];\n if (_protocols.includes(Protocols.Relay)) {\n if (this.relay) {\n this.relay.gossipSub.multicodecs.forEach((codec) => codecs.push(codec));\n }\n else {\n log.error(\"Relay codec not included in dial codec: protocol not mounted locally\");\n }\n }\n if (_protocols.includes(Protocols.Store)) {\n if (this.store) {\n codecs.push(this.store.protocol.multicodec);\n }\n else {\n log.error(\"Store codec not included in dial codec: protocol not mounted locally\");\n }\n }\n if (_protocols.includes(Protocols.LightPush)) {\n if (this.lightPush) {\n codecs.push(this.lightPush.protocol.multicodec);\n }\n else {\n log.error(\"Light Push codec not included in dial codec: protocol not mounted locally\");\n }\n }\n if (_protocols.includes(Protocols.Filter)) {\n if (this.filter) {\n codecs.push(this.filter.protocol.multicodec);\n }\n else {\n log.error(\"Filter codec not included in dial codec: protocol not mounted locally\");\n }\n }\n log.info(`Dialing to ${peerId.toString()} with protocols ${_protocols}`);\n return this.libp2p.dialProtocol(peerId, codecs);\n }\n async start() {\n await this.libp2p.start();\n }\n async stop() {\n this.connectionManager.stop();\n await this.libp2p.stop();\n }\n isStarted() {\n return this.libp2p.status == \"started\";\n }\n isConnected() {\n return this.connectionManager.isConnected();\n }\n /**\n * Return the local multiaddr with peer id on which libp2p is listening.\n *\n * @throws if libp2p is not listening on localhost.\n */\n getLocalMultiaddrWithID() {\n const localMultiaddr = this.libp2p\n .getMultiaddrs()\n .find((addr) => addr.toString().match(/127\\.0\\.0\\.1/));\n if (!localMultiaddr || localMultiaddr.toString() === \"\") {\n throw \"Not listening on localhost\";\n }\n return localMultiaddr + \"/p2p/\" + this.libp2p.peerId.toString();\n }\n}\nfunction mapToPeerIdOrMultiaddr(peerId) {\n return isPeerId(peerId) ? peerId : multiaddr(peerId);\n}\n//# sourceMappingURL=waku.js.map","import { concat as uint8ArrayConcat } from 'uint8arrays/concat';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nexport function base64urlToBuffer(str, len) {\n let buf = uint8ArrayFromString(str, 'base64urlpad');\n if (len != null) {\n if (buf.length > len)\n throw new Error('byte array longer than desired length');\n buf = uint8ArrayConcat([new Uint8Array(len - buf.length), buf]);\n }\n return buf;\n}\nexport function isPromise(thing) {\n if (thing == null) {\n return false;\n }\n return typeof thing.then === 'function' &&\n typeof thing.catch === 'function' &&\n typeof thing.finally === 'function';\n}\n//# sourceMappingURL=util.js.map","const U32_MASK64 = /* @__PURE__ */ BigInt(2 ** 32 - 1);\nconst _32n = /* @__PURE__ */ BigInt(32);\n// We are not using BigUint64Array, because they are extremely slow as per 2022\nfunction fromBig(n, le = false) {\n if (le)\n return { h: Number(n & U32_MASK64), l: Number((n >> _32n) & U32_MASK64) };\n return { h: Number((n >> _32n) & U32_MASK64) | 0, l: Number(n & U32_MASK64) | 0 };\n}\nfunction split(lst, le = false) {\n let Ah = new Uint32Array(lst.length);\n let Al = new Uint32Array(lst.length);\n for (let i = 0; i < lst.length; i++) {\n const { h, l } = fromBig(lst[i], le);\n [Ah[i], Al[i]] = [h, l];\n }\n return [Ah, Al];\n}\nconst toBig = (h, l) => (BigInt(h >>> 0) << _32n) | BigInt(l >>> 0);\n// for Shift in [0, 32)\nconst shrSH = (h, _l, s) => h >>> s;\nconst shrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in [1, 32)\nconst rotrSH = (h, l, s) => (h >>> s) | (l << (32 - s));\nconst rotrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotrBH = (h, l, s) => (h << (64 - s)) | (l >>> (s - 32));\nconst rotrBL = (h, l, s) => (h >>> (s - 32)) | (l << (64 - s));\n// Right rotate for shift===32 (just swaps l&h)\nconst rotr32H = (_h, l) => l;\nconst rotr32L = (h, _l) => h;\n// Left rotate for Shift in [1, 32)\nconst rotlSH = (h, l, s) => (h << s) | (l >>> (32 - s));\nconst rotlSL = (h, l, s) => (l << s) | (h >>> (32 - s));\n// Left rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotlBH = (h, l, s) => (l << (s - 32)) | (h >>> (64 - s));\nconst rotlBL = (h, l, s) => (h << (s - 32)) | (l >>> (64 - s));\n// JS uses 32-bit signed integers for bitwise operations which means we cannot\n// simple take carry out of low bit sum by shift, we need to use division.\nfunction add(Ah, Al, Bh, Bl) {\n const l = (Al >>> 0) + (Bl >>> 0);\n return { h: (Ah + Bh + ((l / 2 ** 32) | 0)) | 0, l: l | 0 };\n}\n// Addition with more than 2 elements\nconst add3L = (Al, Bl, Cl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);\nconst add3H = (low, Ah, Bh, Ch) => (Ah + Bh + Ch + ((low / 2 ** 32) | 0)) | 0;\nconst add4L = (Al, Bl, Cl, Dl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);\nconst add4H = (low, Ah, Bh, Ch, Dh) => (Ah + Bh + Ch + Dh + ((low / 2 ** 32) | 0)) | 0;\nconst add5L = (Al, Bl, Cl, Dl, El) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);\nconst add5H = (low, Ah, Bh, Ch, Dh, Eh) => (Ah + Bh + Ch + Dh + Eh + ((low / 2 ** 32) | 0)) | 0;\n// prettier-ignore\nexport { fromBig, split, toBig, shrSH, shrSL, rotrSH, rotrSL, rotrBH, rotrBL, rotr32H, rotr32L, rotlSH, rotlSL, rotlBH, rotlBL, add, add3L, add3H, add4L, add4H, add5H, add5L, };\n// prettier-ignore\nconst u64 = {\n fromBig, split, toBig,\n shrSH, shrSL,\n rotrSH, rotrSL, rotrBH, rotrBL,\n rotr32H, rotr32L,\n rotlSH, rotlSL, rotlBH, rotlBL,\n add, add3L, add3H, add4L, add4H, add5H, add5L,\n};\nexport default u64;\n//# sourceMappingURL=_u64.js.map","import { HashMD } from './_md.js';\nimport u64 from './_u64.js';\nimport { wrapConstructor } from './utils.js';\n// Round contants (first 32 bits of the fractional parts of the cube roots of the first 80 primes 2..409):\n// prettier-ignore\nconst [SHA512_Kh, SHA512_Kl] = /* @__PURE__ */ (() => u64.split([\n '0x428a2f98d728ae22', '0x7137449123ef65cd', '0xb5c0fbcfec4d3b2f', '0xe9b5dba58189dbbc',\n '0x3956c25bf348b538', '0x59f111f1b605d019', '0x923f82a4af194f9b', '0xab1c5ed5da6d8118',\n '0xd807aa98a3030242', '0x12835b0145706fbe', '0x243185be4ee4b28c', '0x550c7dc3d5ffb4e2',\n '0x72be5d74f27b896f', '0x80deb1fe3b1696b1', '0x9bdc06a725c71235', '0xc19bf174cf692694',\n '0xe49b69c19ef14ad2', '0xefbe4786384f25e3', '0x0fc19dc68b8cd5b5', '0x240ca1cc77ac9c65',\n '0x2de92c6f592b0275', '0x4a7484aa6ea6e483', '0x5cb0a9dcbd41fbd4', '0x76f988da831153b5',\n '0x983e5152ee66dfab', '0xa831c66d2db43210', '0xb00327c898fb213f', '0xbf597fc7beef0ee4',\n '0xc6e00bf33da88fc2', '0xd5a79147930aa725', '0x06ca6351e003826f', '0x142929670a0e6e70',\n '0x27b70a8546d22ffc', '0x2e1b21385c26c926', '0x4d2c6dfc5ac42aed', '0x53380d139d95b3df',\n '0x650a73548baf63de', '0x766a0abb3c77b2a8', '0x81c2c92e47edaee6', '0x92722c851482353b',\n '0xa2bfe8a14cf10364', '0xa81a664bbc423001', '0xc24b8b70d0f89791', '0xc76c51a30654be30',\n '0xd192e819d6ef5218', '0xd69906245565a910', '0xf40e35855771202a', '0x106aa07032bbd1b8',\n '0x19a4c116b8d2d0c8', '0x1e376c085141ab53', '0x2748774cdf8eeb99', '0x34b0bcb5e19b48a8',\n '0x391c0cb3c5c95a63', '0x4ed8aa4ae3418acb', '0x5b9cca4f7763e373', '0x682e6ff3d6b2b8a3',\n '0x748f82ee5defb2fc', '0x78a5636f43172f60', '0x84c87814a1f0ab72', '0x8cc702081a6439ec',\n '0x90befffa23631e28', '0xa4506cebde82bde9', '0xbef9a3f7b2c67915', '0xc67178f2e372532b',\n '0xca273eceea26619c', '0xd186b8c721c0c207', '0xeada7dd6cde0eb1e', '0xf57d4f7fee6ed178',\n '0x06f067aa72176fba', '0x0a637dc5a2c898a6', '0x113f9804bef90dae', '0x1b710b35131c471b',\n '0x28db77f523047d84', '0x32caab7b40c72493', '0x3c9ebe0a15c9bebc', '0x431d67c49c100d4c',\n '0x4cc5d4becb3e42b6', '0x597f299cfc657e2a', '0x5fcb6fab3ad6faec', '0x6c44198c4a475817'\n].map(n => BigInt(n))))();\n// Temporary buffer, not used to store anything between runs\nconst SHA512_W_H = /* @__PURE__ */ new Uint32Array(80);\nconst SHA512_W_L = /* @__PURE__ */ new Uint32Array(80);\nexport class SHA512 extends HashMD {\n constructor() {\n super(128, 64, 16, false);\n // We cannot use array here since array allows indexing by variable which means optimizer/compiler cannot use registers.\n // Also looks cleaner and easier to verify with spec.\n // Initial state (first 32 bits of the fractional parts of the square roots of the first 8 primes 2..19):\n // h -- high 32 bits, l -- low 32 bits\n this.Ah = 0x6a09e667 | 0;\n this.Al = 0xf3bcc908 | 0;\n this.Bh = 0xbb67ae85 | 0;\n this.Bl = 0x84caa73b | 0;\n this.Ch = 0x3c6ef372 | 0;\n this.Cl = 0xfe94f82b | 0;\n this.Dh = 0xa54ff53a | 0;\n this.Dl = 0x5f1d36f1 | 0;\n this.Eh = 0x510e527f | 0;\n this.El = 0xade682d1 | 0;\n this.Fh = 0x9b05688c | 0;\n this.Fl = 0x2b3e6c1f | 0;\n this.Gh = 0x1f83d9ab | 0;\n this.Gl = 0xfb41bd6b | 0;\n this.Hh = 0x5be0cd19 | 0;\n this.Hl = 0x137e2179 | 0;\n }\n // prettier-ignore\n get() {\n const { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n return [Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl];\n }\n // prettier-ignore\n set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl) {\n this.Ah = Ah | 0;\n this.Al = Al | 0;\n this.Bh = Bh | 0;\n this.Bl = Bl | 0;\n this.Ch = Ch | 0;\n this.Cl = Cl | 0;\n this.Dh = Dh | 0;\n this.Dl = Dl | 0;\n this.Eh = Eh | 0;\n this.El = El | 0;\n this.Fh = Fh | 0;\n this.Fl = Fl | 0;\n this.Gh = Gh | 0;\n this.Gl = Gl | 0;\n this.Hh = Hh | 0;\n this.Hl = Hl | 0;\n }\n process(view, offset) {\n // Extend the first 16 words into the remaining 64 words w[16..79] of the message schedule array\n for (let i = 0; i < 16; i++, offset += 4) {\n SHA512_W_H[i] = view.getUint32(offset);\n SHA512_W_L[i] = view.getUint32((offset += 4));\n }\n for (let i = 16; i < 80; i++) {\n // s0 := (w[i-15] rightrotate 1) xor (w[i-15] rightrotate 8) xor (w[i-15] rightshift 7)\n const W15h = SHA512_W_H[i - 15] | 0;\n const W15l = SHA512_W_L[i - 15] | 0;\n const s0h = u64.rotrSH(W15h, W15l, 1) ^ u64.rotrSH(W15h, W15l, 8) ^ u64.shrSH(W15h, W15l, 7);\n const s0l = u64.rotrSL(W15h, W15l, 1) ^ u64.rotrSL(W15h, W15l, 8) ^ u64.shrSL(W15h, W15l, 7);\n // s1 := (w[i-2] rightrotate 19) xor (w[i-2] rightrotate 61) xor (w[i-2] rightshift 6)\n const W2h = SHA512_W_H[i - 2] | 0;\n const W2l = SHA512_W_L[i - 2] | 0;\n const s1h = u64.rotrSH(W2h, W2l, 19) ^ u64.rotrBH(W2h, W2l, 61) ^ u64.shrSH(W2h, W2l, 6);\n const s1l = u64.rotrSL(W2h, W2l, 19) ^ u64.rotrBL(W2h, W2l, 61) ^ u64.shrSL(W2h, W2l, 6);\n // SHA256_W[i] = s0 + s1 + SHA256_W[i - 7] + SHA256_W[i - 16];\n const SUMl = u64.add4L(s0l, s1l, SHA512_W_L[i - 7], SHA512_W_L[i - 16]);\n const SUMh = u64.add4H(SUMl, s0h, s1h, SHA512_W_H[i - 7], SHA512_W_H[i - 16]);\n SHA512_W_H[i] = SUMh | 0;\n SHA512_W_L[i] = SUMl | 0;\n }\n let { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n // Compression function main loop, 80 rounds\n for (let i = 0; i < 80; i++) {\n // S1 := (e rightrotate 14) xor (e rightrotate 18) xor (e rightrotate 41)\n const sigma1h = u64.rotrSH(Eh, El, 14) ^ u64.rotrSH(Eh, El, 18) ^ u64.rotrBH(Eh, El, 41);\n const sigma1l = u64.rotrSL(Eh, El, 14) ^ u64.rotrSL(Eh, El, 18) ^ u64.rotrBL(Eh, El, 41);\n //const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;\n const CHIh = (Eh & Fh) ^ (~Eh & Gh);\n const CHIl = (El & Fl) ^ (~El & Gl);\n // T1 = H + sigma1 + Chi(E, F, G) + SHA512_K[i] + SHA512_W[i]\n // prettier-ignore\n const T1ll = u64.add5L(Hl, sigma1l, CHIl, SHA512_Kl[i], SHA512_W_L[i]);\n const T1h = u64.add5H(T1ll, Hh, sigma1h, CHIh, SHA512_Kh[i], SHA512_W_H[i]);\n const T1l = T1ll | 0;\n // S0 := (a rightrotate 28) xor (a rightrotate 34) xor (a rightrotate 39)\n const sigma0h = u64.rotrSH(Ah, Al, 28) ^ u64.rotrBH(Ah, Al, 34) ^ u64.rotrBH(Ah, Al, 39);\n const sigma0l = u64.rotrSL(Ah, Al, 28) ^ u64.rotrBL(Ah, Al, 34) ^ u64.rotrBL(Ah, Al, 39);\n const MAJh = (Ah & Bh) ^ (Ah & Ch) ^ (Bh & Ch);\n const MAJl = (Al & Bl) ^ (Al & Cl) ^ (Bl & Cl);\n Hh = Gh | 0;\n Hl = Gl | 0;\n Gh = Fh | 0;\n Gl = Fl | 0;\n Fh = Eh | 0;\n Fl = El | 0;\n ({ h: Eh, l: El } = u64.add(Dh | 0, Dl | 0, T1h | 0, T1l | 0));\n Dh = Ch | 0;\n Dl = Cl | 0;\n Ch = Bh | 0;\n Cl = Bl | 0;\n Bh = Ah | 0;\n Bl = Al | 0;\n const All = u64.add3L(T1l, sigma0l, MAJl);\n Ah = u64.add3H(All, T1h, sigma0h, MAJh);\n Al = All | 0;\n }\n // Add the compressed chunk to the current hash value\n ({ h: Ah, l: Al } = u64.add(this.Ah | 0, this.Al | 0, Ah | 0, Al | 0));\n ({ h: Bh, l: Bl } = u64.add(this.Bh | 0, this.Bl | 0, Bh | 0, Bl | 0));\n ({ h: Ch, l: Cl } = u64.add(this.Ch | 0, this.Cl | 0, Ch | 0, Cl | 0));\n ({ h: Dh, l: Dl } = u64.add(this.Dh | 0, this.Dl | 0, Dh | 0, Dl | 0));\n ({ h: Eh, l: El } = u64.add(this.Eh | 0, this.El | 0, Eh | 0, El | 0));\n ({ h: Fh, l: Fl } = u64.add(this.Fh | 0, this.Fl | 0, Fh | 0, Fl | 0));\n ({ h: Gh, l: Gl } = u64.add(this.Gh | 0, this.Gl | 0, Gh | 0, Gl | 0));\n ({ h: Hh, l: Hl } = u64.add(this.Hh | 0, this.Hl | 0, Hh | 0, Hl | 0));\n this.set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl);\n }\n roundClean() {\n SHA512_W_H.fill(0);\n SHA512_W_L.fill(0);\n }\n destroy() {\n this.buffer.fill(0);\n this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);\n }\n}\nclass SHA512_224 extends SHA512 {\n constructor() {\n super();\n // h -- high 32 bits, l -- low 32 bits\n this.Ah = 0x8c3d37c8 | 0;\n this.Al = 0x19544da2 | 0;\n this.Bh = 0x73e19966 | 0;\n this.Bl = 0x89dcd4d6 | 0;\n this.Ch = 0x1dfab7ae | 0;\n this.Cl = 0x32ff9c82 | 0;\n this.Dh = 0x679dd514 | 0;\n this.Dl = 0x582f9fcf | 0;\n this.Eh = 0x0f6d2b69 | 0;\n this.El = 0x7bd44da8 | 0;\n this.Fh = 0x77e36f73 | 0;\n this.Fl = 0x04c48942 | 0;\n this.Gh = 0x3f9d85a8 | 0;\n this.Gl = 0x6a1d36c8 | 0;\n this.Hh = 0x1112e6ad | 0;\n this.Hl = 0x91d692a1 | 0;\n this.outputLen = 28;\n }\n}\nclass SHA512_256 extends SHA512 {\n constructor() {\n super();\n // h -- high 32 bits, l -- low 32 bits\n this.Ah = 0x22312194 | 0;\n this.Al = 0xfc2bf72c | 0;\n this.Bh = 0x9f555fa3 | 0;\n this.Bl = 0xc84c64c2 | 0;\n this.Ch = 0x2393b86b | 0;\n this.Cl = 0x6f53b151 | 0;\n this.Dh = 0x96387719 | 0;\n this.Dl = 0x5940eabd | 0;\n this.Eh = 0x96283ee2 | 0;\n this.El = 0xa88effe3 | 0;\n this.Fh = 0xbe5e1e25 | 0;\n this.Fl = 0x53863992 | 0;\n this.Gh = 0x2b0199fc | 0;\n this.Gl = 0x2c85b8aa | 0;\n this.Hh = 0x0eb72ddc | 0;\n this.Hl = 0x81c52ca2 | 0;\n this.outputLen = 32;\n }\n}\nclass SHA384 extends SHA512 {\n constructor() {\n super();\n // h -- high 32 bits, l -- low 32 bits\n this.Ah = 0xcbbb9d5d | 0;\n this.Al = 0xc1059ed8 | 0;\n this.Bh = 0x629a292a | 0;\n this.Bl = 0x367cd507 | 0;\n this.Ch = 0x9159015a | 0;\n this.Cl = 0x3070dd17 | 0;\n this.Dh = 0x152fecd8 | 0;\n this.Dl = 0xf70e5939 | 0;\n this.Eh = 0x67332667 | 0;\n this.El = 0xffc00b31 | 0;\n this.Fh = 0x8eb44a87 | 0;\n this.Fl = 0x68581511 | 0;\n this.Gh = 0xdb0c2e0d | 0;\n this.Gl = 0x64f98fa7 | 0;\n this.Hh = 0x47b5481d | 0;\n this.Hl = 0xbefa4fa4 | 0;\n this.outputLen = 48;\n }\n}\nexport const sha512 = /* @__PURE__ */ wrapConstructor(() => new SHA512());\nexport const sha512_224 = /* @__PURE__ */ wrapConstructor(() => new SHA512_224());\nexport const sha512_256 = /* @__PURE__ */ wrapConstructor(() => new SHA512_256());\nexport const sha384 = /* @__PURE__ */ wrapConstructor(() => new SHA384());\n//# sourceMappingURL=sha512.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// 100 lines of code in the file are duplicated from noble-hashes (utils).\n// This is OK: `abstract` directory does not use noble-hashes.\n// User may opt-in into using different hashing library. This way, noble-hashes\n// won't be included into their bundle.\nconst _0n = /* @__PURE__ */ BigInt(0);\nconst _1n = /* @__PURE__ */ BigInt(1);\nconst _2n = /* @__PURE__ */ BigInt(2);\nexport function isBytes(a) {\n return (a instanceof Uint8Array ||\n (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array'));\n}\nexport function abytes(item) {\n if (!isBytes(item))\n throw new Error('Uint8Array expected');\n}\nexport function abool(title, value) {\n if (typeof value !== 'boolean')\n throw new Error(`${title} must be valid boolean, got \"${value}\".`);\n}\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'));\n/**\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes) {\n abytes(bytes);\n // pre-caching improves the speed 6x\n let hex = '';\n for (let i = 0; i < bytes.length; i++) {\n hex += hexes[bytes[i]];\n }\n return hex;\n}\nexport function numberToHexUnpadded(num) {\n const hex = num.toString(16);\n return hex.length & 1 ? `0${hex}` : hex;\n}\nexport function hexToNumber(hex) {\n if (typeof hex !== 'string')\n throw new Error('hex string expected, got ' + typeof hex);\n // Big Endian\n return BigInt(hex === '' ? '0' : `0x${hex}`);\n}\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, _A: 65, _F: 70, _a: 97, _f: 102 };\nfunction asciiToBase16(char) {\n if (char >= asciis._0 && char <= asciis._9)\n return char - asciis._0;\n if (char >= asciis._A && char <= asciis._F)\n return char - (asciis._A - 10);\n if (char >= asciis._a && char <= asciis._f)\n return char - (asciis._a - 10);\n return;\n}\n/**\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex) {\n if (typeof hex !== 'string')\n throw new Error('hex string expected, got ' + typeof hex);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2)\n throw new Error('padded hex string expected, got unpadded hex of length ' + hl);\n const array = new Uint8Array(al);\n for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n const n1 = asciiToBase16(hex.charCodeAt(hi));\n const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n if (n1 === undefined || n2 === undefined) {\n const char = hex[hi] + hex[hi + 1];\n throw new Error('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n }\n array[ai] = n1 * 16 + n2;\n }\n return array;\n}\n// BE: Big Endian, LE: Little Endian\nexport function bytesToNumberBE(bytes) {\n return hexToNumber(bytesToHex(bytes));\n}\nexport function bytesToNumberLE(bytes) {\n abytes(bytes);\n return hexToNumber(bytesToHex(Uint8Array.from(bytes).reverse()));\n}\nexport function numberToBytesBE(n, len) {\n return hexToBytes(n.toString(16).padStart(len * 2, '0'));\n}\nexport function numberToBytesLE(n, len) {\n return numberToBytesBE(n, len).reverse();\n}\n// Unpadded, rarely used\nexport function numberToVarBytesBE(n) {\n return hexToBytes(numberToHexUnpadded(n));\n}\n/**\n * Takes hex string or Uint8Array, converts to Uint8Array.\n * Validates output length.\n * Will throw error for other types.\n * @param title descriptive title for an error e.g. 'private key'\n * @param hex hex string or Uint8Array\n * @param expectedLength optional, will compare to result array's length\n * @returns\n */\nexport function ensureBytes(title, hex, expectedLength) {\n let res;\n if (typeof hex === 'string') {\n try {\n res = hexToBytes(hex);\n }\n catch (e) {\n throw new Error(`${title} must be valid hex string, got \"${hex}\". Cause: ${e}`);\n }\n }\n else if (isBytes(hex)) {\n // Uint8Array.from() instead of hash.slice() because node.js Buffer\n // is instance of Uint8Array, and its slice() creates **mutable** copy\n res = Uint8Array.from(hex);\n }\n else {\n throw new Error(`${title} must be hex string or Uint8Array`);\n }\n const len = res.length;\n if (typeof expectedLength === 'number' && len !== expectedLength)\n throw new Error(`${title} expected ${expectedLength} bytes, got ${len}`);\n return res;\n}\n/**\n * Copies several Uint8Arrays into one.\n */\nexport function concatBytes(...arrays) {\n let sum = 0;\n for (let i = 0; i < arrays.length; i++) {\n const a = arrays[i];\n abytes(a);\n sum += a.length;\n }\n const res = new Uint8Array(sum);\n for (let i = 0, pad = 0; i < arrays.length; i++) {\n const a = arrays[i];\n res.set(a, pad);\n pad += a.length;\n }\n return res;\n}\n// Compares 2 u8a-s in kinda constant time\nexport function equalBytes(a, b) {\n if (a.length !== b.length)\n return false;\n let diff = 0;\n for (let i = 0; i < a.length; i++)\n diff |= a[i] ^ b[i];\n return diff === 0;\n}\n/**\n * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nexport function utf8ToBytes(str) {\n if (typeof str !== 'string')\n throw new Error(`utf8ToBytes expected string, got ${typeof str}`);\n return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n// Is positive bigint\nconst isPosBig = (n) => typeof n === 'bigint' && _0n <= n;\nexport function inRange(n, min, max) {\n return isPosBig(n) && isPosBig(min) && isPosBig(max) && min <= n && n < max;\n}\n/**\n * Asserts min <= n < max. NOTE: It's < max and not <= max.\n * @example\n * aInRange('x', x, 1n, 256n); // would assume x is in (1n..255n)\n */\nexport function aInRange(title, n, min, max) {\n // Why min <= n < max and not a (min < n < max) OR b (min <= n <= max)?\n // consider P=256n, min=0n, max=P\n // - a for min=0 would require -1: `inRange('x', x, -1n, P)`\n // - b would commonly require subtraction: `inRange('x', x, 0n, P - 1n)`\n // - our way is the cleanest: `inRange('x', x, 0n, P)\n if (!inRange(n, min, max))\n throw new Error(`expected valid ${title}: ${min} <= n < ${max}, got ${typeof n} ${n}`);\n}\n// Bit operations\n/**\n * Calculates amount of bits in a bigint.\n * Same as `n.toString(2).length`\n */\nexport function bitLen(n) {\n let len;\n for (len = 0; n > _0n; n >>= _1n, len += 1)\n ;\n return len;\n}\n/**\n * Gets single bit at position.\n * NOTE: first bit position is 0 (same as arrays)\n * Same as `!!+Array.from(n.toString(2)).reverse()[pos]`\n */\nexport function bitGet(n, pos) {\n return (n >> BigInt(pos)) & _1n;\n}\n/**\n * Sets single bit at position.\n */\nexport function bitSet(n, pos, value) {\n return n | ((value ? _1n : _0n) << BigInt(pos));\n}\n/**\n * Calculate mask for N bits. Not using ** operator with bigints because of old engines.\n * Same as BigInt(`0b${Array(i).fill('1').join('')}`)\n */\nexport const bitMask = (n) => (_2n << BigInt(n - 1)) - _1n;\n// DRBG\nconst u8n = (data) => new Uint8Array(data); // creates Uint8Array\nconst u8fr = (arr) => Uint8Array.from(arr); // another shortcut\n/**\n * Minimal HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n * @returns function that will call DRBG until 2nd arg returns something meaningful\n * @example\n * const drbg = createHmacDRBG(32, 32, hmac);\n * drbg(seed, bytesToKey); // bytesToKey must return Key or undefined\n */\nexport function createHmacDrbg(hashLen, qByteLen, hmacFn) {\n if (typeof hashLen !== 'number' || hashLen < 2)\n throw new Error('hashLen must be a number');\n if (typeof qByteLen !== 'number' || qByteLen < 2)\n throw new Error('qByteLen must be a number');\n if (typeof hmacFn !== 'function')\n throw new Error('hmacFn must be a function');\n // Step B, Step C: set hashLen to 8*ceil(hlen/8)\n let v = u8n(hashLen); // Minimal non-full-spec HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n let k = u8n(hashLen); // Steps B and C of RFC6979 3.2: set hashLen, in our case always same\n let i = 0; // Iterations counter, will throw when over 1000\n const reset = () => {\n v.fill(1);\n k.fill(0);\n i = 0;\n };\n const h = (...b) => hmacFn(k, v, ...b); // hmac(k)(v, ...values)\n const reseed = (seed = u8n()) => {\n // HMAC-DRBG reseed() function. Steps D-G\n k = h(u8fr([0x00]), seed); // k = hmac(k || v || 0x00 || seed)\n v = h(); // v = hmac(k || v)\n if (seed.length === 0)\n return;\n k = h(u8fr([0x01]), seed); // k = hmac(k || v || 0x01 || seed)\n v = h(); // v = hmac(k || v)\n };\n const gen = () => {\n // HMAC-DRBG generate() function\n if (i++ >= 1000)\n throw new Error('drbg: tried 1000 values');\n let len = 0;\n const out = [];\n while (len < qByteLen) {\n v = h();\n const sl = v.slice();\n out.push(sl);\n len += v.length;\n }\n return concatBytes(...out);\n };\n const genUntil = (seed, pred) => {\n reset();\n reseed(seed); // Steps D-G\n let res = undefined; // Step H: grind until k is in [1..n-1]\n while (!(res = pred(gen())))\n reseed();\n reset();\n return res;\n };\n return genUntil;\n}\n// Validating curves and fields\nconst validatorFns = {\n bigint: (val) => typeof val === 'bigint',\n function: (val) => typeof val === 'function',\n boolean: (val) => typeof val === 'boolean',\n string: (val) => typeof val === 'string',\n stringOrUint8Array: (val) => typeof val === 'string' || isBytes(val),\n isSafeInteger: (val) => Number.isSafeInteger(val),\n array: (val) => Array.isArray(val),\n field: (val, object) => object.Fp.isValid(val),\n hash: (val) => typeof val === 'function' && Number.isSafeInteger(val.outputLen),\n};\n// type Record = { [P in K]: T; }\nexport function validateObject(object, validators, optValidators = {}) {\n const checkField = (fieldName, type, isOptional) => {\n const checkVal = validatorFns[type];\n if (typeof checkVal !== 'function')\n throw new Error(`Invalid validator \"${type}\", expected function`);\n const val = object[fieldName];\n if (isOptional && val === undefined)\n return;\n if (!checkVal(val, object)) {\n throw new Error(`Invalid param ${String(fieldName)}=${val} (${typeof val}), expected ${type}`);\n }\n };\n for (const [fieldName, type] of Object.entries(validators))\n checkField(fieldName, type, false);\n for (const [fieldName, type] of Object.entries(optValidators))\n checkField(fieldName, type, true);\n return object;\n}\n// validate type tests\n// const o: { a: number; b: number; c: number } = { a: 1, b: 5, c: 6 };\n// const z0 = validateObject(o, { a: 'isSafeInteger' }, { c: 'bigint' }); // Ok!\n// // Should fail type-check\n// const z1 = validateObject(o, { a: 'tmp' }, { c: 'zz' });\n// const z2 = validateObject(o, { a: 'isSafeInteger' }, { c: 'zz' });\n// const z3 = validateObject(o, { test: 'boolean', z: 'bug' });\n// const z4 = validateObject(o, { a: 'boolean', z: 'bug' });\n/**\n * throws not implemented error\n */\nexport const notImplemented = () => {\n throw new Error('not implemented');\n};\n/**\n * Memoizes (caches) computation result.\n * Uses WeakMap: the value is going auto-cleaned by GC after last reference is removed.\n */\nexport function memoized(fn) {\n const map = new WeakMap();\n return (arg, ...args) => {\n const val = map.get(arg);\n if (val !== undefined)\n return val;\n const computed = fn(arg, ...args);\n map.set(arg, computed);\n return computed;\n };\n}\n//# sourceMappingURL=utils.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Utilities for modular arithmetics and finite fields\nimport { bitMask, bytesToNumberBE, bytesToNumberLE, ensureBytes, numberToBytesBE, numberToBytesLE, validateObject, } from './utils.js';\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = BigInt(2), _3n = BigInt(3);\n// prettier-ignore\nconst _4n = BigInt(4), _5n = BigInt(5), _8n = BigInt(8);\n// prettier-ignore\nconst _9n = BigInt(9), _16n = BigInt(16);\n// Calculates a modulo b\nexport function mod(a, b) {\n const result = a % b;\n return result >= _0n ? result : b + result;\n}\n/**\n * Efficiently raise num to power and do modular division.\n * Unsafe in some contexts: uses ladder, so can expose bigint bits.\n * @example\n * pow(2n, 6n, 11n) // 64n % 11n == 9n\n */\n// TODO: use field version && remove\nexport function pow(num, power, modulo) {\n if (modulo <= _0n || power < _0n)\n throw new Error('Expected power/modulo > 0');\n if (modulo === _1n)\n return _0n;\n let res = _1n;\n while (power > _0n) {\n if (power & _1n)\n res = (res * num) % modulo;\n num = (num * num) % modulo;\n power >>= _1n;\n }\n return res;\n}\n// Does x ^ (2 ^ power) mod p. pow2(30, 4) == 30 ^ (2 ^ 4)\nexport function pow2(x, power, modulo) {\n let res = x;\n while (power-- > _0n) {\n res *= res;\n res %= modulo;\n }\n return res;\n}\n// Inverses number over modulo\nexport function invert(number, modulo) {\n if (number === _0n || modulo <= _0n) {\n throw new Error(`invert: expected positive integers, got n=${number} mod=${modulo}`);\n }\n // Euclidean GCD https://brilliant.org/wiki/extended-euclidean-algorithm/\n // Fermat's little theorem \"CT-like\" version inv(n) = n^(m-2) mod m is 30x slower.\n let a = mod(number, modulo);\n let b = modulo;\n // prettier-ignore\n let x = _0n, y = _1n, u = _1n, v = _0n;\n while (a !== _0n) {\n // JIT applies optimization if those two lines follow each other\n const q = b / a;\n const r = b % a;\n const m = x - u * q;\n const n = y - v * q;\n // prettier-ignore\n b = a, a = r, x = u, y = v, u = m, v = n;\n }\n const gcd = b;\n if (gcd !== _1n)\n throw new Error('invert: does not exist');\n return mod(x, modulo);\n}\n/**\n * Tonelli-Shanks square root search algorithm.\n * 1. https://eprint.iacr.org/2012/685.pdf (page 12)\n * 2. Square Roots from 1; 24, 51, 10 to Dan Shanks\n * Will start an infinite loop if field order P is not prime.\n * @param P field order\n * @returns function that takes field Fp (created from P) and number n\n */\nexport function tonelliShanks(P) {\n // Legendre constant: used to calculate Legendre symbol (a | p),\n // which denotes the value of a^((p-1)/2) (mod p).\n // (a | p) ≡ 1 if a is a square (mod p)\n // (a | p) ≡ -1 if a is not a square (mod p)\n // (a | p) ≡ 0 if a ≡ 0 (mod p)\n const legendreC = (P - _1n) / _2n;\n let Q, S, Z;\n // Step 1: By factoring out powers of 2 from p - 1,\n // find q and s such that p - 1 = q*(2^s) with q odd\n for (Q = P - _1n, S = 0; Q % _2n === _0n; Q /= _2n, S++)\n ;\n // Step 2: Select a non-square z such that (z | p) ≡ -1 and set c ≡ zq\n for (Z = _2n; Z < P && pow(Z, legendreC, P) !== P - _1n; Z++)\n ;\n // Fast-path\n if (S === 1) {\n const p1div4 = (P + _1n) / _4n;\n return function tonelliFast(Fp, n) {\n const root = Fp.pow(n, p1div4);\n if (!Fp.eql(Fp.sqr(root), n))\n throw new Error('Cannot find square root');\n return root;\n };\n }\n // Slow-path\n const Q1div2 = (Q + _1n) / _2n;\n return function tonelliSlow(Fp, n) {\n // Step 0: Check that n is indeed a square: (n | p) should not be ≡ -1\n if (Fp.pow(n, legendreC) === Fp.neg(Fp.ONE))\n throw new Error('Cannot find square root');\n let r = S;\n // TODO: will fail at Fp2/etc\n let g = Fp.pow(Fp.mul(Fp.ONE, Z), Q); // will update both x and b\n let x = Fp.pow(n, Q1div2); // first guess at the square root\n let b = Fp.pow(n, Q); // first guess at the fudge factor\n while (!Fp.eql(b, Fp.ONE)) {\n if (Fp.eql(b, Fp.ZERO))\n return Fp.ZERO; // https://en.wikipedia.org/wiki/Tonelli%E2%80%93Shanks_algorithm (4. If t = 0, return r = 0)\n // Find m such b^(2^m)==1\n let m = 1;\n for (let t2 = Fp.sqr(b); m < r; m++) {\n if (Fp.eql(t2, Fp.ONE))\n break;\n t2 = Fp.sqr(t2); // t2 *= t2\n }\n // NOTE: r-m-1 can be bigger than 32, need to convert to bigint before shift, otherwise there will be overflow\n const ge = Fp.pow(g, _1n << BigInt(r - m - 1)); // ge = 2^(r-m-1)\n g = Fp.sqr(ge); // g = ge * ge\n x = Fp.mul(x, ge); // x *= ge\n b = Fp.mul(b, g); // b *= g\n r = m;\n }\n return x;\n };\n}\nexport function FpSqrt(P) {\n // NOTE: different algorithms can give different roots, it is up to user to decide which one they want.\n // For example there is FpSqrtOdd/FpSqrtEven to choice root based on oddness (used for hash-to-curve).\n // P ≡ 3 (mod 4)\n // √n = n^((P+1)/4)\n if (P % _4n === _3n) {\n // Not all roots possible!\n // const ORDER =\n // 0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaabn;\n // const NUM = 72057594037927816n;\n const p1div4 = (P + _1n) / _4n;\n return function sqrt3mod4(Fp, n) {\n const root = Fp.pow(n, p1div4);\n // Throw if root**2 != n\n if (!Fp.eql(Fp.sqr(root), n))\n throw new Error('Cannot find square root');\n return root;\n };\n }\n // Atkin algorithm for q ≡ 5 (mod 8), https://eprint.iacr.org/2012/685.pdf (page 10)\n if (P % _8n === _5n) {\n const c1 = (P - _5n) / _8n;\n return function sqrt5mod8(Fp, n) {\n const n2 = Fp.mul(n, _2n);\n const v = Fp.pow(n2, c1);\n const nv = Fp.mul(n, v);\n const i = Fp.mul(Fp.mul(nv, _2n), v);\n const root = Fp.mul(nv, Fp.sub(i, Fp.ONE));\n if (!Fp.eql(Fp.sqr(root), n))\n throw new Error('Cannot find square root');\n return root;\n };\n }\n // P ≡ 9 (mod 16)\n if (P % _16n === _9n) {\n // NOTE: tonelli is too slow for bls-Fp2 calculations even on start\n // Means we cannot use sqrt for constants at all!\n //\n // const c1 = Fp.sqrt(Fp.negate(Fp.ONE)); // 1. c1 = sqrt(-1) in F, i.e., (c1^2) == -1 in F\n // const c2 = Fp.sqrt(c1); // 2. c2 = sqrt(c1) in F, i.e., (c2^2) == c1 in F\n // const c3 = Fp.sqrt(Fp.negate(c1)); // 3. c3 = sqrt(-c1) in F, i.e., (c3^2) == -c1 in F\n // const c4 = (P + _7n) / _16n; // 4. c4 = (q + 7) / 16 # Integer arithmetic\n // sqrt = (x) => {\n // let tv1 = Fp.pow(x, c4); // 1. tv1 = x^c4\n // let tv2 = Fp.mul(c1, tv1); // 2. tv2 = c1 * tv1\n // const tv3 = Fp.mul(c2, tv1); // 3. tv3 = c2 * tv1\n // let tv4 = Fp.mul(c3, tv1); // 4. tv4 = c3 * tv1\n // const e1 = Fp.equals(Fp.square(tv2), x); // 5. e1 = (tv2^2) == x\n // const e2 = Fp.equals(Fp.square(tv3), x); // 6. e2 = (tv3^2) == x\n // tv1 = Fp.cmov(tv1, tv2, e1); // 7. tv1 = CMOV(tv1, tv2, e1) # Select tv2 if (tv2^2) == x\n // tv2 = Fp.cmov(tv4, tv3, e2); // 8. tv2 = CMOV(tv4, tv3, e2) # Select tv3 if (tv3^2) == x\n // const e3 = Fp.equals(Fp.square(tv2), x); // 9. e3 = (tv2^2) == x\n // return Fp.cmov(tv1, tv2, e3); // 10. z = CMOV(tv1, tv2, e3) # Select the sqrt from tv1 and tv2\n // }\n }\n // Other cases: Tonelli-Shanks algorithm\n return tonelliShanks(P);\n}\n// Little-endian check for first LE bit (last BE bit);\nexport const isNegativeLE = (num, modulo) => (mod(num, modulo) & _1n) === _1n;\n// prettier-ignore\nconst FIELD_FIELDS = [\n 'create', 'isValid', 'is0', 'neg', 'inv', 'sqrt', 'sqr',\n 'eql', 'add', 'sub', 'mul', 'pow', 'div',\n 'addN', 'subN', 'mulN', 'sqrN'\n];\nexport function validateField(field) {\n const initial = {\n ORDER: 'bigint',\n MASK: 'bigint',\n BYTES: 'isSafeInteger',\n BITS: 'isSafeInteger',\n };\n const opts = FIELD_FIELDS.reduce((map, val) => {\n map[val] = 'function';\n return map;\n }, initial);\n return validateObject(field, opts);\n}\n// Generic field functions\n/**\n * Same as `pow` but for Fp: non-constant-time.\n * Unsafe in some contexts: uses ladder, so can expose bigint bits.\n */\nexport function FpPow(f, num, power) {\n // Should have same speed as pow for bigints\n // TODO: benchmark!\n if (power < _0n)\n throw new Error('Expected power > 0');\n if (power === _0n)\n return f.ONE;\n if (power === _1n)\n return num;\n let p = f.ONE;\n let d = num;\n while (power > _0n) {\n if (power & _1n)\n p = f.mul(p, d);\n d = f.sqr(d);\n power >>= _1n;\n }\n return p;\n}\n/**\n * Efficiently invert an array of Field elements.\n * `inv(0)` will return `undefined` here: make sure to throw an error.\n */\nexport function FpInvertBatch(f, nums) {\n const tmp = new Array(nums.length);\n // Walk from first to last, multiply them by each other MOD p\n const lastMultiplied = nums.reduce((acc, num, i) => {\n if (f.is0(num))\n return acc;\n tmp[i] = acc;\n return f.mul(acc, num);\n }, f.ONE);\n // Invert last element\n const inverted = f.inv(lastMultiplied);\n // Walk from last to first, multiply them by inverted each other MOD p\n nums.reduceRight((acc, num, i) => {\n if (f.is0(num))\n return acc;\n tmp[i] = f.mul(acc, tmp[i]);\n return f.mul(acc, num);\n }, inverted);\n return tmp;\n}\nexport function FpDiv(f, lhs, rhs) {\n return f.mul(lhs, typeof rhs === 'bigint' ? invert(rhs, f.ORDER) : f.inv(rhs));\n}\nexport function FpLegendre(order) {\n // (a | p) ≡ 1 if a is a square (mod p), quadratic residue\n // (a | p) ≡ -1 if a is not a square (mod p), quadratic non residue\n // (a | p) ≡ 0 if a ≡ 0 (mod p)\n const legendreConst = (order - _1n) / _2n; // Integer arithmetic\n return (f, x) => f.pow(x, legendreConst);\n}\n// This function returns True whenever the value x is a square in the field F.\nexport function FpIsSquare(f) {\n const legendre = FpLegendre(f.ORDER);\n return (x) => {\n const p = legendre(f, x);\n return f.eql(p, f.ZERO) || f.eql(p, f.ONE);\n };\n}\n// CURVE.n lengths\nexport function nLength(n, nBitLength) {\n // Bit size, byte size of CURVE.n\n const _nBitLength = nBitLength !== undefined ? nBitLength : n.toString(2).length;\n const nByteLength = Math.ceil(_nBitLength / 8);\n return { nBitLength: _nBitLength, nByteLength };\n}\n/**\n * Initializes a finite field over prime. **Non-primes are not supported.**\n * Do not init in loop: slow. Very fragile: always run a benchmark on a change.\n * Major performance optimizations:\n * * a) denormalized operations like mulN instead of mul\n * * b) same object shape: never add or remove keys\n * * c) Object.freeze\n * NOTE: operations don't check 'isValid' for all elements for performance reasons,\n * it is caller responsibility to check this.\n * This is low-level code, please make sure you know what you doing.\n * @param ORDER prime positive bigint\n * @param bitLen how many bits the field consumes\n * @param isLE (def: false) if encoding / decoding should be in little-endian\n * @param redef optional faster redefinitions of sqrt and other methods\n */\nexport function Field(ORDER, bitLen, isLE = false, redef = {}) {\n if (ORDER <= _0n)\n throw new Error(`Expected Field ORDER > 0, got ${ORDER}`);\n const { nBitLength: BITS, nByteLength: BYTES } = nLength(ORDER, bitLen);\n if (BYTES > 2048)\n throw new Error('Field lengths over 2048 bytes are not supported');\n const sqrtP = FpSqrt(ORDER);\n const f = Object.freeze({\n ORDER,\n BITS,\n BYTES,\n MASK: bitMask(BITS),\n ZERO: _0n,\n ONE: _1n,\n create: (num) => mod(num, ORDER),\n isValid: (num) => {\n if (typeof num !== 'bigint')\n throw new Error(`Invalid field element: expected bigint, got ${typeof num}`);\n return _0n <= num && num < ORDER; // 0 is valid element, but it's not invertible\n },\n is0: (num) => num === _0n,\n isOdd: (num) => (num & _1n) === _1n,\n neg: (num) => mod(-num, ORDER),\n eql: (lhs, rhs) => lhs === rhs,\n sqr: (num) => mod(num * num, ORDER),\n add: (lhs, rhs) => mod(lhs + rhs, ORDER),\n sub: (lhs, rhs) => mod(lhs - rhs, ORDER),\n mul: (lhs, rhs) => mod(lhs * rhs, ORDER),\n pow: (num, power) => FpPow(f, num, power),\n div: (lhs, rhs) => mod(lhs * invert(rhs, ORDER), ORDER),\n // Same as above, but doesn't normalize\n sqrN: (num) => num * num,\n addN: (lhs, rhs) => lhs + rhs,\n subN: (lhs, rhs) => lhs - rhs,\n mulN: (lhs, rhs) => lhs * rhs,\n inv: (num) => invert(num, ORDER),\n sqrt: redef.sqrt || ((n) => sqrtP(f, n)),\n invertBatch: (lst) => FpInvertBatch(f, lst),\n // TODO: do we really need constant cmov?\n // We don't have const-time bigints anyway, so probably will be not very useful\n cmov: (a, b, c) => (c ? b : a),\n toBytes: (num) => (isLE ? numberToBytesLE(num, BYTES) : numberToBytesBE(num, BYTES)),\n fromBytes: (bytes) => {\n if (bytes.length !== BYTES)\n throw new Error(`Fp.fromBytes: expected ${BYTES}, got ${bytes.length}`);\n return isLE ? bytesToNumberLE(bytes) : bytesToNumberBE(bytes);\n },\n });\n return Object.freeze(f);\n}\nexport function FpSqrtOdd(Fp, elm) {\n if (!Fp.isOdd)\n throw new Error(`Field doesn't have isOdd`);\n const root = Fp.sqrt(elm);\n return Fp.isOdd(root) ? root : Fp.neg(root);\n}\nexport function FpSqrtEven(Fp, elm) {\n if (!Fp.isOdd)\n throw new Error(`Field doesn't have isOdd`);\n const root = Fp.sqrt(elm);\n return Fp.isOdd(root) ? Fp.neg(root) : root;\n}\n/**\n * \"Constant-time\" private key generation utility.\n * Same as mapKeyToField, but accepts less bytes (40 instead of 48 for 32-byte field).\n * Which makes it slightly more biased, less secure.\n * @deprecated use mapKeyToField instead\n */\nexport function hashToPrivateScalar(hash, groupOrder, isLE = false) {\n hash = ensureBytes('privateHash', hash);\n const hashLen = hash.length;\n const minLen = nLength(groupOrder).nByteLength + 8;\n if (minLen < 24 || hashLen < minLen || hashLen > 1024)\n throw new Error(`hashToPrivateScalar: expected ${minLen}-1024 bytes of input, got ${hashLen}`);\n const num = isLE ? bytesToNumberLE(hash) : bytesToNumberBE(hash);\n return mod(num, groupOrder - _1n) + _1n;\n}\n/**\n * Returns total number of bytes consumed by the field element.\n * For example, 32 bytes for usual 256-bit weierstrass curve.\n * @param fieldOrder number of field elements, usually CURVE.n\n * @returns byte length of field\n */\nexport function getFieldBytesLength(fieldOrder) {\n if (typeof fieldOrder !== 'bigint')\n throw new Error('field order must be bigint');\n const bitLength = fieldOrder.toString(2).length;\n return Math.ceil(bitLength / 8);\n}\n/**\n * Returns minimal amount of bytes that can be safely reduced\n * by field order.\n * Should be 2^-128 for 128-bit curve such as P256.\n * @param fieldOrder number of field elements, usually CURVE.n\n * @returns byte length of target hash\n */\nexport function getMinHashLength(fieldOrder) {\n const length = getFieldBytesLength(fieldOrder);\n return length + Math.ceil(length / 2);\n}\n/**\n * \"Constant-time\" private key generation utility.\n * Can take (n + n/2) or more bytes of uniform input e.g. from CSPRNG or KDF\n * and convert them into private scalar, with the modulo bias being negligible.\n * Needs at least 48 bytes of input for 32-byte private key.\n * https://research.kudelskisecurity.com/2020/07/28/the-definitive-guide-to-modulo-bias-and-how-to-avoid-it/\n * FIPS 186-5, A.2 https://csrc.nist.gov/publications/detail/fips/186/5/final\n * RFC 9380, https://www.rfc-editor.org/rfc/rfc9380#section-5\n * @param hash hash output from SHA3 or a similar function\n * @param groupOrder size of subgroup - (e.g. secp256k1.CURVE.n)\n * @param isLE interpret hash bytes as LE num\n * @returns valid private scalar\n */\nexport function mapHashToField(key, fieldOrder, isLE = false) {\n const len = key.length;\n const fieldLen = getFieldBytesLength(fieldOrder);\n const minLen = getMinHashLength(fieldOrder);\n // No small numbers: need to understand bias story. No huge numbers: easier to detect JS timings.\n if (len < 16 || len < minLen || len > 1024)\n throw new Error(`expected ${minLen}-1024 bytes of input, got ${len}`);\n const num = isLE ? bytesToNumberBE(key) : bytesToNumberLE(key);\n // `mod(x, 11)` can sometimes produce 0. `mod(x, 10) + 1` is the same, but no 0\n const reduced = mod(num, fieldOrder - _1n) + _1n;\n return isLE ? numberToBytesLE(reduced, fieldLen) : numberToBytesBE(reduced, fieldLen);\n}\n//# sourceMappingURL=modular.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Abelian group utilities\nimport { validateField, nLength } from './modular.js';\nimport { validateObject } from './utils.js';\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\n// Since points in different groups cannot be equal (different object constructor),\n// we can have single place to store precomputes\nconst pointPrecomputes = new WeakMap();\nconst pointWindowSizes = new WeakMap(); // This allows use make points immutable (nothing changes inside)\n// Elliptic curve multiplication of Point by scalar. Fragile.\n// Scalars should always be less than curve order: this should be checked inside of a curve itself.\n// Creates precomputation tables for fast multiplication:\n// - private scalar is split by fixed size windows of W bits\n// - every window point is collected from window's table & added to accumulator\n// - since windows are different, same point inside tables won't be accessed more than once per calc\n// - each multiplication is 'Math.ceil(CURVE_ORDER / 𝑊) + 1' point additions (fixed for any scalar)\n// - +1 window is neccessary for wNAF\n// - wNAF reduces table size: 2x less memory + 2x faster generation, but 10% slower multiplication\n// TODO: Research returning 2d JS array of windows, instead of a single window. This would allow\n// windows to be in different memory locations\nexport function wNAF(c, bits) {\n const constTimeNegate = (condition, item) => {\n const neg = item.negate();\n return condition ? neg : item;\n };\n const validateW = (W) => {\n if (!Number.isSafeInteger(W) || W <= 0 || W > bits)\n throw new Error(`Wrong window size=${W}, should be [1..${bits}]`);\n };\n const opts = (W) => {\n validateW(W);\n const windows = Math.ceil(bits / W) + 1; // +1, because\n const windowSize = 2 ** (W - 1); // -1 because we skip zero\n return { windows, windowSize };\n };\n return {\n constTimeNegate,\n // non-const time multiplication ladder\n unsafeLadder(elm, n) {\n let p = c.ZERO;\n let d = elm;\n while (n > _0n) {\n if (n & _1n)\n p = p.add(d);\n d = d.double();\n n >>= _1n;\n }\n return p;\n },\n /**\n * Creates a wNAF precomputation window. Used for caching.\n * Default window size is set by `utils.precompute()` and is equal to 8.\n * Number of precomputed points depends on the curve size:\n * 2^(𝑊−1) * (Math.ceil(𝑛 / 𝑊) + 1), where:\n * - 𝑊 is the window size\n * - 𝑛 is the bitlength of the curve order.\n * For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.\n * @returns precomputed point tables flattened to a single array\n */\n precomputeWindow(elm, W) {\n const { windows, windowSize } = opts(W);\n const points = [];\n let p = elm;\n let base = p;\n for (let window = 0; window < windows; window++) {\n base = p;\n points.push(base);\n // =1, because we skip zero\n for (let i = 1; i < windowSize; i++) {\n base = base.add(p);\n points.push(base);\n }\n p = base.double();\n }\n return points;\n },\n /**\n * Implements ec multiplication using precomputed tables and w-ary non-adjacent form.\n * @param W window size\n * @param precomputes precomputed tables\n * @param n scalar (we don't check here, but should be less than curve order)\n * @returns real and fake (for const-time) points\n */\n wNAF(W, precomputes, n) {\n // TODO: maybe check that scalar is less than group order? wNAF behavious is undefined otherwise\n // But need to carefully remove other checks before wNAF. ORDER == bits here\n const { windows, windowSize } = opts(W);\n let p = c.ZERO;\n let f = c.BASE;\n const mask = BigInt(2 ** W - 1); // Create mask with W ones: 0b1111 for W=4 etc.\n const maxNumber = 2 ** W;\n const shiftBy = BigInt(W);\n for (let window = 0; window < windows; window++) {\n const offset = window * windowSize;\n // Extract W bits.\n let wbits = Number(n & mask);\n // Shift number by W bits.\n n >>= shiftBy;\n // If the bits are bigger than max size, we'll split those.\n // +224 => 256 - 32\n if (wbits > windowSize) {\n wbits -= maxNumber;\n n += _1n;\n }\n // This code was first written with assumption that 'f' and 'p' will never be infinity point:\n // since each addition is multiplied by 2 ** W, it cannot cancel each other. However,\n // there is negate now: it is possible that negated element from low value\n // would be the same as high element, which will create carry into next window.\n // It's not obvious how this can fail, but still worth investigating later.\n // Check if we're onto Zero point.\n // Add random point inside current window to f.\n const offset1 = offset;\n const offset2 = offset + Math.abs(wbits) - 1; // -1 because we skip zero\n const cond1 = window % 2 !== 0;\n const cond2 = wbits < 0;\n if (wbits === 0) {\n // The most important part for const-time getPublicKey\n f = f.add(constTimeNegate(cond1, precomputes[offset1]));\n }\n else {\n p = p.add(constTimeNegate(cond2, precomputes[offset2]));\n }\n }\n // JIT-compiler should not eliminate f here, since it will later be used in normalizeZ()\n // Even if the variable is still unused, there are some checks which will\n // throw an exception, so compiler needs to prove they won't happen, which is hard.\n // At this point there is a way to F be infinity-point even if p is not,\n // which makes it less const-time: around 1 bigint multiply.\n return { p, f };\n },\n wNAFCached(P, n, transform) {\n const W = pointWindowSizes.get(P) || 1;\n // Calculate precomputes on a first run, reuse them after\n let comp = pointPrecomputes.get(P);\n if (!comp) {\n comp = this.precomputeWindow(P, W);\n if (W !== 1)\n pointPrecomputes.set(P, transform(comp));\n }\n return this.wNAF(W, comp, n);\n },\n // We calculate precomputes for elliptic curve point multiplication\n // using windowed method. This specifies window size and\n // stores precomputed values. Usually only base point would be precomputed.\n setWindowSize(P, W) {\n validateW(W);\n pointWindowSizes.set(P, W);\n pointPrecomputes.delete(P);\n },\n };\n}\nexport function validateBasic(curve) {\n validateField(curve.Fp);\n validateObject(curve, {\n n: 'bigint',\n h: 'bigint',\n Gx: 'field',\n Gy: 'field',\n }, {\n nBitLength: 'isSafeInteger',\n nByteLength: 'isSafeInteger',\n });\n // Set defaults\n return Object.freeze({\n ...nLength(curve.n, curve.nBitLength),\n ...curve,\n ...{ p: curve.Fp.ORDER },\n });\n}\n//# sourceMappingURL=curve.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Twisted Edwards curve. The formula is: ax² + y² = 1 + dx²y²\nimport { validateBasic, wNAF } from './curve.js';\nimport { mod } from './modular.js';\nimport * as ut from './utils.js';\nimport { ensureBytes, memoized, abool } from './utils.js';\n// Be friendly to bad ECMAScript parsers by not using bigint literals\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = BigInt(2), _8n = BigInt(8);\n// verification rule is either zip215 or rfc8032 / nist186-5. Consult fromHex:\nconst VERIFY_DEFAULT = { zip215: true };\nfunction validateOpts(curve) {\n const opts = validateBasic(curve);\n ut.validateObject(curve, {\n hash: 'function',\n a: 'bigint',\n d: 'bigint',\n randomBytes: 'function',\n }, {\n adjustScalarBytes: 'function',\n domain: 'function',\n uvRatio: 'function',\n mapToCurve: 'function',\n });\n // Set defaults\n return Object.freeze({ ...opts });\n}\n/**\n * Creates Twisted Edwards curve with EdDSA signatures.\n * @example\n * import { Field } from '@noble/curves/abstract/modular';\n * // Before that, define BigInt-s: a, d, p, n, Gx, Gy, h\n * const curve = twistedEdwards({ a, d, Fp: Field(p), n, Gx, Gy, h })\n */\nexport function twistedEdwards(curveDef) {\n const CURVE = validateOpts(curveDef);\n const { Fp, n: CURVE_ORDER, prehash: prehash, hash: cHash, randomBytes, nByteLength, h: cofactor, } = CURVE;\n const MASK = _2n << (BigInt(nByteLength * 8) - _1n);\n const modP = Fp.create; // Function overrides\n // sqrt(u/v)\n const uvRatio = CURVE.uvRatio ||\n ((u, v) => {\n try {\n return { isValid: true, value: Fp.sqrt(u * Fp.inv(v)) };\n }\n catch (e) {\n return { isValid: false, value: _0n };\n }\n });\n const adjustScalarBytes = CURVE.adjustScalarBytes || ((bytes) => bytes); // NOOP\n const domain = CURVE.domain ||\n ((data, ctx, phflag) => {\n abool('phflag', phflag);\n if (ctx.length || phflag)\n throw new Error('Contexts/pre-hash are not supported');\n return data;\n }); // NOOP\n // 0 <= n < MASK\n // Coordinates larger than Fp.ORDER are allowed for zip215\n function aCoordinate(title, n) {\n ut.aInRange('coordinate ' + title, n, _0n, MASK);\n }\n function assertPoint(other) {\n if (!(other instanceof Point))\n throw new Error('ExtendedPoint expected');\n }\n // Converts Extended point to default (x, y) coordinates.\n // Can accept precomputed Z^-1 - for example, from invertBatch.\n const toAffineMemo = memoized((p, iz) => {\n const { ex: x, ey: y, ez: z } = p;\n const is0 = p.is0();\n if (iz == null)\n iz = is0 ? _8n : Fp.inv(z); // 8 was chosen arbitrarily\n const ax = modP(x * iz);\n const ay = modP(y * iz);\n const zz = modP(z * iz);\n if (is0)\n return { x: _0n, y: _1n };\n if (zz !== _1n)\n throw new Error('invZ was invalid');\n return { x: ax, y: ay };\n });\n const assertValidMemo = memoized((p) => {\n const { a, d } = CURVE;\n if (p.is0())\n throw new Error('bad point: ZERO'); // TODO: optimize, with vars below?\n // Equation in affine coordinates: ax² + y² = 1 + dx²y²\n // Equation in projective coordinates (X/Z, Y/Z, Z): (aX² + Y²)Z² = Z⁴ + dX²Y²\n const { ex: X, ey: Y, ez: Z, et: T } = p;\n const X2 = modP(X * X); // X²\n const Y2 = modP(Y * Y); // Y²\n const Z2 = modP(Z * Z); // Z²\n const Z4 = modP(Z2 * Z2); // Z⁴\n const aX2 = modP(X2 * a); // aX²\n const left = modP(Z2 * modP(aX2 + Y2)); // (aX² + Y²)Z²\n const right = modP(Z4 + modP(d * modP(X2 * Y2))); // Z⁴ + dX²Y²\n if (left !== right)\n throw new Error('bad point: equation left != right (1)');\n // In Extended coordinates we also have T, which is x*y=T/Z: check X*Y == Z*T\n const XY = modP(X * Y);\n const ZT = modP(Z * T);\n if (XY !== ZT)\n throw new Error('bad point: equation left != right (2)');\n return true;\n });\n // Extended Point works in extended coordinates: (x, y, z, t) ∋ (x=x/z, y=y/z, t=xy).\n // https://en.wikipedia.org/wiki/Twisted_Edwards_curve#Extended_coordinates\n class Point {\n constructor(ex, ey, ez, et) {\n this.ex = ex;\n this.ey = ey;\n this.ez = ez;\n this.et = et;\n aCoordinate('x', ex);\n aCoordinate('y', ey);\n aCoordinate('z', ez);\n aCoordinate('t', et);\n Object.freeze(this);\n }\n get x() {\n return this.toAffine().x;\n }\n get y() {\n return this.toAffine().y;\n }\n static fromAffine(p) {\n if (p instanceof Point)\n throw new Error('extended point not allowed');\n const { x, y } = p || {};\n aCoordinate('x', x);\n aCoordinate('y', y);\n return new Point(x, y, _1n, modP(x * y));\n }\n static normalizeZ(points) {\n const toInv = Fp.invertBatch(points.map((p) => p.ez));\n return points.map((p, i) => p.toAffine(toInv[i])).map(Point.fromAffine);\n }\n // \"Private method\", don't use it directly\n _setWindowSize(windowSize) {\n wnaf.setWindowSize(this, windowSize);\n }\n // Not required for fromHex(), which always creates valid points.\n // Could be useful for fromAffine().\n assertValidity() {\n assertValidMemo(this);\n }\n // Compare one point to another.\n equals(other) {\n assertPoint(other);\n const { ex: X1, ey: Y1, ez: Z1 } = this;\n const { ex: X2, ey: Y2, ez: Z2 } = other;\n const X1Z2 = modP(X1 * Z2);\n const X2Z1 = modP(X2 * Z1);\n const Y1Z2 = modP(Y1 * Z2);\n const Y2Z1 = modP(Y2 * Z1);\n return X1Z2 === X2Z1 && Y1Z2 === Y2Z1;\n }\n is0() {\n return this.equals(Point.ZERO);\n }\n negate() {\n // Flips point sign to a negative one (-x, y in affine coords)\n return new Point(modP(-this.ex), this.ey, this.ez, modP(-this.et));\n }\n // Fast algo for doubling Extended Point.\n // https://hyperelliptic.org/EFD/g1p/auto-twisted-extended.html#doubling-dbl-2008-hwcd\n // Cost: 4M + 4S + 1*a + 6add + 1*2.\n double() {\n const { a } = CURVE;\n const { ex: X1, ey: Y1, ez: Z1 } = this;\n const A = modP(X1 * X1); // A = X12\n const B = modP(Y1 * Y1); // B = Y12\n const C = modP(_2n * modP(Z1 * Z1)); // C = 2*Z12\n const D = modP(a * A); // D = a*A\n const x1y1 = X1 + Y1;\n const E = modP(modP(x1y1 * x1y1) - A - B); // E = (X1+Y1)2-A-B\n const G = D + B; // G = D+B\n const F = G - C; // F = G-C\n const H = D - B; // H = D-B\n const X3 = modP(E * F); // X3 = E*F\n const Y3 = modP(G * H); // Y3 = G*H\n const T3 = modP(E * H); // T3 = E*H\n const Z3 = modP(F * G); // Z3 = F*G\n return new Point(X3, Y3, Z3, T3);\n }\n // Fast algo for adding 2 Extended Points.\n // https://hyperelliptic.org/EFD/g1p/auto-twisted-extended.html#addition-add-2008-hwcd\n // Cost: 9M + 1*a + 1*d + 7add.\n add(other) {\n assertPoint(other);\n const { a, d } = CURVE;\n const { ex: X1, ey: Y1, ez: Z1, et: T1 } = this;\n const { ex: X2, ey: Y2, ez: Z2, et: T2 } = other;\n // Faster algo for adding 2 Extended Points when curve's a=-1.\n // http://hyperelliptic.org/EFD/g1p/auto-twisted-extended-1.html#addition-add-2008-hwcd-4\n // Cost: 8M + 8add + 2*2.\n // Note: It does not check whether the `other` point is valid.\n if (a === BigInt(-1)) {\n const A = modP((Y1 - X1) * (Y2 + X2));\n const B = modP((Y1 + X1) * (Y2 - X2));\n const F = modP(B - A);\n if (F === _0n)\n return this.double(); // Same point. Tests say it doesn't affect timing\n const C = modP(Z1 * _2n * T2);\n const D = modP(T1 * _2n * Z2);\n const E = D + C;\n const G = B + A;\n const H = D - C;\n const X3 = modP(E * F);\n const Y3 = modP(G * H);\n const T3 = modP(E * H);\n const Z3 = modP(F * G);\n return new Point(X3, Y3, Z3, T3);\n }\n const A = modP(X1 * X2); // A = X1*X2\n const B = modP(Y1 * Y2); // B = Y1*Y2\n const C = modP(T1 * d * T2); // C = T1*d*T2\n const D = modP(Z1 * Z2); // D = Z1*Z2\n const E = modP((X1 + Y1) * (X2 + Y2) - A - B); // E = (X1+Y1)*(X2+Y2)-A-B\n const F = D - C; // F = D-C\n const G = D + C; // G = D+C\n const H = modP(B - a * A); // H = B-a*A\n const X3 = modP(E * F); // X3 = E*F\n const Y3 = modP(G * H); // Y3 = G*H\n const T3 = modP(E * H); // T3 = E*H\n const Z3 = modP(F * G); // Z3 = F*G\n return new Point(X3, Y3, Z3, T3);\n }\n subtract(other) {\n return this.add(other.negate());\n }\n wNAF(n) {\n return wnaf.wNAFCached(this, n, Point.normalizeZ);\n }\n // Constant-time multiplication.\n multiply(scalar) {\n const n = scalar;\n ut.aInRange('scalar', n, _1n, CURVE_ORDER); // 1 <= scalar < L\n const { p, f } = this.wNAF(n);\n return Point.normalizeZ([p, f])[0];\n }\n // Non-constant-time multiplication. Uses double-and-add algorithm.\n // It's faster, but should only be used when you don't care about\n // an exposed private key e.g. sig verification.\n // Does NOT allow scalars higher than CURVE.n.\n multiplyUnsafe(scalar) {\n const n = scalar;\n ut.aInRange('scalar', n, _0n, CURVE_ORDER); // 0 <= scalar < L\n if (n === _0n)\n return I;\n if (this.equals(I) || n === _1n)\n return this;\n if (this.equals(G))\n return this.wNAF(n).p;\n return wnaf.unsafeLadder(this, n);\n }\n // Checks if point is of small order.\n // If you add something to small order point, you will have \"dirty\"\n // point with torsion component.\n // Multiplies point by cofactor and checks if the result is 0.\n isSmallOrder() {\n return this.multiplyUnsafe(cofactor).is0();\n }\n // Multiplies point by curve order and checks if the result is 0.\n // Returns `false` is the point is dirty.\n isTorsionFree() {\n return wnaf.unsafeLadder(this, CURVE_ORDER).is0();\n }\n // Converts Extended point to default (x, y) coordinates.\n // Can accept precomputed Z^-1 - for example, from invertBatch.\n toAffine(iz) {\n return toAffineMemo(this, iz);\n }\n clearCofactor() {\n const { h: cofactor } = CURVE;\n if (cofactor === _1n)\n return this;\n return this.multiplyUnsafe(cofactor);\n }\n // Converts hash string or Uint8Array to Point.\n // Uses algo from RFC8032 5.1.3.\n static fromHex(hex, zip215 = false) {\n const { d, a } = CURVE;\n const len = Fp.BYTES;\n hex = ensureBytes('pointHex', hex, len); // copy hex to a new array\n abool('zip215', zip215);\n const normed = hex.slice(); // copy again, we'll manipulate it\n const lastByte = hex[len - 1]; // select last byte\n normed[len - 1] = lastByte & ~0x80; // clear last bit\n const y = ut.bytesToNumberLE(normed);\n // RFC8032 prohibits >= p, but ZIP215 doesn't\n // zip215=true: 0 <= y < MASK (2^256 for ed25519)\n // zip215=false: 0 <= y < P (2^255-19 for ed25519)\n const max = zip215 ? MASK : Fp.ORDER;\n ut.aInRange('pointHex.y', y, _0n, max);\n // Ed25519: x² = (y²-1)/(dy²+1) mod p. Ed448: x² = (y²-1)/(dy²-1) mod p. Generic case:\n // ax²+y²=1+dx²y² => y²-1=dx²y²-ax² => y²-1=x²(dy²-a) => x²=(y²-1)/(dy²-a)\n const y2 = modP(y * y); // denominator is always non-0 mod p.\n const u = modP(y2 - _1n); // u = y² - 1\n const v = modP(d * y2 - a); // v = d y² + 1.\n let { isValid, value: x } = uvRatio(u, v); // √(u/v)\n if (!isValid)\n throw new Error('Point.fromHex: invalid y coordinate');\n const isXOdd = (x & _1n) === _1n; // There are 2 square roots. Use x_0 bit to select proper\n const isLastByteOdd = (lastByte & 0x80) !== 0; // x_0, last bit\n if (!zip215 && x === _0n && isLastByteOdd)\n // if x=0 and x_0 = 1, fail\n throw new Error('Point.fromHex: x=0 and x_0=1');\n if (isLastByteOdd !== isXOdd)\n x = modP(-x); // if x_0 != x mod 2, set x = p-x\n return Point.fromAffine({ x, y });\n }\n static fromPrivateKey(privKey) {\n return getExtendedPublicKey(privKey).point;\n }\n toRawBytes() {\n const { x, y } = this.toAffine();\n const bytes = ut.numberToBytesLE(y, Fp.BYTES); // each y has 2 x values (x, -y)\n bytes[bytes.length - 1] |= x & _1n ? 0x80 : 0; // when compressing, it's enough to store y\n return bytes; // and use the last byte to encode sign of x\n }\n toHex() {\n return ut.bytesToHex(this.toRawBytes()); // Same as toRawBytes, but returns string.\n }\n }\n Point.BASE = new Point(CURVE.Gx, CURVE.Gy, _1n, modP(CURVE.Gx * CURVE.Gy));\n Point.ZERO = new Point(_0n, _1n, _1n, _0n); // 0, 1, 1, 0\n const { BASE: G, ZERO: I } = Point;\n const wnaf = wNAF(Point, nByteLength * 8);\n function modN(a) {\n return mod(a, CURVE_ORDER);\n }\n // Little-endian SHA512 with modulo n\n function modN_LE(hash) {\n return modN(ut.bytesToNumberLE(hash));\n }\n /** Convenience method that creates public key and other stuff. RFC8032 5.1.5 */\n function getExtendedPublicKey(key) {\n const len = nByteLength;\n key = ensureBytes('private key', key, len);\n // Hash private key with curve's hash function to produce uniformingly random input\n // Check byte lengths: ensure(64, h(ensure(32, key)))\n const hashed = ensureBytes('hashed private key', cHash(key), 2 * len);\n const head = adjustScalarBytes(hashed.slice(0, len)); // clear first half bits, produce FE\n const prefix = hashed.slice(len, 2 * len); // second half is called key prefix (5.1.6)\n const scalar = modN_LE(head); // The actual private scalar\n const point = G.multiply(scalar); // Point on Edwards curve aka public key\n const pointBytes = point.toRawBytes(); // Uint8Array representation\n return { head, prefix, scalar, point, pointBytes };\n }\n // Calculates EdDSA pub key. RFC8032 5.1.5. Privkey is hashed. Use first half with 3 bits cleared\n function getPublicKey(privKey) {\n return getExtendedPublicKey(privKey).pointBytes;\n }\n // int('LE', SHA512(dom2(F, C) || msgs)) mod N\n function hashDomainToScalar(context = new Uint8Array(), ...msgs) {\n const msg = ut.concatBytes(...msgs);\n return modN_LE(cHash(domain(msg, ensureBytes('context', context), !!prehash)));\n }\n /** Signs message with privateKey. RFC8032 5.1.6 */\n function sign(msg, privKey, options = {}) {\n msg = ensureBytes('message', msg);\n if (prehash)\n msg = prehash(msg); // for ed25519ph etc.\n const { prefix, scalar, pointBytes } = getExtendedPublicKey(privKey);\n const r = hashDomainToScalar(options.context, prefix, msg); // r = dom2(F, C) || prefix || PH(M)\n const R = G.multiply(r).toRawBytes(); // R = rG\n const k = hashDomainToScalar(options.context, R, pointBytes, msg); // R || A || PH(M)\n const s = modN(r + k * scalar); // S = (r + k * s) mod L\n ut.aInRange('signature.s', s, _0n, CURVE_ORDER); // 0 <= s < l\n const res = ut.concatBytes(R, ut.numberToBytesLE(s, Fp.BYTES));\n return ensureBytes('result', res, nByteLength * 2); // 64-byte signature\n }\n const verifyOpts = VERIFY_DEFAULT;\n function verify(sig, msg, publicKey, options = verifyOpts) {\n const { context, zip215 } = options;\n const len = Fp.BYTES; // Verifies EdDSA signature against message and public key. RFC8032 5.1.7.\n sig = ensureBytes('signature', sig, 2 * len); // An extended group equation is checked.\n msg = ensureBytes('message', msg);\n if (zip215 !== undefined)\n abool('zip215', zip215);\n if (prehash)\n msg = prehash(msg); // for ed25519ph, etc\n const s = ut.bytesToNumberLE(sig.slice(len, 2 * len));\n // zip215: true is good for consensus-critical apps and allows points < 2^256\n // zip215: false follows RFC8032 / NIST186-5 and restricts points to CURVE.p\n let A, R, SB;\n try {\n A = Point.fromHex(publicKey, zip215);\n R = Point.fromHex(sig.slice(0, len), zip215);\n SB = G.multiplyUnsafe(s); // 0 <= s < l is done inside\n }\n catch (error) {\n return false;\n }\n if (!zip215 && A.isSmallOrder())\n return false;\n const k = hashDomainToScalar(context, R.toRawBytes(), A.toRawBytes(), msg);\n const RkA = R.add(A.multiplyUnsafe(k));\n // [8][S]B = [8]R + [8][k]A'\n return RkA.subtract(SB).clearCofactor().equals(Point.ZERO);\n }\n G._setWindowSize(8); // Enable precomputes. Slows down first publicKey computation by 20ms.\n const utils = {\n getExtendedPublicKey,\n // ed25519 private keys are uniform 32b. No need to check for modulo bias, like in secp256k1.\n randomPrivateKey: () => randomBytes(Fp.BYTES),\n /**\n * We're doing scalar multiplication (used in getPublicKey etc) with precomputed BASE_POINT\n * values. This slows down first getPublicKey() by milliseconds (see Speed section),\n * but allows to speed-up subsequent getPublicKey() calls up to 20x.\n * @param windowSize 2, 4, 8, 16\n */\n precompute(windowSize = 8, point = Point.BASE) {\n point._setWindowSize(windowSize);\n point.multiply(BigInt(3));\n return point;\n },\n };\n return {\n CURVE,\n getPublicKey,\n sign,\n verify,\n ExtendedPoint: Point,\n utils,\n };\n}\n//# sourceMappingURL=edwards.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { mod, pow } from './modular.js';\nimport { aInRange, bytesToNumberLE, ensureBytes, numberToBytesLE, validateObject, } from './utils.js';\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\nfunction validateOpts(curve) {\n validateObject(curve, {\n a: 'bigint',\n }, {\n montgomeryBits: 'isSafeInteger',\n nByteLength: 'isSafeInteger',\n adjustScalarBytes: 'function',\n domain: 'function',\n powPminus2: 'function',\n Gu: 'bigint',\n });\n // Set defaults\n return Object.freeze({ ...curve });\n}\n// NOTE: not really montgomery curve, just bunch of very specific methods for X25519/X448 (RFC 7748, https://www.rfc-editor.org/rfc/rfc7748)\n// Uses only one coordinate instead of two\nexport function montgomery(curveDef) {\n const CURVE = validateOpts(curveDef);\n const { P } = CURVE;\n const modP = (n) => mod(n, P);\n const montgomeryBits = CURVE.montgomeryBits;\n const montgomeryBytes = Math.ceil(montgomeryBits / 8);\n const fieldLen = CURVE.nByteLength;\n const adjustScalarBytes = CURVE.adjustScalarBytes || ((bytes) => bytes);\n const powPminus2 = CURVE.powPminus2 || ((x) => pow(x, P - BigInt(2), P));\n // cswap from RFC7748. But it is not from RFC7748!\n /*\n cswap(swap, x_2, x_3):\n dummy = mask(swap) AND (x_2 XOR x_3)\n x_2 = x_2 XOR dummy\n x_3 = x_3 XOR dummy\n Return (x_2, x_3)\n Where mask(swap) is the all-1 or all-0 word of the same length as x_2\n and x_3, computed, e.g., as mask(swap) = 0 - swap.\n */\n function cswap(swap, x_2, x_3) {\n const dummy = modP(swap * (x_2 - x_3));\n x_2 = modP(x_2 - dummy);\n x_3 = modP(x_3 + dummy);\n return [x_2, x_3];\n }\n // x25519 from 4\n // The constant a24 is (486662 - 2) / 4 = 121665 for curve25519/X25519\n const a24 = (CURVE.a - BigInt(2)) / BigInt(4);\n /**\n *\n * @param pointU u coordinate (x) on Montgomery Curve 25519\n * @param scalar by which the point would be multiplied\n * @returns new Point on Montgomery curve\n */\n function montgomeryLadder(u, scalar) {\n aInRange('u', u, _0n, P);\n aInRange('scalar', scalar, _0n, P);\n // Section 5: Implementations MUST accept non-canonical values and process them as\n // if they had been reduced modulo the field prime.\n const k = scalar;\n const x_1 = u;\n let x_2 = _1n;\n let z_2 = _0n;\n let x_3 = u;\n let z_3 = _1n;\n let swap = _0n;\n let sw;\n for (let t = BigInt(montgomeryBits - 1); t >= _0n; t--) {\n const k_t = (k >> t) & _1n;\n swap ^= k_t;\n sw = cswap(swap, x_2, x_3);\n x_2 = sw[0];\n x_3 = sw[1];\n sw = cswap(swap, z_2, z_3);\n z_2 = sw[0];\n z_3 = sw[1];\n swap = k_t;\n const A = x_2 + z_2;\n const AA = modP(A * A);\n const B = x_2 - z_2;\n const BB = modP(B * B);\n const E = AA - BB;\n const C = x_3 + z_3;\n const D = x_3 - z_3;\n const DA = modP(D * A);\n const CB = modP(C * B);\n const dacb = DA + CB;\n const da_cb = DA - CB;\n x_3 = modP(dacb * dacb);\n z_3 = modP(x_1 * modP(da_cb * da_cb));\n x_2 = modP(AA * BB);\n z_2 = modP(E * (AA + modP(a24 * E)));\n }\n // (x_2, x_3) = cswap(swap, x_2, x_3)\n sw = cswap(swap, x_2, x_3);\n x_2 = sw[0];\n x_3 = sw[1];\n // (z_2, z_3) = cswap(swap, z_2, z_3)\n sw = cswap(swap, z_2, z_3);\n z_2 = sw[0];\n z_3 = sw[1];\n // z_2^(p - 2)\n const z2 = powPminus2(z_2);\n // Return x_2 * (z_2^(p - 2))\n return modP(x_2 * z2);\n }\n function encodeUCoordinate(u) {\n return numberToBytesLE(modP(u), montgomeryBytes);\n }\n function decodeUCoordinate(uEnc) {\n // Section 5: When receiving such an array, implementations of X25519\n // MUST mask the most significant bit in the final byte.\n const u = ensureBytes('u coordinate', uEnc, montgomeryBytes);\n if (fieldLen === 32)\n u[31] &= 127; // 0b0111_1111\n return bytesToNumberLE(u);\n }\n function decodeScalar(n) {\n const bytes = ensureBytes('scalar', n);\n const len = bytes.length;\n if (len !== montgomeryBytes && len !== fieldLen)\n throw new Error(`Expected ${montgomeryBytes} or ${fieldLen} bytes, got ${len}`);\n return bytesToNumberLE(adjustScalarBytes(bytes));\n }\n function scalarMult(scalar, u) {\n const pointU = decodeUCoordinate(u);\n const _scalar = decodeScalar(scalar);\n const pu = montgomeryLadder(pointU, _scalar);\n // The result was not contributory\n // https://cr.yp.to/ecdh.html#validate\n if (pu === _0n)\n throw new Error('Invalid private or public key received');\n return encodeUCoordinate(pu);\n }\n // Computes public key from private. By doing scalar multiplication of base point.\n const GuBytes = encodeUCoordinate(CURVE.Gu);\n function scalarMultBase(scalar) {\n return scalarMult(scalar, GuBytes);\n }\n return {\n scalarMult,\n scalarMultBase,\n getSharedSecret: (privateKey, publicKey) => scalarMult(privateKey, publicKey),\n getPublicKey: (privateKey) => scalarMultBase(privateKey),\n utils: { randomPrivateKey: () => CURVE.randomBytes(CURVE.nByteLength) },\n GuBytes: GuBytes,\n };\n}\n//# sourceMappingURL=montgomery.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { sha512 } from '@noble/hashes/sha512';\nimport { concatBytes, randomBytes, utf8ToBytes } from '@noble/hashes/utils';\nimport { twistedEdwards } from './abstract/edwards.js';\nimport { createHasher, expand_message_xmd } from './abstract/hash-to-curve.js';\nimport { Field, FpSqrtEven, isNegativeLE, mod, pow2 } from './abstract/modular.js';\nimport { montgomery } from './abstract/montgomery.js';\nimport { bytesToHex, bytesToNumberLE, ensureBytes, equalBytes, numberToBytesLE, } from './abstract/utils.js';\n/**\n * ed25519 Twisted Edwards curve with following addons:\n * - X25519 ECDH\n * - Ristretto cofactor elimination\n * - Elligator hash-to-group / point indistinguishability\n */\nconst ED25519_P = BigInt('57896044618658097711785492504343953926634992332820282019728792003956564819949');\n// √(-1) aka √(a) aka 2^((p-1)/4)\nconst ED25519_SQRT_M1 = /* @__PURE__ */ BigInt('19681161376707505956807079304988542015446066515923890162744021073123829784752');\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = BigInt(2), _3n = BigInt(3);\n// prettier-ignore\nconst _5n = BigInt(5), _8n = BigInt(8);\nfunction ed25519_pow_2_252_3(x) {\n // prettier-ignore\n const _10n = BigInt(10), _20n = BigInt(20), _40n = BigInt(40), _80n = BigInt(80);\n const P = ED25519_P;\n const x2 = (x * x) % P;\n const b2 = (x2 * x) % P; // x^3, 11\n const b4 = (pow2(b2, _2n, P) * b2) % P; // x^15, 1111\n const b5 = (pow2(b4, _1n, P) * x) % P; // x^31\n const b10 = (pow2(b5, _5n, P) * b5) % P;\n const b20 = (pow2(b10, _10n, P) * b10) % P;\n const b40 = (pow2(b20, _20n, P) * b20) % P;\n const b80 = (pow2(b40, _40n, P) * b40) % P;\n const b160 = (pow2(b80, _80n, P) * b80) % P;\n const b240 = (pow2(b160, _80n, P) * b80) % P;\n const b250 = (pow2(b240, _10n, P) * b10) % P;\n const pow_p_5_8 = (pow2(b250, _2n, P) * x) % P;\n // ^ To pow to (p+3)/8, multiply it by x.\n return { pow_p_5_8, b2 };\n}\nfunction adjustScalarBytes(bytes) {\n // Section 5: For X25519, in order to decode 32 random bytes as an integer scalar,\n // set the three least significant bits of the first byte\n bytes[0] &= 248; // 0b1111_1000\n // and the most significant bit of the last to zero,\n bytes[31] &= 127; // 0b0111_1111\n // set the second most significant bit of the last byte to 1\n bytes[31] |= 64; // 0b0100_0000\n return bytes;\n}\n// sqrt(u/v)\nfunction uvRatio(u, v) {\n const P = ED25519_P;\n const v3 = mod(v * v * v, P); // v³\n const v7 = mod(v3 * v3 * v, P); // v⁷\n // (p+3)/8 and (p-5)/8\n const pow = ed25519_pow_2_252_3(u * v7).pow_p_5_8;\n let x = mod(u * v3 * pow, P); // (uv³)(uv⁷)^(p-5)/8\n const vx2 = mod(v * x * x, P); // vx²\n const root1 = x; // First root candidate\n const root2 = mod(x * ED25519_SQRT_M1, P); // Second root candidate\n const useRoot1 = vx2 === u; // If vx² = u (mod p), x is a square root\n const useRoot2 = vx2 === mod(-u, P); // If vx² = -u, set x <-- x * 2^((p-1)/4)\n const noRoot = vx2 === mod(-u * ED25519_SQRT_M1, P); // There is no valid root, vx² = -u√(-1)\n if (useRoot1)\n x = root1;\n if (useRoot2 || noRoot)\n x = root2; // We return root2 anyway, for const-time\n if (isNegativeLE(x, P))\n x = mod(-x, P);\n return { isValid: useRoot1 || useRoot2, value: x };\n}\n// Just in case\nexport const ED25519_TORSION_SUBGROUP = [\n '0100000000000000000000000000000000000000000000000000000000000000',\n 'c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a',\n '0000000000000000000000000000000000000000000000000000000000000080',\n '26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc05',\n 'ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f',\n '26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc85',\n '0000000000000000000000000000000000000000000000000000000000000000',\n 'c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa',\n];\nconst Fp = /* @__PURE__ */ (() => Field(ED25519_P, undefined, true))();\nconst ed25519Defaults = /* @__PURE__ */ (() => ({\n // Param: a\n a: BigInt(-1), // Fp.create(-1) is proper; our way still works and is faster\n // d is equal to -121665/121666 over finite field.\n // Negative number is P - number, and division is invert(number, P)\n d: BigInt('37095705934669439343138083508754565189542113879843219016388785533085940283555'),\n // Finite field 𝔽p over which we'll do calculations; 2n**255n - 19n\n Fp,\n // Subgroup order: how many points curve has\n // 2n**252n + 27742317777372353535851937790883648493n;\n n: BigInt('7237005577332262213973186563042994240857116359379907606001950938285454250989'),\n // Cofactor\n h: _8n,\n // Base point (x, y) aka generator point\n Gx: BigInt('15112221349535400772501151409588531511454012693041857206046113283949847762202'),\n Gy: BigInt('46316835694926478169428394003475163141307993866256225615783033603165251855960'),\n hash: sha512,\n randomBytes,\n adjustScalarBytes,\n // dom2\n // Ratio of u to v. Allows us to combine inversion and square root. Uses algo from RFC8032 5.1.3.\n // Constant-time, u/√v\n uvRatio,\n}))();\n/**\n * ed25519 curve with EdDSA signatures.\n */\nexport const ed25519 = /* @__PURE__ */ (() => twistedEdwards(ed25519Defaults))();\nfunction ed25519_domain(data, ctx, phflag) {\n if (ctx.length > 255)\n throw new Error('Context is too big');\n return concatBytes(utf8ToBytes('SigEd25519 no Ed25519 collisions'), new Uint8Array([phflag ? 1 : 0, ctx.length]), ctx, data);\n}\nexport const ed25519ctx = /* @__PURE__ */ (() => twistedEdwards({\n ...ed25519Defaults,\n domain: ed25519_domain,\n}))();\nexport const ed25519ph = /* @__PURE__ */ (() => twistedEdwards(Object.assign({}, ed25519Defaults, {\n domain: ed25519_domain,\n prehash: sha512,\n})))();\nexport const x25519 = /* @__PURE__ */ (() => montgomery({\n P: ED25519_P,\n a: BigInt(486662),\n montgomeryBits: 255, // n is 253 bits\n nByteLength: 32,\n Gu: BigInt(9),\n powPminus2: (x) => {\n const P = ED25519_P;\n // x^(p-2) aka x^(2^255-21)\n const { pow_p_5_8, b2 } = ed25519_pow_2_252_3(x);\n return mod(pow2(pow_p_5_8, _3n, P) * b2, P);\n },\n adjustScalarBytes,\n randomBytes,\n}))();\n/**\n * Converts ed25519 public key to x25519 public key. Uses formula:\n * * `(u, v) = ((1+y)/(1-y), sqrt(-486664)*u/x)`\n * * `(x, y) = (sqrt(-486664)*u/v, (u-1)/(u+1))`\n * @example\n * const someonesPub = ed25519.getPublicKey(ed25519.utils.randomPrivateKey());\n * const aPriv = x25519.utils.randomPrivateKey();\n * x25519.getSharedSecret(aPriv, edwardsToMontgomeryPub(someonesPub))\n */\nexport function edwardsToMontgomeryPub(edwardsPub) {\n const { y } = ed25519.ExtendedPoint.fromHex(edwardsPub);\n const _1n = BigInt(1);\n return Fp.toBytes(Fp.create((_1n + y) * Fp.inv(_1n - y)));\n}\nexport const edwardsToMontgomery = edwardsToMontgomeryPub; // deprecated\n/**\n * Converts ed25519 secret key to x25519 secret key.\n * @example\n * const someonesPub = x25519.getPublicKey(x25519.utils.randomPrivateKey());\n * const aPriv = ed25519.utils.randomPrivateKey();\n * x25519.getSharedSecret(edwardsToMontgomeryPriv(aPriv), someonesPub)\n */\nexport function edwardsToMontgomeryPriv(edwardsPriv) {\n const hashed = ed25519Defaults.hash(edwardsPriv.subarray(0, 32));\n return ed25519Defaults.adjustScalarBytes(hashed).subarray(0, 32);\n}\n// Hash To Curve Elligator2 Map (NOTE: different from ristretto255 elligator)\n// NOTE: very important part is usage of FpSqrtEven for ELL2_C1_EDWARDS, since\n// SageMath returns different root first and everything falls apart\nconst ELL2_C1 = /* @__PURE__ */ (() => (Fp.ORDER + _3n) / _8n)(); // 1. c1 = (q + 3) / 8 # Integer arithmetic\nconst ELL2_C2 = /* @__PURE__ */ (() => Fp.pow(_2n, ELL2_C1))(); // 2. c2 = 2^c1\nconst ELL2_C3 = /* @__PURE__ */ (() => Fp.sqrt(Fp.neg(Fp.ONE)))(); // 3. c3 = sqrt(-1)\n// prettier-ignore\nfunction map_to_curve_elligator2_curve25519(u) {\n const ELL2_C4 = (Fp.ORDER - _5n) / _8n; // 4. c4 = (q - 5) / 8 # Integer arithmetic\n const ELL2_J = BigInt(486662);\n let tv1 = Fp.sqr(u); // 1. tv1 = u^2\n tv1 = Fp.mul(tv1, _2n); // 2. tv1 = 2 * tv1\n let xd = Fp.add(tv1, Fp.ONE); // 3. xd = tv1 + 1 # Nonzero: -1 is square (mod p), tv1 is not\n let x1n = Fp.neg(ELL2_J); // 4. x1n = -J # x1 = x1n / xd = -J / (1 + 2 * u^2)\n let tv2 = Fp.sqr(xd); // 5. tv2 = xd^2\n let gxd = Fp.mul(tv2, xd); // 6. gxd = tv2 * xd # gxd = xd^3\n let gx1 = Fp.mul(tv1, ELL2_J); // 7. gx1 = J * tv1 # x1n + J * xd\n gx1 = Fp.mul(gx1, x1n); // 8. gx1 = gx1 * x1n # x1n^2 + J * x1n * xd\n gx1 = Fp.add(gx1, tv2); // 9. gx1 = gx1 + tv2 # x1n^2 + J * x1n * xd + xd^2\n gx1 = Fp.mul(gx1, x1n); // 10. gx1 = gx1 * x1n # x1n^3 + J * x1n^2 * xd + x1n * xd^2\n let tv3 = Fp.sqr(gxd); // 11. tv3 = gxd^2\n tv2 = Fp.sqr(tv3); // 12. tv2 = tv3^2 # gxd^4\n tv3 = Fp.mul(tv3, gxd); // 13. tv3 = tv3 * gxd # gxd^3\n tv3 = Fp.mul(tv3, gx1); // 14. tv3 = tv3 * gx1 # gx1 * gxd^3\n tv2 = Fp.mul(tv2, tv3); // 15. tv2 = tv2 * tv3 # gx1 * gxd^7\n let y11 = Fp.pow(tv2, ELL2_C4); // 16. y11 = tv2^c4 # (gx1 * gxd^7)^((p - 5) / 8)\n y11 = Fp.mul(y11, tv3); // 17. y11 = y11 * tv3 # gx1*gxd^3*(gx1*gxd^7)^((p-5)/8)\n let y12 = Fp.mul(y11, ELL2_C3); // 18. y12 = y11 * c3\n tv2 = Fp.sqr(y11); // 19. tv2 = y11^2\n tv2 = Fp.mul(tv2, gxd); // 20. tv2 = tv2 * gxd\n let e1 = Fp.eql(tv2, gx1); // 21. e1 = tv2 == gx1\n let y1 = Fp.cmov(y12, y11, e1); // 22. y1 = CMOV(y12, y11, e1) # If g(x1) is square, this is its sqrt\n let x2n = Fp.mul(x1n, tv1); // 23. x2n = x1n * tv1 # x2 = x2n / xd = 2 * u^2 * x1n / xd\n let y21 = Fp.mul(y11, u); // 24. y21 = y11 * u\n y21 = Fp.mul(y21, ELL2_C2); // 25. y21 = y21 * c2\n let y22 = Fp.mul(y21, ELL2_C3); // 26. y22 = y21 * c3\n let gx2 = Fp.mul(gx1, tv1); // 27. gx2 = gx1 * tv1 # g(x2) = gx2 / gxd = 2 * u^2 * g(x1)\n tv2 = Fp.sqr(y21); // 28. tv2 = y21^2\n tv2 = Fp.mul(tv2, gxd); // 29. tv2 = tv2 * gxd\n let e2 = Fp.eql(tv2, gx2); // 30. e2 = tv2 == gx2\n let y2 = Fp.cmov(y22, y21, e2); // 31. y2 = CMOV(y22, y21, e2) # If g(x2) is square, this is its sqrt\n tv2 = Fp.sqr(y1); // 32. tv2 = y1^2\n tv2 = Fp.mul(tv2, gxd); // 33. tv2 = tv2 * gxd\n let e3 = Fp.eql(tv2, gx1); // 34. e3 = tv2 == gx1\n let xn = Fp.cmov(x2n, x1n, e3); // 35. xn = CMOV(x2n, x1n, e3) # If e3, x = x1, else x = x2\n let y = Fp.cmov(y2, y1, e3); // 36. y = CMOV(y2, y1, e3) # If e3, y = y1, else y = y2\n let e4 = Fp.isOdd(y); // 37. e4 = sgn0(y) == 1 # Fix sign of y\n y = Fp.cmov(y, Fp.neg(y), e3 !== e4); // 38. y = CMOV(y, -y, e3 XOR e4)\n return { xMn: xn, xMd: xd, yMn: y, yMd: _1n }; // 39. return (xn, xd, y, 1)\n}\nconst ELL2_C1_EDWARDS = /* @__PURE__ */ (() => FpSqrtEven(Fp, Fp.neg(BigInt(486664))))(); // sgn0(c1) MUST equal 0\nfunction map_to_curve_elligator2_edwards25519(u) {\n const { xMn, xMd, yMn, yMd } = map_to_curve_elligator2_curve25519(u); // 1. (xMn, xMd, yMn, yMd) =\n // map_to_curve_elligator2_curve25519(u)\n let xn = Fp.mul(xMn, yMd); // 2. xn = xMn * yMd\n xn = Fp.mul(xn, ELL2_C1_EDWARDS); // 3. xn = xn * c1\n let xd = Fp.mul(xMd, yMn); // 4. xd = xMd * yMn # xn / xd = c1 * xM / yM\n let yn = Fp.sub(xMn, xMd); // 5. yn = xMn - xMd\n let yd = Fp.add(xMn, xMd); // 6. yd = xMn + xMd # (n / d - 1) / (n / d + 1) = (n - d) / (n + d)\n let tv1 = Fp.mul(xd, yd); // 7. tv1 = xd * yd\n let e = Fp.eql(tv1, Fp.ZERO); // 8. e = tv1 == 0\n xn = Fp.cmov(xn, Fp.ZERO, e); // 9. xn = CMOV(xn, 0, e)\n xd = Fp.cmov(xd, Fp.ONE, e); // 10. xd = CMOV(xd, 1, e)\n yn = Fp.cmov(yn, Fp.ONE, e); // 11. yn = CMOV(yn, 1, e)\n yd = Fp.cmov(yd, Fp.ONE, e); // 12. yd = CMOV(yd, 1, e)\n const inv = Fp.invertBatch([xd, yd]); // batch division\n return { x: Fp.mul(xn, inv[0]), y: Fp.mul(yn, inv[1]) }; // 13. return (xn, xd, yn, yd)\n}\nconst htf = /* @__PURE__ */ (() => createHasher(ed25519.ExtendedPoint, (scalars) => map_to_curve_elligator2_edwards25519(scalars[0]), {\n DST: 'edwards25519_XMD:SHA-512_ELL2_RO_',\n encodeDST: 'edwards25519_XMD:SHA-512_ELL2_NU_',\n p: Fp.ORDER,\n m: 1,\n k: 128,\n expand: 'xmd',\n hash: sha512,\n}))();\nexport const hashToCurve = /* @__PURE__ */ (() => htf.hashToCurve)();\nexport const encodeToCurve = /* @__PURE__ */ (() => htf.encodeToCurve)();\nfunction assertRstPoint(other) {\n if (!(other instanceof RistPoint))\n throw new Error('RistrettoPoint expected');\n}\n// √(-1) aka √(a) aka 2^((p-1)/4)\nconst SQRT_M1 = ED25519_SQRT_M1;\n// √(ad - 1)\nconst SQRT_AD_MINUS_ONE = /* @__PURE__ */ BigInt('25063068953384623474111414158702152701244531502492656460079210482610430750235');\n// 1 / √(a-d)\nconst INVSQRT_A_MINUS_D = /* @__PURE__ */ BigInt('54469307008909316920995813868745141605393597292927456921205312896311721017578');\n// 1-d²\nconst ONE_MINUS_D_SQ = /* @__PURE__ */ BigInt('1159843021668779879193775521855586647937357759715417654439879720876111806838');\n// (d-1)²\nconst D_MINUS_ONE_SQ = /* @__PURE__ */ BigInt('40440834346308536858101042469323190826248399146238708352240133220865137265952');\n// Calculates 1/√(number)\nconst invertSqrt = (number) => uvRatio(_1n, number);\nconst MAX_255B = /* @__PURE__ */ BigInt('0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff');\nconst bytes255ToNumberLE = (bytes) => ed25519.CURVE.Fp.create(bytesToNumberLE(bytes) & MAX_255B);\n// Computes Elligator map for Ristretto\n// https://ristretto.group/formulas/elligator.html\nfunction calcElligatorRistrettoMap(r0) {\n const { d } = ed25519.CURVE;\n const P = ed25519.CURVE.Fp.ORDER;\n const mod = ed25519.CURVE.Fp.create;\n const r = mod(SQRT_M1 * r0 * r0); // 1\n const Ns = mod((r + _1n) * ONE_MINUS_D_SQ); // 2\n let c = BigInt(-1); // 3\n const D = mod((c - d * r) * mod(r + d)); // 4\n let { isValid: Ns_D_is_sq, value: s } = uvRatio(Ns, D); // 5\n let s_ = mod(s * r0); // 6\n if (!isNegativeLE(s_, P))\n s_ = mod(-s_);\n if (!Ns_D_is_sq)\n s = s_; // 7\n if (!Ns_D_is_sq)\n c = r; // 8\n const Nt = mod(c * (r - _1n) * D_MINUS_ONE_SQ - D); // 9\n const s2 = s * s;\n const W0 = mod((s + s) * D); // 10\n const W1 = mod(Nt * SQRT_AD_MINUS_ONE); // 11\n const W2 = mod(_1n - s2); // 12\n const W3 = mod(_1n + s2); // 13\n return new ed25519.ExtendedPoint(mod(W0 * W3), mod(W2 * W1), mod(W1 * W3), mod(W0 * W2));\n}\n/**\n * Each ed25519/ExtendedPoint has 8 different equivalent points. This can be\n * a source of bugs for protocols like ring signatures. Ristretto was created to solve this.\n * Ristretto point operates in X:Y:Z:T extended coordinates like ExtendedPoint,\n * but it should work in its own namespace: do not combine those two.\n * https://datatracker.ietf.org/doc/html/draft-irtf-cfrg-ristretto255-decaf448\n */\nclass RistPoint {\n // Private property to discourage combining ExtendedPoint + RistrettoPoint\n // Always use Ristretto encoding/decoding instead.\n constructor(ep) {\n this.ep = ep;\n }\n static fromAffine(ap) {\n return new RistPoint(ed25519.ExtendedPoint.fromAffine(ap));\n }\n /**\n * Takes uniform output of 64-byte hash function like sha512 and converts it to `RistrettoPoint`.\n * The hash-to-group operation applies Elligator twice and adds the results.\n * **Note:** this is one-way map, there is no conversion from point to hash.\n * https://ristretto.group/formulas/elligator.html\n * @param hex 64-byte output of a hash function\n */\n static hashToCurve(hex) {\n hex = ensureBytes('ristrettoHash', hex, 64);\n const r1 = bytes255ToNumberLE(hex.slice(0, 32));\n const R1 = calcElligatorRistrettoMap(r1);\n const r2 = bytes255ToNumberLE(hex.slice(32, 64));\n const R2 = calcElligatorRistrettoMap(r2);\n return new RistPoint(R1.add(R2));\n }\n /**\n * Converts ristretto-encoded string to ristretto point.\n * https://ristretto.group/formulas/decoding.html\n * @param hex Ristretto-encoded 32 bytes. Not every 32-byte string is valid ristretto encoding\n */\n static fromHex(hex) {\n hex = ensureBytes('ristrettoHex', hex, 32);\n const { a, d } = ed25519.CURVE;\n const P = ed25519.CURVE.Fp.ORDER;\n const mod = ed25519.CURVE.Fp.create;\n const emsg = 'RistrettoPoint.fromHex: the hex is not valid encoding of RistrettoPoint';\n const s = bytes255ToNumberLE(hex);\n // 1. Check that s_bytes is the canonical encoding of a field element, or else abort.\n // 3. Check that s is non-negative, or else abort\n if (!equalBytes(numberToBytesLE(s, 32), hex) || isNegativeLE(s, P))\n throw new Error(emsg);\n const s2 = mod(s * s);\n const u1 = mod(_1n + a * s2); // 4 (a is -1)\n const u2 = mod(_1n - a * s2); // 5\n const u1_2 = mod(u1 * u1);\n const u2_2 = mod(u2 * u2);\n const v = mod(a * d * u1_2 - u2_2); // 6\n const { isValid, value: I } = invertSqrt(mod(v * u2_2)); // 7\n const Dx = mod(I * u2); // 8\n const Dy = mod(I * Dx * v); // 9\n let x = mod((s + s) * Dx); // 10\n if (isNegativeLE(x, P))\n x = mod(-x); // 10\n const y = mod(u1 * Dy); // 11\n const t = mod(x * y); // 12\n if (!isValid || isNegativeLE(t, P) || y === _0n)\n throw new Error(emsg);\n return new RistPoint(new ed25519.ExtendedPoint(x, y, _1n, t));\n }\n /**\n * Encodes ristretto point to Uint8Array.\n * https://ristretto.group/formulas/encoding.html\n */\n toRawBytes() {\n let { ex: x, ey: y, ez: z, et: t } = this.ep;\n const P = ed25519.CURVE.Fp.ORDER;\n const mod = ed25519.CURVE.Fp.create;\n const u1 = mod(mod(z + y) * mod(z - y)); // 1\n const u2 = mod(x * y); // 2\n // Square root always exists\n const u2sq = mod(u2 * u2);\n const { value: invsqrt } = invertSqrt(mod(u1 * u2sq)); // 3\n const D1 = mod(invsqrt * u1); // 4\n const D2 = mod(invsqrt * u2); // 5\n const zInv = mod(D1 * D2 * t); // 6\n let D; // 7\n if (isNegativeLE(t * zInv, P)) {\n let _x = mod(y * SQRT_M1);\n let _y = mod(x * SQRT_M1);\n x = _x;\n y = _y;\n D = mod(D1 * INVSQRT_A_MINUS_D);\n }\n else {\n D = D2; // 8\n }\n if (isNegativeLE(x * zInv, P))\n y = mod(-y); // 9\n let s = mod((z - y) * D); // 10 (check footer's note, no sqrt(-a))\n if (isNegativeLE(s, P))\n s = mod(-s);\n return numberToBytesLE(s, 32); // 11\n }\n toHex() {\n return bytesToHex(this.toRawBytes());\n }\n toString() {\n return this.toHex();\n }\n // Compare one point to another.\n equals(other) {\n assertRstPoint(other);\n const { ex: X1, ey: Y1 } = this.ep;\n const { ex: X2, ey: Y2 } = other.ep;\n const mod = ed25519.CURVE.Fp.create;\n // (x1 * y2 == y1 * x2) | (y1 * y2 == x1 * x2)\n const one = mod(X1 * Y2) === mod(Y1 * X2);\n const two = mod(Y1 * Y2) === mod(X1 * X2);\n return one || two;\n }\n add(other) {\n assertRstPoint(other);\n return new RistPoint(this.ep.add(other.ep));\n }\n subtract(other) {\n assertRstPoint(other);\n return new RistPoint(this.ep.subtract(other.ep));\n }\n multiply(scalar) {\n return new RistPoint(this.ep.multiply(scalar));\n }\n multiplyUnsafe(scalar) {\n return new RistPoint(this.ep.multiplyUnsafe(scalar));\n }\n double() {\n return new RistPoint(this.ep.double());\n }\n negate() {\n return new RistPoint(this.ep.negate());\n }\n}\nexport const RistrettoPoint = /* @__PURE__ */ (() => {\n if (!RistPoint.BASE)\n RistPoint.BASE = new RistPoint(ed25519.ExtendedPoint.BASE);\n if (!RistPoint.ZERO)\n RistPoint.ZERO = new RistPoint(ed25519.ExtendedPoint.ZERO);\n return RistPoint;\n})();\n// Hashing to ristretto255. https://www.rfc-editor.org/rfc/rfc9380#appendix-B\nexport const hashToRistretto255 = (msg, options) => {\n const d = options.DST;\n const DST = typeof d === 'string' ? utf8ToBytes(d) : d;\n const uniform_bytes = expand_message_xmd(msg, DST, 64, sha512);\n const P = RistPoint.hashToCurve(uniform_bytes);\n return P;\n};\nexport const hash_to_ristretto255 = hashToRistretto255; // legacy\n//# sourceMappingURL=ed25519.js.map","import { ed25519 as ed } from '@noble/curves/ed25519';\nconst PUBLIC_KEY_BYTE_LENGTH = 32;\nconst PRIVATE_KEY_BYTE_LENGTH = 64; // private key is actually 32 bytes but for historical reasons we concat private and public keys\nconst KEYS_BYTE_LENGTH = 32;\nexport { PUBLIC_KEY_BYTE_LENGTH as publicKeyLength };\nexport { PRIVATE_KEY_BYTE_LENGTH as privateKeyLength };\nexport function generateKey() {\n // the actual private key (32 bytes)\n const privateKeyRaw = ed.utils.randomPrivateKey();\n const publicKey = ed.getPublicKey(privateKeyRaw);\n // concatenated the public key to the private key\n const privateKey = concatKeys(privateKeyRaw, publicKey);\n return {\n privateKey,\n publicKey\n };\n}\n/**\n * Generate keypair from a 32 byte uint8array\n */\nexport function generateKeyFromSeed(seed) {\n if (seed.length !== KEYS_BYTE_LENGTH) {\n throw new TypeError('\"seed\" must be 32 bytes in length.');\n }\n else if (!(seed instanceof Uint8Array)) {\n throw new TypeError('\"seed\" must be a node.js Buffer, or Uint8Array.');\n }\n // based on node forges algorithm, the seed is used directly as private key\n const privateKeyRaw = seed;\n const publicKey = ed.getPublicKey(privateKeyRaw);\n const privateKey = concatKeys(privateKeyRaw, publicKey);\n return {\n privateKey,\n publicKey\n };\n}\nexport function hashAndSign(privateKey, msg) {\n const privateKeyRaw = privateKey.subarray(0, KEYS_BYTE_LENGTH);\n return ed.sign(msg instanceof Uint8Array ? msg : msg.subarray(), privateKeyRaw);\n}\nexport function hashAndVerify(publicKey, sig, msg) {\n return ed.verify(sig, msg instanceof Uint8Array ? msg : msg.subarray(), publicKey);\n}\nfunction concatKeys(privateKeyRaw, publicKey) {\n const privateKey = new Uint8Array(PRIVATE_KEY_BYTE_LENGTH);\n for (let i = 0; i < KEYS_BYTE_LENGTH; i++) {\n privateKey[i] = privateKeyRaw[i];\n privateKey[KEYS_BYTE_LENGTH + i] = publicKey[i];\n }\n return privateKey;\n}\n//# sourceMappingURL=ed25519-browser.js.map","/* eslint-env browser */\n// Check native crypto exists and is enabled (In insecure context `self.crypto`\n// exists but `self.crypto.subtle` does not).\nexport default {\n get(win = globalThis) {\n const nativeCrypto = win.crypto;\n if (nativeCrypto?.subtle == null) {\n throw Object.assign(new Error('Missing Web Crypto API. ' +\n 'The most likely cause of this error is that this page is being accessed ' +\n 'from an insecure context (i.e. not HTTPS). For more information and ' +\n 'possible resolutions see ' +\n 'https://github.com/libp2p/js-libp2p/blob/main/packages/crypto/README.md#web-crypto-api'), { code: 'ERR_MISSING_WEB_CRYPTO' });\n }\n return nativeCrypto;\n }\n};\n//# sourceMappingURL=webcrypto-browser.js.map","import { concat } from 'uint8arrays/concat';\nimport { fromString } from 'uint8arrays/from-string';\nimport webcrypto from '../webcrypto.js';\n// WebKit on Linux does not support deriving a key from an empty PBKDF2 key.\n// So, as a workaround, we provide the generated key as a constant. We test that\n// this generated key is accurate in test/workaround.spec.ts\n// Generated via:\n// await crypto.subtle.exportKey('jwk',\n// await crypto.subtle.deriveKey(\n// { name: 'PBKDF2', salt: new Uint8Array(16), iterations: 32767, hash: { name: 'SHA-256' } },\n// await crypto.subtle.importKey('raw', new Uint8Array(0), { name: 'PBKDF2' }, false, ['deriveKey']),\n// { name: 'AES-GCM', length: 128 }, true, ['encrypt', 'decrypt'])\n// )\nexport const derivedEmptyPasswordKey = { alg: 'A128GCM', ext: true, k: 'scm9jmO_4BJAgdwWGVulLg', key_ops: ['encrypt', 'decrypt'], kty: 'oct' };\n// Based off of code from https://github.com/luke-park/SecureCompatibleEncryptionExamples\nexport function create(opts) {\n const algorithm = opts?.algorithm ?? 'AES-GCM';\n let keyLength = opts?.keyLength ?? 16;\n const nonceLength = opts?.nonceLength ?? 12;\n const digest = opts?.digest ?? 'SHA-256';\n const saltLength = opts?.saltLength ?? 16;\n const iterations = opts?.iterations ?? 32767;\n const crypto = webcrypto.get();\n keyLength *= 8; // Browser crypto uses bits instead of bytes\n /**\n * Uses the provided password to derive a pbkdf2 key. The key\n * will then be used to encrypt the data.\n */\n async function encrypt(data, password) {\n const salt = crypto.getRandomValues(new Uint8Array(saltLength));\n const nonce = crypto.getRandomValues(new Uint8Array(nonceLength));\n const aesGcm = { name: algorithm, iv: nonce };\n if (typeof password === 'string') {\n password = fromString(password);\n }\n let cryptoKey;\n if (password.length === 0) {\n cryptoKey = await crypto.subtle.importKey('jwk', derivedEmptyPasswordKey, { name: 'AES-GCM' }, true, ['encrypt']);\n try {\n const deriveParams = { name: 'PBKDF2', salt, iterations, hash: { name: digest } };\n const runtimeDerivedEmptyPassword = await crypto.subtle.importKey('raw', password, { name: 'PBKDF2' }, false, ['deriveKey']);\n cryptoKey = await crypto.subtle.deriveKey(deriveParams, runtimeDerivedEmptyPassword, { name: algorithm, length: keyLength }, true, ['encrypt']);\n }\n catch {\n cryptoKey = await crypto.subtle.importKey('jwk', derivedEmptyPasswordKey, { name: 'AES-GCM' }, true, ['encrypt']);\n }\n }\n else {\n // Derive a key using PBKDF2.\n const deriveParams = { name: 'PBKDF2', salt, iterations, hash: { name: digest } };\n const rawKey = await crypto.subtle.importKey('raw', password, { name: 'PBKDF2' }, false, ['deriveKey']);\n cryptoKey = await crypto.subtle.deriveKey(deriveParams, rawKey, { name: algorithm, length: keyLength }, true, ['encrypt']);\n }\n // Encrypt the string.\n const ciphertext = await crypto.subtle.encrypt(aesGcm, cryptoKey, data);\n return concat([salt, aesGcm.iv, new Uint8Array(ciphertext)]);\n }\n /**\n * Uses the provided password to derive a pbkdf2 key. The key\n * will then be used to decrypt the data. The options used to create\n * this decryption cipher must be the same as those used to create\n * the encryption cipher.\n */\n async function decrypt(data, password) {\n const salt = data.subarray(0, saltLength);\n const nonce = data.subarray(saltLength, saltLength + nonceLength);\n const ciphertext = data.subarray(saltLength + nonceLength);\n const aesGcm = { name: algorithm, iv: nonce };\n if (typeof password === 'string') {\n password = fromString(password);\n }\n let cryptoKey;\n if (password.length === 0) {\n try {\n const deriveParams = { name: 'PBKDF2', salt, iterations, hash: { name: digest } };\n const runtimeDerivedEmptyPassword = await crypto.subtle.importKey('raw', password, { name: 'PBKDF2' }, false, ['deriveKey']);\n cryptoKey = await crypto.subtle.deriveKey(deriveParams, runtimeDerivedEmptyPassword, { name: algorithm, length: keyLength }, true, ['decrypt']);\n }\n catch {\n cryptoKey = await crypto.subtle.importKey('jwk', derivedEmptyPasswordKey, { name: 'AES-GCM' }, true, ['decrypt']);\n }\n }\n else {\n // Derive the key using PBKDF2.\n const deriveParams = { name: 'PBKDF2', salt, iterations, hash: { name: digest } };\n const rawKey = await crypto.subtle.importKey('raw', password, { name: 'PBKDF2' }, false, ['deriveKey']);\n cryptoKey = await crypto.subtle.deriveKey(deriveParams, rawKey, { name: algorithm, length: keyLength }, true, ['decrypt']);\n }\n // Decrypt the string.\n const plaintext = await crypto.subtle.decrypt(aesGcm, cryptoKey, ciphertext);\n return new Uint8Array(plaintext);\n }\n const cipher = {\n encrypt,\n decrypt\n };\n return cipher;\n}\n//# sourceMappingURL=aes-gcm.browser.js.map","import { base64 } from 'multiformats/bases/base64';\nimport * as ciphers from '../ciphers/aes-gcm.js';\n/**\n * Exports the given PrivateKey as a base64 encoded string.\n * The PrivateKey is encrypted via a password derived PBKDF2 key\n * leveraging the aes-gcm cipher algorithm.\n */\nexport async function exporter(privateKey, password) {\n const cipher = ciphers.create();\n const encryptedKey = await cipher.encrypt(privateKey, password);\n return base64.encode(encryptedKey);\n}\n//# sourceMappingURL=exporter.js.map","/* eslint-disable import/export */\n/* eslint-disable complexity */\n/* eslint-disable @typescript-eslint/no-namespace */\n/* eslint-disable @typescript-eslint/no-unnecessary-boolean-literal-compare */\n/* eslint-disable @typescript-eslint/no-empty-interface */\nimport { enumeration, encodeMessage, decodeMessage, message } from 'protons-runtime';\nexport var KeyType;\n(function (KeyType) {\n KeyType[\"RSA\"] = \"RSA\";\n KeyType[\"Ed25519\"] = \"Ed25519\";\n KeyType[\"Secp256k1\"] = \"Secp256k1\";\n})(KeyType || (KeyType = {}));\nvar __KeyTypeValues;\n(function (__KeyTypeValues) {\n __KeyTypeValues[__KeyTypeValues[\"RSA\"] = 0] = \"RSA\";\n __KeyTypeValues[__KeyTypeValues[\"Ed25519\"] = 1] = \"Ed25519\";\n __KeyTypeValues[__KeyTypeValues[\"Secp256k1\"] = 2] = \"Secp256k1\";\n})(__KeyTypeValues || (__KeyTypeValues = {}));\n(function (KeyType) {\n KeyType.codec = () => {\n return enumeration(__KeyTypeValues);\n };\n})(KeyType || (KeyType = {}));\nexport var PublicKey;\n(function (PublicKey) {\n let _codec;\n PublicKey.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if (obj.Type != null) {\n w.uint32(8);\n KeyType.codec().encode(obj.Type, w);\n }\n if (obj.Data != null) {\n w.uint32(18);\n w.bytes(obj.Data);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length) => {\n const obj = {};\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1:\n obj.Type = KeyType.codec().decode(reader);\n break;\n case 2:\n obj.Data = reader.bytes();\n break;\n default:\n reader.skipType(tag & 7);\n break;\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n PublicKey.encode = (obj) => {\n return encodeMessage(obj, PublicKey.codec());\n };\n PublicKey.decode = (buf) => {\n return decodeMessage(buf, PublicKey.codec());\n };\n})(PublicKey || (PublicKey = {}));\nexport var PrivateKey;\n(function (PrivateKey) {\n let _codec;\n PrivateKey.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if (obj.Type != null) {\n w.uint32(8);\n KeyType.codec().encode(obj.Type, w);\n }\n if (obj.Data != null) {\n w.uint32(18);\n w.bytes(obj.Data);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length) => {\n const obj = {};\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1:\n obj.Type = KeyType.codec().decode(reader);\n break;\n case 2:\n obj.Data = reader.bytes();\n break;\n default:\n reader.skipType(tag & 7);\n break;\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n PrivateKey.encode = (obj) => {\n return encodeMessage(obj, PrivateKey.codec());\n };\n PrivateKey.decode = (buf) => {\n return decodeMessage(buf, PrivateKey.codec());\n };\n})(PrivateKey || (PrivateKey = {}));\n//# sourceMappingURL=keys.js.map","import { CodeError } from '@libp2p/interface';\nimport { base58btc } from 'multiformats/bases/base58';\nimport { identity } from 'multiformats/hashes/identity';\nimport { sha256 } from 'multiformats/hashes/sha2';\nimport { equals as uint8ArrayEquals } from 'uint8arrays/equals';\nimport { isPromise } from '../util.js';\nimport * as crypto from './ed25519.js';\nimport { exporter } from './exporter.js';\nimport * as pbm from './keys.js';\nexport class Ed25519PublicKey {\n _key;\n constructor(key) {\n this._key = ensureKey(key, crypto.publicKeyLength);\n }\n verify(data, sig) {\n return crypto.hashAndVerify(this._key, sig, data);\n }\n marshal() {\n return this._key;\n }\n get bytes() {\n return pbm.PublicKey.encode({\n Type: pbm.KeyType.Ed25519,\n Data: this.marshal()\n }).subarray();\n }\n equals(key) {\n return uint8ArrayEquals(this.bytes, key.bytes);\n }\n hash() {\n const p = sha256.digest(this.bytes);\n if (isPromise(p)) {\n return p.then(({ bytes }) => bytes);\n }\n return p.bytes;\n }\n}\nexport class Ed25519PrivateKey {\n _key;\n _publicKey;\n // key - 64 byte Uint8Array containing private key\n // publicKey - 32 byte Uint8Array containing public key\n constructor(key, publicKey) {\n this._key = ensureKey(key, crypto.privateKeyLength);\n this._publicKey = ensureKey(publicKey, crypto.publicKeyLength);\n }\n sign(message) {\n return crypto.hashAndSign(this._key, message);\n }\n get public() {\n return new Ed25519PublicKey(this._publicKey);\n }\n marshal() {\n return this._key;\n }\n get bytes() {\n return pbm.PrivateKey.encode({\n Type: pbm.KeyType.Ed25519,\n Data: this.marshal()\n }).subarray();\n }\n equals(key) {\n return uint8ArrayEquals(this.bytes, key.bytes);\n }\n async hash() {\n const p = sha256.digest(this.bytes);\n let bytes;\n if (isPromise(p)) {\n ({ bytes } = await p);\n }\n else {\n bytes = p.bytes;\n }\n return bytes;\n }\n /**\n * Gets the ID of the key.\n *\n * The key id is the base58 encoding of the identity multihash containing its public key.\n * The public key is a protobuf encoding containing a type and the DER encoding\n * of the PKCS SubjectPublicKeyInfo.\n *\n * @returns {Promise}\n */\n async id() {\n const encoding = identity.digest(this.public.bytes);\n return base58btc.encode(encoding.bytes).substring(1);\n }\n /**\n * Exports the key into a password protected `format`\n */\n async export(password, format = 'libp2p-key') {\n if (format === 'libp2p-key') {\n return exporter(this.bytes, password);\n }\n else {\n throw new CodeError(`export format '${format}' is not supported`, 'ERR_INVALID_EXPORT_FORMAT');\n }\n }\n}\nexport function unmarshalEd25519PrivateKey(bytes) {\n // Try the old, redundant public key version\n if (bytes.length > crypto.privateKeyLength) {\n bytes = ensureKey(bytes, crypto.privateKeyLength + crypto.publicKeyLength);\n const privateKeyBytes = bytes.subarray(0, crypto.privateKeyLength);\n const publicKeyBytes = bytes.subarray(crypto.privateKeyLength, bytes.length);\n return new Ed25519PrivateKey(privateKeyBytes, publicKeyBytes);\n }\n bytes = ensureKey(bytes, crypto.privateKeyLength);\n const privateKeyBytes = bytes.subarray(0, crypto.privateKeyLength);\n const publicKeyBytes = bytes.subarray(crypto.publicKeyLength);\n return new Ed25519PrivateKey(privateKeyBytes, publicKeyBytes);\n}\nexport function unmarshalEd25519PublicKey(bytes) {\n bytes = ensureKey(bytes, crypto.publicKeyLength);\n return new Ed25519PublicKey(bytes);\n}\nexport async function generateKeyPair() {\n const { privateKey, publicKey } = crypto.generateKey();\n return new Ed25519PrivateKey(privateKey, publicKey);\n}\nexport async function generateKeyPairFromSeed(seed) {\n const { privateKey, publicKey } = crypto.generateKeyFromSeed(seed);\n return new Ed25519PrivateKey(privateKey, publicKey);\n}\nfunction ensureKey(key, length) {\n key = Uint8Array.from(key ?? []);\n if (key.length !== length) {\n throw new CodeError(`Key must be a Uint8Array of length ${length}, got ${key.length}`, 'ERR_INVALID_KEY_TYPE');\n }\n return key;\n}\n//# sourceMappingURL=ed25519-class.js.map","import { CodeError } from '@libp2p/interface';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport randomBytes from '../random-bytes.js';\nimport webcrypto from '../webcrypto.js';\nimport * as utils from './rsa-utils.js';\nexport { utils };\nexport async function generateKey(bits) {\n const pair = await webcrypto.get().subtle.generateKey({\n name: 'RSASSA-PKCS1-v1_5',\n modulusLength: bits,\n publicExponent: new Uint8Array([0x01, 0x00, 0x01]),\n hash: { name: 'SHA-256' }\n }, true, ['sign', 'verify']);\n const keys = await exportKey(pair);\n return {\n privateKey: keys[0],\n publicKey: keys[1]\n };\n}\n// Takes a jwk key\nexport async function unmarshalPrivateKey(key) {\n const privateKey = await webcrypto.get().subtle.importKey('jwk', key, {\n name: 'RSASSA-PKCS1-v1_5',\n hash: { name: 'SHA-256' }\n }, true, ['sign']);\n const pair = [\n privateKey,\n await derivePublicFromPrivate(key)\n ];\n const keys = await exportKey({\n privateKey: pair[0],\n publicKey: pair[1]\n });\n return {\n privateKey: keys[0],\n publicKey: keys[1]\n };\n}\nexport { randomBytes as getRandomValues };\nexport async function hashAndSign(key, msg) {\n const privateKey = await webcrypto.get().subtle.importKey('jwk', key, {\n name: 'RSASSA-PKCS1-v1_5',\n hash: { name: 'SHA-256' }\n }, false, ['sign']);\n const sig = await webcrypto.get().subtle.sign({ name: 'RSASSA-PKCS1-v1_5' }, privateKey, msg instanceof Uint8Array ? msg : msg.subarray());\n return new Uint8Array(sig, 0, sig.byteLength);\n}\nexport async function hashAndVerify(key, sig, msg) {\n const publicKey = await webcrypto.get().subtle.importKey('jwk', key, {\n name: 'RSASSA-PKCS1-v1_5',\n hash: { name: 'SHA-256' }\n }, false, ['verify']);\n return webcrypto.get().subtle.verify({ name: 'RSASSA-PKCS1-v1_5' }, publicKey, sig, msg instanceof Uint8Array ? msg : msg.subarray());\n}\nasync function exportKey(pair) {\n if (pair.privateKey == null || pair.publicKey == null) {\n throw new CodeError('Private and public key are required', 'ERR_INVALID_PARAMETERS');\n }\n return Promise.all([\n webcrypto.get().subtle.exportKey('jwk', pair.privateKey),\n webcrypto.get().subtle.exportKey('jwk', pair.publicKey)\n ]);\n}\nasync function derivePublicFromPrivate(jwKey) {\n return webcrypto.get().subtle.importKey('jwk', {\n kty: jwKey.kty,\n n: jwKey.n,\n e: jwKey.e\n }, {\n name: 'RSASSA-PKCS1-v1_5',\n hash: { name: 'SHA-256' }\n }, true, ['verify']);\n}\nexport function keySize(jwk) {\n if (jwk.kty !== 'RSA') {\n throw new CodeError('invalid key type', 'ERR_INVALID_KEY_TYPE');\n }\n else if (jwk.n == null) {\n throw new CodeError('invalid key modulus', 'ERR_INVALID_KEY_MODULUS');\n }\n const bytes = uint8ArrayFromString(jwk.n, 'base64url');\n return bytes.length * 8;\n}\n//# sourceMappingURL=rsa-browser.js.map","import { hash as assertHash, bytes as assertBytes, exists as assertExists } from './_assert.js';\nimport { Hash, toBytes } from './utils.js';\n// HMAC (RFC 2104)\nexport class HMAC extends Hash {\n constructor(hash, _key) {\n super();\n this.finished = false;\n this.destroyed = false;\n assertHash(hash);\n const key = toBytes(_key);\n this.iHash = hash.create();\n if (typeof this.iHash.update !== 'function')\n throw new Error('Expected instance of class which extends utils.Hash');\n this.blockLen = this.iHash.blockLen;\n this.outputLen = this.iHash.outputLen;\n const blockLen = this.blockLen;\n const pad = new Uint8Array(blockLen);\n // blockLen can be bigger than outputLen\n pad.set(key.length > blockLen ? hash.create().update(key).digest() : key);\n for (let i = 0; i < pad.length; i++)\n pad[i] ^= 0x36;\n this.iHash.update(pad);\n // By doing update (processing of first block) of outer hash here we can re-use it between multiple calls via clone\n this.oHash = hash.create();\n // Undo internal XOR && apply outer XOR\n for (let i = 0; i < pad.length; i++)\n pad[i] ^= 0x36 ^ 0x5c;\n this.oHash.update(pad);\n pad.fill(0);\n }\n update(buf) {\n assertExists(this);\n this.iHash.update(buf);\n return this;\n }\n digestInto(out) {\n assertExists(this);\n assertBytes(out, this.outputLen);\n this.finished = true;\n this.iHash.digestInto(out);\n this.oHash.update(out);\n this.oHash.digestInto(out);\n this.destroy();\n }\n digest() {\n const out = new Uint8Array(this.oHash.outputLen);\n this.digestInto(out);\n return out;\n }\n _cloneInto(to) {\n // Create new instance without calling constructor since key already in state and we don't know it.\n to || (to = Object.create(Object.getPrototypeOf(this), {}));\n const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;\n to = to;\n to.finished = finished;\n to.destroyed = destroyed;\n to.blockLen = blockLen;\n to.outputLen = outputLen;\n to.oHash = oHash._cloneInto(to.oHash);\n to.iHash = iHash._cloneInto(to.iHash);\n return to;\n }\n destroy() {\n this.destroyed = true;\n this.oHash.destroy();\n this.iHash.destroy();\n }\n}\n/**\n * HMAC: RFC2104 message authentication code.\n * @param hash - function that would be used e.g. sha256\n * @param key - message key\n * @param message - message data\n */\nexport const hmac = (hash, key, message) => new HMAC(hash, key).update(message).digest();\nhmac.create = (hash, key) => new HMAC(hash, key);\n//# sourceMappingURL=hmac.js.map","/*!\n Copyright (c) Peculiar Ventures, LLC\n*/\n\nfunction getUTCDate(date) {\r\n return new Date(date.getTime() + (date.getTimezoneOffset() * 60000));\r\n}\r\nfunction getParametersValue(parameters, name, defaultValue) {\r\n var _a;\r\n if ((parameters instanceof Object) === false) {\r\n return defaultValue;\r\n }\r\n return (_a = parameters[name]) !== null && _a !== void 0 ? _a : defaultValue;\r\n}\r\nfunction bufferToHexCodes(inputBuffer, inputOffset = 0, inputLength = (inputBuffer.byteLength - inputOffset), insertSpace = false) {\r\n let result = \"\";\r\n for (const item of (new Uint8Array(inputBuffer, inputOffset, inputLength))) {\r\n const str = item.toString(16).toUpperCase();\r\n if (str.length === 1) {\r\n result += \"0\";\r\n }\r\n result += str;\r\n if (insertSpace) {\r\n result += \" \";\r\n }\r\n }\r\n return result.trim();\r\n}\r\nfunction checkBufferParams(baseBlock, inputBuffer, inputOffset, inputLength) {\r\n if (!(inputBuffer instanceof ArrayBuffer)) {\r\n baseBlock.error = \"Wrong parameter: inputBuffer must be \\\"ArrayBuffer\\\"\";\r\n return false;\r\n }\r\n if (!inputBuffer.byteLength) {\r\n baseBlock.error = \"Wrong parameter: inputBuffer has zero length\";\r\n return false;\r\n }\r\n if (inputOffset < 0) {\r\n baseBlock.error = \"Wrong parameter: inputOffset less than zero\";\r\n return false;\r\n }\r\n if (inputLength < 0) {\r\n baseBlock.error = \"Wrong parameter: inputLength less than zero\";\r\n return false;\r\n }\r\n if ((inputBuffer.byteLength - inputOffset - inputLength) < 0) {\r\n baseBlock.error = \"End of input reached before message was fully decoded (inconsistent offset and length values)\";\r\n return false;\r\n }\r\n return true;\r\n}\r\nfunction utilFromBase(inputBuffer, inputBase) {\r\n let result = 0;\r\n if (inputBuffer.length === 1) {\r\n return inputBuffer[0];\r\n }\r\n for (let i = (inputBuffer.length - 1); i >= 0; i--) {\r\n result += inputBuffer[(inputBuffer.length - 1) - i] * Math.pow(2, inputBase * i);\r\n }\r\n return result;\r\n}\r\nfunction utilToBase(value, base, reserved = (-1)) {\r\n const internalReserved = reserved;\r\n let internalValue = value;\r\n let result = 0;\r\n let biggest = Math.pow(2, base);\r\n for (let i = 1; i < 8; i++) {\r\n if (value < biggest) {\r\n let retBuf;\r\n if (internalReserved < 0) {\r\n retBuf = new ArrayBuffer(i);\r\n result = i;\r\n }\r\n else {\r\n if (internalReserved < i) {\r\n return (new ArrayBuffer(0));\r\n }\r\n retBuf = new ArrayBuffer(internalReserved);\r\n result = internalReserved;\r\n }\r\n const retView = new Uint8Array(retBuf);\r\n for (let j = (i - 1); j >= 0; j--) {\r\n const basis = Math.pow(2, j * base);\r\n retView[result - j - 1] = Math.floor(internalValue / basis);\r\n internalValue -= (retView[result - j - 1]) * basis;\r\n }\r\n return retBuf;\r\n }\r\n biggest *= Math.pow(2, base);\r\n }\r\n return new ArrayBuffer(0);\r\n}\r\nfunction utilConcatBuf(...buffers) {\r\n let outputLength = 0;\r\n let prevLength = 0;\r\n for (const buffer of buffers) {\r\n outputLength += buffer.byteLength;\r\n }\r\n const retBuf = new ArrayBuffer(outputLength);\r\n const retView = new Uint8Array(retBuf);\r\n for (const buffer of buffers) {\r\n retView.set(new Uint8Array(buffer), prevLength);\r\n prevLength += buffer.byteLength;\r\n }\r\n return retBuf;\r\n}\r\nfunction utilConcatView(...views) {\r\n let outputLength = 0;\r\n let prevLength = 0;\r\n for (const view of views) {\r\n outputLength += view.length;\r\n }\r\n const retBuf = new ArrayBuffer(outputLength);\r\n const retView = new Uint8Array(retBuf);\r\n for (const view of views) {\r\n retView.set(view, prevLength);\r\n prevLength += view.length;\r\n }\r\n return retView;\r\n}\r\nfunction utilDecodeTC() {\r\n const buf = new Uint8Array(this.valueHex);\r\n if (this.valueHex.byteLength >= 2) {\r\n const condition1 = (buf[0] === 0xFF) && (buf[1] & 0x80);\r\n const condition2 = (buf[0] === 0x00) && ((buf[1] & 0x80) === 0x00);\r\n if (condition1 || condition2) {\r\n this.warnings.push(\"Needlessly long format\");\r\n }\r\n }\r\n const bigIntBuffer = new ArrayBuffer(this.valueHex.byteLength);\r\n const bigIntView = new Uint8Array(bigIntBuffer);\r\n for (let i = 0; i < this.valueHex.byteLength; i++) {\r\n bigIntView[i] = 0;\r\n }\r\n bigIntView[0] = (buf[0] & 0x80);\r\n const bigInt = utilFromBase(bigIntView, 8);\r\n const smallIntBuffer = new ArrayBuffer(this.valueHex.byteLength);\r\n const smallIntView = new Uint8Array(smallIntBuffer);\r\n for (let j = 0; j < this.valueHex.byteLength; j++) {\r\n smallIntView[j] = buf[j];\r\n }\r\n smallIntView[0] &= 0x7F;\r\n const smallInt = utilFromBase(smallIntView, 8);\r\n return (smallInt - bigInt);\r\n}\r\nfunction utilEncodeTC(value) {\r\n const modValue = (value < 0) ? (value * (-1)) : value;\r\n let bigInt = 128;\r\n for (let i = 1; i < 8; i++) {\r\n if (modValue <= bigInt) {\r\n if (value < 0) {\r\n const smallInt = bigInt - modValue;\r\n const retBuf = utilToBase(smallInt, 8, i);\r\n const retView = new Uint8Array(retBuf);\r\n retView[0] |= 0x80;\r\n return retBuf;\r\n }\r\n let retBuf = utilToBase(modValue, 8, i);\r\n let retView = new Uint8Array(retBuf);\r\n if (retView[0] & 0x80) {\r\n const tempBuf = retBuf.slice(0);\r\n const tempView = new Uint8Array(tempBuf);\r\n retBuf = new ArrayBuffer(retBuf.byteLength + 1);\r\n retView = new Uint8Array(retBuf);\r\n for (let k = 0; k < tempBuf.byteLength; k++) {\r\n retView[k + 1] = tempView[k];\r\n }\r\n retView[0] = 0x00;\r\n }\r\n return retBuf;\r\n }\r\n bigInt *= Math.pow(2, 8);\r\n }\r\n return (new ArrayBuffer(0));\r\n}\r\nfunction isEqualBuffer(inputBuffer1, inputBuffer2) {\r\n if (inputBuffer1.byteLength !== inputBuffer2.byteLength) {\r\n return false;\r\n }\r\n const view1 = new Uint8Array(inputBuffer1);\r\n const view2 = new Uint8Array(inputBuffer2);\r\n for (let i = 0; i < view1.length; i++) {\r\n if (view1[i] !== view2[i]) {\r\n return false;\r\n }\r\n }\r\n return true;\r\n}\r\nfunction padNumber(inputNumber, fullLength) {\r\n const str = inputNumber.toString(10);\r\n if (fullLength < str.length) {\r\n return \"\";\r\n }\r\n const dif = fullLength - str.length;\r\n const padding = new Array(dif);\r\n for (let i = 0; i < dif; i++) {\r\n padding[i] = \"0\";\r\n }\r\n const paddingString = padding.join(\"\");\r\n return paddingString.concat(str);\r\n}\r\nconst base64Template = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=\";\r\nconst base64UrlTemplate = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_=\";\r\nfunction toBase64(input, useUrlTemplate = false, skipPadding = false, skipLeadingZeros = false) {\r\n let i = 0;\r\n let flag1 = 0;\r\n let flag2 = 0;\r\n let output = \"\";\r\n const template = (useUrlTemplate) ? base64UrlTemplate : base64Template;\r\n if (skipLeadingZeros) {\r\n let nonZeroPosition = 0;\r\n for (let i = 0; i < input.length; i++) {\r\n if (input.charCodeAt(i) !== 0) {\r\n nonZeroPosition = i;\r\n break;\r\n }\r\n }\r\n input = input.slice(nonZeroPosition);\r\n }\r\n while (i < input.length) {\r\n const chr1 = input.charCodeAt(i++);\r\n if (i >= input.length) {\r\n flag1 = 1;\r\n }\r\n const chr2 = input.charCodeAt(i++);\r\n if (i >= input.length) {\r\n flag2 = 1;\r\n }\r\n const chr3 = input.charCodeAt(i++);\r\n const enc1 = chr1 >> 2;\r\n const enc2 = ((chr1 & 0x03) << 4) | (chr2 >> 4);\r\n let enc3 = ((chr2 & 0x0F) << 2) | (chr3 >> 6);\r\n let enc4 = chr3 & 0x3F;\r\n if (flag1 === 1) {\r\n enc3 = enc4 = 64;\r\n }\r\n else {\r\n if (flag2 === 1) {\r\n enc4 = 64;\r\n }\r\n }\r\n if (skipPadding) {\r\n if (enc3 === 64) {\r\n output += `${template.charAt(enc1)}${template.charAt(enc2)}`;\r\n }\r\n else {\r\n if (enc4 === 64) {\r\n output += `${template.charAt(enc1)}${template.charAt(enc2)}${template.charAt(enc3)}`;\r\n }\r\n else {\r\n output += `${template.charAt(enc1)}${template.charAt(enc2)}${template.charAt(enc3)}${template.charAt(enc4)}`;\r\n }\r\n }\r\n }\r\n else {\r\n output += `${template.charAt(enc1)}${template.charAt(enc2)}${template.charAt(enc3)}${template.charAt(enc4)}`;\r\n }\r\n }\r\n return output;\r\n}\r\nfunction fromBase64(input, useUrlTemplate = false, cutTailZeros = false) {\r\n const template = (useUrlTemplate) ? base64UrlTemplate : base64Template;\r\n function indexOf(toSearch) {\r\n for (let i = 0; i < 64; i++) {\r\n if (template.charAt(i) === toSearch)\r\n return i;\r\n }\r\n return 64;\r\n }\r\n function test(incoming) {\r\n return ((incoming === 64) ? 0x00 : incoming);\r\n }\r\n let i = 0;\r\n let output = \"\";\r\n while (i < input.length) {\r\n const enc1 = indexOf(input.charAt(i++));\r\n const enc2 = (i >= input.length) ? 0x00 : indexOf(input.charAt(i++));\r\n const enc3 = (i >= input.length) ? 0x00 : indexOf(input.charAt(i++));\r\n const enc4 = (i >= input.length) ? 0x00 : indexOf(input.charAt(i++));\r\n const chr1 = (test(enc1) << 2) | (test(enc2) >> 4);\r\n const chr2 = ((test(enc2) & 0x0F) << 4) | (test(enc3) >> 2);\r\n const chr3 = ((test(enc3) & 0x03) << 6) | test(enc4);\r\n output += String.fromCharCode(chr1);\r\n if (enc3 !== 64) {\r\n output += String.fromCharCode(chr2);\r\n }\r\n if (enc4 !== 64) {\r\n output += String.fromCharCode(chr3);\r\n }\r\n }\r\n if (cutTailZeros) {\r\n const outputLength = output.length;\r\n let nonZeroStart = (-1);\r\n for (let i = (outputLength - 1); i >= 0; i--) {\r\n if (output.charCodeAt(i) !== 0) {\r\n nonZeroStart = i;\r\n break;\r\n }\r\n }\r\n if (nonZeroStart !== (-1)) {\r\n output = output.slice(0, nonZeroStart + 1);\r\n }\r\n else {\r\n output = \"\";\r\n }\r\n }\r\n return output;\r\n}\r\nfunction arrayBufferToString(buffer) {\r\n let resultString = \"\";\r\n const view = new Uint8Array(buffer);\r\n for (const element of view) {\r\n resultString += String.fromCharCode(element);\r\n }\r\n return resultString;\r\n}\r\nfunction stringToArrayBuffer(str) {\r\n const stringLength = str.length;\r\n const resultBuffer = new ArrayBuffer(stringLength);\r\n const resultView = new Uint8Array(resultBuffer);\r\n for (let i = 0; i < stringLength; i++) {\r\n resultView[i] = str.charCodeAt(i);\r\n }\r\n return resultBuffer;\r\n}\r\nconst log2 = Math.log(2);\r\nfunction nearestPowerOf2(length) {\r\n const base = (Math.log(length) / log2);\r\n const floor = Math.floor(base);\r\n const round = Math.round(base);\r\n return ((floor === round) ? floor : round);\r\n}\r\nfunction clearProps(object, propsArray) {\r\n for (const prop of propsArray) {\r\n delete object[prop];\r\n }\r\n}\n\nexport { arrayBufferToString, bufferToHexCodes, checkBufferParams, clearProps, fromBase64, getParametersValue, getUTCDate, isEqualBuffer, nearestPowerOf2, padNumber, stringToArrayBuffer, toBase64, utilConcatBuf, utilConcatView, utilDecodeTC, utilEncodeTC, utilFromBase, utilToBase };\n","/*!\n * Copyright (c) 2014, GMO GlobalSign\n * Copyright (c) 2015-2022, Peculiar Ventures\n * All rights reserved.\n * \n * Author 2014-2019, Yury Strozhevsky\n * \n * Redistribution and use in source and binary forms, with or without modification,\n * are permitted provided that the following conditions are met:\n * \n * * Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n * \n * * Redistributions in binary form must reproduce the above copyright notice, this\n * list of conditions and the following disclaimer in the documentation and/or\n * other materials provided with the distribution.\n * \n * * Neither the name of the copyright holder nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n * \n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON\n * ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n * \n */\n\nimport * as pvtsutils from 'pvtsutils';\nimport * as pvutils from 'pvutils';\n\nfunction assertBigInt() {\r\n if (typeof BigInt === \"undefined\") {\r\n throw new Error(\"BigInt is not defined. Your environment doesn't implement BigInt.\");\r\n }\r\n}\r\nfunction concat(buffers) {\r\n let outputLength = 0;\r\n let prevLength = 0;\r\n for (let i = 0; i < buffers.length; i++) {\r\n const buffer = buffers[i];\r\n outputLength += buffer.byteLength;\r\n }\r\n const retView = new Uint8Array(outputLength);\r\n for (let i = 0; i < buffers.length; i++) {\r\n const buffer = buffers[i];\r\n retView.set(new Uint8Array(buffer), prevLength);\r\n prevLength += buffer.byteLength;\r\n }\r\n return retView.buffer;\r\n}\r\nfunction checkBufferParams(baseBlock, inputBuffer, inputOffset, inputLength) {\r\n if (!(inputBuffer instanceof Uint8Array)) {\r\n baseBlock.error = \"Wrong parameter: inputBuffer must be 'Uint8Array'\";\r\n return false;\r\n }\r\n if (!inputBuffer.byteLength) {\r\n baseBlock.error = \"Wrong parameter: inputBuffer has zero length\";\r\n return false;\r\n }\r\n if (inputOffset < 0) {\r\n baseBlock.error = \"Wrong parameter: inputOffset less than zero\";\r\n return false;\r\n }\r\n if (inputLength < 0) {\r\n baseBlock.error = \"Wrong parameter: inputLength less than zero\";\r\n return false;\r\n }\r\n if ((inputBuffer.byteLength - inputOffset - inputLength) < 0) {\r\n baseBlock.error = \"End of input reached before message was fully decoded (inconsistent offset and length values)\";\r\n return false;\r\n }\r\n return true;\r\n}\n\nclass ViewWriter {\r\n constructor() {\r\n this.items = [];\r\n }\r\n write(buf) {\r\n this.items.push(buf);\r\n }\r\n final() {\r\n return concat(this.items);\r\n }\r\n}\n\nconst powers2 = [new Uint8Array([1])];\r\nconst digitsString = \"0123456789\";\r\nconst NAME = \"name\";\r\nconst VALUE_HEX_VIEW = \"valueHexView\";\r\nconst IS_HEX_ONLY = \"isHexOnly\";\r\nconst ID_BLOCK = \"idBlock\";\r\nconst TAG_CLASS = \"tagClass\";\r\nconst TAG_NUMBER = \"tagNumber\";\r\nconst IS_CONSTRUCTED = \"isConstructed\";\r\nconst FROM_BER = \"fromBER\";\r\nconst TO_BER = \"toBER\";\r\nconst LOCAL = \"local\";\r\nconst EMPTY_STRING = \"\";\r\nconst EMPTY_BUFFER = new ArrayBuffer(0);\r\nconst EMPTY_VIEW = new Uint8Array(0);\r\nconst END_OF_CONTENT_NAME = \"EndOfContent\";\r\nconst OCTET_STRING_NAME = \"OCTET STRING\";\r\nconst BIT_STRING_NAME = \"BIT STRING\";\n\nfunction HexBlock(BaseClass) {\r\n var _a;\r\n return _a = class Some extends BaseClass {\r\n constructor(...args) {\r\n var _a;\r\n super(...args);\r\n const params = args[0] || {};\r\n this.isHexOnly = (_a = params.isHexOnly) !== null && _a !== void 0 ? _a : false;\r\n this.valueHexView = params.valueHex ? pvtsutils.BufferSourceConverter.toUint8Array(params.valueHex) : EMPTY_VIEW;\r\n }\r\n get valueHex() {\r\n return this.valueHexView.slice().buffer;\r\n }\r\n set valueHex(value) {\r\n this.valueHexView = new Uint8Array(value);\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n const view = inputBuffer instanceof ArrayBuffer ? new Uint8Array(inputBuffer) : inputBuffer;\r\n if (!checkBufferParams(this, view, inputOffset, inputLength)) {\r\n return -1;\r\n }\r\n const endLength = inputOffset + inputLength;\r\n this.valueHexView = view.subarray(inputOffset, endLength);\r\n if (!this.valueHexView.length) {\r\n this.warnings.push(\"Zero buffer length\");\r\n return inputOffset;\r\n }\r\n this.blockLength = inputLength;\r\n return endLength;\r\n }\r\n toBER(sizeOnly = false) {\r\n if (!this.isHexOnly) {\r\n this.error = \"Flag 'isHexOnly' is not set, abort\";\r\n return EMPTY_BUFFER;\r\n }\r\n if (sizeOnly) {\r\n return new ArrayBuffer(this.valueHexView.byteLength);\r\n }\r\n return (this.valueHexView.byteLength === this.valueHexView.buffer.byteLength)\r\n ? this.valueHexView.buffer\r\n : this.valueHexView.slice().buffer;\r\n }\r\n toJSON() {\r\n return {\r\n ...super.toJSON(),\r\n isHexOnly: this.isHexOnly,\r\n valueHex: pvtsutils.Convert.ToHex(this.valueHexView),\r\n };\r\n }\r\n },\r\n _a.NAME = \"hexBlock\",\r\n _a;\r\n}\n\nclass LocalBaseBlock {\r\n constructor({ blockLength = 0, error = EMPTY_STRING, warnings = [], valueBeforeDecode = EMPTY_VIEW, } = {}) {\r\n this.blockLength = blockLength;\r\n this.error = error;\r\n this.warnings = warnings;\r\n this.valueBeforeDecodeView = pvtsutils.BufferSourceConverter.toUint8Array(valueBeforeDecode);\r\n }\r\n static blockName() {\r\n return this.NAME;\r\n }\r\n get valueBeforeDecode() {\r\n return this.valueBeforeDecodeView.slice().buffer;\r\n }\r\n set valueBeforeDecode(value) {\r\n this.valueBeforeDecodeView = new Uint8Array(value);\r\n }\r\n toJSON() {\r\n return {\r\n blockName: this.constructor.NAME,\r\n blockLength: this.blockLength,\r\n error: this.error,\r\n warnings: this.warnings,\r\n valueBeforeDecode: pvtsutils.Convert.ToHex(this.valueBeforeDecodeView),\r\n };\r\n }\r\n}\r\nLocalBaseBlock.NAME = \"baseBlock\";\n\nclass ValueBlock extends LocalBaseBlock {\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n throw TypeError(\"User need to make a specific function in a class which extends 'ValueBlock'\");\r\n }\r\n toBER(sizeOnly, writer) {\r\n throw TypeError(\"User need to make a specific function in a class which extends 'ValueBlock'\");\r\n }\r\n}\r\nValueBlock.NAME = \"valueBlock\";\n\nclass LocalIdentificationBlock extends HexBlock(LocalBaseBlock) {\r\n constructor({ idBlock = {}, } = {}) {\r\n var _a, _b, _c, _d;\r\n super();\r\n if (idBlock) {\r\n this.isHexOnly = (_a = idBlock.isHexOnly) !== null && _a !== void 0 ? _a : false;\r\n this.valueHexView = idBlock.valueHex ? pvtsutils.BufferSourceConverter.toUint8Array(idBlock.valueHex) : EMPTY_VIEW;\r\n this.tagClass = (_b = idBlock.tagClass) !== null && _b !== void 0 ? _b : -1;\r\n this.tagNumber = (_c = idBlock.tagNumber) !== null && _c !== void 0 ? _c : -1;\r\n this.isConstructed = (_d = idBlock.isConstructed) !== null && _d !== void 0 ? _d : false;\r\n }\r\n else {\r\n this.tagClass = -1;\r\n this.tagNumber = -1;\r\n this.isConstructed = false;\r\n }\r\n }\r\n toBER(sizeOnly = false) {\r\n let firstOctet = 0;\r\n switch (this.tagClass) {\r\n case 1:\r\n firstOctet |= 0x00;\r\n break;\r\n case 2:\r\n firstOctet |= 0x40;\r\n break;\r\n case 3:\r\n firstOctet |= 0x80;\r\n break;\r\n case 4:\r\n firstOctet |= 0xC0;\r\n break;\r\n default:\r\n this.error = \"Unknown tag class\";\r\n return EMPTY_BUFFER;\r\n }\r\n if (this.isConstructed)\r\n firstOctet |= 0x20;\r\n if (this.tagNumber < 31 && !this.isHexOnly) {\r\n const retView = new Uint8Array(1);\r\n if (!sizeOnly) {\r\n let number = this.tagNumber;\r\n number &= 0x1F;\r\n firstOctet |= number;\r\n retView[0] = firstOctet;\r\n }\r\n return retView.buffer;\r\n }\r\n if (!this.isHexOnly) {\r\n const encodedBuf = pvutils.utilToBase(this.tagNumber, 7);\r\n const encodedView = new Uint8Array(encodedBuf);\r\n const size = encodedBuf.byteLength;\r\n const retView = new Uint8Array(size + 1);\r\n retView[0] = (firstOctet | 0x1F);\r\n if (!sizeOnly) {\r\n for (let i = 0; i < (size - 1); i++)\r\n retView[i + 1] = encodedView[i] | 0x80;\r\n retView[size] = encodedView[size - 1];\r\n }\r\n return retView.buffer;\r\n }\r\n const retView = new Uint8Array(this.valueHexView.byteLength + 1);\r\n retView[0] = (firstOctet | 0x1F);\r\n if (!sizeOnly) {\r\n const curView = this.valueHexView;\r\n for (let i = 0; i < (curView.length - 1); i++)\r\n retView[i + 1] = curView[i] | 0x80;\r\n retView[this.valueHexView.byteLength] = curView[curView.length - 1];\r\n }\r\n return retView.buffer;\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n const inputView = pvtsutils.BufferSourceConverter.toUint8Array(inputBuffer);\r\n if (!checkBufferParams(this, inputView, inputOffset, inputLength)) {\r\n return -1;\r\n }\r\n const intBuffer = inputView.subarray(inputOffset, inputOffset + inputLength);\r\n if (intBuffer.length === 0) {\r\n this.error = \"Zero buffer length\";\r\n return -1;\r\n }\r\n const tagClassMask = intBuffer[0] & 0xC0;\r\n switch (tagClassMask) {\r\n case 0x00:\r\n this.tagClass = (1);\r\n break;\r\n case 0x40:\r\n this.tagClass = (2);\r\n break;\r\n case 0x80:\r\n this.tagClass = (3);\r\n break;\r\n case 0xC0:\r\n this.tagClass = (4);\r\n break;\r\n default:\r\n this.error = \"Unknown tag class\";\r\n return -1;\r\n }\r\n this.isConstructed = (intBuffer[0] & 0x20) === 0x20;\r\n this.isHexOnly = false;\r\n const tagNumberMask = intBuffer[0] & 0x1F;\r\n if (tagNumberMask !== 0x1F) {\r\n this.tagNumber = (tagNumberMask);\r\n this.blockLength = 1;\r\n }\r\n else {\r\n let count = 1;\r\n let intTagNumberBuffer = this.valueHexView = new Uint8Array(255);\r\n let tagNumberBufferMaxLength = 255;\r\n while (intBuffer[count] & 0x80) {\r\n intTagNumberBuffer[count - 1] = intBuffer[count] & 0x7F;\r\n count++;\r\n if (count >= intBuffer.length) {\r\n this.error = \"End of input reached before message was fully decoded\";\r\n return -1;\r\n }\r\n if (count === tagNumberBufferMaxLength) {\r\n tagNumberBufferMaxLength += 255;\r\n const tempBufferView = new Uint8Array(tagNumberBufferMaxLength);\r\n for (let i = 0; i < intTagNumberBuffer.length; i++)\r\n tempBufferView[i] = intTagNumberBuffer[i];\r\n intTagNumberBuffer = this.valueHexView = new Uint8Array(tagNumberBufferMaxLength);\r\n }\r\n }\r\n this.blockLength = (count + 1);\r\n intTagNumberBuffer[count - 1] = intBuffer[count] & 0x7F;\r\n const tempBufferView = new Uint8Array(count);\r\n for (let i = 0; i < count; i++)\r\n tempBufferView[i] = intTagNumberBuffer[i];\r\n intTagNumberBuffer = this.valueHexView = new Uint8Array(count);\r\n intTagNumberBuffer.set(tempBufferView);\r\n if (this.blockLength <= 9)\r\n this.tagNumber = pvutils.utilFromBase(intTagNumberBuffer, 7);\r\n else {\r\n this.isHexOnly = true;\r\n this.warnings.push(\"Tag too long, represented as hex-coded\");\r\n }\r\n }\r\n if (((this.tagClass === 1)) &&\r\n (this.isConstructed)) {\r\n switch (this.tagNumber) {\r\n case 1:\r\n case 2:\r\n case 5:\r\n case 6:\r\n case 9:\r\n case 13:\r\n case 14:\r\n case 23:\r\n case 24:\r\n case 31:\r\n case 32:\r\n case 33:\r\n case 34:\r\n this.error = \"Constructed encoding used for primitive type\";\r\n return -1;\r\n }\r\n }\r\n return (inputOffset + this.blockLength);\r\n }\r\n toJSON() {\r\n return {\r\n ...super.toJSON(),\r\n tagClass: this.tagClass,\r\n tagNumber: this.tagNumber,\r\n isConstructed: this.isConstructed,\r\n };\r\n }\r\n}\r\nLocalIdentificationBlock.NAME = \"identificationBlock\";\n\nclass LocalLengthBlock extends LocalBaseBlock {\r\n constructor({ lenBlock = {}, } = {}) {\r\n var _a, _b, _c;\r\n super();\r\n this.isIndefiniteForm = (_a = lenBlock.isIndefiniteForm) !== null && _a !== void 0 ? _a : false;\r\n this.longFormUsed = (_b = lenBlock.longFormUsed) !== null && _b !== void 0 ? _b : false;\r\n this.length = (_c = lenBlock.length) !== null && _c !== void 0 ? _c : 0;\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n const view = pvtsutils.BufferSourceConverter.toUint8Array(inputBuffer);\r\n if (!checkBufferParams(this, view, inputOffset, inputLength)) {\r\n return -1;\r\n }\r\n const intBuffer = view.subarray(inputOffset, inputOffset + inputLength);\r\n if (intBuffer.length === 0) {\r\n this.error = \"Zero buffer length\";\r\n return -1;\r\n }\r\n if (intBuffer[0] === 0xFF) {\r\n this.error = \"Length block 0xFF is reserved by standard\";\r\n return -1;\r\n }\r\n this.isIndefiniteForm = intBuffer[0] === 0x80;\r\n if (this.isIndefiniteForm) {\r\n this.blockLength = 1;\r\n return (inputOffset + this.blockLength);\r\n }\r\n this.longFormUsed = !!(intBuffer[0] & 0x80);\r\n if (this.longFormUsed === false) {\r\n this.length = (intBuffer[0]);\r\n this.blockLength = 1;\r\n return (inputOffset + this.blockLength);\r\n }\r\n const count = intBuffer[0] & 0x7F;\r\n if (count > 8) {\r\n this.error = \"Too big integer\";\r\n return -1;\r\n }\r\n if ((count + 1) > intBuffer.length) {\r\n this.error = \"End of input reached before message was fully decoded\";\r\n return -1;\r\n }\r\n const lenOffset = inputOffset + 1;\r\n const lengthBufferView = view.subarray(lenOffset, lenOffset + count);\r\n if (lengthBufferView[count - 1] === 0x00)\r\n this.warnings.push(\"Needlessly long encoded length\");\r\n this.length = pvutils.utilFromBase(lengthBufferView, 8);\r\n if (this.longFormUsed && (this.length <= 127))\r\n this.warnings.push(\"Unnecessary usage of long length form\");\r\n this.blockLength = count + 1;\r\n return (inputOffset + this.blockLength);\r\n }\r\n toBER(sizeOnly = false) {\r\n let retBuf;\r\n let retView;\r\n if (this.length > 127)\r\n this.longFormUsed = true;\r\n if (this.isIndefiniteForm) {\r\n retBuf = new ArrayBuffer(1);\r\n if (sizeOnly === false) {\r\n retView = new Uint8Array(retBuf);\r\n retView[0] = 0x80;\r\n }\r\n return retBuf;\r\n }\r\n if (this.longFormUsed) {\r\n const encodedBuf = pvutils.utilToBase(this.length, 8);\r\n if (encodedBuf.byteLength > 127) {\r\n this.error = \"Too big length\";\r\n return (EMPTY_BUFFER);\r\n }\r\n retBuf = new ArrayBuffer(encodedBuf.byteLength + 1);\r\n if (sizeOnly)\r\n return retBuf;\r\n const encodedView = new Uint8Array(encodedBuf);\r\n retView = new Uint8Array(retBuf);\r\n retView[0] = encodedBuf.byteLength | 0x80;\r\n for (let i = 0; i < encodedBuf.byteLength; i++)\r\n retView[i + 1] = encodedView[i];\r\n return retBuf;\r\n }\r\n retBuf = new ArrayBuffer(1);\r\n if (sizeOnly === false) {\r\n retView = new Uint8Array(retBuf);\r\n retView[0] = this.length;\r\n }\r\n return retBuf;\r\n }\r\n toJSON() {\r\n return {\r\n ...super.toJSON(),\r\n isIndefiniteForm: this.isIndefiniteForm,\r\n longFormUsed: this.longFormUsed,\r\n length: this.length,\r\n };\r\n }\r\n}\r\nLocalLengthBlock.NAME = \"lengthBlock\";\n\nconst typeStore = {};\n\nclass BaseBlock extends LocalBaseBlock {\r\n constructor({ name = EMPTY_STRING, optional = false, primitiveSchema, ...parameters } = {}, valueBlockType) {\r\n super(parameters);\r\n this.name = name;\r\n this.optional = optional;\r\n if (primitiveSchema) {\r\n this.primitiveSchema = primitiveSchema;\r\n }\r\n this.idBlock = new LocalIdentificationBlock(parameters);\r\n this.lenBlock = new LocalLengthBlock(parameters);\r\n this.valueBlock = valueBlockType ? new valueBlockType(parameters) : new ValueBlock(parameters);\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n const resultOffset = this.valueBlock.fromBER(inputBuffer, inputOffset, (this.lenBlock.isIndefiniteForm) ? inputLength : this.lenBlock.length);\r\n if (resultOffset === -1) {\r\n this.error = this.valueBlock.error;\r\n return resultOffset;\r\n }\r\n if (!this.idBlock.error.length)\r\n this.blockLength += this.idBlock.blockLength;\r\n if (!this.lenBlock.error.length)\r\n this.blockLength += this.lenBlock.blockLength;\r\n if (!this.valueBlock.error.length)\r\n this.blockLength += this.valueBlock.blockLength;\r\n return resultOffset;\r\n }\r\n toBER(sizeOnly, writer) {\r\n const _writer = writer || new ViewWriter();\r\n if (!writer) {\r\n prepareIndefiniteForm(this);\r\n }\r\n const idBlockBuf = this.idBlock.toBER(sizeOnly);\r\n _writer.write(idBlockBuf);\r\n if (this.lenBlock.isIndefiniteForm) {\r\n _writer.write(new Uint8Array([0x80]).buffer);\r\n this.valueBlock.toBER(sizeOnly, _writer);\r\n _writer.write(new ArrayBuffer(2));\r\n }\r\n else {\r\n const valueBlockBuf = this.valueBlock.toBER(sizeOnly);\r\n this.lenBlock.length = valueBlockBuf.byteLength;\r\n const lenBlockBuf = this.lenBlock.toBER(sizeOnly);\r\n _writer.write(lenBlockBuf);\r\n _writer.write(valueBlockBuf);\r\n }\r\n if (!writer) {\r\n return _writer.final();\r\n }\r\n return EMPTY_BUFFER;\r\n }\r\n toJSON() {\r\n const object = {\r\n ...super.toJSON(),\r\n idBlock: this.idBlock.toJSON(),\r\n lenBlock: this.lenBlock.toJSON(),\r\n valueBlock: this.valueBlock.toJSON(),\r\n name: this.name,\r\n optional: this.optional,\r\n };\r\n if (this.primitiveSchema)\r\n object.primitiveSchema = this.primitiveSchema.toJSON();\r\n return object;\r\n }\r\n toString(encoding = \"ascii\") {\r\n if (encoding === \"ascii\") {\r\n return this.onAsciiEncoding();\r\n }\r\n return pvtsutils.Convert.ToHex(this.toBER());\r\n }\r\n onAsciiEncoding() {\r\n return `${this.constructor.NAME} : ${pvtsutils.Convert.ToHex(this.valueBlock.valueBeforeDecodeView)}`;\r\n }\r\n isEqual(other) {\r\n if (this === other) {\r\n return true;\r\n }\r\n if (!(other instanceof this.constructor)) {\r\n return false;\r\n }\r\n const thisRaw = this.toBER();\r\n const otherRaw = other.toBER();\r\n return pvutils.isEqualBuffer(thisRaw, otherRaw);\r\n }\r\n}\r\nBaseBlock.NAME = \"BaseBlock\";\r\nfunction prepareIndefiniteForm(baseBlock) {\r\n if (baseBlock instanceof typeStore.Constructed) {\r\n for (const value of baseBlock.valueBlock.value) {\r\n if (prepareIndefiniteForm(value)) {\r\n baseBlock.lenBlock.isIndefiniteForm = true;\r\n }\r\n }\r\n }\r\n return !!baseBlock.lenBlock.isIndefiniteForm;\r\n}\n\nclass BaseStringBlock extends BaseBlock {\r\n constructor({ value = EMPTY_STRING, ...parameters } = {}, stringValueBlockType) {\r\n super(parameters, stringValueBlockType);\r\n if (value) {\r\n this.fromString(value);\r\n }\r\n }\r\n getValue() {\r\n return this.valueBlock.value;\r\n }\r\n setValue(value) {\r\n this.valueBlock.value = value;\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n const resultOffset = this.valueBlock.fromBER(inputBuffer, inputOffset, (this.lenBlock.isIndefiniteForm) ? inputLength : this.lenBlock.length);\r\n if (resultOffset === -1) {\r\n this.error = this.valueBlock.error;\r\n return resultOffset;\r\n }\r\n this.fromBuffer(this.valueBlock.valueHexView);\r\n if (!this.idBlock.error.length)\r\n this.blockLength += this.idBlock.blockLength;\r\n if (!this.lenBlock.error.length)\r\n this.blockLength += this.lenBlock.blockLength;\r\n if (!this.valueBlock.error.length)\r\n this.blockLength += this.valueBlock.blockLength;\r\n return resultOffset;\r\n }\r\n onAsciiEncoding() {\r\n return `${this.constructor.NAME} : '${this.valueBlock.value}'`;\r\n }\r\n}\r\nBaseStringBlock.NAME = \"BaseStringBlock\";\n\nclass LocalPrimitiveValueBlock extends HexBlock(ValueBlock) {\r\n constructor({ isHexOnly = true, ...parameters } = {}) {\r\n super(parameters);\r\n this.isHexOnly = isHexOnly;\r\n }\r\n}\r\nLocalPrimitiveValueBlock.NAME = \"PrimitiveValueBlock\";\n\nvar _a$w;\r\nclass Primitive extends BaseBlock {\r\n constructor(parameters = {}) {\r\n super(parameters, LocalPrimitiveValueBlock);\r\n this.idBlock.isConstructed = false;\r\n }\r\n}\r\n_a$w = Primitive;\r\n(() => {\r\n typeStore.Primitive = _a$w;\r\n})();\r\nPrimitive.NAME = \"PRIMITIVE\";\n\nfunction localChangeType(inputObject, newType) {\r\n if (inputObject instanceof newType) {\r\n return inputObject;\r\n }\r\n const newObject = new newType();\r\n newObject.idBlock = inputObject.idBlock;\r\n newObject.lenBlock = inputObject.lenBlock;\r\n newObject.warnings = inputObject.warnings;\r\n newObject.valueBeforeDecodeView = inputObject.valueBeforeDecodeView;\r\n return newObject;\r\n}\r\nfunction localFromBER(inputBuffer, inputOffset = 0, inputLength = inputBuffer.length) {\r\n const incomingOffset = inputOffset;\r\n let returnObject = new BaseBlock({}, ValueBlock);\r\n const baseBlock = new LocalBaseBlock();\r\n if (!checkBufferParams(baseBlock, inputBuffer, inputOffset, inputLength)) {\r\n returnObject.error = baseBlock.error;\r\n return {\r\n offset: -1,\r\n result: returnObject\r\n };\r\n }\r\n const intBuffer = inputBuffer.subarray(inputOffset, inputOffset + inputLength);\r\n if (!intBuffer.length) {\r\n returnObject.error = \"Zero buffer length\";\r\n return {\r\n offset: -1,\r\n result: returnObject\r\n };\r\n }\r\n let resultOffset = returnObject.idBlock.fromBER(inputBuffer, inputOffset, inputLength);\r\n if (returnObject.idBlock.warnings.length) {\r\n returnObject.warnings.concat(returnObject.idBlock.warnings);\r\n }\r\n if (resultOffset === -1) {\r\n returnObject.error = returnObject.idBlock.error;\r\n return {\r\n offset: -1,\r\n result: returnObject\r\n };\r\n }\r\n inputOffset = resultOffset;\r\n inputLength -= returnObject.idBlock.blockLength;\r\n resultOffset = returnObject.lenBlock.fromBER(inputBuffer, inputOffset, inputLength);\r\n if (returnObject.lenBlock.warnings.length) {\r\n returnObject.warnings.concat(returnObject.lenBlock.warnings);\r\n }\r\n if (resultOffset === -1) {\r\n returnObject.error = returnObject.lenBlock.error;\r\n return {\r\n offset: -1,\r\n result: returnObject\r\n };\r\n }\r\n inputOffset = resultOffset;\r\n inputLength -= returnObject.lenBlock.blockLength;\r\n if (!returnObject.idBlock.isConstructed &&\r\n returnObject.lenBlock.isIndefiniteForm) {\r\n returnObject.error = \"Indefinite length form used for primitive encoding form\";\r\n return {\r\n offset: -1,\r\n result: returnObject\r\n };\r\n }\r\n let newASN1Type = BaseBlock;\r\n switch (returnObject.idBlock.tagClass) {\r\n case 1:\r\n if ((returnObject.idBlock.tagNumber >= 37) &&\r\n (returnObject.idBlock.isHexOnly === false)) {\r\n returnObject.error = \"UNIVERSAL 37 and upper tags are reserved by ASN.1 standard\";\r\n return {\r\n offset: -1,\r\n result: returnObject\r\n };\r\n }\r\n switch (returnObject.idBlock.tagNumber) {\r\n case 0:\r\n if ((returnObject.idBlock.isConstructed) &&\r\n (returnObject.lenBlock.length > 0)) {\r\n returnObject.error = \"Type [UNIVERSAL 0] is reserved\";\r\n return {\r\n offset: -1,\r\n result: returnObject\r\n };\r\n }\r\n newASN1Type = typeStore.EndOfContent;\r\n break;\r\n case 1:\r\n newASN1Type = typeStore.Boolean;\r\n break;\r\n case 2:\r\n newASN1Type = typeStore.Integer;\r\n break;\r\n case 3:\r\n newASN1Type = typeStore.BitString;\r\n break;\r\n case 4:\r\n newASN1Type = typeStore.OctetString;\r\n break;\r\n case 5:\r\n newASN1Type = typeStore.Null;\r\n break;\r\n case 6:\r\n newASN1Type = typeStore.ObjectIdentifier;\r\n break;\r\n case 10:\r\n newASN1Type = typeStore.Enumerated;\r\n break;\r\n case 12:\r\n newASN1Type = typeStore.Utf8String;\r\n break;\r\n case 13:\r\n newASN1Type = typeStore.RelativeObjectIdentifier;\r\n break;\r\n case 14:\r\n newASN1Type = typeStore.TIME;\r\n break;\r\n case 15:\r\n returnObject.error = \"[UNIVERSAL 15] is reserved by ASN.1 standard\";\r\n return {\r\n offset: -1,\r\n result: returnObject\r\n };\r\n case 16:\r\n newASN1Type = typeStore.Sequence;\r\n break;\r\n case 17:\r\n newASN1Type = typeStore.Set;\r\n break;\r\n case 18:\r\n newASN1Type = typeStore.NumericString;\r\n break;\r\n case 19:\r\n newASN1Type = typeStore.PrintableString;\r\n break;\r\n case 20:\r\n newASN1Type = typeStore.TeletexString;\r\n break;\r\n case 21:\r\n newASN1Type = typeStore.VideotexString;\r\n break;\r\n case 22:\r\n newASN1Type = typeStore.IA5String;\r\n break;\r\n case 23:\r\n newASN1Type = typeStore.UTCTime;\r\n break;\r\n case 24:\r\n newASN1Type = typeStore.GeneralizedTime;\r\n break;\r\n case 25:\r\n newASN1Type = typeStore.GraphicString;\r\n break;\r\n case 26:\r\n newASN1Type = typeStore.VisibleString;\r\n break;\r\n case 27:\r\n newASN1Type = typeStore.GeneralString;\r\n break;\r\n case 28:\r\n newASN1Type = typeStore.UniversalString;\r\n break;\r\n case 29:\r\n newASN1Type = typeStore.CharacterString;\r\n break;\r\n case 30:\r\n newASN1Type = typeStore.BmpString;\r\n break;\r\n case 31:\r\n newASN1Type = typeStore.DATE;\r\n break;\r\n case 32:\r\n newASN1Type = typeStore.TimeOfDay;\r\n break;\r\n case 33:\r\n newASN1Type = typeStore.DateTime;\r\n break;\r\n case 34:\r\n newASN1Type = typeStore.Duration;\r\n break;\r\n default: {\r\n const newObject = returnObject.idBlock.isConstructed\r\n ? new typeStore.Constructed()\r\n : new typeStore.Primitive();\r\n newObject.idBlock = returnObject.idBlock;\r\n newObject.lenBlock = returnObject.lenBlock;\r\n newObject.warnings = returnObject.warnings;\r\n returnObject = newObject;\r\n }\r\n }\r\n break;\r\n case 2:\r\n case 3:\r\n case 4:\r\n default: {\r\n newASN1Type = returnObject.idBlock.isConstructed\r\n ? typeStore.Constructed\r\n : typeStore.Primitive;\r\n }\r\n }\r\n returnObject = localChangeType(returnObject, newASN1Type);\r\n resultOffset = returnObject.fromBER(inputBuffer, inputOffset, returnObject.lenBlock.isIndefiniteForm ? inputLength : returnObject.lenBlock.length);\r\n returnObject.valueBeforeDecodeView = inputBuffer.subarray(incomingOffset, incomingOffset + returnObject.blockLength);\r\n return {\r\n offset: resultOffset,\r\n result: returnObject\r\n };\r\n}\r\nfunction fromBER(inputBuffer) {\r\n if (!inputBuffer.byteLength) {\r\n const result = new BaseBlock({}, ValueBlock);\r\n result.error = \"Input buffer has zero length\";\r\n return {\r\n offset: -1,\r\n result\r\n };\r\n }\r\n return localFromBER(pvtsutils.BufferSourceConverter.toUint8Array(inputBuffer).slice(), 0, inputBuffer.byteLength);\r\n}\n\nfunction checkLen(indefiniteLength, length) {\r\n if (indefiniteLength) {\r\n return 1;\r\n }\r\n return length;\r\n}\r\nclass LocalConstructedValueBlock extends ValueBlock {\r\n constructor({ value = [], isIndefiniteForm = false, ...parameters } = {}) {\r\n super(parameters);\r\n this.value = value;\r\n this.isIndefiniteForm = isIndefiniteForm;\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n const view = pvtsutils.BufferSourceConverter.toUint8Array(inputBuffer);\r\n if (!checkBufferParams(this, view, inputOffset, inputLength)) {\r\n return -1;\r\n }\r\n this.valueBeforeDecodeView = view.subarray(inputOffset, inputOffset + inputLength);\r\n if (this.valueBeforeDecodeView.length === 0) {\r\n this.warnings.push(\"Zero buffer length\");\r\n return inputOffset;\r\n }\r\n let currentOffset = inputOffset;\r\n while (checkLen(this.isIndefiniteForm, inputLength) > 0) {\r\n const returnObject = localFromBER(view, currentOffset, inputLength);\r\n if (returnObject.offset === -1) {\r\n this.error = returnObject.result.error;\r\n this.warnings.concat(returnObject.result.warnings);\r\n return -1;\r\n }\r\n currentOffset = returnObject.offset;\r\n this.blockLength += returnObject.result.blockLength;\r\n inputLength -= returnObject.result.blockLength;\r\n this.value.push(returnObject.result);\r\n if (this.isIndefiniteForm && returnObject.result.constructor.NAME === END_OF_CONTENT_NAME) {\r\n break;\r\n }\r\n }\r\n if (this.isIndefiniteForm) {\r\n if (this.value[this.value.length - 1].constructor.NAME === END_OF_CONTENT_NAME) {\r\n this.value.pop();\r\n }\r\n else {\r\n this.warnings.push(\"No EndOfContent block encoded\");\r\n }\r\n }\r\n return currentOffset;\r\n }\r\n toBER(sizeOnly, writer) {\r\n const _writer = writer || new ViewWriter();\r\n for (let i = 0; i < this.value.length; i++) {\r\n this.value[i].toBER(sizeOnly, _writer);\r\n }\r\n if (!writer) {\r\n return _writer.final();\r\n }\r\n return EMPTY_BUFFER;\r\n }\r\n toJSON() {\r\n const object = {\r\n ...super.toJSON(),\r\n isIndefiniteForm: this.isIndefiniteForm,\r\n value: [],\r\n };\r\n for (const value of this.value) {\r\n object.value.push(value.toJSON());\r\n }\r\n return object;\r\n }\r\n}\r\nLocalConstructedValueBlock.NAME = \"ConstructedValueBlock\";\n\nvar _a$v;\r\nclass Constructed extends BaseBlock {\r\n constructor(parameters = {}) {\r\n super(parameters, LocalConstructedValueBlock);\r\n this.idBlock.isConstructed = true;\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n this.valueBlock.isIndefiniteForm = this.lenBlock.isIndefiniteForm;\r\n const resultOffset = this.valueBlock.fromBER(inputBuffer, inputOffset, (this.lenBlock.isIndefiniteForm) ? inputLength : this.lenBlock.length);\r\n if (resultOffset === -1) {\r\n this.error = this.valueBlock.error;\r\n return resultOffset;\r\n }\r\n if (!this.idBlock.error.length)\r\n this.blockLength += this.idBlock.blockLength;\r\n if (!this.lenBlock.error.length)\r\n this.blockLength += this.lenBlock.blockLength;\r\n if (!this.valueBlock.error.length)\r\n this.blockLength += this.valueBlock.blockLength;\r\n return resultOffset;\r\n }\r\n onAsciiEncoding() {\r\n const values = [];\r\n for (const value of this.valueBlock.value) {\r\n values.push(value.toString(\"ascii\").split(\"\\n\").map(o => ` ${o}`).join(\"\\n\"));\r\n }\r\n const blockName = this.idBlock.tagClass === 3\r\n ? `[${this.idBlock.tagNumber}]`\r\n : this.constructor.NAME;\r\n return values.length\r\n ? `${blockName} :\\n${values.join(\"\\n\")}`\r\n : `${blockName} :`;\r\n }\r\n}\r\n_a$v = Constructed;\r\n(() => {\r\n typeStore.Constructed = _a$v;\r\n})();\r\nConstructed.NAME = \"CONSTRUCTED\";\n\nclass LocalEndOfContentValueBlock extends ValueBlock {\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n return inputOffset;\r\n }\r\n toBER(sizeOnly) {\r\n return EMPTY_BUFFER;\r\n }\r\n}\r\nLocalEndOfContentValueBlock.override = \"EndOfContentValueBlock\";\n\nvar _a$u;\r\nclass EndOfContent extends BaseBlock {\r\n constructor(parameters = {}) {\r\n super(parameters, LocalEndOfContentValueBlock);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 0;\r\n }\r\n}\r\n_a$u = EndOfContent;\r\n(() => {\r\n typeStore.EndOfContent = _a$u;\r\n})();\r\nEndOfContent.NAME = END_OF_CONTENT_NAME;\n\nvar _a$t;\r\nclass Null extends BaseBlock {\r\n constructor(parameters = {}) {\r\n super(parameters, ValueBlock);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 5;\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n if (this.lenBlock.length > 0)\r\n this.warnings.push(\"Non-zero length of value block for Null type\");\r\n if (!this.idBlock.error.length)\r\n this.blockLength += this.idBlock.blockLength;\r\n if (!this.lenBlock.error.length)\r\n this.blockLength += this.lenBlock.blockLength;\r\n this.blockLength += inputLength;\r\n if ((inputOffset + inputLength) > inputBuffer.byteLength) {\r\n this.error = \"End of input reached before message was fully decoded (inconsistent offset and length values)\";\r\n return -1;\r\n }\r\n return (inputOffset + inputLength);\r\n }\r\n toBER(sizeOnly, writer) {\r\n const retBuf = new ArrayBuffer(2);\r\n if (!sizeOnly) {\r\n const retView = new Uint8Array(retBuf);\r\n retView[0] = 0x05;\r\n retView[1] = 0x00;\r\n }\r\n if (writer) {\r\n writer.write(retBuf);\r\n }\r\n return retBuf;\r\n }\r\n onAsciiEncoding() {\r\n return `${this.constructor.NAME}`;\r\n }\r\n}\r\n_a$t = Null;\r\n(() => {\r\n typeStore.Null = _a$t;\r\n})();\r\nNull.NAME = \"NULL\";\n\nclass LocalBooleanValueBlock extends HexBlock(ValueBlock) {\r\n constructor({ value, ...parameters } = {}) {\r\n super(parameters);\r\n if (parameters.valueHex) {\r\n this.valueHexView = pvtsutils.BufferSourceConverter.toUint8Array(parameters.valueHex);\r\n }\r\n else {\r\n this.valueHexView = new Uint8Array(1);\r\n }\r\n if (value) {\r\n this.value = value;\r\n }\r\n }\r\n get value() {\r\n for (const octet of this.valueHexView) {\r\n if (octet > 0) {\r\n return true;\r\n }\r\n }\r\n return false;\r\n }\r\n set value(value) {\r\n this.valueHexView[0] = value ? 0xFF : 0x00;\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n const inputView = pvtsutils.BufferSourceConverter.toUint8Array(inputBuffer);\r\n if (!checkBufferParams(this, inputView, inputOffset, inputLength)) {\r\n return -1;\r\n }\r\n this.valueHexView = inputView.subarray(inputOffset, inputOffset + inputLength);\r\n if (inputLength > 1)\r\n this.warnings.push(\"Boolean value encoded in more then 1 octet\");\r\n this.isHexOnly = true;\r\n pvutils.utilDecodeTC.call(this);\r\n this.blockLength = inputLength;\r\n return (inputOffset + inputLength);\r\n }\r\n toBER() {\r\n return this.valueHexView.slice();\r\n }\r\n toJSON() {\r\n return {\r\n ...super.toJSON(),\r\n value: this.value,\r\n };\r\n }\r\n}\r\nLocalBooleanValueBlock.NAME = \"BooleanValueBlock\";\n\nvar _a$s;\r\nclass Boolean extends BaseBlock {\r\n constructor(parameters = {}) {\r\n super(parameters, LocalBooleanValueBlock);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 1;\r\n }\r\n getValue() {\r\n return this.valueBlock.value;\r\n }\r\n setValue(value) {\r\n this.valueBlock.value = value;\r\n }\r\n onAsciiEncoding() {\r\n return `${this.constructor.NAME} : ${this.getValue}`;\r\n }\r\n}\r\n_a$s = Boolean;\r\n(() => {\r\n typeStore.Boolean = _a$s;\r\n})();\r\nBoolean.NAME = \"BOOLEAN\";\n\nclass LocalOctetStringValueBlock extends HexBlock(LocalConstructedValueBlock) {\r\n constructor({ isConstructed = false, ...parameters } = {}) {\r\n super(parameters);\r\n this.isConstructed = isConstructed;\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n let resultOffset = 0;\r\n if (this.isConstructed) {\r\n this.isHexOnly = false;\r\n resultOffset = LocalConstructedValueBlock.prototype.fromBER.call(this, inputBuffer, inputOffset, inputLength);\r\n if (resultOffset === -1)\r\n return resultOffset;\r\n for (let i = 0; i < this.value.length; i++) {\r\n const currentBlockName = this.value[i].constructor.NAME;\r\n if (currentBlockName === END_OF_CONTENT_NAME) {\r\n if (this.isIndefiniteForm)\r\n break;\r\n else {\r\n this.error = \"EndOfContent is unexpected, OCTET STRING may consists of OCTET STRINGs only\";\r\n return -1;\r\n }\r\n }\r\n if (currentBlockName !== OCTET_STRING_NAME) {\r\n this.error = \"OCTET STRING may consists of OCTET STRINGs only\";\r\n return -1;\r\n }\r\n }\r\n }\r\n else {\r\n this.isHexOnly = true;\r\n resultOffset = super.fromBER(inputBuffer, inputOffset, inputLength);\r\n this.blockLength = inputLength;\r\n }\r\n return resultOffset;\r\n }\r\n toBER(sizeOnly, writer) {\r\n if (this.isConstructed)\r\n return LocalConstructedValueBlock.prototype.toBER.call(this, sizeOnly, writer);\r\n return sizeOnly\r\n ? new ArrayBuffer(this.valueHexView.byteLength)\r\n : this.valueHexView.slice().buffer;\r\n }\r\n toJSON() {\r\n return {\r\n ...super.toJSON(),\r\n isConstructed: this.isConstructed,\r\n };\r\n }\r\n}\r\nLocalOctetStringValueBlock.NAME = \"OctetStringValueBlock\";\n\nvar _a$r;\r\nclass OctetString extends BaseBlock {\r\n constructor({ idBlock = {}, lenBlock = {}, ...parameters } = {}) {\r\n var _b, _c;\r\n (_b = parameters.isConstructed) !== null && _b !== void 0 ? _b : (parameters.isConstructed = !!((_c = parameters.value) === null || _c === void 0 ? void 0 : _c.length));\r\n super({\r\n idBlock: {\r\n isConstructed: parameters.isConstructed,\r\n ...idBlock,\r\n },\r\n lenBlock: {\r\n ...lenBlock,\r\n isIndefiniteForm: !!parameters.isIndefiniteForm,\r\n },\r\n ...parameters,\r\n }, LocalOctetStringValueBlock);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 4;\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n this.valueBlock.isConstructed = this.idBlock.isConstructed;\r\n this.valueBlock.isIndefiniteForm = this.lenBlock.isIndefiniteForm;\r\n if (inputLength === 0) {\r\n if (this.idBlock.error.length === 0)\r\n this.blockLength += this.idBlock.blockLength;\r\n if (this.lenBlock.error.length === 0)\r\n this.blockLength += this.lenBlock.blockLength;\r\n return inputOffset;\r\n }\r\n if (!this.valueBlock.isConstructed) {\r\n const view = inputBuffer instanceof ArrayBuffer ? new Uint8Array(inputBuffer) : inputBuffer;\r\n const buf = view.subarray(inputOffset, inputOffset + inputLength);\r\n try {\r\n if (buf.byteLength) {\r\n const asn = localFromBER(buf, 0, buf.byteLength);\r\n if (asn.offset !== -1 && asn.offset === inputLength) {\r\n this.valueBlock.value = [asn.result];\r\n }\r\n }\r\n }\r\n catch (e) {\r\n }\r\n }\r\n return super.fromBER(inputBuffer, inputOffset, inputLength);\r\n }\r\n onAsciiEncoding() {\r\n if (this.valueBlock.isConstructed || (this.valueBlock.value && this.valueBlock.value.length)) {\r\n return Constructed.prototype.onAsciiEncoding.call(this);\r\n }\r\n return `${this.constructor.NAME} : ${pvtsutils.Convert.ToHex(this.valueBlock.valueHexView)}`;\r\n }\r\n getValue() {\r\n if (!this.idBlock.isConstructed) {\r\n return this.valueBlock.valueHexView.slice().buffer;\r\n }\r\n const array = [];\r\n for (const content of this.valueBlock.value) {\r\n if (content instanceof OctetString) {\r\n array.push(content.valueBlock.valueHexView);\r\n }\r\n }\r\n return pvtsutils.BufferSourceConverter.concat(array);\r\n }\r\n}\r\n_a$r = OctetString;\r\n(() => {\r\n typeStore.OctetString = _a$r;\r\n})();\r\nOctetString.NAME = OCTET_STRING_NAME;\n\nclass LocalBitStringValueBlock extends HexBlock(LocalConstructedValueBlock) {\r\n constructor({ unusedBits = 0, isConstructed = false, ...parameters } = {}) {\r\n super(parameters);\r\n this.unusedBits = unusedBits;\r\n this.isConstructed = isConstructed;\r\n this.blockLength = this.valueHexView.byteLength;\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n if (!inputLength) {\r\n return inputOffset;\r\n }\r\n let resultOffset = -1;\r\n if (this.isConstructed) {\r\n resultOffset = LocalConstructedValueBlock.prototype.fromBER.call(this, inputBuffer, inputOffset, inputLength);\r\n if (resultOffset === -1)\r\n return resultOffset;\r\n for (const value of this.value) {\r\n const currentBlockName = value.constructor.NAME;\r\n if (currentBlockName === END_OF_CONTENT_NAME) {\r\n if (this.isIndefiniteForm)\r\n break;\r\n else {\r\n this.error = \"EndOfContent is unexpected, BIT STRING may consists of BIT STRINGs only\";\r\n return -1;\r\n }\r\n }\r\n if (currentBlockName !== BIT_STRING_NAME) {\r\n this.error = \"BIT STRING may consists of BIT STRINGs only\";\r\n return -1;\r\n }\r\n const valueBlock = value.valueBlock;\r\n if ((this.unusedBits > 0) && (valueBlock.unusedBits > 0)) {\r\n this.error = \"Using of \\\"unused bits\\\" inside constructive BIT STRING allowed for least one only\";\r\n return -1;\r\n }\r\n this.unusedBits = valueBlock.unusedBits;\r\n }\r\n return resultOffset;\r\n }\r\n const inputView = pvtsutils.BufferSourceConverter.toUint8Array(inputBuffer);\r\n if (!checkBufferParams(this, inputView, inputOffset, inputLength)) {\r\n return -1;\r\n }\r\n const intBuffer = inputView.subarray(inputOffset, inputOffset + inputLength);\r\n this.unusedBits = intBuffer[0];\r\n if (this.unusedBits > 7) {\r\n this.error = \"Unused bits for BitString must be in range 0-7\";\r\n return -1;\r\n }\r\n if (!this.unusedBits) {\r\n const buf = intBuffer.subarray(1);\r\n try {\r\n if (buf.byteLength) {\r\n const asn = localFromBER(buf, 0, buf.byteLength);\r\n if (asn.offset !== -1 && asn.offset === (inputLength - 1)) {\r\n this.value = [asn.result];\r\n }\r\n }\r\n }\r\n catch (e) {\r\n }\r\n }\r\n this.valueHexView = intBuffer.subarray(1);\r\n this.blockLength = intBuffer.length;\r\n return (inputOffset + inputLength);\r\n }\r\n toBER(sizeOnly, writer) {\r\n if (this.isConstructed) {\r\n return LocalConstructedValueBlock.prototype.toBER.call(this, sizeOnly, writer);\r\n }\r\n if (sizeOnly) {\r\n return new ArrayBuffer(this.valueHexView.byteLength + 1);\r\n }\r\n if (!this.valueHexView.byteLength) {\r\n return EMPTY_BUFFER;\r\n }\r\n const retView = new Uint8Array(this.valueHexView.length + 1);\r\n retView[0] = this.unusedBits;\r\n retView.set(this.valueHexView, 1);\r\n return retView.buffer;\r\n }\r\n toJSON() {\r\n return {\r\n ...super.toJSON(),\r\n unusedBits: this.unusedBits,\r\n isConstructed: this.isConstructed,\r\n };\r\n }\r\n}\r\nLocalBitStringValueBlock.NAME = \"BitStringValueBlock\";\n\nvar _a$q;\r\nclass BitString extends BaseBlock {\r\n constructor({ idBlock = {}, lenBlock = {}, ...parameters } = {}) {\r\n var _b, _c;\r\n (_b = parameters.isConstructed) !== null && _b !== void 0 ? _b : (parameters.isConstructed = !!((_c = parameters.value) === null || _c === void 0 ? void 0 : _c.length));\r\n super({\r\n idBlock: {\r\n isConstructed: parameters.isConstructed,\r\n ...idBlock,\r\n },\r\n lenBlock: {\r\n ...lenBlock,\r\n isIndefiniteForm: !!parameters.isIndefiniteForm,\r\n },\r\n ...parameters,\r\n }, LocalBitStringValueBlock);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 3;\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n this.valueBlock.isConstructed = this.idBlock.isConstructed;\r\n this.valueBlock.isIndefiniteForm = this.lenBlock.isIndefiniteForm;\r\n return super.fromBER(inputBuffer, inputOffset, inputLength);\r\n }\r\n onAsciiEncoding() {\r\n if (this.valueBlock.isConstructed || (this.valueBlock.value && this.valueBlock.value.length)) {\r\n return Constructed.prototype.onAsciiEncoding.call(this);\r\n }\r\n else {\r\n const bits = [];\r\n const valueHex = this.valueBlock.valueHexView;\r\n for (const byte of valueHex) {\r\n bits.push(byte.toString(2).padStart(8, \"0\"));\r\n }\r\n const bitsStr = bits.join(\"\");\r\n return `${this.constructor.NAME} : ${bitsStr.substring(0, bitsStr.length - this.valueBlock.unusedBits)}`;\r\n }\r\n }\r\n}\r\n_a$q = BitString;\r\n(() => {\r\n typeStore.BitString = _a$q;\r\n})();\r\nBitString.NAME = BIT_STRING_NAME;\n\nvar _a$p;\r\nfunction viewAdd(first, second) {\r\n const c = new Uint8Array([0]);\r\n const firstView = new Uint8Array(first);\r\n const secondView = new Uint8Array(second);\r\n let firstViewCopy = firstView.slice(0);\r\n const firstViewCopyLength = firstViewCopy.length - 1;\r\n const secondViewCopy = secondView.slice(0);\r\n const secondViewCopyLength = secondViewCopy.length - 1;\r\n let value = 0;\r\n const max = (secondViewCopyLength < firstViewCopyLength) ? firstViewCopyLength : secondViewCopyLength;\r\n let counter = 0;\r\n for (let i = max; i >= 0; i--, counter++) {\r\n switch (true) {\r\n case (counter < secondViewCopy.length):\r\n value = firstViewCopy[firstViewCopyLength - counter] + secondViewCopy[secondViewCopyLength - counter] + c[0];\r\n break;\r\n default:\r\n value = firstViewCopy[firstViewCopyLength - counter] + c[0];\r\n }\r\n c[0] = value / 10;\r\n switch (true) {\r\n case (counter >= firstViewCopy.length):\r\n firstViewCopy = pvutils.utilConcatView(new Uint8Array([value % 10]), firstViewCopy);\r\n break;\r\n default:\r\n firstViewCopy[firstViewCopyLength - counter] = value % 10;\r\n }\r\n }\r\n if (c[0] > 0)\r\n firstViewCopy = pvutils.utilConcatView(c, firstViewCopy);\r\n return firstViewCopy;\r\n}\r\nfunction power2(n) {\r\n if (n >= powers2.length) {\r\n for (let p = powers2.length; p <= n; p++) {\r\n const c = new Uint8Array([0]);\r\n let digits = (powers2[p - 1]).slice(0);\r\n for (let i = (digits.length - 1); i >= 0; i--) {\r\n const newValue = new Uint8Array([(digits[i] << 1) + c[0]]);\r\n c[0] = newValue[0] / 10;\r\n digits[i] = newValue[0] % 10;\r\n }\r\n if (c[0] > 0)\r\n digits = pvutils.utilConcatView(c, digits);\r\n powers2.push(digits);\r\n }\r\n }\r\n return powers2[n];\r\n}\r\nfunction viewSub(first, second) {\r\n let b = 0;\r\n const firstView = new Uint8Array(first);\r\n const secondView = new Uint8Array(second);\r\n const firstViewCopy = firstView.slice(0);\r\n const firstViewCopyLength = firstViewCopy.length - 1;\r\n const secondViewCopy = secondView.slice(0);\r\n const secondViewCopyLength = secondViewCopy.length - 1;\r\n let value;\r\n let counter = 0;\r\n for (let i = secondViewCopyLength; i >= 0; i--, counter++) {\r\n value = firstViewCopy[firstViewCopyLength - counter] - secondViewCopy[secondViewCopyLength - counter] - b;\r\n switch (true) {\r\n case (value < 0):\r\n b = 1;\r\n firstViewCopy[firstViewCopyLength - counter] = value + 10;\r\n break;\r\n default:\r\n b = 0;\r\n firstViewCopy[firstViewCopyLength - counter] = value;\r\n }\r\n }\r\n if (b > 0) {\r\n for (let i = (firstViewCopyLength - secondViewCopyLength + 1); i >= 0; i--, counter++) {\r\n value = firstViewCopy[firstViewCopyLength - counter] - b;\r\n if (value < 0) {\r\n b = 1;\r\n firstViewCopy[firstViewCopyLength - counter] = value + 10;\r\n }\r\n else {\r\n b = 0;\r\n firstViewCopy[firstViewCopyLength - counter] = value;\r\n break;\r\n }\r\n }\r\n }\r\n return firstViewCopy.slice();\r\n}\r\nclass LocalIntegerValueBlock extends HexBlock(ValueBlock) {\r\n constructor({ value, ...parameters } = {}) {\r\n super(parameters);\r\n this._valueDec = 0;\r\n if (parameters.valueHex) {\r\n this.setValueHex();\r\n }\r\n if (value !== undefined) {\r\n this.valueDec = value;\r\n }\r\n }\r\n setValueHex() {\r\n if (this.valueHexView.length >= 4) {\r\n this.warnings.push(\"Too big Integer for decoding, hex only\");\r\n this.isHexOnly = true;\r\n this._valueDec = 0;\r\n }\r\n else {\r\n this.isHexOnly = false;\r\n if (this.valueHexView.length > 0) {\r\n this._valueDec = pvutils.utilDecodeTC.call(this);\r\n }\r\n }\r\n }\r\n set valueDec(v) {\r\n this._valueDec = v;\r\n this.isHexOnly = false;\r\n this.valueHexView = new Uint8Array(pvutils.utilEncodeTC(v));\r\n }\r\n get valueDec() {\r\n return this._valueDec;\r\n }\r\n fromDER(inputBuffer, inputOffset, inputLength, expectedLength = 0) {\r\n const offset = this.fromBER(inputBuffer, inputOffset, inputLength);\r\n if (offset === -1)\r\n return offset;\r\n const view = this.valueHexView;\r\n if ((view[0] === 0x00) && ((view[1] & 0x80) !== 0)) {\r\n this.valueHexView = view.subarray(1);\r\n }\r\n else {\r\n if (expectedLength !== 0) {\r\n if (view.length < expectedLength) {\r\n if ((expectedLength - view.length) > 1)\r\n expectedLength = view.length + 1;\r\n this.valueHexView = view.subarray(expectedLength - view.length);\r\n }\r\n }\r\n }\r\n return offset;\r\n }\r\n toDER(sizeOnly = false) {\r\n const view = this.valueHexView;\r\n switch (true) {\r\n case ((view[0] & 0x80) !== 0):\r\n {\r\n const updatedView = new Uint8Array(this.valueHexView.length + 1);\r\n updatedView[0] = 0x00;\r\n updatedView.set(view, 1);\r\n this.valueHexView = updatedView;\r\n }\r\n break;\r\n case ((view[0] === 0x00) && ((view[1] & 0x80) === 0)):\r\n {\r\n this.valueHexView = this.valueHexView.subarray(1);\r\n }\r\n break;\r\n }\r\n return this.toBER(sizeOnly);\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n const resultOffset = super.fromBER(inputBuffer, inputOffset, inputLength);\r\n if (resultOffset === -1) {\r\n return resultOffset;\r\n }\r\n this.setValueHex();\r\n return resultOffset;\r\n }\r\n toBER(sizeOnly) {\r\n return sizeOnly\r\n ? new ArrayBuffer(this.valueHexView.length)\r\n : this.valueHexView.slice().buffer;\r\n }\r\n toJSON() {\r\n return {\r\n ...super.toJSON(),\r\n valueDec: this.valueDec,\r\n };\r\n }\r\n toString() {\r\n const firstBit = (this.valueHexView.length * 8) - 1;\r\n let digits = new Uint8Array((this.valueHexView.length * 8) / 3);\r\n let bitNumber = 0;\r\n let currentByte;\r\n const asn1View = this.valueHexView;\r\n let result = \"\";\r\n let flag = false;\r\n for (let byteNumber = (asn1View.byteLength - 1); byteNumber >= 0; byteNumber--) {\r\n currentByte = asn1View[byteNumber];\r\n for (let i = 0; i < 8; i++) {\r\n if ((currentByte & 1) === 1) {\r\n switch (bitNumber) {\r\n case firstBit:\r\n digits = viewSub(power2(bitNumber), digits);\r\n result = \"-\";\r\n break;\r\n default:\r\n digits = viewAdd(digits, power2(bitNumber));\r\n }\r\n }\r\n bitNumber++;\r\n currentByte >>= 1;\r\n }\r\n }\r\n for (let i = 0; i < digits.length; i++) {\r\n if (digits[i])\r\n flag = true;\r\n if (flag)\r\n result += digitsString.charAt(digits[i]);\r\n }\r\n if (flag === false)\r\n result += digitsString.charAt(0);\r\n return result;\r\n }\r\n}\r\n_a$p = LocalIntegerValueBlock;\r\nLocalIntegerValueBlock.NAME = \"IntegerValueBlock\";\r\n(() => {\r\n Object.defineProperty(_a$p.prototype, \"valueHex\", {\r\n set: function (v) {\r\n this.valueHexView = new Uint8Array(v);\r\n this.setValueHex();\r\n },\r\n get: function () {\r\n return this.valueHexView.slice().buffer;\r\n },\r\n });\r\n})();\n\nvar _a$o;\r\nclass Integer extends BaseBlock {\r\n constructor(parameters = {}) {\r\n super(parameters, LocalIntegerValueBlock);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 2;\r\n }\r\n toBigInt() {\r\n assertBigInt();\r\n return BigInt(this.valueBlock.toString());\r\n }\r\n static fromBigInt(value) {\r\n assertBigInt();\r\n const bigIntValue = BigInt(value);\r\n const writer = new ViewWriter();\r\n const hex = bigIntValue.toString(16).replace(/^-/, \"\");\r\n const view = new Uint8Array(pvtsutils.Convert.FromHex(hex));\r\n if (bigIntValue < 0) {\r\n const first = new Uint8Array(view.length + (view[0] & 0x80 ? 1 : 0));\r\n first[0] |= 0x80;\r\n const firstInt = BigInt(`0x${pvtsutils.Convert.ToHex(first)}`);\r\n const secondInt = firstInt + bigIntValue;\r\n const second = pvtsutils.BufferSourceConverter.toUint8Array(pvtsutils.Convert.FromHex(secondInt.toString(16)));\r\n second[0] |= 0x80;\r\n writer.write(second);\r\n }\r\n else {\r\n if (view[0] & 0x80) {\r\n writer.write(new Uint8Array([0]));\r\n }\r\n writer.write(view);\r\n }\r\n const res = new Integer({\r\n valueHex: writer.final(),\r\n });\r\n return res;\r\n }\r\n convertToDER() {\r\n const integer = new Integer({ valueHex: this.valueBlock.valueHexView });\r\n integer.valueBlock.toDER();\r\n return integer;\r\n }\r\n convertFromDER() {\r\n return new Integer({\r\n valueHex: this.valueBlock.valueHexView[0] === 0\r\n ? this.valueBlock.valueHexView.subarray(1)\r\n : this.valueBlock.valueHexView,\r\n });\r\n }\r\n onAsciiEncoding() {\r\n return `${this.constructor.NAME} : ${this.valueBlock.toString()}`;\r\n }\r\n}\r\n_a$o = Integer;\r\n(() => {\r\n typeStore.Integer = _a$o;\r\n})();\r\nInteger.NAME = \"INTEGER\";\n\nvar _a$n;\r\nclass Enumerated extends Integer {\r\n constructor(parameters = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 10;\r\n }\r\n}\r\n_a$n = Enumerated;\r\n(() => {\r\n typeStore.Enumerated = _a$n;\r\n})();\r\nEnumerated.NAME = \"ENUMERATED\";\n\nclass LocalSidValueBlock extends HexBlock(ValueBlock) {\r\n constructor({ valueDec = -1, isFirstSid = false, ...parameters } = {}) {\r\n super(parameters);\r\n this.valueDec = valueDec;\r\n this.isFirstSid = isFirstSid;\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n if (!inputLength) {\r\n return inputOffset;\r\n }\r\n const inputView = pvtsutils.BufferSourceConverter.toUint8Array(inputBuffer);\r\n if (!checkBufferParams(this, inputView, inputOffset, inputLength)) {\r\n return -1;\r\n }\r\n const intBuffer = inputView.subarray(inputOffset, inputOffset + inputLength);\r\n this.valueHexView = new Uint8Array(inputLength);\r\n for (let i = 0; i < inputLength; i++) {\r\n this.valueHexView[i] = intBuffer[i] & 0x7F;\r\n this.blockLength++;\r\n if ((intBuffer[i] & 0x80) === 0x00)\r\n break;\r\n }\r\n const tempView = new Uint8Array(this.blockLength);\r\n for (let i = 0; i < this.blockLength; i++) {\r\n tempView[i] = this.valueHexView[i];\r\n }\r\n this.valueHexView = tempView;\r\n if ((intBuffer[this.blockLength - 1] & 0x80) !== 0x00) {\r\n this.error = \"End of input reached before message was fully decoded\";\r\n return -1;\r\n }\r\n if (this.valueHexView[0] === 0x00)\r\n this.warnings.push(\"Needlessly long format of SID encoding\");\r\n if (this.blockLength <= 8)\r\n this.valueDec = pvutils.utilFromBase(this.valueHexView, 7);\r\n else {\r\n this.isHexOnly = true;\r\n this.warnings.push(\"Too big SID for decoding, hex only\");\r\n }\r\n return (inputOffset + this.blockLength);\r\n }\r\n set valueBigInt(value) {\r\n assertBigInt();\r\n let bits = BigInt(value).toString(2);\r\n while (bits.length % 7) {\r\n bits = \"0\" + bits;\r\n }\r\n const bytes = new Uint8Array(bits.length / 7);\r\n for (let i = 0; i < bytes.length; i++) {\r\n bytes[i] = parseInt(bits.slice(i * 7, i * 7 + 7), 2) + (i + 1 < bytes.length ? 0x80 : 0);\r\n }\r\n this.fromBER(bytes.buffer, 0, bytes.length);\r\n }\r\n toBER(sizeOnly) {\r\n if (this.isHexOnly) {\r\n if (sizeOnly)\r\n return (new ArrayBuffer(this.valueHexView.byteLength));\r\n const curView = this.valueHexView;\r\n const retView = new Uint8Array(this.blockLength);\r\n for (let i = 0; i < (this.blockLength - 1); i++)\r\n retView[i] = curView[i] | 0x80;\r\n retView[this.blockLength - 1] = curView[this.blockLength - 1];\r\n return retView.buffer;\r\n }\r\n const encodedBuf = pvutils.utilToBase(this.valueDec, 7);\r\n if (encodedBuf.byteLength === 0) {\r\n this.error = \"Error during encoding SID value\";\r\n return EMPTY_BUFFER;\r\n }\r\n const retView = new Uint8Array(encodedBuf.byteLength);\r\n if (!sizeOnly) {\r\n const encodedView = new Uint8Array(encodedBuf);\r\n const len = encodedBuf.byteLength - 1;\r\n for (let i = 0; i < len; i++)\r\n retView[i] = encodedView[i] | 0x80;\r\n retView[len] = encodedView[len];\r\n }\r\n return retView;\r\n }\r\n toString() {\r\n let result = \"\";\r\n if (this.isHexOnly)\r\n result = pvtsutils.Convert.ToHex(this.valueHexView);\r\n else {\r\n if (this.isFirstSid) {\r\n let sidValue = this.valueDec;\r\n if (this.valueDec <= 39)\r\n result = \"0.\";\r\n else {\r\n if (this.valueDec <= 79) {\r\n result = \"1.\";\r\n sidValue -= 40;\r\n }\r\n else {\r\n result = \"2.\";\r\n sidValue -= 80;\r\n }\r\n }\r\n result += sidValue.toString();\r\n }\r\n else\r\n result = this.valueDec.toString();\r\n }\r\n return result;\r\n }\r\n toJSON() {\r\n return {\r\n ...super.toJSON(),\r\n valueDec: this.valueDec,\r\n isFirstSid: this.isFirstSid,\r\n };\r\n }\r\n}\r\nLocalSidValueBlock.NAME = \"sidBlock\";\n\nclass LocalObjectIdentifierValueBlock extends ValueBlock {\r\n constructor({ value = EMPTY_STRING, ...parameters } = {}) {\r\n super(parameters);\r\n this.value = [];\r\n if (value) {\r\n this.fromString(value);\r\n }\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n let resultOffset = inputOffset;\r\n while (inputLength > 0) {\r\n const sidBlock = new LocalSidValueBlock();\r\n resultOffset = sidBlock.fromBER(inputBuffer, resultOffset, inputLength);\r\n if (resultOffset === -1) {\r\n this.blockLength = 0;\r\n this.error = sidBlock.error;\r\n return resultOffset;\r\n }\r\n if (this.value.length === 0)\r\n sidBlock.isFirstSid = true;\r\n this.blockLength += sidBlock.blockLength;\r\n inputLength -= sidBlock.blockLength;\r\n this.value.push(sidBlock);\r\n }\r\n return resultOffset;\r\n }\r\n toBER(sizeOnly) {\r\n const retBuffers = [];\r\n for (let i = 0; i < this.value.length; i++) {\r\n const valueBuf = this.value[i].toBER(sizeOnly);\r\n if (valueBuf.byteLength === 0) {\r\n this.error = this.value[i].error;\r\n return EMPTY_BUFFER;\r\n }\r\n retBuffers.push(valueBuf);\r\n }\r\n return concat(retBuffers);\r\n }\r\n fromString(string) {\r\n this.value = [];\r\n let pos1 = 0;\r\n let pos2 = 0;\r\n let sid = \"\";\r\n let flag = false;\r\n do {\r\n pos2 = string.indexOf(\".\", pos1);\r\n if (pos2 === -1)\r\n sid = string.substring(pos1);\r\n else\r\n sid = string.substring(pos1, pos2);\r\n pos1 = pos2 + 1;\r\n if (flag) {\r\n const sidBlock = this.value[0];\r\n let plus = 0;\r\n switch (sidBlock.valueDec) {\r\n case 0:\r\n break;\r\n case 1:\r\n plus = 40;\r\n break;\r\n case 2:\r\n plus = 80;\r\n break;\r\n default:\r\n this.value = [];\r\n return;\r\n }\r\n const parsedSID = parseInt(sid, 10);\r\n if (isNaN(parsedSID))\r\n return;\r\n sidBlock.valueDec = parsedSID + plus;\r\n flag = false;\r\n }\r\n else {\r\n const sidBlock = new LocalSidValueBlock();\r\n if (sid > Number.MAX_SAFE_INTEGER) {\r\n assertBigInt();\r\n const sidValue = BigInt(sid);\r\n sidBlock.valueBigInt = sidValue;\r\n }\r\n else {\r\n sidBlock.valueDec = parseInt(sid, 10);\r\n if (isNaN(sidBlock.valueDec))\r\n return;\r\n }\r\n if (!this.value.length) {\r\n sidBlock.isFirstSid = true;\r\n flag = true;\r\n }\r\n this.value.push(sidBlock);\r\n }\r\n } while (pos2 !== -1);\r\n }\r\n toString() {\r\n let result = \"\";\r\n let isHexOnly = false;\r\n for (let i = 0; i < this.value.length; i++) {\r\n isHexOnly = this.value[i].isHexOnly;\r\n let sidStr = this.value[i].toString();\r\n if (i !== 0)\r\n result = `${result}.`;\r\n if (isHexOnly) {\r\n sidStr = `{${sidStr}}`;\r\n if (this.value[i].isFirstSid)\r\n result = `2.{${sidStr} - 80}`;\r\n else\r\n result += sidStr;\r\n }\r\n else\r\n result += sidStr;\r\n }\r\n return result;\r\n }\r\n toJSON() {\r\n const object = {\r\n ...super.toJSON(),\r\n value: this.toString(),\r\n sidArray: [],\r\n };\r\n for (let i = 0; i < this.value.length; i++) {\r\n object.sidArray.push(this.value[i].toJSON());\r\n }\r\n return object;\r\n }\r\n}\r\nLocalObjectIdentifierValueBlock.NAME = \"ObjectIdentifierValueBlock\";\n\nvar _a$m;\r\nclass ObjectIdentifier extends BaseBlock {\r\n constructor(parameters = {}) {\r\n super(parameters, LocalObjectIdentifierValueBlock);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 6;\r\n }\r\n getValue() {\r\n return this.valueBlock.toString();\r\n }\r\n setValue(value) {\r\n this.valueBlock.fromString(value);\r\n }\r\n onAsciiEncoding() {\r\n return `${this.constructor.NAME} : ${this.valueBlock.toString() || \"empty\"}`;\r\n }\r\n toJSON() {\r\n return {\r\n ...super.toJSON(),\r\n value: this.getValue(),\r\n };\r\n }\r\n}\r\n_a$m = ObjectIdentifier;\r\n(() => {\r\n typeStore.ObjectIdentifier = _a$m;\r\n})();\r\nObjectIdentifier.NAME = \"OBJECT IDENTIFIER\";\n\nclass LocalRelativeSidValueBlock extends HexBlock(LocalBaseBlock) {\r\n constructor({ valueDec = 0, ...parameters } = {}) {\r\n super(parameters);\r\n this.valueDec = valueDec;\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n if (inputLength === 0)\r\n return inputOffset;\r\n const inputView = pvtsutils.BufferSourceConverter.toUint8Array(inputBuffer);\r\n if (!checkBufferParams(this, inputView, inputOffset, inputLength))\r\n return -1;\r\n const intBuffer = inputView.subarray(inputOffset, inputOffset + inputLength);\r\n this.valueHexView = new Uint8Array(inputLength);\r\n for (let i = 0; i < inputLength; i++) {\r\n this.valueHexView[i] = intBuffer[i] & 0x7F;\r\n this.blockLength++;\r\n if ((intBuffer[i] & 0x80) === 0x00)\r\n break;\r\n }\r\n const tempView = new Uint8Array(this.blockLength);\r\n for (let i = 0; i < this.blockLength; i++)\r\n tempView[i] = this.valueHexView[i];\r\n this.valueHexView = tempView;\r\n if ((intBuffer[this.blockLength - 1] & 0x80) !== 0x00) {\r\n this.error = \"End of input reached before message was fully decoded\";\r\n return -1;\r\n }\r\n if (this.valueHexView[0] === 0x00)\r\n this.warnings.push(\"Needlessly long format of SID encoding\");\r\n if (this.blockLength <= 8)\r\n this.valueDec = pvutils.utilFromBase(this.valueHexView, 7);\r\n else {\r\n this.isHexOnly = true;\r\n this.warnings.push(\"Too big SID for decoding, hex only\");\r\n }\r\n return (inputOffset + this.blockLength);\r\n }\r\n toBER(sizeOnly) {\r\n if (this.isHexOnly) {\r\n if (sizeOnly)\r\n return (new ArrayBuffer(this.valueHexView.byteLength));\r\n const curView = this.valueHexView;\r\n const retView = new Uint8Array(this.blockLength);\r\n for (let i = 0; i < (this.blockLength - 1); i++)\r\n retView[i] = curView[i] | 0x80;\r\n retView[this.blockLength - 1] = curView[this.blockLength - 1];\r\n return retView.buffer;\r\n }\r\n const encodedBuf = pvutils.utilToBase(this.valueDec, 7);\r\n if (encodedBuf.byteLength === 0) {\r\n this.error = \"Error during encoding SID value\";\r\n return EMPTY_BUFFER;\r\n }\r\n const retView = new Uint8Array(encodedBuf.byteLength);\r\n if (!sizeOnly) {\r\n const encodedView = new Uint8Array(encodedBuf);\r\n const len = encodedBuf.byteLength - 1;\r\n for (let i = 0; i < len; i++)\r\n retView[i] = encodedView[i] | 0x80;\r\n retView[len] = encodedView[len];\r\n }\r\n return retView.buffer;\r\n }\r\n toString() {\r\n let result = \"\";\r\n if (this.isHexOnly)\r\n result = pvtsutils.Convert.ToHex(this.valueHexView);\r\n else {\r\n result = this.valueDec.toString();\r\n }\r\n return result;\r\n }\r\n toJSON() {\r\n return {\r\n ...super.toJSON(),\r\n valueDec: this.valueDec,\r\n };\r\n }\r\n}\r\nLocalRelativeSidValueBlock.NAME = \"relativeSidBlock\";\n\nclass LocalRelativeObjectIdentifierValueBlock extends ValueBlock {\r\n constructor({ value = EMPTY_STRING, ...parameters } = {}) {\r\n super(parameters);\r\n this.value = [];\r\n if (value) {\r\n this.fromString(value);\r\n }\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n let resultOffset = inputOffset;\r\n while (inputLength > 0) {\r\n const sidBlock = new LocalRelativeSidValueBlock();\r\n resultOffset = sidBlock.fromBER(inputBuffer, resultOffset, inputLength);\r\n if (resultOffset === -1) {\r\n this.blockLength = 0;\r\n this.error = sidBlock.error;\r\n return resultOffset;\r\n }\r\n this.blockLength += sidBlock.blockLength;\r\n inputLength -= sidBlock.blockLength;\r\n this.value.push(sidBlock);\r\n }\r\n return resultOffset;\r\n }\r\n toBER(sizeOnly, writer) {\r\n const retBuffers = [];\r\n for (let i = 0; i < this.value.length; i++) {\r\n const valueBuf = this.value[i].toBER(sizeOnly);\r\n if (valueBuf.byteLength === 0) {\r\n this.error = this.value[i].error;\r\n return EMPTY_BUFFER;\r\n }\r\n retBuffers.push(valueBuf);\r\n }\r\n return concat(retBuffers);\r\n }\r\n fromString(string) {\r\n this.value = [];\r\n let pos1 = 0;\r\n let pos2 = 0;\r\n let sid = \"\";\r\n do {\r\n pos2 = string.indexOf(\".\", pos1);\r\n if (pos2 === -1)\r\n sid = string.substring(pos1);\r\n else\r\n sid = string.substring(pos1, pos2);\r\n pos1 = pos2 + 1;\r\n const sidBlock = new LocalRelativeSidValueBlock();\r\n sidBlock.valueDec = parseInt(sid, 10);\r\n if (isNaN(sidBlock.valueDec))\r\n return true;\r\n this.value.push(sidBlock);\r\n } while (pos2 !== -1);\r\n return true;\r\n }\r\n toString() {\r\n let result = \"\";\r\n let isHexOnly = false;\r\n for (let i = 0; i < this.value.length; i++) {\r\n isHexOnly = this.value[i].isHexOnly;\r\n let sidStr = this.value[i].toString();\r\n if (i !== 0)\r\n result = `${result}.`;\r\n if (isHexOnly) {\r\n sidStr = `{${sidStr}}`;\r\n result += sidStr;\r\n }\r\n else\r\n result += sidStr;\r\n }\r\n return result;\r\n }\r\n toJSON() {\r\n const object = {\r\n ...super.toJSON(),\r\n value: this.toString(),\r\n sidArray: [],\r\n };\r\n for (let i = 0; i < this.value.length; i++)\r\n object.sidArray.push(this.value[i].toJSON());\r\n return object;\r\n }\r\n}\r\nLocalRelativeObjectIdentifierValueBlock.NAME = \"RelativeObjectIdentifierValueBlock\";\n\nvar _a$l;\r\nclass RelativeObjectIdentifier extends BaseBlock {\r\n constructor(parameters = {}) {\r\n super(parameters, LocalRelativeObjectIdentifierValueBlock);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 13;\r\n }\r\n getValue() {\r\n return this.valueBlock.toString();\r\n }\r\n setValue(value) {\r\n this.valueBlock.fromString(value);\r\n }\r\n onAsciiEncoding() {\r\n return `${this.constructor.NAME} : ${this.valueBlock.toString() || \"empty\"}`;\r\n }\r\n toJSON() {\r\n return {\r\n ...super.toJSON(),\r\n value: this.getValue(),\r\n };\r\n }\r\n}\r\n_a$l = RelativeObjectIdentifier;\r\n(() => {\r\n typeStore.RelativeObjectIdentifier = _a$l;\r\n})();\r\nRelativeObjectIdentifier.NAME = \"RelativeObjectIdentifier\";\n\nvar _a$k;\r\nclass Sequence extends Constructed {\r\n constructor(parameters = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 16;\r\n }\r\n}\r\n_a$k = Sequence;\r\n(() => {\r\n typeStore.Sequence = _a$k;\r\n})();\r\nSequence.NAME = \"SEQUENCE\";\n\nvar _a$j;\r\nclass Set extends Constructed {\r\n constructor(parameters = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 17;\r\n }\r\n}\r\n_a$j = Set;\r\n(() => {\r\n typeStore.Set = _a$j;\r\n})();\r\nSet.NAME = \"SET\";\n\nclass LocalStringValueBlock extends HexBlock(ValueBlock) {\r\n constructor({ ...parameters } = {}) {\r\n super(parameters);\r\n this.isHexOnly = true;\r\n this.value = EMPTY_STRING;\r\n }\r\n toJSON() {\r\n return {\r\n ...super.toJSON(),\r\n value: this.value,\r\n };\r\n }\r\n}\r\nLocalStringValueBlock.NAME = \"StringValueBlock\";\n\nclass LocalSimpleStringValueBlock extends LocalStringValueBlock {\r\n}\r\nLocalSimpleStringValueBlock.NAME = \"SimpleStringValueBlock\";\n\nclass LocalSimpleStringBlock extends BaseStringBlock {\r\n constructor({ ...parameters } = {}) {\r\n super(parameters, LocalSimpleStringValueBlock);\r\n }\r\n fromBuffer(inputBuffer) {\r\n this.valueBlock.value = String.fromCharCode.apply(null, pvtsutils.BufferSourceConverter.toUint8Array(inputBuffer));\r\n }\r\n fromString(inputString) {\r\n const strLen = inputString.length;\r\n const view = this.valueBlock.valueHexView = new Uint8Array(strLen);\r\n for (let i = 0; i < strLen; i++)\r\n view[i] = inputString.charCodeAt(i);\r\n this.valueBlock.value = inputString;\r\n }\r\n}\r\nLocalSimpleStringBlock.NAME = \"SIMPLE STRING\";\n\nclass LocalUtf8StringValueBlock extends LocalSimpleStringBlock {\r\n fromBuffer(inputBuffer) {\r\n this.valueBlock.valueHexView = pvtsutils.BufferSourceConverter.toUint8Array(inputBuffer);\r\n try {\r\n this.valueBlock.value = pvtsutils.Convert.ToUtf8String(inputBuffer);\r\n }\r\n catch (ex) {\r\n this.warnings.push(`Error during \"decodeURIComponent\": ${ex}, using raw string`);\r\n this.valueBlock.value = pvtsutils.Convert.ToBinary(inputBuffer);\r\n }\r\n }\r\n fromString(inputString) {\r\n this.valueBlock.valueHexView = new Uint8Array(pvtsutils.Convert.FromUtf8String(inputString));\r\n this.valueBlock.value = inputString;\r\n }\r\n}\r\nLocalUtf8StringValueBlock.NAME = \"Utf8StringValueBlock\";\n\nvar _a$i;\r\nclass Utf8String extends LocalUtf8StringValueBlock {\r\n constructor(parameters = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 12;\r\n }\r\n}\r\n_a$i = Utf8String;\r\n(() => {\r\n typeStore.Utf8String = _a$i;\r\n})();\r\nUtf8String.NAME = \"UTF8String\";\n\nclass LocalBmpStringValueBlock extends LocalSimpleStringBlock {\r\n fromBuffer(inputBuffer) {\r\n this.valueBlock.value = pvtsutils.Convert.ToUtf16String(inputBuffer);\r\n this.valueBlock.valueHexView = pvtsutils.BufferSourceConverter.toUint8Array(inputBuffer);\r\n }\r\n fromString(inputString) {\r\n this.valueBlock.value = inputString;\r\n this.valueBlock.valueHexView = new Uint8Array(pvtsutils.Convert.FromUtf16String(inputString));\r\n }\r\n}\r\nLocalBmpStringValueBlock.NAME = \"BmpStringValueBlock\";\n\nvar _a$h;\r\nclass BmpString extends LocalBmpStringValueBlock {\r\n constructor({ ...parameters } = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 30;\r\n }\r\n}\r\n_a$h = BmpString;\r\n(() => {\r\n typeStore.BmpString = _a$h;\r\n})();\r\nBmpString.NAME = \"BMPString\";\n\nclass LocalUniversalStringValueBlock extends LocalSimpleStringBlock {\r\n fromBuffer(inputBuffer) {\r\n const copyBuffer = ArrayBuffer.isView(inputBuffer) ? inputBuffer.slice().buffer : inputBuffer.slice(0);\r\n const valueView = new Uint8Array(copyBuffer);\r\n for (let i = 0; i < valueView.length; i += 4) {\r\n valueView[i] = valueView[i + 3];\r\n valueView[i + 1] = valueView[i + 2];\r\n valueView[i + 2] = 0x00;\r\n valueView[i + 3] = 0x00;\r\n }\r\n this.valueBlock.value = String.fromCharCode.apply(null, new Uint32Array(copyBuffer));\r\n }\r\n fromString(inputString) {\r\n const strLength = inputString.length;\r\n const valueHexView = this.valueBlock.valueHexView = new Uint8Array(strLength * 4);\r\n for (let i = 0; i < strLength; i++) {\r\n const codeBuf = pvutils.utilToBase(inputString.charCodeAt(i), 8);\r\n const codeView = new Uint8Array(codeBuf);\r\n if (codeView.length > 4)\r\n continue;\r\n const dif = 4 - codeView.length;\r\n for (let j = (codeView.length - 1); j >= 0; j--)\r\n valueHexView[i * 4 + j + dif] = codeView[j];\r\n }\r\n this.valueBlock.value = inputString;\r\n }\r\n}\r\nLocalUniversalStringValueBlock.NAME = \"UniversalStringValueBlock\";\n\nvar _a$g;\r\nclass UniversalString extends LocalUniversalStringValueBlock {\r\n constructor({ ...parameters } = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 28;\r\n }\r\n}\r\n_a$g = UniversalString;\r\n(() => {\r\n typeStore.UniversalString = _a$g;\r\n})();\r\nUniversalString.NAME = \"UniversalString\";\n\nvar _a$f;\r\nclass NumericString extends LocalSimpleStringBlock {\r\n constructor(parameters = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 18;\r\n }\r\n}\r\n_a$f = NumericString;\r\n(() => {\r\n typeStore.NumericString = _a$f;\r\n})();\r\nNumericString.NAME = \"NumericString\";\n\nvar _a$e;\r\nclass PrintableString extends LocalSimpleStringBlock {\r\n constructor(parameters = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 19;\r\n }\r\n}\r\n_a$e = PrintableString;\r\n(() => {\r\n typeStore.PrintableString = _a$e;\r\n})();\r\nPrintableString.NAME = \"PrintableString\";\n\nvar _a$d;\r\nclass TeletexString extends LocalSimpleStringBlock {\r\n constructor(parameters = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 20;\r\n }\r\n}\r\n_a$d = TeletexString;\r\n(() => {\r\n typeStore.TeletexString = _a$d;\r\n})();\r\nTeletexString.NAME = \"TeletexString\";\n\nvar _a$c;\r\nclass VideotexString extends LocalSimpleStringBlock {\r\n constructor(parameters = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 21;\r\n }\r\n}\r\n_a$c = VideotexString;\r\n(() => {\r\n typeStore.VideotexString = _a$c;\r\n})();\r\nVideotexString.NAME = \"VideotexString\";\n\nvar _a$b;\r\nclass IA5String extends LocalSimpleStringBlock {\r\n constructor(parameters = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 22;\r\n }\r\n}\r\n_a$b = IA5String;\r\n(() => {\r\n typeStore.IA5String = _a$b;\r\n})();\r\nIA5String.NAME = \"IA5String\";\n\nvar _a$a;\r\nclass GraphicString extends LocalSimpleStringBlock {\r\n constructor(parameters = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 25;\r\n }\r\n}\r\n_a$a = GraphicString;\r\n(() => {\r\n typeStore.GraphicString = _a$a;\r\n})();\r\nGraphicString.NAME = \"GraphicString\";\n\nvar _a$9;\r\nclass VisibleString extends LocalSimpleStringBlock {\r\n constructor(parameters = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 26;\r\n }\r\n}\r\n_a$9 = VisibleString;\r\n(() => {\r\n typeStore.VisibleString = _a$9;\r\n})();\r\nVisibleString.NAME = \"VisibleString\";\n\nvar _a$8;\r\nclass GeneralString extends LocalSimpleStringBlock {\r\n constructor(parameters = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 27;\r\n }\r\n}\r\n_a$8 = GeneralString;\r\n(() => {\r\n typeStore.GeneralString = _a$8;\r\n})();\r\nGeneralString.NAME = \"GeneralString\";\n\nvar _a$7;\r\nclass CharacterString extends LocalSimpleStringBlock {\r\n constructor(parameters = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 29;\r\n }\r\n}\r\n_a$7 = CharacterString;\r\n(() => {\r\n typeStore.CharacterString = _a$7;\r\n})();\r\nCharacterString.NAME = \"CharacterString\";\n\nvar _a$6;\r\nclass UTCTime extends VisibleString {\r\n constructor({ value, valueDate, ...parameters } = {}) {\r\n super(parameters);\r\n this.year = 0;\r\n this.month = 0;\r\n this.day = 0;\r\n this.hour = 0;\r\n this.minute = 0;\r\n this.second = 0;\r\n if (value) {\r\n this.fromString(value);\r\n this.valueBlock.valueHexView = new Uint8Array(value.length);\r\n for (let i = 0; i < value.length; i++)\r\n this.valueBlock.valueHexView[i] = value.charCodeAt(i);\r\n }\r\n if (valueDate) {\r\n this.fromDate(valueDate);\r\n this.valueBlock.valueHexView = new Uint8Array(this.toBuffer());\r\n }\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 23;\r\n }\r\n fromBuffer(inputBuffer) {\r\n this.fromString(String.fromCharCode.apply(null, pvtsutils.BufferSourceConverter.toUint8Array(inputBuffer)));\r\n }\r\n toBuffer() {\r\n const str = this.toString();\r\n const buffer = new ArrayBuffer(str.length);\r\n const view = new Uint8Array(buffer);\r\n for (let i = 0; i < str.length; i++)\r\n view[i] = str.charCodeAt(i);\r\n return buffer;\r\n }\r\n fromDate(inputDate) {\r\n this.year = inputDate.getUTCFullYear();\r\n this.month = inputDate.getUTCMonth() + 1;\r\n this.day = inputDate.getUTCDate();\r\n this.hour = inputDate.getUTCHours();\r\n this.minute = inputDate.getUTCMinutes();\r\n this.second = inputDate.getUTCSeconds();\r\n }\r\n toDate() {\r\n return (new Date(Date.UTC(this.year, this.month - 1, this.day, this.hour, this.minute, this.second)));\r\n }\r\n fromString(inputString) {\r\n const parser = /(\\d{2})(\\d{2})(\\d{2})(\\d{2})(\\d{2})(\\d{2})Z/ig;\r\n const parserArray = parser.exec(inputString);\r\n if (parserArray === null) {\r\n this.error = \"Wrong input string for conversion\";\r\n return;\r\n }\r\n const year = parseInt(parserArray[1], 10);\r\n if (year >= 50)\r\n this.year = 1900 + year;\r\n else\r\n this.year = 2000 + year;\r\n this.month = parseInt(parserArray[2], 10);\r\n this.day = parseInt(parserArray[3], 10);\r\n this.hour = parseInt(parserArray[4], 10);\r\n this.minute = parseInt(parserArray[5], 10);\r\n this.second = parseInt(parserArray[6], 10);\r\n }\r\n toString(encoding = \"iso\") {\r\n if (encoding === \"iso\") {\r\n const outputArray = new Array(7);\r\n outputArray[0] = pvutils.padNumber(((this.year < 2000) ? (this.year - 1900) : (this.year - 2000)), 2);\r\n outputArray[1] = pvutils.padNumber(this.month, 2);\r\n outputArray[2] = pvutils.padNumber(this.day, 2);\r\n outputArray[3] = pvutils.padNumber(this.hour, 2);\r\n outputArray[4] = pvutils.padNumber(this.minute, 2);\r\n outputArray[5] = pvutils.padNumber(this.second, 2);\r\n outputArray[6] = \"Z\";\r\n return outputArray.join(\"\");\r\n }\r\n return super.toString(encoding);\r\n }\r\n onAsciiEncoding() {\r\n return `${this.constructor.NAME} : ${this.toDate().toISOString()}`;\r\n }\r\n toJSON() {\r\n return {\r\n ...super.toJSON(),\r\n year: this.year,\r\n month: this.month,\r\n day: this.day,\r\n hour: this.hour,\r\n minute: this.minute,\r\n second: this.second,\r\n };\r\n }\r\n}\r\n_a$6 = UTCTime;\r\n(() => {\r\n typeStore.UTCTime = _a$6;\r\n})();\r\nUTCTime.NAME = \"UTCTime\";\n\nvar _a$5;\r\nclass GeneralizedTime extends UTCTime {\r\n constructor(parameters = {}) {\r\n var _b;\r\n super(parameters);\r\n (_b = this.millisecond) !== null && _b !== void 0 ? _b : (this.millisecond = 0);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 24;\r\n }\r\n fromDate(inputDate) {\r\n super.fromDate(inputDate);\r\n this.millisecond = inputDate.getUTCMilliseconds();\r\n }\r\n toDate() {\r\n return (new Date(Date.UTC(this.year, this.month - 1, this.day, this.hour, this.minute, this.second, this.millisecond)));\r\n }\r\n fromString(inputString) {\r\n let isUTC = false;\r\n let timeString = \"\";\r\n let dateTimeString = \"\";\r\n let fractionPart = 0;\r\n let parser;\r\n let hourDifference = 0;\r\n let minuteDifference = 0;\r\n if (inputString[inputString.length - 1] === \"Z\") {\r\n timeString = inputString.substring(0, inputString.length - 1);\r\n isUTC = true;\r\n }\r\n else {\r\n const number = new Number(inputString[inputString.length - 1]);\r\n if (isNaN(number.valueOf()))\r\n throw new Error(\"Wrong input string for conversion\");\r\n timeString = inputString;\r\n }\r\n if (isUTC) {\r\n if (timeString.indexOf(\"+\") !== -1)\r\n throw new Error(\"Wrong input string for conversion\");\r\n if (timeString.indexOf(\"-\") !== -1)\r\n throw new Error(\"Wrong input string for conversion\");\r\n }\r\n else {\r\n let multiplier = 1;\r\n let differencePosition = timeString.indexOf(\"+\");\r\n let differenceString = \"\";\r\n if (differencePosition === -1) {\r\n differencePosition = timeString.indexOf(\"-\");\r\n multiplier = -1;\r\n }\r\n if (differencePosition !== -1) {\r\n differenceString = timeString.substring(differencePosition + 1);\r\n timeString = timeString.substring(0, differencePosition);\r\n if ((differenceString.length !== 2) && (differenceString.length !== 4))\r\n throw new Error(\"Wrong input string for conversion\");\r\n let number = parseInt(differenceString.substring(0, 2), 10);\r\n if (isNaN(number.valueOf()))\r\n throw new Error(\"Wrong input string for conversion\");\r\n hourDifference = multiplier * number;\r\n if (differenceString.length === 4) {\r\n number = parseInt(differenceString.substring(2, 4), 10);\r\n if (isNaN(number.valueOf()))\r\n throw new Error(\"Wrong input string for conversion\");\r\n minuteDifference = multiplier * number;\r\n }\r\n }\r\n }\r\n let fractionPointPosition = timeString.indexOf(\".\");\r\n if (fractionPointPosition === -1)\r\n fractionPointPosition = timeString.indexOf(\",\");\r\n if (fractionPointPosition !== -1) {\r\n const fractionPartCheck = new Number(`0${timeString.substring(fractionPointPosition)}`);\r\n if (isNaN(fractionPartCheck.valueOf()))\r\n throw new Error(\"Wrong input string for conversion\");\r\n fractionPart = fractionPartCheck.valueOf();\r\n dateTimeString = timeString.substring(0, fractionPointPosition);\r\n }\r\n else\r\n dateTimeString = timeString;\r\n switch (true) {\r\n case (dateTimeString.length === 8):\r\n parser = /(\\d{4})(\\d{2})(\\d{2})/ig;\r\n if (fractionPointPosition !== -1)\r\n throw new Error(\"Wrong input string for conversion\");\r\n break;\r\n case (dateTimeString.length === 10):\r\n parser = /(\\d{4})(\\d{2})(\\d{2})(\\d{2})/ig;\r\n if (fractionPointPosition !== -1) {\r\n let fractionResult = 60 * fractionPart;\r\n this.minute = Math.floor(fractionResult);\r\n fractionResult = 60 * (fractionResult - this.minute);\r\n this.second = Math.floor(fractionResult);\r\n fractionResult = 1000 * (fractionResult - this.second);\r\n this.millisecond = Math.floor(fractionResult);\r\n }\r\n break;\r\n case (dateTimeString.length === 12):\r\n parser = /(\\d{4})(\\d{2})(\\d{2})(\\d{2})(\\d{2})/ig;\r\n if (fractionPointPosition !== -1) {\r\n let fractionResult = 60 * fractionPart;\r\n this.second = Math.floor(fractionResult);\r\n fractionResult = 1000 * (fractionResult - this.second);\r\n this.millisecond = Math.floor(fractionResult);\r\n }\r\n break;\r\n case (dateTimeString.length === 14):\r\n parser = /(\\d{4})(\\d{2})(\\d{2})(\\d{2})(\\d{2})(\\d{2})/ig;\r\n if (fractionPointPosition !== -1) {\r\n const fractionResult = 1000 * fractionPart;\r\n this.millisecond = Math.floor(fractionResult);\r\n }\r\n break;\r\n default:\r\n throw new Error(\"Wrong input string for conversion\");\r\n }\r\n const parserArray = parser.exec(dateTimeString);\r\n if (parserArray === null)\r\n throw new Error(\"Wrong input string for conversion\");\r\n for (let j = 1; j < parserArray.length; j++) {\r\n switch (j) {\r\n case 1:\r\n this.year = parseInt(parserArray[j], 10);\r\n break;\r\n case 2:\r\n this.month = parseInt(parserArray[j], 10);\r\n break;\r\n case 3:\r\n this.day = parseInt(parserArray[j], 10);\r\n break;\r\n case 4:\r\n this.hour = parseInt(parserArray[j], 10) + hourDifference;\r\n break;\r\n case 5:\r\n this.minute = parseInt(parserArray[j], 10) + minuteDifference;\r\n break;\r\n case 6:\r\n this.second = parseInt(parserArray[j], 10);\r\n break;\r\n default:\r\n throw new Error(\"Wrong input string for conversion\");\r\n }\r\n }\r\n if (isUTC === false) {\r\n const tempDate = new Date(this.year, this.month, this.day, this.hour, this.minute, this.second, this.millisecond);\r\n this.year = tempDate.getUTCFullYear();\r\n this.month = tempDate.getUTCMonth();\r\n this.day = tempDate.getUTCDay();\r\n this.hour = tempDate.getUTCHours();\r\n this.minute = tempDate.getUTCMinutes();\r\n this.second = tempDate.getUTCSeconds();\r\n this.millisecond = tempDate.getUTCMilliseconds();\r\n }\r\n }\r\n toString(encoding = \"iso\") {\r\n if (encoding === \"iso\") {\r\n const outputArray = [];\r\n outputArray.push(pvutils.padNumber(this.year, 4));\r\n outputArray.push(pvutils.padNumber(this.month, 2));\r\n outputArray.push(pvutils.padNumber(this.day, 2));\r\n outputArray.push(pvutils.padNumber(this.hour, 2));\r\n outputArray.push(pvutils.padNumber(this.minute, 2));\r\n outputArray.push(pvutils.padNumber(this.second, 2));\r\n if (this.millisecond !== 0) {\r\n outputArray.push(\".\");\r\n outputArray.push(pvutils.padNumber(this.millisecond, 3));\r\n }\r\n outputArray.push(\"Z\");\r\n return outputArray.join(\"\");\r\n }\r\n return super.toString(encoding);\r\n }\r\n toJSON() {\r\n return {\r\n ...super.toJSON(),\r\n millisecond: this.millisecond,\r\n };\r\n }\r\n}\r\n_a$5 = GeneralizedTime;\r\n(() => {\r\n typeStore.GeneralizedTime = _a$5;\r\n})();\r\nGeneralizedTime.NAME = \"GeneralizedTime\";\n\nvar _a$4;\r\nclass DATE extends Utf8String {\r\n constructor(parameters = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 31;\r\n }\r\n}\r\n_a$4 = DATE;\r\n(() => {\r\n typeStore.DATE = _a$4;\r\n})();\r\nDATE.NAME = \"DATE\";\n\nvar _a$3;\r\nclass TimeOfDay extends Utf8String {\r\n constructor(parameters = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 32;\r\n }\r\n}\r\n_a$3 = TimeOfDay;\r\n(() => {\r\n typeStore.TimeOfDay = _a$3;\r\n})();\r\nTimeOfDay.NAME = \"TimeOfDay\";\n\nvar _a$2;\r\nclass DateTime extends Utf8String {\r\n constructor(parameters = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 33;\r\n }\r\n}\r\n_a$2 = DateTime;\r\n(() => {\r\n typeStore.DateTime = _a$2;\r\n})();\r\nDateTime.NAME = \"DateTime\";\n\nvar _a$1;\r\nclass Duration extends Utf8String {\r\n constructor(parameters = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 34;\r\n }\r\n}\r\n_a$1 = Duration;\r\n(() => {\r\n typeStore.Duration = _a$1;\r\n})();\r\nDuration.NAME = \"Duration\";\n\nvar _a;\r\nclass TIME extends Utf8String {\r\n constructor(parameters = {}) {\r\n super(parameters);\r\n this.idBlock.tagClass = 1;\r\n this.idBlock.tagNumber = 14;\r\n }\r\n}\r\n_a = TIME;\r\n(() => {\r\n typeStore.TIME = _a;\r\n})();\r\nTIME.NAME = \"TIME\";\n\nclass Any {\r\n constructor({ name = EMPTY_STRING, optional = false, } = {}) {\r\n this.name = name;\r\n this.optional = optional;\r\n }\r\n}\n\nclass Choice extends Any {\r\n constructor({ value = [], ...parameters } = {}) {\r\n super(parameters);\r\n this.value = value;\r\n }\r\n}\n\nclass Repeated extends Any {\r\n constructor({ value = new Any(), local = false, ...parameters } = {}) {\r\n super(parameters);\r\n this.value = value;\r\n this.local = local;\r\n }\r\n}\n\nclass RawData {\r\n constructor({ data = EMPTY_VIEW } = {}) {\r\n this.dataView = pvtsutils.BufferSourceConverter.toUint8Array(data);\r\n }\r\n get data() {\r\n return this.dataView.slice().buffer;\r\n }\r\n set data(value) {\r\n this.dataView = pvtsutils.BufferSourceConverter.toUint8Array(value);\r\n }\r\n fromBER(inputBuffer, inputOffset, inputLength) {\r\n const endLength = inputOffset + inputLength;\r\n this.dataView = pvtsutils.BufferSourceConverter.toUint8Array(inputBuffer).subarray(inputOffset, endLength);\r\n return endLength;\r\n }\r\n toBER(sizeOnly) {\r\n return this.dataView.slice().buffer;\r\n }\r\n}\n\nfunction compareSchema(root, inputData, inputSchema) {\r\n if (inputSchema instanceof Choice) {\r\n for (let j = 0; j < inputSchema.value.length; j++) {\r\n const result = compareSchema(root, inputData, inputSchema.value[j]);\r\n if (result.verified) {\r\n return {\r\n verified: true,\r\n result: root\r\n };\r\n }\r\n }\r\n {\r\n const _result = {\r\n verified: false,\r\n result: {\r\n error: \"Wrong values for Choice type\"\r\n },\r\n };\r\n if (inputSchema.hasOwnProperty(NAME))\r\n _result.name = inputSchema.name;\r\n return _result;\r\n }\r\n }\r\n if (inputSchema instanceof Any) {\r\n if (inputSchema.hasOwnProperty(NAME))\r\n root[inputSchema.name] = inputData;\r\n return {\r\n verified: true,\r\n result: root\r\n };\r\n }\r\n if ((root instanceof Object) === false) {\r\n return {\r\n verified: false,\r\n result: { error: \"Wrong root object\" }\r\n };\r\n }\r\n if ((inputData instanceof Object) === false) {\r\n return {\r\n verified: false,\r\n result: { error: \"Wrong ASN.1 data\" }\r\n };\r\n }\r\n if ((inputSchema instanceof Object) === false) {\r\n return {\r\n verified: false,\r\n result: { error: \"Wrong ASN.1 schema\" }\r\n };\r\n }\r\n if ((ID_BLOCK in inputSchema) === false) {\r\n return {\r\n verified: false,\r\n result: { error: \"Wrong ASN.1 schema\" }\r\n };\r\n }\r\n if ((FROM_BER in inputSchema.idBlock) === false) {\r\n return {\r\n verified: false,\r\n result: { error: \"Wrong ASN.1 schema\" }\r\n };\r\n }\r\n if ((TO_BER in inputSchema.idBlock) === false) {\r\n return {\r\n verified: false,\r\n result: { error: \"Wrong ASN.1 schema\" }\r\n };\r\n }\r\n const encodedId = inputSchema.idBlock.toBER(false);\r\n if (encodedId.byteLength === 0) {\r\n return {\r\n verified: false,\r\n result: { error: \"Error encoding idBlock for ASN.1 schema\" }\r\n };\r\n }\r\n const decodedOffset = inputSchema.idBlock.fromBER(encodedId, 0, encodedId.byteLength);\r\n if (decodedOffset === -1) {\r\n return {\r\n verified: false,\r\n result: { error: \"Error decoding idBlock for ASN.1 schema\" }\r\n };\r\n }\r\n if (inputSchema.idBlock.hasOwnProperty(TAG_CLASS) === false) {\r\n return {\r\n verified: false,\r\n result: { error: \"Wrong ASN.1 schema\" }\r\n };\r\n }\r\n if (inputSchema.idBlock.tagClass !== inputData.idBlock.tagClass) {\r\n return {\r\n verified: false,\r\n result: root\r\n };\r\n }\r\n if (inputSchema.idBlock.hasOwnProperty(TAG_NUMBER) === false) {\r\n return {\r\n verified: false,\r\n result: { error: \"Wrong ASN.1 schema\" }\r\n };\r\n }\r\n if (inputSchema.idBlock.tagNumber !== inputData.idBlock.tagNumber) {\r\n return {\r\n verified: false,\r\n result: root\r\n };\r\n }\r\n if (inputSchema.idBlock.hasOwnProperty(IS_CONSTRUCTED) === false) {\r\n return {\r\n verified: false,\r\n result: { error: \"Wrong ASN.1 schema\" }\r\n };\r\n }\r\n if (inputSchema.idBlock.isConstructed !== inputData.idBlock.isConstructed) {\r\n return {\r\n verified: false,\r\n result: root\r\n };\r\n }\r\n if (!(IS_HEX_ONLY in inputSchema.idBlock)) {\r\n return {\r\n verified: false,\r\n result: { error: \"Wrong ASN.1 schema\" }\r\n };\r\n }\r\n if (inputSchema.idBlock.isHexOnly !== inputData.idBlock.isHexOnly) {\r\n return {\r\n verified: false,\r\n result: root\r\n };\r\n }\r\n if (inputSchema.idBlock.isHexOnly) {\r\n if ((VALUE_HEX_VIEW in inputSchema.idBlock) === false) {\r\n return {\r\n verified: false,\r\n result: { error: \"Wrong ASN.1 schema\" }\r\n };\r\n }\r\n const schemaView = inputSchema.idBlock.valueHexView;\r\n const asn1View = inputData.idBlock.valueHexView;\r\n if (schemaView.length !== asn1View.length) {\r\n return {\r\n verified: false,\r\n result: root\r\n };\r\n }\r\n for (let i = 0; i < schemaView.length; i++) {\r\n if (schemaView[i] !== asn1View[1]) {\r\n return {\r\n verified: false,\r\n result: root\r\n };\r\n }\r\n }\r\n }\r\n if (inputSchema.name) {\r\n inputSchema.name = inputSchema.name.replace(/^\\s+|\\s+$/g, EMPTY_STRING);\r\n if (inputSchema.name)\r\n root[inputSchema.name] = inputData;\r\n }\r\n if (inputSchema instanceof typeStore.Constructed) {\r\n let admission = 0;\r\n let result = {\r\n verified: false,\r\n result: {\r\n error: \"Unknown error\",\r\n }\r\n };\r\n let maxLength = inputSchema.valueBlock.value.length;\r\n if (maxLength > 0) {\r\n if (inputSchema.valueBlock.value[0] instanceof Repeated) {\r\n maxLength = inputData.valueBlock.value.length;\r\n }\r\n }\r\n if (maxLength === 0) {\r\n return {\r\n verified: true,\r\n result: root\r\n };\r\n }\r\n if ((inputData.valueBlock.value.length === 0) &&\r\n (inputSchema.valueBlock.value.length !== 0)) {\r\n let _optional = true;\r\n for (let i = 0; i < inputSchema.valueBlock.value.length; i++)\r\n _optional = _optional && (inputSchema.valueBlock.value[i].optional || false);\r\n if (_optional) {\r\n return {\r\n verified: true,\r\n result: root\r\n };\r\n }\r\n if (inputSchema.name) {\r\n inputSchema.name = inputSchema.name.replace(/^\\s+|\\s+$/g, EMPTY_STRING);\r\n if (inputSchema.name)\r\n delete root[inputSchema.name];\r\n }\r\n root.error = \"Inconsistent object length\";\r\n return {\r\n verified: false,\r\n result: root\r\n };\r\n }\r\n for (let i = 0; i < maxLength; i++) {\r\n if ((i - admission) >= inputData.valueBlock.value.length) {\r\n if (inputSchema.valueBlock.value[i].optional === false) {\r\n const _result = {\r\n verified: false,\r\n result: root\r\n };\r\n root.error = \"Inconsistent length between ASN.1 data and schema\";\r\n if (inputSchema.name) {\r\n inputSchema.name = inputSchema.name.replace(/^\\s+|\\s+$/g, EMPTY_STRING);\r\n if (inputSchema.name) {\r\n delete root[inputSchema.name];\r\n _result.name = inputSchema.name;\r\n }\r\n }\r\n return _result;\r\n }\r\n }\r\n else {\r\n if (inputSchema.valueBlock.value[0] instanceof Repeated) {\r\n result = compareSchema(root, inputData.valueBlock.value[i], inputSchema.valueBlock.value[0].value);\r\n if (result.verified === false) {\r\n if (inputSchema.valueBlock.value[0].optional)\r\n admission++;\r\n else {\r\n if (inputSchema.name) {\r\n inputSchema.name = inputSchema.name.replace(/^\\s+|\\s+$/g, EMPTY_STRING);\r\n if (inputSchema.name)\r\n delete root[inputSchema.name];\r\n }\r\n return result;\r\n }\r\n }\r\n if ((NAME in inputSchema.valueBlock.value[0]) && (inputSchema.valueBlock.value[0].name.length > 0)) {\r\n let arrayRoot = {};\r\n if ((LOCAL in inputSchema.valueBlock.value[0]) && (inputSchema.valueBlock.value[0].local))\r\n arrayRoot = inputData;\r\n else\r\n arrayRoot = root;\r\n if (typeof arrayRoot[inputSchema.valueBlock.value[0].name] === \"undefined\")\r\n arrayRoot[inputSchema.valueBlock.value[0].name] = [];\r\n arrayRoot[inputSchema.valueBlock.value[0].name].push(inputData.valueBlock.value[i]);\r\n }\r\n }\r\n else {\r\n result = compareSchema(root, inputData.valueBlock.value[i - admission], inputSchema.valueBlock.value[i]);\r\n if (result.verified === false) {\r\n if (inputSchema.valueBlock.value[i].optional)\r\n admission++;\r\n else {\r\n if (inputSchema.name) {\r\n inputSchema.name = inputSchema.name.replace(/^\\s+|\\s+$/g, EMPTY_STRING);\r\n if (inputSchema.name)\r\n delete root[inputSchema.name];\r\n }\r\n return result;\r\n }\r\n }\r\n }\r\n }\r\n }\r\n if (result.verified === false) {\r\n const _result = {\r\n verified: false,\r\n result: root\r\n };\r\n if (inputSchema.name) {\r\n inputSchema.name = inputSchema.name.replace(/^\\s+|\\s+$/g, EMPTY_STRING);\r\n if (inputSchema.name) {\r\n delete root[inputSchema.name];\r\n _result.name = inputSchema.name;\r\n }\r\n }\r\n return _result;\r\n }\r\n return {\r\n verified: true,\r\n result: root\r\n };\r\n }\r\n if (inputSchema.primitiveSchema &&\r\n (VALUE_HEX_VIEW in inputData.valueBlock)) {\r\n const asn1 = localFromBER(inputData.valueBlock.valueHexView);\r\n if (asn1.offset === -1) {\r\n const _result = {\r\n verified: false,\r\n result: asn1.result\r\n };\r\n if (inputSchema.name) {\r\n inputSchema.name = inputSchema.name.replace(/^\\s+|\\s+$/g, EMPTY_STRING);\r\n if (inputSchema.name) {\r\n delete root[inputSchema.name];\r\n _result.name = inputSchema.name;\r\n }\r\n }\r\n return _result;\r\n }\r\n return compareSchema(root, asn1.result, inputSchema.primitiveSchema);\r\n }\r\n return {\r\n verified: true,\r\n result: root\r\n };\r\n}\r\nfunction verifySchema(inputBuffer, inputSchema) {\r\n if ((inputSchema instanceof Object) === false) {\r\n return {\r\n verified: false,\r\n result: { error: \"Wrong ASN.1 schema type\" }\r\n };\r\n }\r\n const asn1 = localFromBER(pvtsutils.BufferSourceConverter.toUint8Array(inputBuffer));\r\n if (asn1.offset === -1) {\r\n return {\r\n verified: false,\r\n result: asn1.result\r\n };\r\n }\r\n return compareSchema(asn1.result, asn1.result, inputSchema);\r\n}\n\nexport { Any, BaseBlock, BaseStringBlock, BitString, BmpString, Boolean, CharacterString, Choice, Constructed, DATE, DateTime, Duration, EndOfContent, Enumerated, GeneralString, GeneralizedTime, GraphicString, HexBlock, IA5String, Integer, Null, NumericString, ObjectIdentifier, OctetString, Primitive, PrintableString, RawData, RelativeObjectIdentifier, Repeated, Sequence, Set, TIME, TeletexString, TimeOfDay, UTCTime, UniversalString, Utf8String, ValueBlock, VideotexString, ViewWriter, VisibleString, compareSchema, fromBER, verifySchema };\n","import { CodeError } from '@libp2p/interface';\nimport { randomBytes as randB } from '@noble/hashes/utils';\n/**\n * Generates a Uint8Array with length `number` populated by random bytes\n */\nexport default function randomBytes(length) {\n if (isNaN(length) || length <= 0) {\n throw new CodeError('random bytes length must be a Number bigger than 0', 'ERR_INVALID_LENGTH');\n }\n return randB(length);\n}\n//# sourceMappingURL=random-bytes.js.map","import { CodeError } from '@libp2p/interface';\nimport { pbkdf2Async } from '@noble/hashes/pbkdf2';\nimport { sha512 } from '@noble/hashes/sha512';\nimport * as asn1js from 'asn1js';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport { toString as uint8ArrayToString } from 'uint8arrays/to-string';\nimport randomBytes from '../random-bytes.js';\nimport webcrypto from '../webcrypto.js';\nimport { unmarshalRsaPrivateKey } from './rsa-class.js';\n/**\n * Convert a PKCS#1 in ASN1 DER format to a JWK key\n */\nexport function pkcs1ToJwk(bytes) {\n const { result } = asn1js.fromBER(bytes);\n // @ts-expect-error this looks fragile but DER is a canonical format so we are\n // safe to have deeply property chains like this\n const values = result.valueBlock.value;\n const key = {\n n: uint8ArrayToString(bnToBuf(values[1].toBigInt()), 'base64url'),\n e: uint8ArrayToString(bnToBuf(values[2].toBigInt()), 'base64url'),\n d: uint8ArrayToString(bnToBuf(values[3].toBigInt()), 'base64url'),\n p: uint8ArrayToString(bnToBuf(values[4].toBigInt()), 'base64url'),\n q: uint8ArrayToString(bnToBuf(values[5].toBigInt()), 'base64url'),\n dp: uint8ArrayToString(bnToBuf(values[6].toBigInt()), 'base64url'),\n dq: uint8ArrayToString(bnToBuf(values[7].toBigInt()), 'base64url'),\n qi: uint8ArrayToString(bnToBuf(values[8].toBigInt()), 'base64url'),\n kty: 'RSA',\n alg: 'RS256'\n };\n return key;\n}\n/**\n * Convert a JWK key into PKCS#1 in ASN1 DER format\n */\nexport function jwkToPkcs1(jwk) {\n if (jwk.n == null || jwk.e == null || jwk.d == null || jwk.p == null || jwk.q == null || jwk.dp == null || jwk.dq == null || jwk.qi == null) {\n throw new CodeError('JWK was missing components', 'ERR_INVALID_PARAMETERS');\n }\n const root = new asn1js.Sequence({\n value: [\n new asn1js.Integer({ value: 0 }),\n asn1js.Integer.fromBigInt(bufToBn(uint8ArrayFromString(jwk.n, 'base64url'))),\n asn1js.Integer.fromBigInt(bufToBn(uint8ArrayFromString(jwk.e, 'base64url'))),\n asn1js.Integer.fromBigInt(bufToBn(uint8ArrayFromString(jwk.d, 'base64url'))),\n asn1js.Integer.fromBigInt(bufToBn(uint8ArrayFromString(jwk.p, 'base64url'))),\n asn1js.Integer.fromBigInt(bufToBn(uint8ArrayFromString(jwk.q, 'base64url'))),\n asn1js.Integer.fromBigInt(bufToBn(uint8ArrayFromString(jwk.dp, 'base64url'))),\n asn1js.Integer.fromBigInt(bufToBn(uint8ArrayFromString(jwk.dq, 'base64url'))),\n asn1js.Integer.fromBigInt(bufToBn(uint8ArrayFromString(jwk.qi, 'base64url')))\n ]\n });\n const der = root.toBER();\n return new Uint8Array(der, 0, der.byteLength);\n}\n/**\n * Convert a PKCIX in ASN1 DER format to a JWK key\n */\nexport function pkixToJwk(bytes) {\n const { result } = asn1js.fromBER(bytes);\n // @ts-expect-error this looks fragile but DER is a canonical format so we are\n // safe to have deeply property chains like this\n const values = result.valueBlock.value[1].valueBlock.value[0].valueBlock.value;\n return {\n kty: 'RSA',\n n: uint8ArrayToString(bnToBuf(values[0].toBigInt()), 'base64url'),\n e: uint8ArrayToString(bnToBuf(values[1].toBigInt()), 'base64url')\n };\n}\n/**\n * Convert a JWK key to PKCIX in ASN1 DER format\n */\nexport function jwkToPkix(jwk) {\n if (jwk.n == null || jwk.e == null) {\n throw new CodeError('JWK was missing components', 'ERR_INVALID_PARAMETERS');\n }\n const root = new asn1js.Sequence({\n value: [\n new asn1js.Sequence({\n value: [\n // rsaEncryption\n new asn1js.ObjectIdentifier({\n value: '1.2.840.113549.1.1.1'\n }),\n new asn1js.Null()\n ]\n }),\n // this appears to be a bug in asn1js.js - this should really be a Sequence\n // and not a BitString but it generates the same bytes as node-forge so 🤷‍♂️\n new asn1js.BitString({\n valueHex: new asn1js.Sequence({\n value: [\n asn1js.Integer.fromBigInt(bufToBn(uint8ArrayFromString(jwk.n, 'base64url'))),\n asn1js.Integer.fromBigInt(bufToBn(uint8ArrayFromString(jwk.e, 'base64url')))\n ]\n }).toBER()\n })\n ]\n });\n const der = root.toBER();\n return new Uint8Array(der, 0, der.byteLength);\n}\nfunction bnToBuf(bn) {\n let hex = bn.toString(16);\n if (hex.length % 2 > 0) {\n hex = `0${hex}`;\n }\n const len = hex.length / 2;\n const u8 = new Uint8Array(len);\n let i = 0;\n let j = 0;\n while (i < len) {\n u8[i] = parseInt(hex.slice(j, j + 2), 16);\n i += 1;\n j += 2;\n }\n return u8;\n}\nfunction bufToBn(u8) {\n const hex = [];\n u8.forEach(function (i) {\n let h = i.toString(16);\n if (h.length % 2 > 0) {\n h = `0${h}`;\n }\n hex.push(h);\n });\n return BigInt('0x' + hex.join(''));\n}\nconst SALT_LENGTH = 16;\nconst KEY_SIZE = 32;\nconst ITERATIONS = 10000;\nexport async function exportToPem(privateKey, password) {\n const crypto = webcrypto.get();\n // PrivateKeyInfo\n const keyWrapper = new asn1js.Sequence({\n value: [\n // version (0)\n new asn1js.Integer({ value: 0 }),\n // privateKeyAlgorithm\n new asn1js.Sequence({\n value: [\n // rsaEncryption OID\n new asn1js.ObjectIdentifier({\n value: '1.2.840.113549.1.1.1'\n }),\n new asn1js.Null()\n ]\n }),\n // PrivateKey\n new asn1js.OctetString({\n valueHex: privateKey.marshal()\n })\n ]\n });\n const keyBuf = keyWrapper.toBER();\n const keyArr = new Uint8Array(keyBuf, 0, keyBuf.byteLength);\n const salt = randomBytes(SALT_LENGTH);\n const encryptionKey = await pbkdf2Async(sha512, password, salt, {\n c: ITERATIONS,\n dkLen: KEY_SIZE\n });\n const iv = randomBytes(16);\n const cryptoKey = await crypto.subtle.importKey('raw', encryptionKey, 'AES-CBC', false, ['encrypt']);\n const encrypted = await crypto.subtle.encrypt({\n name: 'AES-CBC',\n iv\n }, cryptoKey, keyArr);\n const pbkdf2Params = new asn1js.Sequence({\n value: [\n // salt\n new asn1js.OctetString({ valueHex: salt }),\n // iteration count\n new asn1js.Integer({ value: ITERATIONS }),\n // key length\n new asn1js.Integer({ value: KEY_SIZE }),\n // AlgorithmIdentifier\n new asn1js.Sequence({\n value: [\n // hmacWithSHA512\n new asn1js.ObjectIdentifier({ value: '1.2.840.113549.2.11' }),\n new asn1js.Null()\n ]\n })\n ]\n });\n const encryptionAlgorithm = new asn1js.Sequence({\n value: [\n // pkcs5PBES2\n new asn1js.ObjectIdentifier({\n value: '1.2.840.113549.1.5.13'\n }),\n new asn1js.Sequence({\n value: [\n // keyDerivationFunc\n new asn1js.Sequence({\n value: [\n // pkcs5PBKDF2\n new asn1js.ObjectIdentifier({\n value: '1.2.840.113549.1.5.12'\n }),\n // PBKDF2-params\n pbkdf2Params\n ]\n }),\n // encryptionScheme\n new asn1js.Sequence({\n value: [\n // aes256-CBC\n new asn1js.ObjectIdentifier({\n value: '2.16.840.1.101.3.4.1.42'\n }),\n // iv\n new asn1js.OctetString({\n valueHex: iv\n })\n ]\n })\n ]\n })\n ]\n });\n const finalWrapper = new asn1js.Sequence({\n value: [\n encryptionAlgorithm,\n new asn1js.OctetString({ valueHex: encrypted })\n ]\n });\n const finalWrapperBuf = finalWrapper.toBER();\n const finalWrapperArr = new Uint8Array(finalWrapperBuf, 0, finalWrapperBuf.byteLength);\n return [\n '-----BEGIN ENCRYPTED PRIVATE KEY-----',\n ...uint8ArrayToString(finalWrapperArr, 'base64pad').split(/(.{64})/).filter(Boolean),\n '-----END ENCRYPTED PRIVATE KEY-----'\n ].join('\\n');\n}\nexport async function importFromPem(pem, password) {\n const crypto = webcrypto.get();\n let plaintext;\n if (pem.includes('-----BEGIN ENCRYPTED PRIVATE KEY-----')) {\n const key = uint8ArrayFromString(pem\n .replace('-----BEGIN ENCRYPTED PRIVATE KEY-----', '')\n .replace('-----END ENCRYPTED PRIVATE KEY-----', '')\n .replace(/\\n/g, '')\n .trim(), 'base64pad');\n const { result } = asn1js.fromBER(key);\n const { iv, salt, iterations, keySize, cipherText } = findEncryptedPEMData(result);\n const encryptionKey = await pbkdf2Async(sha512, password, salt, {\n c: iterations,\n dkLen: keySize\n });\n const cryptoKey = await crypto.subtle.importKey('raw', encryptionKey, 'AES-CBC', false, ['decrypt']);\n const decrypted = toUint8Array(await crypto.subtle.decrypt({\n name: 'AES-CBC',\n iv\n }, cryptoKey, cipherText));\n const { result: decryptedResult } = asn1js.fromBER(decrypted);\n plaintext = findPEMData(decryptedResult);\n }\n else if (pem.includes('-----BEGIN PRIVATE KEY-----')) {\n const key = uint8ArrayFromString(pem\n .replace('-----BEGIN PRIVATE KEY-----', '')\n .replace('-----END PRIVATE KEY-----', '')\n .replace(/\\n/g, '')\n .trim(), 'base64pad');\n const { result } = asn1js.fromBER(key);\n plaintext = findPEMData(result);\n }\n else {\n throw new CodeError('Could not parse private key from PEM data', 'ERR_INVALID_PARAMETERS');\n }\n return unmarshalRsaPrivateKey(plaintext);\n}\nfunction findEncryptedPEMData(root) {\n const encryptionAlgorithm = root.valueBlock.value[0];\n const scheme = encryptionAlgorithm.valueBlock.value[0].toString();\n if (scheme !== 'OBJECT IDENTIFIER : 1.2.840.113549.1.5.13') {\n throw new CodeError('Only pkcs5PBES2 encrypted private keys are supported', 'ERR_INVALID_PARAMS');\n }\n const keyDerivationFunc = encryptionAlgorithm.valueBlock.value[1].valueBlock.value[0];\n const keyDerivationFuncName = keyDerivationFunc.valueBlock.value[0].toString();\n if (keyDerivationFuncName !== 'OBJECT IDENTIFIER : 1.2.840.113549.1.5.12') {\n throw new CodeError('Only pkcs5PBKDF2 key derivation functions are supported', 'ERR_INVALID_PARAMS');\n }\n const pbkdf2Params = keyDerivationFunc.valueBlock.value[1];\n const salt = toUint8Array(pbkdf2Params.valueBlock.value[0].getValue());\n let iterations = ITERATIONS;\n let keySize = KEY_SIZE;\n if (pbkdf2Params.valueBlock.value.length === 3) {\n iterations = Number(pbkdf2Params.valueBlock.value[1].toBigInt());\n keySize = Number((pbkdf2Params.valueBlock.value[2]).toBigInt());\n }\n else if (pbkdf2Params.valueBlock.value.length === 2) {\n throw new CodeError('Could not derive key size and iterations from PEM file - please use @libp2p/rsa to re-import your key', 'ERR_INVALID_PARAMS');\n }\n const encryptionScheme = encryptionAlgorithm.valueBlock.value[1].valueBlock.value[1];\n const encryptionSchemeName = encryptionScheme.valueBlock.value[0].toString();\n if (encryptionSchemeName === 'OBJECT IDENTIFIER : 1.2.840.113549.3.7') {\n // des-EDE3-CBC\n }\n else if (encryptionSchemeName === 'OBJECT IDENTIFIER : 1.3.14.3.2.7') {\n // des-CBC\n }\n else if (encryptionSchemeName === 'OBJECT IDENTIFIER : 2.16.840.1.101.3.4.1.2') {\n // aes128-CBC\n }\n else if (encryptionSchemeName === 'OBJECT IDENTIFIER : 2.16.840.1.101.3.4.1.22') {\n // aes192-CBC\n }\n else if (encryptionSchemeName === 'OBJECT IDENTIFIER : 2.16.840.1.101.3.4.1.42') {\n // aes256-CBC\n }\n else {\n throw new CodeError('Only AES-CBC encryption schemes are supported', 'ERR_INVALID_PARAMS');\n }\n const iv = toUint8Array(encryptionScheme.valueBlock.value[1].getValue());\n return {\n cipherText: toUint8Array(root.valueBlock.value[1].getValue()),\n salt,\n iterations,\n keySize,\n iv\n };\n}\nfunction findPEMData(seq) {\n return toUint8Array(seq.valueBlock.value[2].getValue());\n}\nfunction toUint8Array(buf) {\n return new Uint8Array(buf, 0, buf.byteLength);\n}\n//# sourceMappingURL=rsa-utils.js.map","import { hash as assertHash, number as assertNumber } from './_assert.js';\nimport { hmac } from './hmac.js';\nimport { createView, toBytes, checkOpts, asyncLoop } from './utils.js';\n// Common prologue and epilogue for sync/async functions\nfunction pbkdf2Init(hash, _password, _salt, _opts) {\n assertHash(hash);\n const opts = checkOpts({ dkLen: 32, asyncTick: 10 }, _opts);\n const { c, dkLen, asyncTick } = opts;\n assertNumber(c);\n assertNumber(dkLen);\n assertNumber(asyncTick);\n if (c < 1)\n throw new Error('PBKDF2: iterations (c) should be >= 1');\n const password = toBytes(_password);\n const salt = toBytes(_salt);\n // DK = PBKDF2(PRF, Password, Salt, c, dkLen);\n const DK = new Uint8Array(dkLen);\n // U1 = PRF(Password, Salt + INT_32_BE(i))\n const PRF = hmac.create(hash, password);\n const PRFSalt = PRF._cloneInto().update(salt);\n return { c, dkLen, asyncTick, DK, PRF, PRFSalt };\n}\nfunction pbkdf2Output(PRF, PRFSalt, DK, prfW, u) {\n PRF.destroy();\n PRFSalt.destroy();\n if (prfW)\n prfW.destroy();\n u.fill(0);\n return DK;\n}\n/**\n * PBKDF2-HMAC: RFC 2898 key derivation function\n * @param hash - hash function that would be used e.g. sha256\n * @param password - password from which a derived key is generated\n * @param salt - cryptographic salt\n * @param opts - {c, dkLen} where c is work factor and dkLen is output message size\n */\nexport function pbkdf2(hash, password, salt, opts) {\n const { c, dkLen, DK, PRF, PRFSalt } = pbkdf2Init(hash, password, salt, opts);\n let prfW; // Working copy\n const arr = new Uint8Array(4);\n const view = createView(arr);\n const u = new Uint8Array(PRF.outputLen);\n // DK = T1 + T2 + ⋯ + Tdklen/hlen\n for (let ti = 1, pos = 0; pos < dkLen; ti++, pos += PRF.outputLen) {\n // Ti = F(Password, Salt, c, i)\n const Ti = DK.subarray(pos, pos + PRF.outputLen);\n view.setInt32(0, ti, false);\n // F(Password, Salt, c, i) = U1 ^ U2 ^ ⋯ ^ Uc\n // U1 = PRF(Password, Salt + INT_32_BE(i))\n (prfW = PRFSalt._cloneInto(prfW)).update(arr).digestInto(u);\n Ti.set(u.subarray(0, Ti.length));\n for (let ui = 1; ui < c; ui++) {\n // Uc = PRF(Password, Uc−1)\n PRF._cloneInto(prfW).update(u).digestInto(u);\n for (let i = 0; i < Ti.length; i++)\n Ti[i] ^= u[i];\n }\n }\n return pbkdf2Output(PRF, PRFSalt, DK, prfW, u);\n}\nexport async function pbkdf2Async(hash, password, salt, opts) {\n const { c, dkLen, asyncTick, DK, PRF, PRFSalt } = pbkdf2Init(hash, password, salt, opts);\n let prfW; // Working copy\n const arr = new Uint8Array(4);\n const view = createView(arr);\n const u = new Uint8Array(PRF.outputLen);\n // DK = T1 + T2 + ⋯ + Tdklen/hlen\n for (let ti = 1, pos = 0; pos < dkLen; ti++, pos += PRF.outputLen) {\n // Ti = F(Password, Salt, c, i)\n const Ti = DK.subarray(pos, pos + PRF.outputLen);\n view.setInt32(0, ti, false);\n // F(Password, Salt, c, i) = U1 ^ U2 ^ ⋯ ^ Uc\n // U1 = PRF(Password, Salt + INT_32_BE(i))\n (prfW = PRFSalt._cloneInto(prfW)).update(arr).digestInto(u);\n Ti.set(u.subarray(0, Ti.length));\n await asyncLoop(c - 1, asyncTick, () => {\n // Uc = PRF(Password, Uc−1)\n PRF._cloneInto(prfW).update(u).digestInto(u);\n for (let i = 0; i < Ti.length; i++)\n Ti[i] ^= u[i];\n });\n }\n return pbkdf2Output(PRF, PRFSalt, DK, prfW, u);\n}\n//# sourceMappingURL=pbkdf2.js.map","import { CodeError } from '@libp2p/interface';\nimport { sha256 } from 'multiformats/hashes/sha2';\nimport { equals as uint8ArrayEquals } from 'uint8arrays/equals';\nimport { toString as uint8ArrayToString } from 'uint8arrays/to-string';\nimport { isPromise } from '../util.js';\nimport { exporter } from './exporter.js';\nimport * as pbm from './keys.js';\nimport * as crypto from './rsa.js';\nexport const MAX_RSA_KEY_SIZE = 8192;\nexport class RsaPublicKey {\n _key;\n constructor(key) {\n this._key = key;\n }\n verify(data, sig) {\n return crypto.hashAndVerify(this._key, sig, data);\n }\n marshal() {\n return crypto.utils.jwkToPkix(this._key);\n }\n get bytes() {\n return pbm.PublicKey.encode({\n Type: pbm.KeyType.RSA,\n Data: this.marshal()\n }).subarray();\n }\n equals(key) {\n return uint8ArrayEquals(this.bytes, key.bytes);\n }\n hash() {\n const p = sha256.digest(this.bytes);\n if (isPromise(p)) {\n return p.then(({ bytes }) => bytes);\n }\n return p.bytes;\n }\n}\nexport class RsaPrivateKey {\n _key;\n _publicKey;\n constructor(key, publicKey) {\n this._key = key;\n this._publicKey = publicKey;\n }\n genSecret() {\n return crypto.getRandomValues(16);\n }\n sign(message) {\n return crypto.hashAndSign(this._key, message);\n }\n get public() {\n if (this._publicKey == null) {\n throw new CodeError('public key not provided', 'ERR_PUBKEY_NOT_PROVIDED');\n }\n return new RsaPublicKey(this._publicKey);\n }\n marshal() {\n return crypto.utils.jwkToPkcs1(this._key);\n }\n get bytes() {\n return pbm.PrivateKey.encode({\n Type: pbm.KeyType.RSA,\n Data: this.marshal()\n }).subarray();\n }\n equals(key) {\n return uint8ArrayEquals(this.bytes, key.bytes);\n }\n hash() {\n const p = sha256.digest(this.bytes);\n if (isPromise(p)) {\n return p.then(({ bytes }) => bytes);\n }\n return p.bytes;\n }\n /**\n * Gets the ID of the key.\n *\n * The key id is the base58 encoding of the SHA-256 multihash of its public key.\n * The public key is a protobuf encoding containing a type and the DER encoding\n * of the PKCS SubjectPublicKeyInfo.\n */\n async id() {\n const hash = await this.public.hash();\n return uint8ArrayToString(hash, 'base58btc');\n }\n /**\n * Exports the key as libp2p-key - a aes-gcm encrypted value with the key\n * derived from the password.\n *\n * To export it as a password protected PEM file, please use the `exportPEM`\n * function from `@libp2p/rsa`.\n */\n async export(password, format = 'pkcs-8') {\n if (format === 'pkcs-8') {\n return crypto.utils.exportToPem(this, password);\n }\n else if (format === 'libp2p-key') {\n return exporter(this.bytes, password);\n }\n else {\n throw new CodeError(`export format '${format}' is not supported`, 'ERR_INVALID_EXPORT_FORMAT');\n }\n }\n}\nexport async function unmarshalRsaPrivateKey(bytes) {\n const jwk = crypto.utils.pkcs1ToJwk(bytes);\n if (crypto.keySize(jwk) > MAX_RSA_KEY_SIZE) {\n throw new CodeError('key size is too large', 'ERR_KEY_SIZE_TOO_LARGE');\n }\n const keys = await crypto.unmarshalPrivateKey(jwk);\n return new RsaPrivateKey(keys.privateKey, keys.publicKey);\n}\nexport function unmarshalRsaPublicKey(bytes) {\n const jwk = crypto.utils.pkixToJwk(bytes);\n if (crypto.keySize(jwk) > MAX_RSA_KEY_SIZE) {\n throw new CodeError('key size is too large', 'ERR_KEY_SIZE_TOO_LARGE');\n }\n return new RsaPublicKey(jwk);\n}\nexport async function fromJwk(jwk) {\n if (crypto.keySize(jwk) > MAX_RSA_KEY_SIZE) {\n throw new CodeError('key size is too large', 'ERR_KEY_SIZE_TOO_LARGE');\n }\n const keys = await crypto.unmarshalPrivateKey(jwk);\n return new RsaPrivateKey(keys.privateKey, keys.publicKey);\n}\nexport async function generateKeyPair(bits) {\n if (bits > MAX_RSA_KEY_SIZE) {\n throw new CodeError('key size is too large', 'ERR_KEY_SIZE_TOO_LARGE');\n }\n const keys = await crypto.generateKey(bits);\n return new RsaPrivateKey(keys.privateKey, keys.publicKey);\n}\n//# sourceMappingURL=rsa-class.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Short Weierstrass curve. The formula is: y² = x³ + ax + b\nimport { validateBasic, wNAF } from './curve.js';\nimport * as mod from './modular.js';\nimport * as ut from './utils.js';\nimport { ensureBytes, memoized, abool } from './utils.js';\nfunction validateSigVerOpts(opts) {\n if (opts.lowS !== undefined)\n abool('lowS', opts.lowS);\n if (opts.prehash !== undefined)\n abool('prehash', opts.prehash);\n}\nfunction validatePointOpts(curve) {\n const opts = validateBasic(curve);\n ut.validateObject(opts, {\n a: 'field',\n b: 'field',\n }, {\n allowedPrivateKeyLengths: 'array',\n wrapPrivateKey: 'boolean',\n isTorsionFree: 'function',\n clearCofactor: 'function',\n allowInfinityPoint: 'boolean',\n fromBytes: 'function',\n toBytes: 'function',\n });\n const { endo, Fp, a } = opts;\n if (endo) {\n if (!Fp.eql(a, Fp.ZERO)) {\n throw new Error('Endomorphism can only be defined for Koblitz curves that have a=0');\n }\n if (typeof endo !== 'object' ||\n typeof endo.beta !== 'bigint' ||\n typeof endo.splitScalar !== 'function') {\n throw new Error('Expected endomorphism with beta: bigint and splitScalar: function');\n }\n }\n return Object.freeze({ ...opts });\n}\n// ASN.1 DER encoding utilities\nconst { bytesToNumberBE: b2n, hexToBytes: h2b } = ut;\nexport const DER = {\n // asn.1 DER encoding utils\n Err: class DERErr extends Error {\n constructor(m = '') {\n super(m);\n }\n },\n _parseInt(data) {\n const { Err: E } = DER;\n if (data.length < 2 || data[0] !== 0x02)\n throw new E('Invalid signature integer tag');\n const len = data[1];\n const res = data.subarray(2, len + 2);\n if (!len || res.length !== len)\n throw new E('Invalid signature integer: wrong length');\n // https://crypto.stackexchange.com/a/57734 Leftmost bit of first byte is 'negative' flag,\n // since we always use positive integers here. It must always be empty:\n // - add zero byte if exists\n // - if next byte doesn't have a flag, leading zero is not allowed (minimal encoding)\n if (res[0] & 0b10000000)\n throw new E('Invalid signature integer: negative');\n if (res[0] === 0x00 && !(res[1] & 0b10000000))\n throw new E('Invalid signature integer: unnecessary leading zero');\n return { d: b2n(res), l: data.subarray(len + 2) }; // d is data, l is left\n },\n toSig(hex) {\n // parse DER signature\n const { Err: E } = DER;\n const data = typeof hex === 'string' ? h2b(hex) : hex;\n ut.abytes(data);\n let l = data.length;\n if (l < 2 || data[0] != 0x30)\n throw new E('Invalid signature tag');\n if (data[1] !== l - 2)\n throw new E('Invalid signature: incorrect length');\n const { d: r, l: sBytes } = DER._parseInt(data.subarray(2));\n const { d: s, l: rBytesLeft } = DER._parseInt(sBytes);\n if (rBytesLeft.length)\n throw new E('Invalid signature: left bytes after parsing');\n return { r, s };\n },\n hexFromSig(sig) {\n // Add leading zero if first byte has negative bit enabled. More details in '_parseInt'\n const slice = (s) => (Number.parseInt(s[0], 16) & 0b1000 ? '00' + s : s);\n const h = (num) => {\n const hex = num.toString(16);\n return hex.length & 1 ? `0${hex}` : hex;\n };\n const s = slice(h(sig.s));\n const r = slice(h(sig.r));\n const shl = s.length / 2;\n const rhl = r.length / 2;\n const sl = h(shl);\n const rl = h(rhl);\n return `30${h(rhl + shl + 4)}02${rl}${r}02${sl}${s}`;\n },\n};\n// Be friendly to bad ECMAScript parsers by not using bigint literals\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = BigInt(2), _3n = BigInt(3), _4n = BigInt(4);\nexport function weierstrassPoints(opts) {\n const CURVE = validatePointOpts(opts);\n const { Fp } = CURVE; // All curves has same field / group length as for now, but they can differ\n const toBytes = CURVE.toBytes ||\n ((_c, point, _isCompressed) => {\n const a = point.toAffine();\n return ut.concatBytes(Uint8Array.from([0x04]), Fp.toBytes(a.x), Fp.toBytes(a.y));\n });\n const fromBytes = CURVE.fromBytes ||\n ((bytes) => {\n // const head = bytes[0];\n const tail = bytes.subarray(1);\n // if (head !== 0x04) throw new Error('Only non-compressed encoding is supported');\n const x = Fp.fromBytes(tail.subarray(0, Fp.BYTES));\n const y = Fp.fromBytes(tail.subarray(Fp.BYTES, 2 * Fp.BYTES));\n return { x, y };\n });\n /**\n * y² = x³ + ax + b: Short weierstrass curve formula\n * @returns y²\n */\n function weierstrassEquation(x) {\n const { a, b } = CURVE;\n const x2 = Fp.sqr(x); // x * x\n const x3 = Fp.mul(x2, x); // x2 * x\n return Fp.add(Fp.add(x3, Fp.mul(x, a)), b); // x3 + a * x + b\n }\n // Validate whether the passed curve params are valid.\n // We check if curve equation works for generator point.\n // `assertValidity()` won't work: `isTorsionFree()` is not available at this point in bls12-381.\n // ProjectivePoint class has not been initialized yet.\n if (!Fp.eql(Fp.sqr(CURVE.Gy), weierstrassEquation(CURVE.Gx)))\n throw new Error('bad generator point: equation left != right');\n // Valid group elements reside in range 1..n-1\n function isWithinCurveOrder(num) {\n return ut.inRange(num, _1n, CURVE.n);\n }\n // Validates if priv key is valid and converts it to bigint.\n // Supports options allowedPrivateKeyLengths and wrapPrivateKey.\n function normPrivateKeyToScalar(key) {\n const { allowedPrivateKeyLengths: lengths, nByteLength, wrapPrivateKey, n: N } = CURVE;\n if (lengths && typeof key !== 'bigint') {\n if (ut.isBytes(key))\n key = ut.bytesToHex(key);\n // Normalize to hex string, pad. E.g. P521 would norm 130-132 char hex to 132-char bytes\n if (typeof key !== 'string' || !lengths.includes(key.length))\n throw new Error('Invalid key');\n key = key.padStart(nByteLength * 2, '0');\n }\n let num;\n try {\n num =\n typeof key === 'bigint'\n ? key\n : ut.bytesToNumberBE(ensureBytes('private key', key, nByteLength));\n }\n catch (error) {\n throw new Error(`private key must be ${nByteLength} bytes, hex or bigint, not ${typeof key}`);\n }\n if (wrapPrivateKey)\n num = mod.mod(num, N); // disabled by default, enabled for BLS\n ut.aInRange('private key', num, _1n, N); // num in range [1..N-1]\n return num;\n }\n function assertPrjPoint(other) {\n if (!(other instanceof Point))\n throw new Error('ProjectivePoint expected');\n }\n // Memoized toAffine / validity check. They are heavy. Points are immutable.\n // Converts Projective point to affine (x, y) coordinates.\n // Can accept precomputed Z^-1 - for example, from invertBatch.\n // (x, y, z) ∋ (x=x/z, y=y/z)\n const toAffineMemo = memoized((p, iz) => {\n const { px: x, py: y, pz: z } = p;\n // Fast-path for normalized points\n if (Fp.eql(z, Fp.ONE))\n return { x, y };\n const is0 = p.is0();\n // If invZ was 0, we return zero point. However we still want to execute\n // all operations, so we replace invZ with a random number, 1.\n if (iz == null)\n iz = is0 ? Fp.ONE : Fp.inv(z);\n const ax = Fp.mul(x, iz);\n const ay = Fp.mul(y, iz);\n const zz = Fp.mul(z, iz);\n if (is0)\n return { x: Fp.ZERO, y: Fp.ZERO };\n if (!Fp.eql(zz, Fp.ONE))\n throw new Error('invZ was invalid');\n return { x: ax, y: ay };\n });\n // NOTE: on exception this will crash 'cached' and no value will be set.\n // Otherwise true will be return\n const assertValidMemo = memoized((p) => {\n if (p.is0()) {\n // (0, 1, 0) aka ZERO is invalid in most contexts.\n // In BLS, ZERO can be serialized, so we allow it.\n // (0, 0, 0) is wrong representation of ZERO and is always invalid.\n if (CURVE.allowInfinityPoint && !Fp.is0(p.py))\n return;\n throw new Error('bad point: ZERO');\n }\n // Some 3rd-party test vectors require different wording between here & `fromCompressedHex`\n const { x, y } = p.toAffine();\n // Check if x, y are valid field elements\n if (!Fp.isValid(x) || !Fp.isValid(y))\n throw new Error('bad point: x or y not FE');\n const left = Fp.sqr(y); // y²\n const right = weierstrassEquation(x); // x³ + ax + b\n if (!Fp.eql(left, right))\n throw new Error('bad point: equation left != right');\n if (!p.isTorsionFree())\n throw new Error('bad point: not in prime-order subgroup');\n return true;\n });\n /**\n * Projective Point works in 3d / projective (homogeneous) coordinates: (x, y, z) ∋ (x=x/z, y=y/z)\n * Default Point works in 2d / affine coordinates: (x, y)\n * We're doing calculations in projective, because its operations don't require costly inversion.\n */\n class Point {\n constructor(px, py, pz) {\n this.px = px;\n this.py = py;\n this.pz = pz;\n if (px == null || !Fp.isValid(px))\n throw new Error('x required');\n if (py == null || !Fp.isValid(py))\n throw new Error('y required');\n if (pz == null || !Fp.isValid(pz))\n throw new Error('z required');\n Object.freeze(this);\n }\n // Does not validate if the point is on-curve.\n // Use fromHex instead, or call assertValidity() later.\n static fromAffine(p) {\n const { x, y } = p || {};\n if (!p || !Fp.isValid(x) || !Fp.isValid(y))\n throw new Error('invalid affine point');\n if (p instanceof Point)\n throw new Error('projective point not allowed');\n const is0 = (i) => Fp.eql(i, Fp.ZERO);\n // fromAffine(x:0, y:0) would produce (x:0, y:0, z:1), but we need (x:0, y:1, z:0)\n if (is0(x) && is0(y))\n return Point.ZERO;\n return new Point(x, y, Fp.ONE);\n }\n get x() {\n return this.toAffine().x;\n }\n get y() {\n return this.toAffine().y;\n }\n /**\n * Takes a bunch of Projective Points but executes only one\n * inversion on all of them. Inversion is very slow operation,\n * so this improves performance massively.\n * Optimization: converts a list of projective points to a list of identical points with Z=1.\n */\n static normalizeZ(points) {\n const toInv = Fp.invertBatch(points.map((p) => p.pz));\n return points.map((p, i) => p.toAffine(toInv[i])).map(Point.fromAffine);\n }\n /**\n * Converts hash string or Uint8Array to Point.\n * @param hex short/long ECDSA hex\n */\n static fromHex(hex) {\n const P = Point.fromAffine(fromBytes(ensureBytes('pointHex', hex)));\n P.assertValidity();\n return P;\n }\n // Multiplies generator point by privateKey.\n static fromPrivateKey(privateKey) {\n return Point.BASE.multiply(normPrivateKeyToScalar(privateKey));\n }\n // \"Private method\", don't use it directly\n _setWindowSize(windowSize) {\n wnaf.setWindowSize(this, windowSize);\n }\n // A point on curve is valid if it conforms to equation.\n assertValidity() {\n assertValidMemo(this);\n }\n hasEvenY() {\n const { y } = this.toAffine();\n if (Fp.isOdd)\n return !Fp.isOdd(y);\n throw new Error(\"Field doesn't support isOdd\");\n }\n /**\n * Compare one point to another.\n */\n equals(other) {\n assertPrjPoint(other);\n const { px: X1, py: Y1, pz: Z1 } = this;\n const { px: X2, py: Y2, pz: Z2 } = other;\n const U1 = Fp.eql(Fp.mul(X1, Z2), Fp.mul(X2, Z1));\n const U2 = Fp.eql(Fp.mul(Y1, Z2), Fp.mul(Y2, Z1));\n return U1 && U2;\n }\n /**\n * Flips point to one corresponding to (x, -y) in Affine coordinates.\n */\n negate() {\n return new Point(this.px, Fp.neg(this.py), this.pz);\n }\n // Renes-Costello-Batina exception-free doubling formula.\n // There is 30% faster Jacobian formula, but it is not complete.\n // https://eprint.iacr.org/2015/1060, algorithm 3\n // Cost: 8M + 3S + 3*a + 2*b3 + 15add.\n double() {\n const { a, b } = CURVE;\n const b3 = Fp.mul(b, _3n);\n const { px: X1, py: Y1, pz: Z1 } = this;\n let X3 = Fp.ZERO, Y3 = Fp.ZERO, Z3 = Fp.ZERO; // prettier-ignore\n let t0 = Fp.mul(X1, X1); // step 1\n let t1 = Fp.mul(Y1, Y1);\n let t2 = Fp.mul(Z1, Z1);\n let t3 = Fp.mul(X1, Y1);\n t3 = Fp.add(t3, t3); // step 5\n Z3 = Fp.mul(X1, Z1);\n Z3 = Fp.add(Z3, Z3);\n X3 = Fp.mul(a, Z3);\n Y3 = Fp.mul(b3, t2);\n Y3 = Fp.add(X3, Y3); // step 10\n X3 = Fp.sub(t1, Y3);\n Y3 = Fp.add(t1, Y3);\n Y3 = Fp.mul(X3, Y3);\n X3 = Fp.mul(t3, X3);\n Z3 = Fp.mul(b3, Z3); // step 15\n t2 = Fp.mul(a, t2);\n t3 = Fp.sub(t0, t2);\n t3 = Fp.mul(a, t3);\n t3 = Fp.add(t3, Z3);\n Z3 = Fp.add(t0, t0); // step 20\n t0 = Fp.add(Z3, t0);\n t0 = Fp.add(t0, t2);\n t0 = Fp.mul(t0, t3);\n Y3 = Fp.add(Y3, t0);\n t2 = Fp.mul(Y1, Z1); // step 25\n t2 = Fp.add(t2, t2);\n t0 = Fp.mul(t2, t3);\n X3 = Fp.sub(X3, t0);\n Z3 = Fp.mul(t2, t1);\n Z3 = Fp.add(Z3, Z3); // step 30\n Z3 = Fp.add(Z3, Z3);\n return new Point(X3, Y3, Z3);\n }\n // Renes-Costello-Batina exception-free addition formula.\n // There is 30% faster Jacobian formula, but it is not complete.\n // https://eprint.iacr.org/2015/1060, algorithm 1\n // Cost: 12M + 0S + 3*a + 3*b3 + 23add.\n add(other) {\n assertPrjPoint(other);\n const { px: X1, py: Y1, pz: Z1 } = this;\n const { px: X2, py: Y2, pz: Z2 } = other;\n let X3 = Fp.ZERO, Y3 = Fp.ZERO, Z3 = Fp.ZERO; // prettier-ignore\n const a = CURVE.a;\n const b3 = Fp.mul(CURVE.b, _3n);\n let t0 = Fp.mul(X1, X2); // step 1\n let t1 = Fp.mul(Y1, Y2);\n let t2 = Fp.mul(Z1, Z2);\n let t3 = Fp.add(X1, Y1);\n let t4 = Fp.add(X2, Y2); // step 5\n t3 = Fp.mul(t3, t4);\n t4 = Fp.add(t0, t1);\n t3 = Fp.sub(t3, t4);\n t4 = Fp.add(X1, Z1);\n let t5 = Fp.add(X2, Z2); // step 10\n t4 = Fp.mul(t4, t5);\n t5 = Fp.add(t0, t2);\n t4 = Fp.sub(t4, t5);\n t5 = Fp.add(Y1, Z1);\n X3 = Fp.add(Y2, Z2); // step 15\n t5 = Fp.mul(t5, X3);\n X3 = Fp.add(t1, t2);\n t5 = Fp.sub(t5, X3);\n Z3 = Fp.mul(a, t4);\n X3 = Fp.mul(b3, t2); // step 20\n Z3 = Fp.add(X3, Z3);\n X3 = Fp.sub(t1, Z3);\n Z3 = Fp.add(t1, Z3);\n Y3 = Fp.mul(X3, Z3);\n t1 = Fp.add(t0, t0); // step 25\n t1 = Fp.add(t1, t0);\n t2 = Fp.mul(a, t2);\n t4 = Fp.mul(b3, t4);\n t1 = Fp.add(t1, t2);\n t2 = Fp.sub(t0, t2); // step 30\n t2 = Fp.mul(a, t2);\n t4 = Fp.add(t4, t2);\n t0 = Fp.mul(t1, t4);\n Y3 = Fp.add(Y3, t0);\n t0 = Fp.mul(t5, t4); // step 35\n X3 = Fp.mul(t3, X3);\n X3 = Fp.sub(X3, t0);\n t0 = Fp.mul(t3, t1);\n Z3 = Fp.mul(t5, Z3);\n Z3 = Fp.add(Z3, t0); // step 40\n return new Point(X3, Y3, Z3);\n }\n subtract(other) {\n return this.add(other.negate());\n }\n is0() {\n return this.equals(Point.ZERO);\n }\n wNAF(n) {\n return wnaf.wNAFCached(this, n, Point.normalizeZ);\n }\n /**\n * Non-constant-time multiplication. Uses double-and-add algorithm.\n * It's faster, but should only be used when you don't care about\n * an exposed private key e.g. sig verification, which works over *public* keys.\n */\n multiplyUnsafe(sc) {\n ut.aInRange('scalar', sc, _0n, CURVE.n);\n const I = Point.ZERO;\n if (sc === _0n)\n return I;\n if (sc === _1n)\n return this;\n const { endo } = CURVE;\n if (!endo)\n return wnaf.unsafeLadder(this, sc);\n // Apply endomorphism\n let { k1neg, k1, k2neg, k2 } = endo.splitScalar(sc);\n let k1p = I;\n let k2p = I;\n let d = this;\n while (k1 > _0n || k2 > _0n) {\n if (k1 & _1n)\n k1p = k1p.add(d);\n if (k2 & _1n)\n k2p = k2p.add(d);\n d = d.double();\n k1 >>= _1n;\n k2 >>= _1n;\n }\n if (k1neg)\n k1p = k1p.negate();\n if (k2neg)\n k2p = k2p.negate();\n k2p = new Point(Fp.mul(k2p.px, endo.beta), k2p.py, k2p.pz);\n return k1p.add(k2p);\n }\n /**\n * Constant time multiplication.\n * Uses wNAF method. Windowed method may be 10% faster,\n * but takes 2x longer to generate and consumes 2x memory.\n * Uses precomputes when available.\n * Uses endomorphism for Koblitz curves.\n * @param scalar by which the point would be multiplied\n * @returns New point\n */\n multiply(scalar) {\n const { endo, n: N } = CURVE;\n ut.aInRange('scalar', scalar, _1n, N);\n let point, fake; // Fake point is used to const-time mult\n if (endo) {\n const { k1neg, k1, k2neg, k2 } = endo.splitScalar(scalar);\n let { p: k1p, f: f1p } = this.wNAF(k1);\n let { p: k2p, f: f2p } = this.wNAF(k2);\n k1p = wnaf.constTimeNegate(k1neg, k1p);\n k2p = wnaf.constTimeNegate(k2neg, k2p);\n k2p = new Point(Fp.mul(k2p.px, endo.beta), k2p.py, k2p.pz);\n point = k1p.add(k2p);\n fake = f1p.add(f2p);\n }\n else {\n const { p, f } = this.wNAF(scalar);\n point = p;\n fake = f;\n }\n // Normalize `z` for both points, but return only real one\n return Point.normalizeZ([point, fake])[0];\n }\n /**\n * Efficiently calculate `aP + bQ`. Unsafe, can expose private key, if used incorrectly.\n * Not using Strauss-Shamir trick: precomputation tables are faster.\n * The trick could be useful if both P and Q are not G (not in our case).\n * @returns non-zero affine point\n */\n multiplyAndAddUnsafe(Q, a, b) {\n const G = Point.BASE; // No Strauss-Shamir trick: we have 10% faster G precomputes\n const mul = (P, a // Select faster multiply() method\n ) => (a === _0n || a === _1n || !P.equals(G) ? P.multiplyUnsafe(a) : P.multiply(a));\n const sum = mul(this, a).add(mul(Q, b));\n return sum.is0() ? undefined : sum;\n }\n // Converts Projective point to affine (x, y) coordinates.\n // Can accept precomputed Z^-1 - for example, from invertBatch.\n // (x, y, z) ∋ (x=x/z, y=y/z)\n toAffine(iz) {\n return toAffineMemo(this, iz);\n }\n isTorsionFree() {\n const { h: cofactor, isTorsionFree } = CURVE;\n if (cofactor === _1n)\n return true; // No subgroups, always torsion-free\n if (isTorsionFree)\n return isTorsionFree(Point, this);\n throw new Error('isTorsionFree() has not been declared for the elliptic curve');\n }\n clearCofactor() {\n const { h: cofactor, clearCofactor } = CURVE;\n if (cofactor === _1n)\n return this; // Fast-path\n if (clearCofactor)\n return clearCofactor(Point, this);\n return this.multiplyUnsafe(CURVE.h);\n }\n toRawBytes(isCompressed = true) {\n abool('isCompressed', isCompressed);\n this.assertValidity();\n return toBytes(Point, this, isCompressed);\n }\n toHex(isCompressed = true) {\n abool('isCompressed', isCompressed);\n return ut.bytesToHex(this.toRawBytes(isCompressed));\n }\n }\n Point.BASE = new Point(CURVE.Gx, CURVE.Gy, Fp.ONE);\n Point.ZERO = new Point(Fp.ZERO, Fp.ONE, Fp.ZERO);\n const _bits = CURVE.nBitLength;\n const wnaf = wNAF(Point, CURVE.endo ? Math.ceil(_bits / 2) : _bits);\n // Validate if generator point is on curve\n return {\n CURVE,\n ProjectivePoint: Point,\n normPrivateKeyToScalar,\n weierstrassEquation,\n isWithinCurveOrder,\n };\n}\nfunction validateOpts(curve) {\n const opts = validateBasic(curve);\n ut.validateObject(opts, {\n hash: 'hash',\n hmac: 'function',\n randomBytes: 'function',\n }, {\n bits2int: 'function',\n bits2int_modN: 'function',\n lowS: 'boolean',\n });\n return Object.freeze({ lowS: true, ...opts });\n}\n/**\n * Creates short weierstrass curve and ECDSA signature methods for it.\n * @example\n * import { Field } from '@noble/curves/abstract/modular';\n * // Before that, define BigInt-s: a, b, p, n, Gx, Gy\n * const curve = weierstrass({ a, b, Fp: Field(p), n, Gx, Gy, h: 1n })\n */\nexport function weierstrass(curveDef) {\n const CURVE = validateOpts(curveDef);\n const { Fp, n: CURVE_ORDER } = CURVE;\n const compressedLen = Fp.BYTES + 1; // e.g. 33 for 32\n const uncompressedLen = 2 * Fp.BYTES + 1; // e.g. 65 for 32\n function modN(a) {\n return mod.mod(a, CURVE_ORDER);\n }\n function invN(a) {\n return mod.invert(a, CURVE_ORDER);\n }\n const { ProjectivePoint: Point, normPrivateKeyToScalar, weierstrassEquation, isWithinCurveOrder, } = weierstrassPoints({\n ...CURVE,\n toBytes(_c, point, isCompressed) {\n const a = point.toAffine();\n const x = Fp.toBytes(a.x);\n const cat = ut.concatBytes;\n abool('isCompressed', isCompressed);\n if (isCompressed) {\n return cat(Uint8Array.from([point.hasEvenY() ? 0x02 : 0x03]), x);\n }\n else {\n return cat(Uint8Array.from([0x04]), x, Fp.toBytes(a.y));\n }\n },\n fromBytes(bytes) {\n const len = bytes.length;\n const head = bytes[0];\n const tail = bytes.subarray(1);\n // this.assertValidity() is done inside of fromHex\n if (len === compressedLen && (head === 0x02 || head === 0x03)) {\n const x = ut.bytesToNumberBE(tail);\n if (!ut.inRange(x, _1n, Fp.ORDER))\n throw new Error('Point is not on curve');\n const y2 = weierstrassEquation(x); // y² = x³ + ax + b\n let y;\n try {\n y = Fp.sqrt(y2); // y = y² ^ (p+1)/4\n }\n catch (sqrtError) {\n const suffix = sqrtError instanceof Error ? ': ' + sqrtError.message : '';\n throw new Error('Point is not on curve' + suffix);\n }\n const isYOdd = (y & _1n) === _1n;\n // ECDSA\n const isHeadOdd = (head & 1) === 1;\n if (isHeadOdd !== isYOdd)\n y = Fp.neg(y);\n return { x, y };\n }\n else if (len === uncompressedLen && head === 0x04) {\n const x = Fp.fromBytes(tail.subarray(0, Fp.BYTES));\n const y = Fp.fromBytes(tail.subarray(Fp.BYTES, 2 * Fp.BYTES));\n return { x, y };\n }\n else {\n throw new Error(`Point of length ${len} was invalid. Expected ${compressedLen} compressed bytes or ${uncompressedLen} uncompressed bytes`);\n }\n },\n });\n const numToNByteStr = (num) => ut.bytesToHex(ut.numberToBytesBE(num, CURVE.nByteLength));\n function isBiggerThanHalfOrder(number) {\n const HALF = CURVE_ORDER >> _1n;\n return number > HALF;\n }\n function normalizeS(s) {\n return isBiggerThanHalfOrder(s) ? modN(-s) : s;\n }\n // slice bytes num\n const slcNum = (b, from, to) => ut.bytesToNumberBE(b.slice(from, to));\n /**\n * ECDSA signature with its (r, s) properties. Supports DER & compact representations.\n */\n class Signature {\n constructor(r, s, recovery) {\n this.r = r;\n this.s = s;\n this.recovery = recovery;\n this.assertValidity();\n }\n // pair (bytes of r, bytes of s)\n static fromCompact(hex) {\n const l = CURVE.nByteLength;\n hex = ensureBytes('compactSignature', hex, l * 2);\n return new Signature(slcNum(hex, 0, l), slcNum(hex, l, 2 * l));\n }\n // DER encoded ECDSA signature\n // https://bitcoin.stackexchange.com/questions/57644/what-are-the-parts-of-a-bitcoin-transaction-input-script\n static fromDER(hex) {\n const { r, s } = DER.toSig(ensureBytes('DER', hex));\n return new Signature(r, s);\n }\n assertValidity() {\n ut.aInRange('r', this.r, _1n, CURVE_ORDER); // r in [1..N]\n ut.aInRange('s', this.s, _1n, CURVE_ORDER); // s in [1..N]\n }\n addRecoveryBit(recovery) {\n return new Signature(this.r, this.s, recovery);\n }\n recoverPublicKey(msgHash) {\n const { r, s, recovery: rec } = this;\n const h = bits2int_modN(ensureBytes('msgHash', msgHash)); // Truncate hash\n if (rec == null || ![0, 1, 2, 3].includes(rec))\n throw new Error('recovery id invalid');\n const radj = rec === 2 || rec === 3 ? r + CURVE.n : r;\n if (radj >= Fp.ORDER)\n throw new Error('recovery id 2 or 3 invalid');\n const prefix = (rec & 1) === 0 ? '02' : '03';\n const R = Point.fromHex(prefix + numToNByteStr(radj));\n const ir = invN(radj); // r^-1\n const u1 = modN(-h * ir); // -hr^-1\n const u2 = modN(s * ir); // sr^-1\n const Q = Point.BASE.multiplyAndAddUnsafe(R, u1, u2); // (sr^-1)R-(hr^-1)G = -(hr^-1)G + (sr^-1)\n if (!Q)\n throw new Error('point at infinify'); // unsafe is fine: no priv data leaked\n Q.assertValidity();\n return Q;\n }\n // Signatures should be low-s, to prevent malleability.\n hasHighS() {\n return isBiggerThanHalfOrder(this.s);\n }\n normalizeS() {\n return this.hasHighS() ? new Signature(this.r, modN(-this.s), this.recovery) : this;\n }\n // DER-encoded\n toDERRawBytes() {\n return ut.hexToBytes(this.toDERHex());\n }\n toDERHex() {\n return DER.hexFromSig({ r: this.r, s: this.s });\n }\n // padded bytes of r, then padded bytes of s\n toCompactRawBytes() {\n return ut.hexToBytes(this.toCompactHex());\n }\n toCompactHex() {\n return numToNByteStr(this.r) + numToNByteStr(this.s);\n }\n }\n const utils = {\n isValidPrivateKey(privateKey) {\n try {\n normPrivateKeyToScalar(privateKey);\n return true;\n }\n catch (error) {\n return false;\n }\n },\n normPrivateKeyToScalar: normPrivateKeyToScalar,\n /**\n * Produces cryptographically secure private key from random of size\n * (groupLen + ceil(groupLen / 2)) with modulo bias being negligible.\n */\n randomPrivateKey: () => {\n const length = mod.getMinHashLength(CURVE.n);\n return mod.mapHashToField(CURVE.randomBytes(length), CURVE.n);\n },\n /**\n * Creates precompute table for an arbitrary EC point. Makes point \"cached\".\n * Allows to massively speed-up `point.multiply(scalar)`.\n * @returns cached point\n * @example\n * const fast = utils.precompute(8, ProjectivePoint.fromHex(someonesPubKey));\n * fast.multiply(privKey); // much faster ECDH now\n */\n precompute(windowSize = 8, point = Point.BASE) {\n point._setWindowSize(windowSize);\n point.multiply(BigInt(3)); // 3 is arbitrary, just need any number here\n return point;\n },\n };\n /**\n * Computes public key for a private key. Checks for validity of the private key.\n * @param privateKey private key\n * @param isCompressed whether to return compact (default), or full key\n * @returns Public key, full when isCompressed=false; short when isCompressed=true\n */\n function getPublicKey(privateKey, isCompressed = true) {\n return Point.fromPrivateKey(privateKey).toRawBytes(isCompressed);\n }\n /**\n * Quick and dirty check for item being public key. Does not validate hex, or being on-curve.\n */\n function isProbPub(item) {\n const arr = ut.isBytes(item);\n const str = typeof item === 'string';\n const len = (arr || str) && item.length;\n if (arr)\n return len === compressedLen || len === uncompressedLen;\n if (str)\n return len === 2 * compressedLen || len === 2 * uncompressedLen;\n if (item instanceof Point)\n return true;\n return false;\n }\n /**\n * ECDH (Elliptic Curve Diffie Hellman).\n * Computes shared public key from private key and public key.\n * Checks: 1) private key validity 2) shared key is on-curve.\n * Does NOT hash the result.\n * @param privateA private key\n * @param publicB different public key\n * @param isCompressed whether to return compact (default), or full key\n * @returns shared public key\n */\n function getSharedSecret(privateA, publicB, isCompressed = true) {\n if (isProbPub(privateA))\n throw new Error('first arg must be private key');\n if (!isProbPub(publicB))\n throw new Error('second arg must be public key');\n const b = Point.fromHex(publicB); // check for being on-curve\n return b.multiply(normPrivateKeyToScalar(privateA)).toRawBytes(isCompressed);\n }\n // RFC6979: ensure ECDSA msg is X bytes and < N. RFC suggests optional truncating via bits2octets.\n // FIPS 186-4 4.6 suggests the leftmost min(nBitLen, outLen) bits, which matches bits2int.\n // bits2int can produce res>N, we can do mod(res, N) since the bitLen is the same.\n // int2octets can't be used; pads small msgs with 0: unacceptatble for trunc as per RFC vectors\n const bits2int = CURVE.bits2int ||\n function (bytes) {\n // For curves with nBitLength % 8 !== 0: bits2octets(bits2octets(m)) !== bits2octets(m)\n // for some cases, since bytes.length * 8 is not actual bitLength.\n const num = ut.bytesToNumberBE(bytes); // check for == u8 done here\n const delta = bytes.length * 8 - CURVE.nBitLength; // truncate to nBitLength leftmost bits\n return delta > 0 ? num >> BigInt(delta) : num;\n };\n const bits2int_modN = CURVE.bits2int_modN ||\n function (bytes) {\n return modN(bits2int(bytes)); // can't use bytesToNumberBE here\n };\n // NOTE: pads output with zero as per spec\n const ORDER_MASK = ut.bitMask(CURVE.nBitLength);\n /**\n * Converts to bytes. Checks if num in `[0..ORDER_MASK-1]` e.g.: `[0..2^256-1]`.\n */\n function int2octets(num) {\n ut.aInRange(`num < 2^${CURVE.nBitLength}`, num, _0n, ORDER_MASK);\n // works with order, can have different size than numToField!\n return ut.numberToBytesBE(num, CURVE.nByteLength);\n }\n // Steps A, D of RFC6979 3.2\n // Creates RFC6979 seed; converts msg/privKey to numbers.\n // Used only in sign, not in verify.\n // NOTE: we cannot assume here that msgHash has same amount of bytes as curve order, this will be wrong at least for P521.\n // Also it can be bigger for P224 + SHA256\n function prepSig(msgHash, privateKey, opts = defaultSigOpts) {\n if (['recovered', 'canonical'].some((k) => k in opts))\n throw new Error('sign() legacy options not supported');\n const { hash, randomBytes } = CURVE;\n let { lowS, prehash, extraEntropy: ent } = opts; // generates low-s sigs by default\n if (lowS == null)\n lowS = true; // RFC6979 3.2: we skip step A, because we already provide hash\n msgHash = ensureBytes('msgHash', msgHash);\n validateSigVerOpts(opts);\n if (prehash)\n msgHash = ensureBytes('prehashed msgHash', hash(msgHash));\n // We can't later call bits2octets, since nested bits2int is broken for curves\n // with nBitLength % 8 !== 0. Because of that, we unwrap it here as int2octets call.\n // const bits2octets = (bits) => int2octets(bits2int_modN(bits))\n const h1int = bits2int_modN(msgHash);\n const d = normPrivateKeyToScalar(privateKey); // validate private key, convert to bigint\n const seedArgs = [int2octets(d), int2octets(h1int)];\n // extraEntropy. RFC6979 3.6: additional k' (optional).\n if (ent != null && ent !== false) {\n // K = HMAC_K(V || 0x00 || int2octets(x) || bits2octets(h1) || k')\n const e = ent === true ? randomBytes(Fp.BYTES) : ent; // generate random bytes OR pass as-is\n seedArgs.push(ensureBytes('extraEntropy', e)); // check for being bytes\n }\n const seed = ut.concatBytes(...seedArgs); // Step D of RFC6979 3.2\n const m = h1int; // NOTE: no need to call bits2int second time here, it is inside truncateHash!\n // Converts signature params into point w r/s, checks result for validity.\n function k2sig(kBytes) {\n // RFC 6979 Section 3.2, step 3: k = bits2int(T)\n const k = bits2int(kBytes); // Cannot use fields methods, since it is group element\n if (!isWithinCurveOrder(k))\n return; // Important: all mod() calls here must be done over N\n const ik = invN(k); // k^-1 mod n\n const q = Point.BASE.multiply(k).toAffine(); // q = Gk\n const r = modN(q.x); // r = q.x mod n\n if (r === _0n)\n return;\n // Can use scalar blinding b^-1(bm + bdr) where b ∈ [1,q−1] according to\n // https://tches.iacr.org/index.php/TCHES/article/view/7337/6509. We've decided against it:\n // a) dependency on CSPRNG b) 15% slowdown c) doesn't really help since bigints are not CT\n const s = modN(ik * modN(m + r * d)); // Not using blinding here\n if (s === _0n)\n return;\n let recovery = (q.x === r ? 0 : 2) | Number(q.y & _1n); // recovery bit (2 or 3, when q.x > n)\n let normS = s;\n if (lowS && isBiggerThanHalfOrder(s)) {\n normS = normalizeS(s); // if lowS was passed, ensure s is always\n recovery ^= 1; // // in the bottom half of N\n }\n return new Signature(r, normS, recovery); // use normS, not s\n }\n return { seed, k2sig };\n }\n const defaultSigOpts = { lowS: CURVE.lowS, prehash: false };\n const defaultVerOpts = { lowS: CURVE.lowS, prehash: false };\n /**\n * Signs message hash with a private key.\n * ```\n * sign(m, d, k) where\n * (x, y) = G × k\n * r = x mod n\n * s = (m + dr)/k mod n\n * ```\n * @param msgHash NOT message. msg needs to be hashed to `msgHash`, or use `prehash`.\n * @param privKey private key\n * @param opts lowS for non-malleable sigs. extraEntropy for mixing randomness into k. prehash will hash first arg.\n * @returns signature with recovery param\n */\n function sign(msgHash, privKey, opts = defaultSigOpts) {\n const { seed, k2sig } = prepSig(msgHash, privKey, opts); // Steps A, D of RFC6979 3.2.\n const C = CURVE;\n const drbg = ut.createHmacDrbg(C.hash.outputLen, C.nByteLength, C.hmac);\n return drbg(seed, k2sig); // Steps B, C, D, E, F, G\n }\n // Enable precomputes. Slows down first publicKey computation by 20ms.\n Point.BASE._setWindowSize(8);\n // utils.precompute(8, ProjectivePoint.BASE)\n /**\n * Verifies a signature against message hash and public key.\n * Rejects lowS signatures by default: to override,\n * specify option `{lowS: false}`. Implements section 4.1.4 from https://www.secg.org/sec1-v2.pdf:\n *\n * ```\n * verify(r, s, h, P) where\n * U1 = hs^-1 mod n\n * U2 = rs^-1 mod n\n * R = U1⋅G - U2⋅P\n * mod(R.x, n) == r\n * ```\n */\n function verify(signature, msgHash, publicKey, opts = defaultVerOpts) {\n const sg = signature;\n msgHash = ensureBytes('msgHash', msgHash);\n publicKey = ensureBytes('publicKey', publicKey);\n if ('strict' in opts)\n throw new Error('options.strict was renamed to lowS');\n validateSigVerOpts(opts);\n const { lowS, prehash } = opts;\n let _sig = undefined;\n let P;\n try {\n if (typeof sg === 'string' || ut.isBytes(sg)) {\n // Signature can be represented in 2 ways: compact (2*nByteLength) & DER (variable-length).\n // Since DER can also be 2*nByteLength bytes, we check for it first.\n try {\n _sig = Signature.fromDER(sg);\n }\n catch (derError) {\n if (!(derError instanceof DER.Err))\n throw derError;\n _sig = Signature.fromCompact(sg);\n }\n }\n else if (typeof sg === 'object' && typeof sg.r === 'bigint' && typeof sg.s === 'bigint') {\n const { r, s } = sg;\n _sig = new Signature(r, s);\n }\n else {\n throw new Error('PARSE');\n }\n P = Point.fromHex(publicKey);\n }\n catch (error) {\n if (error.message === 'PARSE')\n throw new Error(`signature must be Signature instance, Uint8Array or hex string`);\n return false;\n }\n if (lowS && _sig.hasHighS())\n return false;\n if (prehash)\n msgHash = CURVE.hash(msgHash);\n const { r, s } = _sig;\n const h = bits2int_modN(msgHash); // Cannot use fields methods, since it is group element\n const is = invN(s); // s^-1\n const u1 = modN(h * is); // u1 = hs^-1 mod n\n const u2 = modN(r * is); // u2 = rs^-1 mod n\n const R = Point.BASE.multiplyAndAddUnsafe(P, u1, u2)?.toAffine(); // R = u1⋅G + u2⋅P\n if (!R)\n return false;\n const v = modN(R.x);\n return v === r;\n }\n return {\n CURVE,\n getPublicKey,\n getSharedSecret,\n sign,\n verify,\n ProjectivePoint: Point,\n Signature,\n utils,\n };\n}\n/**\n * Implementation of the Shallue and van de Woestijne method for any weierstrass curve.\n * TODO: check if there is a way to merge this with uvRatio in Edwards; move to modular.\n * b = True and y = sqrt(u / v) if (u / v) is square in F, and\n * b = False and y = sqrt(Z * (u / v)) otherwise.\n * @param Fp\n * @param Z\n * @returns\n */\nexport function SWUFpSqrtRatio(Fp, Z) {\n // Generic implementation\n const q = Fp.ORDER;\n let l = _0n;\n for (let o = q - _1n; o % _2n === _0n; o /= _2n)\n l += _1n;\n const c1 = l; // 1. c1, the largest integer such that 2^c1 divides q - 1.\n // We need 2n ** c1 and 2n ** (c1-1). We can't use **; but we can use <<.\n // 2n ** c1 == 2n << (c1-1)\n const _2n_pow_c1_1 = _2n << (c1 - _1n - _1n);\n const _2n_pow_c1 = _2n_pow_c1_1 * _2n;\n const c2 = (q - _1n) / _2n_pow_c1; // 2. c2 = (q - 1) / (2^c1) # Integer arithmetic\n const c3 = (c2 - _1n) / _2n; // 3. c3 = (c2 - 1) / 2 # Integer arithmetic\n const c4 = _2n_pow_c1 - _1n; // 4. c4 = 2^c1 - 1 # Integer arithmetic\n const c5 = _2n_pow_c1_1; // 5. c5 = 2^(c1 - 1) # Integer arithmetic\n const c6 = Fp.pow(Z, c2); // 6. c6 = Z^c2\n const c7 = Fp.pow(Z, (c2 + _1n) / _2n); // 7. c7 = Z^((c2 + 1) / 2)\n let sqrtRatio = (u, v) => {\n let tv1 = c6; // 1. tv1 = c6\n let tv2 = Fp.pow(v, c4); // 2. tv2 = v^c4\n let tv3 = Fp.sqr(tv2); // 3. tv3 = tv2^2\n tv3 = Fp.mul(tv3, v); // 4. tv3 = tv3 * v\n let tv5 = Fp.mul(u, tv3); // 5. tv5 = u * tv3\n tv5 = Fp.pow(tv5, c3); // 6. tv5 = tv5^c3\n tv5 = Fp.mul(tv5, tv2); // 7. tv5 = tv5 * tv2\n tv2 = Fp.mul(tv5, v); // 8. tv2 = tv5 * v\n tv3 = Fp.mul(tv5, u); // 9. tv3 = tv5 * u\n let tv4 = Fp.mul(tv3, tv2); // 10. tv4 = tv3 * tv2\n tv5 = Fp.pow(tv4, c5); // 11. tv5 = tv4^c5\n let isQR = Fp.eql(tv5, Fp.ONE); // 12. isQR = tv5 == 1\n tv2 = Fp.mul(tv3, c7); // 13. tv2 = tv3 * c7\n tv5 = Fp.mul(tv4, tv1); // 14. tv5 = tv4 * tv1\n tv3 = Fp.cmov(tv2, tv3, isQR); // 15. tv3 = CMOV(tv2, tv3, isQR)\n tv4 = Fp.cmov(tv5, tv4, isQR); // 16. tv4 = CMOV(tv5, tv4, isQR)\n // 17. for i in (c1, c1 - 1, ..., 2):\n for (let i = c1; i > _1n; i--) {\n let tv5 = i - _2n; // 18. tv5 = i - 2\n tv5 = _2n << (tv5 - _1n); // 19. tv5 = 2^tv5\n let tvv5 = Fp.pow(tv4, tv5); // 20. tv5 = tv4^tv5\n const e1 = Fp.eql(tvv5, Fp.ONE); // 21. e1 = tv5 == 1\n tv2 = Fp.mul(tv3, tv1); // 22. tv2 = tv3 * tv1\n tv1 = Fp.mul(tv1, tv1); // 23. tv1 = tv1 * tv1\n tvv5 = Fp.mul(tv4, tv1); // 24. tv5 = tv4 * tv1\n tv3 = Fp.cmov(tv2, tv3, e1); // 25. tv3 = CMOV(tv2, tv3, e1)\n tv4 = Fp.cmov(tvv5, tv4, e1); // 26. tv4 = CMOV(tv5, tv4, e1)\n }\n return { isValid: isQR, value: tv3 };\n };\n if (Fp.ORDER % _4n === _3n) {\n // sqrt_ratio_3mod4(u, v)\n const c1 = (Fp.ORDER - _3n) / _4n; // 1. c1 = (q - 3) / 4 # Integer arithmetic\n const c2 = Fp.sqrt(Fp.neg(Z)); // 2. c2 = sqrt(-Z)\n sqrtRatio = (u, v) => {\n let tv1 = Fp.sqr(v); // 1. tv1 = v^2\n const tv2 = Fp.mul(u, v); // 2. tv2 = u * v\n tv1 = Fp.mul(tv1, tv2); // 3. tv1 = tv1 * tv2\n let y1 = Fp.pow(tv1, c1); // 4. y1 = tv1^c1\n y1 = Fp.mul(y1, tv2); // 5. y1 = y1 * tv2\n const y2 = Fp.mul(y1, c2); // 6. y2 = y1 * c2\n const tv3 = Fp.mul(Fp.sqr(y1), v); // 7. tv3 = y1^2; 8. tv3 = tv3 * v\n const isQR = Fp.eql(tv3, u); // 9. isQR = tv3 == u\n let y = Fp.cmov(y2, y1, isQR); // 10. y = CMOV(y2, y1, isQR)\n return { isValid: isQR, value: y }; // 11. return (isQR, y) isQR ? y : y*c2\n };\n }\n // No curves uses that\n // if (Fp.ORDER % _8n === _5n) // sqrt_ratio_5mod8\n return sqrtRatio;\n}\n/**\n * Simplified Shallue-van de Woestijne-Ulas Method\n * https://www.rfc-editor.org/rfc/rfc9380#section-6.6.2\n */\nexport function mapToCurveSimpleSWU(Fp, opts) {\n mod.validateField(Fp);\n if (!Fp.isValid(opts.A) || !Fp.isValid(opts.B) || !Fp.isValid(opts.Z))\n throw new Error('mapToCurveSimpleSWU: invalid opts');\n const sqrtRatio = SWUFpSqrtRatio(Fp, opts.Z);\n if (!Fp.isOdd)\n throw new Error('Fp.isOdd is not implemented!');\n // Input: u, an element of F.\n // Output: (x, y), a point on E.\n return (u) => {\n // prettier-ignore\n let tv1, tv2, tv3, tv4, tv5, tv6, x, y;\n tv1 = Fp.sqr(u); // 1. tv1 = u^2\n tv1 = Fp.mul(tv1, opts.Z); // 2. tv1 = Z * tv1\n tv2 = Fp.sqr(tv1); // 3. tv2 = tv1^2\n tv2 = Fp.add(tv2, tv1); // 4. tv2 = tv2 + tv1\n tv3 = Fp.add(tv2, Fp.ONE); // 5. tv3 = tv2 + 1\n tv3 = Fp.mul(tv3, opts.B); // 6. tv3 = B * tv3\n tv4 = Fp.cmov(opts.Z, Fp.neg(tv2), !Fp.eql(tv2, Fp.ZERO)); // 7. tv4 = CMOV(Z, -tv2, tv2 != 0)\n tv4 = Fp.mul(tv4, opts.A); // 8. tv4 = A * tv4\n tv2 = Fp.sqr(tv3); // 9. tv2 = tv3^2\n tv6 = Fp.sqr(tv4); // 10. tv6 = tv4^2\n tv5 = Fp.mul(tv6, opts.A); // 11. tv5 = A * tv6\n tv2 = Fp.add(tv2, tv5); // 12. tv2 = tv2 + tv5\n tv2 = Fp.mul(tv2, tv3); // 13. tv2 = tv2 * tv3\n tv6 = Fp.mul(tv6, tv4); // 14. tv6 = tv6 * tv4\n tv5 = Fp.mul(tv6, opts.B); // 15. tv5 = B * tv6\n tv2 = Fp.add(tv2, tv5); // 16. tv2 = tv2 + tv5\n x = Fp.mul(tv1, tv3); // 17. x = tv1 * tv3\n const { isValid, value } = sqrtRatio(tv2, tv6); // 18. (is_gx1_square, y1) = sqrt_ratio(tv2, tv6)\n y = Fp.mul(tv1, u); // 19. y = tv1 * u -> Z * u^3 * y1\n y = Fp.mul(y, value); // 20. y = y * y1\n x = Fp.cmov(x, tv3, isValid); // 21. x = CMOV(x, tv3, is_gx1_square)\n y = Fp.cmov(y, value, isValid); // 22. y = CMOV(y, y1, is_gx1_square)\n const e1 = Fp.isOdd(u) === Fp.isOdd(y); // 23. e1 = sgn0(u) == sgn0(y)\n y = Fp.cmov(Fp.neg(y), y, e1); // 24. y = CMOV(-y, y, e1)\n x = Fp.div(x, tv4); // 25. x = x / tv4\n return { x, y };\n };\n}\n//# sourceMappingURL=weierstrass.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { hmac } from '@noble/hashes/hmac';\nimport { concatBytes, randomBytes } from '@noble/hashes/utils';\nimport { weierstrass } from './abstract/weierstrass.js';\n// connects noble-curves to noble-hashes\nexport function getHash(hash) {\n return {\n hash,\n hmac: (key, ...msgs) => hmac(hash, key, concatBytes(...msgs)),\n randomBytes,\n };\n}\nexport function createCurve(curveDef, defHash) {\n const create = (hash) => weierstrass({ ...curveDef, ...getHash(hash) });\n return Object.freeze({ ...create(defHash), create });\n}\n//# sourceMappingURL=_shortw_utils.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { sha256 } from '@noble/hashes/sha256';\nimport { randomBytes } from '@noble/hashes/utils';\nimport { createCurve } from './_shortw_utils.js';\nimport { createHasher, isogenyMap } from './abstract/hash-to-curve.js';\nimport { Field, mod, pow2 } from './abstract/modular.js';\nimport { inRange, aInRange, bytesToNumberBE, concatBytes, ensureBytes, numberToBytesBE, } from './abstract/utils.js';\nimport { mapToCurveSimpleSWU } from './abstract/weierstrass.js';\nconst secp256k1P = BigInt('0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f');\nconst secp256k1N = BigInt('0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141');\nconst _1n = BigInt(1);\nconst _2n = BigInt(2);\nconst divNearest = (a, b) => (a + b / _2n) / b;\n/**\n * √n = n^((p+1)/4) for fields p = 3 mod 4. We unwrap the loop and multiply bit-by-bit.\n * (P+1n/4n).toString(2) would produce bits [223x 1, 0, 22x 1, 4x 0, 11, 00]\n */\nfunction sqrtMod(y) {\n const P = secp256k1P;\n // prettier-ignore\n const _3n = BigInt(3), _6n = BigInt(6), _11n = BigInt(11), _22n = BigInt(22);\n // prettier-ignore\n const _23n = BigInt(23), _44n = BigInt(44), _88n = BigInt(88);\n const b2 = (y * y * y) % P; // x^3, 11\n const b3 = (b2 * b2 * y) % P; // x^7\n const b6 = (pow2(b3, _3n, P) * b3) % P;\n const b9 = (pow2(b6, _3n, P) * b3) % P;\n const b11 = (pow2(b9, _2n, P) * b2) % P;\n const b22 = (pow2(b11, _11n, P) * b11) % P;\n const b44 = (pow2(b22, _22n, P) * b22) % P;\n const b88 = (pow2(b44, _44n, P) * b44) % P;\n const b176 = (pow2(b88, _88n, P) * b88) % P;\n const b220 = (pow2(b176, _44n, P) * b44) % P;\n const b223 = (pow2(b220, _3n, P) * b3) % P;\n const t1 = (pow2(b223, _23n, P) * b22) % P;\n const t2 = (pow2(t1, _6n, P) * b2) % P;\n const root = pow2(t2, _2n, P);\n if (!Fp.eql(Fp.sqr(root), y))\n throw new Error('Cannot find square root');\n return root;\n}\nconst Fp = Field(secp256k1P, undefined, undefined, { sqrt: sqrtMod });\n/**\n * secp256k1 short weierstrass curve and ECDSA signatures over it.\n */\nexport const secp256k1 = createCurve({\n a: BigInt(0), // equation params: a, b\n b: BigInt(7), // Seem to be rigid: bitcointalk.org/index.php?topic=289795.msg3183975#msg3183975\n Fp, // Field's prime: 2n**256n - 2n**32n - 2n**9n - 2n**8n - 2n**7n - 2n**6n - 2n**4n - 1n\n n: secp256k1N, // Curve order, total count of valid points in the field\n // Base point (x, y) aka generator point\n Gx: BigInt('55066263022277343669578718895168534326250603453777594175500187360389116729240'),\n Gy: BigInt('32670510020758816978083085130507043184471273380659243275938904335757337482424'),\n h: BigInt(1), // Cofactor\n lowS: true, // Allow only low-S signatures by default in sign() and verify()\n /**\n * secp256k1 belongs to Koblitz curves: it has efficiently computable endomorphism.\n * Endomorphism uses 2x less RAM, speeds up precomputation by 2x and ECDH / key recovery by 20%.\n * For precomputed wNAF it trades off 1/2 init time & 1/3 ram for 20% perf hit.\n * Explanation: https://gist.github.com/paulmillr/eb670806793e84df628a7c434a873066\n */\n endo: {\n beta: BigInt('0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee'),\n splitScalar: (k) => {\n const n = secp256k1N;\n const a1 = BigInt('0x3086d221a7d46bcde86c90e49284eb15');\n const b1 = -_1n * BigInt('0xe4437ed6010e88286f547fa90abfe4c3');\n const a2 = BigInt('0x114ca50f7a8e2f3f657c1108d9d44cfd8');\n const b2 = a1;\n const POW_2_128 = BigInt('0x100000000000000000000000000000000'); // (2n**128n).toString(16)\n const c1 = divNearest(b2 * k, n);\n const c2 = divNearest(-b1 * k, n);\n let k1 = mod(k - c1 * a1 - c2 * a2, n);\n let k2 = mod(-c1 * b1 - c2 * b2, n);\n const k1neg = k1 > POW_2_128;\n const k2neg = k2 > POW_2_128;\n if (k1neg)\n k1 = n - k1;\n if (k2neg)\n k2 = n - k2;\n if (k1 > POW_2_128 || k2 > POW_2_128) {\n throw new Error('splitScalar: Endomorphism failed, k=' + k);\n }\n return { k1neg, k1, k2neg, k2 };\n },\n },\n}, sha256);\n// Schnorr signatures are superior to ECDSA from above. Below is Schnorr-specific BIP0340 code.\n// https://github.com/bitcoin/bips/blob/master/bip-0340.mediawiki\nconst _0n = BigInt(0);\n/** An object mapping tags to their tagged hash prefix of [SHA256(tag) | SHA256(tag)] */\nconst TAGGED_HASH_PREFIXES = {};\nfunction taggedHash(tag, ...messages) {\n let tagP = TAGGED_HASH_PREFIXES[tag];\n if (tagP === undefined) {\n const tagH = sha256(Uint8Array.from(tag, (c) => c.charCodeAt(0)));\n tagP = concatBytes(tagH, tagH);\n TAGGED_HASH_PREFIXES[tag] = tagP;\n }\n return sha256(concatBytes(tagP, ...messages));\n}\n// ECDSA compact points are 33-byte. Schnorr is 32: we strip first byte 0x02 or 0x03\nconst pointToBytes = (point) => point.toRawBytes(true).slice(1);\nconst numTo32b = (n) => numberToBytesBE(n, 32);\nconst modP = (x) => mod(x, secp256k1P);\nconst modN = (x) => mod(x, secp256k1N);\nconst Point = secp256k1.ProjectivePoint;\nconst GmulAdd = (Q, a, b) => Point.BASE.multiplyAndAddUnsafe(Q, a, b);\n// Calculate point, scalar and bytes\nfunction schnorrGetExtPubKey(priv) {\n let d_ = secp256k1.utils.normPrivateKeyToScalar(priv); // same method executed in fromPrivateKey\n let p = Point.fromPrivateKey(d_); // P = d'⋅G; 0 < d' < n check is done inside\n const scalar = p.hasEvenY() ? d_ : modN(-d_);\n return { scalar: scalar, bytes: pointToBytes(p) };\n}\n/**\n * lift_x from BIP340. Convert 32-byte x coordinate to elliptic curve point.\n * @returns valid point checked for being on-curve\n */\nfunction lift_x(x) {\n aInRange('x', x, _1n, secp256k1P); // Fail if x ≥ p.\n const xx = modP(x * x);\n const c = modP(xx * x + BigInt(7)); // Let c = x³ + 7 mod p.\n let y = sqrtMod(c); // Let y = c^(p+1)/4 mod p.\n if (y % _2n !== _0n)\n y = modP(-y); // Return the unique point P such that x(P) = x and\n const p = new Point(x, y, _1n); // y(P) = y if y mod 2 = 0 or y(P) = p-y otherwise.\n p.assertValidity();\n return p;\n}\nconst num = bytesToNumberBE;\n/**\n * Create tagged hash, convert it to bigint, reduce modulo-n.\n */\nfunction challenge(...args) {\n return modN(num(taggedHash('BIP0340/challenge', ...args)));\n}\n/**\n * Schnorr public key is just `x` coordinate of Point as per BIP340.\n */\nfunction schnorrGetPublicKey(privateKey) {\n return schnorrGetExtPubKey(privateKey).bytes; // d'=int(sk). Fail if d'=0 or d'≥n. Ret bytes(d'⋅G)\n}\n/**\n * Creates Schnorr signature as per BIP340. Verifies itself before returning anything.\n * auxRand is optional and is not the sole source of k generation: bad CSPRNG won't be dangerous.\n */\nfunction schnorrSign(message, privateKey, auxRand = randomBytes(32)) {\n const m = ensureBytes('message', message);\n const { bytes: px, scalar: d } = schnorrGetExtPubKey(privateKey); // checks for isWithinCurveOrder\n const a = ensureBytes('auxRand', auxRand, 32); // Auxiliary random data a: a 32-byte array\n const t = numTo32b(d ^ num(taggedHash('BIP0340/aux', a))); // Let t be the byte-wise xor of bytes(d) and hash/aux(a)\n const rand = taggedHash('BIP0340/nonce', t, px, m); // Let rand = hash/nonce(t || bytes(P) || m)\n const k_ = modN(num(rand)); // Let k' = int(rand) mod n\n if (k_ === _0n)\n throw new Error('sign failed: k is zero'); // Fail if k' = 0.\n const { bytes: rx, scalar: k } = schnorrGetExtPubKey(k_); // Let R = k'⋅G.\n const e = challenge(rx, px, m); // Let e = int(hash/challenge(bytes(R) || bytes(P) || m)) mod n.\n const sig = new Uint8Array(64); // Let sig = bytes(R) || bytes((k + ed) mod n).\n sig.set(rx, 0);\n sig.set(numTo32b(modN(k + e * d)), 32);\n // If Verify(bytes(P), m, sig) (see below) returns failure, abort\n if (!schnorrVerify(sig, m, px))\n throw new Error('sign: Invalid signature produced');\n return sig;\n}\n/**\n * Verifies Schnorr signature.\n * Will swallow errors & return false except for initial type validation of arguments.\n */\nfunction schnorrVerify(signature, message, publicKey) {\n const sig = ensureBytes('signature', signature, 64);\n const m = ensureBytes('message', message);\n const pub = ensureBytes('publicKey', publicKey, 32);\n try {\n const P = lift_x(num(pub)); // P = lift_x(int(pk)); fail if that fails\n const r = num(sig.subarray(0, 32)); // Let r = int(sig[0:32]); fail if r ≥ p.\n if (!inRange(r, _1n, secp256k1P))\n return false;\n const s = num(sig.subarray(32, 64)); // Let s = int(sig[32:64]); fail if s ≥ n.\n if (!inRange(s, _1n, secp256k1N))\n return false;\n const e = challenge(numTo32b(r), pointToBytes(P), m); // int(challenge(bytes(r)||bytes(P)||m))%n\n const R = GmulAdd(P, s, modN(-e)); // R = s⋅G - e⋅P\n if (!R || !R.hasEvenY() || R.toAffine().x !== r)\n return false; // -eP == (n-e)P\n return true; // Fail if is_infinite(R) / not has_even_y(R) / x(R) ≠ r.\n }\n catch (error) {\n return false;\n }\n}\n/**\n * Schnorr signatures over secp256k1.\n */\nexport const schnorr = /* @__PURE__ */ (() => ({\n getPublicKey: schnorrGetPublicKey,\n sign: schnorrSign,\n verify: schnorrVerify,\n utils: {\n randomPrivateKey: secp256k1.utils.randomPrivateKey,\n lift_x,\n pointToBytes,\n numberToBytesBE,\n bytesToNumberBE,\n taggedHash,\n mod,\n },\n}))();\nconst isoMap = /* @__PURE__ */ (() => isogenyMap(Fp, [\n // xNum\n [\n '0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa8c7',\n '0x7d3d4c80bc321d5b9f315cea7fd44c5d595d2fc0bf63b92dfff1044f17c6581',\n '0x534c328d23f234e6e2a413deca25caece4506144037c40314ecbd0b53d9dd262',\n '0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa88c',\n ],\n // xDen\n [\n '0xd35771193d94918a9ca34ccbb7b640dd86cd409542f8487d9fe6b745781eb49b',\n '0xedadc6f64383dc1df7c4b2d51b54225406d36b641f5e41bbc52a56612a8c6d14',\n '0x0000000000000000000000000000000000000000000000000000000000000001', // LAST 1\n ],\n // yNum\n [\n '0x4bda12f684bda12f684bda12f684bda12f684bda12f684bda12f684b8e38e23c',\n '0xc75e0c32d5cb7c0fa9d0a54b12a0a6d5647ab046d686da6fdffc90fc201d71a3',\n '0x29a6194691f91a73715209ef6512e576722830a201be2018a765e85a9ecee931',\n '0x2f684bda12f684bda12f684bda12f684bda12f684bda12f684bda12f38e38d84',\n ],\n // yDen\n [\n '0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffff93b',\n '0x7a06534bb8bdb49fd5e9e6632722c2989467c1bfc8e8d978dfb425d2685c2573',\n '0x6484aa716545ca2cf3a70c3fa8fe337e0a3d21162f0d6299a7bf8192bfd2a76f',\n '0x0000000000000000000000000000000000000000000000000000000000000001', // LAST 1\n ],\n].map((i) => i.map((j) => BigInt(j)))))();\nconst mapSWU = /* @__PURE__ */ (() => mapToCurveSimpleSWU(Fp, {\n A: BigInt('0x3f8731abdd661adca08a5558f0f5d272e953d363cb6f0e5d405447c01a444533'),\n B: BigInt('1771'),\n Z: Fp.create(BigInt('-11')),\n}))();\nconst htf = /* @__PURE__ */ (() => createHasher(secp256k1.ProjectivePoint, (scalars) => {\n const { x, y } = mapSWU(Fp.create(scalars[0]));\n return isoMap(x, y);\n}, {\n DST: 'secp256k1_XMD:SHA-256_SSWU_RO_',\n encodeDST: 'secp256k1_XMD:SHA-256_SSWU_NU_',\n p: Fp.ORDER,\n m: 1,\n k: 128,\n expand: 'xmd',\n hash: sha256,\n}))();\nexport const hashToCurve = /* @__PURE__ */ (() => htf.hashToCurve)();\nexport const encodeToCurve = /* @__PURE__ */ (() => htf.encodeToCurve)();\n//# sourceMappingURL=secp256k1.js.map","import { CodeError } from '@libp2p/interface';\nimport { secp256k1 as secp } from '@noble/curves/secp256k1';\nimport { sha256 } from 'multiformats/hashes/sha2';\nimport { isPromise } from '../util.js';\nconst PRIVATE_KEY_BYTE_LENGTH = 32;\nexport { PRIVATE_KEY_BYTE_LENGTH as privateKeyLength };\nexport function generateKey() {\n return secp.utils.randomPrivateKey();\n}\n/**\n * Hash and sign message with private key\n */\nexport function hashAndSign(key, msg) {\n const p = sha256.digest(msg instanceof Uint8Array ? msg : msg.subarray());\n if (isPromise(p)) {\n return p.then(({ digest }) => secp.sign(digest, key).toDERRawBytes())\n .catch(err => {\n throw new CodeError(String(err), 'ERR_INVALID_INPUT');\n });\n }\n try {\n return secp.sign(p.digest, key).toDERRawBytes();\n }\n catch (err) {\n throw new CodeError(String(err), 'ERR_INVALID_INPUT');\n }\n}\n/**\n * Hash message and verify signature with public key\n */\nexport function hashAndVerify(key, sig, msg) {\n const p = sha256.digest(msg instanceof Uint8Array ? msg : msg.subarray());\n if (isPromise(p)) {\n return p.then(({ digest }) => secp.verify(sig, digest, key))\n .catch(err => {\n throw new CodeError(String(err), 'ERR_INVALID_INPUT');\n });\n }\n try {\n return secp.verify(sig, p.digest, key);\n }\n catch (err) {\n throw new CodeError(String(err), 'ERR_INVALID_INPUT');\n }\n}\nexport function compressPublicKey(key) {\n const point = secp.ProjectivePoint.fromHex(key).toRawBytes(true);\n return point;\n}\nexport function decompressPublicKey(key) {\n const point = secp.ProjectivePoint.fromHex(key).toRawBytes(false);\n return point;\n}\nexport function validatePrivateKey(key) {\n try {\n secp.getPublicKey(key, true);\n }\n catch (err) {\n throw new CodeError(String(err), 'ERR_INVALID_PRIVATE_KEY');\n }\n}\nexport function validatePublicKey(key) {\n try {\n secp.ProjectivePoint.fromHex(key);\n }\n catch (err) {\n throw new CodeError(String(err), 'ERR_INVALID_PUBLIC_KEY');\n }\n}\nexport function computePublicKey(privateKey) {\n try {\n return secp.getPublicKey(privateKey, true);\n }\n catch (err) {\n throw new CodeError(String(err), 'ERR_INVALID_PRIVATE_KEY');\n }\n}\n//# sourceMappingURL=secp256k1-browser.js.map","import { CodeError } from '@libp2p/interface';\nimport { sha256 } from 'multiformats/hashes/sha2';\nimport { equals as uint8ArrayEquals } from 'uint8arrays/equals';\nimport { toString as uint8ArrayToString } from 'uint8arrays/to-string';\nimport { isPromise } from '../util.js';\nimport { exporter } from './exporter.js';\nimport * as keysProtobuf from './keys.js';\nimport * as crypto from './secp256k1.js';\nexport class Secp256k1PublicKey {\n _key;\n constructor(key) {\n crypto.validatePublicKey(key);\n this._key = key;\n }\n verify(data, sig) {\n return crypto.hashAndVerify(this._key, sig, data);\n }\n marshal() {\n return crypto.compressPublicKey(this._key);\n }\n get bytes() {\n return keysProtobuf.PublicKey.encode({\n Type: keysProtobuf.KeyType.Secp256k1,\n Data: this.marshal()\n }).subarray();\n }\n equals(key) {\n return uint8ArrayEquals(this.bytes, key.bytes);\n }\n async hash() {\n const p = sha256.digest(this.bytes);\n let bytes;\n if (isPromise(p)) {\n ({ bytes } = await p);\n }\n else {\n bytes = p.bytes;\n }\n return bytes;\n }\n}\nexport class Secp256k1PrivateKey {\n _key;\n _publicKey;\n constructor(key, publicKey) {\n this._key = key;\n this._publicKey = publicKey ?? crypto.computePublicKey(key);\n crypto.validatePrivateKey(this._key);\n crypto.validatePublicKey(this._publicKey);\n }\n sign(message) {\n return crypto.hashAndSign(this._key, message);\n }\n get public() {\n return new Secp256k1PublicKey(this._publicKey);\n }\n marshal() {\n return this._key;\n }\n get bytes() {\n return keysProtobuf.PrivateKey.encode({\n Type: keysProtobuf.KeyType.Secp256k1,\n Data: this.marshal()\n }).subarray();\n }\n equals(key) {\n return uint8ArrayEquals(this.bytes, key.bytes);\n }\n hash() {\n const p = sha256.digest(this.bytes);\n if (isPromise(p)) {\n return p.then(({ bytes }) => bytes);\n }\n return p.bytes;\n }\n /**\n * Gets the ID of the key.\n *\n * The key id is the base58 encoding of the SHA-256 multihash of its public key.\n * The public key is a protobuf encoding containing a type and the DER encoding\n * of the PKCS SubjectPublicKeyInfo.\n */\n async id() {\n const hash = await this.public.hash();\n return uint8ArrayToString(hash, 'base58btc');\n }\n /**\n * Exports the key into a password protected `format`\n */\n async export(password, format = 'libp2p-key') {\n if (format === 'libp2p-key') {\n return exporter(this.bytes, password);\n }\n else {\n throw new CodeError(`export format '${format}' is not supported`, 'ERR_INVALID_EXPORT_FORMAT');\n }\n }\n}\nexport function unmarshalSecp256k1PrivateKey(bytes) {\n return new Secp256k1PrivateKey(bytes);\n}\nexport function unmarshalSecp256k1PublicKey(bytes) {\n return new Secp256k1PublicKey(bytes);\n}\nexport async function generateKeyPair() {\n const privateKeyBytes = crypto.generateKey();\n return new Secp256k1PrivateKey(privateKeyBytes);\n}\n//# sourceMappingURL=secp256k1-class.js.map","/**\n * @packageDocumentation\n *\n * **Supported Key Types**\n *\n * The {@link generateKeyPair}, {@link marshalPublicKey}, and {@link marshalPrivateKey} functions accept a string `type` argument.\n *\n * Currently the `'RSA'`, `'ed25519'`, and `secp256k1` types are supported, although ed25519 and secp256k1 keys support only signing and verification of messages.\n *\n * For encryption / decryption support, RSA keys should be used.\n */\nimport { CodeError } from '@libp2p/interface';\nimport * as Ed25519 from './ed25519-class.js';\nimport generateEphemeralKeyPair from './ephemeral-keys.js';\nimport { importer } from './importer.js';\nimport { keyStretcher } from './key-stretcher.js';\nimport * as keysPBM from './keys.js';\nimport * as RSA from './rsa-class.js';\nimport { importFromPem } from './rsa-utils.js';\nimport * as Secp256k1 from './secp256k1-class.js';\nexport { keyStretcher };\nexport { generateEphemeralKeyPair };\nexport { keysPBM };\nexport { RsaPrivateKey, RsaPublicKey, MAX_RSA_KEY_SIZE } from './rsa-class.js';\nexport { Ed25519PrivateKey, Ed25519PublicKey } from './ed25519-class.js';\nexport { Secp256k1PrivateKey, Secp256k1PublicKey } from './secp256k1-class.js';\nexport const supportedKeys = {\n rsa: RSA,\n ed25519: Ed25519,\n secp256k1: Secp256k1\n};\nfunction unsupportedKey(type) {\n const supported = Object.keys(supportedKeys).join(' / ');\n return new CodeError(`invalid or unsupported key type ${type}. Must be ${supported}`, 'ERR_UNSUPPORTED_KEY_TYPE');\n}\nfunction typeToKey(type) {\n type = type.toLowerCase();\n if (type === 'rsa' || type === 'ed25519' || type === 'secp256k1') {\n return supportedKeys[type];\n }\n throw unsupportedKey(type);\n}\n/**\n * Generates a keypair of the given type and bitsize\n */\nexport async function generateKeyPair(type, bits) {\n return typeToKey(type).generateKeyPair(bits ?? 2048);\n}\n/**\n * Generates a keypair of the given type and bitsize.\n *\n * Seed is a 32 byte uint8array\n */\nexport async function generateKeyPairFromSeed(type, seed, bits) {\n if (type.toLowerCase() !== 'ed25519') {\n throw new CodeError('Seed key derivation is unimplemented for RSA or secp256k1', 'ERR_UNSUPPORTED_KEY_DERIVATION_TYPE');\n }\n return Ed25519.generateKeyPairFromSeed(seed);\n}\n/**\n * Converts a protobuf serialized public key into its representative object\n */\nexport function unmarshalPublicKey(buf) {\n const decoded = keysPBM.PublicKey.decode(buf);\n const data = decoded.Data ?? new Uint8Array();\n switch (decoded.Type) {\n case keysPBM.KeyType.RSA:\n return supportedKeys.rsa.unmarshalRsaPublicKey(data);\n case keysPBM.KeyType.Ed25519:\n return supportedKeys.ed25519.unmarshalEd25519PublicKey(data);\n case keysPBM.KeyType.Secp256k1:\n return supportedKeys.secp256k1.unmarshalSecp256k1PublicKey(data);\n default:\n throw unsupportedKey(decoded.Type ?? 'unknown');\n }\n}\n/**\n * Converts a public key object into a protobuf serialized public key\n */\nexport function marshalPublicKey(key, type) {\n type = (type ?? 'rsa').toLowerCase();\n typeToKey(type); // check type\n return key.bytes;\n}\n/**\n * Converts a protobuf serialized private key into its representative object\n */\nexport async function unmarshalPrivateKey(buf) {\n const decoded = keysPBM.PrivateKey.decode(buf);\n const data = decoded.Data ?? new Uint8Array();\n switch (decoded.Type) {\n case keysPBM.KeyType.RSA:\n return supportedKeys.rsa.unmarshalRsaPrivateKey(data);\n case keysPBM.KeyType.Ed25519:\n return supportedKeys.ed25519.unmarshalEd25519PrivateKey(data);\n case keysPBM.KeyType.Secp256k1:\n return supportedKeys.secp256k1.unmarshalSecp256k1PrivateKey(data);\n default:\n throw unsupportedKey(decoded.Type ?? 'RSA');\n }\n}\n/**\n * Converts a private key object into a protobuf serialized private key\n */\nexport function marshalPrivateKey(key, type) {\n type = (type ?? 'rsa').toLowerCase();\n typeToKey(type); // check type\n return key.bytes;\n}\n/**\n * Converts an exported private key into its representative object.\n *\n * Supported formats are 'pem' (RSA only) and 'libp2p-key'.\n */\nexport async function importKey(encryptedKey, password) {\n try {\n const key = await importer(encryptedKey, password);\n return await unmarshalPrivateKey(key);\n }\n catch (_) {\n // Ignore and try the old pem decrypt\n }\n if (!encryptedKey.includes('BEGIN')) {\n throw new CodeError('Encrypted key was not a libp2p-key or a PEM file', 'ERR_INVALID_IMPORT_FORMAT');\n }\n return importFromPem(encryptedKey, password);\n}\n//# sourceMappingURL=index.js.map","/**\n * @packageDocumentation\n *\n * Exports a `Libp2p` type for modules to use as a type argument.\n *\n * @example\n *\n * ```typescript\n * import type { Libp2p } from '@libp2p/interface'\n *\n * function doSomethingWithLibp2p (node: Libp2p) {\n * // ...\n * }\n * ```\n */\n/**\n * This symbol is used by libp2p services to define the capabilities they can\n * provide to other libp2p services.\n *\n * The service should define a property with this symbol as the key and the\n * value should be a string array of provided capabilities.\n */\nexport const serviceCapabilities = Symbol.for('@libp2p/service-capabilities');\n/**\n * This symbol is used by libp2p services to define the capabilities they\n * require from other libp2p services.\n *\n * The service should define a property with this symbol as the key and the\n * value should be a string array of required capabilities.\n */\nexport const serviceDependencies = Symbol.for('@libp2p/service-dependencies');\nexport * from './connection/index.js';\nexport * from './connection-encrypter/index.js';\nexport * from './connection-gater/index.js';\nexport * from './content-routing/index.js';\nexport * from './keys/index.js';\nexport * from './metrics/index.js';\nexport * from './peer-discovery/index.js';\nexport * from './peer-id/index.js';\nexport * from './peer-info/index.js';\nexport * from './peer-routing/index.js';\nexport * from './peer-store/index.js';\nexport * from './peer-store/tags.js';\nexport * from './pubsub/index.js';\nexport * from './record/index.js';\nexport * from './stream-handler/index.js';\nexport * from './stream-muxer/index.js';\nexport * from './topology/index.js';\nexport * from './transport/index.js';\nexport * from './errors.js';\nexport * from './event-target.js';\nexport * from './events.js';\nexport * from './startable.js';\n//# sourceMappingURL=index.js.map","/**\n * @packageDocumentation\n *\n * An implementation of a peer id\n *\n * @example\n *\n * ```TypeScript\n * import { peerIdFromString } from '@libp2p/peer-id'\n * const peer = peerIdFromString('k51qzi5uqu5dkwkqm42v9j9kqcam2jiuvloi16g72i4i4amoo2m8u3ol3mqu6s')\n *\n * console.log(peer.toCID()) // CID(bafzaa...)\n * console.log(peer.toString()) // \"12D3K...\"\n * ```\n */\nimport { CodeError } from '@libp2p/interface';\nimport { peerIdSymbol } from '@libp2p/interface';\nimport { base58btc } from 'multiformats/bases/base58';\nimport { bases } from 'multiformats/basics';\nimport { CID } from 'multiformats/cid';\nimport * as Digest from 'multiformats/hashes/digest';\nimport { identity } from 'multiformats/hashes/identity';\nimport { sha256 } from 'multiformats/hashes/sha2';\nimport { equals as uint8ArrayEquals } from 'uint8arrays/equals';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport { toString as uint8ArrayToString } from 'uint8arrays/to-string';\nconst inspect = Symbol.for('nodejs.util.inspect.custom');\nconst baseDecoder = Object\n .values(bases)\n .map(codec => codec.decoder)\n // @ts-expect-error https://github.com/multiformats/js-multiformats/issues/141\n .reduce((acc, curr) => acc.or(curr), bases.identity.decoder);\n// these values are from https://github.com/multiformats/multicodec/blob/master/table.csv\nconst LIBP2P_KEY_CODE = 0x72;\nconst MARSHALLED_ED225519_PUBLIC_KEY_LENGTH = 36;\nconst MARSHALLED_SECP256K1_PUBLIC_KEY_LENGTH = 37;\nclass PeerIdImpl {\n type;\n multihash;\n privateKey;\n publicKey;\n string;\n constructor(init) {\n this.type = init.type;\n this.multihash = init.multihash;\n this.privateKey = init.privateKey;\n // mark string cache as non-enumerable\n Object.defineProperty(this, 'string', {\n enumerable: false,\n writable: true\n });\n }\n get [Symbol.toStringTag]() {\n return `PeerId(${this.toString()})`;\n }\n [peerIdSymbol] = true;\n toString() {\n if (this.string == null) {\n this.string = base58btc.encode(this.multihash.bytes).slice(1);\n }\n return this.string;\n }\n // return self-describing String representation\n // in default format from RFC 0001: https://github.com/libp2p/specs/pull/209\n toCID() {\n return CID.createV1(LIBP2P_KEY_CODE, this.multihash);\n }\n toBytes() {\n return this.multihash.bytes;\n }\n /**\n * Returns Multiaddr as a JSON string\n */\n toJSON() {\n return this.toString();\n }\n /**\n * Checks the equality of `this` peer against a given PeerId\n */\n equals(id) {\n if (id == null) {\n return false;\n }\n if (id instanceof Uint8Array) {\n return uint8ArrayEquals(this.multihash.bytes, id);\n }\n else if (typeof id === 'string') {\n return peerIdFromString(id).equals(this);\n }\n else if (id?.multihash?.bytes != null) {\n return uint8ArrayEquals(this.multihash.bytes, id.multihash.bytes);\n }\n else {\n throw new Error('not valid Id');\n }\n }\n /**\n * Returns PeerId as a human-readable string\n * https://nodejs.org/api/util.html#utilinspectcustom\n *\n * @example\n * ```TypeScript\n * import { peerIdFromString } from '@libp2p/peer-id'\n *\n * console.info(peerIdFromString('QmFoo'))\n * // 'PeerId(QmFoo)'\n * ```\n */\n [inspect]() {\n return `PeerId(${this.toString()})`;\n }\n}\nclass RSAPeerIdImpl extends PeerIdImpl {\n type = 'RSA';\n publicKey;\n constructor(init) {\n super({ ...init, type: 'RSA' });\n this.publicKey = init.publicKey;\n }\n}\nclass Ed25519PeerIdImpl extends PeerIdImpl {\n type = 'Ed25519';\n publicKey;\n constructor(init) {\n super({ ...init, type: 'Ed25519' });\n this.publicKey = init.multihash.digest;\n }\n}\nclass Secp256k1PeerIdImpl extends PeerIdImpl {\n type = 'secp256k1';\n publicKey;\n constructor(init) {\n super({ ...init, type: 'secp256k1' });\n this.publicKey = init.multihash.digest;\n }\n}\n// these values are from https://github.com/multiformats/multicodec/blob/master/table.csv\nconst TRANSPORT_IPFS_GATEWAY_HTTP_CODE = 0x0920;\nclass URLPeerIdImpl {\n type = 'url';\n multihash;\n privateKey;\n publicKey;\n url;\n constructor(url) {\n this.url = url.toString();\n this.multihash = identity.digest(uint8ArrayFromString(this.url));\n }\n [inspect]() {\n return `PeerId(${this.url})`;\n }\n [peerIdSymbol] = true;\n toString() {\n return this.toCID().toString();\n }\n toCID() {\n return CID.createV1(TRANSPORT_IPFS_GATEWAY_HTTP_CODE, this.multihash);\n }\n toBytes() {\n return this.toCID().bytes;\n }\n equals(other) {\n if (other == null) {\n return false;\n }\n if (other instanceof Uint8Array) {\n other = uint8ArrayToString(other);\n }\n return other.toString() === this.toString();\n }\n}\nexport function createPeerId(init) {\n if (init.type === 'RSA') {\n return new RSAPeerIdImpl(init);\n }\n if (init.type === 'Ed25519') {\n return new Ed25519PeerIdImpl(init);\n }\n if (init.type === 'secp256k1') {\n return new Secp256k1PeerIdImpl(init);\n }\n throw new CodeError('Type must be \"RSA\", \"Ed25519\" or \"secp256k1\"', 'ERR_INVALID_PARAMETERS');\n}\nexport function peerIdFromPeerId(other) {\n if (other.type === 'RSA') {\n return new RSAPeerIdImpl(other);\n }\n if (other.type === 'Ed25519') {\n return new Ed25519PeerIdImpl(other);\n }\n if (other.type === 'secp256k1') {\n return new Secp256k1PeerIdImpl(other);\n }\n throw new CodeError('Not a PeerId', 'ERR_INVALID_PARAMETERS');\n}\nexport function peerIdFromString(str, decoder) {\n decoder = decoder ?? baseDecoder;\n if (str.charAt(0) === '1' || str.charAt(0) === 'Q') {\n // identity hash ed25519/secp256k1 key or sha2-256 hash of\n // rsa public key - base58btc encoded either way\n const multihash = Digest.decode(base58btc.decode(`z${str}`));\n if (str.startsWith('12D')) {\n return new Ed25519PeerIdImpl({ multihash });\n }\n else if (str.startsWith('16U')) {\n return new Secp256k1PeerIdImpl({ multihash });\n }\n else {\n return new RSAPeerIdImpl({ multihash });\n }\n }\n return peerIdFromBytes(baseDecoder.decode(str));\n}\nexport function peerIdFromBytes(buf) {\n try {\n const multihash = Digest.decode(buf);\n if (multihash.code === identity.code) {\n if (multihash.digest.length === MARSHALLED_ED225519_PUBLIC_KEY_LENGTH) {\n return new Ed25519PeerIdImpl({ multihash });\n }\n else if (multihash.digest.length === MARSHALLED_SECP256K1_PUBLIC_KEY_LENGTH) {\n return new Secp256k1PeerIdImpl({ multihash });\n }\n }\n if (multihash.code === sha256.code) {\n return new RSAPeerIdImpl({ multihash });\n }\n }\n catch {\n return peerIdFromCID(CID.decode(buf));\n }\n throw new Error('Supplied PeerID CID is invalid');\n}\nexport function peerIdFromCID(cid) {\n if (cid?.multihash == null || cid.version == null || (cid.version === 1 && (cid.code !== LIBP2P_KEY_CODE) && cid.code !== TRANSPORT_IPFS_GATEWAY_HTTP_CODE)) {\n throw new Error('Supplied PeerID CID is invalid');\n }\n if (cid.code === TRANSPORT_IPFS_GATEWAY_HTTP_CODE) {\n const url = uint8ArrayToString(cid.multihash.digest);\n return new URLPeerIdImpl(new URL(url));\n }\n const multihash = cid.multihash;\n if (multihash.code === sha256.code) {\n return new RSAPeerIdImpl({ multihash: cid.multihash });\n }\n else if (multihash.code === identity.code) {\n if (multihash.digest.length === MARSHALLED_ED225519_PUBLIC_KEY_LENGTH) {\n return new Ed25519PeerIdImpl({ multihash: cid.multihash });\n }\n else if (multihash.digest.length === MARSHALLED_SECP256K1_PUBLIC_KEY_LENGTH) {\n return new Secp256k1PeerIdImpl({ multihash: cid.multihash });\n }\n }\n throw new Error('Supplied PeerID CID is invalid');\n}\n/**\n * @param publicKey - A marshalled public key\n * @param privateKey - A marshalled private key\n */\nexport async function peerIdFromKeys(publicKey, privateKey) {\n if (publicKey.length === MARSHALLED_ED225519_PUBLIC_KEY_LENGTH) {\n return new Ed25519PeerIdImpl({ multihash: Digest.create(identity.code, publicKey), privateKey });\n }\n if (publicKey.length === MARSHALLED_SECP256K1_PUBLIC_KEY_LENGTH) {\n return new Secp256k1PeerIdImpl({ multihash: Digest.create(identity.code, publicKey), privateKey });\n }\n return new RSAPeerIdImpl({ multihash: await sha256.digest(publicKey), publicKey, privateKey });\n}\n//# sourceMappingURL=index.js.map","/**\n * An abort error class that extends error\n */\nexport class AbortError extends Error {\n type;\n code;\n constructor(message, code, name) {\n super(message ?? 'The operation was aborted');\n this.type = 'aborted';\n this.name = name ?? 'AbortError';\n this.code = code ?? 'ABORT_ERR';\n }\n}\n/**\n * Race a promise against an abort signal\n */\nexport async function raceSignal(promise, signal, opts) {\n if (signal == null) {\n return promise;\n }\n if (signal.aborted) {\n return Promise.reject(new AbortError(opts?.errorMessage, opts?.errorCode, opts?.errorName));\n }\n let listener;\n // create the error here so we have more context in the stack trace\n const error = new AbortError(opts?.errorMessage, opts?.errorCode, opts?.errorName);\n try {\n return await Promise.race([\n promise,\n new Promise((resolve, reject) => {\n listener = () => {\n reject(error);\n };\n signal.addEventListener('abort', listener);\n })\n ]);\n }\n finally {\n if (listener != null) {\n signal.removeEventListener('abort', listener);\n }\n }\n}\n//# sourceMappingURL=index.js.map","/**\n * @packageDocumentation\n *\n * A pushable async generator that waits until the current value is consumed\n * before allowing a new value to be pushed.\n *\n * Useful for when you don't want to keep memory usage under control and/or\n * allow a downstream consumer to dictate how fast data flows through a pipe,\n * but you want to be able to apply a transform to that data.\n *\n * @example\n *\n * ```typescript\n * import { queuelessPushable } from 'it-queueless-pushable'\n *\n * const pushable = queuelessPushable()\n *\n * // run asynchronously\n * Promise.resolve().then(async () => {\n * // push a value - the returned promise will not resolve until the value is\n * // read from the pushable\n * await pushable.push('hello')\n * })\n *\n * // read a value\n * const result = await pushable.next()\n * console.info(result) // { done: false, value: 'hello' }\n * ```\n */\nimport deferred, {} from 'p-defer';\nimport { raceSignal } from 'race-signal';\nclass QueuelessPushable {\n readNext;\n haveNext;\n ended;\n nextResult;\n constructor() {\n this.ended = false;\n this.readNext = deferred();\n this.haveNext = deferred();\n }\n [Symbol.asyncIterator]() {\n return this;\n }\n async next() {\n if (this.nextResult == null) {\n // wait for the supplier to push a value\n await this.haveNext.promise;\n }\n if (this.nextResult == null) {\n throw new Error('HaveNext promise resolved but nextResult was undefined');\n }\n const nextResult = this.nextResult;\n this.nextResult = undefined;\n // signal to the supplier that we read the value\n this.readNext.resolve();\n this.readNext = deferred();\n return nextResult;\n }\n async throw(err) {\n this.ended = true;\n if (err != null) {\n // this can cause unhandled promise rejections if nothing is awaiting the\n // next value so attach a dummy catch listener to the promise\n this.haveNext.promise.catch(() => { });\n this.haveNext.reject(err);\n }\n const result = {\n done: true,\n value: undefined\n };\n return result;\n }\n async return() {\n const result = {\n done: true,\n value: undefined\n };\n await this._push(undefined);\n return result;\n }\n async push(value, options) {\n await this._push(value, options);\n }\n async end(err, options) {\n if (err != null) {\n await this.throw(err);\n }\n else {\n // abortable return\n await this._push(undefined, options);\n }\n }\n async _push(value, options) {\n if (value != null && this.ended) {\n throw new Error('Cannot push value onto an ended pushable');\n }\n // wait for all values to be read\n while (this.nextResult != null) {\n await this.readNext.promise;\n }\n if (value != null) {\n this.nextResult = { done: false, value };\n }\n else {\n this.ended = true;\n this.nextResult = { done: true, value: undefined };\n }\n // let the consumer know we have a new value\n this.haveNext.resolve();\n this.haveNext = deferred();\n // wait for the consumer to have finished processing the value and requested\n // the next one or for the passed signal to abort the waiting\n await raceSignal(this.readNext.promise, options?.signal, options);\n }\n}\nexport function queuelessPushable() {\n return new QueuelessPushable();\n}\n//# sourceMappingURL=index.js.map","/**\n * The incoming stream ended before the expected number of bytes were read\n */\nexport class UnexpectedEOFError extends Error {\n name = 'UnexpectedEOFError';\n code = 'ERR_UNEXPECTED_EOF';\n}\n//# sourceMappingURL=errors.js.map","/**\n * @packageDocumentation\n *\n * This module makes it easy to send and receive bytes over streams.\n *\n * @example\n *\n * ```typescript\n * import { byteStream } from 'it-byte-stream'\n *\n * const stream = byteStream(duplex)\n *\n * // read the next chunk\n * const bytes = await stream.read()\n *\n * // read the next five bytes\n * const fiveBytes = await stream.read(5)\n *\n * // write bytes into the stream\n * await stream.write(Uint8Array.from([0, 1, 2, 3, 4]))\n * ```\n */\nimport { queuelessPushable } from 'it-queueless-pushable';\nimport { Uint8ArrayList } from 'uint8arraylist';\nimport { UnexpectedEOFError } from './errors.js';\n/**\n * @deprecated This will not be exported in a future release\n */\nexport class CodeError extends Error {\n code;\n constructor(message, code) {\n super(message);\n this.code = code;\n }\n}\n/**\n * @deprecated This will not be exported in a future release\n */\nexport class AbortError extends CodeError {\n type;\n constructor(message) {\n super(message, 'ABORT_ERR');\n this.type = 'aborted';\n this.name = 'AbortError';\n }\n}\nexport function byteStream(duplex, opts) {\n const write = queuelessPushable();\n duplex.sink(write).catch(async (err) => {\n await write.end(err);\n });\n duplex.sink = async (source) => {\n for await (const buf of source) {\n await write.push(buf);\n }\n await write.end();\n };\n let source = duplex.source;\n if (duplex.source[Symbol.iterator] != null) {\n source = duplex.source[Symbol.iterator]();\n }\n else if (duplex.source[Symbol.asyncIterator] != null) {\n source = duplex.source[Symbol.asyncIterator]();\n }\n const readBuffer = new Uint8ArrayList();\n const W = {\n read: async (bytes, options) => {\n options?.signal?.throwIfAborted();\n let listener;\n const abortPromise = new Promise((resolve, reject) => {\n listener = () => {\n reject(new AbortError('Read aborted'));\n };\n options?.signal?.addEventListener('abort', listener);\n });\n try {\n if (bytes == null) {\n // just read whatever arrives\n const { done, value } = await Promise.race([\n source.next(),\n abortPromise\n ]);\n if (done === true) {\n return new Uint8ArrayList();\n }\n return value;\n }\n while (readBuffer.byteLength < bytes) {\n const { value, done } = await Promise.race([\n source.next(),\n abortPromise\n ]);\n if (done === true) {\n throw new UnexpectedEOFError('unexpected end of input');\n }\n readBuffer.append(value);\n }\n const buf = readBuffer.sublist(0, bytes);\n readBuffer.consume(bytes);\n return buf;\n }\n finally {\n if (listener != null) {\n options?.signal?.removeEventListener('abort', listener);\n }\n }\n },\n write: async (data, options) => {\n options?.signal?.throwIfAborted();\n // just write\n if (data instanceof Uint8Array) {\n await write.push(data, options);\n }\n else {\n await write.push(data.subarray(), options);\n }\n },\n unwrap: () => {\n if (readBuffer.byteLength > 0) {\n const originalStream = duplex.source;\n duplex.source = (async function* () {\n if (opts?.yieldBytes === false) {\n yield readBuffer;\n }\n else {\n yield* readBuffer;\n }\n yield* originalStream;\n }());\n }\n return duplex;\n }\n };\n return W;\n}\n//# sourceMappingURL=index.js.map","/**\n * The reported length of the next data message was not a positive integer\n */\nexport class InvalidMessageLengthError extends Error {\n name = 'InvalidMessageLengthError';\n code = 'ERR_INVALID_MSG_LENGTH';\n}\n/**\n * The reported length of the next data message was larger than the configured\n * max allowable value\n */\nexport class InvalidDataLengthError extends Error {\n name = 'InvalidDataLengthError';\n code = 'ERR_MSG_DATA_TOO_LONG';\n}\n/**\n * The varint used to specify the length of the next data message contained more\n * bytes than the configured max allowable value\n */\nexport class InvalidDataLengthLengthError extends Error {\n name = 'InvalidDataLengthLengthError';\n code = 'ERR_MSG_LENGTH_TOO_LONG';\n}\n//# sourceMappingURL=errors.js.map","/**\n * @packageDocumentation\n *\n * This module makes it easy to send and receive length-prefixed byte arrays over streams.\n *\n * @example\n *\n * ```typescript\n * import { lpStream } from 'it-length-prefixed-stream'\n *\n * const stream = lpStream(duplex)\n *\n * // read the next length-prefixed chunk\n * const bytes = await stream.read()\n *\n * // write a length-prefixed chunk\n * await stream.write(Uint8Array.from([0, 1, 2, 3, 4]))\n *\n * // write several chunks, all individually length-prefixed\n * await stream.writeV([\n * Uint8Array.from([0, 1, 2, 3, 4]),\n * Uint8Array.from([5, 6, 7, 8, 9])\n * ])\n * ```\n */\nimport { byteStream } from 'it-byte-stream';\nimport * as varint from 'uint8-varint';\nimport { Uint8ArrayList } from 'uint8arraylist';\nimport { InvalidDataLengthError, InvalidDataLengthLengthError, InvalidMessageLengthError } from './errors.js';\nexport function lpStream(duplex, opts = {}) {\n const bytes = byteStream(duplex, opts);\n if (opts.maxDataLength != null && opts.maxLengthLength == null) {\n // if max data length is set but max length length is not, calculate the\n // max length length needed to encode max data length\n opts.maxLengthLength = varint.encodingLength(opts.maxDataLength);\n }\n const decodeLength = opts?.lengthDecoder ?? varint.decode;\n const encodeLength = opts?.lengthEncoder ?? varint.encode;\n const W = {\n read: async (options) => {\n let dataLength = -1;\n const lengthBuffer = new Uint8ArrayList();\n while (true) {\n // read one byte at a time until we can decode a varint\n lengthBuffer.append(await bytes.read(1, options));\n try {\n dataLength = decodeLength(lengthBuffer);\n }\n catch (err) {\n if (err instanceof RangeError) {\n continue;\n }\n throw err;\n }\n if (dataLength < 0) {\n throw new InvalidMessageLengthError('Invalid message length');\n }\n if (opts?.maxLengthLength != null && lengthBuffer.byteLength > opts.maxLengthLength) {\n throw new InvalidDataLengthLengthError('message length length too long');\n }\n if (dataLength > -1) {\n break;\n }\n }\n if (opts?.maxDataLength != null && dataLength > opts.maxDataLength) {\n throw new InvalidDataLengthError('message length too long');\n }\n return bytes.read(dataLength, options);\n },\n write: async (data, options) => {\n // encode, write\n await bytes.write(new Uint8ArrayList(encodeLength(data.byteLength), data), options);\n },\n writeV: async (data, options) => {\n const list = new Uint8ArrayList(...data.flatMap(buf => ([encodeLength(buf.byteLength), buf])));\n // encode, write\n await bytes.write(list, options);\n },\n unwrap: () => {\n return bytes.unwrap();\n }\n };\n return W;\n}\n//# sourceMappingURL=index.js.map","import defer from 'p-defer';\n/**\n * A pair of streams where one drains from the other\n */\nexport function pair() {\n const deferred = defer();\n let piped = false;\n return {\n sink: async (source) => {\n if (piped) {\n throw new Error('already piped');\n }\n piped = true;\n deferred.resolve(source);\n },\n source: (async function* () {\n const source = await deferred.promise;\n yield* source;\n }())\n };\n}\n//# sourceMappingURL=index.js.map","export const NOISE_MSG_MAX_LENGTH_BYTES = 65535;\nexport const NOISE_MSG_MAX_LENGTH_BYTES_WITHOUT_TAG = NOISE_MSG_MAX_LENGTH_BYTES - 16;\nexport const DUMP_SESSION_KEYS = Boolean(globalThis.process?.env?.DUMP_SESSION_KEYS);\n//# sourceMappingURL=constants.js.map","function number(n) {\n if (!Number.isSafeInteger(n) || n < 0)\n throw new Error(`positive integer expected, not ${n}`);\n}\nfunction bool(b) {\n if (typeof b !== 'boolean')\n throw new Error(`boolean expected, not ${b}`);\n}\nexport function isBytes(a) {\n return (a instanceof Uint8Array ||\n (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array'));\n}\nfunction bytes(b, ...lengths) {\n if (!isBytes(b))\n throw new Error('Uint8Array expected');\n if (lengths.length > 0 && !lengths.includes(b.length))\n throw new Error(`Uint8Array expected of length ${lengths}, not of length=${b.length}`);\n}\nfunction hash(hash) {\n if (typeof hash !== 'function' || typeof hash.create !== 'function')\n throw new Error('hash must be wrapped by utils.wrapConstructor');\n number(hash.outputLen);\n number(hash.blockLen);\n}\nfunction exists(instance, checkFinished = true) {\n if (instance.destroyed)\n throw new Error('Hash instance has been destroyed');\n if (checkFinished && instance.finished)\n throw new Error('Hash#digest() has already been called');\n}\nfunction output(out, instance) {\n bytes(out);\n const min = instance.outputLen;\n if (out.length < min) {\n throw new Error(`digestInto() expects output buffer of length at least ${min}`);\n }\n}\nexport { number, bool, bytes, hash, exists, output };\nconst assert = { number, bool, bytes, hash, exists, output };\nexport default assert;\n//# sourceMappingURL=_assert.js.map","/*! noble-ciphers - MIT License (c) 2023 Paul Miller (paulmillr.com) */\nimport { bytes as abytes, isBytes } from './_assert.js';\n// Cast array to different type\nexport const u8 = (arr) => new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\nexport const u16 = (arr) => new Uint16Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 2));\nexport const u32 = (arr) => new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n// Cast array to view\nexport const createView = (arr) => new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n// big-endian hardware is rare. Just in case someone still decides to run ciphers:\n// early-throw an error because we don't support BE yet.\nexport const isLE = new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44;\nif (!isLE)\n throw new Error('Non little-endian hardware is not supported');\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'));\n/**\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes) {\n abytes(bytes);\n // pre-caching improves the speed 6x\n let hex = '';\n for (let i = 0; i < bytes.length; i++) {\n hex += hexes[bytes[i]];\n }\n return hex;\n}\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, _A: 65, _F: 70, _a: 97, _f: 102 };\nfunction asciiToBase16(char) {\n if (char >= asciis._0 && char <= asciis._9)\n return char - asciis._0;\n if (char >= asciis._A && char <= asciis._F)\n return char - (asciis._A - 10);\n if (char >= asciis._a && char <= asciis._f)\n return char - (asciis._a - 10);\n return;\n}\n/**\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex) {\n if (typeof hex !== 'string')\n throw new Error('hex string expected, got ' + typeof hex);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2)\n throw new Error('padded hex string expected, got unpadded hex of length ' + hl);\n const array = new Uint8Array(al);\n for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n const n1 = asciiToBase16(hex.charCodeAt(hi));\n const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n if (n1 === undefined || n2 === undefined) {\n const char = hex[hi] + hex[hi + 1];\n throw new Error('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n }\n array[ai] = n1 * 16 + n2;\n }\n return array;\n}\nexport function hexToNumber(hex) {\n if (typeof hex !== 'string')\n throw new Error('hex string expected, got ' + typeof hex);\n // Big Endian\n return BigInt(hex === '' ? '0' : `0x${hex}`);\n}\n// BE: Big Endian, LE: Little Endian\nexport function bytesToNumberBE(bytes) {\n return hexToNumber(bytesToHex(bytes));\n}\nexport function numberToBytesBE(n, len) {\n return hexToBytes(n.toString(16).padStart(len * 2, '0'));\n}\n// There is no setImmediate in browser and setTimeout is slow.\n// call of async fn will return Promise, which will be fullfiled only on\n// next scheduler queue processing step and this is exactly what we need.\nexport const nextTick = async () => { };\n// Returns control to thread each 'tick' ms to avoid blocking\nexport async function asyncLoop(iters, tick, cb) {\n let ts = Date.now();\n for (let i = 0; i < iters; i++) {\n cb(i);\n // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n const diff = Date.now() - ts;\n if (diff >= 0 && diff < tick)\n continue;\n await nextTick();\n ts += diff;\n }\n}\n/**\n * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nexport function utf8ToBytes(str) {\n if (typeof str !== 'string')\n throw new Error(`string expected, got ${typeof str}`);\n return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n/**\n * @example bytesToUtf8(new Uint8Array([97, 98, 99])) // 'abc'\n */\nexport function bytesToUtf8(bytes) {\n return new TextDecoder().decode(bytes);\n}\n/**\n * Normalizes (non-hex) string or Uint8Array to Uint8Array.\n * Warning: when Uint8Array is passed, it would NOT get copied.\n * Keep in mind for future mutable operations.\n */\nexport function toBytes(data) {\n if (typeof data === 'string')\n data = utf8ToBytes(data);\n else if (isBytes(data))\n data = copyBytes(data);\n else\n throw new Error(`Uint8Array expected, got ${typeof data}`);\n return data;\n}\n/**\n * Copies several Uint8Arrays into one.\n */\nexport function concatBytes(...arrays) {\n let sum = 0;\n for (let i = 0; i < arrays.length; i++) {\n const a = arrays[i];\n abytes(a);\n sum += a.length;\n }\n const res = new Uint8Array(sum);\n for (let i = 0, pad = 0; i < arrays.length; i++) {\n const a = arrays[i];\n res.set(a, pad);\n pad += a.length;\n }\n return res;\n}\nexport function checkOpts(defaults, opts) {\n if (opts == null || typeof opts !== 'object')\n throw new Error('options must be defined');\n const merged = Object.assign(defaults, opts);\n return merged;\n}\n// Compares 2 u8a-s in kinda constant time\nexport function equalBytes(a, b) {\n if (a.length !== b.length)\n return false;\n let diff = 0;\n for (let i = 0; i < a.length; i++)\n diff |= a[i] ^ b[i];\n return diff === 0;\n}\n// For runtime check if class implements interface\nexport class Hash {\n}\n/**\n * @__NO_SIDE_EFFECTS__\n */\nexport const wrapCipher = (params, c) => {\n Object.assign(c, params);\n return c;\n};\n// Polyfill for Safari 14\nexport function setBigUint64(view, byteOffset, value, isLE) {\n if (typeof view.setBigUint64 === 'function')\n return view.setBigUint64(byteOffset, value, isLE);\n const _32n = BigInt(32);\n const _u32_max = BigInt(0xffffffff);\n const wh = Number((value >> _32n) & _u32_max);\n const wl = Number(value & _u32_max);\n const h = isLE ? 4 : 0;\n const l = isLE ? 0 : 4;\n view.setUint32(byteOffset + h, wh, isLE);\n view.setUint32(byteOffset + l, wl, isLE);\n}\nexport function u64Lengths(ciphertext, AAD) {\n const num = new Uint8Array(16);\n const view = createView(num);\n setBigUint64(view, 0, BigInt(AAD ? AAD.length : 0), true);\n setBigUint64(view, 8, BigInt(ciphertext.length), true);\n return num;\n}\n// Is byte array aligned to 4 byte offset (u32)?\nexport function isAligned32(bytes) {\n return bytes.byteOffset % 4 === 0;\n}\n// copy bytes to new u8a (aligned). Because Buffer.slice is broken.\nexport function copyBytes(bytes) {\n return Uint8Array.from(bytes);\n}\nexport function clean(...arrays) {\n for (let i = 0; i < arrays.length; i++) {\n arrays[i].fill(0);\n }\n}\n//# sourceMappingURL=utils.js.map","// Basic utils for ARX (add-rotate-xor) salsa and chacha ciphers.\nimport { bool as abool, bytes as abytes, number as anumber } from './_assert.js';\nimport { checkOpts, clean, copyBytes, u32 } from './utils.js';\n/*\nRFC8439 requires multi-step cipher stream, where\nauthKey starts with counter: 0, actual msg with counter: 1.\n\nFor this, we need a way to re-use nonce / counter:\n\n const counter = new Uint8Array(4);\n chacha(..., counter, ...); // counter is now 1\n chacha(..., counter, ...); // counter is now 2\n\nThis is complicated:\n\n- 32-bit counters are enough, no need for 64-bit: max ArrayBuffer size in JS is 4GB\n- Original papers don't allow mutating counters\n- Counter overflow is undefined [^1]\n- Idea A: allow providing (nonce | counter) instead of just nonce, re-use it\n- Caveat: Cannot be re-used through all cases:\n- * chacha has (counter | nonce)\n- * xchacha has (nonce16 | counter | nonce16)\n- Idea B: separate nonce / counter and provide separate API for counter re-use\n- Caveat: there are different counter sizes depending on an algorithm.\n- salsa & chacha also differ in structures of key & sigma:\n salsa20: s[0] | k(4) | s[1] | nonce(2) | ctr(2) | s[2] | k(4) | s[3]\n chacha: s(4) | k(8) | ctr(1) | nonce(3)\n chacha20orig: s(4) | k(8) | ctr(2) | nonce(2)\n- Idea C: helper method such as `setSalsaState(key, nonce, sigma, data)`\n- Caveat: we can't re-use counter array\n\nxchacha [^2] uses the subkey and remaining 8 byte nonce with ChaCha20 as normal\n(prefixed by 4 NUL bytes, since [RFC8439] specifies a 12-byte nonce).\n\n[^1]: https://mailarchive.ietf.org/arch/msg/cfrg/gsOnTJzcbgG6OqD8Sc0GO5aR_tU/\n[^2]: https://datatracker.ietf.org/doc/html/draft-irtf-cfrg-xchacha#appendix-A.2\n*/\n// We can't make top-level var depend on utils.utf8ToBytes\n// because it's not present in all envs. Creating a similar fn here\nconst _utf8ToBytes = (str) => Uint8Array.from(str.split('').map((c) => c.charCodeAt(0)));\nconst sigma16 = _utf8ToBytes('expand 16-byte k');\nconst sigma32 = _utf8ToBytes('expand 32-byte k');\nconst sigma16_32 = u32(sigma16);\nconst sigma32_32 = u32(sigma32);\nexport const sigma = sigma32_32.slice();\nexport function rotl(a, b) {\n return (a << b) | (a >>> (32 - b));\n}\n// Is byte array aligned to 4 byte offset (u32)?\nfunction isAligned32(b) {\n return b.byteOffset % 4 === 0;\n}\n// Salsa and Chacha block length is always 512-bit\nconst BLOCK_LEN = 64;\nconst BLOCK_LEN32 = 16;\n// new Uint32Array([2**32]) // => Uint32Array(1) [ 0 ]\n// new Uint32Array([2**32-1]) // => Uint32Array(1) [ 4294967295 ]\nconst MAX_COUNTER = 2 ** 32 - 1;\nconst U32_EMPTY = new Uint32Array();\nfunction runCipher(core, sigma, key, nonce, data, output, counter, rounds) {\n const len = data.length;\n const block = new Uint8Array(BLOCK_LEN);\n const b32 = u32(block);\n // Make sure that buffers aligned to 4 bytes\n const isAligned = isAligned32(data) && isAligned32(output);\n const d32 = isAligned ? u32(data) : U32_EMPTY;\n const o32 = isAligned ? u32(output) : U32_EMPTY;\n for (let pos = 0; pos < len; counter++) {\n core(sigma, key, nonce, b32, counter, rounds);\n if (counter >= MAX_COUNTER)\n throw new Error('arx: counter overflow');\n const take = Math.min(BLOCK_LEN, len - pos);\n // aligned to 4 bytes\n if (isAligned && take === BLOCK_LEN) {\n const pos32 = pos / 4;\n if (pos % 4 !== 0)\n throw new Error('arx: invalid block position');\n for (let j = 0, posj; j < BLOCK_LEN32; j++) {\n posj = pos32 + j;\n o32[posj] = d32[posj] ^ b32[j];\n }\n pos += BLOCK_LEN;\n continue;\n }\n for (let j = 0, posj; j < take; j++) {\n posj = pos + j;\n output[posj] = data[posj] ^ block[j];\n }\n pos += take;\n }\n}\nexport function createCipher(core, opts) {\n const { allowShortKeys, extendNonceFn, counterLength, counterRight, rounds } = checkOpts({ allowShortKeys: false, counterLength: 8, counterRight: false, rounds: 20 }, opts);\n if (typeof core !== 'function')\n throw new Error('core must be a function');\n anumber(counterLength);\n anumber(rounds);\n abool(counterRight);\n abool(allowShortKeys);\n return (key, nonce, data, output, counter = 0) => {\n abytes(key);\n abytes(nonce);\n abytes(data);\n const len = data.length;\n if (output === undefined)\n output = new Uint8Array(len);\n abytes(output);\n anumber(counter);\n if (counter < 0 || counter >= MAX_COUNTER)\n throw new Error('arx: counter overflow');\n if (output.length < len)\n throw new Error(`arx: output (${output.length}) is shorter than data (${len})`);\n const toClean = [];\n // Key & sigma\n // key=16 -> sigma16, k=key|key\n // key=32 -> sigma32, k=key\n let l = key.length, k, sigma;\n if (l === 32) {\n toClean.push((k = copyBytes(key)));\n sigma = sigma32_32;\n }\n else if (l === 16 && allowShortKeys) {\n k = new Uint8Array(32);\n k.set(key);\n k.set(key, 16);\n sigma = sigma16_32;\n toClean.push(k);\n }\n else {\n throw new Error(`arx: invalid 32-byte key, got length=${l}`);\n }\n // Nonce\n // salsa20: 8 (8-byte counter)\n // chacha20orig: 8 (8-byte counter)\n // chacha20: 12 (4-byte counter)\n // xsalsa20: 24 (16 -> hsalsa, 8 -> old nonce)\n // xchacha20: 24 (16 -> hchacha, 8 -> old nonce)\n // Align nonce to 4 bytes\n if (!isAligned32(nonce))\n toClean.push((nonce = copyBytes(nonce)));\n const k32 = u32(k);\n // hsalsa & hchacha: handle extended nonce\n if (extendNonceFn) {\n if (nonce.length !== 24)\n throw new Error(`arx: extended nonce must be 24 bytes`);\n extendNonceFn(sigma, k32, u32(nonce.subarray(0, 16)), k32);\n nonce = nonce.subarray(16);\n }\n // Handle nonce counter\n const nonceNcLen = 16 - counterLength;\n if (nonceNcLen !== nonce.length)\n throw new Error(`arx: nonce must be ${nonceNcLen} or 16 bytes`);\n // Pad counter when nonce is 64 bit\n if (nonceNcLen !== 12) {\n const nc = new Uint8Array(12);\n nc.set(nonce, counterRight ? 0 : 12 - nonce.length);\n nonce = nc;\n toClean.push(nonce);\n }\n const n32 = u32(nonce);\n runCipher(core, sigma, k32, n32, data, output, counter, rounds);\n clean(...toClean);\n return output;\n };\n}\n//# sourceMappingURL=_arx.js.map","import { bytes as abytes, exists as aexists, output as aoutput } from './_assert.js';\nimport { clean, toBytes } from './utils.js';\n// Poly1305 is a fast and parallel secret-key message-authentication code.\n// https://cr.yp.to/mac.html, https://cr.yp.to/mac/poly1305-20050329.pdf\n// https://datatracker.ietf.org/doc/html/rfc8439\n// Based on Public Domain poly1305-donna https://github.com/floodyberry/poly1305-donna\nconst u8to16 = (a, i) => (a[i++] & 0xff) | ((a[i++] & 0xff) << 8);\nclass Poly1305 {\n constructor(key) {\n this.blockLen = 16;\n this.outputLen = 16;\n this.buffer = new Uint8Array(16);\n this.r = new Uint16Array(10);\n this.h = new Uint16Array(10);\n this.pad = new Uint16Array(8);\n this.pos = 0;\n this.finished = false;\n key = toBytes(key);\n abytes(key, 32);\n const t0 = u8to16(key, 0);\n const t1 = u8to16(key, 2);\n const t2 = u8to16(key, 4);\n const t3 = u8to16(key, 6);\n const t4 = u8to16(key, 8);\n const t5 = u8to16(key, 10);\n const t6 = u8to16(key, 12);\n const t7 = u8to16(key, 14);\n // https://github.com/floodyberry/poly1305-donna/blob/e6ad6e091d30d7f4ec2d4f978be1fcfcbce72781/poly1305-donna-16.h#L47\n this.r[0] = t0 & 0x1fff;\n this.r[1] = ((t0 >>> 13) | (t1 << 3)) & 0x1fff;\n this.r[2] = ((t1 >>> 10) | (t2 << 6)) & 0x1f03;\n this.r[3] = ((t2 >>> 7) | (t3 << 9)) & 0x1fff;\n this.r[4] = ((t3 >>> 4) | (t4 << 12)) & 0x00ff;\n this.r[5] = (t4 >>> 1) & 0x1ffe;\n this.r[6] = ((t4 >>> 14) | (t5 << 2)) & 0x1fff;\n this.r[7] = ((t5 >>> 11) | (t6 << 5)) & 0x1f81;\n this.r[8] = ((t6 >>> 8) | (t7 << 8)) & 0x1fff;\n this.r[9] = (t7 >>> 5) & 0x007f;\n for (let i = 0; i < 8; i++)\n this.pad[i] = u8to16(key, 16 + 2 * i);\n }\n process(data, offset, isLast = false) {\n const hibit = isLast ? 0 : 1 << 11;\n const { h, r } = this;\n const r0 = r[0];\n const r1 = r[1];\n const r2 = r[2];\n const r3 = r[3];\n const r4 = r[4];\n const r5 = r[5];\n const r6 = r[6];\n const r7 = r[7];\n const r8 = r[8];\n const r9 = r[9];\n const t0 = u8to16(data, offset + 0);\n const t1 = u8to16(data, offset + 2);\n const t2 = u8to16(data, offset + 4);\n const t3 = u8to16(data, offset + 6);\n const t4 = u8to16(data, offset + 8);\n const t5 = u8to16(data, offset + 10);\n const t6 = u8to16(data, offset + 12);\n const t7 = u8to16(data, offset + 14);\n let h0 = h[0] + (t0 & 0x1fff);\n let h1 = h[1] + (((t0 >>> 13) | (t1 << 3)) & 0x1fff);\n let h2 = h[2] + (((t1 >>> 10) | (t2 << 6)) & 0x1fff);\n let h3 = h[3] + (((t2 >>> 7) | (t3 << 9)) & 0x1fff);\n let h4 = h[4] + (((t3 >>> 4) | (t4 << 12)) & 0x1fff);\n let h5 = h[5] + ((t4 >>> 1) & 0x1fff);\n let h6 = h[6] + (((t4 >>> 14) | (t5 << 2)) & 0x1fff);\n let h7 = h[7] + (((t5 >>> 11) | (t6 << 5)) & 0x1fff);\n let h8 = h[8] + (((t6 >>> 8) | (t7 << 8)) & 0x1fff);\n let h9 = h[9] + ((t7 >>> 5) | hibit);\n let c = 0;\n let d0 = c + h0 * r0 + h1 * (5 * r9) + h2 * (5 * r8) + h3 * (5 * r7) + h4 * (5 * r6);\n c = d0 >>> 13;\n d0 &= 0x1fff;\n d0 += h5 * (5 * r5) + h6 * (5 * r4) + h7 * (5 * r3) + h8 * (5 * r2) + h9 * (5 * r1);\n c += d0 >>> 13;\n d0 &= 0x1fff;\n let d1 = c + h0 * r1 + h1 * r0 + h2 * (5 * r9) + h3 * (5 * r8) + h4 * (5 * r7);\n c = d1 >>> 13;\n d1 &= 0x1fff;\n d1 += h5 * (5 * r6) + h6 * (5 * r5) + h7 * (5 * r4) + h8 * (5 * r3) + h9 * (5 * r2);\n c += d1 >>> 13;\n d1 &= 0x1fff;\n let d2 = c + h0 * r2 + h1 * r1 + h2 * r0 + h3 * (5 * r9) + h4 * (5 * r8);\n c = d2 >>> 13;\n d2 &= 0x1fff;\n d2 += h5 * (5 * r7) + h6 * (5 * r6) + h7 * (5 * r5) + h8 * (5 * r4) + h9 * (5 * r3);\n c += d2 >>> 13;\n d2 &= 0x1fff;\n let d3 = c + h0 * r3 + h1 * r2 + h2 * r1 + h3 * r0 + h4 * (5 * r9);\n c = d3 >>> 13;\n d3 &= 0x1fff;\n d3 += h5 * (5 * r8) + h6 * (5 * r7) + h7 * (5 * r6) + h8 * (5 * r5) + h9 * (5 * r4);\n c += d3 >>> 13;\n d3 &= 0x1fff;\n let d4 = c + h0 * r4 + h1 * r3 + h2 * r2 + h3 * r1 + h4 * r0;\n c = d4 >>> 13;\n d4 &= 0x1fff;\n d4 += h5 * (5 * r9) + h6 * (5 * r8) + h7 * (5 * r7) + h8 * (5 * r6) + h9 * (5 * r5);\n c += d4 >>> 13;\n d4 &= 0x1fff;\n let d5 = c + h0 * r5 + h1 * r4 + h2 * r3 + h3 * r2 + h4 * r1;\n c = d5 >>> 13;\n d5 &= 0x1fff;\n d5 += h5 * r0 + h6 * (5 * r9) + h7 * (5 * r8) + h8 * (5 * r7) + h9 * (5 * r6);\n c += d5 >>> 13;\n d5 &= 0x1fff;\n let d6 = c + h0 * r6 + h1 * r5 + h2 * r4 + h3 * r3 + h4 * r2;\n c = d6 >>> 13;\n d6 &= 0x1fff;\n d6 += h5 * r1 + h6 * r0 + h7 * (5 * r9) + h8 * (5 * r8) + h9 * (5 * r7);\n c += d6 >>> 13;\n d6 &= 0x1fff;\n let d7 = c + h0 * r7 + h1 * r6 + h2 * r5 + h3 * r4 + h4 * r3;\n c = d7 >>> 13;\n d7 &= 0x1fff;\n d7 += h5 * r2 + h6 * r1 + h7 * r0 + h8 * (5 * r9) + h9 * (5 * r8);\n c += d7 >>> 13;\n d7 &= 0x1fff;\n let d8 = c + h0 * r8 + h1 * r7 + h2 * r6 + h3 * r5 + h4 * r4;\n c = d8 >>> 13;\n d8 &= 0x1fff;\n d8 += h5 * r3 + h6 * r2 + h7 * r1 + h8 * r0 + h9 * (5 * r9);\n c += d8 >>> 13;\n d8 &= 0x1fff;\n let d9 = c + h0 * r9 + h1 * r8 + h2 * r7 + h3 * r6 + h4 * r5;\n c = d9 >>> 13;\n d9 &= 0x1fff;\n d9 += h5 * r4 + h6 * r3 + h7 * r2 + h8 * r1 + h9 * r0;\n c += d9 >>> 13;\n d9 &= 0x1fff;\n c = ((c << 2) + c) | 0;\n c = (c + d0) | 0;\n d0 = c & 0x1fff;\n c = c >>> 13;\n d1 += c;\n h[0] = d0;\n h[1] = d1;\n h[2] = d2;\n h[3] = d3;\n h[4] = d4;\n h[5] = d5;\n h[6] = d6;\n h[7] = d7;\n h[8] = d8;\n h[9] = d9;\n }\n finalize() {\n const { h, pad } = this;\n const g = new Uint16Array(10);\n let c = h[1] >>> 13;\n h[1] &= 0x1fff;\n for (let i = 2; i < 10; i++) {\n h[i] += c;\n c = h[i] >>> 13;\n h[i] &= 0x1fff;\n }\n h[0] += c * 5;\n c = h[0] >>> 13;\n h[0] &= 0x1fff;\n h[1] += c;\n c = h[1] >>> 13;\n h[1] &= 0x1fff;\n h[2] += c;\n g[0] = h[0] + 5;\n c = g[0] >>> 13;\n g[0] &= 0x1fff;\n for (let i = 1; i < 10; i++) {\n g[i] = h[i] + c;\n c = g[i] >>> 13;\n g[i] &= 0x1fff;\n }\n g[9] -= 1 << 13;\n let mask = (c ^ 1) - 1;\n for (let i = 0; i < 10; i++)\n g[i] &= mask;\n mask = ~mask;\n for (let i = 0; i < 10; i++)\n h[i] = (h[i] & mask) | g[i];\n h[0] = (h[0] | (h[1] << 13)) & 0xffff;\n h[1] = ((h[1] >>> 3) | (h[2] << 10)) & 0xffff;\n h[2] = ((h[2] >>> 6) | (h[3] << 7)) & 0xffff;\n h[3] = ((h[3] >>> 9) | (h[4] << 4)) & 0xffff;\n h[4] = ((h[4] >>> 12) | (h[5] << 1) | (h[6] << 14)) & 0xffff;\n h[5] = ((h[6] >>> 2) | (h[7] << 11)) & 0xffff;\n h[6] = ((h[7] >>> 5) | (h[8] << 8)) & 0xffff;\n h[7] = ((h[8] >>> 8) | (h[9] << 5)) & 0xffff;\n let f = h[0] + pad[0];\n h[0] = f & 0xffff;\n for (let i = 1; i < 8; i++) {\n f = (((h[i] + pad[i]) | 0) + (f >>> 16)) | 0;\n h[i] = f & 0xffff;\n }\n clean(g);\n }\n update(data) {\n aexists(this);\n const { buffer, blockLen } = this;\n data = toBytes(data);\n const len = data.length;\n for (let pos = 0; pos < len;) {\n const take = Math.min(blockLen - this.pos, len - pos);\n // Fast path: we have at least one block in input\n if (take === blockLen) {\n for (; blockLen <= len - pos; pos += blockLen)\n this.process(data, pos);\n continue;\n }\n buffer.set(data.subarray(pos, pos + take), this.pos);\n this.pos += take;\n pos += take;\n if (this.pos === blockLen) {\n this.process(buffer, 0, false);\n this.pos = 0;\n }\n }\n return this;\n }\n destroy() {\n clean(this.h, this.r, this.buffer, this.pad);\n }\n digestInto(out) {\n aexists(this);\n aoutput(out, this);\n this.finished = true;\n const { buffer, h } = this;\n let { pos } = this;\n if (pos) {\n buffer[pos++] = 1;\n for (; pos < 16; pos++)\n buffer[pos] = 0;\n this.process(buffer, 0, true);\n }\n this.finalize();\n let opos = 0;\n for (let i = 0; i < 8; i++) {\n out[opos++] = h[i] >>> 0;\n out[opos++] = h[i] >>> 8;\n }\n return out;\n }\n digest() {\n const { buffer, outputLen } = this;\n this.digestInto(buffer);\n const res = buffer.slice(0, outputLen);\n this.destroy();\n return res;\n }\n}\nexport function wrapConstructorWithKey(hashCons) {\n const hashC = (msg, key) => hashCons(key).update(toBytes(msg)).digest();\n const tmp = hashCons(new Uint8Array(32));\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (key) => hashCons(key);\n return hashC;\n}\nexport const poly1305 = wrapConstructorWithKey((key) => new Poly1305(key));\n//# sourceMappingURL=_poly1305.js.map","// prettier-ignore\nimport { createCipher, rotl } from './_arx.js';\nimport { bytes as abytes } from './_assert.js';\nimport { poly1305 } from './_poly1305.js';\nimport { clean, createView, equalBytes, setBigUint64, wrapCipher, } from './utils.js';\n// ChaCha20 stream cipher was released in 2008. ChaCha aims to increase\n// the diffusion per round, but had slightly less cryptanalysis.\n// https://cr.yp.to/chacha.html, http://cr.yp.to/chacha/chacha-20080128.pdf\n/**\n * ChaCha core function.\n */\n// prettier-ignore\nfunction chachaCore(s, k, n, out, cnt, rounds = 20) {\n let y00 = s[0], y01 = s[1], y02 = s[2], y03 = s[3], // \"expa\" \"nd 3\" \"2-by\" \"te k\"\n y04 = k[0], y05 = k[1], y06 = k[2], y07 = k[3], // Key Key Key Key\n y08 = k[4], y09 = k[5], y10 = k[6], y11 = k[7], // Key Key Key Key\n y12 = cnt, y13 = n[0], y14 = n[1], y15 = n[2]; // Counter Counter\tNonce Nonce\n // Save state to temporary variables\n let x00 = y00, x01 = y01, x02 = y02, x03 = y03, x04 = y04, x05 = y05, x06 = y06, x07 = y07, x08 = y08, x09 = y09, x10 = y10, x11 = y11, x12 = y12, x13 = y13, x14 = y14, x15 = y15;\n for (let r = 0; r < rounds; r += 2) {\n x00 = (x00 + x04) | 0;\n x12 = rotl(x12 ^ x00, 16);\n x08 = (x08 + x12) | 0;\n x04 = rotl(x04 ^ x08, 12);\n x00 = (x00 + x04) | 0;\n x12 = rotl(x12 ^ x00, 8);\n x08 = (x08 + x12) | 0;\n x04 = rotl(x04 ^ x08, 7);\n x01 = (x01 + x05) | 0;\n x13 = rotl(x13 ^ x01, 16);\n x09 = (x09 + x13) | 0;\n x05 = rotl(x05 ^ x09, 12);\n x01 = (x01 + x05) | 0;\n x13 = rotl(x13 ^ x01, 8);\n x09 = (x09 + x13) | 0;\n x05 = rotl(x05 ^ x09, 7);\n x02 = (x02 + x06) | 0;\n x14 = rotl(x14 ^ x02, 16);\n x10 = (x10 + x14) | 0;\n x06 = rotl(x06 ^ x10, 12);\n x02 = (x02 + x06) | 0;\n x14 = rotl(x14 ^ x02, 8);\n x10 = (x10 + x14) | 0;\n x06 = rotl(x06 ^ x10, 7);\n x03 = (x03 + x07) | 0;\n x15 = rotl(x15 ^ x03, 16);\n x11 = (x11 + x15) | 0;\n x07 = rotl(x07 ^ x11, 12);\n x03 = (x03 + x07) | 0;\n x15 = rotl(x15 ^ x03, 8);\n x11 = (x11 + x15) | 0;\n x07 = rotl(x07 ^ x11, 7);\n x00 = (x00 + x05) | 0;\n x15 = rotl(x15 ^ x00, 16);\n x10 = (x10 + x15) | 0;\n x05 = rotl(x05 ^ x10, 12);\n x00 = (x00 + x05) | 0;\n x15 = rotl(x15 ^ x00, 8);\n x10 = (x10 + x15) | 0;\n x05 = rotl(x05 ^ x10, 7);\n x01 = (x01 + x06) | 0;\n x12 = rotl(x12 ^ x01, 16);\n x11 = (x11 + x12) | 0;\n x06 = rotl(x06 ^ x11, 12);\n x01 = (x01 + x06) | 0;\n x12 = rotl(x12 ^ x01, 8);\n x11 = (x11 + x12) | 0;\n x06 = rotl(x06 ^ x11, 7);\n x02 = (x02 + x07) | 0;\n x13 = rotl(x13 ^ x02, 16);\n x08 = (x08 + x13) | 0;\n x07 = rotl(x07 ^ x08, 12);\n x02 = (x02 + x07) | 0;\n x13 = rotl(x13 ^ x02, 8);\n x08 = (x08 + x13) | 0;\n x07 = rotl(x07 ^ x08, 7);\n x03 = (x03 + x04) | 0;\n x14 = rotl(x14 ^ x03, 16);\n x09 = (x09 + x14) | 0;\n x04 = rotl(x04 ^ x09, 12);\n x03 = (x03 + x04) | 0;\n x14 = rotl(x14 ^ x03, 8);\n x09 = (x09 + x14) | 0;\n x04 = rotl(x04 ^ x09, 7);\n }\n // Write output\n let oi = 0;\n out[oi++] = (y00 + x00) | 0;\n out[oi++] = (y01 + x01) | 0;\n out[oi++] = (y02 + x02) | 0;\n out[oi++] = (y03 + x03) | 0;\n out[oi++] = (y04 + x04) | 0;\n out[oi++] = (y05 + x05) | 0;\n out[oi++] = (y06 + x06) | 0;\n out[oi++] = (y07 + x07) | 0;\n out[oi++] = (y08 + x08) | 0;\n out[oi++] = (y09 + x09) | 0;\n out[oi++] = (y10 + x10) | 0;\n out[oi++] = (y11 + x11) | 0;\n out[oi++] = (y12 + x12) | 0;\n out[oi++] = (y13 + x13) | 0;\n out[oi++] = (y14 + x14) | 0;\n out[oi++] = (y15 + x15) | 0;\n}\n/**\n * hchacha helper method, used primarily in xchacha, to hash\n * key and nonce into key' and nonce'.\n * Same as chachaCore, but there doesn't seem to be a way to move the block\n * out without 25% performance hit.\n */\n// prettier-ignore\nexport function hchacha(s, k, i, o32) {\n let x00 = s[0], x01 = s[1], x02 = s[2], x03 = s[3], x04 = k[0], x05 = k[1], x06 = k[2], x07 = k[3], x08 = k[4], x09 = k[5], x10 = k[6], x11 = k[7], x12 = i[0], x13 = i[1], x14 = i[2], x15 = i[3];\n for (let r = 0; r < 20; r += 2) {\n x00 = (x00 + x04) | 0;\n x12 = rotl(x12 ^ x00, 16);\n x08 = (x08 + x12) | 0;\n x04 = rotl(x04 ^ x08, 12);\n x00 = (x00 + x04) | 0;\n x12 = rotl(x12 ^ x00, 8);\n x08 = (x08 + x12) | 0;\n x04 = rotl(x04 ^ x08, 7);\n x01 = (x01 + x05) | 0;\n x13 = rotl(x13 ^ x01, 16);\n x09 = (x09 + x13) | 0;\n x05 = rotl(x05 ^ x09, 12);\n x01 = (x01 + x05) | 0;\n x13 = rotl(x13 ^ x01, 8);\n x09 = (x09 + x13) | 0;\n x05 = rotl(x05 ^ x09, 7);\n x02 = (x02 + x06) | 0;\n x14 = rotl(x14 ^ x02, 16);\n x10 = (x10 + x14) | 0;\n x06 = rotl(x06 ^ x10, 12);\n x02 = (x02 + x06) | 0;\n x14 = rotl(x14 ^ x02, 8);\n x10 = (x10 + x14) | 0;\n x06 = rotl(x06 ^ x10, 7);\n x03 = (x03 + x07) | 0;\n x15 = rotl(x15 ^ x03, 16);\n x11 = (x11 + x15) | 0;\n x07 = rotl(x07 ^ x11, 12);\n x03 = (x03 + x07) | 0;\n x15 = rotl(x15 ^ x03, 8);\n x11 = (x11 + x15) | 0;\n x07 = rotl(x07 ^ x11, 7);\n x00 = (x00 + x05) | 0;\n x15 = rotl(x15 ^ x00, 16);\n x10 = (x10 + x15) | 0;\n x05 = rotl(x05 ^ x10, 12);\n x00 = (x00 + x05) | 0;\n x15 = rotl(x15 ^ x00, 8);\n x10 = (x10 + x15) | 0;\n x05 = rotl(x05 ^ x10, 7);\n x01 = (x01 + x06) | 0;\n x12 = rotl(x12 ^ x01, 16);\n x11 = (x11 + x12) | 0;\n x06 = rotl(x06 ^ x11, 12);\n x01 = (x01 + x06) | 0;\n x12 = rotl(x12 ^ x01, 8);\n x11 = (x11 + x12) | 0;\n x06 = rotl(x06 ^ x11, 7);\n x02 = (x02 + x07) | 0;\n x13 = rotl(x13 ^ x02, 16);\n x08 = (x08 + x13) | 0;\n x07 = rotl(x07 ^ x08, 12);\n x02 = (x02 + x07) | 0;\n x13 = rotl(x13 ^ x02, 8);\n x08 = (x08 + x13) | 0;\n x07 = rotl(x07 ^ x08, 7);\n x03 = (x03 + x04) | 0;\n x14 = rotl(x14 ^ x03, 16);\n x09 = (x09 + x14) | 0;\n x04 = rotl(x04 ^ x09, 12);\n x03 = (x03 + x04) | 0;\n x14 = rotl(x14 ^ x03, 8);\n x09 = (x09 + x14) | 0;\n x04 = rotl(x04 ^ x09, 7);\n }\n let oi = 0;\n o32[oi++] = x00;\n o32[oi++] = x01;\n o32[oi++] = x02;\n o32[oi++] = x03;\n o32[oi++] = x12;\n o32[oi++] = x13;\n o32[oi++] = x14;\n o32[oi++] = x15;\n}\n/**\n * Original, non-RFC chacha20 from DJB. 8-byte nonce, 8-byte counter.\n */\nexport const chacha20orig = /* @__PURE__ */ createCipher(chachaCore, {\n counterRight: false,\n counterLength: 8,\n allowShortKeys: true,\n});\n/**\n * ChaCha stream cipher. Conforms to RFC 8439 (IETF, TLS). 12-byte nonce, 4-byte counter.\n * With 12-byte nonce, it's not safe to use fill it with random (CSPRNG), due to collision chance.\n */\nexport const chacha20 = /* @__PURE__ */ createCipher(chachaCore, {\n counterRight: false,\n counterLength: 4,\n allowShortKeys: false,\n});\n/**\n * XChaCha eXtended-nonce ChaCha. 24-byte nonce.\n * With 24-byte nonce, it's safe to use fill it with random (CSPRNG).\n * https://datatracker.ietf.org/doc/html/draft-irtf-cfrg-xchacha\n */\nexport const xchacha20 = /* @__PURE__ */ createCipher(chachaCore, {\n counterRight: false,\n counterLength: 8,\n extendNonceFn: hchacha,\n allowShortKeys: false,\n});\n/**\n * Reduced 8-round chacha, described in original paper.\n */\nexport const chacha8 = /* @__PURE__ */ createCipher(chachaCore, {\n counterRight: false,\n counterLength: 4,\n rounds: 8,\n});\n/**\n * Reduced 12-round chacha, described in original paper.\n */\nexport const chacha12 = /* @__PURE__ */ createCipher(chachaCore, {\n counterRight: false,\n counterLength: 4,\n rounds: 12,\n});\nconst ZEROS16 = /* @__PURE__ */ new Uint8Array(16);\n// Pad to digest size with zeros\nconst updatePadded = (h, msg) => {\n h.update(msg);\n const left = msg.length % 16;\n if (left)\n h.update(ZEROS16.subarray(left));\n};\nconst ZEROS32 = /* @__PURE__ */ new Uint8Array(32);\nfunction computeTag(fn, key, nonce, data, AAD) {\n const authKey = fn(key, nonce, ZEROS32);\n const h = poly1305.create(authKey);\n if (AAD)\n updatePadded(h, AAD);\n updatePadded(h, data);\n const num = new Uint8Array(16);\n const view = createView(num);\n setBigUint64(view, 0, BigInt(AAD ? AAD.length : 0), true);\n setBigUint64(view, 8, BigInt(data.length), true);\n h.update(num);\n const res = h.digest();\n clean(authKey, num);\n return res;\n}\n/**\n * AEAD algorithm from RFC 8439.\n * Salsa20 and chacha (RFC 8439) use poly1305 differently.\n * We could have composed them similar to:\n * https://github.com/paulmillr/scure-base/blob/b266c73dde977b1dd7ef40ef7a23cc15aab526b3/index.ts#L250\n * But it's hard because of authKey:\n * In salsa20, authKey changes position in salsa stream.\n * In chacha, authKey can't be computed inside computeTag, it modifies the counter.\n */\nexport const _poly1305_aead = (xorStream) => (key, nonce, AAD) => {\n const tagLength = 16;\n abytes(key, 32);\n abytes(nonce);\n return {\n encrypt(plaintext, output) {\n const plength = plaintext.length;\n const clength = plength + tagLength;\n if (output) {\n abytes(output, clength);\n }\n else {\n output = new Uint8Array(clength);\n }\n xorStream(key, nonce, plaintext, output, 1);\n const tag = computeTag(xorStream, key, nonce, output.subarray(0, -tagLength), AAD);\n output.set(tag, plength); // append tag\n clean(tag);\n return output;\n },\n decrypt(ciphertext, output) {\n const clength = ciphertext.length;\n const plength = clength - tagLength;\n if (clength < tagLength)\n throw new Error(`encrypted data must be at least ${tagLength} bytes`);\n if (output) {\n abytes(output, plength);\n }\n else {\n output = new Uint8Array(plength);\n }\n const data = ciphertext.subarray(0, -tagLength);\n const passedTag = ciphertext.subarray(-tagLength);\n const tag = computeTag(xorStream, key, nonce, data, AAD);\n if (!equalBytes(passedTag, tag))\n throw new Error('invalid tag');\n xorStream(key, nonce, data, output, 1);\n clean(tag);\n return output;\n },\n };\n};\n/**\n * ChaCha20-Poly1305 from RFC 8439.\n * With 12-byte nonce, it's not safe to use fill it with random (CSPRNG), due to collision chance.\n */\nexport const chacha20poly1305 = /* @__PURE__ */ wrapCipher({ blockSize: 64, nonceLength: 12, tagLength: 16 }, _poly1305_aead(chacha20));\n/**\n * XChaCha20-Poly1305 extended-nonce chacha.\n * https://datatracker.ietf.org/doc/html/draft-irtf-cfrg-xchacha\n * With 24-byte nonce, it's safe to use fill it with random (CSPRNG).\n */\nexport const xchacha20poly1305 = /* @__PURE__ */ wrapCipher({ blockSize: 64, nonceLength: 24, tagLength: 16 }, _poly1305_aead(xchacha20));\n//# sourceMappingURL=chacha.js.map","import { hash as assertHash, number as assertNumber } from './_assert.js';\nimport { toBytes } from './utils.js';\nimport { hmac } from './hmac.js';\n// HKDF (RFC 5869)\n// https://soatok.blog/2021/11/17/understanding-hkdf/\n/**\n * HKDF-Extract(IKM, salt) -> PRK\n * Arguments position differs from spec (IKM is first one, since it is not optional)\n * @param hash\n * @param ikm\n * @param salt\n * @returns\n */\nexport function extract(hash, ikm, salt) {\n assertHash(hash);\n // NOTE: some libraries treat zero-length array as 'not provided';\n // we don't, since we have undefined as 'not provided'\n // https://github.com/RustCrypto/KDFs/issues/15\n if (salt === undefined)\n salt = new Uint8Array(hash.outputLen); // if not provided, it is set to a string of HashLen zeros\n return hmac(hash, toBytes(salt), toBytes(ikm));\n}\n// HKDF-Expand(PRK, info, L) -> OKM\nconst HKDF_COUNTER = /* @__PURE__ */ new Uint8Array([0]);\nconst EMPTY_BUFFER = /* @__PURE__ */ new Uint8Array();\n/**\n * HKDF-expand from the spec.\n * @param prk - a pseudorandom key of at least HashLen octets (usually, the output from the extract step)\n * @param info - optional context and application specific information (can be a zero-length string)\n * @param length - length of output keying material in octets\n */\nexport function expand(hash, prk, info, length = 32) {\n assertHash(hash);\n assertNumber(length);\n if (length > 255 * hash.outputLen)\n throw new Error('Length should be <= 255*HashLen');\n const blocks = Math.ceil(length / hash.outputLen);\n if (info === undefined)\n info = EMPTY_BUFFER;\n // first L(ength) octets of T\n const okm = new Uint8Array(blocks * hash.outputLen);\n // Re-use HMAC instance between blocks\n const HMAC = hmac.create(hash, prk);\n const HMACTmp = HMAC._cloneInto();\n const T = new Uint8Array(HMAC.outputLen);\n for (let counter = 0; counter < blocks; counter++) {\n HKDF_COUNTER[0] = counter + 1;\n // T(0) = empty string (zero length)\n // T(N) = HMAC-Hash(PRK, T(N-1) | info | N)\n HMACTmp.update(counter === 0 ? EMPTY_BUFFER : T)\n .update(info)\n .update(HKDF_COUNTER)\n .digestInto(T);\n okm.set(T, hash.outputLen * counter);\n HMAC._cloneInto(HMACTmp);\n }\n HMAC.destroy();\n HMACTmp.destroy();\n T.fill(0);\n HKDF_COUNTER.fill(0);\n return okm.slice(0, length);\n}\n/**\n * HKDF (RFC 5869): extract + expand in one step.\n * @param hash - hash function that would be used (e.g. sha256)\n * @param ikm - input keying material, the initial key\n * @param salt - optional salt value (a non-secret random value)\n * @param info - optional context and application specific information\n * @param length - length of output keying material in octets\n */\nexport const hkdf = (hash, ikm, salt, info, length) => expand(hash, extract(hash, ikm, salt), info, length);\n//# sourceMappingURL=hkdf.js.map","import { pureJsCrypto } from './js.js';\nexport const defaultCrypto = pureJsCrypto;\n//# sourceMappingURL=index.browser.js.map","import { chacha20poly1305 } from '@noble/ciphers/chacha';\nimport { x25519 } from '@noble/curves/ed25519';\nimport { extract, expand } from '@noble/hashes/hkdf';\nimport { sha256 } from '@noble/hashes/sha256';\nexport const pureJsCrypto = {\n hashSHA256(data) {\n return sha256(data.subarray());\n },\n getHKDF(ck, ikm) {\n const prk = extract(sha256, ikm, ck);\n const okmU8Array = expand(sha256, prk, undefined, 96);\n const okm = okmU8Array;\n const k1 = okm.subarray(0, 32);\n const k2 = okm.subarray(32, 64);\n const k3 = okm.subarray(64, 96);\n return [k1, k2, k3];\n },\n generateX25519KeyPair() {\n const secretKey = x25519.utils.randomPrivateKey();\n const publicKey = x25519.getPublicKey(secretKey);\n return {\n publicKey,\n privateKey: secretKey\n };\n },\n generateX25519KeyPairFromSeed(seed) {\n const publicKey = x25519.getPublicKey(seed);\n return {\n publicKey,\n privateKey: seed\n };\n },\n generateX25519SharedKey(privateKey, publicKey) {\n return x25519.getSharedSecret(privateKey.subarray(), publicKey.subarray());\n },\n chaCha20Poly1305Encrypt(plaintext, nonce, ad, k) {\n return chacha20poly1305(k, nonce, ad).encrypt(plaintext.subarray());\n },\n chaCha20Poly1305Decrypt(ciphertext, nonce, ad, k, dst) {\n return chacha20poly1305(k, nonce, ad).decrypt(ciphertext.subarray(), dst);\n }\n};\n//# sourceMappingURL=js.js.map","import {} from 'uint8arraylist';\nimport { allocUnsafe as uint8ArrayAllocUnsafe } from 'uint8arrays/alloc';\nexport const uint16BEEncode = (value) => {\n const target = uint8ArrayAllocUnsafe(2);\n target[0] = value >> 8;\n target[1] = value;\n return target;\n};\nuint16BEEncode.bytes = 2;\nexport const uint16BEDecode = (data) => {\n if (data.length < 2)\n throw RangeError('Could not decode int16BE');\n if (data instanceof Uint8Array) {\n let value = 0;\n value += data[0] << 8;\n value += data[1];\n return value;\n }\n return data.getUint16(0);\n};\nuint16BEDecode.bytes = 2;\n//# sourceMappingURL=encoder.js.map","import { toString as uint8ArrayToString } from 'uint8arrays/to-string';\nimport { DUMP_SESSION_KEYS } from './constants.js';\nexport function logLocalStaticKeys(s, keyLogger) {\n if (!keyLogger.enabled || !DUMP_SESSION_KEYS) {\n return;\n }\n if (s) {\n keyLogger(`LOCAL_STATIC_PUBLIC_KEY ${uint8ArrayToString(s.publicKey, 'hex')}`);\n keyLogger(`LOCAL_STATIC_PRIVATE_KEY ${uint8ArrayToString(s.privateKey, 'hex')}`);\n }\n else {\n keyLogger('Missing local static keys.');\n }\n}\nexport function logLocalEphemeralKeys(e, keyLogger) {\n if (!keyLogger.enabled || !DUMP_SESSION_KEYS) {\n return;\n }\n if (e) {\n keyLogger(`LOCAL_PUBLIC_EPHEMERAL_KEY ${uint8ArrayToString(e.publicKey, 'hex')}`);\n keyLogger(`LOCAL_PRIVATE_EPHEMERAL_KEY ${uint8ArrayToString(e.privateKey, 'hex')}`);\n }\n else {\n keyLogger('Missing local ephemeral keys.');\n }\n}\nexport function logRemoteStaticKey(rs, keyLogger) {\n if (!keyLogger.enabled || !DUMP_SESSION_KEYS) {\n return;\n }\n if (rs) {\n keyLogger(`REMOTE_STATIC_PUBLIC_KEY ${uint8ArrayToString(rs.subarray(), 'hex')}`);\n }\n else {\n keyLogger('Missing remote static public key.');\n }\n}\nexport function logRemoteEphemeralKey(re, keyLogger) {\n if (!keyLogger.enabled || !DUMP_SESSION_KEYS) {\n return;\n }\n if (re) {\n keyLogger(`REMOTE_EPHEMERAL_PUBLIC_KEY ${uint8ArrayToString(re.subarray(), 'hex')}`);\n }\n else {\n keyLogger('Missing remote ephemeral keys.');\n }\n}\nexport function logCipherState(cs1, cs2, keyLogger) {\n if (!keyLogger.enabled || !DUMP_SESSION_KEYS) {\n return;\n }\n keyLogger(`CIPHER_STATE_1 ${cs1.n.getUint64()} ${cs1.k && uint8ArrayToString(cs1.k, 'hex')}`);\n keyLogger(`CIPHER_STATE_2 ${cs2.n.getUint64()} ${cs2.k && uint8ArrayToString(cs2.k, 'hex')}`);\n}\n//# sourceMappingURL=logger.js.map","export class UnexpectedPeerError extends Error {\n code;\n constructor(message = 'Unexpected Peer') {\n super(message);\n this.code = UnexpectedPeerError.code;\n }\n static code = 'ERR_UNEXPECTED_PEER';\n}\nexport class InvalidCryptoExchangeError extends Error {\n code;\n constructor(message = 'Invalid crypto exchange') {\n super(message);\n this.code = InvalidCryptoExchangeError.code;\n }\n static code = 'ERR_INVALID_CRYPTO_EXCHANGE';\n}\n//# sourceMappingURL=errors.js.map","import { alloc as uint8ArrayAlloc } from 'uint8arrays/alloc';\nexport const MIN_NONCE = 0;\n// For performance reasons, the nonce is represented as a JS `number`\n// Although JS `number` can safely represent integers up to 2 ** 53 - 1, we choose to only use\n// 4 bytes to store the data for performance reason.\n// This is a slight deviation from the noise spec, which describes the max nonce as 2 ** 64 - 2\n// The effect is that this implementation will need a new handshake to be performed after fewer messages are exchanged than other implementations with full uint64 nonces.\n// this MAX_NONCE is still a large number of messages, so the practical effect of this is negligible.\nexport const MAX_NONCE = 0xffffffff;\nconst ERR_MAX_NONCE = 'Cipherstate has reached maximum n, a new handshake must be performed';\n/**\n * The nonce is an uint that's increased over time.\n * Maintaining different representations help improve performance.\n */\nexport class Nonce {\n n;\n bytes;\n view;\n constructor(n = MIN_NONCE) {\n this.n = n;\n this.bytes = uint8ArrayAlloc(12);\n this.view = new DataView(this.bytes.buffer, this.bytes.byteOffset, this.bytes.byteLength);\n this.view.setUint32(4, n, true);\n }\n increment() {\n this.n++;\n // Even though we're treating the nonce as 8 bytes, RFC7539 specifies 12 bytes for a nonce.\n this.view.setUint32(4, this.n, true);\n }\n getBytes() {\n return this.bytes;\n }\n getUint64() {\n return this.n;\n }\n assertValue() {\n if (this.n > MAX_NONCE) {\n throw new Error(ERR_MAX_NONCE);\n }\n }\n}\n//# sourceMappingURL=nonce.js.map","import { Uint8ArrayList } from 'uint8arraylist';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays';\nimport { alloc as uint8ArrayAlloc } from 'uint8arrays/alloc';\nimport { InvalidCryptoExchangeError } from './errors.js';\nimport { Nonce } from './nonce.js';\n// Code in this file is a direct translation of a subset of the noise protocol https://noiseprotocol.org/noise.html,\n// agnostic to libp2p's usage of noise\nexport const ZEROLEN = uint8ArrayAlloc(0);\nexport class CipherState {\n k;\n n;\n crypto;\n constructor(crypto, k = undefined, n = 0) {\n this.crypto = crypto;\n this.k = k;\n this.n = new Nonce(n);\n }\n hasKey() {\n return Boolean(this.k);\n }\n encryptWithAd(ad, plaintext) {\n if (!this.hasKey()) {\n return plaintext;\n }\n this.n.assertValue();\n const e = this.crypto.encrypt(plaintext, this.n.getBytes(), ad, this.k);\n this.n.increment();\n return e;\n }\n decryptWithAd(ad, ciphertext, dst) {\n if (!this.hasKey()) {\n return ciphertext;\n }\n this.n.assertValue();\n const plaintext = this.crypto.decrypt(ciphertext, this.n.getBytes(), ad, this.k, dst);\n this.n.increment();\n return plaintext;\n }\n}\nexport class SymmetricState {\n cs;\n ck;\n h;\n crypto;\n constructor(crypto, protocolName) {\n this.crypto = crypto;\n const protocolNameBytes = uint8ArrayFromString(protocolName, 'utf-8');\n this.h = hashProtocolName(crypto, protocolNameBytes);\n this.ck = this.h;\n this.cs = new CipherState(crypto);\n }\n mixKey(ikm) {\n const [ck, tempK] = this.crypto.hkdf(this.ck, ikm);\n this.ck = ck;\n this.cs = new CipherState(this.crypto, tempK);\n }\n mixHash(data) {\n this.h = this.crypto.hash(new Uint8ArrayList(this.h, data));\n }\n encryptAndHash(plaintext) {\n const ciphertext = this.cs.encryptWithAd(this.h, plaintext);\n this.mixHash(ciphertext);\n return ciphertext;\n }\n decryptAndHash(ciphertext) {\n const plaintext = this.cs.decryptWithAd(this.h, ciphertext);\n this.mixHash(ciphertext);\n return plaintext;\n }\n split() {\n const [tempK1, tempK2] = this.crypto.hkdf(this.ck, ZEROLEN);\n return [new CipherState(this.crypto, tempK1), new CipherState(this.crypto, tempK2)];\n }\n}\nexport class AbstractHandshakeState {\n ss;\n s;\n e;\n rs;\n re;\n initiator;\n crypto;\n constructor(init) {\n const { crypto, protocolName, prologue, initiator, s, e, rs, re } = init;\n this.crypto = crypto;\n this.ss = new SymmetricState(crypto, protocolName);\n this.ss.mixHash(prologue);\n this.initiator = initiator;\n this.s = s;\n this.e = e;\n this.rs = rs;\n this.re = re;\n }\n writeE() {\n if (this.e) {\n throw new Error('ephemeral keypair is already set');\n }\n const e = this.crypto.generateKeypair();\n this.ss.mixHash(e.publicKey);\n this.e = e;\n return e.publicKey;\n }\n writeS() {\n if (!this.s) {\n throw new Error('static keypair is not set');\n }\n return this.ss.encryptAndHash(this.s.publicKey);\n }\n writeEE() {\n if (!this.e) {\n throw new Error('ephemeral keypair is not set');\n }\n if (!this.re) {\n throw new Error('remote ephemeral public key is not set');\n }\n this.ss.mixKey(this.crypto.dh(this.e, this.re));\n }\n writeES() {\n if (this.initiator) {\n if (!this.e) {\n throw new Error('ephemeral keypair is not set');\n }\n if (!this.rs) {\n throw new Error('remote static public key is not set');\n }\n this.ss.mixKey(this.crypto.dh(this.e, this.rs));\n }\n else {\n if (!this.s) {\n throw new Error('static keypair is not set');\n }\n if (!this.re) {\n throw new Error('remote ephemeral public key is not set');\n }\n this.ss.mixKey(this.crypto.dh(this.s, this.re));\n }\n }\n writeSE() {\n if (this.initiator) {\n if (!this.s) {\n throw new Error('static keypair is not set');\n }\n if (!this.re) {\n throw new Error('remote ephemeral public key is not set');\n }\n this.ss.mixKey(this.crypto.dh(this.s, this.re));\n }\n else {\n if (!this.e) {\n throw new Error('ephemeral keypair is not set');\n }\n if (!this.rs) {\n throw new Error('remote static public key is not set');\n }\n this.ss.mixKey(this.crypto.dh(this.e, this.rs));\n }\n }\n readE(message, offset = 0) {\n if (this.re) {\n throw new Error('remote ephemeral public key is already set');\n }\n if (message.byteLength < offset + 32) {\n throw new Error('message is not long enough');\n }\n this.re = message.sublist(offset, offset + 32);\n this.ss.mixHash(this.re);\n }\n readS(message, offset = 0) {\n if (this.rs) {\n throw new Error('remote static public key is already set');\n }\n const cipherLength = 32 + (this.ss.cs.hasKey() ? 16 : 0);\n if (message.byteLength < offset + cipherLength) {\n throw new Error('message is not long enough');\n }\n const temp = message.sublist(offset, offset + cipherLength);\n this.rs = this.ss.decryptAndHash(temp);\n return cipherLength;\n }\n readEE() {\n this.writeEE();\n }\n readES() {\n this.writeES();\n }\n readSE() {\n this.writeSE();\n }\n}\n/**\n * A IHandshakeState that's optimized for the XX pattern\n */\nexport class XXHandshakeState extends AbstractHandshakeState {\n // e\n writeMessageA(payload) {\n return new Uint8ArrayList(this.writeE(), this.ss.encryptAndHash(payload));\n }\n // e, ee, s, es\n writeMessageB(payload) {\n const e = this.writeE();\n this.writeEE();\n const encS = this.writeS();\n this.writeES();\n return new Uint8ArrayList(e, encS, this.ss.encryptAndHash(payload));\n }\n // s, se\n writeMessageC(payload) {\n const encS = this.writeS();\n this.writeSE();\n return new Uint8ArrayList(encS, this.ss.encryptAndHash(payload));\n }\n // e\n readMessageA(message) {\n try {\n this.readE(message);\n return this.ss.decryptAndHash(message.sublist(32));\n }\n catch (e) {\n throw new InvalidCryptoExchangeError(`handshake stage 0 validation fail: ${e.message}`);\n }\n }\n // e, ee, s, es\n readMessageB(message) {\n try {\n this.readE(message);\n this.readEE();\n const consumed = this.readS(message, 32);\n this.readES();\n return this.ss.decryptAndHash(message.sublist(32 + consumed));\n }\n catch (e) {\n throw new InvalidCryptoExchangeError(`handshake stage 1 validation fail: ${e.message}`);\n }\n }\n // s, se\n readMessageC(message) {\n try {\n const consumed = this.readS(message);\n this.readSE();\n return this.ss.decryptAndHash(message.sublist(consumed));\n }\n catch (e) {\n throw new InvalidCryptoExchangeError(`handshake stage 2 validation fail: ${e.message}`);\n }\n }\n}\nfunction hashProtocolName(crypto, protocolName) {\n if (protocolName.length <= 32) {\n const h = uint8ArrayAlloc(32);\n h.set(protocolName);\n return h;\n }\n else {\n return crypto.hash(protocolName);\n }\n}\n//# sourceMappingURL=protocol.js.map","/* eslint-disable import/export */\n/* eslint-disable complexity */\n/* eslint-disable @typescript-eslint/no-namespace */\n/* eslint-disable @typescript-eslint/no-unnecessary-boolean-literal-compare */\n/* eslint-disable @typescript-eslint/no-empty-interface */\nimport { decodeMessage, encodeMessage, message } from 'protons-runtime';\nimport { alloc as uint8ArrayAlloc } from 'uint8arrays/alloc';\nexport var NoiseExtensions;\n(function (NoiseExtensions) {\n let _codec;\n NoiseExtensions.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if (obj.webtransportCerthashes != null) {\n for (const value of obj.webtransportCerthashes) {\n w.uint32(10);\n w.bytes(value);\n }\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length) => {\n const obj = {\n webtransportCerthashes: []\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.webtransportCerthashes.push(reader.bytes());\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n NoiseExtensions.encode = (obj) => {\n return encodeMessage(obj, NoiseExtensions.codec());\n };\n NoiseExtensions.decode = (buf) => {\n return decodeMessage(buf, NoiseExtensions.codec());\n };\n})(NoiseExtensions || (NoiseExtensions = {}));\nexport var NoiseHandshakePayload;\n(function (NoiseHandshakePayload) {\n let _codec;\n NoiseHandshakePayload.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.identityKey != null && obj.identityKey.byteLength > 0)) {\n w.uint32(10);\n w.bytes(obj.identityKey);\n }\n if ((obj.identitySig != null && obj.identitySig.byteLength > 0)) {\n w.uint32(18);\n w.bytes(obj.identitySig);\n }\n if (obj.extensions != null) {\n w.uint32(34);\n NoiseExtensions.codec().encode(obj.extensions, w);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length) => {\n const obj = {\n identityKey: uint8ArrayAlloc(0),\n identitySig: uint8ArrayAlloc(0)\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1: {\n obj.identityKey = reader.bytes();\n break;\n }\n case 2: {\n obj.identitySig = reader.bytes();\n break;\n }\n case 4: {\n obj.extensions = NoiseExtensions.codec().decode(reader, reader.uint32());\n break;\n }\n default: {\n reader.skipType(tag & 7);\n break;\n }\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n NoiseHandshakePayload.encode = (obj) => {\n return encodeMessage(obj, NoiseHandshakePayload.codec());\n };\n NoiseHandshakePayload.decode = (buf) => {\n return decodeMessage(buf, NoiseHandshakePayload.codec());\n };\n})(NoiseHandshakePayload || (NoiseHandshakePayload = {}));\n//# sourceMappingURL=payload.js.map","import { unmarshalPublicKey } from '@libp2p/crypto/keys';\nimport {} from 'uint8arraylist';\nimport { equals, toString } from 'uint8arrays';\nimport { concat as uint8ArrayConcat } from 'uint8arrays/concat';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport { UnexpectedPeerError } from './errors.js';\nimport { NoiseHandshakePayload } from './proto/payload.js';\nexport async function createHandshakePayload(privateKey, staticPublicKey, extensions) {\n const identitySig = await privateKey.sign(getSignaturePayload(staticPublicKey));\n return NoiseHandshakePayload.encode({\n identityKey: privateKey.public.bytes,\n identitySig,\n extensions\n });\n}\nexport async function decodeHandshakePayload(payloadBytes, remoteStaticKey, remoteIdentityKey) {\n try {\n const payload = NoiseHandshakePayload.decode(payloadBytes);\n if (remoteIdentityKey) {\n const remoteIdentityKeyBytes = remoteIdentityKey.subarray();\n if (!equals(remoteIdentityKeyBytes, payload.identityKey)) {\n throw new Error(`Payload identity key ${toString(payload.identityKey, 'hex')} does not match expected remote identity key ${toString(remoteIdentityKeyBytes, 'hex')}`);\n }\n }\n if (!remoteStaticKey) {\n throw new Error('Remote static does not exist');\n }\n const signaturePayload = getSignaturePayload(remoteStaticKey);\n const publicKey = unmarshalPublicKey(payload.identityKey);\n if (!(await publicKey.verify(signaturePayload, payload.identitySig))) {\n throw new Error('Invalid payload signature');\n }\n return payload;\n }\n catch (e) {\n throw new UnexpectedPeerError(e.message);\n }\n}\nexport function getSignaturePayload(publicKey) {\n const prefix = uint8ArrayFromString('noise-libp2p-static-key:');\n if (publicKey instanceof Uint8Array) {\n return uint8ArrayConcat([prefix, publicKey], prefix.length + publicKey.length);\n }\n publicKey.prepend(prefix);\n return publicKey;\n}\n//# sourceMappingURL=utils.js.map","import { unmarshalPrivateKey } from '@libp2p/crypto/keys';\nimport { CodeError, serviceCapabilities, isPeerId } from '@libp2p/interface';\nimport { peerIdFromKeys } from '@libp2p/peer-id';\nimport { decode } from 'it-length-prefixed';\nimport { lpStream } from 'it-length-prefixed-stream';\nimport { duplexPair } from 'it-pair/duplex';\nimport { pipe } from 'it-pipe';\nimport { alloc as uint8ArrayAlloc } from 'uint8arrays/alloc';\nimport { NOISE_MSG_MAX_LENGTH_BYTES } from './constants.js';\nimport { defaultCrypto } from './crypto/index.js';\nimport { wrapCrypto } from './crypto.js';\nimport { uint16BEDecode, uint16BEEncode } from './encoder.js';\nimport { registerMetrics } from './metrics.js';\nimport { performHandshakeInitiator, performHandshakeResponder } from './performHandshake.js';\nimport { decryptStream, encryptStream } from './streaming.js';\nexport class Noise {\n protocol = '/noise';\n crypto;\n prologue;\n staticKey;\n extensions;\n metrics;\n components;\n constructor(components, init = {}) {\n const { staticNoiseKey, extensions, crypto, prologueBytes } = init;\n const { metrics } = components;\n this.components = components;\n const _crypto = crypto ?? defaultCrypto;\n this.crypto = wrapCrypto(_crypto);\n this.extensions = extensions;\n this.metrics = metrics ? registerMetrics(metrics) : undefined;\n if (staticNoiseKey) {\n // accepts x25519 private key of length 32\n this.staticKey = _crypto.generateX25519KeyPairFromSeed(staticNoiseKey);\n }\n else {\n this.staticKey = _crypto.generateX25519KeyPair();\n }\n this.prologue = prologueBytes ?? uint8ArrayAlloc(0);\n }\n [Symbol.toStringTag] = '@chainsafe/libp2p-noise';\n [serviceCapabilities] = [\n '@libp2p/connection-encryption',\n '@chainsafe/libp2p-noise'\n ];\n async secureOutbound(...args) {\n const { localPeer, connection, remotePeer } = this.parseArgs(args);\n const wrappedConnection = lpStream(connection, {\n lengthEncoder: uint16BEEncode,\n lengthDecoder: uint16BEDecode,\n maxDataLength: NOISE_MSG_MAX_LENGTH_BYTES\n });\n if (!localPeer.privateKey) {\n throw new CodeError('local peerId does not contain private key', 'ERR_NO_PRIVATE_KEY');\n }\n const privateKey = await unmarshalPrivateKey(localPeer.privateKey);\n const remoteIdentityKey = remotePeer?.publicKey;\n const handshake = await this.performHandshakeInitiator(wrappedConnection, privateKey, remoteIdentityKey);\n const conn = await this.createSecureConnection(wrappedConnection, handshake);\n connection.source = conn.source;\n connection.sink = conn.sink;\n return {\n conn: connection,\n remoteExtensions: handshake.payload.extensions,\n remotePeer: await peerIdFromKeys(handshake.payload.identityKey)\n };\n }\n async secureInbound(...args) {\n const { localPeer, connection, remotePeer } = this.parseArgs(args);\n const wrappedConnection = lpStream(connection, {\n lengthEncoder: uint16BEEncode,\n lengthDecoder: uint16BEDecode,\n maxDataLength: NOISE_MSG_MAX_LENGTH_BYTES\n });\n if (!localPeer.privateKey) {\n throw new CodeError('local peerId does not contain private key', 'ERR_NO_PRIVATE_KEY');\n }\n const privateKey = await unmarshalPrivateKey(localPeer.privateKey);\n const remoteIdentityKey = remotePeer?.publicKey;\n const handshake = await this.performHandshakeResponder(wrappedConnection, privateKey, remoteIdentityKey);\n const conn = await this.createSecureConnection(wrappedConnection, handshake);\n connection.source = conn.source;\n connection.sink = conn.sink;\n return {\n conn: connection,\n remoteExtensions: handshake.payload.extensions,\n remotePeer: await peerIdFromKeys(handshake.payload.identityKey)\n };\n }\n /**\n * Perform XX handshake as initiator.\n */\n async performHandshakeInitiator(connection, \n // TODO: pass private key in noise constructor via Components\n privateKey, remoteIdentityKey) {\n let result;\n try {\n result = await performHandshakeInitiator({\n connection,\n privateKey,\n remoteIdentityKey,\n log: this.components.logger.forComponent('libp2p:noise:xxhandshake'),\n crypto: this.crypto,\n prologue: this.prologue,\n s: this.staticKey,\n extensions: this.extensions\n });\n this.metrics?.xxHandshakeSuccesses.increment();\n }\n catch (e) {\n this.metrics?.xxHandshakeErrors.increment();\n throw e;\n }\n return result;\n }\n /**\n * Perform XX handshake as responder.\n */\n async performHandshakeResponder(connection, \n // TODO: pass private key in noise constructor via Components\n privateKey, remoteIdentityKey) {\n let result;\n try {\n result = await performHandshakeResponder({\n connection,\n privateKey,\n remoteIdentityKey,\n log: this.components.logger.forComponent('libp2p:noise:xxhandshake'),\n crypto: this.crypto,\n prologue: this.prologue,\n s: this.staticKey,\n extensions: this.extensions\n });\n this.metrics?.xxHandshakeSuccesses.increment();\n }\n catch (e) {\n this.metrics?.xxHandshakeErrors.increment();\n throw e;\n }\n return result;\n }\n async createSecureConnection(connection, handshake) {\n // Create encryption box/unbox wrapper\n const [secure, user] = duplexPair();\n const network = connection.unwrap();\n await pipe(secure, // write to wrapper\n encryptStream(handshake, this.metrics), // encrypt data + prefix with message length\n network, // send to the remote peer\n (source) => decode(source, { lengthDecoder: uint16BEDecode }), // read message length prefix\n decryptStream(handshake, this.metrics), // decrypt the incoming data\n secure // pipe to the wrapper\n );\n return user;\n }\n /**\n * Detect call signature in `libp2p@1.x.x` or `libp2p@2.x.x` style.\n *\n * TODO: remove this after `libp2p@2.x.x` is released and only support the\n * newer style\n */\n parseArgs(args) {\n // if the first argument is a peer id, we're using the libp2p@1.x.x style\n if (isPeerId(args[0])) {\n return {\n localPeer: args[0],\n connection: args[1],\n remotePeer: args[2]\n };\n }\n else {\n // handle upcoming changes in libp2p@2.x.x where the first argument is the\n // connection and the second is optionally the remote peer\n // @see https://github.com/libp2p/js-libp2p/pull/2304\n return {\n localPeer: this.components.peerId,\n connection: args[0],\n remotePeer: args[1]\n };\n }\n }\n}\n//# sourceMappingURL=noise.js.map","export function wrapCrypto(crypto) {\n return {\n generateKeypair: crypto.generateX25519KeyPair,\n dh: (keypair, publicKey) => crypto.generateX25519SharedKey(keypair.privateKey, publicKey).subarray(0, 32),\n encrypt: crypto.chaCha20Poly1305Encrypt,\n decrypt: crypto.chaCha20Poly1305Decrypt,\n hash: crypto.hashSHA256,\n hkdf: crypto.getHKDF\n };\n}\n//# sourceMappingURL=crypto.js.map","export function registerMetrics(metrics) {\n return {\n xxHandshakeSuccesses: metrics.registerCounter('libp2p_noise_xxhandshake_successes_total', {\n help: 'Total count of noise xxHandshakes successes_'\n }),\n xxHandshakeErrors: metrics.registerCounter('libp2p_noise_xxhandshake_error_total', {\n help: 'Total count of noise xxHandshakes errors'\n }),\n encryptedPackets: metrics.registerCounter('libp2p_noise_encrypted_packets_total', {\n help: 'Total count of noise encrypted packets successfully'\n }),\n decryptedPackets: metrics.registerCounter('libp2p_noise_decrypted_packets_total', {\n help: 'Total count of noise decrypted packets'\n }),\n decryptErrors: metrics.registerCounter('libp2p_noise_decrypt_errors_total', {\n help: 'Total count of noise decrypt errors'\n })\n };\n}\n//# sourceMappingURL=metrics.js.map","import { logLocalStaticKeys, logLocalEphemeralKeys, logRemoteEphemeralKey, logRemoteStaticKey, logCipherState } from './logger.js';\nimport { ZEROLEN, XXHandshakeState } from './protocol.js';\nimport { createHandshakePayload, decodeHandshakePayload } from './utils.js';\nexport async function performHandshakeInitiator(init) {\n const { log, connection, crypto, privateKey, prologue, s, remoteIdentityKey, extensions } = init;\n const payload = await createHandshakePayload(privateKey, s.publicKey, extensions);\n const xx = new XXHandshakeState({\n crypto,\n protocolName: 'Noise_XX_25519_ChaChaPoly_SHA256',\n initiator: true,\n prologue,\n s\n });\n logLocalStaticKeys(xx.s, log);\n log.trace('Stage 0 - Initiator starting to send first message.');\n await connection.write(xx.writeMessageA(ZEROLEN));\n log.trace('Stage 0 - Initiator finished sending first message.');\n logLocalEphemeralKeys(xx.e, log);\n log.trace('Stage 1 - Initiator waiting to receive first message from responder...');\n const plaintext = xx.readMessageB(await connection.read());\n log.trace('Stage 1 - Initiator received the message.');\n logRemoteEphemeralKey(xx.re, log);\n logRemoteStaticKey(xx.rs, log);\n log.trace(\"Initiator going to check remote's signature...\");\n const receivedPayload = await decodeHandshakePayload(plaintext, xx.rs, remoteIdentityKey);\n log.trace('All good with the signature!');\n log.trace('Stage 2 - Initiator sending third handshake message.');\n await connection.write(xx.writeMessageC(payload));\n log.trace('Stage 2 - Initiator sent message with signed payload.');\n const [cs1, cs2] = xx.ss.split();\n logCipherState(cs1, cs2, log);\n return {\n payload: receivedPayload,\n encrypt: (plaintext) => cs1.encryptWithAd(ZEROLEN, plaintext),\n decrypt: (ciphertext, dst) => cs2.decryptWithAd(ZEROLEN, ciphertext, dst)\n };\n}\nexport async function performHandshakeResponder(init) {\n const { log, connection, crypto, privateKey, prologue, s, remoteIdentityKey, extensions } = init;\n const payload = await createHandshakePayload(privateKey, s.publicKey, extensions);\n const xx = new XXHandshakeState({\n crypto,\n protocolName: 'Noise_XX_25519_ChaChaPoly_SHA256',\n initiator: false,\n prologue,\n s\n });\n logLocalStaticKeys(xx.s, log);\n log.trace('Stage 0 - Responder waiting to receive first message.');\n xx.readMessageA(await connection.read());\n log.trace('Stage 0 - Responder received first message.');\n logRemoteEphemeralKey(xx.re, log);\n log.trace('Stage 1 - Responder sending out first message with signed payload and static key.');\n await connection.write(xx.writeMessageB(payload));\n log.trace('Stage 1 - Responder sent the second handshake message with signed payload.');\n logLocalEphemeralKeys(xx.e, log);\n log.trace('Stage 2 - Responder waiting for third handshake message...');\n const plaintext = xx.readMessageC(await connection.read());\n log.trace('Stage 2 - Responder received the message, finished handshake.');\n const receivedPayload = await decodeHandshakePayload(plaintext, xx.rs, remoteIdentityKey);\n const [cs1, cs2] = xx.ss.split();\n logCipherState(cs1, cs2, log);\n return {\n payload: receivedPayload,\n encrypt: (plaintext) => cs2.encryptWithAd(ZEROLEN, plaintext),\n decrypt: (ciphertext, dst) => cs1.decryptWithAd(ZEROLEN, ciphertext, dst)\n };\n}\n//# sourceMappingURL=performHandshake.js.map","import { pair } from './index.js';\n/**\n * Two duplex streams that are attached to each other\n */\nexport function duplexPair() {\n const a = pair();\n const b = pair();\n return [\n {\n source: a.source,\n sink: b.sink\n },\n {\n source: b.source,\n sink: a.sink\n }\n ];\n}\n//# sourceMappingURL=duplex.js.map","import { Uint8ArrayList } from 'uint8arraylist';\nimport { NOISE_MSG_MAX_LENGTH_BYTES, NOISE_MSG_MAX_LENGTH_BYTES_WITHOUT_TAG } from './constants.js';\nimport { uint16BEEncode } from './encoder.js';\nconst CHACHA_TAG_LENGTH = 16;\n// Returns generator that encrypts payload from the user\nexport function encryptStream(handshake, metrics) {\n return async function* (source) {\n for await (const chunk of source) {\n for (let i = 0; i < chunk.length; i += NOISE_MSG_MAX_LENGTH_BYTES_WITHOUT_TAG) {\n let end = i + NOISE_MSG_MAX_LENGTH_BYTES_WITHOUT_TAG;\n if (end > chunk.length) {\n end = chunk.length;\n }\n let data;\n if (chunk instanceof Uint8Array) {\n data = handshake.encrypt(chunk.subarray(i, end));\n }\n else {\n data = handshake.encrypt(chunk.sublist(i, end));\n }\n metrics?.encryptedPackets.increment();\n yield new Uint8ArrayList(uint16BEEncode(data.byteLength), data);\n }\n }\n };\n}\n// Decrypt received payload to the user\nexport function decryptStream(handshake, metrics) {\n return async function* (source) {\n for await (const chunk of source) {\n for (let i = 0; i < chunk.length; i += NOISE_MSG_MAX_LENGTH_BYTES) {\n let end = i + NOISE_MSG_MAX_LENGTH_BYTES;\n if (end > chunk.length) {\n end = chunk.length;\n }\n if (end - CHACHA_TAG_LENGTH < i) {\n throw new Error('Invalid chunk');\n }\n const encrypted = chunk.sublist(i, end);\n // memory allocation is not cheap so reuse the encrypted Uint8Array\n // see https://github.com/ChainSafe/js-libp2p-noise/pull/242#issue-1422126164\n // this is ok because chacha20 reads bytes one by one and don't reread after that\n // it's also tested in https://github.com/ChainSafe/as-chacha20poly1305/pull/1/files#diff-25252846b58979dcaf4e41d47b3eadd7e4f335e7fb98da6c049b1f9cd011f381R48\n const dst = chunk.subarray(i, end - CHACHA_TAG_LENGTH);\n try {\n const plaintext = handshake.decrypt(encrypted, dst);\n metrics?.decryptedPackets.increment();\n yield plaintext;\n }\n catch (e) {\n metrics?.decryptErrors.increment();\n throw e;\n }\n }\n }\n };\n}\n//# sourceMappingURL=streaming.js.map","import { Noise } from './noise.js';\nexport { pureJsCrypto } from './crypto/js.js';\nexport function noise(init = {}) {\n return (components) => new Noise(components, init);\n}\n//# sourceMappingURL=index.js.map","/**\n * Any object that implements this Symbol as a property should return a\n * PeerDiscovery instance as the property value, similar to how\n * `Symbol.Iterable` can be used to return an `Iterable` from an `Iterator`.\n *\n * @example\n *\n * ```TypeScript\n * import { peerDiscovery, PeerDiscovery } from '@libp2p/peer-discovery'\n *\n * class MyPeerDiscoverer implements PeerDiscovery {\n * get [peerDiscovery] () {\n * return this\n * }\n *\n * // ...other methods\n * }\n * ```\n */\nexport const peerDiscoverySymbol = Symbol.for('@libp2p/peer-discovery');\n//# sourceMappingURL=index.js.map","import { multiaddr } from '@multiformats/multiaddr';\n/*\n * Valid combinations\n */\nexport const DNS4 = base('dns4');\nexport const DNS6 = base('dns6');\nexport const DNSADDR = base('dnsaddr');\nexport const DNS = or(base('dns'), DNSADDR, DNS4, DNS6);\nexport const IP = or(base('ip4'), base('ip6'));\nexport const TCP = or(and(IP, base('tcp')), and(DNS, base('tcp')));\nexport const UDP = and(IP, base('udp'));\nexport const UTP = and(UDP, base('utp'));\nexport const QUIC = and(UDP, base('quic'));\nexport const QUICV1 = and(UDP, base('quic-v1'));\nconst _WebSockets = or(and(TCP, base('ws')), and(DNS, base('ws')));\nexport const WebSockets = or(and(_WebSockets, base('p2p')), _WebSockets);\nconst _WebSocketsSecure = or(and(TCP, base('wss')), and(DNS, base('wss')), and(TCP, base('tls'), base('ws')), and(DNS, base('tls'), base('ws')));\nexport const WebSocketsSecure = or(and(_WebSocketsSecure, base('p2p')), _WebSocketsSecure);\nexport const HTTP = or(and(TCP, base('http')), and(IP, base('http')), and(DNS, base('http')));\nexport const HTTPS = or(and(TCP, base('https')), and(IP, base('https')), and(DNS, base('https')));\nconst _WebRTCDirect = and(UDP, base('webrtc-direct'), base('certhash'));\nexport const WebRTCDirect = or(and(_WebRTCDirect, base('p2p')), _WebRTCDirect);\nconst _WebTransport = and(QUICV1, base('webtransport'), base('certhash'), base('certhash'));\nexport const WebTransport = or(and(_WebTransport, base('p2p')), _WebTransport);\n/**\n * @deprecated\n */\nexport const P2PWebRTCStar = or(and(WebSockets, base('p2p-webrtc-star'), base('p2p')), and(WebSocketsSecure, base('p2p-webrtc-star'), base('p2p')), and(WebSockets, base('p2p-webrtc-star')), and(WebSocketsSecure, base('p2p-webrtc-star')));\nexport const WebSocketStar = or(and(WebSockets, base('p2p-websocket-star'), base('p2p')), and(WebSocketsSecure, base('p2p-websocket-star'), base('p2p')), and(WebSockets, base('p2p-websocket-star')), and(WebSocketsSecure, base('p2p-websocket-star')));\n/**\n * @deprecated\n */\nexport const P2PWebRTCDirect = or(and(HTTP, base('p2p-webrtc-direct'), base('p2p')), and(HTTPS, base('p2p-webrtc-direct'), base('p2p')), and(HTTP, base('p2p-webrtc-direct')), and(HTTPS, base('p2p-webrtc-direct')));\nexport const Reliable = or(_WebSockets, _WebSocketsSecure, HTTP, HTTPS, P2PWebRTCStar, P2PWebRTCDirect, TCP, UTP, QUIC, DNS, WebRTCDirect, WebTransport);\n// Unlike ws-star, stardust can run over any transport thus removing the requirement for websockets (but don't even think about running a stardust server over webrtc-star ;) )\nexport const Stardust = or(and(Reliable, base('p2p-stardust'), base('p2p')), and(Reliable, base('p2p-stardust')));\nconst _P2P = or(and(Reliable, base('p2p')), P2PWebRTCStar, P2PWebRTCDirect, WebRTCDirect, WebTransport, base('p2p'));\nconst _Circuit = or(and(_P2P, base('p2p-circuit'), _P2P), and(_P2P, base('p2p-circuit')), and(base('p2p-circuit'), _P2P), and(Reliable, base('p2p-circuit')), and(base('p2p-circuit'), Reliable), base('p2p-circuit'));\nconst CircuitRecursive = () => or(and(_Circuit, CircuitRecursive), _Circuit);\nexport const Circuit = CircuitRecursive();\nexport const P2P = or(and(Circuit, _P2P, Circuit), and(_P2P, Circuit), and(Circuit, _P2P), Circuit, _P2P);\nexport const IPFS = P2P;\nexport const WebRTC = or(and(Circuit, base('webrtc'), base('p2p')), and(Circuit, base('webrtc')), and(Reliable, base('webrtc'), base('p2p')), and(Reliable, base('webrtc')), base('webrtc'));\n/*\n * Validation funcs\n */\nfunction makeMatchesFunction(partialMatch) {\n function matches(a) {\n let ma;\n try {\n ma = multiaddr(a);\n }\n catch (err) { // catch error\n return false; // also if it's invalid it's probably not matching as well so return false\n }\n const out = partialMatch(ma.protoNames());\n if (out === null) {\n return false;\n }\n if (out === true || out === false) {\n return out;\n }\n return out.length === 0;\n }\n return matches;\n}\nfunction and(...args) {\n function partialMatch(a) {\n if (a.length < args.length) {\n return null;\n }\n let out = a;\n args.some((arg) => {\n out = typeof arg === 'function'\n ? arg().partialMatch(a)\n : arg.partialMatch(a);\n if (Array.isArray(out)) {\n a = out;\n }\n if (out === null) {\n return true;\n }\n return false;\n });\n return out;\n }\n return {\n toString: function () { return '{ ' + args.join(' ') + ' }'; },\n input: args,\n matches: makeMatchesFunction(partialMatch),\n partialMatch\n };\n}\nfunction or(...args) {\n function partialMatch(a) {\n let out = null;\n args.some((arg) => {\n const res = typeof arg === 'function'\n ? arg().partialMatch(a)\n : arg.partialMatch(a);\n if (res != null) {\n out = res;\n return true;\n }\n return false;\n });\n return out;\n }\n const result = {\n toString: function () { return '{ ' + args.join(' ') + ' }'; },\n input: args,\n matches: makeMatchesFunction(partialMatch),\n partialMatch\n };\n return result;\n}\nfunction base(n) {\n const name = n;\n function matches(a) {\n let ma;\n try {\n ma = multiaddr(a);\n }\n catch (err) { // catch error\n return false; // also if it's invalid it's probably not matching as well so return false\n }\n const pnames = ma.protoNames();\n if (pnames.length === 1 && pnames[0] === name) {\n return true;\n }\n return false;\n }\n function partialMatch(protos) {\n if (protos.length === 0) {\n return null;\n }\n if (protos[0] === name) {\n return protos.slice(1);\n }\n return null;\n }\n return {\n toString: function () { return name; },\n matches,\n partialMatch\n };\n}\n//# sourceMappingURL=index.js.map","/**\n * @packageDocumentation\n *\n * The configured bootstrap peers will be discovered after the configured timeout. This will ensure there are some peers in the peer store for the node to use to discover other peers.\n *\n * They will be tagged with a tag with the name `'bootstrap'` tag, the value `50` and it will expire after two minutes which means the nodes connections may be closed if the maximum number of connections is reached.\n *\n * Clients that need constant connections to bootstrap nodes (e.g. browsers) can set the TTL to `Infinity`.\n *\n * @example Configuring a list of bootstrap nodes\n *\n * ```TypeScript\n * import { createLibp2p } from 'libp2p'\n * import { bootstrap } from '@libp2p/bootstrap'\n *\n * const libp2p = await createLibp2p({\n * peerDiscovery: [\n * bootstrap({\n * list: [\n * // a list of bootstrap peer multiaddrs to connect to on node startup\n * '/ip4/104.131.131.82/tcp/4001/ipfs/QmaCpDMGvV2BGHeYERUEnRQAwe3N8SzbUtfsmvsqQLuvuJ',\n * '/dnsaddr/bootstrap.libp2p.io/ipfs/QmNnooDu7bfjPFoTZYxMNLWUQJyrVwtbZg5gBMjTezGAJN',\n * '/dnsaddr/bootstrap.libp2p.io/ipfs/QmQCU2EcMqAqQPR2i9bChDtGNJchTbq5TbXJJ16u19uLTa'\n * ]\n * })\n * ]\n * })\n *\n * libp2p.addEventListener('peer:discovery', (evt) => {\n * console.log('found peer: ', evt.detail.toString())\n * })\n * ```\n */\nimport { TypedEventEmitter, peerDiscoverySymbol, serviceCapabilities } from '@libp2p/interface';\nimport { peerIdFromString } from '@libp2p/peer-id';\nimport { P2P } from '@multiformats/mafmt';\nimport { multiaddr } from '@multiformats/multiaddr';\nconst DEFAULT_BOOTSTRAP_TAG_NAME = 'bootstrap';\nconst DEFAULT_BOOTSTRAP_TAG_VALUE = 50;\nconst DEFAULT_BOOTSTRAP_TAG_TTL = 120000;\nconst DEFAULT_BOOTSTRAP_DISCOVERY_TIMEOUT = 1000;\n/**\n * Emits 'peer' events on a regular interval for each peer in the provided list.\n */\nclass Bootstrap extends TypedEventEmitter {\n static tag = 'bootstrap';\n log;\n timer;\n list;\n timeout;\n components;\n _init;\n constructor(components, options = { list: [] }) {\n if (options.list == null || options.list.length === 0) {\n throw new Error('Bootstrap requires a list of peer addresses');\n }\n super();\n this.components = components;\n this.log = components.logger.forComponent('libp2p:bootstrap');\n this.timeout = options.timeout ?? DEFAULT_BOOTSTRAP_DISCOVERY_TIMEOUT;\n this.list = [];\n for (const candidate of options.list) {\n if (!P2P.matches(candidate)) {\n this.log.error('Invalid multiaddr');\n continue;\n }\n const ma = multiaddr(candidate);\n const peerIdStr = ma.getPeerId();\n if (peerIdStr == null) {\n this.log.error('Invalid bootstrap multiaddr without peer id');\n continue;\n }\n const peerData = {\n id: peerIdFromString(peerIdStr),\n multiaddrs: [ma]\n };\n this.list.push(peerData);\n }\n this._init = options;\n }\n [peerDiscoverySymbol] = this;\n [Symbol.toStringTag] = '@libp2p/bootstrap';\n [serviceCapabilities] = [\n '@libp2p/peer-discovery'\n ];\n isStarted() {\n return Boolean(this.timer);\n }\n /**\n * Start emitting events\n */\n start() {\n if (this.isStarted()) {\n return;\n }\n this.log('Starting bootstrap node discovery, discovering peers after %s ms', this.timeout);\n this.timer = setTimeout(() => {\n void this._discoverBootstrapPeers()\n .catch(err => {\n this.log.error(err);\n });\n }, this.timeout);\n }\n /**\n * Emit each address in the list as a PeerInfo\n */\n async _discoverBootstrapPeers() {\n if (this.timer == null) {\n return;\n }\n for (const peerData of this.list) {\n await this.components.peerStore.merge(peerData.id, {\n tags: {\n [this._init.tagName ?? DEFAULT_BOOTSTRAP_TAG_NAME]: {\n value: this._init.tagValue ?? DEFAULT_BOOTSTRAP_TAG_VALUE,\n ttl: this._init.tagTTL ?? DEFAULT_BOOTSTRAP_TAG_TTL\n }\n }\n });\n // check we are still running\n if (this.timer == null) {\n return;\n }\n this.safeDispatchEvent('peer', { detail: peerData });\n }\n }\n /**\n * Stop emitting events\n */\n stop() {\n if (this.timer != null) {\n clearTimeout(this.timer);\n }\n this.timer = undefined;\n }\n}\nexport function bootstrap(init) {\n return (components) => new Bootstrap(components, init);\n}\n//# sourceMappingURL=index.js.map","// The domain string used for peer records contained in a Envelope.\nexport const ENVELOPE_DOMAIN_PEER_RECORD = 'libp2p-peer-record';\n// The type hint used to identify peer records in a Envelope.\n// Defined in https://github.com/multiformats/multicodec/blob/master/table.csv\n// with name \"libp2p-peer-record\"\nexport const ENVELOPE_PAYLOAD_TYPE_PEER_RECORD = Uint8Array.from([3, 1]);\n//# sourceMappingURL=consts.js.map","/* eslint-disable import/export */\n/* eslint-disable complexity */\n/* eslint-disable @typescript-eslint/no-namespace */\n/* eslint-disable @typescript-eslint/no-unnecessary-boolean-literal-compare */\n/* eslint-disable @typescript-eslint/no-empty-interface */\nimport { encodeMessage, decodeMessage, message } from 'protons-runtime';\nexport var PeerRecord;\n(function (PeerRecord) {\n let AddressInfo;\n (function (AddressInfo) {\n let _codec;\n AddressInfo.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.multiaddr != null && obj.multiaddr.byteLength > 0)) {\n w.uint32(10);\n w.bytes(obj.multiaddr);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length) => {\n const obj = {\n multiaddr: new Uint8Array(0)\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1:\n obj.multiaddr = reader.bytes();\n break;\n default:\n reader.skipType(tag & 7);\n break;\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n AddressInfo.encode = (obj) => {\n return encodeMessage(obj, AddressInfo.codec());\n };\n AddressInfo.decode = (buf) => {\n return decodeMessage(buf, AddressInfo.codec());\n };\n })(AddressInfo = PeerRecord.AddressInfo || (PeerRecord.AddressInfo = {}));\n let _codec;\n PeerRecord.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.peerId != null && obj.peerId.byteLength > 0)) {\n w.uint32(10);\n w.bytes(obj.peerId);\n }\n if ((obj.seq != null && obj.seq !== 0n)) {\n w.uint32(16);\n w.uint64(obj.seq);\n }\n if (obj.addresses != null) {\n for (const value of obj.addresses) {\n w.uint32(26);\n PeerRecord.AddressInfo.codec().encode(value, w);\n }\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length) => {\n const obj = {\n peerId: new Uint8Array(0),\n seq: 0n,\n addresses: []\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1:\n obj.peerId = reader.bytes();\n break;\n case 2:\n obj.seq = reader.uint64();\n break;\n case 3:\n obj.addresses.push(PeerRecord.AddressInfo.codec().decode(reader, reader.uint32()));\n break;\n default:\n reader.skipType(tag & 7);\n break;\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n PeerRecord.encode = (obj) => {\n return encodeMessage(obj, PeerRecord.codec());\n };\n PeerRecord.decode = (buf) => {\n return decodeMessage(buf, PeerRecord.codec());\n };\n})(PeerRecord || (PeerRecord = {}));\n//# sourceMappingURL=peer-record.js.map","import { peerIdFromBytes } from '@libp2p/peer-id';\nimport { arrayEquals } from '@libp2p/utils/array-equals';\nimport { multiaddr } from '@multiformats/multiaddr';\nimport { ENVELOPE_DOMAIN_PEER_RECORD, ENVELOPE_PAYLOAD_TYPE_PEER_RECORD } from './consts.js';\nimport { PeerRecord as Protobuf } from './peer-record.js';\n/**\n * The PeerRecord is used for distributing peer routing records across the network.\n * It contains the peer's reachable listen addresses.\n */\nexport class PeerRecord {\n /**\n * Unmarshal Peer Record Protobuf\n */\n static createFromProtobuf = (buf) => {\n const peerRecord = Protobuf.decode(buf);\n const peerId = peerIdFromBytes(peerRecord.peerId);\n const multiaddrs = (peerRecord.addresses ?? []).map((a) => multiaddr(a.multiaddr));\n const seqNumber = peerRecord.seq;\n return new PeerRecord({ peerId, multiaddrs, seqNumber });\n };\n static DOMAIN = ENVELOPE_DOMAIN_PEER_RECORD;\n static CODEC = ENVELOPE_PAYLOAD_TYPE_PEER_RECORD;\n peerId;\n multiaddrs;\n seqNumber;\n domain = PeerRecord.DOMAIN;\n codec = PeerRecord.CODEC;\n marshaled;\n constructor(init) {\n const { peerId, multiaddrs, seqNumber } = init;\n this.peerId = peerId;\n this.multiaddrs = multiaddrs ?? [];\n this.seqNumber = seqNumber ?? BigInt(Date.now());\n }\n /**\n * Marshal a record to be used in an envelope\n */\n marshal() {\n if (this.marshaled == null) {\n this.marshaled = Protobuf.encode({\n peerId: this.peerId.toBytes(),\n seq: BigInt(this.seqNumber),\n addresses: this.multiaddrs.map((m) => ({\n multiaddr: m.bytes\n }))\n });\n }\n return this.marshaled;\n }\n /**\n * Returns true if `this` record equals the `other`\n */\n equals(other) {\n if (!(other instanceof PeerRecord)) {\n return false;\n }\n // Validate PeerId\n if (!this.peerId.equals(other.peerId)) {\n return false;\n }\n // Validate seqNumber\n if (this.seqNumber !== other.seqNumber) {\n return false;\n }\n // Validate multiaddrs\n if (!arrayEquals(this.multiaddrs, other.multiaddrs)) {\n return false;\n }\n return true;\n }\n}\n//# sourceMappingURL=index.js.map","/**\n * @packageDocumentation\n *\n * Provides strategies ensure arrays are equivalent.\n *\n * @example\n *\n * ```typescript\n * import { arrayEquals } from '@libp2p/utils/array-equals'\n * import { multiaddr } from '@multformats/multiaddr'\n *\n * const ma1 = multiaddr('/ip4/127.0.0.1/tcp/9000'),\n * const ma2 = multiaddr('/ip4/82.41.53.1/tcp/9000')\n *\n * console.info(arrayEquals([ma1], [ma1])) // true\n * console.info(arrayEquals([ma1], [ma2])) // false\n * ```\n */\n/**\n * Verify if two arrays of non primitive types with the \"equals\" function are equal.\n * Compatible with multiaddr, peer-id and others.\n */\nexport function arrayEquals(a, b) {\n const sort = (a, b) => a.toString().localeCompare(b.toString());\n if (a.length !== b.length) {\n return false;\n }\n b.sort(sort);\n return a.sort(sort).every((item, index) => b[index].equals(item));\n}\n//# sourceMappingURL=array-equals.js.map","/* eslint-disable import/export */\n/* eslint-disable complexity */\n/* eslint-disable @typescript-eslint/no-namespace */\n/* eslint-disable @typescript-eslint/no-unnecessary-boolean-literal-compare */\n/* eslint-disable @typescript-eslint/no-empty-interface */\nimport { encodeMessage, decodeMessage, message } from 'protons-runtime';\nexport var Envelope;\n(function (Envelope) {\n let _codec;\n Envelope.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.publicKey != null && obj.publicKey.byteLength > 0)) {\n w.uint32(10);\n w.bytes(obj.publicKey);\n }\n if ((obj.payloadType != null && obj.payloadType.byteLength > 0)) {\n w.uint32(18);\n w.bytes(obj.payloadType);\n }\n if ((obj.payload != null && obj.payload.byteLength > 0)) {\n w.uint32(26);\n w.bytes(obj.payload);\n }\n if ((obj.signature != null && obj.signature.byteLength > 0)) {\n w.uint32(42);\n w.bytes(obj.signature);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length) => {\n const obj = {\n publicKey: new Uint8Array(0),\n payloadType: new Uint8Array(0),\n payload: new Uint8Array(0),\n signature: new Uint8Array(0)\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1:\n obj.publicKey = reader.bytes();\n break;\n case 2:\n obj.payloadType = reader.bytes();\n break;\n case 3:\n obj.payload = reader.bytes();\n break;\n case 5:\n obj.signature = reader.bytes();\n break;\n default:\n reader.skipType(tag & 7);\n break;\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n Envelope.encode = (obj) => {\n return encodeMessage(obj, Envelope.codec());\n };\n Envelope.decode = (buf) => {\n return decodeMessage(buf, Envelope.codec());\n };\n})(Envelope || (Envelope = {}));\n//# sourceMappingURL=envelope.js.map","import { unmarshalPrivateKey, unmarshalPublicKey } from '@libp2p/crypto/keys';\nimport { CodeError } from '@libp2p/interface';\nimport { peerIdFromKeys } from '@libp2p/peer-id';\nimport * as varint from 'uint8-varint';\nimport { Uint8ArrayList } from 'uint8arraylist';\nimport { equals as uint8ArrayEquals } from 'uint8arrays/equals';\nimport { fromString as uint8arraysFromString } from 'uint8arrays/from-string';\nimport { codes } from '../errors.js';\nimport { Envelope as Protobuf } from './envelope.js';\nexport class RecordEnvelope {\n /**\n * Unmarshal a serialized Envelope protobuf message\n */\n static createFromProtobuf = async (data) => {\n const envelopeData = Protobuf.decode(data);\n const peerId = await peerIdFromKeys(envelopeData.publicKey);\n return new RecordEnvelope({\n peerId,\n payloadType: envelopeData.payloadType,\n payload: envelopeData.payload,\n signature: envelopeData.signature\n });\n };\n /**\n * Seal marshals the given Record, places the marshaled bytes inside an Envelope\n * and signs it with the given peerId's private key\n */\n static seal = async (record, peerId) => {\n if (peerId.privateKey == null) {\n throw new Error('Missing private key');\n }\n const domain = record.domain;\n const payloadType = record.codec;\n const payload = record.marshal();\n const signData = formatSignaturePayload(domain, payloadType, payload);\n const key = await unmarshalPrivateKey(peerId.privateKey);\n const signature = await key.sign(signData.subarray());\n return new RecordEnvelope({\n peerId,\n payloadType,\n payload,\n signature\n });\n };\n /**\n * Open and certify a given marshalled envelope.\n * Data is unmarshalled and the signature validated for the given domain.\n */\n static openAndCertify = async (data, domain) => {\n const envelope = await RecordEnvelope.createFromProtobuf(data);\n const valid = await envelope.validate(domain);\n if (!valid) {\n throw new CodeError('envelope signature is not valid for the given domain', codes.ERR_SIGNATURE_NOT_VALID);\n }\n return envelope;\n };\n peerId;\n payloadType;\n payload;\n signature;\n marshaled;\n /**\n * The Envelope is responsible for keeping an arbitrary signed record\n * by a libp2p peer.\n */\n constructor(init) {\n const { peerId, payloadType, payload, signature } = init;\n this.peerId = peerId;\n this.payloadType = payloadType;\n this.payload = payload;\n this.signature = signature;\n }\n /**\n * Marshal the envelope content\n */\n marshal() {\n if (this.peerId.publicKey == null) {\n throw new Error('Missing public key');\n }\n if (this.marshaled == null) {\n this.marshaled = Protobuf.encode({\n publicKey: this.peerId.publicKey,\n payloadType: this.payloadType,\n payload: this.payload.subarray(),\n signature: this.signature\n });\n }\n return this.marshaled;\n }\n /**\n * Verifies if the other Envelope is identical to this one\n */\n equals(other) {\n return uint8ArrayEquals(this.marshal(), other.marshal());\n }\n /**\n * Validate envelope data signature for the given domain\n */\n async validate(domain) {\n const signData = formatSignaturePayload(domain, this.payloadType, this.payload);\n if (this.peerId.publicKey == null) {\n throw new Error('Missing public key');\n }\n const key = unmarshalPublicKey(this.peerId.publicKey);\n return key.verify(signData.subarray(), this.signature);\n }\n}\n/**\n * Helper function that prepares a Uint8Array to sign or verify a signature\n */\nconst formatSignaturePayload = (domain, payloadType, payload) => {\n // When signing, a peer will prepare a Uint8Array by concatenating the following:\n // - The length of the domain separation string string in bytes\n // - The domain separation string, encoded as UTF-8\n // - The length of the payload_type field in bytes\n // - The value of the payload_type field\n // - The length of the payload field in bytes\n // - The value of the payload field\n const domainUint8Array = uint8arraysFromString(domain);\n const domainLength = varint.encode(domainUint8Array.byteLength);\n const payloadTypeLength = varint.encode(payloadType.length);\n const payloadLength = varint.encode(payload.length);\n return new Uint8ArrayList(domainLength, domainUint8Array, payloadTypeLength, payloadType, payloadLength, payload);\n};\n//# sourceMappingURL=index.js.map","export const codes = {\n ERR_SIGNATURE_NOT_VALID: 'ERR_SIGNATURE_NOT_VALID'\n};\n//# sourceMappingURL=errors.js.map","/**\n * @packageDocumentation\n *\n * This module exports various matchers that can be used to infer the type of a\n * passed multiaddr.\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { DNS } from '@multiformats/multiaddr-matcher'\n *\n * const ma = multiaddr('/dnsaddr/example.org')\n *\n * DNS.matches(ma) // true - this is a multiaddr with a DNS address at the start\n * ```\n *\n * @example\n *\n * The default matching behaviour ignores any subsequent tuples in the multiaddr.\n * If you want stricter matching you can use `.exactMatch`:\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { DNS, Circuit } from '@multiformats/multiaddr-matcher'\n *\n * const ma = multiaddr('/dnsaddr/example.org/p2p/QmFoo/p2p-circuit/p2p/QmBar')\n *\n * DNS.exactMatch(ma) // false - this address has extra tuples after the DNS component\n * Circuit.matches(ma) // true\n * Circuit.exactMatch(ma) // true - the extra tuples are circuit relay related\n * ```\n */\nimport { isIPv4, isIPv6 } from '@chainsafe/is-ip';\nimport {} from '@multiformats/multiaddr';\nimport { base58btc } from 'multiformats/bases/base58';\nimport { base64url } from 'multiformats/bases/base64';\n/**\n * Split a multiaddr into path components\n */\nconst toParts = (ma) => {\n return ma.toString().split('/').slice(1);\n};\nconst func = (fn) => {\n return {\n match: (vals) => {\n if (vals.length < 1) {\n return false;\n }\n if (fn(vals[0])) {\n return vals.slice(1);\n }\n return false;\n },\n pattern: 'fn'\n };\n};\nconst literal = (str) => {\n return {\n match: (vals) => func((val) => val === str).match(vals),\n pattern: str\n };\n};\nconst string = () => {\n return {\n match: (vals) => func((val) => typeof val === 'string').match(vals),\n pattern: '{string}'\n };\n};\nconst number = () => {\n return {\n match: (vals) => func((val) => !isNaN(parseInt(val))).match(vals),\n pattern: '{number}'\n };\n};\nconst peerId = () => {\n return {\n match: (vals) => {\n if (vals.length < 2) {\n return false;\n }\n if (vals[0] !== 'p2p' && vals[0] !== 'ipfs') {\n return false;\n }\n // Q is RSA, 1 is Ed25519 or Secp256k1\n if (vals[1].startsWith('Q') || vals[1].startsWith('1')) {\n try {\n base58btc.decode(`z${vals[1]}`);\n }\n catch (err) {\n return false;\n }\n }\n else {\n return false;\n }\n return vals.slice(2);\n },\n pattern: '/p2p/{peerid}'\n };\n};\nconst certhash = () => {\n return {\n match: (vals) => {\n if (vals.length < 2) {\n return false;\n }\n if (vals[0] !== 'certhash') {\n return false;\n }\n try {\n base64url.decode(vals[1]);\n }\n catch {\n return false;\n }\n return vals.slice(2);\n },\n pattern: '/certhash/{certhash}'\n };\n};\nconst optional = (matcher) => {\n return {\n match: (vals) => {\n const result = matcher.match(vals);\n if (result === false) {\n return vals;\n }\n return result;\n },\n pattern: `optional(${matcher.pattern})`\n };\n};\nconst or = (...matchers) => {\n return {\n match: (vals) => {\n let matches;\n for (const matcher of matchers) {\n const result = matcher.match(vals);\n // no match\n if (result === false) {\n continue;\n }\n // choose greediest matcher\n if (matches == null || result.length < matches.length) {\n matches = result;\n }\n }\n if (matches == null) {\n return false;\n }\n return matches;\n },\n pattern: `or(${matchers.map(m => m.pattern).join(', ')})`\n };\n};\nconst and = (...matchers) => {\n return {\n match: (vals) => {\n for (const matcher of matchers) {\n // pass what's left of the array\n const result = matcher.match(vals);\n // no match\n if (result === false) {\n return false;\n }\n vals = result;\n }\n return vals;\n },\n pattern: `and(${matchers.map(m => m.pattern).join(', ')})`\n };\n};\nfunction fmt(...matchers) {\n function match(ma) {\n let parts = toParts(ma);\n for (const matcher of matchers) {\n const result = matcher.match(parts);\n if (result === false) {\n return false;\n }\n parts = result;\n }\n return parts;\n }\n function matches(ma) {\n const result = match(ma);\n return result !== false;\n }\n function exactMatch(ma) {\n const result = match(ma);\n if (result === false) {\n return false;\n }\n return result.length === 0;\n }\n return {\n matches,\n exactMatch\n };\n}\n/**\n * DNS matchers\n */\nconst _DNS4 = and(literal('dns4'), string());\nconst _DNS6 = and(literal('dns6'), string());\nconst _DNSADDR = and(literal('dnsaddr'), string());\nconst _DNS = and(literal('dns'), string());\n/**\n * Matches dns4 addresses.\n *\n * Use {@link DNS DNS} instead to match any type of DNS address.\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { DNS4 } from '@multiformats/multiaddr-matcher'\n *\n * DNS4.matches(multiaddr('/dns4/example.org')) // true\n * ```\n */\nexport const DNS4 = fmt(_DNS4);\n/**\n * Matches dns6 addresses.\n *\n * Use {@link DNS DNS} instead to match any type of DNS address.\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { DNS6 } from '@multiformats/multiaddr-matcher'\n *\n * DNS6.matches(multiaddr('/dns6/example.org')) // true\n * ```\n */\nexport const DNS6 = fmt(_DNS6);\n/**\n * Matches dnsaddr addresses.\n *\n * Use {@link DNS DNS} instead to match any type of DNS address.\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { DNSADDR } from '@multiformats/multiaddr-matcher'\n *\n * DNSADDR.matches(multiaddr('/dnsaddr/example.org')) // true\n * ```\n */\nexport const DNSADDR = fmt(_DNSADDR);\n/**\n * Matches any dns address.\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { DNS } from '@multiformats/multiaddr-matcher'\n *\n * DNS.matches(multiaddr('/dnsaddr/example.org')) // true\n * DNS.matches(multiaddr('/dns4/example.org')) // true\n * DNS.matches(multiaddr('/dns6/example.org')) // true\n * ```\n */\nexport const DNS = fmt(or(_DNS, _DNSADDR, _DNS4, _DNS6));\nconst _IP4 = and(literal('ip4'), func(isIPv4));\nconst _IP6 = and(literal('ip6'), func(isIPv6));\nconst _IP = or(_IP4, _IP6);\nconst _IP_OR_DOMAIN = or(_IP, _DNS, _DNS4, _DNS6, _DNSADDR);\n/**\n * A matcher for addresses that start with IP or DNS tuples.\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { IP_OR_DOMAIN } from '@multiformats/multiaddr-matcher'\n *\n * IP_OR_DOMAIN.matches(multiaddr('/ip4/123.123.123.123/p2p/QmFoo')) // true\n * IP_OR_DOMAIN.matches(multiaddr('/dns/example.com/p2p/QmFoo')) // true\n * IP_OR_DOMAIN.matches(multiaddr('/p2p/QmFoo')) // false\n * ```\n */\nexport const IP_OR_DOMAIN = fmt(_IP_OR_DOMAIN);\n/**\n * Matches ip4 addresses.\n *\n * Use {@link IP IP} instead to match any ip4/ip6 address.\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { IP4 } from '@multiformats/multiaddr-matcher'\n *\n * const ma = multiaddr('/ip4/123.123.123.123')\n *\n * IP4.matches(ma) // true\n * ```\n */\nexport const IP4 = fmt(_IP4);\n/**\n * Matches ip6 addresses.\n *\n * Use {@link IP IP} instead to match any ip4/ip6 address.\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { IP6 } from '@multiformats/multiaddr-matcher'\n *\n * const ma = multiaddr('/ip6/fe80::1cc1:a3b8:322f:cf22')\n *\n * IP6.matches(ma) // true\n * ```\n */\nexport const IP6 = fmt(_IP6);\n/**\n * Matches ip4 or ip6 addresses.\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { IP } from '@multiformats/multiaddr-matcher'\n *\n * IP.matches(multiaddr('/ip4/123.123.123.123')) // true\n * IP.matches(multiaddr('/ip6/fe80::1cc1:a3b8:322f:cf22')) // true\n * ```\n */\nexport const IP = fmt(_IP);\nconst _TCP = and(_IP_OR_DOMAIN, literal('tcp'), number());\nconst _UDP = and(_IP_OR_DOMAIN, literal('udp'), number());\n/**\n * Matches TCP addresses.\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { TCP } from '@multiformats/multiaddr-matcher'\n *\n * TCP.matches(multiaddr('/ip4/123.123.123.123/tcp/1234')) // true\n * ```\n */\nexport const TCP = fmt(_TCP);\n/**\n * Matches UDP addresses.\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { UDP } from '@multiformats/multiaddr-matcher'\n *\n * UDP.matches(multiaddr('/ip4/123.123.123.123/udp/1234')) // true\n * ```\n */\nexport const UDP = fmt(_UDP);\nconst _QUIC = and(_UDP, literal('quic'));\nconst _QUICV1 = and(_UDP, literal('quic-v1'));\nconst QUIC_V0_OR_V1 = or(_QUIC, _QUICV1);\n/**\n * Matches QUIC addresses.\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { QUIC } from '@multiformats/multiaddr-matcher'\n *\n * QUIC.matches(multiaddr('/ip4/123.123.123.123/udp/1234/quic')) // true\n * ```\n */\nexport const QUIC = fmt(_QUIC);\n/**\n * Matches QUICv1 addresses.\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { QUICV1 } from '@multiformats/multiaddr-matcher'\n *\n * QUICV1.matches(multiaddr('/ip4/123.123.123.123/udp/1234/quic-v1')) // true\n * ```\n */\nexport const QUICV1 = fmt(_QUICV1);\nconst _WEB = or(_IP_OR_DOMAIN, _TCP, _UDP, _QUIC, _QUICV1);\nconst _WebSockets = or(and(_WEB, literal('ws'), optional(peerId())));\n/**\n * Matches WebSocket addresses.\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { WebSockets } from '@multiformats/multiaddr-matcher'\n *\n * WebSockets.matches(multiaddr('/ip4/123.123.123.123/tcp/1234/ws')) // true\n * ```\n */\nexport const WebSockets = fmt(_WebSockets);\nconst _WebSocketsSecure = or(and(_WEB, literal('wss'), optional(peerId())), and(_WEB, literal('tls'), literal('ws'), optional(peerId())));\n/**\n * Matches secure WebSocket addresses.\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { WebSocketsSecure } from '@multiformats/multiaddr-matcher'\n *\n * WebSocketsSecure.matches(multiaddr('/ip4/123.123.123.123/tcp/1234/wss')) // true\n * ```\n */\nexport const WebSocketsSecure = fmt(_WebSocketsSecure);\nconst _WebRTCDirect = and(_UDP, literal('webrtc-direct'), optional(certhash()), optional(certhash()), optional(peerId()));\n/**\n * Matches WebRTC-direct addresses.\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { WebRTCDirect } from '@multiformats/multiaddr-matcher'\n *\n * WebRTCDirect.matches(multiaddr('/ip4/123.123.123.123/tcp/1234/p2p/QmFoo/webrtc-direct/certhash/u....')) // true\n * ```\n */\nexport const WebRTCDirect = fmt(_WebRTCDirect);\nconst _WebTransport = and(_QUICV1, literal('webtransport'), optional(certhash()), optional(certhash()), optional(peerId()));\n/**\n * Matches WebTransport addresses.\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { WebRTCDirect } from '@multiformats/multiaddr-matcher'\n *\n * WebRTCDirect.matches(multiaddr('/ip4/123.123.123.123/udp/1234/quic-v1/webtransport/certhash/u..../certhash/u..../p2p/QmFoo')) // true\n * ```\n */\nexport const WebTransport = fmt(_WebTransport);\nconst _P2P = or(_WebSockets, _WebSocketsSecure, and(_TCP, optional(peerId())), and(QUIC_V0_OR_V1, optional(peerId())), and(_IP_OR_DOMAIN, optional(peerId())), _WebRTCDirect, _WebTransport, peerId());\n/**\n * Matches peer addresses\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { P2P } from '@multiformats/multiaddr-matcher'\n *\n * P2P.matches(multiaddr('/ip4/123.123.123.123/tcp/1234/p2p/QmFoo')) // true\n * ```\n */\nexport const P2P = fmt(_P2P);\nconst _Circuit = and(_P2P, literal('p2p-circuit'), peerId());\n/**\n * Matches circuit relay addresses\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { Circuit } from '@multiformats/multiaddr-matcher'\n *\n * Circuit.matches(multiaddr('/ip4/123.123.123.123/tcp/1234/p2p/QmRelay/p2p-circuit/p2p/QmTarget')) // true\n * ```\n */\nexport const Circuit = fmt(_Circuit);\nconst _WebRTC = or(and(_P2P, literal('p2p-circuit'), literal('webrtc'), optional(peerId())), and(_P2P, literal('webrtc'), optional(peerId())), literal('webrtc'));\n/**\n * Matches WebRTC addresses\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { WebRTC } from '@multiformats/multiaddr-matcher'\n *\n * WebRTC.matches(multiaddr('/ip4/123.123.123.123/tcp/1234/p2p/QmRelay/p2p-circuit/webrtc/p2p/QmTarget')) // true\n * ```\n */\nexport const WebRTC = fmt(_WebRTC);\nconst _HTTP = or(and(_IP_OR_DOMAIN, literal('tcp'), number(), literal('http'), optional(peerId())), and(_IP_OR_DOMAIN, literal('http'), optional(peerId())));\n/**\n * Matches HTTP addresses\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { HTTP } from '@multiformats/multiaddr-matcher'\n *\n * HTTP.matches(multiaddr('/dns/example.org/http')) // true\n * ```\n */\nexport const HTTP = fmt(_HTTP);\nconst _HTTPS = or(and(_IP_OR_DOMAIN, literal('tcp'), or(and(literal('443'), literal('http')), and(number(), literal('https'))), optional(peerId())), and(_IP_OR_DOMAIN, literal('tls'), literal('http'), optional(peerId())), and(_IP_OR_DOMAIN, literal('https'), optional(peerId())));\n/**\n * Matches HTTPS addresses\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { HTTP } from '@multiformats/multiaddr-matcher'\n *\n * HTTP.matches(multiaddr('/dns/example.org/tls/http')) // true\n * ```\n */\nexport const HTTPS = fmt(_HTTPS);\n//# sourceMappingURL=index.js.map","/**\n * @packageDocumentation\n *\n * This module makes it easy to send and receive length-prefixed Protobuf encoded\n * messages over streams.\n *\n * @example\n *\n * ```typescript\n * import { pbStream } from 'it-protobuf-stream'\n * import { MessageType } from './src/my-message-type.js'\n *\n * // RequestType and ResponseType have been generate from `.proto` files and have\n * // `.encode` and `.decode` methods for serialization/deserialization\n *\n * const stream = pbStream(duplex)\n *\n * // write a message to the stream\n * stream.write({\n * foo: 'bar'\n * }, MessageType)\n *\n * // read a message from the stream\n * const res = await stream.read(MessageType)\n * ```\n */\nimport { lpStream } from 'it-length-prefixed-stream';\nexport function pbStream(duplex, opts) {\n const lp = lpStream(duplex, opts);\n const W = {\n read: async (proto, options) => {\n // readLP, decode\n const value = await lp.read(options);\n return proto.decode(value);\n },\n write: async (message, proto, options) => {\n // encode, writeLP\n await lp.write(proto.encode(message), options);\n },\n writeV: async (messages, proto, options) => {\n // encode, writeLP\n await lp.writeV(messages.map(message => proto.encode(message)), options);\n },\n pb: (proto) => {\n return {\n read: async (options) => W.read(proto, options),\n write: async (d, options) => W.write(d, proto, options),\n writeV: async (d, options) => W.writeV(d, proto, options),\n unwrap: () => W\n };\n },\n unwrap: () => {\n return lp.unwrap();\n }\n };\n return W;\n}\n//# sourceMappingURL=index.js.map","/* eslint-disable import/export */\n/* eslint-disable complexity */\n/* eslint-disable @typescript-eslint/no-namespace */\n/* eslint-disable @typescript-eslint/no-unnecessary-boolean-literal-compare */\n/* eslint-disable @typescript-eslint/no-empty-interface */\nimport { encodeMessage, decodeMessage, message } from 'protons-runtime';\nexport var Identify;\n(function (Identify) {\n let _codec;\n Identify.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if (obj.protocolVersion != null) {\n w.uint32(42);\n w.string(obj.protocolVersion);\n }\n if (obj.agentVersion != null) {\n w.uint32(50);\n w.string(obj.agentVersion);\n }\n if (obj.publicKey != null) {\n w.uint32(10);\n w.bytes(obj.publicKey);\n }\n if (obj.listenAddrs != null) {\n for (const value of obj.listenAddrs) {\n w.uint32(18);\n w.bytes(value);\n }\n }\n if (obj.observedAddr != null) {\n w.uint32(34);\n w.bytes(obj.observedAddr);\n }\n if (obj.protocols != null) {\n for (const value of obj.protocols) {\n w.uint32(26);\n w.string(value);\n }\n }\n if (obj.signedPeerRecord != null) {\n w.uint32(66);\n w.bytes(obj.signedPeerRecord);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length) => {\n const obj = {\n listenAddrs: [],\n protocols: []\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 5:\n obj.protocolVersion = reader.string();\n break;\n case 6:\n obj.agentVersion = reader.string();\n break;\n case 1:\n obj.publicKey = reader.bytes();\n break;\n case 2:\n obj.listenAddrs.push(reader.bytes());\n break;\n case 4:\n obj.observedAddr = reader.bytes();\n break;\n case 3:\n obj.protocols.push(reader.string());\n break;\n case 8:\n obj.signedPeerRecord = reader.bytes();\n break;\n default:\n reader.skipType(tag & 7);\n break;\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n Identify.encode = (obj) => {\n return encodeMessage(obj, Identify.codec());\n };\n Identify.decode = (buf) => {\n return decodeMessage(buf, Identify.codec());\n };\n})(Identify || (Identify = {}));\n//# sourceMappingURL=message.js.map","import detectElectron from 'is-electron'\n\nexport const isEnvWithDom = typeof window === 'object' && typeof document === 'object' && document.nodeType === 9\nexport const isElectron = detectElectron()\n\n/**\n * Detects browser main thread **NOT** web worker or service worker\n */\nexport const isBrowser = isEnvWithDom && !isElectron\nexport const isElectronMain = isElectron && !isEnvWithDom\nexport const isElectronRenderer = isElectron && isEnvWithDom\nexport const isNode = typeof globalThis.process !== 'undefined' && typeof globalThis.process.release !== 'undefined' && globalThis.process.release.name === 'node' && !isElectron\n// @ts-ignore\n// eslint-disable-next-line no-undef\nexport const isWebWorker = typeof importScripts === 'function' && typeof self !== 'undefined' && typeof WorkerGlobalScope !== 'undefined' && self instanceof WorkerGlobalScope\n\n// defeat bundlers replacing process.env.NODE_ENV with \"development\" or whatever\nexport const isTest = typeof globalThis.process !== 'undefined' && typeof globalThis.process.env !== 'undefined' && globalThis.process.env['NODE' + (() => '_')() + 'ENV'] === 'test'\nexport const isReactNative = typeof navigator !== 'undefined' && navigator.product === 'ReactNative'\n","import { CodeError } from '@libp2p/interface';\nimport { peerIdFromKeys } from '@libp2p/peer-id';\nimport { RecordEnvelope, PeerRecord } from '@libp2p/peer-record';\nimport { multiaddr } from '@multiformats/multiaddr';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport { isNode, isBrowser, isWebWorker, isElectronMain, isElectronRenderer, isReactNative } from 'wherearewe';\nimport { IDENTIFY_PROTOCOL_VERSION, MAX_IDENTIFY_MESSAGE_SIZE, MAX_PUSH_CONCURRENCY } from './consts.js';\nexport const defaultValues = {\n protocolPrefix: 'ipfs',\n timeout: 5000,\n maxInboundStreams: 1,\n maxOutboundStreams: 1,\n maxObservedAddresses: 10,\n maxMessageSize: MAX_IDENTIFY_MESSAGE_SIZE,\n runOnConnectionOpen: true,\n runOnSelfUpdate: true,\n runOnTransientConnection: true,\n concurrency: MAX_PUSH_CONCURRENCY\n};\n/**\n * Takes the `addr` and converts it to a Multiaddr if possible\n */\nexport function getCleanMultiaddr(addr) {\n if (addr != null && addr.length > 0) {\n try {\n return multiaddr(addr);\n }\n catch {\n }\n }\n}\nexport function getAgentVersion(nodeInfo, agentVersion) {\n if (agentVersion != null) {\n return agentVersion;\n }\n agentVersion = `${nodeInfo.name}/${nodeInfo.version}`;\n // Append user agent version to default AGENT_VERSION depending on the environment\n if (isNode || isElectronMain) {\n agentVersion += ` UserAgent=${globalThis.process.version}`;\n }\n else if (isBrowser || isWebWorker || isElectronRenderer || isReactNative) {\n agentVersion += ` UserAgent=${globalThis.navigator.userAgent}`;\n }\n return agentVersion;\n}\nexport async function consumeIdentifyMessage(peerStore, events, log, connection, message) {\n log('received identify from %p', connection.remotePeer);\n if (message == null) {\n throw new CodeError('message was null or undefined', 'ERR_INVALID_MESSAGE');\n }\n const peer = {};\n if (message.listenAddrs.length > 0) {\n peer.addresses = message.listenAddrs.map(buf => ({\n isCertified: false,\n multiaddr: multiaddr(buf)\n }));\n }\n if (message.protocols.length > 0) {\n peer.protocols = message.protocols;\n }\n if (message.publicKey != null) {\n peer.publicKey = message.publicKey;\n const peerId = await peerIdFromKeys(message.publicKey);\n if (!peerId.equals(connection.remotePeer)) {\n throw new CodeError('public key did not match remote PeerId', 'ERR_INVALID_PUBLIC_KEY');\n }\n }\n let output;\n // if the peer record has been sent, prefer the addresses in the record as they are signed by the remote peer\n if (message.signedPeerRecord != null) {\n log('received signedPeerRecord from %p', connection.remotePeer);\n let peerRecordEnvelope = message.signedPeerRecord;\n const envelope = await RecordEnvelope.openAndCertify(peerRecordEnvelope, PeerRecord.DOMAIN);\n let peerRecord = PeerRecord.createFromProtobuf(envelope.payload);\n // Verify peerId\n if (!peerRecord.peerId.equals(envelope.peerId)) {\n throw new CodeError('signing key does not match PeerId in the PeerRecord', 'ERR_INVALID_SIGNING_KEY');\n }\n // Make sure remote peer is the one sending the record\n if (!connection.remotePeer.equals(peerRecord.peerId)) {\n throw new CodeError('signing key does not match remote PeerId', 'ERR_INVALID_PEER_RECORD_KEY');\n }\n let existingPeer;\n try {\n existingPeer = await peerStore.get(peerRecord.peerId);\n }\n catch (err) {\n if (err.code !== 'ERR_NOT_FOUND') {\n throw err;\n }\n }\n if (existingPeer != null) {\n // don't lose any existing metadata\n peer.metadata = existingPeer.metadata;\n // if we have previously received a signed record for this peer, compare it to the incoming one\n if (existingPeer.peerRecordEnvelope != null) {\n const storedEnvelope = await RecordEnvelope.createFromProtobuf(existingPeer.peerRecordEnvelope);\n const storedRecord = PeerRecord.createFromProtobuf(storedEnvelope.payload);\n // ensure seq is greater than, or equal to, the last received\n if (storedRecord.seqNumber >= peerRecord.seqNumber) {\n log('sequence number was lower or equal to existing sequence number - stored: %d received: %d', storedRecord.seqNumber, peerRecord.seqNumber);\n peerRecord = storedRecord;\n peerRecordEnvelope = existingPeer.peerRecordEnvelope;\n }\n }\n }\n // store the signed record for next time\n peer.peerRecordEnvelope = peerRecordEnvelope;\n // override the stored addresses with the signed multiaddrs\n peer.addresses = peerRecord.multiaddrs.map(multiaddr => ({\n isCertified: true,\n multiaddr\n }));\n output = {\n seq: peerRecord.seqNumber,\n addresses: peerRecord.multiaddrs\n };\n }\n else {\n log('%p did not send a signed peer record', connection.remotePeer);\n }\n log('patching %p with', connection.remotePeer, peer);\n await peerStore.patch(connection.remotePeer, peer);\n if (message.agentVersion != null || message.protocolVersion != null) {\n const metadata = {};\n if (message.agentVersion != null) {\n metadata.AgentVersion = uint8ArrayFromString(message.agentVersion);\n }\n if (message.protocolVersion != null) {\n metadata.ProtocolVersion = uint8ArrayFromString(message.protocolVersion);\n }\n log('merging %p metadata', connection.remotePeer, metadata);\n await peerStore.merge(connection.remotePeer, {\n metadata\n });\n }\n const result = {\n peerId: connection.remotePeer,\n protocolVersion: message.protocolVersion,\n agentVersion: message.agentVersion,\n publicKey: message.publicKey,\n listenAddrs: message.listenAddrs.map(buf => multiaddr(buf)),\n observedAddr: message.observedAddr == null ? undefined : multiaddr(message.observedAddr),\n protocols: message.protocols,\n signedPeerRecord: output,\n connection\n };\n events.safeDispatchEvent('peer:identify', { detail: result });\n return result;\n}\nexport class AbstractIdentify {\n host;\n protocol;\n started;\n timeout;\n peerId;\n peerStore;\n registrar;\n addressManager;\n maxInboundStreams;\n maxOutboundStreams;\n maxMessageSize;\n maxObservedAddresses;\n events;\n runOnTransientConnection;\n log;\n constructor(components, init) {\n this.protocol = init.protocol;\n this.started = false;\n this.peerId = components.peerId;\n this.peerStore = components.peerStore;\n this.registrar = components.registrar;\n this.addressManager = components.addressManager;\n this.events = components.events;\n this.log = init.log;\n this.timeout = init.timeout ?? defaultValues.timeout;\n this.maxInboundStreams = init.maxInboundStreams ?? defaultValues.maxInboundStreams;\n this.maxOutboundStreams = init.maxOutboundStreams ?? defaultValues.maxOutboundStreams;\n this.maxMessageSize = init.maxMessageSize ?? defaultValues.maxMessageSize;\n this.maxObservedAddresses = init.maxObservedAddresses ?? defaultValues.maxObservedAddresses;\n this.runOnTransientConnection = init.runOnTransientConnection ?? defaultValues.runOnTransientConnection;\n // Store self host metadata\n this.host = {\n protocolVersion: `${init.protocolPrefix ?? defaultValues.protocolPrefix}/${IDENTIFY_PROTOCOL_VERSION}`,\n agentVersion: getAgentVersion(components.nodeInfo, init.agentVersion)\n };\n }\n isStarted() {\n return this.started;\n }\n async start() {\n if (this.started) {\n return;\n }\n await this.peerStore.merge(this.peerId, {\n metadata: {\n AgentVersion: uint8ArrayFromString(this.host.agentVersion),\n ProtocolVersion: uint8ArrayFromString(this.host.protocolVersion)\n }\n });\n await this.registrar.handle(this.protocol, (data) => {\n void this.handleProtocol(data).catch(err => {\n this.log.error(err);\n });\n }, {\n maxInboundStreams: this.maxInboundStreams,\n maxOutboundStreams: this.maxOutboundStreams,\n runOnTransientConnection: this.runOnTransientConnection\n });\n this.started = true;\n }\n async stop() {\n await this.registrar.unhandle(this.protocol);\n this.started = false;\n }\n}\n//# sourceMappingURL=utils.js.map","export const PROTOCOL_VERSION = 'ipfs/0.1.0'; // deprecated\nexport const MULTICODEC_IDENTIFY = '/ipfs/id/1.0.0'; // deprecated\nexport const MULTICODEC_IDENTIFY_PUSH = '/ipfs/id/push/1.0.0'; // deprecated\nexport const IDENTIFY_PROTOCOL_VERSION = '0.1.0';\nexport const MULTICODEC_IDENTIFY_PROTOCOL_NAME = 'id';\nexport const MULTICODEC_IDENTIFY_PUSH_PROTOCOL_NAME = 'id/push';\nexport const MULTICODEC_IDENTIFY_PROTOCOL_VERSION = '1.0.0';\nexport const MULTICODEC_IDENTIFY_PUSH_PROTOCOL_VERSION = '1.0.0';\n// https://github.com/libp2p/go-libp2p/blob/8d2e54e1637041d5cf4fac1e531287560bd1f4ac/p2p/protocol/identify/id.go#L52\nexport const MAX_IDENTIFY_MESSAGE_SIZE = 1024 * 8;\n// https://github.com/libp2p/go-libp2p/blob/0385ec924bad172f74a74db09939e97c079b1420/p2p/protocol/identify/id.go#L47C7-L47C25\nexport const MAX_PUSH_CONCURRENCY = 32;\n//# sourceMappingURL=consts.js.map","/* eslint-disable complexity */\nimport { CodeError, serviceCapabilities, setMaxListeners } from '@libp2p/interface';\nimport { peerIdFromKeys } from '@libp2p/peer-id';\nimport { RecordEnvelope, PeerRecord } from '@libp2p/peer-record';\nimport { protocols } from '@multiformats/multiaddr';\nimport { IP_OR_DOMAIN } from '@multiformats/multiaddr-matcher';\nimport { pbStream } from 'it-protobuf-stream';\nimport { MULTICODEC_IDENTIFY_PROTOCOL_NAME, MULTICODEC_IDENTIFY_PROTOCOL_VERSION } from './consts.js';\nimport { Identify as IdentifyMessage } from './pb/message.js';\nimport { AbstractIdentify, consumeIdentifyMessage, defaultValues, getCleanMultiaddr } from './utils.js';\nexport class Identify extends AbstractIdentify {\n constructor(components, init = {}) {\n super(components, {\n ...init,\n protocol: `/${init.protocolPrefix ?? defaultValues.protocolPrefix}/${MULTICODEC_IDENTIFY_PROTOCOL_NAME}/${MULTICODEC_IDENTIFY_PROTOCOL_VERSION}`,\n log: components.logger.forComponent('libp2p:identify')\n });\n if (init.runOnConnectionOpen ?? defaultValues.runOnConnectionOpen) {\n // When a new connection happens, trigger identify\n components.events.addEventListener('connection:open', (evt) => {\n const connection = evt.detail;\n this.identify(connection).catch(err => { this.log.error('error during identify trigged by connection:open', err); });\n });\n }\n }\n [serviceCapabilities] = [\n '@libp2p/identify'\n ];\n async _identify(connection, options = {}) {\n let stream;\n if (options.signal == null) {\n const signal = AbortSignal.timeout(this.timeout);\n setMaxListeners(Infinity, signal);\n options = {\n ...options,\n signal\n };\n }\n try {\n stream = await connection.newStream(this.protocol, {\n ...options,\n runOnTransientConnection: this.runOnTransientConnection\n });\n const pb = pbStream(stream, {\n maxDataLength: this.maxMessageSize\n }).pb(IdentifyMessage);\n const message = await pb.read(options);\n await stream.close(options);\n return message;\n }\n catch (err) {\n this.log.error('error while reading identify message', err);\n stream?.abort(err);\n throw err;\n }\n }\n async identify(connection, options = {}) {\n const message = await this._identify(connection, options);\n const { publicKey, protocols, observedAddr } = message;\n if (publicKey == null) {\n throw new CodeError('public key was missing from identify message', 'ERR_MISSING_PUBLIC_KEY');\n }\n const id = await peerIdFromKeys(publicKey);\n if (!connection.remotePeer.equals(id)) {\n throw new CodeError('identified peer does not match the expected peer', 'ERR_INVALID_PEER');\n }\n if (this.peerId.equals(id)) {\n throw new CodeError('identified peer is our own peer id?', 'ERR_INVALID_PEER');\n }\n // Get the observedAddr if there is one\n const cleanObservedAddr = getCleanMultiaddr(observedAddr);\n this.log('identify completed for peer %p and protocols %o', id, protocols);\n this.log('our observed address is %a', cleanObservedAddr);\n if (cleanObservedAddr != null &&\n this.addressManager.getObservedAddrs().length < (this.maxObservedAddresses ?? Infinity)) {\n this.log('storing our observed address %a', cleanObservedAddr);\n this.addressManager.addObservedAddr(cleanObservedAddr);\n }\n return consumeIdentifyMessage(this.peerStore, this.events, this.log, connection, message);\n }\n /**\n * Sends the `Identify` response with the Signed Peer Record\n * to the requesting peer over the given `connection`\n */\n async handleProtocol(data) {\n const { connection, stream } = data;\n const signal = AbortSignal.timeout(this.timeout);\n setMaxListeners(Infinity, signal);\n try {\n const publicKey = this.peerId.publicKey ?? new Uint8Array(0);\n const peerData = await this.peerStore.get(this.peerId);\n const multiaddrs = this.addressManager.getAddresses().map(ma => ma.decapsulateCode(protocols('p2p').code));\n let signedPeerRecord = peerData.peerRecordEnvelope;\n if (multiaddrs.length > 0 && signedPeerRecord == null) {\n const peerRecord = new PeerRecord({\n peerId: this.peerId,\n multiaddrs\n });\n const envelope = await RecordEnvelope.seal(peerRecord, this.peerId);\n signedPeerRecord = envelope.marshal().subarray();\n }\n let observedAddr = connection.remoteAddr.bytes;\n if (!IP_OR_DOMAIN.matches(connection.remoteAddr)) {\n observedAddr = undefined;\n }\n const pb = pbStream(stream).pb(IdentifyMessage);\n await pb.write({\n protocolVersion: this.host.protocolVersion,\n agentVersion: this.host.agentVersion,\n publicKey,\n listenAddrs: multiaddrs.map(addr => addr.bytes),\n signedPeerRecord,\n observedAddr,\n protocols: peerData.protocols\n }, {\n signal\n });\n await stream.close({\n signal\n });\n }\n catch (err) {\n this.log.error('could not respond to identify request', err);\n stream.abort(err);\n }\n }\n}\n//# sourceMappingURL=identify.js.map","/**\n * @packageDocumentation\n *\n * Use the `identify` function to add support for the [Identify protocol](https://github.com/libp2p/specs/blob/master/identify/README.md) to libp2p.\n *\n * This protocol allows network peers to discover the multiaddrs the current node listens on, and the protocols it supports.\n *\n * A second function, `identifyPush` is also exported to add support for [identify/push](https://github.com/libp2p/specs/blob/master/identify/README.md#identifypush).\n *\n * This protocol will send updates to all connected peers when the multiaddrs or protocols of the current node change.\n *\n * > [!TIP]\n * > For maximum network compatibility you should configure both protocols\n *\n * @example Enabling identify\n *\n * ```typescript\n * import { createLibp2p } from 'libp2p'\n * import { identify } from '@libp2p/identify'\n *\n * const node = await createLibp2p({\n * // ...other options\n * services: {\n * identify: identify()\n * }\n * })\n * ```\n *\n * @example Enabling identify push\n *\n * ```typescript\n * import { createLibp2p } from 'libp2p'\n * import { identifyPush } from '@libp2p/identify'\n *\n * const node = await createLibp2p({\n * // ...other options\n * services: {\n * identifyPush: identifyPush()\n * }\n * })\n * ```\n */\nimport { IdentifyPush as IdentifyPushClass } from './identify-push.js';\nimport { Identify as IdentifyClass } from './identify.js';\nexport function identify(init = {}) {\n return (components) => new IdentifyClass(components, init);\n}\nexport function identifyPush(init = {}) {\n return (components) => new IdentifyPushClass(components, init);\n}\n//# sourceMappingURL=index.js.map","import { getIterator } from 'get-iterator';\nimport { isPromise } from './is-promise.js';\nexport function closeSource(source, log) {\n const res = getIterator(source).return?.();\n if (isPromise(res)) {\n res.catch(err => {\n log.error('could not cause iterator to return', err);\n });\n }\n}\n//# sourceMappingURL=close-source.js.map","export function getIterator(obj) {\n if (obj != null) {\n if (typeof obj[Symbol.iterator] === 'function') {\n return obj[Symbol.iterator]();\n }\n if (typeof obj[Symbol.asyncIterator] === 'function') {\n return obj[Symbol.asyncIterator]();\n }\n if (typeof obj.next === 'function') {\n return obj; // probably an iterator\n }\n }\n throw new Error('argument is not an iterator or iterable');\n}\n//# sourceMappingURL=index.js.map","export function isPromise(thing) {\n if (thing == null) {\n return false;\n }\n return typeof thing.then === 'function' &&\n typeof thing.catch === 'function' &&\n typeof thing.finally === 'function';\n}\n//# sourceMappingURL=is-promise.js.map","// From https://github.com/sindresorhus/random-int/blob/c37741b56f76b9160b0b63dae4e9c64875128146/index.js#L13-L15\nconst randomInteger = (minimum, maximum) => Math.floor((Math.random() * (maximum - minimum + 1)) + minimum);\n\nconst createAbortError = () => {\n\tconst error = new Error('Delay aborted');\n\terror.name = 'AbortError';\n\treturn error;\n};\n\nconst clearMethods = new WeakMap();\n\nexport function createDelay({clearTimeout: defaultClear, setTimeout: defaultSet} = {}) {\n\t// We cannot use `async` here as we need the promise identity.\n\treturn (milliseconds, {value, signal} = {}) => {\n\t\t// TODO: Use `signal?.throwIfAborted()` when targeting Node.js 18.\n\t\tif (signal?.aborted) {\n\t\t\treturn Promise.reject(createAbortError());\n\t\t}\n\n\t\tlet timeoutId;\n\t\tlet settle;\n\t\tlet rejectFunction;\n\t\tconst clear = defaultClear ?? clearTimeout;\n\n\t\tconst signalListener = () => {\n\t\t\tclear(timeoutId);\n\t\t\trejectFunction(createAbortError());\n\t\t};\n\n\t\tconst cleanup = () => {\n\t\t\tif (signal) {\n\t\t\t\tsignal.removeEventListener('abort', signalListener);\n\t\t\t}\n\t\t};\n\n\t\tconst delayPromise = new Promise((resolve, reject) => {\n\t\t\tsettle = () => {\n\t\t\t\tcleanup();\n\t\t\t\tresolve(value);\n\t\t\t};\n\n\t\t\trejectFunction = reject;\n\t\t\ttimeoutId = (defaultSet ?? setTimeout)(settle, milliseconds);\n\t\t});\n\n\t\tif (signal) {\n\t\t\tsignal.addEventListener('abort', signalListener, {once: true});\n\t\t}\n\n\t\tclearMethods.set(delayPromise, () => {\n\t\t\tclear(timeoutId);\n\t\t\ttimeoutId = null;\n\t\t\tsettle();\n\t\t});\n\n\t\treturn delayPromise;\n\t};\n}\n\nconst delay = createDelay();\n\nexport default delay;\n\nexport async function rangeDelay(minimum, maximum, options = {}) {\n\treturn delay(randomInteger(minimum, maximum), options);\n}\n\nexport function clearDelay(promise) {\n\tclearMethods.get(promise)?.();\n}\n","import { CodeError } from '@libp2p/interface';\nimport delay from 'delay';\nexport class RateLimiter {\n memoryStorage;\n points;\n duration;\n blockDuration;\n execEvenly;\n execEvenlyMinDelayMs;\n keyPrefix;\n constructor(opts = {}) {\n this.points = opts.points ?? 4;\n this.duration = opts.duration ?? 1;\n this.blockDuration = opts.blockDuration ?? 0;\n this.execEvenly = opts.execEvenly ?? false;\n this.execEvenlyMinDelayMs = opts.execEvenlyMinDelayMs ?? (this.duration * 1000 / this.points);\n this.keyPrefix = opts.keyPrefix ?? 'rlflx';\n this.memoryStorage = new MemoryStorage();\n }\n async consume(key, pointsToConsume = 1, options = {}) {\n const rlKey = this.getKey(key);\n const secDuration = this._getKeySecDuration(options);\n let res = this.memoryStorage.incrby(rlKey, pointsToConsume, secDuration);\n res.remainingPoints = Math.max(this.points - res.consumedPoints, 0);\n if (res.consumedPoints > this.points) {\n // Block only first time when consumed more than points\n if (this.blockDuration > 0 && res.consumedPoints <= (this.points + pointsToConsume)) {\n // Block key\n res = this.memoryStorage.set(rlKey, res.consumedPoints, this.blockDuration);\n }\n throw new CodeError('Rate limit exceeded', 'ERR_RATE_LIMIT_EXCEEDED', res);\n }\n else if (this.execEvenly && res.msBeforeNext > 0 && !res.isFirstInDuration) {\n // Execute evenly\n let delayMs = Math.ceil(res.msBeforeNext / (res.remainingPoints + 2));\n if (delayMs < this.execEvenlyMinDelayMs) {\n delayMs = res.consumedPoints * this.execEvenlyMinDelayMs;\n }\n await delay(delayMs);\n }\n return res;\n }\n penalty(key, points = 1, options = {}) {\n const rlKey = this.getKey(key);\n const secDuration = this._getKeySecDuration(options);\n const res = this.memoryStorage.incrby(rlKey, points, secDuration);\n res.remainingPoints = Math.max(this.points - res.consumedPoints, 0);\n return res;\n }\n reward(key, points = 1, options = {}) {\n const rlKey = this.getKey(key);\n const secDuration = this._getKeySecDuration(options);\n const res = this.memoryStorage.incrby(rlKey, -points, secDuration);\n res.remainingPoints = Math.max(this.points - res.consumedPoints, 0);\n return res;\n }\n /**\n * Block any key for secDuration seconds\n *\n * @param key\n * @param secDuration\n */\n block(key, secDuration) {\n const msDuration = secDuration * 1000;\n const initPoints = this.points + 1;\n this.memoryStorage.set(this.getKey(key), initPoints, secDuration);\n return {\n remainingPoints: 0,\n msBeforeNext: msDuration === 0 ? -1 : msDuration,\n consumedPoints: initPoints,\n isFirstInDuration: false\n };\n }\n set(key, points, secDuration = 0) {\n const msDuration = (secDuration >= 0 ? secDuration : this.duration) * 1000;\n this.memoryStorage.set(this.getKey(key), points, secDuration);\n return {\n remainingPoints: 0,\n msBeforeNext: msDuration === 0 ? -1 : msDuration,\n consumedPoints: points,\n isFirstInDuration: false\n };\n }\n get(key) {\n const res = this.memoryStorage.get(this.getKey(key));\n if (res != null) {\n res.remainingPoints = Math.max(this.points - res.consumedPoints, 0);\n }\n return res;\n }\n delete(key) {\n this.memoryStorage.delete(this.getKey(key));\n }\n _getKeySecDuration(options) {\n if (options?.customDuration != null && options.customDuration >= 0) {\n return options.customDuration;\n }\n return this.duration;\n }\n getKey(key) {\n return this.keyPrefix.length > 0 ? `${this.keyPrefix}:${key}` : key;\n }\n parseKey(rlKey) {\n return rlKey.substring(this.keyPrefix.length);\n }\n}\nclass MemoryStorage {\n storage;\n constructor() {\n this.storage = new Map();\n }\n incrby(key, value, durationSec) {\n const existing = this.storage.get(key);\n if (existing != null) {\n const msBeforeExpires = existing.expiresAt != null\n ? existing.expiresAt.getTime() - new Date().getTime()\n : -1;\n if (existing.expiresAt == null || msBeforeExpires > 0) {\n // Change value\n existing.value += value;\n return {\n remainingPoints: 0,\n msBeforeNext: msBeforeExpires,\n consumedPoints: existing.value,\n isFirstInDuration: false\n };\n }\n return this.set(key, value, durationSec);\n }\n return this.set(key, value, durationSec);\n }\n set(key, value, durationSec) {\n const durationMs = durationSec * 1000;\n const existing = this.storage.get(key);\n if (existing != null) {\n clearTimeout(existing.timeoutId);\n }\n const record = {\n value,\n expiresAt: durationMs > 0 ? new Date(Date.now() + durationMs) : undefined\n };\n this.storage.set(key, record);\n if (durationMs > 0) {\n record.timeoutId = setTimeout(() => {\n this.storage.delete(key);\n }, durationMs);\n if (record.timeoutId.unref != null) {\n record.timeoutId.unref();\n }\n }\n return {\n remainingPoints: 0,\n msBeforeNext: durationMs === 0 ? -1 : durationMs,\n consumedPoints: record.value,\n isFirstInDuration: true\n };\n }\n get(key) {\n const existing = this.storage.get(key);\n if (existing != null) {\n const msBeforeExpires = existing.expiresAt != null\n ? existing.expiresAt.getTime() - new Date().getTime()\n : -1;\n return {\n remainingPoints: 0,\n msBeforeNext: msBeforeExpires,\n consumedPoints: existing.value,\n isFirstInDuration: false\n };\n }\n }\n delete(key) {\n const record = this.storage.get(key);\n if (record != null) {\n if (record.timeoutId != null) {\n clearTimeout(record.timeoutId);\n }\n this.storage.delete(key);\n return true;\n }\n return false;\n }\n}\n//# sourceMappingURL=rate-limiter.js.map","export var MessageTypes;\n(function (MessageTypes) {\n MessageTypes[MessageTypes[\"NEW_STREAM\"] = 0] = \"NEW_STREAM\";\n MessageTypes[MessageTypes[\"MESSAGE_RECEIVER\"] = 1] = \"MESSAGE_RECEIVER\";\n MessageTypes[MessageTypes[\"MESSAGE_INITIATOR\"] = 2] = \"MESSAGE_INITIATOR\";\n MessageTypes[MessageTypes[\"CLOSE_RECEIVER\"] = 3] = \"CLOSE_RECEIVER\";\n MessageTypes[MessageTypes[\"CLOSE_INITIATOR\"] = 4] = \"CLOSE_INITIATOR\";\n MessageTypes[MessageTypes[\"RESET_RECEIVER\"] = 5] = \"RESET_RECEIVER\";\n MessageTypes[MessageTypes[\"RESET_INITIATOR\"] = 6] = \"RESET_INITIATOR\";\n})(MessageTypes || (MessageTypes = {}));\nexport const MessageTypeNames = Object.freeze({\n 0: 'NEW_STREAM',\n 1: 'MESSAGE_RECEIVER',\n 2: 'MESSAGE_INITIATOR',\n 3: 'CLOSE_RECEIVER',\n 4: 'CLOSE_INITIATOR',\n 5: 'RESET_RECEIVER',\n 6: 'RESET_INITIATOR'\n});\nexport const InitiatorMessageTypes = Object.freeze({\n NEW_STREAM: MessageTypes.NEW_STREAM,\n MESSAGE: MessageTypes.MESSAGE_INITIATOR,\n CLOSE: MessageTypes.CLOSE_INITIATOR,\n RESET: MessageTypes.RESET_INITIATOR\n});\nexport const ReceiverMessageTypes = Object.freeze({\n MESSAGE: MessageTypes.MESSAGE_RECEIVER,\n CLOSE: MessageTypes.CLOSE_RECEIVER,\n RESET: MessageTypes.RESET_RECEIVER\n});\n//# sourceMappingURL=message-types.js.map","import { Uint8ArrayList } from 'uint8arraylist';\nimport { MessageTypeNames, MessageTypes } from './message-types.js';\nexport const MAX_MSG_SIZE = 1 << 20; // 1MB\nexport const MAX_MSG_QUEUE_SIZE = 4 << 20; // 4MB\nexport class Decoder {\n _buffer;\n _headerInfo;\n _maxMessageSize;\n _maxUnprocessedMessageQueueSize;\n constructor(maxMessageSize = MAX_MSG_SIZE, maxUnprocessedMessageQueueSize = MAX_MSG_QUEUE_SIZE) {\n this._buffer = new Uint8ArrayList();\n this._headerInfo = null;\n this._maxMessageSize = maxMessageSize;\n this._maxUnprocessedMessageQueueSize = maxUnprocessedMessageQueueSize;\n }\n write(chunk) {\n if (chunk == null || chunk.length === 0) {\n return [];\n }\n this._buffer.append(chunk);\n if (this._buffer.byteLength > this._maxUnprocessedMessageQueueSize) {\n throw Object.assign(new Error('unprocessed message queue size too large!'), { code: 'ERR_MSG_QUEUE_TOO_BIG' });\n }\n const msgs = [];\n while (this._buffer.length !== 0) {\n if (this._headerInfo == null) {\n try {\n this._headerInfo = this._decodeHeader(this._buffer);\n }\n catch (err) {\n if (err.code === 'ERR_MSG_TOO_BIG') {\n throw err;\n }\n break; // We haven't received enough data yet\n }\n }\n const { id, type, length, offset } = this._headerInfo;\n const bufferedDataLength = this._buffer.length - offset;\n if (bufferedDataLength < length) {\n break; // not enough data yet\n }\n const msg = {\n id,\n type\n };\n if (type === MessageTypes.NEW_STREAM || type === MessageTypes.MESSAGE_INITIATOR || type === MessageTypes.MESSAGE_RECEIVER) {\n msg.data = this._buffer.sublist(offset, offset + length);\n }\n msgs.push(msg);\n this._buffer.consume(offset + length);\n this._headerInfo = null;\n }\n return msgs;\n }\n /**\n * Attempts to decode the message header from the buffer\n */\n _decodeHeader(data) {\n const { value: h, offset } = readVarInt(data);\n const { value: length, offset: end } = readVarInt(data, offset);\n const type = h & 7;\n // @ts-expect-error h is a number not a CODE\n if (MessageTypeNames[type] == null) {\n throw new Error(`Invalid type received: ${type}`);\n }\n // test message type varint + data length\n if (length > this._maxMessageSize) {\n throw Object.assign(new Error('message size too large!'), { code: 'ERR_MSG_TOO_BIG' });\n }\n // @ts-expect-error h is a number not a CODE\n return { id: h >> 3, type, offset: offset + end, length };\n }\n}\nconst MSB = 0x80;\nconst REST = 0x7F;\nfunction readVarInt(buf, offset = 0) {\n let res = 0;\n let shift = 0;\n let counter = offset;\n let b;\n const l = buf.length;\n do {\n if (counter >= l || shift > 49) {\n offset = 0;\n throw new RangeError('Could not decode varint');\n }\n b = buf.get(counter++);\n res += shift < 28\n ? (b & REST) << shift\n : (b & REST) * Math.pow(2, shift);\n shift += 7;\n } while (b >= MSB);\n offset = counter - offset;\n return {\n value: res,\n offset\n };\n}\n//# sourceMappingURL=decode.js.map","import * as varint from 'uint8-varint';\nimport { Uint8ArrayList } from 'uint8arraylist';\nimport { allocUnsafe } from 'uint8arrays/alloc';\nimport { MessageTypes } from './message-types.js';\nconst POOL_SIZE = 10 * 1024;\nclass Encoder {\n _pool;\n _poolOffset;\n constructor() {\n this._pool = allocUnsafe(POOL_SIZE);\n this._poolOffset = 0;\n }\n /**\n * Encodes the given message and adds it to the passed list\n */\n write(msg, list) {\n const pool = this._pool;\n let offset = this._poolOffset;\n varint.encode(msg.id << 3 | msg.type, pool, offset);\n offset += varint.encodingLength(msg.id << 3 | msg.type);\n if ((msg.type === MessageTypes.NEW_STREAM || msg.type === MessageTypes.MESSAGE_INITIATOR || msg.type === MessageTypes.MESSAGE_RECEIVER) && msg.data != null) {\n varint.encode(msg.data.length, pool, offset);\n offset += varint.encodingLength(msg.data.length);\n }\n else {\n varint.encode(0, pool, offset);\n offset += varint.encodingLength(0);\n }\n const header = pool.subarray(this._poolOffset, offset);\n if (POOL_SIZE - offset < 100) {\n this._pool = allocUnsafe(POOL_SIZE);\n this._poolOffset = 0;\n }\n else {\n this._poolOffset = offset;\n }\n list.append(header);\n if ((msg.type === MessageTypes.NEW_STREAM || msg.type === MessageTypes.MESSAGE_INITIATOR || msg.type === MessageTypes.MESSAGE_RECEIVER) && msg.data != null) {\n list.append(msg.data);\n }\n }\n}\nconst encoder = new Encoder();\n/**\n * Encode and yield one or more messages\n */\nexport async function* encode(source) {\n for await (const message of source) {\n const list = new Uint8ArrayList();\n encoder.write(message, list);\n yield list;\n }\n}\n//# sourceMappingURL=encode.js.map","import { CodeError } from '@libp2p/interface';\nimport { pushable } from 'it-pushable';\nimport defer, {} from 'p-defer';\nimport pDefer from 'p-defer';\nimport { raceSignal } from 'race-signal';\nimport { Uint8ArrayList } from 'uint8arraylist';\nimport { closeSource } from './close-source.js';\nconst ERR_STREAM_RESET = 'ERR_STREAM_RESET';\nconst ERR_SINK_INVALID_STATE = 'ERR_SINK_INVALID_STATE';\nconst DEFAULT_SEND_CLOSE_WRITE_TIMEOUT = 5000;\nfunction isPromise(thing) {\n if (thing == null) {\n return false;\n }\n return typeof thing.then === 'function' &&\n typeof thing.catch === 'function' &&\n typeof thing.finally === 'function';\n}\nexport class AbstractStream {\n id;\n direction;\n timeline;\n protocol;\n metadata;\n source;\n status;\n readStatus;\n writeStatus;\n log;\n sinkController;\n sinkEnd;\n closed;\n endErr;\n streamSource;\n onEnd;\n onCloseRead;\n onCloseWrite;\n onReset;\n onAbort;\n sendCloseWriteTimeout;\n sendingData;\n constructor(init) {\n this.sinkController = new AbortController();\n this.sinkEnd = defer();\n this.closed = defer();\n this.log = init.log;\n // stream status\n this.status = 'open';\n this.readStatus = 'ready';\n this.writeStatus = 'ready';\n this.id = init.id;\n this.metadata = init.metadata ?? {};\n this.direction = init.direction;\n this.timeline = {\n open: Date.now()\n };\n this.sendCloseWriteTimeout = init.sendCloseWriteTimeout ?? DEFAULT_SEND_CLOSE_WRITE_TIMEOUT;\n this.onEnd = init.onEnd;\n this.onCloseRead = init?.onCloseRead;\n this.onCloseWrite = init?.onCloseWrite;\n this.onReset = init?.onReset;\n this.onAbort = init?.onAbort;\n this.source = this.streamSource = pushable({\n onEnd: (err) => {\n if (err != null) {\n this.log.trace('source ended with error', err);\n }\n else {\n this.log.trace('source ended');\n }\n this.onSourceEnd(err);\n }\n });\n // necessary because the libp2p upgrader wraps the sink function\n this.sink = this.sink.bind(this);\n }\n async sink(source) {\n if (this.writeStatus !== 'ready') {\n throw new CodeError(`writable end state is \"${this.writeStatus}\" not \"ready\"`, ERR_SINK_INVALID_STATE);\n }\n try {\n this.writeStatus = 'writing';\n const options = {\n signal: this.sinkController.signal\n };\n if (this.direction === 'outbound') { // If initiator, open a new stream\n const res = this.sendNewStream(options);\n if (isPromise(res)) {\n await res;\n }\n }\n const abortListener = () => {\n closeSource(source, this.log);\n };\n try {\n this.sinkController.signal.addEventListener('abort', abortListener);\n this.log.trace('sink reading from source');\n for await (let data of source) {\n data = data instanceof Uint8Array ? new Uint8ArrayList(data) : data;\n const res = this.sendData(data, options);\n if (isPromise(res)) {\n this.sendingData = pDefer();\n await res;\n this.sendingData.resolve();\n this.sendingData = undefined;\n }\n }\n }\n finally {\n this.sinkController.signal.removeEventListener('abort', abortListener);\n }\n this.log.trace('sink finished reading from source, write status is \"%s\"', this.writeStatus);\n if (this.writeStatus === 'writing') {\n this.writeStatus = 'closing';\n this.log.trace('send close write to remote');\n await this.sendCloseWrite({\n signal: AbortSignal.timeout(this.sendCloseWriteTimeout)\n });\n this.writeStatus = 'closed';\n }\n this.onSinkEnd();\n }\n catch (err) {\n this.log.trace('sink ended with error, calling abort with error', err);\n this.abort(err);\n throw err;\n }\n finally {\n this.log.trace('resolve sink end');\n this.sinkEnd.resolve();\n }\n }\n onSourceEnd(err) {\n if (this.timeline.closeRead != null) {\n return;\n }\n this.timeline.closeRead = Date.now();\n this.readStatus = 'closed';\n if (err != null && this.endErr == null) {\n this.endErr = err;\n }\n this.onCloseRead?.();\n if (this.timeline.closeWrite != null) {\n this.log.trace('source and sink ended');\n this.timeline.close = Date.now();\n if (this.status !== 'aborted' && this.status !== 'reset') {\n this.status = 'closed';\n }\n if (this.onEnd != null) {\n this.onEnd(this.endErr);\n }\n this.closed.resolve();\n }\n else {\n this.log.trace('source ended, waiting for sink to end');\n }\n }\n onSinkEnd(err) {\n if (this.timeline.closeWrite != null) {\n return;\n }\n this.timeline.closeWrite = Date.now();\n this.writeStatus = 'closed';\n if (err != null && this.endErr == null) {\n this.endErr = err;\n }\n this.onCloseWrite?.();\n if (this.timeline.closeRead != null) {\n this.log.trace('sink and source ended');\n this.timeline.close = Date.now();\n if (this.status !== 'aborted' && this.status !== 'reset') {\n this.status = 'closed';\n }\n if (this.onEnd != null) {\n this.onEnd(this.endErr);\n }\n this.closed.resolve();\n }\n else {\n this.log.trace('sink ended, waiting for source to end');\n }\n }\n // Close for both Reading and Writing\n async close(options) {\n this.log.trace('closing gracefully');\n this.status = 'closing';\n // wait for read and write ends to close\n await raceSignal(Promise.all([\n this.closeWrite(options),\n this.closeRead(options),\n this.closed.promise\n ]), options?.signal);\n this.status = 'closed';\n this.log.trace('closed gracefully');\n }\n async closeRead(options = {}) {\n if (this.readStatus === 'closing' || this.readStatus === 'closed') {\n return;\n }\n this.log.trace('closing readable end of stream with starting read status \"%s\"', this.readStatus);\n const readStatus = this.readStatus;\n this.readStatus = 'closing';\n if (this.status !== 'reset' && this.status !== 'aborted' && this.timeline.closeRead == null) {\n this.log.trace('send close read to remote');\n await this.sendCloseRead(options);\n }\n if (readStatus === 'ready') {\n this.log.trace('ending internal source queue with %d queued bytes', this.streamSource.readableLength);\n this.streamSource.end();\n }\n this.log.trace('closed readable end of stream');\n }\n async closeWrite(options = {}) {\n if (this.writeStatus === 'closing' || this.writeStatus === 'closed') {\n return;\n }\n this.log.trace('closing writable end of stream with starting write status \"%s\"', this.writeStatus);\n if (this.writeStatus === 'ready') {\n this.log.trace('sink was never sunk, sink an empty array');\n await raceSignal(this.sink([]), options.signal);\n }\n if (this.writeStatus === 'writing') {\n // try to let sending outgoing data succeed\n if (this.sendingData != null) {\n await raceSignal(this.sendingData.promise, options.signal);\n }\n // stop reading from the source passed to `.sink`\n this.log.trace('aborting source passed to .sink');\n this.sinkController.abort();\n await raceSignal(this.sinkEnd.promise, options.signal);\n }\n this.writeStatus = 'closed';\n this.log.trace('closed writable end of stream');\n }\n /**\n * Close immediately for reading and writing and send a reset message (local\n * error)\n */\n abort(err) {\n if (this.status === 'closed' || this.status === 'aborted' || this.status === 'reset') {\n return;\n }\n this.log('abort with error', err);\n // try to send a reset message\n this.log('try to send reset to remote');\n const res = this.sendReset();\n if (isPromise(res)) {\n res.catch((err) => {\n this.log.error('error sending reset message', err);\n });\n }\n this.status = 'aborted';\n this.timeline.abort = Date.now();\n this._closeSinkAndSource(err);\n this.onAbort?.(err);\n }\n /**\n * Receive a reset message - close immediately for reading and writing (remote\n * error)\n */\n reset() {\n if (this.status === 'closed' || this.status === 'aborted' || this.status === 'reset') {\n return;\n }\n const err = new CodeError('stream reset', ERR_STREAM_RESET);\n this.status = 'reset';\n this.timeline.reset = Date.now();\n this._closeSinkAndSource(err);\n this.onReset?.();\n }\n _closeSinkAndSource(err) {\n this._closeSink(err);\n this._closeSource(err);\n }\n _closeSink(err) {\n // if the sink function is running, cause it to end\n if (this.writeStatus === 'writing') {\n this.log.trace('end sink source');\n this.sinkController.abort();\n }\n this.onSinkEnd(err);\n }\n _closeSource(err) {\n // if the source is not ending, end it\n if (this.readStatus !== 'closing' && this.readStatus !== 'closed') {\n this.log.trace('ending source with %d bytes to be read by consumer', this.streamSource.readableLength);\n this.readStatus = 'closing';\n this.streamSource.end(err);\n }\n }\n /**\n * The remote closed for writing so we should expect to receive no more\n * messages\n */\n remoteCloseWrite() {\n if (this.readStatus === 'closing' || this.readStatus === 'closed') {\n this.log('received remote close write but local source is already closed');\n return;\n }\n this.log.trace('remote close write');\n this._closeSource();\n }\n /**\n * The remote closed for reading so we should not send any more\n * messages\n */\n remoteCloseRead() {\n if (this.writeStatus === 'closing' || this.writeStatus === 'closed') {\n this.log('received remote close read but local sink is already closed');\n return;\n }\n this.log.trace('remote close read');\n this._closeSink();\n }\n /**\n * The underlying muxer has closed, no more messages can be sent or will\n * be received, close immediately to free up resources\n */\n destroy() {\n if (this.status === 'closed' || this.status === 'aborted' || this.status === 'reset') {\n this.log('received destroy but we are already closed');\n return;\n }\n this.log.trace('stream destroyed');\n this._closeSinkAndSource();\n }\n /**\n * When an extending class reads data from it's implementation-specific source,\n * call this method to allow the stream consumer to read the data.\n */\n sourcePush(data) {\n this.streamSource.push(data);\n }\n /**\n * Returns the amount of unread data - can be used to prevent large amounts of\n * data building up when the stream consumer is too slow.\n */\n sourceReadableLength() {\n return this.streamSource.readableLength;\n }\n}\n//# sourceMappingURL=abstract-stream.js.map","import { AbstractStream } from '@libp2p/utils/abstract-stream';\nimport { Uint8ArrayList } from 'uint8arraylist';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport { MAX_MSG_SIZE } from './decode.js';\nimport { InitiatorMessageTypes, ReceiverMessageTypes } from './message-types.js';\nexport class MplexStream extends AbstractStream {\n name;\n streamId;\n send;\n types;\n maxDataSize;\n constructor(init) {\n super(init);\n this.types = init.direction === 'outbound' ? InitiatorMessageTypes : ReceiverMessageTypes;\n this.send = init.send;\n this.name = init.name;\n this.streamId = init.streamId;\n this.maxDataSize = init.maxDataSize;\n }\n async sendNewStream() {\n await this.send({ id: this.streamId, type: InitiatorMessageTypes.NEW_STREAM, data: new Uint8ArrayList(uint8ArrayFromString(this.name)) });\n }\n async sendData(data) {\n data = data.sublist();\n while (data.byteLength > 0) {\n const toSend = Math.min(data.byteLength, this.maxDataSize);\n await this.send({\n id: this.streamId,\n type: this.types.MESSAGE,\n data: data.sublist(0, toSend)\n });\n data.consume(toSend);\n }\n }\n async sendReset() {\n await this.send({ id: this.streamId, type: this.types.RESET });\n }\n async sendCloseWrite() {\n await this.send({ id: this.streamId, type: this.types.CLOSE });\n }\n async sendCloseRead() {\n // mplex does not support close read, only close write\n }\n}\nexport function createStream(options) {\n const { id, name, send, onEnd, type = 'initiator', maxMsgSize = MAX_MSG_SIZE } = options;\n return new MplexStream({\n id: type === 'initiator' ? (`i${id}`) : `r${id}`,\n streamId: id,\n name: `${name ?? id}`,\n direction: type === 'initiator' ? 'outbound' : 'inbound',\n maxDataSize: maxMsgSize,\n onEnd,\n send,\n log: options.logger.forComponent(`libp2p:mplex:stream:${type}:${id}`)\n });\n}\n//# sourceMappingURL=stream.js.map","import { CodeError } from '@libp2p/interface';\nimport { closeSource } from '@libp2p/utils/close-source';\nimport { RateLimiter } from '@libp2p/utils/rate-limiter';\nimport { pipe } from 'it-pipe';\nimport { pushable } from 'it-pushable';\nimport { toString as uint8ArrayToString } from 'uint8arrays';\nimport { Decoder } from './decode.js';\nimport { encode } from './encode.js';\nimport { MessageTypes, MessageTypeNames } from './message-types.js';\nimport { createStream } from './stream.js';\nconst MAX_STREAMS_INBOUND_STREAMS_PER_CONNECTION = 1024;\nconst MAX_STREAMS_OUTBOUND_STREAMS_PER_CONNECTION = 1024;\nconst MAX_STREAM_BUFFER_SIZE = 1024 * 1024 * 4; // 4MB\nconst DISCONNECT_THRESHOLD = 5;\nconst CLOSE_TIMEOUT = 500;\nfunction printMessage(msg) {\n const output = {\n ...msg,\n type: `${MessageTypeNames[msg.type]} (${msg.type})`\n };\n if (msg.type === MessageTypes.NEW_STREAM) {\n output.data = uint8ArrayToString(msg.data instanceof Uint8Array ? msg.data : msg.data.subarray());\n }\n if (msg.type === MessageTypes.MESSAGE_INITIATOR || msg.type === MessageTypes.MESSAGE_RECEIVER) {\n output.data = uint8ArrayToString(msg.data instanceof Uint8Array ? msg.data : msg.data.subarray(), 'base16');\n }\n return output;\n}\nexport class MplexStreamMuxer {\n protocol = '/mplex/6.7.0';\n sink;\n source;\n log;\n _streamId;\n _streams;\n _init;\n _source;\n closeController;\n rateLimiter;\n closeTimeout;\n logger;\n constructor(components, init) {\n init = init ?? {};\n this.log = components.logger.forComponent('libp2p:mplex');\n this.logger = components.logger;\n this._streamId = 0;\n this._streams = {\n /**\n * Stream to ids map\n */\n initiators: new Map(),\n /**\n * Stream to ids map\n */\n receivers: new Map()\n };\n this._init = init;\n this.closeTimeout = init.closeTimeout ?? CLOSE_TIMEOUT;\n /**\n * An iterable sink\n */\n this.sink = this._createSink();\n /**\n * An iterable source\n */\n this._source = pushable({\n objectMode: true,\n onEnd: () => {\n // the source has ended, we can't write any more messages to gracefully\n // close streams so all we can do is destroy them\n for (const stream of this._streams.initiators.values()) {\n stream.destroy();\n }\n for (const stream of this._streams.receivers.values()) {\n stream.destroy();\n }\n }\n });\n this.source = pipe(this._source, source => encode(source));\n /**\n * Close controller\n */\n this.closeController = new AbortController();\n this.rateLimiter = new RateLimiter({\n points: init.disconnectThreshold ?? DISCONNECT_THRESHOLD,\n duration: 1\n });\n }\n /**\n * Returns a Map of streams and their ids\n */\n get streams() {\n // Inbound and Outbound streams may have the same ids, so we need to make those unique\n const streams = [];\n for (const stream of this._streams.initiators.values()) {\n streams.push(stream);\n }\n for (const stream of this._streams.receivers.values()) {\n streams.push(stream);\n }\n return streams;\n }\n /**\n * Initiate a new stream with the given name. If no name is\n * provided, the id of the stream will be used.\n */\n newStream(name) {\n if (this.closeController.signal.aborted) {\n throw new Error('Muxer already closed');\n }\n const id = this._streamId++;\n name = name == null ? id.toString() : name.toString();\n const registry = this._streams.initiators;\n return this._newStream({ id, name, type: 'initiator', registry });\n }\n /**\n * Close or abort all tracked streams and stop the muxer\n */\n async close(options) {\n if (this.closeController.signal.aborted) {\n return;\n }\n const signal = options?.signal ?? AbortSignal.timeout(this.closeTimeout);\n try {\n // try to gracefully close all streams\n await Promise.all(this.streams.map(async (s) => s.close({\n signal\n })));\n this._source.end();\n // try to gracefully close the muxer\n await this._source.onEmpty({\n signal\n });\n this.closeController.abort();\n }\n catch (err) {\n this.abort(err);\n }\n }\n abort(err) {\n if (this.closeController.signal.aborted) {\n return;\n }\n this.streams.forEach(s => { s.abort(err); });\n this.closeController.abort(err);\n }\n /**\n * Called whenever an inbound stream is created\n */\n _newReceiverStream(options) {\n const { id, name } = options;\n const registry = this._streams.receivers;\n return this._newStream({ id, name, type: 'receiver', registry });\n }\n _newStream(options) {\n const { id, name, type, registry } = options;\n this.log('new %s stream %s', type, id);\n if (type === 'initiator' && this._streams.initiators.size === (this._init.maxOutboundStreams ?? MAX_STREAMS_OUTBOUND_STREAMS_PER_CONNECTION)) {\n throw new CodeError('Too many outbound streams open', 'ERR_TOO_MANY_OUTBOUND_STREAMS');\n }\n if (registry.has(id)) {\n throw new Error(`${type} stream ${id} already exists!`);\n }\n const send = async (msg) => {\n if (this.log.enabled) {\n this.log.trace('%s stream %s send', type, id, printMessage(msg));\n }\n this._source.push(msg);\n };\n const onEnd = () => {\n this.log('%s stream with id %s and protocol %s ended', type, id, stream.protocol);\n registry.delete(id);\n if (this._init.onStreamEnd != null) {\n this._init.onStreamEnd(stream);\n }\n };\n const stream = createStream({ id, name, send, type, onEnd, maxMsgSize: this._init.maxMsgSize, logger: this.logger });\n registry.set(id, stream);\n return stream;\n }\n /**\n * Creates a sink with an abortable source. Incoming messages will\n * also have their size restricted. All messages will be varint decoded.\n */\n _createSink() {\n const sink = async (source) => {\n const abortListener = () => {\n closeSource(source, this.log);\n };\n this.closeController.signal.addEventListener('abort', abortListener);\n try {\n const decoder = new Decoder(this._init.maxMsgSize, this._init.maxUnprocessedMessageQueueSize);\n for await (const chunk of source) {\n for (const msg of decoder.write(chunk)) {\n await this._handleIncoming(msg);\n }\n }\n this._source.end();\n }\n catch (err) {\n this.log('error in sink', err);\n this._source.end(err); // End the source with an error\n }\n finally {\n this.closeController.signal.removeEventListener('abort', abortListener);\n }\n };\n return sink;\n }\n async _handleIncoming(message) {\n const { id, type } = message;\n if (this.log.enabled) {\n this.log.trace('incoming message', printMessage(message));\n }\n // Create a new stream?\n if (message.type === MessageTypes.NEW_STREAM) {\n if (this._streams.receivers.size === (this._init.maxInboundStreams ?? MAX_STREAMS_INBOUND_STREAMS_PER_CONNECTION)) {\n this.log('too many inbound streams open');\n // not going to allow this stream, send the reset message manually\n // instead of setting it up just to tear it down\n this._source.push({\n id,\n type: MessageTypes.RESET_RECEIVER\n });\n // if we've hit our stream limit, and the remote keeps trying to open\n // more new streams, if they are doing this very quickly maybe they\n // are attacking us and we should close the connection\n try {\n await this.rateLimiter.consume('new-stream', 1);\n }\n catch {\n this.log('rate limit hit when opening too many new streams over the inbound stream limit - closing remote connection');\n // since there's no backpressure in mplex, the only thing we can really do to protect ourselves is close the connection\n this.abort(new Error('Too many open streams'));\n return;\n }\n return;\n }\n const stream = this._newReceiverStream({ id, name: uint8ArrayToString(message.data instanceof Uint8Array ? message.data : message.data.subarray()) });\n if (this._init.onIncomingStream != null) {\n this._init.onIncomingStream(stream);\n }\n return;\n }\n const list = (type & 1) === 1 ? this._streams.initiators : this._streams.receivers;\n const stream = list.get(id);\n if (stream == null) {\n this.log('missing stream %s for message type %s', id, MessageTypeNames[type]);\n // if the remote keeps sending us messages for streams that have been\n // closed or were never opened they may be attacking us so if they do\n // this very quickly all we can do is close the connection\n try {\n await this.rateLimiter.consume('missing-stream', 1);\n }\n catch {\n this.log('rate limit hit when receiving messages for streams that do not exist - closing remote connection');\n // since there's no backpressure in mplex, the only thing we can really do to protect ourselves is close the connection\n this.abort(new Error('Too many messages for missing streams'));\n return;\n }\n return;\n }\n const maxBufferSize = this._init.maxStreamBufferSize ?? MAX_STREAM_BUFFER_SIZE;\n try {\n switch (type) {\n case MessageTypes.MESSAGE_INITIATOR:\n case MessageTypes.MESSAGE_RECEIVER:\n if (stream.sourceReadableLength() > maxBufferSize) {\n // Stream buffer has got too large, reset the stream\n this._source.push({\n id: message.id,\n type: type === MessageTypes.MESSAGE_INITIATOR ? MessageTypes.RESET_RECEIVER : MessageTypes.RESET_INITIATOR\n });\n // Inform the stream consumer they are not fast enough\n throw new CodeError('Input buffer full - increase Mplex maxBufferSize to accommodate slow consumers', 'ERR_STREAM_INPUT_BUFFER_FULL');\n }\n // We got data from the remote, push it into our local stream\n stream.sourcePush(message.data);\n break;\n case MessageTypes.CLOSE_INITIATOR:\n case MessageTypes.CLOSE_RECEIVER:\n // The remote has stopped writing, so we can stop reading\n stream.remoteCloseWrite();\n break;\n case MessageTypes.RESET_INITIATOR:\n case MessageTypes.RESET_RECEIVER:\n // The remote has errored, stop reading and writing to the stream immediately\n stream.reset();\n break;\n default:\n this.log('unknown message type %s', type);\n }\n }\n catch (err) {\n this.log.error('error while processing message', err);\n stream.abort(err);\n }\n }\n}\n//# sourceMappingURL=mplex.js.map","/**\n * @packageDocumentation\n *\n * This is a [simple stream multiplexer(https://docs.libp2p.io/concepts/multiplex/mplex/) that has been deprecated.\n *\n * Please use [@chainsafe/libp2p-yamux](https://www.npmjs.com/package/@chainsafe/libp2p-yamux) instead.\n *\n * @example\n *\n * ```TypeScript\n * import { mplex } from '@libp2p/mplex'\n * import { pipe } from 'it-pipe'\n *\n * const factory = mplex()\n *\n * const muxer = factory.createStreamMuxer(components, {\n * onStream: stream => { // Receive a duplex stream from the remote\n * // ...receive data from the remote and optionally send data back\n * },\n * onStreamEnd: stream => {\n * // ...handle any tracking you may need of stream closures\n * }\n * })\n *\n * pipe(conn, muxer, conn) // conn is duplex connection to another peer\n *\n * const stream = muxer.newStream() // Create a new duplex stream to the remote\n *\n * // Use the duplex stream to send some data to the remote...\n * pipe([1, 2, 3], stream)\n * ```\n */\nimport { serviceCapabilities } from '@libp2p/interface';\nimport { MplexStreamMuxer } from './mplex.js';\nclass Mplex {\n protocol = '/mplex/6.7.0';\n _init;\n components;\n constructor(components, init = {}) {\n this.components = components;\n this._init = init;\n }\n [Symbol.toStringTag] = '@libp2p/mplex';\n [serviceCapabilities] = [\n '@libp2p/stream-multiplexing'\n ];\n createStreamMuxer(init = {}) {\n return new MplexStreamMuxer(this.components, {\n ...init,\n ...this._init\n });\n }\n}\nexport function mplex(init = {}) {\n return (components) => new Mplex(components, init);\n}\n//# sourceMappingURL=index.js.map","/**\n * @packageDocumentation\n *\n * Return the first value in an (async)iterable\n *\n * @example\n *\n * ```javascript\n * import first from 'it-first'\n *\n * // This can also be an iterator, generator, etc\n * const values = [0, 1, 2, 3, 4]\n *\n * const res = first(values)\n *\n * console.info(res) // 0\n * ```\n *\n * Async sources must be awaited:\n *\n * ```javascript\n * import first from 'it-first'\n *\n * const values = async function * () {\n * yield * [0, 1, 2, 3, 4]\n * }\n *\n * const res = await first(values())\n *\n * console.info(res) // 0\n * ```\n */\nfunction isAsyncIterable(thing) {\n return thing[Symbol.asyncIterator] != null;\n}\nfunction first(source) {\n if (isAsyncIterable(source)) {\n return (async () => {\n for await (const entry of source) { // eslint-disable-line no-unreachable-loop\n return entry;\n }\n return undefined;\n })();\n }\n for (const entry of source) { // eslint-disable-line no-unreachable-loop\n return entry;\n }\n return undefined;\n}\nexport default first;\n//# sourceMappingURL=index.js.map","export const PING_PROTOCOL = '/ipfs/ping/1.0.0';\nexport const PING_LENGTH = 32;\nexport const PROTOCOL_VERSION = '1.0.0';\nexport const PROTOCOL_NAME = 'ping';\nexport const PROTOCOL_PREFIX = 'ipfs';\nexport const TIMEOUT = 10000;\n// See https://github.com/libp2p/specs/blob/d4b5fb0152a6bb86cfd9ea/ping/ping.md?plain=1#L38-L43\n// The dialing peer MUST NOT keep more than one outbound stream for the ping protocol per peer.\n// The listening peer SHOULD accept at most two streams per peer since cross-stream behavior is\n// non-linear and stream writes occur asynchronously. The listening peer may perceive the\n// dialing peer closing and opening the wrong streams (for instance, closing stream B and\n// opening stream A even though the dialing peer is opening stream B and closing stream A).\nexport const MAX_INBOUND_STREAMS = 2;\nexport const MAX_OUTBOUND_STREAMS = 1;\nexport const ERR_WRONG_PING_ACK = 'ERR_WRONG_PING_ACK';\n//# sourceMappingURL=constants.js.map","import { randomBytes } from '@libp2p/crypto';\nimport { CodeError, ERR_INVALID_MESSAGE, ERR_TIMEOUT } from '@libp2p/interface';\nimport first from 'it-first';\nimport { pipe } from 'it-pipe';\nimport { equals as uint8ArrayEquals } from 'uint8arrays/equals';\nimport { PROTOCOL_PREFIX, PROTOCOL_NAME, PING_LENGTH, PROTOCOL_VERSION, TIMEOUT, MAX_INBOUND_STREAMS, MAX_OUTBOUND_STREAMS, ERR_WRONG_PING_ACK } from './constants.js';\nexport class PingService {\n protocol;\n components;\n started;\n timeout;\n maxInboundStreams;\n maxOutboundStreams;\n runOnTransientConnection;\n log;\n constructor(components, init = {}) {\n this.components = components;\n this.log = components.logger.forComponent('libp2p:ping');\n this.started = false;\n this.protocol = `/${init.protocolPrefix ?? PROTOCOL_PREFIX}/${PROTOCOL_NAME}/${PROTOCOL_VERSION}`;\n this.timeout = init.timeout ?? TIMEOUT;\n this.maxInboundStreams = init.maxInboundStreams ?? MAX_INBOUND_STREAMS;\n this.maxOutboundStreams = init.maxOutboundStreams ?? MAX_OUTBOUND_STREAMS;\n this.runOnTransientConnection = init.runOnTransientConnection ?? true;\n this.handleMessage = this.handleMessage.bind(this);\n }\n [Symbol.toStringTag] = '@libp2p/ping';\n async start() {\n await this.components.registrar.handle(this.protocol, this.handleMessage, {\n maxInboundStreams: this.maxInboundStreams,\n maxOutboundStreams: this.maxOutboundStreams,\n runOnTransientConnection: this.runOnTransientConnection\n });\n this.started = true;\n }\n async stop() {\n await this.components.registrar.unhandle(this.protocol);\n this.started = false;\n }\n isStarted() {\n return this.started;\n }\n /**\n * A handler to register with Libp2p to process ping messages\n */\n handleMessage(data) {\n this.log('incoming ping from %p', data.connection.remotePeer);\n const { stream } = data;\n const start = Date.now();\n const signal = AbortSignal.timeout(this.timeout);\n signal.addEventListener('abort', () => {\n stream?.abort(new CodeError('ping timeout', ERR_TIMEOUT));\n });\n void pipe(stream, async function* (source) {\n let received = 0;\n for await (const buf of source) {\n received += buf.byteLength;\n if (received > PING_LENGTH) {\n stream?.abort(new CodeError('Too much data received', ERR_INVALID_MESSAGE));\n return;\n }\n yield buf;\n }\n }, stream)\n .catch(err => {\n this.log.error('incoming ping from %p failed with error', data.connection.remotePeer, err);\n stream?.abort(err);\n })\n .finally(() => {\n const ms = Date.now() - start;\n this.log('incoming ping from %p complete in %dms', data.connection.remotePeer, ms);\n });\n }\n /**\n * Ping a given peer and wait for its response, getting the operation latency.\n */\n async ping(peer, options = {}) {\n this.log('pinging %p', peer);\n const start = Date.now();\n const data = randomBytes(PING_LENGTH);\n const connection = await this.components.connectionManager.openConnection(peer, options);\n let stream;\n let onAbort = () => { };\n if (options.signal == null) {\n const signal = AbortSignal.timeout(this.timeout);\n options = {\n ...options,\n signal\n };\n }\n try {\n stream = await connection.newStream(this.protocol, {\n ...options,\n runOnTransientConnection: this.runOnTransientConnection\n });\n onAbort = () => {\n stream?.abort(new CodeError('ping timeout', ERR_TIMEOUT));\n };\n // make stream abortable\n options.signal?.addEventListener('abort', onAbort, { once: true });\n const result = await pipe([data], stream, async (source) => first(source));\n const ms = Date.now() - start;\n if (result == null) {\n throw new CodeError(`Did not receive a ping ack after ${ms}ms`, ERR_WRONG_PING_ACK);\n }\n if (!uint8ArrayEquals(data, result.subarray())) {\n throw new CodeError(`Received wrong ping ack after ${ms}ms`, ERR_WRONG_PING_ACK);\n }\n this.log('ping %p complete in %dms', connection.remotePeer, ms);\n return ms;\n }\n catch (err) {\n this.log.error('error while pinging %p', connection.remotePeer, err);\n stream?.abort(err);\n throw err;\n }\n finally {\n options.signal?.removeEventListener('abort', onAbort);\n if (stream != null) {\n await stream.close();\n }\n }\n }\n}\n//# sourceMappingURL=ping.js.map","/**\n * @packageDocumentation\n *\n * The ping service implements the [libp2p ping spec](https://github.com/libp2p/specs/blob/master/ping/ping.md) allowing you to make a latency measurement to a remote peer.\n *\n * @example\n *\n * ```typescript\n * import { createLibp2p } from 'libp2p'\n * import { ping } from '@libp2p/ping'\n * import { multiaddr } from '@multiformats/multiaddr'\n *\n * const node = await createLibp2p({\n * services: {\n * ping: ping()\n * }\n * })\n *\n * const rtt = await node.services.ping.ping(multiaddr('/ip4/...'))\n *\n * console.info(rtt)\n * ```\n */\nimport { PingService as PingServiceClass } from './ping.js';\nexport function ping(init = {}) {\n return (components) => new PingServiceClass(components, init);\n}\nexport { PING_PROTOCOL } from './constants.js';\n//# sourceMappingURL=index.js.map","export const transportSymbol = Symbol.for('@libp2p/transport');\nexport function isTransport(other) {\n return other != null && Boolean(other[transportSymbol]);\n}\n/**\n * Enum Transport Manager Fault Tolerance values\n */\nexport var FaultTolerance;\n(function (FaultTolerance) {\n /**\n * should be used for failing in any listen circumstance\n */\n FaultTolerance[FaultTolerance[\"FATAL_ALL\"] = 0] = \"FATAL_ALL\";\n /**\n * should be used for not failing when not listening\n */\n FaultTolerance[FaultTolerance[\"NO_FATAL\"] = 1] = \"NO_FATAL\";\n})(FaultTolerance || (FaultTolerance = {}));\n//# sourceMappingURL=index.js.map","/**\n * @packageDocumentation\n *\n * This module allows easy conversion of Multiaddrs to string URIs.\n *\n * @example Converting multiaddrs to string URIs\n *\n * ```js\n * import { multiaddrToUri } from '@multiformats/multiaddr-to-uri'\n *\n * console.log(multiaddrToUri('/dnsaddr/protocol.ai/https'))\n * // -> https://protocol.ai\n *\n * console.log(multiaddrToUri('/ip4/127.0.0.1/tcp/8080'))\n * // -> http://127.0.0.1:8080\n *\n * console.log(multiaddrToUri('/ip4/127.0.0.1/tcp/8080', { assumeHttp: false }))\n * // -> tcp://127.0.0.1:8080\n * ```\n *\n * Note:\n *\n * - When `/tcp` is the last (terminating) protocol HTTP is assumed by default (implicit `assumeHttp: true`)\n * - this means produced URIs will start with `http://` instead of `tcp://`\n * - passing `{ assumeHttp: false }` disables this behavior\n * - Might be lossy - e.g. a DNSv6 multiaddr\n * - Can throw if the passed multiaddr:\n * - is not a valid multiaddr\n * - is not supported as a URI e.g. circuit\n */\nimport { multiaddr, protocols } from '@multiformats/multiaddr';\nconst ASSUME_HTTP_CODES = [\n protocols('tcp').code,\n protocols('dns').code,\n protocols('dnsaddr').code,\n protocols('dns4').code,\n protocols('dns6').code\n];\nfunction extractSNI(ma) {\n let sniProtoCode;\n try {\n sniProtoCode = protocols('sni').code;\n }\n catch (e) {\n // No SNI protocol in multiaddr\n return null;\n }\n for (const [proto, value] of ma) {\n if (proto === sniProtoCode && value !== undefined) {\n return value;\n }\n }\n return null;\n}\nfunction hasTLS(ma) {\n return ma.some(([proto, _]) => proto === protocols('tls').code);\n}\nfunction interpretNext(headProtoCode, headProtoVal, restMa) {\n const interpreter = interpreters[protocols(headProtoCode).name];\n if (interpreter === undefined) {\n throw new Error(`Can't interpret protocol ${protocols(headProtoCode).name}`);\n }\n const restVal = interpreter(headProtoVal, restMa);\n if (headProtoCode === protocols('ip6').code) {\n return `[${restVal}]`;\n }\n return restVal;\n}\nconst interpreters = {\n ip4: (value, restMa) => value,\n ip6: (value, restMa) => {\n if (restMa.length === 0) {\n return value;\n }\n return `[${value}]`;\n },\n tcp: (value, restMa) => {\n const tailProto = restMa.pop();\n if (tailProto === undefined) {\n throw new Error('Unexpected end of multiaddr');\n }\n return `tcp://${interpretNext(tailProto[0], tailProto[1] ?? '', restMa)}:${value}`;\n },\n udp: (value, restMa) => {\n const tailProto = restMa.pop();\n if (tailProto === undefined) {\n throw new Error('Unexpected end of multiaddr');\n }\n return `udp://${interpretNext(tailProto[0], tailProto[1] ?? '', restMa)}:${value}`;\n },\n dnsaddr: (value, restMa) => value,\n dns4: (value, restMa) => value,\n dns6: (value, restMa) => value,\n dns: (value, restMa) => value,\n ipfs: (value, restMa) => {\n const tailProto = restMa.pop();\n if (tailProto === undefined) {\n throw new Error('Unexpected end of multiaddr');\n }\n return `${interpretNext(tailProto[0], tailProto[1] ?? '', restMa)}/ipfs/${value}`;\n },\n p2p: (value, restMa) => {\n const tailProto = restMa.pop();\n if (tailProto === undefined) {\n throw new Error('Unexpected end of multiaddr');\n }\n return `${interpretNext(tailProto[0], tailProto[1] ?? '', restMa)}/p2p/${value}`;\n },\n http: (value, restMa) => {\n const maHasTLS = hasTLS(restMa);\n const sni = extractSNI(restMa);\n if (maHasTLS && sni !== null) {\n return `https://${sni}`;\n }\n const protocol = maHasTLS ? 'https://' : 'http://';\n const tailProto = restMa.pop();\n if (tailProto === undefined) {\n throw new Error('Unexpected end of multiaddr');\n }\n let baseVal = interpretNext(tailProto[0], tailProto[1] ?? '', restMa);\n // We are reinterpreting the base as http, so we need to remove the tcp:// if it's there\n baseVal = baseVal.replace('tcp://', '');\n return `${protocol}${baseVal}`;\n },\n 'http-path': (value, restMa) => {\n const tailProto = restMa.pop();\n if (tailProto === undefined) {\n throw new Error('Unexpected end of multiaddr');\n }\n const baseVal = interpretNext(tailProto[0], tailProto[1] ?? '', restMa);\n const decodedValue = decodeURIComponent(value);\n return `${baseVal}/${decodedValue}`;\n },\n tls: (value, restMa) => {\n // Noop, the parent context knows that it's tls. We don't need to do\n // anything here\n const tailProto = restMa.pop();\n if (tailProto === undefined) {\n throw new Error('Unexpected end of multiaddr');\n }\n return interpretNext(tailProto[0], tailProto[1] ?? '', restMa);\n },\n sni: (value, restMa) => {\n // Noop, the parent context uses the sni information, we don't need to do\n // anything here\n const tailProto = restMa.pop();\n if (tailProto === undefined) {\n throw new Error('Unexpected end of multiaddr');\n }\n return interpretNext(tailProto[0], tailProto[1] ?? '', restMa);\n },\n https: (value, restMa) => {\n const tailProto = restMa.pop();\n if (tailProto === undefined) {\n throw new Error('Unexpected end of multiaddr');\n }\n let baseVal = interpretNext(tailProto[0], tailProto[1] ?? '', restMa);\n // We are reinterpreting the base as http, so we need to remove the tcp:// if it's there\n baseVal = baseVal.replace('tcp://', '');\n return `https://${baseVal}`;\n },\n ws: (value, restMa) => {\n const maHasTLS = hasTLS(restMa);\n const sni = extractSNI(restMa);\n if (maHasTLS && sni !== null) {\n return `wss://${sni}`;\n }\n const protocol = maHasTLS ? 'wss://' : 'ws://';\n const tailProto = restMa.pop();\n if (tailProto === undefined) {\n throw new Error('Unexpected end of multiaddr');\n }\n let baseVal = interpretNext(tailProto[0], tailProto[1] ?? '', restMa);\n // We are reinterpreting the base, so we need to remove the tcp:// if it's there\n baseVal = baseVal.replace('tcp://', '');\n return `${protocol}${baseVal}`;\n },\n wss: (value, restMa) => {\n const tailProto = restMa.pop();\n if (tailProto === undefined) {\n throw new Error('Unexpected end of multiaddr');\n }\n let baseVal = interpretNext(tailProto[0], tailProto[1] ?? '', restMa);\n // We are reinterpreting the base as http, so we need to remove the tcp:// if it's there\n baseVal = baseVal.replace('tcp://', '');\n return `wss://${baseVal}`;\n },\n 'p2p-websocket-star': (value, restMa) => {\n const tailProto = restMa.pop();\n if (tailProto === undefined) {\n throw new Error('Unexpected end of multiaddr');\n }\n return `${interpretNext(tailProto[0], tailProto[1] ?? '', restMa)}/p2p-websocket-star`;\n },\n 'p2p-webrtc-star': (value, restMa) => {\n const tailProto = restMa.pop();\n if (tailProto === undefined) {\n throw new Error('Unexpected end of multiaddr');\n }\n return `${interpretNext(tailProto[0], tailProto[1] ?? '', restMa)}/p2p-webrtc-star`;\n },\n 'p2p-webrtc-direct': (value, restMa) => {\n const tailProto = restMa.pop();\n if (tailProto === undefined) {\n throw new Error('Unexpected end of multiaddr');\n }\n return `${interpretNext(tailProto[0], tailProto[1] ?? '', restMa)}/p2p-webrtc-direct`;\n }\n};\nexport function multiaddrToUri(input, opts) {\n const ma = multiaddr(input);\n const parts = ma.stringTuples();\n const head = parts.pop();\n if (head === undefined) {\n throw new Error('Unexpected end of multiaddr');\n }\n const protocol = protocols(head[0]);\n const interpreter = interpreters[protocol.name];\n if (interpreter == null) {\n throw new Error(`No interpreter found for ${protocol.name}`);\n }\n let uri = interpreter(head[1] ?? '', parts);\n if (opts?.assumeHttp !== false && ASSUME_HTTP_CODES.includes(head[0])) {\n // strip any declared protocol\n uri = uri.replace(/^.*:\\/\\//, '');\n if (head[1] === '443') {\n uri = `https://${uri}`;\n }\n else {\n uri = `http://${uri}`;\n }\n }\n if (uri.startsWith('http://') || uri.startsWith('https://')) {\n // this will strip default ports while keeping paths intact\n uri = new URL(uri).toString();\n // strip trailing slash, e.g. http://127.0.0.1/ -> http://127.0.0.1\n if (uri.endsWith('/')) {\n uri = uri.substring(0, uri.length - 1);\n }\n }\n return uri;\n}\n//# sourceMappingURL=index.js.map","export default async (socket) => {\n // if the socket is closing or closed, return end\n if (socket.readyState >= 2) {\n throw new Error('socket closed');\n }\n // if open, return\n if (socket.readyState === 1) {\n return;\n }\n await new Promise((resolve, reject) => {\n function cleanup() {\n socket.removeEventListener('open', handleOpen);\n socket.removeEventListener('error', handleErr);\n }\n function handleOpen() {\n cleanup();\n resolve();\n }\n function handleErr(event) {\n cleanup();\n reject(event.error ?? new Error(`connect ECONNREFUSED ${socket.url}`));\n }\n socket.addEventListener('open', handleOpen);\n socket.addEventListener('error', handleErr);\n });\n};\n//# sourceMappingURL=ready.js.map","import ready from './ready.js';\nexport default (socket, options) => {\n options = options ?? {};\n options.closeOnEnd = options.closeOnEnd !== false;\n const sink = async (source) => {\n for await (const data of source) {\n try {\n await ready(socket);\n }\n catch (err) {\n if (err.message === 'socket closed')\n break;\n throw err;\n }\n // the ready promise resolved without error but the socket was closing so\n // exit the loop and don't send data\n if (socket.readyState === socket.CLOSING || socket.readyState === socket.CLOSED) {\n break;\n }\n socket.send(data);\n }\n if (options.closeOnEnd != null && socket.readyState <= 1) {\n await new Promise((resolve, reject) => {\n socket.addEventListener('close', event => {\n if (event.wasClean || event.code === 1006) {\n resolve();\n }\n else {\n const err = Object.assign(new Error('ws error'), { event });\n reject(err);\n }\n });\n setTimeout(() => { socket.close(); });\n });\n }\n };\n return sink;\n};\n//# sourceMappingURL=sink.js.map","import { EventIterator } from 'event-iterator';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\n// copied from github.com/feross/buffer\n// Some ArrayBuffers are not passing the instanceof check, so we need to do a bit more work :(\nfunction isArrayBuffer(obj) {\n return (obj instanceof ArrayBuffer) ||\n (obj?.constructor?.name === 'ArrayBuffer' && typeof obj?.byteLength === 'number');\n}\nexport default (socket) => {\n socket.binaryType = 'arraybuffer';\n const connected = async () => {\n await new Promise((resolve, reject) => {\n if (isConnected) {\n resolve();\n return;\n }\n if (connError != null) {\n reject(connError);\n return;\n }\n const cleanUp = (cont) => {\n socket.removeEventListener('open', onOpen);\n socket.removeEventListener('error', onError);\n cont();\n };\n const onOpen = () => { cleanUp(resolve); };\n const onError = (event) => {\n cleanUp(() => { reject(event.error ?? new Error(`connect ECONNREFUSED ${socket.url}`)); });\n };\n socket.addEventListener('open', onOpen);\n socket.addEventListener('error', onError);\n });\n };\n const source = (async function* () {\n const messages = new EventIterator(({ push, stop, fail }) => {\n const onMessage = (event) => {\n let data = null;\n if (typeof event.data === 'string') {\n data = uint8ArrayFromString(event.data);\n }\n if (isArrayBuffer(event.data)) {\n data = new Uint8Array(event.data);\n }\n if (event.data instanceof Uint8Array) {\n data = event.data;\n }\n if (data == null) {\n return;\n }\n push(data);\n };\n const onError = (event) => { fail(event.error ?? new Error('Socket error')); };\n socket.addEventListener('message', onMessage);\n socket.addEventListener('error', onError);\n socket.addEventListener('close', stop);\n return () => {\n socket.removeEventListener('message', onMessage);\n socket.removeEventListener('error', onError);\n socket.removeEventListener('close', stop);\n };\n }, { highWaterMark: Infinity });\n await connected();\n for await (const chunk of messages) {\n yield isArrayBuffer(chunk) ? new Uint8Array(chunk) : chunk;\n }\n }());\n let isConnected = socket.readyState === 1;\n let connError;\n socket.addEventListener('open', () => {\n isConnected = true;\n connError = null;\n });\n socket.addEventListener('close', () => {\n isConnected = false;\n connError = null;\n });\n socket.addEventListener('error', event => {\n if (!isConnected) {\n connError = event.error ?? new Error(`connect ECONNREFUSED ${socket.url}`);\n }\n });\n return Object.assign(source, {\n connected\n });\n};\n//# sourceMappingURL=source.js.map","/* eslint-env browser */\nexport default WebSocket;\n//# sourceMappingURL=web-socket.browser.js.map","const map = { 'http:': 'ws:', 'https:': 'wss:' };\nconst defaultProtocol = 'ws:';\nexport default (url, location) => {\n if (url.startsWith('//')) {\n url = `${location?.protocol ?? defaultProtocol}${url}`;\n }\n if (url.startsWith('/') && location != null) {\n const proto = location.protocol ?? defaultProtocol;\n const host = location.host;\n const port = location.port != null && host?.endsWith(`:${location.port}`) !== true ? `:${location.port}` : '';\n url = `${proto}//${host}${port}${url}`;\n }\n const wsUrl = new URL(url);\n for (const [httpProto, wsProto] of Object.entries(map)) {\n if (wsUrl.protocol === httpProto) {\n wsUrl.protocol = wsProto;\n }\n }\n return wsUrl;\n};\n//# sourceMappingURL=ws-url.js.map","// load websocket library if we are not in the browser\nimport duplex from './duplex.js';\nimport WebSocket from './web-socket.js';\nimport wsurl from './ws-url.js';\nexport function connect(addr, opts) {\n const location = typeof window === 'undefined' ? undefined : window.location;\n opts = opts ?? {};\n const url = wsurl(addr, location);\n // it's necessary to stringify the URL object otherwise react-native crashes\n const socket = new WebSocket(url.toString(), opts.websocket);\n return duplex(socket, opts);\n}\n//# sourceMappingURL=client.js.map","import sink from './sink.js';\nimport source from './source.js';\nexport default (socket, options) => {\n options = options ?? {};\n const connectedSource = source(socket);\n let remoteAddress = options.remoteAddress;\n let remotePort = options.remotePort;\n if (socket.url != null) {\n // only client->server sockets have urls, server->client connections do not\n try {\n const url = new URL(socket.url);\n remoteAddress = url.hostname;\n remotePort = parseInt(url.port, 10);\n }\n catch { }\n }\n if (remoteAddress == null || remotePort == null) {\n throw new Error('Remote connection did not have address and/or port');\n }\n const duplex = {\n sink: sink(socket, options),\n source: connectedSource,\n connected: async () => { await connectedSource.connected(); },\n close: async () => {\n if (socket.readyState === socket.CONNECTING || socket.readyState === socket.OPEN) {\n await new Promise((resolve) => {\n socket.addEventListener('close', () => {\n resolve();\n });\n socket.close();\n });\n }\n },\n destroy: () => {\n if (socket.terminate != null) {\n socket.terminate();\n }\n else {\n socket.close();\n }\n },\n remoteAddress,\n remotePort,\n socket\n };\n return duplex;\n};\n//# sourceMappingURL=duplex.js.map","/**\n * An implementation of the ProgressEvent interface, this is essentially\n * a typed `CustomEvent` with a `type` property that lets us disambiguate\n * events passed to `progress` callbacks.\n */\nexport class CustomProgressEvent extends Event {\n constructor(type, detail) {\n super(type);\n this.detail = detail;\n }\n}\n//# sourceMappingURL=index.js.map","// p2p multi-address code\nexport const CODE_P2P = 421;\nexport const CODE_CIRCUIT = 290;\nexport const CODE_TCP = 6;\nexport const CODE_WS = 477;\nexport const CODE_WSS = 478;\n// Time to wait for a connection to close gracefully before destroying it manually\nexport const CLOSE_TIMEOUT = 500;\n//# sourceMappingURL=constants.js.map","import * as mafmt from '@multiformats/mafmt';\nimport { CODE_CIRCUIT, CODE_P2P, CODE_TCP, CODE_WS, CODE_WSS } from './constants.js';\nexport function all(multiaddrs) {\n return multiaddrs.filter((ma) => {\n if (ma.protoCodes().includes(CODE_CIRCUIT)) {\n return false;\n }\n const testMa = ma.decapsulateCode(CODE_P2P);\n return mafmt.WebSockets.matches(testMa) ||\n mafmt.WebSocketsSecure.matches(testMa);\n });\n}\nexport function wss(multiaddrs) {\n return multiaddrs.filter((ma) => {\n if (ma.protoCodes().includes(CODE_CIRCUIT)) {\n return false;\n }\n const testMa = ma.decapsulateCode(CODE_P2P);\n return mafmt.WebSocketsSecure.matches(testMa);\n });\n}\nexport function dnsWss(multiaddrs) {\n return multiaddrs.filter((ma) => {\n if (ma.protoCodes().includes(CODE_CIRCUIT)) {\n return false;\n }\n const testMa = ma.decapsulateCode(CODE_P2P);\n return mafmt.WebSocketsSecure.matches(testMa) &&\n mafmt.DNS.matches(testMa.decapsulateCode(CODE_TCP).decapsulateCode(CODE_WSS));\n });\n}\nexport function dnsWsOrWss(multiaddrs) {\n return multiaddrs.filter((ma) => {\n if (ma.protoCodes().includes(CODE_CIRCUIT)) {\n return false;\n }\n const testMa = ma.decapsulateCode(CODE_P2P);\n // WS\n if (mafmt.WebSockets.matches(testMa)) {\n return mafmt.DNS.matches(testMa.decapsulateCode(CODE_TCP).decapsulateCode(CODE_WS));\n }\n // WSS\n return mafmt.WebSocketsSecure.matches(testMa) &&\n mafmt.DNS.matches(testMa.decapsulateCode(CODE_TCP).decapsulateCode(CODE_WSS));\n });\n}\n//# sourceMappingURL=filters.js.map","/**\n * @packageDocumentation\n *\n * A [libp2p transport](https://docs.libp2p.io/concepts/transports/overview/) based on [WebSockets](https://developer.mozilla.org/en-US/docs/Web/API/WebSockets_API).\n *\n * @example\n *\n * ```TypeScript\n * import { createLibp2p } from 'libp2p'\n * import { webSockets } from '@libp2p/websockets'\n * import { multiaddr } from '@multiformats/multiaddr'\n *\n * const node = await createLibp2p({\n * transports: [\n * webSockets()\n * ]\n * //... other config\n * })\n * await node.start()\n *\n * const ma = multiaddr('/ip4/127.0.0.1/tcp/9090/ws')\n * await node.dial(ma)\n * ```\n *\n * ## Filters\n *\n * When run in a browser by default this module will only connect to secure web socket addresses.\n *\n * To change this you should pass a filter to the factory function.\n *\n * You can create your own address filters for this transports, or rely in the filters [provided](./src/filters.js).\n *\n * The available filters are:\n *\n * - `filters.all`\n * - Returns all TCP and DNS based addresses, both with `ws` or `wss`.\n * - `filters.dnsWss`\n * - Returns all DNS based addresses with `wss`.\n * - `filters.dnsWsOrWss`\n * - Returns all DNS based addresses, both with `ws` or `wss`.\n *\n * @example Allow dialing insecure WebSockets\n *\n * ```TypeScript\n * import { createLibp2p } from 'libp2p'\n * import { webSockets } from '@libp2p/websockets'\n * import * as filters from '@libp2p/websockets/filters'\n *\n * const node = await createLibp2p({\n * transports: [\n * webSockets({\n * // connect to all sockets, even insecure ones\n * filter: filters.all\n * })\n * ]\n * })\n * ```\n */\nimport { CodeError, transportSymbol, serviceCapabilities } from '@libp2p/interface';\nimport { multiaddrToUri as toUri } from '@multiformats/multiaddr-to-uri';\nimport { connect } from 'it-ws/client';\nimport pDefer from 'p-defer';\nimport { CustomProgressEvent } from 'progress-events';\nimport { raceSignal } from 'race-signal';\nimport { isBrowser, isWebWorker } from 'wherearewe';\nimport * as filters from './filters.js';\nimport { createListener } from './listener.js';\nimport { socketToMaConn } from './socket-to-conn.js';\nclass WebSockets {\n log;\n init;\n logger;\n metrics;\n components;\n constructor(components, init) {\n this.log = components.logger.forComponent('libp2p:websockets');\n this.logger = components.logger;\n this.components = components;\n this.init = init;\n if (components.metrics != null) {\n this.metrics = {\n dialerEvents: components.metrics.registerCounterGroup('libp2p_websockets_dialer_events_total', {\n label: 'event',\n help: 'Total count of WebSockets dialer events by type'\n })\n };\n }\n }\n [transportSymbol] = true;\n [Symbol.toStringTag] = '@libp2p/websockets';\n [serviceCapabilities] = [\n '@libp2p/transport'\n ];\n async dial(ma, options) {\n this.log('dialing %s', ma);\n options = options ?? {};\n const socket = await this._connect(ma, options);\n const maConn = socketToMaConn(socket, ma, {\n logger: this.logger,\n metrics: this.metrics?.dialerEvents\n });\n this.log('new outbound connection %s', maConn.remoteAddr);\n const conn = await options.upgrader.upgradeOutbound(maConn, options);\n this.log('outbound connection %s upgraded', maConn.remoteAddr);\n return conn;\n }\n async _connect(ma, options) {\n options?.signal?.throwIfAborted();\n const cOpts = ma.toOptions();\n this.log('dialing %s:%s', cOpts.host, cOpts.port);\n const errorPromise = pDefer();\n const rawSocket = connect(toUri(ma), this.init);\n rawSocket.socket.addEventListener('error', () => {\n // the WebSocket.ErrorEvent type doesn't actually give us any useful\n // information about what happened\n // https://developer.mozilla.org/en-US/docs/Web/API/WebSocket/error_event\n const err = new CodeError(`Could not connect to ${ma.toString()}`, 'ERR_CONNECTION_FAILED');\n this.log.error('connection error:', err);\n this.metrics?.dialerEvents.increment({ error: true });\n errorPromise.reject(err);\n });\n try {\n options.onProgress?.(new CustomProgressEvent('websockets:open-connection'));\n await raceSignal(Promise.race([rawSocket.connected(), errorPromise.promise]), options.signal);\n }\n catch (err) {\n if (options.signal?.aborted === true) {\n this.metrics?.dialerEvents.increment({ abort: true });\n }\n rawSocket.close()\n .catch(err => {\n this.log.error('error closing raw socket', err);\n });\n throw err;\n }\n this.log('connected %s', ma);\n this.metrics?.dialerEvents.increment({ connect: true });\n return rawSocket;\n }\n /**\n * Creates a Websockets listener. The provided `handler` function will be called\n * anytime a new incoming Connection has been successfully upgraded via\n * `upgrader.upgradeInbound`\n */\n createListener(options) {\n return createListener({\n logger: this.logger,\n metrics: this.components.metrics\n }, {\n ...this.init,\n ...options\n });\n }\n /**\n * Takes a list of `Multiaddr`s and returns only valid Websockets addresses.\n * By default, in a browser environment only DNS+WSS multiaddr is accepted,\n * while in a Node.js environment DNS+{WS, WSS} multiaddrs are accepted.\n */\n listenFilter(multiaddrs) {\n multiaddrs = Array.isArray(multiaddrs) ? multiaddrs : [multiaddrs];\n if (this.init?.filter != null) {\n return this.init?.filter(multiaddrs);\n }\n // Browser\n if (isBrowser || isWebWorker) {\n return filters.wss(multiaddrs);\n }\n return filters.all(multiaddrs);\n }\n /**\n * Filter check for all Multiaddrs that this transport can dial\n */\n dialFilter(multiaddrs) {\n return this.listenFilter(multiaddrs);\n }\n}\nexport function webSockets(init = {}) {\n return (components) => {\n return new WebSockets(components, init);\n };\n}\n//# sourceMappingURL=index.js.map","import { CodeError } from '@libp2p/interface';\nimport { CLOSE_TIMEOUT } from './constants.js';\n// Convert a stream into a MultiaddrConnection\n// https://github.com/libp2p/interface-transport#multiaddrconnection\nexport function socketToMaConn(stream, remoteAddr, options) {\n const log = options.logger.forComponent('libp2p:websockets:maconn');\n const metrics = options.metrics;\n const metricPrefix = options.metricPrefix ?? '';\n const maConn = {\n log,\n async sink(source) {\n try {\n await stream.sink((async function* () {\n for await (const buf of source) {\n if (buf instanceof Uint8Array) {\n yield buf;\n }\n else {\n yield buf.subarray();\n }\n }\n })());\n }\n catch (err) {\n if (err.type !== 'aborted') {\n log.error(err);\n }\n }\n },\n source: stream.source,\n remoteAddr,\n timeline: { open: Date.now() },\n async close(options = {}) {\n const start = Date.now();\n if (options.signal == null) {\n const signal = AbortSignal.timeout(CLOSE_TIMEOUT);\n options = {\n ...options,\n signal\n };\n }\n const listener = () => {\n const { host, port } = maConn.remoteAddr.toOptions();\n log('timeout closing stream to %s:%s after %dms, destroying it manually', host, port, Date.now() - start);\n this.abort(new CodeError('Socket close timeout', 'ERR_SOCKET_CLOSE_TIMEOUT'));\n };\n options.signal?.addEventListener('abort', listener);\n try {\n await stream.close();\n }\n catch (err) {\n log.error('error closing WebSocket gracefully', err);\n this.abort(err);\n }\n finally {\n options.signal?.removeEventListener('abort', listener);\n maConn.timeline.close = Date.now();\n }\n },\n abort(err) {\n const { host, port } = maConn.remoteAddr.toOptions();\n log('timeout closing stream to %s:%s due to error', host, port, err);\n stream.destroy();\n maConn.timeline.close = Date.now();\n // ws WebSocket.terminate does not accept an Error arg to emit an 'error'\n // event on destroy like other node streams so we can't update a metric\n // with an event listener\n // https://github.com/websockets/ws/issues/1752#issuecomment-622380981\n metrics?.increment({ [`${metricPrefix}error`]: true });\n }\n };\n stream.socket.addEventListener('close', () => {\n metrics?.increment({ [`${metricPrefix}close`]: true });\n // In instances where `close` was not explicitly called,\n // such as an iterable stream ending, ensure we have set the close\n // timeline\n if (maConn.timeline.close == null) {\n maConn.timeline.close = Date.now();\n }\n }, { once: true });\n return maConn;\n}\n//# sourceMappingURL=socket-to-conn.js.map","export function createListener() {\n throw new Error('WebSocket Servers can not be created in the browser!');\n}\n//# sourceMappingURL=listener.browser.js.map","/**\n * Any object that implements this Symbol as a property should return a\n * ContentRouting instance as the property value, similar to how\n * `Symbol.Iterable` can be used to return an `Iterable` from an `Iterator`.\n *\n * @example\n *\n * ```TypeScript\n * import { contentRoutingSymbol, ContentRouting } from '@libp2p/content-routing'\n *\n * class MyContentRouter implements ContentRouting {\n * get [contentRoutingSymbol] () {\n * return this\n * }\n *\n * // ...other methods\n * }\n * ```\n */\nexport const contentRoutingSymbol = Symbol.for('@libp2p/content-routing');\n//# sourceMappingURL=index.js.map","/**\n * Any object that implements this Symbol as a property should return a\n * PeerRouting instance as the property value, similar to how\n * `Symbol.Iterable` can be used to return an `Iterable` from an `Iterator`.\n *\n * @example\n *\n * ```TypeScript\n * import { peerRouting, PeerRouting } from '@libp2p/peer-routing'\n *\n * class MyPeerRouter implements PeerRouting {\n * get [peerRouting] () {\n * return this\n * }\n *\n * // ...other methods\n * }\n * ```\n */\nexport const peerRoutingSymbol = Symbol.for('@libp2p/peer-routing');\n//# sourceMappingURL=index.js.map","// Helpers.\nconst s = 1000;\nconst m = s * 60;\nconst h = m * 60;\nconst d = h * 24;\nconst w = d * 7;\nconst y = d * 365.25;\nfunction ms(value, options) {\n try {\n if (typeof value === 'string' && value.length > 0) {\n return parse(value);\n }\n else if (typeof value === 'number' && isFinite(value)) {\n return options?.long ? fmtLong(value) : fmtShort(value);\n }\n throw new Error('Value is not a string or number.');\n }\n catch (error) {\n const message = isError(error)\n ? `${error.message}. value=${JSON.stringify(value)}`\n : 'An unknown error has occured.';\n throw new Error(message);\n }\n}\n/**\n * Parse the given `str` and return milliseconds.\n */\nfunction parse(str) {\n str = String(str);\n if (str.length > 100) {\n throw new Error('Value exceeds the maximum length of 100 characters.');\n }\n const match = /^(-?(?:\\d+)?\\.?\\d+) *(milliseconds?|msecs?|ms|seconds?|secs?|s|minutes?|mins?|m|hours?|hrs?|h|days?|d|weeks?|w|years?|yrs?|y)?$/i.exec(str);\n if (!match) {\n return NaN;\n }\n const n = parseFloat(match[1]);\n const type = (match[2] || 'ms').toLowerCase();\n switch (type) {\n case 'years':\n case 'year':\n case 'yrs':\n case 'yr':\n case 'y':\n return n * y;\n case 'weeks':\n case 'week':\n case 'w':\n return n * w;\n case 'days':\n case 'day':\n case 'd':\n return n * d;\n case 'hours':\n case 'hour':\n case 'hrs':\n case 'hr':\n case 'h':\n return n * h;\n case 'minutes':\n case 'minute':\n case 'mins':\n case 'min':\n case 'm':\n return n * m;\n case 'seconds':\n case 'second':\n case 'secs':\n case 'sec':\n case 's':\n return n * s;\n case 'milliseconds':\n case 'millisecond':\n case 'msecs':\n case 'msec':\n case 'ms':\n return n;\n default:\n // This should never occur.\n throw new Error(`The unit ${type} was matched, but no matching case exists.`);\n }\n}\nexport default ms;\n/**\n * Short format for `ms`.\n */\nfunction fmtShort(ms) {\n const msAbs = Math.abs(ms);\n if (msAbs >= d) {\n return `${Math.round(ms / d)}d`;\n }\n if (msAbs >= h) {\n return `${Math.round(ms / h)}h`;\n }\n if (msAbs >= m) {\n return `${Math.round(ms / m)}m`;\n }\n if (msAbs >= s) {\n return `${Math.round(ms / s)}s`;\n }\n return `${ms}ms`;\n}\n/**\n * Long format for `ms`.\n */\nfunction fmtLong(ms) {\n const msAbs = Math.abs(ms);\n if (msAbs >= d) {\n return plural(ms, msAbs, d, 'day');\n }\n if (msAbs >= h) {\n return plural(ms, msAbs, h, 'hour');\n }\n if (msAbs >= m) {\n return plural(ms, msAbs, m, 'minute');\n }\n if (msAbs >= s) {\n return plural(ms, msAbs, s, 'second');\n }\n return `${ms} ms`;\n}\n/**\n * Pluralization helper.\n */\nfunction plural(ms, msAbs, n, name) {\n const isPlural = msAbs >= n * 1.5;\n return `${Math.round(ms / n)} ${name}${isPlural ? 's' : ''}`;\n}\n/**\n * A type guard for errors.\n */\nfunction isError(error) {\n return typeof error === 'object' && error !== null && 'message' in error;\n}\n","/* eslint-disable no-console */\n/* eslint-disable @typescript-eslint/restrict-plus-operands */\n/* eslint-disable @typescript-eslint/strict-boolean-expressions */\n/* eslint-env browser */\n/**\n * This is the web browser implementation of `debug()`.\n */\nimport humanize from 'ms';\nimport setup from './common.js';\nconst storage = localstorage();\n/**\n * Colors.\n */\nconst colors = [\n '#0000CC',\n '#0000FF',\n '#0033CC',\n '#0033FF',\n '#0066CC',\n '#0066FF',\n '#0099CC',\n '#0099FF',\n '#00CC00',\n '#00CC33',\n '#00CC66',\n '#00CC99',\n '#00CCCC',\n '#00CCFF',\n '#3300CC',\n '#3300FF',\n '#3333CC',\n '#3333FF',\n '#3366CC',\n '#3366FF',\n '#3399CC',\n '#3399FF',\n '#33CC00',\n '#33CC33',\n '#33CC66',\n '#33CC99',\n '#33CCCC',\n '#33CCFF',\n '#6600CC',\n '#6600FF',\n '#6633CC',\n '#6633FF',\n '#66CC00',\n '#66CC33',\n '#9900CC',\n '#9900FF',\n '#9933CC',\n '#9933FF',\n '#99CC00',\n '#99CC33',\n '#CC0000',\n '#CC0033',\n '#CC0066',\n '#CC0099',\n '#CC00CC',\n '#CC00FF',\n '#CC3300',\n '#CC3333',\n '#CC3366',\n '#CC3399',\n '#CC33CC',\n '#CC33FF',\n '#CC6600',\n '#CC6633',\n '#CC9900',\n '#CC9933',\n '#CCCC00',\n '#CCCC33',\n '#FF0000',\n '#FF0033',\n '#FF0066',\n '#FF0099',\n '#FF00CC',\n '#FF00FF',\n '#FF3300',\n '#FF3333',\n '#FF3366',\n '#FF3399',\n '#FF33CC',\n '#FF33FF',\n '#FF6600',\n '#FF6633',\n '#FF9900',\n '#FF9933',\n '#FFCC00',\n '#FFCC33'\n];\n/**\n * Currently only WebKit-based Web Inspectors, Firefox >= v31,\n * and the Firebug extension (any Firefox version) are known\n * to support \"%c\" CSS customizations.\n *\n * TODO: add a `localStorage` variable to explicitly enable/disable colors\n */\n// eslint-disable-next-line complexity\nfunction useColors() {\n // NB: In an Electron preload script, document will be defined but not fully\n // initialized. Since we know we're in Chrome, we'll just detect this case\n // explicitly\n // @ts-expect-error window.process.type and window.process.__nwjs are not in the types\n if (typeof window !== 'undefined' && window.process && (window.process.type === 'renderer' || window.process.__nwjs)) {\n return true;\n }\n // Internet Explorer and Edge do not support colors.\n if (typeof navigator !== 'undefined' && (navigator.userAgent?.toLowerCase().match(/(edge|trident)\\/(\\d+)/) != null)) {\n return false;\n }\n // Is webkit? http://stackoverflow.com/a/16459606/376773\n // document is undefined in react-native: https://github.com/facebook/react-native/pull/1632\n // @ts-expect-error document.documentElement.style.WebkitAppearance is not in the types\n return (typeof document !== 'undefined' && document.documentElement?.style?.WebkitAppearance) ||\n // Is firebug? http://stackoverflow.com/a/398120/376773\n // @ts-expect-error window.console.firebug and window.console.exception are not in the types\n (typeof window !== 'undefined' && window.console && (window.console.firebug || (window.console.exception && window.console.table))) ||\n // Is firefox >= v31?\n // https://developer.mozilla.org/en-US/docs/Tools/Web_Console#Styling_messages\n (typeof navigator !== 'undefined' && (navigator.userAgent?.toLowerCase().match(/firefox\\/(\\d+)/) != null) && parseInt(RegExp.$1, 10) >= 31) ||\n // Double check webkit in userAgent just in case we are in a worker\n (typeof navigator !== 'undefined' && navigator.userAgent?.toLowerCase().match(/applewebkit\\/(\\d+)/));\n}\n/**\n * Colorize log arguments if enabled.\n */\nfunction formatArgs(args) {\n args[0] = (this.useColors ? '%c' : '') +\n this.namespace +\n (this.useColors ? ' %c' : ' ') +\n args[0] +\n (this.useColors ? '%c ' : ' ') +\n '+' + humanize(this.diff);\n if (!this.useColors) {\n return;\n }\n const c = 'color: ' + this.color;\n args.splice(1, 0, c, 'color: inherit');\n // The final \"%c\" is somewhat tricky, because there could be other\n // arguments passed either before or after the %c, so we need to\n // figure out the correct index to insert the CSS into\n let index = 0;\n let lastC = 0;\n args[0].replace(/%[a-zA-Z%]/g, (match) => {\n if (match === '%%') {\n return;\n }\n index++;\n if (match === '%c') {\n // We only are interested in the *last* %c\n // (the user may have provided their own)\n lastC = index;\n }\n });\n args.splice(lastC, 0, c);\n}\n/**\n * Invokes `console.debug()` when available.\n * No-op when `console.debug` is not a \"function\".\n * If `console.debug` is not available, falls back\n * to `console.log`.\n */\nconst log = console.debug ?? console.log ?? (() => { });\n/**\n * Save `namespaces`.\n *\n * @param {string} namespaces\n */\nfunction save(namespaces) {\n try {\n if (namespaces) {\n storage?.setItem('debug', namespaces);\n }\n else {\n storage?.removeItem('debug');\n }\n }\n catch (error) {\n // Swallow\n // XXX (@Qix-) should we be logging these?\n }\n}\n/**\n * Load `namespaces`.\n *\n * @returns {string} returns the previously persisted debug modes\n */\nfunction load() {\n let r;\n try {\n r = storage?.getItem('debug');\n }\n catch (error) {\n // Swallow\n // XXX (@Qix-) should we be logging these?\n }\n // If debug isn't set in LS, and we're in Electron, try to load $DEBUG\n if (!r && typeof process !== 'undefined' && 'env' in process) {\n r = process.env.DEBUG;\n }\n return r;\n}\n/**\n * Localstorage attempts to return the localstorage.\n *\n * This is necessary because safari throws\n * when a user disables cookies/localstorage\n * and you attempt to access it.\n */\nfunction localstorage() {\n try {\n // TVMLKit (Apple TV JS Runtime) does not have a window object, just localStorage in the global context\n // The Browser also has localStorage in the global context.\n return localStorage;\n }\n catch (error) {\n // Swallow\n // XXX (@Qix-) should we be logging these?\n }\n}\nfunction setupFormatters(formatters) {\n /**\n * Map %j to `JSON.stringify()`, since no Web Inspectors do that by default.\n */\n formatters.j = function (v) {\n try {\n return JSON.stringify(v);\n }\n catch (error) {\n return '[UnexpectedJSONParseError]: ' + error.message;\n }\n };\n}\nexport default setup({ formatArgs, save, load, useColors, setupFormatters, colors, storage, log });\n//# sourceMappingURL=browser.js.map","/* eslint-disable no-console */\n/* eslint-disable @typescript-eslint/strict-boolean-expressions */\n/**\n * This is the common logic for both the Node.js and web browser\n * implementations of `debug()`.\n */\nimport humanize from 'ms';\nexport default function setup(env) {\n createDebug.debug = createDebug;\n createDebug.default = createDebug;\n createDebug.coerce = coerce;\n createDebug.disable = disable;\n createDebug.enable = enable;\n createDebug.enabled = enabled;\n createDebug.humanize = humanize;\n createDebug.destroy = destroy;\n Object.keys(env).forEach(key => {\n // @ts-expect-error cannot use string to index type\n createDebug[key] = env[key];\n });\n /**\n * The currently active debug mode names, and names to skip.\n */\n createDebug.names = [];\n createDebug.skips = [];\n /**\n * Map of special \"%n\" handling functions, for the debug \"format\" argument.\n *\n * Valid key names are a single, lower or upper-case letter, i.e. \"n\" and \"N\".\n */\n createDebug.formatters = {};\n /**\n * Selects a color for a debug namespace\n *\n * @param {string} namespace - The namespace string for the debug instance to be colored\n * @returns {number | string} An ANSI color code for the given namespace\n */\n function selectColor(namespace) {\n let hash = 0;\n for (let i = 0; i < namespace.length; i++) {\n hash = ((hash << 5) - hash) + namespace.charCodeAt(i);\n hash |= 0; // Convert to 32bit integer\n }\n // @ts-expect-error colors is not in the types\n return createDebug.colors[Math.abs(hash) % createDebug.colors.length];\n }\n createDebug.selectColor = selectColor;\n /**\n * Create a debugger with the given `namespace`.\n *\n * @param {string} namespace\n * @returns {Function}\n */\n function createDebug(namespace) {\n let prevTime;\n let enableOverride = null;\n let namespacesCache;\n let enabledCache;\n function debug(...args) {\n // Disabled?\n // @ts-expect-error enabled is not in the types\n if (!debug.enabled) {\n return;\n }\n const self = debug;\n // Set `diff` timestamp\n const curr = Number(new Date());\n const ms = curr - (prevTime || curr);\n self.diff = ms;\n self.prev = prevTime;\n self.curr = curr;\n prevTime = curr;\n args[0] = createDebug.coerce(args[0]);\n if (typeof args[0] !== 'string') {\n // Anything else let's inspect with %O\n args.unshift('%O');\n }\n // Apply any `formatters` transformations\n let index = 0;\n args[0] = args[0].replace(/%([a-zA-Z%])/g, (match, format) => {\n // If we encounter an escaped % then don't increase the array index\n if (match === '%%') {\n return '%';\n }\n index++;\n // @ts-expect-error formatters is not in the types\n const formatter = createDebug.formatters[format];\n if (typeof formatter === 'function') {\n const val = args[index];\n match = formatter.call(self, val);\n // Now we need to remove `args[index]` since it's inlined in the `format`\n args.splice(index, 1);\n index--;\n }\n return match;\n });\n // Apply env-specific formatting (colors, etc.)\n // @ts-expect-error formatArgs is not in the types\n createDebug.formatArgs.call(self, args);\n // @ts-expect-error log is not in the types\n const logFn = self.log || createDebug.log;\n logFn.apply(self, args);\n }\n debug.namespace = namespace;\n // @ts-expect-error useColors is not in the types\n debug.useColors = createDebug.useColors();\n debug.color = createDebug.selectColor(namespace);\n debug.extend = extend;\n debug.destroy = createDebug.destroy; // XXX Temporary. Will be removed in the next major release.\n Object.defineProperty(debug, 'enabled', {\n enumerable: true,\n configurable: false,\n get: () => {\n if (enableOverride !== null) {\n return enableOverride;\n }\n // @ts-expect-error namespaces is not in the types\n if (namespacesCache !== createDebug.namespaces) {\n // @ts-expect-error namespaces is not in the types\n namespacesCache = createDebug.namespaces;\n enabledCache = createDebug.enabled(namespace);\n }\n return enabledCache;\n },\n set: v => {\n enableOverride = v;\n }\n });\n // Env-specific initialization logic for debug instances\n // @ts-expect-error init is not in the types\n if (typeof createDebug.init === 'function') {\n // @ts-expect-error init is not in the types\n createDebug.init(debug);\n }\n // @ts-expect-error some properties are added dynamically\n return debug;\n }\n function extend(namespace, delimiter) {\n const newDebug = createDebug(this.namespace + (typeof delimiter === 'undefined' ? ':' : delimiter) + namespace);\n newDebug.log = this.log;\n return newDebug;\n }\n /**\n * Enables a debug mode by namespaces. This can include modes\n * separated by a colon and wildcards.\n *\n * @param {string} namespaces\n */\n function enable(namespaces) {\n // @ts-expect-error save is not in the types\n createDebug.save(namespaces);\n // @ts-expect-error namespaces is not in the types\n createDebug.namespaces = namespaces;\n createDebug.names = [];\n createDebug.skips = [];\n let i;\n const split = (typeof namespaces === 'string' ? namespaces : '').split(/[\\s,]+/);\n const len = split.length;\n for (i = 0; i < len; i++) {\n if (!split[i]) {\n // ignore empty strings\n continue;\n }\n namespaces = split[i].replace(/\\*/g, '.*?');\n if (namespaces[0] === '-') {\n createDebug.skips.push(new RegExp('^' + namespaces.substr(1) + '$'));\n }\n else {\n createDebug.names.push(new RegExp('^' + namespaces + '$'));\n }\n }\n }\n /**\n * Disable debug output.\n *\n * @returns {string} namespaces\n */\n function disable() {\n const namespaces = [\n ...createDebug.names.map(toNamespace),\n ...createDebug.skips.map(toNamespace).map(namespace => '-' + namespace)\n ].join(',');\n createDebug.enable('');\n return namespaces;\n }\n /**\n * Returns true if the given mode name is enabled, false otherwise.\n *\n * @param {string} name\n * @returns {boolean}\n */\n function enabled(name) {\n if (name[name.length - 1] === '*') {\n return true;\n }\n let i;\n let len;\n for (i = 0, len = createDebug.skips.length; i < len; i++) {\n if (createDebug.skips[i].test(name)) {\n return false;\n }\n }\n for (i = 0, len = createDebug.names.length; i < len; i++) {\n if (createDebug.names[i].test(name)) {\n return true;\n }\n }\n return false;\n }\n /**\n * Convert regexp to namespace\n */\n function toNamespace(regexp) {\n return regexp.toString()\n .substring(2, regexp.toString().length - 2)\n .replace(/\\.\\*\\?$/, '*');\n }\n /**\n * Coerce `val`.\n */\n function coerce(val) {\n if (val instanceof Error) {\n return val.stack ?? val.message;\n }\n return val;\n }\n /**\n * XXX DO NOT USE. This is a temporary stub function.\n * XXX It WILL be removed in the next major release.\n */\n function destroy() {\n console.warn('Instance method `debug.destroy()` is deprecated and no longer does anything. It will be removed in the next major version of `debug`.');\n }\n // @ts-expect-error setupFormatters is not in the types\n createDebug.setupFormatters(createDebug.formatters);\n // @ts-expect-error load is not in the types\n createDebug.enable(createDebug.load());\n // @ts-expect-error some properties are added dynamically\n return createDebug;\n}\n//# sourceMappingURL=common.js.map","/**\n * @packageDocumentation\n *\n * This module is a fork of the [debug](https://www.npmjs.com/package/debug) module. It has been converted to TypeScript and the output is ESM.\n *\n * It is API compatible with no extra features or bug fixes, it should only be used if you want a 100% ESM application.\n *\n * ESM should be arriving in `debug@5.x.x` so this module can be retired after that.\n *\n * Please see [debug](https://www.npmjs.com/package/debug) for API details.\n */\n/**\n * Module dependencies.\n */\nimport weald from './node.js';\nexport default weald;\n//# sourceMappingURL=index.js.map","/**\n * @packageDocumentation\n *\n * A logger for libp2p based on the venerable [debug](https://www.npmjs.com/package/debug) module.\n *\n * @example\n *\n * ```TypeScript\n * import { logger } from '@libp2p/logger'\n *\n * const log = logger('libp2p:my:component:name')\n *\n * try {\n * // an operation\n * log('something happened: %s', 'it was ok')\n * } catch (err) {\n * log.error('something bad happened: %o', err)\n * }\n *\n * log('with this peer: %p', {})\n * log('and this base58btc: %b', Uint8Array.from([0, 1, 2, 3]))\n * log('and this base32: %t', Uint8Array.from([4, 5, 6, 7]))\n * ```\n *\n * ```console\n * $ DEBUG=libp2p:* node index.js\n * something happened: it was ok\n * something bad happened: \n * with this peer: 12D3Foo\n * with this base58btc: Qmfoo\n * with this base32: bafyfoo\n * ```\n */\nimport { base32 } from 'multiformats/bases/base32';\nimport { base58btc } from 'multiformats/bases/base58';\nimport { base64 } from 'multiformats/bases/base64';\nimport debug from 'weald';\nimport { truncatePeerId } from './utils.js';\n// Add a formatter for converting to a base58 string\ndebug.formatters.b = (v) => {\n return v == null ? 'undefined' : base58btc.baseEncode(v);\n};\n// Add a formatter for converting to a base32 string\ndebug.formatters.t = (v) => {\n return v == null ? 'undefined' : base32.baseEncode(v);\n};\n// Add a formatter for converting to a base64 string\ndebug.formatters.m = (v) => {\n return v == null ? 'undefined' : base64.baseEncode(v);\n};\n// Add a formatter for stringifying peer ids\ndebug.formatters.p = (v) => {\n return v == null ? 'undefined' : v.toString();\n};\n// Add a formatter for stringifying CIDs\ndebug.formatters.c = (v) => {\n return v == null ? 'undefined' : v.toString();\n};\n// Add a formatter for stringifying Datastore keys\ndebug.formatters.k = (v) => {\n return v == null ? 'undefined' : v.toString();\n};\n// Add a formatter for stringifying Multiaddrs\ndebug.formatters.a = (v) => {\n return v == null ? 'undefined' : v.toString();\n};\nfunction createDisabledLogger(namespace) {\n const logger = () => { };\n logger.enabled = false;\n logger.color = '';\n logger.diff = 0;\n logger.log = () => { };\n logger.namespace = namespace;\n logger.destroy = () => true;\n logger.extend = () => logger;\n return logger;\n}\n/**\n * Create a component logger that will prefix any log messages with a truncated\n * peer id.\n *\n * @example\n *\n * ```TypeScript\n * import { peerLogger } from '@libp2p/logger'\n * import { peerIdFromString } from '@libp2p/peer-id'\n *\n * const peerId = peerIdFromString('12D3FooBar')\n * const logger = peerLogger(peerId)\n *\n * const log = logger.forComponent('my-component')\n * log.info('hello world')\n * // logs \"12…oBar:my-component hello world\"\n * ```\n */\nexport function peerLogger(peerId, options = {}) {\n return prefixLogger(truncatePeerId(peerId, options));\n}\n/**\n * Create a component logger that will prefix any log messages with the passed\n * string.\n *\n * @example\n *\n * ```TypeScript\n * import { prefixLogger } from '@libp2p/logger'\n *\n * const logger = prefixLogger('my-node')\n *\n * const log = logger.forComponent('my-component')\n * log.info('hello world')\n * // logs \"my-node:my-component hello world\"\n * ```\n */\nexport function prefixLogger(prefix) {\n return {\n forComponent(name) {\n return logger(`${prefix}:${name}`);\n }\n };\n}\n/**\n * Create a component logger\n *\n * @example\n *\n * ```TypeScript\n * import { defaultLogger } from '@libp2p/logger'\n * import { peerIdFromString } from '@libp2p/peer-id'\n *\n * const logger = defaultLogger()\n *\n * const log = logger.forComponent('my-component')\n * log.info('hello world')\n * // logs \"my-component hello world\"\n * ```\n */\nexport function defaultLogger() {\n return {\n forComponent(name) {\n return logger(name);\n }\n };\n}\n/**\n * Creates a logger for the passed component name.\n *\n * @example\n *\n * ```TypeScript\n * import { logger } from '@libp2p/logger'\n *\n * const log = logger('my-component')\n * log.info('hello world')\n * // logs \"my-component hello world\"\n * ```\n */\nexport function logger(name) {\n // trace logging is a no-op by default\n let trace = createDisabledLogger(`${name}:trace`);\n // look at all the debug names and see if trace logging has explicitly been enabled\n if (debug.enabled(`${name}:trace`) && debug.names.map((r) => r.toString()).find((n) => n.includes(':trace')) != null) {\n trace = debug(`${name}:trace`);\n }\n return Object.assign(debug(name), {\n error: debug(`${name}:error`),\n trace\n });\n}\nexport function disable() {\n debug.disable();\n}\nexport function enable(namespaces) {\n debug.enable(namespaces);\n}\nexport function enabled(namespaces) {\n return debug.enabled(namespaces);\n}\n//# sourceMappingURL=index.js.map","/**\n * Calls the passed map function on every entry of the passed iterable iterator\n */\nexport function mapIterable(iter, map) {\n const iterator = {\n [Symbol.iterator]: () => {\n return iterator;\n },\n next: () => {\n const next = iter.next();\n const val = next.value;\n if (next.done === true || val == null) {\n const result = {\n done: true,\n value: undefined\n };\n return result;\n }\n return {\n done: false,\n value: map(val)\n };\n }\n };\n return iterator;\n}\n//# sourceMappingURL=util.js.map","import { peerIdFromString } from '@libp2p/peer-id';\nimport { mapIterable } from './util.js';\n/**\n * We can't use PeerIds as set entries because set entries are\n * compared using same-value-zero equality, so this is just\n * a map that stringifies the PeerIds before storing them.\n *\n * PeerIds cache stringified versions of themselves so this\n * should be a cheap operation.\n *\n * @example\n *\n * ```TypeScript\n * import { peerSet } from '@libp2p/peer-collections'\n *\n * const set = peerSet()\n * set.add(peerId)\n * ```\n */\nexport class PeerSet {\n set;\n constructor(set) {\n this.set = new Set();\n if (set != null) {\n for (const key of set) {\n this.set.add(key.toString());\n }\n }\n }\n get size() {\n return this.set.size;\n }\n [Symbol.iterator]() {\n return this.values();\n }\n add(peer) {\n this.set.add(peer.toString());\n }\n clear() {\n this.set.clear();\n }\n delete(peer) {\n this.set.delete(peer.toString());\n }\n entries() {\n return mapIterable(this.set.entries(), (val) => {\n const peerId = peerIdFromString(val[0]);\n return [peerId, peerId];\n });\n }\n forEach(predicate) {\n this.set.forEach((str) => {\n const id = peerIdFromString(str);\n predicate(id, id, this);\n });\n }\n has(peer) {\n return this.set.has(peer.toString());\n }\n values() {\n return mapIterable(this.set.values(), (val) => {\n return peerIdFromString(val);\n });\n }\n intersection(other) {\n const output = new PeerSet();\n for (const peerId of other) {\n if (this.has(peerId)) {\n output.add(peerId);\n }\n }\n return output;\n }\n difference(other) {\n const output = new PeerSet();\n for (const peerId of this) {\n if (!other.has(peerId)) {\n output.add(peerId);\n }\n }\n return output;\n }\n union(other) {\n const output = new PeerSet();\n for (const peerId of other) {\n output.add(peerId);\n }\n for (const peerId of this) {\n output.add(peerId);\n }\n return output;\n }\n}\nexport function peerSet() {\n return new PeerSet();\n}\n//# sourceMappingURL=set.js.map","/**\n * @packageDocumentation\n *\n * Generate, import, and export PeerIDs.\n *\n * A Peer ID is the SHA-256 [multihash](https://github.com/multiformats/multihash) of a public key.\n *\n * The public key is a base64 encoded string of a protobuf containing an RSA DER buffer. This uses a node buffer to pass the base64 encoded public key protobuf to the multihash for ID generation.\n *\n * @example\n *\n * ```TypeScript\n * import { createEd25519PeerId } from '@libp2p/peer-id-factory'\n *\n * const peerId = await createEd25519PeerId()\n * console.log(peerId.toString())\n * ```\n *\n * ```bash\n * 12D3KooWRm8J3iL796zPFi2EtGGtUJn58AG67gcqzMFHZnnsTzqD\n * ```\n */\nimport { generateKeyPair, marshalPrivateKey, unmarshalPrivateKey, marshalPublicKey, unmarshalPublicKey } from '@libp2p/crypto/keys';\nimport { peerIdFromKeys, peerIdFromBytes } from '@libp2p/peer-id';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport { PeerIdProto } from './proto.js';\nexport const createEd25519PeerId = async () => {\n const key = await generateKeyPair('Ed25519');\n const id = await createFromPrivKey(key);\n if (id.type === 'Ed25519') {\n return id;\n }\n throw new Error(`Generated unexpected PeerId type \"${id.type}\"`);\n};\nexport const createSecp256k1PeerId = async () => {\n const key = await generateKeyPair('secp256k1');\n const id = await createFromPrivKey(key);\n if (id.type === 'secp256k1') {\n return id;\n }\n throw new Error(`Generated unexpected PeerId type \"${id.type}\"`);\n};\nexport const createRSAPeerId = async (opts) => {\n const key = await generateKeyPair('RSA', opts?.bits ?? 2048);\n const id = await createFromPrivKey(key);\n if (id.type === 'RSA') {\n return id;\n }\n throw new Error(`Generated unexpected PeerId type \"${id.type}\"`);\n};\nexport async function createFromPubKey(publicKey) {\n return peerIdFromKeys(marshalPublicKey(publicKey));\n}\nexport async function createFromPrivKey(privateKey) {\n return peerIdFromKeys(marshalPublicKey(privateKey.public), marshalPrivateKey(privateKey));\n}\nexport function exportToProtobuf(peerId, excludePrivateKey) {\n return PeerIdProto.encode({\n id: peerId.multihash.bytes,\n pubKey: peerId.publicKey,\n privKey: excludePrivateKey === true || peerId.privateKey == null ? undefined : peerId.privateKey\n });\n}\nexport async function createFromProtobuf(buf) {\n const { id, privKey, pubKey } = PeerIdProto.decode(buf);\n return createFromParts(id ?? new Uint8Array(0), privKey, pubKey);\n}\nexport async function createFromJSON(obj) {\n return createFromParts(uint8ArrayFromString(obj.id, 'base58btc'), obj.privKey != null ? uint8ArrayFromString(obj.privKey, 'base64pad') : undefined, obj.pubKey != null ? uint8ArrayFromString(obj.pubKey, 'base64pad') : undefined);\n}\nasync function createFromParts(multihash, privKey, pubKey) {\n if (privKey != null) {\n const key = await unmarshalPrivateKey(privKey);\n return createFromPrivKey(key);\n }\n else if (pubKey != null) {\n const key = unmarshalPublicKey(pubKey);\n return createFromPubKey(key);\n }\n const peerId = peerIdFromBytes(multihash);\n if (peerId.type !== 'Ed25519' && peerId.type !== 'secp256k1' && peerId.type !== 'RSA') {\n // should not be possible since `multihash` is derived from keys and these\n // are the cryptographic peer id types\n throw new Error('Supplied PeerID is invalid');\n }\n return peerId;\n}\n//# sourceMappingURL=index.js.map","import { peerIdFromString } from '@libp2p/peer-id';\nimport { mapIterable } from './util.js';\n/**\n * We can't use PeerIds as map keys because map keys are\n * compared using same-value-zero equality, so this is just\n * a map that stringifies the PeerIds before storing them.\n *\n * PeerIds cache stringified versions of themselves so this\n * should be a cheap operation.\n *\n * @example\n *\n * ```TypeScript\n * import { peerMap } from '@libp2p/peer-collections'\n *\n * const map = peerMap()\n * map.set(peerId, 'value')\n * ```\n */\nexport class PeerMap {\n map;\n constructor(map) {\n this.map = new Map();\n if (map != null) {\n for (const [key, value] of map.entries()) {\n this.map.set(key.toString(), value);\n }\n }\n }\n [Symbol.iterator]() {\n return this.entries();\n }\n clear() {\n this.map.clear();\n }\n delete(peer) {\n return this.map.delete(peer.toString());\n }\n entries() {\n return mapIterable(this.map.entries(), (val) => {\n return [peerIdFromString(val[0]), val[1]];\n });\n }\n forEach(fn) {\n this.map.forEach((value, key) => {\n fn(value, peerIdFromString(key), this);\n });\n }\n get(peer) {\n return this.map.get(peer.toString());\n }\n has(peer) {\n return this.map.has(peer.toString());\n }\n set(peer, value) {\n this.map.set(peer.toString(), value);\n }\n keys() {\n return mapIterable(this.map.keys(), (val) => {\n return peerIdFromString(val);\n });\n }\n values() {\n return this.map.values();\n }\n get size() {\n return this.map.size;\n }\n}\nexport function peerMap() {\n return new PeerMap();\n}\n//# sourceMappingURL=map.js.map","import lowerBound from './lower-bound.js';\nexport default class PriorityQueue {\n #queue = [];\n enqueue(run, options) {\n options = {\n priority: 0,\n ...options,\n };\n const element = {\n priority: options.priority,\n run,\n };\n if (this.size && this.#queue[this.size - 1].priority >= options.priority) {\n this.#queue.push(element);\n return;\n }\n const index = lowerBound(this.#queue, element, (a, b) => b.priority - a.priority);\n this.#queue.splice(index, 0, element);\n }\n dequeue() {\n const item = this.#queue.shift();\n return item?.run;\n }\n filter(options) {\n return this.#queue.filter((element) => element.priority === options.priority).map((element) => element.run);\n }\n get size() {\n return this.#queue.length;\n }\n}\n","// Port of lower_bound from https://en.cppreference.com/w/cpp/algorithm/lower_bound\n// Used to compute insertion index to keep queue sorted after insertion\nexport default function lowerBound(array, value, comparator) {\n let first = 0;\n let count = array.length;\n while (count > 0) {\n const step = Math.trunc(count / 2);\n let it = first + step;\n if (comparator(array[it], value) <= 0) {\n first = ++it;\n count -= step + 1;\n }\n else {\n count = step;\n }\n }\n return first;\n}\n","import { EventEmitter } from 'eventemitter3';\nimport pTimeout, { TimeoutError } from 'p-timeout';\nimport PriorityQueue from './priority-queue.js';\n/**\nPromise queue with concurrency control.\n*/\nexport default class PQueue extends EventEmitter {\n #carryoverConcurrencyCount;\n #isIntervalIgnored;\n #intervalCount = 0;\n #intervalCap;\n #interval;\n #intervalEnd = 0;\n #intervalId;\n #timeoutId;\n #queue;\n #queueClass;\n #pending = 0;\n // The `!` is needed because of https://github.com/microsoft/TypeScript/issues/32194\n #concurrency;\n #isPaused;\n #throwOnTimeout;\n /**\n Per-operation timeout in milliseconds. Operations fulfill once `timeout` elapses if they haven't already.\n\n Applies to each future operation.\n */\n timeout;\n // TODO: The `throwOnTimeout` option should affect the return types of `add()` and `addAll()`\n constructor(options) {\n super();\n // eslint-disable-next-line @typescript-eslint/consistent-type-assertions\n options = {\n carryoverConcurrencyCount: false,\n intervalCap: Number.POSITIVE_INFINITY,\n interval: 0,\n concurrency: Number.POSITIVE_INFINITY,\n autoStart: true,\n queueClass: PriorityQueue,\n ...options,\n };\n if (!(typeof options.intervalCap === 'number' && options.intervalCap >= 1)) {\n throw new TypeError(`Expected \\`intervalCap\\` to be a number from 1 and up, got \\`${options.intervalCap?.toString() ?? ''}\\` (${typeof options.intervalCap})`);\n }\n if (options.interval === undefined || !(Number.isFinite(options.interval) && options.interval >= 0)) {\n throw new TypeError(`Expected \\`interval\\` to be a finite number >= 0, got \\`${options.interval?.toString() ?? ''}\\` (${typeof options.interval})`);\n }\n this.#carryoverConcurrencyCount = options.carryoverConcurrencyCount;\n this.#isIntervalIgnored = options.intervalCap === Number.POSITIVE_INFINITY || options.interval === 0;\n this.#intervalCap = options.intervalCap;\n this.#interval = options.interval;\n this.#queue = new options.queueClass();\n this.#queueClass = options.queueClass;\n this.concurrency = options.concurrency;\n this.timeout = options.timeout;\n this.#throwOnTimeout = options.throwOnTimeout === true;\n this.#isPaused = options.autoStart === false;\n }\n get #doesIntervalAllowAnother() {\n return this.#isIntervalIgnored || this.#intervalCount < this.#intervalCap;\n }\n get #doesConcurrentAllowAnother() {\n return this.#pending < this.#concurrency;\n }\n #next() {\n this.#pending--;\n this.#tryToStartAnother();\n this.emit('next');\n }\n #onResumeInterval() {\n this.#onInterval();\n this.#initializeIntervalIfNeeded();\n this.#timeoutId = undefined;\n }\n get #isIntervalPaused() {\n const now = Date.now();\n if (this.#intervalId === undefined) {\n const delay = this.#intervalEnd - now;\n if (delay < 0) {\n // Act as the interval was done\n // We don't need to resume it here because it will be resumed on line 160\n this.#intervalCount = (this.#carryoverConcurrencyCount) ? this.#pending : 0;\n }\n else {\n // Act as the interval is pending\n if (this.#timeoutId === undefined) {\n this.#timeoutId = setTimeout(() => {\n this.#onResumeInterval();\n }, delay);\n }\n return true;\n }\n }\n return false;\n }\n #tryToStartAnother() {\n if (this.#queue.size === 0) {\n // We can clear the interval (\"pause\")\n // Because we can redo it later (\"resume\")\n if (this.#intervalId) {\n clearInterval(this.#intervalId);\n }\n this.#intervalId = undefined;\n this.emit('empty');\n if (this.#pending === 0) {\n this.emit('idle');\n }\n return false;\n }\n if (!this.#isPaused) {\n const canInitializeInterval = !this.#isIntervalPaused;\n if (this.#doesIntervalAllowAnother && this.#doesConcurrentAllowAnother) {\n const job = this.#queue.dequeue();\n if (!job) {\n return false;\n }\n this.emit('active');\n job();\n if (canInitializeInterval) {\n this.#initializeIntervalIfNeeded();\n }\n return true;\n }\n }\n return false;\n }\n #initializeIntervalIfNeeded() {\n if (this.#isIntervalIgnored || this.#intervalId !== undefined) {\n return;\n }\n this.#intervalId = setInterval(() => {\n this.#onInterval();\n }, this.#interval);\n this.#intervalEnd = Date.now() + this.#interval;\n }\n #onInterval() {\n if (this.#intervalCount === 0 && this.#pending === 0 && this.#intervalId) {\n clearInterval(this.#intervalId);\n this.#intervalId = undefined;\n }\n this.#intervalCount = this.#carryoverConcurrencyCount ? this.#pending : 0;\n this.#processQueue();\n }\n /**\n Executes all queued functions until it reaches the limit.\n */\n #processQueue() {\n // eslint-disable-next-line no-empty\n while (this.#tryToStartAnother()) { }\n }\n get concurrency() {\n return this.#concurrency;\n }\n set concurrency(newConcurrency) {\n if (!(typeof newConcurrency === 'number' && newConcurrency >= 1)) {\n throw new TypeError(`Expected \\`concurrency\\` to be a number from 1 and up, got \\`${newConcurrency}\\` (${typeof newConcurrency})`);\n }\n this.#concurrency = newConcurrency;\n this.#processQueue();\n }\n async #throwOnAbort(signal) {\n return new Promise((_resolve, reject) => {\n signal.addEventListener('abort', () => {\n reject(signal.reason);\n }, { once: true });\n });\n }\n async add(function_, options = {}) {\n options = {\n timeout: this.timeout,\n throwOnTimeout: this.#throwOnTimeout,\n ...options,\n };\n return new Promise((resolve, reject) => {\n this.#queue.enqueue(async () => {\n this.#pending++;\n this.#intervalCount++;\n try {\n options.signal?.throwIfAborted();\n let operation = function_({ signal: options.signal });\n if (options.timeout) {\n operation = pTimeout(Promise.resolve(operation), { milliseconds: options.timeout });\n }\n if (options.signal) {\n operation = Promise.race([operation, this.#throwOnAbort(options.signal)]);\n }\n const result = await operation;\n resolve(result);\n this.emit('completed', result);\n }\n catch (error) {\n if (error instanceof TimeoutError && !options.throwOnTimeout) {\n resolve();\n return;\n }\n reject(error);\n this.emit('error', error);\n }\n finally {\n this.#next();\n }\n }, options);\n this.emit('add');\n this.#tryToStartAnother();\n });\n }\n async addAll(functions, options) {\n return Promise.all(functions.map(async (function_) => this.add(function_, options)));\n }\n /**\n Start (or resume) executing enqueued tasks within concurrency limit. No need to call this if queue is not paused (via `options.autoStart = false` or by `.pause()` method.)\n */\n start() {\n if (!this.#isPaused) {\n return this;\n }\n this.#isPaused = false;\n this.#processQueue();\n return this;\n }\n /**\n Put queue execution on hold.\n */\n pause() {\n this.#isPaused = true;\n }\n /**\n Clear the queue.\n */\n clear() {\n this.#queue = new this.#queueClass();\n }\n /**\n Can be called multiple times. Useful if you for example add additional items at a later time.\n\n @returns A promise that settles when the queue becomes empty.\n */\n async onEmpty() {\n // Instantly resolve if the queue is empty\n if (this.#queue.size === 0) {\n return;\n }\n await this.#onEvent('empty');\n }\n /**\n @returns A promise that settles when the queue size is less than the given limit: `queue.size < limit`.\n\n If you want to avoid having the queue grow beyond a certain size you can `await queue.onSizeLessThan()` before adding a new item.\n\n Note that this only limits the number of items waiting to start. There could still be up to `concurrency` jobs already running that this call does not include in its calculation.\n */\n async onSizeLessThan(limit) {\n // Instantly resolve if the queue is empty.\n if (this.#queue.size < limit) {\n return;\n }\n await this.#onEvent('next', () => this.#queue.size < limit);\n }\n /**\n The difference with `.onEmpty` is that `.onIdle` guarantees that all work from the queue has finished. `.onEmpty` merely signals that the queue is empty, but it could mean that some promises haven't completed yet.\n\n @returns A promise that settles when the queue becomes empty, and all promises have completed; `queue.size === 0 && queue.pending === 0`.\n */\n async onIdle() {\n // Instantly resolve if none pending and if nothing else is queued\n if (this.#pending === 0 && this.#queue.size === 0) {\n return;\n }\n await this.#onEvent('idle');\n }\n async #onEvent(event, filter) {\n return new Promise(resolve => {\n const listener = () => {\n if (filter && !filter()) {\n return;\n }\n this.off(event, listener);\n resolve();\n };\n this.on(event, listener);\n });\n }\n /**\n Size of the queue, the number of queued items waiting to run.\n */\n get size() {\n return this.#queue.size;\n }\n /**\n Size of the queue, filtered by the given options.\n\n For example, this can be used to find the number of items remaining in the queue with a specific priority level.\n */\n sizeBy(options) {\n // eslint-disable-next-line unicorn/no-array-callback-reference\n return this.#queue.filter(options).length;\n }\n /**\n Number of running items (no longer in the queue).\n */\n get pending() {\n return this.#pending;\n }\n /**\n Whether the queue is currently paused.\n */\n get isPaused() {\n return this.#isPaused;\n }\n}\n","const events = {};\nconst observable = (worker) => {\n worker.addEventListener('message', (event) => {\n observable.dispatchEvent('message', worker, event);\n });\n if (worker.port != null) {\n worker.port.addEventListener('message', (event) => {\n observable.dispatchEvent('message', worker, event);\n });\n }\n};\nobservable.addEventListener = (type, fn) => {\n if (events[type] == null) {\n events[type] = [];\n }\n events[type].push(fn);\n};\nobservable.removeEventListener = (type, fn) => {\n if (events[type] == null) {\n return;\n }\n events[type] = events[type]\n .filter(listener => listener === fn);\n};\nobservable.dispatchEvent = function (type, worker, event) {\n if (events[type] == null) {\n return;\n }\n events[type].forEach(fn => fn(worker, event));\n};\nexport default observable;\n//# sourceMappingURL=index.js.map","export const WORKER_REQUEST_READ_LOCK = 'lock:worker:request-read';\nexport const WORKER_RELEASE_READ_LOCK = 'lock:worker:release-read';\nexport const MASTER_GRANT_READ_LOCK = 'lock:master:grant-read';\nexport const WORKER_REQUEST_WRITE_LOCK = 'lock:worker:request-write';\nexport const WORKER_RELEASE_WRITE_LOCK = 'lock:worker:release-write';\nexport const MASTER_GRANT_WRITE_LOCK = 'lock:master:grant-write';\n//# sourceMappingURL=constants.js.map","import observer from 'observable-webworkers';\nimport { WORKER_REQUEST_READ_LOCK, WORKER_RELEASE_READ_LOCK, MASTER_GRANT_READ_LOCK, WORKER_REQUEST_WRITE_LOCK, WORKER_RELEASE_WRITE_LOCK, MASTER_GRANT_WRITE_LOCK } from './constants.js';\nimport { nanoid } from './utils.js';\nconst handleWorkerLockRequest = (emitter, masterEvent, requestType, releaseType, grantType) => {\n return (worker, event) => {\n if (event.data.type !== requestType) {\n return;\n }\n const requestEvent = {\n type: event.data.type,\n name: event.data.name,\n identifier: event.data.identifier\n };\n emitter.dispatchEvent(new MessageEvent(masterEvent, {\n data: {\n name: requestEvent.name,\n handler: async () => {\n // grant lock to worker\n worker.postMessage({\n type: grantType,\n name: requestEvent.name,\n identifier: requestEvent.identifier\n });\n // wait for worker to finish\n await new Promise((resolve) => {\n const releaseEventListener = (event) => {\n if (event == null || event.data == null) {\n return;\n }\n const releaseEvent = {\n type: event.data.type,\n name: event.data.name,\n identifier: event.data.identifier\n };\n if (releaseEvent.type === releaseType && releaseEvent.identifier === requestEvent.identifier) {\n worker.removeEventListener('message', releaseEventListener);\n resolve();\n }\n };\n worker.addEventListener('message', releaseEventListener);\n });\n }\n }\n }));\n };\n};\nconst makeWorkerLockRequest = (name, requestType, grantType, releaseType) => {\n return async () => {\n const id = nanoid();\n globalThis.postMessage({\n type: requestType,\n identifier: id,\n name\n });\n return new Promise((resolve) => {\n const listener = (event) => {\n if (event == null || event.data == null) {\n return;\n }\n const responseEvent = {\n type: event.data.type,\n identifier: event.data.identifier\n };\n if (responseEvent.type === grantType && responseEvent.identifier === id) {\n globalThis.removeEventListener('message', listener);\n // grant lock\n resolve(() => {\n // release lock\n globalThis.postMessage({\n type: releaseType,\n identifier: id,\n name\n });\n });\n }\n };\n globalThis.addEventListener('message', listener);\n });\n };\n};\nconst defaultOptions = {\n singleProcess: false\n};\nexport default (options) => {\n options = Object.assign({}, defaultOptions, options);\n const isPrimary = Boolean(globalThis.document) || options.singleProcess;\n if (isPrimary) {\n const emitter = new EventTarget();\n observer.addEventListener('message', handleWorkerLockRequest(emitter, 'requestReadLock', WORKER_REQUEST_READ_LOCK, WORKER_RELEASE_READ_LOCK, MASTER_GRANT_READ_LOCK));\n observer.addEventListener('message', handleWorkerLockRequest(emitter, 'requestWriteLock', WORKER_REQUEST_WRITE_LOCK, WORKER_RELEASE_WRITE_LOCK, MASTER_GRANT_WRITE_LOCK));\n return emitter;\n }\n return {\n isWorker: true,\n readLock: (name) => makeWorkerLockRequest(name, WORKER_REQUEST_READ_LOCK, MASTER_GRANT_READ_LOCK, WORKER_RELEASE_READ_LOCK),\n writeLock: (name) => makeWorkerLockRequest(name, WORKER_REQUEST_WRITE_LOCK, MASTER_GRANT_WRITE_LOCK, WORKER_RELEASE_WRITE_LOCK)\n };\n};\n//# sourceMappingURL=browser.js.map","export const nanoid = (size = 21) => {\n return Math.random().toString().substring(2);\n};\n//# sourceMappingURL=utils.js.map","/**\n * @packageDocumentation\n *\n * - Reads occur concurrently\n * - Writes occur one at a time\n * - No reads occur while a write operation is in progress\n * - Locks can be created with different names\n * - Reads/writes can time out\n *\n * ## Usage\n *\n * ```javascript\n * import mortice from 'mortice'\n * import delay from 'delay'\n *\n * // the lock name & options objects are both optional\n * const mutex = mortice('my-lock', {\n *\n * // how long before write locks time out (default: 24 hours)\n * timeout: 30000,\n *\n * // control how many read operations are executed concurrently (default: Infinity)\n * concurrency: 5,\n *\n * // by default the the lock will be held on the main thread, set this to true if the\n * // a lock should reside on each worker (default: false)\n * singleProcess: false\n * })\n *\n * Promise.all([\n * (async () => {\n * const release = await mutex.readLock()\n *\n * try {\n * console.info('read 1')\n * } finally {\n * release()\n * }\n * })(),\n * (async () => {\n * const release = await mutex.readLock()\n *\n * try {\n * console.info('read 2')\n * } finally {\n * release()\n * }\n * })(),\n * (async () => {\n * const release = await mutex.writeLock()\n *\n * try {\n * await delay(1000)\n *\n * console.info('write 1')\n * } finally {\n * release()\n * }\n * })(),\n * (async () => {\n * const release = await mutex.readLock()\n *\n * try {\n * console.info('read 3')\n * } finally {\n * release()\n * }\n * })()\n * ])\n * ```\n *\n * read 1\n * read 2\n * \n * write 1\n * read 3\n *\n * ## Browser\n *\n * Because there's no global way to evesdrop on messages sent by Web Workers, please pass all created Web Workers to the [`observable-webworkers`](https://npmjs.org/package/observable-webworkers) module:\n *\n * ```javascript\n * // main.js\n * import mortice from 'mortice'\n * import observe from 'observable-webworkers'\n *\n * // create our lock on the main thread, it will be held here\n * const mutex = mortice()\n *\n * const worker = new Worker('worker.js')\n *\n * observe(worker)\n * ```\n *\n * ```javascript\n * // worker.js\n * import mortice from 'mortice'\n * import delay from 'delay'\n *\n * const mutex = mortice()\n *\n * let release = await mutex.readLock()\n * // read something\n * release()\n *\n * release = await mutex.writeLock()\n * // write something\n * release()\n * ```\n */\nimport PQueue from 'p-queue';\nimport pTimeout from 'p-timeout';\nimport impl from './node.js';\nconst mutexes = {};\nlet implementation;\nasync function createReleaseable(queue, options) {\n let res;\n const p = new Promise((resolve) => {\n res = resolve;\n });\n void queue.add(async () => pTimeout((async () => {\n await new Promise((resolve) => {\n res(() => {\n resolve();\n });\n });\n })(), {\n milliseconds: options.timeout\n }));\n return p;\n}\nconst createMutex = (name, options) => {\n if (implementation.isWorker === true) {\n return {\n readLock: implementation.readLock(name, options),\n writeLock: implementation.writeLock(name, options)\n };\n }\n const masterQueue = new PQueue({ concurrency: 1 });\n let readQueue;\n return {\n async readLock() {\n // If there's already a read queue, just add the task to it\n if (readQueue != null) {\n return createReleaseable(readQueue, options);\n }\n // Create a new read queue\n readQueue = new PQueue({\n concurrency: options.concurrency,\n autoStart: false\n });\n const localReadQueue = readQueue;\n // Add the task to the read queue\n const readPromise = createReleaseable(readQueue, options);\n void masterQueue.add(async () => {\n // Start the task only once the master queue has completed processing\n // any previous tasks\n localReadQueue.start();\n // Once all the tasks in the read queue have completed, remove it so\n // that the next read lock will occur after any write locks that were\n // started in the interim\n await localReadQueue.onIdle()\n .then(() => {\n if (readQueue === localReadQueue) {\n readQueue = null;\n }\n });\n });\n return readPromise;\n },\n async writeLock() {\n // Remove the read queue reference, so that any later read locks will be\n // added to a new queue that starts after this write lock has been\n // released\n readQueue = null;\n return createReleaseable(masterQueue, options);\n }\n };\n};\nconst defaultOptions = {\n name: 'lock',\n concurrency: Infinity,\n timeout: 84600000,\n singleProcess: false\n};\nexport default function createMortice(options) {\n const opts = Object.assign({}, defaultOptions, options);\n if (implementation == null) {\n implementation = impl(opts);\n if (implementation.isWorker !== true) {\n // we are master, set up worker requests\n implementation.addEventListener('requestReadLock', (event) => {\n if (mutexes[event.data.name] == null) {\n return;\n }\n void mutexes[event.data.name].readLock()\n .then(async (release) => event.data.handler().finally(() => { release(); }));\n });\n implementation.addEventListener('requestWriteLock', async (event) => {\n if (mutexes[event.data.name] == null) {\n return;\n }\n void mutexes[event.data.name].writeLock()\n .then(async (release) => event.data.handler().finally(() => { release(); }));\n });\n }\n }\n if (mutexes[opts.name] == null) {\n mutexes[opts.name] = createMutex(opts.name, opts);\n }\n return mutexes[opts.name];\n}\n//# sourceMappingURL=index.js.map","export const codes = {\n ERR_INVALID_PARAMETERS: 'ERR_INVALID_PARAMETERS'\n};\n//# sourceMappingURL=errors.js.map","/* eslint-disable import/export */\n/* eslint-disable complexity */\n/* eslint-disable @typescript-eslint/no-namespace */\n/* eslint-disable @typescript-eslint/no-unnecessary-boolean-literal-compare */\n/* eslint-disable @typescript-eslint/no-empty-interface */\nimport { encodeMessage, decodeMessage, message } from 'protons-runtime';\nexport var Peer;\n(function (Peer) {\n let Peer$metadataEntry;\n (function (Peer$metadataEntry) {\n let _codec;\n Peer$metadataEntry.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.key != null && obj.key !== '')) {\n w.uint32(10);\n w.string(obj.key);\n }\n if ((obj.value != null && obj.value.byteLength > 0)) {\n w.uint32(18);\n w.bytes(obj.value);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length) => {\n const obj = {\n key: '',\n value: new Uint8Array(0)\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1:\n obj.key = reader.string();\n break;\n case 2:\n obj.value = reader.bytes();\n break;\n default:\n reader.skipType(tag & 7);\n break;\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n Peer$metadataEntry.encode = (obj) => {\n return encodeMessage(obj, Peer$metadataEntry.codec());\n };\n Peer$metadataEntry.decode = (buf) => {\n return decodeMessage(buf, Peer$metadataEntry.codec());\n };\n })(Peer$metadataEntry = Peer.Peer$metadataEntry || (Peer.Peer$metadataEntry = {}));\n let Peer$tagsEntry;\n (function (Peer$tagsEntry) {\n let _codec;\n Peer$tagsEntry.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.key != null && obj.key !== '')) {\n w.uint32(10);\n w.string(obj.key);\n }\n if (obj.value != null) {\n w.uint32(18);\n Tag.codec().encode(obj.value, w);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length) => {\n const obj = {\n key: ''\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1:\n obj.key = reader.string();\n break;\n case 2:\n obj.value = Tag.codec().decode(reader, reader.uint32());\n break;\n default:\n reader.skipType(tag & 7);\n break;\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n Peer$tagsEntry.encode = (obj) => {\n return encodeMessage(obj, Peer$tagsEntry.codec());\n };\n Peer$tagsEntry.decode = (buf) => {\n return decodeMessage(buf, Peer$tagsEntry.codec());\n };\n })(Peer$tagsEntry = Peer.Peer$tagsEntry || (Peer.Peer$tagsEntry = {}));\n let _codec;\n Peer.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if (obj.addresses != null) {\n for (const value of obj.addresses) {\n w.uint32(10);\n Address.codec().encode(value, w);\n }\n }\n if (obj.protocols != null) {\n for (const value of obj.protocols) {\n w.uint32(18);\n w.string(value);\n }\n }\n if (obj.publicKey != null) {\n w.uint32(34);\n w.bytes(obj.publicKey);\n }\n if (obj.peerRecordEnvelope != null) {\n w.uint32(42);\n w.bytes(obj.peerRecordEnvelope);\n }\n if (obj.metadata != null && obj.metadata.size !== 0) {\n for (const [key, value] of obj.metadata.entries()) {\n w.uint32(50);\n Peer.Peer$metadataEntry.codec().encode({ key, value }, w);\n }\n }\n if (obj.tags != null && obj.tags.size !== 0) {\n for (const [key, value] of obj.tags.entries()) {\n w.uint32(58);\n Peer.Peer$tagsEntry.codec().encode({ key, value }, w);\n }\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length) => {\n const obj = {\n addresses: [],\n protocols: [],\n metadata: new Map(),\n tags: new Map()\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1:\n obj.addresses.push(Address.codec().decode(reader, reader.uint32()));\n break;\n case 2:\n obj.protocols.push(reader.string());\n break;\n case 4:\n obj.publicKey = reader.bytes();\n break;\n case 5:\n obj.peerRecordEnvelope = reader.bytes();\n break;\n case 6: {\n const entry = Peer.Peer$metadataEntry.codec().decode(reader, reader.uint32());\n obj.metadata.set(entry.key, entry.value);\n break;\n }\n case 7: {\n const entry = Peer.Peer$tagsEntry.codec().decode(reader, reader.uint32());\n obj.tags.set(entry.key, entry.value);\n break;\n }\n default:\n reader.skipType(tag & 7);\n break;\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n Peer.encode = (obj) => {\n return encodeMessage(obj, Peer.codec());\n };\n Peer.decode = (buf) => {\n return decodeMessage(buf, Peer.codec());\n };\n})(Peer || (Peer = {}));\nexport var Address;\n(function (Address) {\n let _codec;\n Address.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.multiaddr != null && obj.multiaddr.byteLength > 0)) {\n w.uint32(10);\n w.bytes(obj.multiaddr);\n }\n if (obj.isCertified != null) {\n w.uint32(16);\n w.bool(obj.isCertified);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length) => {\n const obj = {\n multiaddr: new Uint8Array(0)\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1:\n obj.multiaddr = reader.bytes();\n break;\n case 2:\n obj.isCertified = reader.bool();\n break;\n default:\n reader.skipType(tag & 7);\n break;\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n Address.encode = (obj) => {\n return encodeMessage(obj, Address.codec());\n };\n Address.decode = (buf) => {\n return decodeMessage(buf, Address.codec());\n };\n})(Address || (Address = {}));\nexport var Tag;\n(function (Tag) {\n let _codec;\n Tag.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.value != null && obj.value !== 0)) {\n w.uint32(8);\n w.uint32(obj.value);\n }\n if (obj.expiry != null) {\n w.uint32(16);\n w.uint64(obj.expiry);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length) => {\n const obj = {\n value: 0\n };\n const end = length == null ? reader.len : reader.pos + length;\n while (reader.pos < end) {\n const tag = reader.uint32();\n switch (tag >>> 3) {\n case 1:\n obj.value = reader.uint32();\n break;\n case 2:\n obj.expiry = reader.uint64();\n break;\n default:\n reader.skipType(tag & 7);\n break;\n }\n }\n return obj;\n });\n }\n return _codec;\n };\n Tag.encode = (obj) => {\n return encodeMessage(obj, Tag.codec());\n };\n Tag.decode = (buf) => {\n return decodeMessage(buf, Tag.codec());\n };\n})(Tag || (Tag = {}));\n//# sourceMappingURL=peer.js.map","import { peerIdFromPeerId } from '@libp2p/peer-id';\nimport { multiaddr } from '@multiformats/multiaddr';\nimport { Peer as PeerPB } from '../pb/peer.js';\nexport function bytesToPeer(peerId, buf) {\n const peer = PeerPB.decode(buf);\n if (peer.publicKey != null && peerId.publicKey == null) {\n peerId = peerIdFromPeerId({\n ...peerId,\n publicKey: peerId.publicKey\n });\n }\n const tags = new Map();\n // remove any expired tags\n const now = BigInt(Date.now());\n for (const [key, tag] of peer.tags.entries()) {\n if (tag.expiry != null && tag.expiry < now) {\n continue;\n }\n tags.set(key, tag);\n }\n return {\n ...peer,\n id: peerId,\n addresses: peer.addresses.map(({ multiaddr: ma, isCertified }) => {\n return {\n multiaddr: multiaddr(ma),\n isCertified: isCertified ?? false\n };\n }),\n metadata: peer.metadata,\n peerRecordEnvelope: peer.peerRecordEnvelope ?? undefined,\n tags\n };\n}\n//# sourceMappingURL=bytes-to-peer.js.map","import { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport { toString as uint8ArrayToString } from 'uint8arrays/to-string';\nconst pathSepS = '/';\nconst pathSepB = new TextEncoder().encode(pathSepS);\nconst pathSep = pathSepB[0];\n/**\n * A Key represents the unique identifier of an object.\n * Our Key scheme is inspired by file systems and Google App Engine key model.\n * Keys are meant to be unique across a system. Keys are hierarchical,\n * incorporating more and more specific namespaces. Thus keys can be deemed\n * 'children' or 'ancestors' of other keys:\n * - `new Key('/Comedy')`\n * - `new Key('/Comedy/MontyPython')`\n * Also, every namespace can be parametrized to embed relevant object\n * information. For example, the Key `name` (most specific namespace) could\n * include the object type:\n * - `new Key('/Comedy/MontyPython/Actor:JohnCleese')`\n * - `new Key('/Comedy/MontyPython/Sketch:CheeseShop')`\n * - `new Key('/Comedy/MontyPython/Sketch:CheeseShop/Character:Mousebender')`\n *\n */\nexport class Key {\n _buf;\n /**\n * @param {string | Uint8Array} s\n * @param {boolean} [clean]\n */\n constructor(s, clean) {\n if (typeof s === 'string') {\n this._buf = uint8ArrayFromString(s);\n }\n else if (s instanceof Uint8Array) {\n this._buf = s;\n }\n else {\n throw new Error('Invalid key, should be String of Uint8Array');\n }\n if (clean == null) {\n clean = true;\n }\n if (clean) {\n this.clean();\n }\n if (this._buf.byteLength === 0 || this._buf[0] !== pathSep) {\n throw new Error('Invalid key');\n }\n }\n /**\n * Convert to the string representation\n *\n * @param {import('uint8arrays/to-string').SupportedEncodings} [encoding='utf8'] - The encoding to use.\n * @returns {string}\n */\n toString(encoding = 'utf8') {\n return uint8ArrayToString(this._buf, encoding);\n }\n /**\n * Return the Uint8Array representation of the key\n *\n * @returns {Uint8Array}\n */\n uint8Array() {\n return this._buf;\n }\n /**\n * Return string representation of the key\n *\n * @returns {string}\n */\n get [Symbol.toStringTag]() {\n return `Key(${this.toString()})`;\n }\n /**\n * Constructs a key out of a namespace array.\n *\n * @param {Array} list - The array of namespaces\n * @returns {Key}\n *\n * @example\n * ```js\n * Key.withNamespaces(['one', 'two'])\n * // => Key('/one/two')\n * ```\n */\n static withNamespaces(list) {\n return new Key(list.join(pathSepS));\n }\n /**\n * Returns a randomly (uuid) generated key.\n *\n * @returns {Key}\n *\n * @example\n * ```js\n * Key.random()\n * // => Key('/344502982398')\n * ```\n */\n static random() {\n return new Key(Math.random().toString().substring(2));\n }\n /**\n * @param {*} other\n */\n static asKey(other) {\n if (other instanceof Uint8Array || typeof other === 'string') {\n // we can create a key from this\n return new Key(other);\n }\n if (typeof other.uint8Array === 'function') {\n // this is an older version or may have crossed the esm/cjs boundary\n return new Key(other.uint8Array());\n }\n return null;\n }\n /**\n * Cleanup the current key\n *\n * @returns {void}\n */\n clean() {\n if (this._buf == null || this._buf.byteLength === 0) {\n this._buf = pathSepB;\n }\n if (this._buf[0] !== pathSep) {\n const bytes = new Uint8Array(this._buf.byteLength + 1);\n bytes.fill(pathSep, 0, 1);\n bytes.set(this._buf, 1);\n this._buf = bytes;\n }\n // normalize does not remove trailing slashes\n while (this._buf.byteLength > 1 && this._buf[this._buf.byteLength - 1] === pathSep) {\n this._buf = this._buf.subarray(0, -1);\n }\n }\n /**\n * Check if the given key is sorted lower than ourself.\n *\n * @param {Key} key - The other Key to check against\n * @returns {boolean}\n */\n less(key) {\n const list1 = this.list();\n const list2 = key.list();\n for (let i = 0; i < list1.length; i++) {\n if (list2.length < i + 1) {\n return false;\n }\n const c1 = list1[i];\n const c2 = list2[i];\n if (c1 < c2) {\n return true;\n }\n else if (c1 > c2) {\n return false;\n }\n }\n return list1.length < list2.length;\n }\n /**\n * Returns the key with all parts in reversed order.\n *\n * @returns {Key}\n *\n * @example\n * ```js\n * new Key('/Comedy/MontyPython/Actor:JohnCleese').reverse()\n * // => Key('/Actor:JohnCleese/MontyPython/Comedy')\n * ```\n */\n reverse() {\n return Key.withNamespaces(this.list().slice().reverse());\n }\n /**\n * Returns the `namespaces` making up this Key.\n *\n * @returns {Array}\n */\n namespaces() {\n return this.list();\n }\n /** Returns the \"base\" namespace of this key.\n *\n * @returns {string}\n *\n * @example\n * ```js\n * new Key('/Comedy/MontyPython/Actor:JohnCleese').baseNamespace()\n * // => 'Actor:JohnCleese'\n * ```\n */\n baseNamespace() {\n const ns = this.namespaces();\n return ns[ns.length - 1];\n }\n /**\n * Returns the `list` representation of this key.\n *\n * @returns {Array}\n *\n * @example\n * ```js\n * new Key('/Comedy/MontyPython/Actor:JohnCleese').list()\n * // => ['Comedy', 'MontyPythong', 'Actor:JohnCleese']\n * ```\n */\n list() {\n return this.toString().split(pathSepS).slice(1);\n }\n /**\n * Returns the \"type\" of this key (value of last namespace).\n *\n * @returns {string}\n *\n * @example\n * ```js\n * new Key('/Comedy/MontyPython/Actor:JohnCleese').type()\n * // => 'Actor'\n * ```\n */\n type() {\n return namespaceType(this.baseNamespace());\n }\n /**\n * Returns the \"name\" of this key (field of last namespace).\n *\n * @returns {string}\n *\n * @example\n * ```js\n * new Key('/Comedy/MontyPython/Actor:JohnCleese').name()\n * // => 'JohnCleese'\n * ```\n */\n name() {\n return namespaceValue(this.baseNamespace());\n }\n /**\n * Returns an \"instance\" of this type key (appends value to namespace).\n *\n * @param {string} s - The string to append.\n * @returns {Key}\n *\n * @example\n * ```js\n * new Key('/Comedy/MontyPython/Actor').instance('JohnClesse')\n * // => Key('/Comedy/MontyPython/Actor:JohnCleese')\n * ```\n */\n instance(s) {\n return new Key(this.toString() + ':' + s);\n }\n /**\n * Returns the \"path\" of this key (parent + type).\n *\n * @returns {Key}\n *\n * @example\n * ```js\n * new Key('/Comedy/MontyPython/Actor:JohnCleese').path()\n * // => Key('/Comedy/MontyPython/Actor')\n * ```\n */\n path() {\n let p = this.parent().toString();\n if (!p.endsWith(pathSepS)) {\n p += pathSepS;\n }\n p += this.type();\n return new Key(p);\n }\n /**\n * Returns the `parent` Key of this Key.\n *\n * @returns {Key}\n *\n * @example\n * ```js\n * new Key(\"/Comedy/MontyPython/Actor:JohnCleese\").parent()\n * // => Key(\"/Comedy/MontyPython\")\n * ```\n */\n parent() {\n const list = this.list();\n if (list.length === 1) {\n return new Key(pathSepS);\n }\n return new Key(list.slice(0, -1).join(pathSepS));\n }\n /**\n * Returns the `child` Key of this Key.\n *\n * @param {Key} key - The child Key to add\n * @returns {Key}\n *\n * @example\n * ```js\n * new Key('/Comedy/MontyPython').child(new Key('Actor:JohnCleese'))\n * // => Key('/Comedy/MontyPython/Actor:JohnCleese')\n * ```\n */\n child(key) {\n if (this.toString() === pathSepS) {\n return key;\n }\n else if (key.toString() === pathSepS) {\n return this;\n }\n return new Key(this.toString() + key.toString(), false);\n }\n /**\n * Returns whether this key is a prefix of `other`\n *\n * @param {Key} other - The other key to test against\n * @returns {boolean}\n *\n * @example\n * ```js\n * new Key('/Comedy').isAncestorOf('/Comedy/MontyPython')\n * // => true\n * ```\n */\n isAncestorOf(other) {\n if (other.toString() === this.toString()) {\n return false;\n }\n return other.toString().startsWith(this.toString());\n }\n /**\n * Returns whether this key is a contains another as prefix.\n *\n * @param {Key} other - The other Key to test against\n * @returns {boolean}\n *\n * @example\n * ```js\n * new Key('/Comedy/MontyPython').isDecendantOf('/Comedy')\n * // => true\n * ```\n */\n isDecendantOf(other) {\n if (other.toString() === this.toString()) {\n return false;\n }\n return this.toString().startsWith(other.toString());\n }\n /**\n * Checks if this key has only one namespace.\n *\n * @returns {boolean}\n */\n isTopLevel() {\n return this.list().length === 1;\n }\n /**\n * Concats one or more Keys into one new Key.\n *\n * @param {Array} keys - The array of keys to concatenate\n * @returns {Key}\n */\n concat(...keys) {\n return Key.withNamespaces([...this.namespaces(), ...flatten(keys.map(key => key.namespaces()))]);\n }\n}\n/**\n * The first component of a namespace. `foo` in `foo:bar`\n *\n * @param {string} ns\n * @returns {string}\n */\nfunction namespaceType(ns) {\n const parts = ns.split(':');\n if (parts.length < 2) {\n return '';\n }\n return parts.slice(0, -1).join(':');\n}\n/**\n * The last component of a namespace, `baz` in `foo:bar:baz`.\n *\n * @param {string} ns\n * @returns {string}\n */\nfunction namespaceValue(ns) {\n const parts = ns.split(':');\n return parts[parts.length - 1];\n}\n/**\n * Flatten array of arrays (only one level)\n *\n * @template T\n * @param {Array} arr\n * @returns {T[]}\n */\nfunction flatten(arr) {\n return ([]).concat(...arr);\n}\n//# sourceMappingURL=key.js.map","import { CodeError } from '@libp2p/interface';\nimport { isPeerId } from '@libp2p/interface';\nimport { Key } from 'interface-datastore/key';\nimport { codes } from '../errors.js';\nexport const NAMESPACE_COMMON = '/peers/';\nexport function peerIdToDatastoreKey(peerId) {\n if (!isPeerId(peerId) || peerId.type == null) {\n throw new CodeError('Invalid PeerId', codes.ERR_INVALID_PARAMETERS);\n }\n const b32key = peerId.toCID().toString();\n return new Key(`${NAMESPACE_COMMON}${b32key}`);\n}\n//# sourceMappingURL=peer-id-to-datastore-key.js.map","import { CodeError } from '@libp2p/interface';\nimport { isMultiaddr, multiaddr } from '@multiformats/multiaddr';\nimport { codes } from '../errors.js';\nexport async function dedupeFilterAndSortAddresses(peerId, filter, addresses) {\n const addressMap = new Map();\n for (const addr of addresses) {\n if (addr == null) {\n continue;\n }\n if (addr.multiaddr instanceof Uint8Array) {\n addr.multiaddr = multiaddr(addr.multiaddr);\n }\n if (!isMultiaddr(addr.multiaddr)) {\n throw new CodeError('Multiaddr was invalid', codes.ERR_INVALID_PARAMETERS);\n }\n if (!(await filter(peerId, addr.multiaddr))) {\n continue;\n }\n const isCertified = addr.isCertified ?? false;\n const maStr = addr.multiaddr.toString();\n const existingAddr = addressMap.get(maStr);\n if (existingAddr != null) {\n addr.isCertified = existingAddr.isCertified || isCertified;\n }\n else {\n addressMap.set(maStr, {\n multiaddr: addr.multiaddr,\n isCertified\n });\n }\n }\n return [...addressMap.values()]\n .sort((a, b) => {\n return a.multiaddr.toString().localeCompare(b.multiaddr.toString());\n })\n .map(({ isCertified, multiaddr }) => ({\n isCertified,\n multiaddr: multiaddr.bytes\n }));\n}\n//# sourceMappingURL=dedupe-addresses.js.map","import { CodeError } from '@libp2p/interface';\nimport { equals as uint8arrayEquals } from 'uint8arrays/equals';\nimport { codes } from '../errors.js';\nimport { dedupeFilterAndSortAddresses } from './dedupe-addresses.js';\nexport async function toPeerPB(peerId, data, strategy, options) {\n if (data == null) {\n throw new CodeError('Invalid PeerData', codes.ERR_INVALID_PARAMETERS);\n }\n if (data.publicKey != null && peerId.publicKey != null && !uint8arrayEquals(data.publicKey, peerId.publicKey)) {\n throw new CodeError('publicKey bytes do not match peer id publicKey bytes', codes.ERR_INVALID_PARAMETERS);\n }\n const existingPeer = options.existingPeer;\n if (existingPeer != null && !peerId.equals(existingPeer.id)) {\n throw new CodeError('peer id did not match existing peer id', codes.ERR_INVALID_PARAMETERS);\n }\n let addresses = existingPeer?.addresses ?? [];\n let protocols = new Set(existingPeer?.protocols ?? []);\n let metadata = existingPeer?.metadata ?? new Map();\n let tags = existingPeer?.tags ?? new Map();\n let peerRecordEnvelope = existingPeer?.peerRecordEnvelope;\n // when patching, we replace the original fields with passed values\n if (strategy === 'patch') {\n if (data.multiaddrs != null || data.addresses != null) {\n addresses = [];\n if (data.multiaddrs != null) {\n addresses.push(...data.multiaddrs.map(multiaddr => ({\n isCertified: false,\n multiaddr\n })));\n }\n if (data.addresses != null) {\n addresses.push(...data.addresses);\n }\n }\n if (data.protocols != null) {\n protocols = new Set(data.protocols);\n }\n if (data.metadata != null) {\n const metadataEntries = data.metadata instanceof Map ? [...data.metadata.entries()] : Object.entries(data.metadata);\n metadata = createSortedMap(metadataEntries, {\n validate: validateMetadata\n });\n }\n if (data.tags != null) {\n const tagsEntries = data.tags instanceof Map ? [...data.tags.entries()] : Object.entries(data.tags);\n tags = createSortedMap(tagsEntries, {\n validate: validateTag,\n map: mapTag\n });\n }\n if (data.peerRecordEnvelope != null) {\n peerRecordEnvelope = data.peerRecordEnvelope;\n }\n }\n // when merging, we join the original fields with passed values\n if (strategy === 'merge') {\n if (data.multiaddrs != null) {\n addresses.push(...data.multiaddrs.map(multiaddr => ({\n isCertified: false,\n multiaddr\n })));\n }\n if (data.addresses != null) {\n addresses.push(...data.addresses);\n }\n if (data.protocols != null) {\n protocols = new Set([...protocols, ...data.protocols]);\n }\n if (data.metadata != null) {\n const metadataEntries = data.metadata instanceof Map ? [...data.metadata.entries()] : Object.entries(data.metadata);\n for (const [key, value] of metadataEntries) {\n if (value == null) {\n metadata.delete(key);\n }\n else {\n metadata.set(key, value);\n }\n }\n metadata = createSortedMap([...metadata.entries()], {\n validate: validateMetadata\n });\n }\n if (data.tags != null) {\n const tagsEntries = data.tags instanceof Map ? [...data.tags.entries()] : Object.entries(data.tags);\n const mergedTags = new Map(tags);\n for (const [key, value] of tagsEntries) {\n if (value == null) {\n mergedTags.delete(key);\n }\n else {\n mergedTags.set(key, value);\n }\n }\n tags = createSortedMap([...mergedTags.entries()], {\n validate: validateTag,\n map: mapTag\n });\n }\n if (data.peerRecordEnvelope != null) {\n peerRecordEnvelope = data.peerRecordEnvelope;\n }\n }\n const output = {\n addresses: await dedupeFilterAndSortAddresses(peerId, options.addressFilter ?? (async () => true), addresses),\n protocols: [...protocols.values()].sort((a, b) => {\n return a.localeCompare(b);\n }),\n metadata,\n tags,\n publicKey: existingPeer?.id.publicKey ?? data.publicKey ?? peerId.publicKey,\n peerRecordEnvelope\n };\n // Ed25519 and secp256k1 have their public key embedded in them so no need to duplicate it\n if (peerId.type !== 'RSA') {\n delete output.publicKey;\n }\n return output;\n}\n/**\n * In JS maps are ordered by insertion order so create a new map with the\n * keys inserted in alphabetical order.\n */\nfunction createSortedMap(entries, options) {\n const output = new Map();\n for (const [key, value] of entries) {\n if (value == null) {\n continue;\n }\n options.validate(key, value);\n }\n for (const [key, value] of entries.sort(([a], [b]) => {\n return a.localeCompare(b);\n })) {\n if (value != null) {\n output.set(key, options.map?.(key, value) ?? value);\n }\n }\n return output;\n}\nfunction validateMetadata(key, value) {\n if (typeof key !== 'string') {\n throw new CodeError('Metadata key must be a string', codes.ERR_INVALID_PARAMETERS);\n }\n if (!(value instanceof Uint8Array)) {\n throw new CodeError('Metadata value must be a Uint8Array', codes.ERR_INVALID_PARAMETERS);\n }\n}\nfunction validateTag(key, tag) {\n if (typeof key !== 'string') {\n throw new CodeError('Tag name must be a string', codes.ERR_INVALID_PARAMETERS);\n }\n if (tag.value != null) {\n if (parseInt(`${tag.value}`, 10) !== tag.value) {\n throw new CodeError('Tag value must be an integer', codes.ERR_INVALID_PARAMETERS);\n }\n if (tag.value < 0 || tag.value > 100) {\n throw new CodeError('Tag value must be between 0-100', codes.ERR_INVALID_PARAMETERS);\n }\n }\n if (tag.ttl != null) {\n if (parseInt(`${tag.ttl}`, 10) !== tag.ttl) {\n throw new CodeError('Tag ttl must be an integer', codes.ERR_INVALID_PARAMETERS);\n }\n if (tag.ttl < 0) {\n throw new CodeError('Tag ttl must be between greater than 0', codes.ERR_INVALID_PARAMETERS);\n }\n }\n}\nfunction mapTag(key, tag) {\n let expiry;\n if (tag.expiry != null) {\n expiry = tag.expiry;\n }\n if (tag.ttl != null) {\n expiry = BigInt(Date.now() + Number(tag.ttl));\n }\n return {\n value: tag.value ?? 0,\n expiry\n };\n}\n//# sourceMappingURL=to-peer-pb.js.map","import { CodeError } from '@libp2p/interface';\nimport { PeerMap } from '@libp2p/peer-collections';\nimport { peerIdFromBytes } from '@libp2p/peer-id';\nimport mortice, {} from 'mortice';\nimport { base32 } from 'multiformats/bases/base32';\nimport { equals as uint8ArrayEquals } from 'uint8arrays/equals';\nimport { codes } from './errors.js';\nimport { Peer as PeerPB } from './pb/peer.js';\nimport { bytesToPeer } from './utils/bytes-to-peer.js';\nimport { NAMESPACE_COMMON, peerIdToDatastoreKey } from './utils/peer-id-to-datastore-key.js';\nimport { toPeerPB } from './utils/to-peer-pb.js';\nfunction decodePeer(key, value, cache) {\n // /peers/${peer-id-as-libp2p-key-cid-string-in-base-32}\n const base32Str = key.toString().split('/')[2];\n const buf = base32.decode(base32Str);\n const peerId = peerIdFromBytes(buf);\n const cached = cache.get(peerId);\n if (cached != null) {\n return cached;\n }\n const peer = bytesToPeer(peerId, value);\n cache.set(peerId, peer);\n return peer;\n}\nfunction mapQuery(query, cache) {\n if (query == null) {\n return {};\n }\n return {\n prefix: NAMESPACE_COMMON,\n filters: (query.filters ?? []).map(fn => ({ key, value }) => {\n return fn(decodePeer(key, value, cache));\n }),\n orders: (query.orders ?? []).map(fn => (a, b) => {\n return fn(decodePeer(a.key, a.value, cache), decodePeer(b.key, b.value, cache));\n })\n };\n}\nexport class PersistentStore {\n peerId;\n datastore;\n lock;\n addressFilter;\n constructor(components, init = {}) {\n this.peerId = components.peerId;\n this.datastore = components.datastore;\n this.addressFilter = init.addressFilter;\n this.lock = mortice({\n name: 'peer-store',\n singleProcess: true\n });\n }\n async has(peerId) {\n return this.datastore.has(peerIdToDatastoreKey(peerId));\n }\n async delete(peerId) {\n if (this.peerId.equals(peerId)) {\n throw new CodeError('Cannot delete self peer', codes.ERR_INVALID_PARAMETERS);\n }\n await this.datastore.delete(peerIdToDatastoreKey(peerId));\n }\n async load(peerId) {\n const buf = await this.datastore.get(peerIdToDatastoreKey(peerId));\n return bytesToPeer(peerId, buf);\n }\n async save(peerId, data) {\n const { existingBuf, existingPeer } = await this.#findExistingPeer(peerId);\n const peerPb = await toPeerPB(peerId, data, 'patch', {\n addressFilter: this.addressFilter\n });\n return this.#saveIfDifferent(peerId, peerPb, existingBuf, existingPeer);\n }\n async patch(peerId, data) {\n const { existingBuf, existingPeer } = await this.#findExistingPeer(peerId);\n const peerPb = await toPeerPB(peerId, data, 'patch', {\n addressFilter: this.addressFilter,\n existingPeer\n });\n return this.#saveIfDifferent(peerId, peerPb, existingBuf, existingPeer);\n }\n async merge(peerId, data) {\n const { existingBuf, existingPeer } = await this.#findExistingPeer(peerId);\n const peerPb = await toPeerPB(peerId, data, 'merge', {\n addressFilter: this.addressFilter,\n existingPeer\n });\n return this.#saveIfDifferent(peerId, peerPb, existingBuf, existingPeer);\n }\n async *all(query) {\n const peerCache = new PeerMap();\n for await (const { key, value } of this.datastore.query(mapQuery(query ?? {}, peerCache))) {\n const peer = decodePeer(key, value, peerCache);\n if (peer.id.equals(this.peerId)) {\n // Skip self peer if present\n continue;\n }\n yield peer;\n }\n }\n async #findExistingPeer(peerId) {\n try {\n const existingBuf = await this.datastore.get(peerIdToDatastoreKey(peerId));\n const existingPeer = bytesToPeer(peerId, existingBuf);\n return {\n existingBuf,\n existingPeer\n };\n }\n catch (err) {\n if (err.code !== 'ERR_NOT_FOUND') {\n throw err;\n }\n }\n return {};\n }\n async #saveIfDifferent(peerId, peer, existingBuf, existingPeer) {\n const buf = PeerPB.encode(peer);\n if (existingBuf != null && uint8ArrayEquals(buf, existingBuf)) {\n return {\n peer: bytesToPeer(peerId, buf),\n previous: existingPeer,\n updated: false\n };\n }\n await this.datastore.put(peerIdToDatastoreKey(peerId), buf);\n return {\n peer: bytesToPeer(peerId, buf),\n previous: existingPeer,\n updated: true\n };\n }\n}\n//# sourceMappingURL=store.js.map","/**\n * @packageDocumentation\n *\n * The peer store is where libp2p stores data about the peers it has encountered on the network.\n */\nimport { RecordEnvelope, PeerRecord } from '@libp2p/peer-record';\nimport all from 'it-all';\nimport { PersistentStore } from './store.js';\n/**\n * An implementation of PeerStore that stores data in a Datastore\n */\nexport class PersistentPeerStore {\n store;\n events;\n peerId;\n log;\n constructor(components, init = {}) {\n this.log = components.logger.forComponent('libp2p:peer-store');\n this.events = components.events;\n this.peerId = components.peerId;\n this.store = new PersistentStore(components, init);\n }\n [Symbol.toStringTag] = '@libp2p/peer-store';\n async forEach(fn, query) {\n this.log.trace('forEach await read lock');\n const release = await this.store.lock.readLock();\n this.log.trace('forEach got read lock');\n try {\n for await (const peer of this.store.all(query)) {\n fn(peer);\n }\n }\n finally {\n this.log.trace('forEach release read lock');\n release();\n }\n }\n async all(query) {\n this.log.trace('all await read lock');\n const release = await this.store.lock.readLock();\n this.log.trace('all got read lock');\n try {\n return await all(this.store.all(query));\n }\n finally {\n this.log.trace('all release read lock');\n release();\n }\n }\n async delete(peerId) {\n this.log.trace('delete await write lock');\n const release = await this.store.lock.writeLock();\n this.log.trace('delete got write lock');\n try {\n await this.store.delete(peerId);\n }\n finally {\n this.log.trace('delete release write lock');\n release();\n }\n }\n async has(peerId) {\n this.log.trace('has await read lock');\n const release = await this.store.lock.readLock();\n this.log.trace('has got read lock');\n try {\n return await this.store.has(peerId);\n }\n finally {\n this.log.trace('has release read lock');\n release();\n }\n }\n async get(peerId) {\n this.log.trace('get await read lock');\n const release = await this.store.lock.readLock();\n this.log.trace('get got read lock');\n try {\n return await this.store.load(peerId);\n }\n finally {\n this.log.trace('get release read lock');\n release();\n }\n }\n async save(id, data) {\n this.log.trace('save await write lock');\n const release = await this.store.lock.writeLock();\n this.log.trace('save got write lock');\n try {\n const result = await this.store.save(id, data);\n this.#emitIfUpdated(id, result);\n return result.peer;\n }\n finally {\n this.log.trace('save release write lock');\n release();\n }\n }\n async patch(id, data) {\n this.log.trace('patch await write lock');\n const release = await this.store.lock.writeLock();\n this.log.trace('patch got write lock');\n try {\n const result = await this.store.patch(id, data);\n this.#emitIfUpdated(id, result);\n return result.peer;\n }\n finally {\n this.log.trace('patch release write lock');\n release();\n }\n }\n async merge(id, data) {\n this.log.trace('merge await write lock');\n const release = await this.store.lock.writeLock();\n this.log.trace('merge got write lock');\n try {\n const result = await this.store.merge(id, data);\n this.#emitIfUpdated(id, result);\n return result.peer;\n }\n finally {\n this.log.trace('merge release write lock');\n release();\n }\n }\n async consumePeerRecord(buf, expectedPeer) {\n const envelope = await RecordEnvelope.openAndCertify(buf, PeerRecord.DOMAIN);\n if (expectedPeer?.equals(envelope.peerId) === false) {\n this.log('envelope peer id was not the expected peer id - expected: %p received: %p', expectedPeer, envelope.peerId);\n return false;\n }\n const peerRecord = PeerRecord.createFromProtobuf(envelope.payload);\n let peer;\n try {\n peer = await this.get(envelope.peerId);\n }\n catch (err) {\n if (err.code !== 'ERR_NOT_FOUND') {\n throw err;\n }\n }\n // ensure seq is greater than, or equal to, the last received\n if (peer?.peerRecordEnvelope != null) {\n const storedEnvelope = await RecordEnvelope.createFromProtobuf(peer.peerRecordEnvelope);\n const storedRecord = PeerRecord.createFromProtobuf(storedEnvelope.payload);\n if (storedRecord.seqNumber >= peerRecord.seqNumber) {\n this.log('sequence number was lower or equal to existing sequence number - stored: %d received: %d', storedRecord.seqNumber, peerRecord.seqNumber);\n return false;\n }\n }\n await this.patch(peerRecord.peerId, {\n peerRecordEnvelope: buf,\n addresses: peerRecord.multiaddrs.map(multiaddr => ({\n isCertified: true,\n multiaddr\n }))\n });\n return true;\n }\n #emitIfUpdated(id, result) {\n if (!result.updated) {\n return;\n }\n if (this.peerId.equals(id)) {\n this.events.safeDispatchEvent('self:peer:update', { detail: result });\n }\n else {\n this.events.safeDispatchEvent('peer:update', { detail: result });\n }\n }\n}\n//# sourceMappingURL=index.js.map","/**\n * @packageDocumentation\n *\n * Mostly useful for tests or when you want to be explicit about consuming an iterable without doing anything with any yielded values.\n *\n * @example\n *\n * ```javascript\n * import drain from 'it-drain'\n *\n * // This can also be an iterator, generator, etc\n * const values = [0, 1, 2, 3, 4]\n *\n * drain(values)\n * ```\n *\n * Async sources must be awaited:\n *\n * ```javascript\n * import drain from 'it-drain'\n *\n * const values = async function * {\n * yield * [0, 1, 2, 3, 4]\n * }\n *\n * await drain(values())\n * ```\n */\nfunction isAsyncIterable(thing) {\n return thing[Symbol.asyncIterator] != null;\n}\nfunction drain(source) {\n if (isAsyncIterable(source)) {\n return (async () => {\n for await (const _ of source) { } // eslint-disable-line no-unused-vars,no-empty,@typescript-eslint/no-unused-vars\n })();\n }\n else {\n for (const _ of source) { } // eslint-disable-line no-unused-vars,no-empty,@typescript-eslint/no-unused-vars\n }\n}\nexport default drain;\n//# sourceMappingURL=index.js.map","/**\n * @packageDocumentation\n *\n * Filter values out of an (async)iterable\n *\n * @example\n *\n * ```javascript\n * import all from 'it-all'\n * import filter from 'it-filter'\n *\n * // This can also be an iterator, generator, etc\n * const values = [0, 1, 2, 3, 4]\n *\n * const fn = (val, index) => val > 2 // Return boolean to keep item\n *\n * const arr = all(filter(values, fn))\n *\n * console.info(arr) // 3, 4\n * ```\n *\n * Async sources and filter functions must be awaited:\n *\n * ```javascript\n * import all from 'it-all'\n * import filter from 'it-filter'\n *\n * const values = async function * () {\n * yield * [0, 1, 2, 3, 4]\n * }\n *\n * const fn = async val => (val, index) > 2 // Return boolean or promise of boolean to keep item\n *\n * const arr = await all(filter(values, fn))\n *\n * console.info(arr) // 3, 4\n * ```\n */\nimport peek from 'it-peekable';\nfunction isAsyncIterable(thing) {\n return thing[Symbol.asyncIterator] != null;\n}\nfunction filter(source, fn) {\n let index = 0;\n if (isAsyncIterable(source)) {\n return (async function* () {\n for await (const entry of source) {\n if (await fn(entry, index++)) {\n yield entry;\n }\n }\n })();\n }\n // if mapping function returns a promise we have to return an async generator\n const peekable = peek(source);\n const { value, done } = peekable.next();\n if (done === true) {\n return (function* () { }());\n }\n const res = fn(value, index++);\n // @ts-expect-error .then is not present on O\n if (typeof res.then === 'function') {\n return (async function* () {\n if (await res) {\n yield value;\n }\n for await (const entry of peekable) {\n if (await fn(entry, index++)) {\n yield entry;\n }\n }\n })();\n }\n const func = fn;\n return (function* () {\n if (res === true) {\n yield value;\n }\n for (const entry of peekable) {\n if (func(entry, index++)) {\n yield entry;\n }\n }\n })();\n}\nexport default filter;\n//# sourceMappingURL=index.js.map","/**\n * @packageDocumentation\n *\n * Lets you look at the contents of an async iterator and decide what to do\n *\n * @example\n *\n * ```javascript\n * import peekable from 'it-peekable'\n *\n * // This can also be an iterator, generator, etc\n * const values = [0, 1, 2, 3, 4]\n *\n * const it = peekable(value)\n *\n * const first = it.peek()\n *\n * console.info(first) // 0\n *\n * it.push(first)\n *\n * console.info([...it])\n * // [ 0, 1, 2, 3, 4 ]\n * ```\n *\n * Async sources must be awaited:\n *\n * ```javascript\n * import peekable from 'it-peekable'\n *\n * const values = async function * () {\n * yield * [0, 1, 2, 3, 4]\n * }\n *\n * const it = peekable(values())\n *\n * const first = await it.peek()\n *\n * console.info(first) // 0\n *\n * it.push(first)\n *\n * console.info(await all(it))\n * // [ 0, 1, 2, 3, 4 ]\n * ```\n */\nfunction peekable(iterable) {\n // @ts-expect-error can't use Symbol.asyncIterator to index iterable since it might be Iterable\n const [iterator, symbol] = iterable[Symbol.asyncIterator] != null\n // @ts-expect-error can't use Symbol.asyncIterator to index iterable since it might be Iterable\n ? [iterable[Symbol.asyncIterator](), Symbol.asyncIterator]\n // @ts-expect-error can't use Symbol.iterator to index iterable since it might be AsyncIterable\n : [iterable[Symbol.iterator](), Symbol.iterator];\n const queue = [];\n // @ts-expect-error can't use symbol to index peekable\n return {\n peek: () => {\n return iterator.next();\n },\n push: (value) => {\n queue.push(value);\n },\n next: () => {\n if (queue.length > 0) {\n return {\n done: false,\n value: queue.shift()\n };\n }\n return iterator.next();\n },\n [symbol]() {\n return this;\n }\n };\n}\nexport default peekable;\n//# sourceMappingURL=index.js.map","/**\n * @packageDocumentation\n *\n * Consumes all values from an (async)iterable and returns them sorted by the passed sort function.\n *\n * @example\n *\n * ```javascript\n * import sort from 'it-sort'\n * import all from 'it-all'\n *\n * const sorter = (a, b) => {\n * return a.localeCompare(b)\n * }\n *\n * // This can also be an iterator, generator, etc\n * const values = ['foo', 'bar']\n *\n * const arr = all(sort(values, sorter))\n *\n * console.info(arr) // 'bar', 'foo'\n * ```\n *\n * Async sources must be awaited:\n *\n * ```javascript\n * import sort from 'it-sort'\n * import all from 'it-all'\n *\n * const sorter = (a, b) => {\n * return a.localeCompare(b)\n * }\n *\n * const values = async function * () {\n * yield * ['foo', 'bar']\n * }\n *\n * const arr = await all(sort(values, sorter))\n *\n * console.info(arr) // 'bar', 'foo'\n * ```\n */\nimport all from 'it-all';\nfunction isAsyncIterable(thing) {\n return thing[Symbol.asyncIterator] != null;\n}\nfunction sort(source, sorter) {\n if (isAsyncIterable(source)) {\n return (async function* () {\n const arr = await all(source);\n yield* arr.sort(sorter);\n })();\n }\n return (function* () {\n const arr = all(source);\n yield* arr.sort(sorter);\n })();\n}\nexport default sort;\n//# sourceMappingURL=index.js.map","/**\n * @packageDocumentation\n *\n * For when you only want a few values out of an (async)iterable.\n *\n * @example\n *\n * ```javascript\n * import take from 'it-take'\n * import all from 'it-all'\n *\n * // This can also be an iterator, generator, etc\n * const values = [0, 1, 2, 3, 4]\n *\n * const arr = all(take(values, 2))\n *\n * console.info(arr) // 0, 1\n * ```\n *\n * Async sources must be awaited:\n *\n * ```javascript\n * import take from 'it-take'\n * import all from 'it-all'\n *\n * const values = async function * () {\n * yield * [0, 1, 2, 3, 4]\n * }\n *\n * const arr = await all(take(values(), 2))\n *\n * console.info(arr) // 0, 1\n * ```\n */\nfunction isAsyncIterable(thing) {\n return thing[Symbol.asyncIterator] != null;\n}\nfunction take(source, limit) {\n if (isAsyncIterable(source)) {\n return (async function* () {\n let items = 0;\n if (limit < 1) {\n return;\n }\n for await (const entry of source) {\n yield entry;\n items++;\n if (items === limit) {\n return;\n }\n }\n })();\n }\n return (function* () {\n let items = 0;\n if (limit < 1) {\n return;\n }\n for (const entry of source) {\n yield entry;\n items++;\n if (items === limit) {\n return;\n }\n }\n })();\n}\nexport default take;\n//# sourceMappingURL=index.js.map","import drain from 'it-drain';\nimport filter from 'it-filter';\nimport sort from 'it-sort';\nimport take from 'it-take';\nexport class BaseDatastore {\n put(key, val, options) {\n return Promise.reject(new Error('.put is not implemented'));\n }\n get(key, options) {\n return Promise.reject(new Error('.get is not implemented'));\n }\n has(key, options) {\n return Promise.reject(new Error('.has is not implemented'));\n }\n delete(key, options) {\n return Promise.reject(new Error('.delete is not implemented'));\n }\n async *putMany(source, options = {}) {\n for await (const { key, value } of source) {\n await this.put(key, value, options);\n yield key;\n }\n }\n async *getMany(source, options = {}) {\n for await (const key of source) {\n yield {\n key,\n value: await this.get(key, options)\n };\n }\n }\n async *deleteMany(source, options = {}) {\n for await (const key of source) {\n await this.delete(key, options);\n yield key;\n }\n }\n batch() {\n let puts = [];\n let dels = [];\n return {\n put(key, value) {\n puts.push({ key, value });\n },\n delete(key) {\n dels.push(key);\n },\n commit: async (options) => {\n await drain(this.putMany(puts, options));\n puts = [];\n await drain(this.deleteMany(dels, options));\n dels = [];\n }\n };\n }\n /**\n * Extending classes should override `query` or implement this method\n */\n // eslint-disable-next-line require-yield\n async *_all(q, options) {\n throw new Error('._all is not implemented');\n }\n /**\n * Extending classes should override `queryKeys` or implement this method\n */\n // eslint-disable-next-line require-yield\n async *_allKeys(q, options) {\n throw new Error('._allKeys is not implemented');\n }\n query(q, options) {\n let it = this._all(q, options);\n if (q.prefix != null) {\n const prefix = q.prefix;\n it = filter(it, (e) => e.key.toString().startsWith(prefix));\n }\n if (Array.isArray(q.filters)) {\n it = q.filters.reduce((it, f) => filter(it, f), it);\n }\n if (Array.isArray(q.orders)) {\n it = q.orders.reduce((it, f) => sort(it, f), it);\n }\n if (q.offset != null) {\n let i = 0;\n const offset = q.offset;\n it = filter(it, () => i++ >= offset);\n }\n if (q.limit != null) {\n it = take(it, q.limit);\n }\n return it;\n }\n queryKeys(q, options) {\n let it = this._allKeys(q, options);\n if (q.prefix != null) {\n const prefix = q.prefix;\n it = filter(it, (key) => key.toString().startsWith(prefix));\n }\n if (Array.isArray(q.filters)) {\n it = q.filters.reduce((it, f) => filter(it, f), it);\n }\n if (Array.isArray(q.orders)) {\n it = q.orders.reduce((it, f) => sort(it, f), it);\n }\n if (q.offset != null) {\n const offset = q.offset;\n let i = 0;\n it = filter(it, () => i++ >= offset);\n }\n if (q.limit != null) {\n it = take(it, q.limit);\n }\n return it;\n }\n}\n//# sourceMappingURL=base.js.map","import { Key } from 'interface-datastore/key';\nimport { BaseDatastore } from './base.js';\nimport * as Errors from './errors.js';\nexport class MemoryDatastore extends BaseDatastore {\n data;\n constructor() {\n super();\n this.data = new Map();\n }\n put(key, val) {\n this.data.set(key.toString(), val);\n return key;\n }\n get(key) {\n const result = this.data.get(key.toString());\n if (result == null) {\n throw Errors.notFoundError();\n }\n return result;\n }\n has(key) {\n return this.data.has(key.toString());\n }\n delete(key) {\n this.data.delete(key.toString());\n }\n *_all() {\n for (const [key, value] of this.data.entries()) {\n yield { key: new Key(key), value };\n }\n }\n *_allKeys() {\n for (const key of this.data.keys()) {\n yield new Key(key);\n }\n }\n}\n//# sourceMappingURL=memory.js.map","import errCode from 'err-code';\nexport function dbOpenFailedError(err) {\n err = err ?? new Error('Cannot open database');\n return errCode(err, 'ERR_DB_OPEN_FAILED');\n}\nexport function dbDeleteFailedError(err) {\n err = err ?? new Error('Delete failed');\n return errCode(err, 'ERR_DB_DELETE_FAILED');\n}\nexport function dbWriteFailedError(err) {\n err = err ?? new Error('Write failed');\n return errCode(err, 'ERR_DB_WRITE_FAILED');\n}\nexport function dbReadFailedError(err) {\n err = err ?? new Error('Read failed');\n return errCode(err, 'ERR_DB_READ_FAILED');\n}\nexport function notFoundError(err) {\n err = err ?? new Error('Not Found');\n return errCode(err, 'ERR_NOT_FOUND');\n}\nexport function abortedError(err) {\n err = err ?? new Error('Aborted');\n return errCode(err, 'ERR_ABORTED');\n}\n//# sourceMappingURL=errors.js.map","import { peerIdFromString } from '@libp2p/peer-id';\nimport { multiaddr } from '@multiformats/multiaddr';\nimport { debounce } from './utils.js';\nconst defaultAddressFilter = (addrs) => addrs;\n/**\n * If the passed multiaddr contains the passed peer id, remove it\n */\nfunction stripPeerId(ma, peerId) {\n const observedPeerIdStr = ma.getPeerId();\n // strip our peer id if it has been passed\n if (observedPeerIdStr != null) {\n const observedPeerId = peerIdFromString(observedPeerIdStr);\n // use same encoding for comparison\n if (observedPeerId.equals(peerId)) {\n ma = ma.decapsulate(multiaddr(`/p2p/${peerId.toString()}`));\n }\n }\n return ma;\n}\nexport class DefaultAddressManager {\n log;\n components;\n // this is an array to allow for duplicates, e.g. multiples of `/ip4/0.0.0.0/tcp/0`\n listen;\n announce;\n observed;\n announceFilter;\n /**\n * Responsible for managing the peer addresses.\n * Peers can specify their listen and announce addresses.\n * The listen addresses will be used by the libp2p transports to listen for new connections,\n * while the announce addresses will be used for the peer addresses' to other peers in the network.\n */\n constructor(components, init = {}) {\n const { listen = [], announce = [] } = init;\n this.components = components;\n this.log = components.logger.forComponent('libp2p:address-manager');\n this.listen = listen.map(ma => ma.toString());\n this.announce = new Set(announce.map(ma => ma.toString()));\n this.observed = new Map();\n this.announceFilter = init.announceFilter ?? defaultAddressFilter;\n // this method gets called repeatedly on startup when transports start listening so\n // debounce it so we don't cause multiple self:peer:update events to be emitted\n this._updatePeerStoreAddresses = debounce(this._updatePeerStoreAddresses.bind(this), 1000);\n // update our stored addresses when new transports listen\n components.events.addEventListener('transport:listening', () => {\n this._updatePeerStoreAddresses();\n });\n // update our stored addresses when existing transports stop listening\n components.events.addEventListener('transport:close', () => {\n this._updatePeerStoreAddresses();\n });\n }\n [Symbol.toStringTag] = '@libp2p/address-manager';\n _updatePeerStoreAddresses() {\n // if announce addresses have been configured, ensure they make it into our peer\n // record for things like identify\n const addrs = this.getAnnounceAddrs()\n .concat(this.components.transportManager.getAddrs())\n .concat([...this.observed.entries()]\n .filter(([_, metadata]) => metadata.confident)\n .map(([str]) => multiaddr(str))).map(ma => {\n // strip our peer id if it is present\n if (ma.getPeerId() === this.components.peerId.toString()) {\n return ma.decapsulate(`/p2p/${this.components.peerId.toString()}`);\n }\n return ma;\n });\n this.components.peerStore.patch(this.components.peerId, {\n multiaddrs: addrs\n })\n .catch(err => { this.log.error('error updating addresses', err); });\n }\n /**\n * Get peer listen multiaddrs\n */\n getListenAddrs() {\n return Array.from(this.listen).map((a) => multiaddr(a));\n }\n /**\n * Get peer announcing multiaddrs\n */\n getAnnounceAddrs() {\n return Array.from(this.announce).map((a) => multiaddr(a));\n }\n /**\n * Get observed multiaddrs\n */\n getObservedAddrs() {\n return Array.from(this.observed).map(([a]) => multiaddr(a));\n }\n /**\n * Add peer observed addresses\n */\n addObservedAddr(addr) {\n addr = stripPeerId(addr, this.components.peerId);\n const addrString = addr.toString();\n // do not trigger the change:addresses event if we already know about this address\n if (this.observed.has(addrString)) {\n return;\n }\n this.observed.set(addrString, {\n confident: false\n });\n }\n confirmObservedAddr(addr) {\n addr = stripPeerId(addr, this.components.peerId);\n const addrString = addr.toString();\n const metadata = this.observed.get(addrString) ?? {\n confident: false\n };\n const startingConfidence = metadata.confident;\n this.observed.set(addrString, {\n confident: true\n });\n // only trigger the 'self:peer:update' event if our confidence in an address has changed\n if (!startingConfidence) {\n this._updatePeerStoreAddresses();\n }\n }\n removeObservedAddr(addr) {\n addr = stripPeerId(addr, this.components.peerId);\n const addrString = addr.toString();\n this.observed.delete(addrString);\n }\n getAddresses() {\n let addrs = this.getAnnounceAddrs().map(ma => ma.toString());\n if (addrs.length === 0) {\n // no configured announce addrs, add configured listen addresses\n addrs = this.components.transportManager.getAddrs().map(ma => ma.toString());\n }\n // add observed addresses we are confident in\n addrs = addrs.concat(Array.from(this.observed)\n .filter(([ma, metadata]) => metadata.confident)\n .map(([ma]) => ma));\n // dedupe multiaddrs\n const addrSet = new Set(addrs);\n // Create advertising list\n return this.announceFilter(Array.from(addrSet)\n .map(str => multiaddr(str)))\n .map(ma => {\n // do not append our peer id to a path multiaddr as it will become invalid\n if (ma.protos().pop()?.path === true) {\n return ma;\n }\n if (ma.getPeerId() === this.components.peerId.toString()) {\n return ma;\n }\n return ma.encapsulate(`/p2p/${this.components.peerId.toString()}`);\n });\n }\n}\n//# sourceMappingURL=index.js.map","export function debounce(func, wait) {\n let timeout;\n return function () {\n const later = function () {\n timeout = undefined;\n func();\n };\n clearTimeout(timeout);\n timeout = setTimeout(later, wait);\n };\n}\n//# sourceMappingURL=utils.js.map","import { CodeError, serviceCapabilities, serviceDependencies } from '@libp2p/interface';\nimport { isStartable } from '@libp2p/interface';\nimport { defaultLogger } from '@libp2p/logger';\nclass DefaultComponents {\n components = {};\n _started = false;\n constructor(init = {}) {\n this.components = {};\n for (const [key, value] of Object.entries(init)) {\n this.components[key] = value;\n }\n if (this.components.logger == null) {\n this.components.logger = defaultLogger();\n }\n }\n isStarted() {\n return this._started;\n }\n async _invokeStartableMethod(methodName) {\n await Promise.all(Object.values(this.components)\n .filter(obj => isStartable(obj))\n .map(async (startable) => {\n await startable[methodName]?.();\n }));\n }\n async beforeStart() {\n await this._invokeStartableMethod('beforeStart');\n }\n async start() {\n await this._invokeStartableMethod('start');\n this._started = true;\n }\n async afterStart() {\n await this._invokeStartableMethod('afterStart');\n }\n async beforeStop() {\n await this._invokeStartableMethod('beforeStop');\n }\n async stop() {\n await this._invokeStartableMethod('stop');\n this._started = false;\n }\n async afterStop() {\n await this._invokeStartableMethod('afterStop');\n }\n}\nconst OPTIONAL_SERVICES = [\n 'metrics',\n 'connectionProtector',\n 'dns'\n];\nconst NON_SERVICE_PROPERTIES = [\n 'components',\n 'isStarted',\n 'beforeStart',\n 'start',\n 'afterStart',\n 'beforeStop',\n 'stop',\n 'afterStop',\n 'then',\n '_invokeStartableMethod'\n];\nexport function defaultComponents(init = {}) {\n const components = new DefaultComponents(init);\n const proxy = new Proxy(components, {\n get(target, prop, receiver) {\n if (typeof prop === 'string' && !NON_SERVICE_PROPERTIES.includes(prop)) {\n const service = components.components[prop];\n if (service == null && !OPTIONAL_SERVICES.includes(prop)) {\n throw new CodeError(`${prop} not set`, 'ERR_SERVICE_MISSING');\n }\n return service;\n }\n return Reflect.get(target, prop, receiver);\n },\n set(target, prop, value) {\n if (typeof prop === 'string') {\n components.components[prop] = value;\n }\n else {\n Reflect.set(target, prop, value);\n }\n return true;\n }\n });\n // @ts-expect-error component keys are proxied\n return proxy;\n}\nexport function checkServiceDependencies(components) {\n const serviceCapabilities = {};\n for (const service of Object.values(components.components)) {\n for (const capability of getServiceCapabilities(service)) {\n serviceCapabilities[capability] = true;\n }\n }\n for (const service of Object.values(components.components)) {\n for (const capability of getServiceDependencies(service)) {\n if (serviceCapabilities[capability] !== true) {\n throw new CodeError(`Service \"${getServiceName(service)}\" required capability \"${capability}\" but it was not provided by any component, you may need to add additional configuration when creating your node.`, 'ERR_UNMET_SERVICE_DEPENDENCIES');\n }\n }\n }\n}\nfunction getServiceCapabilities(service) {\n if (Array.isArray(service?.[serviceCapabilities])) {\n return service[serviceCapabilities];\n }\n return [];\n}\nfunction getServiceDependencies(service) {\n if (Array.isArray(service?.[serviceDependencies])) {\n return service[serviceDependencies];\n }\n return [];\n}\nfunction getServiceName(service) {\n return service?.[Symbol.toStringTag] ?? service?.toString() ?? 'unknown';\n}\n//# sourceMappingURL=components.js.map","export function isStartable(obj) {\n return obj != null && typeof obj.start === 'function' && typeof obj.stop === 'function';\n}\nexport async function start(...objs) {\n const startables = [];\n for (const obj of objs) {\n if (isStartable(obj)) {\n startables.push(obj);\n }\n }\n await Promise.all(startables.map(async (s) => {\n if (s.beforeStart != null) {\n await s.beforeStart();\n }\n }));\n await Promise.all(startables.map(async (s) => {\n await s.start();\n }));\n await Promise.all(startables.map(async (s) => {\n if (s.afterStart != null) {\n await s.afterStart();\n }\n }));\n}\nexport async function stop(...objs) {\n const startables = [];\n for (const obj of objs) {\n if (isStartable(obj)) {\n startables.push(obj);\n }\n }\n await Promise.all(startables.map(async (s) => {\n if (s.beforeStop != null) {\n await s.beforeStop();\n }\n }));\n await Promise.all(startables.map(async (s) => {\n await s.stop();\n }));\n await Promise.all(startables.map(async (s) => {\n if (s.afterStop != null) {\n await s.afterStop();\n }\n }));\n}\n//# sourceMappingURL=startable.js.map","import { isIPv4, isIPv6 } from '@chainsafe/is-ip';\nimport { Netmask } from 'netmask';\nconst PRIVATE_IP_RANGES = [\n '0.0.0.0/8',\n '10.0.0.0/8',\n '100.64.0.0/10',\n '127.0.0.0/8',\n '169.254.0.0/16',\n '172.16.0.0/12',\n '192.0.0.0/24',\n '192.0.0.0/29',\n '192.0.0.8/32',\n '192.0.0.9/32',\n '192.0.0.10/32',\n '192.0.0.170/32',\n '192.0.0.171/32',\n '192.0.2.0/24',\n '192.31.196.0/24',\n '192.52.193.0/24',\n '192.88.99.0/24',\n '192.168.0.0/16',\n '192.175.48.0/24',\n '198.18.0.0/15',\n '198.51.100.0/24',\n '203.0.113.0/24',\n '240.0.0.0/4',\n '255.255.255.255/32'\n];\nconst NETMASK_RANGES = PRIVATE_IP_RANGES.map(ipRange => new Netmask(ipRange));\nfunction ipv4Check(ipAddr) {\n for (const r of NETMASK_RANGES) {\n if (r.contains(ipAddr))\n return true;\n }\n return false;\n}\nfunction isIpv4MappedIpv6(ipAddr) {\n return /^::ffff:([0-9a-fA-F]{1,4}):([0-9a-fA-F]{1,4})$/.test(ipAddr);\n}\n/**\n * @see https://datatracker.ietf.org/doc/html/rfc4291#section-2.5.5.2\n */\nfunction ipv4MappedIpv6Check(ipAddr) {\n const parts = ipAddr.split(':');\n if (parts.length < 2) {\n return false;\n }\n const octet34 = parts[parts.length - 1].padStart(4, '0');\n const octet12 = parts[parts.length - 2].padStart(4, '0');\n const ip4 = `${parseInt(octet12.substring(0, 2), 16)}.${parseInt(octet12.substring(2), 16)}.${parseInt(octet34.substring(0, 2), 16)}.${parseInt(octet34.substring(2), 16)}`;\n return ipv4Check(ip4);\n}\n/**\n * @see https://datatracker.ietf.org/doc/html/rfc4291#section-2.2 example 3\n */\nfunction isIpv4EmbeddedIpv6(ipAddr) {\n return /^::ffff:([0-9]{1,3})\\.([0-9]{1,3})\\.([0-9]{1,3})\\.([0-9]{1,3})$/.test(ipAddr);\n}\nfunction ipv4EmbeddedIpv6Check(ipAddr) {\n const parts = ipAddr.split(':');\n const ip4 = parts[parts.length - 1];\n return ipv4Check(ip4);\n}\nfunction ipv6Check(ipAddr) {\n return /^::$/.test(ipAddr) ||\n /^::1$/.test(ipAddr) ||\n /^64:ff9b::([0-9]{1,3})\\.([0-9]{1,3})\\.([0-9]{1,3})\\.([0-9]{1,3})$/.test(ipAddr) ||\n /^100::([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4})$/.test(ipAddr) ||\n /^2001::([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4})$/.test(ipAddr) ||\n /^2001:2[0-9a-fA-F]:([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4})$/.test(ipAddr) ||\n /^2001:db8:([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4})$/.test(ipAddr) ||\n /^2002:([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4})$/.test(ipAddr) ||\n /^f[c-d]([0-9a-fA-F]{2,2}):/i.test(ipAddr) ||\n /^fe[8-9a-bA-B][0-9a-fA-F]:/i.test(ipAddr) ||\n /^ff([0-9a-fA-F]{2,2}):/i.test(ipAddr);\n}\nexport function isPrivateIp(ip) {\n if (isIPv4(ip))\n return ipv4Check(ip);\n else if (isIpv4MappedIpv6(ip))\n return ipv4MappedIpv6Check(ip);\n else if (isIpv4EmbeddedIpv6(ip))\n return ipv4EmbeddedIpv6Check(ip);\n else if (isIPv6(ip))\n return ipv6Check(ip);\n else\n return undefined;\n}\n//# sourceMappingURL=private-ip.js.map","import { isPrivateIp } from '@libp2p/utils/private-ip';\n/**\n * Returns a connection gater that disallows dialling private addresses by\n * default. Browsers are severely limited in their resource usage so don't\n * waste time trying to dial undiallable addresses.\n */\nexport function connectionGater(gater = {}) {\n return {\n denyDialPeer: async () => false,\n denyDialMultiaddr: async (multiaddr) => {\n const tuples = multiaddr.stringTuples();\n if (tuples[0][0] === 4 || tuples[0][0] === 41) {\n return Boolean(isPrivateIp(`${tuples[0][1]}`));\n }\n return false;\n },\n denyInboundConnection: async () => false,\n denyOutboundConnection: async () => false,\n denyInboundEncryptedConnection: async () => false,\n denyOutboundEncryptedConnection: async () => false,\n denyInboundUpgradedConnection: async () => false,\n denyOutboundUpgradedConnection: async () => false,\n filterMultiaddrForPeer: async () => true,\n ...gater\n };\n}\n//# sourceMappingURL=connection-gater.browser.js.map","import { isPrivateIp } from '../private-ip.js';\n/**\n * Check if a given multiaddr has a private address.\n */\nexport function isPrivate(ma) {\n try {\n const { address } = ma.nodeAddress();\n return Boolean(isPrivateIp(address));\n }\n catch {\n return true;\n }\n}\n//# sourceMappingURL=is-private.js.map","/**\n * @packageDocumentation\n *\n * Provides strategies to sort a list of multiaddrs.\n *\n * @example\n *\n * ```typescript\n * import { publicAddressesFirst } from '@libp2p/utils/address-sort'\n * import { multiaddr } from '@multformats/multiaddr'\n *\n *\n * const addresses = [\n * multiaddr('/ip4/127.0.0.1/tcp/9000'),\n * multiaddr('/ip4/82.41.53.1/tcp/9000')\n * ].sort(publicAddressesFirst)\n *\n * console.info(addresses)\n * // ['/ip4/82.41.53.1/tcp/9000', '/ip4/127.0.0.1/tcp/9000']\n * ```\n */\nimport { Circuit } from '@multiformats/multiaddr-matcher';\nimport { isPrivate } from './multiaddr/is-private.js';\n/**\n * Compare function for array.sort() that moves public addresses to the start\n * of the array.\n */\nexport function publicAddressesFirst(a, b) {\n const isAPrivate = isPrivate(a.multiaddr);\n const isBPrivate = isPrivate(b.multiaddr);\n if (isAPrivate && !isBPrivate) {\n return 1;\n }\n else if (!isAPrivate && isBPrivate) {\n return -1;\n }\n return 0;\n}\n/**\n * Compare function for array.sort() that moves certified addresses to the start\n * of the array.\n */\nexport function certifiedAddressesFirst(a, b) {\n if (a.isCertified && !b.isCertified) {\n return -1;\n }\n else if (!a.isCertified && b.isCertified) {\n return 1;\n }\n return 0;\n}\n/**\n * Compare function for array.sort() that moves circuit relay addresses to the\n * start of the array.\n */\nexport function circuitRelayAddressesLast(a, b) {\n const isACircuit = Circuit.exactMatch(a.multiaddr);\n const isBCircuit = Circuit.exactMatch(b.multiaddr);\n if (isACircuit && !isBCircuit) {\n return 1;\n }\n else if (!isACircuit && isBCircuit) {\n return -1;\n }\n return 0;\n}\nexport function defaultAddressSort(a, b) {\n const publicResult = publicAddressesFirst(a, b);\n if (publicResult !== 0) {\n return publicResult;\n }\n const relayResult = circuitRelayAddressesLast(a, b);\n if (relayResult !== 0) {\n return relayResult;\n }\n const certifiedResult = certifiedAddressesFirst(a, b);\n return certifiedResult;\n}\n//# sourceMappingURL=address-sort.js.map","import { RecordType } from '../index.js';\nexport function getTypes(types) {\n const DEFAULT_TYPES = [\n RecordType.A\n ];\n if (types == null) {\n return DEFAULT_TYPES;\n }\n if (Array.isArray(types)) {\n if (types.length === 0) {\n return DEFAULT_TYPES;\n }\n return types;\n }\n return [\n types\n ];\n}\n//# sourceMappingURL=get-types.js.map","import { toString as uint8ArrayToString } from 'uint8arrays/to-string';\nimport { RecordType } from '../index.js';\n/**\n * This TTL will be used if the remote service does not return one\n */\nexport const DEFAULT_TTL = 60;\nexport function toDNSResponse(obj) {\n return {\n Status: obj.Status ?? 0,\n TC: obj.TC ?? obj.flag_tc ?? false,\n RD: obj.RD ?? obj.flag_rd ?? false,\n RA: obj.RA ?? obj.flag_ra ?? false,\n AD: obj.AD ?? obj.flag_ad ?? false,\n CD: obj.CD ?? obj.flag_cd ?? false,\n Question: (obj.Question ?? obj.questions ?? []).map((question) => {\n return {\n name: question.name,\n type: RecordType[question.type]\n };\n }),\n Answer: (obj.Answer ?? obj.answers ?? []).map((answer) => {\n return {\n name: answer.name,\n type: RecordType[answer.type],\n TTL: (answer.TTL ?? answer.ttl ?? DEFAULT_TTL),\n data: answer.data instanceof Uint8Array ? uint8ArrayToString(answer.data) : answer.data\n };\n })\n };\n}\n//# sourceMappingURL=to-dns-response.js.map","/* eslint-env browser */\nimport PQueue from 'p-queue';\nimport { CustomProgressEvent } from 'progress-events';\nimport { RecordType } from '../index.js';\nimport { getTypes } from '../utils/get-types.js';\nimport { toDNSResponse } from '../utils/to-dns-response.js';\n/**\n * Browsers limit concurrent connections per host (~6), we don't want to exhaust\n * the limit so this value controls how many DNS queries can be in flight at\n * once.\n */\nexport const DEFAULT_QUERY_CONCURRENCY = 4;\n/**\n * Uses the RFC 8427 'application/dns-json' content-type to resolve DNS queries.\n *\n * Supports and server that uses the same schema as Google's DNS over HTTPS\n * resolver.\n *\n * This resolver needs fewer dependencies than the regular DNS-over-HTTPS\n * resolver so can result in a smaller bundle size and consequently is preferred\n * for browser use.\n *\n * @see https://developers.cloudflare.com/1.1.1.1/encryption/dns-over-https/make-api-requests/dns-json/\n * @see https://github.com/curl/curl/wiki/DNS-over-HTTPS#publicly-available-servers\n * @see https://dnsprivacy.org/public_resolvers/\n * @see https://datatracker.ietf.org/doc/html/rfc8427\n */\nexport function dnsJsonOverHttps(url, init = {}) {\n const httpQueue = new PQueue({\n concurrency: init.queryConcurrency ?? DEFAULT_QUERY_CONCURRENCY\n });\n return async (fqdn, options = {}) => {\n const searchParams = new URLSearchParams();\n searchParams.set('name', fqdn);\n getTypes(options.types).forEach(type => {\n // We pass record type as a string to the server because cloudflare DNS bug. see https://github.com/ipfs/helia/issues/474\n searchParams.append('type', RecordType[type]);\n });\n options.onProgress?.(new CustomProgressEvent('dns:query', { detail: fqdn }));\n // query DNS-JSON over HTTPS server\n const response = await httpQueue.add(async () => {\n const res = await fetch(`${url}?${searchParams}`, {\n headers: {\n accept: 'application/dns-json'\n },\n signal: options?.signal\n });\n if (res.status !== 200) {\n throw new Error(`Unexpected HTTP status: ${res.status} - ${res.statusText}`);\n }\n const response = toDNSResponse(await res.json());\n options.onProgress?.(new CustomProgressEvent('dns:response', { detail: response }));\n return response;\n }, {\n signal: options.signal\n });\n if (response == null) {\n throw new Error('No DNS response received');\n }\n return response;\n };\n}\n//# sourceMappingURL=dns-json-over-https.js.map","/**\n * @packageDocumentation\n *\n * Query DNS records using `node:dns`, DNS over HTTP and/or DNSJSON over HTTP.\n *\n * A list of publicly accessible servers can be found [here](https://github.com/curl/curl/wiki/DNS-over-HTTPS#publicly-available-servers).\n *\n * @example Using the default resolver\n *\n * ```TypeScript\n * import { dns } from '@multiformats/dns'\n *\n * const resolver = dns()\n *\n * // resolve A records with a 5s timeout\n * const result = await dns.query('google.com', {\n * signal: AbortSignal.timeout(5000)\n * })\n * ```\n *\n * @example Using per-TLD resolvers\n *\n * ```TypeScript\n * import { dns } from '@multiformats/dns'\n * import { dnsJsonOverHttps } from '@multiformats/dns/resolvers'\n *\n * const resolver = dns({\n * resolvers: {\n * // will only be used to resolve `.com` addresses\n * 'com.': dnsJsonOverHttps('https://cloudflare-dns.com/dns-query'),\n *\n * // this can also be an array, resolvers will be shuffled and tried in\n * // series\n * 'net.': [\n * dnsJsonOverHttps('https://dns.google/resolve'),\n * dnsJsonOverHttps('https://dns.pub/dns-query')\n * ],\n *\n * // will only be used to resolve all other addresses\n * '.': dnsJsonOverHttps('https://dnsforge.de/dns-query'),\n * }\n * })\n * ```\n *\n * @example Query for specific record types\n *\n * ```TypeScript\n * import { dns, RecordType } from '@multiformats/dns'\n *\n * const resolver = dns()\n *\n * // resolve only TXT records\n * const result = await dns.query('google.com', {\n * types: [\n * RecordType.TXT\n * ]\n * })\n * ```\n *\n * ## Caching\n *\n * Individual Aanswers are cached so. If you make a request, for which all\n * record types are cached, all values will be pulled from the cache.\n *\n * If any of the record types are not cached, a new request will be resolved as\n * if none of the records were cached, and the cache will be updated to include\n * the new results.\n *\n * @example Ignoring the cache\n *\n * ```TypeScript\n * import { dns, RecordType } from '@multiformats/dns'\n *\n * const resolver = dns()\n *\n * // do not used cached results, always resolve a new query\n * const result = await dns.query('google.com', {\n * cached: false\n * })\n * ```\n */\nimport { DNS as DNSClass } from './dns.js';\n/**\n * A subset of DNS Record Types\n *\n * @see https://www.iana.org/assignments/dns-parameters/dns-parameters.xhtml#dns-parameters-4.\n */\nexport var RecordType;\n(function (RecordType) {\n RecordType[RecordType[\"A\"] = 1] = \"A\";\n RecordType[RecordType[\"CNAME\"] = 5] = \"CNAME\";\n RecordType[RecordType[\"TXT\"] = 16] = \"TXT\";\n RecordType[RecordType[\"AAAA\"] = 28] = \"AAAA\";\n})(RecordType || (RecordType = {}));\n/**\n * The default maximum amount of recursion allowed during a query\n */\nexport const MAX_RECURSIVE_DEPTH = 32;\nexport function dns(init = {}) {\n return new DNSClass(init);\n}\n//# sourceMappingURL=index.js.map","import hashlru from 'hashlru';\nimport { RecordType } from '../index.js';\nimport { DEFAULT_TTL, toDNSResponse } from './to-dns-response.js';\n/**\n * Time Aware Least Recent Used Cache\n *\n * @see https://arxiv.org/pdf/1801.00390\n */\nclass CachedAnswers {\n lru;\n constructor(maxSize) {\n this.lru = hashlru(maxSize);\n }\n get(fqdn, types) {\n let foundAllAnswers = true;\n const answers = [];\n for (const type of types) {\n const cached = this.getAnswers(fqdn, type);\n if (cached.length === 0) {\n foundAllAnswers = false;\n break;\n }\n answers.push(...cached);\n }\n if (foundAllAnswers) {\n return toDNSResponse({ answers });\n }\n }\n getAnswers(domain, type) {\n const key = `${domain.toLowerCase()}-${type}`;\n const answers = this.lru.get(key);\n if (answers != null) {\n const cachedAnswers = answers\n .filter((entry) => {\n return entry.expires > Date.now();\n })\n .map(({ expires, value }) => ({\n ...value,\n TTL: Math.round((expires - Date.now()) / 1000),\n type: RecordType[value.type]\n }));\n if (cachedAnswers.length === 0) {\n this.lru.remove(key);\n }\n // @ts-expect-error hashlru stringifies stored types which turns enums\n // into strings, we convert back into enums above but tsc doesn't know\n return cachedAnswers;\n }\n return [];\n }\n add(domain, answer) {\n const key = `${domain.toLowerCase()}-${answer.type}`;\n const answers = this.lru.get(key) ?? [];\n answers.push({\n expires: Date.now() + ((answer.TTL ?? DEFAULT_TTL) * 1000),\n value: answer\n });\n this.lru.set(key, answers);\n }\n remove(domain, type) {\n const key = `${domain.toLowerCase()}-${type}`;\n this.lru.remove(key);\n }\n clear() {\n this.lru.clear();\n }\n}\n/**\n * Avoid sending multiple queries for the same hostname by caching results\n */\nexport function cache(size) {\n return new CachedAnswers(size);\n}\n//# sourceMappingURL=cache.js.map","import { CustomProgressEvent } from 'progress-events';\nimport { defaultResolver } from './resolvers/default.js';\nimport { cache } from './utils/cache.js';\nimport { getTypes } from './utils/get-types.js';\nconst DEFAULT_ANSWER_CACHE_SIZE = 1000;\nexport class DNS {\n resolvers;\n cache;\n constructor(init) {\n this.resolvers = {};\n this.cache = cache(init.cacheSize ?? DEFAULT_ANSWER_CACHE_SIZE);\n Object.entries(init.resolvers ?? {}).forEach(([tld, resolver]) => {\n if (!Array.isArray(resolver)) {\n resolver = [resolver];\n }\n // convert `com` -> `com.`\n if (!tld.endsWith('.')) {\n tld = `${tld}.`;\n }\n this.resolvers[tld] = resolver;\n });\n // configure default resolver if none specified\n if (this.resolvers['.'] == null) {\n this.resolvers['.'] = defaultResolver();\n }\n }\n /**\n * Queries DNS resolvers for the passed record types for the passed domain.\n *\n * If cached records exist for all desired types they will be returned\n * instead.\n *\n * Any new responses will be added to the cache for subsequent requests.\n */\n async query(domain, options = {}) {\n const types = getTypes(options.types);\n const cached = options.cached !== false ? this.cache.get(domain, types) : undefined;\n if (cached != null) {\n options.onProgress?.(new CustomProgressEvent('dns:cache', { detail: cached }));\n return cached;\n }\n const tld = `${domain.split('.').pop()}.`;\n const resolvers = (this.resolvers[tld] ?? this.resolvers['.']).sort(() => {\n return (Math.random() > 0.5) ? -1 : 1;\n });\n const errors = [];\n for (const resolver of resolvers) {\n // skip further resolutions if the user aborted the signal\n if (options.signal?.aborted === true) {\n break;\n }\n try {\n const result = await resolver(domain, {\n ...options,\n types\n });\n for (const answer of result.Answer) {\n this.cache.add(domain, answer);\n }\n return result;\n }\n catch (err) {\n errors.push(err);\n options.onProgress?.(new CustomProgressEvent('dns:error', { detail: err }));\n }\n }\n if (errors.length === 1) {\n throw errors[0];\n }\n throw new AggregateError(errors, `DNS lookup of ${domain} ${types} failed`);\n }\n}\n//# sourceMappingURL=dns.js.map","import { dnsJsonOverHttps } from './dns-json-over-https.js';\nexport function defaultResolver() {\n return [\n dnsJsonOverHttps('https://cloudflare-dns.com/dns-query'),\n dnsJsonOverHttps('https://dns.google/resolve')\n ];\n}\n//# sourceMappingURL=default.browser.js.map","import { CodeError } from '@libp2p/interface';\nimport { dns, RecordType } from '@multiformats/dns';\nimport { multiaddr } from '../index.js';\nimport { getProtocol } from '../protocols-table.js';\nconst MAX_RECURSIVE_DEPTH = 32;\nconst { code: dnsaddrCode } = getProtocol('dnsaddr');\nexport const dnsaddrResolver = async function dnsaddrResolver(ma, options = {}) {\n const recursionLimit = options.maxRecursiveDepth ?? MAX_RECURSIVE_DEPTH;\n if (recursionLimit === 0) {\n throw new CodeError('Max recursive depth reached', 'ERR_MAX_RECURSIVE_DEPTH_REACHED');\n }\n const [, hostname] = ma.stringTuples().find(([proto]) => proto === dnsaddrCode) ?? [];\n const resolver = options?.dns ?? dns();\n const result = await resolver.query(`_dnsaddr.${hostname}`, {\n signal: options?.signal,\n types: [\n RecordType.TXT\n ]\n });\n const peerId = ma.getPeerId();\n const output = [];\n for (const answer of result.Answer) {\n const addr = answer.data\n .replace(/[\"']/g, '')\n .trim()\n .split('=')[1];\n if (addr == null) {\n continue;\n }\n if (peerId != null && !addr.includes(peerId)) {\n continue;\n }\n const ma = multiaddr(addr);\n if (addr.startsWith('/dnsaddr')) {\n const resolved = await ma.resolve({\n ...options,\n maxRecursiveDepth: recursionLimit - 1\n });\n output.push(...resolved.map(ma => ma.toString()));\n }\n else {\n output.push(ma.toString());\n }\n }\n return output;\n};\n//# sourceMappingURL=dnsaddr.js.map","/**\n * Thin ESM wrapper for CJS named exports.\n *\n * Ref: https://redfin.engineering/node-modules-at-war-why-commonjs-and-es-modules-cant-get-along-9617135eeca1\n */\n\nimport mergeOptions from './index.js';\nexport default mergeOptions;\n","export var messages;\n(function (messages) {\n messages[\"NOT_STARTED_YET\"] = \"The libp2p node is not started yet\";\n messages[\"ERR_PROTECTOR_REQUIRED\"] = \"Private network is enforced, but no protector was provided\";\n messages[\"NOT_FOUND\"] = \"Not found\";\n})(messages || (messages = {}));\nexport var codes;\n(function (codes) {\n codes[\"ERR_PROTECTOR_REQUIRED\"] = \"ERR_PROTECTOR_REQUIRED\";\n codes[\"ERR_PEER_DIAL_INTERCEPTED\"] = \"ERR_PEER_DIAL_INTERCEPTED\";\n codes[\"ERR_CONNECTION_INTERCEPTED\"] = \"ERR_CONNECTION_INTERCEPTED\";\n codes[\"ERR_INVALID_PROTOCOLS_FOR_STREAM\"] = \"ERR_INVALID_PROTOCOLS_FOR_STREAM\";\n codes[\"ERR_CONNECTION_ENDED\"] = \"ERR_CONNECTION_ENDED\";\n codes[\"ERR_CONNECTION_FAILED\"] = \"ERR_CONNECTION_FAILED\";\n codes[\"ERR_NODE_NOT_STARTED\"] = \"ERR_NODE_NOT_STARTED\";\n codes[\"ERR_ALREADY_ABORTED\"] = \"ERR_ALREADY_ABORTED\";\n codes[\"ERR_TOO_MANY_ADDRESSES\"] = \"ERR_TOO_MANY_ADDRESSES\";\n codes[\"ERR_NO_VALID_ADDRESSES\"] = \"ERR_NO_VALID_ADDRESSES\";\n codes[\"ERR_RELAYED_DIAL\"] = \"ERR_RELAYED_DIAL\";\n codes[\"ERR_DIALED_SELF\"] = \"ERR_DIALED_SELF\";\n codes[\"ERR_DISCOVERED_SELF\"] = \"ERR_DISCOVERED_SELF\";\n codes[\"ERR_DUPLICATE_TRANSPORT\"] = \"ERR_DUPLICATE_TRANSPORT\";\n codes[\"ERR_ENCRYPTION_FAILED\"] = \"ERR_ENCRYPTION_FAILED\";\n codes[\"ERR_HOP_REQUEST_FAILED\"] = \"ERR_HOP_REQUEST_FAILED\";\n codes[\"ERR_INVALID_KEY\"] = \"ERR_INVALID_KEY\";\n codes[\"ERR_INVALID_MESSAGE\"] = \"ERR_INVALID_MESSAGE\";\n codes[\"ERR_INVALID_PARAMETERS\"] = \"ERR_INVALID_PARAMETERS\";\n codes[\"ERR_INVALID_PEER\"] = \"ERR_INVALID_PEER\";\n codes[\"ERR_MUXER_UNAVAILABLE\"] = \"ERR_MUXER_UNAVAILABLE\";\n codes[\"ERR_NOT_FOUND\"] = \"ERR_NOT_FOUND\";\n codes[\"ERR_TRANSPORT_UNAVAILABLE\"] = \"ERR_TRANSPORT_UNAVAILABLE\";\n codes[\"ERR_TRANSPORT_DIAL_FAILED\"] = \"ERR_TRANSPORT_DIAL_FAILED\";\n codes[\"ERR_UNSUPPORTED_PROTOCOL\"] = \"ERR_UNSUPPORTED_PROTOCOL\";\n codes[\"ERR_PROTOCOL_HANDLER_ALREADY_REGISTERED\"] = \"ERR_PROTOCOL_HANDLER_ALREADY_REGISTERED\";\n codes[\"ERR_INVALID_MULTIADDR\"] = \"ERR_INVALID_MULTIADDR\";\n codes[\"ERR_SIGNATURE_NOT_VALID\"] = \"ERR_SIGNATURE_NOT_VALID\";\n codes[\"ERR_FIND_SELF\"] = \"ERR_FIND_SELF\";\n codes[\"ERR_NO_ROUTERS_AVAILABLE\"] = \"ERR_NO_ROUTERS_AVAILABLE\";\n codes[\"ERR_CONNECTION_NOT_MULTIPLEXED\"] = \"ERR_CONNECTION_NOT_MULTIPLEXED\";\n codes[\"ERR_NO_DIAL_TOKENS\"] = \"ERR_NO_DIAL_TOKENS\";\n codes[\"ERR_INVALID_CMS\"] = \"ERR_INVALID_CMS\";\n codes[\"ERR_MISSING_KEYS\"] = \"ERR_MISSING_KEYS\";\n codes[\"ERR_NO_KEY\"] = \"ERR_NO_KEY\";\n codes[\"ERR_INVALID_KEY_NAME\"] = \"ERR_INVALID_KEY_NAME\";\n codes[\"ERR_INVALID_KEY_TYPE\"] = \"ERR_INVALID_KEY_TYPE\";\n codes[\"ERR_KEY_ALREADY_EXISTS\"] = \"ERR_KEY_ALREADY_EXISTS\";\n codes[\"ERR_INVALID_KEY_SIZE\"] = \"ERR_INVALID_KEY_SIZE\";\n codes[\"ERR_KEY_NOT_FOUND\"] = \"ERR_KEY_NOT_FOUND\";\n codes[\"ERR_OLD_KEY_NAME_INVALID\"] = \"ERR_OLD_KEY_NAME_INVALID\";\n codes[\"ERR_NEW_KEY_NAME_INVALID\"] = \"ERR_NEW_KEY_NAME_INVALID\";\n codes[\"ERR_PASSWORD_REQUIRED\"] = \"ERR_PASSWORD_REQUIRED\";\n codes[\"ERR_PEM_REQUIRED\"] = \"ERR_PEM_REQUIRED\";\n codes[\"ERR_CANNOT_READ_KEY\"] = \"ERR_CANNOT_READ_KEY\";\n codes[\"ERR_MISSING_PRIVATE_KEY\"] = \"ERR_MISSING_PRIVATE_KEY\";\n codes[\"ERR_MISSING_PUBLIC_KEY\"] = \"ERR_MISSING_PUBLIC_KEY\";\n codes[\"ERR_INVALID_OLD_PASS_TYPE\"] = \"ERR_INVALID_OLD_PASS_TYPE\";\n codes[\"ERR_INVALID_NEW_PASS_TYPE\"] = \"ERR_INVALID_NEW_PASS_TYPE\";\n codes[\"ERR_INVALID_PASS_LENGTH\"] = \"ERR_INVALID_PASS_LENGTH\";\n codes[\"ERR_NOT_IMPLEMENTED\"] = \"ERR_NOT_IMPLEMENTED\";\n codes[\"ERR_WRONG_PING_ACK\"] = \"ERR_WRONG_PING_ACK\";\n codes[\"ERR_INVALID_RECORD\"] = \"ERR_INVALID_RECORD\";\n codes[\"ERR_ALREADY_SUCCEEDED\"] = \"ERR_ALREADY_SUCCEEDED\";\n codes[\"ERR_NO_HANDLER_FOR_PROTOCOL\"] = \"ERR_NO_HANDLER_FOR_PROTOCOL\";\n codes[\"ERR_TOO_MANY_OUTBOUND_PROTOCOL_STREAMS\"] = \"ERR_TOO_MANY_OUTBOUND_PROTOCOL_STREAMS\";\n codes[\"ERR_TOO_MANY_INBOUND_PROTOCOL_STREAMS\"] = \"ERR_TOO_MANY_INBOUND_PROTOCOL_STREAMS\";\n codes[\"ERR_CONNECTION_DENIED\"] = \"ERR_CONNECTION_DENIED\";\n codes[\"ERR_TRANSFER_LIMIT_EXCEEDED\"] = \"ERR_TRANSFER_LIMIT_EXCEEDED\";\n})(codes || (codes = {}));\n//# sourceMappingURL=errors.js.map","import { CodeError, FaultTolerance } from '@libp2p/interface';\nimport { peerIdFromKeys } from '@libp2p/peer-id';\nimport { defaultAddressSort } from '@libp2p/utils/address-sort';\nimport { dnsaddrResolver } from '@multiformats/multiaddr/resolvers';\nimport mergeOptions from 'merge-options';\nimport { codes, messages } from './errors.js';\nconst DefaultConfig = {\n addresses: {\n listen: [],\n announce: [],\n noAnnounce: [],\n announceFilter: (multiaddrs) => multiaddrs\n },\n connectionManager: {\n resolvers: {\n dnsaddr: dnsaddrResolver\n },\n addressSorter: defaultAddressSort\n },\n transportManager: {\n faultTolerance: FaultTolerance.FATAL_ALL\n }\n};\nexport async function validateConfig(opts) {\n const resultingOptions = mergeOptions(DefaultConfig, opts);\n if (resultingOptions.connectionProtector === null && globalThis.process?.env?.LIBP2P_FORCE_PNET != null) { // eslint-disable-line no-undef\n throw new CodeError(messages.ERR_PROTECTOR_REQUIRED, codes.ERR_PROTECTOR_REQUIRED);\n }\n if (resultingOptions.privateKey != null && !(await peerIdFromKeys(resultingOptions.privateKey.public.bytes, resultingOptions.privateKey.bytes)).equals(resultingOptions.peerId)) {\n throw new CodeError('Private key doesn\\'t match peer id', codes.ERR_INVALID_KEY);\n }\n return resultingOptions;\n}\n//# sourceMappingURL=config.js.map","import { CodeError, isPeerId } from '@libp2p/interface';\nimport { peerIdFromString } from '@libp2p/peer-id';\nimport { isMultiaddr } from '@multiformats/multiaddr';\nimport { codes } from './errors.js';\n/**\n * Extracts a PeerId and/or multiaddr from the passed PeerId or Multiaddr or an array of Multiaddrs\n */\nexport function getPeerAddress(peer) {\n if (isPeerId(peer)) {\n return { peerId: peer, multiaddrs: [] };\n }\n if (!Array.isArray(peer)) {\n peer = [peer];\n }\n let peerId;\n if (peer.length > 0) {\n const peerIdStr = peer[0].getPeerId();\n peerId = peerIdStr == null ? undefined : peerIdFromString(peerIdStr);\n // ensure PeerId is either not set or is consistent\n peer.forEach(ma => {\n if (!isMultiaddr(ma)) {\n throw new CodeError('Invalid Multiaddr', codes.ERR_INVALID_MULTIADDR);\n }\n const maPeerIdStr = ma.getPeerId();\n if (maPeerIdStr == null) {\n if (peerId != null) {\n throw new CodeError('Multiaddrs must all have the same peer id or have no peer id', codes.ERR_INVALID_PARAMETERS);\n }\n }\n else {\n const maPeerId = peerIdFromString(maPeerIdStr);\n if (peerId?.equals(maPeerId) !== true) {\n throw new CodeError('Multiaddrs must all have the same peer id or have no peer id', codes.ERR_INVALID_PARAMETERS);\n }\n }\n });\n }\n return {\n peerId,\n multiaddrs: peer\n };\n}\n//# sourceMappingURL=get-peer.js.map","/**\n * @packageDocumentation\n *\n * Race an event against an AbortSignal, taking care to remove any event\n * listeners that were added.\n *\n * @example Getting started\n *\n * ```TypeScript\n * import { raceEvent } from 'race-event'\n *\n * const controller = new AbortController()\n * const emitter = new EventTarget()\n *\n * setTimeout(() => {\n * controller.abort()\n * }, 500)\n *\n * setTimeout(() => {\n * // too late\n * emitter.dispatchEvent(new CustomEvent('event'))\n * }, 1000)\n *\n * // throws an AbortError\n * const resolve = await raceEvent(emitter, 'event', controller.signal)\n * ```\n *\n * @example Aborting the promise with an error event\n *\n * ```TypeScript\n * import { raceEvent } from 'race-event'\n *\n * const emitter = new EventTarget()\n *\n * setTimeout(() => {\n * emitter.dispatchEvent(new CustomEvent('failure', {\n * detail: new Error('Oh no!')\n * }))\n * }, 1000)\n *\n * // throws 'Oh no!' error\n * const resolve = await raceEvent(emitter, 'success', AbortSignal.timeout(5000), {\n * errorEvent: 'failure'\n * })\n * ```\n *\n * @example Customising the thrown AbortError\n *\n * The error message and `.code` property of the thrown `AbortError` can be\n * specified by passing options:\n *\n * ```TypeScript\n * import { raceEvent } from 'race-event'\n *\n * const controller = new AbortController()\n * const emitter = new EventTarget()\n *\n * setTimeout(() => {\n * controller.abort()\n * }, 500)\n *\n * // throws a Error: Oh no!\n * const resolve = await raceEvent(emitter, 'event', controller.signal, {\n * errorMessage: 'Oh no!',\n * errorCode: 'ERR_OH_NO'\n * })\n * ```\n *\n * @example Only resolving on specific events\n *\n * Where multiple events with the same type are emitted, a `filter` function can\n * be passed to only resolve on one of them:\n *\n * ```TypeScript\n * import { raceEvent } from 'race-event'\n *\n * const controller = new AbortController()\n * const emitter = new EventTarget()\n *\n * // throws a Error: Oh no!\n * const resolve = await raceEvent(emitter, 'event', controller.signal, {\n * filter: (evt: Event) => {\n * return evt.detail.foo === 'bar'\n * }\n * })\n * ```\n *\n * @example Terminating early by throwing from the filter\n *\n * You can cause listening for the event to cease and all event listeners to be\n * removed by throwing from the filter:\n *\n * ```TypeScript\n * import { raceEvent } from 'race-event'\n *\n * const controller = new AbortController()\n * const emitter = new EventTarget()\n *\n * // throws Error: Cannot continue\n * const resolve = await raceEvent(emitter, 'event', controller.signal, {\n * filter: (evt) => {\n * if (...reasons) {\n * throw new Error('Cannot continue')\n * }\n *\n * return true\n * }\n * })\n * ```\n */\n/**\n * An abort error class that extends error\n */\nexport class AbortError extends Error {\n type;\n code;\n constructor(message, code) {\n super(message ?? 'The operation was aborted');\n this.type = 'aborted';\n this.name = 'AbortError';\n this.code = code ?? 'ABORT_ERR';\n }\n}\n/**\n * Race a promise against an abort signal\n */\nexport async function raceEvent(emitter, eventName, signal, opts) {\n // create the error here so we have more context in the stack trace\n const error = new AbortError(opts?.errorMessage, opts?.errorCode);\n if (signal?.aborted === true) {\n return Promise.reject(error);\n }\n return new Promise((resolve, reject) => {\n function removeListeners() {\n signal?.removeEventListener('abort', abortListener);\n emitter.removeEventListener(eventName, eventListener);\n if (opts?.errorEvent != null) {\n emitter.removeEventListener(opts.errorEvent, errorEventListener);\n }\n }\n const eventListener = (evt) => {\n try {\n if (opts?.filter?.(evt) === false) {\n return;\n }\n }\n catch (err) {\n removeListeners();\n reject(err);\n return;\n }\n removeListeners();\n resolve(evt);\n };\n const errorEventListener = (evt) => {\n removeListeners();\n reject(evt.detail);\n };\n const abortListener = () => {\n removeListeners();\n reject(error);\n };\n signal?.addEventListener('abort', abortListener);\n emitter.addEventListener(eventName, eventListener);\n if (opts?.errorEvent != null) {\n emitter.addEventListener(opts.errorEvent, errorEventListener);\n }\n });\n}\n//# sourceMappingURL=index.js.map","import { AbortError } from '@libp2p/interface';\nimport pDefer from 'p-defer';\nexport class JobRecipient {\n deferred;\n signal;\n constructor(signal) {\n this.signal = signal;\n this.deferred = pDefer();\n this.onAbort = this.onAbort.bind(this);\n this.signal?.addEventListener('abort', this.onAbort);\n }\n onAbort() {\n this.deferred.reject(this.signal?.reason ?? new AbortError());\n }\n cleanup() {\n this.signal?.removeEventListener('abort', this.onAbort);\n }\n}\n//# sourceMappingURL=recipient.js.map","import { AbortError, setMaxListeners } from '@libp2p/interface';\nimport { raceSignal } from 'race-signal';\nimport { JobRecipient } from './recipient.js';\n/**\n * Returns a random string\n */\nfunction randomId() {\n return `${(parseInt(String(Math.random() * 1e9), 10)).toString()}${Date.now()}`;\n}\nexport class Job {\n id;\n fn;\n options;\n recipients;\n status;\n timeline;\n controller;\n constructor(fn, options) {\n this.id = randomId();\n this.status = 'queued';\n this.fn = fn;\n this.options = options;\n this.recipients = [];\n this.timeline = {\n created: Date.now()\n };\n this.controller = new AbortController();\n setMaxListeners(Infinity, this.controller.signal);\n this.onAbort = this.onAbort.bind(this);\n }\n abort(err) {\n this.controller.abort(err);\n }\n onAbort() {\n const allAborted = this.recipients.reduce((acc, curr) => {\n return acc && (curr.signal?.aborted === true);\n }, true);\n // if all recipients have aborted the job, actually abort the job\n if (allAborted) {\n this.controller.abort(new AbortError());\n this.cleanup();\n }\n }\n async join(options = {}) {\n const recipient = new JobRecipient(options.signal);\n this.recipients.push(recipient);\n options.signal?.addEventListener('abort', this.onAbort);\n return recipient.deferred.promise;\n }\n async run() {\n this.status = 'running';\n this.timeline.started = Date.now();\n try {\n this.controller.signal.throwIfAborted();\n const result = await raceSignal(this.fn({\n ...(this.options ?? {}),\n signal: this.controller.signal\n }), this.controller.signal);\n this.recipients.forEach(recipient => {\n recipient.deferred.resolve(result);\n });\n this.status = 'complete';\n }\n catch (err) {\n this.recipients.forEach(recipient => {\n recipient.deferred.reject(err);\n });\n this.status = 'errored';\n }\n finally {\n this.timeline.finished = Date.now();\n this.cleanup();\n }\n }\n cleanup() {\n this.recipients.forEach(recipient => {\n recipient.cleanup();\n recipient.signal?.removeEventListener('abort', this.onAbort);\n });\n }\n}\n//# sourceMappingURL=job.js.map","import { AbortError, CodeError, TypedEventEmitter } from '@libp2p/interface';\nimport { pushable } from 'it-pushable';\nimport { raceEvent } from 'race-event';\nimport { Job } from './job.js';\n/**\n * Heavily influence by `p-queue` with the following differences:\n *\n * 1. Items remain at the head of the queue while they are running so `queue.size` includes `queue.pending` items - this is so interested parties can join the results of a queue item while it is running\n * 2. The options for a job are stored separately to the job in order for them to be modified while they are still in the queue\n */\nexport class Queue extends TypedEventEmitter {\n concurrency;\n queue;\n pending;\n sort;\n constructor(init = {}) {\n super();\n this.concurrency = init.concurrency ?? Number.POSITIVE_INFINITY;\n this.pending = 0;\n if (init.metricName != null) {\n init.metrics?.registerMetricGroup(init.metricName, {\n calculate: () => {\n return {\n size: this.queue.length,\n running: this.pending,\n queued: this.queue.length - this.pending\n };\n }\n });\n }\n this.sort = init.sort;\n this.queue = [];\n }\n tryToStartAnother() {\n if (this.size === 0) {\n // do this in the microtask queue so all job recipients receive the\n // result before the \"empty\" event fires\n queueMicrotask(() => {\n this.safeDispatchEvent('empty');\n });\n if (this.running === 0) {\n // do this in the microtask queue so all job recipients receive the\n // result before the \"idle\" event fires\n queueMicrotask(() => {\n this.safeDispatchEvent('idle');\n });\n }\n return false;\n }\n if (this.pending < this.concurrency) {\n let job;\n for (const j of this.queue) {\n if (j.status === 'queued') {\n job = j;\n break;\n }\n }\n if (job == null) {\n return false;\n }\n this.safeDispatchEvent('active');\n this.pending++;\n void job.run()\n .finally(() => {\n // remove the job from the queue\n for (let i = 0; i < this.queue.length; i++) {\n if (this.queue[i] === job) {\n this.queue.splice(i, 1);\n break;\n }\n }\n this.pending--;\n this.tryToStartAnother();\n this.safeDispatchEvent('next');\n });\n return true;\n }\n return false;\n }\n enqueue(job) {\n this.queue.push(job);\n if (this.sort != null) {\n this.queue.sort(this.sort);\n }\n }\n /**\n * Adds a sync or async task to the queue. Always returns a promise.\n */\n async add(fn, options) {\n options?.signal?.throwIfAborted();\n const job = new Job(fn, options);\n this.enqueue(job);\n this.safeDispatchEvent('add');\n this.tryToStartAnother();\n return job.join(options)\n .then(result => {\n this.safeDispatchEvent('completed', { detail: result });\n this.safeDispatchEvent('success', { detail: { job, result } });\n return result;\n })\n .catch(err => {\n if (job.status === 'queued') {\n // job was aborted before it started - remove the job from the queue\n for (let i = 0; i < this.queue.length; i++) {\n if (this.queue[i] === job) {\n this.queue.splice(i, 1);\n break;\n }\n }\n }\n this.safeDispatchEvent('error', { detail: err });\n this.safeDispatchEvent('failure', { detail: { job, error: err } });\n throw err;\n });\n }\n /**\n * Clear the queue\n */\n clear() {\n this.queue.splice(0, this.queue.length);\n }\n /**\n * Abort all jobs in the queue and clear it\n */\n abort() {\n this.queue.forEach(job => {\n job.abort(new AbortError());\n });\n this.clear();\n }\n /**\n * Can be called multiple times. Useful if you for example add additional items at a later time.\n *\n * @returns A promise that settles when the queue becomes empty.\n */\n async onEmpty(options) {\n // Instantly resolve if the queue is empty\n if (this.size === 0) {\n return;\n }\n await raceEvent(this, 'empty', options?.signal);\n }\n /**\n * @returns A promise that settles when the queue size is less than the given\n * limit: `queue.size < limit`.\n *\n * If you want to avoid having the queue grow beyond a certain size you can\n * `await queue.onSizeLessThan()` before adding a new item.\n *\n * Note that this only limits the number of items waiting to start. There\n * could still be up to `concurrency` jobs already running that this call does\n * not include in its calculation.\n */\n async onSizeLessThan(limit, options) {\n // Instantly resolve if the queue is empty.\n if (this.size < limit) {\n return;\n }\n await raceEvent(this, 'next', options?.signal, {\n filter: () => this.size < limit\n });\n }\n /**\n * The difference with `.onEmpty` is that `.onIdle` guarantees that all work\n * from the queue has finished. `.onEmpty` merely signals that the queue is\n * empty, but it could mean that some promises haven't completed yet.\n *\n * @returns A promise that settles when the queue becomes empty, and all\n * promises have completed; `queue.size === 0 && queue.pending === 0`.\n */\n async onIdle(options) {\n // Instantly resolve if none pending and if nothing else is queued\n if (this.pending === 0 && this.size === 0) {\n return;\n }\n await raceEvent(this, 'idle', options?.signal);\n }\n /**\n * Size of the queue including running items\n */\n get size() {\n return this.queue.length;\n }\n /**\n * The number of queued items waiting to run.\n */\n get queued() {\n return this.queue.length - this.pending;\n }\n /**\n * The number of items currently running.\n */\n get running() {\n return this.pending;\n }\n /**\n * Returns an async generator that makes it easy to iterate over the results\n * of jobs added to the queue.\n *\n * The generator will end when the queue becomes idle, that is there are no\n * jobs running and no jobs that have yet to run.\n *\n * If you need to keep the queue open indefinitely, consider using it-pushable\n * instead.\n */\n async *toGenerator(options) {\n options?.signal?.throwIfAborted();\n const stream = pushable({\n objectMode: true\n });\n const cleanup = (err) => {\n if (err != null) {\n this.abort();\n }\n else {\n this.clear();\n }\n stream.end(err);\n };\n const onQueueJobComplete = (evt) => {\n if (evt.detail != null) {\n stream.push(evt.detail);\n }\n };\n const onQueueError = (evt) => {\n cleanup(evt.detail);\n };\n const onQueueIdle = () => {\n cleanup();\n };\n // clear the queue and throw if the query is aborted\n const onSignalAbort = () => {\n cleanup(new CodeError('Queue aborted', 'ERR_QUEUE_ABORTED'));\n };\n // add listeners\n this.addEventListener('completed', onQueueJobComplete);\n this.addEventListener('error', onQueueError);\n this.addEventListener('idle', onQueueIdle);\n options?.signal?.addEventListener('abort', onSignalAbort);\n try {\n yield* stream;\n }\n finally {\n // remove listeners\n this.removeEventListener('completed', onQueueJobComplete);\n this.removeEventListener('error', onQueueError);\n this.removeEventListener('idle', onQueueIdle);\n options?.signal?.removeEventListener('abort', onSignalAbort);\n // empty the queue for when the user has broken out of a loop early\n cleanup();\n }\n }\n}\n//# sourceMappingURL=index.js.map","import { Queue } from './queue/index.js';\n/**\n * Extends Queue to add support for querying queued jobs by peer id\n */\nexport class PeerQueue extends Queue {\n has(peerId) {\n return this.find(peerId) != null;\n }\n find(peerId) {\n return this.queue.find(job => {\n return peerId.equals(job.options.peerId);\n });\n }\n}\n//# sourceMappingURL=peer-queue.js.map","export * from './constants.defaults.js';\n/**\n * @see https://libp2p.github.io/js-libp2p/interfaces/index._internal_.ConnectionManagerConfig.html#minConnections\n */\nexport const MIN_CONNECTIONS = 5;\n/**\n * @see https://libp2p.github.io/js-libp2p/interfaces/index._internal_.ConnectionManagerConfig.html#maxConnections\n */\nexport const MAX_CONNECTIONS = 100;\n/**\n * @see https://libp2p.github.io/js-libp2p/interfaces/index._internal_.ConnectionManagerConfig.html#maxParallelDials\n */\nexport const MAX_PARALLEL_DIALS = 50;\n/**\n * @see https://libp2p.github.io/js-libp2p/interfaces/libp2p.index.unknown.ConnectionManagerInit.html#autoDialPeerRetryThreshold\n */\nexport const AUTO_DIAL_PEER_RETRY_THRESHOLD = 1000 * 60 * 7;\n//# sourceMappingURL=constants.browser.js.map","/**\n * @see https://libp2p.github.io/js-libp2p/interfaces/index._internal_.ConnectionManagerConfig.html#dialTimeout\n */\nexport const DIAL_TIMEOUT = 5e3;\n/**\n * @see https://libp2p.github.io/js-libp2p/interfaces/index._internal_.ConnectionManagerConfig.html#inboundUpgradeTimeout\n */\nexport const INBOUND_UPGRADE_TIMEOUT = 2e3;\n/**\n * @see https://libp2p.github.io/js-libp2p/interfaces/index._internal_.ConnectionManagerConfig.html#maxPeerAddrsToDial\n */\nexport const MAX_PEER_ADDRS_TO_DIAL = 25;\n/**\n * @see https://libp2p.github.io/js-libp2p/interfaces/index._internal_.ConnectionManagerConfig.html#autoDialInterval\n */\nexport const AUTO_DIAL_INTERVAL = 5000;\n/**\n * @see https://libp2p.github.io/js-libp2p/interfaces/index._internal_.ConnectionManagerConfig.html#autoDialConcurrency\n */\nexport const AUTO_DIAL_CONCURRENCY = 25;\n/**\n * @see https://libp2p.github.io/js-libp2p/interfaces/index._internal_.ConnectionManagerConfig.html#autoDialPriority\n */\nexport const AUTO_DIAL_PRIORITY = 0;\n/**\n * @see https://libp2p.github.io/js-libp2p/interfaces/index._internal_.ConnectionManagerConfig.html#autoDialMaxQueueLength\n */\nexport const AUTO_DIAL_MAX_QUEUE_LENGTH = 100;\n/**\n * @see https://libp2p.github.io/js-libp2p/interfaces/libp2p.index.unknown.ConnectionManagerInit.html#autoDialDiscoveredPeersDebounce\n */\nexport const AUTO_DIAL_DISCOVERED_PEERS_DEBOUNCE = 10;\n/**\n * @see https://libp2p.github.io/js-libp2p/interfaces/index._internal_.ConnectionManagerConfig.html#inboundConnectionThreshold\n */\nexport const INBOUND_CONNECTION_THRESHOLD = 5;\n/**\n * @see https://libp2p.github.io/js-libp2p/interfaces/index._internal_.ConnectionManagerConfig.html#maxIncomingPendingConnections\n */\nexport const MAX_INCOMING_PENDING_CONNECTIONS = 10;\n/**\n * Store as part of the peer store metadata for a given peer, the value for this\n * key is a timestamp of the last time a dial attempted failed with the relevant\n * peer stored as a string.\n *\n * Used to insure we do not endlessly try to auto dial peers we have recently\n * failed to dial.\n */\nexport const LAST_DIAL_FAILURE_KEY = 'last-dial-failure';\n/**\n * @see https://libp2p.github.io/js-libp2p/interfaces/index._internal_.ConnectionManagerConfig.html#maxDialQueueLength\n */\nexport const MAX_DIAL_QUEUE_LENGTH = 500;\n//# sourceMappingURL=constants.defaults.js.map","import { PeerMap, PeerSet } from '@libp2p/peer-collections';\nimport { PeerQueue } from '@libp2p/utils/peer-queue';\nimport { toString as uint8ArrayToString } from 'uint8arrays/to-string';\nimport { AUTO_DIAL_CONCURRENCY, AUTO_DIAL_DISCOVERED_PEERS_DEBOUNCE, AUTO_DIAL_INTERVAL, AUTO_DIAL_MAX_QUEUE_LENGTH, AUTO_DIAL_PEER_RETRY_THRESHOLD, AUTO_DIAL_PRIORITY, LAST_DIAL_FAILURE_KEY, MIN_CONNECTIONS } from './constants.js';\nconst defaultOptions = {\n minConnections: MIN_CONNECTIONS,\n maxQueueLength: AUTO_DIAL_MAX_QUEUE_LENGTH,\n autoDialConcurrency: AUTO_DIAL_CONCURRENCY,\n autoDialPriority: AUTO_DIAL_PRIORITY,\n autoDialInterval: AUTO_DIAL_INTERVAL,\n autoDialPeerRetryThreshold: AUTO_DIAL_PEER_RETRY_THRESHOLD,\n autoDialDiscoveredPeersDebounce: AUTO_DIAL_DISCOVERED_PEERS_DEBOUNCE\n};\nexport class AutoDial {\n connectionManager;\n peerStore;\n queue;\n minConnections;\n autoDialPriority;\n autoDialIntervalMs;\n autoDialMaxQueueLength;\n autoDialPeerRetryThresholdMs;\n autoDialDiscoveredPeersDebounce;\n autoDialInterval;\n started;\n running;\n log;\n /**\n * Proactively tries to connect to known peers stored in the PeerStore.\n * It will keep the number of connections below the upper limit and sort\n * the peers to connect based on whether we know their keys and protocols.\n */\n constructor(components, init) {\n this.connectionManager = components.connectionManager;\n this.peerStore = components.peerStore;\n this.minConnections = init.minConnections ?? defaultOptions.minConnections;\n this.autoDialPriority = init.autoDialPriority ?? defaultOptions.autoDialPriority;\n this.autoDialIntervalMs = init.autoDialInterval ?? defaultOptions.autoDialInterval;\n this.autoDialMaxQueueLength = init.maxQueueLength ?? defaultOptions.maxQueueLength;\n this.autoDialPeerRetryThresholdMs = init.autoDialPeerRetryThreshold ?? defaultOptions.autoDialPeerRetryThreshold;\n this.autoDialDiscoveredPeersDebounce = init.autoDialDiscoveredPeersDebounce ?? defaultOptions.autoDialDiscoveredPeersDebounce;\n this.log = components.logger.forComponent('libp2p:connection-manager:auto-dial');\n this.started = false;\n this.running = false;\n this.queue = new PeerQueue({\n concurrency: init.autoDialConcurrency ?? defaultOptions.autoDialConcurrency,\n metricName: 'libp2p_autodial_queue',\n metrics: components.metrics\n });\n this.queue.addEventListener('error', (evt) => {\n this.log.error('error during auto-dial', evt.detail);\n });\n // check the min connection limit whenever a peer disconnects\n components.events.addEventListener('connection:close', () => {\n this.autoDial()\n .catch(err => {\n this.log.error(err);\n });\n });\n // sometimes peers are discovered in quick succession so add a small\n // debounce to ensure all eligible peers are autodialed\n let debounce;\n // when new peers are discovered, dial them if we don't have\n // enough connections\n components.events.addEventListener('peer:discovery', () => {\n clearTimeout(debounce);\n debounce = setTimeout(() => {\n this.autoDial()\n .catch(err => {\n this.log.error(err);\n });\n }, this.autoDialDiscoveredPeersDebounce);\n });\n }\n isStarted() {\n return this.started;\n }\n start() {\n this.started = true;\n }\n afterStart() {\n this.autoDial()\n .catch(err => {\n this.log.error('error while autodialing', err);\n });\n }\n stop() {\n // clear the queue\n this.queue.clear();\n clearTimeout(this.autoDialInterval);\n this.started = false;\n this.running = false;\n }\n async autoDial() {\n if (!this.started || this.running) {\n return;\n }\n const connections = this.connectionManager.getConnectionsMap();\n const numConnections = connections.size;\n // already have enough connections\n if (numConnections >= this.minConnections) {\n if (this.minConnections > 0) {\n this.log.trace('have enough connections %d/%d', numConnections, this.minConnections);\n }\n // no need to schedule next autodial as it will be run when on\n // connection:close event\n return;\n }\n if (this.queue.size > this.autoDialMaxQueueLength) {\n this.log('not enough connections %d/%d but auto dial queue is full', numConnections, this.minConnections);\n this.sheduleNextAutodial();\n return;\n }\n this.running = true;\n this.log('not enough connections %d/%d - will dial peers to increase the number of connections', numConnections, this.minConnections);\n const dialQueue = new PeerSet(\n // @ts-expect-error boolean filter removes falsy peer IDs\n this.connectionManager.getDialQueue()\n .map(queue => queue.peerId)\n .filter(Boolean));\n // sort peers on whether we know protocols or public keys for them\n const peers = await this.peerStore.all({\n filters: [\n // remove some peers\n (peer) => {\n // remove peers without addresses\n if (peer.addresses.length === 0) {\n this.log.trace('not autodialing %p because they have no addresses', peer.id);\n return false;\n }\n // remove peers we are already connected to\n if (connections.has(peer.id)) {\n this.log.trace('not autodialing %p because they are already connected', peer.id);\n return false;\n }\n // remove peers we are already dialling\n if (dialQueue.has(peer.id)) {\n this.log.trace('not autodialing %p because they are already being dialed', peer.id);\n return false;\n }\n // remove peers already in the autodial queue\n if (this.queue.has(peer.id)) {\n this.log.trace('not autodialing %p because they are already being autodialed', peer.id);\n return false;\n }\n return true;\n }\n ]\n });\n // shuffle the peers - this is so peers with the same tag values will be\n // dialled in a different order each time\n const shuffledPeers = peers.sort(() => Math.random() > 0.5 ? 1 : -1);\n // sort shuffled peers by tag value\n const peerValues = new PeerMap();\n for (const peer of shuffledPeers) {\n if (peerValues.has(peer.id)) {\n continue;\n }\n // sum all tag values\n peerValues.set(peer.id, [...peer.tags.values()].reduce((acc, curr) => {\n return acc + curr.value;\n }, 0));\n }\n // sort by value, highest to lowest\n const sortedPeers = shuffledPeers.sort((a, b) => {\n const peerAValue = peerValues.get(a.id) ?? 0;\n const peerBValue = peerValues.get(b.id) ?? 0;\n if (peerAValue > peerBValue) {\n return -1;\n }\n if (peerAValue < peerBValue) {\n return 1;\n }\n return 0;\n });\n const peersThatHaveNotFailed = sortedPeers.filter(peer => {\n const lastDialFailure = peer.metadata.get(LAST_DIAL_FAILURE_KEY);\n if (lastDialFailure == null) {\n return true;\n }\n const lastDialFailureTimestamp = parseInt(uint8ArrayToString(lastDialFailure));\n if (isNaN(lastDialFailureTimestamp)) {\n return true;\n }\n // only dial if the time since the last failure is above the retry threshold\n return Date.now() - lastDialFailureTimestamp > this.autoDialPeerRetryThresholdMs;\n });\n this.log('selected %d/%d peers to dial', peersThatHaveNotFailed.length, peers.length);\n for (const peer of peersThatHaveNotFailed) {\n this.queue.add(async () => {\n const numConnections = this.connectionManager.getConnectionsMap().size;\n // Check to see if we still need to auto dial\n if (numConnections >= this.minConnections) {\n this.log('got enough connections now %d/%d', numConnections, this.minConnections);\n this.queue.clear();\n return;\n }\n this.log('connecting to a peerStore stored peer %p', peer.id);\n await this.connectionManager.openConnection(peer.id, {\n priority: this.autoDialPriority\n });\n }, {\n peerId: peer.id\n }).catch(err => {\n this.log.error('could not connect to peerStore stored peer', err);\n });\n }\n this.running = false;\n this.sheduleNextAutodial();\n }\n sheduleNextAutodial() {\n if (!this.started) {\n return;\n }\n this.autoDialInterval = setTimeout(() => {\n this.autoDial()\n .catch(err => {\n this.log.error('error while autodialing', err);\n });\n }, this.autoDialIntervalMs);\n }\n}\n//# sourceMappingURL=auto-dial.js.map","/**\n * Close the passed stream, falling back to aborting the stream if closing\n * cleanly fails.\n */\nexport async function safelyCloseStream(stream, options) {\n try {\n await stream?.close(options);\n }\n catch (err) {\n stream?.abort(err);\n }\n}\n/**\n * These are speculative protocols that are run automatically on connection open\n * so are usually not the reason the connection was opened.\n *\n * Consequently when requested it should be safe to close connections that only\n * have these protocol streams open.\n */\nconst DEFAULT_CLOSABLE_PROTOCOLS = [\n // identify\n '/ipfs/id/1.0.0',\n // identify-push\n '/ipfs/id/push/1.0.0',\n // autonat\n '/libp2p/autonat/1.0.0',\n // dcutr\n '/libp2p/dcutr'\n];\n/**\n * Close the passed connection if it has no streams, or only closable protocol\n * streams, falling back to aborting the connection if closing it cleanly fails.\n */\nexport async function safelyCloseConnectionIfUnused(connection, options) {\n const streamProtocols = connection?.streams?.map(stream => stream.protocol) ?? [];\n const closableProtocols = options?.closableProtocols ?? DEFAULT_CLOSABLE_PROTOCOLS;\n // if the connection has protocols not in the closable protocols list, do not\n // close the connection\n if (streamProtocols.filter(proto => proto != null && !closableProtocols.includes(proto)).length > 0) {\n return;\n }\n try {\n await connection?.close(options);\n }\n catch (err) {\n connection?.abort(err);\n }\n}\n//# sourceMappingURL=close.js.map","import { PeerMap } from '@libp2p/peer-collections';\nimport { safelyCloseConnectionIfUnused } from '@libp2p/utils/close';\nimport { MAX_CONNECTIONS } from './constants.js';\nconst defaultOptions = {\n maxConnections: MAX_CONNECTIONS,\n allow: []\n};\n/**\n * If we go over the max connections limit, choose some connections to close\n */\nexport class ConnectionPruner {\n maxConnections;\n connectionManager;\n peerStore;\n allow;\n events;\n log;\n constructor(components, init = {}) {\n this.maxConnections = init.maxConnections ?? defaultOptions.maxConnections;\n this.allow = init.allow ?? defaultOptions.allow;\n this.connectionManager = components.connectionManager;\n this.peerStore = components.peerStore;\n this.events = components.events;\n this.log = components.logger.forComponent('libp2p:connection-manager:connection-pruner');\n // check the max connection limit whenever a peer connects\n components.events.addEventListener('connection:open', () => {\n this.maybePruneConnections()\n .catch(err => {\n this.log.error(err);\n });\n });\n }\n /**\n * If we have more connections than our maximum, select some excess connections\n * to prune based on peer value\n */\n async maybePruneConnections() {\n const connections = this.connectionManager.getConnections();\n const numConnections = connections.length;\n this.log('checking max connections limit %d/%d', numConnections, this.maxConnections);\n if (numConnections <= this.maxConnections) {\n return;\n }\n const peerValues = new PeerMap();\n // work out peer values\n for (const connection of connections) {\n const remotePeer = connection.remotePeer;\n if (peerValues.has(remotePeer)) {\n continue;\n }\n peerValues.set(remotePeer, 0);\n try {\n const peer = await this.peerStore.get(remotePeer);\n // sum all tag values\n peerValues.set(remotePeer, [...peer.tags.values()].reduce((acc, curr) => {\n return acc + curr.value;\n }, 0));\n }\n catch (err) {\n if (err.code !== 'ERR_NOT_FOUND') {\n this.log.error('error loading peer tags', err);\n }\n }\n }\n const sortedConnections = this.sortConnections(connections, peerValues);\n // close some connections\n const toPrune = Math.max(numConnections - this.maxConnections, 0);\n const toClose = [];\n for (const connection of sortedConnections) {\n this.log('too many connections open - closing a connection to %p', connection.remotePeer);\n // check allow list\n const connectionInAllowList = this.allow.some((ma) => {\n return connection.remoteAddr.toString().startsWith(ma.toString());\n });\n // Connections in the allow list should be excluded from pruning\n if (!connectionInAllowList) {\n toClose.push(connection);\n }\n if (toClose.length === toPrune) {\n break;\n }\n }\n // close connections\n await Promise.all(toClose.map(async (connection) => {\n await safelyCloseConnectionIfUnused(connection, {\n signal: AbortSignal.timeout(1000)\n });\n }));\n // despatch prune event\n this.events.safeDispatchEvent('connection:prune', { detail: toClose });\n }\n sortConnections(connections, peerValues) {\n return connections\n // sort by connection age, newest to oldest\n .sort((a, b) => {\n const connectionALifespan = a.timeline.open;\n const connectionBLifespan = b.timeline.open;\n if (connectionALifespan < connectionBLifespan) {\n return 1;\n }\n if (connectionALifespan > connectionBLifespan) {\n return -1;\n }\n return 0;\n })\n // sort by direction, incoming first then outgoing\n .sort((a, b) => {\n if (a.direction === 'outbound' && b.direction === 'inbound') {\n return 1;\n }\n if (a.direction === 'inbound' && b.direction === 'outbound') {\n return -1;\n }\n return 0;\n })\n // sort by number of streams, lowest to highest\n .sort((a, b) => {\n if (a.streams.length > b.streams.length) {\n return 1;\n }\n if (a.streams.length < b.streams.length) {\n return -1;\n }\n return 0;\n })\n // sort by tag value, lowest to highest\n .sort((a, b) => {\n const peerAValue = peerValues.get(a.remotePeer) ?? 0;\n const peerBValue = peerValues.get(b.remotePeer) ?? 0;\n if (peerAValue > peerBValue) {\n return 1;\n }\n if (peerAValue < peerBValue) {\n return -1;\n }\n return 0;\n });\n }\n}\n//# sourceMappingURL=connection-pruner.js.map","import { Queue } from './queue/index.js';\nexport class PriorityQueue extends Queue {\n constructor(init = {}) {\n super({\n ...init,\n sort: (a, b) => {\n if (a.options.priority > b.options.priority) {\n return -1;\n }\n if (a.options.priority < b.options.priority) {\n return 1;\n }\n return 0;\n }\n });\n }\n}\n//# sourceMappingURL=priority-queue.js.map","/**\n * Takes an array of AbortSignals and returns a single signal.\n * If any signals are aborted, the returned signal will be aborted.\n */\nexport function anySignal(signals) {\n const controller = new globalThis.AbortController();\n function onAbort() {\n controller.abort();\n for (const signal of signals) {\n if (signal?.removeEventListener != null) {\n signal.removeEventListener('abort', onAbort);\n }\n }\n }\n for (const signal of signals) {\n if (signal?.aborted === true) {\n onAbort();\n break;\n }\n if (signal?.addEventListener != null) {\n signal.addEventListener('abort', onAbort);\n }\n }\n function clear() {\n for (const signal of signals) {\n if (signal?.removeEventListener != null) {\n signal.removeEventListener('abort', onAbort);\n }\n }\n }\n const signal = controller.signal;\n signal.clear = clear;\n return signal;\n}\n//# sourceMappingURL=index.js.map","/* eslint-disable max-depth */\nimport { CodeError, AggregateCodeError, ERR_TIMEOUT, setMaxListeners } from '@libp2p/interface';\nimport { PeerMap } from '@libp2p/peer-collections';\nimport { defaultAddressSort } from '@libp2p/utils/address-sort';\nimport { PriorityQueue } from '@libp2p/utils/priority-queue';\nimport { resolvers, multiaddr } from '@multiformats/multiaddr';\nimport { dnsaddrResolver } from '@multiformats/multiaddr/resolvers';\nimport { Circuit } from '@multiformats/multiaddr-matcher';\nimport { anySignal } from 'any-signal';\nimport { CustomProgressEvent } from 'progress-events';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport { codes } from '../errors.js';\nimport { getPeerAddress } from '../get-peer.js';\nimport { DIAL_TIMEOUT, MAX_PARALLEL_DIALS, MAX_PEER_ADDRS_TO_DIAL, LAST_DIAL_FAILURE_KEY, MAX_DIAL_QUEUE_LENGTH } from './constants.js';\nimport { resolveMultiaddrs } from './utils.js';\nimport { DEFAULT_DIAL_PRIORITY } from './index.js';\nconst defaultOptions = {\n addressSorter: defaultAddressSort,\n maxParallelDials: MAX_PARALLEL_DIALS,\n maxDialQueueLength: MAX_DIAL_QUEUE_LENGTH,\n maxPeerAddrsToDial: MAX_PEER_ADDRS_TO_DIAL,\n dialTimeout: DIAL_TIMEOUT,\n resolvers: {\n dnsaddr: dnsaddrResolver\n }\n};\nexport class DialQueue {\n queue;\n components;\n addressSorter;\n maxPeerAddrsToDial;\n maxDialQueueLength;\n dialTimeout;\n shutDownController;\n connections;\n log;\n constructor(components, init = {}) {\n this.addressSorter = init.addressSorter ?? defaultOptions.addressSorter;\n this.maxPeerAddrsToDial = init.maxPeerAddrsToDial ?? defaultOptions.maxPeerAddrsToDial;\n this.maxDialQueueLength = init.maxDialQueueLength ?? defaultOptions.maxDialQueueLength;\n this.dialTimeout = init.dialTimeout ?? defaultOptions.dialTimeout;\n this.connections = init.connections ?? new PeerMap();\n this.log = components.logger.forComponent('libp2p:connection-manager:dial-queue');\n this.components = components;\n this.shutDownController = new AbortController();\n setMaxListeners(Infinity, this.shutDownController.signal);\n for (const [key, value] of Object.entries(init.resolvers ?? {})) {\n resolvers.set(key, value);\n }\n // controls dial concurrency\n this.queue = new PriorityQueue({\n concurrency: init.maxParallelDials ?? defaultOptions.maxParallelDials,\n metricName: 'libp2p_dial_queue',\n metrics: components.metrics\n });\n // a started job errored\n this.queue.addEventListener('error', (event) => {\n this.log.error('error in dial queue', event.detail);\n });\n }\n start() {\n this.shutDownController = new AbortController();\n setMaxListeners(Infinity, this.shutDownController.signal);\n }\n /**\n * Clears any pending dials\n */\n stop() {\n this.shutDownController.abort();\n this.queue.abort();\n }\n /**\n * Connects to a given peer, multiaddr or list of multiaddrs.\n *\n * If a peer is passed, all known multiaddrs will be tried. If a multiaddr or\n * multiaddrs are passed only those will be dialled.\n *\n * Where a list of multiaddrs is passed, if any contain a peer id then all\n * multiaddrs in the list must contain the same peer id.\n *\n * The dial to the first address that is successfully able to upgrade a\n * connection will be used, all other dials will be aborted when that happens.\n */\n async dial(peerIdOrMultiaddr, options = {}) {\n const { peerId, multiaddrs } = getPeerAddress(peerIdOrMultiaddr);\n // make sure we don't have an existing connection to any of the addresses we\n // are about to dial\n const existingConnection = Array.from(this.connections.values()).flat().find(conn => {\n if (options.force === true) {\n return false;\n }\n if (conn.remotePeer.equals(peerId)) {\n return true;\n }\n return multiaddrs.find(addr => {\n return addr.equals(conn.remoteAddr);\n });\n });\n if (existingConnection != null) {\n this.log('already connected to %a', existingConnection.remoteAddr);\n options.onProgress?.(new CustomProgressEvent('dial-queue:already-connected'));\n return existingConnection;\n }\n // ready to dial, all async work finished - make sure we don't have any\n // pending dials in progress for this peer or set of multiaddrs\n const existingDial = this.queue.queue.find(job => {\n if (peerId?.equals(job.options.peerId) === true) {\n return true;\n }\n // does the dial contain any of the target multiaddrs?\n const addresses = job.options.multiaddrs;\n if (addresses == null) {\n return false;\n }\n for (const multiaddr of multiaddrs) {\n if (addresses.has(multiaddr.toString())) {\n return true;\n }\n }\n return false;\n });\n if (existingDial != null) {\n this.log('joining existing dial target for %p', peerId);\n // add all multiaddrs to the dial target\n for (const multiaddr of multiaddrs) {\n existingDial.options.multiaddrs.add(multiaddr.toString());\n }\n options.onProgress?.(new CustomProgressEvent('dial-queue:already-in-dial-queue'));\n return existingDial.join(options);\n }\n if (this.queue.size >= this.maxDialQueueLength) {\n throw new CodeError('Dial queue is full', 'ERR_DIAL_QUEUE_FULL');\n }\n this.log('creating dial target for %p', peerId, multiaddrs.map(ma => ma.toString()));\n options.onProgress?.(new CustomProgressEvent('dial-queue:add-to-dial-queue'));\n return this.queue.add(async (options) => {\n options?.onProgress?.(new CustomProgressEvent('dial-queue:start-dial'));\n // create abort conditions - need to do this before `calculateMultiaddrs` as\n // we may be about to resolve a dns addr which can time out\n const signal = this.createDialAbortController(options?.signal);\n let addrsToDial;\n try {\n // load addresses from address book, resolve and dnsaddrs, filter\n // undiallables, add peer IDs, etc\n addrsToDial = await this.calculateMultiaddrs(peerId, options?.multiaddrs, {\n ...options,\n signal\n });\n options?.onProgress?.(new CustomProgressEvent('dial-queue:calculated-addresses', addrsToDial));\n addrsToDial.map(({ multiaddr }) => multiaddr.toString()).forEach(addr => {\n options?.multiaddrs.add(addr);\n });\n }\n catch (err) {\n signal.clear();\n throw err;\n }\n try {\n let dialed = 0;\n const errors = [];\n for (const address of addrsToDial) {\n if (dialed === this.maxPeerAddrsToDial) {\n this.log('dialed maxPeerAddrsToDial (%d) addresses for %p, not trying any others', dialed, peerId);\n throw new CodeError('Peer had more than maxPeerAddrsToDial', codes.ERR_TOO_MANY_ADDRESSES);\n }\n dialed++;\n try {\n const conn = await this.components.transportManager.dial(address.multiaddr, {\n ...options,\n signal\n });\n this.log('dial to %a succeeded', address.multiaddr);\n return conn;\n }\n catch (err) {\n this.log.error('dial failed to %a', address.multiaddr, err);\n if (peerId != null) {\n // record the failed dial\n try {\n await this.components.peerStore.patch(peerId, {\n metadata: {\n [LAST_DIAL_FAILURE_KEY]: uint8ArrayFromString(Date.now().toString())\n }\n });\n }\n catch (err) {\n this.log.error('could not update last dial failure key for %p', peerId, err);\n }\n }\n // the user/dial timeout/shutdown controller signal aborted\n if (signal.aborted) {\n throw new CodeError(err.message, ERR_TIMEOUT);\n }\n errors.push(err);\n }\n }\n if (errors.length === 1) {\n throw errors[0];\n }\n throw new AggregateCodeError(errors, 'All multiaddr dials failed', codes.ERR_TRANSPORT_DIAL_FAILED);\n }\n finally {\n // clean up abort signals/controllers\n signal.clear();\n }\n }, {\n peerId,\n priority: options.priority ?? DEFAULT_DIAL_PRIORITY,\n multiaddrs: new Set(multiaddrs.map(ma => ma.toString())),\n signal: options.signal,\n onProgress: options.onProgress\n });\n }\n createDialAbortController(userSignal) {\n // let any signal abort the dial\n const signal = anySignal([\n AbortSignal.timeout(this.dialTimeout),\n this.shutDownController.signal,\n userSignal\n ]);\n // This emitter gets listened to a lot\n setMaxListeners(Infinity, signal);\n return signal;\n }\n // eslint-disable-next-line complexity\n async calculateMultiaddrs(peerId, multiaddrs = new Set(), options = {}) {\n const addrs = [...multiaddrs].map(ma => ({\n multiaddr: multiaddr(ma),\n isCertified: false\n }));\n // if a peer id or multiaddr(s) with a peer id, make sure it isn't our peer id and that we are allowed to dial it\n if (peerId != null) {\n if (this.components.peerId.equals(peerId)) {\n throw new CodeError('Tried to dial self', codes.ERR_DIALED_SELF);\n }\n if ((await this.components.connectionGater.denyDialPeer?.(peerId)) === true) {\n throw new CodeError('The dial request is blocked by gater.allowDialPeer', codes.ERR_PEER_DIAL_INTERCEPTED);\n }\n // if just a peer id was passed, load available multiaddrs for this peer\n // from the peer store\n if (addrs.length === 0) {\n this.log('loading multiaddrs for %p', peerId);\n try {\n const peer = await this.components.peerStore.get(peerId);\n addrs.push(...peer.addresses);\n this.log('loaded multiaddrs for %p', peerId, addrs.map(({ multiaddr }) => multiaddr.toString()));\n }\n catch (err) {\n if (err.code !== codes.ERR_NOT_FOUND) {\n throw err;\n }\n }\n }\n // if we still don't have any addresses for this peer, try a lookup\n // using the peer routing\n if (addrs.length === 0) {\n this.log('looking up multiaddrs for %p in the peer routing', peerId);\n try {\n const peerInfo = await this.components.peerRouting.findPeer(peerId);\n this.log('found multiaddrs for %p in the peer routing', peerId, addrs.map(({ multiaddr }) => multiaddr.toString()));\n addrs.push(...peerInfo.multiaddrs.map(multiaddr => ({\n multiaddr,\n isCertified: false\n })));\n }\n catch (err) {\n if (err.code !== codes.ERR_NO_ROUTERS_AVAILABLE) {\n this.log.error('looking up multiaddrs for %p in the peer routing failed', peerId, err);\n }\n }\n }\n }\n // resolve addresses - this can result in a one-to-many translation when\n // dnsaddrs are resolved\n let resolvedAddresses = (await Promise.all(addrs.map(async (addr) => {\n const result = await resolveMultiaddrs(addr.multiaddr, {\n dns: this.components.dns,\n ...options,\n log: this.log\n });\n if (result.length === 1 && result[0].equals(addr.multiaddr)) {\n return addr;\n }\n return result.map(multiaddr => ({\n multiaddr,\n isCertified: false\n }));\n })))\n .flat();\n // ensure the peer id is appended to the multiaddr\n if (peerId != null) {\n const peerIdMultiaddr = `/p2p/${peerId.toString()}`;\n resolvedAddresses = resolvedAddresses.map(addr => {\n const lastProto = addr.multiaddr.protos().pop();\n // do not append peer id to path multiaddrs\n if (lastProto?.path === true) {\n return addr;\n }\n // append peer id to multiaddr if it is not already present\n if (addr.multiaddr.getPeerId() == null) {\n return {\n multiaddr: addr.multiaddr.encapsulate(peerIdMultiaddr),\n isCertified: addr.isCertified\n };\n }\n return addr;\n });\n }\n const filteredAddrs = resolvedAddresses.filter(addr => {\n // filter out any multiaddrs that we do not have transports for\n if (this.components.transportManager.dialTransportForMultiaddr(addr.multiaddr) == null) {\n return false;\n }\n // if the resolved multiaddr has a PeerID but it's the wrong one, ignore it\n // - this can happen with addresses like bootstrap.libp2p.io that resolve\n // to multiple different peers\n const addrPeerId = addr.multiaddr.getPeerId();\n if (peerId != null && addrPeerId != null) {\n return peerId.equals(addrPeerId);\n }\n return true;\n });\n // deduplicate addresses\n const dedupedAddrs = new Map();\n for (const addr of filteredAddrs) {\n const maStr = addr.multiaddr.toString();\n const existing = dedupedAddrs.get(maStr);\n if (existing != null) {\n existing.isCertified = existing.isCertified || addr.isCertified || false;\n continue;\n }\n dedupedAddrs.set(maStr, addr);\n }\n const dedupedMultiaddrs = [...dedupedAddrs.values()];\n // make sure we actually have some addresses to dial\n if (dedupedMultiaddrs.length === 0) {\n throw new CodeError('The dial request has no valid addresses', codes.ERR_NO_VALID_ADDRESSES);\n }\n const gatedAdrs = [];\n for (const addr of dedupedMultiaddrs) {\n if (this.components.connectionGater.denyDialMultiaddr != null && await this.components.connectionGater.denyDialMultiaddr(addr.multiaddr)) {\n continue;\n }\n gatedAdrs.push(addr);\n }\n const sortedGatedAddrs = gatedAdrs.sort(this.addressSorter);\n // make sure we actually have some addresses to dial\n if (sortedGatedAddrs.length === 0) {\n throw new CodeError('The connection gater denied all addresses in the dial request', codes.ERR_NO_VALID_ADDRESSES);\n }\n this.log.trace('addresses for %p before filtering', peerId ?? 'unknown peer', resolvedAddresses.map(({ multiaddr }) => multiaddr.toString()));\n this.log.trace('addresses for %p after filtering', peerId ?? 'unknown peer', sortedGatedAddrs.map(({ multiaddr }) => multiaddr.toString()));\n return sortedGatedAddrs;\n }\n async isDialable(multiaddr, options = {}) {\n if (!Array.isArray(multiaddr)) {\n multiaddr = [multiaddr];\n }\n try {\n const addresses = await this.calculateMultiaddrs(undefined, new Set(multiaddr.map(ma => ma.toString())), options);\n if (options.runOnTransientConnection === false) {\n // return true if any resolved multiaddrs are not relay addresses\n return addresses.find(addr => {\n return !Circuit.matches(addr.multiaddr);\n }) != null;\n }\n return true;\n }\n catch (err) {\n this.log.trace('error calculating if multiaddr(s) were dialable', err);\n }\n return false;\n }\n}\n//# sourceMappingURL=dial-queue.js.map","import { resolvers } from '@multiformats/multiaddr';\n/**\n * Recursively resolve DNSADDR multiaddrs\n */\nexport async function resolveMultiaddrs(ma, options) {\n // check multiaddr resolvers\n let resolvable = false;\n for (const key of resolvers.keys()) {\n resolvable = ma.protoNames().includes(key);\n if (resolvable) {\n break;\n }\n }\n // return multiaddr if it is not resolvable\n if (!resolvable) {\n return [ma];\n }\n const output = await ma.resolve(options);\n options.log('resolved %s to', ma, output.map(ma => ma.toString()));\n return output;\n}\n//# sourceMappingURL=utils.js.map","import { CodeError, KEEP_ALIVE } from '@libp2p/interface';\nimport { PeerMap } from '@libp2p/peer-collections';\nimport { defaultAddressSort } from '@libp2p/utils/address-sort';\nimport { RateLimiter } from '@libp2p/utils/rate-limiter';\nimport { multiaddr } from '@multiformats/multiaddr';\nimport { dnsaddrResolver } from '@multiformats/multiaddr/resolvers';\nimport { CustomProgressEvent } from 'progress-events';\nimport { codes } from '../errors.js';\nimport { getPeerAddress } from '../get-peer.js';\nimport { AutoDial } from './auto-dial.js';\nimport { ConnectionPruner } from './connection-pruner.js';\nimport { AUTO_DIAL_CONCURRENCY, AUTO_DIAL_DISCOVERED_PEERS_DEBOUNCE, AUTO_DIAL_MAX_QUEUE_LENGTH, AUTO_DIAL_PEER_RETRY_THRESHOLD, AUTO_DIAL_PRIORITY, DIAL_TIMEOUT, INBOUND_CONNECTION_THRESHOLD, MAX_CONNECTIONS, MAX_DIAL_QUEUE_LENGTH, MAX_INCOMING_PENDING_CONNECTIONS, MAX_PARALLEL_DIALS, MAX_PEER_ADDRS_TO_DIAL, MIN_CONNECTIONS } from './constants.js';\nimport { DialQueue } from './dial-queue.js';\nexport const DEFAULT_DIAL_PRIORITY = 50;\nconst defaultOptions = {\n minConnections: MIN_CONNECTIONS,\n maxConnections: MAX_CONNECTIONS,\n inboundConnectionThreshold: INBOUND_CONNECTION_THRESHOLD,\n maxIncomingPendingConnections: MAX_INCOMING_PENDING_CONNECTIONS,\n autoDialConcurrency: AUTO_DIAL_CONCURRENCY,\n autoDialPriority: AUTO_DIAL_PRIORITY,\n autoDialMaxQueueLength: AUTO_DIAL_MAX_QUEUE_LENGTH,\n autoDialPeerRetryThreshold: AUTO_DIAL_PEER_RETRY_THRESHOLD,\n autoDialDiscoveredPeersDebounce: AUTO_DIAL_DISCOVERED_PEERS_DEBOUNCE\n};\n/**\n * Responsible for managing known connections.\n */\nexport class DefaultConnectionManager {\n started;\n connections;\n allow;\n deny;\n maxIncomingPendingConnections;\n incomingPendingConnections;\n maxConnections;\n dialQueue;\n autoDial;\n connectionPruner;\n inboundConnectionRateLimiter;\n peerStore;\n metrics;\n events;\n log;\n constructor(components, init = {}) {\n this.maxConnections = init.maxConnections ?? defaultOptions.maxConnections;\n const minConnections = init.minConnections ?? defaultOptions.minConnections;\n if (this.maxConnections < minConnections) {\n throw new CodeError('Connection Manager maxConnections must be greater than minConnections', codes.ERR_INVALID_PARAMETERS);\n }\n /**\n * Map of connections per peer\n */\n this.connections = new PeerMap();\n this.started = false;\n this.peerStore = components.peerStore;\n this.metrics = components.metrics;\n this.events = components.events;\n this.log = components.logger.forComponent('libp2p:connection-manager');\n this.onConnect = this.onConnect.bind(this);\n this.onDisconnect = this.onDisconnect.bind(this);\n this.events.addEventListener('connection:open', this.onConnect);\n this.events.addEventListener('connection:close', this.onDisconnect);\n // allow/deny lists\n this.allow = (init.allow ?? []).map(ma => multiaddr(ma));\n this.deny = (init.deny ?? []).map(ma => multiaddr(ma));\n this.incomingPendingConnections = 0;\n this.maxIncomingPendingConnections = init.maxIncomingPendingConnections ?? defaultOptions.maxIncomingPendingConnections;\n // controls individual peers trying to dial us too quickly\n this.inboundConnectionRateLimiter = new RateLimiter({\n points: init.inboundConnectionThreshold ?? defaultOptions.inboundConnectionThreshold,\n duration: 1\n });\n // controls what happens when we don't have enough connections\n this.autoDial = new AutoDial({\n connectionManager: this,\n peerStore: components.peerStore,\n events: components.events,\n logger: components.logger\n }, {\n minConnections,\n autoDialConcurrency: init.autoDialConcurrency ?? defaultOptions.autoDialConcurrency,\n autoDialPriority: init.autoDialPriority ?? defaultOptions.autoDialPriority,\n autoDialPeerRetryThreshold: init.autoDialPeerRetryThreshold ?? defaultOptions.autoDialPeerRetryThreshold,\n autoDialDiscoveredPeersDebounce: init.autoDialDiscoveredPeersDebounce ?? defaultOptions.autoDialDiscoveredPeersDebounce,\n maxQueueLength: init.autoDialMaxQueueLength ?? defaultOptions.autoDialMaxQueueLength\n });\n // controls what happens when we have too many connections\n this.connectionPruner = new ConnectionPruner({\n connectionManager: this,\n peerStore: components.peerStore,\n events: components.events,\n logger: components.logger\n }, {\n maxConnections: this.maxConnections,\n allow: this.allow\n });\n this.dialQueue = new DialQueue(components, {\n addressSorter: init.addressSorter ?? defaultAddressSort,\n maxParallelDials: init.maxParallelDials ?? MAX_PARALLEL_DIALS,\n maxDialQueueLength: init.maxDialQueueLength ?? MAX_DIAL_QUEUE_LENGTH,\n maxPeerAddrsToDial: init.maxPeerAddrsToDial ?? MAX_PEER_ADDRS_TO_DIAL,\n dialTimeout: init.dialTimeout ?? DIAL_TIMEOUT,\n resolvers: init.resolvers ?? {\n dnsaddr: dnsaddrResolver\n },\n connections: this.connections\n });\n }\n [Symbol.toStringTag] = '@libp2p/connection-manager';\n isStarted() {\n return this.started;\n }\n /**\n * Starts the Connection Manager. If Metrics are not enabled on libp2p\n * only event loop and connection limits will be monitored.\n */\n async start() {\n // track inbound/outbound connections\n this.metrics?.registerMetricGroup('libp2p_connection_manager_connections', {\n calculate: () => {\n const metric = {\n inbound: 0,\n outbound: 0\n };\n for (const conns of this.connections.values()) {\n for (const conn of conns) {\n if (conn.direction === 'inbound') {\n metric.inbound++;\n }\n else {\n metric.outbound++;\n }\n }\n }\n return metric;\n }\n });\n // track total number of streams per protocol\n this.metrics?.registerMetricGroup('libp2p_protocol_streams_total', {\n label: 'protocol',\n calculate: () => {\n const metric = {};\n for (const conns of this.connections.values()) {\n for (const conn of conns) {\n for (const stream of conn.streams) {\n const key = `${stream.direction} ${stream.protocol ?? 'unnegotiated'}`;\n metric[key] = (metric[key] ?? 0) + 1;\n }\n }\n }\n return metric;\n }\n });\n // track 90th percentile of streams per protocol\n this.metrics?.registerMetricGroup('libp2p_connection_manager_protocol_streams_per_connection_90th_percentile', {\n label: 'protocol',\n calculate: () => {\n const allStreams = {};\n for (const conns of this.connections.values()) {\n for (const conn of conns) {\n const streams = {};\n for (const stream of conn.streams) {\n const key = `${stream.direction} ${stream.protocol ?? 'unnegotiated'}`;\n streams[key] = (streams[key] ?? 0) + 1;\n }\n for (const [protocol, count] of Object.entries(streams)) {\n allStreams[protocol] = allStreams[protocol] ?? [];\n allStreams[protocol].push(count);\n }\n }\n }\n const metric = {};\n for (let [protocol, counts] of Object.entries(allStreams)) {\n counts = counts.sort((a, b) => a - b);\n const index = Math.floor(counts.length * 0.9);\n metric[protocol] = counts[index];\n }\n return metric;\n }\n });\n this.dialQueue.start();\n this.autoDial.start();\n this.started = true;\n this.log('started');\n }\n async afterStart() {\n // re-connect to any peers with the KEEP_ALIVE tag\n void Promise.resolve()\n .then(async () => {\n const keepAlivePeers = await this.peerStore.all({\n filters: [(peer) => {\n return peer.tags.has(KEEP_ALIVE);\n }]\n });\n await Promise.all(keepAlivePeers.map(async (peer) => {\n await this.openConnection(peer.id)\n .catch(err => {\n this.log.error(err);\n });\n }));\n })\n .catch(err => {\n this.log.error(err);\n });\n this.autoDial.afterStart();\n }\n /**\n * Stops the Connection Manager\n */\n async stop() {\n this.dialQueue.stop();\n this.autoDial.stop();\n // Close all connections we're tracking\n const tasks = [];\n for (const connectionList of this.connections.values()) {\n for (const connection of connectionList) {\n tasks.push((async () => {\n try {\n await connection.close();\n }\n catch (err) {\n this.log.error(err);\n }\n })());\n }\n }\n this.log('closing %d connections', tasks.length);\n await Promise.all(tasks);\n this.connections.clear();\n this.log('stopped');\n }\n onConnect(evt) {\n void this._onConnect(evt).catch(err => {\n this.log.error(err);\n });\n }\n /**\n * Tracks the incoming connection and check the connection limit\n */\n async _onConnect(evt) {\n const { detail: connection } = evt;\n if (!this.started) {\n // This can happen when we are in the process of shutting down the node\n await connection.close();\n return;\n }\n const peerId = connection.remotePeer;\n const storedConns = this.connections.get(peerId);\n let isNewPeer = false;\n if (storedConns != null) {\n storedConns.push(connection);\n }\n else {\n isNewPeer = true;\n this.connections.set(peerId, [connection]);\n }\n // only need to store RSA public keys, all other types are embedded in the peer id\n if (peerId.publicKey != null && peerId.type === 'RSA') {\n await this.peerStore.patch(peerId, {\n publicKey: peerId.publicKey\n });\n }\n if (isNewPeer) {\n this.events.safeDispatchEvent('peer:connect', { detail: connection.remotePeer });\n }\n }\n /**\n * Removes the connection from tracking\n */\n onDisconnect(evt) {\n const { detail: connection } = evt;\n if (!this.started) {\n // This can happen when we are in the process of shutting down the node\n return;\n }\n const peerId = connection.remotePeer;\n let storedConn = this.connections.get(peerId);\n if (storedConn != null && storedConn.length > 1) {\n storedConn = storedConn.filter((conn) => conn.id !== connection.id);\n this.connections.set(peerId, storedConn);\n }\n else if (storedConn != null) {\n this.connections.delete(peerId);\n this.events.safeDispatchEvent('peer:disconnect', { detail: connection.remotePeer });\n }\n }\n getConnections(peerId) {\n if (peerId != null) {\n return this.connections.get(peerId) ?? [];\n }\n let conns = [];\n for (const c of this.connections.values()) {\n conns = conns.concat(c);\n }\n return conns;\n }\n getConnectionsMap() {\n return this.connections;\n }\n async openConnection(peerIdOrMultiaddr, options = {}) {\n if (!this.isStarted()) {\n throw new CodeError('Not started', codes.ERR_NODE_NOT_STARTED);\n }\n options.signal?.throwIfAborted();\n const { peerId } = getPeerAddress(peerIdOrMultiaddr);\n if (peerId != null && options.force !== true) {\n this.log('dial %p', peerId);\n const existingConnection = this.getConnections(peerId)\n .find(conn => !conn.transient);\n if (existingConnection != null) {\n this.log('had an existing non-transient connection to %p', peerId);\n options.onProgress?.(new CustomProgressEvent('dial-queue:already-connected'));\n return existingConnection;\n }\n }\n const connection = await this.dialQueue.dial(peerIdOrMultiaddr, {\n ...options,\n priority: options.priority ?? DEFAULT_DIAL_PRIORITY\n });\n let peerConnections = this.connections.get(connection.remotePeer);\n if (peerConnections == null) {\n peerConnections = [];\n this.connections.set(connection.remotePeer, peerConnections);\n }\n // we get notified of connections via the Upgrader emitting \"connection\"\n // events, double check we aren't already tracking this connection before\n // storing it\n let trackedConnection = false;\n for (const conn of peerConnections) {\n if (conn.id === connection.id) {\n trackedConnection = true;\n }\n }\n if (!trackedConnection) {\n peerConnections.push(connection);\n }\n return connection;\n }\n async closeConnections(peerId, options = {}) {\n const connections = this.connections.get(peerId) ?? [];\n await Promise.all(connections.map(async (connection) => {\n try {\n await connection.close(options);\n }\n catch (err) {\n connection.abort(err);\n }\n }));\n }\n async acceptIncomingConnection(maConn) {\n // check deny list\n const denyConnection = this.deny.some(ma => {\n return maConn.remoteAddr.toString().startsWith(ma.toString());\n });\n if (denyConnection) {\n this.log('connection from %a refused - connection remote address was in deny list', maConn.remoteAddr);\n return false;\n }\n // check allow list\n const allowConnection = this.allow.some(ma => {\n return maConn.remoteAddr.toString().startsWith(ma.toString());\n });\n if (allowConnection) {\n this.incomingPendingConnections++;\n return true;\n }\n // check pending connections\n if (this.incomingPendingConnections === this.maxIncomingPendingConnections) {\n this.log('connection from %a refused - incomingPendingConnections exceeded by host', maConn.remoteAddr);\n return false;\n }\n if (maConn.remoteAddr.isThinWaistAddress()) {\n const host = maConn.remoteAddr.nodeAddress().address;\n try {\n await this.inboundConnectionRateLimiter.consume(host, 1);\n }\n catch {\n this.log('connection from %a refused - inboundConnectionThreshold exceeded by host %s', maConn.remoteAddr, host);\n return false;\n }\n }\n if (this.getConnections().length < this.maxConnections) {\n this.incomingPendingConnections++;\n return true;\n }\n this.log('connection from %a refused - maxConnections exceeded', maConn.remoteAddr);\n return false;\n }\n afterUpgradeInbound() {\n this.incomingPendingConnections--;\n }\n getDialQueue() {\n const statusMap = {\n queued: 'queued',\n running: 'active',\n errored: 'error',\n complete: 'success'\n };\n return this.dialQueue.queue.queue.map(job => {\n return {\n id: job.id,\n status: statusMap[job.status],\n peerId: job.options.peerId,\n multiaddrs: [...job.options.multiaddrs].map(ma => multiaddr(ma))\n };\n });\n }\n async isDialable(multiaddr, options = {}) {\n return this.dialQueue.isDialable(multiaddr, options);\n }\n}\n//# sourceMappingURL=index.js.map","export const KEEP_ALIVE = 'keep-alive';\n//# sourceMappingURL=tags.js.map","/**\n * Implements exponential moving average. Ported from `moving-average`.\n *\n * @see https://en.wikipedia.org/wiki/Moving_average#Exponential_moving_average\n * @see https://www.npmjs.com/package/moving-average\n */\nexport class MovingAverage {\n movingAverage;\n variance;\n deviation;\n forecast;\n timespan;\n previousTime;\n constructor(timespan) {\n this.timespan = timespan;\n this.movingAverage = 0;\n this.variance = 0;\n this.deviation = 0;\n this.forecast = 0;\n }\n alpha(t, pt) {\n return 1 - (Math.exp(-(t - pt) / this.timespan));\n }\n push(value, time = Date.now()) {\n if (this.previousTime != null) {\n // calculate moving average\n const a = this.alpha(time, this.previousTime);\n const diff = value - this.movingAverage;\n const incr = a * diff;\n this.movingAverage = a * value + (1 - a) * this.movingAverage;\n // calculate variance & deviation\n this.variance = (1 - a) * (this.variance + diff * incr);\n this.deviation = Math.sqrt(this.variance);\n // calculate forecast\n this.forecast = this.movingAverage + a * diff;\n }\n else {\n this.movingAverage = value;\n }\n this.previousTime = time;\n }\n}\n//# sourceMappingURL=moving-average.js.map","import { setMaxListeners } from '@libp2p/interface';\nimport { anySignal } from 'any-signal';\nimport { MovingAverage } from './moving-average.js';\nexport const DEFAULT_TIMEOUT_MULTIPLIER = 1.2;\nexport const DEFAULT_FAILURE_MULTIPLIER = 2;\nexport const DEFAULT_MIN_TIMEOUT = 2000;\nexport class AdaptiveTimeout {\n success;\n failure;\n next;\n metric;\n timeoutMultiplier;\n failureMultiplier;\n minTimeout;\n constructor(init = {}) {\n this.success = new MovingAverage(init.interval ?? 5000);\n this.failure = new MovingAverage(init.interval ?? 5000);\n this.next = new MovingAverage(init.interval ?? 5000);\n this.failureMultiplier = init.failureMultiplier ?? DEFAULT_FAILURE_MULTIPLIER;\n this.timeoutMultiplier = init.timeoutMultiplier ?? DEFAULT_TIMEOUT_MULTIPLIER;\n this.minTimeout = init.minTimeout ?? DEFAULT_MIN_TIMEOUT;\n if (init.metricName != null) {\n this.metric = init.metrics?.registerMetricGroup(init.metricName);\n }\n }\n getTimeoutSignal(options = {}) {\n // calculate timeout for individual peers based on moving average of\n // previous successful requests\n const timeout = Math.max(Math.round(this.next.movingAverage * (options.timeoutFactor ?? this.timeoutMultiplier)), this.minTimeout);\n const sendTimeout = AbortSignal.timeout(timeout);\n const timeoutSignal = anySignal([options.signal, sendTimeout]);\n setMaxListeners(Infinity, timeoutSignal, sendTimeout);\n timeoutSignal.start = Date.now();\n timeoutSignal.timeout = timeout;\n return timeoutSignal;\n }\n cleanUp(signal) {\n const time = Date.now() - signal.start;\n if (signal.aborted) {\n this.failure.push(time);\n this.next.push(time * this.failureMultiplier);\n this.metric?.update({\n failureMovingAverage: this.failure.movingAverage,\n failureDeviation: this.failure.deviation,\n failureForecast: this.failure.forecast,\n failureVariance: this.failure.variance,\n failure: time\n });\n }\n else {\n this.success.push(time);\n this.next.push(time);\n this.metric?.update({\n successMovingAverage: this.success.movingAverage,\n successDeviation: this.success.deviation,\n successForecast: this.success.forecast,\n successVariance: this.success.variance,\n success: time\n });\n }\n }\n}\n//# sourceMappingURL=adaptive-timeout.js.map","import { randomBytes } from '@libp2p/crypto';\nimport { serviceCapabilities } from '@libp2p/interface';\nimport { AdaptiveTimeout } from '@libp2p/utils/adaptive-timeout';\nimport { byteStream } from 'it-byte-stream';\nconst DEFAULT_PING_INTERVAL_MS = 10000;\nconst PROTOCOL_VERSION = '1.0.0';\nconst PROTOCOL_NAME = 'ping';\nconst PROTOCOL_PREFIX = 'ipfs';\nconst PING_LENGTH = 32;\nexport class ConnectionMonitor {\n protocol;\n components;\n log;\n heartbeatInterval;\n pingIntervalMs;\n abortController;\n timeout;\n constructor(components, init = {}) {\n this.components = components;\n this.protocol = `/${init.protocolPrefix ?? PROTOCOL_PREFIX}/${PROTOCOL_NAME}/${PROTOCOL_VERSION}`;\n this.log = components.logger.forComponent('libp2p:connection-monitor');\n this.pingIntervalMs = init.pingInterval ?? DEFAULT_PING_INTERVAL_MS;\n this.timeout = new AdaptiveTimeout({\n ...(init.pingTimeout ?? {}),\n metrics: components.metrics,\n metricName: 'libp2p_connection_monitor_ping_time_milliseconds'\n });\n }\n [Symbol.toStringTag] = '@libp2p/connection-monitor';\n [serviceCapabilities] = [\n '@libp2p/connection-monitor'\n ];\n start() {\n this.abortController = new AbortController();\n this.heartbeatInterval = setInterval(() => {\n this.components.connectionManager.getConnections().forEach(conn => {\n Promise.resolve().then(async () => {\n let start = Date.now();\n try {\n const signal = this.timeout.getTimeoutSignal({\n signal: this.abortController?.signal\n });\n const stream = await conn.newStream(this.protocol, {\n signal,\n runOnTransientConnection: true\n });\n const bs = byteStream(stream);\n start = Date.now();\n await Promise.all([\n bs.write(randomBytes(PING_LENGTH), {\n signal\n }),\n bs.read(PING_LENGTH, {\n signal\n })\n ]);\n conn.rtt = Date.now() - start;\n await bs.unwrap().close({\n signal\n });\n }\n catch (err) {\n if (err.code !== 'ERR_UNSUPPORTED_PROTOCOL') {\n throw err;\n }\n // protocol was unsupported, but that's ok as it means the remote\n // peer was still alive. We ran multistream-select which means two\n // round trips (e.g. 1x for the mss header, then another for the\n // protocol) so divide the time it took by two\n conn.rtt = (Date.now() - start) / 2;\n }\n })\n .catch(err => {\n this.log.error('error during heartbeat, aborting connection', err);\n conn.abort(err);\n });\n });\n }, this.pingIntervalMs);\n }\n stop() {\n this.abortController?.abort();\n if (this.heartbeatInterval != null) {\n clearInterval(this.heartbeatInterval);\n }\n }\n}\n//# sourceMappingURL=connection-monitor.js.map","import { CodeError } from '@libp2p/interface';\nimport { PeerSet } from '@libp2p/peer-collections';\nimport merge from 'it-merge';\nimport { codes, messages } from './errors.js';\nexport class CompoundContentRouting {\n routers;\n started;\n components;\n constructor(components, init) {\n this.routers = init.routers ?? [];\n this.started = false;\n this.components = components;\n }\n [Symbol.toStringTag] = '@libp2p/content-routing';\n isStarted() {\n return this.started;\n }\n async start() {\n this.started = true;\n }\n async stop() {\n this.started = false;\n }\n /**\n * Iterates over all content routers in parallel to find providers of the given key\n */\n async *findProviders(key, options = {}) {\n if (this.routers.length === 0) {\n throw new CodeError('No content routers available', codes.ERR_NO_ROUTERS_AVAILABLE);\n }\n const self = this;\n const seen = new PeerSet();\n for await (const peer of merge(...self.routers.map(router => router.findProviders(key, options)))) {\n // the peer was yielded by a content router without multiaddrs and we\n // failed to load them\n if (peer == null) {\n continue;\n }\n // store the addresses for the peer if found\n if (peer.multiaddrs.length > 0) {\n await this.components.peerStore.merge(peer.id, {\n multiaddrs: peer.multiaddrs\n });\n }\n // deduplicate peers\n if (seen.has(peer.id)) {\n continue;\n }\n seen.add(peer.id);\n yield peer;\n }\n }\n /**\n * Iterates over all content routers in parallel to notify it is\n * a provider of the given key\n */\n async provide(key, options = {}) {\n if (this.routers.length === 0) {\n throw new CodeError('No content routers available', codes.ERR_NO_ROUTERS_AVAILABLE);\n }\n await Promise.all(this.routers.map(async (router) => {\n await router.provide(key, options);\n }));\n }\n /**\n * Store the given key/value pair in the available content routings\n */\n async put(key, value, options) {\n if (!this.isStarted()) {\n throw new CodeError(messages.NOT_STARTED_YET, codes.ERR_NODE_NOT_STARTED);\n }\n await Promise.all(this.routers.map(async (router) => {\n await router.put(key, value, options);\n }));\n }\n /**\n * Get the value to the given key.\n * Times out after 1 minute by default.\n */\n async get(key, options) {\n if (!this.isStarted()) {\n throw new CodeError(messages.NOT_STARTED_YET, codes.ERR_NODE_NOT_STARTED);\n }\n return Promise.any(this.routers.map(async (router) => {\n return router.get(key, options);\n }));\n }\n}\n//# sourceMappingURL=content-routing.js.map","import { alloc as uint8ArrayAlloc } from 'uint8arrays/alloc';\nimport { equals as uint8ArrayEquals } from 'uint8arrays/equals';\nexport const MAX_FINGERPRINT_SIZE = 64;\nexport class Fingerprint {\n fp;\n h;\n seed;\n constructor(buf, hash, seed, fingerprintSize = 2) {\n if (fingerprintSize > MAX_FINGERPRINT_SIZE) {\n throw new TypeError('Invalid Fingerprint Size');\n }\n const fnv = hash.hashV(buf, seed);\n const fp = uint8ArrayAlloc(fingerprintSize);\n for (let i = 0; i < fp.length; i++) {\n fp[i] = fnv[i];\n }\n if (fp.length === 0) {\n fp[0] = 7;\n }\n this.fp = fp;\n this.h = hash;\n this.seed = seed;\n }\n hash() {\n return this.h.hash(this.fp, this.seed);\n }\n equals(other) {\n if (!(other?.fp instanceof Uint8Array)) {\n return false;\n }\n return uint8ArrayEquals(this.fp, other.fp);\n }\n}\n//# sourceMappingURL=fingerprint.js.map","export function getRandomInt(min, max) {\n return Math.floor(Math.random() * (max - min)) + min;\n}\n//# sourceMappingURL=utils.js.map","import { Fingerprint } from './fingerprint.js';\nimport { getRandomInt } from './utils.js';\nexport class Bucket {\n contents;\n constructor(size) {\n this.contents = new Array(size).fill(null);\n }\n has(fingerprint) {\n if (!(fingerprint instanceof Fingerprint)) {\n throw new TypeError('Invalid Fingerprint');\n }\n return this.contents.some((fp) => {\n return fingerprint.equals(fp);\n });\n }\n add(fingerprint) {\n if (!(fingerprint instanceof Fingerprint)) {\n throw new TypeError('Invalid Fingerprint');\n }\n for (let i = 0; i < this.contents.length; i++) {\n if (this.contents[i] == null) {\n this.contents[i] = fingerprint;\n return true;\n }\n }\n return true;\n }\n swap(fingerprint) {\n if (!(fingerprint instanceof Fingerprint)) {\n throw new TypeError('Invalid Fingerprint');\n }\n const i = getRandomInt(0, this.contents.length - 1);\n const current = this.contents[i];\n this.contents[i] = fingerprint;\n return current;\n }\n remove(fingerprint) {\n if (!(fingerprint instanceof Fingerprint)) {\n throw new TypeError('Invalid Fingerprint');\n }\n const found = this.contents.findIndex((fp) => {\n return fingerprint.equals(fp);\n });\n if (found > -1) {\n this.contents[found] = null;\n return true;\n }\n else {\n return false;\n }\n }\n}\n//# sourceMappingURL=bucket.js.map","// FNV_PRIMES and FNV_OFFSETS from\n// http://www.isthe.com/chongo/tech/comp/fnv/index.html#FNV-param\n\nconst FNV_PRIMES = {\n\t32: 16_777_619n,\n\t64: 1_099_511_628_211n,\n\t128: 309_485_009_821_345_068_724_781_371n,\n\t256: 374_144_419_156_711_147_060_143_317_175_368_453_031_918_731_002_211n,\n\t512: 35_835_915_874_844_867_368_919_076_489_095_108_449_946_327_955_754_392_558_399_825_615_420_669_938_882_575_126_094_039_892_345_713_852_759n,\n\t1024: 5_016_456_510_113_118_655_434_598_811_035_278_955_030_765_345_404_790_744_303_017_523_831_112_055_108_147_451_509_157_692_220_295_382_716_162_651_878_526_895_249_385_292_291_816_524_375_083_746_691_371_804_094_271_873_160_484_737_966_720_260_389_217_684_476_157_468_082_573n,\n};\n\nconst FNV_OFFSETS = {\n\t32: 2_166_136_261n,\n\t64: 14_695_981_039_346_656_037n,\n\t128: 144_066_263_297_769_815_596_495_629_667_062_367_629n,\n\t256: 100_029_257_958_052_580_907_070_968_620_625_704_837_092_796_014_241_193_945_225_284_501_741_471_925_557n,\n\t512: 9_659_303_129_496_669_498_009_435_400_716_310_466_090_418_745_672_637_896_108_374_329_434_462_657_994_582_932_197_716_438_449_813_051_892_206_539_805_784_495_328_239_340_083_876_191_928_701_583_869_517_785n,\n\t1024: 14_197_795_064_947_621_068_722_070_641_403_218_320_880_622_795_441_933_960_878_474_914_617_582_723_252_296_732_303_717_722_150_864_096_521_202_355_549_365_628_174_669_108_571_814_760_471_015_076_148_029_755_969_804_077_320_157_692_458_563_003_215_304_957_150_157_403_644_460_363_550_505_412_711_285_966_361_610_267_868_082_893_823_963_790_439_336_411_086_884_584_107_735_010_676_915n,\n};\n\nconst cachedEncoder = new globalThis.TextEncoder();\n\nfunction fnv1aUint8Array(uint8Array, size) {\n\tconst fnvPrime = FNV_PRIMES[size];\n\tlet hash = FNV_OFFSETS[size];\n\n\t// eslint-disable-next-line unicorn/no-for-loop -- This is a performance-sensitive loop\n\tfor (let index = 0; index < uint8Array.length; index++) {\n\t\thash ^= BigInt(uint8Array[index]);\n\t\thash = BigInt.asUintN(size, hash * fnvPrime);\n\t}\n\n\treturn hash;\n}\n\nfunction fnv1aEncodeInto(string, size, utf8Buffer) {\n\tif (utf8Buffer.length === 0) {\n\t\tthrow new Error('The `utf8Buffer` option must have a length greater than zero');\n\t}\n\n\tconst fnvPrime = FNV_PRIMES[size];\n\tlet hash = FNV_OFFSETS[size];\n\tlet remaining = string;\n\n\twhile (remaining.length > 0) {\n\t\tconst result = cachedEncoder.encodeInto(remaining, utf8Buffer);\n\t\tremaining = remaining.slice(result.read);\n\t\tfor (let index = 0; index < result.written; index++) {\n\t\t\thash ^= BigInt(utf8Buffer[index]);\n\t\t\thash = BigInt.asUintN(size, hash * fnvPrime);\n\t\t}\n\t}\n\n\treturn hash;\n}\n\nexport default function fnv1a(value, {size = 32, utf8Buffer} = {}) {\n\tif (!FNV_PRIMES[size]) {\n\t\tthrow new Error('The `size` option must be one of 32, 64, 128, 256, 512, or 1024');\n\t}\n\n\tif (typeof value === 'string') {\n\t\tif (utf8Buffer) {\n\t\t\treturn fnv1aEncodeInto(value, size, utf8Buffer);\n\t\t}\n\n\t\tvalue = cachedEncoder.encode(value);\n\t}\n\n\treturn fnv1aUint8Array(value, size);\n}\n","import fnv1aHash from '@sindresorhus/fnv1a';\nimport mur from 'murmurhash3js-revisited';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nexport const murmur3 = {\n hash: (input, seed) => {\n return mur.x86.hash32(input, seed);\n },\n hashV: (input, seed) => {\n return numberToBuffer(murmur3.hash(input, seed));\n }\n};\nexport const fnv1a = {\n hash: (input) => {\n return Number(fnv1aHash(input, {\n size: 32\n }));\n },\n hashV: (input, seed) => {\n return numberToBuffer(fnv1a.hash(input, seed));\n }\n};\nexport function numberToBuffer(num) {\n let hex = num.toString(16);\n if (hex.length % 2 === 1) {\n hex = `0${hex}`;\n }\n return uint8ArrayFromString(hex, 'base16');\n}\n//# sourceMappingURL=hashes.js.map","import { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport { Bucket } from './bucket.js';\nimport { Fingerprint, MAX_FINGERPRINT_SIZE } from './fingerprint.js';\nimport { fnv1a } from './hashes.js';\nimport { getRandomInt } from './utils.js';\nconst maxCuckooCount = 500;\nexport class CuckooFilter {\n bucketSize;\n filterSize;\n fingerprintSize;\n buckets;\n count;\n hash;\n seed;\n constructor(init) {\n this.filterSize = init.filterSize;\n this.bucketSize = init.bucketSize ?? 4;\n this.fingerprintSize = init.fingerprintSize ?? 2;\n this.count = 0;\n this.buckets = [];\n this.hash = init.hash ?? fnv1a;\n this.seed = init.seed ?? getRandomInt(0, Math.pow(2, 10));\n }\n add(item) {\n if (typeof item === 'string') {\n item = uint8ArrayFromString(item);\n }\n const fingerprint = new Fingerprint(item, this.hash, this.seed, this.fingerprintSize);\n const j = this.hash.hash(item, this.seed) % this.filterSize;\n const k = (j ^ fingerprint.hash()) % this.filterSize;\n if (this.buckets[j] == null) {\n this.buckets[j] = new Bucket(this.bucketSize);\n }\n if (this.buckets[k] == null) {\n this.buckets[k] = new Bucket(this.bucketSize);\n }\n if (this.buckets[j].add(fingerprint) || this.buckets[k].add(fingerprint)) {\n this.count++;\n return true;\n }\n const rand = [j, k];\n let i = rand[getRandomInt(0, rand.length - 1)];\n if (this.buckets[i] == null) {\n this.buckets[i] = new Bucket(this.bucketSize);\n }\n for (let n = 0; n < maxCuckooCount; n++) {\n const swapped = this.buckets[i].swap(fingerprint);\n if (swapped == null) {\n continue;\n }\n i = (i ^ swapped.hash()) % this.filterSize;\n if (this.buckets[i] == null) {\n this.buckets[i] = new Bucket(this.bucketSize);\n }\n if (this.buckets[i].add(swapped)) {\n this.count++;\n return true;\n }\n else {\n continue;\n }\n }\n return false;\n }\n has(item) {\n if (typeof item === 'string') {\n item = uint8ArrayFromString(item);\n }\n const fingerprint = new Fingerprint(item, this.hash, this.seed, this.fingerprintSize);\n const j = this.hash.hash(item, this.seed) % this.filterSize;\n const inJ = this.buckets[j]?.has(fingerprint) ?? false;\n if (inJ) {\n return inJ;\n }\n const k = (j ^ fingerprint.hash()) % this.filterSize;\n return this.buckets[k]?.has(fingerprint) ?? false;\n }\n remove(item) {\n if (typeof item === 'string') {\n item = uint8ArrayFromString(item);\n }\n const fingerprint = new Fingerprint(item, this.hash, this.seed, this.fingerprintSize);\n const j = this.hash.hash(item, this.seed) % this.filterSize;\n const inJ = this.buckets[j]?.remove(fingerprint) ?? false;\n if (inJ) {\n this.count--;\n return inJ;\n }\n const k = (j ^ fingerprint.hash()) % this.filterSize;\n const inK = this.buckets[k]?.remove(fingerprint) ?? false;\n if (inK) {\n this.count--;\n }\n return inK;\n }\n get reliable() {\n return Math.floor(100 * (this.count / this.filterSize)) <= 90;\n }\n}\n// max load constants, defined in the cuckoo paper\nconst MAX_LOAD = {\n 1: 0.5,\n 2: 0.84,\n 4: 0.95,\n 8: 0.98\n};\nfunction calculateBucketSize(errorRate = 0.001) {\n if (errorRate > 0.002) {\n return 2;\n }\n if (errorRate > 0.00001) {\n return 4;\n }\n return 8;\n}\nexport function optimize(maxItems, errorRate = 0.001) {\n // https://www.eecs.harvard.edu/~michaelm/postscripts/cuckoo-conext2014.pdf\n // Section 5.1 Optimal Bucket Size\n const bucketSize = calculateBucketSize(errorRate);\n const load = MAX_LOAD[bucketSize];\n // https://stackoverflow.com/questions/57555236/how-to-size-a-cuckoo-filter/57617208#57617208\n const filterSize = Math.round(maxItems / load);\n const fingerprintSize = Math.min(Math.ceil(Math.log2(1 / errorRate) + Math.log2(2 * bucketSize)), MAX_FINGERPRINT_SIZE);\n return {\n filterSize,\n bucketSize,\n fingerprintSize\n };\n}\nexport function createCuckooFilter(maxItems, errorRate = 0.005) {\n const opts = optimize(maxItems, errorRate);\n return new CuckooFilter(opts);\n}\n//# sourceMappingURL=cuckoo-filter.js.map","import { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport { CuckooFilter, optimize } from './cuckoo-filter.js';\nimport { fnv1a } from './hashes.js';\nimport { getRandomInt } from './utils.js';\nexport class ScalableCuckooFilter {\n filterSize;\n bucketSize;\n fingerprintSize;\n scale;\n filterSeries;\n hash;\n seed;\n constructor(init) {\n this.bucketSize = init.bucketSize ?? 4;\n this.filterSize = init.filterSize ?? (1 << 18) / this.bucketSize;\n this.fingerprintSize = init.fingerprintSize ?? 2;\n this.scale = init.scale ?? 2;\n this.hash = init.hash ?? fnv1a;\n this.seed = init.seed ?? getRandomInt(0, Math.pow(2, 10));\n this.filterSeries = [\n new CuckooFilter({\n filterSize: this.filterSize,\n bucketSize: this.bucketSize,\n fingerprintSize: this.fingerprintSize,\n hash: this.hash,\n seed: this.seed\n })\n ];\n }\n add(item) {\n if (typeof item === 'string') {\n item = uint8ArrayFromString(item);\n }\n if (this.has(item)) {\n return true;\n }\n let current = this.filterSeries.find((cuckoo) => {\n return cuckoo.reliable;\n });\n if (current == null) {\n const curSize = this.filterSize * Math.pow(this.scale, this.filterSeries.length);\n current = new CuckooFilter({\n filterSize: curSize,\n bucketSize: this.bucketSize,\n fingerprintSize: this.fingerprintSize,\n hash: this.hash,\n seed: this.seed\n });\n this.filterSeries.push(current);\n }\n return current.add(item);\n }\n has(item) {\n if (typeof item === 'string') {\n item = uint8ArrayFromString(item);\n }\n for (let i = 0; i < this.filterSeries.length; i++) {\n if (this.filterSeries[i].has(item)) {\n return true;\n }\n }\n return false;\n }\n remove(item) {\n if (typeof item === 'string') {\n item = uint8ArrayFromString(item);\n }\n for (let i = 0; i < this.filterSeries.length; i++) {\n if (this.filterSeries[i].remove(item)) {\n return true;\n }\n }\n return false;\n }\n get count() {\n return this.filterSeries.reduce((acc, curr) => {\n return acc + curr.count;\n }, 0);\n }\n}\nexport function createScalableCuckooFilter(maxItems, errorRate = 0.001, options) {\n return new ScalableCuckooFilter({\n ...optimize(maxItems, errorRate),\n ...(options ?? {})\n });\n}\n//# sourceMappingURL=scalable-cuckoo-filter.js.map","/**\n * @packageDocumentation\n *\n * Takes an (async) iterable that emits promise-returning functions, invokes them in parallel up to the concurrency limit and emits the results as they become available, optionally in the same order as the input\n *\n * @example\n *\n * ```javascript\n * import parallel from 'it-parallel'\n * import all from 'it-all'\n * import delay from 'delay'\n *\n * // This can also be an iterator, async iterator, generator, etc\n * const input = [\n * async () => {\n * console.info('start 1')\n * await delay(500)\n *\n * console.info('end 1')\n * return 1\n * },\n * async () => {\n * console.info('start 2')\n * await delay(200)\n *\n * console.info('end 2')\n * return 2\n * },\n * async () => {\n * console.info('start 3')\n * await delay(100)\n *\n * console.info('end 3')\n * return 3\n * }\n * ]\n *\n * const result = await all(parallel(input, {\n * concurrency: 2\n * }))\n *\n * // output:\n * // start 1\n * // start 2\n * // end 2\n * // start 3\n * // end 3\n * // end 1\n *\n * console.info(result) // [2, 3, 1]\n * ```\n *\n * If order is important, pass `ordered: true` as an option:\n *\n * ```javascript\n * const result = await all(parallel(input, {\n * concurrency: 2,\n * ordered: true\n * }))\n *\n * // output:\n * // start 1\n * // start 2\n * // end 2\n * // start 3\n * // end 3\n * // end 1\n *\n * console.info(result) // [1, 2, 3]\n * ```\n */\nimport defer from 'p-defer';\nconst CustomEvent = globalThis.CustomEvent ?? Event;\n/**\n * Takes an (async) iterator that emits promise-returning functions,\n * invokes them in parallel and emits the results as they become available but\n * in the same order as the input\n */\nexport default async function* parallel(source, options = {}) {\n let concurrency = options.concurrency ?? Infinity;\n if (concurrency < 1) {\n concurrency = Infinity;\n }\n const ordered = options.ordered == null ? false : options.ordered;\n const emitter = new EventTarget();\n const ops = [];\n let slotAvailable = defer();\n let resultAvailable = defer();\n let sourceFinished = false;\n let sourceErr;\n let opErred = false;\n emitter.addEventListener('task-complete', () => {\n resultAvailable.resolve();\n });\n void Promise.resolve().then(async () => {\n try {\n for await (const task of source) {\n if (ops.length === concurrency) {\n slotAvailable = defer();\n await slotAvailable.promise;\n }\n if (opErred) {\n break;\n }\n const op = {\n done: false\n };\n ops.push(op);\n task()\n .then(result => {\n op.done = true;\n op.ok = true;\n op.value = result;\n emitter.dispatchEvent(new CustomEvent('task-complete'));\n }, err => {\n op.done = true;\n op.err = err;\n emitter.dispatchEvent(new CustomEvent('task-complete'));\n });\n }\n sourceFinished = true;\n emitter.dispatchEvent(new CustomEvent('task-complete'));\n }\n catch (err) {\n sourceErr = err;\n emitter.dispatchEvent(new CustomEvent('task-complete'));\n }\n });\n function valuesAvailable() {\n if (ordered) {\n return ops[0]?.done;\n }\n return Boolean(ops.find(op => op.done));\n }\n function* yieldOrderedValues() {\n while ((ops.length > 0) && ops[0].done) {\n const op = ops[0];\n ops.shift();\n if (op.ok) {\n yield op.value;\n }\n else {\n // allow the source to exit\n opErred = true;\n slotAvailable.resolve();\n throw op.err;\n }\n slotAvailable.resolve();\n }\n }\n function* yieldUnOrderedValues() {\n // more values can become available while we wait for `yield`\n // to return control to this function\n while (valuesAvailable()) {\n for (let i = 0; i < ops.length; i++) {\n if (ops[i].done) {\n const op = ops[i];\n ops.splice(i, 1);\n i--;\n if (op.ok) {\n yield op.value;\n }\n else {\n opErred = true;\n slotAvailable.resolve();\n throw op.err;\n }\n slotAvailable.resolve();\n }\n }\n }\n }\n while (true) {\n if (!valuesAvailable()) {\n resultAvailable = defer();\n await resultAvailable.promise;\n }\n if (sourceErr != null) {\n // the source threw an error, propagate it\n throw sourceErr;\n }\n if (ordered) {\n yield* yieldOrderedValues();\n }\n else {\n yield* yieldUnOrderedValues();\n }\n if (sourceFinished && ops.length === 0) {\n // not waiting for any results and no more tasks so we are done\n break;\n }\n }\n}\n//# sourceMappingURL=index.js.map","import { CodeError } from '@libp2p/interface';\nimport { createScalableCuckooFilter } from '@libp2p/utils/filters';\nimport merge from 'it-merge';\nimport parallel from 'it-parallel';\nimport { codes, messages } from './errors.js';\nexport class DefaultPeerRouting {\n log;\n peerId;\n peerStore;\n routers;\n constructor(components, init = {}) {\n this.log = components.logger.forComponent('libp2p:peer-routing');\n this.peerId = components.peerId;\n this.peerStore = components.peerStore;\n this.routers = init.routers ?? [];\n }\n [Symbol.toStringTag] = '@libp2p/peer-routing';\n /**\n * Iterates over all peer routers in parallel to find the given peer\n */\n async findPeer(id, options) {\n if (this.routers.length === 0) {\n throw new CodeError('No peer routers available', codes.ERR_NO_ROUTERS_AVAILABLE);\n }\n if (id.toString() === this.peerId.toString()) {\n throw new CodeError('Should not try to find self', codes.ERR_FIND_SELF);\n }\n const self = this;\n const source = merge(...this.routers.map(router => (async function* () {\n try {\n yield await router.findPeer(id, options);\n }\n catch (err) {\n self.log.error(err);\n }\n })()));\n for await (const peer of source) {\n if (peer == null) {\n continue;\n }\n // store the addresses for the peer if found\n if (peer.multiaddrs.length > 0) {\n await this.peerStore.merge(peer.id, {\n multiaddrs: peer.multiaddrs\n });\n }\n return peer;\n }\n throw new CodeError(messages.NOT_FOUND, codes.ERR_NOT_FOUND);\n }\n /**\n * Attempt to find the closest peers on the network to the given key\n */\n async *getClosestPeers(key, options = {}) {\n if (this.routers.length === 0) {\n throw new CodeError('No peer routers available', codes.ERR_NO_ROUTERS_AVAILABLE);\n }\n const self = this;\n const seen = createScalableCuckooFilter(1024);\n for await (const peer of parallel(async function* () {\n const source = merge(...self.routers.map(router => router.getClosestPeers(key, options)));\n for await (let peer of source) {\n yield async () => {\n // find multiaddrs if they are missing\n if (peer.multiaddrs.length === 0) {\n try {\n peer = await self.findPeer(peer.id, {\n ...options,\n useCache: false\n });\n }\n catch (err) {\n self.log.error('could not find peer multiaddrs', err);\n return;\n }\n }\n return peer;\n };\n }\n }())) {\n if (peer == null) {\n continue;\n }\n // store the addresses for the peer if found\n if (peer.multiaddrs.length > 0) {\n await this.peerStore.merge(peer.id, {\n multiaddrs: peer.multiaddrs\n });\n }\n // deduplicate peers\n if (seen.has(peer.id.toBytes())) {\n continue;\n }\n seen.add(peer.id.toBytes());\n yield peer;\n }\n }\n}\n//# sourceMappingURL=peer-routing.js.map","import { randomBytes } from '@libp2p/crypto';\nimport { TypedEventEmitter, setMaxListeners } from '@libp2p/interface';\nimport { anySignal } from 'any-signal';\nimport pDefer, {} from 'p-defer';\nimport { raceEvent } from 'race-event';\nimport { raceSignal } from 'race-signal';\nexport class RandomWalk extends TypedEventEmitter {\n peerRouting;\n log;\n walking;\n walkers;\n shutdownController;\n walkController;\n needNext;\n constructor(components) {\n super();\n this.log = components.logger.forComponent('libp2p:random-walk');\n this.peerRouting = components.peerRouting;\n this.walkers = 0;\n this.walking = false;\n // stops any in-progress walks when the node is shut down\n this.shutdownController = new AbortController();\n setMaxListeners(Infinity, this.shutdownController.signal);\n }\n [Symbol.toStringTag] = '@libp2p/random-walk';\n start() {\n this.shutdownController = new AbortController();\n setMaxListeners(Infinity, this.shutdownController.signal);\n }\n stop() {\n this.shutdownController.abort();\n }\n async *walk(options) {\n if (!this.walking) {\n // start the query that causes walk:peer events to be emitted\n this.startWalk();\n }\n this.walkers++;\n const signal = anySignal([this.shutdownController.signal, options?.signal]);\n setMaxListeners(Infinity, signal);\n try {\n while (true) {\n // if another consumer has paused the query, start it again\n this.needNext?.resolve();\n this.needNext = pDefer();\n // wait for a walk:peer or walk:error event\n const event = await raceEvent(this, 'walk:peer', signal, {\n errorEvent: 'walk:error'\n });\n yield event.detail;\n }\n }\n finally {\n signal.clear();\n this.walkers--;\n // stop the walk if no more consumers are interested\n if (this.walkers === 0) {\n this.walkController?.abort();\n this.walkController = undefined;\n }\n }\n }\n startWalk() {\n this.walking = true;\n // the signal for this controller will be aborted if no more random peers\n // are required\n this.walkController = new AbortController();\n setMaxListeners(Infinity, this.walkController.signal);\n const signal = anySignal([this.walkController.signal, this.shutdownController.signal]);\n setMaxListeners(Infinity, signal);\n const start = Date.now();\n let found = 0;\n Promise.resolve().then(async () => {\n this.log('start walk');\n // find peers until no more consumers are interested\n while (this.walkers > 0) {\n try {\n const data = randomBytes(32);\n let s = Date.now();\n for await (const peer of this.peerRouting.getClosestPeers(data, { signal })) {\n if (signal.aborted) {\n this.log('aborting walk');\n }\n signal.throwIfAborted();\n this.log('found peer %p after %dms for %d walkers', peer.id, Date.now() - s, this.walkers);\n found++;\n this.safeDispatchEvent('walk:peer', {\n detail: peer\n });\n // if we only have one consumer, pause the query until they request\n // another random peer or they signal they are no longer interested\n if (this.walkers === 1 && this.needNext != null) {\n this.log('wait for need next');\n await raceSignal(this.needNext.promise, signal);\n }\n s = Date.now();\n }\n this.log('walk iteration for %b and %d walkers finished, found %d peers', data, this.walkers, found);\n }\n catch (err) {\n this.log.error('randomwalk errored', err);\n this.safeDispatchEvent('walk:error', {\n detail: err\n });\n }\n }\n this.log('no walkers left, ended walk');\n })\n .catch(err => {\n this.log.error('randomwalk errored', err);\n })\n .finally(() => {\n this.log('finished walk, found %d peers after %dms', found, Date.now() - start);\n this.walking = false;\n });\n }\n}\n//# sourceMappingURL=random-walk.js.map","import { CodeError } from '@libp2p/interface';\nimport merge from 'merge-options';\nimport { codes } from './errors.js';\nexport const DEFAULT_MAX_INBOUND_STREAMS = 32;\nexport const DEFAULT_MAX_OUTBOUND_STREAMS = 64;\n/**\n * Responsible for notifying registered protocols of events in the network.\n */\nexport class DefaultRegistrar {\n log;\n topologies;\n handlers;\n components;\n constructor(components) {\n this.log = components.logger.forComponent('libp2p:registrar');\n this.topologies = new Map();\n this.handlers = new Map();\n this.components = components;\n this._onDisconnect = this._onDisconnect.bind(this);\n this._onPeerUpdate = this._onPeerUpdate.bind(this);\n this._onPeerIdentify = this._onPeerIdentify.bind(this);\n this.components.events.addEventListener('peer:disconnect', this._onDisconnect);\n this.components.events.addEventListener('peer:update', this._onPeerUpdate);\n this.components.events.addEventListener('peer:identify', this._onPeerIdentify);\n }\n [Symbol.toStringTag] = '@libp2p/registrar';\n getProtocols() {\n return Array.from(new Set([\n ...this.handlers.keys()\n ])).sort();\n }\n getHandler(protocol) {\n const handler = this.handlers.get(protocol);\n if (handler == null) {\n throw new CodeError(`No handler registered for protocol ${protocol}`, codes.ERR_NO_HANDLER_FOR_PROTOCOL);\n }\n return handler;\n }\n getTopologies(protocol) {\n const topologies = this.topologies.get(protocol);\n if (topologies == null) {\n return [];\n }\n return [\n ...topologies.values()\n ];\n }\n /**\n * Registers the `handler` for each protocol\n */\n async handle(protocol, handler, opts) {\n if (this.handlers.has(protocol)) {\n throw new CodeError(`Handler already registered for protocol ${protocol}`, codes.ERR_PROTOCOL_HANDLER_ALREADY_REGISTERED);\n }\n const options = merge.bind({ ignoreUndefined: true })({\n maxInboundStreams: DEFAULT_MAX_INBOUND_STREAMS,\n maxOutboundStreams: DEFAULT_MAX_OUTBOUND_STREAMS\n }, opts);\n this.handlers.set(protocol, {\n handler,\n options\n });\n // Add new protocol to self protocols in the peer store\n await this.components.peerStore.merge(this.components.peerId, {\n protocols: [protocol]\n });\n }\n /**\n * Removes the handler for each protocol. The protocol\n * will no longer be supported on streams.\n */\n async unhandle(protocols) {\n const protocolList = Array.isArray(protocols) ? protocols : [protocols];\n protocolList.forEach(protocol => {\n this.handlers.delete(protocol);\n });\n // Update self protocols in the peer store\n await this.components.peerStore.patch(this.components.peerId, {\n protocols: this.getProtocols()\n });\n }\n /**\n * Register handlers for a set of multicodecs given\n */\n async register(protocol, topology) {\n if (topology == null) {\n throw new CodeError('invalid topology', codes.ERR_INVALID_PARAMETERS);\n }\n // Create topology\n const id = `${(Math.random() * 1e9).toString(36)}${Date.now()}`;\n let topologies = this.topologies.get(protocol);\n if (topologies == null) {\n topologies = new Map();\n this.topologies.set(protocol, topologies);\n }\n topologies.set(id, topology);\n return id;\n }\n /**\n * Unregister topology\n */\n unregister(id) {\n for (const [protocol, topologies] of this.topologies.entries()) {\n if (topologies.has(id)) {\n topologies.delete(id);\n if (topologies.size === 0) {\n this.topologies.delete(protocol);\n }\n }\n }\n }\n /**\n * Remove a disconnected peer from the record\n */\n _onDisconnect(evt) {\n const remotePeer = evt.detail;\n void this.components.peerStore.get(remotePeer)\n .then(peer => {\n for (const protocol of peer.protocols) {\n const topologies = this.topologies.get(protocol);\n if (topologies == null) {\n // no topologies are interested in this protocol\n continue;\n }\n for (const topology of topologies.values()) {\n if (topology.filter?.has(remotePeer) === false) {\n continue;\n }\n topology.filter?.remove(remotePeer);\n topology.onDisconnect?.(remotePeer);\n }\n }\n })\n .catch(err => {\n if (err.code === codes.ERR_NOT_FOUND) {\n // peer has not completed identify so they are not in the peer store\n return;\n }\n this.log.error('could not inform topologies of disconnecting peer %p', remotePeer, err);\n });\n }\n /**\n * When a peer is updated, if they have removed supported protocols notify any\n * topologies interested in the removed protocols.\n */\n _onPeerUpdate(evt) {\n const { peer, previous } = evt.detail;\n const removed = (previous?.protocols ?? []).filter(protocol => !peer.protocols.includes(protocol));\n for (const protocol of removed) {\n const topologies = this.topologies.get(protocol);\n if (topologies == null) {\n // no topologies are interested in this protocol\n continue;\n }\n for (const topology of topologies.values()) {\n if (topology.filter?.has(peer.id) === false) {\n continue;\n }\n topology.filter?.remove(peer.id);\n topology.onDisconnect?.(peer.id);\n }\n }\n }\n /**\n * After identify has completed and we have received the list of supported\n * protocols, notify any topologies interested in those protocols.\n */\n _onPeerIdentify(evt) {\n const protocols = evt.detail.protocols;\n const connection = evt.detail.connection;\n const peerId = evt.detail.peerId;\n for (const protocol of protocols) {\n const topologies = this.topologies.get(protocol);\n if (topologies == null) {\n // no topologies are interested in this protocol\n continue;\n }\n for (const topology of topologies.values()) {\n if (connection.transient && topology.notifyOnTransient !== true) {\n continue;\n }\n if (topology.filter?.has(peerId) === true) {\n continue;\n }\n topology.filter?.add(peerId);\n topology.onConnect?.(peerId, connection);\n }\n }\n }\n}\n//# sourceMappingURL=registrar.js.map","class TrackedMap extends Map {\n metric;\n constructor(init) {\n super();\n const { name, metrics } = init;\n this.metric = metrics.registerMetric(name);\n this.updateComponentMetric();\n }\n set(key, value) {\n super.set(key, value);\n this.updateComponentMetric();\n return this;\n }\n delete(key) {\n const deleted = super.delete(key);\n this.updateComponentMetric();\n return deleted;\n }\n clear() {\n super.clear();\n this.updateComponentMetric();\n }\n updateComponentMetric() {\n this.metric.update(this.size);\n }\n}\nexport function trackedMap(config) {\n const { name, metrics } = config;\n let map;\n if (metrics != null) {\n map = new TrackedMap({ name, metrics });\n }\n else {\n map = new Map();\n }\n return map;\n}\n//# sourceMappingURL=tracked-map.js.map","import { CodeError, FaultTolerance } from '@libp2p/interface';\nimport { trackedMap } from '@libp2p/utils/tracked-map';\nimport { CustomProgressEvent } from 'progress-events';\nimport { codes } from './errors.js';\nexport class DefaultTransportManager {\n log;\n components;\n transports;\n listeners;\n faultTolerance;\n started;\n constructor(components, init = {}) {\n this.log = components.logger.forComponent('libp2p:transports');\n this.components = components;\n this.started = false;\n this.transports = new Map();\n this.listeners = trackedMap({\n name: 'libp2p_transport_manager_listeners',\n metrics: this.components.metrics\n });\n this.faultTolerance = init.faultTolerance ?? FaultTolerance.FATAL_ALL;\n }\n [Symbol.toStringTag] = '@libp2p/transport-manager';\n /**\n * Adds a `Transport` to the manager\n */\n add(transport) {\n const tag = transport[Symbol.toStringTag];\n if (tag == null) {\n throw new CodeError('Transport must have a valid tag', codes.ERR_INVALID_KEY);\n }\n if (this.transports.has(tag)) {\n throw new CodeError(`There is already a transport with the tag ${tag}`, codes.ERR_DUPLICATE_TRANSPORT);\n }\n this.log('adding transport %s', tag);\n this.transports.set(tag, transport);\n if (!this.listeners.has(tag)) {\n this.listeners.set(tag, []);\n }\n }\n isStarted() {\n return this.started;\n }\n start() {\n this.started = true;\n }\n async afterStart() {\n // Listen on the provided transports for the provided addresses\n const addrs = this.components.addressManager.getListenAddrs();\n await this.listen(addrs);\n }\n /**\n * Stops all listeners\n */\n async stop() {\n const tasks = [];\n for (const [key, listeners] of this.listeners) {\n this.log('closing listeners for %s', key);\n while (listeners.length > 0) {\n const listener = listeners.pop();\n if (listener == null) {\n continue;\n }\n tasks.push(listener.close());\n }\n }\n await Promise.all(tasks);\n this.log('all listeners closed');\n for (const key of this.listeners.keys()) {\n this.listeners.set(key, []);\n }\n this.started = false;\n }\n /**\n * Dials the given Multiaddr over it's supported transport\n */\n async dial(ma, options) {\n const transport = this.dialTransportForMultiaddr(ma);\n if (transport == null) {\n throw new CodeError(`No transport available for address ${String(ma)}`, codes.ERR_TRANSPORT_UNAVAILABLE);\n }\n options?.onProgress?.(new CustomProgressEvent('transport-manager:selected-transport', transport[Symbol.toStringTag]));\n try {\n // @ts-expect-error the transport has a typed onProgress option but we\n // can't predict what transport implementation we selected so all we can\n // do is pass the onProgress handler in and hope for the best\n return await transport.dial(ma, {\n ...options,\n upgrader: this.components.upgrader\n });\n }\n catch (err) {\n if (err.code == null) {\n err.code = codes.ERR_TRANSPORT_DIAL_FAILED;\n }\n throw err;\n }\n }\n /**\n * Returns all Multiaddr's the listeners are using\n */\n getAddrs() {\n let addrs = [];\n for (const listeners of this.listeners.values()) {\n for (const listener of listeners) {\n addrs = [...addrs, ...listener.getAddrs()];\n }\n }\n return addrs;\n }\n /**\n * Returns all the transports instances\n */\n getTransports() {\n return Array.of(...this.transports.values());\n }\n /**\n * Returns all the listener instances\n */\n getListeners() {\n return Array.of(...this.listeners.values()).flat();\n }\n /**\n * Finds a transport that matches the given Multiaddr\n */\n dialTransportForMultiaddr(ma) {\n for (const transport of this.transports.values()) {\n const addrs = transport.dialFilter([ma]);\n if (addrs.length > 0) {\n return transport;\n }\n }\n }\n /**\n * Finds a transport that matches the given Multiaddr\n */\n listenTransportForMultiaddr(ma) {\n for (const transport of this.transports.values()) {\n const addrs = transport.listenFilter([ma]);\n if (addrs.length > 0) {\n return transport;\n }\n }\n }\n /**\n * Starts listeners for each listen Multiaddr\n */\n async listen(addrs) {\n if (!this.isStarted()) {\n throw new CodeError('Not started', codes.ERR_NODE_NOT_STARTED);\n }\n if (addrs == null || addrs.length === 0) {\n this.log('no addresses were provided for listening, this node is dial only');\n return;\n }\n const couldNotListen = [];\n for (const [key, transport] of this.transports.entries()) {\n const supportedAddrs = transport.listenFilter(addrs);\n const tasks = [];\n // For each supported multiaddr, create a listener\n for (const addr of supportedAddrs) {\n this.log('creating listener for %s on %a', key, addr);\n const listener = transport.createListener({\n upgrader: this.components.upgrader\n });\n let listeners = this.listeners.get(key) ?? [];\n if (listeners == null) {\n listeners = [];\n this.listeners.set(key, listeners);\n }\n listeners.push(listener);\n // Track listen/close events\n listener.addEventListener('listening', () => {\n this.components.events.safeDispatchEvent('transport:listening', {\n detail: listener\n });\n });\n listener.addEventListener('close', () => {\n const index = listeners.findIndex(l => l === listener);\n // remove the listener\n listeners.splice(index, 1);\n this.components.events.safeDispatchEvent('transport:close', {\n detail: listener\n });\n });\n // We need to attempt to listen on everything\n tasks.push(listener.listen(addr));\n }\n // Keep track of transports we had no addresses for\n if (tasks.length === 0) {\n couldNotListen.push(key);\n continue;\n }\n const results = await Promise.allSettled(tasks);\n // If we are listening on at least 1 address, succeed.\n // TODO: we should look at adding a retry (`p-retry`) here to better support\n // listening on remote addresses as they may be offline. We could then potentially\n // just wait for any (`p-any`) listener to succeed on each transport before returning\n const isListening = results.find(r => r.status === 'fulfilled');\n if ((isListening == null) && this.faultTolerance !== FaultTolerance.NO_FATAL) {\n throw new CodeError(`Transport (${key}) could not listen on any available address`, codes.ERR_NO_VALID_ADDRESSES);\n }\n }\n // If no transports were able to listen, throw an error. This likely\n // means we were given addresses we do not have transports for\n if (couldNotListen.length === this.transports.size) {\n const message = `no valid addresses were provided for transports [${couldNotListen.join(', ')}]`;\n if (this.faultTolerance === FaultTolerance.FATAL_ALL) {\n throw new CodeError(message, codes.ERR_NO_VALID_ADDRESSES);\n }\n this.log(`libp2p in dial mode only: ${message}`);\n }\n }\n /**\n * Removes the given transport from the manager.\n * If a transport has any running listeners, they will be closed.\n */\n async remove(key) {\n const listeners = this.listeners.get(key) ?? [];\n this.log.trace('removing transport %s', key);\n // Close any running listeners\n const tasks = [];\n this.log.trace('closing listeners for %s', key);\n while (listeners.length > 0) {\n const listener = listeners.pop();\n if (listener == null) {\n continue;\n }\n tasks.push(listener.close());\n }\n await Promise.all(tasks);\n this.transports.delete(key);\n this.listeners.delete(key);\n }\n /**\n * Removes all transports from the manager.\n * If any listeners are running, they will be closed.\n *\n * @async\n */\n async removeAll() {\n const tasks = [];\n for (const key of this.transports.keys()) {\n tasks.push(this.remove(key));\n }\n await Promise.all(tasks);\n }\n}\n//# sourceMappingURL=transport-manager.js.map","export const PROTOCOL_ID = '/multistream/1.0.0';\n// Conforming to go-libp2p\n// See https://github.com/multiformats/go-multistream/blob/master/multistream.go#L297\nexport const MAX_PROTOCOL_LENGTH = 1024;\n//# sourceMappingURL=constants.js.map","import { CodeError } from '@libp2p/interface';\nimport {} from 'uint8arraylist';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport { toString as uint8ArrayToString } from 'uint8arrays/to-string';\nconst NewLine = uint8ArrayFromString('\\n');\n/**\n * `write` encodes and writes a single buffer\n */\nexport async function write(writer, buffer, options) {\n await writer.write(buffer, options);\n}\n/**\n * `writeAll` behaves like `write`, except it encodes an array of items as a single write\n */\nexport async function writeAll(writer, buffers, options) {\n await writer.writeV(buffers, options);\n}\n/**\n * Read a length-prefixed buffer from the passed stream, stripping the final newline character\n */\nexport async function read(reader, options) {\n const buf = await reader.read(options);\n if (buf.byteLength === 0 || buf.get(buf.byteLength - 1) !== NewLine[0]) {\n options.log.error('Invalid mss message - missing newline', buf);\n throw new CodeError('missing newline', 'ERR_INVALID_MULTISTREAM_SELECT_MESSAGE');\n }\n return buf.sublist(0, -1); // Remove newline\n}\n/**\n * Read a length-prefixed string from the passed stream, stripping the final newline character\n */\nexport async function readString(reader, options) {\n const buf = await read(reader, options);\n return uint8ArrayToString(buf.subarray());\n}\n//# sourceMappingURL=multistream.js.map","import { encode } from 'it-length-prefixed';\nimport { lpStream } from 'it-length-prefixed-stream';\nimport { Uint8ArrayList } from 'uint8arraylist';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport { MAX_PROTOCOL_LENGTH, PROTOCOL_ID } from './constants.js';\nimport * as multistream from './multistream.js';\n/**\n * Handle multistream protocol selections for the given list of protocols.\n *\n * Note that after a protocol is handled `listener` can no longer be used.\n *\n * @param stream - A duplex iterable stream to listen on\n * @param protocols - A list of protocols (or single protocol) that this listener is able to speak.\n * @param options - an options object containing an AbortSignal and an optional boolean `writeBytes` - if this is true, `Uint8Array`s will be written into `duplex`, otherwise `Uint8ArrayList`s will\n * @returns A stream for the selected protocol and the protocol that was selected from the list of protocols provided to `select`\n * @example\n *\n * ```TypeScript\n * import { pipe } from 'it-pipe'\n * import * as mss from '@libp2p/multistream-select'\n * import { Mplex } from '@libp2p/mplex'\n *\n * const muxer = new Mplex({\n * async onStream (muxedStream) {\n * // mss.handle(handledProtocols)\n * // Returns selected stream and protocol\n * const { stream, protocol } = await mss.handle(muxedStream, [\n * '/ipfs-dht/1.0.0',\n * '/ipfs-bitswap/1.0.0'\n * ])\n *\n * // Typically here we'd call the handler function that was registered in\n * // libp2p for the given protocol:\n * // e.g. handlers[protocol].handler(stream)\n * //\n * // If protocol was /ipfs-dht/1.0.0 it might do something like this:\n * // try {\n * // await pipe(\n * // dhtStream,\n * // source => (async function * () {\n * // for await (const chunk of source)\n * // // Incoming DHT data -> process and yield to respond\n * // })(),\n * // dhtStream\n * // )\n * // } catch (err) {\n * // // Error in stream\n * // }\n * }\n * })\n * ```\n */\nexport async function handle(stream, protocols, options) {\n protocols = Array.isArray(protocols) ? protocols : [protocols];\n options.log.trace('handle: available protocols %s', protocols);\n const lp = lpStream(stream, {\n ...options,\n maxDataLength: MAX_PROTOCOL_LENGTH,\n maxLengthLength: 2 // 2 bytes is enough to length-prefix MAX_PROTOCOL_LENGTH\n });\n while (true) {\n options.log.trace('handle: reading incoming string');\n const protocol = await multistream.readString(lp, options);\n options.log.trace('handle: read \"%s\"', protocol);\n if (protocol === PROTOCOL_ID) {\n options.log.trace('handle: respond with \"%s\" for \"%s\"', PROTOCOL_ID, protocol);\n await multistream.write(lp, uint8ArrayFromString(`${PROTOCOL_ID}\\n`), options);\n options.log.trace('handle: responded with \"%s\" for \"%s\"', PROTOCOL_ID, protocol);\n continue;\n }\n if (protocols.includes(protocol)) {\n options.log.trace('handle: respond with \"%s\" for \"%s\"', protocol, protocol);\n await multistream.write(lp, uint8ArrayFromString(`${protocol}\\n`), options);\n options.log.trace('handle: responded with \"%s\" for \"%s\"', protocol, protocol);\n return { stream: lp.unwrap(), protocol };\n }\n if (protocol === 'ls') {\n // \\n\\n\\n\n const protos = new Uint8ArrayList(...protocols.map(p => encode.single(uint8ArrayFromString(`${p}\\n`))), uint8ArrayFromString('\\n'));\n options.log.trace('handle: respond with \"%s\" for %s', protocols, protocol);\n await multistream.write(lp, protos, options);\n options.log.trace('handle: responded with \"%s\" for %s', protocols, protocol);\n continue;\n }\n options.log('handle: respond with \"na\" for \"%s\"', protocol);\n await multistream.write(lp, uint8ArrayFromString('na\\n'), options);\n options.log('handle: responded with \"na\" for \"%s\"', protocol);\n }\n}\n//# sourceMappingURL=handle.js.map","import { CodeError } from '@libp2p/interface';\nimport { lpStream } from 'it-length-prefixed-stream';\nimport pDefer from 'p-defer';\nimport { raceSignal } from 'race-signal';\nimport * as varint from 'uint8-varint';\nimport { Uint8ArrayList } from 'uint8arraylist';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport { MAX_PROTOCOL_LENGTH } from './constants.js';\nimport * as multistream from './multistream.js';\nimport { PROTOCOL_ID } from './index.js';\n/**\n * Negotiate a protocol to use from a list of protocols.\n *\n * @param stream - A duplex iterable stream to dial on\n * @param protocols - A list of protocols (or single protocol) to negotiate with. Protocols are attempted in order until a match is made.\n * @param options - An options object containing an AbortSignal and an optional boolean `writeBytes` - if this is true, `Uint8Array`s will be written into `duplex`, otherwise `Uint8ArrayList`s will\n * @returns A stream for the selected protocol and the protocol that was selected from the list of protocols provided to `select`.\n * @example\n *\n * ```TypeScript\n * import { pipe } from 'it-pipe'\n * import * as mss from '@libp2p/multistream-select'\n * import { Mplex } from '@libp2p/mplex'\n *\n * const muxer = new Mplex()\n * const muxedStream = muxer.newStream()\n *\n * // mss.select(protocol(s))\n * // Select from one of the passed protocols (in priority order)\n * // Returns selected stream and protocol\n * const { stream: dhtStream, protocol } = await mss.select(muxedStream, [\n * // This might just be different versions of DHT, but could be different impls\n * '/ipfs-dht/2.0.0', // Most of the time this will probably just be one item.\n * '/ipfs-dht/1.0.0'\n * ])\n *\n * // Typically this stream will be passed back to the caller of libp2p.dialProtocol\n * //\n * // ...it might then do something like this:\n * // try {\n * // await pipe(\n * // [uint8ArrayFromString('Some DHT data')]\n * // dhtStream,\n * // async source => {\n * // for await (const chunk of source)\n * // // DHT response data\n * // }\n * // )\n * // } catch (err) {\n * // // Error in stream\n * // }\n * ```\n */\nexport async function select(stream, protocols, options) {\n protocols = Array.isArray(protocols) ? [...protocols] : [protocols];\n if (protocols.length === 1 && options.negotiateFully === false) {\n return optimisticSelect(stream, protocols[0], options);\n }\n const lp = lpStream(stream, {\n ...options,\n maxDataLength: MAX_PROTOCOL_LENGTH\n });\n const protocol = protocols.shift();\n if (protocol == null) {\n throw new Error('At least one protocol must be specified');\n }\n options.log.trace('select: write [\"%s\", \"%s\"]', PROTOCOL_ID, protocol);\n const p1 = uint8ArrayFromString(`${PROTOCOL_ID}\\n`);\n const p2 = uint8ArrayFromString(`${protocol}\\n`);\n await multistream.writeAll(lp, [p1, p2], options);\n options.log.trace('select: reading multistream-select header');\n let response = await multistream.readString(lp, options);\n options.log.trace('select: read \"%s\"', response);\n // Read the protocol response if we got the protocolId in return\n if (response === PROTOCOL_ID) {\n options.log.trace('select: reading protocol response');\n response = await multistream.readString(lp, options);\n options.log.trace('select: read \"%s\"', response);\n }\n // We're done\n if (response === protocol) {\n return { stream: lp.unwrap(), protocol };\n }\n // We haven't gotten a valid ack, try the other protocols\n for (const protocol of protocols) {\n options.log.trace('select: write \"%s\"', protocol);\n await multistream.write(lp, uint8ArrayFromString(`${protocol}\\n`), options);\n options.log.trace('select: reading protocol response');\n const response = await multistream.readString(lp, options);\n options.log.trace('select: read \"%s\" for \"%s\"', response, protocol);\n if (response === protocol) {\n return { stream: lp.unwrap(), protocol };\n }\n }\n throw new CodeError('protocol selection failed', 'ERR_UNSUPPORTED_PROTOCOL');\n}\n/**\n * Optimistically negotiates a protocol.\n *\n * It *does not* block writes waiting for the other end to respond. Instead, it\n * simply assumes the negotiation went successfully and starts writing data.\n *\n * Use when it is known that the receiver supports the desired protocol.\n */\nfunction optimisticSelect(stream, protocol, options) {\n const originalSink = stream.sink.bind(stream);\n const originalSource = stream.source;\n let negotiated = false;\n let negotiating = false;\n const doneNegotiating = pDefer();\n let sentProtocol = false;\n let sendingProtocol = false;\n const doneSendingProtocol = pDefer();\n let readProtocol = false;\n let readingProtocol = false;\n const doneReadingProtocol = pDefer();\n const lp = lpStream({\n sink: originalSink,\n source: originalSource\n }, {\n ...options,\n maxDataLength: MAX_PROTOCOL_LENGTH\n });\n stream.sink = async (source) => {\n const { sink } = lp.unwrap();\n await sink(async function* () {\n let sentData = false;\n for await (const buf of source) {\n // started reading before the source yielded, wait for protocol send\n if (sendingProtocol) {\n await doneSendingProtocol.promise;\n }\n // writing before reading, send the protocol and the first chunk of data\n if (!sentProtocol) {\n sendingProtocol = true;\n options.log.trace('optimistic: write [\"%s\", \"%s\", data(%d)] in sink', PROTOCOL_ID, protocol, buf.byteLength);\n const protocolString = `${protocol}\\n`;\n // send protocols in first chunk of data written to transport\n yield new Uint8ArrayList(Uint8Array.from([19]), // length of PROTOCOL_ID plus newline\n uint8ArrayFromString(`${PROTOCOL_ID}\\n`), varint.encode(protocolString.length), uint8ArrayFromString(protocolString), buf).subarray();\n options.log.trace('optimistic: wrote [\"%s\", \"%s\", data(%d)] in sink', PROTOCOL_ID, protocol, buf.byteLength);\n sentProtocol = true;\n sendingProtocol = false;\n doneSendingProtocol.resolve();\n // read the negotiation response but don't block more sending\n negotiate()\n .catch(err => {\n options.log.error('could not finish optimistic protocol negotiation of %s', protocol, err);\n });\n }\n else {\n yield buf;\n }\n sentData = true;\n }\n // special case - the source passed to the sink has ended but we didn't\n // negotiated the protocol yet so do it now\n if (!sentData) {\n await negotiate();\n }\n }());\n };\n async function negotiate() {\n if (negotiating) {\n options.log.trace('optimistic: already negotiating %s stream', protocol);\n await doneNegotiating.promise;\n return;\n }\n negotiating = true;\n try {\n // we haven't sent the protocol yet, send it now\n if (!sentProtocol) {\n options.log.trace('optimistic: doing send protocol for %s stream', protocol);\n await doSendProtocol();\n }\n // if we haven't read the protocol response yet, do it now\n if (!readProtocol) {\n options.log.trace('optimistic: doing read protocol for %s stream', protocol);\n await doReadProtocol();\n }\n }\n finally {\n negotiating = false;\n negotiated = true;\n doneNegotiating.resolve();\n }\n }\n async function doSendProtocol() {\n if (sendingProtocol) {\n await doneSendingProtocol.promise;\n return;\n }\n sendingProtocol = true;\n try {\n options.log.trace('optimistic: write [\"%s\", \"%s\", data] in source', PROTOCOL_ID, protocol);\n await lp.writeV([\n uint8ArrayFromString(`${PROTOCOL_ID}\\n`),\n uint8ArrayFromString(`${protocol}\\n`)\n ]);\n options.log.trace('optimistic: wrote [\"%s\", \"%s\", data] in source', PROTOCOL_ID, protocol);\n }\n finally {\n sentProtocol = true;\n sendingProtocol = false;\n doneSendingProtocol.resolve();\n }\n }\n async function doReadProtocol() {\n if (readingProtocol) {\n await doneReadingProtocol.promise;\n return;\n }\n readingProtocol = true;\n try {\n options.log.trace('optimistic: reading multistream select header');\n let response = await multistream.readString(lp, options);\n options.log.trace('optimistic: read multistream select header \"%s\"', response);\n if (response === PROTOCOL_ID) {\n response = await multistream.readString(lp, options);\n }\n options.log.trace('optimistic: read protocol \"%s\", expecting \"%s\"', response, protocol);\n if (response !== protocol) {\n throw new CodeError('protocol selection failed', 'ERR_UNSUPPORTED_PROTOCOL');\n }\n }\n finally {\n readProtocol = true;\n readingProtocol = false;\n doneReadingProtocol.resolve();\n }\n }\n stream.source = (async function* () {\n // make sure we've done protocol negotiation before we read stream data\n await negotiate();\n options.log.trace('optimistic: reading data from \"%s\" stream', protocol);\n yield* lp.unwrap().source;\n })();\n if (stream.closeRead != null) {\n const originalCloseRead = stream.closeRead.bind(stream);\n stream.closeRead = async (opts) => {\n // we need to read & write to negotiate the protocol so ensure we've done\n // this before closing the readable end of the stream\n if (!negotiated) {\n await negotiate().catch(err => {\n options.log.error('could not negotiate protocol before close read', err);\n });\n }\n // protocol has been negotiated, ok to close the readable end\n await originalCloseRead(opts);\n };\n }\n if (stream.closeWrite != null) {\n const originalCloseWrite = stream.closeWrite.bind(stream);\n stream.closeWrite = async (opts) => {\n // we need to read & write to negotiate the protocol so ensure we've done\n // this before closing the writable end of the stream\n if (!negotiated) {\n await negotiate().catch(err => {\n options.log.error('could not negotiate protocol before close write', err);\n });\n }\n // protocol has been negotiated, ok to close the writable end\n await originalCloseWrite(opts);\n };\n }\n if (stream.close != null) {\n const originalClose = stream.close.bind(stream);\n stream.close = async (opts) => {\n // if we are in the process of negotiation, let it finish before closing\n // because we may have unsent early data\n const tasks = [];\n if (sendingProtocol) {\n tasks.push(doneSendingProtocol.promise);\n }\n if (readingProtocol) {\n tasks.push(doneReadingProtocol.promise);\n }\n if (tasks.length > 0) {\n // let the in-flight protocol negotiation finish gracefully\n await raceSignal(Promise.all(tasks), opts?.signal);\n }\n else {\n // no protocol negotiation attempt has occurred so don't start one\n negotiated = true;\n negotiating = false;\n doneNegotiating.resolve();\n }\n // protocol has been negotiated, ok to close the writable end\n await originalClose(opts);\n };\n }\n return {\n stream,\n protocol\n };\n}\n//# sourceMappingURL=select.js.map","export const connectionSymbol = Symbol.for('@libp2p/connection');\nexport function isConnection(other) {\n return other != null && Boolean(other[connectionSymbol]);\n}\n//# sourceMappingURL=index.js.map","import { connectionSymbol, CodeError, setMaxListeners } from '@libp2p/interface';\nconst CLOSE_TIMEOUT = 500;\n/**\n * An implementation of the js-libp2p connection.\n * Any libp2p transport should use an upgrader to return this connection.\n */\nexport class ConnectionImpl {\n /**\n * Connection identifier.\n */\n id;\n /**\n * Observed multiaddr of the remote peer\n */\n remoteAddr;\n /**\n * Remote peer id\n */\n remotePeer;\n direction;\n timeline;\n multiplexer;\n encryption;\n status;\n transient;\n log;\n /**\n * User provided tags\n *\n */\n tags;\n /**\n * Reference to the new stream function of the multiplexer\n */\n _newStream;\n /**\n * Reference to the close function of the raw connection\n */\n _close;\n _abort;\n /**\n * Reference to the getStreams function of the muxer\n */\n _getStreams;\n /**\n * An implementation of the js-libp2p connection.\n * Any libp2p transport should use an upgrader to return this connection.\n */\n constructor(init) {\n const { remoteAddr, remotePeer, newStream, close, abort, getStreams } = init;\n this.id = `${(parseInt(String(Math.random() * 1e9))).toString(36)}${Date.now()}`;\n this.remoteAddr = remoteAddr;\n this.remotePeer = remotePeer;\n this.direction = init.direction;\n this.status = 'open';\n this.timeline = init.timeline;\n this.multiplexer = init.multiplexer;\n this.encryption = init.encryption;\n this.transient = init.transient ?? false;\n this.log = init.logger.forComponent(`libp2p:connection:${this.direction}:${this.id}`);\n if (this.remoteAddr.getPeerId() == null) {\n this.remoteAddr = this.remoteAddr.encapsulate(`/p2p/${this.remotePeer}`);\n }\n this._newStream = newStream;\n this._close = close;\n this._abort = abort;\n this._getStreams = getStreams;\n this.tags = [];\n }\n [Symbol.toStringTag] = 'Connection';\n [connectionSymbol] = true;\n /**\n * Get all the streams of the muxer\n */\n get streams() {\n return this._getStreams();\n }\n /**\n * Create a new stream from this connection\n */\n async newStream(protocols, options) {\n if (this.status === 'closing') {\n throw new CodeError('the connection is being closed', 'ERR_CONNECTION_BEING_CLOSED');\n }\n if (this.status === 'closed') {\n throw new CodeError('the connection is closed', 'ERR_CONNECTION_CLOSED');\n }\n if (!Array.isArray(protocols)) {\n protocols = [protocols];\n }\n if (this.transient && options?.runOnTransientConnection !== true) {\n throw new CodeError('Cannot open protocol stream on transient connection', 'ERR_TRANSIENT_CONNECTION');\n }\n const stream = await this._newStream(protocols, options);\n stream.direction = 'outbound';\n return stream;\n }\n /**\n * Close the connection\n */\n async close(options = {}) {\n if (this.status === 'closed' || this.status === 'closing') {\n return;\n }\n this.log('closing connection to %a', this.remoteAddr);\n this.status = 'closing';\n if (options.signal == null) {\n const signal = AbortSignal.timeout(CLOSE_TIMEOUT);\n setMaxListeners(Infinity, signal);\n options = {\n ...options,\n signal\n };\n }\n try {\n this.log.trace('closing all streams');\n // close all streams gracefully - this can throw if we're not multiplexed\n await Promise.all(this.streams.map(async (s) => s.close(options)));\n this.log.trace('closing underlying transport');\n // close raw connection\n await this._close(options);\n this.log.trace('updating timeline with close time');\n this.status = 'closed';\n this.timeline.close = Date.now();\n }\n catch (err) {\n this.log.error('error encountered during graceful close of connection to %a', this.remoteAddr, err);\n this.abort(err);\n }\n }\n abort(err) {\n this.log.error('aborting connection to %a due to error', this.remoteAddr, err);\n this.status = 'closing';\n this.streams.forEach(s => { s.abort(err); });\n this.log.error('all streams aborted', this.streams.length);\n // Abort raw connection\n this._abort(err);\n this.timeline.close = Date.now();\n this.status = 'closed';\n }\n}\nexport function createConnection(init) {\n return new ConnectionImpl(init);\n}\n//# sourceMappingURL=index.js.map","import { CodeError, ERR_TIMEOUT, setMaxListeners } from '@libp2p/interface';\nimport * as mss from '@libp2p/multistream-select';\nimport { peerIdFromString } from '@libp2p/peer-id';\nimport { CustomProgressEvent } from 'progress-events';\nimport { createConnection } from './connection/index.js';\nimport { INBOUND_UPGRADE_TIMEOUT } from './connection-manager/constants.js';\nimport { codes } from './errors.js';\nimport { DEFAULT_MAX_INBOUND_STREAMS, DEFAULT_MAX_OUTBOUND_STREAMS } from './registrar.js';\nconst DEFAULT_PROTOCOL_SELECT_TIMEOUT = 30000;\nfunction findIncomingStreamLimit(protocol, registrar) {\n try {\n const { options } = registrar.getHandler(protocol);\n return options.maxInboundStreams;\n }\n catch (err) {\n if (err.code !== codes.ERR_NO_HANDLER_FOR_PROTOCOL) {\n throw err;\n }\n }\n return DEFAULT_MAX_INBOUND_STREAMS;\n}\nfunction findOutgoingStreamLimit(protocol, registrar, options = {}) {\n try {\n const { options } = registrar.getHandler(protocol);\n if (options.maxOutboundStreams != null) {\n return options.maxOutboundStreams;\n }\n }\n catch (err) {\n if (err.code !== codes.ERR_NO_HANDLER_FOR_PROTOCOL) {\n throw err;\n }\n }\n return options.maxOutboundStreams ?? DEFAULT_MAX_OUTBOUND_STREAMS;\n}\nfunction countStreams(protocol, direction, connection) {\n let streamCount = 0;\n connection.streams.forEach(stream => {\n if (stream.direction === direction && stream.protocol === protocol) {\n streamCount++;\n }\n });\n return streamCount;\n}\nexport class DefaultUpgrader {\n components;\n connectionEncryption;\n muxers;\n inboundUpgradeTimeout;\n events;\n constructor(components, init) {\n this.components = components;\n this.connectionEncryption = new Map();\n init.connectionEncryption.forEach(encrypter => {\n this.connectionEncryption.set(encrypter.protocol, encrypter);\n });\n this.muxers = new Map();\n init.muxers.forEach(muxer => {\n this.muxers.set(muxer.protocol, muxer);\n });\n this.inboundUpgradeTimeout = init.inboundUpgradeTimeout ?? INBOUND_UPGRADE_TIMEOUT;\n this.events = components.events;\n }\n [Symbol.toStringTag] = '@libp2p/upgrader';\n async shouldBlockConnection(remotePeer, maConn, connectionType) {\n const connectionGater = this.components.connectionGater[connectionType];\n if (connectionGater !== undefined) {\n if (await connectionGater(remotePeer, maConn)) {\n throw new CodeError(`The multiaddr connection is blocked by gater.${connectionType}`, codes.ERR_CONNECTION_INTERCEPTED);\n }\n }\n }\n /**\n * Upgrades an inbound connection\n */\n async upgradeInbound(maConn, opts) {\n const accept = await this.components.connectionManager.acceptIncomingConnection(maConn);\n if (!accept) {\n throw new CodeError('connection denied', codes.ERR_CONNECTION_DENIED);\n }\n let encryptedConn;\n let remotePeer;\n let upgradedConn;\n let muxerFactory;\n let cryptoProtocol;\n const signal = AbortSignal.timeout(this.inboundUpgradeTimeout);\n const onAbort = () => {\n maConn.abort(new CodeError('inbound upgrade timeout', ERR_TIMEOUT));\n };\n signal.addEventListener('abort', onAbort, { once: true });\n setMaxListeners(Infinity, signal);\n try {\n if ((await this.components.connectionGater.denyInboundConnection?.(maConn)) === true) {\n throw new CodeError('The multiaddr connection is blocked by gater.acceptConnection', codes.ERR_CONNECTION_INTERCEPTED);\n }\n this.components.metrics?.trackMultiaddrConnection(maConn);\n maConn.log('starting the inbound connection upgrade');\n // Protect\n let protectedConn = maConn;\n if (opts?.skipProtection !== true) {\n const protector = this.components.connectionProtector;\n if (protector != null) {\n maConn.log('protecting the inbound connection');\n protectedConn = await protector.protect(maConn);\n }\n }\n try {\n // Encrypt the connection\n encryptedConn = protectedConn;\n if (opts?.skipEncryption !== true) {\n opts?.onProgress?.(new CustomProgressEvent('upgrader:encrypt-inbound-connection'));\n ({\n conn: encryptedConn,\n remotePeer,\n protocol: cryptoProtocol\n } = await this._encryptInbound(protectedConn));\n const maConn = {\n ...protectedConn,\n ...encryptedConn\n };\n await this.shouldBlockConnection(remotePeer, maConn, 'denyInboundEncryptedConnection');\n }\n else {\n const idStr = maConn.remoteAddr.getPeerId();\n if (idStr == null) {\n throw new CodeError('inbound connection that skipped encryption must have a peer id', codes.ERR_INVALID_MULTIADDR);\n }\n const remotePeerId = peerIdFromString(idStr);\n cryptoProtocol = 'native';\n remotePeer = remotePeerId;\n }\n upgradedConn = encryptedConn;\n if (opts?.muxerFactory != null) {\n muxerFactory = opts.muxerFactory;\n }\n else if (this.muxers.size > 0) {\n opts?.onProgress?.(new CustomProgressEvent('upgrader:multiplex-inbound-connection'));\n // Multiplex the connection\n const multiplexed = await this._multiplexInbound({\n ...protectedConn,\n ...encryptedConn\n }, this.muxers);\n muxerFactory = multiplexed.muxerFactory;\n upgradedConn = multiplexed.stream;\n }\n }\n catch (err) {\n maConn.log.error('failed to upgrade inbound connection', err);\n throw err;\n }\n await this.shouldBlockConnection(remotePeer, maConn, 'denyInboundUpgradedConnection');\n maConn.log('successfully upgraded inbound connection');\n return this._createConnection({\n cryptoProtocol,\n direction: 'inbound',\n maConn,\n upgradedConn,\n muxerFactory,\n remotePeer,\n transient: opts?.transient\n });\n }\n finally {\n signal.removeEventListener('abort', onAbort);\n this.components.connectionManager.afterUpgradeInbound();\n }\n }\n /**\n * Upgrades an outbound connection\n */\n async upgradeOutbound(maConn, opts) {\n const idStr = maConn.remoteAddr.getPeerId();\n let remotePeerId;\n if (idStr != null) {\n remotePeerId = peerIdFromString(idStr);\n await this.shouldBlockConnection(remotePeerId, maConn, 'denyOutboundConnection');\n }\n let encryptedConn;\n let remotePeer;\n let upgradedConn;\n let cryptoProtocol;\n let muxerFactory;\n this.components.metrics?.trackMultiaddrConnection(maConn);\n maConn.log('starting the outbound connection upgrade');\n // If the transport natively supports encryption, skip connection\n // protector and encryption\n // Protect\n let protectedConn = maConn;\n if (opts?.skipProtection !== true) {\n const protector = this.components.connectionProtector;\n if (protector != null) {\n protectedConn = await protector.protect(maConn);\n }\n }\n try {\n // Encrypt the connection\n encryptedConn = protectedConn;\n if (opts?.skipEncryption !== true) {\n ({\n conn: encryptedConn,\n remotePeer,\n protocol: cryptoProtocol\n } = await this._encryptOutbound(protectedConn, remotePeerId));\n const maConn = {\n ...protectedConn,\n ...encryptedConn\n };\n await this.shouldBlockConnection(remotePeer, maConn, 'denyOutboundEncryptedConnection');\n }\n else {\n if (remotePeerId == null) {\n throw new CodeError('Encryption was skipped but no peer id was passed', codes.ERR_INVALID_PEER);\n }\n cryptoProtocol = 'native';\n remotePeer = remotePeerId;\n }\n upgradedConn = encryptedConn;\n if (opts?.muxerFactory != null) {\n muxerFactory = opts.muxerFactory;\n }\n else if (this.muxers.size > 0) {\n // Multiplex the connection\n const multiplexed = await this._multiplexOutbound({\n ...protectedConn,\n ...encryptedConn\n }, this.muxers);\n muxerFactory = multiplexed.muxerFactory;\n upgradedConn = multiplexed.stream;\n }\n }\n catch (err) {\n maConn.log.error('failed to upgrade outbound connection', err);\n await maConn.close(err);\n throw err;\n }\n await this.shouldBlockConnection(remotePeer, maConn, 'denyOutboundUpgradedConnection');\n maConn.log('successfully upgraded outbound connection');\n return this._createConnection({\n cryptoProtocol,\n direction: 'outbound',\n maConn,\n upgradedConn,\n muxerFactory,\n remotePeer,\n transient: opts?.transient\n });\n }\n /**\n * A convenience method for generating a new `Connection`\n */\n _createConnection(opts) {\n const { cryptoProtocol, direction, maConn, upgradedConn, remotePeer, muxerFactory, transient } = opts;\n let muxer;\n let newStream;\n let connection; // eslint-disable-line prefer-const\n if (muxerFactory != null) {\n // Create the muxer\n muxer = muxerFactory.createStreamMuxer({\n direction,\n // Run anytime a remote stream is created\n onIncomingStream: muxedStream => {\n if (connection == null) {\n return;\n }\n void Promise.resolve()\n .then(async () => {\n const protocols = this.components.registrar.getProtocols();\n const { stream, protocol } = await mss.handle(muxedStream, protocols, {\n log: muxedStream.log,\n yieldBytes: false\n });\n if (connection == null) {\n return;\n }\n connection.log('incoming stream opened on %s', protocol);\n const incomingLimit = findIncomingStreamLimit(protocol, this.components.registrar);\n const streamCount = countStreams(protocol, 'inbound', connection);\n if (streamCount === incomingLimit) {\n const err = new CodeError(`Too many inbound protocol streams for protocol \"${protocol}\" - limit ${incomingLimit}`, codes.ERR_TOO_MANY_INBOUND_PROTOCOL_STREAMS);\n muxedStream.abort(err);\n throw err;\n }\n // after the handshake the returned stream can have early data so override\n // the souce/sink\n muxedStream.source = stream.source;\n muxedStream.sink = stream.sink;\n muxedStream.protocol = protocol;\n // allow closing the write end of a not-yet-negotiated stream\n if (stream.closeWrite != null) {\n muxedStream.closeWrite = stream.closeWrite;\n }\n // allow closing the read end of a not-yet-negotiated stream\n if (stream.closeRead != null) {\n muxedStream.closeRead = stream.closeRead;\n }\n // make sure we don't try to negotiate a stream we are closing\n if (stream.close != null) {\n muxedStream.close = stream.close;\n }\n // If a protocol stream has been successfully negotiated and is to be passed to the application,\n // the peerstore should ensure that the peer is registered with that protocol\n await this.components.peerStore.merge(remotePeer, {\n protocols: [protocol]\n });\n this.components.metrics?.trackProtocolStream(muxedStream, connection);\n this._onStream({ connection, stream: muxedStream, protocol });\n })\n .catch(async (err) => {\n connection.log.error('error handling incoming stream id %s', muxedStream.id, err.message, err.code, err.stack);\n if (muxedStream.timeline.close == null) {\n await muxedStream.close();\n }\n });\n }\n });\n newStream = async (protocols, options = {}) => {\n if (muxer == null) {\n throw new CodeError('Stream is not multiplexed', codes.ERR_MUXER_UNAVAILABLE);\n }\n connection.log('starting new stream for protocols %s', protocols);\n const muxedStream = await muxer.newStream();\n connection.log.trace('started new stream %s for protocols %s', muxedStream.id, protocols);\n try {\n if (options.signal == null) {\n muxedStream.log('no abort signal was passed while trying to negotiate protocols %s falling back to default timeout', protocols);\n const signal = AbortSignal.timeout(DEFAULT_PROTOCOL_SELECT_TIMEOUT);\n setMaxListeners(Infinity, signal);\n options = {\n ...options,\n signal\n };\n }\n muxedStream.log.trace('selecting protocol from protocols %s', protocols);\n const { stream, protocol } = await mss.select(muxedStream, protocols, {\n ...options,\n log: muxedStream.log,\n yieldBytes: true\n });\n muxedStream.log('selected protocol %s', protocol);\n const outgoingLimit = findOutgoingStreamLimit(protocol, this.components.registrar, options);\n const streamCount = countStreams(protocol, 'outbound', connection);\n if (streamCount >= outgoingLimit) {\n const err = new CodeError(`Too many outbound protocol streams for protocol \"${protocol}\" - ${streamCount}/${outgoingLimit}`, codes.ERR_TOO_MANY_OUTBOUND_PROTOCOL_STREAMS);\n muxedStream.abort(err);\n throw err;\n }\n // If a protocol stream has been successfully negotiated and is to be passed to the application,\n // the peerstore should ensure that the peer is registered with that protocol\n await this.components.peerStore.merge(remotePeer, {\n protocols: [protocol]\n });\n // after the handshake the returned stream can have early data so override\n // the souce/sink\n muxedStream.source = stream.source;\n muxedStream.sink = stream.sink;\n muxedStream.protocol = protocol;\n // allow closing the write end of a not-yet-negotiated stream\n if (stream.closeWrite != null) {\n muxedStream.closeWrite = stream.closeWrite;\n }\n // allow closing the read end of a not-yet-negotiated stream\n if (stream.closeRead != null) {\n muxedStream.closeRead = stream.closeRead;\n }\n // make sure we don't try to negotiate a stream we are closing\n if (stream.close != null) {\n muxedStream.close = stream.close;\n }\n this.components.metrics?.trackProtocolStream(muxedStream, connection);\n return muxedStream;\n }\n catch (err) {\n connection.log.error('could not create new stream for protocols %s', protocols, err);\n if (muxedStream.timeline.close == null) {\n muxedStream.abort(err);\n }\n if (err.code != null) {\n throw err;\n }\n throw new CodeError(String(err), codes.ERR_UNSUPPORTED_PROTOCOL);\n }\n };\n // Pipe all data through the muxer\n void Promise.all([\n muxer.sink(upgradedConn.source),\n upgradedConn.sink(muxer.source)\n ]).catch(err => {\n connection.log.error('error piping data through muxer', err);\n });\n }\n const _timeline = maConn.timeline;\n maConn.timeline = new Proxy(_timeline, {\n set: (...args) => {\n if (connection != null && args[1] === 'close' && args[2] != null && _timeline.close == null) {\n // Wait for close to finish before notifying of the closure\n (async () => {\n try {\n if (connection.status === 'open') {\n await connection.close();\n }\n }\n catch (err) {\n connection.log.error('error closing connection after timeline close', err);\n }\n finally {\n this.events.safeDispatchEvent('connection:close', {\n detail: connection\n });\n }\n })().catch(err => {\n connection.log.error('error thrown while dispatching connection:close event', err);\n });\n }\n return Reflect.set(...args);\n }\n });\n maConn.timeline.upgraded = Date.now();\n const errConnectionNotMultiplexed = () => {\n throw new CodeError('connection is not multiplexed', codes.ERR_CONNECTION_NOT_MULTIPLEXED);\n };\n // Create the connection\n connection = createConnection({\n remoteAddr: maConn.remoteAddr,\n remotePeer,\n status: 'open',\n direction,\n timeline: maConn.timeline,\n multiplexer: muxer?.protocol,\n encryption: cryptoProtocol,\n transient,\n logger: this.components.logger,\n newStream: newStream ?? errConnectionNotMultiplexed,\n getStreams: () => { if (muxer != null) {\n return muxer.streams;\n }\n else {\n return [];\n } },\n close: async (options) => {\n // Ensure remaining streams are closed gracefully\n if (muxer != null) {\n connection.log.trace('close muxer');\n await muxer.close(options);\n }\n connection.log.trace('close maconn');\n // close the underlying transport\n await maConn.close(options);\n connection.log.trace('closed maconn');\n },\n abort: (err) => {\n maConn.abort(err);\n // Ensure remaining streams are aborted\n if (muxer != null) {\n muxer.abort(err);\n }\n }\n });\n this.events.safeDispatchEvent('connection:open', {\n detail: connection\n });\n return connection;\n }\n /**\n * Routes incoming streams to the correct handler\n */\n _onStream(opts) {\n const { connection, stream, protocol } = opts;\n const { handler, options } = this.components.registrar.getHandler(protocol);\n if (connection.transient && options.runOnTransientConnection !== true) {\n throw new CodeError('Cannot open protocol stream on transient connection', 'ERR_TRANSIENT_CONNECTION');\n }\n handler({ connection, stream });\n }\n /**\n * Attempts to encrypt the incoming `connection` with the provided `cryptos`\n */\n async _encryptInbound(connection) {\n const protocols = Array.from(this.connectionEncryption.keys());\n connection.log('handling inbound crypto protocol selection', protocols);\n try {\n const { stream, protocol } = await mss.handle(connection, protocols, {\n log: connection.log\n });\n const encrypter = this.connectionEncryption.get(protocol);\n if (encrypter == null) {\n throw new Error(`no crypto module found for ${protocol}`);\n }\n connection.log('encrypting inbound connection using', protocol);\n return {\n ...await encrypter.secureInbound(this.components.peerId, stream),\n protocol\n };\n }\n catch (err) {\n connection.log.error('encrypting inbound connection failed', err);\n throw new CodeError(err.message, codes.ERR_ENCRYPTION_FAILED);\n }\n }\n /**\n * Attempts to encrypt the given `connection` with the provided connection encrypters.\n * The first `ConnectionEncrypter` module to succeed will be used\n */\n async _encryptOutbound(connection, remotePeerId) {\n const protocols = Array.from(this.connectionEncryption.keys());\n connection.log('selecting outbound crypto protocol', protocols);\n try {\n connection.log.trace('selecting encrypter from %s', protocols);\n const { stream, protocol } = await mss.select(connection, protocols, {\n log: connection.log,\n yieldBytes: true\n });\n const encrypter = this.connectionEncryption.get(protocol);\n if (encrypter == null) {\n throw new Error(`no crypto module found for ${protocol}`);\n }\n connection.log('encrypting outbound connection to %p using %s', remotePeerId, encrypter);\n return {\n ...await encrypter.secureOutbound(this.components.peerId, stream, remotePeerId),\n protocol\n };\n }\n catch (err) {\n connection.log.error('encrypting outbound connection to %p failed', remotePeerId, err);\n throw new CodeError(err.message, codes.ERR_ENCRYPTION_FAILED);\n }\n }\n /**\n * Selects one of the given muxers via multistream-select. That\n * muxer will be used for all future streams on the connection.\n */\n async _multiplexOutbound(connection, muxers) {\n const protocols = Array.from(muxers.keys());\n connection.log('outbound selecting muxer %s', protocols);\n try {\n connection.log.trace('selecting stream muxer from %s', protocols);\n const { stream, protocol } = await mss.select(connection, protocols, {\n log: connection.log,\n yieldBytes: true\n });\n connection.log('selected %s as muxer protocol', protocol);\n const muxerFactory = muxers.get(protocol);\n return { stream, muxerFactory };\n }\n catch (err) {\n connection.log.error('error multiplexing outbound connection', err);\n throw new CodeError(String(err), codes.ERR_MUXER_UNAVAILABLE);\n }\n }\n /**\n * Registers support for one of the given muxers via multistream-select. The\n * selected muxer will be used for all future streams on the connection.\n */\n async _multiplexInbound(connection, muxers) {\n const protocols = Array.from(muxers.keys());\n connection.log('inbound handling muxers %s', protocols);\n try {\n const { stream, protocol } = await mss.handle(connection, protocols, {\n log: connection.log\n });\n const muxerFactory = muxers.get(protocol);\n return { stream, muxerFactory };\n }\n catch (err) {\n connection.log.error('error multiplexing inbound connection', err);\n throw new CodeError(String(err), codes.ERR_MUXER_UNAVAILABLE);\n }\n }\n}\n//# sourceMappingURL=upgrader.js.map","import { unmarshalPrivateKey, unmarshalPublicKey } from '@libp2p/crypto/keys';\nimport { contentRoutingSymbol, CodeError, TypedEventEmitter, CustomEvent, setMaxListeners, peerDiscoverySymbol, peerRoutingSymbol } from '@libp2p/interface';\nimport { defaultLogger } from '@libp2p/logger';\nimport { PeerSet } from '@libp2p/peer-collections';\nimport { peerIdFromString } from '@libp2p/peer-id';\nimport { createEd25519PeerId } from '@libp2p/peer-id-factory';\nimport { PersistentPeerStore } from '@libp2p/peer-store';\nimport { isMultiaddr } from '@multiformats/multiaddr';\nimport { MemoryDatastore } from 'datastore-core/memory';\nimport { concat as uint8ArrayConcat } from 'uint8arrays/concat';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport { DefaultAddressManager } from './address-manager/index.js';\nimport { checkServiceDependencies, defaultComponents } from './components.js';\nimport { connectionGater } from './config/connection-gater.js';\nimport { validateConfig } from './config.js';\nimport { DefaultConnectionManager } from './connection-manager/index.js';\nimport { ConnectionMonitor } from './connection-monitor.js';\nimport { CompoundContentRouting } from './content-routing.js';\nimport { codes } from './errors.js';\nimport { DefaultPeerRouting } from './peer-routing.js';\nimport { RandomWalk } from './random-walk.js';\nimport { DefaultRegistrar } from './registrar.js';\nimport { DefaultTransportManager } from './transport-manager.js';\nimport { DefaultUpgrader } from './upgrader.js';\nimport * as pkg from './version.js';\nexport class Libp2pNode extends TypedEventEmitter {\n peerId;\n peerStore;\n contentRouting;\n peerRouting;\n metrics;\n services;\n logger;\n status;\n components;\n log;\n constructor(init) {\n super();\n this.status = 'stopped';\n // event bus - components can listen to this emitter to be notified of system events\n // and also cause them to be emitted\n const events = new TypedEventEmitter();\n const originalDispatch = events.dispatchEvent.bind(events);\n events.dispatchEvent = (evt) => {\n const internalResult = originalDispatch(evt);\n const externalResult = this.dispatchEvent(new CustomEvent(evt.type, { detail: evt.detail }));\n return internalResult || externalResult;\n };\n // This emitter gets listened to a lot\n setMaxListeners(Infinity, events);\n this.peerId = init.peerId;\n this.logger = init.logger ?? defaultLogger();\n this.log = this.logger.forComponent('libp2p');\n // @ts-expect-error {} may not be of type T\n this.services = {};\n // @ts-expect-error defaultComponents is missing component types added later\n const components = this.components = defaultComponents({\n peerId: init.peerId,\n privateKey: init.privateKey,\n nodeInfo: init.nodeInfo ?? {\n name: pkg.name,\n version: pkg.version\n },\n logger: this.logger,\n events,\n datastore: init.datastore ?? new MemoryDatastore(),\n connectionGater: connectionGater(init.connectionGater),\n dns: init.dns\n });\n this.peerStore = this.configureComponent('peerStore', new PersistentPeerStore(components, {\n addressFilter: this.components.connectionGater.filterMultiaddrForPeer,\n ...init.peerStore\n }));\n // Create Metrics\n if (init.metrics != null) {\n this.metrics = this.configureComponent('metrics', init.metrics(this.components));\n }\n components.events.addEventListener('peer:update', evt => {\n // if there was no peer previously in the peer store this is a new peer\n if (evt.detail.previous == null) {\n const peerInfo = {\n id: evt.detail.peer.id,\n multiaddrs: evt.detail.peer.addresses.map(a => a.multiaddr)\n };\n components.events.safeDispatchEvent('peer:discovery', { detail: peerInfo });\n }\n });\n // Set up connection protector if configured\n if (init.connectionProtector != null) {\n this.configureComponent('connectionProtector', init.connectionProtector(components));\n }\n // Set up the Upgrader\n this.components.upgrader = new DefaultUpgrader(this.components, {\n connectionEncryption: (init.connectionEncryption ?? []).map((fn, index) => this.configureComponent(`connection-encryption-${index}`, fn(this.components))),\n muxers: (init.streamMuxers ?? []).map((fn, index) => this.configureComponent(`stream-muxers-${index}`, fn(this.components))),\n inboundUpgradeTimeout: init.connectionManager?.inboundUpgradeTimeout\n });\n // Setup the transport manager\n this.configureComponent('transportManager', new DefaultTransportManager(this.components, init.transportManager));\n // Create the Connection Manager\n this.configureComponent('connectionManager', new DefaultConnectionManager(this.components, init.connectionManager));\n if (init.connectionMonitor?.enabled !== false) {\n // Create the Connection Monitor if not disabled\n this.configureComponent('connectionMonitor', new ConnectionMonitor(this.components, init.connectionMonitor));\n }\n // Create the Registrar\n this.configureComponent('registrar', new DefaultRegistrar(this.components));\n // Addresses {listen, announce, noAnnounce}\n this.configureComponent('addressManager', new DefaultAddressManager(this.components, init.addresses));\n // Peer routers\n const peerRouters = (init.peerRouters ?? []).map((fn, index) => this.configureComponent(`peer-router-${index}`, fn(this.components)));\n this.peerRouting = this.components.peerRouting = this.configureComponent('peerRouting', new DefaultPeerRouting(this.components, {\n routers: peerRouters\n }));\n // Content routers\n const contentRouters = (init.contentRouters ?? []).map((fn, index) => this.configureComponent(`content-router-${index}`, fn(this.components)));\n this.contentRouting = this.components.contentRouting = this.configureComponent('contentRouting', new CompoundContentRouting(this.components, {\n routers: contentRouters\n }));\n // Random walk\n this.configureComponent('randomWalk', new RandomWalk(this.components));\n (init.peerDiscovery ?? []).forEach((fn, index) => {\n const service = this.configureComponent(`peer-discovery-${index}`, fn(this.components));\n service.addEventListener('peer', (evt) => {\n this.#onDiscoveryPeer(evt);\n });\n });\n // Transport modules\n init.transports?.forEach((fn, index) => {\n this.components.transportManager.add(this.configureComponent(`transport-${index}`, fn(this.components)));\n });\n // User defined modules\n if (init.services != null) {\n for (const name of Object.keys(init.services)) {\n const createService = init.services[name];\n const service = createService(this.components);\n if (service == null) {\n this.log.error('service factory %s returned null or undefined instance', name);\n continue;\n }\n this.services[name] = service;\n this.configureComponent(name, service);\n if (service[contentRoutingSymbol] != null) {\n this.log('registering service %s for content routing', name);\n contentRouters.push(service[contentRoutingSymbol]);\n }\n if (service[peerRoutingSymbol] != null) {\n this.log('registering service %s for peer routing', name);\n peerRouters.push(service[peerRoutingSymbol]);\n }\n if (service[peerDiscoverySymbol] != null) {\n this.log('registering service %s for peer discovery', name);\n service[peerDiscoverySymbol].addEventListener?.('peer', (evt) => {\n this.#onDiscoveryPeer(evt);\n });\n }\n }\n }\n // Ensure all services have their required dependencies\n checkServiceDependencies(components);\n }\n configureComponent(name, component) {\n if (component == null) {\n this.log.error('component %s was null or undefined', name);\n }\n // @ts-expect-error cannot assign props\n this.components[name] = component;\n return component;\n }\n /**\n * Starts the libp2p node and all its subsystems\n */\n async start() {\n if (this.status !== 'stopped') {\n return;\n }\n this.status = 'starting';\n this.log('libp2p is starting');\n try {\n await this.components.beforeStart?.();\n await this.components.start();\n await this.components.afterStart?.();\n this.status = 'started';\n this.safeDispatchEvent('start', { detail: this });\n this.log('libp2p has started');\n }\n catch (err) {\n this.log.error('An error occurred starting libp2p', err);\n // set status to 'started' so this.stop() will stop any running components\n this.status = 'started';\n await this.stop();\n throw err;\n }\n }\n /**\n * Stop the libp2p node by closing its listeners and open connections\n */\n async stop() {\n if (this.status !== 'started') {\n return;\n }\n this.log('libp2p is stopping');\n this.status = 'stopping';\n await this.components.beforeStop?.();\n await this.components.stop();\n await this.components.afterStop?.();\n this.status = 'stopped';\n this.safeDispatchEvent('stop', { detail: this });\n this.log('libp2p has stopped');\n }\n getConnections(peerId) {\n return this.components.connectionManager.getConnections(peerId);\n }\n getDialQueue() {\n return this.components.connectionManager.getDialQueue();\n }\n getPeers() {\n const peerSet = new PeerSet();\n for (const conn of this.components.connectionManager.getConnections()) {\n peerSet.add(conn.remotePeer);\n }\n return Array.from(peerSet);\n }\n async dial(peer, options = {}) {\n return this.components.connectionManager.openConnection(peer, {\n // ensure any userland dials take top priority in the queue\n priority: 75,\n ...options\n });\n }\n async dialProtocol(peer, protocols, options = {}) {\n if (protocols == null) {\n throw new CodeError('no protocols were provided to open a stream', codes.ERR_INVALID_PROTOCOLS_FOR_STREAM);\n }\n protocols = Array.isArray(protocols) ? protocols : [protocols];\n if (protocols.length === 0) {\n throw new CodeError('no protocols were provided to open a stream', codes.ERR_INVALID_PROTOCOLS_FOR_STREAM);\n }\n const connection = await this.dial(peer, options);\n return connection.newStream(protocols, options);\n }\n getMultiaddrs() {\n return this.components.addressManager.getAddresses();\n }\n getProtocols() {\n return this.components.registrar.getProtocols();\n }\n async hangUp(peer, options = {}) {\n if (isMultiaddr(peer)) {\n peer = peerIdFromString(peer.getPeerId() ?? '');\n }\n await this.components.connectionManager.closeConnections(peer, options);\n }\n /**\n * Get the public key for the given peer id\n */\n async getPublicKey(peer, options = {}) {\n this.log('getPublicKey %p', peer);\n if (peer.publicKey != null) {\n return peer.publicKey;\n }\n try {\n const peerInfo = await this.peerStore.get(peer);\n if (peerInfo.id.publicKey != null) {\n return peerInfo.id.publicKey;\n }\n }\n catch (err) {\n if (err.code !== codes.ERR_NOT_FOUND) {\n throw err;\n }\n }\n const peerKey = uint8ArrayConcat([\n uint8ArrayFromString('/pk/'),\n peer.multihash.digest\n ]);\n // search any available content routing methods\n const bytes = await this.contentRouting.get(peerKey, options);\n // ensure the returned key is valid\n unmarshalPublicKey(bytes);\n await this.peerStore.patch(peer, {\n publicKey: bytes\n });\n return bytes;\n }\n async handle(protocols, handler, options) {\n if (!Array.isArray(protocols)) {\n protocols = [protocols];\n }\n await Promise.all(protocols.map(async (protocol) => {\n await this.components.registrar.handle(protocol, handler, options);\n }));\n }\n async unhandle(protocols) {\n if (!Array.isArray(protocols)) {\n protocols = [protocols];\n }\n await Promise.all(protocols.map(async (protocol) => {\n await this.components.registrar.unhandle(protocol);\n }));\n }\n async register(protocol, topology) {\n return this.components.registrar.register(protocol, topology);\n }\n unregister(id) {\n this.components.registrar.unregister(id);\n }\n async isDialable(multiaddr, options = {}) {\n return this.components.connectionManager.isDialable(multiaddr, options);\n }\n /**\n * Called whenever peer discovery services emit `peer` events and adds peers\n * to the peer store.\n */\n #onDiscoveryPeer(evt) {\n const { detail: peer } = evt;\n if (peer.id.toString() === this.peerId.toString()) {\n this.log.error(new Error(codes.ERR_DISCOVERED_SELF));\n return;\n }\n void this.components.peerStore.merge(peer.id, {\n multiaddrs: peer.multiaddrs\n })\n .catch(err => { this.log.error(err); });\n }\n}\n/**\n * Returns a new Libp2pNode instance - this exposes more of the internals than the\n * libp2p interface and is useful for testing and debugging.\n */\nexport async function createLibp2pNode(options = {}) {\n const peerId = options.peerId ??= await createEd25519PeerId();\n if (peerId.privateKey == null) {\n throw new CodeError('peer id was missing private key', 'ERR_MISSING_PRIVATE_KEY');\n }\n options.privateKey ??= await unmarshalPrivateKey(peerId.privateKey);\n return new Libp2pNode(await validateConfig(options));\n}\n//# sourceMappingURL=libp2p.js.map","export const version = '1.9.4';\nexport const name = 'libp2p';\n//# sourceMappingURL=version.js.map","/**\n * The ENR tree for the different fleets.\n * SANDBOX and TEST fleets are for The Waku Network.\n */\nexport const enrTree = {\n SANDBOX: \"enrtree://AIRVQ5DDA4FFWLRBCHJWUWOO6X6S4ZTZ5B667LQ6AJU6PEYDLRD5O@sandbox.waku.nodes.status.im\",\n TEST: \"enrtree://AOGYWMBYOUIMOENHXCHILPKY3ZRFEULMFI4DOM442QSZ73TT2A7VI@test.waku.nodes.status.im\"\n};\nexport const DEFAULT_BOOTSTRAP_TAG_NAME = \"bootstrap\";\nexport const DEFAULT_BOOTSTRAP_TAG_VALUE = 50;\nexport const DEFAULT_BOOTSTRAP_TAG_TTL = 100_000_000;\nexport const DEFAULT_NODE_REQUIREMENTS = {\n store: 1,\n filter: 2,\n lightPush: 2\n};\n//# sourceMappingURL=constants.js.map","/*! noble-secp256k1 - MIT License (c) 2019 Paul Miller (paulmillr.com) */\nimport * as nodeCrypto from 'crypto';\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\nconst _2n = BigInt(2);\nconst _3n = BigInt(3);\nconst _8n = BigInt(8);\nconst CURVE = Object.freeze({\n a: _0n,\n b: BigInt(7),\n P: BigInt('0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f'),\n n: BigInt('0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141'),\n h: _1n,\n Gx: BigInt('55066263022277343669578718895168534326250603453777594175500187360389116729240'),\n Gy: BigInt('32670510020758816978083085130507043184471273380659243275938904335757337482424'),\n beta: BigInt('0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee'),\n});\nconst divNearest = (a, b) => (a + b / _2n) / b;\nconst endo = {\n beta: BigInt('0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee'),\n splitScalar(k) {\n const { n } = CURVE;\n const a1 = BigInt('0x3086d221a7d46bcde86c90e49284eb15');\n const b1 = -_1n * BigInt('0xe4437ed6010e88286f547fa90abfe4c3');\n const a2 = BigInt('0x114ca50f7a8e2f3f657c1108d9d44cfd8');\n const b2 = a1;\n const POW_2_128 = BigInt('0x100000000000000000000000000000000');\n const c1 = divNearest(b2 * k, n);\n const c2 = divNearest(-b1 * k, n);\n let k1 = mod(k - c1 * a1 - c2 * a2, n);\n let k2 = mod(-c1 * b1 - c2 * b2, n);\n const k1neg = k1 > POW_2_128;\n const k2neg = k2 > POW_2_128;\n if (k1neg)\n k1 = n - k1;\n if (k2neg)\n k2 = n - k2;\n if (k1 > POW_2_128 || k2 > POW_2_128) {\n throw new Error('splitScalarEndo: Endomorphism failed, k=' + k);\n }\n return { k1neg, k1, k2neg, k2 };\n },\n};\nconst fieldLen = 32;\nconst groupLen = 32;\nconst hashLen = 32;\nconst compressedLen = fieldLen + 1;\nconst uncompressedLen = 2 * fieldLen + 1;\nexport { CURVE };\nfunction weierstrass(x) {\n const { a, b } = CURVE;\n const x2 = mod(x * x);\n const x3 = mod(x2 * x);\n return mod(x3 + a * x + b);\n}\nconst USE_ENDOMORPHISM = CURVE.a === _0n;\nclass ShaError extends Error {\n constructor(message) {\n super(message);\n }\n}\nfunction assertJacPoint(other) {\n if (!(other instanceof JacobianPoint))\n throw new TypeError('JacobianPoint expected');\n}\nclass JacobianPoint {\n constructor(x, y, z) {\n this.x = x;\n this.y = y;\n this.z = z;\n }\n static fromAffine(p) {\n if (!(p instanceof Point)) {\n throw new TypeError('JacobianPoint#fromAffine: expected Point');\n }\n if (p.equals(Point.ZERO))\n return JacobianPoint.ZERO;\n return new JacobianPoint(p.x, p.y, _1n);\n }\n static toAffineBatch(points) {\n const toInv = invertBatch(points.map((p) => p.z));\n return points.map((p, i) => p.toAffine(toInv[i]));\n }\n static normalizeZ(points) {\n return JacobianPoint.toAffineBatch(points).map(JacobianPoint.fromAffine);\n }\n equals(other) {\n assertJacPoint(other);\n const { x: X1, y: Y1, z: Z1 } = this;\n const { x: X2, y: Y2, z: Z2 } = other;\n const Z1Z1 = mod(Z1 * Z1);\n const Z2Z2 = mod(Z2 * Z2);\n const U1 = mod(X1 * Z2Z2);\n const U2 = mod(X2 * Z1Z1);\n const S1 = mod(mod(Y1 * Z2) * Z2Z2);\n const S2 = mod(mod(Y2 * Z1) * Z1Z1);\n return U1 === U2 && S1 === S2;\n }\n negate() {\n return new JacobianPoint(this.x, mod(-this.y), this.z);\n }\n double() {\n const { x: X1, y: Y1, z: Z1 } = this;\n const A = mod(X1 * X1);\n const B = mod(Y1 * Y1);\n const C = mod(B * B);\n const x1b = X1 + B;\n const D = mod(_2n * (mod(x1b * x1b) - A - C));\n const E = mod(_3n * A);\n const F = mod(E * E);\n const X3 = mod(F - _2n * D);\n const Y3 = mod(E * (D - X3) - _8n * C);\n const Z3 = mod(_2n * Y1 * Z1);\n return new JacobianPoint(X3, Y3, Z3);\n }\n add(other) {\n assertJacPoint(other);\n const { x: X1, y: Y1, z: Z1 } = this;\n const { x: X2, y: Y2, z: Z2 } = other;\n if (X2 === _0n || Y2 === _0n)\n return this;\n if (X1 === _0n || Y1 === _0n)\n return other;\n const Z1Z1 = mod(Z1 * Z1);\n const Z2Z2 = mod(Z2 * Z2);\n const U1 = mod(X1 * Z2Z2);\n const U2 = mod(X2 * Z1Z1);\n const S1 = mod(mod(Y1 * Z2) * Z2Z2);\n const S2 = mod(mod(Y2 * Z1) * Z1Z1);\n const H = mod(U2 - U1);\n const r = mod(S2 - S1);\n if (H === _0n) {\n if (r === _0n) {\n return this.double();\n }\n else {\n return JacobianPoint.ZERO;\n }\n }\n const HH = mod(H * H);\n const HHH = mod(H * HH);\n const V = mod(U1 * HH);\n const X3 = mod(r * r - HHH - _2n * V);\n const Y3 = mod(r * (V - X3) - S1 * HHH);\n const Z3 = mod(Z1 * Z2 * H);\n return new JacobianPoint(X3, Y3, Z3);\n }\n subtract(other) {\n return this.add(other.negate());\n }\n multiplyUnsafe(scalar) {\n const P0 = JacobianPoint.ZERO;\n if (typeof scalar === 'bigint' && scalar === _0n)\n return P0;\n let n = normalizeScalar(scalar);\n if (n === _1n)\n return this;\n if (!USE_ENDOMORPHISM) {\n let p = P0;\n let d = this;\n while (n > _0n) {\n if (n & _1n)\n p = p.add(d);\n d = d.double();\n n >>= _1n;\n }\n return p;\n }\n let { k1neg, k1, k2neg, k2 } = endo.splitScalar(n);\n let k1p = P0;\n let k2p = P0;\n let d = this;\n while (k1 > _0n || k2 > _0n) {\n if (k1 & _1n)\n k1p = k1p.add(d);\n if (k2 & _1n)\n k2p = k2p.add(d);\n d = d.double();\n k1 >>= _1n;\n k2 >>= _1n;\n }\n if (k1neg)\n k1p = k1p.negate();\n if (k2neg)\n k2p = k2p.negate();\n k2p = new JacobianPoint(mod(k2p.x * endo.beta), k2p.y, k2p.z);\n return k1p.add(k2p);\n }\n precomputeWindow(W) {\n const windows = USE_ENDOMORPHISM ? 128 / W + 1 : 256 / W + 1;\n const points = [];\n let p = this;\n let base = p;\n for (let window = 0; window < windows; window++) {\n base = p;\n points.push(base);\n for (let i = 1; i < 2 ** (W - 1); i++) {\n base = base.add(p);\n points.push(base);\n }\n p = base.double();\n }\n return points;\n }\n wNAF(n, affinePoint) {\n if (!affinePoint && this.equals(JacobianPoint.BASE))\n affinePoint = Point.BASE;\n const W = (affinePoint && affinePoint._WINDOW_SIZE) || 1;\n if (256 % W) {\n throw new Error('Point#wNAF: Invalid precomputation window, must be power of 2');\n }\n let precomputes = affinePoint && pointPrecomputes.get(affinePoint);\n if (!precomputes) {\n precomputes = this.precomputeWindow(W);\n if (affinePoint && W !== 1) {\n precomputes = JacobianPoint.normalizeZ(precomputes);\n pointPrecomputes.set(affinePoint, precomputes);\n }\n }\n let p = JacobianPoint.ZERO;\n let f = JacobianPoint.BASE;\n const windows = 1 + (USE_ENDOMORPHISM ? 128 / W : 256 / W);\n const windowSize = 2 ** (W - 1);\n const mask = BigInt(2 ** W - 1);\n const maxNumber = 2 ** W;\n const shiftBy = BigInt(W);\n for (let window = 0; window < windows; window++) {\n const offset = window * windowSize;\n let wbits = Number(n & mask);\n n >>= shiftBy;\n if (wbits > windowSize) {\n wbits -= maxNumber;\n n += _1n;\n }\n const offset1 = offset;\n const offset2 = offset + Math.abs(wbits) - 1;\n const cond1 = window % 2 !== 0;\n const cond2 = wbits < 0;\n if (wbits === 0) {\n f = f.add(constTimeNegate(cond1, precomputes[offset1]));\n }\n else {\n p = p.add(constTimeNegate(cond2, precomputes[offset2]));\n }\n }\n return { p, f };\n }\n multiply(scalar, affinePoint) {\n let n = normalizeScalar(scalar);\n let point;\n let fake;\n if (USE_ENDOMORPHISM) {\n const { k1neg, k1, k2neg, k2 } = endo.splitScalar(n);\n let { p: k1p, f: f1p } = this.wNAF(k1, affinePoint);\n let { p: k2p, f: f2p } = this.wNAF(k2, affinePoint);\n k1p = constTimeNegate(k1neg, k1p);\n k2p = constTimeNegate(k2neg, k2p);\n k2p = new JacobianPoint(mod(k2p.x * endo.beta), k2p.y, k2p.z);\n point = k1p.add(k2p);\n fake = f1p.add(f2p);\n }\n else {\n const { p, f } = this.wNAF(n, affinePoint);\n point = p;\n fake = f;\n }\n return JacobianPoint.normalizeZ([point, fake])[0];\n }\n toAffine(invZ) {\n const { x, y, z } = this;\n const is0 = this.equals(JacobianPoint.ZERO);\n if (invZ == null)\n invZ = is0 ? _8n : invert(z);\n const iz1 = invZ;\n const iz2 = mod(iz1 * iz1);\n const iz3 = mod(iz2 * iz1);\n const ax = mod(x * iz2);\n const ay = mod(y * iz3);\n const zz = mod(z * iz1);\n if (is0)\n return Point.ZERO;\n if (zz !== _1n)\n throw new Error('invZ was invalid');\n return new Point(ax, ay);\n }\n}\nJacobianPoint.BASE = new JacobianPoint(CURVE.Gx, CURVE.Gy, _1n);\nJacobianPoint.ZERO = new JacobianPoint(_0n, _1n, _0n);\nfunction constTimeNegate(condition, item) {\n const neg = item.negate();\n return condition ? neg : item;\n}\nconst pointPrecomputes = new WeakMap();\nexport class Point {\n constructor(x, y) {\n this.x = x;\n this.y = y;\n }\n _setWindowSize(windowSize) {\n this._WINDOW_SIZE = windowSize;\n pointPrecomputes.delete(this);\n }\n hasEvenY() {\n return this.y % _2n === _0n;\n }\n static fromCompressedHex(bytes) {\n const isShort = bytes.length === 32;\n const x = bytesToNumber(isShort ? bytes : bytes.subarray(1));\n if (!isValidFieldElement(x))\n throw new Error('Point is not on curve');\n const y2 = weierstrass(x);\n let y = sqrtMod(y2);\n const isYOdd = (y & _1n) === _1n;\n if (isShort) {\n if (isYOdd)\n y = mod(-y);\n }\n else {\n const isFirstByteOdd = (bytes[0] & 1) === 1;\n if (isFirstByteOdd !== isYOdd)\n y = mod(-y);\n }\n const point = new Point(x, y);\n point.assertValidity();\n return point;\n }\n static fromUncompressedHex(bytes) {\n const x = bytesToNumber(bytes.subarray(1, fieldLen + 1));\n const y = bytesToNumber(bytes.subarray(fieldLen + 1, fieldLen * 2 + 1));\n const point = new Point(x, y);\n point.assertValidity();\n return point;\n }\n static fromHex(hex) {\n const bytes = ensureBytes(hex);\n const len = bytes.length;\n const header = bytes[0];\n if (len === fieldLen)\n return this.fromCompressedHex(bytes);\n if (len === compressedLen && (header === 0x02 || header === 0x03)) {\n return this.fromCompressedHex(bytes);\n }\n if (len === uncompressedLen && header === 0x04)\n return this.fromUncompressedHex(bytes);\n throw new Error(`Point.fromHex: received invalid point. Expected 32-${compressedLen} compressed bytes or ${uncompressedLen} uncompressed bytes, not ${len}`);\n }\n static fromPrivateKey(privateKey) {\n return Point.BASE.multiply(normalizePrivateKey(privateKey));\n }\n static fromSignature(msgHash, signature, recovery) {\n const { r, s } = normalizeSignature(signature);\n if (![0, 1, 2, 3].includes(recovery))\n throw new Error('Cannot recover: invalid recovery bit');\n const h = truncateHash(ensureBytes(msgHash));\n const { n } = CURVE;\n const radj = recovery === 2 || recovery === 3 ? r + n : r;\n const rinv = invert(radj, n);\n const u1 = mod(-h * rinv, n);\n const u2 = mod(s * rinv, n);\n const prefix = recovery & 1 ? '03' : '02';\n const R = Point.fromHex(prefix + numTo32bStr(radj));\n const Q = Point.BASE.multiplyAndAddUnsafe(R, u1, u2);\n if (!Q)\n throw new Error('Cannot recover signature: point at infinify');\n Q.assertValidity();\n return Q;\n }\n toRawBytes(isCompressed = false) {\n return hexToBytes(this.toHex(isCompressed));\n }\n toHex(isCompressed = false) {\n const x = numTo32bStr(this.x);\n if (isCompressed) {\n const prefix = this.hasEvenY() ? '02' : '03';\n return `${prefix}${x}`;\n }\n else {\n return `04${x}${numTo32bStr(this.y)}`;\n }\n }\n toHexX() {\n return this.toHex(true).slice(2);\n }\n toRawX() {\n return this.toRawBytes(true).slice(1);\n }\n assertValidity() {\n const msg = 'Point is not on elliptic curve';\n const { x, y } = this;\n if (!isValidFieldElement(x) || !isValidFieldElement(y))\n throw new Error(msg);\n const left = mod(y * y);\n const right = weierstrass(x);\n if (mod(left - right) !== _0n)\n throw new Error(msg);\n }\n equals(other) {\n return this.x === other.x && this.y === other.y;\n }\n negate() {\n return new Point(this.x, mod(-this.y));\n }\n double() {\n return JacobianPoint.fromAffine(this).double().toAffine();\n }\n add(other) {\n return JacobianPoint.fromAffine(this).add(JacobianPoint.fromAffine(other)).toAffine();\n }\n subtract(other) {\n return this.add(other.negate());\n }\n multiply(scalar) {\n return JacobianPoint.fromAffine(this).multiply(scalar, this).toAffine();\n }\n multiplyAndAddUnsafe(Q, a, b) {\n const P = JacobianPoint.fromAffine(this);\n const aP = a === _0n || a === _1n || this !== Point.BASE ? P.multiplyUnsafe(a) : P.multiply(a);\n const bQ = JacobianPoint.fromAffine(Q).multiplyUnsafe(b);\n const sum = aP.add(bQ);\n return sum.equals(JacobianPoint.ZERO) ? undefined : sum.toAffine();\n }\n}\nPoint.BASE = new Point(CURVE.Gx, CURVE.Gy);\nPoint.ZERO = new Point(_0n, _0n);\nfunction sliceDER(s) {\n return Number.parseInt(s[0], 16) >= 8 ? '00' + s : s;\n}\nfunction parseDERInt(data) {\n if (data.length < 2 || data[0] !== 0x02) {\n throw new Error(`Invalid signature integer tag: ${bytesToHex(data)}`);\n }\n const len = data[1];\n const res = data.subarray(2, len + 2);\n if (!len || res.length !== len) {\n throw new Error(`Invalid signature integer: wrong length`);\n }\n if (res[0] === 0x00 && res[1] <= 0x7f) {\n throw new Error('Invalid signature integer: trailing length');\n }\n return { data: bytesToNumber(res), left: data.subarray(len + 2) };\n}\nfunction parseDERSignature(data) {\n if (data.length < 2 || data[0] != 0x30) {\n throw new Error(`Invalid signature tag: ${bytesToHex(data)}`);\n }\n if (data[1] !== data.length - 2) {\n throw new Error('Invalid signature: incorrect length');\n }\n const { data: r, left: sBytes } = parseDERInt(data.subarray(2));\n const { data: s, left: rBytesLeft } = parseDERInt(sBytes);\n if (rBytesLeft.length) {\n throw new Error(`Invalid signature: left bytes after parsing: ${bytesToHex(rBytesLeft)}`);\n }\n return { r, s };\n}\nexport class Signature {\n constructor(r, s) {\n this.r = r;\n this.s = s;\n this.assertValidity();\n }\n static fromCompact(hex) {\n const arr = hex instanceof Uint8Array;\n const name = 'Signature.fromCompact';\n if (typeof hex !== 'string' && !arr)\n throw new TypeError(`${name}: Expected string or Uint8Array`);\n const str = arr ? bytesToHex(hex) : hex;\n if (str.length !== 128)\n throw new Error(`${name}: Expected 64-byte hex`);\n return new Signature(hexToNumber(str.slice(0, 64)), hexToNumber(str.slice(64, 128)));\n }\n static fromDER(hex) {\n const arr = hex instanceof Uint8Array;\n if (typeof hex !== 'string' && !arr)\n throw new TypeError(`Signature.fromDER: Expected string or Uint8Array`);\n const { r, s } = parseDERSignature(arr ? hex : hexToBytes(hex));\n return new Signature(r, s);\n }\n static fromHex(hex) {\n return this.fromDER(hex);\n }\n assertValidity() {\n const { r, s } = this;\n if (!isWithinCurveOrder(r))\n throw new Error('Invalid Signature: r must be 0 < r < n');\n if (!isWithinCurveOrder(s))\n throw new Error('Invalid Signature: s must be 0 < s < n');\n }\n hasHighS() {\n const HALF = CURVE.n >> _1n;\n return this.s > HALF;\n }\n normalizeS() {\n return this.hasHighS() ? new Signature(this.r, mod(-this.s, CURVE.n)) : this;\n }\n toDERRawBytes() {\n return hexToBytes(this.toDERHex());\n }\n toDERHex() {\n const sHex = sliceDER(numberToHexUnpadded(this.s));\n const rHex = sliceDER(numberToHexUnpadded(this.r));\n const sHexL = sHex.length / 2;\n const rHexL = rHex.length / 2;\n const sLen = numberToHexUnpadded(sHexL);\n const rLen = numberToHexUnpadded(rHexL);\n const length = numberToHexUnpadded(rHexL + sHexL + 4);\n return `30${length}02${rLen}${rHex}02${sLen}${sHex}`;\n }\n toRawBytes() {\n return this.toDERRawBytes();\n }\n toHex() {\n return this.toDERHex();\n }\n toCompactRawBytes() {\n return hexToBytes(this.toCompactHex());\n }\n toCompactHex() {\n return numTo32bStr(this.r) + numTo32bStr(this.s);\n }\n}\nfunction concatBytes(...arrays) {\n if (!arrays.every((b) => b instanceof Uint8Array))\n throw new Error('Uint8Array list expected');\n if (arrays.length === 1)\n return arrays[0];\n const length = arrays.reduce((a, arr) => a + arr.length, 0);\n const result = new Uint8Array(length);\n for (let i = 0, pad = 0; i < arrays.length; i++) {\n const arr = arrays[i];\n result.set(arr, pad);\n pad += arr.length;\n }\n return result;\n}\nconst hexes = Array.from({ length: 256 }, (v, i) => i.toString(16).padStart(2, '0'));\nfunction bytesToHex(uint8a) {\n if (!(uint8a instanceof Uint8Array))\n throw new Error('Expected Uint8Array');\n let hex = '';\n for (let i = 0; i < uint8a.length; i++) {\n hex += hexes[uint8a[i]];\n }\n return hex;\n}\nconst POW_2_256 = BigInt('0x10000000000000000000000000000000000000000000000000000000000000000');\nfunction numTo32bStr(num) {\n if (typeof num !== 'bigint')\n throw new Error('Expected bigint');\n if (!(_0n <= num && num < POW_2_256))\n throw new Error('Expected number 0 <= n < 2^256');\n return num.toString(16).padStart(64, '0');\n}\nfunction numTo32b(num) {\n const b = hexToBytes(numTo32bStr(num));\n if (b.length !== 32)\n throw new Error('Error: expected 32 bytes');\n return b;\n}\nfunction numberToHexUnpadded(num) {\n const hex = num.toString(16);\n return hex.length & 1 ? `0${hex}` : hex;\n}\nfunction hexToNumber(hex) {\n if (typeof hex !== 'string') {\n throw new TypeError('hexToNumber: expected string, got ' + typeof hex);\n }\n return BigInt(`0x${hex}`);\n}\nfunction hexToBytes(hex) {\n if (typeof hex !== 'string') {\n throw new TypeError('hexToBytes: expected string, got ' + typeof hex);\n }\n if (hex.length % 2)\n throw new Error('hexToBytes: received invalid unpadded hex' + hex.length);\n const array = new Uint8Array(hex.length / 2);\n for (let i = 0; i < array.length; i++) {\n const j = i * 2;\n const hexByte = hex.slice(j, j + 2);\n const byte = Number.parseInt(hexByte, 16);\n if (Number.isNaN(byte) || byte < 0)\n throw new Error('Invalid byte sequence');\n array[i] = byte;\n }\n return array;\n}\nfunction bytesToNumber(bytes) {\n return hexToNumber(bytesToHex(bytes));\n}\nfunction ensureBytes(hex) {\n return hex instanceof Uint8Array ? Uint8Array.from(hex) : hexToBytes(hex);\n}\nfunction normalizeScalar(num) {\n if (typeof num === 'number' && Number.isSafeInteger(num) && num > 0)\n return BigInt(num);\n if (typeof num === 'bigint' && isWithinCurveOrder(num))\n return num;\n throw new TypeError('Expected valid private scalar: 0 < scalar < curve.n');\n}\nfunction mod(a, b = CURVE.P) {\n const result = a % b;\n return result >= _0n ? result : b + result;\n}\nfunction pow2(x, power) {\n const { P } = CURVE;\n let res = x;\n while (power-- > _0n) {\n res *= res;\n res %= P;\n }\n return res;\n}\nfunction sqrtMod(x) {\n const { P } = CURVE;\n const _6n = BigInt(6);\n const _11n = BigInt(11);\n const _22n = BigInt(22);\n const _23n = BigInt(23);\n const _44n = BigInt(44);\n const _88n = BigInt(88);\n const b2 = (x * x * x) % P;\n const b3 = (b2 * b2 * x) % P;\n const b6 = (pow2(b3, _3n) * b3) % P;\n const b9 = (pow2(b6, _3n) * b3) % P;\n const b11 = (pow2(b9, _2n) * b2) % P;\n const b22 = (pow2(b11, _11n) * b11) % P;\n const b44 = (pow2(b22, _22n) * b22) % P;\n const b88 = (pow2(b44, _44n) * b44) % P;\n const b176 = (pow2(b88, _88n) * b88) % P;\n const b220 = (pow2(b176, _44n) * b44) % P;\n const b223 = (pow2(b220, _3n) * b3) % P;\n const t1 = (pow2(b223, _23n) * b22) % P;\n const t2 = (pow2(t1, _6n) * b2) % P;\n const rt = pow2(t2, _2n);\n const xc = (rt * rt) % P;\n if (xc !== x)\n throw new Error('Cannot find square root');\n return rt;\n}\nfunction invert(number, modulo = CURVE.P) {\n if (number === _0n || modulo <= _0n) {\n throw new Error(`invert: expected positive integers, got n=${number} mod=${modulo}`);\n }\n let a = mod(number, modulo);\n let b = modulo;\n let x = _0n, y = _1n, u = _1n, v = _0n;\n while (a !== _0n) {\n const q = b / a;\n const r = b % a;\n const m = x - u * q;\n const n = y - v * q;\n b = a, a = r, x = u, y = v, u = m, v = n;\n }\n const gcd = b;\n if (gcd !== _1n)\n throw new Error('invert: does not exist');\n return mod(x, modulo);\n}\nfunction invertBatch(nums, p = CURVE.P) {\n const scratch = new Array(nums.length);\n const lastMultiplied = nums.reduce((acc, num, i) => {\n if (num === _0n)\n return acc;\n scratch[i] = acc;\n return mod(acc * num, p);\n }, _1n);\n const inverted = invert(lastMultiplied, p);\n nums.reduceRight((acc, num, i) => {\n if (num === _0n)\n return acc;\n scratch[i] = mod(acc * scratch[i], p);\n return mod(acc * num, p);\n }, inverted);\n return scratch;\n}\nfunction bits2int_2(bytes) {\n const delta = bytes.length * 8 - groupLen * 8;\n const num = bytesToNumber(bytes);\n return delta > 0 ? num >> BigInt(delta) : num;\n}\nfunction truncateHash(hash, truncateOnly = false) {\n const h = bits2int_2(hash);\n if (truncateOnly)\n return h;\n const { n } = CURVE;\n return h >= n ? h - n : h;\n}\nlet _sha256Sync;\nlet _hmacSha256Sync;\nclass HmacDrbg {\n constructor(hashLen, qByteLen) {\n this.hashLen = hashLen;\n this.qByteLen = qByteLen;\n if (typeof hashLen !== 'number' || hashLen < 2)\n throw new Error('hashLen must be a number');\n if (typeof qByteLen !== 'number' || qByteLen < 2)\n throw new Error('qByteLen must be a number');\n this.v = new Uint8Array(hashLen).fill(1);\n this.k = new Uint8Array(hashLen).fill(0);\n this.counter = 0;\n }\n hmac(...values) {\n return utils.hmacSha256(this.k, ...values);\n }\n hmacSync(...values) {\n return _hmacSha256Sync(this.k, ...values);\n }\n checkSync() {\n if (typeof _hmacSha256Sync !== 'function')\n throw new ShaError('hmacSha256Sync needs to be set');\n }\n incr() {\n if (this.counter >= 1000)\n throw new Error('Tried 1,000 k values for sign(), all were invalid');\n this.counter += 1;\n }\n async reseed(seed = new Uint8Array()) {\n this.k = await this.hmac(this.v, Uint8Array.from([0x00]), seed);\n this.v = await this.hmac(this.v);\n if (seed.length === 0)\n return;\n this.k = await this.hmac(this.v, Uint8Array.from([0x01]), seed);\n this.v = await this.hmac(this.v);\n }\n reseedSync(seed = new Uint8Array()) {\n this.checkSync();\n this.k = this.hmacSync(this.v, Uint8Array.from([0x00]), seed);\n this.v = this.hmacSync(this.v);\n if (seed.length === 0)\n return;\n this.k = this.hmacSync(this.v, Uint8Array.from([0x01]), seed);\n this.v = this.hmacSync(this.v);\n }\n async generate() {\n this.incr();\n let len = 0;\n const out = [];\n while (len < this.qByteLen) {\n this.v = await this.hmac(this.v);\n const sl = this.v.slice();\n out.push(sl);\n len += this.v.length;\n }\n return concatBytes(...out);\n }\n generateSync() {\n this.checkSync();\n this.incr();\n let len = 0;\n const out = [];\n while (len < this.qByteLen) {\n this.v = this.hmacSync(this.v);\n const sl = this.v.slice();\n out.push(sl);\n len += this.v.length;\n }\n return concatBytes(...out);\n }\n}\nfunction isWithinCurveOrder(num) {\n return _0n < num && num < CURVE.n;\n}\nfunction isValidFieldElement(num) {\n return _0n < num && num < CURVE.P;\n}\nfunction kmdToSig(kBytes, m, d, lowS = true) {\n const { n } = CURVE;\n const k = truncateHash(kBytes, true);\n if (!isWithinCurveOrder(k))\n return;\n const kinv = invert(k, n);\n const q = Point.BASE.multiply(k);\n const r = mod(q.x, n);\n if (r === _0n)\n return;\n const s = mod(kinv * mod(m + d * r, n), n);\n if (s === _0n)\n return;\n let sig = new Signature(r, s);\n let recovery = (q.x === sig.r ? 0 : 2) | Number(q.y & _1n);\n if (lowS && sig.hasHighS()) {\n sig = sig.normalizeS();\n recovery ^= 1;\n }\n return { sig, recovery };\n}\nfunction normalizePrivateKey(key) {\n let num;\n if (typeof key === 'bigint') {\n num = key;\n }\n else if (typeof key === 'number' && Number.isSafeInteger(key) && key > 0) {\n num = BigInt(key);\n }\n else if (typeof key === 'string') {\n if (key.length !== 2 * groupLen)\n throw new Error('Expected 32 bytes of private key');\n num = hexToNumber(key);\n }\n else if (key instanceof Uint8Array) {\n if (key.length !== groupLen)\n throw new Error('Expected 32 bytes of private key');\n num = bytesToNumber(key);\n }\n else {\n throw new TypeError('Expected valid private key');\n }\n if (!isWithinCurveOrder(num))\n throw new Error('Expected private key: 0 < key < n');\n return num;\n}\nfunction normalizePublicKey(publicKey) {\n if (publicKey instanceof Point) {\n publicKey.assertValidity();\n return publicKey;\n }\n else {\n return Point.fromHex(publicKey);\n }\n}\nfunction normalizeSignature(signature) {\n if (signature instanceof Signature) {\n signature.assertValidity();\n return signature;\n }\n try {\n return Signature.fromDER(signature);\n }\n catch (error) {\n return Signature.fromCompact(signature);\n }\n}\nexport function getPublicKey(privateKey, isCompressed = false) {\n return Point.fromPrivateKey(privateKey).toRawBytes(isCompressed);\n}\nexport function recoverPublicKey(msgHash, signature, recovery, isCompressed = false) {\n return Point.fromSignature(msgHash, signature, recovery).toRawBytes(isCompressed);\n}\nfunction isProbPub(item) {\n const arr = item instanceof Uint8Array;\n const str = typeof item === 'string';\n const len = (arr || str) && item.length;\n if (arr)\n return len === compressedLen || len === uncompressedLen;\n if (str)\n return len === compressedLen * 2 || len === uncompressedLen * 2;\n if (item instanceof Point)\n return true;\n return false;\n}\nexport function getSharedSecret(privateA, publicB, isCompressed = false) {\n if (isProbPub(privateA))\n throw new TypeError('getSharedSecret: first arg must be private key');\n if (!isProbPub(publicB))\n throw new TypeError('getSharedSecret: second arg must be public key');\n const b = normalizePublicKey(publicB);\n b.assertValidity();\n return b.multiply(normalizePrivateKey(privateA)).toRawBytes(isCompressed);\n}\nfunction bits2int(bytes) {\n const slice = bytes.length > fieldLen ? bytes.slice(0, fieldLen) : bytes;\n return bytesToNumber(slice);\n}\nfunction bits2octets(bytes) {\n const z1 = bits2int(bytes);\n const z2 = mod(z1, CURVE.n);\n return int2octets(z2 < _0n ? z1 : z2);\n}\nfunction int2octets(num) {\n return numTo32b(num);\n}\nfunction initSigArgs(msgHash, privateKey, extraEntropy) {\n if (msgHash == null)\n throw new Error(`sign: expected valid message hash, not \"${msgHash}\"`);\n const h1 = ensureBytes(msgHash);\n const d = normalizePrivateKey(privateKey);\n const seedArgs = [int2octets(d), bits2octets(h1)];\n if (extraEntropy != null) {\n if (extraEntropy === true)\n extraEntropy = utils.randomBytes(fieldLen);\n const e = ensureBytes(extraEntropy);\n if (e.length !== fieldLen)\n throw new Error(`sign: Expected ${fieldLen} bytes of extra data`);\n seedArgs.push(e);\n }\n const seed = concatBytes(...seedArgs);\n const m = bits2int(h1);\n return { seed, m, d };\n}\nfunction finalizeSig(recSig, opts) {\n const { sig, recovery } = recSig;\n const { der, recovered } = Object.assign({ canonical: true, der: true }, opts);\n const hashed = der ? sig.toDERRawBytes() : sig.toCompactRawBytes();\n return recovered ? [hashed, recovery] : hashed;\n}\nasync function sign(msgHash, privKey, opts = {}) {\n const { seed, m, d } = initSigArgs(msgHash, privKey, opts.extraEntropy);\n const drbg = new HmacDrbg(hashLen, groupLen);\n await drbg.reseed(seed);\n let sig;\n while (!(sig = kmdToSig(await drbg.generate(), m, d, opts.canonical)))\n await drbg.reseed();\n return finalizeSig(sig, opts);\n}\nfunction signSync(msgHash, privKey, opts = {}) {\n const { seed, m, d } = initSigArgs(msgHash, privKey, opts.extraEntropy);\n const drbg = new HmacDrbg(hashLen, groupLen);\n drbg.reseedSync(seed);\n let sig;\n while (!(sig = kmdToSig(drbg.generateSync(), m, d, opts.canonical)))\n drbg.reseedSync();\n return finalizeSig(sig, opts);\n}\nexport { sign, signSync };\nconst vopts = { strict: true };\nexport function verify(signature, msgHash, publicKey, opts = vopts) {\n let sig;\n try {\n sig = normalizeSignature(signature);\n msgHash = ensureBytes(msgHash);\n }\n catch (error) {\n return false;\n }\n const { r, s } = sig;\n if (opts.strict && sig.hasHighS())\n return false;\n const h = truncateHash(msgHash);\n let P;\n try {\n P = normalizePublicKey(publicKey);\n }\n catch (error) {\n return false;\n }\n const { n } = CURVE;\n const sinv = invert(s, n);\n const u1 = mod(h * sinv, n);\n const u2 = mod(r * sinv, n);\n const R = Point.BASE.multiplyAndAddUnsafe(P, u1, u2);\n if (!R)\n return false;\n const v = mod(R.x, n);\n return v === r;\n}\nfunction schnorrChallengeFinalize(ch) {\n return mod(bytesToNumber(ch), CURVE.n);\n}\nclass SchnorrSignature {\n constructor(r, s) {\n this.r = r;\n this.s = s;\n this.assertValidity();\n }\n static fromHex(hex) {\n const bytes = ensureBytes(hex);\n if (bytes.length !== 64)\n throw new TypeError(`SchnorrSignature.fromHex: expected 64 bytes, not ${bytes.length}`);\n const r = bytesToNumber(bytes.subarray(0, 32));\n const s = bytesToNumber(bytes.subarray(32, 64));\n return new SchnorrSignature(r, s);\n }\n assertValidity() {\n const { r, s } = this;\n if (!isValidFieldElement(r) || !isWithinCurveOrder(s))\n throw new Error('Invalid signature');\n }\n toHex() {\n return numTo32bStr(this.r) + numTo32bStr(this.s);\n }\n toRawBytes() {\n return hexToBytes(this.toHex());\n }\n}\nfunction schnorrGetPublicKey(privateKey) {\n return Point.fromPrivateKey(privateKey).toRawX();\n}\nclass InternalSchnorrSignature {\n constructor(message, privateKey, auxRand = utils.randomBytes()) {\n if (message == null)\n throw new TypeError(`sign: Expected valid message, not \"${message}\"`);\n this.m = ensureBytes(message);\n const { x, scalar } = this.getScalar(normalizePrivateKey(privateKey));\n this.px = x;\n this.d = scalar;\n this.rand = ensureBytes(auxRand);\n if (this.rand.length !== 32)\n throw new TypeError('sign: Expected 32 bytes of aux randomness');\n }\n getScalar(priv) {\n const point = Point.fromPrivateKey(priv);\n const scalar = point.hasEvenY() ? priv : CURVE.n - priv;\n return { point, scalar, x: point.toRawX() };\n }\n initNonce(d, t0h) {\n return numTo32b(d ^ bytesToNumber(t0h));\n }\n finalizeNonce(k0h) {\n const k0 = mod(bytesToNumber(k0h), CURVE.n);\n if (k0 === _0n)\n throw new Error('sign: Creation of signature failed. k is zero');\n const { point: R, x: rx, scalar: k } = this.getScalar(k0);\n return { R, rx, k };\n }\n finalizeSig(R, k, e, d) {\n return new SchnorrSignature(R.x, mod(k + e * d, CURVE.n)).toRawBytes();\n }\n error() {\n throw new Error('sign: Invalid signature produced');\n }\n async calc() {\n const { m, d, px, rand } = this;\n const tag = utils.taggedHash;\n const t = this.initNonce(d, await tag(TAGS.aux, rand));\n const { R, rx, k } = this.finalizeNonce(await tag(TAGS.nonce, t, px, m));\n const e = schnorrChallengeFinalize(await tag(TAGS.challenge, rx, px, m));\n const sig = this.finalizeSig(R, k, e, d);\n if (!(await schnorrVerify(sig, m, px)))\n this.error();\n return sig;\n }\n calcSync() {\n const { m, d, px, rand } = this;\n const tag = utils.taggedHashSync;\n const t = this.initNonce(d, tag(TAGS.aux, rand));\n const { R, rx, k } = this.finalizeNonce(tag(TAGS.nonce, t, px, m));\n const e = schnorrChallengeFinalize(tag(TAGS.challenge, rx, px, m));\n const sig = this.finalizeSig(R, k, e, d);\n if (!schnorrVerifySync(sig, m, px))\n this.error();\n return sig;\n }\n}\nasync function schnorrSign(msg, privKey, auxRand) {\n return new InternalSchnorrSignature(msg, privKey, auxRand).calc();\n}\nfunction schnorrSignSync(msg, privKey, auxRand) {\n return new InternalSchnorrSignature(msg, privKey, auxRand).calcSync();\n}\nfunction initSchnorrVerify(signature, message, publicKey) {\n const raw = signature instanceof SchnorrSignature;\n const sig = raw ? signature : SchnorrSignature.fromHex(signature);\n if (raw)\n sig.assertValidity();\n return {\n ...sig,\n m: ensureBytes(message),\n P: normalizePublicKey(publicKey),\n };\n}\nfunction finalizeSchnorrVerify(r, P, s, e) {\n const R = Point.BASE.multiplyAndAddUnsafe(P, normalizePrivateKey(s), mod(-e, CURVE.n));\n if (!R || !R.hasEvenY() || R.x !== r)\n return false;\n return true;\n}\nasync function schnorrVerify(signature, message, publicKey) {\n try {\n const { r, s, m, P } = initSchnorrVerify(signature, message, publicKey);\n const e = schnorrChallengeFinalize(await utils.taggedHash(TAGS.challenge, numTo32b(r), P.toRawX(), m));\n return finalizeSchnorrVerify(r, P, s, e);\n }\n catch (error) {\n return false;\n }\n}\nfunction schnorrVerifySync(signature, message, publicKey) {\n try {\n const { r, s, m, P } = initSchnorrVerify(signature, message, publicKey);\n const e = schnorrChallengeFinalize(utils.taggedHashSync(TAGS.challenge, numTo32b(r), P.toRawX(), m));\n return finalizeSchnorrVerify(r, P, s, e);\n }\n catch (error) {\n if (error instanceof ShaError)\n throw error;\n return false;\n }\n}\nexport const schnorr = {\n Signature: SchnorrSignature,\n getPublicKey: schnorrGetPublicKey,\n sign: schnorrSign,\n verify: schnorrVerify,\n signSync: schnorrSignSync,\n verifySync: schnorrVerifySync,\n};\nPoint.BASE._setWindowSize(8);\nconst crypto = {\n node: nodeCrypto,\n web: typeof self === 'object' && 'crypto' in self ? self.crypto : undefined,\n};\nconst TAGS = {\n challenge: 'BIP0340/challenge',\n aux: 'BIP0340/aux',\n nonce: 'BIP0340/nonce',\n};\nconst TAGGED_HASH_PREFIXES = {};\nexport const utils = {\n bytesToHex,\n hexToBytes,\n concatBytes,\n mod,\n invert,\n isValidPrivateKey(privateKey) {\n try {\n normalizePrivateKey(privateKey);\n return true;\n }\n catch (error) {\n return false;\n }\n },\n _bigintTo32Bytes: numTo32b,\n _normalizePrivateKey: normalizePrivateKey,\n hashToPrivateKey: (hash) => {\n hash = ensureBytes(hash);\n const minLen = groupLen + 8;\n if (hash.length < minLen || hash.length > 1024) {\n throw new Error(`Expected valid bytes of private key as per FIPS 186`);\n }\n const num = mod(bytesToNumber(hash), CURVE.n - _1n) + _1n;\n return numTo32b(num);\n },\n randomBytes: (bytesLength = 32) => {\n if (crypto.web) {\n return crypto.web.getRandomValues(new Uint8Array(bytesLength));\n }\n else if (crypto.node) {\n const { randomBytes } = crypto.node;\n return Uint8Array.from(randomBytes(bytesLength));\n }\n else {\n throw new Error(\"The environment doesn't have randomBytes function\");\n }\n },\n randomPrivateKey: () => utils.hashToPrivateKey(utils.randomBytes(groupLen + 8)),\n precompute(windowSize = 8, point = Point.BASE) {\n const cached = point === Point.BASE ? point : new Point(point.x, point.y);\n cached._setWindowSize(windowSize);\n cached.multiply(_3n);\n return cached;\n },\n sha256: async (...messages) => {\n if (crypto.web) {\n const buffer = await crypto.web.subtle.digest('SHA-256', concatBytes(...messages));\n return new Uint8Array(buffer);\n }\n else if (crypto.node) {\n const { createHash } = crypto.node;\n const hash = createHash('sha256');\n messages.forEach((m) => hash.update(m));\n return Uint8Array.from(hash.digest());\n }\n else {\n throw new Error(\"The environment doesn't have sha256 function\");\n }\n },\n hmacSha256: async (key, ...messages) => {\n if (crypto.web) {\n const ckey = await crypto.web.subtle.importKey('raw', key, { name: 'HMAC', hash: { name: 'SHA-256' } }, false, ['sign']);\n const message = concatBytes(...messages);\n const buffer = await crypto.web.subtle.sign('HMAC', ckey, message);\n return new Uint8Array(buffer);\n }\n else if (crypto.node) {\n const { createHmac } = crypto.node;\n const hash = createHmac('sha256', key);\n messages.forEach((m) => hash.update(m));\n return Uint8Array.from(hash.digest());\n }\n else {\n throw new Error(\"The environment doesn't have hmac-sha256 function\");\n }\n },\n sha256Sync: undefined,\n hmacSha256Sync: undefined,\n taggedHash: async (tag, ...messages) => {\n let tagP = TAGGED_HASH_PREFIXES[tag];\n if (tagP === undefined) {\n const tagH = await utils.sha256(Uint8Array.from(tag, (c) => c.charCodeAt(0)));\n tagP = concatBytes(tagH, tagH);\n TAGGED_HASH_PREFIXES[tag] = tagP;\n }\n return utils.sha256(tagP, ...messages);\n },\n taggedHashSync: (tag, ...messages) => {\n if (typeof _sha256Sync !== 'function')\n throw new ShaError('sha256Sync is undefined, you need to set it');\n let tagP = TAGGED_HASH_PREFIXES[tag];\n if (tagP === undefined) {\n const tagH = _sha256Sync(Uint8Array.from(tag, (c) => c.charCodeAt(0)));\n tagP = concatBytes(tagH, tagH);\n TAGGED_HASH_PREFIXES[tag] = tagP;\n }\n return _sha256Sync(tagP, ...messages);\n },\n _JacobianPoint: JacobianPoint,\n};\nObject.defineProperties(utils, {\n sha256Sync: {\n configurable: false,\n get() {\n return _sha256Sync;\n },\n set(val) {\n if (!_sha256Sync)\n _sha256Sync = val;\n },\n },\n hmacSha256Sync: {\n configurable: false,\n get() {\n return _hmacSha256Sync;\n },\n set(val) {\n if (!_hmacSha256Sync)\n _hmacSha256Sync = val;\n },\n },\n});\n","import * as secp from \"@noble/secp256k1\";\nimport { concat } from \"@waku/utils/bytes\";\nimport sha3 from \"js-sha3\";\n/**\n * ECDSA Sign a message with the given private key.\n *\n * @param message The message to sign, usually a hash.\n * @param privateKey The ECDSA private key to use to sign the message.\n *\n * @returns The signature and the recovery id concatenated.\n */\nexport async function sign(message, privateKey) {\n const [signature, recoveryId] = await secp.sign(message, privateKey, {\n recovered: true,\n der: false\n });\n return concat([signature, new Uint8Array([recoveryId])], signature.length + 1);\n}\nexport function keccak256(input) {\n return new Uint8Array(sha3.keccak256.arrayBuffer(input));\n}\nexport function compressPublicKey(publicKey) {\n if (publicKey.length === 64) {\n publicKey = concat([new Uint8Array([4]), publicKey], 65);\n }\n const point = secp.Point.fromHex(publicKey);\n return point.toRawBytes(true);\n}\n/**\n * Verify an ECDSA signature.\n */\nexport function verifySignature(signature, message, publicKey) {\n try {\n const _signature = secp.Signature.fromCompact(signature.slice(0, 64));\n return secp.verify(_signature, message, publicKey);\n }\n catch {\n return false;\n }\n}\n//# sourceMappingURL=crypto.js.map","// Maximum encoded size of an ENR\nexport const MAX_RECORD_SIZE = 300;\nexport const ERR_INVALID_ID = \"Invalid record id\";\nexport const ERR_NO_SIGNATURE = \"No valid signature found\";\n// The maximum length of byte size of a multiaddr to encode in the `multiaddr` field\n// The size is a big endian 16-bit unsigned integer\nexport const MULTIADDR_LENGTH_SIZE = 2;\n//# sourceMappingURL=constants.js.map","import { multiaddrFromFields } from \"./multiaddr_from_fields.js\";\nexport function locationMultiaddrFromEnrFields(enr, protocol) {\n switch (protocol) {\n case \"udp\":\n return (locationMultiaddrFromEnrFields(enr, \"udp4\") ||\n locationMultiaddrFromEnrFields(enr, \"udp6\"));\n case \"tcp\":\n return (locationMultiaddrFromEnrFields(enr, \"tcp4\") ||\n locationMultiaddrFromEnrFields(enr, \"tcp6\"));\n }\n const isIpv6 = protocol.endsWith(\"6\");\n const ipVal = enr.get(isIpv6 ? \"ip6\" : \"ip\");\n if (!ipVal)\n return;\n const protoName = protocol.slice(0, 3);\n let protoVal;\n switch (protoName) {\n case \"udp\":\n protoVal = isIpv6 ? enr.get(\"udp6\") : enr.get(\"udp\");\n break;\n case \"tcp\":\n protoVal = isIpv6 ? enr.get(\"tcp6\") : enr.get(\"tcp\");\n break;\n default:\n return;\n }\n if (!protoVal)\n return;\n return multiaddrFromFields(isIpv6 ? \"ip6\" : \"ip4\", protoName, ipVal, protoVal);\n}\n//# sourceMappingURL=get_multiaddr.js.map","import { multiaddr } from \"@multiformats/multiaddr\";\nimport { convertToString } from \"@multiformats/multiaddr/convert\";\nexport function multiaddrFromFields(ipFamily, protocol, ipBytes, protocolBytes) {\n let ma = multiaddr(\"/\" + ipFamily + \"/\" + convertToString(ipFamily, ipBytes));\n ma = ma.encapsulate(multiaddr(\"/\" + protocol + \"/\" + convertToString(protocol, protocolBytes)));\n return ma;\n}\n//# sourceMappingURL=multiaddr_from_fields.js.map","import { multiaddr } from \"@multiformats/multiaddr\";\nimport { MULTIADDR_LENGTH_SIZE } from \"./constants.js\";\nexport function decodeMultiaddrs(bytes) {\n const multiaddrs = [];\n let index = 0;\n while (index < bytes.length) {\n const sizeDataView = new DataView(bytes.buffer, index, MULTIADDR_LENGTH_SIZE);\n const size = sizeDataView.getUint16(0);\n index += MULTIADDR_LENGTH_SIZE;\n const multiaddrBytes = bytes.slice(index, index + size);\n index += size;\n multiaddrs.push(multiaddr(multiaddrBytes));\n }\n return multiaddrs;\n}\nexport function encodeMultiaddrs(multiaddrs) {\n const totalLength = multiaddrs.reduce((acc, ma) => acc + MULTIADDR_LENGTH_SIZE + ma.bytes.length, 0);\n const bytes = new Uint8Array(totalLength);\n const dataView = new DataView(bytes.buffer);\n let index = 0;\n multiaddrs.forEach((multiaddr) => {\n if (multiaddr.getPeerId())\n throw new Error(\"`multiaddr` field MUST not contain peer id\");\n // Prepend the size of the next entry\n dataView.setUint16(index, multiaddr.bytes.length);\n index += MULTIADDR_LENGTH_SIZE;\n bytes.set(multiaddr.bytes, index);\n index += multiaddr.bytes.length;\n });\n return bytes;\n}\n//# sourceMappingURL=multiaddrs_codec.js.map","export function encodeWaku2(protocols) {\n let byte = 0;\n if (protocols.lightPush)\n byte += 1;\n byte = byte << 1;\n if (protocols.filter)\n byte += 1;\n byte = byte << 1;\n if (protocols.store)\n byte += 1;\n byte = byte << 1;\n if (protocols.relay)\n byte += 1;\n return byte;\n}\nexport function decodeWaku2(byte) {\n const waku2 = {\n relay: false,\n store: false,\n filter: false,\n lightPush: false\n };\n if (byte % 2)\n waku2.relay = true;\n byte = byte >> 1;\n if (byte % 2)\n waku2.store = true;\n byte = byte >> 1;\n if (byte % 2)\n waku2.filter = true;\n byte = byte >> 1;\n if (byte % 2)\n waku2.lightPush = true;\n return waku2;\n}\n//# sourceMappingURL=waku2_codec.js.map","import { convertToBytes, convertToString } from \"@multiformats/multiaddr/convert\";\nimport { decodeRelayShard } from \"@waku/utils\";\nimport { bytesToUtf8 } from \"@waku/utils/bytes\";\nimport { ERR_INVALID_ID } from \"./constants.js\";\nimport { decodeMultiaddrs, encodeMultiaddrs } from \"./multiaddrs_codec.js\";\nimport { decodeWaku2, encodeWaku2 } from \"./waku2_codec.js\";\nexport class RawEnr extends Map {\n seq;\n signature;\n constructor(kvs = {}, seq = BigInt(1), signature) {\n super(Object.entries(kvs));\n this.seq = seq;\n this.signature = signature;\n }\n set(k, v) {\n this.signature = undefined;\n this.seq++;\n return super.set(k, v);\n }\n get id() {\n const id = this.get(\"id\");\n if (!id)\n throw new Error(\"id not found.\");\n return bytesToUtf8(id);\n }\n get publicKey() {\n switch (this.id) {\n case \"v4\":\n return this.get(\"secp256k1\");\n default:\n throw new Error(ERR_INVALID_ID);\n }\n }\n get rs() {\n const rs = this.get(\"rs\");\n if (!rs)\n return undefined;\n return decodeRelayShard(rs);\n }\n get rsv() {\n const rsv = this.get(\"rsv\");\n if (!rsv)\n return undefined;\n return decodeRelayShard(rsv);\n }\n get ip() {\n return getStringValue(this, \"ip\", \"ip4\");\n }\n set ip(ip) {\n setStringValue(this, \"ip\", \"ip4\", ip);\n }\n get tcp() {\n return getNumberAsStringValue(this, \"tcp\", \"tcp\");\n }\n set tcp(port) {\n setNumberAsStringValue(this, \"tcp\", \"tcp\", port);\n }\n get udp() {\n return getNumberAsStringValue(this, \"udp\", \"udp\");\n }\n set udp(port) {\n setNumberAsStringValue(this, \"udp\", \"udp\", port);\n }\n get ip6() {\n return getStringValue(this, \"ip6\", \"ip6\");\n }\n set ip6(ip) {\n setStringValue(this, \"ip6\", \"ip6\", ip);\n }\n get tcp6() {\n return getNumberAsStringValue(this, \"tcp6\", \"tcp\");\n }\n set tcp6(port) {\n setNumberAsStringValue(this, \"tcp6\", \"tcp\", port);\n }\n get udp6() {\n return getNumberAsStringValue(this, \"udp6\", \"udp\");\n }\n set udp6(port) {\n setNumberAsStringValue(this, \"udp6\", \"udp\", port);\n }\n /**\n * Get the `multiaddrs` field from ENR.\n *\n * This field is used to store multiaddresses that cannot be stored with the current ENR pre-defined keys.\n * These can be a multiaddresses that include encapsulation (e.g. wss) or do not use `ip4` nor `ip6` for the host\n * address (e.g. `dns4`, `dnsaddr`, etc)..\n *\n * If the peer information only contains information that can be represented with the ENR pre-defined keys\n * (ip, tcp, etc) then the usage of { @link ENR.getLocationMultiaddr } should be preferred.\n *\n * The multiaddresses stored in this field are expected to be location multiaddresses, ie, peer id less.\n */\n get multiaddrs() {\n const raw = this.get(\"multiaddrs\");\n if (raw)\n return decodeMultiaddrs(raw);\n return;\n }\n /**\n * Set the `multiaddrs` field on the ENR.\n *\n * This field is used to store multiaddresses that cannot be stored with the current ENR pre-defined keys.\n * These can be a multiaddresses that include encapsulation (e.g. wss) or do not use `ip4` nor `ip6` for the host\n * address (e.g. `dns4`, `dnsaddr`, etc)..\n *\n * If the peer information only contains information that can be represented with the ENR pre-defined keys\n * (ip, tcp, etc) then the usage of { @link ENR.setLocationMultiaddr } should be preferred.\n * The multiaddresses stored in this field must be location multiaddresses,\n * ie, without a peer id.\n */\n set multiaddrs(multiaddrs) {\n deleteUndefined(this, \"multiaddrs\", multiaddrs, encodeMultiaddrs);\n }\n /**\n * Get the `waku2` field from ENR.\n */\n get waku2() {\n const raw = this.get(\"waku2\");\n if (raw)\n return decodeWaku2(raw[0]);\n return;\n }\n /**\n * Set the `waku2` field on the ENR.\n */\n set waku2(waku2) {\n deleteUndefined(this, \"waku2\", waku2, (w) => new Uint8Array([encodeWaku2(w)]));\n }\n}\nfunction getStringValue(map, key, proto) {\n const raw = map.get(key);\n if (!raw)\n return;\n return convertToString(proto, raw);\n}\nfunction getNumberAsStringValue(map, key, proto) {\n const raw = map.get(key);\n if (!raw)\n return;\n return Number(convertToString(proto, raw));\n}\nfunction setStringValue(map, key, proto, value) {\n deleteUndefined(map, key, value, convertToBytes.bind({}, proto));\n}\nfunction setNumberAsStringValue(map, key, proto, value) {\n setStringValue(map, key, proto, value?.toString(10));\n}\nfunction deleteUndefined(map, key, value, transform) {\n if (value !== undefined) {\n map.set(key, transform(value));\n }\n else {\n map.delete(key);\n }\n}\n//# sourceMappingURL=raw_enr.js.map","import * as secp from \"@noble/secp256k1\";\nimport { bytesToHex } from \"@waku/utils/bytes\";\nimport { keccak256 } from \"./crypto.js\";\nexport async function sign(privKey, msg) {\n return secp.sign(keccak256(msg), privKey, {\n der: false\n });\n}\nexport function nodeId(pubKey) {\n const publicKey = secp.Point.fromHex(pubKey);\n const uncompressedPubkey = publicKey.toRawBytes(false);\n return bytesToHex(keccak256(uncompressedPubkey.slice(1)));\n}\n//# sourceMappingURL=v4.js.map","import { Logger } from \"@waku/utils\";\nimport { ERR_INVALID_ID } from \"./constants.js\";\nimport { keccak256, verifySignature } from \"./crypto.js\";\nimport { locationMultiaddrFromEnrFields } from \"./get_multiaddr.js\";\nimport { createPeerIdFromPublicKey } from \"./peer_id.js\";\nimport { RawEnr } from \"./raw_enr.js\";\nimport * as v4 from \"./v4.js\";\nconst log = new Logger(\"enr\");\nexport var TransportProtocol;\n(function (TransportProtocol) {\n TransportProtocol[\"TCP\"] = \"tcp\";\n TransportProtocol[\"UDP\"] = \"udp\";\n})(TransportProtocol || (TransportProtocol = {}));\nexport var TransportProtocolPerIpVersion;\n(function (TransportProtocolPerIpVersion) {\n TransportProtocolPerIpVersion[\"TCP4\"] = \"tcp4\";\n TransportProtocolPerIpVersion[\"UDP4\"] = \"udp4\";\n TransportProtocolPerIpVersion[\"TCP6\"] = \"tcp6\";\n TransportProtocolPerIpVersion[\"UDP6\"] = \"udp6\";\n})(TransportProtocolPerIpVersion || (TransportProtocolPerIpVersion = {}));\nexport class ENR extends RawEnr {\n static RECORD_PREFIX = \"enr:\";\n peerId;\n static async create(kvs = {}, seq = BigInt(1), signature) {\n const enr = new ENR(kvs, seq, signature);\n try {\n const publicKey = enr.publicKey;\n if (publicKey) {\n enr.peerId = await createPeerIdFromPublicKey(publicKey);\n }\n }\n catch (e) {\n log.error(\"Could not calculate peer id for ENR\", e);\n }\n return enr;\n }\n get nodeId() {\n switch (this.id) {\n case \"v4\":\n return this.publicKey ? v4.nodeId(this.publicKey) : undefined;\n default:\n throw new Error(ERR_INVALID_ID);\n }\n }\n getLocationMultiaddr = locationMultiaddrFromEnrFields.bind({}, this);\n get shardInfo() {\n if (this.rs && this.rsv) {\n log.warn(\"ENR contains both `rs` and `rsv` fields.\");\n }\n return this.rs || this.rsv;\n }\n setLocationMultiaddr(multiaddr) {\n const protoNames = multiaddr.protoNames();\n if (protoNames.length !== 2 &&\n protoNames[1] !== \"udp\" &&\n protoNames[1] !== \"tcp\") {\n throw new Error(\"Invalid multiaddr\");\n }\n const tuples = multiaddr.tuples();\n if (!tuples[0][1] || !tuples[1][1]) {\n throw new Error(\"Invalid multiaddr\");\n }\n // IPv4\n if (tuples[0][0] === 4) {\n this.set(\"ip\", tuples[0][1]);\n this.set(protoNames[1], tuples[1][1]);\n }\n else {\n this.set(\"ip6\", tuples[0][1]);\n this.set(protoNames[1] + \"6\", tuples[1][1]);\n }\n }\n getAllLocationMultiaddrs() {\n const multiaddrs = [];\n for (const protocol of Object.values(TransportProtocolPerIpVersion)) {\n const ma = this.getLocationMultiaddr(protocol);\n if (ma)\n multiaddrs.push(ma);\n }\n const _multiaddrs = this.multiaddrs ?? [];\n return multiaddrs.concat(_multiaddrs).map((ma) => {\n if (this.peerId) {\n return ma.encapsulate(`/p2p/${this.peerId.toString()}`);\n }\n return ma;\n });\n }\n get peerInfo() {\n const id = this.peerId;\n if (!id)\n return;\n return {\n id,\n multiaddrs: this.getAllLocationMultiaddrs()\n };\n }\n /**\n * Returns the full multiaddr from the ENR fields matching the provided\n * `protocol` parameter.\n * To return full multiaddrs from the `multiaddrs` ENR field,\n * use { @link ENR.getFullMultiaddrs }.\n *\n * @param protocol\n */\n getFullMultiaddr(protocol) {\n if (this.peerId) {\n const locationMultiaddr = this.getLocationMultiaddr(protocol);\n if (locationMultiaddr) {\n return locationMultiaddr.encapsulate(`/p2p/${this.peerId.toString()}`);\n }\n }\n return;\n }\n /**\n * Returns the full multiaddrs from the `multiaddrs` ENR field.\n */\n getFullMultiaddrs() {\n if (this.peerId && this.multiaddrs) {\n const peerId = this.peerId;\n return this.multiaddrs.map((ma) => {\n return ma.encapsulate(`/p2p/${peerId.toString()}`);\n });\n }\n return [];\n }\n verify(data, signature) {\n if (!this.get(\"id\") || this.id !== \"v4\") {\n throw new Error(ERR_INVALID_ID);\n }\n if (!this.publicKey) {\n throw new Error(\"Failed to verify ENR: No public key\");\n }\n return verifySignature(signature, keccak256(data), this.publicKey);\n }\n async sign(data, privateKey) {\n switch (this.id) {\n case \"v4\":\n this.signature = await v4.sign(privateKey, data);\n break;\n default:\n throw new Error(ERR_INVALID_ID);\n }\n return this.signature;\n }\n}\n//# sourceMappingURL=enr.js.map","import { unmarshalPrivateKey, unmarshalPublicKey } from \"@libp2p/crypto/keys\";\nimport { supportedKeys } from \"@libp2p/crypto/keys\";\nimport { peerIdFromKeys } from \"@libp2p/peer-id\";\nexport function createPeerIdFromPublicKey(publicKey) {\n const _publicKey = new supportedKeys.secp256k1.Secp256k1PublicKey(publicKey);\n return peerIdFromKeys(_publicKey.bytes, undefined);\n}\nexport function getPublicKeyFromPeerId(peerId) {\n if (peerId.type !== \"secp256k1\") {\n throw new Error(\"Unsupported peer id type\");\n }\n if (!peerId.publicKey) {\n throw new Error(\"Public key not present on peer id\");\n }\n return unmarshalPublicKey(peerId.publicKey).marshal();\n}\n// Only used in tests\nexport async function getPrivateKeyFromPeerId(peerId) {\n if (peerId.type !== \"secp256k1\") {\n throw new Error(\"Unsupported peer id type\");\n }\n if (!peerId.privateKey) {\n throw new Error(\"Private key not present on peer id\");\n }\n const privateKey = await unmarshalPrivateKey(peerId.privateKey);\n return privateKey.marshal();\n}\n//# sourceMappingURL=peer_id.js.map","\"use strict\";\nlet _permanentCensorErrors = false;\nlet _censorErrors = false;\nconst LogLevels = { debug: 1, \"default\": 2, info: 2, warning: 3, error: 4, off: 5 };\nlet _logLevel = LogLevels[\"default\"];\nimport { version } from \"./_version\";\nlet _globalLogger = null;\nfunction _checkNormalize() {\n try {\n const missing = [];\n // Make sure all forms of normalization are supported\n [\"NFD\", \"NFC\", \"NFKD\", \"NFKC\"].forEach((form) => {\n try {\n if (\"test\".normalize(form) !== \"test\") {\n throw new Error(\"bad normalize\");\n }\n ;\n }\n catch (error) {\n missing.push(form);\n }\n });\n if (missing.length) {\n throw new Error(\"missing \" + missing.join(\", \"));\n }\n if (String.fromCharCode(0xe9).normalize(\"NFD\") !== String.fromCharCode(0x65, 0x0301)) {\n throw new Error(\"broken implementation\");\n }\n }\n catch (error) {\n return error.message;\n }\n return null;\n}\nconst _normalizeError = _checkNormalize();\nexport var LogLevel;\n(function (LogLevel) {\n LogLevel[\"DEBUG\"] = \"DEBUG\";\n LogLevel[\"INFO\"] = \"INFO\";\n LogLevel[\"WARNING\"] = \"WARNING\";\n LogLevel[\"ERROR\"] = \"ERROR\";\n LogLevel[\"OFF\"] = \"OFF\";\n})(LogLevel || (LogLevel = {}));\nexport var ErrorCode;\n(function (ErrorCode) {\n ///////////////////\n // Generic Errors\n // Unknown Error\n ErrorCode[\"UNKNOWN_ERROR\"] = \"UNKNOWN_ERROR\";\n // Not Implemented\n ErrorCode[\"NOT_IMPLEMENTED\"] = \"NOT_IMPLEMENTED\";\n // Unsupported Operation\n // - operation\n ErrorCode[\"UNSUPPORTED_OPERATION\"] = \"UNSUPPORTED_OPERATION\";\n // Network Error (i.e. Ethereum Network, such as an invalid chain ID)\n // - event (\"noNetwork\" is not re-thrown in provider.ready; otherwise thrown)\n ErrorCode[\"NETWORK_ERROR\"] = \"NETWORK_ERROR\";\n // Some sort of bad response from the server\n ErrorCode[\"SERVER_ERROR\"] = \"SERVER_ERROR\";\n // Timeout\n ErrorCode[\"TIMEOUT\"] = \"TIMEOUT\";\n ///////////////////\n // Operational Errors\n // Buffer Overrun\n ErrorCode[\"BUFFER_OVERRUN\"] = \"BUFFER_OVERRUN\";\n // Numeric Fault\n // - operation: the operation being executed\n // - fault: the reason this faulted\n ErrorCode[\"NUMERIC_FAULT\"] = \"NUMERIC_FAULT\";\n ///////////////////\n // Argument Errors\n // Missing new operator to an object\n // - name: The name of the class\n ErrorCode[\"MISSING_NEW\"] = \"MISSING_NEW\";\n // Invalid argument (e.g. value is incompatible with type) to a function:\n // - argument: The argument name that was invalid\n // - value: The value of the argument\n ErrorCode[\"INVALID_ARGUMENT\"] = \"INVALID_ARGUMENT\";\n // Missing argument to a function:\n // - count: The number of arguments received\n // - expectedCount: The number of arguments expected\n ErrorCode[\"MISSING_ARGUMENT\"] = \"MISSING_ARGUMENT\";\n // Too many arguments\n // - count: The number of arguments received\n // - expectedCount: The number of arguments expected\n ErrorCode[\"UNEXPECTED_ARGUMENT\"] = \"UNEXPECTED_ARGUMENT\";\n ///////////////////\n // Blockchain Errors\n // Call exception\n // - transaction: the transaction\n // - address?: the contract address\n // - args?: The arguments passed into the function\n // - method?: The Solidity method signature\n // - errorSignature?: The EIP848 error signature\n // - errorArgs?: The EIP848 error parameters\n // - reason: The reason (only for EIP848 \"Error(string)\")\n ErrorCode[\"CALL_EXCEPTION\"] = \"CALL_EXCEPTION\";\n // Insufficient funds (< value + gasLimit * gasPrice)\n // - transaction: the transaction attempted\n ErrorCode[\"INSUFFICIENT_FUNDS\"] = \"INSUFFICIENT_FUNDS\";\n // Nonce has already been used\n // - transaction: the transaction attempted\n ErrorCode[\"NONCE_EXPIRED\"] = \"NONCE_EXPIRED\";\n // The replacement fee for the transaction is too low\n // - transaction: the transaction attempted\n ErrorCode[\"REPLACEMENT_UNDERPRICED\"] = \"REPLACEMENT_UNDERPRICED\";\n // The gas limit could not be estimated\n // - transaction: the transaction passed to estimateGas\n ErrorCode[\"UNPREDICTABLE_GAS_LIMIT\"] = \"UNPREDICTABLE_GAS_LIMIT\";\n // The transaction was replaced by one with a higher gas price\n // - reason: \"cancelled\", \"replaced\" or \"repriced\"\n // - cancelled: true if reason == \"cancelled\" or reason == \"replaced\")\n // - hash: original transaction hash\n // - replacement: the full TransactionsResponse for the replacement\n // - receipt: the receipt of the replacement\n ErrorCode[\"TRANSACTION_REPLACED\"] = \"TRANSACTION_REPLACED\";\n ///////////////////\n // Interaction Errors\n // The user rejected the action, such as signing a message or sending\n // a transaction\n ErrorCode[\"ACTION_REJECTED\"] = \"ACTION_REJECTED\";\n})(ErrorCode || (ErrorCode = {}));\n;\nconst HEX = \"0123456789abcdef\";\nexport class Logger {\n constructor(version) {\n Object.defineProperty(this, \"version\", {\n enumerable: true,\n value: version,\n writable: false\n });\n }\n _log(logLevel, args) {\n const level = logLevel.toLowerCase();\n if (LogLevels[level] == null) {\n this.throwArgumentError(\"invalid log level name\", \"logLevel\", logLevel);\n }\n if (_logLevel > LogLevels[level]) {\n return;\n }\n console.log.apply(console, args);\n }\n debug(...args) {\n this._log(Logger.levels.DEBUG, args);\n }\n info(...args) {\n this._log(Logger.levels.INFO, args);\n }\n warn(...args) {\n this._log(Logger.levels.WARNING, args);\n }\n makeError(message, code, params) {\n // Errors are being censored\n if (_censorErrors) {\n return this.makeError(\"censored error\", code, {});\n }\n if (!code) {\n code = Logger.errors.UNKNOWN_ERROR;\n }\n if (!params) {\n params = {};\n }\n const messageDetails = [];\n Object.keys(params).forEach((key) => {\n const value = params[key];\n try {\n if (value instanceof Uint8Array) {\n let hex = \"\";\n for (let i = 0; i < value.length; i++) {\n hex += HEX[value[i] >> 4];\n hex += HEX[value[i] & 0x0f];\n }\n messageDetails.push(key + \"=Uint8Array(0x\" + hex + \")\");\n }\n else {\n messageDetails.push(key + \"=\" + JSON.stringify(value));\n }\n }\n catch (error) {\n messageDetails.push(key + \"=\" + JSON.stringify(params[key].toString()));\n }\n });\n messageDetails.push(`code=${code}`);\n messageDetails.push(`version=${this.version}`);\n const reason = message;\n let url = \"\";\n switch (code) {\n case ErrorCode.NUMERIC_FAULT: {\n url = \"NUMERIC_FAULT\";\n const fault = message;\n switch (fault) {\n case \"overflow\":\n case \"underflow\":\n case \"division-by-zero\":\n url += \"-\" + fault;\n break;\n case \"negative-power\":\n case \"negative-width\":\n url += \"-unsupported\";\n break;\n case \"unbound-bitwise-result\":\n url += \"-unbound-result\";\n break;\n }\n break;\n }\n case ErrorCode.CALL_EXCEPTION:\n case ErrorCode.INSUFFICIENT_FUNDS:\n case ErrorCode.MISSING_NEW:\n case ErrorCode.NONCE_EXPIRED:\n case ErrorCode.REPLACEMENT_UNDERPRICED:\n case ErrorCode.TRANSACTION_REPLACED:\n case ErrorCode.UNPREDICTABLE_GAS_LIMIT:\n url = code;\n break;\n }\n if (url) {\n message += \" [ See: https:/\\/links.ethers.org/v5-errors-\" + url + \" ]\";\n }\n if (messageDetails.length) {\n message += \" (\" + messageDetails.join(\", \") + \")\";\n }\n // @TODO: Any??\n const error = new Error(message);\n error.reason = reason;\n error.code = code;\n Object.keys(params).forEach(function (key) {\n error[key] = params[key];\n });\n return error;\n }\n throwError(message, code, params) {\n throw this.makeError(message, code, params);\n }\n throwArgumentError(message, name, value) {\n return this.throwError(message, Logger.errors.INVALID_ARGUMENT, {\n argument: name,\n value: value\n });\n }\n assert(condition, message, code, params) {\n if (!!condition) {\n return;\n }\n this.throwError(message, code, params);\n }\n assertArgument(condition, message, name, value) {\n if (!!condition) {\n return;\n }\n this.throwArgumentError(message, name, value);\n }\n checkNormalize(message) {\n if (message == null) {\n message = \"platform missing String.prototype.normalize\";\n }\n if (_normalizeError) {\n this.throwError(\"platform missing String.prototype.normalize\", Logger.errors.UNSUPPORTED_OPERATION, {\n operation: \"String.prototype.normalize\", form: _normalizeError\n });\n }\n }\n checkSafeUint53(value, message) {\n if (typeof (value) !== \"number\") {\n return;\n }\n if (message == null) {\n message = \"value not safe\";\n }\n if (value < 0 || value >= 0x1fffffffffffff) {\n this.throwError(message, Logger.errors.NUMERIC_FAULT, {\n operation: \"checkSafeInteger\",\n fault: \"out-of-safe-range\",\n value: value\n });\n }\n if (value % 1) {\n this.throwError(message, Logger.errors.NUMERIC_FAULT, {\n operation: \"checkSafeInteger\",\n fault: \"non-integer\",\n value: value\n });\n }\n }\n checkArgumentCount(count, expectedCount, message) {\n if (message) {\n message = \": \" + message;\n }\n else {\n message = \"\";\n }\n if (count < expectedCount) {\n this.throwError(\"missing argument\" + message, Logger.errors.MISSING_ARGUMENT, {\n count: count,\n expectedCount: expectedCount\n });\n }\n if (count > expectedCount) {\n this.throwError(\"too many arguments\" + message, Logger.errors.UNEXPECTED_ARGUMENT, {\n count: count,\n expectedCount: expectedCount\n });\n }\n }\n checkNew(target, kind) {\n if (target === Object || target == null) {\n this.throwError(\"missing new\", Logger.errors.MISSING_NEW, { name: kind.name });\n }\n }\n checkAbstract(target, kind) {\n if (target === kind) {\n this.throwError(\"cannot instantiate abstract class \" + JSON.stringify(kind.name) + \" directly; use a sub-class\", Logger.errors.UNSUPPORTED_OPERATION, { name: target.name, operation: \"new\" });\n }\n else if (target === Object || target == null) {\n this.throwError(\"missing new\", Logger.errors.MISSING_NEW, { name: kind.name });\n }\n }\n static globalLogger() {\n if (!_globalLogger) {\n _globalLogger = new Logger(version);\n }\n return _globalLogger;\n }\n static setCensorship(censorship, permanent) {\n if (!censorship && permanent) {\n this.globalLogger().throwError(\"cannot permanently disable censorship\", Logger.errors.UNSUPPORTED_OPERATION, {\n operation: \"setCensorship\"\n });\n }\n if (_permanentCensorErrors) {\n if (!censorship) {\n return;\n }\n this.globalLogger().throwError(\"error censorship permanent\", Logger.errors.UNSUPPORTED_OPERATION, {\n operation: \"setCensorship\"\n });\n }\n _censorErrors = !!censorship;\n _permanentCensorErrors = !!permanent;\n }\n static setLogLevel(logLevel) {\n const level = LogLevels[logLevel.toLowerCase()];\n if (level == null) {\n Logger.globalLogger().warn(\"invalid log level - \" + logLevel);\n return;\n }\n _logLevel = level;\n }\n static from(version) {\n return new Logger(version);\n }\n}\nLogger.errors = ErrorCode;\nLogger.levels = LogLevel;\n//# sourceMappingURL=index.js.map","export const version = \"logger/5.7.0\";\n//# sourceMappingURL=_version.js.map","export const version = \"bytes/5.7.0\";\n//# sourceMappingURL=_version.js.map","\"use strict\";\nimport { Logger } from \"@ethersproject/logger\";\nimport { version } from \"./_version\";\nconst logger = new Logger(version);\n///////////////////////////////\nfunction isHexable(value) {\n return !!(value.toHexString);\n}\nfunction addSlice(array) {\n if (array.slice) {\n return array;\n }\n array.slice = function () {\n const args = Array.prototype.slice.call(arguments);\n return addSlice(new Uint8Array(Array.prototype.slice.apply(array, args)));\n };\n return array;\n}\nexport function isBytesLike(value) {\n return ((isHexString(value) && !(value.length % 2)) || isBytes(value));\n}\nfunction isInteger(value) {\n return (typeof (value) === \"number\" && value == value && (value % 1) === 0);\n}\nexport function isBytes(value) {\n if (value == null) {\n return false;\n }\n if (value.constructor === Uint8Array) {\n return true;\n }\n if (typeof (value) === \"string\") {\n return false;\n }\n if (!isInteger(value.length) || value.length < 0) {\n return false;\n }\n for (let i = 0; i < value.length; i++) {\n const v = value[i];\n if (!isInteger(v) || v < 0 || v >= 256) {\n return false;\n }\n }\n return true;\n}\nexport function arrayify(value, options) {\n if (!options) {\n options = {};\n }\n if (typeof (value) === \"number\") {\n logger.checkSafeUint53(value, \"invalid arrayify value\");\n const result = [];\n while (value) {\n result.unshift(value & 0xff);\n value = parseInt(String(value / 256));\n }\n if (result.length === 0) {\n result.push(0);\n }\n return addSlice(new Uint8Array(result));\n }\n if (options.allowMissingPrefix && typeof (value) === \"string\" && value.substring(0, 2) !== \"0x\") {\n value = \"0x\" + value;\n }\n if (isHexable(value)) {\n value = value.toHexString();\n }\n if (isHexString(value)) {\n let hex = value.substring(2);\n if (hex.length % 2) {\n if (options.hexPad === \"left\") {\n hex = \"0\" + hex;\n }\n else if (options.hexPad === \"right\") {\n hex += \"0\";\n }\n else {\n logger.throwArgumentError(\"hex data is odd-length\", \"value\", value);\n }\n }\n const result = [];\n for (let i = 0; i < hex.length; i += 2) {\n result.push(parseInt(hex.substring(i, i + 2), 16));\n }\n return addSlice(new Uint8Array(result));\n }\n if (isBytes(value)) {\n return addSlice(new Uint8Array(value));\n }\n return logger.throwArgumentError(\"invalid arrayify value\", \"value\", value);\n}\nexport function concat(items) {\n const objects = items.map(item => arrayify(item));\n const length = objects.reduce((accum, item) => (accum + item.length), 0);\n const result = new Uint8Array(length);\n objects.reduce((offset, object) => {\n result.set(object, offset);\n return offset + object.length;\n }, 0);\n return addSlice(result);\n}\nexport function stripZeros(value) {\n let result = arrayify(value);\n if (result.length === 0) {\n return result;\n }\n // Find the first non-zero entry\n let start = 0;\n while (start < result.length && result[start] === 0) {\n start++;\n }\n // If we started with zeros, strip them\n if (start) {\n result = result.slice(start);\n }\n return result;\n}\nexport function zeroPad(value, length) {\n value = arrayify(value);\n if (value.length > length) {\n logger.throwArgumentError(\"value out of range\", \"value\", arguments[0]);\n }\n const result = new Uint8Array(length);\n result.set(value, length - value.length);\n return addSlice(result);\n}\nexport function isHexString(value, length) {\n if (typeof (value) !== \"string\" || !value.match(/^0x[0-9A-Fa-f]*$/)) {\n return false;\n }\n if (length && value.length !== 2 + 2 * length) {\n return false;\n }\n return true;\n}\nconst HexCharacters = \"0123456789abcdef\";\nexport function hexlify(value, options) {\n if (!options) {\n options = {};\n }\n if (typeof (value) === \"number\") {\n logger.checkSafeUint53(value, \"invalid hexlify value\");\n let hex = \"\";\n while (value) {\n hex = HexCharacters[value & 0xf] + hex;\n value = Math.floor(value / 16);\n }\n if (hex.length) {\n if (hex.length % 2) {\n hex = \"0\" + hex;\n }\n return \"0x\" + hex;\n }\n return \"0x00\";\n }\n if (typeof (value) === \"bigint\") {\n value = value.toString(16);\n if (value.length % 2) {\n return (\"0x0\" + value);\n }\n return \"0x\" + value;\n }\n if (options.allowMissingPrefix && typeof (value) === \"string\" && value.substring(0, 2) !== \"0x\") {\n value = \"0x\" + value;\n }\n if (isHexable(value)) {\n return value.toHexString();\n }\n if (isHexString(value)) {\n if (value.length % 2) {\n if (options.hexPad === \"left\") {\n value = \"0x0\" + value.substring(2);\n }\n else if (options.hexPad === \"right\") {\n value += \"0\";\n }\n else {\n logger.throwArgumentError(\"hex data is odd-length\", \"value\", value);\n }\n }\n return value.toLowerCase();\n }\n if (isBytes(value)) {\n let result = \"0x\";\n for (let i = 0; i < value.length; i++) {\n let v = value[i];\n result += HexCharacters[(v & 0xf0) >> 4] + HexCharacters[v & 0x0f];\n }\n return result;\n }\n return logger.throwArgumentError(\"invalid hexlify value\", \"value\", value);\n}\n/*\nfunction unoddify(value: BytesLike | Hexable | number): BytesLike | Hexable | number {\n if (typeof(value) === \"string\" && value.length % 2 && value.substring(0, 2) === \"0x\") {\n return \"0x0\" + value.substring(2);\n }\n return value;\n}\n*/\nexport function hexDataLength(data) {\n if (typeof (data) !== \"string\") {\n data = hexlify(data);\n }\n else if (!isHexString(data) || (data.length % 2)) {\n return null;\n }\n return (data.length - 2) / 2;\n}\nexport function hexDataSlice(data, offset, endOffset) {\n if (typeof (data) !== \"string\") {\n data = hexlify(data);\n }\n else if (!isHexString(data) || (data.length % 2)) {\n logger.throwArgumentError(\"invalid hexData\", \"value\", data);\n }\n offset = 2 + 2 * offset;\n if (endOffset != null) {\n return \"0x\" + data.substring(offset, 2 + 2 * endOffset);\n }\n return \"0x\" + data.substring(offset);\n}\nexport function hexConcat(items) {\n let result = \"0x\";\n items.forEach((item) => {\n result += hexlify(item).substring(2);\n });\n return result;\n}\nexport function hexValue(value) {\n const trimmed = hexStripZeros(hexlify(value, { hexPad: \"left\" }));\n if (trimmed === \"0x\") {\n return \"0x0\";\n }\n return trimmed;\n}\nexport function hexStripZeros(value) {\n if (typeof (value) !== \"string\") {\n value = hexlify(value);\n }\n if (!isHexString(value)) {\n logger.throwArgumentError(\"invalid hex string\", \"value\", value);\n }\n value = value.substring(2);\n let offset = 0;\n while (offset < value.length && value[offset] === \"0\") {\n offset++;\n }\n return \"0x\" + value.substring(offset);\n}\nexport function hexZeroPad(value, length) {\n if (typeof (value) !== \"string\") {\n value = hexlify(value);\n }\n else if (!isHexString(value)) {\n logger.throwArgumentError(\"invalid hex string\", \"value\", value);\n }\n if (value.length > 2 * length + 2) {\n logger.throwArgumentError(\"value out of range\", \"value\", arguments[1]);\n }\n while (value.length < 2 * length + 2) {\n value = \"0x0\" + value.substring(2);\n }\n return value;\n}\nexport function splitSignature(signature) {\n const result = {\n r: \"0x\",\n s: \"0x\",\n _vs: \"0x\",\n recoveryParam: 0,\n v: 0,\n yParityAndS: \"0x\",\n compact: \"0x\"\n };\n if (isBytesLike(signature)) {\n let bytes = arrayify(signature);\n // Get the r, s and v\n if (bytes.length === 64) {\n // EIP-2098; pull the v from the top bit of s and clear it\n result.v = 27 + (bytes[32] >> 7);\n bytes[32] &= 0x7f;\n result.r = hexlify(bytes.slice(0, 32));\n result.s = hexlify(bytes.slice(32, 64));\n }\n else if (bytes.length === 65) {\n result.r = hexlify(bytes.slice(0, 32));\n result.s = hexlify(bytes.slice(32, 64));\n result.v = bytes[64];\n }\n else {\n logger.throwArgumentError(\"invalid signature string\", \"signature\", signature);\n }\n // Allow a recid to be used as the v\n if (result.v < 27) {\n if (result.v === 0 || result.v === 1) {\n result.v += 27;\n }\n else {\n logger.throwArgumentError(\"signature invalid v byte\", \"signature\", signature);\n }\n }\n // Compute recoveryParam from v\n result.recoveryParam = 1 - (result.v % 2);\n // Compute _vs from recoveryParam and s\n if (result.recoveryParam) {\n bytes[32] |= 0x80;\n }\n result._vs = hexlify(bytes.slice(32, 64));\n }\n else {\n result.r = signature.r;\n result.s = signature.s;\n result.v = signature.v;\n result.recoveryParam = signature.recoveryParam;\n result._vs = signature._vs;\n // If the _vs is available, use it to populate missing s, v and recoveryParam\n // and verify non-missing s, v and recoveryParam\n if (result._vs != null) {\n const vs = zeroPad(arrayify(result._vs), 32);\n result._vs = hexlify(vs);\n // Set or check the recid\n const recoveryParam = ((vs[0] >= 128) ? 1 : 0);\n if (result.recoveryParam == null) {\n result.recoveryParam = recoveryParam;\n }\n else if (result.recoveryParam !== recoveryParam) {\n logger.throwArgumentError(\"signature recoveryParam mismatch _vs\", \"signature\", signature);\n }\n // Set or check the s\n vs[0] &= 0x7f;\n const s = hexlify(vs);\n if (result.s == null) {\n result.s = s;\n }\n else if (result.s !== s) {\n logger.throwArgumentError(\"signature v mismatch _vs\", \"signature\", signature);\n }\n }\n // Use recid and v to populate each other\n if (result.recoveryParam == null) {\n if (result.v == null) {\n logger.throwArgumentError(\"signature missing v and recoveryParam\", \"signature\", signature);\n }\n else if (result.v === 0 || result.v === 1) {\n result.recoveryParam = result.v;\n }\n else {\n result.recoveryParam = 1 - (result.v % 2);\n }\n }\n else {\n if (result.v == null) {\n result.v = 27 + result.recoveryParam;\n }\n else {\n const recId = (result.v === 0 || result.v === 1) ? result.v : (1 - (result.v % 2));\n if (result.recoveryParam !== recId) {\n logger.throwArgumentError(\"signature recoveryParam mismatch v\", \"signature\", signature);\n }\n }\n }\n if (result.r == null || !isHexString(result.r)) {\n logger.throwArgumentError(\"signature missing or invalid r\", \"signature\", signature);\n }\n else {\n result.r = hexZeroPad(result.r, 32);\n }\n if (result.s == null || !isHexString(result.s)) {\n logger.throwArgumentError(\"signature missing or invalid s\", \"signature\", signature);\n }\n else {\n result.s = hexZeroPad(result.s, 32);\n }\n const vs = arrayify(result.s);\n if (vs[0] >= 128) {\n logger.throwArgumentError(\"signature s out of range\", \"signature\", signature);\n }\n if (result.recoveryParam) {\n vs[0] |= 0x80;\n }\n const _vs = hexlify(vs);\n if (result._vs) {\n if (!isHexString(result._vs)) {\n logger.throwArgumentError(\"signature invalid _vs\", \"signature\", signature);\n }\n result._vs = hexZeroPad(result._vs, 32);\n }\n // Set or check the _vs\n if (result._vs == null) {\n result._vs = _vs;\n }\n else if (result._vs !== _vs) {\n logger.throwArgumentError(\"signature _vs mismatch v and s\", \"signature\", signature);\n }\n }\n result.yParityAndS = result._vs;\n result.compact = result.r + result.yParityAndS.substring(2);\n return result;\n}\nexport function joinSignature(signature) {\n signature = splitSignature(signature);\n return hexlify(concat([\n signature.r,\n signature.s,\n (signature.recoveryParam ? \"0x1c\" : \"0x1b\")\n ]));\n}\n//# sourceMappingURL=index.js.map","export const version = \"rlp/5.7.0\";\n//# sourceMappingURL=_version.js.map","\"use strict\";\n//See: https://github.com/ethereum/wiki/wiki/RLP\nimport { arrayify, hexlify, isBytesLike } from \"@ethersproject/bytes\";\nimport { Logger } from \"@ethersproject/logger\";\nimport { version } from \"./_version\";\nconst logger = new Logger(version);\nfunction arrayifyInteger(value) {\n const result = [];\n while (value) {\n result.unshift(value & 0xff);\n value >>= 8;\n }\n return result;\n}\nfunction unarrayifyInteger(data, offset, length) {\n let result = 0;\n for (let i = 0; i < length; i++) {\n result = (result * 256) + data[offset + i];\n }\n return result;\n}\nfunction _encode(object) {\n if (Array.isArray(object)) {\n let payload = [];\n object.forEach(function (child) {\n payload = payload.concat(_encode(child));\n });\n if (payload.length <= 55) {\n payload.unshift(0xc0 + payload.length);\n return payload;\n }\n const length = arrayifyInteger(payload.length);\n length.unshift(0xf7 + length.length);\n return length.concat(payload);\n }\n if (!isBytesLike(object)) {\n logger.throwArgumentError(\"RLP object must be BytesLike\", \"object\", object);\n }\n const data = Array.prototype.slice.call(arrayify(object));\n if (data.length === 1 && data[0] <= 0x7f) {\n return data;\n }\n else if (data.length <= 55) {\n data.unshift(0x80 + data.length);\n return data;\n }\n const length = arrayifyInteger(data.length);\n length.unshift(0xb7 + length.length);\n return length.concat(data);\n}\nexport function encode(object) {\n return hexlify(_encode(object));\n}\nfunction _decodeChildren(data, offset, childOffset, length) {\n const result = [];\n while (childOffset < offset + 1 + length) {\n const decoded = _decode(data, childOffset);\n result.push(decoded.result);\n childOffset += decoded.consumed;\n if (childOffset > offset + 1 + length) {\n logger.throwError(\"child data too short\", Logger.errors.BUFFER_OVERRUN, {});\n }\n }\n return { consumed: (1 + length), result: result };\n}\n// returns { consumed: number, result: Object }\nfunction _decode(data, offset) {\n if (data.length === 0) {\n logger.throwError(\"data too short\", Logger.errors.BUFFER_OVERRUN, {});\n }\n // Array with extra length prefix\n if (data[offset] >= 0xf8) {\n const lengthLength = data[offset] - 0xf7;\n if (offset + 1 + lengthLength > data.length) {\n logger.throwError(\"data short segment too short\", Logger.errors.BUFFER_OVERRUN, {});\n }\n const length = unarrayifyInteger(data, offset + 1, lengthLength);\n if (offset + 1 + lengthLength + length > data.length) {\n logger.throwError(\"data long segment too short\", Logger.errors.BUFFER_OVERRUN, {});\n }\n return _decodeChildren(data, offset, offset + 1 + lengthLength, lengthLength + length);\n }\n else if (data[offset] >= 0xc0) {\n const length = data[offset] - 0xc0;\n if (offset + 1 + length > data.length) {\n logger.throwError(\"data array too short\", Logger.errors.BUFFER_OVERRUN, {});\n }\n return _decodeChildren(data, offset, offset + 1, length);\n }\n else if (data[offset] >= 0xb8) {\n const lengthLength = data[offset] - 0xb7;\n if (offset + 1 + lengthLength > data.length) {\n logger.throwError(\"data array too short\", Logger.errors.BUFFER_OVERRUN, {});\n }\n const length = unarrayifyInteger(data, offset + 1, lengthLength);\n if (offset + 1 + lengthLength + length > data.length) {\n logger.throwError(\"data array too short\", Logger.errors.BUFFER_OVERRUN, {});\n }\n const result = hexlify(data.slice(offset + 1 + lengthLength, offset + 1 + lengthLength + length));\n return { consumed: (1 + lengthLength + length), result: result };\n }\n else if (data[offset] >= 0x80) {\n const length = data[offset] - 0x80;\n if (offset + 1 + length > data.length) {\n logger.throwError(\"data too short\", Logger.errors.BUFFER_OVERRUN, {});\n }\n const result = hexlify(data.slice(offset + 1, offset + 1 + length));\n return { consumed: (1 + length), result: result };\n }\n return { consumed: 1, result: hexlify(data[offset]) };\n}\nexport function decode(data) {\n const bytes = arrayify(data);\n const decoded = _decode(bytes, 0);\n if (decoded.consumed !== bytes.length) {\n logger.throwArgumentError(\"invalid rlp data\", \"data\", data);\n }\n return decoded.result;\n}\n//# sourceMappingURL=index.js.map","import * as RLP from \"@ethersproject/rlp\";\nimport { Logger } from \"@waku/utils\";\nimport { bytesToHex, bytesToUtf8, hexToBytes } from \"@waku/utils/bytes\";\nimport { fromString } from \"uint8arrays/from-string\";\nimport { ENR } from \"./enr.js\";\nconst log = new Logger(\"enr:decoder\");\nexport class EnrDecoder {\n static fromString(encoded) {\n if (!encoded.startsWith(ENR.RECORD_PREFIX)) {\n throw new Error(`\"string encoded ENR must start with '${ENR.RECORD_PREFIX}'`);\n }\n return EnrDecoder.fromRLP(fromString(encoded.slice(4), \"base64url\"));\n }\n static fromRLP(encoded) {\n const decoded = RLP.decode(encoded).map(hexToBytes);\n return fromValues(decoded);\n }\n}\nasync function fromValues(values) {\n const { signature, seq, kvs } = checkValues(values);\n const obj = {};\n for (let i = 0; i < kvs.length; i += 2) {\n try {\n obj[bytesToUtf8(kvs[i])] = kvs[i + 1];\n }\n catch (e) {\n log.error(\"Failed to decode ENR key to UTF-8, skipping it\", kvs[i], e);\n }\n }\n const _seq = decodeSeq(seq);\n const enr = await ENR.create(obj, _seq, signature);\n checkSignature(seq, kvs, enr, signature);\n return enr;\n}\nfunction decodeSeq(seq) {\n // If seq is an empty array, translate as value 0\n if (!seq.length)\n return BigInt(0);\n return BigInt(\"0x\" + bytesToHex(seq));\n}\nfunction checkValues(values) {\n if (!Array.isArray(values)) {\n throw new Error(\"Decoded ENR must be an array\");\n }\n if (values.length % 2 !== 0) {\n throw new Error(\"Decoded ENR must have an even number of elements\");\n }\n const [signature, seq, ...kvs] = values;\n if (!signature || Array.isArray(signature)) {\n throw new Error(\"Decoded ENR invalid signature: must be a byte array\");\n }\n if (!seq || Array.isArray(seq)) {\n throw new Error(\"Decoded ENR invalid sequence number: must be a byte array\");\n }\n return { signature, seq, kvs };\n}\nfunction checkSignature(seq, kvs, enr, signature) {\n const rlpEncodedBytes = hexToBytes(RLP.encode([seq, ...kvs]));\n if (!enr.verify(rlpEncodedBytes, signature)) {\n throw new Error(\"Unable to verify ENR signature\");\n }\n}\n//# sourceMappingURL=decoder.js.map","const v4Regex = /^(\\d{1,3}\\.){3,3}\\d{1,3}$/\nconst v4Size = 4\nconst v6Regex = /^(::)?(((\\d{1,3}\\.){3}(\\d{1,3}){1})?([0-9a-f]){0,4}:{0,2}){1,8}(::)?$/i\nconst v6Size = 16\n\nexport const v4 = {\n name: 'v4',\n size: v4Size,\n isFormat: ip => v4Regex.test(ip),\n encode (ip, buff, offset) {\n offset = ~~offset\n buff = buff || new Uint8Array(offset + v4Size)\n const max = ip.length\n let n = 0\n for (let i = 0; i < max;) {\n const c = ip.charCodeAt(i++)\n if (c === 46) { // \".\"\n buff[offset++] = n\n n = 0\n } else {\n n = n * 10 + (c - 48)\n }\n }\n buff[offset] = n\n return buff\n },\n decode (buff, offset) {\n offset = ~~offset\n return `${buff[offset++]}.${buff[offset++]}.${buff[offset++]}.${buff[offset]}`\n }\n}\n\nexport const v6 = {\n name: 'v6',\n size: v6Size,\n isFormat: ip => ip.length > 0 && v6Regex.test(ip),\n encode (ip, buff, offset) {\n offset = ~~offset\n let end = offset + v6Size\n let fill = -1\n let hexN = 0\n let decN = 0\n let prevColon = true\n let useDec = false\n buff = buff || new Uint8Array(offset + v6Size)\n // Note: This algorithm needs to check if the offset\n // could exceed the buffer boundaries as it supports\n // non-standard compliant encodings that may go beyond\n // the boundary limits. if (offset < end) checks should\n // not be necessary...\n for (let i = 0; i < ip.length; i++) {\n let c = ip.charCodeAt(i)\n if (c === 58) { // :\n if (prevColon) {\n if (fill !== -1) {\n // Not Standard! (standard doesn't allow multiple ::)\n // We need to treat\n if (offset < end) buff[offset] = 0\n if (offset < end - 1) buff[offset + 1] = 0\n offset += 2\n } else if (offset < end) {\n // :: in the middle\n fill = offset\n }\n } else {\n // : ends the previous number\n if (useDec === true) {\n // Non-standard! (ipv4 should be at end only)\n // A ipv4 address should not be found anywhere else but at\n // the end. This codec also support putting characters\n // after the ipv4 address..\n if (offset < end) buff[offset] = decN\n offset++\n } else {\n if (offset < end) buff[offset] = hexN >> 8\n if (offset < end - 1) buff[offset + 1] = hexN & 0xff\n offset += 2\n }\n hexN = 0\n decN = 0\n }\n prevColon = true\n useDec = false\n } else if (c === 46) { // . indicates IPV4 notation\n if (offset < end) buff[offset] = decN\n offset++\n decN = 0\n hexN = 0\n prevColon = false\n useDec = true\n } else {\n prevColon = false\n if (c >= 97) {\n c -= 87 // a-f ... 97~102 -87 => 10~15\n } else if (c >= 65) {\n c -= 55 // A-F ... 65~70 -55 => 10~15\n } else {\n c -= 48 // 0-9 ... starting from charCode 48\n decN = decN * 10 + c\n }\n // We don't know yet if its a dec or hex number\n hexN = (hexN << 4) + c\n }\n }\n if (prevColon === false) {\n // Commiting last number\n if (useDec === true) {\n if (offset < end) buff[offset] = decN\n offset++\n } else {\n if (offset < end) buff[offset] = hexN >> 8\n if (offset < end - 1) buff[offset + 1] = hexN & 0xff\n offset += 2\n }\n } else if (fill === 0) {\n // Not Standard! (standard doesn't allow multiple ::)\n // This means that a : was found at the start AND end which means the\n // end needs to be treated as 0 entry...\n if (offset < end) buff[offset] = 0\n if (offset < end - 1) buff[offset + 1] = 0\n offset += 2\n } else if (fill !== -1) {\n // Non-standard! (standard doens't allow multiple ::)\n // Here we find that there has been a :: somewhere in the middle\n // and the end. To treat the end with priority we need to move all\n // written data two bytes to the right.\n offset += 2\n for (let i = Math.min(offset - 1, end - 1); i >= fill + 2; i--) {\n buff[i] = buff[i - 2]\n }\n buff[fill] = 0\n buff[fill + 1] = 0\n fill = offset\n }\n if (fill !== offset && fill !== -1) {\n // Move the written numbers to the end while filling the everything\n // \"fill\" to the bytes with zeros.\n if (offset > end - 2) {\n // Non Standard support, when the cursor exceeds bounds.\n offset = end - 2\n }\n while (end > fill) {\n buff[--end] = offset < end && offset > fill ? buff[--offset] : 0\n }\n } else {\n // Fill the rest with zeros\n while (offset < end) {\n buff[offset++] = 0\n }\n }\n return buff\n },\n decode (buff, offset) {\n offset = ~~offset\n let result = ''\n for (let i = 0; i < v6Size; i += 2) {\n if (i !== 0) {\n result += ':'\n }\n result += (buff[offset + i] << 8 | buff[offset + i + 1]).toString(16)\n }\n return result\n .replace(/(^|:)0(:0)*:0(:|$)/, '$1::$3')\n .replace(/:{3,4}/, '::')\n }\n}\n\nexport const name = 'ip'\nexport function sizeOf (ip) {\n if (v4.isFormat(ip)) return v4.size\n if (v6.isFormat(ip)) return v6.size\n throw Error(`Invalid ip address: ${ip}`)\n}\n\nexport function familyOf (string) {\n return sizeOf(string) === v4.size ? 1 : 2\n}\n\nexport function encode (ip, buff, offset) {\n offset = ~~offset\n const size = sizeOf(ip)\n if (typeof buff === 'function') {\n buff = buff(offset + size)\n }\n if (size === v4.size) {\n return v4.encode(ip, buff, offset)\n }\n return v6.encode(ip, buff, offset)\n}\n\nexport function decode (buff, offset, length) {\n offset = ~~offset\n length = length || (buff.length - offset)\n if (length === v4.size) {\n return v4.decode(buff, offset, length)\n }\n if (length === v6.size) {\n return v6.decode(buff, offset, length)\n }\n throw Error(`Invalid buffer size needs to be ${v4.size} for v4 or ${v6.size} for v6.`)\n}\n","export function toString (type) {\n switch (type) {\n case 1: return 'A'\n case 10: return 'NULL'\n case 28: return 'AAAA'\n case 18: return 'AFSDB'\n case 42: return 'APL'\n case 257: return 'CAA'\n case 60: return 'CDNSKEY'\n case 59: return 'CDS'\n case 37: return 'CERT'\n case 5: return 'CNAME'\n case 49: return 'DHCID'\n case 32769: return 'DLV'\n case 39: return 'DNAME'\n case 48: return 'DNSKEY'\n case 43: return 'DS'\n case 55: return 'HIP'\n case 13: return 'HINFO'\n case 45: return 'IPSECKEY'\n case 25: return 'KEY'\n case 36: return 'KX'\n case 29: return 'LOC'\n case 15: return 'MX'\n case 35: return 'NAPTR'\n case 2: return 'NS'\n case 47: return 'NSEC'\n case 50: return 'NSEC3'\n case 51: return 'NSEC3PARAM'\n case 12: return 'PTR'\n case 46: return 'RRSIG'\n case 17: return 'RP'\n case 24: return 'SIG'\n case 6: return 'SOA'\n case 99: return 'SPF'\n case 33: return 'SRV'\n case 44: return 'SSHFP'\n case 32768: return 'TA'\n case 249: return 'TKEY'\n case 52: return 'TLSA'\n case 250: return 'TSIG'\n case 16: return 'TXT'\n case 252: return 'AXFR'\n case 251: return 'IXFR'\n case 41: return 'OPT'\n case 255: return 'ANY'\n }\n return 'UNKNOWN_' + type\n}\n\nexport function toType (name) {\n switch (name.toUpperCase()) {\n case 'A': return 1\n case 'NULL': return 10\n case 'AAAA': return 28\n case 'AFSDB': return 18\n case 'APL': return 42\n case 'CAA': return 257\n case 'CDNSKEY': return 60\n case 'CDS': return 59\n case 'CERT': return 37\n case 'CNAME': return 5\n case 'DHCID': return 49\n case 'DLV': return 32769\n case 'DNAME': return 39\n case 'DNSKEY': return 48\n case 'DS': return 43\n case 'HIP': return 55\n case 'HINFO': return 13\n case 'IPSECKEY': return 45\n case 'KEY': return 25\n case 'KX': return 36\n case 'LOC': return 29\n case 'MX': return 15\n case 'NAPTR': return 35\n case 'NS': return 2\n case 'NSEC': return 47\n case 'NSEC3': return 50\n case 'NSEC3PARAM': return 51\n case 'PTR': return 12\n case 'RRSIG': return 46\n case 'RP': return 17\n case 'SIG': return 24\n case 'SOA': return 6\n case 'SPF': return 99\n case 'SRV': return 33\n case 'SSHFP': return 44\n case 'TA': return 32768\n case 'TKEY': return 249\n case 'TLSA': return 52\n case 'TSIG': return 250\n case 'TXT': return 16\n case 'AXFR': return 252\n case 'IXFR': return 251\n case 'OPT': return 41\n case 'ANY': return 255\n case '*': return 255\n }\n if (name.toUpperCase().startsWith('UNKNOWN_')) return parseInt(name.slice(8))\n return 0\n}\n","/*\n * Traditional DNS header RCODEs (4-bits) defined by IANA in\n * https://www.iana.org/assignments/dns-parameters/dns-parameters.xhtml\n */\n\nexport function toString (rcode) {\n switch (rcode) {\n case 0: return 'NOERROR'\n case 1: return 'FORMERR'\n case 2: return 'SERVFAIL'\n case 3: return 'NXDOMAIN'\n case 4: return 'NOTIMP'\n case 5: return 'REFUSED'\n case 6: return 'YXDOMAIN'\n case 7: return 'YXRRSET'\n case 8: return 'NXRRSET'\n case 9: return 'NOTAUTH'\n case 10: return 'NOTZONE'\n case 11: return 'RCODE_11'\n case 12: return 'RCODE_12'\n case 13: return 'RCODE_13'\n case 14: return 'RCODE_14'\n case 15: return 'RCODE_15'\n }\n return 'RCODE_' + rcode\n}\n\nexport function toRcode (code) {\n switch (code.toUpperCase()) {\n case 'NOERROR': return 0\n case 'FORMERR': return 1\n case 'SERVFAIL': return 2\n case 'NXDOMAIN': return 3\n case 'NOTIMP': return 4\n case 'REFUSED': return 5\n case 'YXDOMAIN': return 6\n case 'YXRRSET': return 7\n case 'NXRRSET': return 8\n case 'NOTAUTH': return 9\n case 'NOTZONE': return 10\n case 'RCODE_11': return 11\n case 'RCODE_12': return 12\n case 'RCODE_13': return 13\n case 'RCODE_14': return 14\n case 'RCODE_15': return 15\n }\n return 0\n}\n","/*\n * Traditional DNS header OPCODEs (4-bits) defined by IANA in\n * https://www.iana.org/assignments/dns-parameters/dns-parameters.xhtml#dns-parameters-5\n */\n\nexport function toString (opcode) {\n switch (opcode) {\n case 0: return 'QUERY'\n case 1: return 'IQUERY'\n case 2: return 'STATUS'\n case 3: return 'OPCODE_3'\n case 4: return 'NOTIFY'\n case 5: return 'UPDATE'\n case 6: return 'OPCODE_6'\n case 7: return 'OPCODE_7'\n case 8: return 'OPCODE_8'\n case 9: return 'OPCODE_9'\n case 10: return 'OPCODE_10'\n case 11: return 'OPCODE_11'\n case 12: return 'OPCODE_12'\n case 13: return 'OPCODE_13'\n case 14: return 'OPCODE_14'\n case 15: return 'OPCODE_15'\n }\n return 'OPCODE_' + opcode\n}\n\nexport function toOpcode (code) {\n switch (code.toUpperCase()) {\n case 'QUERY': return 0\n case 'IQUERY': return 1\n case 'STATUS': return 2\n case 'OPCODE_3': return 3\n case 'NOTIFY': return 4\n case 'UPDATE': return 5\n case 'OPCODE_6': return 6\n case 'OPCODE_7': return 7\n case 'OPCODE_8': return 8\n case 'OPCODE_9': return 9\n case 'OPCODE_10': return 10\n case 'OPCODE_11': return 11\n case 'OPCODE_12': return 12\n case 'OPCODE_13': return 13\n case 'OPCODE_14': return 14\n case 'OPCODE_15': return 15\n }\n return 0\n}\n","export function toString (klass) {\n switch (klass) {\n case 1: return 'IN'\n case 2: return 'CS'\n case 3: return 'CH'\n case 4: return 'HS'\n case 255: return 'ANY'\n }\n return 'UNKNOWN_' + klass\n}\n\nexport function toClass (name) {\n switch (name.toUpperCase()) {\n case 'IN': return 1\n case 'CS': return 2\n case 'CH': return 3\n case 'HS': return 4\n case 'ANY': return 255\n }\n return 0\n}\n","export function toString (type) {\n switch (type) {\n // list at\n // https://www.iana.org/assignments/dns-parameters/dns-parameters.xhtml#dns-parameters-11\n case 1: return 'LLQ'\n case 2: return 'UL'\n case 3: return 'NSID'\n case 5: return 'DAU'\n case 6: return 'DHU'\n case 7: return 'N3U'\n case 8: return 'CLIENT_SUBNET'\n case 9: return 'EXPIRE'\n case 10: return 'COOKIE'\n case 11: return 'TCP_KEEPALIVE'\n case 12: return 'PADDING'\n case 13: return 'CHAIN'\n case 14: return 'KEY_TAG'\n case 26946: return 'DEVICEID'\n }\n if (type < 0) {\n return null\n }\n return `OPTION_${type}`\n}\n\nexport function toCode (name) {\n if (typeof name === 'number') {\n return name\n }\n if (!name) {\n return -1\n }\n switch (name.toUpperCase()) {\n case 'OPTION_0': return 0\n case 'LLQ': return 1\n case 'UL': return 2\n case 'NSID': return 3\n case 'OPTION_4': return 4\n case 'DAU': return 5\n case 'DHU': return 6\n case 'N3U': return 7\n case 'CLIENT_SUBNET': return 8\n case 'EXPIRE': return 9\n case 'COOKIE': return 10\n case 'TCP_KEEPALIVE': return 11\n case 'PADDING': return 12\n case 'CHAIN': return 13\n case 'KEY_TAG': return 14\n case 'DEVICEID': return 26946\n case 'OPTION_65535': return 65535\n }\n const m = name.match(/_(\\d+)$/)\n if (m) {\n return parseInt(m[1], 10)\n }\n return -1\n}\n","const SURROGATE_A = 0b1101100000000000\nconst SURROGATE_B = 0b1101110000000000\n\nexport const name = 'utf8'\n\nexport function encodingLength (str) {\n let len = 0\n const strLen = str.length\n for (let i = 0; i < strLen; i += 1) {\n const code = str.charCodeAt(i)\n if (code <= 0x7F) {\n len += 1\n } else if (code <= 0x07FF) {\n len += 2\n } else if ((code & 0xF800) !== SURROGATE_A) {\n len += 3\n } else {\n const next = i + 1\n if (next === strLen || code >= SURROGATE_B) {\n len += 3\n } else {\n const nextCode = str.charCodeAt(next)\n if ((nextCode & 0xFC00) !== SURROGATE_B) {\n len += 3\n } else {\n i = next\n len += 4\n }\n }\n }\n }\n return len\n}\n\nexport function encode (str, buf, offset) {\n const strLen = str.length\n if (offset === undefined || offset === null) {\n offset = 0\n }\n if (buf === undefined) {\n buf = new Uint8Array(encodingLength(str) + offset)\n }\n let off = offset\n for (let i = 0; i < strLen; i += 1) {\n let code = str.charCodeAt(i)\n if (code <= 0x7F) {\n buf[off++] = code\n } else if (code <= 0x07FF) {\n buf[off++] = 0b11000000 | ((code & 0b11111000000) >> 6)\n buf[off++] = 0b10000000 | (code & 0b00000111111)\n } else if ((code & 0xF800) !== SURROGATE_A) {\n buf[off++] = 0b11100000 | ((code & 0b1111000000000000) >> 12)\n buf[off++] = 0b10000000 | ((code & 0b0000111111000000) >> 6)\n buf[off++] = 0b10000000 | (code & 0b0000000000111111)\n } else {\n const next = i + 1\n if (next === strLen || code >= SURROGATE_B) {\n // Incorrectly started surrogate pair\n buf[off++] = 0xef\n buf[off++] = 0xbf\n buf[off++] = 0xbd\n } else {\n const nextCode = str.charCodeAt(next)\n if ((nextCode & 0xFC00) !== SURROGATE_B) {\n // Incorrect surrogate pair\n buf[off++] = 0xef\n buf[off++] = 0xbf\n buf[off++] = 0xbd\n } else {\n i = next\n code = 0b000010000000000000000 |\n ((code & 0b1111111111) << 10) |\n (nextCode & 0b1111111111)\n buf[off++] = 0b11110000 | ((code & 0b111000000000000000000) >> 18)\n buf[off++] = 0b10000000 | ((code & 0b000111111000000000000) >> 12)\n buf[off++] = 0b10000000 | ((code & 0b000000000111111000000) >> 6)\n buf[off++] = 0b10000000 | (code & 0b000000000000000111111)\n }\n }\n }\n }\n encode.bytes = off - offset\n return buf\n}\nencode.bytes = 0\n\nexport function decode (buf, start, end) {\n let result = ''\n if (start === undefined || start === null) {\n start = 0\n }\n if (end === undefined || end === null) {\n end = buf.length\n }\n for (let offset = start; offset < end;) {\n const code = buf[offset++]\n let num\n if (code <= 128) {\n num = code\n } else if (code > 191 && code < 224) {\n num = ((code & 0b11111) << 6) | (buf[offset++] & 0b111111)\n } else if (code > 239 && code < 365) {\n num = (\n ((code & 0b111) << 18) |\n ((buf[offset++] & 0b111111) << 12) |\n ((buf[offset++] & 0b111111) << 6) |\n (buf[offset++] & 0b111111)\n ) - 0x10000\n const numA = SURROGATE_A | ((num >> 10) & 0b1111111111)\n result += String.fromCharCode(numA)\n num = SURROGATE_B | (num & 0b1111111111)\n } else {\n num = ((code & 0b1111) << 12) |\n ((buf[offset++] & 0b111111) << 6) |\n (buf[offset++] & 0b111111)\n }\n result += String.fromCharCode(num)\n }\n decode.bytes = end - start\n return result\n}\ndecode.bytes = 0\n","import * as utf8 from 'utf8-codec'\n\nexport const isU8Arr = input => input instanceof Uint8Array\n\nexport function bytelength (input) {\n return typeof input === 'string' ? utf8.encodingLength(input) : input.byteLength\n}\n\nexport function from (input) {\n if (input instanceof Uint8Array) {\n return input\n }\n if (Array.isArray(input)) {\n return new Uint8Array(input)\n }\n return utf8.encode(input)\n}\n\nexport function write (arr, str, start) {\n if (typeof str !== 'string') {\n throw new Error('unknown input type')\n }\n utf8.encode(str, arr, start)\n return utf8.encode.bytes\n}\n\nexport function toHex (buf, start, end) {\n let result = ''\n for (let offset = start; offset < end;) {\n const num = buf[offset++]\n const str = num.toString(16)\n result += (str.length === 1) ? '0' + str : str\n }\n return result\n}\n\nconst P_24 = Math.pow(2, 24)\nconst P_16 = Math.pow(2, 16)\nconst P_8 = Math.pow(2, 8)\nexport const readUInt32BE = (buf, offset) => buf[offset] * P_24 +\n buf[offset + 1] * P_16 +\n buf[offset + 2] * P_8 +\n buf[offset + 3]\n\nexport const readUInt16BE = (buf, offset) => (buf[offset] << 8) | buf[offset + 1]\nexport const writeUInt32BE = (buf, value, offset) => {\n value = +value\n buf[offset + 3] = value\n value = value >>> 8\n buf[offset + 2] = value\n value = value >>> 8\n buf[offset + 1] = value\n value = value >>> 8\n buf[offset] = value\n return offset + 4\n}\nexport const writeUInt16BE = (buf, value, offset) => {\n buf[offset] = value >> 8\n buf[offset + 1] = value & 0xFF\n return offset + 2\n}\n\nexport function copy (source, target, targetStart, sourceStart, sourceEnd) {\n if (targetStart < 0) {\n sourceStart -= targetStart\n targetStart = 0\n }\n\n if (sourceStart < 0) {\n sourceStart = 0\n }\n\n if (sourceEnd < 0) {\n return new Uint8Array(0)\n }\n\n if (targetStart >= target.length || sourceStart >= sourceEnd) {\n return 0\n }\n\n return _copyActual(source, target, targetStart, sourceStart, sourceEnd)\n}\n\nfunction _copyActual (source, target, targetStart, sourceStart, sourceEnd) {\n if (sourceEnd - sourceStart > target.length - targetStart) {\n sourceEnd = sourceStart + target.length - targetStart\n }\n\n let nb = sourceEnd - sourceStart\n const sourceLen = source.length - sourceStart\n if (nb > sourceLen) {\n nb = sourceLen\n }\n\n if (sourceStart !== 0 || sourceEnd < source.length) {\n source = new Uint8Array(source.buffer, source.byteOffset + sourceStart, nb)\n }\n\n target.set(source, targetStart)\n\n return nb\n}\n","import * as ip from '@leichtgewicht/ip-codec'\nimport * as types from './types.mjs'\nimport * as rcodes from './rcodes.mjs'\nimport * as opcodes from './opcodes.mjs'\nimport * as classes from './classes.mjs'\nimport * as optioncodes from './optioncodes.mjs'\nimport * as b from './buffer_utils.mjs'\nimport { decode as toUtf8 } from 'utf8-codec'\n\nconst QUERY_FLAG = 0\nconst RESPONSE_FLAG = 1 << 15\nconst FLUSH_MASK = 1 << 15\nconst NOT_FLUSH_MASK = ~FLUSH_MASK\nconst QU_MASK = 1 << 15\nconst NOT_QU_MASK = ~QU_MASK\n\nfunction codec ({ bytes = 0, encode, decode, encodingLength }) {\n encode.bytes = bytes\n decode.bytes = bytes\n return {\n encode,\n decode,\n encodingLength: encodingLength || (() => bytes)\n }\n}\n\nexport const name = codec({\n encode (str, buf, offset) {\n if (!buf) buf = new Uint8Array(name.encodingLength(str))\n if (!offset) offset = 0\n const oldOffset = offset\n\n // strip leading and trailing .\n const n = str.replace(/^\\.|\\.$/gm, '')\n if (n.length) {\n const list = n.split('.')\n\n for (let i = 0; i < list.length; i++) {\n const len = b.write(buf, list[i], offset + 1)\n buf[offset] = len\n offset += len + 1\n }\n }\n\n buf[offset++] = 0\n\n name.encode.bytes = offset - oldOffset\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n\n const list = []\n let oldOffset = offset\n let totalLength = 0\n let consumedBytes = 0\n let jumped = false\n\n while (true) {\n if (offset >= buf.length) {\n throw new Error('Cannot decode name (buffer overflow)')\n }\n const len = buf[offset++]\n consumedBytes += jumped ? 0 : 1\n\n if (len === 0) {\n break\n } else if ((len & 0xc0) === 0) {\n if (offset + len > buf.length) {\n throw new Error('Cannot decode name (buffer overflow)')\n }\n totalLength += len + 1\n if (totalLength > 254) {\n throw new Error('Cannot decode name (name too long)')\n }\n list.push(toUtf8(buf, offset, offset + len))\n offset += len\n consumedBytes += jumped ? 0 : len\n } else if ((len & 0xc0) === 0xc0) {\n if (offset + 1 > buf.length) {\n throw new Error('Cannot decode name (buffer overflow)')\n }\n const jumpOffset = b.readUInt16BE(buf, offset - 1) - 0xc000\n if (jumpOffset >= oldOffset) {\n // Allow only pointers to prior data. RFC 1035, section 4.1.4 states:\n // \"[...] an entire domain name or a list of labels at the end of a domain name\n // is replaced with a pointer to a prior occurance (sic) of the same name.\"\n throw new Error('Cannot decode name (bad pointer)')\n }\n offset = jumpOffset\n oldOffset = jumpOffset\n consumedBytes += jumped ? 0 : 1\n jumped = true\n } else {\n throw new Error('Cannot decode name (bad label)')\n }\n }\n\n name.decode.bytes = consumedBytes\n return list.length === 0 ? '.' : list.join('.')\n },\n encodingLength (n) {\n if (n === '.' || n === '..') return 1\n return b.bytelength(n.replace(/^\\.|\\.$/gm, '')) + 2\n }\n})\n\nconst string = codec({\n encode (s, buf, offset) {\n if (!buf) buf = new Uint8Array(string.encodingLength(s))\n if (!offset) offset = 0\n\n const len = b.write(buf, s, offset + 1)\n buf[offset] = len\n string.encode.bytes = len + 1\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n\n const len = buf[offset]\n const s = toUtf8(buf, offset + 1, offset + 1 + len)\n string.decode.bytes = len + 1\n return s\n },\n encodingLength (s) {\n return b.bytelength(s) + 1\n }\n})\n\nconst header = codec({\n bytes: 12,\n encode (h, buf, offset) {\n if (!buf) buf = new Uint8Array(header.encodingLength(h))\n if (!offset) offset = 0\n\n const flags = (h.flags || 0) & 32767\n const type = h.type === 'response' ? RESPONSE_FLAG : QUERY_FLAG\n\n b.writeUInt16BE(buf, h.id || 0, offset)\n b.writeUInt16BE(buf, flags | type, offset + 2)\n b.writeUInt16BE(buf, h.questions.length, offset + 4)\n b.writeUInt16BE(buf, h.answers.length, offset + 6)\n b.writeUInt16BE(buf, h.authorities.length, offset + 8)\n b.writeUInt16BE(buf, h.additionals.length, offset + 10)\n\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n if (buf.length < 12) throw new Error('Header must be 12 bytes')\n const flags = b.readUInt16BE(buf, offset + 2)\n\n return {\n id: b.readUInt16BE(buf, offset),\n type: flags & RESPONSE_FLAG ? 'response' : 'query',\n flags: flags & 32767,\n flag_qr: ((flags >> 15) & 0x1) === 1,\n opcode: opcodes.toString((flags >> 11) & 0xf),\n flag_aa: ((flags >> 10) & 0x1) === 1,\n flag_tc: ((flags >> 9) & 0x1) === 1,\n flag_rd: ((flags >> 8) & 0x1) === 1,\n flag_ra: ((flags >> 7) & 0x1) === 1,\n flag_z: ((flags >> 6) & 0x1) === 1,\n flag_ad: ((flags >> 5) & 0x1) === 1,\n flag_cd: ((flags >> 4) & 0x1) === 1,\n rcode: rcodes.toString(flags & 0xf),\n questions: new Array(b.readUInt16BE(buf, offset + 4)),\n answers: new Array(b.readUInt16BE(buf, offset + 6)),\n authorities: new Array(b.readUInt16BE(buf, offset + 8)),\n additionals: new Array(b.readUInt16BE(buf, offset + 10))\n }\n },\n encodingLength () {\n return 12\n }\n})\n\nconst runknown = codec({\n encode (data, buf, offset) {\n if (!buf) buf = new Uint8Array(runknown.encodingLength(data))\n if (!offset) offset = 0\n\n const dLen = data.length\n b.writeUInt16BE(buf, dLen, offset)\n b.copy(data, buf, offset + 2, 0, dLen)\n\n runknown.encode.bytes = dLen + 2\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n\n const len = b.readUInt16BE(buf, offset)\n const data = buf.slice(offset + 2, offset + 2 + len)\n runknown.decode.bytes = len + 2\n return data\n },\n encodingLength (data) {\n return data.length + 2\n }\n})\n\nconst rns = codec({\n encode (data, buf, offset) {\n if (!buf) buf = new Uint8Array(rns.encodingLength(data))\n if (!offset) offset = 0\n\n name.encode(data, buf, offset + 2)\n b.writeUInt16BE(buf, name.encode.bytes, offset)\n rns.encode.bytes = name.encode.bytes + 2\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n\n const len = b.readUInt16BE(buf, offset)\n const dd = name.decode(buf, offset + 2)\n\n rns.decode.bytes = len + 2\n return dd\n },\n encodingLength (data) {\n return name.encodingLength(data) + 2\n }\n})\n\nconst rsoa = codec({\n encode (data, buf, offset) {\n if (!buf) buf = new Uint8Array(rsoa.encodingLength(data))\n if (!offset) offset = 0\n\n const oldOffset = offset\n offset += 2\n name.encode(data.mname, buf, offset)\n offset += name.encode.bytes\n name.encode(data.rname, buf, offset)\n offset += name.encode.bytes\n b.writeUInt32BE(buf, data.serial || 0, offset)\n offset += 4\n b.writeUInt32BE(buf, data.refresh || 0, offset)\n offset += 4\n b.writeUInt32BE(buf, data.retry || 0, offset)\n offset += 4\n b.writeUInt32BE(buf, data.expire || 0, offset)\n offset += 4\n b.writeUInt32BE(buf, data.minimum || 0, offset)\n offset += 4\n\n b.writeUInt16BE(buf, offset - oldOffset - 2, oldOffset)\n rsoa.encode.bytes = offset - oldOffset\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n\n const oldOffset = offset\n\n const data = {}\n offset += 2\n data.mname = name.decode(buf, offset)\n offset += name.decode.bytes\n data.rname = name.decode(buf, offset)\n offset += name.decode.bytes\n data.serial = b.readUInt32BE(buf, offset)\n offset += 4\n data.refresh = b.readUInt32BE(buf, offset)\n offset += 4\n data.retry = b.readUInt32BE(buf, offset)\n offset += 4\n data.expire = b.readUInt32BE(buf, offset)\n offset += 4\n data.minimum = b.readUInt32BE(buf, offset)\n offset += 4\n\n rsoa.decode.bytes = offset - oldOffset\n return data\n },\n encodingLength (data) {\n return 22 + name.encodingLength(data.mname) + name.encodingLength(data.rname)\n }\n})\n\nconst rtxt = codec({\n encode (data, buf, offset) {\n if (!Array.isArray(data)) data = [data]\n for (let i = 0; i < data.length; i++) {\n if (typeof data[i] === 'string') {\n data[i] = b.from(data[i])\n }\n if (!b.isU8Arr(data[i])) {\n throw new Error('Must be a Buffer')\n }\n }\n\n if (!buf) buf = new Uint8Array(rtxt.encodingLength(data))\n if (!offset) offset = 0\n\n const oldOffset = offset\n offset += 2\n\n data.forEach(function (d) {\n buf[offset++] = d.length\n b.copy(d, buf, offset, 0, d.length)\n offset += d.length\n })\n\n b.writeUInt16BE(buf, offset - oldOffset - 2, oldOffset)\n rtxt.encode.bytes = offset - oldOffset\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n const oldOffset = offset\n let remaining = b.readUInt16BE(buf, offset)\n offset += 2\n\n const data = []\n while (remaining > 0) {\n const len = buf[offset++]\n --remaining\n if (remaining < len) {\n throw new Error('Buffer overflow')\n }\n data.push(buf.slice(offset, offset + len))\n offset += len\n remaining -= len\n }\n\n rtxt.decode.bytes = offset - oldOffset\n return data\n },\n encodingLength (data) {\n if (!Array.isArray(data)) data = [data]\n let length = 2\n data.forEach(function (buf) {\n if (typeof buf === 'string') {\n length += b.bytelength(buf) + 1\n } else {\n length += buf.length + 1\n }\n })\n return length\n }\n})\n\nconst rnull = codec({\n encode (data, buf, offset) {\n if (!buf) buf = new Uint8Array(rnull.encodingLength(data))\n if (!offset) offset = 0\n\n if (typeof data === 'string') data = b.from(data)\n if (!data) data = new Uint8Array(0)\n\n const oldOffset = offset\n offset += 2\n\n const len = data.length\n b.copy(data, buf, offset, 0, len)\n offset += len\n\n b.writeUInt16BE(buf, offset - oldOffset - 2, oldOffset)\n rnull.encode.bytes = offset - oldOffset\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n const oldOffset = offset\n const len = b.readUInt16BE(buf, offset)\n\n offset += 2\n\n const data = buf.slice(offset, offset + len)\n offset += len\n\n rnull.decode.bytes = offset - oldOffset\n return data\n },\n encodingLength (data) {\n if (!data) return 2\n return (b.isU8Arr(data) ? data.length : b.bytelength(data)) + 2\n }\n})\n\nconst rhinfo = codec({\n encode (data, buf, offset) {\n if (!buf) buf = new Uint8Array(rhinfo.encodingLength(data))\n if (!offset) offset = 0\n\n const oldOffset = offset\n offset += 2\n string.encode(data.cpu, buf, offset)\n offset += string.encode.bytes\n string.encode(data.os, buf, offset)\n offset += string.encode.bytes\n b.writeUInt16BE(buf, offset - oldOffset - 2, oldOffset)\n rhinfo.encode.bytes = offset - oldOffset\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n\n const oldOffset = offset\n\n const data = {}\n offset += 2\n data.cpu = string.decode(buf, offset)\n offset += string.decode.bytes\n data.os = string.decode(buf, offset)\n offset += string.decode.bytes\n rhinfo.decode.bytes = offset - oldOffset\n return data\n },\n encodingLength (data) {\n return string.encodingLength(data.cpu) + string.encodingLength(data.os) + 2\n }\n})\n\nconst rptr = codec({\n encode (data, buf, offset) {\n if (!buf) buf = new Uint8Array(rptr.encodingLength(data))\n if (!offset) offset = 0\n\n name.encode(data, buf, offset + 2)\n b.writeUInt16BE(buf, name.encode.bytes, offset)\n rptr.encode.bytes = name.encode.bytes + 2\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n\n const data = name.decode(buf, offset + 2)\n rptr.decode.bytes = name.decode.bytes + 2\n return data\n },\n encodingLength (data) {\n return name.encodingLength(data) + 2\n }\n})\n\nconst rsrv = codec({\n encode (data, buf, offset) {\n if (!buf) buf = new Uint8Array(rsrv.encodingLength(data))\n if (!offset) offset = 0\n\n b.writeUInt16BE(buf, data.priority || 0, offset + 2)\n b.writeUInt16BE(buf, data.weight || 0, offset + 4)\n b.writeUInt16BE(buf, data.port || 0, offset + 6)\n name.encode(data.target, buf, offset + 8)\n\n const len = name.encode.bytes + 6\n b.writeUInt16BE(buf, len, offset)\n\n rsrv.encode.bytes = len + 2\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n\n const len = b.readUInt16BE(buf, offset)\n\n const data = {}\n data.priority = b.readUInt16BE(buf, offset + 2)\n data.weight = b.readUInt16BE(buf, offset + 4)\n data.port = b.readUInt16BE(buf, offset + 6)\n data.target = name.decode(buf, offset + 8)\n\n rsrv.decode.bytes = len + 2\n return data\n },\n encodingLength (data) {\n return 8 + name.encodingLength(data.target)\n }\n})\n\nconst rcaa = codec({\n encode (data, buf, offset) {\n const len = rcaa.encodingLength(data)\n\n if (!buf) buf = new Uint8Array(rcaa.encodingLength(data))\n if (!offset) offset = 0\n\n if (data.issuerCritical) {\n data.flags = rcaa.ISSUER_CRITICAL\n }\n\n b.writeUInt16BE(buf, len - 2, offset)\n offset += 2\n buf[offset] = data.flags || 0\n offset += 1\n string.encode(data.tag, buf, offset)\n offset += string.encode.bytes\n b.write(buf, data.value, offset)\n offset += b.bytelength(data.value)\n\n rcaa.encode.bytes = len\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n\n const len = b.readUInt16BE(buf, offset)\n offset += 2\n\n const oldOffset = offset\n const data = {}\n data.flags = buf[offset]\n offset += 1\n data.tag = string.decode(buf, offset)\n offset += string.decode.bytes\n data.value = toUtf8(buf, offset, oldOffset + len)\n\n data.issuerCritical = !!(data.flags & rcaa.ISSUER_CRITICAL)\n\n rcaa.decode.bytes = len + 2\n\n return data\n },\n encodingLength (data) {\n return string.encodingLength(data.tag) + string.encodingLength(data.value) + 2\n }\n})\n\nrcaa.ISSUER_CRITICAL = 1 << 7\n\nconst rmx = codec({\n encode (data, buf, offset) {\n if (!buf) buf = new Uint8Array(rmx.encodingLength(data))\n if (!offset) offset = 0\n\n const oldOffset = offset\n offset += 2\n b.writeUInt16BE(buf, data.preference || 0, offset)\n offset += 2\n name.encode(data.exchange, buf, offset)\n offset += name.encode.bytes\n\n b.writeUInt16BE(buf, offset - oldOffset - 2, oldOffset)\n rmx.encode.bytes = offset - oldOffset\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n\n const oldOffset = offset\n\n const data = {}\n offset += 2\n data.preference = b.readUInt16BE(buf, offset)\n offset += 2\n data.exchange = name.decode(buf, offset)\n offset += name.decode.bytes\n\n rmx.decode.bytes = offset - oldOffset\n return data\n },\n encodingLength (data) {\n return 4 + name.encodingLength(data.exchange)\n }\n})\n\nconst ra = codec({\n encode (host, buf, offset) {\n if (!buf) buf = new Uint8Array(ra.encodingLength(host))\n if (!offset) offset = 0\n\n b.writeUInt16BE(buf, 4, offset)\n offset += 2\n ip.v4.encode(host, buf, offset)\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n\n offset += 2\n const host = ip.v4.decode(buf, offset)\n return host\n },\n bytes: 6\n})\n\nconst raaaa = codec({\n encode (host, buf, offset) {\n if (!buf) buf = new Uint8Array(raaaa.encodingLength(host))\n if (!offset) offset = 0\n\n b.writeUInt16BE(buf, 16, offset)\n offset += 2\n ip.v6.encode(host, buf, offset)\n raaaa.encode.bytes = 18\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n\n offset += 2\n const host = ip.v6.decode(buf, offset)\n raaaa.decode.bytes = 18\n return host\n },\n bytes: 18\n})\n\nconst alloc = size => new Uint8Array(size)\n\nconst roption = codec({\n encode (option, buf, offset) {\n if (!buf) buf = new Uint8Array(roption.encodingLength(option))\n if (!offset) offset = 0\n const oldOffset = offset\n\n const code = optioncodes.toCode(option.code)\n b.writeUInt16BE(buf, code, offset)\n offset += 2\n if (option.data) {\n b.writeUInt16BE(buf, option.data.length, offset)\n offset += 2\n b.copy(option.data, buf, offset)\n offset += option.data.length\n } else {\n switch (code) {\n // case 3: NSID. No encode makes sense.\n // case 5,6,7: Not implementable\n case 8: // ECS\n {\n // note: do IP math before calling\n const spl = option.sourcePrefixLength || 0\n const fam = option.family || ip.familyOf(option.ip, alloc)\n const ipBuf = ip.encode(option.ip, alloc)\n const ipLen = Math.ceil(spl / 8)\n b.writeUInt16BE(buf, ipLen + 4, offset)\n offset += 2\n b.writeUInt16BE(buf, fam, offset)\n offset += 2\n buf[offset++] = spl\n buf[offset++] = option.scopePrefixLength || 0\n\n b.copy(ipBuf, buf, offset, 0, ipLen)\n offset += ipLen\n }\n break\n // case 9: EXPIRE (experimental)\n // case 10: COOKIE. No encode makes sense.\n case 11: // KEEP-ALIVE\n if (option.timeout) {\n b.writeUInt16BE(buf, 2, offset)\n offset += 2\n b.writeUInt16BE(buf, option.timeout, offset)\n offset += 2\n } else {\n b.writeUInt16BE(buf, 0, offset)\n offset += 2\n }\n break\n case 12: // PADDING\n {\n const len = option.length || 0\n b.writeUInt16BE(buf, len, offset)\n offset += 2\n buf.fill(0, offset, offset + len)\n offset += len\n }\n break\n // case 13: CHAIN. Experimental.\n case 14: // KEY-TAG\n {\n const tagsLen = option.tags.length * 2\n b.writeUInt16BE(buf, tagsLen, offset)\n offset += 2\n for (const tag of option.tags) {\n b.writeUInt16BE(buf, tag, offset)\n offset += 2\n }\n }\n break\n default:\n throw new Error(`Unknown roption code: ${option.code}`)\n }\n }\n\n roption.encode.bytes = offset - oldOffset\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n const option = {}\n option.code = b.readUInt16BE(buf, offset)\n option.type = optioncodes.toString(option.code)\n offset += 2\n const len = b.readUInt16BE(buf, offset)\n offset += 2\n option.data = buf.slice(offset, offset + len)\n switch (option.code) {\n // case 3: NSID. No decode makes sense.\n case 8: // ECS\n option.family = b.readUInt16BE(buf, offset)\n offset += 2\n option.sourcePrefixLength = buf[offset++]\n option.scopePrefixLength = buf[offset++]\n {\n const padded = new Uint8Array((option.family === 1) ? 4 : 16)\n b.copy(buf, padded, 0, offset, offset + len - 4)\n option.ip = ip.decode(padded)\n }\n break\n // case 12: Padding. No decode makes sense.\n case 11: // KEEP-ALIVE\n if (len > 0) {\n option.timeout = b.readUInt16BE(buf, offset)\n offset += 2\n }\n break\n case 14:\n option.tags = []\n for (let i = 0; i < len; i += 2) {\n option.tags.push(b.readUInt16BE(buf, offset))\n offset += 2\n }\n // don't worry about default. caller will use data if desired\n }\n\n roption.decode.bytes = len + 4\n return option\n },\n encodingLength (option) {\n if (option.data) {\n return option.data.length + 4\n }\n const code = optioncodes.toCode(option.code)\n switch (code) {\n case 8: // ECS\n {\n const spl = option.sourcePrefixLength || 0\n return Math.ceil(spl / 8) + 8\n }\n case 11: // KEEP-ALIVE\n return (typeof option.timeout === 'number') ? 6 : 4\n case 12: // PADDING\n return option.length + 4\n case 14: // KEY-TAG\n return 4 + (option.tags.length * 2)\n }\n throw new Error(`Unknown roption code: ${option.code}`)\n }\n})\n\nconst ropt = codec({\n encode (options, buf, offset) {\n if (!buf) buf = new Uint8Array(ropt.encodingLength(options))\n if (!offset) offset = 0\n const oldOffset = offset\n\n const rdlen = encodingLengthList(options, roption)\n b.writeUInt16BE(buf, rdlen, offset)\n offset = encodeList(options, roption, buf, offset + 2)\n\n ropt.encode.bytes = offset - oldOffset\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n const oldOffset = offset\n\n const options = []\n let rdlen = b.readUInt16BE(buf, offset)\n offset += 2\n let o = 0\n while (rdlen > 0) {\n options[o++] = roption.decode(buf, offset)\n offset += roption.decode.bytes\n rdlen -= roption.decode.bytes\n }\n ropt.decode.bytes = offset - oldOffset\n return options\n },\n encodingLength (options) {\n return 2 + encodingLengthList(options || [], roption)\n }\n})\n\nconst rdnskey = codec({\n encode (key, buf, offset) {\n if (!buf) buf = new Uint8Array(rdnskey.encodingLength(key))\n if (!offset) offset = 0\n const oldOffset = offset\n\n const keydata = key.key\n if (!b.isU8Arr(keydata)) {\n throw new Error('Key must be a Buffer')\n }\n\n offset += 2 // Leave space for length\n b.writeUInt16BE(buf, key.flags, offset)\n offset += 2\n buf[offset] = rdnskey.PROTOCOL_DNSSEC\n offset += 1\n buf[offset] = key.algorithm\n offset += 1\n b.copy(keydata, buf, offset, 0, keydata.length)\n offset += keydata.length\n\n rdnskey.encode.bytes = offset - oldOffset\n b.writeUInt16BE(buf, rdnskey.encode.bytes - 2, oldOffset)\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n const oldOffset = offset\n\n const key = {}\n const length = b.readUInt16BE(buf, offset)\n offset += 2\n key.flags = b.readUInt16BE(buf, offset)\n offset += 2\n if (buf[offset] !== rdnskey.PROTOCOL_DNSSEC) {\n throw new Error('Protocol must be 3')\n }\n offset += 1\n key.algorithm = buf[offset]\n offset += 1\n key.key = buf.slice(offset, oldOffset + length + 2)\n offset += key.key.length\n rdnskey.decode.bytes = offset - oldOffset\n return key\n },\n encodingLength (key) {\n return 6 + b.bytelength(key.key)\n }\n})\n\nrdnskey.PROTOCOL_DNSSEC = 3\nrdnskey.ZONE_KEY = 0x80\nrdnskey.SECURE_ENTRYPOINT = 0x8000\n\nconst rrrsig = codec({\n encode (sig, buf, offset) {\n if (!buf) buf = new Uint8Array(rrrsig.encodingLength(sig))\n if (!offset) offset = 0\n const oldOffset = offset\n\n const signature = sig.signature\n if (!b.isU8Arr(signature)) {\n throw new Error('Signature must be a Buffer')\n }\n\n offset += 2 // Leave space for length\n b.writeUInt16BE(buf, types.toType(sig.typeCovered), offset)\n offset += 2\n buf[offset] = sig.algorithm\n offset += 1\n buf[offset] = sig.labels\n offset += 1\n b.writeUInt32BE(buf, sig.originalTTL, offset)\n offset += 4\n b.writeUInt32BE(buf, sig.expiration, offset)\n offset += 4\n b.writeUInt32BE(buf, sig.inception, offset)\n offset += 4\n b.writeUInt16BE(buf, sig.keyTag, offset)\n offset += 2\n name.encode(sig.signersName, buf, offset)\n offset += name.encode.bytes\n b.copy(signature, buf, offset, 0, signature.length)\n offset += signature.length\n\n rrrsig.encode.bytes = offset - oldOffset\n b.writeUInt16BE(buf, rrrsig.encode.bytes - 2, oldOffset)\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n const oldOffset = offset\n\n const sig = {}\n const length = b.readUInt16BE(buf, offset)\n offset += 2\n sig.typeCovered = types.toString(b.readUInt16BE(buf, offset))\n offset += 2\n sig.algorithm = buf[offset]\n offset += 1\n sig.labels = buf[offset]\n offset += 1\n sig.originalTTL = b.readUInt32BE(buf, offset)\n offset += 4\n sig.expiration = b.readUInt32BE(buf, offset)\n offset += 4\n sig.inception = b.readUInt32BE(buf, offset)\n offset += 4\n sig.keyTag = b.readUInt16BE(buf, offset)\n offset += 2\n sig.signersName = name.decode(buf, offset)\n offset += name.decode.bytes\n sig.signature = buf.slice(offset, oldOffset + length + 2)\n offset += sig.signature.length\n rrrsig.decode.bytes = offset - oldOffset\n return sig\n },\n encodingLength (sig) {\n return 20 +\n name.encodingLength(sig.signersName) +\n b.bytelength(sig.signature)\n }\n})\nconst rrp = codec({\n encode (data, buf, offset) {\n if (!buf) buf = new Uint8Array(rrp.encodingLength(data))\n if (!offset) offset = 0\n const oldOffset = offset\n\n offset += 2 // Leave space for length\n name.encode(data.mbox || '.', buf, offset)\n offset += name.encode.bytes\n name.encode(data.txt || '.', buf, offset)\n offset += name.encode.bytes\n rrp.encode.bytes = offset - oldOffset\n b.writeUInt16BE(buf, rrp.encode.bytes - 2, oldOffset)\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n const oldOffset = offset\n\n const data = {}\n offset += 2\n data.mbox = name.decode(buf, offset) || '.'\n offset += name.decode.bytes\n data.txt = name.decode(buf, offset) || '.'\n offset += name.decode.bytes\n rrp.decode.bytes = offset - oldOffset\n return data\n },\n encodingLength (data) {\n return 2 + name.encodingLength(data.mbox || '.') + name.encodingLength(data.txt || '.')\n }\n})\n\nconst typebitmap = codec({\n encode (typelist, buf, offset) {\n if (!buf) buf = new Uint8Array(typebitmap.encodingLength(typelist))\n if (!offset) offset = 0\n const oldOffset = offset\n\n const typesByWindow = []\n for (let i = 0; i < typelist.length; i++) {\n const typeid = types.toType(typelist[i])\n if (typesByWindow[typeid >> 8] === undefined) {\n typesByWindow[typeid >> 8] = []\n }\n typesByWindow[typeid >> 8][(typeid >> 3) & 0x1F] |= 1 << (7 - (typeid & 0x7))\n }\n\n for (let i = 0; i < typesByWindow.length; i++) {\n if (typesByWindow[i] !== undefined) {\n const windowBuf = b.from(typesByWindow[i])\n buf[offset] = i\n offset += 1\n buf[offset] = windowBuf.length\n offset += 1\n b.copy(windowBuf, buf, offset, 0, windowBuf.length)\n offset += windowBuf.length\n }\n }\n\n typebitmap.encode.bytes = offset - oldOffset\n return buf\n },\n decode (buf, offset, length) {\n if (!offset) offset = 0\n const oldOffset = offset\n\n const typelist = []\n while (offset - oldOffset < length) {\n const window = buf[offset]\n offset += 1\n const windowLength = buf[offset]\n offset += 1\n for (let i = 0; i < windowLength; i++) {\n const b = buf[offset + i]\n for (let j = 0; j < 8; j++) {\n if (b & (1 << (7 - j))) {\n const typeid = types.toString((window << 8) | (i << 3) | j)\n typelist.push(typeid)\n }\n }\n }\n offset += windowLength\n }\n\n typebitmap.decode.bytes = offset - oldOffset\n return typelist\n },\n encodingLength (typelist) {\n const extents = []\n for (let i = 0; i < typelist.length; i++) {\n const typeid = types.toType(typelist[i])\n extents[typeid >> 8] = Math.max(extents[typeid >> 8] || 0, typeid & 0xFF)\n }\n\n let len = 0\n for (let i = 0; i < extents.length; i++) {\n if (extents[i] !== undefined) {\n len += 2 + Math.ceil((extents[i] + 1) / 8)\n }\n }\n\n return len\n }\n})\n\nconst rnsec = codec({\n encode (record, buf, offset) {\n if (!buf) buf = new Uint8Array(rnsec.encodingLength(record))\n if (!offset) offset = 0\n const oldOffset = offset\n\n offset += 2 // Leave space for length\n name.encode(record.nextDomain, buf, offset)\n offset += name.encode.bytes\n typebitmap.encode(record.rrtypes, buf, offset)\n offset += typebitmap.encode.bytes\n\n rnsec.encode.bytes = offset - oldOffset\n b.writeUInt16BE(buf, rnsec.encode.bytes - 2, oldOffset)\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n const oldOffset = offset\n\n const record = {}\n const length = b.readUInt16BE(buf, offset)\n offset += 2\n record.nextDomain = name.decode(buf, offset)\n offset += name.decode.bytes\n record.rrtypes = typebitmap.decode(buf, offset, length - (offset - oldOffset))\n offset += typebitmap.decode.bytes\n\n rnsec.decode.bytes = offset - oldOffset\n return record\n },\n encodingLength (record) {\n return 2 +\n name.encodingLength(record.nextDomain) +\n typebitmap.encodingLength(record.rrtypes)\n }\n})\n\nconst rnsec3 = codec({\n encode (record, buf, offset) {\n if (!buf) buf = new Uint8Array(rnsec3.encodingLength(record))\n if (!offset) offset = 0\n const oldOffset = offset\n\n const salt = record.salt\n if (!b.isU8Arr(salt)) {\n throw new Error('salt must be a Buffer')\n }\n\n const nextDomain = record.nextDomain\n if (!b.isU8Arr(nextDomain)) {\n throw new Error('nextDomain must be a Buffer')\n }\n\n offset += 2 // Leave space for length\n buf[offset] = record.algorithm\n offset += 1\n buf[offset] = record.flags\n offset += 1\n b.writeUInt16BE(buf, record.iterations, offset)\n offset += 2\n buf[offset] = salt.length\n offset += 1\n b.copy(salt, buf, offset, 0, salt.length)\n offset += salt.length\n buf[offset] = nextDomain.length\n offset += 1\n b.copy(nextDomain, buf, offset, 0, nextDomain.length)\n offset += nextDomain.length\n typebitmap.encode(record.rrtypes, buf, offset)\n offset += typebitmap.encode.bytes\n\n rnsec3.encode.bytes = offset - oldOffset\n b.writeUInt16BE(buf, rnsec3.encode.bytes - 2, oldOffset)\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n const oldOffset = offset\n\n const record = {}\n const length = b.readUInt16BE(buf, offset)\n offset += 2\n record.algorithm = buf[offset]\n offset += 1\n record.flags = buf[offset]\n offset += 1\n record.iterations = b.readUInt16BE(buf, offset)\n offset += 2\n const saltLength = buf[offset]\n offset += 1\n record.salt = buf.slice(offset, offset + saltLength)\n offset += saltLength\n const hashLength = buf[offset]\n offset += 1\n record.nextDomain = buf.slice(offset, offset + hashLength)\n offset += hashLength\n record.rrtypes = typebitmap.decode(buf, offset, length - (offset - oldOffset))\n offset += typebitmap.decode.bytes\n\n rnsec3.decode.bytes = offset - oldOffset\n return record\n },\n encodingLength (record) {\n return 8 +\n record.salt.length +\n record.nextDomain.length +\n typebitmap.encodingLength(record.rrtypes)\n }\n})\n\nconst rds = codec({\n encode (digest, buf, offset) {\n if (!buf) buf = new Uint8Array(rds.encodingLength(digest))\n if (!offset) offset = 0\n const oldOffset = offset\n\n const digestdata = digest.digest\n if (!b.isU8Arr(digestdata)) {\n throw new Error('Digest must be a Buffer')\n }\n\n offset += 2 // Leave space for length\n b.writeUInt16BE(buf, digest.keyTag, offset)\n offset += 2\n buf[offset] = digest.algorithm\n offset += 1\n buf[offset] = digest.digestType\n offset += 1\n b.copy(digestdata, buf, offset, 0, digestdata.length)\n offset += digestdata.length\n\n rds.encode.bytes = offset - oldOffset\n b.writeUInt16BE(buf, rds.encode.bytes - 2, oldOffset)\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n const oldOffset = offset\n\n const digest = {}\n const length = b.readUInt16BE(buf, offset)\n offset += 2\n digest.keyTag = b.readUInt16BE(buf, offset)\n offset += 2\n digest.algorithm = buf[offset]\n offset += 1\n digest.digestType = buf[offset]\n offset += 1\n digest.digest = buf.slice(offset, oldOffset + length + 2)\n offset += digest.digest.length\n rds.decode.bytes = offset - oldOffset\n return digest\n },\n encodingLength (digest) {\n return 6 + b.bytelength(digest.digest)\n }\n})\n\nfunction renc (type) {\n switch (type.toUpperCase()) {\n case 'A': return ra\n case 'PTR': return rptr\n case 'CNAME': return rptr\n case 'DNAME': return rptr\n case 'TXT': return rtxt\n case 'NULL': return rnull\n case 'AAAA': return raaaa\n case 'SRV': return rsrv\n case 'HINFO': return rhinfo\n case 'CAA': return rcaa\n case 'NS': return rns\n case 'SOA': return rsoa\n case 'MX': return rmx\n case 'OPT': return ropt\n case 'DNSKEY': return rdnskey\n case 'RRSIG': return rrrsig\n case 'RP': return rrp\n case 'NSEC': return rnsec\n case 'NSEC3': return rnsec3\n case 'DS': return rds\n }\n return runknown\n}\n\nexport const answer = codec({\n encode (a, buf, offset) {\n if (!buf) buf = new Uint8Array(answer.encodingLength(a))\n if (!offset) offset = 0\n\n const oldOffset = offset\n\n name.encode(a.name, buf, offset)\n offset += name.encode.bytes\n\n b.writeUInt16BE(buf, types.toType(a.type), offset)\n\n if (a.type.toUpperCase() === 'OPT') {\n if (a.name !== '.') {\n throw new Error('OPT name must be root.')\n }\n b.writeUInt16BE(buf, a.udpPayloadSize || 4096, offset + 2)\n buf[offset + 4] = a.extendedRcode || 0\n buf[offset + 5] = a.ednsVersion || 0\n b.writeUInt16BE(buf, a.flags || 0, offset + 6)\n\n offset += 8\n ropt.encode(a.options || [], buf, offset)\n offset += ropt.encode.bytes\n } else {\n let klass = classes.toClass(a.class === undefined ? 'IN' : a.class)\n if (a.flush) klass |= FLUSH_MASK // the 1st bit of the class is the flush bit\n b.writeUInt16BE(buf, klass, offset + 2)\n b.writeUInt32BE(buf, a.ttl || 0, offset + 4)\n\n offset += 8\n const enc = renc(a.type)\n enc.encode(a.data, buf, offset)\n offset += enc.encode.bytes\n }\n\n answer.encode.bytes = offset - oldOffset\n return buf\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n\n const a = {}\n const oldOffset = offset\n\n a.name = name.decode(buf, offset)\n offset += name.decode.bytes\n a.type = types.toString(b.readUInt16BE(buf, offset))\n if (a.type === 'OPT') {\n a.udpPayloadSize = b.readUInt16BE(buf, offset + 2)\n a.extendedRcode = buf[offset + 4]\n a.ednsVersion = buf[offset + 5]\n a.flags = b.readUInt16BE(buf, offset + 6)\n a.flag_do = ((a.flags >> 15) & 0x1) === 1\n a.options = ropt.decode(buf, offset + 8)\n offset += 8 + ropt.decode.bytes\n } else {\n const klass = b.readUInt16BE(buf, offset + 2)\n a.ttl = b.readUInt32BE(buf, offset + 4)\n\n a.class = classes.toString(klass & NOT_FLUSH_MASK)\n a.flush = !!(klass & FLUSH_MASK)\n\n const enc = renc(a.type)\n a.data = enc.decode(buf, offset + 8)\n offset += 8 + enc.decode.bytes\n }\n\n answer.decode.bytes = offset - oldOffset\n return a\n },\n encodingLength (a) {\n const data = (a.data !== null && a.data !== undefined) ? a.data : a.options\n return name.encodingLength(a.name) + 8 + renc(a.type).encodingLength(data)\n }\n})\n\nexport const question = codec({\n encode (q, buf, offset) {\n if (!buf) buf = new Uint8Array(question.encodingLength(q))\n if (!offset) offset = 0\n\n const oldOffset = offset\n\n name.encode(q.name, buf, offset)\n offset += name.encode.bytes\n\n b.writeUInt16BE(buf, types.toType(q.type), offset)\n offset += 2\n\n b.writeUInt16BE(buf, classes.toClass(q.class === undefined ? 'IN' : q.class), offset)\n offset += 2\n\n question.encode.bytes = offset - oldOffset\n return q\n },\n decode (buf, offset) {\n if (!offset) offset = 0\n\n const oldOffset = offset\n const q = {}\n\n q.name = name.decode(buf, offset)\n offset += name.decode.bytes\n\n q.type = types.toString(b.readUInt16BE(buf, offset))\n offset += 2\n\n q.class = classes.toString(b.readUInt16BE(buf, offset))\n offset += 2\n\n const qu = !!(q.class & QU_MASK)\n if (qu) q.class &= NOT_QU_MASK\n\n question.decode.bytes = offset - oldOffset\n return q\n },\n encodingLength (q) {\n return name.encodingLength(q.name) + 4\n }\n})\n\nexport {\n rsoa as soa,\n rtxt as txt,\n rnull as null,\n runknown as unknown,\n rns as ns,\n rhinfo as hinfo,\n rptr as ptr,\n rptr as cname,\n rptr as dname,\n rsrv as srv,\n rcaa as caa,\n rmx as mx,\n ra as a,\n raaaa as aaaa,\n roption as option,\n ropt as opt,\n rdnskey as dnskey,\n rrrsig as rrsig,\n rrp as rp,\n rnsec as nsec,\n rnsec3 as nsec3,\n rds as ds,\n renc as enc\n}\n\nexport const AUTHORITATIVE_ANSWER = 1 << 10\nexport const TRUNCATED_RESPONSE = 1 << 9\nexport const RECURSION_DESIRED = 1 << 8\nexport const RECURSION_AVAILABLE = 1 << 7\nexport const AUTHENTIC_DATA = 1 << 5\nexport const CHECKING_DISABLED = 1 << 4\nexport const DNSSEC_OK = 1 << 15\n\nexport const packet = {\n encode: function (result, buf, offset) {\n const allocing = !buf\n\n if (allocing) buf = new Uint8Array(encodingLength(result))\n if (!offset) offset = 0\n\n const oldOffset = offset\n\n if (!result.questions) result.questions = []\n if (!result.answers) result.answers = []\n if (!result.authorities) result.authorities = []\n if (!result.additionals) result.additionals = []\n\n header.encode(result, buf, offset)\n offset += header.encode.bytes\n\n offset = encodeList(result.questions, question, buf, offset)\n offset = encodeList(result.answers, answer, buf, offset)\n offset = encodeList(result.authorities, answer, buf, offset)\n offset = encodeList(result.additionals, answer, buf, offset)\n\n packet.encode.bytes = offset - oldOffset\n\n // just a quick sanity check\n if (allocing && encode.bytes !== buf.length) {\n return buf.slice(0, encode.bytes)\n }\n\n return buf\n },\n decode: function (buf, offset) {\n if (!offset) offset = 0\n\n const oldOffset = offset\n const result = header.decode(buf, offset)\n offset += header.decode.bytes\n\n offset = decodeList(result.questions, question, buf, offset)\n offset = decodeList(result.answers, answer, buf, offset)\n offset = decodeList(result.authorities, answer, buf, offset)\n offset = decodeList(result.additionals, answer, buf, offset)\n\n packet.decode.bytes = offset - oldOffset\n\n return result\n },\n encodingLength: function (result) {\n return header.encodingLength(result) +\n encodingLengthList(result.questions || [], question) +\n encodingLengthList(result.answers || [], answer) +\n encodingLengthList(result.authorities || [], answer) +\n encodingLengthList(result.additionals || [], answer)\n }\n}\npacket.encode.bytes = 0\npacket.decode.bytes = 0\n\nfunction sanitizeSingle (input, type) {\n if (input.questions) {\n throw new Error('Only one .question object expected instead of a .questions array!')\n }\n const sanitized = Object.assign({\n type\n }, input)\n if (sanitized.question) {\n sanitized.questions = [sanitized.question]\n delete sanitized.question\n }\n return sanitized\n}\n\nexport const query = {\n encode: function (result, buf, offset) {\n buf = packet.encode(sanitizeSingle(result, 'query'), buf, offset)\n query.encode.bytes = packet.encode.bytes\n return buf\n },\n decode: function (buf, offset) {\n const res = packet.decode(buf, offset)\n query.decode.bytes = packet.decode.bytes\n if (res.questions) {\n res.question = res.questions[0]\n delete res.questions\n }\n return res\n },\n encodingLength: function (result) {\n return packet.encodingLength(sanitizeSingle(result, 'query'))\n }\n}\nquery.encode.bytes = 0\nquery.decode.bytes = 0\n\nexport const response = {\n encode: function (result, buf, offset) {\n buf = packet.encode(sanitizeSingle(result, 'response'), buf, offset)\n response.encode.bytes = packet.encode.bytes\n return buf\n },\n decode: function (buf, offset) {\n const res = packet.decode(buf, offset)\n response.decode.bytes = packet.decode.bytes\n if (res.questions) {\n res.question = res.questions[0]\n delete res.questions\n }\n return res\n },\n encodingLength: function (result) {\n return packet.encodingLength(sanitizeSingle(result, 'response'))\n }\n}\nresponse.encode.bytes = 0\nresponse.decode.bytes = 0\n\nexport const encode = packet.encode\nexport const decode = packet.decode\nexport const encodingLength = packet.encodingLength\n\nexport function streamEncode (result) {\n const buf = encode(result)\n const combine = new Uint8Array(2 + buf.byteLength)\n b.writeUInt16BE(combine, buf.byteLength)\n b.copy(buf, combine, 2, 0, buf.length)\n streamEncode.bytes = combine.byteLength\n return combine\n}\nstreamEncode.bytes = 0\n\nexport function streamDecode (sbuf) {\n const len = b.readUInt16BE(sbuf, 0)\n if (sbuf.byteLength < len + 2) {\n // not enough data\n return null\n }\n const result = decode(sbuf.slice(2))\n streamDecode.bytes = decode.bytes\n return result\n}\nstreamDecode.bytes = 0\n\nexport function encodingLengthList (list, enc) {\n let len = 0\n for (let i = 0; i < list.length; i++) len += enc.encodingLength(list[i])\n return len\n}\n\nexport function encodeList (list, enc, buf, offset) {\n for (let i = 0; i < list.length; i++) {\n enc.encode(list[i], buf, offset)\n offset += enc.encode.bytes\n }\n return offset\n}\n\nexport function decodeList (list, enc, buf, offset) {\n for (let i = 0; i < list.length; i++) {\n list[i] = enc.decode(buf, offset)\n offset += enc.decode.bytes\n }\n return offset\n}\n","export const PREFERS_PADDING = 1\nexport const PREFERS_NO_PADDING = 2\n\nexport function make (name, charset, padding, paddingMode) {\n if (charset.length !== 64) {\n throw new Error(`Charset needs to be 64 characters long! (${charset.length})`)\n }\n const byCharCode = new Uint8Array(256)\n const byNum = new Uint8Array(64)\n for (let i = 0; i < 64; i += 1) {\n const code = charset.charCodeAt(i)\n if (code > 255) {\n throw new Error(`Character #${i} in charset [code=${code}, char=${charset.charAt(i)}] is too high! (max=255)`)\n }\n if (byCharCode[code] !== 0) {\n throw new Error(`Character [code=${code}, char=${charset.charAt(i)}] is more than once in the charset!`)\n }\n byCharCode[code] = i\n byNum[i] = code\n }\n const padCode = padding.charCodeAt(0)\n const codec = {\n name,\n encodingLength (str) {\n const strLen = str.length\n const len = strLen * 0.75 | 0\n if (str.charCodeAt(strLen - 1) === padCode) {\n if (str.charCodeAt(strLen - 2) === padCode) {\n return len - 2\n }\n return len - 1\n }\n return len\n },\n encode (str, buffer, offset) {\n if (buffer === null || buffer === undefined) {\n buffer = new Uint8Array(codec.encodingLength(str))\n }\n if (offset === null || offset === undefined) {\n offset = 0\n }\n\n let strLen = str.length\n if (str.charCodeAt(strLen - 1) === padCode) {\n if (str.charCodeAt(strLen - 2) === padCode) {\n strLen -= 2\n } else {\n strLen -= 1\n }\n }\n\n const padding = strLen % 4\n const safeLen = strLen - padding\n\n let off = offset\n let i = 0\n while (i < safeLen) {\n const code =\n (byCharCode[str.charCodeAt(i)] << 18) |\n (byCharCode[str.charCodeAt(i + 1)] << 12) |\n (byCharCode[str.charCodeAt(i + 2)] << 6) |\n byCharCode[str.charCodeAt(i + 3)]\n buffer[off++] = code >> 16\n buffer[off++] = code >> 8\n buffer[off++] = code\n i += 4\n }\n\n if (padding === 3) {\n const code =\n (byCharCode[str.charCodeAt(i)] << 10) |\n (byCharCode[str.charCodeAt(i + 1)] << 4) |\n (byCharCode[str.charCodeAt(i + 2)] >> 2)\n buffer[off++] = code >> 8\n buffer[off++] = code\n } else if (padding === 2) {\n buffer[off++] = (byCharCode[str.charCodeAt(i)] << 2) |\n (byCharCode[str.charCodeAt(i + 1)] >> 4)\n }\n\n codec.encode.bytes = off - offset\n return buffer\n },\n decode (buffer, start, end) {\n if (start === null || start === undefined) {\n start = 0\n }\n if (end === null || end === undefined) {\n end = buffer.length\n }\n\n const length = end - start\n const pad = length % 3\n const safeEnd = start + length - pad\n const codes = []\n for (let off = start; off < safeEnd; off += 3) {\n const num = (buffer[off] << 16) | ((buffer[off + 1] << 8)) | buffer[off + 2]\n codes.push(\n byNum[num >> 18 & 0x3F],\n byNum[num >> 12 & 0x3F],\n byNum[num >> 6 & 0x3F],\n byNum[num & 0x3F]\n )\n }\n\n if (pad === 2) {\n const num = (buffer[end - 2] << 8) + buffer[end - 1]\n codes.push(\n byNum[num >> 10],\n byNum[(num >> 4) & 0x3F],\n byNum[(num << 2) & 0x3F]\n )\n if (paddingMode === PREFERS_PADDING) {\n codes.push(padCode)\n }\n } else if (pad === 1) {\n const num = buffer[end - 1]\n codes.push(\n byNum[num >> 2],\n byNum[(num << 4) & 0x3F]\n )\n if (paddingMode === PREFERS_PADDING) {\n codes.push(padCode, padCode)\n }\n }\n\n codec.decode.bytes = length\n return String.fromCharCode.apply(String, codes)\n }\n }\n return codec\n}\n\nexport const base64 = make('base64', 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/', '=', PREFERS_PADDING)\n// https://datatracker.ietf.org/doc/html/rfc4648#section-5\nexport const base64URL = make('base64-url', 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_', '=', PREFERS_NO_PADDING)\n","let AbortError = typeof global !== 'undefined' ? global.AbortError : typeof window !== 'undefined' ? window.AbortError : null\nif (!AbortError) {\n AbortError = class AbortError extends Error {\n constructor (message = 'Request aborted.') {\n super(message)\n }\n }\n}\nAbortError.prototype.name = 'AbortError'\nAbortError.prototype.code = 'ABORT_ERR'\n\nconst URL = (typeof globalThis !== 'undefined' && globalThis.URL) || require('url').URL\n\nexport { AbortError, URL }\n\nexport class HTTPStatusError extends Error {\n constructor (uri, code, method) {\n super('status=' + code + ' while requesting ' + uri + ' [' + method + ']')\n this.uri = uri\n this.status = code\n this.method = method\n }\n\n toJSON () {\n return {\n code: this.code,\n uri: this.uri,\n status: this.status,\n method: this.method,\n endpoint: this.endpoint\n }\n }\n}\nHTTPStatusError.prototype.name = 'HTTPStatusError'\nHTTPStatusError.prototype.code = 'HTTP_STATUS'\n\nexport class ResponseError extends Error {\n constructor (message, cause) {\n super(message)\n this.cause = cause\n }\n\n toJSON () {\n return {\n message: this.message,\n endpoint: this.endpoint,\n code: this.code,\n cause: reduceError(this.cause)\n }\n }\n}\nResponseError.prototype.name = 'ResponseError'\nResponseError.prototype.code = 'RESPONSE_ERR'\n\nexport class TimeoutError extends Error {\n constructor (timeout) {\n super('Timeout (t=' + timeout + ').')\n this.timeout = timeout\n }\n\n toJSON () {\n return {\n code: this.code,\n endpoint: this.endpoint,\n timeout: this.timeout\n }\n }\n}\nTimeoutError.prototype.name = 'TimeoutError'\nTimeoutError.prototype.code = 'ETIMEOUT'\n\nconst v4Regex = /^((\\d{1,3}\\.){3,3}\\d{1,3})(:(\\d{2,5}))?$/\nconst v6Regex = /^((::)?(((\\d{1,3}\\.){3}(\\d{1,3}){1})?([0-9a-f]){0,4}:{0,2}){1,8}(::)?)(:(\\d{2,5}))?$/i\n\nexport function reduceError (err) {\n if (typeof err === 'string') {\n return {\n message: err\n }\n }\n try {\n const json = JSON.stringify(err)\n if (json !== '{}') {\n return JSON.parse(json)\n }\n } catch (e) {}\n const error = {\n message: String(err.message || err)\n }\n if (err.code !== undefined) {\n error.code = String(err.code)\n }\n return error\n}\n\nconst baseParts = /^(([a-z0-9]+:)\\/\\/)?([^/[\\s:]+|\\[[^\\]]+\\])?(:([^/\\s]+))?(\\/[^\\s]*)?(.*)$/\nconst httpFlags = /\\[(post|get|((ipv4|ipv6|name)=([^\\]]+)))\\]/ig\nconst updFlags = /\\[(((pk|name)=([^\\]]+)))\\]/ig\n\nexport function parseEndpoint (endpoint) {\n const parts = baseParts.exec(endpoint)\n const protocol = parts[2] || 'https:'\n const host = parts[3]\n const port = parts[5]\n const path = parts[6]\n const rest = parts[7]\n if (protocol === 'https:' || protocol === 'http:') {\n const flags = parseFlags(rest, httpFlags)\n return {\n name: flags.name,\n protocol,\n ipv4: flags.ipv4,\n ipv6: flags.ipv6,\n host,\n port,\n path,\n method: flags.post ? 'POST' : 'GET'\n }\n }\n if (protocol === 'udp:' || protocol === 'udp4:' || protocol === 'udp6:') {\n const flags = parseFlags(rest, updFlags)\n const v6Parts = /^\\[(.*)\\]$/.exec(host)\n if (v6Parts && protocol === 'udp4:') {\n throw new Error(`Endpoint parsing error: Cannot use ipv6 host with udp4: (endpoint=${endpoint})`)\n }\n if (!v6Parts && protocol === 'udp6:') {\n throw new Error(`Endpoint parsing error: Incorrectly formatted host for udp6: (endpoint=${endpoint})`)\n }\n if (v6Parts) {\n return new UDP6Endpoint({ protocol: 'udp6:', ipv6: v6Parts[1], port, pk: flags.pk, name: flags.name })\n }\n return new UDP4Endpoint({ protocol: 'udp4:', ipv4: host, port, pk: flags.pk, name: flags.name })\n }\n throw new InvalidProtocolError(protocol, endpoint)\n}\n\nfunction parseFlags (rest, regex) {\n regex.lastIndex = 0\n const result = {}\n while (true) {\n const match = regex.exec(rest)\n if (!match) break\n if (match[2]) {\n result[match[3].toLowerCase()] = match[4]\n } else {\n result[match[1].toLowerCase()] = true\n }\n }\n return result\n}\n\nexport class InvalidProtocolError extends Error {\n constructor (protocol, endpoint) {\n super(`Invalid Endpoint: unsupported protocol \"${protocol}\" for endpoint: ${endpoint}, supported protocols: ${supportedProtocols.join(', ')}`)\n this.protocol = protocol\n this.endpoint = endpoint\n }\n\n toJSON () {\n return {\n code: this.code,\n endpoint: this.endpoint,\n timeout: this.timeout\n }\n }\n}\nInvalidProtocolError.prototype.name = 'InvalidProtocolError'\nInvalidProtocolError.prototype.code = 'EPROTOCOL'\n\nexport const supportedProtocols = ['http:', 'https:', 'udp4:', 'udp6:']\n\nexport class BaseEndpoint {\n constructor (opts, isHTTP) {\n this.name = opts.name || null\n this.protocol = opts.protocol\n const port = typeof opts.port === 'string' ? opts.port = parseInt(opts.port, 10) : opts.port\n if (port === undefined || port === null) {\n this.port = isHTTP\n ? (this.protocol === 'https:' ? 443 : 80)\n : (opts.pk ? 443 : 53)\n } else if (typeof port !== 'number' && !isNaN(port)) {\n throw new Error(`Invalid Endpoint: port \"${opts.port}\" needs to be a number: ${JSON.stringify(opts)}`)\n } else {\n this.port = port\n }\n }\n\n toJSON () {\n return this.toString()\n }\n}\n\nexport class UDPEndpoint extends BaseEndpoint {\n constructor (opts) {\n super(opts, false)\n this.pk = opts.pk || null\n }\n\n toString () {\n const port = this.port !== (this.pk ? 443 : 53) ? `:${this.port}` : ''\n const pk = this.pk ? ` [pk=${this.pk}]` : ''\n const name = this.name ? ` [name=${this.name}]` : ''\n return `udp://${this.ipv4 || `[${this.ipv6}]`}${port}${pk}${name}`\n }\n}\n\nexport class UDP4Endpoint extends UDPEndpoint {\n constructor (opts) {\n super(Object.assign({ protocol: 'udp4:' }, opts))\n if (!opts.ipv4 || typeof opts.ipv4 !== 'string') {\n throw new Error(`Invalid Endpoint: .ipv4 \"${opts.ipv4}\" needs to be set: ${JSON.stringify(opts)}`)\n }\n this.ipv4 = opts.ipv4\n }\n}\n\nexport class UDP6Endpoint extends UDPEndpoint {\n constructor (opts) {\n super(Object.assign({ protocol: 'udp6:' }, opts))\n if (!opts.ipv6 || typeof opts.ipv6 !== 'string') {\n throw new Error(`Invalid Endpoint: .ipv6 \"${opts.ipv6}\" needs to be set: ${JSON.stringify(opts)}`)\n }\n this.ipv6 = opts.ipv6\n }\n}\n\nfunction safeHost (host) {\n return v6Regex.test(host) && !v4Regex.test(host) ? `[${host}]` : host\n}\n\nexport class HTTPEndpoint extends BaseEndpoint {\n constructor (opts) {\n super(Object.assign({ protocol: 'https:' }, opts), true)\n if (!opts.host) {\n if (opts.ipv4) {\n opts.host = opts.ipv4\n }\n if (opts.ipv6) {\n opts.host = `[${opts.ipv6}]`\n }\n }\n if (!opts.host || typeof opts.host !== 'string') {\n throw new Error(`Invalid Endpoint: host \"${opts.path}\" needs to be set: ${JSON.stringify(opts)}`)\n }\n this.host = opts.host\n this.path = opts.path || '/dns-query'\n this.method = /^post$/i.test(opts.method) ? 'POST' : 'GET'\n this.ipv4 = opts.ipv4\n this.ipv6 = opts.ipv6\n if (!this.ipv6) {\n const v6Parts = v6Regex.exec(this.host)\n if (v6Parts) {\n this.ipv6 = v6Parts[1]\n }\n }\n if (!this.ipv4) {\n if (v4Regex.test(this.host)) {\n this.ipv4 = this.host\n }\n }\n const url = `${this.protocol}//${safeHost(this.host)}:${this.port}${this.path}`\n try {\n this.url = new URL(url)\n } catch (err) {\n throw new Error(err.message + ` [${url}]`)\n }\n }\n\n toString () {\n const protocol = this.protocol === 'https:' ? '' : 'http://'\n const port = this.port !== (this.protocol === 'https:' ? 443 : 80) ? `:${this.port}` : ''\n const method = this.method !== 'GET' ? ' [post]' : ''\n const path = this.path === '/dns-query' ? '' : this.path\n const name = this.name ? ` [name=${this.name}]` : ''\n const ipv4 = this.ipv4 && this.ipv4 !== this.host ? ` [ipv4=${this.ipv4}]` : ''\n const ipv6 = this.ipv6 && this.ipv6 !== this.host ? ` [ipv6=${this.ipv6}]` : ''\n return `${protocol}${safeHost(this.host)}${port}${path}${method}${ipv4}${ipv6}${name}`\n }\n}\n\nexport function toEndpoint (input) {\n let opts\n if (typeof input === 'string') {\n opts = parseEndpoint(input)\n } else {\n if (typeof input !== 'object' || input === null || Array.isArray(input)) {\n throw new Error(`Can not convert ${input} to an endpoint`)\n } else if (input instanceof BaseEndpoint) {\n return input\n }\n opts = input\n }\n if (opts.protocol === null || opts.protocol === undefined) {\n opts.protocol = 'https:'\n }\n const protocol = opts.protocol\n if (protocol === 'udp4:') {\n return new UDP4Endpoint(opts)\n }\n if (protocol === 'udp6:') {\n return new UDP6Endpoint(opts)\n }\n if (protocol === 'https:' || protocol === 'http:') {\n return new HTTPEndpoint(opts)\n }\n throw new InvalidProtocolError(protocol, JSON.stringify(opts))\n}\n","/* global XMLHttpRequest, localStorage */\nimport * as utf8Codec from 'utf8-codec'\nimport { base64URL } from '@leichtgewicht/base64-codec'\nimport {\n AbortError,\n HTTPStatusError,\n TimeoutError,\n URL\n} from './common.mjs'\nconst contentType = 'application/dns-message'\n\nfunction noop () { }\n\nexport function queryDns () {\n throw new Error('Only \"doh\" endpoints are supported in the browser')\n}\n\nexport async function loadJSON (url, cache, timeout, abortSignal) {\n const cacheKey = cache ? cache.localStoragePrefix + cache.name : null\n if (cacheKey) {\n try {\n const cached = JSON.parse(localStorage.getItem(cacheKey))\n if (cached && cached.time > cache.maxTime) {\n return cached\n }\n } catch (err) {}\n }\n const { data } = await requestRaw(url, 'GET', null, timeout, abortSignal)\n const result = {\n time: Date.now(),\n data: JSON.parse(utf8Codec.decode(data))\n }\n if (cacheKey) {\n try {\n localStorage.setItem(cacheKey, JSON.stringify(result))\n } catch (err) {\n result.time = null\n }\n }\n return result\n}\n\nfunction requestRaw (url, method, data, timeout, abortSignal) {\n return new Promise((resolve, reject) => {\n const target = new URL(url)\n if (method === 'GET' && data) {\n target.search = '?dns=' + base64URL.decode(data)\n }\n const uri = target.toString()\n const xhr = new XMLHttpRequest()\n xhr.open(method, uri, true)\n xhr.setRequestHeader('Accept', contentType)\n if (method === 'POST') {\n xhr.setRequestHeader('Content-Type', contentType)\n }\n xhr.responseType = 'arraybuffer'\n xhr.timeout = timeout\n xhr.ontimeout = ontimeout\n xhr.onreadystatechange = onreadystatechange\n xhr.onerror = onerror\n xhr.onload = onload\n if (method === 'POST') {\n xhr.send(data)\n } else {\n xhr.send()\n }\n\n if (abortSignal) {\n abortSignal.addEventListener('abort', onabort)\n }\n\n function ontimeout () {\n finish(new TimeoutError(timeout))\n try {\n xhr.abort()\n } catch (e) { }\n }\n\n function onload () {\n if (xhr.status !== 200) {\n finish(new HTTPStatusError(uri, xhr.status, method))\n } else {\n let buf\n if (typeof xhr.response === 'string') {\n buf = utf8Codec.encode(xhr.response)\n } else if (xhr.response instanceof Uint8Array) {\n buf = xhr.response\n } else if (Array.isArray(xhr.response) || xhr.response instanceof ArrayBuffer) {\n buf = new Uint8Array(xhr.response)\n } else {\n throw new Error('Unprocessable response ' + xhr.response)\n }\n finish(null, buf)\n }\n }\n\n function onreadystatechange () {\n if (xhr.readyState > 1 && xhr.status !== 200 && xhr.status !== 0) {\n finish(new HTTPStatusError(uri, xhr.status, method))\n try {\n xhr.abort()\n } catch (e) { }\n }\n }\n\n let finish = function (error, data) {\n finish = noop\n if (abortSignal) {\n abortSignal.removeEventListener('abort', onabort)\n }\n if (error) {\n resolve({\n error,\n response: xhr\n })\n } else {\n resolve({\n data,\n response: xhr\n })\n }\n }\n\n function onerror () {\n finish(xhr.status === 200 ? new Error('Inexplicable XHR Error') : new HTTPStatusError(uri, xhr.status, method))\n }\n\n function onabort () {\n finish(new AbortError())\n try {\n xhr.abort()\n } catch (e) { }\n }\n })\n}\n\nexport function request (url, method, packet, timeout, abortSignal) {\n return requestRaw(url, method, packet, timeout, abortSignal)\n}\n\nexport function processResolvers (resolvers) {\n return resolvers.filter(resolver => resolver.cors || resolver.endpoint.cors)\n}\n","import * as packet from '@leichtgewicht/dns-packet'\nimport { toRcode } from '@leichtgewicht/dns-packet/rcodes.js'\nimport { decode } from 'utf8-codec'\nimport * as lib from './lib.mjs'\nimport { resolvers as backupResolvers } from './resolvers.mjs'\nimport {\n AbortError,\n ResponseError,\n URL,\n toEndpoint\n} from './common.mjs'\n\nexport {\n TimeoutError,\n HTTPStatusError,\n AbortError,\n ResponseError,\n BaseEndpoint,\n HTTPEndpoint,\n UDP4Endpoint,\n UDP6Endpoint,\n parseEndpoint,\n toEndpoint\n} from './common.mjs'\n\nexport const DNS_RCODE_ERROR = {\n 1: 'FormErr',\n 2: 'ServFail',\n 3: 'NXDomain',\n 4: 'NotImp',\n 5: 'Refused',\n 6: 'YXDomain',\n 7: 'YXRRSet',\n 8: 'NXRRSet',\n 9: 'NotAuth',\n 10: 'NotZone',\n 11: 'DSOTYPENI'\n}\n\nexport const DNS_RCODE_MESSAGE = {\n // https://www.iana.org/assignments/dns-parameters/dns-parameters.xhtml#dns-parameters-6\n 1: 'The name server was unable to interpret the query.',\n 2: 'The name server was unable to process this query due to a problem with the name server.',\n 3: 'Non-Existent Domain.',\n 4: 'The name server does not support the requested kind of query.',\n 5: 'The name server refuses to perform the specified operation for policy reasons.',\n 6: 'Name Exists when it should not.',\n 7: 'RR Set Exists when it should not.',\n 8: 'RR Set that should exist does not.',\n 9: 'Server Not Authoritative for zone / Not Authorized.',\n 10: 'Name not contained in zone.',\n 11: 'DSO-TYPE Not Implemented.'\n}\n\nexport class DNSRcodeError extends Error {\n constructor (rcode, question) {\n super(`${(DNS_RCODE_MESSAGE[rcode] || 'Undefined error.')} (rcode=${rcode}${DNS_RCODE_ERROR[rcode] ? `, error=${DNS_RCODE_ERROR[rcode]}` : ''}, question=${JSON.stringify(question)})`)\n this.rcode = rcode\n this.code = `DNS_RCODE_${rcode}`\n this.error = DNS_RCODE_ERROR[rcode]\n this.question = question\n }\n\n toJSON () {\n return {\n code: this.code,\n error: this.error,\n question: this.question,\n endpoint: this.endpoint\n }\n }\n}\n\nexport function validateResponse (data, question) {\n const rcode = toRcode(data.rcode)\n if (rcode !== 0) {\n const err = new DNSRcodeError(rcode, question)\n err.endpoint = data.endpoint\n throw err\n }\n return data\n}\n\nfunction processResolvers (res) {\n const time = (res.time === null || res.time === undefined) ? Date.now() : res.time\n const resolvers = lib.processResolvers(res.data.map(resolver => {\n resolver.endpoint = toEndpoint(Object.assign({ name: resolver.name }, resolver.endpoint))\n return resolver\n }))\n const endpoints = resolvers.map(resolver => resolver.endpoint)\n return {\n data: {\n resolvers,\n resolverByName: resolvers.reduce((byName, resolver) => {\n byName[resolver.name] = resolver\n return byName\n }, {}),\n endpoints,\n endpointByName: endpoints.reduce((byName, endpoint) => {\n byName[endpoint.name] = endpoint\n return byName\n }, {})\n },\n time\n }\n}\n\nexport const backup = processResolvers(backupResolvers)\n\nfunction toMultiQuery (singleQuery) {\n const query = Object.assign({\n type: 'query'\n }, singleQuery)\n delete query.question\n query.questions = []\n if (singleQuery.question) {\n query.questions.push(singleQuery.question)\n }\n return query\n}\n\nfunction queryOne (endpoint, query, timeout, abortSignal) {\n if (abortSignal && abortSignal.aborted) {\n return Promise.reject(new AbortError())\n }\n if (endpoint.protocol === 'udp4:' || endpoint.protocol === 'udp6:') {\n return lib.queryDns(endpoint, query, timeout, abortSignal)\n }\n return queryDoh(endpoint, query, timeout, abortSignal)\n}\n\nfunction queryDoh (endpoint, query, timeout, abortSignal) {\n return lib.request(\n endpoint.url,\n endpoint.method,\n packet.encode(Object.assign({\n flags: packet.RECURSION_DESIRED\n }, query)),\n timeout,\n abortSignal\n ).then(\n function (res) {\n const data = res.data\n const response = res.response\n let error = res.error\n if (error === undefined) {\n if (data.length === 0) {\n error = new ResponseError('Empty.')\n } else {\n try {\n const decoded = packet.decode(data)\n decoded.response = response\n return decoded\n } catch (err) {\n error = new ResponseError('Invalid packet (cause=' + err.message + ')', err)\n }\n }\n }\n throw Object.assign(error, { response })\n }\n )\n}\n\nconst UPDATE_URL = new URL('https://martinheidegger.github.io/dns-query/resolvers.json')\n\nfunction concatUint8 (arrs) {\n const res = new Uint8Array(\n arrs.reduce((len, arr) => len + arr.length, 0)\n )\n let pos = 0\n for (const arr of arrs) {\n res.set(arr, pos)\n pos += arr.length\n }\n return res\n}\n\nexport function combineTXT (inputs) {\n return decode(concatUint8(inputs))\n}\n\nfunction isNameString (entry) {\n return /^@/.test(entry)\n}\n\nexport class Wellknown {\n constructor (opts) {\n this.opts = Object.assign({\n timeout: 5000,\n update: true,\n updateURL: UPDATE_URL,\n persist: false,\n localStoragePrefix: 'dnsquery_',\n maxAge: 300000 // 5 minutes\n }, opts)\n this._dataP = null\n }\n\n _data (force, outdated) {\n if (!force && this._dataP !== null) {\n return this._dataP.then(res => {\n if (res.time < Date.now() - this.opts.maxAge) {\n return this._data(true, res)\n }\n return res\n })\n }\n this._dataP = (!this.opts.update\n ? Promise.resolve(backup)\n : lib.loadJSON(\n this.opts.updateURL,\n this.opts.persist\n ? {\n name: 'resolvers.json',\n localStoragePrefix: this.opts.localStoragePrefix,\n maxTime: Date.now() - this.opts.maxAge\n }\n : null,\n this.opts.timeout\n )\n .then(res => processResolvers({\n data: res.data.resolvers,\n time: res.time\n }))\n .catch(() => outdated || backup)\n )\n return this._dataP\n }\n\n data () {\n return this._data(false).then(data => data.data)\n }\n\n endpoints (input) {\n if (input === null || input === undefined) {\n return this.data().then(data => data.endpoints)\n }\n if (input === 'doh') {\n input = filterDoh\n }\n if (input === 'dns') {\n input = filterDns\n }\n if (typeof input === 'function') {\n return this.data().then(data => data.endpoints.filter(input))\n }\n if (typeof input === 'string' || typeof input[Symbol.iterator] !== 'function') {\n return Promise.reject(new Error(`Endpoints (${input}) needs to be iterable (array).`))\n }\n input = Array.from(input).filter(Boolean)\n if (input.findIndex(isNameString) === -1) {\n try {\n return Promise.resolve(input.map(toEndpoint))\n } catch (err) {\n return Promise.reject(err)\n }\n }\n return this.data().then(data =>\n input.map(entry => {\n if (isNameString(entry)) {\n const found = data.endpointByName[entry.substring(1)]\n if (!found) {\n throw new Error(`Endpoint ${entry} is not known.`)\n }\n return found\n }\n return toEndpoint(entry)\n })\n )\n }\n}\n\nexport const wellknown = new Wellknown()\n\nfunction isPromise (input) {\n if (input === null) {\n return false\n }\n if (typeof input !== 'object') {\n return false\n }\n return typeof input.then === 'function'\n}\n\nfunction toPromise (input) {\n return isPromise(input) ? input : Promise.resolve(input)\n}\n\nexport function query (q, opts) {\n opts = Object.assign({\n retries: 5,\n timeout: 30000 // 30 seconds\n }, opts)\n if (!q.question) return Promise.reject(new Error('To request data you need to specify a .question!'))\n return toPromise(opts.endpoints)\n .then(endpoints => {\n if (!Array.isArray(endpoints) || endpoints.length === 0) {\n throw new Error('No endpoints defined to lookup dns records.')\n }\n return queryN(endpoints.map(toEndpoint), toMultiQuery(q), opts)\n })\n .then(data => {\n data.question = data.questions[0]\n delete data.questions\n return data\n })\n}\n\nexport function lookupTxt (domain, opts) {\n const q = Object.assign({\n question: {\n type: 'TXT',\n name: domain\n }\n }, opts.query)\n return query(q, opts)\n .then(data => {\n validateResponse(data, q)\n return {\n entries: (data.answers || [])\n .filter(answer => answer.type === 'TXT' && answer.data)\n .map(answer => {\n return ({\n data: combineTXT(answer.data),\n ttl: answer.ttl\n })\n })\n .sort((a, b) => {\n if (a.data > b.data) return 1\n if (a.data < b.data) return -1\n return 0\n }),\n endpoint: data.endpoint\n }\n })\n}\n\nfunction queryN (endpoints, q, opts) {\n const endpoint = endpoints.length === 1\n ? endpoints[0]\n : endpoints[Math.floor(Math.random() * endpoints.length) % endpoints.length]\n return queryOne(endpoint, q, opts.timeout, opts.signal)\n .then(\n data => {\n // Add the endpoint to give a chance to identify which endpoint returned the result\n data.endpoint = endpoint.toString()\n return data\n },\n err => {\n if (err.name === 'AbortError' || opts.retries === 0) {\n err.endpoint = endpoint.toString()\n throw err\n }\n if (opts.retries > 0) {\n opts.retries -= 1\n }\n return queryN(endpoints, q, opts)\n }\n )\n}\n\nfunction filterDoh (endpoint) {\n return endpoint.protocol === 'https:' || endpoint.protocol === 'http:'\n}\n\nfunction filterDns (endpoint) {\n return endpoint.protocol === 'udp4:' || endpoint.protocol === 'udp6:'\n}\n","export const resolvers = {\n data: [\n {\n name: 'adfree.usableprivacy.net',\n endpoint: {\n protocol: 'https:',\n host: 'adfree.usableprivacy.net'\n },\n description: 'Public updns DoH service with advertising, tracker and malware filters.\\nHosted in Europe by @usableprivacy, details see: https://docs.usableprivacy.com',\n country: 'Germany',\n location: {\n lat: 51.2993,\n long: 9.491\n },\n filter: true\n },\n {\n name: 'adguard-dns-doh',\n endpoint: {\n protocol: 'https:',\n host: 'dns.adguard.com',\n ipv4: '94.140.15.15'\n },\n description: 'Remove ads and protect your computer from malware (over DoH)',\n country: 'France',\n location: {\n lat: 48.8582,\n long: 2.3387\n },\n filter: true\n },\n {\n name: 'adguard-dns-family-doh',\n endpoint: {\n protocol: 'https:',\n host: 'dns-family.adguard.com',\n ipv4: '94.140.15.16'\n },\n description: 'Adguard DNS with safesearch and adult content blocking (over DoH)',\n country: 'France',\n location: {\n lat: 48.8582,\n long: 2.3387\n },\n filter: true\n },\n {\n name: 'adguard-dns-unfiltered-doh',\n endpoint: {\n protocol: 'https:',\n host: 'dns-unfiltered.adguard.com',\n ipv4: '94.140.14.140'\n },\n description: 'AdGuard public DNS servers without filters (over DoH)',\n country: 'France',\n location: {\n lat: 48.8582,\n long: 2.3387\n }\n },\n {\n name: 'ahadns-doh-chi',\n endpoint: {\n protocol: 'https:',\n host: 'doh.chi.ahadns.net',\n cors: true\n },\n description: 'A zero logging DNS with support for DNS-over-HTTPS (DoH) & DNS-over-TLS (DoT). Blocks ads, malware, trackers, viruses, ransomware, telemetry and more. No persistent logs. DNSSEC. Hosted in Chicago, USA. By https://ahadns.com/\\nServer statistics can be seen at: https://statistics.ahadns.com/?server=chi',\n country: 'United States',\n location: {\n lat: 41.8483,\n long: -87.6517\n },\n filter: true,\n cors: true\n },\n {\n name: 'ahadns-doh-in',\n endpoint: {\n protocol: 'https:',\n host: 'doh.in.ahadns.net',\n cors: true\n },\n description: 'A zero logging DNS with support for DNS-over-HTTPS (DoH) & DNS-over-TLS (DoT). Blocks ads, malware, trackers, viruses, ransomware, telemetry and more. No persistent logs. DNSSEC. Hosted in Mumbai, India. By https://ahadns.com/\\nServer statistics can be seen at: https://statistics.ahadns.com/?server=in',\n country: 'India',\n location: {\n lat: 19.0748,\n long: 72.8856\n },\n filter: true,\n cors: true\n },\n {\n name: 'ahadns-doh-la',\n endpoint: {\n protocol: 'https:',\n host: 'doh.la.ahadns.net',\n cors: true\n },\n description: 'A zero logging DNS with support for DNS-over-HTTPS (DoH) & DNS-over-TLS (DoT). Blocks ads, malware, trackers, viruses, ransomware, telemetry and more. No persistent logs. DNSSEC. Hosted in Los Angeles, USA. By https://ahadns.com/\\nServer statistics can be seen at: https://statistics.ahadns.com/?server=la',\n country: 'United States',\n location: {\n lat: 34.0549,\n long: -118.2578\n },\n filter: true,\n cors: true\n },\n {\n name: 'ahadns-doh-nl',\n endpoint: {\n protocol: 'https:',\n host: 'doh.nl.ahadns.net',\n cors: true\n },\n description: 'A zero logging DNS with support for DNS-over-HTTPS (DoH) & DNS-over-TLS (DoT). Blocks ads, malware, trackers, viruses, ransomware, telemetry and more. No persistent logs. DNSSEC. Hosted in Amsterdam, Netherlands. By https://ahadns.com/\\nServer statistics can be seen at: https://statistics.ahadns.com/?server=nl',\n country: 'Netherlands',\n location: {\n lat: 52.3824,\n long: 4.8995\n },\n filter: true,\n cors: true\n },\n {\n name: 'ahadns-doh-ny',\n endpoint: {\n protocol: 'https:',\n host: 'doh.ny.ahadns.net',\n cors: true\n },\n description: 'A zero logging DNS with support for DNS-over-HTTPS (DoH) & DNS-over-TLS (DoT). Blocks ads, malware, trackers, viruses, ransomware, telemetry and more. No persistent logs. DNSSEC. Hosted in New York. By https://ahadns.com/\\nServer statistics can be seen at: https://statistics.ahadns.com/?server=ny',\n country: 'United States',\n location: {\n lat: 40.7308,\n long: -73.9975\n },\n filter: true,\n cors: true\n },\n {\n name: 'ahadns-doh-pl',\n endpoint: {\n protocol: 'https:',\n host: 'doh.pl.ahadns.net',\n cors: true\n },\n description: 'A zero logging DNS with support for DNS-over-HTTPS (DoH) & DNS-over-TLS (DoT). Blocks ads, malware, trackers, viruses, ransomware, telemetry and more. No persistent logs. DNSSEC. Hosted in Poland. By https://ahadns.com/\\nServer statistics can be seen at: https://statistics.ahadns.com/?server=pl',\n country: 'Netherlands',\n location: {\n lat: 52.3824,\n long: 4.8995\n },\n filter: true,\n cors: true\n },\n {\n name: 'alidns-doh',\n endpoint: {\n protocol: 'https:',\n host: 'dns.alidns.com',\n ipv4: '223.5.5.5',\n cors: true\n },\n description: 'A public DNS resolver that supports DoH/DoT in mainland China, provided by Alibaba-Cloud.\\nWarning: GFW filtering rules are applied by that resolver.\\nHomepage: https://alidns.com/',\n country: 'China',\n location: {\n lat: 34.7725,\n long: 113.7266\n },\n filter: true,\n log: true,\n cors: true\n },\n {\n name: 'ams-ads-doh-nl',\n endpoint: {\n protocol: 'https:',\n host: 'dnsnl-noads.alekberg.net'\n },\n description: 'Resolver in Amsterdam. DoH protocol. Non-logging. Blocks ads, malware and trackers. DNSSEC enabled.',\n country: 'Romania',\n location: {\n lat: 45.9968,\n long: 24.997\n },\n filter: true\n },\n {\n name: 'ams-doh-nl',\n endpoint: {\n protocol: 'https:',\n host: 'dnsnl.alekberg.net'\n },\n description: 'Resolver in Amsterdam. DoH protocol. Non-logging, non-filtering, DNSSEC.',\n country: 'Romania',\n location: {\n lat: 45.9968,\n long: 24.997\n }\n },\n {\n name: 'att',\n endpoint: {\n protocol: 'https:',\n host: 'dohtrial.att.net'\n },\n description: 'AT&T test DoH server.',\n log: true\n },\n {\n name: 'bcn-ads-doh',\n endpoint: {\n protocol: 'https:',\n host: 'dnses-noads.alekberg.net'\n },\n description: 'Resolver in Spain. DoH protocol. Non-logging, remove ads and malware, DNSSEC.',\n country: 'Spain',\n location: {\n lat: 41.3891,\n long: 2.1611\n },\n filter: true\n },\n {\n name: 'bcn-doh',\n endpoint: {\n protocol: 'https:',\n host: 'dnses.alekberg.net'\n },\n description: 'Resolver in Spain. DoH protocol. Non-logging, non-filtering, DNSSEC.',\n country: 'Spain',\n location: {\n lat: 41.3891,\n long: 2.1611\n }\n },\n {\n name: 'brahma-world',\n endpoint: {\n protocol: 'https:',\n host: 'dns.brahma.world'\n },\n description: 'DNS-over-HTTPS server. Non Logging, filters ads, trackers and malware. DNSSEC ready, QNAME Minimization, No EDNS Client-Subnet.\\nHosted in Stockholm, Sweden. (https://dns.brahma.world)',\n country: 'United States',\n location: {\n lat: 37.751,\n long: -97.822\n },\n filter: true\n },\n {\n name: 'cisco-doh',\n endpoint: {\n protocol: 'https:',\n host: 'doh.opendns.com',\n ipv4: '146.112.41.2'\n },\n description: 'Remove your DNS blind spot (DoH protocol)\\nWarning: modifies your queries to include a copy of your network\\naddress when forwarding them to a selection of companies and organizations.',\n country: 'United States',\n location: {\n lat: 37.751,\n long: -97.822\n },\n filter: true,\n log: true\n },\n {\n name: 'cloudflare',\n endpoint: {\n protocol: 'https:',\n host: 'dns.cloudflare.com',\n ipv4: '1.0.0.1',\n cors: true\n },\n description: 'Cloudflare DNS (anycast) - aka 1.1.1.1 / 1.0.0.1',\n country: 'Australia',\n location: {\n lat: -33.494,\n long: 143.2104\n },\n cors: true\n },\n {\n name: 'cloudflare-family',\n endpoint: {\n protocol: 'https:',\n host: 'family.cloudflare-dns.com',\n ipv4: '1.0.0.3',\n cors: true\n },\n description: 'Cloudflare DNS (anycast) with malware protection and parental control - aka 1.1.1.3 / 1.0.0.3',\n country: 'Australia',\n location: {\n lat: -33.494,\n long: 143.2104\n },\n filter: true,\n cors: true\n },\n {\n name: 'cloudflare-ipv6',\n endpoint: {\n protocol: 'https:',\n host: '1dot1dot1dot1.cloudflare-dns.com',\n cors: true\n },\n description: 'Cloudflare DNS over IPv6 (anycast)',\n country: 'United States',\n location: {\n lat: 37.751,\n long: -97.822\n },\n cors: true\n },\n {\n name: 'cloudflare-security',\n endpoint: {\n protocol: 'https:',\n host: 'security.cloudflare-dns.com',\n ipv4: '1.0.0.2',\n cors: true\n },\n description: 'Cloudflare DNS (anycast) with malware blocking - aka 1.1.1.2 / 1.0.0.2',\n country: 'Australia',\n location: {\n lat: -33.494,\n long: 143.2104\n },\n filter: true,\n cors: true\n },\n {\n name: 'controld-block-malware',\n endpoint: {\n protocol: 'https:',\n host: 'freedns.controld.com',\n path: '/p1'\n },\n description: 'ControlD Free DNS. Take CONTROL of your Internet. Block unwanted content, bypass geo-restrictions and be more productive. DoH protocol and No logging. - https://controld.com/free-dns\\nThis DNS blocks Malware domains.',\n country: 'Canada',\n location: {\n lat: 43.6319,\n long: -79.3716\n },\n filter: true\n },\n {\n name: 'controld-block-malware-ad',\n endpoint: {\n protocol: 'https:',\n host: 'freedns.controld.com',\n path: '/p2'\n },\n description: 'ControlD Free DNS. Take CONTROL of your Internet. Block unwanted content, bypass geo-restrictions and be more productive. DoH protocol and No logging. - https://controld.com/free-dns\\nThis DNS blocks Malware, Ads & Tracking domains.',\n country: 'Canada',\n location: {\n lat: 43.6319,\n long: -79.3716\n },\n filter: true\n },\n {\n name: 'controld-block-malware-ad-social',\n endpoint: {\n protocol: 'https:',\n host: 'freedns.controld.com',\n path: '/p3'\n },\n description: 'ControlD Free DNS. Take CONTROL of your Internet. Block unwanted content, bypass geo-restrictions and be more productive. DoH protocol and No logging. - https://controld.com/free-dns\\nThis DNS blocks Malware, Ads & Tracking and Social Networks domains.',\n country: 'Canada',\n location: {\n lat: 43.6319,\n long: -79.3716\n },\n filter: true\n },\n {\n name: 'controld-family-friendly',\n endpoint: {\n protocol: 'https:',\n host: 'freedns.controld.com',\n path: '/family'\n },\n description: 'ControlD Free DNS. Take CONTROL of your Internet. Block unwanted content, bypass geo-restrictions and be more productive. DoH protocol and No logging. - https://controld.com/free-dns\\nThis DNS blocks Malware, Ads & Tracking, Adult Content and Drugs domains.',\n country: 'Canada',\n location: {\n lat: 43.6319,\n long: -79.3716\n },\n filter: true\n },\n {\n name: 'controld-uncensored',\n endpoint: {\n protocol: 'https:',\n host: 'freedns.controld.com',\n path: '/uncensored'\n },\n description: 'ControlD Free DNS. Take CONTROL of your Internet. Block unwanted content, bypass geo-restrictions and be more productive. DoH protocol and No logging. - https://controld.com/free-dns\\nThis DNS unblocks censored domains from various countries.',\n country: 'Canada',\n location: {\n lat: 43.6319,\n long: -79.3716\n }\n },\n {\n name: 'controld-unfiltered',\n endpoint: {\n protocol: 'https:',\n host: 'freedns.controld.com',\n path: '/p0'\n },\n description: 'ControlD Free DNS. Take CONTROL of your Internet. Block unwanted content, bypass geo-restrictions and be more productive. DoH protocol and No logging. - https://controld.com/free-dns\\nThis is a Unfiltered DNS, no DNS record blocking or manipulation here, if you want to block Malware, Ads & Tracking or Social Network domains, use the other ControlD DNS configs.',\n country: 'Canada',\n location: {\n lat: 43.6319,\n long: -79.3716\n }\n },\n {\n name: 'dns.digitale-gesellschaft.ch',\n endpoint: {\n protocol: 'https:',\n host: 'dns.digitale-gesellschaft.ch'\n },\n description: 'Public DoH resolver operated by the Digital Society (https://www.digitale-gesellschaft.ch).\\nHosted in Zurich, Switzerland.\\nNon-logging, non-filtering, supports DNSSEC.',\n country: 'Switzerland',\n location: {\n lat: 47.1449,\n long: 8.1551\n }\n },\n {\n name: 'dns.ryan-palmer',\n endpoint: {\n protocol: 'https:',\n host: 'dns1.ryan-palmer.com'\n },\n description: 'Non-logging, non-filtering, DNSSEC DoH Server. Hosted in the UK.',\n country: 'United Kingdom',\n location: {\n lat: 51.5164,\n long: -0.093\n }\n },\n {\n name: 'dns.sb',\n endpoint: {\n protocol: 'https:',\n host: 'doh.sb',\n ipv4: '185.222.222.222',\n cors: true\n },\n description: 'DNSSEC-enabled DoH server by https://xtom.com/\\nhttps://dns.sb/doh/',\n country: 'Unknown',\n location: {\n lat: 47,\n long: 8\n },\n cors: true\n },\n {\n name: 'dns.therifleman.name',\n endpoint: {\n protocol: 'https:',\n host: 'dns.therifleman.name'\n },\n description: 'DNS-over-HTTPS DNS forwarder from Mumbai, India. Blocks web and Android trackers and ads.\\nIP addresses are not logged, but queries are logged for 24 hours for debugging.\\nReport issues, send suggestions @ joker349 at protonmail.com.\\nAlso supports DoT (for android) @ dns.therifleman.name and plain DNS @ 172.104.206.174',\n country: 'United States',\n location: {\n lat: 37.751,\n long: -97.822\n },\n filter: true\n },\n {\n name: 'dnsforfamily-doh',\n endpoint: {\n protocol: 'https:',\n host: 'dns-doh.dnsforfamily.com'\n },\n description: '(DoH Protocol) (Now supports DNSSEC). Block adult websites, gambling websites, malwares and advertisements.\\nIt also enforces safe search in: Google, YouTube, Bing, DuckDuckGo and Yandex.\\nSocial websites like Facebook and Instagram are not blocked. No DNS queries are logged.\\nAs of 26-May-2022 5.9 million websites are blocked and new websites are added to blacklist daily.\\nCompletely free, no ads or any commercial motive. Operating for 4 years now.\\nProvided by: https://dnsforfamily.com',\n country: 'Finland',\n location: {\n lat: 60.1758,\n long: 24.9349\n },\n filter: true\n },\n {\n name: 'dnsforfamily-doh-no-safe-search',\n endpoint: {\n protocol: 'https:',\n host: 'dns-doh-no-safe-search.dnsforfamily.com'\n },\n description: '(DoH Protocol) (Now supports DNSSEC) Block adult websites, gambling websites, malwares and advertisements.\\nUnlike other dnsforfamily servers, this one does not enforces safe search. So Google, YouTube, Bing, DuckDuckGo and Yandex are completely accessible without any restriction.\\nSocial websites like Facebook and Instagram are not blocked. No DNS queries are logged.\\nAs of 26-May-2022 5.9 million websites are blocked and new websites are added to blacklist daily.\\nCompletely free, no ads or any commercial motive. Operating for 4 years now.\\nWarning: This server is incompatible with anonymization.\\nProvided by: https://dnsforfamily.com',\n country: 'Finland',\n location: {\n lat: 60.1758,\n long: 24.9349\n },\n filter: true\n },\n {\n name: 'dnsforge.de',\n endpoint: {\n protocol: 'https:',\n host: 'dnsforge.de',\n cors: true\n },\n description: 'Public DoH resolver running with Pihole for Adblocking (https://dnsforge.de).\\nNon-logging, AD-filtering, supports DNSSEC. Hosted in Germany.',\n country: 'Germany',\n location: {\n lat: 52.2998,\n long: 9.447\n },\n filter: true,\n cors: true\n },\n {\n name: 'dnshome-doh',\n endpoint: {\n protocol: 'https:',\n host: 'dns.dnshome.de'\n },\n description: 'https://www.dnshome.de/ public resolver in Germany'\n },\n {\n name: 'dnspod-doh',\n endpoint: {\n protocol: 'https:',\n host: 'doh.pub',\n cors: true\n },\n description: 'A public DNS resolver in mainland China provided by DNSPod (Tencent Cloud).\\nhttps://www.dnspod.cn/Products/Public.DNS?lang=en',\n filter: true,\n log: true,\n cors: true\n },\n {\n name: 'dnswarden-asia-adblock-dohv4',\n endpoint: {\n protocol: 'https:',\n host: 'doh.asia.dnswarden.com',\n path: '/adblock'\n },\n description: 'Hosted in Singapore. For more information look [here](https://github.com/bhanupratapys/dnswarden) or [here](https://dnswarden.com).',\n country: 'Singapore',\n location: {\n lat: 1.2929,\n long: 103.8547\n },\n filter: true\n },\n {\n name: 'dnswarden-asia-adultfilter-dohv4',\n endpoint: {\n protocol: 'https:',\n host: 'doh.asia.dnswarden.com',\n path: '/adultfilter'\n },\n description: 'Hosted in Singapore. For more information look [here](https://github.com/bhanupratapys/dnswarden) or [here](https://dnswarden.com).',\n country: 'Singapore',\n location: {\n lat: 1.2929,\n long: 103.8547\n },\n filter: true\n },\n {\n name: 'dnswarden-asia-uncensor-dohv4',\n endpoint: {\n protocol: 'https:',\n host: 'doh.asia.dnswarden.com',\n path: '/uncensored'\n },\n description: 'Hosted in Singapore. For more information look [here](https://github.com/bhanupratapys/dnswarden) or [here](https://dnswarden.com).',\n country: 'Singapore',\n location: {\n lat: 1.2929,\n long: 103.8547\n }\n },\n {\n name: 'dnswarden-eu-adblock-dohv4',\n endpoint: {\n protocol: 'https:',\n host: 'doh.eu.dnswarden.com'\n },\n description: 'Hosted in Germany. For more information look [here](https://github.com/bhanupratapys/dnswarden) or [here](https://dnswarden.com).',\n country: 'Germany',\n location: {\n lat: 50.1103,\n long: 8.7147\n },\n filter: true\n },\n {\n name: 'dnswarden-us-adblock-dohv4',\n endpoint: {\n protocol: 'https:',\n host: 'doh.us.dnswarden.com'\n },\n description: 'Hosted in USA (Dallas) . For more information look [here](https://github.com/bhanupratapys/dnswarden) or [here](https://dnswarden.com).',\n country: 'United States',\n location: {\n lat: 32.7889,\n long: -96.8021\n },\n filter: true\n },\n {\n name: 'doh-ch-blahdns',\n endpoint: {\n protocol: 'https:',\n host: 'doh-ch.blahdns.com',\n cors: true\n },\n description: 'Blocks ad and Tracking, no Logging, DNSSEC, Hosted in Switzerland. By https://blahdns.com/',\n country: 'Netherlands',\n location: {\n lat: 52.3824,\n long: 4.8995\n },\n filter: true,\n cors: true\n },\n {\n name: 'doh-cleanbrowsing-adult',\n endpoint: {\n protocol: 'https:',\n host: 'doh.cleanbrowsing.org',\n path: '/doh/adult-filter/',\n cors: true\n },\n description: 'Blocks access to all adult, pornographic and explicit sites. It does\\nnot block proxy or VPNs, nor mixed-content sites. Sites like Reddit\\nare allowed. Google and Bing are set to the Safe Mode.\\nBy https://cleanbrowsing.org/',\n filter: true,\n cors: true\n },\n {\n name: 'doh-cleanbrowsing-family',\n endpoint: {\n protocol: 'https:',\n host: 'doh.cleanbrowsing.org',\n path: '/doh/family-filter/',\n cors: true\n },\n description: 'Blocks access to all adult, pornographic and explicit sites. It also\\nblocks proxy and VPN domains that are used to bypass the filters.\\nMixed content sites (like Reddit) are also blocked. Google, Bing and\\nYoutube are set to the Safe Mode.\\nBy https://cleanbrowsing.org/',\n filter: true,\n cors: true\n },\n {\n name: 'doh-cleanbrowsing-security',\n endpoint: {\n protocol: 'https:',\n host: 'doh.cleanbrowsing.org',\n path: '/doh/security-filter/',\n cors: true\n },\n description: 'Block access to phishing, malware and malicious domains. It does not block adult content.\\nBy https://cleanbrowsing.org/',\n filter: true,\n cors: true\n },\n {\n name: 'doh-crypto-sx',\n endpoint: {\n protocol: 'https:',\n host: 'doh.crypto.sx',\n cors: true\n },\n description: 'DNS-over-HTTPS server. Anycast, no logs, no censorship, DNSSEC.\\nBackend hosted by Scaleway, globally cached via Cloudflare.\\nMaintained by Frank Denis.',\n country: 'United States',\n location: {\n lat: 37.751,\n long: -97.822\n },\n cors: true\n },\n {\n name: 'doh-crypto-sx-ipv6',\n endpoint: {\n protocol: 'https:',\n host: 'doh-ipv6.crypto.sx',\n cors: true\n },\n description: 'DNS-over-HTTPS server accessible over IPv6. Anycast, no logs, no censorship, DNSSEC.\\nBackend hosted by Scaleway, globally cached via Cloudflare.\\nMaintained by Frank Denis.',\n country: 'United States',\n location: {\n lat: 37.751,\n long: -97.822\n },\n cors: true\n },\n {\n name: 'doh-de-blahdns',\n endpoint: {\n protocol: 'https:',\n host: 'doh-de.blahdns.com',\n cors: true\n },\n description: 'Blocks ad and Tracking, no Logging, DNSSEC, Hosted in Germany. By https://blahdns.com/',\n country: 'Germany',\n location: {\n lat: 51.2993,\n long: 9.491\n },\n filter: true,\n cors: true\n },\n {\n name: 'doh-fi-blahdns',\n endpoint: {\n protocol: 'https:',\n host: 'doh-fi.blahdns.com',\n cors: true\n },\n description: 'Blocks ad and Tracking, no Logging, DNSSEC, Hosted in Finland. By https://blahdns.com/',\n country: 'Finland',\n location: {\n lat: 60.1758,\n long: 24.9349\n },\n filter: true,\n cors: true\n },\n {\n name: 'doh-ibksturm',\n endpoint: {\n protocol: 'https:',\n host: 'ibksturm.synology.me'\n },\n description: 'DoH & DoT Server, No Logging, No Filters, DNSSEC\\nRunning privately by ibksturm in Thurgau, Switzerland'\n },\n {\n name: 'doh-jp-blahdns',\n endpoint: {\n protocol: 'https:',\n host: 'doh-jp.blahdns.com',\n cors: true\n },\n description: 'Blocks ad and Tracking, no Logging, DNSSEC, Hosted in Japan. By https://blahdns.com/',\n country: 'Japan',\n location: {\n lat: 35.6882,\n long: 139.7532\n },\n filter: true,\n cors: true\n },\n {\n name: 'doh.ffmuc.net',\n endpoint: {\n protocol: 'https:',\n host: 'doh.ffmuc.net'\n },\n description: 'An open (non-logging, non-filtering, non-censoring) DoH resolver operated by Freifunk Munich with nodes in DE.\\nhttps://ffmuc.net/',\n country: 'Germany',\n location: {\n lat: 51.2993,\n long: 9.491\n }\n },\n {\n name: 'doh.tiarap.org',\n endpoint: {\n protocol: 'https:',\n host: 'doh.tiarap.org'\n },\n description: 'Non-Logging DNS-over-HTTPS server, cached via Cloudflare.\\nFilters out ads, trackers and malware, NO ECS, supports DNSSEC.',\n country: 'United States',\n location: {\n lat: 37.751,\n long: -97.822\n },\n filter: true\n },\n {\n name: 'google',\n endpoint: {\n protocol: 'https:',\n host: 'dns.google',\n ipv4: '8.8.8.8',\n cors: true\n },\n description: 'Google DNS (anycast)',\n country: 'United States',\n location: {\n lat: 37.751,\n long: -97.822\n },\n log: true,\n cors: true\n },\n {\n name: 'hdns',\n endpoint: {\n protocol: 'https:',\n host: 'query.hdns.io',\n cors: true\n },\n description: 'HDNS is a public DNS resolver that supports Handshake domains.\\nhttps://www.hdns.io',\n country: 'United States',\n location: {\n lat: 37.7771,\n long: -122.406\n },\n cors: true\n },\n {\n name: 'he',\n endpoint: {\n protocol: 'https:',\n host: 'ordns.he.net'\n },\n description: 'Hurricane Electric DoH server (anycast)\\nUnknown logging policy.',\n country: 'United States',\n location: {\n lat: 37.751,\n long: -97.822\n },\n log: true\n },\n {\n name: 'id-gmail-doh',\n endpoint: {\n protocol: 'https:',\n host: 'doh.tiar.app'\n },\n description: 'Non-Logging DNS-over-HTTPS server located in Singapore.\\nFilters out ads, trackers and malware, supports DNSSEC, provided by id-gmail.',\n country: 'Singapore',\n location: {\n lat: 1.2929,\n long: 103.8547\n },\n filter: true\n },\n {\n name: 'iij',\n endpoint: {\n protocol: 'https:',\n host: 'public.dns.iij.jp'\n },\n description: 'DoH server operated by Internet Initiative Japan in Tokyo.\\nhttps://www.iij.ad.jp/',\n country: 'Japan',\n location: {\n lat: 35.69,\n long: 139.69\n },\n log: true\n },\n {\n name: 'iqdns-doh',\n endpoint: {\n protocol: 'https:',\n host: 'a.passcloud.xyz'\n },\n description: 'Non-logging DoH service runned by V2EX.com user johnsonwil.\\nReturns \"no such domain\" for anti-Chinese government websites. Supports DNSSEC.\\nFor more information: https://www.v2ex.com/t/785666',\n filter: true\n },\n {\n name: 'jp.tiar.app-doh',\n endpoint: {\n protocol: 'https:',\n host: 'jp.tiar.app'\n },\n description: 'Non-Logging, Non-Filtering DNS-over-HTTPS server in Japan.\\nNo ECS, Support DNSSEC',\n country: 'Japan',\n location: {\n lat: 35.6882,\n long: 139.7532\n }\n },\n {\n name: 'jp.tiarap.org',\n endpoint: {\n protocol: 'https:',\n host: 'jp.tiarap.org'\n },\n description: 'DNS-over-HTTPS Server. Non-Logging, Non-Filtering, No ECS, Support DNSSEC.\\nCached via Cloudflare.'\n },\n {\n name: 'libredns',\n endpoint: {\n protocol: 'https:',\n host: 'doh.libredns.gr'\n },\n description: 'DoH server in Germany. No logging, but no DNS padding and no DNSSEC support.\\nhttps://libredns.gr/',\n country: 'Germany',\n location: {\n lat: 51.2993,\n long: 9.491\n }\n },\n {\n name: 'nextdns',\n endpoint: {\n protocol: 'https:',\n host: 'anycsast.dns.nextdns.io'\n },\n description: 'NextDNS is a cloud-based private DNS service that gives you full control\\nover what is allowed and what is blocked on the Internet.\\nDNSSEC, Anycast, Non-logging, NoFilters\\nhttps://www.nextdns.io/',\n country: 'Netherlands',\n location: {\n lat: 52.3891,\n long: 4.6563\n }\n },\n {\n name: 'nextdns-ultralow',\n endpoint: {\n protocol: 'https:',\n host: 'dns.nextdns.io',\n path: '/dnscrypt-proxy'\n },\n description: 'NextDNS is a cloud-based private DNS service that gives you full control\\nover what is allowed and what is blocked on the Internet.\\nhttps://www.nextdns.io/\\nTo select the server location, the \"-ultralow\" variant relies on bootstrap servers\\ninstead of anycast.'\n },\n {\n name: 'njalla-doh',\n endpoint: {\n protocol: 'https:',\n host: 'dns.njal.la',\n cors: true\n },\n description: 'Non-logging DoH server in Sweden operated by Njalla.\\nhttps://dns.njal.la/',\n country: 'Sweden',\n location: {\n lat: 59.3247,\n long: 18.056\n },\n cors: true\n },\n {\n name: 'odoh-cloudflare',\n endpoint: {\n protocol: 'https:',\n host: 'odoh.cloudflare-dns.com',\n cors: true\n },\n description: 'Cloudflare ODoH server.\\nhttps://cloudflare.com',\n cors: true\n },\n {\n name: 'odoh-crypto-sx',\n endpoint: {\n protocol: 'https:',\n host: 'odoh.crypto.sx',\n cors: true\n },\n description: 'ODoH target server. Anycast, no logs.\\nBackend hosted by Scaleway. Maintained by Frank Denis.',\n cors: true\n },\n {\n name: 'odoh-id-gmail',\n endpoint: {\n protocol: 'https:',\n host: 'doh.tiar.app',\n path: '/odoh'\n },\n description: 'ODoH target server. Based in Singapore, no logs.\\nFilter ads, trackers and malware.',\n filter: true\n },\n {\n name: 'odoh-jp.tiar.app',\n endpoint: {\n protocol: 'https:',\n host: 'jp.tiar.app',\n path: '/odoh'\n },\n description: 'ODoH target server. no logs.'\n },\n {\n name: 'odoh-jp.tiarap.org',\n endpoint: {\n protocol: 'https:',\n host: 'jp.tiarap.org',\n path: '/odoh'\n },\n description: 'ODoH target server via Cloudflare, no logs.'\n },\n {\n name: 'odoh-resolver4.dns.openinternet.io',\n endpoint: {\n protocol: 'https:',\n host: 'resolver4.dns.openinternet.io'\n },\n description: \"ODoH target server. no logs, no filter, DNSSEC.\\nRunning on dedicated hardware colocated at Sonic.net in Santa Rosa, CA in the United States.\\nUses Sonic's recusrive DNS servers as upstream resolvers (but is not affiliated with Sonic\\nin any way). Provided by https://openinternet.io\"\n },\n {\n name: 'odoh-tiarap.org',\n endpoint: {\n protocol: 'https:',\n host: 'doh.tiarap.org',\n path: '/odoh'\n },\n description: 'ODoH target server via Cloudflare, no logs.\\nFilter ads, trackers and malware.',\n filter: true\n },\n {\n name: 'publicarray-au2-doh',\n endpoint: {\n protocol: 'https:',\n host: 'doh-2.seby.io',\n cors: true\n },\n description: 'DNSSEC • OpenNIC • Non-logging • Uncensored - hosted on ovh.com.au\\nMaintained by publicarray - https://dns.seby.io',\n country: 'Australia',\n location: {\n lat: -33.8591,\n long: 151.2002\n },\n cors: true\n },\n {\n name: 'puredns-doh',\n endpoint: {\n protocol: 'https:',\n host: 'puredns.org',\n ipv4: '146.190.6.13',\n cors: true\n },\n description: 'Public uncensored DNS resolver in Singapore - https://puredns.org\\n** Only available in Indonesia and Singapore **',\n country: 'United States',\n location: {\n lat: 37.751,\n long: -97.822\n },\n cors: true\n },\n {\n name: 'quad101',\n endpoint: {\n protocol: 'https:',\n host: 'dns.twnic.tw',\n cors: true\n },\n description: 'DNSSEC-aware public resolver by the Taiwan Network Information Center (TWNIC)\\nhttps://101.101.101.101/index_en.html',\n cors: true\n },\n {\n name: 'quad9-doh-ip4-port443-filter-ecs-pri',\n endpoint: {\n protocol: 'https:',\n host: 'dns11.quad9.net',\n ipv4: '149.112.112.11'\n },\n description: 'Quad9 (anycast) dnssec/no-log/filter/ecs 9.9.9.11 - 149.112.112.11',\n country: 'United States',\n location: {\n lat: 37.751,\n long: -97.822\n },\n filter: true\n },\n {\n name: 'quad9-doh-ip4-port443-filter-pri',\n endpoint: {\n protocol: 'https:',\n host: 'dns.quad9.net',\n ipv4: '149.112.112.112'\n },\n description: 'Quad9 (anycast) dnssec/no-log/filter 9.9.9.9 - 149.112.112.9 - 149.112.112.112',\n country: 'United States',\n location: {\n lat: 37.751,\n long: -97.822\n },\n filter: true\n },\n {\n name: 'quad9-doh-ip4-port443-nofilter-ecs-pri',\n endpoint: {\n protocol: 'https:',\n host: 'dns12.quad9.net',\n ipv4: '9.9.9.12'\n },\n description: 'Quad9 (anycast) no-dnssec/no-log/no-filter/ecs 9.9.9.12 - 149.112.112.12',\n country: 'United States',\n location: {\n lat: 37.751,\n long: -97.822\n }\n },\n {\n name: 'quad9-doh-ip4-port443-nofilter-pri',\n endpoint: {\n protocol: 'https:',\n host: 'dns10.quad9.net',\n ipv4: '149.112.112.10'\n },\n description: 'Quad9 (anycast) no-dnssec/no-log/no-filter 9.9.9.10 - 149.112.112.10',\n country: 'United States',\n location: {\n lat: 37.751,\n long: -97.822\n }\n },\n {\n name: 'quad9-doh-ip6-port5053-filter-pri',\n endpoint: {\n protocol: 'https:',\n host: 'dns9.quad9.net'\n },\n description: 'Quad9 (anycast) dnssec/no-log/filter 2620:fe::fe - 2620:fe::9 - 2620:fe::fe:9',\n country: 'United States',\n location: {\n lat: 37.751,\n long: -97.822\n },\n filter: true\n },\n {\n name: 'safesurfer-doh',\n endpoint: {\n protocol: 'https:',\n host: 'doh.safesurfer.io'\n },\n description: 'Family safety focused blocklist for over 2 million adult sites, as well as phishing and malware and more.\\nFree to use, paid for customizing blocking for more categories+sites and viewing usage at my.safesurfer.io. Logs taken for viewing\\nusage, data never sold - https://safesurfer.io',\n filter: true,\n log: true\n },\n {\n name: 'sth-ads-doh-se',\n endpoint: {\n protocol: 'https:',\n host: 'dnsse-noads.alekberg.net'\n },\n description: 'Resolver in Stockholm, Sweden. DoH server. Non-logging, remove ads and malware, DNSSEC.',\n country: 'Bulgaria',\n location: {\n lat: 42.696,\n long: 23.332\n },\n filter: true\n },\n {\n name: 'sth-doh-se',\n endpoint: {\n protocol: 'https:',\n host: 'dnsse.alekberg.net'\n },\n description: 'Resolver in Stockholm, Sweden. DoH server. Non-logging, non-filtering, DNSSEC.',\n country: 'Bulgaria',\n location: {\n lat: 42.696,\n long: 23.332\n }\n },\n {\n name: 'switch',\n endpoint: {\n protocol: 'https:',\n host: 'dns.switch.ch'\n },\n description: 'Public DoH service provided by SWITCH in Switzerland\\nhttps://www.switch.ch\\nProvides protection against malware, but does not block ads.',\n filter: true\n },\n {\n name: 'uncensoreddns-dk-ipv4',\n endpoint: {\n protocol: 'https:',\n host: 'unicast.uncensoreddns.org'\n },\n description: 'Also known as censurfridns.\\nDoH, no logs, no filter, DNSSEC, unicast hosted in Denmark - https://blog.uncensoreddns.org',\n country: 'Denmark',\n location: {\n lat: 55.7123,\n long: 12.0564\n }\n },\n {\n name: 'uncensoreddns-ipv4',\n endpoint: {\n protocol: 'https:',\n host: 'anycast.uncensoreddns.org'\n },\n description: 'Also known as censurfridns.\\nDoH, no logs, no filter, DNSSEC, anycast - https://blog.uncensoreddns.org',\n country: 'Denmark',\n location: {\n lat: 55.7123,\n long: 12.0564\n }\n },\n {\n name: 'v.dnscrypt.uk-doh-ipv4',\n endpoint: {\n protocol: 'https:',\n host: 'v.dnscrypt.uk'\n },\n description: 'DoH, no logs, uncensored, DNSSEC. Hosted in London UK on Digital Ocean\\nhttps://www.dnscrypt.uk',\n country: 'United Kingdom',\n location: {\n lat: 51.4964,\n long: -0.1224\n }\n }\n ],\n time: 1654187067783\n}\n","import { Logger } from \"@waku/utils\";\nimport { bytesToUtf8 } from \"@waku/utils/bytes\";\nimport { query, wellknown } from \"dns-query\";\nconst log = new Logger(\"dns-over-https\");\nexport class DnsOverHttps {\n endpoints;\n retries;\n /**\n * Create new Dns-Over-Http DNS client.\n *\n * @param endpoints The endpoints for Dns-Over-Https queries;\n * Defaults to using dns-query's API..\n * @param retries Retries if a given endpoint fails.\n *\n * @throws {code: string} If DNS query fails.\n */\n static async create(endpoints, retries) {\n const _endpoints = endpoints ?? (await wellknown.endpoints(\"doh\"));\n return new DnsOverHttps(_endpoints, retries);\n }\n constructor(endpoints, retries = 3) {\n this.endpoints = endpoints;\n this.retries = retries;\n }\n /**\n * Resolves a TXT record\n *\n * @param domain The domain name\n *\n * @throws if the query fails\n */\n async resolveTXT(domain) {\n let answers;\n try {\n const res = await query({\n question: { type: \"TXT\", name: domain }\n }, {\n endpoints: this.endpoints,\n retries: this.retries\n });\n answers = res.answers;\n }\n catch (error) {\n log.error(\"query failed: \", error);\n throw new Error(\"DNS query failed\");\n }\n if (!answers)\n throw new Error(`Could not resolve ${domain}`);\n const data = answers.map((a) => a.data);\n const result = [];\n data.forEach((d) => {\n if (typeof d === \"string\") {\n result.push(d);\n }\n else if (Array.isArray(d)) {\n d.forEach((sd) => {\n if (typeof sd === \"string\") {\n result.push(sd);\n }\n else {\n result.push(bytesToUtf8(sd));\n }\n });\n }\n else {\n result.push(bytesToUtf8(d));\n }\n });\n return result;\n }\n}\n//# sourceMappingURL=dns_over_https.js.map","import { ENR } from \"@waku/enr\";\nimport { keccak256, verifySignature } from \"@waku/enr\";\nimport { utf8ToBytes } from \"@waku/utils/bytes\";\nimport base32 from \"hi-base32\";\nimport { fromString } from \"uint8arrays/from-string\";\nexport class ENRTree {\n static RECORD_PREFIX = ENR.RECORD_PREFIX;\n static TREE_PREFIX = \"enrtree:\";\n static BRANCH_PREFIX = \"enrtree-branch:\";\n static ROOT_PREFIX = \"enrtree-root:\";\n /**\n * Extracts the branch subdomain referenced by a DNS tree root string after verifying\n * the root record signature with its base32 compressed public key.\n */\n static parseAndVerifyRoot(root, publicKey) {\n if (!root.startsWith(this.ROOT_PREFIX))\n throw new Error(`ENRTree root entry must start with '${this.ROOT_PREFIX}'`);\n const rootValues = ENRTree.parseRootValues(root);\n const decodedPublicKey = base32.decode.asBytes(publicKey);\n // The signature is a 65-byte secp256k1 over the keccak256 hash\n // of the record content, excluding the `sig=` part, encoded as URL-safe base64 string\n // (Trailing recovery bit must be trimmed to pass `ecdsaVerify` method)\n const signedComponent = root.split(\" sig\")[0];\n const signedComponentBuffer = utf8ToBytes(signedComponent);\n const signatureBuffer = fromString(rootValues.signature, \"base64url\").slice(0, 64);\n const isVerified = verifySignature(signatureBuffer, keccak256(signedComponentBuffer), new Uint8Array(decodedPublicKey));\n if (!isVerified)\n throw new Error(\"Unable to verify ENRTree root signature\");\n return rootValues.eRoot;\n }\n static parseRootValues(txt) {\n const matches = txt.match(/^enrtree-root:v1 e=([^ ]+) l=([^ ]+) seq=(\\d+) sig=([^ ]+)$/);\n if (!Array.isArray(matches))\n throw new Error(\"Could not parse ENRTree root entry\");\n matches.shift(); // The first entry is the full match\n const [eRoot, lRoot, seq, signature] = matches;\n if (!eRoot)\n throw new Error(\"Could not parse 'e' value from ENRTree root entry\");\n if (!lRoot)\n throw new Error(\"Could not parse 'l' value from ENRTree root entry\");\n if (!seq)\n throw new Error(\"Could not parse 'seq' value from ENRTree root entry\");\n if (!signature)\n throw new Error(\"Could not parse 'sig' value from ENRTree root entry\");\n return { eRoot, lRoot, seq: Number(seq), signature };\n }\n /**\n * Returns the public key and top level domain of an ENR tree entry.\n * The domain is the starting point for traversing a set of linked DNS TXT records\n * and the public key is used to verify the root entry record\n */\n static parseTree(tree) {\n if (!tree.startsWith(this.TREE_PREFIX))\n throw new Error(`ENRTree tree entry must start with '${this.TREE_PREFIX}'`);\n const matches = tree.match(/^enrtree:\\/\\/([^@]+)@(.+)$/);\n if (!Array.isArray(matches))\n throw new Error(\"Could not parse ENRTree tree entry\");\n matches.shift(); // The first entry is the full match\n const [publicKey, domain] = matches;\n if (!publicKey)\n throw new Error(\"Could not parse public key from ENRTree tree entry\");\n if (!domain)\n throw new Error(\"Could not parse domain from ENRTree tree entry\");\n return { publicKey, domain };\n }\n /**\n * Returns subdomains listed in an ENR branch entry. These in turn lead to\n * either further branch entries or ENR records.\n */\n static parseBranch(branch) {\n if (!branch.startsWith(this.BRANCH_PREFIX))\n throw new Error(`ENRTree branch entry must start with '${this.BRANCH_PREFIX}'`);\n return branch.split(this.BRANCH_PREFIX)[1].split(\",\");\n }\n}\n//# sourceMappingURL=enrtree.js.map","import { Logger } from \"@waku/utils\";\nconst log = new Logger(\"discovery:fetch_nodes\");\n/**\n * Fetch nodes using passed [[getNode]] until all wanted capabilities are\n * fulfilled or the number of [[getNode]] call exceeds the sum of\n * [[wantedNodeCapabilityCount]] plus [[errorTolerance]].\n */\nexport async function fetchNodesUntilCapabilitiesFulfilled(wantedNodeCapabilityCount, errorTolerance, getNode) {\n const wanted = {\n relay: wantedNodeCapabilityCount.relay ?? 0,\n store: wantedNodeCapabilityCount.store ?? 0,\n filter: wantedNodeCapabilityCount.filter ?? 0,\n lightPush: wantedNodeCapabilityCount.lightPush ?? 0\n };\n const maxSearches = wanted.relay + wanted.store + wanted.filter + wanted.lightPush;\n const actual = {\n relay: 0,\n store: 0,\n filter: 0,\n lightPush: 0\n };\n let totalSearches = 0;\n const peers = [];\n while (!isSatisfied(wanted, actual) &&\n totalSearches < maxSearches + errorTolerance) {\n const peer = await getNode();\n if (peer && isNewPeer(peer, peers)) {\n // ENRs without a waku2 key are ignored.\n if (peer.waku2) {\n if (helpsSatisfyCapabilities(peer.waku2, wanted, actual)) {\n addCapabilities(peer.waku2, actual);\n peers.push(peer);\n }\n }\n log.info(`got new peer candidate from DNS address=${peer.nodeId}@${peer.ip}`);\n }\n totalSearches++;\n }\n return peers;\n}\n/**\n * Fetch nodes using passed [[getNode]] until all wanted capabilities are\n * fulfilled or the number of [[getNode]] call exceeds the sum of\n * [[wantedNodeCapabilityCount]] plus [[errorTolerance]].\n */\nexport async function* yieldNodesUntilCapabilitiesFulfilled(wantedNodeCapabilityCount, errorTolerance, getNode) {\n const wanted = {\n relay: wantedNodeCapabilityCount.relay ?? 0,\n store: wantedNodeCapabilityCount.store ?? 0,\n filter: wantedNodeCapabilityCount.filter ?? 0,\n lightPush: wantedNodeCapabilityCount.lightPush ?? 0\n };\n const maxSearches = wanted.relay + wanted.store + wanted.filter + wanted.lightPush;\n const actual = {\n relay: 0,\n store: 0,\n filter: 0,\n lightPush: 0\n };\n let totalSearches = 0;\n const peerNodeIds = new Set();\n while (!isSatisfied(wanted, actual) &&\n totalSearches < maxSearches + errorTolerance) {\n const peer = await getNode();\n if (peer && peer.nodeId && !peerNodeIds.has(peer.nodeId)) {\n peerNodeIds.add(peer.nodeId);\n // ENRs without a waku2 key are ignored.\n if (peer.waku2) {\n if (helpsSatisfyCapabilities(peer.waku2, wanted, actual)) {\n addCapabilities(peer.waku2, actual);\n yield peer;\n }\n }\n log.info(`got new peer candidate from DNS address=${peer.nodeId}@${peer.ip}`);\n }\n totalSearches++;\n }\n}\nfunction isSatisfied(wanted, actual) {\n return (actual.relay >= wanted.relay &&\n actual.store >= wanted.store &&\n actual.filter >= wanted.filter &&\n actual.lightPush >= wanted.lightPush);\n}\nfunction isNewPeer(peer, peers) {\n if (!peer.nodeId)\n return false;\n for (const existingPeer of peers) {\n if (peer.nodeId === existingPeer.nodeId) {\n return false;\n }\n }\n return true;\n}\nfunction addCapabilities(node, total) {\n if (node.relay)\n total.relay += 1;\n if (node.store)\n total.store += 1;\n if (node.filter)\n total.filter += 1;\n if (node.lightPush)\n total.lightPush += 1;\n}\n/**\n * Checks if the proposed ENR [[node]] helps satisfy the [[wanted]] capabilities,\n * considering the [[actual]] capabilities of nodes retrieved so far..\n *\n * @throws If the function is called when the wanted capabilities are already fulfilled.\n */\nfunction helpsSatisfyCapabilities(node, wanted, actual) {\n if (isSatisfied(wanted, actual)) {\n throw \"Internal Error: Waku2 wanted capabilities are already fulfilled\";\n }\n const missing = missingCapabilities(wanted, actual);\n return ((missing.relay && node.relay) ||\n (missing.store && node.store) ||\n (missing.filter && node.filter) ||\n (missing.lightPush && node.lightPush));\n}\n/**\n * Return a [[Waku2]] Object for which capabilities are set to true if they are\n * [[wanted]] yet missing from [[actual]].\n */\nfunction missingCapabilities(wanted, actual) {\n return {\n relay: actual.relay < wanted.relay,\n store: actual.store < wanted.store,\n filter: actual.filter < wanted.filter,\n lightPush: actual.lightPush < wanted.lightPush\n };\n}\n//# sourceMappingURL=fetch_nodes.js.map","import { EnrDecoder } from \"@waku/enr\";\nimport { Logger } from \"@waku/utils\";\nimport { DnsOverHttps } from \"./dns_over_https.js\";\nimport { ENRTree } from \"./enrtree.js\";\nimport { fetchNodesUntilCapabilitiesFulfilled, yieldNodesUntilCapabilitiesFulfilled } from \"./fetch_nodes.js\";\nconst log = new Logger(\"discovery:dns\");\nexport class DnsNodeDiscovery {\n dns;\n _DNSTreeCache;\n _errorTolerance = 10;\n static async dnsOverHttp(dnsClient) {\n if (!dnsClient) {\n dnsClient = await DnsOverHttps.create();\n }\n return new DnsNodeDiscovery(dnsClient);\n }\n /**\n * Returns a list of verified peers listed in an EIP-1459 DNS tree. Method may\n * return fewer peers than requested if @link wantedNodeCapabilityCount requires\n * larger quantity of peers than available or the number of errors/duplicate\n * peers encountered by randomized search exceeds the sum of the fields of\n * @link wantedNodeCapabilityCount plus the @link _errorTolerance factor.\n */\n async getPeers(enrTreeUrls, wantedNodeCapabilityCount) {\n const networkIndex = Math.floor(Math.random() * enrTreeUrls.length);\n const { publicKey, domain } = ENRTree.parseTree(enrTreeUrls[networkIndex]);\n const context = {\n domain,\n publicKey,\n visits: {}\n };\n const peers = await fetchNodesUntilCapabilitiesFulfilled(wantedNodeCapabilityCount, this._errorTolerance, () => this._search(domain, context));\n log.info(\"retrieved peers: \", peers.map((peer) => {\n return {\n id: peer.peerId?.toString(),\n multiaddrs: peer.multiaddrs?.map((ma) => ma.toString())\n };\n }));\n return peers;\n }\n constructor(dns) {\n this._DNSTreeCache = {};\n this.dns = dns;\n }\n /**\n * {@inheritDoc getPeers}\n */\n async *getNextPeer(enrTreeUrls, wantedNodeCapabilityCount) {\n const networkIndex = Math.floor(Math.random() * enrTreeUrls.length);\n const { publicKey, domain } = ENRTree.parseTree(enrTreeUrls[networkIndex]);\n const context = {\n domain,\n publicKey,\n visits: {}\n };\n for await (const peer of yieldNodesUntilCapabilitiesFulfilled(wantedNodeCapabilityCount, this._errorTolerance, () => this._search(domain, context))) {\n yield peer;\n }\n }\n /**\n * Runs a recursive, randomized descent of the DNS tree to retrieve a single\n * ENR record as an ENR. Returns null if parsing or DNS resolution fails.\n */\n async _search(subdomain, context) {\n try {\n const entry = await this._getTXTRecord(subdomain, context);\n context.visits[subdomain] = true;\n let next;\n let branches;\n const entryType = getEntryType(entry);\n try {\n switch (entryType) {\n case ENRTree.ROOT_PREFIX:\n next = ENRTree.parseAndVerifyRoot(entry, context.publicKey);\n return await this._search(next, context);\n case ENRTree.BRANCH_PREFIX:\n branches = ENRTree.parseBranch(entry);\n next = selectRandomPath(branches, context);\n return await this._search(next, context);\n case ENRTree.RECORD_PREFIX:\n return EnrDecoder.fromString(entry);\n default:\n return null;\n }\n }\n catch (error) {\n log.error(`Failed to search DNS tree ${entryType} at subdomain ${subdomain}: ${error}`);\n return null;\n }\n }\n catch (error) {\n log.error(`Failed to retrieve TXT record at subdomain ${subdomain}: ${error}`);\n return null;\n }\n }\n /**\n * Retrieves the TXT record stored at a location from either\n * this DNS tree cache or via DNS query.\n *\n * @throws if the TXT Record contains non-UTF-8 values.\n */\n async _getTXTRecord(subdomain, context) {\n if (this._DNSTreeCache[subdomain]) {\n return this._DNSTreeCache[subdomain];\n }\n // Location is either the top level tree entry host or a subdomain of it.\n const location = subdomain !== context.domain\n ? `${subdomain}.${context.domain}`\n : context.domain;\n const response = await this.dns.resolveTXT(location);\n if (!response.length)\n throw new Error(\"Received empty result array while fetching TXT record\");\n if (!response[0].length)\n throw new Error(\"Received empty TXT record\");\n // Branch entries can be an array of strings of comma delimited subdomains, with\n // some subdomain strings split across the array elements\n const result = response.join(\"\");\n this._DNSTreeCache[subdomain] = result;\n return result;\n }\n}\nfunction getEntryType(entry) {\n if (entry.startsWith(ENRTree.ROOT_PREFIX))\n return ENRTree.ROOT_PREFIX;\n if (entry.startsWith(ENRTree.BRANCH_PREFIX))\n return ENRTree.BRANCH_PREFIX;\n if (entry.startsWith(ENRTree.RECORD_PREFIX))\n return ENRTree.RECORD_PREFIX;\n return \"\";\n}\n/**\n * Returns a randomly selected subdomain string from the list provided by a branch\n * entry record.\n *\n * The client must track subdomains which are already resolved to avoid\n * going into an infinite loop b/c branch entries can contain\n * circular references. It’s in the client’s best interest to traverse the\n * tree in random order.\n */\nfunction selectRandomPath(branches, context) {\n // Identify domains already visited in this traversal of the DNS tree.\n // Then filter against them to prevent cycles.\n const circularRefs = {};\n for (const [idx, subdomain] of branches.entries()) {\n if (context.visits[subdomain]) {\n circularRefs[idx] = true;\n }\n }\n // If all possible paths are circular...\n if (Object.keys(circularRefs).length === branches.length) {\n throw new Error(\"Unresolvable circular path detected\");\n }\n // Randomly select a viable path\n let index;\n do {\n index = Math.floor(Math.random() * branches.length);\n } while (circularRefs[index]);\n return branches[index];\n}\n//# sourceMappingURL=dns.js.map","import { CustomEvent, TypedEventEmitter } from \"@libp2p/interface\";\nimport { peerDiscoverySymbol as symbol } from \"@libp2p/interface\";\nimport { DNS_DISCOVERY_TAG } from \"@waku/interfaces\";\nimport { encodeRelayShard, Logger } from \"@waku/utils\";\nimport { DEFAULT_BOOTSTRAP_TAG_NAME, DEFAULT_BOOTSTRAP_TAG_TTL, DEFAULT_BOOTSTRAP_TAG_VALUE, DEFAULT_NODE_REQUIREMENTS } from \"./constants.js\";\nimport { DnsNodeDiscovery } from \"./dns.js\";\nconst log = new Logger(\"peer-discovery-dns\");\n/**\n * Parse options and expose function to return bootstrap peer addresses.\n */\nexport class PeerDiscoveryDns extends TypedEventEmitter {\n nextPeer;\n _started;\n _components;\n _options;\n constructor(components, options) {\n super();\n this._started = false;\n this._components = components;\n this._options = options;\n const { enrUrls } = options;\n log.info(\"Use following EIP-1459 ENR Tree URLs: \", enrUrls);\n }\n /**\n * Start discovery process\n */\n async start() {\n log.info(\"Starting peer discovery via dns\");\n this._started = true;\n await this.findPeers();\n }\n async findPeers() {\n if (!this.nextPeer) {\n let { enrUrls } = this._options;\n if (!Array.isArray(enrUrls))\n enrUrls = [enrUrls];\n const { wantedNodeCapabilityCount } = this._options;\n const dns = await DnsNodeDiscovery.dnsOverHttp();\n this.nextPeer = dns.getNextPeer.bind(dns, enrUrls, wantedNodeCapabilityCount);\n }\n for await (const peerEnr of this.nextPeer()) {\n if (!this._started) {\n return;\n }\n const { peerInfo, shardInfo } = peerEnr;\n if (!peerInfo) {\n continue;\n }\n const tagsToUpdate = {\n [DEFAULT_BOOTSTRAP_TAG_NAME]: {\n value: this._options.tagValue ?? DEFAULT_BOOTSTRAP_TAG_VALUE,\n ttl: this._options.tagTTL ?? DEFAULT_BOOTSTRAP_TAG_TTL\n }\n };\n let isPeerChanged = false;\n const isPeerExists = await this._components.peerStore.has(peerInfo.id);\n if (isPeerExists) {\n const peer = await this._components.peerStore.get(peerInfo.id);\n const hasBootstrapTag = peer.tags.has(DEFAULT_BOOTSTRAP_TAG_NAME);\n if (!hasBootstrapTag) {\n isPeerChanged = true;\n await this._components.peerStore.merge(peerInfo.id, {\n tags: tagsToUpdate\n });\n }\n }\n else {\n isPeerChanged = true;\n await this._components.peerStore.save(peerInfo.id, {\n tags: tagsToUpdate,\n ...(shardInfo && {\n metadata: {\n shardInfo: encodeRelayShard(shardInfo)\n }\n })\n });\n }\n if (isPeerChanged) {\n this.dispatchEvent(new CustomEvent(\"peer\", { detail: peerInfo }));\n }\n }\n }\n /**\n * Stop emitting events\n */\n stop() {\n this._started = false;\n }\n get [symbol]() {\n return true;\n }\n get [Symbol.toStringTag]() {\n return DNS_DISCOVERY_TAG;\n }\n}\nexport function wakuDnsDiscovery(enrUrls, wantedNodeCapabilityCount = DEFAULT_NODE_REQUIREMENTS) {\n return (components) => new PeerDiscoveryDns(components, { enrUrls, wantedNodeCapabilityCount });\n}\n//# sourceMappingURL=dns_discovery.js.map","import { proto_peer_exchange as proto } from \"@waku/proto\";\n/**\n * PeerExchangeRPC represents a message conforming to the Waku Peer Exchange protocol\n */\nexport class PeerExchangeRPC {\n proto;\n constructor(proto) {\n this.proto = proto;\n }\n static createRequest(params) {\n const { numPeers } = params;\n return new PeerExchangeRPC({\n query: {\n numPeers: numPeers\n },\n response: undefined\n });\n }\n /**\n * Encode the current PeerExchangeRPC request to bytes\n * @returns Uint8Array\n */\n encode() {\n return proto.PeerExchangeRPC.encode(this.proto);\n }\n /**\n * Decode the current PeerExchangeRPC request to bytes\n * @returns Uint8Array\n */\n static decode(bytes) {\n const res = proto.PeerExchangeRPC.decode(bytes);\n return new PeerExchangeRPC(res);\n }\n get query() {\n return this.proto.query;\n }\n get response() {\n return this.proto.response;\n }\n}\n//# sourceMappingURL=rpc.js.map","import { BaseProtocol } from \"@waku/core/lib/base_protocol\";\nimport { EnrDecoder } from \"@waku/enr\";\nimport { ProtocolError } from \"@waku/interfaces\";\nimport { isDefined } from \"@waku/utils\";\nimport { Logger } from \"@waku/utils\";\nimport all from \"it-all\";\nimport * as lp from \"it-length-prefixed\";\nimport { pipe } from \"it-pipe\";\nimport { Uint8ArrayList } from \"uint8arraylist\";\nimport { PeerExchangeRPC } from \"./rpc.js\";\nexport const PeerExchangeCodec = \"/vac/waku/peer-exchange/2.0.0-alpha1\";\nconst log = new Logger(\"peer-exchange\");\n/**\n * Implementation of the Peer Exchange protocol (https://rfc.vac.dev/spec/34/)\n */\nexport class WakuPeerExchange extends BaseProtocol {\n /**\n * @param components - libp2p components\n */\n constructor(components, pubsubTopics) {\n super(PeerExchangeCodec, components, log, pubsubTopics);\n }\n /**\n * Make a peer exchange query to a peer\n */\n async query(params) {\n const { numPeers, peerId } = params;\n const rpcQuery = PeerExchangeRPC.createRequest({\n numPeers: BigInt(numPeers)\n });\n const peer = await this.peerStore.get(peerId);\n if (!peer) {\n return {\n peerInfos: null,\n error: ProtocolError.NO_PEER_AVAILABLE\n };\n }\n let stream;\n try {\n stream = await this.getStream(peer);\n }\n catch (err) {\n log.error(\"Failed to get stream\", err);\n return {\n peerInfos: null,\n error: ProtocolError.NO_STREAM_AVAILABLE\n };\n }\n const res = await pipe([rpcQuery.encode()], lp.encode, stream, lp.decode, async (source) => await all(source));\n try {\n const bytes = new Uint8ArrayList();\n res.forEach((chunk) => {\n bytes.append(chunk);\n });\n const { response } = PeerExchangeRPC.decode(bytes);\n if (!response) {\n log.error(\"PeerExchangeRPC message did not contains a `response` field\");\n return {\n peerInfos: null,\n error: ProtocolError.EMPTY_PAYLOAD\n };\n }\n const peerInfos = await Promise.all(response.peerInfos\n .map((peerInfo) => peerInfo.enr)\n .filter(isDefined)\n .map(async (enr) => {\n return { ENR: await EnrDecoder.fromRLP(enr) };\n }));\n return {\n peerInfos,\n error: null\n };\n }\n catch (err) {\n log.error(\"Failed to decode push reply\", err);\n return {\n peerInfos: null,\n error: ProtocolError.DECODE_FAILED\n };\n }\n }\n}\n/**\n *\n * @returns A function that creates a new peer exchange protocol\n */\nexport function wakuPeerExchange(pubsubTopics) {\n return (components) => new WakuPeerExchange(components, pubsubTopics);\n}\n//# sourceMappingURL=waku_peer_exchange.js.map","import { CustomEvent, TypedEventEmitter } from \"@libp2p/interface\";\nimport { peerDiscoverySymbol as symbol } from \"@libp2p/interface\";\nimport { Tags } from \"@waku/interfaces\";\nimport { decodeRelayShard, encodeRelayShard, Logger } from \"@waku/utils\";\nimport { PeerExchangeCodec, WakuPeerExchange } from \"./waku_peer_exchange.js\";\nconst log = new Logger(\"peer-exchange-discovery\");\nconst DEFAULT_PEER_EXCHANGE_REQUEST_NODES = 10;\nconst DEFAULT_PEER_EXCHANGE_QUERY_INTERVAL_MS = 10 * 1000;\nconst DEFAULT_MAX_RETRIES = 3;\nexport const DEFAULT_PEER_EXCHANGE_TAG_NAME = Tags.PEER_EXCHANGE;\nconst DEFAULT_PEER_EXCHANGE_TAG_VALUE = 50;\nconst DEFAULT_PEER_EXCHANGE_TAG_TTL = 100_000_000;\nexport class PeerExchangeDiscovery extends TypedEventEmitter {\n components;\n peerExchange;\n options;\n isStarted;\n queryingPeers = new Set();\n queryAttempts = new Map();\n handleDiscoveredPeer = (event) => {\n const { protocols, peerId } = event.detail;\n if (!protocols.includes(PeerExchangeCodec) ||\n this.queryingPeers.has(peerId.toString()))\n return;\n this.queryingPeers.add(peerId.toString());\n this.startRecurringQueries(peerId).catch((error) => log.error(`Error querying peer ${error}`));\n };\n constructor(components, pubsubTopics, options = {}) {\n super();\n this.components = components;\n this.peerExchange = new WakuPeerExchange(components, pubsubTopics);\n this.options = options;\n this.isStarted = false;\n }\n /**\n * Start emitting events\n */\n start() {\n if (this.isStarted) {\n return;\n }\n this.dispatchEvent(new CustomEvent(\"waku:peer-exchange:started\", { detail: true }));\n log.info(\"Starting peer exchange node discovery, discovering peers\");\n // might be better to use \"peer:identify\" or \"peer:update\"\n this.components.events.addEventListener(\"peer:identify\", this.handleDiscoveredPeer);\n }\n /**\n * Remove event listener\n */\n stop() {\n if (!this.isStarted)\n return;\n log.info(\"Stopping peer exchange node discovery\");\n this.isStarted = false;\n this.queryingPeers.clear();\n this.components.events.removeEventListener(\"peer:identify\", this.handleDiscoveredPeer);\n }\n get [symbol]() {\n return true;\n }\n get [Symbol.toStringTag]() {\n return \"@waku/peer-exchange\";\n }\n startRecurringQueries = async (peerId) => {\n const peerIdStr = peerId.toString();\n const { queryInterval = DEFAULT_PEER_EXCHANGE_QUERY_INTERVAL_MS, maxRetries = DEFAULT_MAX_RETRIES } = this.options;\n log.info(`Querying peer: ${peerIdStr} (attempt ${this.queryAttempts.get(peerIdStr) ?? 1})`);\n await this.query(peerId);\n const currentAttempt = this.queryAttempts.get(peerIdStr) ?? 1;\n if (currentAttempt > maxRetries) {\n this.abortQueriesForPeer(peerIdStr);\n return;\n }\n setTimeout(() => {\n this.queryAttempts.set(peerIdStr, currentAttempt + 1);\n this.startRecurringQueries(peerId).catch((error) => {\n log.error(`Error in startRecurringQueries: ${error}`);\n });\n }, queryInterval * currentAttempt);\n };\n async query(peerId) {\n const { error, peerInfos } = await this.peerExchange.query({\n numPeers: DEFAULT_PEER_EXCHANGE_REQUEST_NODES,\n peerId\n });\n if (error) {\n log.error(\"Peer exchange query failed\", error);\n return { error, peerInfos: null };\n }\n for (const _peerInfo of peerInfos) {\n const { ENR } = _peerInfo;\n if (!ENR) {\n log.warn(\"No ENR in peerInfo object, skipping\");\n continue;\n }\n const { peerId, peerInfo, shardInfo } = ENR;\n if (!peerId || !peerInfo) {\n continue;\n }\n const hasPeer = await this.components.peerStore.has(peerId);\n if (hasPeer) {\n const { hasMultiaddrDiff, hasShardDiff } = await this.checkPeerInfoDiff(peerInfo, shardInfo);\n if (hasMultiaddrDiff || hasShardDiff) {\n log.info(`Peer ${peerId.toString()} has updated multiaddrs or shardInfo, updating`);\n if (hasMultiaddrDiff) {\n log.info(`Peer ${peerId.toString()} has updated multiaddrs, updating`);\n await this.components.peerStore.patch(peerId, {\n multiaddrs: peerInfo.multiaddrs\n });\n }\n if (hasShardDiff && shardInfo) {\n log.info(`Peer ${peerId.toString()} has updated shardInfo, updating`);\n await this.components.peerStore.merge(peerId, {\n metadata: {\n shardInfo: encodeRelayShard(shardInfo)\n }\n });\n this.dispatchEvent(new CustomEvent(\"peer\", {\n detail: {\n id: peerId,\n multiaddrs: peerInfo.multiaddrs\n }\n }));\n }\n continue;\n }\n }\n // update the tags for the peer\n await this.components.peerStore.save(peerId, {\n tags: {\n [DEFAULT_PEER_EXCHANGE_TAG_NAME]: {\n value: this.options.tagValue ?? DEFAULT_PEER_EXCHANGE_TAG_VALUE,\n ttl: this.options.tagTTL ?? DEFAULT_PEER_EXCHANGE_TAG_TTL\n }\n },\n ...(shardInfo && {\n metadata: {\n shardInfo: encodeRelayShard(shardInfo)\n }\n }),\n ...(peerInfo.multiaddrs && {\n multiaddrs: peerInfo.multiaddrs\n })\n });\n log.info(`Discovered peer: ${peerId.toString()}`);\n this.dispatchEvent(new CustomEvent(\"peer\", {\n detail: {\n id: peerId,\n multiaddrs: peerInfo.multiaddrs\n }\n }));\n }\n return { error: null, peerInfos };\n }\n abortQueriesForPeer(peerIdStr) {\n log.info(`Aborting queries for peer: ${peerIdStr}`);\n this.queryingPeers.delete(peerIdStr);\n this.queryAttempts.delete(peerIdStr);\n }\n async checkPeerInfoDiff(peerInfo, shardInfo) {\n const { id: peerId } = peerInfo;\n const peer = await this.components.peerStore.get(peerId);\n const existingMultiaddrs = peer.addresses.map((a) => a.multiaddr.toString());\n const newMultiaddrs = peerInfo.multiaddrs.map((ma) => ma.toString());\n const hasMultiaddrDiff = existingMultiaddrs.some((ma) => !newMultiaddrs.includes(ma));\n let hasShardDiff = false;\n const existingShardInfoBytes = peer.metadata.get(\"shardInfo\");\n if (existingShardInfoBytes) {\n const existingShardInfo = decodeRelayShard(existingShardInfoBytes);\n if (existingShardInfo || shardInfo) {\n hasShardDiff =\n existingShardInfo.clusterId !== shardInfo?.clusterId ||\n existingShardInfo.shards.some((shard) => !shardInfo?.shards.includes(shard));\n }\n }\n return { hasMultiaddrDiff, hasShardDiff };\n }\n}\nexport function wakuPeerExchangeDiscovery(pubsubTopics) {\n return (components) => new PeerExchangeDiscovery(components, pubsubTopics);\n}\n//# sourceMappingURL=waku_peer_exchange_discovery.js.map","import { TypedEventEmitter } from \"@libp2p/interface\";\nimport { CustomEvent } from \"@libp2p/interface\";\nimport { createFromJSON } from \"@libp2p/peer-id-factory\";\nimport { multiaddr } from \"@multiformats/multiaddr\";\nimport { Tags } from \"@waku/interfaces\";\nimport { getWsMultiaddrFromMultiaddrs, Logger } from \"@waku/utils\";\nconst log = new Logger(\"peer-exchange-discovery\");\nexport const DEFAULT_LOCAL_TAG_NAME = Tags.LOCAL;\nconst DEFAULT_LOCAL_TAG_VALUE = 50;\nconst DEFAULT_LOCAL_TAG_TTL = 100_000_000;\nexport class LocalPeerCacheDiscovery extends TypedEventEmitter {\n components;\n options;\n isStarted;\n peers = [];\n constructor(components, options) {\n super();\n this.components = components;\n this.options = options;\n this.isStarted = false;\n this.peers = this.getPeersFromLocalStorage();\n }\n get [Symbol.toStringTag]() {\n return \"@waku/local-peer-cache-discovery\";\n }\n async start() {\n if (this.isStarted)\n return;\n log.info(\"Starting Local Storage Discovery\");\n this.components.events.addEventListener(\"peer:identify\", this.handleNewPeers);\n for (const { id: idStr, address } of this.peers) {\n const peerId = await createFromJSON({ id: idStr });\n if (await this.components.peerStore.has(peerId))\n continue;\n await this.components.peerStore.save(peerId, {\n multiaddrs: [multiaddr(address)],\n tags: {\n [this.options?.tagName ?? DEFAULT_LOCAL_TAG_NAME]: {\n value: this.options?.tagValue ?? DEFAULT_LOCAL_TAG_VALUE,\n ttl: this.options?.tagTTL ?? DEFAULT_LOCAL_TAG_TTL\n }\n }\n });\n this.dispatchEvent(new CustomEvent(\"peer\", {\n detail: {\n id: peerId,\n multiaddrs: [multiaddr(address)]\n }\n }));\n }\n log.info(`Discovered ${this.peers.length} peers`);\n this.isStarted = true;\n }\n stop() {\n if (!this.isStarted)\n return;\n log.info(\"Stopping Local Storage Discovery\");\n this.components.events.removeEventListener(\"peer:identify\", this.handleNewPeers);\n this.isStarted = false;\n this.savePeersToLocalStorage();\n }\n handleNewPeers = (event) => {\n const { peerId, listenAddrs } = event.detail;\n const websocketMultiaddr = getWsMultiaddrFromMultiaddrs(listenAddrs);\n const localStoragePeers = this.getPeersFromLocalStorage();\n const existingPeerIndex = localStoragePeers.findIndex((_peer) => _peer.id === peerId.toString());\n if (existingPeerIndex >= 0) {\n localStoragePeers[existingPeerIndex].address =\n websocketMultiaddr.toString();\n }\n else {\n localStoragePeers.push({\n id: peerId.toString(),\n address: websocketMultiaddr.toString()\n });\n }\n this.peers = localStoragePeers;\n this.savePeersToLocalStorage();\n };\n getPeersFromLocalStorage() {\n try {\n const storedPeersData = localStorage.getItem(\"waku:peers\");\n if (!storedPeersData)\n return [];\n const peers = JSON.parse(storedPeersData);\n return peers.filter(isValidStoredPeer);\n }\n catch (error) {\n log.error(\"Error parsing peers from local storage:\", error);\n return [];\n }\n }\n savePeersToLocalStorage() {\n try {\n localStorage.setItem(\"waku:peers\", JSON.stringify(this.peers));\n }\n catch (error) {\n log.error(\"Error saving peers to local storage:\", error);\n }\n }\n}\nfunction isValidStoredPeer(peer) {\n return (peer &&\n typeof peer === \"object\" &&\n typeof peer.id === \"string\" &&\n typeof peer.address === \"string\");\n}\nexport function wakuLocalPeerCacheDiscovery() {\n return (components, options) => new LocalPeerCacheDiscovery(components, options);\n}\n//# sourceMappingURL=index.js.map","export * from \"./is_defined.js\";\nexport * from \"./random_subset.js\";\nexport * from \"./group_by.js\";\nexport * from \"./to_async_iterator.js\";\nexport * from \"./is_size_valid.js\";\nexport * from \"./sharding/index.js\";\nexport * from \"./push_or_init_map.js\";\nexport * from \"./relay_shard_codec.js\";\nexport * from \"./delay.js\";\nexport function removeItemFromArray(arr, value) {\n const index = arr.indexOf(value);\n if (index > -1) {\n arr.splice(index, 1);\n }\n return arr;\n}\nexport function getWsMultiaddrFromMultiaddrs(addresses) {\n const wsMultiaddr = addresses.find((addr) => addr.toString().includes(\"ws\") || addr.toString().includes(\"wss\"));\n if (!wsMultiaddr) {\n throw new Error(\"No ws multiaddr found in the given addresses\");\n }\n return wsMultiaddr;\n}\n//# sourceMappingURL=index.js.map","import { noise } from \"@chainsafe/libp2p-noise\";\nimport { bootstrap } from \"@libp2p/bootstrap\";\nimport { identify } from \"@libp2p/identify\";\nimport { mplex } from \"@libp2p/mplex\";\nimport { ping } from \"@libp2p/ping\";\nimport { webSockets } from \"@libp2p/websockets\";\nimport { all as filterAll, wss } from \"@libp2p/websockets/filters\";\nimport { wakuMetadata } from \"@waku/core\";\nimport { DefaultNetworkConfig } from \"@waku/interfaces\";\nimport { derivePubsubTopicsFromNetworkConfig, Logger } from \"@waku/utils\";\nimport { createLibp2p } from \"libp2p\";\nimport { DefaultPingMaxInboundStreams, DefaultUserAgent } from \"../waku.js\";\nimport { defaultPeerDiscoveries } from \"./discovery.js\";\nconst log = new Logger(\"sdk:create\");\nexport async function defaultLibp2p(pubsubTopics, options, userAgent) {\n if (!options?.hideWebSocketInfo && process?.env?.NODE_ENV !== \"test\") {\n /* eslint-disable no-console */\n console.info(\"%cIgnore WebSocket connection failures\", \"background: gray; color: white; font-size: x-large\");\n console.info(\"%cWaku tries to discover peers and some of them are expected to fail\", \"background: gray; color: white; font-size: x-large\");\n /* eslint-enable no-console */\n }\n const metadataService = pubsubTopics\n ? { metadata: wakuMetadata(pubsubTopics) }\n : {};\n const filter = options?.filterMultiaddrs === false || process?.env?.NODE_ENV === \"test\"\n ? filterAll\n : wss;\n return createLibp2p({\n connectionManager: {\n minConnections: 1\n },\n transports: [webSockets({ filter: filter })],\n streamMuxers: [mplex()],\n connectionEncryption: [noise()],\n ...options,\n services: {\n identify: identify({\n agentVersion: userAgent ?? DefaultUserAgent\n }),\n ping: ping({\n maxInboundStreams: options?.pingMaxInboundStreams ?? DefaultPingMaxInboundStreams\n }),\n ...metadataService,\n ...options?.services\n }\n }); // TODO: make libp2p include it;\n}\nexport async function createLibp2pAndUpdateOptions(options) {\n const { networkConfig } = options;\n const pubsubTopics = derivePubsubTopicsFromNetworkConfig(networkConfig ?? DefaultNetworkConfig);\n log.info(\"Creating Waku node with pubsub topics\", pubsubTopics);\n const libp2pOptions = options?.libp2p ?? {};\n const peerDiscovery = libp2pOptions.peerDiscovery ?? [];\n if (options?.defaultBootstrap) {\n peerDiscovery.push(...defaultPeerDiscoveries(pubsubTopics));\n }\n if (options?.bootstrapPeers) {\n peerDiscovery.push(bootstrap({ list: options.bootstrapPeers }));\n }\n libp2pOptions.peerDiscovery = peerDiscovery;\n const libp2p = await defaultLibp2p(pubsubTopics, libp2pOptions, options?.userAgent);\n return { libp2p, pubsubTopics };\n}\n//# sourceMappingURL=libp2p.js.map","/**\n * @packageDocumentation\n *\n * Use the `createLibp2p` function to create a libp2p node.\n *\n * @example\n *\n * ```typescript\n * import { createLibp2p } from 'libp2p'\n *\n * const node = await createLibp2p({\n * // ...other options\n * })\n * ```\n */\nimport { createLibp2pNode } from './libp2p.js';\n/**\n * Returns a new instance of the Libp2p interface, generating a new PeerId\n * if one is not passed as part of the options.\n *\n * The node will be started unless `start: false` is passed as an option.\n *\n * @example\n *\n * ```TypeScript\n * import { createLibp2p } from 'libp2p'\n * import { tcp } from '@libp2p/tcp'\n * import { mplex } from '@libp2p/mplex'\n * import { noise } from '@chainsafe/libp2p-noise'\n * import { yamux } from '@chainsafe/libp2p-yamux'\n *\n * // specify options\n * const options = {\n * transports: [tcp()],\n * streamMuxers: [yamux(), mplex()],\n * connectionEncryption: [noise()]\n * }\n *\n * // create libp2p\n * const libp2p = await createLibp2p(options)\n * ```\n */\nexport async function createLibp2p(options = {}) {\n const node = await createLibp2pNode(options);\n if (options.start !== false) {\n await node.start();\n }\n return node;\n}\n//# sourceMappingURL=index.js.map","import { WakuNode } from \"../waku.js\";\nimport { createLibp2pAndUpdateOptions } from \"./libp2p.js\";\n/**\n * Create a Waku node that uses Waku Light Push, Filter and Store to send and\n * receive messages, enabling low resource consumption.\n * Uses Waku Filter V2 by default.\n */\nexport async function createLightNode(options = {}) {\n const { libp2p, pubsubTopics } = await createLibp2pAndUpdateOptions(options);\n return new WakuNode(pubsubTopics, options, libp2p, {\n store: true,\n lightpush: true,\n filter: true\n });\n}\n//# sourceMappingURL=create.js.map","export function isStaticSharding(config) {\n return (\"clusterId\" in config && \"shards\" in config && !(\"contentTopics\" in config));\n}\nexport function isAutoSharding(config) {\n return \"contentTopics\" in config;\n}\n//# sourceMappingURL=type_guards.js.map","import { enrTree, wakuDnsDiscovery, wakuLocalPeerCacheDiscovery, wakuPeerExchangeDiscovery } from \"@waku/discovery\";\nexport function defaultPeerDiscoveries(pubsubTopics) {\n const dnsEnrTrees = [enrTree[\"SANDBOX\"], enrTree[\"TEST\"]];\n const discoveries = [\n wakuDnsDiscovery(dnsEnrTrees),\n wakuLocalPeerCacheDiscovery(),\n wakuPeerExchangeDiscovery(pubsubTopics)\n ];\n return discoveries;\n}\n//# sourceMappingURL=discovery.js.map","var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n return new (P || (P = Promise))(function (resolve, reject) {\n function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n step((generator = generator.apply(thisArg, _arguments || [])).next());\n });\n};\nvar __generator = (this && this.__generator) || function (thisArg, body) {\n var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\n return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\n function verb(n) { return function (v) { return step([n, v]); }; }\n function step(op) {\n if (f) throw new TypeError(\"Generator is already executing.\");\n while (g && (g = 0, op[0] && (_ = 0)), _) try {\n if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\n if (y = 0, t) op = [op[0] & 2, t.value];\n switch (op[0]) {\n case 0: case 1: t = op; break;\n case 4: _.label++; return { value: op[1], done: false };\n case 5: _.label++; y = op[1]; op = [0]; continue;\n case 7: op = _.ops.pop(); _.trys.pop(); continue;\n default:\n if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\n if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\n if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\n if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\n if (t[2]) _.ops.pop();\n _.trys.pop(); continue;\n }\n op = body.call(thisArg, _);\n } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\n if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\n }\n};\nexport var TelemetryType;\n(function (TelemetryType) {\n TelemetryType[\"LIGHT_PUSH_FILTER\"] = \"LightPushFilter\";\n TelemetryType[\"LIGHT_PUSH_ERROR\"] = \"LightPushError\";\n TelemetryType[\"GENERIC\"] = \"Generic\";\n})(TelemetryType || (TelemetryType = {}));\nvar TelemetryClient = /** @class */ (function () {\n function TelemetryClient(url, intervalPeriod) {\n if (intervalPeriod === void 0) { intervalPeriod = 5000; }\n this.url = url;\n this.intervalPeriod = intervalPeriod;\n this.queue = [];\n this.intervalId = null;\n this.requestId = 0;\n }\n TelemetryClient.prototype.push = function (messages) {\n var _a;\n (_a = this.queue).push.apply(_a, messages);\n };\n TelemetryClient.prototype.start = function () {\n return __awaiter(this, void 0, void 0, function () {\n var _this = this;\n return __generator(this, function (_a) {\n if (!this.intervalId) {\n this.intervalId = setInterval(function () { return __awaiter(_this, void 0, void 0, function () {\n var success;\n return __generator(this, function (_a) {\n switch (_a.label) {\n case 0:\n if (!(this.queue.length > 0)) return [3 /*break*/, 2];\n return [4 /*yield*/, this.send(this.queue)];\n case 1:\n success = _a.sent();\n if (success) {\n console.log(\"Sent \", this.queue.length, \" telemetry logs\");\n this.queue = [];\n }\n _a.label = 2;\n case 2: return [2 /*return*/];\n }\n });\n }); }, this.intervalPeriod);\n }\n return [2 /*return*/];\n });\n });\n };\n TelemetryClient.prototype.stop = function () {\n if (this.intervalId) {\n clearInterval(this.intervalId);\n this.intervalId = null;\n }\n };\n TelemetryClient.prototype.send = function (messages) {\n return __awaiter(this, void 0, void 0, function () {\n var telemetryRequests, res, e_1;\n var _this = this;\n return __generator(this, function (_a) {\n switch (_a.label) {\n case 0:\n telemetryRequests = messages.map(function (message) { return ({\n id: ++_this.requestId,\n telemetryType: message.messageType.toString(),\n telemetryData: message\n }); });\n _a.label = 1;\n case 1:\n _a.trys.push([1, 3, , 4]);\n return [4 /*yield*/, fetch(this.url, {\n method: \"POST\",\n body: JSON.stringify(telemetryRequests),\n })];\n case 2:\n res = _a.sent();\n if (res.status !== 201) {\n console.error(\"Error sending messages to telemetry service: \", res.status, res.statusText, res.json);\n return [2 /*return*/, false];\n }\n return [2 /*return*/, true];\n case 3:\n e_1 = _a.sent();\n console.error(\"Error sending messages to telemetry service: \", e_1);\n console.error(\"Failed trying to send the following messages: \", telemetryRequests);\n return [2 /*return*/, false];\n case 4: return [2 /*return*/];\n }\n });\n });\n };\n return TelemetryClient;\n}());\nexport { TelemetryClient };\n","var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n return new (P || (P = Promise))(function (resolve, reject) {\n function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n step((generator = generator.apply(thisArg, _arguments || [])).next());\n });\n};\nvar __generator = (this && this.__generator) || function (thisArg, body) {\n var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\n return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\n function verb(n) { return function (v) { return step([n, v]); }; }\n function step(op) {\n if (f) throw new TypeError(\"Generator is already executing.\");\n while (g && (g = 0, op[0] && (_ = 0)), _) try {\n if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\n if (y = 0, t) op = [op[0] & 2, t.value];\n switch (op[0]) {\n case 0: case 1: t = op; break;\n case 4: _.label++; return { value: op[1], done: false };\n case 5: _.label++; y = op[1]; op = [0]; continue;\n case 7: op = _.ops.pop(); _.trys.pop(); continue;\n default:\n if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\n if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\n if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\n if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\n if (t[2]) _.ops.pop();\n _.trys.pop(); continue;\n }\n op = body.call(thisArg, _);\n } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\n if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\n }\n};\nexport var generateRandomNumber = function () {\n return Math.floor(Math.random() * 1000000);\n};\nexport var hashNumber = function (number) { return __awaiter(void 0, void 0, void 0, function () {\n var encoder, data, buffer;\n return __generator(this, function (_a) {\n switch (_a.label) {\n case 0:\n encoder = new TextEncoder();\n data = encoder.encode(number.toString());\n return [4 /*yield*/, crypto.subtle.digest(\"SHA-256\", data)];\n case 1:\n buffer = _a.sent();\n return [2 /*return*/, Array.from(new Uint8Array(buffer))\n .map(function (b) { return b.toString(16).padStart(2, \"0\"); })\n .join(\"\")];\n }\n });\n}); };\n","var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n return new (P || (P = Promise))(function (resolve, reject) {\n function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n step((generator = generator.apply(thisArg, _arguments || [])).next());\n });\n};\nvar __generator = (this && this.__generator) || function (thisArg, body) {\n var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\n return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\n function verb(n) { return function (v) { return step([n, v]); }; }\n function step(op) {\n if (f) throw new TypeError(\"Generator is already executing.\");\n while (g && (g = 0, op[0] && (_ = 0)), _) try {\n if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\n if (y = 0, t) op = [op[0] & 2, t.value];\n switch (op[0]) {\n case 0: case 1: t = op; break;\n case 4: _.label++; return { value: op[1], done: false };\n case 5: _.label++; y = op[1]; op = [0]; continue;\n case 7: op = _.ops.pop(); _.trys.pop(); continue;\n default:\n if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\n if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\n if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\n if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\n if (t[2]) _.ops.pop();\n _.trys.pop(); continue;\n }\n op = body.call(thisArg, _);\n } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\n if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\n }\n};\nvar __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {\n if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\n if (ar || !(i in from)) {\n if (!ar) ar = Array.prototype.slice.call(from, 0, i);\n ar[i] = from[i];\n }\n }\n return to.concat(ar || Array.prototype.slice.call(from));\n};\nimport { createLightNode, createEncoder, createDecoder, waitForRemotePeer, utils } from \"@waku/sdk\";\nimport { Type, Field } from \"protobufjs\";\nimport { TelemetryClient, TelemetryType, } from \"./telemetry_client\";\nimport { generateRandomNumber, hashNumber } from \"./util\";\nvar DEFAULT_CONTENT_TOPIC = \"/js-waku-examples/1/message-ratio/utf8\";\nvar TELEMETRY_URL = process.env.TELEMETRY_URL || \"http://localhost:8080/waku-metrics\";\nvar ProtoSequencedMessage = new Type(\"SequencedMessage\")\n .add(new Field(\"hash\", 1, \"string\"))\n .add(new Field(\"total\", 2, \"uint64\"))\n .add(new Field(\"index\", 3, \"uint64\"))\n .add(new Field(\"sender\", 4, \"string\"));\nvar sequenceCompletedEvent = new CustomEvent(\"sequenceCompleted\");\nvar messageSentEvent = new CustomEvent(\"messageSent\");\nvar messageReceivedEvent = new CustomEvent(\"messageReceived\");\nvar wakuNode = function () { return __awaiter(void 0, void 0, void 0, function () {\n return __generator(this, function (_a) {\n switch (_a.label) {\n case 0: return [4 /*yield*/, createLightNode({\n networkConfig: {\n contentTopics: [DEFAULT_CONTENT_TOPIC],\n },\n defaultBootstrap: true,\n })];\n case 1: return [2 /*return*/, _a.sent()];\n }\n });\n}); };\nexport function app(telemetryClient) {\n return __awaiter(this, void 0, void 0, function () {\n var node, peerId, encoder, startLightPushSequence, startFilterSubscription;\n var _this = this;\n return __generator(this, function (_a) {\n switch (_a.label) {\n case 0: return [4 /*yield*/, wakuNode()];\n case 1:\n node = _a.sent();\n return [4 /*yield*/, node.start()];\n case 2:\n _a.sent();\n return [4 /*yield*/, waitForRemotePeer(node)];\n case 3:\n _a.sent();\n peerId = node.libp2p.peerId.toString();\n encoder = createEncoder({\n contentTopic: DEFAULT_CONTENT_TOPIC,\n });\n startLightPushSequence = function (numMessages_1) {\n var args_1 = [];\n for (var _i = 1; _i < arguments.length; _i++) {\n args_1[_i - 1] = arguments[_i];\n }\n return __awaiter(_this, __spreadArray([numMessages_1], args_1, true), void 0, function (numMessages, period) {\n var sequenceHash, sequenceTotal, sequenceIndex, sendMessage;\n var _this = this;\n if (period === void 0) { period = 3000; }\n return __generator(this, function (_a) {\n switch (_a.label) {\n case 0: return [4 /*yield*/, hashNumber(generateRandomNumber())];\n case 1:\n sequenceHash = _a.sent();\n sequenceTotal = numMessages;\n sequenceIndex = 0;\n sendMessage = function () { return __awaiter(_this, void 0, void 0, function () {\n var message, payload, result, messageElement, messagesSent, error_1;\n return __generator(this, function (_a) {\n switch (_a.label) {\n case 0:\n _a.trys.push([0, 2, , 3]);\n message = ProtoSequencedMessage.create({\n hash: sequenceHash,\n total: sequenceTotal,\n index: sequenceIndex,\n sender: peerId,\n });\n payload = ProtoSequencedMessage.encode(message).finish();\n return [4 /*yield*/, node.lightPush.send(encoder, {\n payload: payload,\n timestamp: new Date(),\n })];\n case 1:\n result = _a.sent();\n console.log(\"===\");\n console.log(\"light push successes: \", result.successes.length);\n console.log(result.successes);\n console.log(\"light push failures: \", result.failures.length);\n console.log(result.failures);\n if (result.successes.length > 0) {\n // Push to telemetry client\n telemetryClient.push([\n {\n messageType: TelemetryType.LIGHT_PUSH_FILTER,\n timestamp: Math.floor(new Date().getTime() / 1000),\n peerIdSender: peerId,\n peerIdReporter: peerId,\n sequenceHash: sequenceHash,\n sequenceTotal: sequenceTotal,\n sequenceIndex: sequenceIndex,\n contentTopic: DEFAULT_CONTENT_TOPIC,\n pubsubTopic: utils.contentTopicToPubsubTopic(DEFAULT_CONTENT_TOPIC),\n },\n ]);\n messageElement = document.createElement(\"div\");\n messagesSent = document.getElementById(\"messagesSent\");\n messageElement.textContent = \"Message: \".concat(sequenceHash, \" \").concat(sequenceIndex, \" of \").concat(sequenceTotal);\n messagesSent.insertBefore(messageElement, messagesSent.firstChild);\n messagesSent.insertBefore(document.createElement(\"br\"), messagesSent.firstChild);\n document.dispatchEvent(messageSentEvent);\n // Increment sequence\n sequenceIndex++;\n }\n if (result.failures.length > 0) {\n telemetryClient.push(result.failures.map(function (failure) {\n var _a;\n return ({\n messageType: TelemetryType.LIGHT_PUSH_ERROR,\n timestamp: Math.floor(new Date().getTime() / 1000),\n peerId: peerId,\n peerIdRemote: (_a = failure.peerId) === null || _a === void 0 ? void 0 : _a.toString(),\n errorMessage: failure.error.toString(),\n contentTopic: DEFAULT_CONTENT_TOPIC,\n });\n }));\n }\n if (sequenceIndex < sequenceTotal) {\n setTimeout(sendMessage, period); // Schedule the next send\n }\n else {\n document.dispatchEvent(sequenceCompletedEvent);\n }\n return [3 /*break*/, 3];\n case 2:\n error_1 = _a.sent();\n console.error(\"Error sending message\", error_1);\n return [3 /*break*/, 3];\n case 3: return [2 /*return*/];\n }\n });\n }); };\n sendMessage(); // Start the recursive sending\n return [2 /*return*/];\n }\n });\n });\n };\n startFilterSubscription = function () { return __awaiter(_this, void 0, void 0, function () {\n var decoder, messagesReceived, subscriptionCallback;\n return __generator(this, function (_a) {\n switch (_a.label) {\n case 0:\n decoder = createDecoder(DEFAULT_CONTENT_TOPIC);\n messagesReceived = document.getElementById(\"messagesReceived\");\n subscriptionCallback = function (message) {\n var sequencedMessage = ProtoSequencedMessage.decode(message.payload);\n // Don't bother reporting messages sent by this same node\n if (sequencedMessage.sender === peerId) {\n return;\n }\n telemetryClient.push([\n {\n messageType: TelemetryType.LIGHT_PUSH_FILTER,\n timestamp: Math.floor(new Date().getTime() / 1000),\n peerIdSender: sequencedMessage.sender,\n peerIdReporter: peerId,\n sequenceHash: sequencedMessage.hash,\n sequenceTotal: sequencedMessage.total,\n sequenceIndex: sequencedMessage.index,\n contentTopic: DEFAULT_CONTENT_TOPIC,\n pubsubTopic: utils.contentTopicToPubsubTopic(DEFAULT_CONTENT_TOPIC),\n },\n ]);\n var messageElement = document.createElement(\"div\");\n messageElement.textContent = \"Message: \".concat(sequencedMessage.hash, \" \").concat(sequencedMessage.index, \" of \").concat(sequencedMessage.total);\n messagesReceived.appendChild(messageElement);\n messagesReceived.appendChild(document.createElement(\"br\"));\n document.dispatchEvent(messageReceivedEvent);\n };\n return [4 /*yield*/, node.filter.subscribe(decoder, subscriptionCallback)];\n case 1:\n _a.sent();\n return [2 /*return*/];\n }\n });\n }); };\n return [2 /*return*/, {\n node: node,\n startLightPushSequence: startLightPushSequence,\n startFilterSubscription: startFilterSubscription,\n }];\n }\n });\n });\n}\n(function () { return __awaiter(void 0, void 0, void 0, function () {\n function startSequence() {\n var numMessages = Math.floor(Math.random() * 16) + 5;\n var messagePeriod = Math.floor(Math.random() * 2001) + 5000;\n startLightPushSequence(numMessages, messagePeriod);\n }\n var telemetryClient, _a, node, startLightPushSequence, startFilterSubscription, runningScreen, sentMessagesCount, sentMessagesCounter, receivedMessagesCount, receivedMessagesCounter;\n return __generator(this, function (_b) {\n switch (_b.label) {\n case 0:\n telemetryClient = new TelemetryClient(TELEMETRY_URL, 5000);\n return [4 /*yield*/, app(telemetryClient)];\n case 1:\n _a = _b.sent(), node = _a.node, startLightPushSequence = _a.startLightPushSequence, startFilterSubscription = _a.startFilterSubscription;\n window.waku = node;\n runningScreen = document.getElementById(\"runningScreen\");\n runningScreen.style.display = \"block\";\n return [4 /*yield*/, telemetryClient.start()];\n case 2:\n _b.sent();\n startFilterSubscription();\n sentMessagesCount = 0;\n sentMessagesCounter = document.getElementById(\"numSent\");\n document.addEventListener(\"messageSent\", function () {\n sentMessagesCount++;\n sentMessagesCounter.textContent = sentMessagesCount.toString();\n });\n receivedMessagesCount = 0;\n receivedMessagesCounter = document.getElementById(\"numReceived\");\n document.addEventListener(\"messageReceived\", function () {\n receivedMessagesCount++;\n receivedMessagesCounter.textContent = receivedMessagesCount.toString();\n });\n document.addEventListener(sequenceCompletedEvent.type, function () { return startSequence(); });\n startSequence();\n return [2 /*return*/];\n }\n });\n}); })();\n"],"names":["module","exports","fn","ctx","params","Array","arguments","length","offset","index","pending","Promise","resolve","reject","err","apply","base64","string","p","n","charAt","Math","ceil","b64","s64","i","encode","buffer","start","end","t","parts","chunk","j","b","push","String","fromCharCode","slice","join","invalidEncoding","decode","c","charCodeAt","undefined","Error","test","codegen","functionParams","functionName","body","Codegen","formatStringOrScope","source","toString","verbose","console","log","scopeKeys","Object","keys","scopeParams","scopeValues","scopeOffset","Function","formatParams","formatOffset","replace","$0","$1","value","Number","floor","JSON","stringify","functionNameOverride","EventEmitter","this","_listeners","prototype","on","evt","off","listeners","splice","emit","args","fetch","asPromise","fs","inquire","filename","options","callback","xhr","readFile","contents","XMLHttpRequest","binary","onreadystatechange","readyState","status","response","responseText","Uint8Array","overrideMimeType","responseType","open","send","factory","Float32Array","f32","f8b","le","writeFloat_f32_cpy","val","buf","pos","writeFloat_f32_rev","readFloat_f32_cpy","readFloat_f32_rev","writeFloatLE","writeFloatBE","readFloatLE","readFloatBE","writeFloat_ieee754","writeUint","sign","isNaN","round","exponent","LN2","pow","readFloat_ieee754","readUint","uint","mantissa","NaN","Infinity","bind","writeUintLE","writeUintBE","readUintLE","readUintBE","Float64Array","f64","writeDouble_f64_cpy","writeDouble_f64_rev","readDouble_f64_cpy","readDouble_f64_rev","writeDoubleLE","writeDoubleBE","readDoubleLE","readDoubleBE","writeDouble_ieee754","off0","off1","readDouble_ieee754","lo","hi","moduleName","mod","eval","e","path","isAbsolute","normalize","split","absolute","prefix","shift","originPath","includePath","alreadyNormalized","alloc","size","SIZE","MAX","slab","call","utf8","len","read","write","c1","c2","formatArgs","useColors","namespace","humanize","diff","color","lastC","match","save","namespaces","storage","setItem","removeItem","error","load","r","getItem","process","env","DEBUG","window","type","__nwjs","navigator","userAgent","toLowerCase","document","documentElement","style","WebkitAppearance","firebug","exception","table","parseInt","RegExp","localStorage","localstorage","destroy","warned","warn","colors","debug","formatters","v","message","createDebug","prevTime","namespacesCache","enabledCache","enableOverride","enabled","self","curr","Date","ms","prev","coerce","unshift","format","formatter","selectColor","extend","defineProperty","enumerable","configurable","get","set","init","delimiter","newDebug","toNamespace","regexp","substring","default","stack","disable","names","map","skips","enable","name","forEach","key","hash","abs","assign","obj","props","code","TypeError","_","ErrClass","create","getPrototypeOf","event_iterator_1","EventIterator","EventQueue","constructor","pullQueue","pushQueue","eventHandlers","isPaused","isStopped","resolution","done","placeholder","highWaterMark","highWater","stop","remove","fail","rejection","catch","then","removeCallback","Symbol","asyncIterator","next","result","lowWaterMark","lowWater","return","listen","queue","event","freeze","has","hasOwnProperty","Events","EE","context","once","addListener","emitter","listener","_events","_eventsCount","clearEvent","__proto__","eventNames","events","getOwnPropertySymbols","concat","handlers","l","ee","listenerCount","a1","a2","a3","a4","a5","removeListener","removeAllListeners","prefixed","max","cache","_cache","update","clear","root","HI_BASE32_NO_NODE_JS","versions","node","global","COMMON_JS","HI_BASE32_NO_COMMON_JS","AMD","BASE32_ENCODE_CHAR","BASE32_DECODE_CHAR","blocks","throwInvalidUtf8","position","partial","substr","decodeAsBytes","base32Str","v1","v2","v3","v4","v5","v6","v7","v8","bytes","count","remain","asciiOnly","str","followingChars","toUtf8String","indexOf","input","notString","ArrayBuffer","encodeBytes","encodeAscii","encodeUtf8","asBytes","base32","electron","INPUT_ERROR","WINDOW","JS_SHA3_NO_WINDOW","WEB_WORKER","JS_SHA3_NO_NODE_JS","JS_SHA3_NO_COMMON_JS","ARRAY_BUFFER","JS_SHA3_NO_ARRAY_BUFFER","HEX_CHARS","CSHAKE_PADDING","SHIFT","RC","BITS","SHAKE_BITS","OUTPUT_TYPES","CSHAKE_BYTEPAD","isArray","isView","JS_SHA3_NO_ARRAY_BUFFER_IS_VIEW","formatMessage","empty","cloneArray","array","newArray","createOutputMethod","bits","padding","outputType","Keccak","createShakeOutputMethod","outputBits","createCshakeOutputMethod","s","methods","createKmacOutputMethod","createOutputMethods","method","createMethod","algorithms","w","bytepad","Kmac","methodNames","algorithm","methodName","newMethodName","reset","finalized","block","blockCount","byteCount","outputBlocks","extraBytes","isString","lastByteIndex","f","x","right","o","encodeString","strs","paddingBytes","zeros","finalize","hex","arrayBuffer","Uint32Array","digest","h","c0","c3","c4","c5","c6","c7","c8","c9","b0","b1","b2","b3","b4","b5","b6","b7","b8","b9","b10","b11","b12","b13","b14","b15","b16","b17","b18","b19","b20","b21","b22","b23","b24","b25","b26","b27","b28","b29","b30","b31","b32","b33","b34","b35","b36","b37","b38","b39","b40","b41","b42","b43","b44","b45","b46","b47","b48","b49","isOptionObject","propertyIsEnumerable","object","writable","globalThis","defaultMergeOptions","concatArrays","ignoreUndefined","getEnumerableOwnPropertyKeys","symbols","symbol","clone","cloneOptionObject","mergeKeys","merged","config","merge","resultIndex","indices","k","filter","includes","option","m","d","plural","msAbs","isPlural","exec","parseFloat","parse","isFinite","long","fmtShort","library","_validBytes","isInteger","_x86Multiply","_x86Rotl","_x86Fmix","_x64Add","_x64Multiply","_x64Rotl","_x64LeftShift","_x64Xor","_x64Fmix","x86","hash32","seed","inputValidation","remainder","h1","k1","hash128","h2","h3","h4","k2","k3","k4","x64","murmurHash3","Netmask","atob","chr","chr0","chrA","chra","ip2long","long2ip","ip","ref","base","dmax","net","mask","maskLong","error1","bitmask","netLong","hostmask","first","last","broadcast","contains","lastLong","common","timeType","commonRe","json","nested","google","protobuf","Any","fields","type_url","id","Duration","seconds","nanos","Timestamp","Empty","Struct","keyType","Value","oneofs","kind","oneof","nullValue","numberValue","stringValue","boolValue","structValue","listValue","NullValue","values","NULL_VALUE","ListValue","rule","DoubleValue","FloatValue","Int64Value","UInt64Value","Int32Value","UInt32Value","BoolValue","StringValue","BytesValue","FieldMask","paths","file","converter","Enum","util","genValuePartial_fromObject","gen","field","fieldIndex","prop","defaultAlreadyEmitted","resolvedType","typeDefault","repeated","fullName","isUnsigned","genValuePartial_toObject","fromObject","mtype","fieldsArray","safeProp","toObject","sort","compareFieldsById","repeatedFields","mapFields","normalFields","partOf","valuesById","low","high","unsigned","toNumber","arrayDefault","hasKs2","_fieldsArray","group","types","defaults","basic","packed","rfield","required","missing","wireType","mapKey","genTypePartial","optional","ReflectionObject","className","Namespace","comment","comments","valuesOptions","reserved","fromJSON","enm","toJSON","toJSONOptions","keepComments","Boolean","add","isReservedId","isReservedName","allow_alias","Field","Type","ruleRe","isObject","defaultValue","Long","extensionField","declaringField","_packed","getOption","setOption","ifNotSet","resolved","parent","lookupTypeOrEnum","proto3_optional","fromNumber","newBuffer","emptyObject","emptyArray","ctor","fieldId","fieldType","fieldRule","decorateType","decorateEnum","fieldName","_configure","Type_","build","Root","loadSync","encoder","decoder","verifier","OneOf","MapField","Service","Method","Message","wrappers","configure","Writer","BufferWriter","Reader","BufferReader","rpc","roots","tokenize","resolvedKeyType","fieldKeyType","fieldValueType","properties","$type","writer","encodeDelimited","reader","decodeDelimited","verify","requestType","requestStream","responseStream","parsedOptions","resolvedRequestType","resolvedResponseType","lookupType","arrayToJSON","_nestedArray","clearCache","addJSON","toArray","nestedArray","nestedJson","getEnum","setOptions","onAdd","onRemove","define","ptr","part","resolveAll","lookup","filterTypes","parentAlreadyChecked","found","lookupEnum","lookupService","Service_","Enum_","defineProperties","_handleAdd","_handleRemove","setParsedOption","propName","opt","find","newValue","setProperty","newOpt","Root_","fieldNames","addFieldsToParent","oneofName","oneOfGetter","oneOfSetter","keepCase","base10Re","base10NegRe","base16Re","base16NegRe","base8Re","base8NegRe","numberRe","nameRe","typeRefRe","fqTypeRefRe","pkg","imports","weakImports","syntax","token","preferTrailingComment","tn","alternateCommentMode","peek","skip","cmnt","head","isProto3","applyCase","camelCase","illegal","insideTryCatch","line","readString","readValue","acceptTypeRef","parseNumber","readRanges","target","acceptStrings","parseId","dummy","ifBlock","parseOption","parseInlineOptions","acceptNegative","parsePackage","parseImport","whichImports","parseSyntax","parseCommon","parseType","parseEnum","service","commentText","parseMethod","parseService","reference","parseField","parseExtension","fnIf","fnElse","trailingLine","valueType","parseMapField","parseOneOf","extensions","endsWith","startsWith","lcFirst","ucFirst","parseGroup","parseEnumValue","isCustom","parseOptionValue","objectResult","lastValue","prevValue","simpleValue","LongBits","indexOutOfRange","writeLength","RangeError","create_array","Buffer","isBuffer","readLongVarint","readFixed32_end","readFixed64","_slice","subarray","uint32","int32","sint32","bool","fixed32","sfixed32","float","double","nativeBuffer","skipType","BufferReader_","int64","uint64","sint64","zzDecode","fixed64","sfixed64","utf8Slice","min","deferred","files","SYNC","resolvePath","sync","finish","cb","getBundledFileName","idx","lastIndexOf","altname","parsed","queued","weak","setTimeout","readFileSync","isNode","exposeRe","tryHandleExtension","extendedType","sisterField","parse_","common_","rpcImpl","requestDelimited","responseDelimited","rpcCall","requestCtor","responseCtor","request","endedByRPC","_methodsArray","inherited","methodsArray","rpcService","isReserved","q","delimRe","stringDoubleRe","stringSingleRe","setCommentRe","setCommentAltRe","setCommentSplitRe","whitespaceRe","unescapeRe","unescapeMap","unescape","lastCommentLine","stringDelim","subject","setComment","isLeading","lineEmpty","leading","commentOffset","lines","trim","text","isDoubleSlashCommentLine","startOffset","endOffset","findEndOfLine","lineText","cursor","re","lastIndex","repeat","isDoc","isLeadingComment","expected","actual","ret","_fieldsById","_oneofsArray","_ctor","fieldsById","oneofsArray","generateConstructor","ctorProperties","setup","wrapper","originalThis","fork","ldelim","typeName","bake","safePropBackslashRe","safePropQuoteRe","toUpperCase","camelCaseRe","a","decorateRoot","decorateEnumIndex","dst","setProp","zero","zzEncode","zeroHash","from","fromString","toLong","fromHash","toHash","part0","part1","part2","src","newError","CustomError","captureStackTrace","pool","isset","isSet","utf8Write","_Buffer_from","_Buffer_allocUnsafe","sizeOrArray","dcodeIO","key2Re","key32Re","key64Re","longToHash","longFromHash","fromBits","ProtocolError","fieldMap","longs","enums","encoding","allocUnsafe","seenFirstField","invalid","genVerifyKey","genVerifyValue","oneofProp","Op","noop","State","tail","states","writeByte","VarintOp","writeVarint64","writeFixed32","_push","writeBytes","BufferWriter_","writeStringBuffer","writeBytesBuffer","copy","byteLength","BufferSourceConverter","isArrayBuffer","data","toArrayBuffer","byteOffset","toUint8Array","toView","isArrayBufferView","isBufferSource","isEqual","aView","bView","buffers","res","view","STRING_TYPE","HEX_REGEX","BASE64_REGEX","BASE64URL_REGEX","Utf8Converter","encodeURIComponent","uintArray","encodedString","decodeURIComponent","escape","Utf16Converter","littleEndian","dataView","DataView","getUint16","setUint16","Convert","isHex","isBase64","isBase64Url","ToString","enc","ToUtf8String","ToBinary","ToHex","ToBase64","ToBase64Url","FromString","FromUtf8String","FromBinary","FromHex","FromBase64","FromBase64Url","btoa","formatted","formatString","base64url","Base64Padding","DEFAULT_UTF8_ENCODING","stringLength","resultView","byte","hexString","ToUtf16String","FromUtf16String","padCount","__webpack_module_cache__","leafPrototypes","getProto","__webpack_require__","moduleId","cachedModule","__webpack_modules__","amdO","mode","__esModule","ns","def","current","getOwnPropertyNames","definition","toStringTag","N1","N2","N3","N4","N5","N6","N7","MSB","REST","encodingLength","MAX_SAFE_INTEGER","encodeUint8Array","decodeUint8Array","encodeUint8ArrayList","decodeUint8ArrayList","d8b","MAX_SAFE_NUMBER_INTEGER","BigInt","MIN_SAFE_NUMBER_INTEGER","MIN_SAFE_INTEGER","toBigInt","fromBigInt","negative","TWO_32","readFixed32End","Uint8ArrayReader","int64Number","int64String","uint64Number","uint64String","sint64Number","sint64String","fixed64Number","fixed64String","sfixed64Number","sfixed64String","decodeMessage","codec","opts","createReader","ALPHABET","BASE_MAP","xc","BASE","LEADER","FACTOR","iFACTOR","decodeUnsafe","psz","zeroes","b256","carry","it3","it4","vch","pbegin","pend","b58","it1","it2","Encoder","baseEncode","Decoder","baseDecode","prefixCodePoint","codePointAt","or","ComposedDecoder","decoders","left","Codec","baseX","alphabet","rfc4648","bitsPerChar","pad","out","codes","written","SyntaxError","base10","base16","base16upper","base2","alphabetBytesToChars","reduce","alphabetCharsToBytes","base256emoji","byts","char","byt","base32upper","base32pad","base32padupper","base32hex","base32hexupper","base32hexpad","base32hexpadupper","base32z","base36","base36upper","base58btc","base58flickr","base64pad","base64urlpad","base8","identity","TextDecoder","TextEncoder","textEncoder","textDecoder","MSBALL","INT","MSB$1","REST$1","N8","N9","num","oldOffset","counter","encodeTo","int","sizeOffset","digestOffset","Digest","multihash","Hasher","sha","async","crypto","subtle","link","version","cid","toStringV0","baseCache","toStringV1","WeakMap","Map","CID","asCID","toV0","DAG_PB_CODE","SHA_256_CODE","createV0","toV1","createV1","equals","other","unknown","aa","bb","ii","for","encodeCID","cidSymbol","decodeFirst","specs","inspectBytes","prefixSize","multihashSize","multihashBytes","digestBytes","digestSize","multihashCode","initialBytes","parseCIDtoBytes","codeOffset","hashOffset","bases","createCodec","ascii","latin1","bufferPool","Uint8ArrayWriter","writeVarint32","super","encodeMessage","lengthDelimited","CODEC_TYPES","RateLimitProof","WakuMessage","FilterRequest","MessagePush","FilterRpc","TopicOnlyMessage","FilterSubscribeRequest","PushRequest","PushResponse","WakuMessageKeyValue","PeerInfo","PeerExchangeQuery","PeerExchangeResponse","WakuMetadataRequest","WakuMetadataResponse","enumeration","findValue","VARINT","enumValue","LENGTH_DELIMITED","MaxLengthError","isDefined","groupByContentTopic","groupedDecoders","decs","contentTopic","wait","_codec","proof","merkleRoot","epoch","shareX","shareY","nullifier","rlnIdentifier","tag","payload","timestamp","meta","rateLimitProof","ephemeral","limits","ContentFilter","subscribe","topic","contentFilters","contentFilters$","messages","messages$","requestId","FilterSubscribeType","__FilterSubscribeTypeValues","filterSubscribeType","pubsubTopic","contentTopics","SUBSCRIBER_PING","FilterSubscribeResponse","statusCode","statusDesc","wakuMessage","isSuccess","info","PushRpc","messageHash","StoreQueryRequest","includeData","timeStart","timeEnd","messageHashes","paginationCursor","paginationForward","paginationLimit","StoreQueryResponse","enr","numPeers","peerInfos","peerInfos$","PeerExchangeRPC","query","clusterId","shards","number","isSafeInteger","lengths","outputLen","blockLen","exists","instance","checkFinished","destroyed","finished","arr","rotr","word","nextTick","asyncLoop","iters","tick","ts","now","toBytes","Hash","_cloneInto","toStr","hashCons","hashC","msg","tmp","bytesLength","getRandomValues","Maj","HashMD","padOffset","isLE","take","roundClean","digestInto","output","fill","setBigUint64","_32n","_u32_max","wh","wl","setUint32","oview","outLen","state","to","SHA256_K","SHA256_IV","SHA256_W","SHA256","A","B","C","D","E","F","G","H","getUint32","W15","W2","s0","s1","T1","T2","Protocols","Tags","EPeersByDiscoveryEvents","EConnectionStateEvents","DNS_DISCOVERY_TAG","DEFAULT_CLUSTER_ID","DefaultNetworkConfig","HealthStatus","bytesToUtf8","byteArrays","totalLength","acc","singleShardInfoToPubsubTopic","shardInfo","shard","shardInfoToPubsubTopics","Set","contentTopicToPubsubTopic","application","pubsubTopicToSingleShardInfo","pubsubTopics","pubsubTopicsToShardInfo","shardInfoSet","clusterIds","ensurePubsubTopicIsConfigured","configuredTopics","networkShards","generation","topicName","ensureValidContentTopic","dataview","getBigUint64","contentTopicToShardIndex","determinePubsubTopic","pubsubTopicShardInfo","decodeRelayShard","byteIndex","bitIndex","getUint8","numIndices","encodeRelayShard","setUint8","delay","APP_NAME","Logger","_info","_warn","_error","createDebugNamespace","level","logger","OneMillion","DecodedMessage","proto","_rawTimestamp","metaSetter","toWire","toProtoObj","protoMessage","valueOf","createEncoder","fromWireToProtoObj","fromProtoObj","entry","arrays","findBufAndOffset","bufs","bufEnd","isUint8ArrayList","Uint8ArrayList","appendAll","iterator","append","prepend","prependAll","reverse","consume","trunc","beginInclusive","endExclusive","_subList","sublist","list","bufStart","sliceStartInBuf","sliceEndsInBuf","search","needle","M","rightmostPositions","Int32Array","lastPatIndex","getInt8","setInt8","getInt16","setInt16","getInt32","setInt32","getBigInt64","setBigInt64","getFloat32","setFloat32","getFloat64","setFloat64","fromUint8Arrays","thing","defaultEncoder","lengthLength","lengthBuf","encodeLength","lengthEncoder","maybeYield","single","InvalidMessageLengthError","InvalidDataLengthError","InvalidDataLengthLengthError","UnexpectedEOFError","ReadMode","defaultDecoder","LENGTH","dataLength","lengthDecoder","maxLengthLength","maxDataLength","dataLengthLength","onLength","DATA","onData","pDefer","promise","fromReader","FixedFIFO","top","btm","hwm","isEmpty","FIFO","splitLimit","calculateSize","AbortError","pushable","getNext","onNext","ended","onEnd","drain","bufferNext","objectMode","bufferError","queueMicrotask","throw","readableLength","onEmpty","signal","throwIfAborted","cancel","addEventListener","race","removeEventListener","_pushable","sources","syncSources","all","item","pipe","rest","isDuplex","duplex","isIterable","fns","sink","duplexPipelineFn","rawPipe","stream","sourceWrap","StreamManager","multicodec","getConnections","streamPool","handlePeerUpdateStreamPool","getStream","peer","peerIdStr","streamPromise","createStream","delete","prepareStream","retries","connection","connections","latestConnection","timeline","selectConnection","newStream","backoff","timeoutPromise","detail","protocols","isConnectedTo","peerId","some","BaseProtocol","components","addLibp2pEventListener","removeLibp2pEventListener","streamManager","connectionManager","peerStore","allPeers","peers","getPeersForProtocol","connectedPeers","getPeers","maxBootstrapPeers","filteredPeers","bootstrapPeers","tags","BOOTSTRAP","nonBootstrapPeers","selectedPeers","randomIndex","random","randomPeer","filterPeersByDiscovery","peerPromises","remotePeer","protocol","encodedPeerShardInfo","metadata","peerShardInfo","getConnectedPeersForProtocolAndShard","sortedFilteredPeers","pingBytes","ping","sortPeersByLatency","randomUUID","rnds8","rng","byteToHex","rnds","unsafeStringify","FilterPushRpc","FilterSubscribeRpc","createSubscribeRequest","SUBSCRIBE","createUnsubscribeRequest","UNSUBSCRIBE","createUnsubscribeAllRequest","UNSUBSCRIBE_ALL","createSubscriberPingRequest","FilterCodecs","FilterCore","handleIncomingMessage","libp2p","handle","onRequest","maxInboundStreams","success","failure","GENERIC_FAIL","REMOTE_PEER_REJECTED","unsubscribe","NO_STREAM_AVAILABLE","unsubscribeRequest","unsubscribeAll","NO_RESPONSE","streamData","createRequest","LightPushCore","preparePushMessage","EMPTY_PAYLOAD","isWireSizeUnderCap","isMessageSizeUnderCap","SIZE_TOO_BIG","ENCODE_FAILED","preparationError","DECODE_FAILED","rlnErrorCase","rlnErrorMap","RLN_IDENTITY_MISSING","RLN_MEMBERSHIP_INDEX","RLN_LIMIT_MISSING","infoLowerCase","errorKey","RLN_PROOF_GENERATION","matchRLNErrorMessage","EmptyMessage","ONE_MILLION","getTime","StoreCore","queryPerPage","queryOpts","currentCursor","storeQueryRequest","storeQueryResponse","errorMessage","decodedMessages","protoMsg","wire","TimeoutError","getDOMException","DOMException","getAbortedReason","reason","pTimeout","milliseconds","fallback","customTimers","clearTimeout","timer","cancelablePromise","aborted","POSITIVE_INFINITY","timeoutError","finally","normalizeEmitter","pEvent","arrayPromise","returnValue","rejectionEvents","multiArgs","resolveImmediately","flat","items","onItem","arguments_","rejectHandler","rejectionEvent","timeout","pEventMultiple","waitForRemotePeer","waku","timeoutMs","relay","Relay","Filter","store","Store","lightPush","LightPush","getEnabledProtocols","isStarted","promises","getMeshPeers","gossipSub","waitForGossipSubPeerInMesh","waitForConnectedPeer","services","rejectReason","awaitTimeout","rejectOnTimeout","metadataService","any","confirmOrAttemptHandshake","_resolve","TypedEventEmitter","EventTarget","dispatchEvent","safeDispatchEvent","CustomEvent","KeepAliveManager","pingKeepAliveTimers","relayKeepAliveTimers","pingKeepAlive","pingPeriodSecs","relayKeepAlive","relayPeriodSecs","interval","setInterval","intervals","scheduleRelayPings","clearInterval","stopAll","connectionsExist","ConnectionManager","configuredPubsubTopics","static","keepAliveManager","dialAttemptsForPeer","dialErrorsForPeer","currentActiveParallelDialCount","pendingPeerDialQueue","isP2PNetworkConnected","isConnected","onLine","keepAliveOptions","instances","onEventHandlers","stopNetworkStatusListener","dropConnection","hangUp","getPeersByDiscovery","peersDiscovered","peersConnected","conn","peersDiscoveredByBootstrap","peersDiscoveredByPeerExchange","peersDiscoveredByLocal","peersConnectedByBootstrap","peersConnectedByPeerExchange","peersConnectedByLocal","getTagNamesForPeer","PEER_EXCHANGE","LOCAL","DISCOVERED","CONNECTED","maxDialAttemptsForPeer","maxBootstrapPeersAllowed","maxParallelDials","startEventListeners","dialPeerStorePeers","dialPromises","peerInfo","attemptDial","startPeerDiscoveryListener","startPeerConnectionListener","startPeerDisconnectionListener","startNetworkStatusListener","dialPeer","dialAttempt","dial","AggregateError","errors","processDialQueue","attemptDnsDiscovery","dnsDiscovery","findPeers","shouldDialPeer","dispatchDiscoveryEvent","PEER_CONNECT_BOOTSTRAP","PEER_CONNECT_PEER_EXCHANGE","setP2PNetworkConnected","setP2PNetworkDisconnected","dispatchWakuConnectionEvent","isPeerTopicConfigured","getPeerShardInfo","isPeerDialableBasedOnBootstrapStatus","tagName","isBootstrap","PEER_DISCOVERY_BOOTSTRAP","PEER_DISCOVERY_PEER_EXCHANGE","shardInfoBytes","CONNECTION_STATUS","HealthManager","health","overallStatus","Unhealthy","protocolStatuses","getInstance","getHealthStatus","getProtocolStatus","updateProtocolHealth","getNameFromMulticodec","MinimallyHealthy","SufficientlyHealthy","lastUpdate","updateOverallHealth","statuses","getHealthManager","MetadataCodec","Metadata","libp2pComponents","handshakesConfirmed","registrar","NO_PEER_AVAILABLE","encodedResponse","decodeMetadataResponse","savePeerShardInfo","encodedShardInfo","wakuMetadata","peerIdSymbol","isPeerId","AggregateCodeError","ERR_TIMEOUT","MAX_IPV6_LENGTH","MAX_IPV4_LENGTH","parser","readAtomically","parseWith","peekChar","readChar","readGivenChar","readSeparator","sep","inner","readNumber","radix","maxDigits","allowZeroPrefix","maxBytes","digitCount","leadingChar","hasLeadingZero","maxValue","digit","readIPv4Addr","ix","readIPv6Addr","readGroups","groups","ipv4","headSize","headIp4","limit","tailSize","readIPAddr","isIPv4","new","isIPv6","isIP","isV4","isV6","sections","v4Buffer","argv","V","convertToString","ipBuff","ipString","bytes2ip","bytes2str","bytes2port","address","bytes2mh","addrBytes","portBytes","bytes2onion","bytes2mb","convertToBytes","ip2bytes","str2bytes","port2bytes","mh","mh2bytes","addr","port","portBuf","onion2bytes","onion32bytes","mbstr","mb","anybaseDecoder","mb2bytes","row","resolvable","createProtocol","bytesToMultiaddrParts","tuples","stringTuples","sizeForAddr","stringAddr","stringTuplesToString","tup","cleanPath","tuplesToBytes","inspect","DNS_CODES","Multiaddr","stringToMultiaddrParts","isMultiaddr","toOptions","family","transport","host","zone","tcp","udp","ip4","ip6","dns6","ip6zone","protos","protoCodes","protoNames","encapsulate","decapsulate","addrString","decapsulateCode","getPeerId","p2p","tuple","pop","getPath","resolvableProto","resolver","resolvers","nodeAddress","isThinWaistAddress","pubsubTopicBytes","contentTopicBytes","timestampBytes","bigIntTimestamp","numberToBytes","tryConvertTimestampToBytes","BaseProtocolSDK","core","healthManager","numPeersToUse","maintainPeersIntervalId","maintainPeersLock","renewPeersLocker","RenewPeerLocker","maintainPeersInterval","startMaintainPeersInterval","renewPeer","peerToDisconnect","findAndAddPeers","updatedPeers","updatePeers","lock","stopMaintainPeersInterval","hasPeers","autoRetry","forceUseAllPeers","initialDelay","maxAttempts","maxDelay","attempts","maintainPeers","delayMs","numPeersToAdd","cleanUnlocked","additionalPeers","findAdditionalPeers","dials","newPeers","isLocked","lockDuration","time","isTimeUnlocked","entries","SubscriptionManager","subscriptionCallbacks","receivedMessagesHashStr","peerFailures","receivedMessagesHashes","missedMessagesByPeer","keepAliveInterval","maxPingFailures","maxMissedMessagesThreshold","keepAliveTimer","allPeerIdStr","nodes","fromEntries","addHash","keepAlive","pingsBeforePeerRenewed","decodersArray","failures","TOPIC_DECODER_MISMATCH","successes","decodersGroupedByCT","results","allSettled","finalResult","handleResult","subscriptionCallback","startSubscriptionsMaintenance","stopSubscriptionsMaintenance","pingSpecificPeer","validateMessage","hashes","incrementMissedMessageCount","shouldRenewPeer","renewAndSubscribePeer","processIncomingMessage","hashedMessageStr","messageHashStr","decodePromises","dec","decoded","decodedMessage","pushMessage","promiseResult","coreResult","handlePeerFailure","newPeer","startKeepAlivePings","startConnectionListener","stopKeepAlivePings","stopConnectionListener","connectionListener","renewPeerPromises","currentCount","FilterSDK","_connectionManager","activeSubscriptions","subscription","getActiveSubscription","protocolUseOptions","subscribeOptions","uniquePubsubTopics","getUniquePubsubTopics","INVALID_DECODER_TOPICS","createSubscription","setActiveSubscription","subscribeWithUnsubscribe","toSubscriptionIterator","receiver","iteratorOptions","isWithTimeout","startTime","toAsyncIterator","LightPushSDK","_options","TOPIC_NOT_CONFIGURED","sendPromises","StoreSDK","queryGenerator","decodersAsMap","validateDecodersAndPubsubTopic","responseGenerator","queryWithOrderedCallback","processMessages","queryWithPromiseCallback","abort","page","_promises","msgPromise","processedMessages","createCursor","uniquePubsubTopicsInQuery","pubsubTopicForQuery","DefaultUserAgent","DefaultPingMaxInboundStreams","WakuNode","protocolsEnabled","lightpush","wakuLightPush","wakuFilter","_protocols","mapToPeerIdOrMultiaddr","codecs","multicodecs","dialProtocol","getLocalMultiaddrWithID","localMultiaddr","getMultiaddrs","isPromise","U32_MASK64","fromBig","u64","lst","Ah","Al","toBig","shrSH","_l","shrSL","rotrSH","rotrSL","rotrBH","rotrBL","rotr32H","_h","rotr32L","rotlSH","rotlSL","rotlBH","rotlBL","Bh","Bl","add3L","Cl","add3H","Ch","add4L","Dl","add4H","Dh","add5H","Eh","add5L","El","SHA512_Kh","SHA512_Kl","SHA512_W_H","SHA512_W_L","SHA512","Fh","Fl","Gh","Gl","Hh","Hl","W15h","W15l","s0h","s0l","W2h","W2l","s1h","s1l","SUMl","SUMh","sigma1h","sigma1l","CHIh","CHIl","T1ll","T1h","T1l","sigma0h","sigma0l","MAJh","MAJl","All","_0n","_1n","_2n","abool","title","padStart","hexToNumber","_0","_9","_A","_F","_a","_f","hl","al","ai","n1","n2","expectedLength","sum","isPosBig","bitMask","u8n","u8fr","createHmacDrbg","hashLen","qByteLen","hmacFn","reseed","sl","pred","validatorFns","bigint","function","boolean","stringOrUint8Array","Fp","isValid","validateObject","validators","optValidators","checkField","isOptional","checkVal","memoized","arg","computed","_3n","_4n","_5n","_8n","power","modulo","pow2","invert","y","u","FIELD_FIELDS","nLength","nBitLength","_nBitLength","nByteLength","ORDER","bitLen","redef","BYTES","sqrtP","P","p1div4","eql","sqr","mul","nv","sub","ONE","legendreC","Q","S","Z","Q1div2","neg","g","ZERO","t2","ge","tonelliShanks","FpSqrt","MASK","is0","isOdd","lhs","rhs","FpPow","div","sqrN","addN","subN","mulN","inv","sqrt","invertBatch","nums","lastMultiplied","inverted","reduceRight","FpInvertBatch","cmov","fromBytes","getFieldBytesLength","fieldOrder","bitLength","getMinHashLength","pointPrecomputes","pointWindowSizes","wNAF","constTimeNegate","condition","negate","validateW","W","windows","windowSize","unsafeLadder","elm","precomputeWindow","points","precomputes","maxNumber","shiftBy","wbits","offset1","offset2","cond1","cond2","wNAFCached","transform","comp","setWindowSize","validateBasic","curve","validateField","Gx","Gy","VERIFY_DEFAULT","zip215","ED25519_P","ED25519_SQRT_M1","ed25519_pow_2_252_3","_10n","_20n","_40n","_80n","b80","b160","b240","b250","pow_p_5_8","adjustScalarBytes","uvRatio","vx2","root1","root2","useRoot1","useRoot2","noRoot","ed25519Defaults","randomBytes","ed25519","curveDef","CURVE","domain","mapToCurve","validateOpts","prehash","cHash","cofactor","modP","phflag","aCoordinate","assertPoint","Point","toAffineMemo","iz","ex","ey","ez","z","ax","ay","zz","assertValidMemo","X","Y","et","T","X2","Y2","Z2","Z4","aX2","toAffine","fromAffine","normalizeZ","toInv","_setWindowSize","wnaf","assertValidity","X1","Y1","Z1","X1Z2","X2Z1","Y1Z2","Y2Z1","x1y1","X3","Y3","T3","Z3","subtract","multiply","scalar","CURVE_ORDER","multiplyUnsafe","I","isSmallOrder","isTorsionFree","clearCofactor","fromHex","normed","lastByte","y2","isXOdd","isLastByteOdd","fromPrivateKey","privKey","getExtendedPublicKey","point","toRawBytes","toHex","modN","modN_LE","hashed","pointBytes","hashDomainToScalar","msgs","verifyOpts","getPublicKey","R","sig","publicKey","SB","ExtendedPoint","utils","randomPrivateKey","precompute","x25519","montgomeryBits","powPminus2","Gu","montgomeryBytes","fieldLen","cswap","swap","x_2","x_3","a24","encodeUCoordinate","scalarMult","pointU","uEnc","decodeUCoordinate","_scalar","decodeScalar","pu","x_1","sw","z_2","z_3","k_t","AA","BB","DA","CB","dacb","da_cb","z2","montgomeryLadder","GuBytes","scalarMultBase","getSharedSecret","privateKey","montgomery","PUBLIC_KEY_BYTE_LENGTH","PRIVATE_KEY_BYTE_LENGTH","KEYS_BYTE_LENGTH","concatKeys","privateKeyRaw","win","nativeCrypto","derivedEmptyPasswordKey","alg","ext","key_ops","kty","exporter","password","cipher","keyLength","iterations","encrypt","salt","nonce","aesGcm","iv","cryptoKey","importKey","deriveParams","runtimeDerivedEmptyPassword","deriveKey","rawKey","ciphertext","decrypt","saltLength","plaintext","encryptedKey","KeyType","__KeyTypeValues","PublicKey","PrivateKey","Data","Ed25519PublicKey","_key","ensureKey","marshal","Ed25519","Ed25519PrivateKey","_publicKey","public","unmarshalEd25519PrivateKey","privateKeyBytes","publicKeyBytes","unmarshalEd25519PublicKey","generateKeyPairFromSeed","pair","derivePublicFromPrivate","exportKey","jwKey","keySize","jwk","HMAC","iHash","oHash","hmac","utilFromBase","inputBuffer","inputBase","utilToBase","internalReserved","internalValue","biggest","retBuf","retView","basis","utilConcatView","views","outputLength","prevLength","utilDecodeTC","valueHex","condition1","condition2","warnings","bigIntBuffer","bigIntView","bigInt","smallIntBuffer","smallIntView","padNumber","inputNumber","fullLength","dif","assertBigInt","baseBlock","inputOffset","inputLength","ViewWriter","final","powers2","digitsString","EMPTY_STRING","EMPTY_BUFFER","EMPTY_VIEW","END_OF_CONTENT_NAME","OCTET_STRING_NAME","BIT_STRING_NAME","HexBlock","BaseClass","isHexOnly","valueHexView","fromBER","endLength","blockLength","toBER","sizeOnly","NAME","LocalBaseBlock","valueBeforeDecode","valueBeforeDecodeView","blockName","ValueBlock","LocalIdentificationBlock","idBlock","_b","_c","_d","tagClass","tagNumber","isConstructed","firstOctet","encodedBuf","encodedView","curView","inputView","intBuffer","tagNumberMask","intTagNumberBuffer","tagNumberBufferMaxLength","tempBufferView","LocalLengthBlock","lenBlock","isIndefiniteForm","longFormUsed","lenOffset","lengthBufferView","typeStore","BaseBlock","primitiveSchema","parameters","valueBlockType","valueBlock","resultOffset","_writer","prepareIndefiniteForm","idBlockBuf","valueBlockBuf","lenBlockBuf","onAsciiEncoding","inputBuffer1","inputBuffer2","view1","view2","Constructed","BaseStringBlock","stringValueBlockType","getValue","setValue","fromBuffer","LocalPrimitiveValueBlock","_a$w","_a$v","_a$u","_a$t","_a$s","_a$r","_a$q","_a$p","_a$o","_a$n","_a$m","_a$l","_a$k","_a$j","_a$i","_a$h","_a$g","_a$f","_a$e","_a$d","_a$c","_a$b","_a$a","_a$9","_a$8","_a$7","_a$6","_a$5","_a$4","_a$3","_a$2","_a$1","Primitive","localFromBER","incomingOffset","returnObject","newASN1Type","EndOfContent","Integer","BitString","OctetString","Null","ObjectIdentifier","Enumerated","Utf8String","RelativeObjectIdentifier","TIME","Sequence","NumericString","PrintableString","TeletexString","VideotexString","IA5String","UTCTime","GeneralizedTime","GraphicString","VisibleString","GeneralString","UniversalString","CharacterString","BmpString","DATE","TimeOfDay","DateTime","newObject","inputObject","newType","localChangeType","LocalConstructedValueBlock","currentOffset","LocalEndOfContentValueBlock","override","LocalBooleanValueBlock","octet","LocalOctetStringValueBlock","currentBlockName","asn","content","LocalBitStringValueBlock","unusedBits","bitsStr","viewAdd","second","firstView","secondView","firstViewCopy","firstViewCopyLength","secondViewCopy","secondViewCopyLength","power2","digits","viewSub","LocalIntegerValueBlock","_valueDec","setValueHex","valueDec","modValue","tempBuf","tempView","fromDER","toDER","updatedView","firstBit","currentByte","bitNumber","asn1View","flag","byteNumber","bigIntValue","secondInt","convertToDER","integer","convertFromDER","LocalSidValueBlock","isFirstSid","valueBigInt","sidValue","LocalObjectIdentifierValueBlock","sidBlock","retBuffers","valueBuf","pos1","pos2","sid","plus","parsedSID","sidStr","sidArray","LocalRelativeSidValueBlock","LocalRelativeObjectIdentifierValueBlock","LocalStringValueBlock","LocalSimpleStringValueBlock","LocalSimpleStringBlock","inputString","strLen","LocalUtf8StringValueBlock","LocalBmpStringValueBlock","LocalUniversalStringValueBlock","copyBuffer","valueView","strLength","codeBuf","codeView","valueDate","year","month","day","hour","minute","fromDate","toBuffer","inputDate","getUTCFullYear","getUTCMonth","getUTCDate","getUTCHours","getUTCMinutes","getUTCSeconds","toDate","UTC","parserArray","outputArray","toISOString","millisecond","getUTCMilliseconds","isUTC","timeString","dateTimeString","fractionPart","hourDifference","minuteDifference","multiplier","differencePosition","differenceString","fractionPointPosition","fractionPartCheck","fractionResult","tempDate","getUTCDay","bnToBuf","bn","u8","bufToBn","exportToPem","keyBuf","keyArr","encryptionKey","dkLen","asyncTick","DK","PRF","PRFSalt","_password","_salt","_opts","checkOpts","pbkdf2Init","prfW","ti","Ti","pbkdf2Output","encrypted","pbkdf2Params","encryptionAlgorithm","finalWrapperBuf","MAX_RSA_KEY_SIZE","RsaPublicKey","der","RSA","RsaPrivateKey","genSecret","dp","dq","qi","unmarshalRsaPublicKey","fromJwk","generateKey","modulusLength","publicExponent","validateSigVerOpts","lowS","b2n","h2b","DER","Err","_parseInt","toSig","sBytes","rBytesLeft","hexFromSig","shl","rhl","rl","weierstrass","bits2int","bits2int_modN","compressedLen","uncompressedLen","invN","ProjectivePoint","normPrivateKeyToScalar","weierstrassEquation","isWithinCurveOrder","allowedPrivateKeyLengths","wrapPrivateKey","allowInfinityPoint","endo","beta","splitScalar","validatePointOpts","_isCompressed","x2","x3","N","assertPrjPoint","px","py","pz","hasEvenY","U1","U2","t0","t1","t3","t4","t5","sc","k1neg","k2neg","k1p","k2p","fake","f1p","f2p","multiplyAndAddUnsafe","isCompressed","_bits","weierstrassPoints","cat","sqrtError","suffix","numToNByteStr","isBiggerThanHalfOrder","slcNum","Signature","recovery","fromCompact","addRecoveryBit","recoverPublicKey","msgHash","rec","radj","ir","u1","u2","hasHighS","normalizeS","toDERRawBytes","toDERHex","toCompactRawBytes","toCompactHex","isValidPrivateKey","minLen","reduced","isProbPub","delta","ORDER_MASK","int2octets","defaultSigOpts","defaultVerOpts","privateA","publicB","k2sig","extraEntropy","ent","h1int","seedArgs","kBytes","ik","normS","prepSig","drbg","signature","sg","_sig","derError","is","getHash","secp256k1P","secp256k1N","divNearest","_6n","_11n","_22n","_23n","_44n","_88n","b88","b176","b220","b223","secp256k1","defHash","createCurve","POW_2_128","validatePublicKey","Secp256k1PublicKey","Secp256k1","Secp256k1PrivateKey","unmarshalSecp256k1PrivateKey","unmarshalSecp256k1PublicKey","supportedKeys","rsa","unsupportedKey","supported","typeToKey","marshalPublicKey","unmarshalRsaPrivateKey","serviceCapabilities","serviceDependencies","baseDecoder","LIBP2P_KEY_CODE","MARSHALLED_ED225519_PUBLIC_KEY_LENGTH","MARSHALLED_SECP256K1_PUBLIC_KEY_LENGTH","PeerIdImpl","toCID","peerIdFromString","RSAPeerIdImpl","Ed25519PeerIdImpl","Secp256k1PeerIdImpl","TRANSPORT_IPFS_GATEWAY_HTTP_CODE","URLPeerIdImpl","url","peerIdFromBytes","URL","peerIdFromCID","peerIdFromKeys","raceSignal","errorCode","errorName","QueuelessPushable","readNext","haveNext","nextResult","byteStream","readBuffer","abortPromise","unwrap","originalStream","yieldBytes","lpStream","decodeLength","lengthBuffer","writeV","flatMap","piped","NOISE_MSG_MAX_LENGTH_BYTES","DUMP_SESSION_KEYS","copyBytes","wrapCipher","clean","_utf8ToBytes","sigma16","sigma32","sigma16_32","sigma32_32","MAX_COUNTER","U32_EMPTY","createCipher","allowShortKeys","extendNonceFn","counterLength","counterRight","rounds","toClean","sigma","k32","nonceNcLen","nc","n32","isAligned","d32","o32","pos32","posj","runCipher","u8to16","Poly1305","Uint16Array","t6","t7","isLast","hibit","r0","r1","r2","r3","r4","r5","r6","r7","r8","r9","h0","h5","h6","h7","h8","h9","d0","d1","d2","d3","d4","d5","d6","d7","d8","d9","opos","poly1305","wrapConstructorWithKey","chachaCore","cnt","y00","y01","y02","y03","y04","y05","y06","y07","y08","y09","y10","y11","y12","y13","y14","y15","x00","x01","x02","x03","x04","x05","x06","x07","x08","x09","x10","x11","x12","x13","x14","x15","oi","chacha20","xchacha20","ZEROS16","updatePadded","ZEROS32","computeTag","AAD","authKey","_poly1305_aead","xorStream","plength","clength","passedTag","chacha20poly1305","blockSize","nonceLength","tagLength","HKDF_COUNTER","defaultCrypto","hashSHA256","getHKDF","ck","ikm","prk","extract","okm","HMACTmp","expand","generateX25519KeyPair","secretKey","generateX25519KeyPairFromSeed","generateX25519SharedKey","chaCha20Poly1305Encrypt","ad","chaCha20Poly1305Decrypt","uint16BEEncode","uint16BEDecode","logLocalStaticKeys","keyLogger","logLocalEphemeralKeys","logRemoteEphemeralKey","logCipherState","cs1","cs2","getUint64","Nonce","increment","getBytes","assertValue","ZEROLEN","CipherState","hasKey","encryptWithAd","decryptWithAd","SymmetricState","cs","protocolName","protocolNameBytes","hashProtocolName","mixKey","tempK","hkdf","mixHash","encryptAndHash","decryptAndHash","tempK1","tempK2","AbstractHandshakeState","ss","rs","initiator","prologue","writeE","generateKeypair","writeS","writeEE","dh","writeES","writeSE","readE","readS","cipherLength","temp","readEE","readES","readSE","XXHandshakeState","writeMessageA","writeMessageB","encS","writeMessageC","readMessageA","readMessageB","consumed","readMessageC","NoiseExtensions","NoiseHandshakePayload","createHandshakePayload","staticPublicKey","identitySig","getSignaturePayload","identityKey","decodeHandshakePayload","payloadBytes","remoteStaticKey","remoteIdentityKey","remoteIdentityKeyBytes","signaturePayload","webtransportCerthashes","Noise","staticKey","metrics","staticNoiseKey","prologueBytes","_crypto","keypair","wrapCrypto","xxHandshakeSuccesses","registerCounter","help","xxHandshakeErrors","encryptedPackets","decryptedPackets","decryptErrors","registerMetrics","secureOutbound","localPeer","parseArgs","wrappedConnection","handshake","performHandshakeInitiator","createSecureConnection","remoteExtensions","secureInbound","performHandshakeResponder","xx","trace","receivedPayload","forComponent","secure","user","duplexPair","network","encryptStream","decryptStream","noise","peerDiscoverySymbol","DNS4","DNS6","DNSADDR","DNS","IP","TCP","and","UDP","UTP","QUIC","QUICV1","_WebSockets","WebSockets","_WebSocketsSecure","WebSocketsSecure","HTTP","HTTPS","_WebRTCDirect","WebRTCDirect","_WebTransport","WebTransport","P2PWebRTCStar","P2PWebRTCDirect","Reliable","_P2P","_Circuit","CircuitRecursive","Circuit","P2P","makeMatchesFunction","partialMatch","ma","matches","pnames","Bootstrap","_init","candidate","peerData","multiaddrs","_discoverBootstrapPeers","tagValue","ttl","tagTTL","ENVELOPE_PAYLOAD_TYPE_PEER_RECORD","PeerRecord","AddressInfo","multiaddr","seq","addresses","peerRecord","seqNumber","DOMAIN","CODEC","marshaled","localeCompare","every","arrayEquals","Envelope","payloadType","RecordEnvelope","envelopeData","record","signData","formatSignaturePayload","envelope","createFromProtobuf","validate","domainUint8Array","domainLength","payloadTypeLength","payloadLength","func","vals","pattern","literal","certhash","matcher","matchers","fmt","toParts","exactMatch","_DNS4","_DNS6","_DNSADDR","_DNS","_IP4","_IP6","_IP","_IP_OR_DOMAIN","IP_OR_DOMAIN","_TCP","_UDP","_QUIC","_QUICV1","QUIC_V0_OR_V1","_WEB","pbStream","lp","pb","Identify","protocolVersion","agentVersion","listenAddrs","observedAddr","signedPeerRecord","isEnvWithDom","nodeType","isElectron","isBrowser","isElectronMain","isElectronRenderer","release","isWebWorker","importScripts","WorkerGlobalScope","isReactNative","product","defaultValues","AbstractIdentify","started","addressManager","maxOutboundStreams","maxMessageSize","maxObservedAddresses","runOnTransientConnection","nodeInfo","protocolPrefix","AgentVersion","ProtocolVersion","handleProtocol","unhandle","runOnConnectionOpen","identify","_identify","AbortSignal","close","cleanObservedAddr","getCleanMultiaddr","getObservedAddrs","addObservedAddr","isCertified","peerRecordEnvelope","openAndCertify","existingPeer","storedEnvelope","storedRecord","patch","consumeIdentifyMessage","getAddresses","seal","remoteAddr","closeSource","getIterator","createAbortError","clearMethods","defaultClear","defaultSet","timeoutId","settle","rejectFunction","signalListener","delayPromise","createDelay","RateLimiter","memoryStorage","duration","blockDuration","execEvenly","execEvenlyMinDelayMs","keyPrefix","MemoryStorage","pointsToConsume","rlKey","getKey","secDuration","_getKeySecDuration","incrby","remainingPoints","consumedPoints","msBeforeNext","isFirstInDuration","penalty","reward","msDuration","initPoints","customDuration","parseKey","durationSec","existing","msBeforeExpires","expiresAt","durationMs","unref","MessageTypes","MessageTypeNames","InitiatorMessageTypes","NEW_STREAM","MESSAGE","MESSAGE_INITIATOR","CLOSE","CLOSE_INITIATOR","RESET","RESET_INITIATOR","ReceiverMessageTypes","MESSAGE_RECEIVER","CLOSE_RECEIVER","RESET_RECEIVER","MAX_MSG_SIZE","_buffer","_headerInfo","_maxMessageSize","_maxUnprocessedMessageQueueSize","maxUnprocessedMessageQueueSize","_decodeHeader","readVarInt","POOL_SIZE","_pool","_poolOffset","header","AbstractStream","direction","readStatus","writeStatus","sinkController","sinkEnd","closed","endErr","streamSource","onCloseRead","onCloseWrite","onReset","onAbort","sendCloseWriteTimeout","sendingData","AbortController","onSourceEnd","sendNewStream","abortListener","sendData","sendCloseWrite","onSinkEnd","closeRead","closeWrite","sendCloseRead","sendReset","_closeSinkAndSource","_closeSink","_closeSource","remoteCloseWrite","remoteCloseRead","sourcePush","sourceReadableLength","MplexStream","streamId","maxDataSize","toSend","printMessage","MplexStreamMuxer","_streamId","_streams","_source","closeController","rateLimiter","closeTimeout","initiators","receivers","_createSink","disconnectThreshold","streams","registry","_newStream","_newReceiverStream","maxMsgSize","onStreamEnd","_handleIncoming","onIncomingStream","maxBufferSize","maxStreamBufferSize","Mplex","createStreamMuxer","mplex","ERR_WRONG_PING_ACK","PingService","handleMessage","received","openConnection","transportSymbol","FaultTolerance","ASSUME_HTTP_CODES","extractSNI","sniProtoCode","hasTLS","interpretNext","headProtoCode","headProtoVal","restMa","interpreter","interpreters","restVal","tailProto","dnsaddr","dns4","dns","ipfs","http","maHasTLS","sni","baseVal","tls","https","ws","wss","socket","cleanup","handleOpen","handleErr","closeOnEnd","ready","CLOSING","CLOSED","wasClean","connect","location","wsUrl","httpProto","wsProto","connectedSource","binaryType","connected","connError","cleanUp","cont","onOpen","onError","onMessage","remoteAddress","remotePort","hostname","CONNECTING","OPEN","terminate","websocket","CustomProgressEvent","Event","testMa","dialerEvents","registerCounterGroup","label","maConn","metricPrefix","socketToMaConn","_connect","upgrader","upgradeOutbound","cOpts","errorPromise","rawSocket","uri","onProgress","createListener","listenFilter","dialFilter","webSockets","contentRoutingSymbol","peerRoutingSymbol","fmtLong","isError","setupFormatters","defaultLogger","createDisabledLogger","mapIterable","iter","PeerSet","predicate","intersection","difference","union","createEd25519PeerId","generateKeyPair","createFromPrivKey","createFromJSON","pubKey","createFromPubKey","createFromParts","PeerMap","PriorityQueue","enqueue","run","element","priority","comparator","step","it","lowerBound","dequeue","PQueue","carryoverConcurrencyCount","intervalCap","concurrency","autoStart","queueClass","throwOnTimeout","canInitializeInterval","job","newConcurrency","function_","operation","addAll","functions","pause","onSizeLessThan","onIdle","sizeBy","observable","worker","WORKER_REQUEST_READ_LOCK","WORKER_RELEASE_READ_LOCK","MASTER_GRANT_READ_LOCK","WORKER_REQUEST_WRITE_LOCK","WORKER_RELEASE_WRITE_LOCK","MASTER_GRANT_WRITE_LOCK","handleWorkerLockRequest","masterEvent","releaseType","grantType","requestEvent","identifier","MessageEvent","handler","postMessage","releaseEventListener","releaseEvent","makeWorkerLockRequest","responseEvent","defaultOptions","singleProcess","mutexes","implementation","createReleaseable","ERR_INVALID_PARAMETERS","Peer","Address","Tag","bytesToPeer","peerIdFromPeerId","expiry","Peer$metadataEntry","Peer$tagsEntry","pathSepS","pathSepB","pathSep","Key","_buf","uint8Array","withNamespaces","asKey","less","list1","list2","baseNamespace","namespaceType","namespaceValue","child","isAncestorOf","isDecendantOf","isTopLevel","NAMESPACE_COMMON","peerIdToDatastoreKey","b32key","dedupeFilterAndSortAddresses","addressMap","maStr","existingAddr","toPeerPB","strategy","createSortedMap","validateMetadata","validateTag","mapTag","metadataEntries","tagsEntries","mergedTags","addressFilter","decodePeer","cached","PersistentStore","datastore","isWorker","readLock","writeLock","masterQueue","readQueue","localReadQueue","readPromise","createMutex","existingBuf","peerPb","peerCache","filters","orders","mapQuery","previous","updated","put","PersistentPeerStore","consumePeerRecord","expectedPeer","peekable","iterable","sorter","BaseDatastore","putMany","getMany","deleteMany","batch","puts","dels","commit","_all","_allKeys","queryKeys","MemoryDatastore","defaultAddressFilter","addrs","stripPeerId","observedPeerIdStr","DefaultAddressManager","announce","observed","announceFilter","_updatePeerStoreAddresses","debounce","getAnnounceAddrs","transportManager","getAddrs","confident","getListenAddrs","confirmObservedAddr","startingConfidence","removeObservedAddr","addrSet","DefaultComponents","_started","_invokeStartableMethod","isStartable","startable","beforeStart","afterStart","beforeStop","afterStop","OPTIONAL_SERVICES","NON_SERVICE_PROPERTIES","getServiceCapabilities","getServiceDependencies","getServiceName","NETMASK_RANGES","ipRange","ipv4Check","ipAddr","isPrivateIp","octet34","octet12","ipv4MappedIpv6Check","ipv4EmbeddedIpv6Check","ipv6Check","connectionGater","gater","denyDialPeer","denyDialMultiaddr","denyInboundConnection","denyOutboundConnection","denyInboundEncryptedConnection","denyOutboundEncryptedConnection","denyInboundUpgradedConnection","denyOutboundUpgradedConnection","filterMultiaddrForPeer","isPrivate","defaultAddressSort","publicResult","isAPrivate","isBPrivate","publicAddressesFirst","relayResult","isACircuit","isBCircuit","circuitRelayAddressesLast","certifiedResult","certifiedAddressesFirst","getTypes","DEFAULT_TYPES","RecordType","DEFAULT_TTL","toDNSResponse","Status","TC","flag_tc","RD","flag_rd","RA","flag_ra","AD","flag_ad","CD","flag_cd","Question","questions","question","Answer","answers","answer","TTL","dnsJsonOverHttps","httpQueue","queryConcurrency","fqdn","searchParams","URLSearchParams","headers","accept","statusText","CachedAnswers","lru","maxSize","hashlru","foundAllAnswers","getAnswers","cachedAnswers","expires","cacheSize","tld","dnsaddrCode","dnsaddrResolver","recursionLimit","maxRecursiveDepth","TXT","DefaultConfig","noAnnounce","addressSorter","faultTolerance","FATAL_ALL","getPeerAddress","ERR_INVALID_MULTIADDR","maPeerIdStr","maPeerId","raceEvent","eventName","removeListeners","eventListener","errorEvent","errorEventListener","JobRecipient","Job","recipients","controller","created","recipient","Queue","metricName","registerMetricGroup","calculate","running","tryToStartAnother","toGenerator","onQueueJobComplete","onQueueError","onQueueIdle","onSignalAbort","PeerQueue","AUTO_DIAL_PEER_RETRY_THRESHOLD","LAST_DIAL_FAILURE_KEY","AutoDial","minConnections","autoDialPriority","autoDialIntervalMs","autoDialMaxQueueLength","autoDialPeerRetryThresholdMs","autoDialDiscoveredPeersDebounce","autoDialInterval","maxQueueLength","autoDialPeerRetryThreshold","autoDialConcurrency","autoDial","getConnectionsMap","numConnections","sheduleNextAutodial","dialQueue","getDialQueue","shuffledPeers","peerValues","peersThatHaveNotFailed","peerAValue","peerBValue","lastDialFailure","lastDialFailureTimestamp","DEFAULT_CLOSABLE_PROTOCOLS","maxConnections","allow","ConnectionPruner","maybePruneConnections","sortedConnections","sortConnections","toPrune","toClose","streamProtocols","closableProtocols","safelyCloseConnectionIfUnused","connectionALifespan","connectionBLifespan","anySignal","signals","maxDialQueueLength","maxPeerAddrsToDial","dialTimeout","DialQueue","shutDownController","peerIdOrMultiaddr","existingConnection","force","existingDial","createDialAbortController","addrsToDial","calculateMultiaddrs","dialed","ERR_TOO_MANY_ADDRESSES","ERR_TRANSPORT_DIAL_FAILED","DEFAULT_DIAL_PRIORITY","userSignal","ERR_DIALED_SELF","ERR_PEER_DIAL_INTERCEPTED","ERR_NOT_FOUND","peerRouting","findPeer","ERR_NO_ROUTERS_AVAILABLE","resolvedAddresses","resolveMultiaddrs","peerIdMultiaddr","lastProto","filteredAddrs","dialTransportForMultiaddr","addrPeerId","dedupedAddrs","dedupedMultiaddrs","ERR_NO_VALID_ADDRESSES","gatedAdrs","sortedGatedAddrs","isDialable","DefaultConnectionManager","deny","maxIncomingPendingConnections","incomingPendingConnections","connectionPruner","inboundConnectionRateLimiter","onConnect","onDisconnect","inboundConnectionThreshold","metric","inbound","outbound","conns","allStreams","counts","keepAlivePeers","tasks","connectionList","_onConnect","storedConns","isNewPeer","storedConn","ERR_NODE_NOT_STARTED","transient","peerConnections","trackedConnection","closeConnections","acceptIncomingConnection","afterUpgradeInbound","statusMap","errored","complete","MovingAverage","movingAverage","variance","deviation","forecast","timespan","previousTime","alpha","pt","exp","incr","AdaptiveTimeout","timeoutMultiplier","failureMultiplier","minTimeout","getTimeoutSignal","timeoutFactor","sendTimeout","timeoutSignal","failureMovingAverage","failureDeviation","failureForecast","failureVariance","successMovingAverage","successDeviation","successForecast","successVariance","ConnectionMonitor","heartbeatInterval","pingIntervalMs","abortController","pingInterval","pingTimeout","bs","rtt","CompoundContentRouting","routers","findProviders","seen","router","provide","NOT_STARTED_YET","Fingerprint","fp","fingerprintSize","fnv","hashV","getRandomInt","Bucket","fingerprint","findIndex","FNV_PRIMES","FNV_OFFSETS","cachedEncoder","utf8Buffer","fnvPrime","remaining","encodeInto","asUintN","fnv1aEncodeInto","fnv1aUint8Array","fnv1a","numberToBuffer","CuckooFilter","bucketSize","filterSize","buckets","rand","swapped","inJ","inK","reliable","MAX_LOAD","optimize","maxItems","errorRate","calculateBucketSize","log2","ScalableCuckooFilter","scale","filterSeries","cuckoo","curSize","DefaultPeerRouting","ERR_FIND_SELF","NOT_FOUND","getClosestPeers","createScalableCuckooFilter","ordered","ops","sourceErr","slotAvailable","resultAvailable","sourceFinished","opErred","valuesAvailable","op","yieldOrderedValues","ok","yieldUnOrderedValues","task","parallel","useCache","RandomWalk","walking","walkers","shutdownController","walkController","needNext","walk","startWalk","DefaultRegistrar","topologies","_onDisconnect","_onPeerUpdate","_onPeerIdentify","getProtocols","getHandler","ERR_NO_HANDLER_FOR_PROTOCOL","getTopologies","ERR_PROTOCOL_HANDLER_ALREADY_REGISTERED","register","topology","unregister","removed","notifyOnTransient","TrackedMap","registerMetric","updateComponentMetric","deleted","DefaultTransportManager","transports","trackedMap","ERR_INVALID_KEY","ERR_DUPLICATE_TRANSPORT","ERR_TRANSPORT_UNAVAILABLE","getTransports","of","getListeners","listenTransportForMultiaddr","couldNotListen","supportedAddrs","NO_FATAL","removeAll","PROTOCOL_ID","MAX_PROTOCOL_LENGTH","NewLine","negotiateFully","originalSink","originalSource","negotiated","negotiating","doneNegotiating","sentProtocol","sendingProtocol","doneSendingProtocol","readProtocol","readingProtocol","doneReadingProtocol","negotiate","doSendProtocol","doReadProtocol","sentData","protocolString","originalCloseRead","originalCloseWrite","originalClose","optimisticSelect","p1","p2","connectionSymbol","ConnectionImpl","multiplexer","encryption","_close","_abort","_getStreams","getStreams","countStreams","streamCount","DefaultUpgrader","connectionEncryption","muxers","inboundUpgradeTimeout","encrypter","muxer","shouldBlockConnection","connectionType","ERR_CONNECTION_INTERCEPTED","upgradeInbound","ERR_CONNECTION_DENIED","encryptedConn","upgradedConn","muxerFactory","cryptoProtocol","trackMultiaddrConnection","protectedConn","skipProtection","protector","connectionProtector","protect","skipEncryption","_encryptInbound","idStr","remotePeerId","multiplexed","_multiplexInbound","_createConnection","_encryptOutbound","ERR_INVALID_PEER","_multiplexOutbound","muxedStream","incomingLimit","findIncomingStreamLimit","ERR_TOO_MANY_INBOUND_PROTOCOL_STREAMS","trackProtocolStream","_onStream","ERR_MUXER_UNAVAILABLE","outgoingLimit","findOutgoingStreamLimit","ERR_TOO_MANY_OUTBOUND_PROTOCOL_STREAMS","ERR_UNSUPPORTED_PROTOCOL","_timeline","Proxy","Reflect","upgraded","ERR_CONNECTION_NOT_MULTIPLEXED","ERR_ENCRYPTION_FAILED","Libp2pNode","contentRouting","originalDispatch","internalResult","externalResult","defaultComponents","configureComponent","streamMuxers","connectionMonitor","peerRouters","contentRouters","peerDiscovery","createService","capability","checkServiceDependencies","component","peerSet","ERR_INVALID_PROTOCOLS_FOR_STREAM","peerKey","ERR_DISCOVERED_SELF","enrTree","SANDBOX","TEST","DEFAULT_NODE_REQUIREMENTS","groupLen","USE_ENDOMORPHISM","ShaError","assertJacPoint","JacobianPoint","toAffineBatch","scratch","Z1Z1","Z2Z2","S1","S2","x1b","HH","HHH","P0","normalizeScalar","affinePoint","_WINDOW_SIZE","invZ","iz1","iz2","iz3","fromCompressedHex","isShort","bytesToNumber","isValidFieldElement","rt","isYOdd","fromUncompressedHex","normalizePrivateKey","fromSignature","normalizeSignature","truncateHash","rinv","numTo32bStr","toHexX","toRawX","aP","bQ","sliceDER","parseDERInt","parseDERSignature","HALF","sHex","rHex","sHexL","rHexL","sLen","rLen","uint8a","POW_2_256","hexByte","truncateOnly","bits2int_2","_sha256Sync","_hmacSha256Sync","HmacDrbg","hmacSha256","hmacSync","checkSync","reseedSync","generate","generateSync","kmdToSig","kinv","bits2octets","z1","vopts","strict","web","bytesToHex","hexToBytes","concatBytes","_bigintTo32Bytes","_normalizePrivateKey","hashToPrivateKey","sha256","createHash","ckey","createHmac","sha256Sync","hmacSha256Sync","taggedHash","tagP","tagH","taggedHashSync","_JacobianPoint","keccak256","sha3","verifySignature","normalizePublicKey","sinv","ERR_INVALID_ID","locationMultiaddrFromEnrFields","isIpv6","ipVal","protoName","protoVal","ipFamily","ipBytes","protocolBytes","multiaddrFromFields","encodeMultiaddrs","encodeWaku2","RawEnr","kvs","rsv","getStringValue","setStringValue","getNumberAsStringValue","setNumberAsStringValue","tcp6","udp6","raw","multiaddrBytes","decodeMultiaddrs","deleteUndefined","waku2","decodeWaku2","initSigArgs","canonical","recSig","recovered","finalizeSig","TransportProtocol","TransportProtocolPerIpVersion","createPeerIdFromPublicKey","nodeId","uncompressedPubkey","getLocationMultiaddr","setLocationMultiaddr","getAllLocationMultiaddrs","_multiaddrs","getFullMultiaddr","locationMultiaddr","getFullMultiaddrs","_permanentCensorErrors","_censorErrors","LogLevels","warning","_logLevel","_globalLogger","_normalizeError","form","_checkNormalize","LogLevel","ErrorCode","HEX","_log","logLevel","throwArgumentError","levels","INFO","WARNING","makeError","UNKNOWN_ERROR","messageDetails","NUMERIC_FAULT","fault","CALL_EXCEPTION","INSUFFICIENT_FUNDS","MISSING_NEW","NONCE_EXPIRED","REPLACEMENT_UNDERPRICED","TRANSACTION_REPLACED","UNPREDICTABLE_GAS_LIMIT","throwError","INVALID_ARGUMENT","argument","assert","assertArgument","checkNormalize","UNSUPPORTED_OPERATION","checkSafeUint53","checkArgumentCount","expectedCount","MISSING_ARGUMENT","UNEXPECTED_ARGUMENT","checkNew","checkAbstract","globalLogger","setCensorship","censorship","permanent","setLogLevel","isHexable","addSlice","arrayify","allowMissingPrefix","toHexString","isHexString","hexPad","HexCharacters","hexlify","arrayifyInteger","unarrayifyInteger","_encode","_decodeChildren","childOffset","_decode","BUFFER_OVERRUN","EnrDecoder","encoded","RECORD_PREFIX","fromRLP","checkValues","_seq","decodeSeq","rlpEncodedBytes","checkSignature","fromValues","v4Regex","v6Regex","isFormat","buff","hexN","decN","prevColon","useDec","sizeOf","toType","rcode","opcode","klass","toClass","toCode","SURROGATE_A","SURROGATE_B","nextCode","numA","isU8Arr","bytelength","P_24","P_16","P_8","readUInt32BE","readUInt16BE","writeUInt32BE","writeUInt16BE","targetStart","sourceStart","sourceEnd","nb","sourceLen","_copyActual","consumedBytes","jumped","jumpOffset","flags","authorities","additionals","flag_qr","flag_aa","flag_z","runknown","dLen","rns","dd","rsoa","mname","rname","serial","refresh","retry","expire","minimum","rtxt","rnull","rhinfo","cpu","os","rptr","rsrv","weight","rcaa","issuerCritical","ISSUER_CRITICAL","rmx","preference","exchange","ra","raaaa","roption","spl","sourcePrefixLength","fam","ipBuf","ipLen","scopePrefixLength","tagsLen","padded","ropt","rdlen","encodingLengthList","encodeList","rdnskey","keydata","PROTOCOL_DNSSEC","ZONE_KEY","SECURE_ENTRYPOINT","rrrsig","typeCovered","labels","originalTTL","expiration","inception","keyTag","signersName","rrp","mbox","txt","typebitmap","typelist","typesByWindow","typeid","windowBuf","windowLength","extents","rnsec","nextDomain","rrtypes","rnsec3","hashLength","rds","digestdata","digestType","renc","udpPayloadSize","extendedRcode","ednsVersion","class","flush","flag_do","RECURSION_DESIRED","packet","allocing","decodeList","sanitizeSingle","sanitized","make","charset","paddingMode","byCharCode","byNum","padCode","safeLen","safeEnd","base64URL","require","HTTPStatusError","endpoint","ResponseError","cause","reduceError","baseParts","httpFlags","updFlags","parseFlags","regex","InvalidProtocolError","supportedProtocols","BaseEndpoint","isHTTP","pk","UDPEndpoint","ipv6","UDP4Endpoint","UDP6Endpoint","safeHost","HTTPEndpoint","v6Parts","toEndpoint","post","parseEndpoint","contentType","requestRaw","abortSignal","setRequestHeader","ontimeout","onerror","onload","onabort","cors","endpoints","resolverByName","byName","endpointByName","backup","description","country","lat","UPDATE_URL","isNameString","wellknown","updateURL","persist","localStoragePrefix","maxAge","_dataP","_data","outdated","cacheKey","maxTime","filterDoh","filterDns","queryN","singleQuery","toMultiQuery","queryDoh","queryOne","DnsOverHttps","_endpoints","resolveTXT","sd","ENRTree","parseAndVerifyRoot","ROOT_PREFIX","rootValues","parseRootValues","decodedPublicKey","signedComponent","signedComponentBuffer","eRoot","lRoot","parseTree","tree","TREE_PREFIX","parseBranch","branch","BRANCH_PREFIX","isSatisfied","wanted","addCapabilities","total","helpsSatisfyCapabilities","missingCapabilities","DnsNodeDiscovery","_DNSTreeCache","_errorTolerance","dnsOverHttp","dnsClient","enrTreeUrls","wantedNodeCapabilityCount","networkIndex","visits","errorTolerance","getNode","maxSearches","totalSearches","fetchNodesUntilCapabilitiesFulfilled","_search","getNextPeer","peerNodeIds","yieldNodesUntilCapabilitiesFulfilled","subdomain","_getTXTRecord","branches","entryType","getEntryType","circularRefs","selectRandomPath","PeerDiscoveryDns","nextPeer","_components","enrUrls","peerEnr","tagsToUpdate","isPeerChanged","wakuDnsDiscovery","PeerExchangeCodec","WakuPeerExchange","rpcQuery","ENR","DEFAULT_PEER_EXCHANGE_QUERY_INTERVAL_MS","DEFAULT_MAX_RETRIES","DEFAULT_PEER_EXCHANGE_TAG_NAME","PeerExchangeDiscovery","peerExchange","queryingPeers","queryAttempts","handleDiscoveredPeer","startRecurringQueries","queryInterval","maxRetries","currentAttempt","abortQueriesForPeer","_peerInfo","hasMultiaddrDiff","hasShardDiff","checkPeerInfoDiff","existingMultiaddrs","newMultiaddrs","existingShardInfoBytes","existingShardInfo","wakuPeerExchangeDiscovery","DEFAULT_LOCAL_TAG_NAME","LocalPeerCacheDiscovery","getPeersFromLocalStorage","handleNewPeers","savePeersToLocalStorage","websocketMultiaddr","wsMultiaddr","getWsMultiaddrFromMultiaddrs","localStoragePeers","existingPeerIndex","_peer","storedPeersData","isValidStoredPeer","defaultLibp2p","hideWebSocketInfo","resultingOptions","LIBP2P_FORCE_PNET","ERR_PROTECTOR_REQUIRED","validateConfig","createLibp2pNode","createLibp2p","filterMultiaddrs","pingMaxInboundStreams","createLightNode","networkConfig","isAutoSharding","derivePubsubTopicsFromNetworkConfig","libp2pOptions","defaultBootstrap","defaultPeerDiscoveries","createLibp2pAndUpdateOptions","TelemetryType","__awaiter","thisArg","_arguments","generator","fulfilled","rejected","__generator","sent","trys","verb","TelemetryClient","intervalPeriod","intervalId","_this","telemetryRequests","e_1","telemetryType","messageType","telemetryData","hashNumber","DEFAULT_CONTENT_TOPIC","ProtoSequencedMessage","sequenceCompletedEvent","messageSentEvent","messageReceivedEvent","app","telemetryClient","startLightPushSequence","startFilterSubscription","numMessages_1","args_1","_i","pack","ar","__spreadArray","numMessages","period","sequenceHash","sequenceTotal","sequenceIndex","sendMessage","messageElement","messagesSent","error_1","sender","LIGHT_PUSH_FILTER","peerIdSender","peerIdReporter","createElement","getElementById","textContent","insertBefore","firstChild","LIGHT_PUSH_ERROR","peerIdRemote","messagesReceived","sequencedMessage","appendChild","startSequence","messagePeriod","sentMessagesCount","sentMessagesCounter","receivedMessagesCount","receivedMessagesCounter","display"],"sourceRoot":""} \ No newline at end of file diff --git a/flush-notes/404.html b/flush-notes/404.html index 01f71ab..5936503 100644 --- a/flush-notes/404.html +++ b/flush-notes/404.html @@ -1 +1 @@ -Share notes

Loading...

\ No newline at end of file +Share notes

Loading...

\ No newline at end of file diff --git a/flush-notes/_next/static/L_HMaTM59jyWvxVpm_fuL/_buildManifest.js b/flush-notes/_next/static/tZpcVhCMEAEgOPvJiTrkR/_buildManifest.js similarity index 100% rename from flush-notes/_next/static/L_HMaTM59jyWvxVpm_fuL/_buildManifest.js rename to flush-notes/_next/static/tZpcVhCMEAEgOPvJiTrkR/_buildManifest.js diff --git a/flush-notes/_next/static/L_HMaTM59jyWvxVpm_fuL/_ssgManifest.js b/flush-notes/_next/static/tZpcVhCMEAEgOPvJiTrkR/_ssgManifest.js similarity index 100% rename from flush-notes/_next/static/L_HMaTM59jyWvxVpm_fuL/_ssgManifest.js rename to flush-notes/_next/static/tZpcVhCMEAEgOPvJiTrkR/_ssgManifest.js diff --git a/flush-notes/index.html b/flush-notes/index.html index ea45fc7..c5ad357 100644 --- a/flush-notes/index.html +++ b/flush-notes/index.html @@ -1 +1 @@ -Share notes

Loading...

\ No newline at end of file +Share notes

Loading...

\ No newline at end of file diff --git a/flush-notes/index.txt b/flush-notes/index.txt index ccbcfd6..3bc2fc1 100644 --- a/flush-notes/index.txt +++ b/flush-notes/index.txt @@ -1,6 +1,6 @@ 1:HL["/_next/static/media/a34f9d1faa5f3315-s.p.woff2","font",{"crossOrigin":"","type":"font/woff2"}] 2:HL["/_next/static/css/9efc354ebd501924.css","style",{"crossOrigin":""}] -0:["L_HMaTM59jyWvxVpm_fuL",[[["",{"children":["__PAGE__",{}]},"$undefined","$undefined",true],"$L3",[[["$","link","0",{"rel":"stylesheet","href":"/_next/static/css/9efc354ebd501924.css","precedence":"next","crossOrigin":""}]],"$L4"]]]] +0:["tZpcVhCMEAEgOPvJiTrkR",[[["",{"children":["__PAGE__",{}]},"$undefined","$undefined",true],"$L3",[[["$","link","0",{"rel":"stylesheet","href":"/_next/static/css/9efc354ebd501924.css","precedence":"next","crossOrigin":""}]],"$L4"]]]] 5:I[5685,["948","static/chunks/948-50bbf5866eb892b4.js","185","static/chunks/app/layout-81c8309cfee59371.js"],""] 6:I[6954,[],""] 7:I[7264,[],""] diff --git a/flush-notes/view.html b/flush-notes/view.html index 266d119..c81c2f9 100644 --- a/flush-notes/view.html +++ b/flush-notes/view.html @@ -1 +1 @@ -Share notes

Loading...

\ No newline at end of file +Share notes

Loading...

\ No newline at end of file diff --git a/flush-notes/view.txt b/flush-notes/view.txt index f1d4cca..4d1ab4c 100644 --- a/flush-notes/view.txt +++ b/flush-notes/view.txt @@ -1,6 +1,6 @@ 1:HL["/_next/static/media/a34f9d1faa5f3315-s.p.woff2","font",{"crossOrigin":"","type":"font/woff2"}] 2:HL["/_next/static/css/9efc354ebd501924.css","style",{"crossOrigin":""}] -0:["L_HMaTM59jyWvxVpm_fuL",[[["",{"children":["view",{"children":["__PAGE__",{}]}]},"$undefined","$undefined",true],"$L3",[[["$","link","0",{"rel":"stylesheet","href":"/_next/static/css/9efc354ebd501924.css","precedence":"next","crossOrigin":""}]],"$L4"]]]] +0:["tZpcVhCMEAEgOPvJiTrkR",[[["",{"children":["view",{"children":["__PAGE__",{}]}]},"$undefined","$undefined",true],"$L3",[[["$","link","0",{"rel":"stylesheet","href":"/_next/static/css/9efc354ebd501924.css","precedence":"next","crossOrigin":""}]],"$L4"]]]] 5:I[5685,["948","static/chunks/948-50bbf5866eb892b4.js","185","static/chunks/app/layout-81c8309cfee59371.js"],""] 6:I[6954,[],""] 7:I[7264,[],""]